studying_leetcode

Notes for technical interview

Setup

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.

Problem List

Arrays

LeetCode Number	Problem	Difficulty
1	Two Sum	${\color{green}Easy}$
121	Best Time to Buy and Sell Stock	${\color{green}Easy}$
238	Product of Array Except Self	${\color{orange}Medium}$
53	Maximum Subarray	${\color{orange}Medium}$
242	Valid Anagram	${\color{green}Easy}$
125	Valid Palindrome	${\color{green}Easy}$
3	Longest Substring Without Repeating Characters	${\color{orange}Medium}$

Hash Tables

LeetCode Number	Problem	Difficulty
1	Two Sum	${\color{green}Easy}$
383	Ransom Note	${\color{green}Easy}$

Recursion

LeetCode Number	Problem	Difficulty
22	Generate Parenthesis	${\color{orange}Medium}$
77	Combinations	${\color{orange}Medium}$
78	Subsets	${\color{orange}Medium}$

Sorting and Searching

LeetCode Number	Problem	Difficulty
704	Binary Search	${\color{green}Easy}$
33	Search in Rotated Sorted Array	${\color{orange}Medium}$

Matrices

LeetCode Number	Problem	Difficulty
73	Set Matrix Zeroes	${\color{orange}Medium}$
54	Spiral Matrix	${\color{orange}Medium}$

Linked Lists

LeetCode Number	Problem	Difficulty
206	Reverse Linked List	${\color{green}Easy}$
141	Linked List Cycle	${\color{green}Easy}$

Queue

LeetCode Number	Problem	Difficulty
225	Implement Stack Using Queues	${\color{green}Easy}$

Stacks

LeetCode Number	Problem	Difficulty
20	Valid Parentheses	${\color{green}Easy}$

Patterns

1. Two Pointers

1. Introduction

2. Fast & Slow Pointers

1. Introduction

3. Sliding Window

1. Introduction

4. Merging Intervals

1. Introduction

5. Cyclic Sort

1. Introduction

6. In-Place Reversal of a Linked List

1. Introduction

7. Stack

1. Introduction

8. Monotonic Stack

1. Introduction

9. Hash Maps

1. Introduction

10. Tree Breadth First Search

1. [Introduction]

11. Tree Depth First Search

1. [Introduction]

12. Graphs

13. Island (Matrix Traversal)

14. Two Heaps

15. Subsets

16. Modified Binary Search

17. Bitwise XOR

18. Top 'K' Elements

19. K-Way Merge

20. Greedy Algorithms

21. 0/1 Knapsack (Dynamic Programming)

22. Backtracking

23. Trie

24. Topological Sort (Graph)

25. Union Find

26. Ordered Set

27. Multi-Thread