Premium Employer

i

This company page is being actively managed by Zepto Team. If you also belong to the team, you can get access from here

Zepto Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Zepto Senior Software Developer Interview Questions and Answers

Updated 19 Jul 2024

Zepto Senior Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - Coding Test 

Low level design | duration 60 min

Interview Preparation Tips

Interview preparation tips for other job seekers - LLD -- they ask me to design BookeMyShow along with DB schema and class digram

Interview questions from similar companies

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 65 minutes
Round difficulty - Easy

There were 2 sections – 
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

It was an online coding test in which 3 coding question were given.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in string S that contains all characters in string X.

    • Iterate through string S and keep track of characters in X found in a window

    • Use two pointers to maintain the window and slide it to find the smallest window

    • Return the smallest window containing all characters in X

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible integer that cannot be represented, which is 1.

    • Iterate through the array and update the smallest integer that cannot be represented.

    • If the current element is greater than the smallest integer that cannot be represented, return tha...

  • Answered by AI
  • Q3. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...

  • Ans. 

    Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.

    • Implement a function that takes knight's starting position, target position, and chessboard size as input

    • Use breadth-first search algorithm to find the shortest path for the Knight

    • Consider all possible 8 movements of the Knight on the chessboard

    • Return the minimum number of moves required for the Knight to reach the target po

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node.

    • Keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. What are the port numbers of protocols such as FTP and SMTP?
  • Ans. 

    FTP uses port number 21 and SMTP uses port number 25.

    • FTP uses port 21 for data transfer and port 20 for control information.

    • SMTP uses port 25 for email communication.

    • Understanding port numbers is important for network communication.

  • Answered by AI
  • Q3. Can you explain the OSI Model?
  • Ans. 

    The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.

    • The OSI Model stands for Open Systems Interconnection Model.

    • It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.

    • Each layer has specific functions and communicates with the adjacent layers.

    • Example: Layer 1 (Physical) deals with physi...

  • Answered by AI
  • Q4. How do you copy files in Linux?
  • Ans. 

    To copy files in Linux, you can use the 'cp' command.

    • Use the 'cp' command followed by the source file and destination directory to copy a file.

    • To copy a directory and its contents, use the '-r' flag with the 'cp' command.

    • You can also use wildcards like '*' to copy multiple files at once.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip 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

Interview Questionnaire 

8 Questions

  • Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
  • Ans. 

    Find the subset of an array with the largest sum of continuous positive numbers.

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

    • If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.

    • Also keep track of the start and end indices of the maximum sum subset.

    • Return the subset using the start and end indices.

  • Answered by AI
  • Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
  • Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
  • Ans. 

    Find smallest substring in s1 containing all characters of s2.

    • Create a hash table of characters in s2

    • Use sliding window technique to find smallest substring in s1

    • Check if all characters in s2 are present in the substring

    • Update the smallest substring if a smaller one is found

  • Answered by AI
  • Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
  • Q5. Write algo for reversing a linked list
  • Ans. 

    Algorithm to reverse a linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q6. What is lazy loading? Advantages and disadvantages of the same?
  • Ans. 

    Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.

    • Advantages: faster initial page load, reduced bandwidth usage, improved user experience

    • Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO

    • Examples: images, videos, and other media files can be loaded only when they are visible on the screen

  • Answered by AI
  • Q7. How ajax works? Difference between angular js and jquery?
  • Ans. 

    Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.

    • Ajax stands for Asynchronous JavaScript and XML

    • It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes

    • AngularJS is a JavaScript framework that extends HTML with new attrib...

  • Answered by AI
  • Q8. Design a traffic light system?
  • Ans. 

    A traffic light system controls the flow of traffic at intersections.

    • The system consists of three lights: red, yellow, and green.

    • Each light has a specific duration for which it stays on.

    • The system also includes sensors to detect the presence of vehicles and pedestrians.

    • The duration of each light can be adjusted based on traffic patterns.

    • The system can be connected to a central control system for remote monitoring and m

  • Answered by AI

Interview Preparation Tips

Skills: Javascript, Ajax, Angular JS, Jquery
College Name: na

Skills evaluated in this interview

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with 3 problems based on DSA and Algorithms.

  • Q1. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.

    • Sort the array in non-decreasing order.

    • Iterate through the array and keep track of the smallest sum that can be formed.

    • If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.

    • Return the answer as the smallest integer not representable as a subset

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list to be the last node encountered during the reversal process.

  • Answered by AI
  • Q3. 

    Smallest Window Problem Statement

    Given two strings S and X containing random characters, the task is to find the smallest substring in S which contains all the characters present in X.

    Input:

    The first...
  • Ans. 

    The task is to find the smallest substring in string S which contains all the characters present in string X.

    • Iterate through string S and keep track of characters in X using a hashmap

    • Use two pointers to maintain a sliding window and find the smallest window containing all characters in X

    • Return the smallest window found

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on OOPS and Angular.

  • Q1. What are the different OOP concepts?
  • Ans. 

    OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.

    • Inheritance allows a class to inherit properties and behavior from another class.

    • Encapsulation restricts access to certain components of an object, protecting its integrity.

    • Polymorphism allows objects to be treated as instances of their parent class.

    • Abstraction hides the complex implementation details of an object and only shows the necessar

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on System Design, ajax, jquery were asked.

  • Q1. How would you design a traffic light system?
  • Ans. 

    Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.

    • Divide the traffic light system into three main lights: red, yellow, and green.

    • Implement timers to control the duration of each light.

    • Include sensors to detect the presence of vehicles and pedestrians.

    • Consider implementing a pedestrian crossing signal.

    • Integrate a central control system to coordinate the timing

  • Answered by AI
  • Q2. How does AJAX work?
  • Ans. 

    AJAX allows for asynchronous communication between client and server without needing to reload the entire page.

    • AJAX stands for Asynchronous JavaScript and XML.

    • It allows for sending and receiving data from a server without reloading the entire page.

    • AJAX uses XMLHttpRequest object to make requests to the server.

    • It can update parts of a web page without requiring a full page reload.

    • Commonly used in web applications to pro

  • Answered by AI
  • Q3. What is the difference between AngularJS and jQuery?
  • Ans. 

    AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.

    • AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.

    • jQuery is a lightweight library primarily used for DOM manipulation and event handling.

    • AngularJS is suitable for building single-page applic...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Javascript, Ajax, Angular JS, Jquery, Data Structures, Algorithms, System Design, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

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...

  • 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
  • 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...
  • 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
Round 2 - Face to Face 

(1 Question)

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...

  • 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

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 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

Interview Questionnaire 

32 Questions

  • Q1. Discussion on the rectangular board question asked in prev round
  • Q2. How will you implement a shuffle function for a playlist of songs
  • Ans. 

    Implementing a shuffle function for a playlist of songs

    • Create a new empty playlist

    • Randomly select a song from the original playlist and add it to the new playlist

    • Remove the selected song from the original playlist

    • Repeat until all songs have been added to the new playlist

    • Return the new shuffled playlist

  • Answered by AI
  • Q3. What is memory leak?
  • Ans. 

    Memory leak is a situation where a program fails to release memory it no longer needs.

    • Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.

    • Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.

    • Tools like valgrind can be used to detect memory leaks in C and C++ programs.

    • Examples of memory leaks include...

  • Answered by AI
  • Q4. What is the problem with arrays?
  • Ans. 

    Arrays have fixed size and can lead to memory wastage and performance issues.

    • Arrays have a fixed size and cannot be resized dynamically.

    • Inserting or deleting elements in an array can be time-consuming.

    • Arrays can lead to memory wastage if they are not fully utilized.

    • Arrays can cause performance issues if they are too large and need to be traversed frequently.

    • Arrays can also be prone to buffer overflow attacks.

    • Example: A...

  • Answered by AI
  • Q5. Write a function in javascript to hide text on mouse click
  • Ans. 

    Function to hide text on mouse click in JavaScript

    • Create a function that takes an element as input

    • Add an event listener to the element for a mouse click

    • Toggle the element's display property between 'none' and its original value

  • Answered by AI
  • Q6. A unsorted array was given and a number x.find out the two elements whose sum is equal to x
  • Ans. 

    Find two elements in an unsorted array whose sum is equal to a given number x.

    • Use a hash table to store the difference between x and each element in the array.

    • Iterate through the array and check if the current element is in the hash table.

    • Return the pair of elements that add up to x.

  • Answered by AI
  • Q7. More questions on basic OS concepts related to storage, memory
  • Q8. Puzzle : -----/
  • Q9. What is BST ?
  • Ans. 

    BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.

    • BST is a tree-like data structure where each node has at most two children.

    • The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

    • BST allows for efficient searching and sorting operations with a time complexity of O(log n).

    • Examples of a...

  • Answered by AI
  • Q10. How many BSTs are possible with two nodes and three nodes?
  • Ans. 

    Number of possible BSTs with 2 and 3 nodes.

    • For 2 nodes, only 2 BSTs are possible.

    • For 3 nodes, 5 BSTs are possible.

    • Number of BSTs can be calculated using Catalan numbers formula.

    • Catalan(2) = 2, Catalan(3) = 5.

  • Answered by AI
  • Q11. How many trees are possible with two and three nodes?
  • Ans. 

    Answering the question about possible trees with two and three nodes.

    • For two nodes, there is only one possible tree.

    • For three nodes, there are three possible trees.

    • The formula for calculating the number of possible trees with n nodes is (2n-3)!!.

    • The double exclamation mark represents the double factorial function.

    • The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).

  • Answered by AI
  • Q12. Puzzle : 100 people are standing in a circle .each one is allowed to shoot a person infront of him and he hands the gun to the next to next person for e.g 1st person kills 2nd and hands gun to 3rd .This c...
  • Q13. What is indexing? Why it is used?
  • Q14. What are B+ trees?what is the advantage?
  • Ans. 

    B+ trees are balanced trees used for indexing and searching large amounts of data.

    • B+ trees are similar to binary search trees but have multiple keys per node.

    • They are commonly used in databases and file systems.

    • B+ trees have a high fanout, reducing the number of disk accesses required for searching.

    • They are also self-balancing, ensuring efficient performance even with large amounts of data.

    • Example: In a database, a B+ ...

  • Answered by AI
  • Q15. Any questions you want to ask?
  • Ans. 

    Yes, I have a few questions.

    • Can you tell me more about the team I'll be working with?

    • What is the company culture like?

    • What are the biggest challenges the team is currently facing?

    • Can you walk me through the development process for a typical project?

    • What opportunities are there for professional growth and development?

  • Answered by AI
  • Q16. Asked me about the skills i have mentioned in my resume
  • Q17. Which data structure i like?
  • Ans. 

    I prefer hash tables for their constant time lookup and insertion.

    • Hash tables are efficient for storing and retrieving data.

    • They have constant time complexity for both insertion and lookup.

    • They can be implemented using arrays or linked lists.

    • Examples include Python's dictionary and Java's HashMap.

  • Answered by AI
  • Q18. Can you implement a stack using queue
  • Ans. 

    Yes, we can implement a stack using two queues.

    • Push operation: Enqueue the element to the first queue.

    • Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.

    • Top operation: Same as pop operation but don't dequeue the last element.

    • Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...

  • Answered by AI
  • Q19. Two arrays of arrival time of trains and departure time of trains were given. find the minimum no of platforms require so that no collision occurs
  • Ans. 

    Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.

    • Sort both arrays in ascending order

    • Initialize platform count and max count to 1

    • Loop through both arrays and compare arrival and departure times

    • If arrival time is less than or equal to departure time, increment platform count

    • Else, decrement platform count

    • Update max count if platform count is greater than ma

  • Answered by AI
  • Q20. What is JVM ? Difference between JVM and compiler
  • Ans. 

    JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.

    • JVM is responsible for interpreting the compiled Java code and executing it.

    • It provides platform independence by converting bytecode into machine-specific code.

    • JVM has various components like class loader, bytecode verifier, and execution engine.

    • Compiler converts source code into bytecode, while JVM exec...

  • Answered by AI
  • Q21. He asked me to write a html code for a page design he gave
  • Q22. He asked me to write a query for a relational schema and problem statement given by him
  • Q23. Tell me about Yourself
  • Ans. 

    I am a software engineer with experience in developing web applications and a passion for learning new technologies.

    • Experienced in developing web applications using technologies such as Java, Spring, and Angular

    • Passionate about learning new technologies and keeping up with industry trends

    • Strong problem-solving skills and ability to work in a team environment

    • Completed a Bachelor's degree in Computer Science from XYZ Uni

  • Answered by AI
  • Q24. She asked me if i was nervous
  • Q25. What do i know about PayTM ?
  • Ans. 

    PayTM is an Indian e-commerce payment system and digital wallet company.

    • PayTM was founded in 2010 by Vijay Shekhar Sharma.

    • It started as a mobile recharge and bill payment platform.

    • PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.

    • It also offers a digital wallet that can be used to pay for various services and products.

    • PayTM has over 350 million registered users and is ...

  • Answered by AI
  • Q26. Any feature i would like to add in PayTM app?
  • Ans. 

    I would like to add a feature for splitting bills among friends.

    • The feature would allow users to split bills for movies, dinners, etc.

    • Users can select friends from their contact list and split the bill equally or unequally.

    • The app would send a notification to the selected friends to pay their share.

    • The feature would make it easier for users to split expenses and avoid awkward conversations.

    • It would also encourage more

  • Answered by AI
  • Q27. What is my favourite app and any improvements in it which i want to implement?
  • Ans. 

    My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.

    • Improved algorithm for personalized playlists

    • Better integration with social media platforms

    • Option to create collaborative playlists with friends

  • Answered by AI
  • Q28. She asked me about my school and which school i like the most and why?
  • Q29. She asked me about my family
  • Q30. What is my favourite subject?
  • Ans. 

    My favourite subject is Computer Science.

    • I enjoy programming and problem-solving.

    • I find algorithms and data structures fascinating.

    • I am interested in artificial intelligence and machine learning.

    • I like learning about new technologies and keeping up with industry trends.

  • Answered by AI
  • Q31. Have i ever been to delhi?
  • Q32. Why do I choose NIT Hamirpur? what do i like about Hamirpur?
  • Ans. 

    I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.

    • NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.

    • The campus is located in a serene and picturesque location, which provides a conducive environment for learning.

    • The faculty members are highly experienced and knowledgeable, and are always willing to help students.

    • The college has state-of-th...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: General aptitude was easy.It was of 30 mins.
Next technical aptitude and coding questions were of 50 mins duration.
Technical aptitude questions were from OS,C,C++,DBMS.Questions were based on basic concepts.
There were 3 coding questions.
1.A girl eat fish of exact length of 10.She can cut the fish to get the desired length.An array of lengths of fish and maximum possible cuts allowed were given.Find out the max number of fish the girl can eat.
2. A 2-D rectangular board which contains sand grains : 'o' ,obstacles: 'x' and empty cells : '.' .The board is kept vertical. The sand grain can move down into and empty cell but it cannot cross obstacle. find out the final position of all sand grains in the board.
3.It was question on subsequence .
Tips: Just keep your basic concepts clear. Practice questions on strings,dynamic programming and recursion.Go through Geeksforgeeks .It'll help you a lot.
Duration: 80mins minutes
Total Questions: 50

Round: Technical Interview
Experience: The interviewer was very calm and polite. He was giving me hints and enough time to solve the questions.
Tips: Keep talking with the interviewer .Discuss your approach. Do take hints they give you.

Round: Technical Interview
Experience: I was stuck in one or two questions but they keep giving me hints. Interviewers were very nice. They were asking me the approach for each question. They were very cool.

Tips: Stay calm and go ahead. Apply whatever basic knowledge you have . keep asking doubts for the questions if you have any.

Round: Technical Interview
Experience: He asked me about my projects. What was my role. It was an hour long round. Enough time was given to solve each question.I was asked to write code with minimum complexity.
Tips: Keep discussing the questions. Try to reach to the best approach .keep smiling.Never fake your resume.

Round: HR Interview
Experience: The HR was very polite.I was a bit nervous at first but then I was relaxed.
Tips: Just be yourself .You are almost done when you are selected for HR. :) Keep Smiling and be confident about what ever you say.

General Tips: Be confident and have clear basic concepts of all subjects.
Skill Tips: Practise as many questions as you can on geeksforgeeks.
Skills: Coding skills, Logical skills, Aptitude, Basic Knowledge of DBMS
College Name: NIT Hamirpur
Motivation: My recent project work related to E-commerce and the reputation and ecstatic growth of the company in recent months.
Funny Moments: after one of the technical round , interviewer asked me if i had any questions about the company.I asked them what kind of rewards will be given .. do you guys go for trips and get any free coupons :P

Skills evaluated in this interview

Interview Questionnaire 

21 Questions

  • Q1. Discussion of previous written test questions
  • Q2. Find the odd repeating element from a set of repeating elements
  • Ans. 

    Find the odd repeating element from an array of strings

    • Use a hash table to count the frequency of each element

    • Iterate through the hash table to find the element with an odd count

  • Answered by AI
  • Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
  • Ans. 

    Finding an element in a sorted 2D matrix

    • Start from the top right corner or bottom left corner

    • Compare the target element with the current element

    • Move left or down if the target is smaller, else move right or up

    • Repeat until the target is found or all elements are checked

  • Answered by AI
  • Q4. SQL Query to find Nth highest salary from table
  • Ans. 

    SQL query to find Nth highest salary from table

    • Use ORDER BY and LIMIT clauses

    • Use subquery to get the Nth highest salary

    • Handle cases where there are less than N distinct salaries

  • Answered by AI
  • Q5. Another basic SQL query
  • Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
  • Ans. 

    Function to swap '3' and '4' without using if-else

    • Use XOR operator to swap the values

    • Convert the input to ASCII code and perform the swap

    • Use a lookup table to map the values

  • Answered by AI
  • Q7. Question on Suffix trees
  • Q8. Question on Tries
  • Q9. Question on Ternary search trees
  • Q10. Question on hash maps
  • Q11. Question on complexity of an algorithm
  • Q12. 3-4 SQL queries
  • Q13. Question on SQL joins
  • Q14. JAVA questions on static block,static function and static variables
  • Q15. JAVA questions on memory initialization and references
  • Q16. Puzzle on measuring exactly half a glass of water
  • Q17. Introduce yourself
  • Ans. 

    I am a software developer with experience in Java and Python.

    • Proficient in Java and Python programming languages

    • Experience in developing web applications using Spring framework

    • Familiarity with database management systems like MySQL and MongoDB

  • Answered by AI
  • Q18. Why PAYTM?
  • Ans. 

    PAYTM is a leading digital payment platform in India with a wide range of services.

    • PAYTM has a user-friendly interface and offers a seamless payment experience.

    • It provides a variety of services like mobile recharges, bill payments, and online shopping.

    • PAYTM has a strong focus on security and fraud prevention measures.

    • It has a large user base and is widely accepted by merchants across India.

    • PAYTM is constantly innovatin...

  • Answered by AI
  • Q19. Will you go for further studies?
  • Ans. 

    Yes, I am open to pursuing further studies in the future.

    • I believe in continuous learning and staying updated with the latest technologies.

    • Further studies can help me specialize in a particular field and enhance my skills.

    • I may consider pursuing a master's degree in computer science or a related field.

    • However, my immediate focus is on gaining practical experience and contributing to the organization.

  • Answered by AI
  • Q20. Why do you think has PAYTM grown so fast?
  • Ans. 

    PAYTM grew fast due to its innovative approach and early adoption of digital payments.

    • Early adoption of digital payments in India

    • Innovative approach with features like mobile recharges, bill payments, and cashback offers

    • Expansion into e-commerce and financial services

    • Strategic partnerships with major companies like Uber and Alibaba

  • Answered by AI
  • Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?

Interview Preparation Tips

Round: Test
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.

Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)

Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know

Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)

Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)

General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.

Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.

College Name: BITS Pilani

Interview Preparation Tips

Skills: Algorithm, Java, Data structure
College Name: na

Interview Questionnaire 

7 Questions

  • Q1. Given an array find the number of conitnuous sequences having equal number of 0's and 1's
  • Ans. 

    Count the number of continuous sequences with equal number of 0's and 1's in an array.

    • Iterate through the array and keep track of the count of 0's and 1's encountered so far.

    • Store the difference between the counts in a hash table and increment the count for that difference.

    • If the difference is already present in the hash table, add the count to the existing value.

    • Return the sum of all values in the hash table.

  • Answered by AI
  • Q2. Number of substrngs which are palindrome
  • Ans. 

    Count the number of palindromic substrings in a given string.

    • A substring is a contiguous sequence of characters within a string.

    • A palindrome is a string that reads the same backward as forward.

    • Use dynamic programming to count all palindromic substrings.

    • Time complexity can be reduced to O(n^2) using Manacher's algorithm.

  • Answered by AI
  • Q3. Longest Palindrom in a string in O(n)
  • Ans. 

    Find the longest palindrome in a given string in linear time complexity.

    • Use Manacher's algorithm to find the longest palindrome in a string in O(n) time complexity.

    • The algorithm involves preprocessing the string to add special characters to handle even and odd length palindromes.

    • Then, it uses a combination of dynamic programming and symmetry properties to find the longest palindrome.

    • For example, in the string 'babad',

  • Answered by AI
  • Q4. Find the value of pie
  • Ans. 

    The value of pie is a mathematical constant approximately equal to 3.14159.

    • Pie is the ratio of the circumference of a circle to its diameter.

    • It is an irrational number, meaning it cannot be expressed as a finite decimal or fraction.

    • Pie is commonly used in geometry and trigonometry calculations.

    • The value of pie is often approximated as 3.14 or 22/7.

  • Answered by AI
  • Q5. Project discussion
  • Q6. Tell me about yourself
  • Ans. 

    I am a passionate software engineer with experience in developing web applications using various technologies.

    • Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

    • Proficient in backend development with Node.js and databases like MongoDB and MySQL

    • Familiar with version control systems like Git and deployment tools like Docker

    • Strong problem-solving skills and ability

  • Answered by AI
  • Q7. Will u be able to fit in the company ?
  • Ans. 

    Yes, I believe I will be able to fit in the company based on my experience, skills, and values.

    • I have experience working in diverse teams and adapting to different work cultures.

    • I share the company's values and vision, which align with my own.

    • I am eager to learn and contribute to the team, fostering a positive work environment.

    • I have strong communication skills, which are essential for collaboration and teamwork.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 20 minutes
Total Questions: 20

Round: Technical Interview
Experience: Nice
Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com

Round: Technical Interview
Experience: niice
Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com

Round: Technical Interview
Experience: nice
Tips: do some projects

Round: HR Interview
Experience: nice
Tips: read on google on how to answer such questions

General Tips: geeksforgeeks.com
Skill Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com
Skills: c , algorithms , data structures
College Name: Delhi Technological University, Delhi

Skills evaluated in this interview

Zepto Interview FAQs

How many rounds are there in Zepto Senior Software Developer interview?
Zepto interview process usually has 1 rounds. The most common rounds in the Zepto interview process are Coding Test.

Tell us how to improve this page.

Zepto Senior Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join Zepto We’re revolutionizing the way India shops.
Zepto Senior Software Developer Salary
based on 4 salaries
₹21 L/yr - ₹65 L/yr
156% more than the average Senior Software Developer Salary in India
View more details
Shift Incharge
403 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
144 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Store Manager
137 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Manager
129 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Store Incharge
95 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Zepto with

Blinkit

3.7
Compare

Dunzo

3.4
Compare

BigBasket

3.9
Compare

Swiggy

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview