Star Bazaar Assistant Manager Supply Chain Interview Questions and Answers

Q1. Tell me smthng about yourself
Add your answer
Q2. Why did u left your last job
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based) 
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.

Q1. 
Nth Fibonacci Number Problem Statement
Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.
N...read more
Ans. 
Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.
• Implement matrix exponentiation to calculate Fibonacci numbers efficiently.

• Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

• Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.

• Optimize the solution to achieve better than O(N) time complexity.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
 

Q1. 
Similar Strings Problem Statement
Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.
Explanation:
String A is similar to stri...read more
Ans. 
Determine if two strings are similar based on given conditions.
• Check if the strings are equal first.

• Then check if the strings can be divided into two halves with similar patterns.

• Return 1 if the strings are similar, 0 otherwise.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.

 

Round duration - 30 minutes
Round difficulty - Medium

This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.


 

Round duration - 20 minutes
Round difficulty - Easy

The platform was Zoom time duration was 20 mins. Asked me to give my introduction.

 

Round duration - 60 Minutes
Round difficulty - Medium

There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.

Q1. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
• Use dynamic programming to keep track of maximum stolen money at each house.

• Consider two cases: either rob the current house and skip the next, or skip the current house.

• Handle circular arrangement by considering the first and last houses separately.

• Example: For arr[] = {2, 3, 2}, the output is 3. Rob...read more
Answered by AI
Add your answer
Q2. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

• Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

• Optimize the solution to avoid redundant calculations by storing intermediate results.

• Time complexity can be reduced to O(N) using dynamic programming.

• Example: For N = 5, the 5th F
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .

Q1. 
Intersection of Linked Lists Problem Statement
You are provided with two linked lists, L1 and L2, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l...read more
Ans. 
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
• Traverse both linked lists simultaneously to find common elements

• Create a new linked list to store the intersecting elements

• Ensure the final linked list is sorted in ascending order

• Handle cases where there are no common elements between the lists
Answered by AI
Add your answer
Q2. 
Kth Largest Element Problem Statement
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
Input:
The first line contains an integer 'T...read more
Ans. 
Find the Kth largest element in a given list of numbers.
• Sort the array in descending order.

• Return the Kth element from the sorted array.

• Handle multiple test cases efficiently.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .

Q1. 
Data Structure with Insert, Delete, and GetRandom Operations
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...read more
Ans. 
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
• Use a combination of HashMap and ArrayList to achieve constant time operations.

• For insert operation, add the element to the ArrayList and store its index in the HashMap.

• For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...read more
Answered by AI
Add your answer
Q2. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Implement a doubly linked list to maintain the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access.

• When capacity is reached, evict the least recently used item before inserting a new item.

• Update the position of a key in the linked list whenever it is accesse
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round was inclined towards some Low Level Design Principles and some concepts from Java .

Q1. Design a Railway Reservation System.
Ans. 
Design a Railway Reservation System
• Create a database to store train schedules, seat availability, and passenger information

• Implement a user interface for users to search for trains, book tickets, and view their reservations

• Include features like seat selection, payment processing, and ticket confirmation

• Handle scenarios like waitlisting, cancellations, and refunds

• Ensure data security and privacy of passenger information
Answered by AI
Add your answer
Q2. Why is Java considered platform-independent while the Java Virtual Machine (JVM) is platform-dependent?
Ans. 
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
• Java code is compiled into bytecode, which can run on any platform with a JVM.

• JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.

• The JVM ...read more
Answered by AI
Add your answer