Techletter #23 | May 17, 2023
I have been searching everywhere about what are some of the basic stuff that you need to know before you can start solving problems.
So here I have listed down some of the important topics, that we need to go through:
| Data Structures | Algorithms | Concepts |
|---|---|---|
| Linked Lists | Breadth-First Search | Bit Manipulation |
| Trees, Tries & Graphs | Depth-First Search | Memory |
| Stacks & Queues | Binary Search | Recursion |
| Heaps | Merge Sort | Dynamic Programming |
| ArrayLists | Quick Sort | Big O Time & Space |
| Hash Tables |
I give my credits to the book CTCI for the above table.
In the upcoming articles let us understand how to use and implement them one by one.
The above concepts are something like mandatory. But, before jumping into them, we need to understand a few other concepts as well like
-
Arrays, Strings, Hash Table, Searching & Sorting
-
Matrix, Linked List, Stack, Queue & Intervals
-
Tree, Graph, Heap & Trie
-
Dynamic Programming, Math, Binary & Geometry
These are some of the topics which we will be going through in the upcoming days.
Some of the best resources that I have found: