BigBasket Interview Questions and Answers

The program reads a file and selects the first 3 lines. It then identifies the longest line and counts the number of words in that line.

• Read the file using appropriate file handling methods

• Store the first 3 lines in an array of strings

• Iterate through the array to find the longest line

• Count the number of words in the longest line using string manipulation methods

O(nk) is better than O(n) for large data and hash tables.

• O(nk) is better because it takes into account the size of the data and the number of keys.

• For large data and hash tables, the size of n will be large, making O(nk) more efficient.

• O(n) assumes a constant number of keys, which may not be the case in practice.

• Amazon may have chosen O(nk) for better scalability and performance.

Amazon displays only a subset of search results based on various factors like relevance, popularity, and user preferences.

• Amazon uses algorithms to determine which products to display in search results.

• Factors considered include product relevance, customer reviews, sales rank, and availability.

• Machine learning techniques may be used to personalize search results based on user behavior and preferences.

• Amazon also considers factors like seller reputation and fulfillment options...read more

The question is about finding the shortest path in a 3x3 matrix with weighted edges.

• This is a graph traversal problem.

• Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest path.

• Assign weights to the edges and calculate the sum of weights for each possible path.

• Choose the path with the smallest sum of weights as the shortest path.

The product will be the key and the brands will be the values.

• The key in this case refers to the unique identifier for each product.

• The values are the different brands associated with each product.

• For example, if the product is a smartphone, the key could be the model number and the values could be the different brands that manufacture that model.

Radix sort is a sorting algorithm that sorts integers by processing individual digits from least significant to most significant.

• Radix sort is a non-comparative sorting algorithm.

• It sorts numbers by grouping them based on each digit's value.

• It is commonly used for sorting strings in lexicographic order.

• Radix sort has linear time complexity, making it efficient for large datasets.

Hash tables are a data structure that uses a hash function to map keys to values, providing efficient lookup, insertion, and deletion.

• Hash tables use a hash function to convert keys into array indices.

• They provide constant-time average case complexity for search, insert, and delete operations.

• Collisions can occur when different keys map to the same index, which can be resolved using techniques like chaining or open addressing.

• Examples of hash table implementations include Pyt...read more

The Fibonacci series can be applied in day-to-day life for various purposes.

• Financial planning: Fibonacci numbers can be used to calculate investment growth and determine optimal investment strategies.

• Architecture and design: Fibonacci ratios can be used to create aesthetically pleasing designs and layouts.

• Nature and biology: Fibonacci patterns can be observed in the growth of plants, arrangement of leaves, and formation of shells.

• Music and art: Fibonacci sequences can be use...read more