Mastering Algorithms: HashMaps, Two Pointers, and Beyond

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

Lessons and practices

Lesson 1: Complexity Analysis and Optimization Techniques Using Kotlin

Sum of Integerland Road Sections

Minimum Absolute Difference in Kotlinia

Optimized Array Replacement

Lesson 2: Optimizing Data Sequence Intersection with Kotlin's Collections

Common Characters in String and List

Find Common Galaxies Using HashSet in Kotlin

Recommend Unwatched Popular Movies

Lesson 3: Efficient List Manipulation and Optimization with Kotlin's HashMap

Partition Lexiconia's Scroll into Chapters

Maximize Broken Words by Removing One Character

Finding Shortest Distances Between Word Occurrences

Lesson 4: Using the Two-Pointer Technique for Pair Sum Problems in Kotlin

Finding Zero-Sum Chocolate Pairs using Two-Pointer Technique

Maximum Subarray Sum with Two Pointers

Finding the Longest Subarray with a Given Sum using Two-Pointer Technique

Lesson 5: Mastering Array Manipulation and the Two-Pointer Technique in Kotlin

Find Closest Numbers in Arrays

Network Influencer Identification in Two Degrees

Longest Substring with K Distinct Characters

Interested in this course? Learn and practice with Cosmo!

Practice is how you turn knowledge into actual skills.