Flipkart SDE Interview Questions and Answers

Typing amazon.com in the browser's address bar takes you to Amazon's website.

• The browser sends a request to the DNS server to resolve the domain name 'amazon.com' to an IP address.

• The browser establishes a TCP connection with the server at the resolved IP address.

• The browser sends an HTTP request to the server for the homepage of Amazon's website.

• The server responds with the HTML code for the homepage, which the browse

The transaction process involves transferring funds from one account to another. A scheme is designed to ensure secure and accurate transfers.

• Verify the availability of sufficient funds in the sender's account

• Authenticate the sender's identity and authorization for the transaction

• Deduct the transfer amount from the sender's account balance

• Initiate a request to transfer the funds to the recipient's account

• Validate the r...read more

When a server receives an HTTP request, it interacts with the operating system, handles threading, thread pooling, synchronization, and hashing.

• Upon receiving an HTTP request, the server creates a new thread to handle the request.

• The operating system manages the allocation of system resources to the server process.

• Thread pooling is used to efficiently manage and reuse threads for handling multiple requests.

• Synchronizat...read more

ACID properties ensure reliability and consistency in database transactions.

• ACID stands for Atomicity, Consistency, Isolation, and Durability.

• Atomicity ensures that a transaction is treated as a single unit of work, either all or none of its operations are executed.

• Consistency ensures that a transaction brings the database from one valid state to another.

• Isolation ensures that concurrent transactions do not interfere w...read more

To find kth-smallest element in BST, perform inorder traversal and return the kth element.

• Perform inorder traversal of the BST

• Maintain a counter variable to keep track of the number of nodes visited

• When the counter reaches k, return the current node's value

• If k is greater than the number of nodes in the BST, return null or throw an exception

To find the top 10 selling products, sort the products by their sales count in descending order and select the first 10.

• Sort the products by their sales count in descending order

• Select the first 10 products from the sorted list

Design a valet parking lot with ticket assignment and car retrieval using best fit and nearest distance.

• Create a parking lot with designated spots for each size of car

• Assign a ticket to the customer upon entry and record the spot number

• Retrieve the car by searching for the nearest available spot of the appropriate size

• Use best fit algorithm to minimize empty spots

• Implement a system for payment upon exit

Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.

• Use recursion to generate all possible combinations

• Check for validity of each combination using a stack

• Use a set to avoid duplicity

Construct a binary tree from in-order traversal with nodes greater than left and right child.

• The root node will be the maximum value in the in-order traversal

• Recursively construct the left and right subtrees using the left and right portions of the in-order traversal

• Repeat until all nodes are added to the tree

An algorithm to find top 10 trending words inserted by users in sites like Twitter.

• Collect a large dataset of tweets

• Tokenize the tweets into individual words

• Remove stop words and punctuation

• Count the frequency of each word

• Sort the words by frequency in descending order

• Select the top 10 words

Find the first occurrence of 1 in a sorted binary array.

• Use binary search to find the first occurrence of 1.

• If the mid element is 1, check if it's the first occurrence or if the element before it is 0.

• If the mid element is 0, search in the right half of the array.

• If the mid element is 1 and the element before it is also 1, search in the left half of the array.

Remove duplicates from a string in O(n) without using hash

• Use an array of boolean values to keep track of characters already seen

• Iterate through the string and mark characters as seen in the array

• If a character has already been seen, remove it from the string

Find the first occurrence of 1 in a sorted infinite binary tree.

• Use binary search to traverse the tree.

• If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.

• If the current node is 0, move to the right subtree.

• Repeat until the first occurrence of 1 is found or the tree is exhausted.