Swiggy NON Voice Process Interview Questions and Answers for Freshers

Q1. What are your salary expectations?
View 32 more answers
Q2. What is your family background?
View 18 more answers
Q3. Share details of your previous job.
View 13 more answers
Q4. Why should we hire you?
View 13 more answers
Q5. Why are you looking for a change?
View 11 more answers
Q6. Tell me about yourself.
View 10 more answers
Q7. Why are you looking for a job
View 11 more answers

Q1. What are your salary expectations?
View 7 more answers
Q2. About my previous job
View 6 more answers

Q1. Speak on ur favourite topic, sales One product
View 2 more answers
Q2. Any questions will ask
Add your answer

Q1. About family about urself
Add your answer

Q1. Sales about Amazon convenience tha customers
Add your answer

Q1. Technical support and email sending
View 1 more answer

Q1. What your salary expectation?
View 15 more answers
Q2. Explain about yourself?
Ans. Good morning sir/madam. My self S.Ravi kumar.Iam from mahabub nagar. I have completed my graduation B.Tech from Siddhartha Institute of engineering and technology. Coming to my family total three members in my family. Father mother and my self. Father is a farmer mother is a house maker. My strength hardworking and a quick learner. My hobbies reading books and playing cricket. That's all about me. Thank you
Answered Anonymously
View 5 more answers

It is pretty tough and you don't have time

It was pretty tough

Q1. It was pretty tough And very little time is given
View 1 more answer
Q2. General technical questions
Add your answer
Q3. General knowledge questions
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer