Info Edge Senior Software Engineer Interview Questions, Process, and Tips

Q1. OOPS, java, data structure
Add your answer
Q2. Coding assignment for binary search
Ans. 
Implement binary search algorithm to find a target string in a sorted array of strings.
• Ensure the array of strings is sorted before performing binary search.

• Compare the target string with the middle element of the array and adjust the search range accordingly.

• Repeat the process until the target string is found or the search range is exhausted.
Answered by AI
Add your answer

Q1. What is your Notice period
Add your answer
Q2. Expectation from new job
Add your answer

Q1. Easy DSA questions on string manipulation
Add your answer

Q1. Build an MVC architecture
Ans. 
MVC architecture separates an application into Model, View, and Controller components for better organization and scalability.
• Model represents the data and business logic

• View displays the data to the user

• Controller handles user input and updates the model

• Example: Model - User class with properties like name, email; View - HTML template to display user info; Controller - User controller to handle user actions
Answered by AI
Add your answer

Q1. Discussed previous job experiences.
Add your answer
Q2. Was asked if I am comfortable working on weekends/late nights during emergencies.
Add your answer

Q1. What are your strengths/weaknesses.
Add your answer

Aptitude test was on hacker earth

No coding test was taken by the interviewrrwe

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round where the interviewer asked me 2 DSA based problems.

Q1. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....read more
Ans. 
The idea is to traverse the given list of prices and find a local minimum of every increasing sequence. We can gain maximum profit if we buy the shares at the starting of every increasing sequence (local minimum) and sell them at the end of the increasing sequence (local maximum). 
Steps :
1. Find the local minima and store it as starting index. If not exists, return.
2. Find the local maxima. and store it as an endi...read more
Answered by CodingNinjas
View 5 more answers
Q2. Number of Flips
Ninja is learning the binary representation of the numbers. He wanted to practice the topic, so he picked a question. The problem statement says, two numbers, ‘A’ and ‘B’ are given. Find th...read more
Ans. 
For this question, it can be observed that there can be only two possible solutions for an alternate binary string. The resultant string will look like either of the two cases: 

1. 010101… 
2. 101010…
3. 
Now, in order to find the minimum replacements, count the number of replacements to convert the string in type 1 and store it in variable count.
For type2, the number of replacements will be n-count (n is le...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round where the interviewer asked me 2 DSA based problems.

Q1. Boundary Traversal
You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.
NOTE:
The boundary ...read more
Ans. 
The idea is to split the problem into 3 parts:
• Print the left boundary in a top-down manner.
• Print the leaf nodes in the same order as in the inorder traversal.
• Print the right boundary in a bottom-up manner.
Time Complexity : O(N)
Answered by CodingNinjas
View 1 more answer
Q2. Reverse List In K Groups
You are given a linked list of 'N' nodes and an integer 'K'. You have to reverse the given linked list in groups of size K i.e if the list contains x nodes numbered...read more
Ans. 
Recursion can be used to solve this problem. We reverse every group of k linked list nodes and attach it to the previous group. 

Steps :
1) The first step is to check whether the Head is NULL or Not, if its NULL then we can directly return NULL,
2) If the Head is not NULL, then we need to check the length of Linked List starting from current Head.
3) If the length is less than k , then there is no need to reverse it a...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked behavioral problems.

Q1. Basic HR Questions
1. What are technical challenges that you solved?
2. Where do you want to work & what interests you?
3. Why Info Edge?
Ans. 
Tip 1 : The cross questioning can go intense some time, think before you speak.
Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring. How all is the...read more
Answered by CodingNinjas
Add your answer