AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Info
Edge
Work with us 
Compare
Filter interviews by
Info Edge SDE Interview Questions and Answers
Info Edge SDE Interview Experiences
4 interviews found
SUMAN JANGID
(2 Questions)
- Q1. Two stack based question
- Q2. Find the non repeting no from an array
- Ans.
Find the non-repeating number in an array of strings.
Iterate through the array and count the occurrences of each number using a hashmap.
Return the number that has a count of 1.
Skills evaluated in this interview
Anonymous
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude test anddsa quuestions and also core questions
Dsa round tree and graph questions
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
Maths,dsa and core subject round
Dsa round graph and tree and ll
I applied via Referral and was interviewed in Feb 2023. There were 2 interview rounds.
(2 Questions)
- Q1. SQL basics - joins, aggregates, groupby, where
- Q2. Java - leetcode medium - string manipulation, swap two numbers, linked list
Interview Preparation Tips
What people are saying about Info Edge
Interview questions from similar companies
Interview Questionnaire
5 Questions
- Q1. What happens when we type amazon.com ?
- Ans.
Typing amazon.com in the browser's address bar takes you to Amazon's website.
The browser sends a request to the DNS server to resolve the domain name 'amazon.com' to an IP address.
The browser establishes a TCP connection with the server at the resolved IP address.
The browser sends an HTTP request to the server for the homepage of Amazon's website.
The server responds with the HTML code for the homepage, which the browse...
- Q2. Describe transaction process in detail if we want to transfer from one account to other. Also design scheme for it
- Ans.
The transaction process involves transferring funds from one account to another. A scheme is designed to ensure secure and accurate transfers.
Verify the availability of sufficient funds in the sender's account
Authenticate the sender's identity and authorization for the transaction
Deduct the transfer amount from the sender's account balance
Initiate a request to transfer the funds to the recipient's account
Validate the r...
- Q3. What happens on server side on receiving HTTP requests and how operating system interacts and then discussion related with threading, thread pool ,synchronization, hashing etc
- Ans.
When a server receives an HTTP request, it interacts with the operating system, handles threading, thread pooling, synchronization, and hashing.
Upon receiving an HTTP request, the server creates a new thread to handle the request.
The operating system manages the allocation of system resources to the server process.
Thread pooling is used to efficiently manage and reuse threads for handling multiple requests.
Synchronizat...
- Q4. Describe ACID properties in detail
- Ans.
ACID properties ensure reliability and consistency in database transactions.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that a transaction is treated as a single unit of work, either all or none of its operations are executed.
Consistency ensures that a transaction brings the database from one valid state to another.
Isolation ensures that concurrent transactions do not interfere w...
- Q5. How to find kth- smallest element in BST? -----/
- Ans.
To find kth-smallest element in BST, perform inorder traversal and return the kth element.
Perform inorder traversal of the BST
Maintain a counter variable to keep track of the number of nodes visited
When the counter reaches k, return the current node's value
If k is greater than the number of nodes in the BST, return null or throw an exception
Interview Preparation Tips
Experience: Online Round: (Duration – 90 minutes)
20 MCQs and 2 coding questions. MCQs were on Algorithms, Time Complexity, Quantitative Aptitude, Probability, Operating Systems, Graphs, Data Structures, Recursion outputs etc.
Coding Questions:
1. In one of Amazon fulfillment centers, there are a no. of empty boxes kept in increasing order in a row. Kiva robots are designed to put a product in a box. The product size is given. Design a program to find the best fit box for given product size. First line contains no. of empty boxes and next line contains size of boxes with space. The next line contains size of given product. The output shows the best fit box size and -1 otherwise.For example, Input: 6
2 7 9 11 13 16
12
Output: 13 2. You have to find a string in two-dimensional array. The input contains 2-D array of characters and given string. You can move in one of eight directions . The output contains location of first letter of string if string found completely, otherwise return -1. Any one out of multiple answers is accepted, if possible.
For example, Input:
b t g
p a d
r k jString: rat
Output: (2,0)
Round: TECHNICAL INTERVIEW
Experience: Brief introduction about myself and my project.
1. Given an array of positive and negative integers, rearrange positive and negative numbers in 0(n) time .
First, I solved it using 2 arrays,each for positive and negative integers and place elements of array in these 2 arrays and them combine them back by taking one element from each array. Then he told me to do without extra space. I then segregated positive and negative elements using quicksort .Below is the link:
-----. Program to check whether strings are rotation of each other or not. I approached as below:
-----/
He then told to solve without using strstr. I used naive searching method.
Round: HR INTERVIEW
Experience: Brief introduction and some behavioral questions.
Given a BST and a key sum, design an algorithm to find all pairs of integers whose sum equal to key.
I first approached using an array and placing elements into it in inorder fashion and then find pairs. He told to do in-place and I solved with 2 traversals (inorder and reverse- inorder
Round: Technical Interview
Experience: Based on CS Fundamentals and also had 15 minutes discussion on my internship project.
Q.Given a Binary tree, full_path_sum is sum of all nodes from root to leaf in a path. Given a min_sum value, delete nodes if path has full_path_sum less than min_sum . Delete all such nodes . For example,Given min_sum =8 1
2 3
4 5 6 7
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Experience: Online Round :(Duration – 90 minutes)20 MCQs to solve and 2 coding questions. 20MCQs were on Algorithms,Data Structures, C Output, Quantitative Aptitude, etc.
Coding questions were of 10 marks each.
MCQ’s had negative marking.
Correct : +1
Wrong : -0.25Q1– Given an array of numbers, arrange them in an alternate fashion such that every number is followed by a number of opposite sign. Also the order was to be maintained. If the count of negative numbers is more keep the extra at last in array and same for positive numbers.Example :
Input: -3 -2 6 0 7 -1 -8
Output: -3 6 -2 0 -1 7 -8Q2– String of characters as arranged in a cellphone i.e.
1- NULL
2-a,b,c
3-d,e,f
4-g,h,i
.
.
.
9-w,x,y,z
0-NULLPrint all combinations for given number of digits(k) in lexicographical order .
Constraint : 1<=k<4
For Example : Input = 234
Output : adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi cdg cdh cdi ceg che dei cfg cfh cfi
Round: TECHNICAL INTERVIEW
Experience: Q1– Design a shuffle function which would play songs randomly in your device (unique song_id) and code it.
After i gave him a solution with hash function , he asked me to improve the algorithm such that once a song is played it should be played only when all the other songs are played,
Solution’s Complexity : Space – O(n) , Time – O(1) ; n—> number of songs
After that he asked me to improve my solution and do it without using extra space.
Solution’s Complexity : Space – O(1) , Time – O(n) ; n—>number of songs
Hint : Maintain indices and once a song is played shift it in range of played songs index.
After that i was asked about each part of the hash function and how i came up with that.Q2– Add two linked lists. And code it.Input : 1->2->3->4->NULL
8->2->NULL
Output : 1->3->1->6->NULLFirst he asked to do it without recursion and then with recursion.We also talked about theproblem we face if we store the value of the linked list in an integer or long if the number of digits were above certain limits in the non-recursive function.
Round: TECHNICAL INTERVIEW
Experience: Q1 – Find the largest sub tree which is binary search tree in a given Binary Tree. Then to optimize it and then asked me to code it.
Q2 – Given a linked list with a next pointer and an arbitrary pointer pointing to any node in the list , copy the linked list.After i gave him a solution which changed the links of the initial linked list, he asked me to do without changing the links.So i gave him a O(n^2) solution . He asked me to give another way or optimize my solution.He helped me to figure out the solution.Hint – Hash map.The interviewers were really helping and supporting and were more interested in seeing the efforts you make and the way you get to the logic.They help throughout by giving hints.
College Name: NA
Interview Questionnaire
7 Questions
- Q1. In a binary tree, a random pointer is given in each node. If this pointer pointing other than any successor of the node then set it as NULL. Otherwise let it remain untouched. Write code
- Ans.
Modify a binary tree's random pointers to point to NULL if they don't point to a successor node.
Traverse the binary tree using DFS or BFS.
For each node, check if the random pointer points to a valid successor.
If it points to a node that is not a successor, set it to NULL.
A successor of a node is defined as its children or their descendants.
- Q2. You will be given the number of pairs of parenthesis. Find out the total possible valid unique combinations and there should not be any duplicity. Write code
- Ans.
Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.
Use recursion to generate all possible combinations
Check for validity of each combination using a stack
Use a set to avoid duplicity
- Q3. Given an in-order traversal of a special binary tree having property that the node is always greater than its left and right child. Construct the tree and write code
- Ans.
Construct a binary tree from in-order traversal with nodes greater than left and right child.
The root node will be the maximum value in the in-order traversal
Recursively construct the left and right subtrees using the left and right portions of the in-order traversal
Repeat until all nodes are added to the tree
- Q4. Find top 10 trending words inserted by users in sites like twitter. Only algorithm
- Ans.
An algorithm to find top 10 trending words inserted by users in sites like Twitter.
Collect a large dataset of tweets
Tokenize the tweets into individual words
Remove stop words and punctuation
Count the frequency of each word
Sort the words by frequency in descending order
Select the top 10 words
- Q5. Write an efficient code to find the first occurrence of 1 in a sorted binary array
- Ans.
Find the first occurrence of 1 in a sorted binary array.
Use binary search to find the first occurrence of 1.
If the mid element is 1, check if it's the first occurrence or if the element before it is 0.
If the mid element is 0, search in the right half of the array.
If the mid element is 1 and the element before it is also 1, search in the left half of the array.
- Q6. Remove duplicated from a string in O(n) without using hash
- Ans.
Remove duplicates from a string in O(n) without using hash
Use an array of boolean values to keep track of characters already seen
Iterate through the string and mark characters as seen in the array
If a character has already been seen, remove it from the string
- Q7. Ind the first occurrence of 1 in a sorted infinite binary tree
- Ans.
Find the first occurrence of 1 in a sorted infinite binary tree.
Use binary search to traverse the tree.
If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.
If the current node is 0, move to the right subtree.
Repeat until the first occurrence of 1 is found or the tree is exhausted.
Interview Preparation Tips
Experience: Q1. For a given number, find the next greatest number which is just greater than previous one and made up of same digits.
Q2. Find immediate ancestor of a given Node
Q3. Clone the linked list having an extra random pointer in nodes which is pointing random node in the list.
Round: HR Interview
Experience: Amazon has many visitors to its site. And it tracks what pages the customers visited, etc and other stuff.Make an efficient data structure for storing 3 days of information of all those customers who have visited site exactly two different days and searched more than 3 unique pages of the site in those 2 days.So whoever visited site exactly two days out of these three days and visited more then 3 unique pages should be in the contact list.
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Find the second largest element in an array. (-----/)
- Ans.
Find the second largest element in an array.
Sort the array and return the second last element
Iterate through the array and keep track of the two largest elements
Use a priority queue to find the second largest element
- Q2. Given a sorted array which can have repeated elements, find the occurrence of an element. (Most optimal solution is O(logn) – Using binary search to find start and end occurrence)
- Ans.
Given a sorted array with repeated elements, find the occurrence of a given element using binary search.
Use binary search to find the first occurrence of the element
Use binary search to find the last occurrence of the element
Calculate the occurrence by subtracting the indices of the last and first occurrences and adding 1
- Q3. Make a data structure and implement an algorithm to print all the files in a directory. (the root directory can have sub-directories too.) I used an n-ary tree and BFS to print files. It can also be done u...
- Ans.
Implement a data structure and algorithm to print all files in a directory, including sub-directories.
Use an n-ary tree or stack to represent the directory structure
Implement a BFS or DFS algorithm to traverse the directory and print files
Handle sub-directories recursively
Consider using a queue or stack to keep track of directories to visit
- Q4. He asked some question about my CV
- Q5. Print a matrix diagonally. (-----/)
- Ans.
Print a matrix diagonally.
Start from the top left corner and print the diagonal elements
Move down and right to print the next diagonal
Repeat until all diagonals are printed
- Q6. DFS of binary tree, n-ary tree
- Ans.
DFS is a traversal algorithm used to visit all nodes of a tree or graph. It can be applied to binary as well as n-ary trees.
DFS stands for Depth First Search.
In DFS, we start from the root node and visit its children recursively until we reach a leaf node.
There are two types of DFS: Preorder (root, left, right) and Postorder (left, right, root).
DFS can be implemented using recursion or a stack data structure.
Example: I...
- Q7. Then he asked some question from other subjects. OS – Scheduling DBMS – Normalization, Transaction OOPS – Abstraction
Interview Preparation Tips
Experience: They had an online aptitude test on day 1. It was 90 minutes: 20 MCQs + 2 coding questions (choice between C/C++/Java for coding). MCQs were based on DSA, OS, and Math. They were apparently difficult.
Round: Test
Experience: 1. Keypad problem ( -----/ )– Little difficult problem on backtracking.2. Given an array, find the count of impossible triangle ( -----/ )
Round: Test
Experience: Questions involved DSA and strongly based on optimising the code:
1. Given a linked list, reverse K nodes in it eg :- 1->2->3->4->5->NULL , k = 3 3->2->1->5->4 2. Search for an element in an array which has elements who’s values are first increasing and then decreasing. (Use modified binary search)
Duration: 60 minutes
Total Questions: 2
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Experience: 1. An array is given with element name and their respective pH values. Print the combination of 2 elements which make a neutral compound.
A discussion started and best solution was O(n) time complexity and O(1) space complexity.
Then I got call for F2F interviews and here are those-
Round: Technical Interview
Experience: 1. Print Matrix in spiral form.
2. A store have n customers and any 1 can visit them any time through out the year.Data is stored in a file.Design a data structure to find given person visited on so n so date or not.
Round: Technical Interview
Experience: 1.There are N packages P1, P2…Pn. A package may depend on another or many other for its compilation. Given a matrix of dependency, find a sequence of package compilation.
2.A 2D matrix is given, with each elements representing number of gold coin at that position. I have to travel from (0,0) to last element of matrix collecting maximum no. of coins.I can travel either right of an element or down of it.
3.In Galaxy there are trillions of stars. I am provide distance of every star from earth. Tell me nearest 1Million stars to earth, provided with best time and space complexity.
Round: Technical Interview
Experience: 1. Implement LRU.
2.In Android phones we have 3X3 grid for making a pattern. Given a length, find number of combinations for that length in that grid.
Round: HR Interview
Experience: 1. Project deep discussion.
2. Few given scenarios and how you will tackle.
3. Strengths and weaknesses.
4. Given a file with many statements. Print all the strings with their anagrams through the file.Logic to check anagrams and to store them
Round: Technical Interview
Experience: 1. Behavioral Questions like
>Why you want to leave your organization?
>What is most challenging work you have done till date?
>Why you want to join Amazon?
etc.
2. Which data structure you know?
3.Say I have few words and their meaning, and I want to store them which DS will you use and why.
I started with Hashmap and we kept on discussing about pros and cons.Finally ended up with trie.He asked me to write code for it, for adding new word and for fetching meaning from Trie.The whole process started in 1st week and yesterday got a call from HR for I am invited to be part of Amazon.
College Name: NA
Interview Questionnaire
2 Questions
- Q1. Find top 10 selling product given the count of sales of each product
- Ans.
To find the top 10 selling products, sort the products by their sales count in descending order and select the first 10.
Sort the products by their sales count in descending order
Select the first 10 products from the sorted list
- Q2. Design a valet parking lot with basic use-case of assigning ticket to customer and retrieving the car later. Three sizes available. Use best fit and nearest distance
Interview Preparation Tips
Skills evaluated in this interview
Info Edge Interview FAQs
Tell us how to improve this page.
Info Edge Interviews By Designations
- Info Edge Software Engineer Interview Questions
- Info Edge Senior Executive Interview Questions
- Info Edge Software Developer Interview Questions
- Info Edge Sales Executive Interview Questions
- Info Edge Data Scientist Interview Questions
- Info Edge Senior Software Engineer Interview Questions
- Info Edge Business Analyst Interview Questions
- Info Edge Operations Executive Interview Questions
- Show more
Overall Interview Experience Rating
based on 4 interview experiences
Difficulty level
Duration
SDE Interview Questions from Similar Companies
Info Edge SDE Reviews and Ratings
based on 1 review
Rating in categories
|
Senior Executive
682
salaries
|  ₹2.6 L/yr - ₹8 L/yr |
|
Sales Executive
658
salaries
| ₹10 L/yr - ₹10 L/yr |
|
Assistant Manager
611
salaries
| ₹3.3 L/yr - ₹9.5 L/yr |
|
Associate Senior Executive
563
salaries
| ₹2.2 L/yr - ₹6 L/yr |
|
Senior Software Engineer
369
salaries
| ₹10 L/yr - ₹28 L/yr |
TCS
Amazon
Flipkart
Indiamart Intermesh
- Home >
- Interviews >
- Info Edge Interview Questions
