AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Swiggy Software Developer Interview Questions and Answers
17 Interview questions
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequenc...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the curren...
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniqu...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
Count Ways To Travel Triangular Pyramid
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single step...
Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.
Bob can move to any adjacent vertex in a single step
Bob must return to vertex 'O' after exactly 'N' steps
Calculate the number of different ways Bob can complete the journey
Return the result modulo 1000000007
Consider the constraints provided
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 '...Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.
Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.
Sort the generated strings in lexicographically increasing order before outputting them.
What people are saying about Swiggy
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they are...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
Shuffle Two Strings Problem Statement
You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:
- Th...
Check if a string is formed by interleaving two other strings.
Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.
Use dynamic programming to efficiently solve the problem.
Handle edge cases like empty strings or unequal lengths of A, B, and C.
Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.
Hurdle Game Problem Statement
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number o...
Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.
Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level
Return the current level as the number of levels cleared
Ninja and Intersection of Lines
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the i...
Find the intersection point of two lines on a 2D plane given their coordinates.
Calculate the slopes of both lines using the given coordinates.
Use the slope-intercept form of a line to find the equations of the two lines.
Solve the equations simultaneously to find the intersection point.
Return the coordinates of the intersection point with precision up to 6 decimal places.
Cycle Detection in Directed Graph
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.
Input:
The first line of input contains ...Detect cycles in a directed graph and return true if a cycle exists, false otherwise.
Use Depth First Search (DFS) to detect cycles in the directed graph.
Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.
If a vertex is visited and is present in the recursion stack, then a cycle exists.
Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 ->...
A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.
A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.
URLs typically consist of a protocol (such as ...
Swiggy Software Developer Interview Experiences
5 interviews found
HAckerrank based test
I appeared for an interview in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
- Q1.
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
- Ans.
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
- Q2.
Subsequences of String Problem Statement
You are provided with a string
'STR'that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen... - Ans.
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Interview Preparation Tips
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
Skills evaluated in this interview
I appeared for an interview before May 2021.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
1 easy and 2 medium-hard DSA problems to solve
- Q1.
Hurdle Game Problem Statement
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
- Ans.
Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.
Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level
Return the current level as the number of levels cleared
- Q2.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they ar...
- Ans.
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
- Q3.
Count Ways To Travel Triangular Pyramid
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...
- Ans.
Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.
Bob can move to any adjacent vertex in a single step
Bob must return to vertex 'O' after exactly 'N' steps
Calculate the number of different ways Bob can complete the journey
Return the result modulo 1000000007
Consider the constraints provided
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
2 DSA problems and computer subject questions
- Q1.
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 of length 'K' with no consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.
Sort the generated strings in lexicographically increasing order before outputting them.
- Q2.
Shuffle Two Strings Problem Statement
You are provided with three strings
A,B, andC. The task is to determine ifCis formed by interleavingAandB.Cis considered an interleaving ofAandBif:- T...
- Ans.
Check if a string is formed by interleaving two other strings.
Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.
Use dynamic programming to efficiently solve the problem.
Handle edge cases like empty strings or unequal lengths of A, B, and C.
Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
DSA round
- Q1.
Ninja and Intersection of Lines
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...
- Ans.
Find the intersection point of two lines on a 2D plane given their coordinates.
Calculate the slopes of both lines using the given coordinates.
Use the slope-intercept form of a line to find the equations of the two lines.
Solve the equations simultaneously to find the intersection point.
Return the coordinates of the intersection point with precision up to 6 decimal places.
- Q2.
Cycle Detection in Directed Graph
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return
true. Otherwise, returnfalse.Input:
The first line of input contains... - Ans.
Detect cycles in a directed graph and return true if a cycle exists, false otherwise.
Use Depth First Search (DFS) to detect cycles in the directed graph.
Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.
If a vertex is visited and is present in the recursion stack, then a cycle exists.
Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
It is a managerial round
- Q1. How does a URL work and what is a load balancer?
- Ans.
A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.
A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.
URLs typically consist of a protocol (such as HTTP ...
Interview Preparation Tips
Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects
Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
- Q1.
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...
- Ans.
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
- Q2.
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
- Ans.
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Next Greater Element Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Interview Preparation Tips
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q2.
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...
- Ans.
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
- Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
- Ans.
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
- Q1.
Rearrange Array Elements Problem Statement
Given an array
Acontaining 'N' integers and an integerm, rearrange the elements of the array such that the differences between the array elements andmare sor... - Ans.
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
- Q2.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
- Q1.
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
1
232
34545
4567654Explanation:
The pat...
- Ans.
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
- Q2. What is the difference between a web server and an application server?
- Ans.
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
- Q3. How does the internet work?
- Ans.
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
- Q4. Write a SQL query to find the nth highest salary.
- Ans.
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with 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
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1.
Rotate Matrix Right K Times
You are given a matrix
MATof size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma... - Ans.
Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.
Iterate 'K' times to perform right rotation on the matrix
Shift each column to the right by one position in each rotation
Handle wrapping around the matrix when shifting columns
Return the matrix elements row-wise after 'K' rotations
- Q2.
Word Search Problem Statement
Given a two-dimensional grid of size
N x Mconsisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.The 'WORD' can b...
- Ans.
Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.
Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use recursion to explore all possible paths from a starting cell to form the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of how man...
(3 Questions)
Round duration - 75 minutes
Round difficulty - Medium
Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.
- Q1.
Problem Statement: Largest Island
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
- Ans.
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the...
- Q2.
Pythagorean Triplet Problem
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Expl...
- Ans.
Check if there exists a Pythagorean triplet in a given array of integers.
Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number.
- Q3.
Top View of Binary Tree Problem Statement
Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...
- Ans.
Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.
Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.
Return the values of the topmost nodes in the map as the top view of the Binary Tree.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.
- Q1.
Fixing a Swapped Binary Search Tree
Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.
Input:
The first... - Ans.
Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.
Identify the two nodes that are swapped by mistake in the BST.
Swap the values of the two identified nodes to restore the BST.
Perform an in-order traversal of the BST to verify the correct restoration.
Ensure no extra space other than the recursion stack is used for the solution.
- Q2.
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named
Stackwhich supports the following operations, each in O(1... - Ans.
Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.
Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure that each operation runs in constant time O(1).
Handle edge cases like empty stack appropriately.
Test the implementation with sample queri...
Interview Preparation Tips
Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.
Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Indiamart Intermesh
Brhamanc Brhamanc
posted on 21 Dec 2020
Interview Questionnaire
7 Questions
- Q1. Some of The most important Salary Immideyetly Processes
- Q2. Oneandof Yaer NoukrNoukri.com *****
- Q3. Noukri.com Online Payment
- Q4. Fast forward Noukri.com
- Q5. Brhamanc IT Course hdca and core java programming language Brhamanc IT Information Technology World Asia Pacific region India Tamilnadu Coimbatore Chinnathdagam 641108
- Q6. Brhamanc IT Course hdca and core java programming language
- Q7. QUALIFICATION:10TH STANDARD
Software Developer Interview Questions & Answers
Indiamart Intermesh
Anonymous
posted on 22 Mar 2021
I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Fibonacci series, Prime function, linked lisk value access, query
Interview Preparation Tips
Best of luck
Chirag Varshney
(4 Questions)
- Q1. Explain Deadlock?
- Ans.
Deadlock is a situation in computing where two or more processes cannot proceed because each is waiting for the other to release resources.
Occurs in multi-threaded environments when processes hold resources and wait for others.
Example: Process A holds Resource 1 and waits for Resource 2, while Process B holds Resource 2 and waits for Resource 1.
Can lead to system inefficiency and unresponsiveness.
Deadlock detection and...
- Q2. Explain Red Black Tree?
- Ans.
A Red-Black Tree is a balanced binary search tree with specific properties to ensure efficient operations.
Each node is colored either red or black.
The root node is always black.
Red nodes cannot have red children (no two reds in a row).
Every path from a node to its descendant leaves must have the same number of black nodes.
This structure ensures O(log n) time complexity for insertion, deletion, and search operations.
Exa...
- Q3. Find local minima in a 1-D array?
- Q4. Find local minima in 2-D array?
- Ans.
Local minima in a 2-D array are elements smaller than their neighbors. We can find them using various algorithms.
A local minimum is defined as an element that is less than its adjacent elements.
For example, in the array [[9, 8, 7], [6, 5, 4], [3, 2, 1]], the element 1 is a local minimum.
To find local minima, iterate through each element and compare it with its neighbors (up, down, left, right).
Consider edge cases where...
Skills evaluated in this interview
Swiggy Interview FAQs
Tell us how to improve this page.
Swiggy Interviews By Designations
- Swiggy Business Analyst Interview Questions
- Swiggy Sales Manager Interview Questions
- Swiggy Fleet Manager Interview Questions
- Swiggy Assistant Store Manager Interview Questions
- Swiggy Store Manager Interview Questions
- Swiggy MIS Executive Interview Questions
- Swiggy Business Associate Interview Questions
- Swiggy Team Lead Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Software Developer Interview Questions from Similar Companies
Swiggy Software Developer Reviews and Ratings
based on 9 reviews
Rating in categories
|
Delivery Boy
898
salaries
|  ₹0.4 L/yr - ₹5.1 L/yr |
|
Fleet Manager
640
salaries
| ₹2.5 L/yr - ₹6 L/yr |
|
Sales Manager
571
salaries
| ₹2.8 L/yr - ₹9.5 L/yr |
|
Assistant Manager
527
salaries
| ₹6.1 L/yr - ₹15.5 L/yr |
|
Store Manager
495
salaries
| ₹2.4 L/yr - ₹7.2 L/yr |
Eternal Limited
Dunzo
FoodPanda
Rapido
- Home >
- Interviews >
- Swiggy Interview Questions
