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

Clear (1)

Zepto Quality Assurance Engineer 3 Interview Questions, Process, and Tips

Updated 10 Oct 2024

Zepto Quality Assurance Engineer 3 Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(9 Questions)

  • Q1. Write negative testcases for cart value not greater equal to 1000
  • Ans. 

    Negative testcases for cart value less than 1000

    • Add a product with a price less than 1000 to the cart

    • Remove all products from the cart and check if the total value is less than 1000

    • Add multiple products to the cart but ensure the total value is less than 1000

  • Answered by AI
  • Q2. Write HTTP status codes
  • Ans. 

    HTTP status codes are standardized codes used to indicate the result of a HTTP request.

    • 1. 2xx - Success: Request was successful (e.g. 200 OK)

    • 2. 3xx - Redirection: Further action needs to be taken (e.g. 301 Moved Permanently)

    • 3. 4xx - Client Error: Request cannot be fulfilled (e.g. 404 Not Found)

    • 4. 5xx - Server Error: Server failed to fulfill a valid request (e.g. 500 Internal Server Error)

  • Answered by AI
  • Q3. How can you check backward compatibility in API (if BE changes are deployed on PROD)
  • Ans. 

    To check backward compatibility in API after BE changes are deployed on PROD, perform regression testing on existing functionalities.

    • Perform regression testing on existing API functionalities to ensure they still work as expected after BE changes

    • Check if any existing API endpoints have been deprecated or modified due to BE changes

    • Verify if any new API endpoints have been added and test their functionality

    • Ensure that th...

  • Answered by AI
  • Q4. GET, POST, PUT, PATCH difference
  • Ans. 

    GET retrieves data, POST submits data, PUT updates data, PATCH partially updates data

    • GET is used to retrieve data from a server

    • POST is used to submit data to a server

    • PUT is used to update existing data on a server

    • PATCH is used to partially update existing data on a server

  • Answered by AI
  • Q5. How to test netowork latency while testing mobile apps
  • Ans. 

    Use network monitoring tools and simulate different network conditions to test network latency in mobile apps.

    • Use network monitoring tools like Wireshark or Charles Proxy to analyze network traffic and identify latency issues.

    • Simulate different network conditions (3G, 4G, WiFi, etc.) using tools like Network Link Conditioner on iOS or Android Emulator on Android.

    • Measure latency by sending requests to a server and calcu...

  • Answered by AI
  • Q6. In which method data is more secure GET or POST?
  • Ans. 

    POST method is more secure than GET method for transmitting sensitive data.

    • POST method sends data in the request body, making it more secure as the data is not visible in the URL.

    • GET method sends data in the URL, which can be visible in browser history, server logs, and can be easily intercepted.

    • POST method is recommended for transmitting sensitive information like passwords, credit card details, etc.

    • GET method is comm...

  • Answered by AI
  • Q7. SQL: UPDATE the name of EMPLOYEE having 3rd high salary
  • Ans. 

    Update the name of employee with 3rd highest salary in SQL

    • Use a subquery to find the 3rd highest salary

    • Join the subquery with the EMPLOYEE table on salary to get the employee name

    • Use the UPDATE statement to update the name of the employee

  • Answered by AI
  • Q8. Scenario based question
  • Q9. What is RACE condition
  • Ans. 

    A RACE condition is a situation in which the outcome of a program depends on the order of execution of its components.

    • Occurs in concurrent programming when multiple threads access shared data and the outcome depends on the order of execution

    • Can lead to unpredictable behavior and bugs in the program

    • Example: Two threads trying to increment the same variable simultaneously can result in incorrect values due to race condit

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare well for mobile app testing questions
API testing
database queries

Skills evaluated in this interview

Interview questions from similar companies

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 

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

I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.

Round 1 - Coding Test 

I dont remember exact questions but they are like leetcode easy and medium

Round 2 - One-on-one 

(2 Questions)

  • Q1. How web/internet works?
  • Ans. 

    The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.

    • Devices connect to the internet through ISPs

    • Data is transmitted through packets using TCP/IP protocols

    • Web browsers use HTTP/HTTPS protocols to request and receive web pages

    • DNS servers translate domain names to IP addresses

    • Web servers host web pages and respond to requests

    • Search engines use web cr

  • Answered by AI
  • Q2. Coding questions with complete explanation
Round 3 - One-on-one 

(1 Question)

  • Q1. Coding and managerial round similar to round 2

Interview Preparation Tips

Interview preparation tips for other job seekers - practice coding well and some development skill. you are good to go

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result

Interview Preparation Tips

Interview preparation tips for other job seekers - "GfG must do" should be solved properly alteast , otherwise go keep on practicing on any platform .

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I was interviewed in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

Interview Preparation Tips

Round: Test
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25

Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3

Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.

Interview Questionnaire 

2 Questions

  • Q1. Data struct,algo,
  • Q2. High level data structs and algos

Interview Preparation Tips

Round: Problem Statement
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE

Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach

Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos

Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. Boundary traversal of a tree
  • Ans. 

    Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.

    • The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.

    • For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.

    • For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.

    • For the ri...

  • Answered by AI
  • Q2. Find the nearest greater value of a given value in a BST
  • Ans. 

    Find the nearest greater value of a given value in a Binary Search Tree (BST).

    • Start from the root node and compare the given value with the current node's value.

    • If the given value is less than the current node's value, move to the left subtree.

    • If the given value is greater than the current node's value, move to the right subtree.

    • Keep track of the closest greater value encountered while traversing the tree.

    • Return the cl

  • Answered by AI
  • Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
  • Ans. 

    Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.

    • We can start by jumping the maximum number of steps in each round until we reach the broken step.

    • After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.

    • We can continue this pattern until we reach the maximum height we can reach wit

  • Answered by AI
  • Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure

Interview Preparation Tips

Round: Test
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22

Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.

Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.

General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Zepto Interview FAQs

How many rounds are there in Zepto Quality Assurance Engineer 3 interview?
Zepto interview process usually has 1 rounds. The most common rounds in the Zepto interview process are Technical.
What are the top questions asked in Zepto Quality Assurance Engineer 3 interview?

Some of the top questions asked at the Zepto Quality Assurance Engineer 3 interview -

  1. how can you check backward compatibility in API (if BE changes are deployed on ...read more
  2. how to test netowork latency while testing mobile a...read more
  3. In which method data is more secure GET or PO...read more

Recently Viewed

JOBS

Collegedunia

No Jobs

REVIEWS

Acmegrade

No Reviews

INTERVIEWS

MeritNation

No Interviews

JOBS

Spacelinkers Infotech

No Jobs

JOBS

Roadmap IT Solutions

No Jobs

REVIEWS

Acmegrade

No Reviews

JOBS

Thompsons Hr Consulting

No Jobs

JOBS

Caliber Organisation

No Jobs

INTERVIEWS

Acmegrade

No Interviews

REVIEWS

MT Educare

No Reviews

Tell us how to improve this page.

Zepto Quality Assurance Engineer 3 Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Join Zepto We’re revolutionizing the way India shops.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 747 Interviews
Swiggy Interview Questions
3.8
 • 424 Interviews
BigBasket Interview Questions
3.9
 • 355 Interviews
Udaan Interview Questions
3.9
 • 333 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zomato Interview Questions
3.7
 • 308 Interviews
Blinkit Interview Questions
3.7
 • 178 Interviews
BlackBuck Interview Questions
3.8
 • 175 Interviews
View all
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