DSA Cracker Sheet - problem solving on data structures and algorithms
| Topics | Question count |
|---|---|
| Array | 36 questions |
| Matrix | 10 questions |
| String | 43 questions |
| Searching & sorting | 36 questions |
| Linked list | 36 questions |
| Binary trees | 35 questions |
| Binary search trees | 22 questions |
| Greedy | 35 questions |
| Backtracking | 19 questions |
| Stacks & Queues | 38 questions |
| Heap | 18 questions |
| Graph | 44 questions |
| Trie | 5 questions |
| Dynamic Programming | 60 questions |
| Bit Manipulation | 10 questions |
- Applied two pointers approach for swapping at both ends, shrinking the window for each traversal
- Applied Iteration and Recursion to reverse the array
- Applied Control flow: for, while for loops and if, switch for decision making
- Applied Linear search to find maximum and minimum in just one iteration
- Applied Iteration and Recursion to find maximum and minimum in the array
- Applied Control flow: for for loop and if, switch for decision making
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent