Company: Flipkart Technical Interview Questions: Q1. Write code to find sum of two numbers stored as linked list.(LSB at last node) and head of each list is given. Q2. Write code to print elements on the path from root to leaf node having the maximum sum. Q3. What is the complexity of retrieving min element from … Read More →
Aspiring Minds Interview Questions – Set 1
Company: Aspiring Minds (AMCAT) Technical Interview (3 Rounds): Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not just the previous node. Write a program … Read More →
Infoedge/Naukri.com Interview – Set 2
Infoedge/Naukri.com Technical Interview Q1. Difference between threads and process? Q2. how threading works at CPU level? Q3. Idea about thrashing? Q4. List page replacement policies? Q5. what data structure uses FIFO? Q6. How paging works ? Q7. what are page faults? Q8. what is ATM? Q9. Have you ever made a thread based program in … Read More →
Practo Interview Questions – Set 1
I recently got an offer from Practo, here is my interview experience: There were four rounds. Round 1: Coding Test on HackerRank. Round 2: Q1. Implement queue with the help of two stacks. Q2. Given a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd … Read More →
InMobi Interview Questions – Set 1
Company : InMobi College & Profile: IIT Delhi for SDET There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins. For coding section 60 mins. It was hosted on Hackerrank. Q1. In a line where words are separated by spaces, , and … Read More →
Nagarro Interview Questions – Set 2
Round 1: Aptitude test : 2 papers 40+6 questions 20 question was on reasoning (Moderate) 20+6 was maths questions (difficulty level was good) Round 2 : Telephonic round on the spot: 1. Tell me about yourself? 2. Define Automation framework? 3. Difference between High severity and low severity with example, what is important as QA point … Read More →
Myntra Interview Questions – Set 2
Profile: Backend Software Developer Process: 5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR Interview Question at Myntra Round 1: Q1. Change Binary tree so that parent node is the sum of root nodes. Q2. Reverse a linkedlist ? Q3. Given an array of +ve and -ve numbers , have to rearrange them … Read More →
Quikr Interview Questions – Set 2
Quikr Interview Questions for Developer Profile Location: Mumbai Written Test: One problem statement was given: You have been given stack of documents that have already been processed and some that have not. your task is to classify these documents into one of the eight categories: [1,2,3..8]. However you notice that there are already large amount … Read More →
Quikr Interview Questions – Set 1
Company: Quikr Profile: Software Developer Profile, Bangalore location Round 1: Q1. Given a no K and an array. Find pair of elements whose sum is equal to given no K. Q2. If there is a website run by 2 servers. These 2 servers balances the load using Load Balancer. So, if 1 session is created … Read More →
MakeMyTrip Interview Questions – Set 1
MakeMyTrip Interview Questions Q1. find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} {2,5} and the ans is {1,2, 5} as its sum is larger … Read More →
Bharti SoftBank (HIKE) Interview Questions – Set 2
Written Test 1. The test consisted of 10 MCQ’s on Aptitude and 10 MCQ’s on C programming. 2. It also consisted of 2 programming questions which were easy. Technical Interview: Q1. Find the mirror image of a binary tree. Q2. Maximum length path between any two nodes in a tree. Q3. A question on Btrees? … Read More →
Flipkart Interview Questions – Set 3
Company : Flipkart I was interviewed for Flipkart SDE 2 role few days back. I want to share interview experience with other geeks. Written Test: It was online coding round on interview street. (1Hr) Technical Rounds: Q1. Check whether given Binary Tree is a Binary Search Tree. Discuss various approaches? Q2. Given a large list … Read More →
What’s going on ?