155 Coding Interview Questions

155 Coding Interview Questions

English | MP4 | AVC 1920×1080 | AAC 48KHz 2ch | 85h 32m | 19.9 GB

The practice you need to ace the coding interviews.

If you want to ace the coding interviews, being well-versed in all common data structures and popular problem-solving methods is paramount. With 155 questions spanning 15 categories and 4 difficulty levels, we’ve got you covered.

The truth is that interview questions and algorithms are difficult. Even more difficult is trying to understand the inner workings of a complex algorithm from a book or from a poorly thought-out video shot on your grandma’s camera.

Algoexpert is the leading online interview preparation platform.

Table of Contents

1 A Algorithm from Clément Mihailescu
2 Airport Connections from Clément Mihailescu
3 All Kinds Of Node Depths from Clément Mihailescu
4 Ambiguous Measurements.mp4 from Clément Mihailescu
5 Apartment Hunting from Clément Mihailescu
6 Array Of Products from Clément Mihailescu
7 Balanced Brackets from Clément Mihailescu
8 Binary Search from Clément Mihailescu
9 Binary Tree Diameter from Clément Mihailescu
10 Boggle Board from Clément Mihailescu
11 Branch Sums from Clément Mihailescu
12 Breadth-first Search from Clément Mihailescu
13 BST Construction from Clément Mihailescu
14 BST Traversal from Clément Mihailescu
15 Bubble Sort from Clément Mihailescu
16 Caesar Cipher Encryptor from Clément Mihailescu
17 Calendar Matching from Clément Mihailescu
18 Class Photos from Clément Mihailescu
19 Continuous Median from Clément Mihailescu
20 Count Inversions.mp4 from Clément Mihailescu
21 Cycle In Graph from Clément Mihailescu
22 Depth-first Search from Clément Mihailescu
23 Detect Arbitrage.mp4 from Clément Mihailescu
24 Dijkstra’s Algorithm from Clément Mihailescu
25 Disk Stacking from Clément Mihailescu
26 Find Closest Value In BST from Clément Mihailescu
27 Find Kth Largest Value In BST from Clément Mihailescu
28 Find Loop from Clément Mihailescu
29 Find Nodes Distance K from Clément Mihailescu
30 Find Successor from Clément Mihailescu
31 Find Three Largest Numbers from Clément Mihailescu
32 First Duplicate Value from Clément Mihailescu
33 First Non-Repeating Character.mp4 from Clément Mihailescu
34 Flatten Binary Tree from Clément Mihailescu
35 Four Number Sum from Clément Mihailescu
36 Generate Div Tags from Clément Mihailescu
37 Generate Document from Clément Mihailescu
38 Group Anagrams from Clément Mihailescu
39 Heap Sort from Clément Mihailescu
40 Height Balanced Binary Tree from Clément Mihailescu
41 Index Equals Value from Clément Mihailescu
42 Insertion Sort from Clément Mihailescu
43 Interweaving Strings from Clément Mihailescu
44 Invert Binary Tree from Clément Mihailescu
45 Iterative In-order Traversal from Clément Mihailescu
46 Kadane’s Algorithm from Clément Mihailescu
47 Knapsack Problem from Clément Mihailescu
48 Knuth–Morris–Pratt from Clément Mihailescu
49 Laptop Rentals.mp4 from Clément Mihailescu
50 Largest Range from Clément Mihailescu
51 Largest Rectangle Under Skyline.mp4 from Clément Mihailescu
52 Levenshtein Distance from Clément Mihailescu
53 Line Through Points from Clément Mihailescu
54 Linked List Construction from Clément Mihailescu
55 Linked List Palindrome from Clément Mihailescu
56 Longest Balanced Substring from Clément Mihailescu
57 Longest Common Subsequence from Clément Mihailescu
58 Longest Increasing Subsequence from Clément Mihailescu
59 Longest Palindromic Substring from Clément Mihailescu
60 Longest Peak from Clément Mihailescu
61 Longest String Chain from Clément Mihailescu
62 Longest Substring Without Duplication from Clément Mihailescu
63 Lowest Common Manager from Clément Mihailescu
64 LRU Cache from Clément Mihailescu
65 Max Path Sum from Clément Mihailescu
66 Max Profit With K Transactions from Clément Mihailescu
67 Max Subset Sum No Adjacent from Clément Mihailescu
68 Max Sum Increasing Subsequence from Clément Mihailescu
69 Maximum Sum Submatrix.mp4 from Clément Mihailescu
70 Merge Linked Lists from Clément Mihailescu
71 Merge Overlapping Intervals.mp4 from Clément Mihailescu
72 Merge Sort from Clément Mihailescu
73 Merge Sorted Arrays from Clément Mihailescu
74 Min Heap Construction from Clément Mihailescu
75 Min Height BST from Clément Mihailescu
76 Min Max Stack Construction from Clément Mihailescu
77 Min Number Of Coins For Change from Clément Mihailescu
78 Min Number Of Jumps from Clément Mihailescu
79 Min Rewards from Clément Mihailescu
80 Minimum Area Rectangle from Clément Mihailescu
81 Minimum Waiting Time from Clément Mihailescu
82 Monotonic Array from Clément Mihailescu
83 Move Element To End from Clément Mihailescu
84 Multi String Search from Clément Mihailescu
85 Node Depths from Clément Mihailescu
86 Non-Constructible Change from Clément Mihailescu
87 Nth Fibonacci from Clément Mihailescu
88 Number Of Binary Tree Topologies from Clément Mihailescu
89 Number Of Ways To Make Change from Clément Mihailescu
90 Number Of Ways To Traverse Graph from Clément Mihailescu
91 Numbers In Pi from Clément Mihailescu
92 Palindrome Check from Clément Mihailescu
93 Palindrome Partitioning Min Cuts from Clément Mihailescu
94 Pattern Matcher from Clément Mihailescu
95 Permutations from Clément Mihailescu
96 Phone Number Mnemonics from Clément Mihailescu
97 Powerset from Clément Mihailescu
98 Product Sum from Clément Mihailescu
99 Quick Sort from Clément Mihailescu
100 Quickselect from Clément Mihailescu
101 Rearrange Linked List from Clément Mihailescu
102 Reconstruct BST from Clément Mihailescu
103 Rectangle Mania from Clément Mihailescu
104 Remove Duplicates From Linked List from Clément Mihailescu
105 Remove Islands from Clément Mihailescu
106 Remove Nth Node From End from Clément Mihailescu
107 Reverse Linked List from Clément Mihailescu
108 Reverse Words In String from Clément Mihailescu
109 Right Sibling Tree from Clément Mihailescu
110 Right Smaller Than from Clément Mihailescu
111 River Sizes from Clément Mihailescu
112 Run-Length Encoding from Clément Mihailescu
113 Same BSTs from Clément Mihailescu
114 Search For Range from Clément Mihailescu
115 Search In Sorted Matrix from Clément Mihailescu
116 Selection Sort from Clément Mihailescu
117 Shift Linked List from Clément Mihailescu
118 Shifted Binary Search from Clément Mihailescu
119 Shorten Path from Clément Mihailescu
120 Single Cycle Check from Clément Mihailescu
121 Smallest Difference from Clément Mihailescu
122 Smallest Substring Containing from Clément Mihailescu
123 Solve Sudoku from Clément Mihailescu
124 Sort K-Sorted Array from Clément Mihailescu
125 Sorted Squared Array from Clément Mihailescu
126 Spiral Traverse from Clément Mihailescu
127 Square Of Zeroes from Clément Mihailescu
128 Staircase Traversal from Clément Mihailescu
129 Subarray Sort from Clément Mihailescu
130 Suffix Trie Construction from Clément Mihailescu
131 Sum Of Linked Lists from Clément Mihailescu
132 Sunset Views from Clément Mihailescu
133 Tandem Bicycle.mp4 from Clément Mihailescu
134 Task Assignment from Clément Mihailescu
135 Three Number Sort from Clément Mihailescu
136 Three Number Sum from Clément Mihailescu
137 Topological Sort from Clément Mihailescu
138 Tournament Winner from Clément Mihailescu
139 Two Number Sum from Clément Mihailescu
140 Underscorify Substring from Clément Mihailescu
141 Valid IP Addresses from Clément Mihailescu
142 Valid Starting City from Clément Mihailescu
143 Validate BST from Clément Mihailescu
144 Validate Subsequence from Clément Mihailescu
145 Validate Three Nodes.mp4 from Clément Mihailescu
146 Water Area from Clément Mihailescu
147 Waterfall Streams from Clément Mihailescu
148 Youngest Common Ancestor from Clément Mihailescu
149 Zigzag Traverse from Clément Mihailescu
150 Zip Linked List from Clément Mihailescu

Homepage