Upload Button Icon Add office photos
Engaged Employer

i

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

Flipkart Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Clear (1)

Flipkart Sdet Interview Questions, Process, and Tips

Updated 4 Jun 2015

Flipkart Sdet Interview Experiences

1 interview found

Sdet Interview Questions & Answers

user image Anonymous

posted on 2 Jun 2015

Interview Questionnaire 

8 Questions

  • Q1. Program to find the angle between the hands of a clock. Input- the time. Expected output- Angle in degrees
  • Ans. 

    Program to find the angle between the hands of a clock given the time.

    • Calculate the angle of the hour hand from 12 o'clock position

    • Calculate the angle of the minute hand from 12 o'clock position

    • Calculate the absolute difference between the two angles

    • If the difference is greater than 180 degrees, subtract it from 360 degrees

    • Return the absolute value of the difference as the angle between the hands

  • Answered by AI
  • Q2. How do you find if given two linked lists intersect or not
  • Ans. 

    To find if two linked lists intersect, traverse both lists and compare their tail nodes.

    • Traverse both linked lists and find their lengths

    • If the lengths are different, move the longer list's head pointer to the difference in length

    • Now traverse both lists and compare their nodes until a common node is found

    • If no common node is found, the lists do not intersect

  • Answered by AI
  • Q3. Explain basic concept of JOINS in sql
  • Ans. 

    JOINS are used to combine rows from two or more tables based on a related column between them.

    • JOINS are used to retrieve data from multiple tables in a single query

    • There are different types of JOINS - INNER, LEFT, RIGHT, FULL OUTER

    • JOINS are based on a related column between the tables

    • Syntax: SELECT * FROM table1 JOIN table2 ON table1.column = table2.column

  • Answered by AI
  • Q4. If in a given table, consisting of student name and grade, Output a table containing each grade and its frequency in descending order
  • Q5. Questions regarding my final year project
  • Q6. SQL queries
  • Q7. If you are given a sorted array of size 7 but only 4 elements in it and a sorted array of 3 elements. How would to combine the elements into the first array in such a way that array is sorted
  • Ans. 

    Combine 4 elements of a sorted array of size 7 and a sorted array of 3 elements to make a sorted array.

    • Insert the 3 elements of the smaller array into the larger array

    • Sort the larger array using any sorting algorithm

  • Answered by AI
  • Q8. How do you find if a string is a palindrome or not?
  • Ans. 

    To check if a string is a palindrome, compare the first and last characters, then move towards the center.

    • Remove all non-alphanumeric characters and convert to lowercase

    • Use two pointers, one starting from the beginning and the other from the end

    • Compare the characters at both pointers, move towards the center until they meet

    • If all characters match, the string is a palindrome

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: online test from HackerEarth. It had 3 programming questions, out of which we had to program any two. The questions were: 1) To reverse the words in a given string2) I don’t remember this question properly but was something similar to this…. Finding all the factors of a given number and finding if the one’s position of the factorial and the number were same..

There were 30 other MCQs from aptitude, programming, data structures and algorithms.

After the online test, there were 3 rounds

Round: Technical Interview
Experience: I was given two scenarios to write test cases(apart from UItesting). One was the flipkart coupon textbox from checkout page and the other was the gmail application. He also asked me sql query to remove all duplicates from a table having multiple duplicates.

College Name: NA

Skills evaluated in this interview

Interview questions from similar companies

Sdet Interview Questions & Answers

Amazon user image Anonymous

posted on 24 May 2015

Interview Questionnaire 

13 Questions

  • Q1. Project Detail & past experience
  • Q2. Current Technology i am working in
  • Ans. 

    I am currently working with Java and Selenium for test automation.

    • Using Java programming language for writing test scripts

    • Using Selenium WebDriver for automating web applications

    • Integrating with CI/CD tools like Jenkins for continuous testing

    • Working with frameworks like TestNG for test management

    • Using tools like Maven for project management

  • Answered by AI
  • Q3. Maximum Subsequent distinct & contiguous sub array in a character array
  • Ans. 

    Find the maximum subsequent distinct and contiguous subarray in a character array.

    • Use a sliding window approach to iterate through the array.

    • Keep track of the distinct characters in the current subarray.

    • Update the maximum length and subarray as necessary.

  • Answered by AI
  • Q4. Make a stack using 2 given queue
  • Ans. 

    Create a stack using 2 given queues.

    • Push elements into one queue until it is full.

    • When the first queue is full, push new elements into the second queue.

    • To pop an element, remove all elements from the non-empty queue except the last one.

    • Switch the non-empty queue to the other one when it becomes empty.

  • Answered by AI
  • Q5. Some Project Experience & Automation Framework Discussion,which i have worked on
  • Q6. There was some situational questions also for Team work
  • Q7. About DNS Server,Router etc
  • Q8. You are given a web page into that simply one browse button and Image Holder is their.Write the Test Cases for this
  • Q9. You are given application like Google Analytics. How will you test this application ?
  • Q10. What are the basic features you will add into your own test framework
  • Ans. 

    A test framework should have features like test case management, test data management, reporting, and integration with CI/CD tools.

    • Test case management: Ability to create, organize, and execute test cases.

    • Test data management: Ability to manage test data and generate test data sets.

    • Reporting: Ability to generate detailed test reports with metrics and logs.

    • Integration with CI/CD tools: Ability to integrate with tools li...

  • Answered by AI
  • Q11. How will you check that each page of amazon.com is having its logo or not.he also asked me to write code for this also
  • Ans. 

    To check if each page of Amazon.com has its logo, we can use automated testing with Selenium WebDriver.

    • Use Selenium WebDriver to navigate to each page of Amazon.com

    • Locate the logo element on each page using its XPath or CSS selector

    • Verify that the logo element is displayed on each page

  • Answered by AI
  • Q12. Have you worked on any automation framework or not?
  • Ans. 

    Yes, I have worked on automation frameworks.

    • I have experience in developing and maintaining automation frameworks using tools like Selenium, TestNG, and Cucumber.

    • I have also worked on customizing existing frameworks to meet specific project requirements.

    • I am familiar with both data-driven and keyword-driven frameworks.

    • I have integrated automation frameworks with CI/CD pipelines for continuous testing.

    • One example of a p...

  • Answered by AI
  • Q13. What happen between, when you enter a URL into a browser address bar and hit enter to actually page gets loaded ?
  • Ans. 

    When entering a URL and hitting enter, the browser performs DNS lookup, establishes a TCP connection, sends an HTTP request, receives the response, and renders the page.

    • Browser performs DNS lookup to resolve the domain name to an IP address

    • Browser establishes a TCP connection with the server

    • Browser sends an HTTP request to the server

    • Server processes the request and sends back an HTTP response

    • Browser receives the respon

  • Answered by AI

Interview Preparation Tips

Round: HR INTERVIEW
Experience: 1. Let’s start with you introduction

In between introduction he asked me about my some project work experience and How have you done?2. Take a integer as a input and replace all the ‘0’ with ‘5’. For example:

102 - 152

1020 - 1525

(Do not use any array for replacing the '0' to '5') 3. You are given two binary tree and write algorithm to check

Are two Binary Trees mirror image of each other?Amazon Interview for SDET @ Hydrabad Development Center

Round: Case Study Interview
Experience: This round was purely for checking Test Framework and Test Case Knowledge.He has given me some scenario and ask to write test cases for them.

Round: HR Interview
Experience: This round was purely a discussion based on past project experience.Like which project do you think that was most difficult and you had a nice experience.
He asked me each progress point of the project.

College Name: NA

Skills evaluated in this interview

Sdet Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Questionnaire 

4 Questions

  • Q1. Given a singly linked list, write a recursive method to reverse every 3 nodes in the list. He asked me to inform if I have seen the question
  • Ans. 

    Reverse every 3 nodes in a singly linked list using recursion.

    • Create a recursive method that takes the head of the linked list as input.

    • If the head is null or there are less than 3 nodes remaining, return the head.

    • Reverse the first 3 nodes by swapping their pointers.

    • Recursively call the method on the next 3 nodes and update the pointers accordingly.

    • Return the new head of the reversed linked list.

  • Answered by AI
  • Q2. Long discussion on my internship and about the projects I have worked on
  • Q3. Tell about your criticism
  • Q4. 3 weaknesses currently i am working
  • Ans. 

    1. Time management 2. Public speaking 3. Learning new technologies

    • Struggling with time management, often missing deadlines

    • Nervous when speaking in front of large groups

    • Finding it challenging to keep up with the latest technologies in the field

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: On-line Coding Round on Hacker Rank:

1. Given an array of sorted integers which represent box sizes and an integer representing an item size

    You have to find best fit box for the item (-1 in case of no box found)

  For example:

    Given 10,20,30,40,50,60,70 and 45

      You have to print 50

    Given 10,20,30,40,50,60,70 and 75

      You have to print -1

      Given 10,20,30,40,50,60,70 and 50

    You have to print 50

2. -----/

Round: TECHNICAL INTERVIEW
Experience: 1. Given an array of integers

you have to output sequence a1,a2,a3,a4,a5,a6,a7 such that a1a3a5a7

    For example:

    Given 10,20,30,40,50,60,70

      You have to print 10, 30, 20, 50, 40, 70, 60

At first, I gave answer using sorting. But my interviewer asked me to do this without sorting the input array, and I did it.

2. A simple question on Tree data structure which i don’t remember.

3. Questions related to my project.

Round: TECHNICAL INTERVIEW
Experience: 1. A matrix is given which is sorted row wise and column wise

You have to print the sorted order.

    For example:

    Given

       1 2 3 4 6 8

       2 3 3 4 7 8

       2 3 4 5 7 8

       2 3 4 5 8 8

       3 4 4 6 8 9

       4 5 5 7 8 9

    You have to print sorted order

2. Questions related to my project during my internship.

Round: TECHNICAL INTERVIEW
Experience: 1.What happens when we type amazon.com

Relating to this the interviewer asked me every step in detail including all 7 layers of networks.

Protocols like: HTTP, HTTPS, DHCP, DNS, IMAP, POP, TCP, UDP etc. Their uses and differences.

2. Describe ACID property of a transaction (DBMS).

Round: HR Interview
Experience: Given a singly linked list, write a recursive method to reverse every 3 nodes in the list.
He asked me to inform if I have seen the question.I replied : Yes sir, it is the similar question I faced in coding round of Amazon-internship last year.
But he didn’t changed the question.
I solved it with a silly mistake which i corrected when mentioned.

College Name: NA

Skills evaluated in this interview

Sdet Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

College Name: NA

Sdet Interview Questions & Answers

Snapdeal user image Anonymous

posted on 11 May 2015

Interview Questionnaire 

6 Questions

  • Q1. Same DS, Algo questions and resume based interview.
  • Q2. Asked some advanced Java questions since I had done a project in J2EE
  • Q3. Your previous projects, interests
  • Ans. 

    I have worked on projects involving test automation, performance testing, and API testing. I am also interested in exploring new testing tools and techniques.

    • Test automation projects using Selenium and Cucumber

    • Performance testing using JMeter for load testing

    • API testing using Postman and RestAssured

    • Interest in exploring new testing tools and techniques

  • Answered by AI
  • Q4. Questions about resume
  • Q5. Why Snapdeal
  • Ans. 

    Snapdeal is a leading e-commerce platform in India, offering a wide range of products and services.

    • Snapdeal has a vast product catalog, providing customers with a wide variety of options.

    • The platform offers competitive prices and frequent discounts, making it attractive for customers.

    • Snapdeal has a user-friendly interface and a seamless shopping experience.

    • The company has a strong logistics network, ensuring timely del...

  • Answered by AI
  • Q6. Puzzles and SQL query questions

Interview Preparation Tips

Round: Test
Experience: a) Aptitude MCQ (50 questions in 12 minutes), b) Quant + 2 Coding questions (Hackerrank) (45 minutes), c) C/Java MCQ* Aptitude MCQ consists of very easy questions, speed is all what matters here. Attempt all questions (No negative marking).* Quant questions were a bit difficult and took time to solve. For some questions, we had to deduce the answer by checking all the options. Hackerrank coding questions were average.

Line intersection problem and overlapping paintings problem.

” It is important to solve atleast 1 coding problem (3 test cases atleast), to get into the next round. ”

Get familiar with Hackerrank before your interview.*C/Java MCQ questions were average. You had to choose either C or Java. Basic output questions.
Duration: 60 minutes
Total Questions: 50

Round: Technical Interview
Experience: Majority of the students were eliminated after the first round. This round consisted of questions from DS, Algo, OS and Networks. linked list, stack, queue and tree questions were their favorites. Refer geeksforgeeks for questions on these topics (LL reversal, identical trees etc). Also, the interviewer would ask you to write the code for questions on LL, trees etc., so be prepared for it. I was also asked about deadlock, process synchronization, TCP/IP.If you are unable to solve a problem, that is perfectly all right. Don’t give up. Tell the interviewer what you are thinking. The interviewer would help you to reach the final solution.

Round: Technical Interview
Tips: Please don’t write non-sense in your resume,If you have something in your resume, be prepared to back it up.Make sure you know everything about your previous projects.

Round: Technical Interview
Experience: SQL questions were difficult. Study nested queries, joins etc. Again, don’t quit. Try to reach out a solution, interact with the interviewer. They want to know your thought process. I wasn’t able to give the correct/optimal solution of queries and the puzzle, but i was able to dig deep and give a non-optimal solution. Practice popular puzzles.Round 2,3,4 may take upto 1.5 hrs each depending upon the interviewers and candidates. They would know almost everything about you after these 3 rounds.

College Name: NA

Sdet Interview Questions & Answers

Amazon user image Anonymous

posted on 26 Nov 2021

I applied via Company Website and was interviewed in Oct 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. There were total 6 rounds: 3 were Technical Coding rounds(Data Structure Based), Expect questions at least LeetCode medium level. 4th round was a Manager Round, he asked mostly managerial questions with so...

Interview Preparation Tips

Interview preparation tips for other job seekers - Complete experience was good. Interviewers were helpful. Be prepared for Bar Raiser round, this was the round where I faced difficulty to answer questions. And don't expect much questions related to automation. Amazon consider there SDETs equivalent to SDEs.

Sdet Interview Questions & Answers

Amazon user image Anonymous

posted on 18 Oct 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
No response
Round 1 - One-on-one 

(1 Question)

  • Q1. First and last occurrence of an element in an array
  • Ans. 

    Find the first and last occurrence of a specific element in an array of strings.

    • Iterate through the array and keep track of the index of the first and last occurrence of the element.

    • Return the index of the first and last occurrence of the element.

  • Answered by AI

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

Flipkart Interview FAQs

What are the top questions asked in Flipkart Sdet interview?

Some of the top questions asked at the Flipkart Sdet interview -

  1. if you are given a sorted array of size 7 but only 4 elements in it and a sorte...read more
  2. How do you find if a string is a palindrome or n...read more
  3. How do you find if given two linked lists intersect or ...read more

Recently Viewed

INTERVIEWS

RITES

No Interviews

JOBS

Optiver

No Jobs

SALARIES

Optiver

SALARIES

Saint-Gobain

SALARIES

Optiver

INTERVIEWS

RITES

No Interviews

SALARIES

RITES

SALARIES

RITES

SALARIES

Asian Paints

LIST OF COMPANIES

Saint-Gobain

Associated Companies

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
PolicyBazaar Interview Questions
3.6
 • 355 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Info Edge Interview Questions
3.9
 • 317 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
View all
Flipkart Sdet Salary
based on 10 salaries
₹8.2 L/yr - ₹29 L/yr
31% more than the average Sdet Salary in India
View more details
Senior Executive
2.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Executive
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
1.6k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Entry Operator
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Flipkart with

Amazon

4.1
Compare

Myntra

4.0
Compare

Snapdeal

3.8
Compare

Meesho

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