LeetCode
Question
·
Jun 2021
Uber | OA - CodeSignal | count of strictly increasing sequences
4 upvotes
1,455 views
4 replies
Question Details
Given two list of integers \'a\' and \'b\' of same length \'n\'. Find the count of strictly increasing sequences of integers l[0] < l[1] < .... l[n-1] so that min(a[i],...
Full Details
🔒
Unlock all Uber questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a uber interview for a swe role during the oa round reported in 2021.
It covers the following topics: General Experience .