Please enable JavaScript.
Coggle requires JavaScript to display documents.
Two Pointers, Stacks, Hashing II, Stacks 2, Linked List II, 1st June:…
-
-
-
Stacks 2
Remove duplicate adjascent characters. (Same as Parantheses Problems, Smallest Section Mirror Image)
-
-
-
-
-
-
Linked List II
Given a LL, Create a clone of a given LL with next and random pointers
-
-
-
Given a LL, find if it is Pallindrome or not
-
Given a LL, find the length of longest pallindrome
-
-
Queues Followup
Reverse First K Number
Move k elements into stack1 and n-k elements in stack2. Now pop element of stack1 and push to queue. Next POP element of stack2 and move to stack2 and then to queue
-
-
After adding a single character find the first non repeating character.
If no NON repeating character Print "#"
-
Given an integer array A, there is a sliding window of size 'k'. You have to find the maximum of all windows of size 'K'.
-
Heaps
Given N array, perform B negation on the given array
-
-
Min Heap :::
-Delete the min,
-Negate the Min,
-Insert the min
-
-
Given an Array, find the product of largest K elements in the array till 'i'.
Result should return an Array of length (N-K).
-
-
-
-
-
-
-