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.
Overview
Syllabus
- Unit 1: Complexity Analysis and Optimization Techniques Using Kotlin
- Sum of Integerland Road Sections
- Minimum Absolute Difference in Kotlinia
- Optimized Array Replacement
- Unit 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
- Unit 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
- Unit 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
- Unit 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