in technical round.. 1 given an unsorted array add frst and second large num of array.. without using nested loops 2 intersection of two arrays 3 find frst non repeated character of given string.. for eg. INDIA so N is the answer 4 there were a probm.. whose solution I'd josaphas number 5 there were one probm on tree. I hd solved frst three.. bt they want all
Round 1 1st q: - problem on string detection in another string. 2nd q:- problem related to matrix 3rd q:- n people standing in circle. A revolver is given to 1st person. He kills the 2nd and passes revolver to 3rd . 3rd kills 4th and passes to next and so on. Given n , find last man standing. 4th q:- based on dfs of tree (recursion). Round 2 Optimization of earlier written codes New problem.:- Accept a 1d array as input from user and display it in upper triangular matrix. And mirror the same in lower triangle of matrix too. After that asked me to optimize it to complexity O(n).
What is your preferred management style?
Function gets a digit and an int signed needs to return the maximal number possible created by inserting the given digit at any position
How would you describe what this role entails?
Building an assignment to showcase dev skills.
Not applicable in this scenario
Writing a code of html css and javascript and questions related to those technology
What is Inheritance? Why use inheritance?
What is test-driven programming? How did you test your application? What is the unit/integration testing? Automation testing? Why use an automation test?
Viewing 3701 - 3710 interview questions