Round 1
You are at a railway junction where K trains are arriving. Each train has coaches sorted by passenger age (youngest → oldest).
Your job is to create one long train that is still sorted, by combining all K trains.
Input:
Train A1 → 4 → 7
Train B2 → 5 → 8
Train C3 → 6 → 9
Output: 1 → 2 → 3 → 4 → 5 → 6 → 7 → 8 → 9
swap two bits in a given integer
Input: n = 28, p1 = 0, p2 = 3
Output: 21
Explanation: 28 in binary is 11100. If we swap 0'th and 3rd digits, we get 10101 which is 21 in decimal.
Find the single non-repeating element in an array where every other element repeats twice.
Input: arr = [4, 1, 2, 1, 2]
Output: 4
Find two non-repeating elements in an array where every other element repeats twice.
Input: arr = [2, 4, 7, 9, 2, 4]
Output: (7, 9)
Round 2
Skipping one node Every time, delete 1, 2, 3, … number of nodes from a single linked list
Input: 1,2,3,4,5,6,7,8,9
Output: 2,5,9
Given two integers x and y (x > y)represented in binary format, find the number of times bit pattern in y appears in bit pattern of x
Input: a=21, b=5
Output: 2
Explanation: 21->10101 5->101
Also had an in-depth discussion about the resume and past experiences.