References: Problems List

Table of Contents

LeetCode Problems covered by Omkar

Arrays

Sliding Windows

No Problem Video TimeStamp Tags Code
1 Missing Number - Easy - 268 Array Floater 1 01:46:40 hrs arrays, cycle_sort Source
2 Find All Numbers disappeared in an array - Easy - 448 Array Floater 1 03:16:34 hrs arrays, cycle_sort Source
3 Find the Duplicate Number - Medium - 287 Array Floater 1 03:42:01 hrs arrays, cycle_sort Source
4 Find All duplicates in an array - Medium - 442 Array Floater 1 04:26:00 hrs arrays, cycle_sort
5 Find Missing Positive - Hard - 41 Array Floater 1 04:45:35 hrs arrays, cycle_sort
6 Couples Holding Hands - Hard - 765 Array Floater 1 05:40:26 hrs arrays, cycle_sort
7 Pancake Sorting - Medium - 969 Array Floater 2 00:51:45 hrs arrays, decrease_and_conquer, sorting
8 Wiggle Sort - Medium - 280 Array Floater 2 02:07:01 hrs arrays, decrease_and_conquer, sorting
9 Search a 2D Matrix II - Medium - 240 Array Floater 2 03:14:05 hrs arrays, decrease_and_conquer, searching
10 Find the Celebrity - Medium - 277 Array Floater 2 04:17:25 hrs arrays, decrease_and_conquer, searching
11 Maximum Subarray - Medium - 53 Array Floater 2 05:08:00 hrs arrays, optimization
12 Best Time to Buy and Sell Stock - Easy - 121 Array Floater 2 06:16:15 hrs arrays, optimization
13 Maximal Square - Medium - 221 Array Floater 2 06:51:25 hrs arrays, optimization
14 Running Sum of 1D Array - Easy - 1480 Array Floater 3 00:10:40 hrs arrays, prefix_sum
15 Range Sum Query - Immutable - Easy - 303 Array Floater 3 00:15:50 hrs arrays, prefix_sum
16 Range Sum Query 2D - Immutable - Medium - 304 Array Floater 3 00:41:10 hrs arrays, prefix_sum
17 Subarray Sums divisible by K - Medium - 974 Array Floater 3 03:58:220 hrs arrays, prefix_sum
18 Subarray Sum Equals K - Medium - 560 Array Floater 3 01:52:30 hrs arrays, prefix_sum
19 Maximum Size Subarray Sum Equals K - Medium - 325 Array Floater 3 04:39:55 hrs arrays, prefix_sum
20 Number of Subarrays with Odd Sum - Medium - 1524 Array Floater 3 05:18:00 hrs arrays, prefix_sum
21 Contiguous Array - Medium - 525 Array Floater 3 05:59:15 hrs arrays, prefix_sum
22 Continuous Subarray Sum - Medium - 523 Array Floater 3 06:41:40 hrs arrays, prefix_sum
23 Moving Average from data stream - 346 - Easy Array Floater 4 Sliding Windows I 00:14:10 hrs arrays, sliding_windows, fixed_length
24 Maximum Average Subarray I - 643 - Easy Array Floater 4 Sliding Windows I 00:44:00 hrs arrays, sliding_windows, fixed_length
25 Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold - 1343 - Medium Array Floater 4 Sliding Windows I 01:06:39 hrs arrays, sliding_windows, fixed_length
26 Diet Plan Performance - 1176 - Easy Array Floater 4 Sliding Windows I 01:28:14 hrs arrays, sliding_windows, fixed_length
27 Grumpy Bookstore Owner - 1052 - Medium Array Floater 4 Sliding Windows I 01:41:20 hrs arrays, sliding_windows, fixed_length
28 Maximum number of vowels in a substring of given length - 1456 - Medium Array Floater 4 Sliding Windows I 02:23:30 hrs arrays, sliding_windows, fixed_length
29 Find K length substrings with no repeated characters - 1100 - Medium Array Floater 4 Sliding Windows I 02:42:30 hrs arrays, sliding_windows, fixed_length
30 Sliding windows maximum - 239 - Hard Array Floater 4 Sliding Windows I 03:06:20 hrs arrays, sliding_windows, fixed_length
31 Permutation in String - 567 Array Floater 5 Sliding Windows II 00:00 hrs arrays, sliding_windows, fixed_length
32 Find all anagrams in string - 438 Array Floater 5 Sliding Windows II 29:00 hrs arrays, sliding_windows
33 Sliding window median - 480 Array Floater 5 Sliding Windows II 48:55 hrs arrays, sliding_windows
34 Minimum Size Subarray Sum - 209 Array Floater 5 Sliding Windows II 1:40:32 hrs arrays, sliding_windows
35 Subarray Product Less than K - 713 Array Floater 5 Sliding Windows II 2:41:10 hrs arrays, sliding_windows
36 Minimum Operations to reduce x to zero - 1658 Array Floater 5 Sliding Windows II 2:59:52 hrs arrays, sliding_windows
37 Max Consequtive Ones III - 1004 Array Floater 5 Sliding Windows II 3:39:30 hrs arrays, sliding_windows
38 Fruit into Baskets - 904 Array Floater 6 Sliding Windows III 00:00 hrs arrays, sliding_windows
39 Longest Substring with atmost 2 distinct characters - 159 Array Floater 6 Sliding Windows III 34:10 hrs arrays, sliding_windows
40 Longest Substring with at most K distinct characters - 340 Array Floater 6 Sliding Windows III 49:40 hrs arrays, sliding_windows
41 Longest substring with no repeating characters - 3 Array Floater 6 Sliding Windows III 57:15 hrs arrays, sliding_windows
42 Maximum Erasure values - 1695 Array Floater 6 Sliding Windows III 1:24:16 hrs arrays, sliding_windows
43 Longest Continuous subarray with absolute diff <= limit - 1438 Array Floater 6 Sliding Windows III 1:44:10 hrs arrays, sliding_windows
44 Maximum points you can obtain from cards - 1423 Array Floater 6 Sliding Windows III 2:30:40 hrs arrays, sliding_windows
45 Subarrays with K different integers - 992 Array Floater 6 Sliding Windows III 2:51:27 hrs arrays, sliding_windows
46 Minimum window substring - 76 Array Floater 6 Sliding Windows III 3:32:20 hrs arrays, sliding_windows
47 Best Time to Sell Stock - Easy - 121 Array Floater 7 00:02:50 hrs arrays, decrease_and_conquer
48 Best Time to Buy and Sell Stock II - Medium - 122 Array Floater 7 01:19;26 hrs arrays, decrease_and_conquer
49 Best Time to Buy and SEll STock with Cooldown - Medium - 309 Array Floater 7 02:09:10 hrs arrays, decrease_and_conquer
50 Best Time to Buy and SEll Stock with Transaction fee - Medium - 714 Array Floater 7 02:42:20 hrs arrays, decrease_and_conquer
51 Best Time to Buy and Sell Stock III - Hard - 123 Array Floater 8 00:24:50 hrs arrays
52 Best Time to Buy and Sell Stock IV - Hard - 188 Array Floater 8 01:44:30 hrs arrays
53 Two Sum II - Input array is sorted - Medium - 167 Array Floater 9 00:18:33 hrs arrays, two_pointer
54 Container with Most Water - Medium - 11 Array Floater 9 00:52:33 hrs arrays, two_pointer
55 Trapping Rain Water - Hard - 42 Array Floater 9 01:47:25 hrs arrays, two_pointer
56 Best Sight Seeing Pair - Medium - 1014 Array Floater 9 03:46:20 hrs arrays, two_pointer
57 Check if a Number is majority element in a sorted array - Easy - 1150 Array Floater 10 00:02:20 hrs arrays, two_pointer Source
58 Majority Element - Easy - 169 Array Floater 10 00:08:30 hrs arrays, two_pointer
59 Majority Element II - Medium - 229 Array Floater 10 01:13:31 hrs arrays, two_pointer
60 Sort an Array Sorting Part 1 and Part 2 - Omkar 00:29:05 hrs sorting, arrays
61 Two Sum Sorting Part 1 and Part 2 - Omkar 1:17:30 hrs arrays
62 Merge Sorted Array - Easy - 88 Sorting Part 1 and Part 2 - Omkar 04:16:40 hrs two_pointer, arrays
63 Kth Largest Element in an Array - Medium - 215 Sorting Part 1 and Part 2 - Omkar 04:35:15 hrs quickselect, arrays
64 Kth Largest Element in an Array - Medium - 215 (iterative approach) Sorting Problems Floater Part 2
65 Intersection of two arrays - Easy - 349 Sorting with Omkar_part 2
66 Sort Colors - Medium - 75 Sorting with Omkar_part 2
67 K Closest Points to Origin - Medium - 973 Sorting Problems Floater Part 2
68 Top K Frequent Elements - Medium - 347 Sorting Problems Floater Part 2
69 Top K Frequent Words - Medium - 692 Sorting Problems Floater Part 2
70 3Sum - 15 - Medium Sorting Part 3 3:18:30 hrs presorting, sorting
71 4Sum - Medium - 18 Two Sum Extensions with Omkar July 22, 2022 sorting
72 Two Sum Less than K - Easy - 1099 Omkars Sorting - Two Sum Extension Floater 2 July 29, 2022 sorting
73 3Sum - Closest - Medium - 16 Omkars Sorting - Two Sum Extension Floater 2 July 29, 2022 sorting
74 3Sum Smaller - Medium - 259 Omkars Sorting - Two Sum Extension Floater 2 July 29, 2022 sorting
75 3Sum with Multiplicity - Medium - 923 Omkars Sorting - Two Sum Extension Floater 2 July 29, 2022 sorting
No Problem Video TimeStamp Tags Code
1 Binary Search - 704 Binary Search Variant 1 08:22 hrs binary_search
2 Guess Number higher or lower - 374 Binary Search Variant 1 33:15 hrs binary_search
3 First Bad version - 278 Binary Search Variant 1 52:47 hrs binary_search
4 Search Insert Version - 35 Binary Search Variant 1 1:28:25 hrs binary_search
5 Find smallest Letter Greater than target - 744 Binary Search Variant 1 1:42:21 hrs binary_search
6 Seach in a sorted array of unknown size - 702 - Medium Binary Search Variant 1 3:33:43 hrs binary_search Source
7 Valid Mountain Array - 941 - Easy Binary Search Variant 2 Slides 7-9 0:14:38 hrs two_pointer, arrays, mountain_array Source
8 Peak Index in a Mountain Array - 852 - Easy Binary Search Variant 2 Slides 10-12 0:42:00 hrs binary_search, arrays, mountain_array Source
9 Find in Mountain Array - 1095 - Hard Binary Search Variant 2 Slides 13-15 1:00:10 hrs binary_search, arrays, mountain_array
10 Sqrt(x) - Easy - 69 Binary Search Variant 3 00:09:21 hrs binary_search, arrays
11 Valid Perfect Square - Easy - 367 Binary Search Variant 3 00:34:30 hrs binary_search, arrays
12 Real Square Roots Binary Search Variant 3 binary_search, arrays
13 Arranging Coins - Easy - 441 Binary Search Variant 3 01:13:35 hrs binary_search, arrays
14 Koko Eating Bananas - Medium - 875 Binary Search Variant 3 binary_search, arrays
15 Capacity To Ship Packages within D Days - Medium - 1011 Binary Search Variant 3 binary_search, arrays
16 Minimize Max distance to Gas Station - Hard - 774 Binary Search Variant 3 binary_search, arrays
17 Divide Chocolate - Hard - 1231 Binary Search Variant 4 02:19:20 hrs binary_sarch, arrays
18 Split Array Largest Sum - Hard - 410 Binary Search Variant 4 00:12:55 hrs binary_search, arrays
19 Median of two sorted arrays - 4 - Hard Binary Search Variant 5 00:01:40 hrs binary_search, arrays

Interval Problems

No Problem Video TimeStamp Tags Code
1 Meeting Rooms 252 - Easy Live Sorting Floater 1 - Interval Line Sweep Class 00:03:50 hrs sorting, interval, arrays
2 Meeting Rooms - 253 - Medium Live Sorting Floater 1 - Interval Line Sweep Class 00:45:30 hrs sorting, interval, arrays
3 Car Pooling - 1094 - Medium Live Sorting Floater 1 - Interval Line Sweep Class 1:52:10 hrs sorting, interval, arrays
4 Merge Intervals - 56 - Medium Live Sorting Floater 1 - Interval Line Sweep Class 2:50:30 hrs sorting, interval, arrays
5 Insert Interval - 57 - Medium Live Sorting Floater 1 - Interval Line Sweep Class 3:40:02 hrs sorting, interval, arrays
6 Employee Free Time Live Sorting Floater 1 - Interval Line Sweep Class 4:08:45 hrs sorting, interval, arrays
7 Interval List Intersections Live Sorting Floater 1 - Interval Line Sweep Class 5:22:25 hrs sorting, interval, arrays

Number Problems

No Problem Video TimeStamp Tags Code
1 Count All Valid Pickup and Delivery Options - 1359 - Hard Number Problems - Adhoc Floater 1 0:03:50 hrs number_problems, arrays
2 Consecutive Numbers Sum - 829 - Hard Number Problems - Adhoc Floater 1 1:25:35 hrs number_problems, arrays
3 Roman to Integer - Easy - 13 Number Problems - Adhoc Floater 1 2:48:50 hrs number_problems, arrays
4 Integer to Roman - Medium - 12 Number Problems - Adhoc Floater 1 3:56:40 hrs number_problems, arrays
5 Integer to English Words - 273 - Hard Number Problems - Adhoc Floater 1 number_problems, arrays

Bit Manipulation Problems

No Problem Video TimeStamp Tags Code
1 Reverse Bits - Easy - 190 Adhoc Floater 3 00:11:40 hrs bit_manipulation
2 Flipping Image - Easy - 832 Adhoc Floater 3 01:11:52 hrs bit_manipulation
3 Sum of Two Integers - Medium - 371 Adhoc Floater 3 01:28:10 hrs bit_manipulation
4 Single Number - Easy - 136 Adhoc Floater 3 02:23:00 hrs bit_manipulation
5 Single Number II - Medium - 137 Adhoc Floater 3 03:31:40 hrs bit_manipulation
6 Single Number III - Medium - 260 Adhoc Floater 3 04:13:47 hrs bit_manipulation
7 Reverse Integer - Medium - 7 Adhoc Floater 3 04:31:00 hrs bit_manipulation
8 Palindrome Number - Easy - 9 Adhoc Floater 3 05:10:00 hrs bit_manipulation

Monotonic Stacks

No Problem Video TimeStamp Tags Code
1 Buildings With An Ocean View - Medium - 1762 Monotonic Stacks I 00:02:40 hrs monotonic_stack
2 Online Stock Span - Medium - 901 Monotonic Stacks I 1:47:10 hrs monotonic_stack
3 Next Greater Element I - Easy - 496 Monotonic Stacks I monotonic_stack
4 Daily Temperatures - Medium - 739 Monotonic Stacks I monotonic_stack
5 Sum of Subarray Minimums - Medium - 907 Monotonic Stacks I monotonic_stack
6 Next Greater Element II - Medium - 503 Monotonic Stacks II monotonic_stack
7 Largest Rectangle in Histogram - Hard - 84 Monotonic Stacks II monotonic_stack
8 Maximum Score of a good subarray - Hard - 1793 Monotonic Stacks II monotonic_stack
9 Maximal Rectangle - Hard - 85 Monotonic Stacks II monotonic_stack

Linked Lists:

No Problem Video TimeStamp Tags Code
1 Middle of the Linked List - Easy - 876 Linked List Floater 1 00:09:12 hrs linked_list
2 Linked List Cycle - Easy - 141 Linked List Floater 1 00:43:00 hrs linked_list
3 Happy Number - Easy - 202 Linked List Floater 1 01:15:04 hrs linked_list, math_sequences
4 Linked List Cycle II - Easy - 142 Linked List Floater 1 02:56:40 hrs linked_list
5 Circular Array Loop - Medium - 457 Linked List Floater 1 03:51:30 hrs linked_list, sequences
6 Find the duplicate number - Medium - 287 Linked List Floater 1 05:03:46 hrs linked_list, array_sequence
7 Design Linked List - Medium - 707 Linked List Floater 2 00:13:00 hrs linked_list
8 Delete Node in a Linked List - Medium - 237 Linked List Floater 2 01:46:30 hrs linked_list
9 Remove Linked List Elements - Easy - 203 Linked List Floater 2 01:51:26 hrs linked_list, deletion
10 Remove Duplicates from sorted list - Easy - 83 Linked List Floater 2 02:11:41 hrs linked_list, deletion
11 Remove Duplicates from sorted list II - Medium - 82 Linked List Floater 2 02:20:54 hrs linked_list, deletion
12 Delete N Nodes after M Nodes of a linked list - Easy - 1474 Linked List Floater 2 03:00:00 hrs linked_list, deletion
13 Insert Into a sorted circular linked list - Medium - 708 Linked List Floater 2 03:24:20 hrs linked_list, insertion
14 Merge two sorted lists - Easy - 21 Linked List Floater 3 00:05:55 hrs linked_list, rearrangements
15 Sort List - Medium - 148 Linked List Floater 3 00:36:00 hrs linked_list, rearrangements
16 Merge k sorted lists - Hard - 23 Linked List Floater 3 01:06:30 hrs linked_list, rearrangements
17 Insertion sort list - Medium - 147 Linked List Floater 3 01:36:10 hrs linked_list, rearrangements
18 Partition List - Medium - 86 Linked List Floater 3 02:09:00 hrs linked_list, rearrangements
19 Rotate List - Medium - 61 Linked List Floater 3 02:41:40 hrs linked_list, rearrangements
20 Reverse Linked List - Easy - 206 Linked List Floater 4 00:10:00 hrs linked_list, reversals
21 Reverse Linked List II - Medium - 92 Linked List Floater 4 01:23:20 hrs linked_list, reversals
22 Palindrome Linked List - Easy - 234 Linked List Floater 4 02:28:00 hrs linked_list, reversals
23 Reorder List - Medium - 143 Linked List Floater 4 02:57:20 hrs linked_list, reversals
24 Reverse Nodes in k-group - Hard - 25 Linked List Floater 4 03:38:50 hrs linked_list, reversals

Recursion/Backtracking

No Problem Video TimeStamp Tags Code
1 Letter Case Permutation - 784 - Medium Recursion: Live Class Omkar Schedule Link 40:00 hrs recursion, permutation
2 Subsets Recursion: Live Live Class Omkar Schedule Link 2:23:35 hrs recursion, combination
3 Permutations - 46 - Medium Recursion: Live Class Omkar Schedule Link 2:52:10 hrs recursion, permutation
4 Permutations II - 47 - Medium Recursion: Live Class Omkar Schedule Link Slides 4:08:20 hrs recursion, permutation
5 Subsets II - 90 - Medium Recursion: Live Class Omkar Schedule Link 4:34:34 hrs recursion, permutation
6 Letter Combinations of a phone number - 17 - Medium Recursion: Live Class Omkar Schedule Link 5:14:20 hrs recursion, permutation Source
7 Combinations - 77 Recursion: Live Class Omkar Schedule Link 5:34:30 hrs recursion, combination, backtracking
8 Combinations II - 40 - Medium Recursion: Live Class Omkar Schedule Link 6:03:04 hrs recursion, combination, backtracking
9 N Queens Problem - 51 - Hard N Queen Problem Library Link 00:00:00 hrs recursion
10 Generate Parentheses - Medium - 22 Generate Parenthesis 00:12:00 hrs recursion, backtracking

Tries

No Problem Video TimeStamp Tags Code
1 [Implement Trie or Prefix Tree - Medium - 208]Range Sum Query - Mutable - 307 - Medium Adhoc Floater 8 - Tries I 3:31:35 hrs tries
2 Implement Trie II - 1804 - Medium Adhoc Floater 9 - Tries II 00:16:40 hrs tries
3 Longest Word in dictionary - 720 - Medium Adhoc Floater 9 - Tries II tries
4 Longest Common Prefix - 14 - Easy Adhoc Floater 9 - Tries II tries
5 Design Add and Search Words data structure - 211 - Medium Adhoc Floater 9 - Tries II tries
6 Design Search AutoComplete System - Hard - 642 Adhoc Floater 9 - Tries II tries
7 Word Search - Medium - 79 Adhoc Floater 10 - Tries III tries
8 Word Search II - Hard - 212 Adhoc Floater 10 - Tries III tries
9 Wild Card Matching - Hard - 44 Adhoc Floater 10 - Tries III tries
10 Regular Expression Matching - Hard - 10 Adhoc Floater 10 - Tries III tries

Greedy Algorithms

No Problem Video TimeStamp Tags Code
1 American Coin Change Ad-hoc Floater 4 - Greedy Algorithms I greedy
2 Fractional Knapsack Ad-hoc Floater 4 - Greedy Algorithms I greedy
3 Max number of kings on a chess board Ad-hoc Floater 4 - Greedy Algorithms I greedy
4 Best Time to Buy and Sell Stock II - Medium - 122 Ad-hoc Floater 4 - Greedy Algorithms I greedy
5 Maximum Units on a truck - Easy - 1710 Ad-hoc Floater 4 - Greedy Algorithms I greedy
6 Two City Scheduling - Medium - 1029 Ad-hoc Floater 4 - Greedy Algorithms I greedy
7 Lemonade Change - Easy - 860 Ad-hoc Floater 4 - Greedy Algorithms I greedy
8 Gas Station - Medium - 134 Ad-hoc Floater 4 - Greedy Algorithms I not_greedy
9 Robot Bounded in Circle - Medium - 1041 Ad-hoc Floater 4 - Greedy Algorithms I not_greedy
10 CPU Scheduling Ad-hoc Floater 5 - Greedy Algorithms II greedy
11 Non Overlapping Intervals - Medium - 435 Ad-hoc Floater 5 - Greedy Algorithms II 01:02:58 hrs greedy
12 Minimum Number of Arrows to burst balloons - Medium 452 Ad-hoc Floater 5 - Greedy Algorithms II 02:34:35 hrs greedy
13 Lemonade Change - Easy - 860 Ad-hoc Floater 5 - Greedy Algorithms II 03:37:30 hrs greedy
14 Robot Bounded in Circle - Medium - 1041 Ad-hoc Floater 5 - Greedy Algorithms II 04:03:20 hrs not_greedy
15 Gas Station - Medium - 134 Ad-hoc Floater 5 - Greedy Algorithms II 05:07:40 hrs not_greedy

Trees

Binary Search Trees

No Problem Video TimeStamp Tags Code
1 Merge Two BSTS to sorted lists Tree Series Part 5 04:59:00 hrs Trees, BST, construction (inorder), Linked_Lists
2 Validate Binary Search Tree - Medium - 98 Tree Series Part 3 04:18:10 hrs Trees, BST, DFS, bottom_up_dfs
3 Largest BST SubTree - Medium - 333 Tree Series Part 3 04:42:40 hrs Trees, BST, DFS, bottom_up_dfs
4 Convert BST to sorted doubly linked list - Medium - 426 Tree Series Part 4 00:46:10 hrs Trees,BST, DFS, top_down_dfs, inorder_traversal
5 Kth Smallest element in a BST - Medium - 230 Tree Series Part 4 01:42:25 hrs Trees,BST, DFS, top_down_dfs, bottom_up_dfs
6 Binary Search Tree Iterator - Medium - 173 Tree Series Part 4, Binary Search Tree Interator 04:05:20 hrs Trees, Binary_tree, stack
7 Convert Sorted Array to Binary Search Tree - Easy - 108 Tree Series Part 5 00:06:08 hrs Trees, BST, construction
8 Convert Sorted List to Binary Search Tree - Medium - 109 Tree Series Part 5 00:43:50 hrs Trees, BST, construction
9 Merge Two BSTs [EPI Problem] Tree Series Part 5 01:12:14 hrs Trees, BST, construction
10 Construct BST from preorder traversal - Medium - 1008 Tree Series Part 5 02:08:15 hrs Trees, BST, construction
12 Serialize and Deserialize BST - Medium - 449 Tree Series Part 5 02:52:50 hrs Trees, BST, construction
13 Convert Sorted list to binary search tree - Medium - 109 Tree Series Part 5 04:24:22 hrs Trees, BST, construction

N-Aray Trees

No Problem Video TimeStamp Tags Code
1 N-Ary tree level order traversal - Medium - 429 Tree Series Part 1 Tree, N-ary
2 Height of an N-ary Tree Tree Series Part 2 04:00:00 hrs Trees, N-Ary, DFS, top_down_dfs, bottom_up_dfs
3 Maximum Depth of N-ary Tree - 559 - Easy Tree Series Part 1 Slides Page 41 1:49:05 hrs Trees N-ary, BFS

Binary Trees

No Problem Video TimeStamp Tags Code
1 Binary Tree Level Order Traversal - 102 - Medium Tree Series Part 1 Slides Page 10 0:27:05 hrs Trees Binary_tree, BFS
2 Binary Tree Level Order Traversal II - 107 - Medium Tree Series Part 1 Slides Page 16 0:50:00 hrs Trees Binary_tree, BFS
3 Binary Tree Zigzag Level Order Traversal - 103 - Medium Tree Series Part 1 Slides Page 23 1:04:25 hrs Trees Binary_tree, BFS
4 Average of Levels in Binary Tree - 637 - Easy Tree Series Part 1 Slides Page 27 1:19:25 hrs Trees Binary_tree, BFS
5 Find Largest Value in Each Tree Row - 515 - Medium Tree Series Part 1 Slides Page 30 1:23:00 hrs Trees Binary_tree, BFS
6 Binary Tree Right Side View - 199 - Medium Tree Series Part 1 Slides Page 33 1:25:50 hrs Trees Binary_tree, BFS
7 Minimum Depth of Binary Tree - 111 - Easy Tree Series Part 1 Slides Page 36 1:35:15 hrs Trees Binary_tree, BFS
8 Maximum Depth of Binary Tree - 104 - Easy Tree Series Part 1 Slides Page 39 1:43:15 hrs Trees Binary_tree, BFS
9 Maximum Level Sum of a Binary Tree - 1161 - Medium Tree Series Part 1 Slides Page 43 2:19:05 hrs Trees Binary_tree, BFS
10 Univalued Binary Tree - 965 - Easy Tree Series Part 1 Slides Page 45 2:27:20 hrs Trees Binary_tree, BFS
11 Cousins in Binary Tree - 993 - Easy Tree Series Part 1 Slides Page 47 2:30:00 hrs Trees Binary_tree, BFS
12 Populating Next Right Pointers in Each Node - 116 - Medium Tree Series Part 1 Slides Page 51 2:40:35 hrs Trees Binary_tree, BFS, top_down_dfs
13 Add One Row to Tree - 623 - Medium Tree Series Part 1 Slides Page 54 2:53:00 hrs Trees Binary_tree, BFS
14 Maximum Width of Binary Tree - 662 - Medium Tree Series Part 1 Slides Page 58 3:08:24 hrs Trees Binary_tree, BFS
15 Check completeness of Binary Tree - 958 - Medium Tree Series Part 1 Slides Page 62 3:39:35 hrs Trees, Binary_tree, BFS
16 Same Tree - 100 - Easy Tree Series Part 1 Slides Page 65 3:57:55 hrs Trees, Binary_tree, BFS, top_down_dfs
17 Symmetric Tree - 101 - Easy Tree Series Part 1 Slides Page 67 4:09:10 hrs Trees, Binary_tree, BFS, top_down_dfs
18 Clone a Binary Tree (Not a leetcode problem) Tree Series Part 1 Slides Page 69 4:26:50 hrs Trees, Binary_tree, BFS, top_down_dfs
19 Print all paths of a tree Tree Series Part 2 00:41:10 hrs Trees, Binary_tree, DFS, top_down_dfs
20 Path Sum - Easy - 112 Tree Series Part 2 01:45:35 hrs Trees, Binary_tree, DFS, top_down_dfs
21 Path Sum - Medium - 113 Tree Series Part 2 02:06:25 hrs Trees, Binary_tree, DFS, top_down_dfs
22 Binary Tree Longest Consequtive Sequence - Medium - 298 Tree Series Part 2 02:10:10 hrs Trees, Binary_tree, DFS, top_down_dfs
23 Path Sum III - Medium - 437 Tree Series Part 2 03:03:40 hrs Trees, Binary_tree, DFS, top_down_dfs
24 Invert Binary Tree - Easy - 226 Tree Series Part 2 03:47:53 hrs Trees, Binary_tree, DFS, top_down_dfs
25 Diameter of a tree - Easy - 543 Tree Series Part 2 04:21:25 hrs Trees, Binary_tree, DFS, bottom_up_dfs
26 Count Univalue Subtrees - Medium - 250 Tree Series Part 2 04:46:30 hrs Trees, Binary_tree, DFS, bottom_up_dfs
27 Lowest Common Ancestor of a binary tree - Medium - 236 Tree Series Part 2 05:19:00 hrs Trees, Binary_tree, DFS, bottom_up_dfs
28 Find Bottom Left Tree Value - Medium - 513 Tree Series Part 3 00:12:55 hrs Trees, Binary_tree, BFS, top_down_dfs
29 Binary Tree Vertical Order Traversal - Medium - 314 Tree Series Part 3 00:40:20 hrs Trees, Binary_tree, BFS,top_down_dfs
30 Vertical Order Traversal of a binary tree - Hard - 987 Tree Series Part 3 01:43:05 hrs Trees, Binary_tree, DFS, top_down_dfs
31 Boundary of a binary tree - Medium - 545 Tree Series Part 3 02:03:40 hrs Trees, Binary_tree, DFS, top_down_dfs
32 Binary Tree Upside Down - Medium - 156 Tree Series Part 3, Tree Series Part 4 03:03:10 hrs, 00:28:02 hrs Trees, Binary_tree, DFS, top_down_dfs, BFS
33 Balanced Binary Tree - Easy - 110 Tree Series Part 3 03:50:40 hrs Trees, Binary_tree, DFS, bottom_up_dfs
34 Longest Univalue Path - Medium - 687 Tree Series Part 3 04:56:20 hrs Trees, Binary_tree, DFS, bottom_up_dfs
35 Binary Tree Maximum Path Sum - Hard - 124 Tree Series Part 3 05:38:15 hrs Trees, Binary_tree, DFS, bottom_up_dfs
36 Binary Tree Tilt - Easy - 563 Tree Series Part 4 00:05:05 hrs Trees, Binary_tree, DFS, bottom_up_dfs
37 Flatten Binary Tree to Linked List - Medium - 114 Tree Series Part 4 01:59:40 hrs Trees, Binary_tree, DFS, top_down_dfs, bottom_up_dfs
38 Binary Tree Preorder traversal - Easy - 144 Tree Series Part 4 03:11:00 hrs Trees, Binary_tree, stack
39 Binary Tree Inorder Traversal - Medium - 94 Tree Series Part 4 03:43:45 hrs Trees, Binary_tree, stack
40 Binary Tree Postorder Traversal - Easy - 145 Tree Series Part 4 03:44:04 hrs Trees, Binary_tree, stack
41 Construct Binary Tree from preorder and inorder traversal - Medium - 105 Tree Series Part 5 01:18:20 hrs Trees, Binary_tree, construction
42 Construct Binary Tree from inorder and postorder traversal - Medium - 106 Tree Series Part 5 02:37:10 hrs Trees, Binary_tree, construction
43 Serialize and Deserialize Binary Tree - Hard - 297 Tree Series Part 5 03:15:40 hrs Trees, Binary_tree, construction
44 All Nodes Distance K in Binary Tree - Medium - 863 Tree Floater - 1 Shashi B 00:02:00 hrs Trees, Binary_tree

Other Trees

No Problem Video TimeStamp Tags Code
1 Range Sum Query - Mutable - 307 - Medium Ad-hoc Floater 6 Library Link 0:03:10 hrs binary_indexed_trees, segment trees
2 Minimum Height Trees - 310 - Medium Ad-hoc Floater 6 Library Link 3:08:00 hrs
3 Range Min/Max Queries Ad-hoc Floater 7 Library Link 0:01:00 hrs segment_trees

Graphs

No Problem Video TimeStamp Tags Code
1 Number of connected components in an undirected graph - 323 - Hard Omkar Live Class 00:24:30 hrs graphs, undirected
2 Graph valid tree - 261 - Medium Omkar Live Class 01:23:20 hrs graphs, undirected
3 Is Graph Bipartite - 785 - Medium Omkar Live Class 02:19:03 hrs graphs, undirected
4 Possible Bipartition - 886 - Medium Omkar Live Class 03:19:26 hrs graphs, undirected
5 Number of Islands - 200 - Medium Omkar Live Class 03:21:55 hrs graphs, undirected
6 Snakes and Ladders - 909 - Medium Omkar Live Class 04:08:10 hrs graphs, undirected
7 Find the Shortest Path from Source S to Some Destination When There are Lengths (Weights) on edges? Omkar Live Class 04:48:20 hrs graphs, undirected, BFS
8 Course Schedule - 207 - Medium Omkar Live Class 05:41:32 hrs graphs, undirected
9 Critical Connections in a network - 1192 Advanced Graphs Floater 1 Slides 02:01 hrs graphs Source
10 Cover all vertices with the least number of vertices Advanced Graphs Floater 2 Slides 02:58 hrs graphs
11 Flight Routes Check Advanced Graphs Floater 2 Slides 55:30 hrs graphs
12 Planets and Kingdoms Advanced Graphs Floater 3 Slides 17:50 hrs graphs
13 Minimum Knight Moves - 1197 Advanced Graphs Floater 5 Schedule Link Slides 38:37 hrs graphs, Bidirectional Search
14 Open the lock - 752 Advanced Graphs Floater 5 Schedule Link Slides 2:02:00 hrs graphs
15 Reconstruct Itinerary - 332 - Hard Advanced Graphs Floater 6 Schedule Link Slides 3:50 hrs graphs, Euler graphs
16 Teleporters Path Advanced Graphs Floater 6 Schedule Link Slides 2:25:30 hrs graphs, Euler Path
17 Mail Delivery Advanced Graphs Floater 6 Schedule Link Slides 2:29:30 hrs graphs, Euler Cycle, undirected
18 Network Delay Time - 743 - Medium Advanced Graphs Floater 7 Schedule Link Slides 2:30 hrs graphs, Dijkstra
19 Path with Maximum Probability - 1514 - Medium Advanced Graphs Floater 7 Schedule Link Slides 1:09:01 hrs graphs, Dijkstra
20 Path with Minimum Effort - 1631 - Medium Advanced Graphs Floater 7 Schedule Link Slides 1:52:40 hrs graphs, Dijkstra
21 All Paths From Source to Target - 797 - Medium Advanced Graphs Floater 11 - DAG Problems 00:17:35 hrs graphs, DAG
22 Parallel Courses - 1136 - Medium Advanced Graphs Floater 11 - DAG Problems 02:30:52 hrs graphs, DAG

Dynamic Programming

No Problem Video TimeStamp Tags Code
1 Climbing Stairs - 70 - Easy DP Part 1 Library Link 1:17:00 hrs DP Counting Problem
2 Nth Tribonacci Number DP Part 1 Library Link 2:11:00 hrs DP
3 Domino and Tromino Tiling - 790 - Medium DP Part 1 Library Link 2:16:00 hrs DP
4 Unique Paths - 62 - Medium DP Part 1 Library Link Slides 3:41:30 hrs DP Source
5 Pascal’s triangle - 118 - Easy DP Part 1 Library Link Slides 4:18:12 hrs DP
6 Unique Path II DP Part 2 Library Link Slides 20:24:00 hrs DP
7 Minimum Path Sum - 64 - Medium DP Part 2 Library Link Slides 1:08:40 hrs DP Optimization
8 Minimum Cost of Climbing Stairs - 746 - Easy DP Part 2 Library Link Slides 2:08:00 hrs DP Optimization
9 Coin Change - 322 - Medium DP Part 2 Library Link Slides 2:51:01 hrs DP Optimization
10 Triangle - 120 - Medium DP Part 2 Library Link Slides 3:21:10 hrs DP
11 House Robber - 198 - Medium DP Part 2 Library Link Slides 4:00:45 hrs DP
12 House Robber II - 213 - Medium DP Part 2 Library Link Slides 4:22:36 hrs DP
13 Minimum Cost of Tickets - 983 - Medium DP Part 2 Library Link Slides 4:33:50 hrs DP
14 Knight Dialer - 935 - Medium DP Part 3 Library Link Slides 1:07:45 hrs DP
15 Paint Fence - 276 - Medium DP Part 3 Library Link Slides 2:05:00 hrs DP
16 Paint House - 256 - Medium DP Part 3 Library Link Slides 3:31:00 hrs DP
17 Rod Cutting DP Part 3 Library Link Slides 3:52:00 hrs DP
18 Integer Break - 343 - Medium DP Part 3 Library Link Slides 4:27:00 hrs DP
19 Paint House II DP Part 4 Library Link Slides Page 89/90 54:00 hrs DP
20 Edit Distance - 72 - Hard DP Part 4 Library Link Slides 1:42:50 hrs DP
21 Longest Common Subsequence - 1143 - Medium DP Part 4 Library Link 3:35:40 hrs DP
22 Delete Operation for two strings - 583 - Medium DP Part 4 Library Link 4:20:10 hrs DP
23 Shortest Common Supersequence - 1092 - Hard DP Part 4 Library Link 4:42:10 hrs DP
24 Partition Equal subset sum - 416 - Medium DP Part 5 Schedule Link Library Link 3:12:46 hrs DP
25 Decode Ways - 91 - Medium DP Part 5 Schedule Link Library Link 11:10 hrs DP
26 Interleaving String - 9 - Medium DP Part 5 Schedule Link Library Link 1:16:40 hrs DP
27 Combination Sum IV - 377 - Medium DP Part 7 Library Link Schedule Link 18:25 hrs DP, Combination, Enumeration/Counting
28 Coin Change 2 - 158 - Medium DP Part 7 Library Link Schedule Link 1:31:50 hrs DP, Combination, Enumeration/Counting
29 Count Well formed Parenthesis DP Part 8 Library Link Schedule Link 5:05 hrs DP, Enumeration/Counting
30 Unique Binary Search Trees - 96 - Medium DP Part 8 Library Link Schedule Link 1:14:45 hrs DP,Trees, BST
31 Unique Binary Search Tree II - 95 - Medium DP Part 9 Library Link Schedule Link 07:10 hrs DP, Trees, BST
32 All possible full binary trees - 894 - Medium DP Part 9 Library Link Schedule Link 1:48:10 hrs DP, Trees, Binary_Tree
33 Different ways to add Parentheses - 241 - Medium DP Part 9 Library Link Schedule Link 2:42:45 hrs DP, Enumeration/Counting
34 Changing Matrix Multiplication DP Part 10 Library Link Schedule Link 04:20 hrs DP, Matrix
35 Burt Balloon Problem - 312 - Hard DP Part 10 Library Link Schedule Link 2:20:31 hrs DP
36 Valid Palindrome - 125 - Easy DP Part 11 Library Link Schedule Link 10:55 hrs DP
37 Valid Palindrome II - 680 - Easy DP Part 11 Library Link Schedule Link 34:17 hrs DP
38 Longest Palindromic Subsequence - 516 - Medium] DP Part 11 Library Link Schedule Link 50:52 hrs DP
39 Valid Palindrome III - 1216 - Hard DP Part 11 Library Link Schedule Link 2:14:15 hrs DP

List of IK Practice Problems

No IK Problem Tags
1 Segregate Even and Odd Numbers Sorting
2 Implement Merge Sort Sorting
3 Merge One Sorted Array into Another Sorting
4 Dutch National Flag Sorting
5 2Sum in a sorted array Sorting
6 2Sum in an array Sorting
7 Merge K sorted linked lists Sorting
8 Attend Meetings Sorting
9 Top K Frequent Elements Sorting
10 Kth Largest in a stream Sorting
11 Kth largest in an array Sorting
12 Online Median Sorting
13 Intersection of 3 sorted arrays Sorting
14 Sort all characters Sorting
15 Four billion Sorting
16 Nearest Neighbors Sorting
17 Generate all subsets of a set Recursion
18 Palindromic decomposition of a string Recursion
19 How many binary search trees with n nodes Recursion
20 Solve Sudukou puzzle Recursion
21 N Queen Problem Recursion
22 Generate all possible expressions that evaluate to the target value Recursion
23 Permute array of unique integers Recursion
24 Letter Case Permutation Recursion
25 N Choose K Combinations Recursion
26 Permute array of integers duplicates allowed Recursion
27 Subsets with duplicate characters Recursion
28 Words from a phone number Recursion
29 Generate all combinations with sum equal to target Recursion
30 Power Recursion
31 Tower of Hanoi Recursion
32 Strings from wild card Recursion
33 Find all well formed brackets Recursion
34 Possible to achieve target sum Recursion
35 Is it a BST Trees
36 Single Value Tree Trees
37 Print All paths of a tree Trees
38 Upside Down Trees
39 Merge two BSTs Trees
40 Post Order Traversal without recursino Trees
41 Lowest Common Ancestor Trees
42 Convert a binary tree into a circular doubly linked list Trees
43 Pre order traversal of a binary tree Trees
44 Inorder traversal of a binary tree Trees
45 Post Order traversal of a binary tree Trees
46 Level order traversal of binary tree Trees
47 Level order traversal of a tree Trees
48 Reverse level order traversal of a binary tre Trees
49 Zigzag level order traversal of a binary tree Trees
50 Diameter of a binary tree Trees
51 Convert sorted list to a binary search tree Trees
52 Print all paths that sum to K Trees
53 Construct a binary search tree from its preorder traversal Trees
54 Right side view of a binary tree Trees
55 Root to leaf path sum equal to K Trees
56 Mirror Image of Binary Tree Trees
57 Construct Binary Tree Trees
58 Clone a Binary Tree Trees
59 Largest BST Trees
60 Inorder Binary Tree iterator Trees
61 Populate Sibling Pointer Trees
62 Height of a tree Trees
63 Balanced BST from a sorted array Trees
64 Kth Smallest element of BST Trees
65 Flood Fill Graphs
66 Knights Tour on a chessboard Graphs
67 Shortest String transformation using a dictionary Graphs
68 Course Schedule Graphs
69 Zombie Clusters Graphs
70 Critical Connections Graphs
71 Shortest Path in 2D Grid with Keys and Doors Graphs
72 Count Islands Graphs
73 Find largest Island Graphs
74 Count Connected Components in an undirected graph Graphs
75 Is it a Tree Graphs
76 Complete all courses with dependencies Graphs
77 Friendly Groups Graphs
78 Detect Cycle in directed graph Graphs
79 Longest path in weighted DAG Graphs
80 Snakes and Ladders Matrix Graphs
81 Shortest distance to a guard Graphs
82 Count Basins Graphs
83 Find order or characters in alien dictionary Graphs
84 Create Transpose of a directed graph Graphs
85 Find Middle Node of a Linked list Linked List
86 Implement a min stack Linked List
87 Longest Substring with Balanced Parentheses Linked List
88 Swap Kth Nodes in a Linked List Linked List
89 Remove Nth Node from the end of a list Linked List
90 Zip Linked list from two ends Linked List
91 Reverse a linked list in groups of K Linked List
92 Maximum in sliding window Linked List
93 Design and implement LRU cache Linked List
94 Add Two numbers Linked List
95 Alternative Node Split Linked List
96 Merge Sort a linked list Linked List
97 Valid Expression Linked List
98 Clone Linked List with Random Pointer Linked List
99 Design And Implement Skip List Linked List
100 Zigzag A word Strings
101 Longest Substring with exactly two distinct characters Strings
102 Generate all numeronyms Strings
103 Join words to make a palindrome Strings
104 Regex Matcher Strings
105 Longest Repeated substring Strings
106 KMP Strings
107 Convert String Sinusoidally Strings
108 Minimum window substring Strings
109 Indices of words in text string Strings
110 Boggle Solver Strings
111 Count ways to reach the Nth Step DP
112 Minimum Coins DP
113 Jump Game DP
114 Robbery DP
115 Knight’s Tour on a phone keypad DP
116 Levenshtein Distance DP
117 Word break count DP
118 Equal subset partition DP
119 Cut the rope to maximize profit DP
120 Number of ways to make change DP
121 Largest Square Submatrix with all 1s DP
122 Word Wrap DP
123 Strings Interleave DP
124 Longest Common Subsequence DP
125 Coin Play DP
126 Matrix Chain Multiplication DP
127 Number of paths in a matrix DP
128 Cut the rope DP
129 Merge Overlapping Intervals Ad-hoc Practice
130 Array Product Ad-hoc Practice
131 2D Array Search Ad-hoc Practice
132 Pascals Triangle Ad-hoc Practice
133 Sum Zero Ad-hoc Practice
134 Area Under Histogram Ad-hoc Practice
135 Alternating Positives and Negatives Ad-hoc Practice
136 Run Length Encoding Ad-hoc Practice
137 Minimum Element in a sorted and Rotated Array Ad-hoc Practice
138 Find the next palindromic number Ad-hoc Practice
139 Hamming Weight Ad-hoc Practice
140 Skyline Ad-hoc Practice

Interviews Journal:

Company Recruiter Date connected Date Responded Current Status Initiated by
Meta Melvin Pitts

Interview Diary:

Company Date Time EDT Notes Status
IK 01 June 7:00 PM Career Coaching Completed. Got interesting tips
Evolution IQ 01 June 11:30 AM Call with Recruiter Recruiter did not call back
Grammarly 02 June 1:30 PM Call with Recruiter Talked to the recruiter. Asked for 4 weeks to get ready for the interview
Optum Labs 06 June 10:30 AM Call with Recruiter Completed. Next round is to be scheduled
IK 15 June 9:00 PM - 10:00 PM Behavioral Mock with Vikas Bharadwaj Completed
Amazon 17 June 2:30 PM - 3:00 PM Call with Ujjwal Ratan, Hiring Manager Completed. The role does not match. Not proceeding
IK 18 June 1:00 PM Scalable System Design Mock with Reza Sadoddin Completed. Got mixed feedback
Meta 21 June 1:45 PM Behavioral First Round Completed. Moving to next round.
Alation Inc 22 June 12:00 AM Call with recruiter Completed. Need to provide dates for next round
Alation Inc 05 July 2:15 PM - 2:45 PM Call with Joachim Rahmfeld Completed
Optum Labs 05 July 3:00 PM - 4:00 PM Call with Carlos Morato Completed. Did not hear any further feedback.
Google 19th JUly Call with the recruiter Veera Gupte Missed the call with the recruiter. Rescheduled to early August
Meta Between 20 July - 30th July PlaceHolder Virtual Onsite Loop To be Scheduled

Things to do:

  • Send email to IK on complexity analysis
  • Send email to IK on uplevel interview link for Meta
  • Send email to IK on behavioral mock

List of System Design Problems

No Topic Video TimeStamp Tags
1 Design NetFlix Gaurav - Alternative Class SS - 2 00:06:14 hrs
2 Design Gmail Gaurav - Alternative Class SS - 2 00:45:34 hrs
3 Design Amazon Reviews Sundar Gaurav 00:07:44 hrs, 01:32:00 hrs
4 Design Twitter Gaurav - Alternative Class SS - 2 02:27:36 hrs
5 Design Inventory System Sundar - Alternative Class SS - 2 02:46:52 hrs
6 Design Billionth Car Problem Sundar - Alternative Class SS - 2 03:28:43 hrs
7 Design GUID Sundar - Alternative Class SS - 2 03:44:22 hrs
8

Uplevel Foundation, Live Classes and Helpful Videos from discord list:

Scalable System Design

No Topic Author Type Other Details
1 Alternative Class - Scalable System Design Sundar Video
2 Alternative Class - Online Processing Systems Slides + concepts pdfs Niloy Video
3 Alternative Instructor Scalable System 1 (New Foundation) Slides Omkar Deshpande Video
4 Alternative Class - Online Processing Systems Slides Notes Class Slides Vivek Hariharan Video
5 Scalable Systems 1 Vineet Joglekar Video May 9, 2021

Uplevel Library

Machine Learning

No Topic Author Type Other Details
1 ML Coding Walkthrough - Banking Loan Prediction Video
2 Machine Learning Interviews: Ranking and Recommendation Video
3 Recommendation System Video
4 Fraud Detection Video
5 Time Series Analysis- City Bike Dataset Video
6 Introduction to Time Series Video
7 Time Series DB Video
8 ML Coding Walkthrough - Housing Price Prediction Video
9 Introduction to Machine Learning System Design Video
10 Machine Learning System Design Framework Video
11 Supervised Learning II - Live Problem Question (Mandatory) Slides Video
12 Supervised Learning II - Assignment Solution Video
13 Alternative Slides: Supervised Learning II Agni Kumar Instruction
14 Deep Learning II - Assignment Solution Instruction
15 Unsupervised Learning - Module Overview Instruction

Data Structures & Algorithms

No Topic Author Type Other Details
1 Ad-Hoc Floater 3 - Bit Manipulation II Omkar Deshpande Video
2 Ad-Hoc Floater 4 - Greedy Algorithms I Omkar Deshpande Video
3 Ad-Hoc Floater 5 - Greedy Algorithms II Omkar Deshpande Video
4 Ad-Hoc Floater 6 - Binary Indexed Trees Omkar Deshpande Video
5 Ad-Hoc Floater 7 - Segment Trees Omkar Deshpande Video
6 Live Ad-Hoc Floater 8 - Tries I Slides Omkar Deshpande Video
7 Live Ad-Hoc Floater 9 - Tries II Omkar Deshpande Video
8 Live Ad-Hoc Floater 10 - Tries III (Whole String Pattern Matching) Omkar Deshpande Video
9 Binary Search Variants Part 1 Omkar Deshpande Video
10 Binary Search Variants Part 2 Omkar Deshpande Video
11 Binary Search Variants Part 3 Omkar Deshpande Video
12 Binary Search Variants Part 4 Omkar Deshpande Video
13 Binary Search Variants Floater 5 Omkar Deshpande Video Monday, October 25, 2021
14 Binary Search Variants Series Slides Omkar Deshpande Instruction
15 Monotonic Stacks 1 Omkar Deshpande Video
16 Monotonic Stacks 2 Omkar Deshpande Video
17 Array Floater 1 - Cycle Sort Slides Omkar Deshpande Video
18 Array Floater 2 - Decrease and Conquer Slides Omkar Deshpande Video
19 Array Floater 3 - Prefix Sums Slides Omkar Deshpande Video
20 Array Floater 4 - Sliding Windows I Slides Omkar Deshpande Video
21 Array Floater 5 - Sliding Windows II Slides Omkar Deshpande Video
22 Array Floater 6 - Sliding Windows III Slides Omkar Deshpande Video
23 Array Floater 7 - Miscellaneous Practice - Buy and Sell Stock, Unlimited Transactions Omkar Deshpande Video
24 Arrays Floater 7 - Best Time to Buy and Sell Stock Part A Omkar Deshpande Video
25 Arrays Floater 8 - Best Time to Buy and Sell Stock Part B Omkar Deshpande Video
26 Live Arrays Floater 9 - Bidirectional Decrease-and-Conquer Omkar Deshpande Video
27 Arrays - Live Arrays Floater 9 - Bidirectional Decrease-and-Conquer Slides Omkar Deshpande Video Omkar, October 22, 2021
28 Arrays Floater 10 - Decrease and Conquer (Of 2 and 3) Omkar Deshpande Video Monday, November 29, 2021
29 Linked Lists Floater 1 - Floyd’s Cycle Detection Omkar Deshpande Video
30 Linked Lists Floater 2 - Insertion and Deletion Omkar Deshpande Video
31 Linked Lists Floater 3 - List Rearrangements Omkar Deshpande Video
32 Linked Lists Floater 4 - List Reversal Omkar Deshpande Video
33 How Many Binary Search Trees With N Nodes Omkar Deshnpande Video
34 Binary Search Tree Iterator Omkar Deshpande Video
35 Alternative Class - Trees Omkar Deshpande Video
36 Trees Floater I Shashi B B Video Tuesday, July 19, 2022
37 Binary Indexed Trees_Floater Session Omkar Deshpande Video Sunday, May 16, 2021
38 Dynamic Programming Series - Part 6 Omkar Deshpande Video
39 Dynamic Programming Series - Part 7 Omkar Deshpande Video
40 Dynamic Programming Series - Part 8 Omkar Deshpande Video
41 Dynamic Programming Series Part 9 Omkar Deshpande Video
42 Dynamic Programming Series Part 10 Omkar Deshpande Video
43 Dynamic Programming Series Part 11 Omkar Deshpande Video
44 Generate Parenthesis Omkar Deshpande Video
45 Zombie Clusters Omkar Deshpande Video
46 Sorting Bonus Foundational Session - Designing a Heap Omkar Deshpande Video
47 Sorting Problems FLoater 1 Shashi B Video Tuesday, July 5, 2022
48 Live Sorting Floater 1 - Interval Line Sweep Class Omkar Deshpande Video
49 Hoare’s Partitioning Omkar Deshpande Video
50 Divide and Conquer Quick Sort Omkar Deshpande Video
51 Brute Force: Bubble Sort Omkar Deshpande Video
52 Sorting Part 4 Omkar Deshpande Video
53 Counting Sort Omkar Deshpande Video
54 N-Queen Problem Omkar Deshpande Video
55 Recursion Slides Sorting Slides Omkar Deshpande Instruction
56 Generate All Possible Expressions That Evaluate To The Given Target Value Video
57 Generate_All_Possible_Expressions_to_Target_Recursion_Set_1 Video
58 Generate All Possible Expressions to Target - Recursion Problem Set 1 Video

Behavioral

No Topic Author Type Other Details
1 Amazon Leadership Principles Instruction
2 Regular Behavioral Sample Interview 1 Video
3 Alternative Class - Leadership Interviews Nick Video
4 Live Behavioral Interview Patterns Class Darion Whitten Video Wednesday, May 18, 2022
5 Behavioral Interviews Review Margaret Northup Video Saturday, April 2, 2022
6 Offer Negotiation Randy Visser Video Wednesday, April 6, 2022
7 Behavioral Interviews Bareeha Dehradunwala Video Wednesday, March 30, 2022
8 Interview Research and Strategy + Resume and LinkedIn Farzana Haniff Video Wednesday, March 23, 2022
9 Career Coaching Office Hours Christer Antonsen Video June 1, 2022
10 Suresh Iyer Career Skills Spreadsheet Instruction End-November-2021
11

System Design

No Topic Author Type Other Details
1 Live Stream Processing Systems Class Belal Said Video Sunday, June 5, 2022
2 Stream Processing Test Review Training Session Alexandr Raevskiy Video Wednesday, May 18, 2022
3 Alternative Class - Stream Processing Systems Test Review Tilo Video
4 Design a Ticketmaster Rajya Vardhan Mishra Video Friday, April 29, 2022
5 Scalable Systems 2 - Part 2 Niloy Mukherjee Video January 29, 2022
6 How to Choose Databases in System Design Interviews Rajya Vardhan Mishra Video
7 Scalable Systems - Live Scalable Systems Floater Session - Design Billionth Car Problem Rajya Vardhan Mishra Video April 2, 2022

Youtube Videos:

Machine Learning

Courses:

  1. Full Stack Deep Learning Spring 2021
  2. Rec Sys Slides
  3. https://docs.google.com/presentation/d/1qSOwBrjEmZTXQqNqB9XRAV7QsB6SJrLZ4pZBCkpvzyA/edit#slide=id.g1046ed9e5d0%5F0%5F18

Ranking

No Topic Author Type Other Details
1 Machine Learning Course - 23. ML Design Pattern - Ranking Geoff Hulten Video June 11, 2021
2 Stanford CS224N: NLP with Deep learning winter 2021 Stanford Video Jun 22, 2022
3 Stanford CS25- Transformers United Stanford Video Jul 12, 2022
4 Pascal Poupart Professor ML & NLP videos University of Waterloo Video
5 Excellent talk on Random Forest

Does RF require tuning

metric
Previous
Next

Last updated on May 15, 2022

Edit this page