Opening your learning path
Progress is saved as you study.
Opening your learning path
Progress is saved as you study.
The Hashing - Previously Seen / Existence Check pattern applies when you need the Hashing - Previously Seen / Existence Check technique within the Array/Matrix Manipulation Patterns pattern. Its time complexity is O(n) and space complexity O(n). Common variations are Product Except Self (Prefix/Suffix Products) and Merge Sorted Array (In-place from End).
Use hash sets for O(1) existence checks. Track previously seen elements to detect duplicates, find pairs, and validate sequences.
Hashing - Previously Seen / Existence Check is one of the 10 subpatterns of the Array/Matrix Manipulation Patterns pattern, which covers in-place operations, hashing, prefix sums, spiral traversal, and cyclic sort. The whole pattern is about 4 hours of study. This subpattern is a depth topic for once the core techniques are automatic.
Master array and matrix manipulation techniques including in-place rotation, spiral traversal, prefix/suffix products, and cyclic sort. Essential patterns for coding interviews at FAANG companies. Problems in this subpattern are usually searched for as hash set, contains duplicate, existence check, seen tracking, longest consecutive, leetcode 217.
Read the theory for Hashing - Previously Seen / Existence Check, then work the problems attached to it in the browser editor. Your solution runs against the problem's test cases, and the AI coach offers a hint about the technique you are missing rather than a finished solution. Progress is tracked per subpattern, so the Array/Matrix Manipulation Patterns tracker shows this one as covered once you have solved its problems.
Hashing - Previously Seen / Existence Check is one lesson in a 16-pattern DSA course. If you are preparing end to end, work the interview-critical patterns first and use the pattern sheet as the checklist; if you are here for one technique, the Array/Matrix Manipulation Patterns guide is the shortest path back to the rest of it.