FoodPanda Senior Engineer- Maintenance Interview Questions and Answers

Logic reasoning aptitude quant os dbms cn

Arrays, strings, linked list

Q1. Explain ur projects and internships
Add your answer
Q2. Technical questions related to domain
Add your answer

Q1. Tell me something about yourself
Add your answer
Q2. How well are you able to handle data
Ans. 
I am highly skilled in handling data and have extensive experience in data analysis and management.
• Proficient in data collection, cleaning, and organization

• Strong analytical skills to interpret and draw insights from data

• Experience with various data analysis tools and software

• Ability to create data visualizations and reports

• Knowledge of data privacy and security measures

• Experience in handling large datasets and perform...read more
Answered by AI
Add your answer
Q3. Are you comfortable travelling and meeting clients
Add your answer

Time management and assigning yourself tasks with utmost priority

Q1. Sql only questions like joins and window functions
Add your answer
Q2. Asked about joins and python knowledge
Add your answer
Q3. Calculate rolling average for order amount for merchants
Ans. 
Calculate rolling average for order amount for merchants
• Calculate the average order amount for each merchant over a specific time period

• Update the average as new orders come in, dropping the oldest order amount from the calculation

• Example: Merchant A had orders of $100, $150, $200 in the last 3 days. Rolling average would be ($100 + $150 + $200) / 3 = $150
Answered by AI
Add your answer

SQL, Python, Case Studies, Window Functions

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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer

My work experience and my knowledge