1:) Backspace String Compare 2:) Given a singly linked list L0 -> L1 -> … -> Ln-1 -> Ln. Rearrange the nodes in the list so that the new formed list is : L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 … 3:) Count number of nodes that are less than k unit from the binary tree(parent pointer is not given) 4:) HTTP vs HTPPS, DNS, 4-way Handshaking, TCP vs UDP. 5:) Indexing, How to store the password in DB? 6:) Mutex Vs Semaphore. 7:) Smart Pointer