AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Infibeam Software Engineer Interview Questions, Process, and Tips
Infibeam Software Engineer Interview Experiences
1 interview found
I applied via Referral
Interview Questionnaire
13 Questions
- Q1. I was asked to derive the time complexity of my code from the written test. It was to print the elements of a binary tree in spiral order
- Q2. Program to swap two pointers
- Ans.
A program to swap two pointers.
Declare two pointers of the same data type
Assign the first pointer to a temporary variable
Assign the second pointer to the first pointer
Assign the temporary variable to the second pointer
- Q3. Program to determine whether a given binary tree is binary search tree. I was asked to solve this in two different ways
- Q4. Two DBMS queries involving aggregate functions
- Q5. Program to implement Dijkstra’s algorithm
- Ans.
Dijkstra's algorithm finds shortest path between nodes in a graph
Create a graph with nodes and edges
Initialize distances from source node to all other nodes as infinity
Set distance from source node to itself as 0
Create a set of unvisited nodes
While unvisited set is not empty, select node with minimum distance
For each neighbor of selected node, calculate distance from source node
If calculated distance is less than curre...
- Q6. Program to implement FloydWarshall’s agorithm
- Ans.
Floyd-Warshall's algorithm is used to find the shortest path between all pairs of vertices in a weighted graph.
Create a 2D array to store the distances between all pairs of vertices.
Initialize the array with the weights of the edges in the graph.
Use nested loops to iterate over all pairs of vertices and update the distances if a shorter path is found through a third vertex.
The final array will contain the shortest dist
- Q7. Program to print the elements of a matrix in spiral order recursively
- Ans.
Program to print matrix elements in spiral order recursively
Create a recursive function to print the elements in spiral order
Define the boundaries of the matrix and traverse the matrix in spiral order
Call the recursive function to print the elements in spiral order
Handle edge cases such as empty matrix or matrix with only one row/column
- Q8. Given an unsorted array of numbers, find two numbers which add up to the given sum in O(n)
- Ans.
Find two numbers in an unsorted array that add up to a given sum in O(n)
Use a hash table to store the difference between the sum and each element in the array
Iterate through the array and check if the current element is in the hash table
If it is, return the current element and the corresponding difference
If not, add the current element to the hash table
- Q9. Explain indexing in DBMS
- Ans.
Indexing is a technique used in DBMS to improve the performance of queries.
Indexing creates a separate data structure that allows faster retrieval of data.
It works by creating a pointer to the location of data in the table.
Indexes can be created on one or more columns of a table.
Types of indexing include B-tree, hash, and bitmap indexing.
Indexes can also be clustered or non-clustered.
Clustered indexes determine the phy...
- Q10. Explain B and B+ trees
- Ans.
B and B+ trees are data structures used for efficient searching and sorting of large datasets.
B trees are balanced trees used for disk-based storage systems.
B+ trees are similar to B trees but have all data stored in the leaf nodes for faster searching.
B trees have a variable number of keys per node, while B+ trees have a fixed number.
B trees have a higher fanout than B+ trees, making them more efficient for smaller da...
- Q11. Given a binary tree, write a program to determine whether there exists a root to leaf path having the given sum
- Q12. Program to find the lowest common ancestor of two nodes in binary search tree as well as binary tree. I was also asked to give the brute force approach for the same
- Ans.
Program to find lowest common ancestor of two nodes in binary search tree and binary tree with brute force approach.
For binary search tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
For binary tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
Brute force approach involves checking each node's descendants to see if they contain both nodes.
...
- Q13. Program to print all ancestors of a node in a binary tree
- Ans.
Program to print all ancestors of a node in a binary tree
Create a recursive function to traverse the binary tree
Check if the current node is the target node
If yes, print all the nodes in the call stack
If not, recursively call the function for left and right subtrees
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Rajesh Paramanandam
I was interviewed in Oct 2016.
Interview Preparation Tips
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40
Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..
Tips: Beware filling ur resume.. they will ask every stuff that you have in resume
Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project
College Name: Sri ganesh college of engineering and technology
I applied via Campus Placement
Interview Questionnaire
4 Questions
- Q1. Boundary traversal of a tree
- Ans.
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
- Q2. Find the nearest greater value of a given value in a BST
- Ans.
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
- Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
- Ans.
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
- Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure
Interview Preparation Tips
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22
Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.
Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.
General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .
Skills evaluated in this interview
Anonymous
Interview Questionnaire
2 Questions
- Q1. Data struct,algo,
- Q2. High level data structs and algos
Interview Preparation Tips
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE
Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach
Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos
Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos
Interview Preparation Tips
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25
Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3
Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.
I was interviewed before May 2016.
Interview Questionnaire
4 Questions
- Q1. Tell us about yourself
- Ans.
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge of data structures and algorithms
Proficient in programming languages such as Java, Python, and C++
Familiar with Agile development methodolog
- Q2. Why Flipkart
- Ans.
Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.
Flipkart offers a challenging and dynamic work environment for software engineers.
The company has a strong reputation for investing in technology and innovation.
Flipkart has a large user base and offers opportunities to work on a variety of projects.
The company has a strong focus on customer satisfaction and user experie...
- Q3. Are you comfortable to reallocate
- Ans.
Yes, I am comfortable with reallocating as needed.
I am flexible and adaptable to changing circumstances.
I have experience working in dynamic environments where priorities can shift.
I am willing to take on new challenges and responsibilities as required.
- Q4. Why should we hire you
- Ans.
I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.
Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++
Strong problem-solving skills demonstrated through successful completion of complex projects
Proven track record of delivering high-quality software on time a...
Interview Preparation Tips
Experience: 2 problem statements to be coded using any language
Tips: Focussed on string manipulations and enormous data size handling
Duration: 1 hour 30 minutes
Total Questions: 2
Skills: C/C++
College Name: Guru Premsukh Memorial College of Engineering
Interview Questionnaire
13 Questions
- Q1. Given a string of parenthesis, write a function if it is balanced
- Ans.
Function to check if a string of parenthesis is balanced
Use a stack to keep track of opening parenthesis
If a closing parenthesis is encountered, pop from stack and check if it matches
If stack is empty and a closing parenthesis is encountered, return False
If all parenthesis are matched and stack is empty, return True
- Q2. Given two linked lists each of which represent a number, write a function that returns a linked list that represents the sum
- Q3. Find the number of occurrences of words in a paragraph
- Ans.
Count the occurrences of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Create a dictionary to store the count of each word.
Iterate through the words and increment the count in the dictionary.
Return the dictionary with the word counts.
- Q4. Find common elements out of two sorted array?
- Ans.
Find common elements out of two sorted array
Use two pointers to traverse both arrays simultaneously
Compare elements at each pointer and move the pointer of the smaller element
If elements are equal, add to common elements list and move both pointers
Stop when either pointer reaches end of array
- Q5. Convert BST to a Doubly linked list?
- Ans.
Convert a Binary Search Tree to a Doubly Linked List.
Create a DLL node class with left, right, and data fields.
Traverse the BST in-order and add each node to the DLL.
Adjust the left and right pointers of each node to create the DLL.
Return the head of the DLL.
- Q6. Given a binary tree in which the node structure has an additional field called “next” which of pointer to tree node type, fill up this field of each node to point to the next node at the same level (NULL i...
- Ans.
The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.
Use a level order traversal to process the tree nodes.
Maintain a queue to store the nodes at each level.
For each node, set its 'next' field to the next node in the queue.
If a node is the last node at its level, set its 'next' field to NULL.
- Q7. Given a parentheses string, determine if it is a valid / legitimate parentheses string. For strings consisting of single parentheses type and those consisting of multiple types
- Q8. You have a dictionary of words. Given a word, print all anagram are in dictionary . State the data structure to be used to solve this problem
- Ans.
To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.
Create a hash table to store the anagrams
Iterate through each word in the dictionary
Sort the characters of the word and use it as a key in the hash table
If the key already exists, add the word to the list of values for that key
Print the list of values for the
- Q9. You have given 10 files and you have given a string suggest data structure which ll facilitate efficient search of string in the file if string appears more than ones in that case u have to print line numb...
- Ans.
Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.
Use a hash table to store the file name and line number of each occurrence of the string.
Iterate through each file and for each line, check if the string is present and update the hash table accordingly.
Print the hash table entries for the string.
- Q10. Write a program to print a tree in vertical order asked more than one approach to do this problem and modified problem many times
- Q11. Discussion on my current work, difficulties and challenges faced at work, difficult people I have had to work with, instances when I went out of my way to propose creative solutions to existing problems a...
- Q12. Why do you think amazon is the right place for you?
- Ans.
Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.
Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.
The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.
Amazon offers numerous opportunities for growth and career advancement, allowing me to con...
- Q13. You have given an binary matrix which is sorted row wise and column wise write a program to search a row in the matrix having maximum number of zeroes
Interview Preparation Tips
Skills: Algorithm, data structure
College Name: NA
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. DS Algo Questions on Trees. Leadership Principles
Interview Preparation Tips
Interview Preparation Tips
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.
Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.
General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal
Interview Questionnaire
9 Questions
- Q1. Calculate the level sum of the binary tree
- Ans.
Calculate the level sum of a binary tree.
Traverse the tree level by level using BFS
Add the values of nodes at each level
Store the level sum in an array
Return the array of level sums
- Q2. Defective ball puzzle problem
- Q3. Some basic problems (OOP concept,basic datastructures)
- Q4. Vertical sum of binary tree
- Ans.
Vertical sum of binary tree is the sum of all nodes in each vertical line of the tree.
Traverse the tree in-order and keep track of the horizontal distance of each node from the root.
Use a hash table to store the sum of nodes at each horizontal distance.
Recursively traverse the left and right subtrees and update the hash table accordingly.
- Q5. Questions on TCP/IP, Database, OS, Data-structures, (and on many more which you studied in your whole college life)
- Q6. Calculate the top 10 words , which comes frequently in 1 hour time span , on facebook, (dynamically)
- Ans.
Calculate top 10 frequently used words on Facebook in 1 hour dynamically.
Use Facebook API to fetch data
Implement a script to count word frequency
Sort the words based on frequency and return top 10
- Q7. Tell About Yourself
- Ans.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Proficient in programming languages such as Java, Python, and JavaScript
Experience with front-end frameworks like React and Angular
Familiarity with back-end technologies such as Node.js and Spring Boot
Strong understanding of data structures and algorithms
Ability to work collaboratively in a team environment
- Q8. Family Background
- Q9. Number of rectangles/squares in chess board
- Ans.
There are 204 squares and 1296 rectangles on a standard 8x8 chess board.
The number of squares can be calculated using the formula n(n+1)(2n+1)/6, where n is the number of rows/columns.
The number of rectangles can be calculated using the formula n(n+1)m(m+1)/4, where n and m are the number of rows and columns respectively.
For an 8x8 chess board, there are 64 squares of size 1x1, 49 squares of size 2x2, 36 squares of siz...
Interview Preparation Tips
Experience: There were 22 MCQ questions on the technical .while 3 questions were of coding type .1.check for balanced parentheses in an expression2. Find out next higher number with same set of digits3. Doesn't Remember.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
Duration: 90 minutes
Total Questions: 25
Round: Technical Interview
Experience: My experience was very awesome , i answered all the questions , although in starting i was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
Tips: Don't get panic. Just listen the questions carefully and then answer it.
Round: Technical Interview
Experience: I was not confident while answering Q3, and my answer was not appropriate, though after with little help of interviewer i got the answer properly.
Round: HR Interview
Tips: Keep confidence and show them good communication skills.Previous round's performance also matters in this rounds
College Name: NIT JALANDHAR
Funny Moments: In H.R. RoundOne of my friend was interviewed before me, so he told me the questions,H.R. asked him, and one of them was, number of squares in chess board, and then there was my turn for H.R. interview, i went, and he asked me , In chess board , there are how many , before completing his question i answered,204, while his question was , how many rectangles, "ye question pakka tune apne friend se pucha hoga :p " then we passed smiles, but i gave him proper solution of calculation of 204, and then answered my question too.
Skills evaluated in this interview
Infibeam Interview FAQs
Some of the top questions asked at the Infibeam Software Engineer interview -
Recently Viewed
LIST OF COMPANIES
Infibeam
Locations
REVIEWS
Flipkart
No Reviews
SALARIES
Microsoft Corporation
REVIEWS
Infosys
No Reviews
SALARIES
Infosys
SALARIES
Infosys
SALARIES
Flipkart
SALARIES
Flipkart
INTERVIEWS
Empower
No Interviews
INTERVIEWS
Empower
No Interviews
Tell us how to improve this page.
Software Engineer Interview Questions from Similar Companies
Fast track your campus placements
Infibeam Software Engineer Reviews and Ratings
based on 4 reviews
Rating in categories
|
Software Engineer
8
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Program Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Program Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Snapdeal
Shopclues
Paytm Mall
- Home >
- Interviews >
- Infibeam Interview Questions >
- Infibeam Software Engineer Interview Questions
