Basics of c++ but in deep level
Engineer 1 Interview Questions
3,923 engineer 1 interview questions shared by candidates
Basic Leetcode Questions Medium - Hard
largest even sum possible with given elements in an array
Behavioral questions were asked there
Round 1: Behavioral Questions (25 mins) : Time when you missed a deadline LLD Question: Library Mgmt System (30 mins) Round 2: 50 mins DSA Questions: Dynamic Programming (subset sum) problem, BST Max Sum problem, Heap (Top K) problem Round 3: 60 mins Fully behavioral: Time when you had to face a lot of challenges in a project.
Technical Round 1 Q1> Variation of Celebrity Problem Given a square matrix of n, where matrix[i][j] = 1 indicates that employee i "acknowledges" employee j. Determine the "ultimate employee" - Employee acknowledged by all, but does not acknowledge anyone else. If no ultimate decision maker, return -1. Q2> Some kind of BFS problem. Consider a graph of Amazon "Fulfilment Center" (Root) and Delivery Stations [Node] FC Manager wants to know how many DS are there for which a package will have to go through X intermediate DSes Technical Round 2 Q1> Variation of subarray with sum k. Calculate subarrays where sum of elements of subarray is equal to length of subarray. Q2> BFS type problem - Rotten Tomatoes Find least "iterations" for all oranges to become rotten. A rotten orange at index (i,j) can rot all of its neighbours (up, down, left, right. No horizontal). If it is impossible to rot every orange then simply return -1; Behavioural Qs - Have you ever gone above and beyond what your role demands? Have you ever had to work on a very tight deadline? Have you ever had to go out of your way to dive deep and learn something for the job?
Leetcode medium in 3 rounds each followed by 2 behavioral questions
Questions on their leadership principles
Tell me a situation where you don't have exact roadmap and you learn everything on the way.
Coding Question : Graphs and Dynamic programming
Viewing 3101 - 3110 interview questions