Binary Tree Min Depth
Prereq: BFS on Tree
Given a binary tree, find the depth of the shallowest leaf node.
Overview
Basic Data Structures
Sorted Array
Implicitly Sorted Array
Advanced
Speedrun
DFS on Tree
Binary Search Tree
Advanced
Combinatorial Search
Additional States
Aggregation and Memoization
Additional Practices
Speedrun
Vanilla BFS
Matrix as Graph
Implicit Graph
Directed Graph / Topological Sort
Weighted Graph
Minimum Spanning Tree
Introduction
Same Direction
Opposite Direction
Sliding Window
Prefix Sum
Cycle Finding
Speedrun
Introduction
Coin Change
Dynamic number of subproblems
Two Sequences
0-1 Knapsack
Disjoint Set Union | Union Find
Data Structure Design
Segment Tree
Monotonic Stack
Line Sweep
Tree Traversal without Recursion
Greedy
Amazon OA
- Amazon Online Assessment Questions 2021 (OA)
- Robot in Circle
- Number Game
- Find All Combination of Numbers that Sum to a Target
- Fill The Truck
- Slowest Key
- Five Star Sellers
- Number of Ways to Split Into Primes
- Storage Optimization
- Music Pair
- Minimum Difficulty of a Job Schedule
- Autoscale Policy, Utilization Check
- Optimal Utilization
- Merge Two Sorted Lists
- Two Sum - Unique Pairs
- Shopping Patterns
- Amazon Prime Air Delivery Route
- Reorder Data in Log Files
- Top K Frequently Mentioned Keywords
Microsoft OA
- Microsoft Online Assessment Questions
- Max Network Rank
- Minimum Adj Swaps to Make Palindrome
- Lexicographically Smallest String
- Longest Substring Without 3 Contiguous Occurrences of Letter
- Min Moves to Obtain String Without 3 Identical Consecutive Letters
- String Without 3 Identical Consecutive Letters
- Longest Semi-Alternating Substring
- Min Steps to Make Piles Equal Height
- Day of week that is K days later
- Max Inserts to Obtain String Without 3 Consecutive 'a'
- Concatenated String Length with unique Characters
- Largest K such that both K and -K exist in array
- Min Adj Swaps to Group Red Balls
- Maximum Length of a Concatenated String with Unique Characters
- Unique Integers That Sum Up To 0
- Min Deletions To Obtain String in Right Format
- Particle Velocity
- Widest Path Without Trees
- Jump Game
- Fair Indexes
- Partition array into N subsets with balanced sum
Google OA
- Google Online Assessment Questions 2021 (OA)
- Compare Strings
- Largest Subarray
- Maximum Area Serving Cake
- Minimum Number of Decreasing Subsequence Partitions
- Pick Up Coupons
- Rose Garden
- Smallest Integer Satisfying the Rule
- Fill 2D Array
- Water Plants
- Split Strings
- Google Online Assessment 2021 (OA) - Rings on Rods
- Google Online Assessment 2021 (OA) - Longest Palindrome