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 IT Engineer Interview Questions and Answers

Updated 6 Feb 2023

Flipkart IT Engineer Interview Experiences

1 interview found

IT Engineer Interview Questions & Answers

user image Anonymous

posted on 6 Feb 2023

Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Jan 2023. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(3 Questions)

  • Q1. 1) Tell about your self? 2)What about job role? 3) Why this Select this Company?
  • Q2. Tell me About Your Self? I am Chandrasekhar from Kalburgi and completed Be Graduated in Bangalore and now searching good opportunity.
  • Q3. About Job Role? Searching a growing with you.

Interview Preparation Tips

Interview preparation tips for other job seekers - I am completed BE Graduated and now i am searching good opportunity for Growing with you company.

Interview questions from similar companies

IT Engineer Interview Questions & Answers

Amazon user image Suhas Chintala

posted on 30 Aug 2016

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: Topics were on OS, DBMS, OOPS, C Problems, etc
Tips: A gen brush up on the above subjects is a plus
Duration: 120 minutes
Total Questions: 22

Round: Technical Interview
Experience: Problems on graph algorithms, Sort-search algorithms were asked. The coding was to be done is C or c++.
About 2 rounds of Technical interviews were done
Tips: DSA, Graph theory course stuff should get you through peacefully.

Skills: Basic C/C++, Graph Theory, Algorithms And Data Structures
Duration: 2
College Name: IIT Madras

I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

9 Questions

  • Q1. What is DHCP
  • Ans. 

    DHCP stands for Dynamic Host Configuration Protocol. It is a network protocol that automatically assigns IP addresses to devices.

    • DHCP is used to simplify network administration by automatically assigning IP addresses to devices

    • It allows devices to join a network without manual configuration

    • DHCP servers can also assign other network configuration information such as subnet mask, default gateway, and DNS server addresses

    • ...

  • Answered by AI
  • Q2. What is DNS
  • Ans. 

    DNS stands for Domain Name System. It is a system that translates domain names into IP addresses.

    • DNS is like a phonebook for the internet

    • It helps to locate websites by translating domain names into IP addresses

    • DNS servers store information about domain names and their corresponding IP addresses

    • DNS can also be used for email routing and other internet services

  • Answered by AI
  • Q3. What is Tree
  • Ans. 

    A tree is a perennial plant with a single stem or trunk, supporting branches and leaves.

    • Trees are important for the environment as they absorb carbon dioxide and produce oxygen.

    • They provide shade, shelter, and food for animals and humans.

    • Trees can be classified as deciduous or evergreen based on their leaves.

    • Examples of trees include oak, maple, pine, and palm trees.

  • Answered by AI
  • Q4. What is Server
  • Ans. 

    A server is a computer program or device that provides functionality to other programs or devices, called clients.

    • A server is designed to manage network resources.

    • It provides services to clients over a network.

    • Examples include web servers, email servers, and file servers.

    • Servers can be physical or virtual machines.

    • They often have more processing power, memory, and storage than client devices.

  • Answered by AI
  • Q5. What is Kerrberos
  • Ans. 

    Kerberos is a network authentication protocol used to provide secure communication over the internet.

    • Kerberos uses a ticket-granting server to authenticate users and grant access to network resources.

    • It uses symmetric key cryptography to ensure secure communication between the client and server.

    • Kerberos is commonly used in enterprise environments to provide single sign-on functionality.

    • It was developed by MIT and is no...

  • Answered by AI
  • Q6. What is PST
  • Ans. 

    PST stands for Personal Storage Table, a file format used by Microsoft Outlook to store email messages, contacts, and other data.

    • PST files can be exported/imported to transfer data between different Outlook accounts or computers.

    • PST files have a maximum size limit of 50 GB in Outlook 2010 and later versions.

    • PST files can become corrupted and cause data loss, so it's important to back them up regularly.

    • PST files can be ...

  • Answered by AI
  • Q7. What is Subnettin
  • Ans. 

    Subnetting is the process of dividing a network into smaller subnetworks.

    • Subnetting helps in efficient utilization of IP addresses.

    • It allows for better network management and security.

    • Subnetting is done by borrowing bits from the host portion of an IP address.

    • CIDR notation is used to represent subnet masks.

    • Example: 192.168.1.0/24 represents a network with 256 IP addresses.

  • Answered by AI
  • Q8. What is Active Directory
  • Ans. 

    Active Directory is a Microsoft service that manages network resources and user permissions.

    • Centralized database for managing network resources

    • Allows for user authentication and authorization

    • Provides a hierarchical structure for organizing resources

    • Enables group policy management

    • Integrates with other Microsoft services like Exchange and SharePoint

  • Answered by AI
  • Q9. What is OSPF
  • Ans. 

    OSPF (Open Shortest Path First) is a routing protocol used in IP networks.

    • OSPF is a link-state protocol

    • It calculates the shortest path to a destination using Dijkstra's algorithm

    • It supports VLSM (Variable Length Subnet Masking)

    • It uses a hierarchical network design with areas

    • OSPF routers exchange link-state advertisements (LSAs) to build a topology database

    • It uses cost as a metric to determine the best path

    • OSPF is commo

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice makes perfect

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.

Round 1 - Technical 

(4 Questions)

  • Q1. What is monthly salary
  • Q2. What type of work did I get
  • Q3. What is time of work ?
  • Q4. Can I get part-time job

Interview Preparation Tips

Interview preparation tips for other job seekers - I need part-time job in IT field
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via AmbitionBox and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Shift timing? And off ?
  • Q2. Sallery? And job location?

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

Interview Questionnaire 

15 Questions

  • Q1. Reverse a binary search tree in such a manner so that parent child relationship maintained and left child become right child and vice versa
  • Ans. 

    Reverse a binary search tree while maintaining parent-child relationship.

    • Start by swapping the left and right child of each node recursively.

    • Use a depth-first search approach to traverse the tree.

    • Make sure to update the parent-child relationships accordingly.

  • Answered by AI
  • Q2. Find the minimum and maximum element in stack in O(1)
  • Ans. 

    To find min and max element in stack in O(1), we can use an auxiliary stack.

    • Create an auxiliary stack to keep track of the minimum and maximum elements.

    • Push the first element to both the main and auxiliary stack.

    • For each subsequent element, compare it with the top element of the auxiliary stack and push the smaller element to the auxiliary stack.

    • To get the minimum element, simply return the top element of the auxiliary...

  • Answered by AI
  • Q3. Given an array find the next minimum element in array for each element. for example if give array is 4,2,1,5,3 resultant array would be 2,1,-1,3,-1
  • Ans. 

    Given an array, find the next minimum element for each element.

    • Iterate through the array

    • For each element, compare it with the elements on its right

    • Find the minimum element greater than the current element

    • If no such element exists, assign -1

    • Build the resultant array

  • Answered by AI
  • Q4. Given two string A and B . remove each character from string A which occur in B. if a occur 2 times in B remove 2 a from A
  • Q5. Find the median of input stream in minimum time complexcity.(Online algo)
  • Ans. 

    Find median of input stream in minimum time complexity using online algorithm.

    • Use two heaps, one max heap for elements smaller than current median and one min heap for elements greater than current median.

    • Maintain balance between the two heaps by ensuring that the size difference is at most 1.

    • If the size of both heaps is equal, median is the average of the top elements of both heaps. Else, median is the top element of ...

  • Answered by AI
  • Q6. Make copy of a linked list which has two pointer one point to next node and other one point to arbitrary node in linked list
  • Ans. 

    To make a copy of a linked list with two pointers, iterate through the original list and create a new node for each element.

    • Iterate through the original linked list

    • Create a new node for each element

    • Set the 'next' pointer of each new node

    • Set the 'arbitrary' pointer of each new node

  • Answered by AI
  • Q7. If u will access data from a social networking site such as Facebook . suggest some method to remove latency to access data
  • Q8. Given a cordinate system in which there are n points. you have to calculate the m minimum points from some origin point. Suggest a data structure for this
  • Q9. Some question on hash data structure
  • Q10. Given a linked list and some no n . you have to reverse the node of linked list in pair of n. consider all test cases for this
  • Ans. 

    Reverse the nodes of a linked list in pairs of n

    • Iterate through the linked list in pairs of n

    • Reverse the nodes within each pair

    • Connect the reversed pairs together

    • Handle cases where the number of nodes is not a multiple of n

  • Answered by AI
  • Q11. Given a array where the difference between two consecutive element is one. Given a no find that no in array in minimum time complexity
  • Q12. How to check singly linked list is palindrome or not
  • Ans. 

    To check if a singly linked list is a palindrome, reverse the second half and compare it with the first half.

    • Traverse the linked list to find the middle node

    • Reverse the second half of the linked list

    • Compare the reversed second half with the first half to check for palindrome

  • Answered by AI
  • Q13. Given a preorder of binary tree such that in tree each node have either 0 or no childern. and each leaf node is represented by N. construct a tree from this
  • Ans. 

    Given a preorder of binary tree with leaf nodes represented by N, construct the tree.

    • Start by creating an empty stack.

    • Iterate through the preorder list.

    • If the current element is N, create a leaf node and push it onto the stack.

    • If the current element is not N, create a new node and set its left child to the top of the stack.

    • Pop the top of the stack and set it as the right child of the new node.

    • Push the new node onto the...

  • Answered by AI
  • Q14. 14. you have given a string of multiline. you have to print the maximum occupancy word in each line and if there is some capital letter in each line then print each capital letter occupancy and then smal...
  • Ans. 

    The question asks to find the maximum occupancy word in each line of a given multiline string and also count the occupancy of capital and small letters separately.

    • Split the multiline string into individual lines

    • For each line, split it into words

    • Initialize variables to store the maximum occupancy word and its count

    • Iterate through each word and count the occupancy of each letter

    • If the current word has a higher occupancy ...

  • Answered by AI
  • Q15. One question related to password matching you have given some precondition for password then user input some password then you will validate the password with each condition if any one condition failed th...

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Preparation Tips

Round: HR INTERVIEW
Experience: Tell me about yourself.Most challenging task.-----://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/

Small modification in it. Parenthesis pairs are given in a separate list. You have to optimize the problem by suggesting the method you will need to store the pairs.

Round: HR INTERVIEW
Experience: What is the angle between hour and minute hand at 12:15. I said 90’ but corrected myself immediately.So he told me the importance that for huge no of clients this small mistake can create a blunder.He asked me a scenario where I faced this thing and thereby improved the time complexity.Lot of behavioural questions like conflicts with manager, team collaboration etc.

Round: HR INTERVIEW
Experience: -----://stackoverflow.com/questions/20026243/find-2-missing-numbers-in-an-array-of-integers-with-two-missing-valuesHe asked me if have heard of nut and bolt problem. I didn’t so he moved to next question.Given an array. Find the maximum number of groups of size of 2 or 3 that can be formed such that sum of the numbers in group is divisible by 3. No number can be reused.

Round: TECHNICAL INTERVIEW
Experience: Convert an integer to its roman. He asked me to consider cases with integers containing 4 and 9. I didn’t understand properly.He asked me if I I did anything extraordinary apart from my daily work in the office and what challenges I faced -----/

He did not accept this solution and asked me to optimize. This round didn’t go well, so I was not selected.

General Tips: Tips:Solve all the data structures related problems from geeksforgeeks and start practicing to write perfect code for any problem.
College Name: NA

Interview Questionnaire 

23 Questions

  • Q1. 18 questions in 20 minutes (probability, Os ,DSA,c)
  • Q2. In second section 2 programming questions in 30 minutes.(Pruning a binary tree , Cutting a rod so that we can get optimal benefit )
  • Q3. Given array of stock prices get the date of selling and buying so that profit is maximum
  • Ans. 

    Algorithm to find the best buying and selling dates for maximum profit from given stock prices array.

    • Iterate through the array and keep track of minimum price and maximum profit.

    • If current price is less than minimum price, update minimum price.

    • If current price minus minimum price is greater than maximum profit, update maximum profit and buying and selling dates.

    • Return buying and selling dates.

    • Example: [10, 7, 5, 8, 11,...

  • Answered by AI
  • Q4. Print a matrix diagonally . I was told to write the code as question was quite easy . After that we moved on
  • Q5. Frog can jump 1 or 2 steps write the code to find out number of ways to go up to n steps. Discussed the complexity of it with mathematical proof
  • Ans. 

    The code finds the number of ways to reach n steps by jumping 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem

    • Create an array to store the number of ways to reach each step

    • Initialize the array with base cases for 0 and 1 steps

    • Iterate through the array and calculate the number of ways for each step

    • Return the value at the last step

  • Answered by AI
  • Q6. Check for balancing of parenthesis using divide and conquer. Didn’t ask for code just wanted the approach. I solved it with stack. But he just wanted Divide and conquer. After thinking for 15 minutes and o...
  • Q7. There is a dictionary of billion words and there is one method provided String getWord(int index); We can give it index and it will return the String on that index . Now word is given to us we have to find...
  • Q8. After that he moved to Oops concepts asked about abstract classes and interfaces. Also asked when to use interfaces .After that we had discussion on volatile keyword(Asked for program which can show its be...
  • Q9. He told me if there is a class and if we want to use only 3 methods of it so in that case we should use inheritance or not. Asked for other better options
  • Q10. Why are you leaving your company so early
  • Q11. Discussion about project in company and about my college projects as well(It was a deep discussion and I think it can throw us out if we don’t give proper answers)
  • Q12. Replace each node in BST with sum of its greater nodes. I solved it quite easily after that he applied various constraints on it(around 3 or 4). So the problem became quite hard. But after thinking about ...
  • Q13. After that he discussed about n-ary tree and getting the LCA in n-ary tree of n nodes.(Wrote the code for it and discussed complexity)
  • Q14. Advantages and disadvantages of amazon.com
  • Ans. 

    Amazon.com is an online retail giant with a vast selection of products and services.

    • Advantages: Wide selection of products, competitive pricing, fast shipping, convenient shopping experience

    • Disadvantages: Can put smaller retailers out of business, concerns over worker treatment and environmental impact

    • Example: Amazon Prime offers free two-day shipping and access to streaming services like Prime Video and Music

    • Example: ...

  • Answered by AI
  • Q15. How to make a file mutually exclusive on a shared file system
  • Ans. 

    Use file locking mechanisms like flock or lockfile to make a file mutually exclusive on a shared file system.

    • Use flock or lockfile to acquire a lock on the file before accessing it.

    • Release the lock once the operation is complete.

    • Ensure all processes accessing the file use the same locking mechanism.

    • Example: flock /path/to/file -c 'command to execute'

    • Example: lockfile /path/to/file && command to execute && rm -f /path/t

  • Answered by AI
  • Q16. Tell me about yourself
  • Ans. 

    I am a software developer with 5 years of experience in developing web applications using Java and JavaScript.

    • 5 years of experience in software development

    • Proficient in Java and JavaScript

    • Developed web applications

    • Strong problem-solving skills

    • Experience with agile development methodologies

  • Answered by AI
  • Q17. Negative and positive things in you
  • Ans. 

    Positive: Strong problem-solving skills, Negative: Can be overly critical of own work

    • Positive: Strong problem-solving skills - I excel at breaking down complex problems and finding efficient solutions

    • Negative: Can be overly critical of own work - I tend to be perfectionistic and struggle with accepting imperfections

  • Answered by AI
  • Q18. Discussion about projects.(Deep discussion)
  • Q19. Tell me a situation in your current company when you had a failure in doing a task and What you learnt from it
  • Ans. 

    I had a failure in implementing a new feature due to a lack of understanding of the requirements.

    • I was assigned to develop a new feature for our software application.

    • I misunderstood the requirements and implemented the feature incorrectly.

    • During the testing phase, it was discovered that the feature was not functioning as expected.

    • I took responsibility for the mistake and immediately communicated it to my team lead.

    • I wo...

  • Answered by AI
  • Q20. Replace every element in array with its closest maximum element in right. As amortized analysis was involved he asked for mathematical proof
  • Ans. 

    Replace every element in array with its closest maximum element in right.

    • Iterate through the array from right to left

    • Keep track of the maximum element seen so far

    • Replace each element with the maximum element seen so far

  • Answered by AI
  • Q21. Asked to design distributed Hashtable . Discussed pros and cons
  • Ans. 

    Designing a distributed Hashtable and discussing its pros and cons.

    • Distributed Hashtable is a data structure that stores key-value pairs across multiple nodes.

    • Pros include scalability, fault tolerance, and load balancing.

    • Cons include increased complexity, potential for data inconsistency, and slower performance due to network communication.

    • Examples of distributed Hashtable implementations include Cassandra, Riak, and D

  • Answered by AI
  • Q22. How will you resolve conflicts with your manager
  • Q23. How will you resolve conflicts with your team mates

Interview Preparation Tips

Round: Technical Interview
Experience: After 2 days HR called me for 3 F2F interviews.

Round: Technical Interview
Experience: Given array of stock prices get the date of selling and buying so that profit is maximum.- Discussed various approaches Brute force ,Using heaps, Divide and conquer and optimal solution.
For each approach I wrote the code on white paper and they told to trace it out with example. I have to write production level code with all corner cases.

Round: Technical Interview
Experience: After one week HR called me that I have one more round with s/w developer manager so I went back to HYD.

Round: Technical Interview
Experience: After that I came back to Pune. I went through a lot of thinking.After two days I got a call from HR that feedback is very positive and all the interviewers want you in their team.  and I got an offer.

General Tips: I got interviewed for Amazon Hyderabad for SDE1 position . It was for e-commerce platform team.I want to share my experience so that it can help others. I have 7 months of experience but the vacancy was for 1+ year exp. Guys all the logistics were arranged by Amazon (Including flight tickets+Hotelstay+cab+lunch and dinner). It was an amazing experience.
Skills: Algorithm, Coding, probability
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

18 Questions

  • Q1. Tell me about yourself?
  • Q2. DBMS project discussion
  • Q3. How to merge k sorted arrays of n length and discussion on its complexity?
  • Q4. A question on how to reach to the end of an array based on the values available in the array. Values determine the steps which can be taken forward. complete code for this?
  • Q5. How to identify that if a tree is a bst or not?
  • Ans. 

    To identify if a tree is a BST, check if the inorder traversal of the tree results in a sorted sequence.

    • Perform an inorder traversal of the tree

    • Check if the resulting sequence is sorted in ascending order

    • If yes, the tree is a BST; otherwise, it is not

  • Answered by AI
  • Q6. Discussion about the java project
  • Q7. Shortest path in maze and then discussion on it. Maze was modified into a n-dimension maze. complete code for 2-d maze
  • Q8. Favourite subject and what are you best at
  • Ans. 

    My favorite subject is computer science and I excel in problem-solving and algorithm design.

    • Computer science is my favorite subject because I enjoy coding and creating software applications.

    • I am best at problem-solving, as I have a strong analytical mindset and can efficiently break down complex issues.

    • I excel in algorithm design, as I have a deep understanding of data structures and can optimize code for efficiency.

  • Answered by AI
  • Q9. What is paging. what is virtual memory and discussion on why do we have virtual memory?
  • Ans. 

    Paging is a memory management technique used by operating systems to manage memory more efficiently. Virtual memory is a technique that allows a computer to use more memory than it physically has available.

    • Paging divides memory into fixed-size blocks called pages.

    • Virtual memory allows programs to use more memory than is physically available by temporarily transferring pages of data from RAM to disk.

    • Virtual memory also ...

  • Answered by AI
  • Q10. Inside a system with 4 gb ram OS only uses around 3.2 gb. Why is rest of the memory lying waste?
  • Ans. 

    The remaining memory is not wasted, but reserved for other system processes and applications.

    • The operating system reserves a portion of the RAM for its own processes and functions.

    • The unused memory can be used for caching data, improving system performance.

    • Applications and processes may not require the full amount of RAM at all times.

    • The unused memory can be allocated to other applications when needed.

    • Virtual memory an...

  • Answered by AI
  • Q11. A LONG discussion on implementing a T-9 dictionary in a mobile
  • Q12. An array is given which may be any of the 4 cases a.) completely increasing b.) completely decreasing c.) decreasing then increasing d.) increasing then decreasing. Find max in the array. o(log n) solutio...
  • Q13. No of combinations of moves for knight in chess board are given return total possible positions
  • Ans. 

    Return the total possible positions for a knight on a chess board given the number of combinations of moves.

    • Calculate all possible positions for a knight on a chess board using its unique L-shaped moves.

    • Consider the boundaries of the chess board while calculating the positions.

    • The total possible positions for a knight on a chess board are 64.

  • Answered by AI
  • Q14. Again, Tell me about urself
  • Q15. Little discussion on intern project and then discussion on java project
  • Q16. Multiple requests for storing multiple files on a server. How to keep them mutually exclusive?
  • Ans. 

    Use file locking mechanism to ensure mutual exclusion.

    • Implement file locking mechanism to prevent simultaneous access to files.

    • Use semaphores or mutexes to ensure only one process can access a file at a time.

    • Implement a queue system to handle multiple requests and process them one by one.

    • Use transactional file systems to ensure atomicity of file operations.

    • Implement a timeout mechanism to prevent deadlocks.

    • Consider imp...

  • Answered by AI
  • Q17. Write COMPLETE code for implementing a hash table?
  • Ans. 

    Implementing a hash table in code

    • Choose a hash function to map keys to indices in the table

    • Create an array to hold the values at each index

    • Handle collisions by using a collision resolution strategy

    • Implement methods for inserting, retrieving, and deleting values

    • Consider load factor and resizing the table if necessary

  • Answered by AI
  • Q18. Given a bst. Replace the value in each node with sum of all the nodes which have values greater than the node itself
  • Ans. 

    The given question asks to replace the value in each node of a binary search tree with the sum of all nodes greater than the current node.

    • Traverse the BST in reverse order (right, root, left)

    • Keep track of the sum of all greater nodes encountered so far

    • Update the value of each node with the sum and update the sum

  • Answered by AI

Interview Preparation Tips

General Tips: That was pretty much the interview rounds. Best of luck.
Skills: Algorithm, data structure
College Name: MNIT Jaipur

Skills evaluated in this interview

Flipkart Interview FAQs

How many rounds are there in Flipkart IT Engineer interview?
Flipkart interview process usually has 2 rounds. The most common rounds in the Flipkart interview process are Resume Shortlist and One-on-one Round.

Tell us how to improve this page.

Flipkart IT Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
PolicyBazaar Interview Questions
3.6
 • 357 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 IT Engineer Salary
based on 15 salaries
₹2.5 L/yr - ₹6 L/yr
29% less than the average IT Engineer Salary in India
View more details

Flipkart IT Engineer Reviews and Ratings

based on 5 reviews

4.9/5

Rating in categories

4.8

Skill development

4.8

Work-life balance

4.8

Salary

4.9

Job security

4.9

Company culture

4.8

Promotions

4.8

Work satisfaction

Explore 5 Reviews and Ratings
Senior Executive
2.7k salaries
unlock blur

₹1.8 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

Executive
1.3k salaries
unlock blur

₹1.2 L/yr - ₹7 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