Top AI Repos — open-source AI, indexed and scored
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Welcome to the SDE Interview Preparation Roadmap! This repository is not just about my personal journey; it's a collaborative space for collective learning. As I prepare for Software Development Engineer (SDE) interviews, I've created a comprehensive checklist to guide my preparation.
| Date | Stars |
|---|---|
| 2026-07-24 | 1993 |
| 2026-07-25 | 2002 |
| 2026-07-28 | 2002 |
| 2026-07-30 | 2002 |
| 2026-08-06 | 2002 |
Today
— stars today
This week
— stars this week
This month
— stars this month
Momentum
0.0
growth rate 0.00%/day
# <span style="color:darkslategray;">SDE Interview and Prep Roadmap</span>
## <span style="color:darkolivegreen;">Overview</span>
Welcome to the SDE Interview Preparation Roadmap! This repository is not just about my personal journey; it's a collaborative space for collective learning. As I prepare for Software Development Engineer (SDE) interviews, I've created a comprehensive checklist to guide my preparation. By sharing this roadmap, I aim to foster a community of learners where we can all grow together. It covers various domains including **Data Structures, Algorithms, System Design, Operating Systems, Networking, Databases, Programming Languages and Concepts, System Architecture, Problem-solving and Coding, as well as Behavioral and Soft Skills**.
## <span style="color:darkolivegreen;">Printable PDF Version of Checklist - [Click Here](/SDE-Interview-and-Prep-Roadmap.pdf)</span>
## <span style="color:darkolivegreen;">**Domains and Topics**</span>
<details>
<summary>1. <span style="color:green;">Data Structures</span></summary>
- [ ] [**Arrays**](./Data%20Structures/Arrays.md)
- [ ] [**Linked Lists**](./Data%20Structures/LinkedList.md)
- [ ] Singly linked lists
- [ ] Circularly linked lists
- [ ] Lock-free linked lists
- [ ] Doubly linked lists
- [ ] Circular doubly linked lists
- [ ] Circular linked lists
- [ ] Skip lists
- [ ] Unrolled linked lists
- [ ] **Stacks**
- [ ] Implementations using arrays and linked lists
- [ ] Array-based stack
- [ ] Linked list-based stack
- [ ] Applications (e.g., expression evaluation, backtracking)
- [ ] Priority stacks
- [ ] **Queues**
- [ ] Implementations (e.g., array-based, linked list-based, priority queues)
- [ ] Circular queue
- [ ] Double-ended queue (Deque)
- [ ] Applications (e.g., BFS, job scheduling)
- [ ] **Trees**
- [ ] Binary Trees
- [ ] Full binary tree
- [ ] Complete binary tree
- [ ] Perfect binary tree
- [ ] Binary Search Trees (BST)
- [ ] Self-balancing BST
- [ ] Scapegoat tree
- [ ] Tango tree
- [ ] AVL Trees
- [ ] Red-Black Trees
- [ ] Splay Trees
- [ ] B-Trees
- [ ] Heap Trees (min-heap, max-heap)
- [ ] Trie
- [ ] Radix Trees
- [ ] **Graphs**
- [ ] Representations (adjacency matrix, adjacency list)
- [ ] Edge list
- [ ] Incidence matrix
- [ ] Traversal algorithms (DFS, BFS)
- [ ] Weighted graphs
- [ ] Directed graphs
- [ ] Acyclic graphs
- [ ] Bipartite graphs
- [ ] Spanning trees (Minimum Spanning Tree, Maximum Spanning Tree)
- [ ] Graphs with special properties (e.g., planar graphs, Eulerian graphs)
- [ ] **Hash Tables**
- [ ] Collision resolution techniques (chaining, open addressing)
- [ ] Hash functions
- [ ] Perfect Hashing
- [ ] Cuckoo Hashing
- [ ] Robin Hood Hashing
- [ ] Count-Min Sketch
- [ ] Bloom Filters
</details>
<details>
<summary>2. <span style="color:green;">Algorithms</span></summary>
- [ ] **Sorting Algorithms**:
- [ ] Bubble Sort
- [ ] Selection Sort
- [ ] Insertion Sort
- [ ] Merge Sort
- [ ] Quick Sort
- [ ] Heap Sort
- [ ] Shell Sort
- [ ] Counting Sort
- [ ] Radix Sort
- [ ] Bucket Sort
- [ ] Comb Sort
- [ ] Cocktail Shaker Sort
- [ ] Tim Sort
- [ ] Cycle Sort
- [ ] Pancake Sort
- [ ] Bitonic Sort
- [ ] Gnome Sort
- [ ] Strand Sort
- [ ] **Searching Algorithms**:
- [ ] Linear Search
- [ ] Binary Search
- [ ] Depth-First Search (DFS)
- [ ] Breadth-First Search (BFS)
- [ ] Jump Search
- [ ] Interpolation Search
- [ ] Exponential Search
- [ ] Fibonacci Search
- [ ] Ternary Search
- [ ] Hashing (Hash Table)
- [ ] **Dynamic Programming**
- [ ] Memoization
- [ ] Tabulation
- [ ] LongeExcerpt of 20,383 characters
Read on GitHub
20
1
1
1
Would you bet a product on this? Bounded 0–100 and slow moving.
matched fp:ea4cd66596286512, topic:roadmap, name:roadmap, desc:roadmap