Patterns to master DSA
DS -> Data Structures; SP -> Sample Problems -> sliding window ( DS-> array, String, Hashtable; sample problems -> longest substring with k distinct characters, fruits into bakets) -> matrix travarsal (DS-> matrix, queue; sp -> number of islands, flood fill, cycle in a matrix) -> two pointer (DS->array, string, linked list; sp-> squaring a sorted array, dutch national flag problem, minimum window sort) -> fast and slow pointers (DS->array, string, linked list; sp-> middle of th linked list, happy number, cycle in a circular array) -> merge intervels (DS-> array, heap; sp-> conflict appointments, minimum meeting rooms) -> cyclic sort (DS-> array; sp-> find all missing numbers, find all duplicate numbers, find the first k misssing positive numbers) -> inplace reversal (linked list) ( DS -> linkedlist; sp-> reverse everyt k-element, rotate a LL) -> breadth first search(BFS) (DS->tree, graph, matrix; sp-> l...