- [ ] introduction.md - [x] array.md - [x] string.md - [x] sorting-searching.md - [x] recursion.md - [x] hash-table.md - [x] linked-list.md - [x] stack.md - [x] queue.md - [x] matrix.md - [x] graph.md - [x] interval.md - [x] tree.md - [x] heap.md - [x] trie.md - [x] geometry.md - [x] math.md - [x] dynamic-programming.md - [x] binary.md ## Introduction TODO ## Implementations | Language | API | | ---------- | ---- | | C++ | []() | | Java | []() | | Python | []() | | JavaScript | []() | ## Time complexity TODO | Operation | Big-O | Note | | --------- | ----- | ---- | | Access | O(n) | | | Search | O(n) | | | Insert | O(1) | | | Remove | O(1) | | ## Learning resources TODO ## Corner cases TODO ## Things to look out for during interviews TODO ## Techniques TODO ## Recommended questions TODO