Code-Prodigy

A collection of most asked concepts in coding interviews and coding templates for practice

S. No.	Problem
1	Two pointer: one input, opposite ends
2	Two pointers: two input, exhaust both
3	Sliding window problem
4	Prefix sum
5	Efficient string building
6	Linked List : fast and slow pointer
7	Reverse a linked list
8	Number of subarray
9	Monotonic increasing stock
10	Binary Tree DFS (recursive)
11	Binary Tree DFS (iterative)
12	Binary Tree BFS
13	Graph DFS (recursive)
14	Graph DFS (iterative)
15	Graph BFS
16	Top K elements with heap
17	Binary Search
18	Binary Search : duplicate elements, left-most insertion point
19	Binary Search : duplicate elements, right-most insertion point
20	Binary Search : greedy problems - maximum
21	Binary Search : greedy problems - minimum
22	Dynamic programming: top-down memoization

Name		Name	Last commit message	Last commit date
Latest commit History 25 Commits
1.py		1.py
10.py		10.py
11.py		11.py
12.py		12.py
13.py		13.py
14.py		14.py
15.py		15.py
16.py		16.py
17.py		17.py
18.py		18.py
19.py		19.py
2.py		2.py
20.py		20.py
21.py		21.py
22.py		22.py
3.py		3.py
4.py		4.py
5.py		5.py
6.py		6.py
7.py		7.py
8.py		8.py
9.py		9.py
README.md		README.md

Provide feedback