Amazon Interview Prep: Data Structures & Algorithms

Solve the jump game by tracking the maximum reachable index while scanning the nums array from index 0. Return true if maximum reachable reaches the last index; otherwise return false.

Master the longest increasing subsequence problem with a bottom-up dynamic programming approach, defining subsequences, computing dp values ending at each index, and achieving O(n^2) time complexity.

Color the starting pixel and flood fill all connected pixels in four directions: top, bottom, left, and right, using DFS (or BFS), with Java, Python, JavaScript, and C++ implementations.

Use Dijkstra's algorithm to compute the minimum time for a signal to reach all nodes in a weighted directed graph built from travel times, returning the farthest distance or -1.

Learn to sort an array of zeros, ones, and twos in place using a two-pointer approach that moves zeros left and twos right, leaving ones in the middle.

explore binary search to maximize the minimum distance between balls placed in sorted basket positions, using a greedy feasibility check to decide distance.

Explore an efficient Sudoku validator that uses row, column, and 3x3 grid sets to ensure no repeated digits, even on partially filled boards.

learn how to solve the sliding window maximum problem by maintaining a deque of candidate indices to track the maximum in each window of size k, achieving linear time.

Learn to merge intervals in javascript by sorting by start times, merging overlapping intervals into non-overlapping ranges, and building the final answer with min start and max end.

Sort intervals by start times, tie-break with end times, then merge overlapping intervals into non-overlapping ranges; the C++ solution runs in O(n log n) time.

Master the two sum problem with a hash table that stores seen numbers and their indices to find the complement for the target, returning two distinct indices without reusing elements.

Learn the two sum problem solved with a hash table in c++, returning the indices of two numbers that add to the target using a complement lookup.

Master finding the lowest common ancestor in a binary search tree by traversing from the root, guiding left when both targets are smaller, right when larger, and returning the ancestor.

Rotate a given n x n matrix by 90 degrees in place using a two-step approach: transpose the matrix, then reverse each row, implemented in Java without extra space.