Swiggy Senior Software Developer Interview Questions and Answers

Low level design | duration 60 min

Q1. Rain water trapped problem
Ans. 
Rain water trapped problem
• Calculate the amount of rainwater trapped between buildings or in a given landscape

• Use two pointers approach to find the maximum height on left and right of each building

• Subtract the height of each building from the minimum of the maximum heights to get the trapped water amount
Answered by AI
Add your answer

Data and Algo test need to do live in front of interviewers.

The first round was an online assesment conducted on the hackerrank platform. This round
consisted of 3 DSA Question, 2 Medium and 1 Hard. The duration of the test was 1hr
45mins.

Q1. The question was really long, but it was essentially asking us to design a polling system with two actors (CLI only): the user and the administrator. The admin's tasks were to create a poll, delete a pol...read more
Add your answer

Q1. He asked me about the box model in CSS. He expected me to remember some basic Bootstrap and Tailwind classes, as well as the Bootstrap grid system. He was happy with the number of projects I had made and...read more
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

BFS Implementation of a jug question.

Q1. Few hashmap questions
Add your answer
Q2. Object Oriented Programming questions
Add your answer

Q1. Maximum Sum Subarray
Add your answer
Q2. Insert node in binary search tree
Ans. 
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
• 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 node. If it is greater, move to the right child node.

• Repeat this process until reaching a leaf node, then insert ...read more
Answered by AI
Add your answer