Uber Interview Questions - Data Structures & Algorithms

Explore the maximum sum subarray problem and Kadane's algorithm, learning to find the contiguous subarray with the largest sum using an efficient Java solution.

Explore the maximum sum subarray problem with a clear, efficient Kadane's algorithm approach in JavaScript, revealing how to compute contiguous subarray sums in linear time with constant space.

Learn Kadane's algorithm to find the maximum sum contiguous subarray in linear time, using two variables (max_so_far and current_sum) and a single pass in C++.

Explore the maximum sum subarray problem and learn a simple Kadane's algorithm solution in Python that computes the largest contiguous subarray sum in O(n) time and O(1) space.

Master the product of array except self problem with a Java solution. Compute left and right products in O(n) time without division to build the output array.

Master the product of array except self problem with a linear-time, no-division JavaScript solution using left and right prefix products to compute each output element.

Explore product of array except self problem by computing output where each element equals the product of all others, using left and right arrays in O(n) without division, in c++.

Learn to implement the product of array except self problem in python by building left and right product arrays and multiplying them to get the result in O(n) without division.

Explore the trapping rain water problem with a two-pointer method and left-right max arrays to compute water above each bar on an elevation map, in Java.

Explore the two-pointer solution to the trapping rain water problem, computing water trapped above each bar using left and right maxima on an elevation map, implemented in JavaScript.

Demonstrates a two-pointer solution to the trapping rainwater problem on an elevation map by computing water trapped above each bar using left and right maxima and a C++ implementation.

Learn to solve the trapping rain water problem with a two-pointer approach on an elevation map, using left and right maxima to compute trapped water per bar in Python.

Master the search insert position problem with binary search on a sorted array of distinct integers to determine the target’s index or its insertion point, achieving O(log n) time.

Learn to solve the search insert position problem for a target value using binary search in a sorted array of distinct integers, with O(log n) time in JavaScript.

Apply a binary search variation to locate the first index with nums[i] >= target in a sorted array of distinct integers, returning the insertion position in O(log n) via C++.

Master the search insert position problem in python using binary search to return the target index or insertion point in a sorted array of distinct integers, with O(log n) time.

Explore a Java solution to the longest substring without repeating characters using a two-pointer sliding window and a hash map to track character counts, expanding and shrinking for optimal length.

Use a two-pointer window and a hash table in JavaScript to find the length of the longest substring without repeating characters, expanding on unique characters and shrinking on duplicates.

Learn to solve the longest substring without repeating characters using a two pointer method and hash table, and study its c++ solution.

Explore the longest substring without repeating characters using a two-pointer technique and a hash table; implement a Python solution that expands and shrinks the window to track the maximum length.

Add two numbers represented by reverse-order linked lists in Java. Build the result by node-by-node addition with carry, using a dummy head.

Implement a JavaScript solution to add two numbers represented by reversed linked lists, handle carry, create a result list with a dummy head, and manage remaining carry.

Add two numbers from reverse-ordered linked lists by performing digit-by-digit addition in C++, building the result list with a dummy head and managing carry through to completion.

Learn to add two numbers represented by reverse-order linked lists, managing carry and building a new result list, with a Python solution using pointers and a dummy head.

Learn to reverse a linked list in Java using recursion, via a helper function that reverses from the current node and updates the new head, with O(n) time and space.

Reverse a linked list using a recursive JavaScript approach, returning the last node as the new head and reversing links from head to tail.

Master recursive reversal of a linked list from the head using a function like f(current), and learn why the time and space complexity are O(n).

Learn a recursive solution to reverse a linked list in Python from the head, including the base case and the O(n) time and O(n) space complexity.

Sort the intervals by starting times (and by ending times when equal), then merge overlapping intervals to produce a non-overlapping list of intervals in Java.

Sort the given intervals by start times (then by end times) and merge overlapping intervals to produce a final array of non-overlapping intervals in JavaScript.

Sort intervals by start times (tie by end times), then merge overlapping intervals to produce non-overlapping results in C++.

Merge intervals in python by sorting intervals by start times and end times, merging overlapping ones to produce non-overlapping results, with a clear O(n log n) approach.

Apply binary search to the duplicate number problem on 1..n with n+1 elements. Count elements less than or equal to mid to locate the repeated value without modifying the array.

Learn to solve the find the duplicate number problem in JavaScript with binary search, counting numbers less than or equal to mid, without modifying the array.

Discover how to find the duplicate number in an array of n+1 elements from 1 to n without modifying the array, using binary search based on counts up to mid.

Learn to solve the duplicate number problem without modifying the array and with constant space by using binary search on 1..n and counting elements ≤ mid in Python.