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.
Overview
Syllabus
- Unit 1: Understanding Hash Tables and Hash Maps in TypeScript
- Find the First Repeating String in an Array
- Sum of Equal Pairs in Arrays
- Longest Subarray with a Given Sum in TypeScript
- Group Anagrams and Sort Lists
- Count Distinct Pairs with Given Difference
- Unit 2: Understanding Heaps and Priority Queues in TypeScript
- Most Frequent Elements with Heaps in TypeScript
- Find K Shortest Strings in a List Using Max-Heap
- Sort Array by Absolute Difference from Median Using Heap
- Finding the Median of a Stream of Numbers Using Heaps
- Unit 3: Advanced Graph Algorithms in TypeScript
- Counting Connected Components in an Undirected Graph
- Shortest Path Using Dijkstra's Algorithm in TypeScript
- Topological Sort for Directed Acyclic Graphs (DAG)
- Implement Dijkstra's Algorithm for Shortest Path Between Airports
- Finding the Longest Path in a Directed Acyclic Graph (DAG)
- Efficient Path to Potential Friend in a Social Network
- Find Shortest Path in a Grid
- Unit 4: String Searching Algorithms in TypeScript
- KMP String Search Implementation in TypeScript
- Max Substring Occurrences
- Count Palindromic Substrings of Specific Length
- Longest Common Prefix Finder
- Unit 5: Bit Manipulation Techniques in TypeScript
- Power of Two Check Using Bit Manipulation
- Find the Position of the Lone Set Bit in a Binary Number
- Count Unset Bits in a 32-bit Integer
- Swap Odd and Even Bits in a 32-bit Integer
- Count Different Bits Between Integers