Q: Construct a stack using queues. || Q: Explain the time complexities for functionalities of some inbuilt data structures in C++ (eg. set, priority_queue, map, unordered_map) and how to decide which one to use. || Q: Choose the largest subsequence of an array such that there are at most k adjacent pairs of numbers where one number is not equal to the other. || Q: Traverse an undirected connected graph (vertices are 1, 2, ... n) starting from any vertex and when you visit a node for the first time, push it to the end of a list. Find the lexicographically highest list among all such lists.
