Swiggy Interview Questions

Showing 33 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Swiggy. The higher the ranking, the more likely you'll encounter it in a Swiggy interview.

Question

Frequency

Difficulty

Maximize Area of Square Hole in Grid

Imagine a grid with horizontal and vertical bars that can be removed. Find the largest possible square you can cut out by strategically removing some of these bars to create a square-shaped hole.

ArraysTwo PointersSliding Windows

If you have a Swiggy interview, it's very likely that you will get this question

#1. Maximize Area of Square Hole in Grid

Imagine a grid with horizontal and vertical bars that can be removed. Find the largest possible square you can cut out by strategically removing some of these bars to create a square-shaped hole.

ArraysTwo PointersSliding Windows

This question is very likely to be asked in your Swiggy interview

Minimum Value to Get Positive Step by Step Sum

You are given an array of integers. Find the minimum positive starting value so that the step-by-step sum is never less than 1.

ArraysGreedy Algorithms

If you have a Swiggy interview, it's very likely that you will get this question

#2. Minimum Value to Get Positive Step by Step Sum

You are given an array of integers. Find the minimum positive starting value so that the step-by-step sum is never less than 1.

ArraysGreedy Algorithms

This question is very likely to be asked in your Swiggy interview

Next Greater Element I

You're given two arrays. For each number in the first array, find the next larger number in the second array.

If you have a Swiggy interview, it's very likely that you will get this question

#3. Next Greater Element I

You're given two arrays. For each number in the first array, find the next larger number in the second array.

This question is very likely to be asked in your Swiggy interview

Sort Colors

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers

If you have a Swiggy interview, it's very likely that you will get this question

#4. Sort Colors

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers

This question is very likely to be asked in your Swiggy interview

Count Good Meals

You're given a list of meals, each with a certain deliciousness value. Determine how many pairs of meals have a combined deliciousness that is a power of two.

ArraysTwo Pointers

Somewhat likely

If you have a Swiggy interview, you might get this question

#5. Count Good Meals

You're given a list of meals, each with a certain deliciousness value. Determine how many pairs of meals have a combined deliciousness that is a power of two.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Swiggy interview

Merge Sorted Array

You are given two sorted integer arrays. Merge the second array into the first one, maintaining the sorted order.

ArraysTwo Pointers

Somewhat likely

If you have a Swiggy interview, you might get this question

#6. Merge Sorted Array

You are given two sorted integer arrays. Merge the second array into the first one, maintaining the sorted order.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Swiggy interview

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

Somewhat likely

If you have a Swiggy interview, you might get this question

#7. Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

This question is somewhat likely to be asked in your Swiggy interview

Happy Number

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

Hash TableMathTwo Pointers

Somewhat likely

If you have a Swiggy interview, you might get this question

#8. Happy Number

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

Hash TableMathTwo Pointers

This question is somewhat likely to be asked in your Swiggy interview

Daily Temperatures

Given a list of daily temperatures, find how many days you have to wait until a warmer temperature. Return a list where each element represents the waiting days for each day's temperature.

Somewhat likely

If you have a Swiggy interview, you might get this question

#9. Daily Temperatures

Given a list of daily temperatures, find how many days you have to wait until a warmer temperature. Return a list where each element represents the waiting days for each day's temperature.

This question is somewhat likely to be asked in your Swiggy interview

Integer to Roman

Convert a given integer into its Roman numeral representation. You need to understand the mapping between integer values and Roman symbols to perform the conversion accurately.

ArraysGreedy Algorithms

Somewhat likely

If you have a Swiggy interview, you might get this question

#10. Integer to Roman

Convert a given integer into its Roman numeral representation. You need to understand the mapping between integer values and Roman symbols to perform the conversion accurately.

ArraysGreedy Algorithms

This question is somewhat likely to be asked in your Swiggy interview

Fair Candy Swap

Two people, Alice and Bob, have candy bars of different sizes. Determine how to swap one candy bar from each person so that they both have the same total amount of candy.

ArraysTwo Pointers

Somewhat likely

If you have a Swiggy interview, you might get this question

#11. Fair Candy Swap

Two people, Alice and Bob, have candy bars of different sizes. Determine how to swap one candy bar from each person so that they both have the same total amount of candy.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Swiggy interview

Course Schedule

Determine if it is possible to finish all courses given prerequisite relationships between them. Essentially, detect if a cycle exists in the course dependencies.

Somewhat likely

If you have a Swiggy interview, you might get this question

#12. Course Schedule

Determine if it is possible to finish all courses given prerequisite relationships between them. Essentially, detect if a cycle exists in the course dependencies.

This question is somewhat likely to be asked in your Swiggy interview

Maximum Profit in Job Scheduling

You're given a list of jobs with start times, end times, and profits. Find the maximum profit you can obtain by scheduling a subset of jobs that don't overlap.

ArraysBinary SearchDynamic Programming

If you have a Swiggy interview, it's unlikely that you will get this question

#13. Maximum Profit in Job Scheduling

You're given a list of jobs with start times, end times, and profits. Find the maximum profit you can obtain by scheduling a subset of jobs that don't overlap.

ArraysBinary SearchDynamic Programming

This question is not likely to be asked in your Swiggy interview

Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

If you have a Swiggy interview, it's unlikely that you will get this question

#14. Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

This question is not likely to be asked in your Swiggy interview

Longest Consecutive Sequence

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. These consecutive numbers do not need to be adjacent in the original array.

If you have a Swiggy interview, it's unlikely that you will get this question

#15. Longest Consecutive Sequence

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. These consecutive numbers do not need to be adjacent in the original array.

This question is not likely to be asked in your Swiggy interview

Unique Binary Search Trees

Given an integer n, determine how many structurally unique binary search trees can store values from 1 to n. Calculate the number of possible BST shapes for a given number of nodes.

Dynamic ProgrammingTrees

If you have a Swiggy interview, it's unlikely that you will get this question

#16. Unique Binary Search Trees

Given an integer n, determine how many structurally unique binary search trees can store values from 1 to n. Calculate the number of possible BST shapes for a given number of nodes.

Dynamic ProgrammingTrees

This question is not likely to be asked in your Swiggy interview

Minimum Number of Work Sessions to Finish the Tasks

You're given a list of tasks with varying durations and a maximum session time. Determine the fewest work sessions needed to complete all tasks, given each task must be finished within a single session.

ArraysDynamic ProgrammingBit Manipulation

If you have a Swiggy interview, it's unlikely that you will get this question

#17. Minimum Number of Work Sessions to Finish the Tasks

You're given a list of tasks with varying durations and a maximum session time. Determine the fewest work sessions needed to complete all tasks, given each task must be finished within a single session.

ArraysDynamic ProgrammingBit Manipulation

This question is not likely to be asked in your Swiggy interview

Subarray Sum Equals K

Determine the total number of continuous subarrays within a given array that sum up to a specific target value, k.

ArraysSliding Windows

If you have a Swiggy interview, it's unlikely that you will get this question

#18. Subarray Sum Equals K

Determine the total number of continuous subarrays within a given array that sum up to a specific target value, k.

ArraysSliding Windows

This question is not likely to be asked in your Swiggy interview

Majority Element

Find the element that appears more than n/2 times in a given array of size n. Essentially, you need to identify the majority element.

If you have a Swiggy interview, it's unlikely that you will get this question

#19. Majority Element

Find the element that appears more than n/2 times in a given array of size n. Essentially, you need to identify the majority element.

This question is not likely to be asked in your Swiggy interview

Maximum Score From Removing Substrings

You are given a string and two smaller strings with associated scores. Find the maximum possible score by repeatedly removing either of the smaller strings as substrings from the original string and summing their scores.

ArraysTwo PointersGreedy AlgorithmsStacks

If you have a Swiggy interview, it's unlikely that you will get this question

#20. Maximum Score From Removing Substrings

You are given a string and two smaller strings with associated scores. Find the maximum possible score by repeatedly removing either of the smaller strings as substrings from the original string and summing their scores.

ArraysTwo PointersGreedy AlgorithmsStacks

This question is not likely to be asked in your Swiggy interview

Copyright © Taro