Interview Prep - The Last Mile in TypeScript
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
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
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
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
KMP String Search Implementation in TypeScript
Max Substring Occurrences
Count Palindromic Substrings of Specific Length
Longest Common Prefix Finder
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
Interested in this course? Learn and practice with Cosmo!
Practice is how you turn knowledge into actual skills.