Swiggy Associate Software Engineer Interview Questions and Answers

Q1. Focus on algorithms - trees, graphs. Questions on improving algorithm performance. Converting algorithm to code.
Add your answer

AI

C#

Q1. Insert node in BST
Ans. 
Insert a node in a Binary Search Tree (BST)
• Start at the root node and compare the value of the node to be inserted with the current node

• If the value is less than the current node, move to the left child. If greater, move to the right child

• Repeat the process until reaching a leaf node, then insert the new node as a left or right child
Answered by AI
Add your answer
Q2. Design Lift system
Ans. 
Design a lift system for efficient vertical transportation
• Consider the number of floors in the building

• Include safety features like emergency stop button

• Optimize for speed and energy efficiency

• Implement a user-friendly interface for passengers
Answered by AI
Add your answer

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer

Q1. Microservices in-depth (advantages/disadvantages, service mesh, communication protocol, monitoring, resilience pattern)
Add your answer
Q2. Binary search (not joking)
Add your answer

Q1. Programming Language in-depth
Add your answer
Q2. Leetcode Hard Largest Miltiple of 3
Ans. 
Given an array of digits, find the largest multiple of 3 that can be formed from the digits.
• Sort the array in descending order.

• If the sum of digits is divisible by 3, return the array as a string.

• If the sum of digits modulo 3 is 1, remove the smallest digit that has a remainder of 1 when divided by 3, or the two smallest digits that have a remainder of 2 when divided by 3.

• If the sum of digits modulo 3 is 2, remove the ...read more
Answered by AI
Add your answer

Design and code a parking lot application

Q1. Past work and digging around that. few changes in past work and how to implement them.
Add your answer

Q1. How to ensure that there is no data corruption when data is being streamed and processed asynchronously
Ans. 
To ensure no data corruption during asynchronous streaming and processing, use data validation, error handling, and checksums.
• Implement data validation techniques to check the integrity of the streamed data.

• Handle errors and exceptions properly to prevent data corruption.

• Use checksums or hash functions to verify the integrity of the data.

• Implement reliable communication protocols like TCP/IP to ensure data integrity.

• Co...read more
Answered by AI
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

Q1. 
Maximum Sum of Two Non-Overlapping Subarrays
Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.
...read more
Ans. 
The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.
• Iterate through the array and calculate the sum of each subarray of length K

• Store the maximum sum obtained from the first subarray

• Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

• Store the maximum sum obtained from the second subarray

• Return the sum of the two maximum
Answered by AI
Add your answer
Q2. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
The task is to find the count of distinct subsequences in a given string.
• Use dynamic programming to solve the problem.

• Create a 2D array to store the count of distinct subsequences for each prefix of the string.

• Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

• For each character in the string, calculate the count of distinct subsequences by considering two cases: including...read more
Answered by AI
Add your answer
Q3. 
Array Intersection Problem Statement
Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...read more
Ans. 
The task is to find the intersection of two integer arrays/lists.
• Read the number of test cases

• For each test case, read the size and elements of the first array/list

• Read the size and elements of the second array/list

• Find the intersection of the two arrays/lists

• Print the intersection elements in the order they appear in the first array/list
Answered by AI
View 2 more answers

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

Q1. 
Number of Islands Problem Statement
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...read more
Ans. 
The task is to find the number of islands in a grid consisting of 0s and 1s.
• An island is a group of 1s connected horizontally, vertically, or diagonally

• The grid is surrounded by 0s on all four edges

• Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

• Initialize a visited array to keep track of visited cells

• For each unvisited cell with a value of 1, p...read more
Answered by AI
Add your answer
Q2. 
Arrangement Problem Statement
Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].
Input:
The input start...read more
Ans. 
The goal is to find the number of permutations of a list satisfying certain conditions.
• Iterate through all permutations of the list

• Check if each permutation satisfies the given conditions

• Count the number of permutations that satisfy the conditions

• Return the count for each test case
Answered by AI
Add your answer
Q3. 
Idempotent Matrix Verification
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
Input:
The first line cont...read more
Ans. 
An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.
• Check if the given matrix satisfies the property M*M = M

• Iterate through each element of the matrix and perform the matrix multiplication

• Compare the result with the original matrix

• If they are equal, return true; otherwise, return false
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

Q1. Can you design an attendance management system?
Ans. 
Design attendance management system
• Create a database to store employee information

• Implement a user interface for employees to mark their attendance

• Develop a system to track and record attendance data

• Generate reports and analytics based on attendance data
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.