Swiggy Software Development Engineer Interview Questions and Answers

Design cab booking system on hacker rank platform

It was on naukri website 62 question out of which 2 were coding rest were CS fundamentals and apti

1.5 hours long, platform was hackerearth.

Q1. Reverse a Linked List
Ans. 
Reverse a linked list by changing the pointers direction.
• Start with three pointers: current, previous, and next.

• Iterate through the linked list, updating the pointers to reverse the direction.

• Update the head pointer to the last node to complete the reversal.
Answered by AI
Add your answer

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