→ SORTING:
Selection sort: Selection sort in 3 minutes Selection Sort Algorithm - Tutorial
Insertion sort: Insertion sort in 2 minutes Insertion Sort Algorithm - Tutorial
Bubble sort: Bubble sort in 2 minutes Bubble Sort Algorithm - Tutorial
Merge sort: Merge sort in 3 minutes Merge Sort Algorithm - Tutorial
Quick sort: Quick sort in 4 minutes Quick Sort Algorithm - Tutorial
→ ARRAY:
Maximum subarray sum: Kadane's Algorithm : Maximum Subarray Sum in an Array - Tutorial
Next permutation: next_permutation : find next lexicographically greater permutation -
Tutorial
Set matrix zero: Set Matrix Zero - Tutorial
Rearrange Array Elements by Sign - Tutorial
—> BS:
Search Element in a Rotated Sorted Array - Tutorial
Search Element in Rotated Sorted Array II - Tutorial
Peak element in Array - Tutorial
Minimum in Rotated Sorted Array - Tutorial
Find out how many times the array has been rotated - Tutorial
→ BS ON ANSWER
Koko Eating Bananas - Tutorial
Aggressive Cows : Detailed Solution - Tutorial
Capacity to Ship Packages within D Days - Tutorial
Search in a row and column-wise sorted matrix - Tutorial
→ RECURSION:
Combination Sum - 1 - Tutorial
Combination Sum II - Find all unique combinations - Tutorial
Subset Sum : Sum of all Subsets - Tutorial
II | Print all the Unique Subsets - Tutorial
→STACK:
Next Greater Element Using Stack - Tutorial
L6. Next Greater Element - II | Stack and Queue Playlist
Trapping Rainwater - Tutorial
Next Smaller Element - takeUforward
Next Greater Element - takeUforward
→SLIDING WINDOW:
L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist
L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist
L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist
L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist
L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Win…
HEAP:
Kth Largest Element in an Array - LeetCode
Replace elements by its rank in the array - Tutorial
GREEDY:
Assign Cookies - Tutorial
Job Sequencing Problem - Tutorial
N meetings in one room - Tutorial
Minimum number of platforms required for a railway - Tutorial
Merge Overlapping Sub-intervals - Tutorial
L8. Non Overlapping Intervals | Greedy Algorithms Playlist
L9. Insert Intervals | Greedy Algorithms Playlist
BINARY TREE:
Top view of a Binary Tree - Tutorial
Level Order Traversal of a Binary Tree - Tutorial
Maximum depth of a Binary Tree - Tutorial
Calculate the Diameter of a Binary Tree - Tutorial
Check if two trees are identical - Tutorial
GRAPHS:
Rotten Oranges : Min time to rot all oranges : BFS - Tutorial
Flood Fill Algorithm - Graphs - Tutorial
Distance of Nearest Cell having 1 - Tutorial
Surrounded Regions | Replace O’s with X’s - Tutorial
Number of Islands - Tutorial
Detect Cycle in an Undirected Graph (using DFS) - Tutorial
Dijkstra’s Algorithm - Using Set : G-33 - Tutorial
G-37: Path With Minimum Effort - Tutorial
DP: If doing DP first do 1D dp and then DP on subsequence and then dp on stocks
Dynamic Programming : Climbing Stairs - Tutorial
Dynamic Programming: House Robber (DP 6) - Tutorial
Grid Unique Paths : DP on Grids (DP8) - Tutorial
Grid Unique Paths 2 (DP 9) - Tutorial
Minimum Path Sum In a Grid (DP 10) - Tutorial
Subset sum equal to target (DP- 14) - Tutorial
Count Subsets with Sum K (DP - 17) - Tutorial
Longest Common Subsequence | (DP - 25) - Tutorial
Longest Increasing Subsequence | (DP-41) - Tutorial
