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

CodeSignal

Mastering Algorithms: Maps, Two Pointers, and Beyond in Go

via CodeSignal

Go to class Write review

Overview

Dive into the key algorithms involving maps, sets, and two-pointer techniques. This course will enhance your skills in optimizing data structures and problem-solving methods.

Syllabus

  • Unit 1: Introduction to Complexity Analysis and Optimization in Go
    • Sum of Integer Points Between Two Towns
    • Find Minimum Absolute Difference in Array
    • Optimized Array Replacement Based on Closest Neighbor
  • Unit 2: Effective Set Operations with Go Slices and Maps
    • Finding Common Characters Between String and Array
    • Check Celestial Body Presence in Lists Using Maps in Go
    • Book Recommendation System in Go
  • Unit 3: Efficient Block Minimization with Go Maps and Slices
    • Partition String into Substrings by Unique Letters
    • Character Removal to Maximize Unique Broken Words
    • Calculate Minimum Distances in Word List
  • Unit 4: Applying the Two-Pointer Technique for Pair Sums in Go
    • Finding Chocolate Pairs with Zero Sweetness Sum in Go
    • Finding Maximum Sum Subarray with Two-Pointer Technique
    • Finding the Longest Subarray with a Given Sum in Go
  • Unit 5: Efficient Pair Replacement Using Slices and Two-Pointer Technique in Go
    • Find Closest Numbers in Array to Form Resulting Sequence
    • Finding the Most Influential Person within Two Degrees of Connection
    • Longest Substring with K Distinct Characters in Go

Reviews

Start your review of Mastering Algorithms: Maps, Two Pointers, and Beyond in Go

Go to class

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.