Given an array of integers (arr[int]) and a target (int). I want you to return the indices of 2 numbers sum. For example, given the array [2, 7, 11, 15] and a target of 9, the function should return [0, 1], indicating that the numbers at indices 0 and 1 (i.e., 2 and 7) add up to the target sum of 9.
Round 2 Q2 The interviewer explained how radix sort works on integers and asked me to implement it.
Write and explain the code that is written (Creating a Mine Sweeper game)
Design a schema for a set of models, then write some SQL queries to get aggregate values.
Why were my tenure from my previous companies 1 year stints?
2. Interviewer brought a real world topic which he is currently working on inside Anaplan and asked how I would go and solve it.
1. They showed me a code and asked for improvements. 2. They showed me something they want to create, and asked how I would design it in terms of design and architecture.
First they asked simple OOP questions followed by 2 java programs I would say they are easy level. 1. First program is verify if a given number is prime. I did it and tried to enhance it for optimal solution. Interviewer was looking for specific optimal condition which I didnt provided. 2. Second program is given an integer array and a sum find 2 numbers in array whose sum is equal to given number. Again looking for optimal solution, interviewer given tip to use a hash set .
Detailed project architecture currently working on & Design patterns implemented in it.
Do you use Twitch?
Viewing 2241 - 2250 interview questions