Q. Implement code such that two asynchronous tasks pass on control to each other and execute their tasks. Task 1 does something and the control should pass on to Task 2 while Task 1 waits. Once Task 2 completes, control passes to Task 1 while Task 2 waits and the cycle repeats.
Q. Find the Largest Sum Contiguous Subarray along with its starting and ending index positions.
Some Include: Q: BST from Inorder / Postorder Q: Valid Parentheses Q: String to Int (stoi) Q: Explain thread lifecycle. Q: Explain always available servers (Paxos, Raft Consensus) Q: Explain processes vs threads
It was DS algo but most of the questions were asked on Oops It was my initial stage of job change, wasn't prepared well in oops Couldn't make it
Round2- (Technical Interview) Asked two coding questions 1. simple loop based question 2. merge two sorted array with O(1) extra space
Java questions:static keyword,OOPs concept,synchronization
1. Identify linked list is circular 2. Traverse binary search tree in INORDER without using recursion and stack. 3. Questions on oops and basic java 4. If you have to transfer a file from one server to other, how to do you protect the file contents.
Algorithms, core java, puzzle, Design, scalability. HashMap related, time complexity, spiral printing of a matrix, singleton design pattern, puzzles etc, Arrays, quicksort.
Kernel controls 3 major components on the motherboard exclusively. what are the 3 components?
Interview was mainly moderate difficult String related operations (similar to the ones found on CareerCup), standard questions on Java, Selenium, Networking. A couple of testing and test case scenario related questions, which were answerable.
Viewing 3531 - 3540 interview questions