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

Flipkart SQL Developer Interview Questions and Answers

Updated 15 Oct 2024

Flipkart SQL Developer Interview Experiences

1 interview found

SQL Developer Interview Questions & Answers

user image Anonymous

posted on 15 Oct 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - One-on-one 

(5 Questions)

  • Q1. SQL topics in operaters dql,
  • Q2. Dml,ddl,tcl,sub query
  • Q3. College projects
  • Q4. Special operators
  • Q5. Education baground

Interview Preparation Tips

Interview preparation tips for other job seekers - naukri

Interview questions from similar companies

I appeared for an interview before Dec 2015.

Interview Questionnaire 

2 Questions

  • Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
  • Q2. Why do you want to join the company?
  • Ans. 

    I am excited to join the company because of its reputation for innovation and commitment to employee growth.

    • I am impressed by the company's track record of developing cutting-edge software solutions.

    • I appreciate the company's focus on fostering a culture of learning and development.

    • I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.

    • I believe that the co...

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)

Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.

Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions

Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad

Interview Preparation Tips

Round: Technical Interview
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.

Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview 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

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.

  • Q1. 

    Merge Two Sorted Linked Lists

    Given two sorted linked lists, your task is to merge them into a single sorted linked list. Return the head of the newly combined list.

    Note:

    The given linked lists may or ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list.

    • Create a dummy node to start the merged list

    • Compare nodes from both lists and add the smaller one to the merged list

    • Move the pointer of the merged list and the list with the smaller node

    • Handle cases where one list is exhausted before the other

    • Return the head of the merged list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice

  • Q1. 

    Missing Numbers Problem Statement

    You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...

  • Ans. 

    Identify missing numbers within the range of smallest and largest elements in an array.

    • Find the smallest and largest elements in the array.

    • Generate a list of numbers within the range of smallest and largest elements.

    • Remove the numbers that are present in the array to get the missing numbers.

    • Sort and return the missing numbers.

  • Answered by AI
  • Q2. 

    Find Maximum Element Between Two Nodes in a BST

    Given a Binary Search Tree (BST) and two integers, NODE1 and NODE2, determine the maximum element found in the path between NODE1 and NODE2.

    Explanation:

    ...

  • Ans. 

    Find the maximum element between two nodes in a Binary Search Tree (BST) path.

    • Traverse the BST to find the path between NODE1 and NODE2.

    • Keep track of the maximum element encountered in the path.

    • Return the maximum element found, or -1 if NODE1 or NODE2 are not in the BST or no elements exist between them.

  • Answered by AI
  • Q3. 

    String Compression Problem Statement

    Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...

  • Ans. 

    Implement a program to compress a string by replacing consecutive duplicates with the count of repetitions.

    • Iterate through the string and keep track of consecutive characters and their counts.

    • Replace consecutive duplicates with the count of repetitions.

    • Ensure the count of repetitions is ≤ 9.

    • Return the compressed string.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in BangaloreEligibility criteriaOnly femalesAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, Dynamic programming, Computer network basicsTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions

Application resume tips for other job seekers

Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

    • Use a nested loop to compare each element with all elements to its right.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Postfix Expression Evaluation Problem Statement

    Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...

  • Ans. 

    Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).

    • Iterate through each character in the postfix expression

    • If character is an operand, push it onto the stack

    • If character is an operator, pop two operands from stack, apply operator, and push result back

    • Continue until end of expression, return final result modulo (10^9+7)

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

  • Q1. 

    String Rearrangement Problem Statement

    You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.

    Return the rear...

  • Ans. 

    Given a string of lowercase characters, rearrange it so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.

    • Iterate through the string and count the frequency of each character.

    • Sort the characters based on their frequency in non-increasing order.

    • Place the characters with highest frequency first, alternating with other characters.

    • If there are more than half of the characters with

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    Given an integer array ARR of size N and an integer S, your task is to return a list of all pairs of elements such that the sum of each pair equals S.

    Input:

    The first line co...
  • Ans. 

    The task is to find pairs of elements in an array that sum up to a given target value.

    • Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Ensure pairs are sorted based on the criteria mentioned in the question.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

  • Q1. 

    Find Number of Islands

    You are provided with a 2-dimensional array/list of size N rows by M columns, containing ones (1) and zeroes (0). Here, 1 represents land, and 0 represents water.

    A cell is consider...

  • Ans. 

    Find the number of islands in a 2D matrix of 1s and 0s.

    • Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

    • Use a visited array to keep track of visited cells to avoid counting the same island multiple times.

    • Increment the island count whenever a new island is encountered.

  • Answered by AI
  • Q2. 

    Triplets in a Sorted Doubly Linked List

    Given a sorted doubly linked list of distinct nodes, determine how many triplets in the list have a sum equal to a given value 'X'. Each node in the list contains a...

  • Ans. 

    Given a sorted doubly linked list of distinct nodes, find and count triplets with a sum equal to a given value 'X'.

    • Iterate through the list and for each node, use two pointers to find the other two nodes that sum up to 'X'.

    • Keep track of the count of triplets found and return it at the end.

    • Handle edge cases like when the list has less than 3 nodes or no triplets are found.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from J.C. Bose University of Science and Technology, YMCA. Eligibility criteriaCgpa above 7Amazon interview preparation:Topics to prepare for the interview - Array, Strings, Graph, Linked list, DP, Greedy, Trees, Binary search, Two-pointersTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare application part of topics like graph other than the general questions.
Tip 2 : Prefer Leetcode for solving questions.
Tip 3 : Practice as many questions as possible from topic arrays.

Application resume tips for other job seekers

Tip 1 : Add stuff you really have good knowledge about.
Tip 2 : Use the point-wise format for filling any area (eg: Brief explanation of projects).

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

In this round i was tested for Data Structure competency. Two questions were asked.

  • Q1. 

    Group Anagrams Problem Statement

    Given an array or list of strings called inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...

  • Ans. 

    Group anagrams in an array of strings based on their characters.

    • Iterate through the array of strings and sort each string to group anagrams together.

    • Use a hashmap to store the sorted string as key and the list of anagrams as value.

    • Return the values of the hashmap as the grouped anagrams.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Two questions were asked in this round on data structures and algorithms.

  • Q1. 

    BST Iterator Problem Statement

    You are tasked with creating a class named BSTIterator that acts as an iterator for the inorder traversal of a binary search tree. Implement the following functions:

    1. BST...
  • Ans. 

    Implement a BSTIterator class for inorder traversal of a binary search tree.

    • Create a BSTIterator class with constructor, next, and hasNext functions.

    • Use a stack to simulate inorder traversal of the binary search tree.

    • Ensure the hasNext function returns true if there are more elements to traverse.

    • Example: Input - 4 2 6 1 3 5 7 -1 -1 -1 -1 -1 -1, Output - 1 2 3 4 5 6 7

  • Answered by AI
  • Q2. 

    K Most Frequent Words Problem Statement

    Given an array or list WORDS of 'N' non-empty words and an integer 'K', identify the 'K' most frequent words and return them sorted by their frequency, in descendin...

  • Ans. 

    Identify the K most frequent words in a list, sorted by frequency and lexicographical order.

    • Use a hashmap to store word frequencies

    • Use a min heap to keep track of K most frequent words

    • Sort the heap based on frequency and lexicographical order

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming , Trees, LinkedList, OOPS, Stack, QueueTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Build strong fundamentals in Data Structures and Algorithms. Practise basic data structures like Arrays, Linked List, Tree, Stack, Queues. For Graphs practise - BFS, DFS, Kruskal, Prims.
Tip 2 : Practice coding questions (medium-hard level) on online platforms like CodeZen, Codeforces, CodeChef.
Tip 3 : Practice mock interviews before the real interview.

Application resume tips for other job seekers

Tip 1 : Briefly write you skills in which you are comfortable. Don't try to add anything vague as you will be questioned about everything which is written on resume.
Tip 2 : Have at least two projects on your resume which reflects application of your acquired skills

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    String Transformation Problem Statement

    Given a string str of length N, perform a series of operations to create a new string:

    1. Select the smallest character from the first 'K' characters of the string,...
  • Ans. 

    The problem involves selecting the smallest character from the first 'K' characters of a string and appending it to a new string until the original string is empty.

    • Iterate through the string, selecting the smallest character from the first 'K' characters each time.

    • Remove the selected character from the original string and append it to the new string.

    • If fewer than 'K' characters remain, sort and append them in order.

    • Rep...

  • Answered by AI
  • Q2. 

    Counting Derangements Problem

    A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0} because each el...

  • Ans. 

    Count the total number of derangements possible for a set of 'N' elements.

    • A derangement is a permutation where no element appears in its original position.

    • Use the formula for derangements: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!).

    • Return the answer modulo (10^9 + 7) as the result could be very large.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

1 hour online interview. 
Slot was given prior via email.
The HR contacted me via email and simultaneously provided me a link where I had to write the codes during my interview

  • Q1. 

    Mike and Mobile Keypad Problem

    Mike, a young math enthusiast, is playing with his mom’s mobile phone, which has a keypad with 12 buttons (10 digits: 0-9, and 2 special characters: ‘*’ and ‘#’). His challe...

  • Ans. 

    Calculate the number of distinct numbers that can be formed by pressing 'N' buttons on a mobile keypad following specific rules.

    • Use dynamic programming to keep track of the number of distinct numbers that can be formed at each step.

    • Consider the possible transitions from each button to calculate the total number of distinct numbers.

    • Implement a solution that efficiently handles large values by using modulo arithmetic.

    • Ens...

  • Answered by AI
  • Q2. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array of integers.

    • Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum in O(N) time complexity.

  • Answered by AI
  • Q3. 

    Maximum Sum of Non-Adjacent Elements

    Given an array/list of ‘N’ integers, your task is to return the maximum sum of the subsequence where no two elements are adjacent in the given array/list.

    Example:

    I...
  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or skip it.

    • At each index, the maximum sum is either the sum of the current element and the element two positions back, or the sum at the previous index.

    • Iterate through the array and update the maximum sum at each index accordingly.

    • Return the...

  • Answered by AI
  • Q4. 

    Trapping Rainwater Problem Statement

    You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the ith bar. Calculate the total amount of rainwater t...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped within given elevation map.

    • Iterate through the array to find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water above each bar to get the total trapped water for the elevation map.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Strongly Connected Components (Tarjan’s Algorithm) Problem Statement

    Given an unweighted directed graph with V vertices and E edges, your task is to identify and print all the strongly connected component...

  • Ans. 

    Tarjan's Algorithm is used to find strongly connected components in an unweighted directed graph.

    • Tarjan's Algorithm is a depth-first search based algorithm.

    • It uses a stack to keep track of vertices in the current SCC.

    • The algorithm assigns a unique id to each vertex and keeps track of the lowest id reachable from the current vertex.

    • Once a SCC is identified, the vertices in the stack form that SCC.

    • The algorithm runs in O...

  • Answered by AI
  • Q2. 

    Stock Trading Maximum Profit Problem

    Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...

  • Ans. 

    The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.

    • Iterate through the stock prices and buy on days when the price is lower than the next day, and sell on days when the price is higher than the next day.

    • Calculate the profit by summing up the differences between buying and selling prices.

    • Repeat the process for each test case and output the maximum profit achie...

  • Answered by AI
Round 4 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a one hour round in which I was first told to introduce myself and then moved to questions.

  • Q1. 

    Permutation in String Problem Statement

    Determine if the string str2 contains a permutation of the string str1 as one of its substrings.

    Input:

    The first line contains an integer 'T', representing the n...
  • Ans. 

    Check if a permutation of one string is a substring of another string.

    • Create a frequency map of characters in str1.

    • Iterate through str2 with a window of size N and check if the frequency map matches.

    • Return 'Yes' if a permutation is found, 'No' otherwise.

  • Answered by AI
  • Q2. 

    Sort 0s, 1s, and 2s Problem Statement

    You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.

    Input:

    ...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array once and swap elements based on their values and the pointers.

    • After the single scan, the array will be sorted in the required order.

  • Answered by AI
Round 5 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This was based more on my communication skills rather than my technical skills. The interviewer didn't only focus on whether I knew the answer or not but if I was able to communicate my knowledge to the interviewer.

It was more of theory based interview
Questions are as follows:-
1. What are SQL and acid properties?

2. How does a website start?

3. What are deadlocks with real life examples? Give necessary conditions for deadlock. 
-> Real life examples were must. 

4. What is virtual function?

5. Tell me the most challenging this while you made your project. ( I had to pick my project on my own) 

6. Tell me the most interesting feature you found working on a language. 

7. Technical question on structures in C as I used it in my project. The interviewer asked if the structure for a linked list is changed as:-
struct node

{
int data;
struct next; 
};
I explained how this won't work as struct will be created again and again which will lead to memory limit exceeded.

  • Q1. 

    Delete Alternate Nodes from a Singly Linked List

    Given a Singly Linked List of integers, remove all the alternate nodes from the list.

    Input:

    The first and the only line of input will contain the elemen...
  • Ans. 

    Remove alternate nodes from a singly linked list of integers.

    • Traverse the linked list and skip every alternate node while updating the next pointers.

    • Make sure to handle cases where there are less than 3 nodes in the list.

    • Update the next pointers accordingly to remove alternate nodes.

    • Example: Input: 10 20 30 40 50 60 -1, Output: 10 30 50

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from J.C. Bose University of Science and Technology, YMCA. Eligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Dynamic programming, Algorithms, OOPS, Data Structures, Operating SystemTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Listen carefully to what the interviewer expects from you. 
Tip 2 : Practice at least 300 questions, topic wise.
Tip 3 : Do participate in contests.

Application resume tips for other job seekers

Tip 1 : Be true on your resume.
Tip 2 : Make your resume crisp and clear.

Final outcome of the interviewSelected

Skills evaluated in this interview

Flipkart Interview FAQs

How many rounds are there in Flipkart SQL Developer interview?
Flipkart interview process usually has 1 rounds. The most common rounds in the Flipkart interview process are One-on-one Round.
What are the top questions asked in Flipkart SQL Developer interview?

Some of the top questions asked at the Flipkart SQL Developer interview -

  1. SQL topics in operaters d...read more
  2. dml,ddl,tcl,sub qu...read more
  3. college proje...read more

Tell us how to improve this page.

Flipkart SQL Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
PolicyBazaar Interview Questions
3.6
 • 366 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Info Edge Interview Questions
3.9
 • 318 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
View all
Flipkart SQL Developer Salary
based on 4 salaries
₹4.5 L/yr - ₹10 L/yr
32% more than the average SQL Developer Salary in India
View more details
Senior Executive
2.6k salaries
unlock blur

₹2 L/yr - ₹9 L/yr

Operations Executive
1.8k salaries
unlock blur

₹1.2 L/yr - ₹6.3 L/yr

Team Lead
1.8k salaries
unlock blur

₹1.2 L/yr - ₹10 L/yr

Assistant Manager
1.6k salaries
unlock blur

₹6 L/yr - ₹21 L/yr

Data Entry Operator
1.5k salaries
unlock blur

₹0.6 L/yr - ₹4 L/yr

Explore more salaries
Compare Flipkart with

Amazon

4.0
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