Amazon Interview Questions – Set 9 (For SDE 2)

Recently I attended Amazon Bangalore interview for SDE 2 position. All f2f and no phone/written screening as I had attended one before and cleared those. Total 4 rounds and below are the details. Round 1: Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n) Q2. Read More →

Vizury Interview Questions – Set 1

Company: Vizury Interactive Solutions I applied at Vizury for the post of Product Engineer through a recruiter. The process took one day and I was interviewed at Vizury.  Round 1: Q1. What is hashing? How to handle collision? Q2. Find all anagrams in a set of strings? Q3. Some database questions. Don’t remember? Round 2: Q1. Read More →

Goldman Sachs Interview Questions – Set 1

Company: Goldman Sachs Hi, I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore. Round 1: Q1. Print all nodes at a distance k from a given node in binary tree? Q2. randN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, Read More →

Snapdeal Interview Questions – Set 2

Recently Snapdeal came to our campus. Online Test- 22 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank 22 MCQ had almost 10 aptitude and 12 C output based questions. Coding Question: Q1. Given a string of parenthesis only, check if it’s valid or not. Q2. Given points of two lines segments A(x1,y1 x2,y2) Read More →

Flipkart Interview Questions – Set 4

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 →

PayU Interview Questions – Set 2

Company: PayU India Profile: Senior Developer Round 1(Telephonic): Q1. Find loop in linked list and remove it? Q2. Prove p^2-1 is divisible by 24 given p is a prime number?   Round 2: Q1. Given number of points in a circle. How many ways chords can drawn in circle with conditions give. I. From any 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 →

Break String into Dictionary Words

Given an English dictionary (implemented as a hashmap (word -> meaning)) and a string without spaces, output all possible combinations of valid English words that when combined, reproduce the input string. e.g. input: “programmerit” output: {{pro, gram, merit}, {program, merit}, {programmer, it}} output: Solution: Recursive implementation: The idea is simple, we consider each prefix and Read More →

Intuit Interview Questions – Set 1

Company : Intuit College: IIT M We first had a PPT about the company. They focused on innovation a lot and what they do. The people presenting seemed pretty cool and professional at the same time. Team consisted of youngsters and extremely experienced employees as well. This was followed by a written elimination round. There 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 →

Flower Pot Puzzle

Puzzle: Sara has 6 flower pots, each having a unique flower. Pots are arranged in an arbitrary sequence in a row. Sara rearranges the sequence each day but not two pots should be arranged adjacent to each other which were already adjacent to each other in previous arrangement. How many days she can do this Read More →