Azuga Telemetics Interview Experience | Set 1

1st round: Written test of 30 mins (goes on for 1 hr): I got Question paper (Set #6)- Given an array, you have to find out that one element that is repeating odd times, r...

1 st round: Written test of 30 mins (goes on for 1 hr): I got Question paper (Set #6)- Given an array, you have to find out that one element that is repeating odd times, rest all repeat even number of times (

Solution : Use XOR for it or sort and use 2 pointers) Inorder traversal of tree Other Sets basically had few simple SQL queries or sorting or sorting a string with spaces, capitals and lower case (Ex: Input:“Abc XyZ WWqq”,

Output: “AXZWW bcyqq”) 2 nd Round: F2F Gave an option of either Multi-threading or array question, I chose array Arrange given numbers to form the biggest number This , but with a twist, that the solution either has (Time: O(n+m) Space: O(n+m)) OR (Time: O(n*m) Space: O(1)) Inheritance questions- Why static members Cannot be inherited in Java? Can you override a static method in Java? Why static method can not be overridden?

Sample code, expected output (Simple inheritance concepts) 3 rd Round: F2F- Some senior person. No theory, only problem solving Print Nodes in Top View of Binary Tree Intersection point of two Linked Lists . But the catch is its infinitely long list, and you’re not allowed to use O(n) space or modify the list He was asking the same set of question to 2 year guy and 6 year guy.