Скачать или смотреть Delete Given Node In Linked List (Medium) + REVISE Arrays Part-IV

*REVISE*
1. 2Sum Problem: Nested Loop / Use Map / Two Pointer, start and end.
2. 4-Sum Problem: 4 Nested Loop / 2 Fixed Pointer + start and end pointer
3. Longest Consecutive Sequence: Nested Loop / Sort + check for next ele / Set + if(starting of sequence then, check if next element present) to prevent TLE
4. Largest Subarray with K sum: Nested Loop / Keep Count of sum till now + use map to hold sum till all index + in order to find high difference
5. Count number of subarrays with given XOR K: Keep map to store count of all possible combination for given XOR val. In order to see till current XOR are there any XOR which can be remove to find target
6. Longest Substring without repeat:
6.1 Nested Loop
6.2 Set, if duplicate found increment left pointer till duplicate removed from set
6.3 Map, store pos. of ele. If found duplicate, and prev. pos. greater left pointer update left pointer