Saturday, May 14, 2022
HomeArtificial IntelligenceFlipkart Interview Questions - Nice Studying

Flipkart Interview Questions – Nice Studying

Wipro Interview Questions

About Flipkart

Flipkart Personal Restricted is an Indian e-commerce firm established in 2007. The corporate is headquartered in Bangalore, Karnataka, India included in Singapore as a personal restricted firm. Flipkart began with a main concentrate on on-line e-book gross sales and shortly expanded to totally different product classes akin to way of life merchandise, electronics, dwelling necessities, dwelling groceries and vogue. As we speak, Flipkart is the most important on-line Indian market competing with the world chief Amazon. Since 2010, the corporate has acquired Myntra, Jabong, eBay India, and so forth. This weblog on ” Flipkart Interview Questions” lets you follow the questions requested at Flipkart.

Flipkart Recruitment Course of

The Choice Course of Is Primarily based On The Publish You Are Making use of For How Ever For Entry Degree Place In Flipkart Recruitment Choice Course of There Primarily divided on to beneath steps as follows

  • On-line Coding or Telephonic spherical
  • A number of Technical Rounds
  • Hiring Supervisor Spherical
  • HR Interview Spherical

On-line Coding Spherical/ Telephonic spherical:

The net spherical is hosted on Hackerrank and on this spherical, the candidates are given round 3 coding questions, of which 2 are simple and 1 is difficult. The variety of questions might fluctuate the issue distribution is similar. The entire spherical is round 60 minutes lengthy. Issues are typically primarily based on recursion, strings, timber and graphs.

Technical Spherical 1:

Private interview spherical which largely consists of algorithmic issues on DS like graphs, dp, matrices and strings. Many instances puzzles are additionally requested, although commonplace puzzles, some variation could also be there. A powerful understanding of information buildings is required to cross this spherical.

Technical Spherical 2:

This spherical typically is a machine coding spherical, during which a specific drawback is given whose answer is to be constructed from scratch in any language of alternative, ex: job scheduling drawback, implementing an entire textual content line editor with specified options. The spherical is of ~90 minutes and an entire working code with error dealing with is anticipated on the finish.

Hiring Supervisor spherical:

This spherical primarily consists of exhausting algorithmic and DS associated issues, principally from timber, graphs and linked lists, together with the dialogue of your initiatives, the applied sciences utilized in them, the issues confronted and so forth. Some conceptual issues associated to OS are additionally requested.

HR Interview Spherical:

You possibly can count on HR questions like :

1. Inform about your self.

2. Your shortcomings and strengths.

3. Dialogue concerning your submit within the firm

Eligibility Standards

The eligibility standards for the brisker to affix Flipkart is 60% means in tenth, twelfth and in Commencement. Candidates should have no pending backlogs on the time of showing for the Flipkart Recruitment course of. 

Different necessities embrace:

Candidates should Be Versatile To Work In Shifts.

Candidates Should Have Good Communication Expertise.

Candidates Should Have A Good Maintain On Arithmetic Or Should Be Good In Calculation.

Candidates should Have Good Tutorial Information From Class X On Wards.

Candidates Who Have Attended Flipkart Interview Or Recruitment Earlier than 6 Months Want Not Apply.

Flipkart Interview Questions

Which is the quickest technique to kind an virtually sorted array?

This is among the essential Flipkart Interview Questions

There are quite a lot of sorting algorithms like insertion kind, bubble kind, merge kind, choice kind, heap kind, and quicksort.The array is sort of sorted. The very best-preferred technique is the insertion kind as proven within the beneath program one can infer that insertion kind is the quickest technique. This code makes use of the time within the python library to depict the entire execution time for insertion kind and merge kind. 

#Importing Library
import timeit
def insertion_sort():
    insert_arr = [4, 5, 7, 6]
    for i in vary(1, len(insert_arr)):
        # Set key:
        key = insert_arr[i]
        j = i - 1
        whereas j >= 0 and insert_arr[j] > key:
            # Swap:
            insert_arr[j + 1] = insert_arr[j]
            insert_arr[j] = key
            # Decrement 'j':
            j -= 1
def merge_Sort():
    myList = [4, 5, 7, 6]
    if len(myList) > 1:
        mid = len(myList) / 2
        left = myList[:mid]
        proper = myList[mid:]
        # Recursive name on left and proper half
        # 2 iterators for traversing the 2 halves and one iterator for predominant checklist
        i = 0
        j = 0
        ok = 0
        whereas i < len(left) and j < len(proper):
            if left[i] < proper[j]:
              # The left half worth is used
              myList[k] = left[i]
              # Transferring the iterator ahead
              i += 1
                myList[k] = proper[j]
                j += 1
            # Transferring to the following slot
            ok += 1
        # For all the opposite remaining values in checklist
        whereas i < len(left):
            myList[k] = left[i]
            i += 1
            ok += 1
        whereas j < len(proper):
            j += 1
            ok += 1
print("Insertion kind:")
print("Merge kind:")

Nonetheless, merge kind is most well-liked when the order of enter on not recognized and the worst-case time complexity is nlogn. Whereas bubble kind time complexity of n and fast kind provides complexity of n^2.

What’s a hash desk? Clarify how hash capabilities and buckets work.

A hash desk or hash map is a knowledge construction that gives direct entry to things primarily based on a key. It’s a construction that may map keys to values. Hash tables implement an associative array, which is listed by arbitrary objects (keys). A hash desk makes use of a hash operate (is used to map information of random measurement to fixed-size values.)to compute an index, additionally known as a hash worth, into an array of buckets or slots, from which the specified worth could be discovered.

The primary options of the important thing (a singular string or integer)used:

The important thing used could be your Social safety Quantity, your phone quantity, checking account quantity, and so forth

Keys should  at all times be distinctive

Every secret’s at all times mapped to its related a price

Few properties of Hash Features are:

Computation may be very quick (virtually fixed)

Can’t be reversed it’s unidirectional

Enter data is hidden output doesn’t reveal inputs data

Exhausting to search out collisions (totally different information with the identical hash)

Implementation is constructed utilizing parity-preserving bit operations (XOR and ADD), multiply, or divide.

Hash buckets are used to allocate information gadgets for sorting or lookup functions. The goal is to weaken the linked lists in order that looking for a specific merchandise could be accessed inside a shorter timeframe. 

A hash desk that makes use of buckets is a mix of an array and a linked checklist. Every component within the array i.e. The hash desk is a header for a linked checklist. All parts within the array that hash into the identical location might be saved within the checklist. The hash operate allocates every file to the primary slot inside one of many buckets. If the slots are occupied, then the bucket slots might be searched sequentially till an open slot is discovered. If the bucket is totally stuffed, the file will get saved in an overflow bucket of infinite capability on the finish of the desk. All buckets share the identical overflow bucket. Nonetheless, a superb implementation will use a hash operate that distributes the data evenly among the many buckets in order that as few data as attainable go into the overflow bucket.

Within the given array of integers, discover Pythagorean triplets.

This is among the essential Flipkart Interview Questions

A Pythagorean triplet is a set {a, b, c} such that a2 = b2+ c2. The consumer might be supplied with an array of integers and has to establish all of the attainable units of Pythagorean triples.


We are able to resolve the issue by sorting the given array in ascending order, first in O(n2).

The steps concerned could be:

  1. Sq. each component within the given array after which kind it in ascending order.
  2. Because the array now incorporates squares, the brand new equation for triplet turns into a = b + c. Now repair ‘a’ to be the final component of this sorted array, 
  3. Repair b as the primary component of the sorted array and c because the component proper earlier than component a. Since numbers are constructive and the array is sorted, b<a and c < a. To search out triplets, run a loop that will increase b from 1. 
    1. Enhance the place of b if b + c < a
    2. Lower the place of c if b + c > a
    3. If the sum is the same as a, then print the sq. root of the three numbers, increment b, and decrement c.
    4. Repeat the final step for every component a within the array.
import java.util.*; 
import java.lang.Math; 
class PythagoreanTriplet { 
  static void find_Triplet(int arr_trip[], int n) 
    // Step1 squaring each component in an array
    for (int i = 0; i < n; i++) 
      arr_trip[i] = arr_trip[i] * arr_trip[i]; 
    // Step2 and Step 3 fixing component a b and c and sorting array
    for (int i = n - 1; i >= 2; i--) {  
      int b = 0; 
      int c = i - 1; 
      whereas (b < c) { 
        // if triplet discovered 
        if (arr_trip[b] + arr_trip[c] == arr_trip[i]) {
          System.out.printf("Triplets are: %f, %f, %fn", new Object[] {Math.sqrt(arr_trip[b]), Math.sqrt(arr_trip[c]), Math.sqrt(arr_trip[i])});
        if (arr_trip[b] + arr_trip[c] < arr_trip[i]) 
  // Important code 
  public static void predominant(String[] args) 
    int arr_trip[] = { 3, 7, 4, 6, 5 }; 
    int arr_trip_size = arr_trip.size; 
    find_Triplet(arr_trip, arr_trip_size);

Compute the closest palindrome variety of the given quantity.

The issue assertion is that if for a  given quantity job is to search out the closest palindrome quantity.   

For instance, if the quantity entered is say 43 then there are two numbers that should show the closest palindrome quantity which is 44.

Under are a number of options that may be thought of. 

Answer 1: If a quantity incorporates all 9’s digits then we will get the following closest Palindrome by merely including 2 to it. num = 99 : output : num + 2 = 101.

Answer 2: One other attainable means of getting the closest palindrome is to repeat the primary half of the quantity and add a mirror picture on the finish of it. Left half : For instance, left facet of “456789” is “456” and the left half of “456789” is “4 5”. To transform to a palindrome, we will take the mirror of its left half. 

Let’s quantity: 456789 

After copying the primary half, append the reverse of it on the finish quantity seems to be like:

we get palindrome 456654

Answer 3: One other attainable means of getting the closest palindromic quantity is by decrementing and incrementing the center digit by one on the palindrome. 


The interview questions needs to be directed in direction of acquiring details about the job seeker’s means to carry out the duties of the job, in addition to their motivation for wanting the place. The interviewer also needs to ask questions concerning the job seeker’s {qualifications}, work expertise, and abilities.



Please enter your comment!
Please enter your name here

Most Popular

Recent Comments