Category Archives: Experienced

Amazon Interview Experience | Set 317 (SDE-1 Off – Campus)

Round 1:  Tell me about yourself.  Trapping Rain Water :Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. http://www.geeksforgeeks.org/trapping-rain-water/ Print left view of a binary tree. http://www.geeksforgeeks.org/print-left-view-binary-tree/ Discussion : I gave two approaches one with DFS and… Read More »

Swiggy Interview Experience | Set 3 (For SDE-2)

1. Online coding test – HackerEarth 2. Machine coding round – Question and Input attached. 3. F2F – DS & Algo Round a) Tail recursion for Fibonacci – http://www.geeksforgeeks.org/tail-recursion/ b) http://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/ c) Sorted Array, count frequency of all numbers in less than O(n) d) Longest Palindromic Substring 4. F2F – Design Round Design a catalog… Read More »

Paytm Interview Experience | Set 10 (For Experienced)

It was a walk-in for experienced candidates actually. Round 1: Machine Coding Round (60 min) Q1. Infix to Postfix conversion e.g. A+(B-C)*D becomes ABC-D*+ Q2. Given an array of integers find the minimum distance between a pair of numbers Q3. Find the frequency of each character in a given string Round 2: First F2F Technical… Read More »

Amazon Interview Experience | Set 316 (Off-Campus)

Amazon Off Campus Interview Experience(SDE-1, Experienced) Round 1: 1) Tell me about yourself. 2) Trapping Rain Water : Giv­en n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. http://www.geeksforgeeks.org/trapping-rain-water/ 3)  Print left view of a binary tree. http://www.geeksforgeeks.org/print-left-view-binary-tree/… Read More »

Tolexo (Indiamart company) Interview Experience | Set 1 ( Senior Software Developer)

Round 1 (Telephonic) : Discussed about previous projects. How Node.js internally works. What is left joins and how it’s works. Round 2 (F2F) : How inodb (mysql engine) works and it’s internal architecture. How joins works. More question from DB Inorder traversal of binary tree. Missing number Problem !! ( http://www.geeksforgeeks.org/find-the-missing-number/) Some basic Ubuntu commands.  how… Read More »