10+ Mishan Design Point Interview Questions and Answers

The task is to find the intersection of two integer arrays/lists.

• Read the number of test cases

• For each test case, read the size and elements of the first array/list

• Read the size and elements of the second array/list

• Find the intersection of the two arrays/lists

• Print the intersection elements in the order they appear in the first array/list

The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

• Iterate through the array and calculate the sum of each subarray of length K

• Store the maximum sum obtained from the first subarray

• Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

• Store the maximum sum obtained from the second subarray

• Return the sum of the two maximum sums

The task is to find the count of distinct subsequences in a given string.

• Use dynamic programming to solve the problem.

• Create a 2D array to store the count of distinct subsequences for each prefix of the string.

• Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

• For each character in the string, calculate the count of distinct subsequences by considering two cases: including the current character and excluding the current character...read more

The task is to find the number of islands in a grid consisting of 0s and 1s.

• An island is a group of 1s connected horizontally, vertically, or diagonally

• The grid is surrounded by 0s on all four edges

• Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

• Initialize a visited array to keep track of visited cells

• For each unvisited cell with a value of 1, perform a DFS or BFS to explore the connected land cells an...read more

The goal is to find the number of permutations of a list satisfying certain conditions.

• Iterate through all permutations of the list

• Check if each permutation satisfies the given conditions

• Count the number of permutations that satisfy the conditions

• Return the count for each test case

An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

• Check if the given matrix satisfies the property M*M = M

• Iterate through each element of the matrix and perform the matrix multiplication

• Compare the result with the original matrix

• If they are equal, return true; otherwise, return false

Design attendance management system

• Create a database to store employee information

• Implement a user interface for employees to mark their attendance

• Develop a system to track and record attendance data

• Generate reports and analytics based on attendance data

Designing a social media platform like Facebook with key functionalities.

• Implement user authentication and authorization for secure access.

• Create a database schema for users, posts, and relationships.

• Develop features for adding, deleting, and retrieving posts.

• Implement follow/unfollow functionality for users.

• Design a news feed algorithm to display posts from followed users.

• Include features for liking, commenting, and sharing posts.

Concurrency in software development allows multiple tasks to run simultaneously, improving performance and responsiveness.

• Use multithreading to execute multiple tasks concurrently

• Implement asynchronous programming to handle tasks that may take longer to complete

• Use synchronization techniques like locks and semaphores to manage access to shared resources

• Consider using thread pools to manage and reuse threads efficiently

The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.

• Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.

• Define the interactions between these components and how data flows between them.

• Specify the data structures and algorithms used for efficient booking and tracking of cabs.

• Consider scalability, fault toleran...read more