Recursive Level Order Traversal of a tree

Level order traversal is also called  breadth first traversal for the tree. Non-Recursive solution of the problem is – Non-recursive Level Order Traversal Approach: There are basically two functions in this method. One is to print all nodes at a given level (printLevel), and other is to get height of tree and print level wise nodes. Read More →

Chasing Dog Puzzle

Puzzle: There are four dogs each at the corner of a unit square. Each of the dogs starts chasing the dog in the clockwise direction. They all run at the same speed and continuously change their direction accordingly so that they are always heading straight towards the other dog. How long does it take for the Read More →

DE Shaw Interview Questions – Set 2

Company: DE Shaw Off campus (Bangalore) (0-1 yr experience) Role : Software Developer Round 1: (Written Test) 20 Aptitude – Basic Quantitative Apt questions 20 Technical – C,C++ & JAVA related, Finding output, Basic Concepts Round 2: Q1. find maximum length BST in a given binary tree? Q2. Write an algorithm to find the absolute Read More →

Flipkart Interview Questions – Set 2

I have recently appeared for Flipkart Recruitment process for SDE position. I  would like to share interview questions. Flipkart Interview Process :- Telephonic Round : 1 F2F : 3 Rounds Technical Interview Questions :- Q1. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of Read More →

Crossing the Bridge Puzzle

Crossing the Bridge riddle

Puzzle: Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: Read More →

Print BST elements in range K1 and K2

Problem: Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Print all the keys of tree in range k1 to k2. i.e. print all x such that k1

Morgan Stanley Interview Pattern

Interview Experience Morgan Stanley Morgan Stanley had a written test. The written test had three sections-aptitude, computer knowledge based and computer programming. All the three sections were objective. Aptitude had 10 questions, computer knowledge had 10 questions and compute programming had 30 questions. The total time given was 90 minutes. There was one-fourth negative marking Read More →

ZS Associates Interview Questions – Set 1

Organization: ZS Associates Position: Business Operations Associate Selection Process: Written + Interview (3-4 Rounds) (*As in 2010, but probably the process has changed now. Get in touch with your immediate seniors.) Written test: 3-4 aptitude questions (CAT type) + 2 subjective HR questions Interviews: Round 1: Case Study You will be given a case and Read More →

Google Interview Questions | Set 1

Google Interview Question: I applied for a job in Google jobs page. I know that its very difficult that a resume gets noticed by google. Suddenly one fine day i got a call from Google HR saying that they are interested in my profile and asked me if, i was ready to go with the Read More →

Cisco Interview Questions – Set 2

Cisco interview process :- Written round (1 hour (Having questions from digital electronics and 20 aptitude majorly p &c and some programming questions on c)) Technical Interview : Q1. They discuss about my projects and some basic questions on c and ask me to design a chat module in c as it was mentioned in Read More →

Sapient Nitro Interview Questions – Set 1

Company: Sapient Written test is conducted by Aspiring Minds which consists of 4 sections:– 1) English 2) General Aptitude 3) Programming concepts 4) Logical reasoning Interview: There are 2 interviews round 1) Technical 2) HR Profile Offered : Trainee Technology Pay Scale : CTC- 4.23LPA/Now it may be different . Bond: 1.5 year Eligibility Criteria Read More →

Bharti SoftBank Interview Questions – Set 1

Interview Process(Bharti SoftBank): Technical Interview (2 Telephonic + 2 F2F) + 1HR Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution. Technical Interview Questions: Q1. Reverse string by words. Give another algorithm other than reversing whole string and then reverse every word. Q2. Given Read More →