Upload Button Icon Add office photos

Swiggy

Compare button icon Compare button icon Compare

Filter interviews by

Swiggy React Native Developer Interview Questions and Answers for Experienced

Updated 31 Aug 2024

Swiggy React Native Developer Interview Experiences for Experienced

1 interview found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
More than 8 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed before Aug 2023. There was 1 interview round.

Round 1 - Coding Test 

The first round is Hackerrank two algo and one UI test very easy, Second is Fundamentals of JS and React Native one must have a deep understanding of JS to do that I strongly suggest going through Akashay Saini's JS series It'll help and the Third is PS/DS asked some basic A&DS questions can be solved easily with little practice on Leetcode

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview process is very long, The First round was in January second in Feb and the Third in April

Top trending discussions

View All
Interview Tips & Stories
6d (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Swiggy?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Rotate Matrix Right K Times

    You are given a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...

  • Ans. 

    Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.

    • Iterate 'K' times to perform right rotation on the matrix

    • Shift each column to the right by one position in each rotation

    • Handle wrapping around the matrix when shifting columns

    • Return the matrix elements row-wise after 'K' rotations

  • Answered by AI
  • Q2. 

    Word Search Problem Statement

    Given a two-dimensional grid of size N x M consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.

    The 'WORD' can b...

  • Ans. 

    Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use recursion to explore all possible paths from a starting cell to form the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of how man...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

  • Q1. 

    Problem Statement: Largest Island

    You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.

    An island consists of a...

  • Ans. 

    Find the maximum area of an island in a grid of 0s and 1s.

    • Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

    • Keep track of the area of each island found and return the maximum area.

    • Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like grid boundaries and already visited cells during DFS.

    • If no island is present, return 0 as the...

  • Answered by AI
  • Q2. 

    Pythagorean Triplet Problem

    Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.

    Expl...

  • Ans. 

    Check if there exists a Pythagorean triplet in a given array of integers.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
  • Q3. 

    Top View of Binary Tree Problem Statement

    Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...

  • Ans. 

    Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.

    • Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.

    • Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.

    • Return the values of the topmost nodes in the map as the top view of the Binary Tree.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

  • Q1. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two nodes that are swapped by mistake in the BST.

    • Swap the values of the two identified nodes to restore the BST.

    • Perform an in-order traversal of the BST to verify the correct restoration.

    • Ensure no extra space other than the recursion stack is used for the solution.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.

    • Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure that each operation runs in constant time O(1).

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queri...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, OS, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application resume tips for other job seekers

Tip 1 : Try not to mention those things about which you are not comfortable. 
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series, Prime function, linked lisk value access, query

Interview Preparation Tips

Interview preparation tips for other job seekers - First a test based on amcat. Followed by two technical interview. First Tech Interview basis and overview of you concept of ds and algo will ne asked. In second Tech interview indepth concept of topics such as arrays, linked list, os,algo, etc will be asked. Prepare ds and algo concept, dbms query & concept, internet basis such as protocols, methods,etc.

Best of luck

I applied via Job Portal and was interviewed before Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Data structure
  • Q2. Java concepts
  • Q3. Handson coding

Interview Preparation Tips

Interview preparation tips for other job seekers - Get handson in any language but be confident

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Dec 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.

  • Q1. 

    Biggest Number Formation Problem

    Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.

    Input:

    Integer T denoting the nu...
  • Ans. 

    Construct the largest number by concatenating positive integers in the array exactly once.

    • Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.

    • Use a custom comparator function to sort the numbers based on their concatenated values.

    • Join the sorted array elements to form the final largest number.

  • Answered by AI
  • Q2. 

    Number of Longest Increasing Subsequence Problem Statement

    Given an integer array ARR of length N, determine the count of longest increasing subsequences present in the array.

    Explanation:

    The Longest I...

  • Ans. 

    Count the number of longest increasing subsequences in an integer array.

    • Identify the longest increasing subsequences in the array

    • Count the number of such subsequences

    • Consider the constraints while implementing the solution

    • Examples: For input [50, 3, 90, 60, 80], the output is 2

  • Answered by AI
Round 2 - Telephonic Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.

He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.

  • Q1. 

    Cache Operations Problem

    You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:

    Explanation:

      ...
  • Ans. 

    Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.

    • Create a cache data structure with specified size 'N'.

    • Implement insert and update operations based on the given criteria.

    • For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.

    • Handle cases where the cache is full and least frequently used items need to be removed.

    • Retu...

  • Answered by AI
  • Q2. 

    Possible Words from a Phone Number: Problem Statement

    Given a string S composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...

  • Ans. 

    Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.

    • Create a mapping of digits to letters on a T9 keypad

    • Use recursion to generate all possible combinations of letters for the given phone number

    • Sort the resulting strings in lexicographical order

  • Answered by AI
  • Q3. 

    Shortest Unique Prefix Problem

    You are given an array containing N words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...

  • Ans. 

    Given an array of words, find the shortest unique prefix for each word.

    • Create a Trie data structure to efficiently store and search for prefixes.

    • Traverse the Trie to find the shortest unique prefix for each word.

    • Return the list of shortest unique prefixes for all words.

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in a given array.

    • Iterate through the array and keep track of the maximum sum subarray seen so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Handle cases where all elements are negative by returning the maximum element in the array.

    • Consider the sum of an empty subarray as 0.

  • Answered by AI
  • Q2. 

    LRU Cache Implementation

    Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:

    1. get(key) - Return the value associated with the key if ...
  • Ans. 

    Implement a Least Recently Used (LRU) cache data structure with get and put operations.

    • Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and remove it when the cache reaches its capacity.

    • Update the position of an item in the cache whenever it is accessed or updated.

    • Ensure constant time complexity for both get and put operations by u...

  • Answered by AI
Round 4 - HR 

Round duration - 40 Minutes
Round difficulty - Easy

The interviewer was very friendly. He asked me about myself and previous interviews.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Database Management, Operating System, Aptitude.Time required to prepare for the interview - 3.5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do at least 2-3 Development Projects as it creates a great impression. 
Tip 2 : Do it simply don't include complex terms to explain anything/concept. 
Tip 3 : Practice as many questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Dec 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

There were a total of 3 coding questions to be solved, and the time limit was 90 minutes. The candidate was free to use language of their choice.

  • Q1. 

    Longest Palindromic Subsequence Problem Statement

    Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.

    Explanation:

    • A subsequ...
  • Ans. 

    The task is to find the length of the longest palindromic subsequence in a given string.

    • A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters.

    • A string is said to be palindrome if the reverse of the string is the same as the actual string.

    • Find the longest palindromic subsequence by considering all possible subs...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

The first round of interview lasted for around 45 minutes. I was asked two DSA questions, and was supposed to code them while my screen was shared. I wrote code for both the questions with little help from the interviewer. Finally, I was asked couple of questions based on my resume.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    The task is to merge two sorted linked lists into a single sorted linked list.

    • Create a new linked list to store the merged list

    • Compare the values of the nodes from both lists and add the smaller value to the new list

    • Move the pointer of the list with the smaller value to the next node

    • Repeat the comparison and addition until one of the lists is empty

    • Add the remaining nodes from the non-empty list to the new list

    • Return th...

  • Answered by AI
  • Q2. 

    Rotational Equivalence of Strings Problem Statement

    Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...

  • Ans. 

    The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.

    • Iterate through each character of the first string and check if it matches the corresponding character in the second string after a certain number of cyclic rotations.

    • If all characters match for any number of cyclic rotations, then the first string can be converted into the second string.

    • Us...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

I was given one data structure question and was then asked about recursion.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of the elements

    • For each element, pop elements from the stack until a greater element is found or the stack is empty

    • If a greater element is found, it is the next greater element for the current element

    • If the stack becomes empty, there is no greater element to the right

    • Store the ...

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Easy

This was the hiring manager round. No data structures question were asked in this round. There was discussion around the projects that I had done and my resume. As I am from EEE branch, I was asked why I want to get into software. The interview happened around 8 PM. I was asked to create a schema for one of my projects.

  • Q1. Why do you want to pursue a career in software?
  • Ans. 

    I want to get into software because of my passion for problem-solving and the opportunity to create innovative solutions.

    • Passion for problem-solving

    • Opportunity to create innovative solutions

    • Interest in technology and its impact on society

    • Career growth and job stability

    • Flexibility and remote work options

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPATata 1mg interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, Number Theory, LLD, PuzzlesTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice regularly, meaning once you have covered all the topics, revisit them every week, and solve 3-5 questions.
Tip 2 : Use the Feynman technique. Explain your approach towards solving the problem to someone, or better yet, note it down so that when you revisit that question, the explanation is handy. 
Tip 3 : Do 1 project, preferably a full-stack one including a database. This would provide some material for discussion, and be through with each aspect of the project.

Application resume tips for other job seekers

Tip 1 : Keep the resume to one page and put info that is directly related to the role applied. 
Tip 2 : In the projects section, keep a maximum of 3 projects, but ensure that at least one of them is hosted/live that can be shown to the interviewer.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

  • Q1. 

    Position of Right Most Set Bit

    Determine the position of the rightmost set bit in the binary representation of a given number N.

    Input:

    T: Number of test cases
    N: An integer for which the position of the...
  • Ans. 

    Find the position of the rightmost set bit in a given number's binary representation.

    • Convert the number to binary representation.

    • Find the position of the rightmost set bit by counting from right to left.

    • Return the position of the rightmost set bit.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Water Jug Problem Statement

    You have two water jugs with capacities X and Y liters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to...

  • Ans. 

    The Water Jug Problem involves determining if a specific amount of water can be measured using two jugs of different capacities.

    • Start by considering the constraints and limitations of the problem.

    • Think about how the operations allowed can be used to reach the target measurement.

    • Consider different scenarios and test cases to understand the problem better.

    • Implement a function that can determine if the target measurement ...

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

Interview Preparation Tips

Eligibility criteriaAbove 7.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures and Algorithm, Machine Learning, DBMS, C++, Python, Front End Web DevelopmentTime required to prepare for the interview - 1 YearInterview preparation tips for other job seekers

Tip 1 : Make your DSA and Algorithm as much as strong as possible.Main focus should be on Graphs and Trees.
Tip 2 : There are many standard algorithm on which questions are frequently asked.Try to practice as much as you can on them.
Tip 3 : Your project should be unique to create unforgettable impression.

Application resume tips for other job seekers

Tip 1 : Add 2-3 best of your projects which shows something extraordinary.
Tip 2 : Add your achievements if you have any like getting top rank in a coding competition.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic coding only not to worry much

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about ur self
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Excellent team player with good communication skills

  • Answered by AI
  • Q2. What is ur projects
  • Ans. 

    I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using React and Node.js

    • Created a mobile app for tracking fitness goals using Flutter

    • Implemented RESTful APIs for communication between frontend and backend systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - all the best do well!

Swiggy Interview FAQs

How many rounds are there in Swiggy React Native Developer interview for experienced candidates?
Swiggy interview process for experienced candidates usually has 1 rounds. The most common rounds in the Swiggy interview process for experienced candidates are Coding Test.
How to prepare for Swiggy React Native Developer interview for experienced candidates?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Swiggy. The most common topics and skills that interviewers at Swiggy expect are CSS, E-commerce, HTML, React Native and Redux.

Tell us how to improve this page.

Overall Interview Experience Rating

2/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

More than 8 weeks 100%
View more

Interview Questions from Similar Companies

Meesho Interview Questions
3.7
 • 369 Interviews
Lenskart Interview Questions
3.2
 • 364 Interviews
Info Edge Interview Questions
3.9
 • 348 Interviews
Udaan Interview Questions
3.9
 • 347 Interviews
Zepto Interview Questions
3.5
 • 296 Interviews
Oyo Rooms Interview Questions
3.2
 • 232 Interviews
BlackBuck Interview Questions
3.7
 • 194 Interviews
Tata 1mg Interview Questions
3.6
 • 188 Interviews
Digit Insurance Interview Questions
3.8
 • 158 Interviews
View all
Delivery Boy
889 salaries
unlock blur

₹1.7 L/yr - ₹5.1 L/yr

Fleet Manager
633 salaries
unlock blur

₹2.5 L/yr - ₹6 L/yr

Sales Manager
569 salaries
unlock blur

₹4.3 L/yr - ₹9.5 L/yr

Assistant Manager
540 salaries
unlock blur

₹5.1 L/yr - ₹12.7 L/yr

Store Manager
494 salaries
unlock blur

₹3.2 L/yr - ₹7.2 L/yr

Explore more salaries
Compare Swiggy with

Eternal Limited

3.7
Compare

Dunzo

3.4
Compare

FoodPanda

3.8
Compare

Rapido

3.7
Compare
write
Share an Interview