Guided course · Coding and System-Design Practice in C#
DSA Coding Patterns in C#
Master the coding-round patterns in C# with runnable solutions: how to state and check Big-O by counting operations, the C# costs that change complexity (collections, LINQ, strings, Span), arrays and prefix sums, hashing with Dictionary and HashSet, two pointers, sliding windows, stacks and monotonic stacks, queues and deques, binary search including search on the answer, tree traversals and BSTs with SortedSet, graphs with BFS, DFS, topological sort, Dijkstra and union-find, heaps with PriorityQueue, and interval scheduling. Every solution runs on .NET 10 with test cases and real output, and selected complexity claims are illustrated with operation counts or timing measurements. 17 lessons including a 10-drill practice set and a 25-question mock interview.
Module 1 · Foundations
2 lessons · 34 minModule 2 · Linear Structures
6 lessons · 1 h 36 min- 03Arrays and Strings in C#: Prefix Sums, Kadane, In-Place Rotation and Counting Arrays (included with Full Access)16 min
- 04Hashing Patterns in C#: Dictionary, HashSet, CollectionsMarshal and Bad Hash Codes (included with Full Access)18 min
- 05Two Pointers in C#: Sorted Pairs, 3Sum, Container With Most Water and In-Place Partitioning (included with Full Access)15 min
- 06Sliding Window in C#: Fixed Windows, Grow-and-Shrink, Minimum Window Substring (included with Full Access)16 min
- 07Stacks in C#: Matching Brackets, Monotonic Stacks and Expression Evaluation (included with Full Access)16 min
- 08Queues and Deques in C#: Queue<T>, Two-Stack Queues and Sliding Window Maximum (included with Full Access)15 min
Module 3 · Searching and Trees
3 lessons · 50 min- 09Binary Search in C#: Lower Bound, Array.BinarySearch, Rotated Arrays and Searching the Answer (included with Full Access)17 min
- 10Tree Traversals in C#: Recursive and Iterative DFS, BFS Level Order and Stack Depth (included with Full Access)16 min
- 11Binary Search Trees in C#: Validation, LCA, Kth Smallest, Diameter and SortedSet (included with Full Access)17 min
Module 4 · Graphs, Heaps and Intervals
4 lessons · 1 h 8 min- 12Graphs with BFS and DFS in C#: Adjacency Lists, Grid Shortest Paths, Islands and Bipartite Checks (included with Full Access)17 min
- 13Topological Sort, Dijkstra with PriorityQueue and Union-Find in C# (included with Full Access)18 min
- 14Heaps with PriorityQueue in C#: Top K, Merge K Sorted, Running Median and API Pitfalls (included with Full Access)17 min
- 15Interval Problems in C#: Merge, Insert, Greedy Scheduling, Meeting Rooms and Sweep Lines (included with Full Access)16 min