Coding Round - Three questions were there. -First one was easy stock buy and sell problem. - Second one was tree based hard problem . Similar question would be - number of ways to build ant colony on Leetcode. - Third quesition was medium array based problem Interview Round 1 - Two coding questions were there and then a little discussion on coding round questions. - First one was number of rooms required of arrival and departure dates of bookings is given. - Second one was a array problem. In the problem array of integers was given and we can apply 1 operation which increases the value of a element by 1. We were given the max number of possible operations and asked to find the maximum frequency of any element we can get. Interview Round 2 - Coding question was - Boundary Traversal of a Binary Tree. After which he asked me some DBMS and OS question. I was rejected in this round :(
Software Development Engineer I Interview Questions
1,214 software development engineer i interview questions shared by candidates
Only question from Computer Networks was about the OSI layers and difference between TCP and UDP and in what scenarios are they used.
Tell me about yourself
If there's any reason make you not to choose a company, what it's going to be? / or What is your ideal dream job's attribute?
Asked questions about my work at a prior internship
Cannot disclose the question but they were LC Easy/Medium. Also be prepared to answer in detail a system design question in one of the rounds.
Considering that it's a Dev I position, I didn't get any big surprises during the interview. However I've heard that for higher positions it can be pretty tough on the technical side.
Dynamic Programming Questions, Recursions and Java Basic.
Preorder Traversal on a Binary Tree Given a 2d array where every row is sorted left to right min to max and every column is sorted top to bottom min to max, how would you insert an element and move it to a valid position assuming that insertion deletes the largest element in the array Given an integer, return the next largest integer that is made up of the same digits as the given one. Implement Binary Search Vocab Questions about Object Oriented Programming.
parentheses validation, system design, modified binary search
Viewing 671 - 680 interview questions