Mgh Logistics Interview Questions and Answers

FMCG stands for Fast Moving Consumer Goods, which are products that are sold quickly and at a relatively low cost.

• FMCG products are typically non-durable goods that are consumed or used up quickly, such as food, beverages, toiletries, and cleaning products.

• These products are sold in large quantities and at a low profit margin, but generate high sales volume due to their high demand.

• FMCG companies often rely on extensiv...read more

Developing distribution involves identifying target markets, creating a distribution strategy, and building relationships with distributors.

• Conduct market research to identify potential target markets

• Create a distribution strategy that aligns with the company's goals and objectives

• Build relationships with distributors by offering incentives and providing excellent customer service

• Regularly evaluate and adjust the distr...read more

Design a stack that supports getmin in O(1) time and O(1) space complexities.

• Use two stacks, one for storing the actual values and the other for storing the minimum values.

• When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.

• When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.

• To get the minimum val...read more

Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.

• There are three main types of binary tree traversal: inorder, preorder, and postorder.

• Inorder traversal visits the left subtree, then the root, then the right subtree.

• Preorder traversal visits the root, then the left subtree, then the right subtree.

• Postorder traversal visits the left subtree, then the right subt...read more

LRU cache is a data structure that stores the most recently used items and discards the least recently used items.

• LRU stands for Least Recently Used

• It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item

• It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion

• Example: A web browser cache that ...read more