dsa2 min read
Isomorphic Strings [Easy] — Two-Way Character Mapping
Check if two strings are isomorphic by maintaining bidirectional character mappings to ensure a consistent one-to-one correspondence.
Read →
All Posts
1276 articles
dsa1 min read
Word Pattern [Easy] — Bijective Two-Way Map
Check if a string follows a given pattern using bidirectional mapping between pattern chars and words.
Read →
dsa2 min read
Happy Number [Easy] — HashSet Cycle Detection
Determine if a number is happy by repeatedly summing digit squares and detecting cycles using a HashSet or Floyd algorithm.
Read →
dsa1 min read
Contains Duplicate II [Easy] — Index Window HashMap
Find if any two duplicate elements are within k indices of each other using a HashMap of last-seen positions.
Read →
dsa1 min read
Find Common Characters [Easy] — Min Frequency Intersection
Find characters common to all strings in a list by intersecting their frequency arrays with element-wise minimum.
Read →
Page 58 of 256