swiggy logo
Swiggy· sde-2

Swiggy SDE-2 Round 1 (Interview Vector)

Result
Ongoing
Posted
4 Feb 2025
488 reads

Summary

I recently interviewed for an SDE-2 position at Swiggy and successfully cleared the first round, which involved solving two LeetCode problems within the allotted time.

How it went

I recently appeared for the Swiggy SDE-2 interview, specifically for Round 1. I was presented with two coding questions, for which I had 25 minutes each. I was able to successfully solve both problems and felt it was a good experience overall. Based on my performance, I have been selected to proceed to Round 2, which will focus on Low-Level Design (LLD).

Questions asked (2)

  1. 01

    Two City Scheduling

    Data Structures & Algorithms · Medium

    A company is planning to interview 2n people. Given an array costs where costs[i] = [costAi, costBi], the cost of sending the ith person to city A is costAi, and to city B is costBi. Return the minimum cost to send exactly n people to city A and exactly n people to city B.

    Open the problem
  2. 02

    Path with Maximum Gold

    Data Structures & Algorithms · Medium

    In a gold mine grid of size m x n, each cell in this mine has an integer representing the amount of gold in that cell, 0 if it is empty. Every time you are in a cell, you will collect all the gold in it. You can move from your current cell to an adjacent cell (left, right, up, or down). You cannot visit the same cell more than once. Never visit a cell with 0 gold. Return the maximum amount of gold you can collect.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Swiggy recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!