AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Info Edge
Compare
Filter interviews by
Info Edge Software Developer Intern Interview Questions and Answers
Info Edge Software Developer Intern Interview Experiences
2 interviews found
excellentlyeel
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Multi-Level LinkedList sorting
- Q2. Replacement of blank space with %20 in string without using any new string.
- Ans.
Replace blank space with %20 in string without using new string.
Loop through string and replace blank space with %20 in place.
Use two pointers, one for original string and one for modified string.
Use ASCII value of %20 to replace blank space in place.
Interview Preparation Tips
Anonymous
Interview Preparation Tips
College Name: Thapar University, Patiala
What people are saying about Info Edge
Interview questions from similar companies
Interview Questionnaire
12 Questions
- Q1. Given a no K and an array. Find pair of elements whose sum is equal to given no K
- Ans.
Find pair of elements in an array whose sum is equal to a given number K.
Iterate through the array and for each element, check if K minus the element exists in the array.
Use a hash table to store the elements and their indices for faster lookup.
If multiple pairs exist, return any one of them.
If no pair exists, return null or an appropriate message.
- Q2. If there is a website run by 2 servers. These 2 servers balances the load using Load Balancer. So, if 1 session is created on 1 server and say load is shift to another server immediately, then how session ...
- Ans.
Session is maintained using session affinity or sticky sessions.
Session affinity ensures that a user's session is always directed to the same server.
Load balancer uses a unique identifier to route requests to the same server.
Sticky sessions can be implemented using cookies or URL rewriting.
Session replication can also be used to maintain session data across multiple servers.
- Q3. WAP to implement some basic Design Patterns like Singleton?
- Ans.
Singleton pattern ensures only one instance of a class is created and provides a global point of access to it.
Create a private constructor to prevent direct instantiation of the class
Create a private static instance of the class
Create a public static method to access the instance
Ensure thread safety by using synchronized keyword or static initialization block
Examples: Logger, Configuration Manager, Database Connection
- Q4. Abstract class? How it is different from interface? Is multiple inheritance possible in php? How?
- Ans.
Explaining abstract class, interface and multiple inheritance in PHP.
Abstract class is a class that cannot be instantiated and can have abstract methods.
Interface is a collection of abstract methods and constants that can be implemented by a class.
Multiple inheritance is not possible in PHP, but can be achieved using interfaces.
Interfaces can be implemented by multiple classes, allowing for multiple inheritance-like be
- Q5. Write a stored procedure from a given set of tables and conditions. Simple one
- Ans.
Write a stored procedure from given tables and conditions
Identify the tables and their relationships
Determine the conditions to be used in the stored procedure
Write the SQL code for the stored procedure
Test the stored procedure to ensure it returns the desired results
- Q6. How to increase php memory at run time, if it exhausts?
- Ans.
To increase PHP memory at run time, modify the php.ini file or use ini_set() function.
Edit the memory_limit value in php.ini file
Use ini_set('memory_limit', '256M') function to increase memory limit at run time
Check for memory leaks in the code
Use unset() function to free up memory after use
- Q7. What all we can do with php.ini?
- Ans.
php.ini is a configuration file for PHP that allows users to customize various settings.
Change PHP settings such as memory limit, file upload size, and error reporting
Enable or disable extensions and modules
Set timezone and language settings
Configure email settings
Control caching and session settings
- Q8. Session and cookies?
- Q9. Javascript clausers?
- Q10. Jquery function to get domain from a url?
- Ans.
Use window.location to get domain from a url in jQuery.
Use window.location to get the full url
Use .hostname to get the domain name
Use .replace() to remove 'www.' if present
- Q11. WAP to get smallest plindron number larger than the given no?
- Ans.
WAP to find smallest palindrome number larger than given number.
Convert the given number to string and check if it is already a palindrome.
If not, increment the number and check if it is a palindrome.
Repeat until a palindrome number larger than the given number is found.
Use a while loop to implement the above steps.
- Q12. WAP to check if linked list elements is a palindrome without using any extra space?
- Ans.
WAP to check if linked list elements is a palindrome without using any extra space.
Traverse the linked list and reverse the second half of the list
Compare the first half with the reversed second half
Use two pointers to traverse the list, one at normal speed and other at double speed
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Find the first non repetitive character in a string?
- Ans.
Find the first non-repeating character in a string.
Create a hash table to store the frequency of each character in the string.
Iterate through the string and check the frequency of each character.
Return the first character with a frequency of 1.
- Q2. What is connection pooling
- Ans.
Connection pooling is a technique of reusing database connections to improve performance.
Connection pooling helps to reduce the overhead of creating and destroying database connections.
It maintains a pool of connections that can be reused by multiple clients.
Connection pooling is commonly used in web applications to handle multiple requests simultaneously.
It can be configured with parameters like maximum number of conn...
- Q3. Write a singleton class in php?
- Ans.
A singleton class in PHP is a class that can only be instantiated once.
Create a private constructor to prevent direct instantiation
Create a private static variable to hold the instance of the class
Create a public static method to get the instance of the class
Ensure that the public static method always returns the same instance
- Q4. How to write a Connection class to MySQL database using PHP?
- Ans.
To connect to MySQL database using PHP, create a Connection class.
Use mysqli_connect() function to establish a connection
Pass the database credentials as parameters to the function
Create a constructor method to initialize the connection
Create a query method to execute SQL queries
Close the connection using mysqli_close() method
- Q5. What are the different types of error in php?
- Ans.
There are three types of errors in PHP: syntax errors, runtime errors, and logical errors.
Syntax errors occur when the code is not written correctly, such as missing semicolons or parentheses.
Runtime errors occur during the execution of the code, such as trying to access an undefined variable.
Logical errors occur when the code runs without errors, but produces unexpected results, such as a miscalculation in a formula.
- Q6. How session works in php?
- Ans.
Session in PHP allows to store user data on the server for later use.
Session starts when a user logs in and ends when the user logs out or the session expires.
Session data is stored on the server and identified by a unique session ID.
Session variables can be set and accessed using the $_SESSION superglobal array.
Session can be destroyed using the session_destroy() function.
Session can be used to store user-specific dat...
- Q7. Find missing element in an array of elements from 0 to n-1?
- Ans.
Find missing element in an array of elements from 0 to n-1
Calculate sum of all elements in array and subtract from sum of n natural numbers
Use XOR operation on all elements and n natural numbers
Sort the array and find the missing element
Interview Preparation Tips
Experience: You have been given stack of documents that have already been processed and some that have not. your task is to classify these documents into one of the eight categories: [1,2,3..8]. However you notice that there are already large amount of documents which have already been correctly processed(training data). you decide to use machine learning on this data in order to categorize.First line of the input file contain T number of documents. T lines will follow each containing a series of space separated words which represents the processed word.
Skills: PHP, data base, 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
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
SAMKIT JAIN
I was interviewed in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.
- 28 MCQs based on core CS
- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions
- Q1.
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...
- Ans.
Remove duplicates from a sorted linked list without adjacent duplicates.
Traverse the linked list while comparing current and next nodes.
If they are equal, skip the next node by updating the current node's next pointer.
Repeat until the end of the list is reached.
- Q2.
Course Schedule Problem Statement
You are enrolled as a student and must complete
Ncourses, numbered from 1 to N, to earn your degree.Some courses have prerequisites, which means that to take course
i,... - Ans.
Check if it is feasible to complete all courses with prerequisites.
Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.
Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).
If there is no cycle, then it is feasible to complete all courses.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...
- Ans.
Find the Lowest Common Ancestor of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the Lowest Common Ancestor.
Implement a recursive function to efficiently find the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Pretty Good Round. Fast Paced. We covered a lot of ground.
- Q1.
Binary Search Tree Iterator Problem Statement
Design and implement a class
BSTIteratorto perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me... - Ans.
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
Implement a parameterized constructor to initialize the iterator with the root of the BST.
Implement a method 'next()' to return the next smallest element in in-order traversal.
Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.
Ensure the output is the in-order traversal of the
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.
Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.
Return the maximum length ...
- Q3.
BFS in Graph Problem Statement
You are given an undirected and disconnected graph
G(V, E)havingVvertices numbered from0toV-1andEedges. Your task is to print its BFS traversal starting from the 0t... - Ans.
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.
Use a queue to keep track of nodes to visit next.
Keep a visited array to avoid revisiting nodes.
Print the BFS traversal path as the nodes are visited.
Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
- Q4.
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with
Vvertices (labeled 0, 1, ..., V-1) andEedges, each edge connects two nodesXandYwith a specified weight representing the dis... - Ans.
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity, except for the source node which is 0.
Update distances t...
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
Bar Raised Round. Definitely felt the difficulty.
- Q1.
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
- Ans.
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
If no such character is found, return the first character of the string
Interview Preparation Tips
Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews.
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.
Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.
Skills evaluated in this interview
I applied via Campus Placement
Interview Preparation Tips
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.
Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix
Tips: All question were from geeksforgeeks
So practice it well ..u will make through it
Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible
Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...
Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens
Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar
I was interviewed before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
- Q1. How can you check if two strings are anagrams of each other?
- Ans.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Interview Preparation Tips
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedSkills 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
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
|
Senior Executive
745
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Associate Senior Executive
665
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
601
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Sales Executive
448
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
352
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
JustDial
Indiamart Intermesh
PolicyBazaar
- Home >
- Interviews >
- Info Edge Interview Questions >
- Info Edge Software Developer Intern Interview Questions
