Tag Archives: Technical Interview Questions

Microsoft Interview – Set 1

I appeared for MS interview for developer profile recently. I would like to contribute for CrazyforCode by sharing my experience. Round 1 Q1. Two numbers are stored in two linked lists, with one digit in each node. Add the numbers and return the resultant sum in a linked list. eg. if LL1= 2 ­> 3 Read More →

Nextag (Wize Commerce) Interview Questions

I apperaed for Nextag(wize Commerce) interview SSE profile recently.I would like to share my interview experience here. Round 1 Q1. Split the array into 2 arrays such that difference between sum is minimum? Q2. A long number ie 123956778 is given. Get the digit from position given as input? ie. 4th digit is 9. Q3. Read More →

Netapp interview – Set 2

I appeared in Netapp interview recently and I would like to contibute to crazyforcode.com. This website is very helpful for interview preparation. First a written round was conducted. Written was based on Programming, Data structure, OS and Aptitude. There were 4 sections with a total of 50 questions to be done in 1 hour, with Read More →

Ebay interview – Set 1

Written Round:There were 30 questions out of which 50% was based on java and c++, the rest from verbal and quantitative stuff.The key areas to focus on are: · OOPS-all concepts, contructors etc · Database-sql queries and normal basics stuff about schemas etc · Networks- subnetting, various routing protocols, about mac address · Probability ans Read More →

Netapp interview – Set 1

I am from MNIT Jaipur. I appeared for Netapp campus interview for developer profile recently. I would like to contribute for CrazyforCode by sharing my experience. First a written round was conducted. Written was based on Programming, Data structure, OS and Aptitude/Quant. Round 1 → explain your internship project. Q1. Define IP tables. Q2. Write Read More →

D. E. Shaw Interview – Set 1

Location – Bits Pilani Campus Criteria :Cs/IT/ECE And CGPA min of 7.0[CSE] .For ECE =7.5 D. E. Shaw generally prefers computer science branch students but they’re not as strict as Amazon or Google and for for CS students it was only 7.0 . Luckily, my CGPA was above the cutoff and I was allowed to Read More →

Adobe Interview – Set 2

I am from MNIT Jaipur. I recently got interviewed in our campus placement for Adobe, following is my interview experience. Round 1 They started with something I did not even think of, Images fundamentals. Making images blurry, making them shaggy. Operating on images in parallel. Hardware engines support for parallelism. Some other fundamentals Adobe people were Read More →

Amazon Interview – Set 3

I appeared for Amazon campus interview on 30th July 2013. I am from MNIT Jaipur. I would like to contribute for CrazyforCode by sharing my experience. Round 1 Q1. Tell me about yourself? Q2. DBMS project discussion. Q3. How to merge k sorted arrays of n length and discussion on its complexity? Q4. A question Read More →

Software AG interview – Set 1

I am 2010 passed out from MNITJ. I would like to contribute for CrazyforCode by sharing my experience of Software AG Interview process. This was for a SSE position in Bangalore. There was no written test. I had 3 round of F2F interviews and 1 HR interview. Round 1 Q1. Interface i = 20 Abstract Read More →

Amazon interview – Set 2

I am 2011 passed out from IIIT Hyderabad. I would like to contribute for CrazyforCode by sharing my experience of Amazon Interview process. This was for a SDE position in Bangalore. I had one online test. After that 4 round of F2F interviews and I cracked it. Round 1 Q1. Find next inorder predecessor in Read More →

Adobe Interview – Set 1

I am Aman gupta. I passed out in 2010. I recently appeared for the adobe interview. I had one written test. It consisted questions of C/C++,English and logical reasoning. I cleared the written test and then got call for face to face interview. Round 1: 1. Given a router which takes a ip as input Read More →

Amazon interview – Set 1

Round 1(Telephonic) 1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x. 2. Gievn a binary tree and return all root to leaf node pathss row,col and value. 3. He then asked me to give test cases for Read More →