Notes for technical interview
We will actually start with specific data structures and break into patterns via Data structures/algorithm tech handbook and then using Neetcode as hollistic reference. Then we will add Neetcode afterwards. A master list of all the leetcode problems completed and organized afterwards by data structures.
LeetCode Number | Problem | Difficulty |
---|---|---|
1 | Two Sum | |
121 | Best Time to Buy and Sell Stock | |
238 | Product of Array Except Self | |
53 | Maximum Subarray | |
242 | Valid Anagram | |
125 | Valid Palindrome | |
3 | Longest Substring Without Repeating Characters |
LeetCode Number | Problem | Difficulty |
---|---|---|
1 | Two Sum | |
383 | Ransom Note |
LeetCode Number | Problem | Difficulty |
---|---|---|
22 | Generate Parenthesis | |
77 | Combinations | |
78 | Subsets |
LeetCode Number | Problem | Difficulty |
---|---|---|
704 | Binary Search | |
33 | Search in Rotated Sorted Array |
LeetCode Number | Problem | Difficulty |
---|---|---|
73 | Set Matrix Zeroes | |
54 | Spiral Matrix |
LeetCode Number | Problem | Difficulty |
---|---|---|
206 | Reverse Linked List | |
141 | Linked List Cycle |
LeetCode Number | Problem | Difficulty |
---|---|---|
225 | Implement Stack Using Queues |
LeetCode Number | Problem | Difficulty |
---|---|---|
20 | Valid Parentheses | |
232 | Implement Queue Using Stacks |
- [Introduction]
- [Introduction]