Roadmap › 0. Fundamentals › Step 2
DSA
Data Structures & Algorithms — How They Work Inside
Big-O and how to measure algorithms, arrays and dynamic arrays, linked lists, stacks and queues, hash tables (how hashing and collisions work), trees, binary search trees, heaps, tries, graphs, searching, sorting algorithms step by step, recursion, two pointers and sliding window, greedy, dynamic programming and backtracking — with C# code and where .NET and SQL Server use each one.
Interview priority:★ Must know High priority — asked in almost every interview, learn firstMedium asked regularlyLow good to know
Module 1: Measuring Algorithms
- 1.Big-O notation — time and space complexityBasic ★ Must know
Module 2: Linear Data Structures
- 2.Arrays and dynamic arrays (how List<T> grows)Basic ★ Must know
- 3.Linked lists, stacks and queuesBasic ★ Must know
- 4.Hash tables — how Dictionary works insideIntermediate ★ Must know
Module 3: Trees, Heaps and Graphs
- 5.Trees, binary search trees and traversalsIntermediate ★ Must know
- 6.Heaps and priority queues, triesIntermediate Medium
- 7.Graphs — BFS, DFS and shortest pathsIntermediate ★ Must know
Module 4: Searching and Sorting
- 8.Binary search and how sorting algorithms workBasic ★ Must know
Module 5: Problem-Solving Patterns
- 9.Recursion, two pointers and sliding windowIntermediate ★ Must know
- 10.Greedy, dynamic programming and backtrackingAdvanced ★ Must know
Next course in the roadmap: 3. Coding Round Practice (DSA in C#) →