Telephonic Interview: Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1. Example 1: Input: 12 Output: 21 Example 2: Input: 21 Output: -1
Dsa based questions and project related questions
The questions were all related to explaining my current role and prior projects I have worked on that are relevant to this position.
Average Matrix problems, Trees related questions(leet code). They will ask to optimize your solution.
2nd Technical Round: 1. What is a deadlock? 2. Write a program in Java to produce deadlock scenario? 3. How to avoid deadlock? 4. Find you own pattern matching algorithm with O(n) complexity?
Q. Build an app to real time display the next available bus to the destination. You could have multiple buses going from your starting point to the destination point ?
A take home programming question that tested your knowledge of algorithms and object oriented programming, and also your ability to prioritize with which features you can add and which features you can cut given the two hour time limit. It's really hard to complete everything within 2 hours, so it tests a lot of your skills.
Code to give the optimal dependency libraries to be installed
1. You are given a acronym dictionary where it has expansion say WHO => world health Organisation. Then there is input which has this acronym used, you will have to substitute the acronym for the expansion and that will be your result.
LCA
Viewing 331 - 340 interview questions