10+ Adani Group Interview Questions and Answers

The task is to identify all distinct triplets within an array that sum up to a specified number.

• Iterate through the array and use nested loops to find all possible triplets.

• Keep track of the sum of each triplet and compare it with the target sum.

• Print the triplet if the sum matches the target sum, else print -1.

Find the K-th largest element in a BST.

• Perform reverse in-order traversal of the BST to find the K-th largest element.

• Keep track of the count of visited nodes to determine the K-th largest element.

• Return -1 if there is no K-th largest element in the BST.

The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.

• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.

• Handle modulo 10^9+7 to avoid overflow issues.

• Consider base cases for 0th and 1st stair.

• Optimize the solution by using constant space instead of an array.

Designing the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow.

• For HLD, identify main components like user interface, booking system, payment gateway, and database.

• For LLD, break down each component into detailed modules and their interactions.

• Consider scalability, security, and performance in both designs.

• Example: HLD - User selects movie -> Booking system checks availability -> Payment gateway processes transaction.

• Example: LLD - Booking syste...read more

Designing a database schema for a support ticketing system like Freshdesk.

• Create a 'Tickets' table with fields like ticket ID, subject, description, status, priority, etc.

• Include a 'Users' table for customer and agent information.

• Establish a 'Categories' table for ticket categorization.

• Implement a 'Comments' table to track communication history.

• Utilize foreign keys to establish relationships between tables.

A tiny URL application is built by generating short aliases for long URLs, storing them in a database, and redirecting users to the original URL when the alias is accessed.

• Generate a unique short alias for each long URL

• Store the alias and corresponding long URL in a database

• Implement a redirect mechanism to redirect users from the alias to the original URL

• Handle edge cases like duplicate URLs, expired aliases, and invalid URLs

Count pairs in an array whose sum is a perfect square.

• Iterate through the array and calculate the sum of each pair.

• Check if the sum is a perfect square using a function.

• Increment a counter if the sum is a perfect square.

• Return the final count of pairs.

The immediate higher number to the right of each element in an array

• Iterate through the array from right to left

• For each element, compare it with the elements to its right to find the immediate higher number

• Store the immediate higher number in a new array

To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.

• Perform an in-order traversal of the BST to get the elements in non-decreasing order.

• Keep track of the Kth largest element while traversing the BST.

• Return the Kth largest element once found.