AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Infibeam Software Engineer Interview Questions and Answers
10 Interview questions
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...
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
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 ...
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
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
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
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 th...
Check if a binary tree has a root-to-leaf path with a specified sum.
Use Depth-First Search (DFS) to traverse the tree.
At each node, subtract the node's value from the target sum.
If a leaf node is reached, check if the remaining sum is zero.
Example: For a tree with root 5, left child 4, right child 8, and sum 9, the path 5 -> 4 is valid.
Analyzing the time complexity of printing binary tree elements in spiral order involves understanding tree traversal methods.
Spiral order traversal alternates between left-to-right and right-to-left at each level.
Using two stacks can help manage the alternating order efficiently.
For a binary tree with 'n' nodes, each node is visited once, leading to O(n) time complexity.
Example: For a tree with nodes 1, 2, 3, 4, 5...
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 n...
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
- Ans.
Analyzing the time complexity of printing binary tree elements in spiral order involves understanding tree traversal methods.
Spiral order traversal alternates between left-to-right and right-to-left at each level.
Using two stacks can help manage the alternating order efficiently.
For a binary tree with 'n' nodes, each node is visited once, leading to O(n) time complexity.
Example: For a tree with nodes 1, 2, 3, 4, 5, the...
- 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
- Ans.
Check if a binary tree has a root-to-leaf path with a specified sum.
Use Depth-First Search (DFS) to traverse the tree.
At each node, subtract the node's value from the target sum.
If a leaf node is reached, check if the remaining sum is zero.
Example: For a tree with root 5, left child 4, right child 8, and sum 9, the path 5 -> 4 is valid.
- 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
Anonymous
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
The test was organized online on Amcat and there were 3 coding problems. There were no MCQs in this round.
- Q1.
Ninja Technique Problem Statement
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...
- Ans.
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
Iterate through all substrings of the input string and check if their integer value equals the product of two consecutive integers.
Use nested loops to generate all possible substrings efficiently.
Check if the product of two consecutive integers matches the integer value of the substring.
...
- Q2.
Find Nodes at a Specific Distance from Target in a Binary Tree
Given a binary tree, a target node within this tree, and an integer
K, identify and return all nodes that are exactlyKedges away from the t... - Ans.
Find nodes at a specific distance from a target node in a binary tree.
Traverse the binary tree to find the target node.
Perform a depth-first search to identify nodes at distance K from the target node.
Return the values of nodes found at distance K in an array.
(1 Question)
Round duration - 50 Minutes
Round difficulty - Medium
This round was scheduled by the college Training and Placement team virtually. The interviewer asked me questions pertaining mainly to DSA and we discussed my projects.
- Q1.
Segregate Even and Odd Nodes in a Linked List
You are given the head node of a singly linked list
head. Your task is to modify the linked list so that all the even-valued nodes appear before all the odd-v... - Ans.
Reorder a singly linked list so that all even-valued nodes appear before odd-valued nodes while preserving the original order.
Create two separate linked lists for even and odd nodes
Traverse the original list and move nodes to respective even or odd lists
Merge the even and odd lists while maintaining the original order
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
Again, the round was virtual. This was a Tech + Managerial round organized by the college T & P cell. The interviewer asked questions related to fundamental subjects such as Operating Systems, Object-oriented programming, and DBMS. There was one coding round at the end.
- Q1.
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...
- Ans.
Diagonal traversal of a binary tree involves printing nodes at 135 degree angle in between lines.
Traverse the tree in a diagonal manner, starting from the root node.
Maintain a map to store nodes at each diagonal level.
Print the nodes at each diagonal level in the order of traversal.
Round duration - 40 Minutes
Round difficulty - Easy
The round was virtual and was organized by the T & P cell of the college. The interviewer asked some behavioural and situation-based questions. There was one puzzle at the end.
Interview Preparation Tips
Tip 1 : For a product-based company, the first important thing is to solve as many DSA problems as possible. I solved problems mainly on GeeksforGeeks, LeetCode, and Coding Ninjas.
Tip 2 : Prepare 2-3 good projects based on your technical skillset. Prepare it very well as there is a high chance that projects would be discussed in the interview.
Tip 3 : Prepare fundamental college subjects like Operating systems, Object-oriented Programming, Database Management.
Tip 1 : Keep it short and concise
Tip 2 : Describe your projects very specifically
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Medium
It consisted of three coding questions varying from easy to medium.
- Q1.
Distributing Coins in a Binary Tree
You are provided with the root of a binary tree that consists of 'N' nodes. Each node in this tree contains coins, and the total number of coins across all nodes is equ...
- Ans.
Determine the minimum number of moves required to distribute coins in a binary tree so that every node has exactly one coin.
Traverse the binary tree in a bottom-up manner to distribute coins efficiently.
Keep track of the excess or deficit of coins at each node to calculate the minimum moves required.
Transfer coins from nodes with excess coins to nodes with deficits to balance the distribution.
Example: For the input ROO...
- Q2.
Distinct Subsets Count
Given an array
arrof N integers that may include duplicates, determine the number of subsets of this array containing only distinct elements.The result should be returned modulo ...
- Ans.
Count the number of distinct-element subsets in an array modulo 10^9+7.
Iterate through the array and keep track of distinct elements using a set.
Calculate the number of subsets using the formula 2^distinct_count - 1.
Return the result modulo 10^9+7 for each test case.
- Q3.
0-1 Knapsack Problem Statement
A thief is robbing a store and can carry a maximal weight 'W' in his knapsack. There are 'N' items, where the i-th item has a weight 'wi' and value 'vi'. Consider the maximu...
- Ans.
The 0-1 Knapsack Problem involves maximizing the value of items a thief can steal within a weight limit.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the maximum value that can be achieved at each weight limit.
Iterate through the items and weights to fill the array with optimal values.
Return the maximum value achievable at the given weight limit.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The interview was focused on data structures as well as computer fundamentals along with puzzles.
- Q1.
Sort an Array in Wave Form
You are given an unsorted array
ARR. Your task is to sort it so that it forms a wave-like array.Input:
The first line contains an integer 'T', the number of test cases.
For ea... - Ans.
Sort an array in wave form where each element is greater than or equal to its adjacent elements.
Iterate through the array and swap adjacent elements to form a wave pattern.
Ensure that the first element is greater than or equal to the second element.
There can be multiple valid wave arrays, so any valid wave array is acceptable.
- Q2.
Reverse a Linked List Problem Statement
You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.
Input:
The first line of input contai... - Ans.
Reverse a given singly linked list by changing the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(3 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The Round was mainly focused on resume+ dsa + system design +computer fundamentals
- Q1.
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5
Stre... - Ans.
Calculate and print the median after each new integer is added to the stream.
Use a min heap to store the larger half of the numbers and a max heap to store the smaller half.
Keep the two heaps balanced by ensuring the size difference is at most 1.
If the total number of elements is odd, the median is the top of the larger heap. If even, average the tops of both heaps.
- Q2. Can you explain the implementation of an LRU (Least Recently Used) Cache in a database management system?
- Ans.
LRU cache in a database management system stores most recently used data and removes least recently used data when full.
LRU cache is implemented using a doubly linked list and a hash map.
Each node in the linked list represents a key-value pair.
When a key is accessed, it is moved to the front of the linked list.
If the cache is full, the least recently used node at the end of the list is removed.
Example: If cache size is...
- Q3. Design a stack that supports the getMin() operation in O(1) time and O(1) extra space.
- Ans.
Use two stacks - one to store actual values and one to store minimum values.
Use two stacks - one to store actual values and one to store minimum values
When pushing a new value, check if it is smaller than the current minimum and push it to the min stack if so
When popping a value, check if it is the current minimum and pop from min stack if so
getMin() operation can be done by peeking at the top of the min stack
Interview Preparation Tips
Tip 1 : Properly grasp over basic concepts
Tip 2 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 3 : Don't lie over your resume
Tip 1 : Don't Lie over your resume
Tip 2 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
(2 Questions)
Round duration - 70 minutes
Round difficulty - Medium
- Q1.
Subtree of Another Tree Problem Statement
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Explanation:
... - Ans.
Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.
Traverse through tree T and check if any subtree matches tree S
Use recursion to compare nodes of both trees
Handle edge cases like null nodes and empty trees
- Q2.
Generate Binary Strings with No Consecutive 1s
Given an integer
K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.Input:
The input begins with an integer ... - Ans.
Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.
Use backtracking to generate all possible binary strings without consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition.
Keep track of the current string and its length to ensure no consecutive '1's are added.
Sort the generated strings in lexicographically increasing order b...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a data structures round.
- Q1.
Longest Consecutive Sequence Problem Statement
You are provided with an unsorted array/list
ARRofNintegers. Your task is to determine the length of the longest consecutive sequence present in the array... - Ans.
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
Iterate through the array and store all elements in a set for constant time lookup.
For each element, check if it is the start of a sequence by looking for element-1 in the set.
If it is the start, keep incrementing the count until the next element is not found in the set.
- Q2.
Permutations Problem Statement
Given an array of distinct integers, find all possible permutations of the array.
Explanation:
A permutation is a mathematical way of determining the number of possible ar...
- Ans.
Find all possible permutations of an array of distinct integers.
Use backtracking to generate all possible permutations
Swap elements to create different permutations
Return the permutations as an array of arrays of integers
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a data structures round.
- Q1.
Subsequence Determination Problem
Your task is to verify if the given string
STR1is a subsequence of the stringSTR2. A subsequence means characters fromSTR2are retained in their original order but som... - Ans.
Verify if a string is a subsequence of another string by checking if characters are retained in order.
Iterate through both strings simultaneously, checking if characters match in order.
If a character in STR1 matches a character in STR2, move to the next character in STR2.
If all characters in STR1 are found in STR2 in order, return True; otherwise, return False.
- Q2.
Minimum Falling Path Sum Problem Statement
Given a square array
VECof integers withNrows andNcolumns, you need to determine the minimum sum of a falling path through this square array. The array has ... - Ans.
Find the minimum sum of a falling path through a square array by selecting one element from each row with constraints on column selection.
Iterate through the array from the second row, updating each element with the minimum sum of the element and its adjacent elements from the previous row.
The minimum sum path will end in the last row with the minimum value.
Use dynamic programming to efficiently calculate the minimum f...
Round duration - 25 minutes
Round difficulty - Easy
This round was all about OS/DBMS questions.
Interview Preparation Tips
Tip 1 : Practice atleast 100-150 Medium problems and 20-30 hard problems from leetcode
Tip 2 : Try to give a short contest maybe on leetcode, codeforces or codechef as it is beneficial to crack in Online Test.
Tip 3 : Do atleast 2 projects and ask find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you an modification in your project.
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Try to keep a single page resume.
Tip 4 : If your CGPA is quite low do not mention it on the resume.
Tip 5 : In achievements sections only add relevant achievements. Putting achievements like "won painting competition" or "won dancing competition" wont help.
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Discussion on my internships and course projects.
- Q2. My field of interest, how well have I fared in it.
- Q3. Design a mvc controller system where given a url, I am able to invoke the right controller. Eg, given "xyz.com/a/b/c", I should be able to invoke c controller by going through a and b
- Ans.
Design an MVC controller system to route URLs to the appropriate controllers based on the URL structure.
Define a routing mechanism that maps URLs to controller actions.
Use a hierarchical structure where each segment of the URL corresponds to a controller.
Example: For 'xyz.com/a/b/c', 'a' routes to 'AController', 'b' to 'BController', and 'c' to 'CController'.
Implement a method to parse the URL and invoke the correspond...
- Q4. Design autocomplete in IDEs
- Ans.
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
- Q5. What is my weakness
- Ans.
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
- Q6. Given 2 game scenarios for basketball, and given p as the probability of making a basket in an attempt, I have to understand the condition where game1 would be preferable over game2. In first game, I have ...
- Ans.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
- Q7. Given a dictionary of words, I have to go from one word to another in least number of transitions where a transition is a defined as changing any letter of the current word such that the new word is also i...
Interview Preparation Tips
Experience: The test was on hackerrank.
Tips: * Fast coding and problem solving required
* Time crunch
* The test is valued a LOT in the hiring process
Duration: 120 minutes
Total Questions: 4
Round: Technical Interview
Experience: Question 1 : He tried to take the discussion to web based technologies to which I straightly told I don’t know. Not sure if that was a good decision. Nevertheless, he went over my resume a lot of times and asked about various projects.
Question 2 : Discussed the various projects related to it.
Question 3 : He asked this question because I had worked on django during my FB internship. I proposed a tree based structure. xyz.com/a/b/c ---> b is child of a, c is child of b.
Question 4 : Next he moved to a very interesting question. Given a simple text editor, I want to facilitate autocomplete feature. We discussed about syntactic methods using language specific keywords. I suggested a trie based implementation which he liked. Later he asked me to improve and redirected me to using scope of the variables, and grammar of the language. We discussed about all the steps I did in language translators lab (macrojava -> minijava -> typechecking -> miniIR -> microIR -> miniRA ->Mips) where we built a Java compiler in Java. We later hopped back to original question and I suggested that we can use grammar to to store multiple (nested kind of) tries for different scope. He asked me how would I define “scope”. He gave me a scenario which helped me come up with the nested trie structure
int a;
{
int b;
{
int c; //a b c can be used
}
{
int d; //a b d can be used
}
}
He then asked me details of how I would code. I said we could use the respective visitors and maintain the current trie root for scope. He liked it but I missed at 2 places :
1. He asked me about token generation used in a compiler and I said flex and bison. I was expected to elaborate a bit.
2. He asked me how the grammar is generated and how the visitors are invoked. I couldn’t explain properly because I was not thorough with it.
Tips: * Keep smiling in the interviews.
* My interviewer had hopped from Microsoft to Visa. We had a short detailed discussion on how the transition was and what drove him to do that.
* It’s always good to know about the company to pick up interesting discussions, read up latest articles and news
* The interviewers want to see if you are passionate about what they are building. Their PPT (Pre Placement Talk) was also focussed majorly on the technologies they are building.
* If you take a question in a direction, make sure you are very very thorough with it. I took it in the direction of compilers, but couldn't make the transition seamlessly because I wasn't thorough with a lot of things (like token generation, visitor invocation).
* Not sure if telling upfront that you don't know about web technologies when you are applying for a profile that might need it is a good idea or not.
Round: Technical Interview
Experience: I think he was a senior person and spoke very passionately about the work that is happening in visa Bangalore office.
Question 1 : I said maybe I should have learnt a little about web based technologies. I think he was looking for a more generic answer.
Question 2 : I went ahead with calculating the expected score where my score random variable = 1 with probability p, and 0 with probability (1-p). I conditioned that expected score of game1 > game2 which would give me the range of p. I goofed up the equations twice but he said he liked my approach and I was just there
Question 3 : I suggested building a graph where a node is a word and an edge means a transition, and then performing BFS. He said that was obvious and that he was more interested in knowing how I build the graph. I suggested a method to reduce the number of string comparisons by storing a count vector with each word. Count vector is a 26 length vector where count[i] = number of times that letter occurs in the word. I would do string comparison to identify neighbours only if the difference in count vectors in 2. Eg, cot = cat - a + o. String comparison is still needed because of false positives. Eg, oct = cat - a + o but cat -> oct is not a valid transition. He liked my approach and asked me to code, discussed the complexity.
Tips: * Don't be naive around a senior engineer. Be confident.
* Explain your approach before going ahead solving it. I missed that in Q1 and for a long time he didn't know what I was heading towards.
* Write clean code, practice coding on paper to make sure you write compilable code. Shabby code is a turn off.
* Show passion for the company you are applying for.
General Tips: * Be friendly and keep smiling.
* Know about the company, well in detail. Recent news, articles, acquisitions, organisational changes, new offices, new product, etc.
* Know about the volume the company handles, certain mind boggling figures, what the company *does not* do
* If you are introducing yourself as an expert in a certain field, be prepared for questions like "How will you contribute to our company with your expertise" type of questions.
* Be very very thorough with every single thing you write on your resume. A small point you weren't sure about might become the basis of your whole interview. Don't write things you are unsure of, or have worked very little on.
Skill Tips: * I think I didn’t take Visa very seriously. I was assuming they won’t take a undergrad and they won’t take me because I have 0 knowledge in web based technologies. I might have acted a little cocky.
* They had nice pie diagrams which shows that they had done thorough research about each and every candidate based on resume and the coding test.
* They value the coding test a lot.
* Be very thorough with the projects you write on resume. They will give you a problem which won't be straightforward and will map onto one of your course projects. You are expected to do the mapping seamlessly. Every bit of the discussion you have with the interviewer can be your next problem.
* Brush up on web based technologies if you can.
* There will be a HR round as well if you clear the technical interviews.
Skills: Maths(esp Probability), Design, Passion, Web Technologies, Technical Skill And Speaking Skill, Coding Skills
College Name: IIT Madras
Motivation: * Been the leader since more than half a century, been through the technological revolution.
* Revolutionising payments architecture. Building something of greatest need, so elegant and optimised, yet producing such consistent performance.
* Keeping up with the need of the generation by introducing features which are brand new. Eg, “all-purpose credit card”.
* Loved their PPT (Pre Placement Talk). Volume of the data and processing is IMMENSE. Billions of transactions in a year voluming up to trillions. More than 200 countries in the world --> these stats are HUGE.
* Fraud detection is a space I would have loved to work on given that I come from a Data Mining background.
Funny Moments: Chucked out before HR round :P
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. Why would you like to join Visa and why?
- Ans.
I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.
Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.
The company's commitment to security aligns with my passion for developing secure software solutions.
Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...
- Q2. Tell me about yourself
- Ans.
I'm a passionate software engineer with a strong background in full-stack development and a love for problem-solving.
Graduated with a degree in Computer Science from XYZ University.
Worked at ABC Corp, where I developed a web application that improved user engagement by 30%.
Proficient in languages like JavaScript, Python, and Java, with experience in frameworks like React and Django.
Enjoy collaborating in agile teams an...
Interview Preparation Tips
Experience: Coding Questions were fairly standard ones.
Duration: 75 minutes
Total Questions: 42
Round: Interview
Experience: Networks based questions, firewalls, TCP/IP and other OSI layers
Round: Interview
Experience: Coding questions. Asked to code on paper. Questions on Object Oriented Design.
Skills: Networks basics, OOPs basics, Coding Skills
College Name: IIT Guwahati
Motivation: Profiles offered, Package, Location
Interview Preparation Tips
Experience: Questions on
1. Programming: 10 Questions2. Machine Learning Hadoop MCQ: 6 Questions3. Networking MCQ: 6 Questions4. Operating System: 6 Questions5. Infrastructure: 6 Questions6. Application Security: 6 Questions
Tips: Questions were simple , except sections 2,5 unless you have a basic idea about it.
Duration: 75 minutes
Total Questions: 34+2
Round: Technical Interview
Experience: – Projects, Internship– Asymmetric and Symmetric encryption with some real world usage– Concepts behind Digital Signature and Digital Certificates– Detailed discussion on HTTPS– Basic OS concepts : Threads, Mutex , Semaphores– Basic OOPS concepts : Virtual functions , Function overloading and overriding , encapsulation.
Tips: Focus on Network Security concepts !
Round: Technical Interview
Experience: – Projects , Internship– Some discussion on Testing and how you would design a unit test case and a complete project test case. Discussion on Automated Testing.– How does a Web application work.– Software Development Models– Discussion on interpreted language and compiled language– Some DBMS basics for efficiency :- Indexing viz. B+trees , Hashing.– Some discussion on Apple Pay , VbV (Verified by Visa) (informal)
Round: HR Interview
Experience: Basic HR questions !
General Tips: Confidence is the key along with sufficient coding practice both on the IDE and pen-paper.
Skills: Network Security, Programming, Algorithms, Operating System
College Name: IIT ROORKEE
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Interview Questionnaire
7 Questions
- Q1. Given an array, Implement Binary search tree
- Ans.
Implement Binary Search Tree using given array of strings.
Sort the array in ascending order
Find the middle element and make it the root of the tree
Recursively create left and right subtrees using the left and right halves of the array
Repeat until all elements are added to the tree
- Q2. Given the above Binary search tree, print in ascending order
- Ans.
Print the given Binary search tree in ascending order
Traverse the left subtree recursively
Print the root node
Traverse the right subtree recursively
- Q3. Given an array of stock prices, find where to buy and where to sell for maximum profit in O(n)
- Q4. Resume based
- Q5. What are three problems Chennai faces?
- Ans.
Chennai faces problems related to water scarcity, traffic congestion, and pollution.
Water scarcity due to inadequate rainfall and poor management of water resources.
Traffic congestion due to the increasing number of vehicles and poor road infrastructure.
Pollution caused by industries, vehicular emissions, and improper waste disposal.
- Q6. Which one would you solve and how and why?
- Ans.
Need more context on the question to provide an answer.
Please provide more information on the problem to be solved.
Without context, it is difficult to provide a solution.
Can you please provide more details on the problem statement?
- Q7. What is most interesting thing about Visa?
Interview Preparation Tips
Experience: 4 Coding questions on Hackerrank platform, one and half hour time. I am not going to reveal the questions here, but one was a basic binary tree implementation and the other three were algorithmic and mathematical problems. They were kinda hard to solve in an hour and half. I could do only 1 and half of the other one. I got 115/300 points on that. I was one of the 16 people selected for the interview.
Tips: It all depends on how well you can focus on the test day. Just practice a lot on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 4
Round: Technical Interview
Experience: The first two questions I was able to do fast enough. I was also asked a few questions on my resume and coding-related internship. The last one, I showed an O(n*n) algorithm first and then modified it to O(n). Around 45 minutes.
Tips: Be thorough on the coding part in your resume. Think out aloud!
Round: Technical + HR Interview
Experience: Just a few normal questions regarding my projects and my favorite course and it's application to Visa. 15 minutes.
Tips: Once again, be thorough on your resume.
Round: HR Interview
Experience: Once again a normal round, just random questions as to whether I am interested and good enough in communication. 15 minutes.
Tips: Don't get shaken. Be ready for all kinds of questions. Especially about Visa relation to what you do
Skills: Smart Coding
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(4 Questions)
Round duration - 45 minutes
Round difficulty - Easy
This was a technical interview round.
- Q1. How does AJAX work?
- Ans.
AJAX allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes.
AJAX stands for Asynchronous JavaScript and XML.
It allows web pages to update content without reloading the entire page.
AJAX uses XMLHttpRequest object to send and receive data from a server.
Commonly used in web applications to provide a more responsive user experience.
- Q2. What is the difference between SOAP and REST?
- Ans.
SOAP is a protocol, while REST is an architectural style for web services.
SOAP is a protocol that uses XML for message format and relies on a request-response model.
REST is an architectural style that uses standard HTTP methods like GET, POST, PUT, DELETE.
SOAP is more rigid and requires more bandwidth, while REST is lightweight and flexible.
SOAP has built-in security features like WS-Security, while REST relies on exte...
- Q3. What is the difference between GET and POST methods in APIs?
- Ans.
GET is used to request data from a server, while POST is used to submit data to a server.
GET requests data from a specified resource, while POST submits data to be processed to a specified resource.
GET requests are cached by browsers, while POST requests are not.
GET requests can be bookmarked and shared, while POST requests cannot.
GET requests have length restrictions, while POST requests do not.
Example: Using GET to r...
- Q4. What is the Observer Pattern?
- Ans.
The Observer Pattern is a behavioral design pattern where an object (subject) maintains a list of dependents (observers) that are notified of any state changes.
Allows for one-to-many dependency between objects
When the subject's state changes, all observers are automatically notified and updated
Commonly used in event handling systems and GUI frameworks
(4 Questions)
Round duration - 40 minutes
Round difficulty - Easy
This was the second technical interview round.
- Q1. What is a singleton class?
- Ans.
A singleton class is a class that can only have one instance created throughout the entire application.
Singleton classes have a private constructor to prevent multiple instances from being created.
They typically provide a static method to access the single instance.
Commonly used for logging, database connections, and configuration settings.
- Q2. What is meant by immutability in Java?
- Ans.
Immutability in Java refers to the property of objects whose state cannot be changed once they are created.
Immutability ensures that once an object is created, its state cannot be modified.
Immutable objects are thread-safe and can be shared without the risk of data corruption.
String class in Java is an example of an immutable class.
To create an immutable class, make the class final, all fields private, and provide only...
- Q3. What is dependency injection?
- Ans.
Dependency injection is a design pattern where components are given their dependencies rather than creating them internally.
Allows for easier testing by providing mock dependencies
Promotes loose coupling between components
Improves code reusability and maintainability
Examples: Constructor injection, Setter injection, Interface injection
- Q4. How do you create an immutable class in Java?
- Ans.
To create an immutable class in Java, make the class final, make all fields private and final, provide only getter methods, and do not provide any setter methods.
Make the class final to prevent inheritance.
Make all fields private and final to prevent modification.
Provide only getter methods to access the fields.
Do not provide any setter methods to modify the fields.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Infibeam Interview FAQs
Some of the top questions asked at the Infibeam Software Engineer interview -
Tell us how to improve this page.
Infibeam Interviews By Designations
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Project Engineer Interview Questions
- Lead Engineer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Software Engineer Interview Questions from Similar Companies
Infibeam Software Engineer Reviews and Ratings
based on 4 reviews
Rating in categories
|
Software Developer
4
salaries
|  ₹3.4 L/yr - ₹21.5 L/yr |
|
Program Manager
4
salaries
| ₹14 L/yr - ₹40 L/yr |
|
Product Manager
4
salaries
| ₹6 L/yr - ₹40 L/yr |
|
Web Designer
4
salaries
| ₹1.7 L/yr - ₹3.8 L/yr |
|
Senior Software Engineer
4
salaries
| ₹12.5 L/yr - ₹29 L/yr |
Paytm
Angel One
Truhome Finance
Mobikwik
- Home >
- Interviews >
- Infibeam Interview Questions
