Interview Prep - The Last Mile in Ruby

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

First Repeating Element in Array

Nearby Duplicate Detection in Array

Finding Number of Sum Pairs in Arrays

Anagram Grouping Task

Count Distinct Pairs with Specific Difference

Lesson 2: Efficient Data Management with Priority Queues

Most Frequent Elements in an Array

Find K Shortest Strings in an Array

Sort Arrays by Absolute Difference from Median

Find Stream Median Using Priority Queues

Lesson 3: Advanced Graph Algorithms

Count Connected Components in an Undirected Graph

Shortest Path Using Dijkstra's Algorithm in a Grid

Topological Sort Implementation

Dijkstra's Algorithm for Shortest Path Calculation

Finding the Longest Path in a Directed Acyclic Graph (DAG)

Find the Shortest Friend Path in a Social Network Graph

Find the Shortest Path in a Grid

Lesson 4: String Searching Algorithms

KMP String Searching Algorithm Implementation

Maximize Substring Occurrences

Counting Palindromic Substrings

Longest Common Prefix Task

Lesson 5: Bit Manipulation Techniques

Power of Two Check Using Bit Manipulation

Find Lone Set Bit in Integer

Count Unset Bits in a 32-bit Integer

Swap Odd and Even Bits in an Integer

Bit Difference Counter Task

Interested in this course? Learn and practice with Cosmo!

Practice is how you turn knowledge into actual skills.