Flipkart Manual Java Selenium Automation Interview Questions For QA

Updated on: 17.05.2019

• Explain About your self?
• Explain your roles & responsibilities in the project?
• Apart from Selenium, What are the other tools do you know?
• Which framework do you know & Experience?
• Apart from Data-driven, what other frameworks you know?
• What is Jenkins & How do you configure & How do you get mail once tests are completed?
• Which Version controllers are you using?
• Difference between SVN & Git?
• How do you maintain the source code in Git?
• Suppose there are 10 classes & I want to push only 5 classes, How do you do that?
• What are the challenges you faced?
• How do you deal when you get conflicts?
• What are ancestors & Siblings tell me the syntax?
• What are the selenium components & have you used a selenium grid?
• Have you worked on UFT?
• Are you comfortable with the selenium webDriver?
• Reverse a String & Keep the first letter of string constants?
  Example: I/P- Software Testingo, O/P- Serawtfo Tognitse
• Explain the OOPS concept WRT to your framework?

Flipkart Interview Experience | 2years Experience | SDE1 (Offsite Hiring Drive)

Machine Round ( 90mins coding + 30mins review ):

Design and implement a Multiple Level Cache Management System with N levels, say: L1 -> L2 -> L3 … -> LN. Each layer will store Key-Value pairs of data. Both KEY and VALUE are of type String. L1 is the topmost layer with the most priority. LN is the last layer with the least priority. You can choose any replacement policy for the cache. You are given the following details about the system:

• The number of levels of cache.
• The capacity of each layer, i.e., the number of elements that can be stored.
• Read the time of each layer.
• Write the time of each layer.

This Cache system should be able to perform the following operations:

1. READ KEY Operation: The read will start from the L1 level. If KEY is found at this layer, then this value will be returned. If KEY is not found at this layer, later try to read from the next layer. Keep doing this until the value of KEY is found at any level, or the last level has been reached. If the value of KEY is found at any level, then this VALUE should also be written into all previous levels of cache, which have higher priority than this level. Total Read time is the sum of the Reading time of all levels where READ operation was attempted and Write time of all levels where WRITE operation was attempted. You have to print the VALUE of KEY and the total time taken to read it.

2. WRITE KEY Operation: Write will start from the L1 level. Write the value of KEY at this level and all levels below it. If at any level the value of KEY is the same as given VALUE, then don’t write again and return. Total Write time is the sum of WRITE time of all levels where WRITE operation was attempted and Read time of levels where READ operation was attempted. You have to print the total time taken to write this KEY-VALUE information.

3. STAT Operation ( Bonus point / Optional )

Stat operations prints three information:

• What is the current usage of each level of cache, i.e., Filled / Total size
• What is the average read time of this Multi-Level Cache System for the last 10 READ operation?
• What is the average write time of this Multi-Level Cache System for the last 10 WRITE operation?

Implementing the Bonus part is optional, but candidates who implement this part would be rated higher.

The duration of the complete exercise is roughly 2 hours. Of this, 90 mins are available to you for designing and implementing your solution. At the end of this time, your evaluator sits with you 1-on-1 and sees a demo of your code and evaluates it on certain criteria.

Below are a few points you need to keep in mind during your design and implementation.

• Since we want to have a demo, it has to be running code. Appears fairly implicit, but it’s a very important and unique criterion to Flipkart.
• What it means for you is: you may know of excellent data-structures or the most optimal and fitting algorithm to the given problem statement, but you need to ask yourself whether you can implement it within 90 mins? If the answer is not close to yes, you may need to reconsider and maybe choose a sub-optimal but simpler-to-implement data-structures/algorithm. Of course, you would always have the chance to explain this choice later in your evaluation.
• If you can get it implemented and running in the given time, a more optimal and fitting solution will have more credit.
• Your code needs to display maturity in various senses: modularity, extensibility, Separation of Concerns(SoC), good and consistent naming-conventions, validation and exception handling, comprehensive of test-cases covering corner cases, and other coding best practices that you may be aware of and follow. So, put related functionality in classes or methods, don’t have unrelated things muddled together in a class, make interfaces or base classes wherever you see generic behavior that can be abstracted out, etc.

Essentially, just 3 things: running code, optimality, and maturity.

Check: Selenium Testing Interview Questions

I solved this problem using LRU Policy. I solved the Bonus part partially. Here’s input/output from my code: ( I have also printed all elements of cache for better understanding )

• 3
• 2 5 10
• 1 3 9
• 5 10 15
• WRITE ABC apple
• WRITE def ball
• READ ABC
• WRITE ghi cat
• WRITE jkl dog
• WRITE mno elephant
• WRITE pqr fish
• READ jkl
• WRITE abc apple
• STATS

Sample Output:

Don’t Miss: Selenium Program For Testers

Write time: 43

• abc: apple,
• abc: apple,
• abc: apple,

Write time: 43

• def: ball, abc: apple,
• def: ball, abc: apple,
• def: ball, abc: apple,

Value at abc is apple

Read time: 1

• abc: apple, def: ball,
• def: ball, abc: apple,
• def: ball, abc: apple,

Write time: 43

• ghi: cat, abc: apple,
• ghi: cat, def: ball, abc: apple,
• ghi: cat, def: ball, abc: apple,

Write time: 43

• jkl: dog, ghi: cat,
• jkl: dog, ghi: cat, def: ball, abc: apple,
• jkl: dog, ghi: cat, def: ball, abc: apple,

Write time: 43

• mno: elephant, jkl: dog,
• mno: elephant, jkl: dog, ghi: cat, def: ball, abc: apple,
• mno: elephant, jkl: dog, ghi: cat, def: ball, abc: apple,

Write time: 43

• pqr: fish, mno: elephant,
• pqr: fish, mno: elephant, jkl: dog, ghi: cat, def: ball,
• pqr: fish, mno: elephant, jkl: dog, ghi: cat, def: ball, abc: apple,

Value at jkl is a dog

Read time: 9

• jkl: dog, pqr: fish,
• jkl: dog, pqr: fish, mno: elephant, ghi: cat, def: ball,
• pqr: fish, mno: elephant, jkl: dog, ghi: cat, def: ball, abc: apple,

Write time: 28

• abc: apple, jkl: dog,
• abc: apple, jkl: dog, pqr: fish, mno: elephant, ghi: cat,
• abc: apple, pqr: fish, mno: elephant, jkl: dog, ghi: cat, def: ball,

Usage: 2 / 2, 5 / 5, 6 / 10,

• abc: apple, jkl: dog,
• abc: apple, jkl: dog, pqr: fish, mno: elephant, ghi: cat,
• abc: apple, pqr: fish, mno: elephant, jkl: dog, ghi: cat, def: ball,

Questions asked during code review:

• Why LRU?
• What was the reason behind creating every class?
• How easily can you change/modify the Caching policy?

Problem Solving / Data structure Round (1 hour)

• Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer.
• You are standing at 0 on a number line. At i’th turn, you can move exactly. I step towards left or right. What is the minimum number of steps required to reach a given number n?
• It is given a 2D square matrix of zero and one. Find the largest square submatrix inside the given matrix, which has one on all its boundary.
  E.g.:

1 0 1 1 1 1
1 0 1 0 1 1
1 0 1 0 0 1
0 1 1 1 1 1
1 1 0 1 1 1
0 0 1 1 0 1

Output: 4 (highlighted in bold, I solved it using N^3 DP)

• Sort A stack using the only recursion. You can’t use any loops.
• Given an array, find a subset with a given sum.

All questions involved writing pseudo code, time-complexity, space-complexity, edge-cases

HR Round (30 mins)

• Tell me something about yourself.
• Discussed projects of the current company in detail.
• What was the most challenging I did at my company?
• Who is your role model? Why?
• Have you helped juniors at your company?
• How do you keep updated with new technologies?
• Why are you changing jobs?
• Why Flipkart?

Flipkart SDE Interview Questions

I had an interview with Flipkart for SDE. There was two technical round both guys were cool, and the interview process was very nice when I got stuck they provide me a hint.

Round 1:

• You have an infinite stream of repeated numbers find top K frequent number from this stream and discussion on this question like which data structure will you use and time complexity etc.
• Given a link list consist of data, next pointer, and also a random pointer, which points to a random node of the list. How will you make a clone of this?
• How an array (fixed size can) use like for K stack? and after this, how will you make these k stack to memory efficient?

Read Also: Manual Test Cases For Testers

Round 2:

• A linked list was containing characters as values. Find if a linked list is a palindrome.
• Given two integers M and N write the function to compute the number of bit changes required to convert one to another
  Example: m=14 n=15
  Answer: 1Explanation : 24 : 11000 15: 01111
• Project-related questions
• Oops, concepts in detail.

I recently interviewed for a Senior Software Engineer at Flipkart. This is my interview experience.

Flipkart Technical Interview Round Process

Round 1:

• Tell me if a binary tree is BST?
• Given a stream of integers, give me the median at any time.
• Given a sorted array, being rotated; Find an element in it.

Don’t Miss: Selenium Tutorials For Testers

Round 2:

• Need an efficient solution for the problem. Given an array a[], find three indices (triplets) i,j,k such that:
  i < j < k
  2. a[i] < a[j] < a[k] 3. a[i] + a[j] + a[k] <= t , where t is a given sum Array is not necessarily sorted. Have to count number of such triplets.
• Construct a BST with the preorder, and inorder traversals gave

Round 3:

• Identify Trending Topics with many constraints like demographic regions/gender/religion etc. Discussion on the best methods.
• An iron rod is given that has to be cut in a manner such that the cost is maximized. Different rod sizes have different costs, and there is a cutting cost involved.
• Deletion in a binary search tree?

The last round was a telephonic round with VP after a few days.

Check Also: Java Tutorials For Testers

Round 4: VP Round (Telephonic – 50mins)

• Discussion on projects.
• Behavioral questions. Interests, why willing to change, etc.

Flipkart Technical Interview Questions

Company: Flipkart

• Write code to find the sum of two numbers stored as a linked list. (LSB at last node) and the head of each list is given.
• Write code to print elements on the path from a root to a leaf node having the maximum sum.
• What is the complexity of retrieving min element from a max heap?
• Which is the fastest method to sort an almost sorted array: quick sort, bubble sort, merge sort, shell sort
• Tell me about the zombie process?
• Complexities on a hash table?
• Reverse linked list and a few questions on trees and dynamic prog and aptitude testing?
• Given an array, find any three numbers which sum to zero. Give the best algorithm?
• Given a BST, how would you return the kth smallest element? Cover all the corner cases with time complexity long?

Thanks, Akshaya, for sharing your interview experience. Software Testingo Team wishes you all the best for your future.

Flipkart SDE Interview Questions in Bangalore

I have recently appeared for the Flipkart Recruitment process for the SDE position. I want to share the interview questions.

Flipkart Interview Process

Telephonic Round: 1
F2F : 3 Rounds

Technical Interview Questions

• A sentence is given, which contains lowercase English letters and spaces. It may contain multiple spaces. Get the first letter of every word and return the result as a string. The result should not contain any space.
• Find the Nth largest element in the BST.
• Given a BST, find the node which contains the value which is equal to or greater than the input value?
• Write a program to check if a binary tree is balanced
• Given S string, Find max size of a sub-string, in which no duplicate chars present?
• What is a hash table? Explain how they work (hash function and buckets)?
• WAP to find a continuous subset whose sum is divisible by 7. We are given an array of numbers (-ve and +ve). Calculate the complexity of your algorithm?
• Given a 2-dimensional array of integers, find the value 1 in the array and set all those rows and columns to 1, which contains one of the values as 1.
• How to find a number in a rotated sorted array. Was he looking for the binary search kind of solution?

Thanks, Software Testingo Blog, for maintaining such a nice website. It helped me a lot.

Flipkart Interview Process & Experience

I recently have appeared for the Flipkart interview process.

Round 1

• Write code to check if a tree is BST or not.
• Modify this code to find the maximum subtree in a tree, which is a BST. A maximum subtree means subtree goes up to its leaves from any node. Modify the code again to find the maximum tree, which is a BST. BST can lie anywhere, and it may or may not go to its leaves.

Round 2

• There is code like

  var I;
  {
  ..
  var j;
  ..
  }
  var k;
  ..
  var a;
  {
  ..
  var c;
  {
  var I;
  }
  ..
  var d;
  ..
  }

  For simplicity, you may assume that there is only one variable declaration on 1 line. Now given a line number, you have to tell what all variables are valid on that line. Propose an algorithm for this.

• Implement an LRU cache. Write a code for this. LRU cache supports 3 operations,
  put(key, value)
  get(key)
  remove(key)
  S. This is a very important and good question. Even if you know the answer, don’t rush with it. Take your time to frame the algorithm. Always speak your thoughts. Interviewers like to know the way you are thinking.
• WAP to get the next higher palindrome of a given number. 123 -> 131 1232 -> 1331

Round 3

• Implement next_permutation function (similar to what is in algorithm.h).
• Given n sequences, and starting and stopping point of every sequence with its score. For, eg.
  no of sequences = 5
  start-stop score
  0 4 4
  3 10 11
  6 8 8
  7 15 10
  11 15 4
  All scores are positive. You have to find the maximum subset of nonoverlapping sequences having a maximum total sum of scores. I proposed an n^2 approach first and then modified it to -nlgn.
• Normal discussion on work culture, teams, etc.

This is pretty much about the interview rounds. Best of luck. 🙂

Thanks, Shailja Kapoor, for contributing this article. If you would like to contribute, mail us your interview experience softwaretestingo.com@gmail.com. We will like to publish it on Software Testingo Blog and help other job seekers.