Domanda di colloquio di Sixt
1. LRU cache 2. Find subsequence(which has all unique chars )in given array 3. Find swapped node in given bst 4. Window sliding algorithms 5. Sort an array using stack. 6. Detect look in given linked list.
1. LRU cache 2. Find subsequence(which has all unique chars )in given array 3. Find swapped node in given bst 4. Window sliding algorithms 5. Sort an array using stack. 6. Detect look in given linked list.