Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Interview Prep - The Last Mile in Go

Go to class Write review

Overview

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.

Syllabus

Unit 1: Hash Tables and Maps in Go

Finding the First Repeating String in an Array
Detect Nearby Duplicate Indices in Array
Finding Pairs with Given Sum
Find and Group Anagrams in a List of Strings
Count Distinct Pairs with Specific Difference

Unit 2: Heaps and Priority Queues in Go

Finding the K Most Frequent Elements in an Array
Finding K Shortest Strings from a List
Sort Integers by Absolute Difference from Median Using Heap
Stream Median Calculation in Go

Unit 3: Advanced Graph Algorithms in Go

Finding Connected Components in an Undirected Graph
Shortest Path using Dijkstra's Algorithm in a Grid
Topological Sort on Directed Acyclic Graph (DAG)
Implement Dijkstra’s Algorithm for Shortest Path in Go
Longest Path in a Directed Acyclic Graph
Shortest Path in a Social Network Graph
Find the Shortest Path in a Grid with Obstacles

Unit 4: String Searching Algorithms in Go

KMP String Searching in Multiple Texts
Max Substring Occurrences Algorithm in Go
Count Palindromic Substrings in Go
Longest Common Prefix Problem in Go

Unit 5: Bit Manipulation Techniques in Go

Check if a Number is a Power of Two Using Bit Manipulation
Find Position of Lone Set Bit in Integer
Count Unset Bits in a 32-bit Integer
Swap Odd and Even Bits
Calculate Bit Differences Between Integers

Reviews

Start your review of Interview Prep - The Last Mile in Go