Delve into the essentials of optimal programming algorithms involving HashMaps, HashSets, and two-pointer techniques. Enhance your skills in data structure optimization and streamline problem-solving methods.
Overview
Syllabus
- Lesson 1: Complexity Analysis: A Quick Reminder
- Summing Integers Between Two Numbers
- Finding Minimum Absolute Difference in an Array
- Closest Pair Mapping in Arrays
- Lesson 2: Optimizing Performance with HashSets in Python
- Finding Common Characters with Sets
- Efficient Presence Checking in Celestial Body Lists
- Movie Recommendation Algorithm with Sets
- Lesson 3: Optimizing Array Analysis with HashMaps
- String Partitioning by Unique Characters
- Character Removal for Minimal Word Count
- Finding the Minimum Distance Between Word Occurrences in a List
- Lesson 4: Efficient Pair Sum Identification with the Two-Pointer Technique
- Identifying Pairs with Zero Sum Using Two-Pointer Technique
- Finding Maximum Sum Subarray Using Two-pointer Technique
- Finding the Longest Subarray with a Specified Sum Using Two-Pointer Technique
- Lesson 5: Manipulating Arrays with Hashing and Two Pointers Technique
- Array Transformation Based on Closest Half-value Criterion
- Finding the Most Influential Person in a Network
- Longest Substring with At Most K Distinct Characters
Related Courses
-
Mastering Algorithms: HashMaps, Two Pointers, and Beyond in C++
-
Mastering Algorithms: HashMaps, Two Pointers, and Beyond in Java
-
Mastering Algorithms: Map, Set, and Two Pointers in JavaScript
-
Maximized Efficiency in Problem Solving Techniques in Python
-
Maximizing Efficiency in Problem-Solving Techniques in C++
-
Hashing, Dictionaries, and Sets in Java
