Data Structures
Search Insert Position
Search Insert Position (LeetCode 35): use lower-bound binary search to find where a target is or should be inserted, in O(log n).
Data Structures
Arrays, Strings, Sliding Window, Two Pointers, Searching & Binary Search, Sorting, Linked List, Stack & Queue, Recursion & Backtracking, Trees, Heap / Priority Queue, Graphs, Dynamic Programming, Greedy, Bit Manipulation, Trie, Math & Number Theory, Design (LLD / OOP), SQL, System Design (HLD)
180 notes in 20 topics
Topics in Data Structures
Arrays 30
Strings 35
Sliding Window 35
Two Pointers 30
Searching & Binary Search 30
Sorting 25
Linked List 0
Stack & Queue 0
Recursion & Backtracking 0
Trees 0
Heap / Priority Queue 0
Graphs 0
Dynamic Programming 0
Greedy 0
Bit Manipulation 0
Trie 0
Math & Number Theory 0
Design (LLD / OOP) 0
SQL 0
System Design (HLD) 0
Notes
Data Structures
First and Last Position of Element in Sorted Array
Find First and Last Position of a target in a sorted array (LeetCode 34) using two binary searches (lower and upper bound) in O(log n).
Data Structures
Search in Rotated Sorted Array
Search in Rotated Sorted Array (LeetCode 33): modified binary search that identifies the sorted half each step, in O(log n).
Data Structures
Search in Rotated Sorted Array II (With Duplicates)
Search in Rotated Sorted Array II (LeetCode 81) with duplicates: binary search that shrinks ambiguous ends, O(log n) average and O(n) worst case.
Data Structures
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array (LeetCode 153): binary search comparing mid with the right end, in O(log n).
Data Structures
Find Peak Element
Find Peak Element (LeetCode 162): binary search on the slope to find any element greater than its neighbours in O(log n).
Data Structures
Sqrt(x) Using Binary Search
Compute integer Sqrt(x) (LeetCode 69) with binary search on the answer in O(log x), rounding down, in Python, Java and C++.
Data Structures
Koko Eating Bananas
Koko Eating Bananas (LeetCode 875): binary search on the eating speed, checking feasibility in O(n log maxPile).
Data Structures
Capacity To Ship Packages Within D Days
Capacity To Ship Packages Within D Days (LeetCode 1011): binary search the ship capacity with a greedy feasibility check, O(n log sum).
Data Structures
Split Array Largest Sum
Split Array Largest Sum (LeetCode 410): binary search the largest subarray sum with a greedy split check, O(n log sum).
Data Structures
Median of Two Sorted Arrays
Median of Two Sorted Arrays (LeetCode 4): binary search a partition of the smaller array for O(log(min(m,n))) time.
Data Structures
Search a 2D Matrix
Search a 2D Matrix (LeetCode 74): treat the row-sorted matrix as one sorted list and binary search in O(log(m*n)).