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: Introduction to Associative Arrays in PHP
- Find the First Repeating String in an Array
- Determine Nearby Duplicate Indices
- Sum Pairs Problem in Arrays
- Find Anagrams in a List of Strings
- Count Distinct Pairs with Given Difference
- Unit 2: Efficient Use of Priority Queues in PHP with SplPriorityQueue
- Finding the K Most Frequent Elements in an Array
- Find K Shortest Strings in a List
- Sort by Absolute Difference from Median
- Finding Medians of Integer Stream
- Unit 3: Advanced Graph Algorithms: Implementing Dijkstra's Algorithm in PHP
- Counting Connected Components in an Undirected Graph
- Shortest Path using Dijkstra's Algorithm in a Grid
- Topological Sort of a Directed Acyclic Graph
- Implement Dijkstra’s Algorithm in PHP
- Finding the Longest Path in a Directed Acyclic Graph (DAG)
- Find Friends Efficiently in a Social Network Graph
- Finding the Shortest Path in a Grid
- Unit 4: String Searching Algorithms in PHP
- Implement KMP String Searching Algorithm in PHP
- Maximizing Substring Occurrences
- Count Palindromic Substrings in a Given Length
- Longest Common Prefix Finder
- Unit 5: Bit Manipulation Techniques in PHP
- Check if a Number is a Power of Two Using Bit Manipulation
- Find the Position of the Lone Set Bit
- Counting Unset Bits in a 32-bit Integer
- Swap Odd and Even Bits in an Integer
- Bit Difference Counter Task