Flipkart Software Development Engineer Interview Questions, Process, and Tips

Find the nearest K integers in a Binary Search Tree

• Perform an in-order traversal of the BST to get a sorted list of integers

• Use a priority queue to keep track of the K nearest integers

• Compare the absolute difference between the target integer and each node value to determine the nearest integers

I have experience working on a project to develop a mobile application for tracking fitness goals.

• Developed user interface for inputting and tracking fitness data

• Integrated with wearable devices to automatically sync data

• Implemented gamification features to motivate users to achieve their goals

Splitwise is a platform for managing shared expenses among friends or groups.

• Allow users to create groups and add expenses

• Track who owes money to whom

• Send reminders for pending payments

• Support multiple currencies for international groups

Count the number of triplets in an array whose sum is divisible by 3.

• Iterate through all possible triplets in the array.

• Check if the sum of the triplet is divisible by 3.

• Increment a counter for each valid triplet.