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

Getting Deep into Complex Algorithms for Interviews with Go

Go to class Write review

Overview

In this course, you'll delve deeply into algorithms and data structures, which are key topics in technical interviews. You'll tackle problems involving linked lists, binary trees, dynamic programming, and graph algorithms. Understanding these advanced topics will equip you with the tools needed to solve complex problems efficiently.

Syllabus

Unit 1: Linked List Operations in Go

Determine if a Linked List is a Palindrome
Swap Nodes in a Linked List
Remove Duplicates from Unsorted Linked List
Rotate Linked List by K Places
Detect Cycle in Linked List

Unit 2: Binary Tree Traversals in Go

Postorder Traversal of a Binary Tree in Go
Preorder Traversal Algorithm in Go
Second Smallest Value in Binary Tree
Reverse a Binary Tree in Go
Check if a Binary Tree is a Binary Search Tree

Unit 3: Dynamic Programming Basics in Go

Calculate the N-th Fibonacci Number Using Dynamic Programming in Go
Climbing Stairs Problem in Go
Minimum Steps to Transform Zero to N Using Addition and Multiplication
Coin Change Ways Calculation
Minimal Number of Perfect Squares Sum

Unit 4: Graph Algorithms Implementation in Go

Shortest Distance Using Breadth-First Search in Graphs
Implement BFS to Find Vertices Within Distance
Shortest Route with Obstacles Using BFS
Shortest Path in a Binary Matrix Using BFS
Chess Knight Minimum Moves

Unit 5: Advanced Recursion Techniques in Go

Generating Distinct Permutations Using Backtracking in Go
Generate and Sort All Character Combinations Using Backtracking
Generate Valid Parentheses Combinations Using Backtracking
Letter Case Combinations in a String
Generate All Combinations of Characters in Strings Using Backtracking

Reviews

Start your review of Getting Deep into Complex Algorithms for Interviews with Go