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
- Lesson 1: Understanding and Using Hash Tables in JavaScript
- First Repeating Element in an Array
- Find Pairs with Given Sum in Two Arrays
- Finding longest subarray with a given sum
- Finding Anagrams in a List of Strings
- Count Pairs with Specific Difference
- Lesson 2: Heaps and Priority Queues in JavaScript
- K Most Frequent Elements in an Array
- Finding K Shortest Strings in a List
- Sort Integers by Absolute Difference from Median
- Finding Stream Medians Using Heaps
- Lesson 3: Advanced Graph Algorithms with Dijkstra’s Algorithm in JavaScript
- Counting Connected Components in an Undirected Graph
- Finding the Shortest Path in a Grid Using Dijkstra's Algorithm
- Topological Sort of a Directed Acyclic Graph in JavaScript
- Implementing Dijkstra's Algorithm for Shortest Path in JavaScript
- Finding the Longest Path in a Directed Acyclic Graph (DAG)
- Finding a Friend in a Social Network Graph Using Dijkstra's Algorithm
- Shortest Path in Grid
- Lesson 4: String Searching Algorithms in JavaScript
- Implement KMP String Searching Algorithm to Find Pattern in List of Texts
- Maximum Substring Occurrences
- Counting Palindromic Substrings
- Find the Longest Common Prefix
- Lesson 5: Bit Manipulation Techniques in JavaScript
- Check if a Number is a Power of Two Using Bit Manipulation
- Finding the Lone Set Bit in a Binary Number
- Counting Unset Bits in a 32-bit Integer
- Swapping Odd and Even Bits
- Counting Bit Differences Between Two Integers
