Update: Just done with the OA. I was able to solve both questions. Question 1: Minimum number of swaps required to make binary string a palindrome Luckily I had seen the question previously while browsing Amazon OA questions (Discussion link ) Question 2: Question Image I was able to come up with a sliding window approach, this took me 1 hour to finish but I passed all the test cases.
Lots of questions on leadership principles
Prove a simplified "Juego de la Oca" board (an array of every cell and how many moves can you move at most from there) can be solved.
En la pregunta de ADE fue una pregunta que se podía resolver con un hash map, en la de OOP fue la de diseño de una pizzería
design a chess game, low level design
What do you know about Starling?
How Collection.synchronize(map) different from synchronisation in concurrent Hashmap.
They asked all the questions which a good product based will ask but they can't pay you
How would you check if a string of parenthesis are valid?
1. Data Structures - Linked List, Binary Trees, Stacks and Queues (Theory and Coding (3 to 4) both) 2. DBMS and SQL - Keys, Joins, DBMS vs RDBMS, Clauses, Types of languages, etc. (Theory and Queries) 3. JAVA - All OOPS concepts(with real life examples), Generics, File and Exception Handling, etc. 4. Coding Questions (5 to 6) - Problem Solving (like array and string manipulation)
Viewing 3801 - 3810 interview questions