Introduction

This is a repository of many LeetCode problems and their solutions. This is mainly useful to revise the concepts while trying to practice for coding interviews again. Each of the solutions consists of atleast one approach to solve the problem.

Current status

As of now only one approach has been coded for most problems and the language of choise is python. But this is a work in progress and more coded solutions will be added eventually.

Topics and problems under each topic

This collection of solutions is mainly from software engineering interviews POV. Hence the topics those are most frequently covered in the interviews are solved first.

1. Arrays
2. Back tracking
3. Binary Search
4. DFS and BFS
5. Dynamic programming
6. Graphs
7. Heaps
8. Intervals
9. Linked Lists
10. Queue
11. Sorting
12. Stacks
13. Strings
14. Trees
15. Trie

TODO

1. Some of these topics might be dense than the other for e.g. Arrays vs intervals. We can later seggregate them into subtopics as well.
2. There is no difficulty tag associated as of now to each problem.
3. The sequence of problems in the notebooks are purely based on the sequence in which each problem as solved and does not follow any pattern best for revision.