Interview Prep - The Last Mile in C#

This course focuses on advanced and popular topics that are commonly encountered in technical interviews. You'll delve into hash tables, heaps, advanced graph algorithms, string searching algorithms, and bit manipulation techniques. Mastering these areas will provide you with a comprehensive skill set to tackle even the toughest coding interview questions.

Lessons and practices

Lesson 1: Introduction to Hash Tables and Dictionaries in C#

First Repeating String Element

Finding Nearby Duplicate Indices in Array

Sum Pairs Finder Using Dictionaries

Find Anagrams in a List of Strings

Counting Distinct Pairs with Specific Difference

Lesson 2: Heaps and Priority Queues in C#

Finding Top k Frequent Elements Using PriorityQueue in C#

Finding the k Shortest Strings in a List

Sort Integers by Absolute Difference from Median

Find the Median from a Stream of Integers Using Heaps

Lesson 3: Advanced Graph Algorithms in C#

Finding Connected Components in an Undirected Graph

Shortest Path in Grid Using Dijkstra's Algorithm

Topological Sort of a Directed Acyclic Graph (DAG)

Implement Dijkstra's Algorithm for Airport Distance Calculation

Finding the Optimal Introduction Path in a Social Network

Find the Shortest Path in a Grid Using Priority Queues

Lesson 4: String Searching Algorithms in C#

Implementing KMP String Search for Multiple Texts

Maximize Substring Occurrences

Count Palindromic Substrings

Longest Common Prefix Algorithm

Lesson 5: Bit Manipulation Techniques in C#

Check if a Number is a Power of Two Using Bit Manipulation

Identify Position of Lone Set Bit in Integer

Count the Number of Unset Bits

Bit Manipulation: Swap Odd and Even Bits

Calculate Bit Differences Using Bit Manipulation

Interested in this course? Learn and practice with Cosmo!

Practice is how you turn knowledge into actual skills.