Roadmap › 0. Fundamentals › Step 3
{}
Coding Round Practice (DSA in C#)
Big-O, arrays, strings, hashing, two pointers, sliding window, stacks, linked lists, trees, sorting, searching, recursion and the most-asked C# coding programs with solutions.
Interview priority:★ Must know High priority — asked in almost every interview, learn firstMedium asked regularlyLow good to know
Module 1: Foundations
- 1.Big-O notationBasic ★ Must know
- 2.String programsBasic ★ Must know
- 3.Number programsBasic ★ Must know
Module 2: Arrays and Hashing
- 4.Array programsBasic ★ Must know
- 5.Hash map pattern — Two Sum, frequency, groupingIntermediate ★ Must know
- 6.Two pointers and sliding windowIntermediate ★ Must know
Module 3: Stacks, Queues and Linked Lists
- 7.Stack problemsIntermediate ★ Must know
- 8.Linked list problemsIntermediate ★ Must know
- 9.LRU cache (design + code)Advanced Medium
Module 4: Sorting, Searching and Recursion
- 10.Binary searchBasic ★ Must know
- 11.Sorting algorithmsIntermediate ★ Must know
- 12.Recursion, memoisation and dynamic programmingIntermediate Medium
Module 5: Trees and Graphs
- 13.Binary trees and BSTIntermediate ★ Must know
- 14.Graph BFS and DFSAdvanced Medium
Next course in the roadmap: 4. Networking & Hosting — How a Website Works, End to End →