Mastering common DSA patterns helps in quickly recognizing and applying strategies during interviews or contests.Pattern 1: Sliding Window involves recognizing subarrays/substrings and using structures like Arrays, Strings, HashMaps/Sets.Pattern 2: Two Pointers is used in sorted arrays or pair-based problems to reduce nested loops to O(n).Pattern 3: Fast & Slow Pointers are employed in linked lists to detect cycles or repeated states.Pattern 4: Merge Intervals is applicable when dealing with intervals or ranges for tasks like scheduling or booking overlaps.Pattern 5: Cyclic Sort is useful for finding missing/duplicate elements in arrays with a known range without extra space.Pattern 6: Binary Search efficiently finds positions or values in sorted arrays or ranges with variations like Lower/Upper Bound.Pattern 7: Special Array Sorting optimizes sorting for arrays with specific structures like 0s/1s/2s or bitonic sequences.Pattern 8: Hash Maps in Arrays/Linked Lists assist in tasks like frequency counting, prefix sums, or constant time lookups.Pattern 9: Prefix & Suffix Sum aids in sum calculations between indices or partitioning based on sums.