10+ Awesome Screens Interview Questions and Answers

Test cases for testing history in YouTube-like channel

• Verify that the history page displays the correct list of videos watched by the user

• Test if the history can be cleared successfully

• Check if the history is updated in real-time as the user watches videos

• Ensure that the history is accessible only to the logged-in user

• Verify that the history page loads quickly and efficiently

Return odd and even numbers from two stacks, one full and one empty, without using any other memory.

• Pop elements from full stack and check if it's odd or even

• Push odd elements to one stack and even elements to another

• Push elements back to full stack in alternating order

• Time complexity: O(n), Space complexity: O(1)

Use SQL query with GROUP BY and HAVING clause to find and remove duplicates in a table.

• Use SELECT statement with COUNT() function to identify duplicates

• Use GROUP BY clause to group duplicate records

• Use HAVING clause to filter out groups with count greater than 1

• Use DELETE statement to remove duplicates based on identified criteria

Separate 0's and 1's from string and reverse the string word-wise.

• Iterate through the string and separate 0's and 1's into separate arrays

• Join the arrays back into a single string with 0's first and 1's second

• Split the string into an array of words and reverse the order of the array

• Join the array back into a single string with words in reverse order

Print the left view of a binary tree

• Traverse the tree in a level order traversal

• Print the first node at each level encountered

• Use a queue to keep track of nodes at each level

LRU cache implementation using doubly linked list and hash map.

• Use a doubly linked list to keep track of the order of elements in the cache.

• Use a hash map to store the key-value pairs for fast access.

• When a new element is added, check if the cache is full and remove the least recently used element.

• When an element is accessed, move it to the front of the linked list.

Program to find the Next Smaller Element

• Create an empty stack

• Traverse the array from right to left

• Pop elements from stack until a smaller element is found

• If no smaller element is found, output -1

• Push the current element onto the stack

Automation Framework is a set of guidelines and standards for creating and maintaining automated tests.

• Automation Framework provides a structure for organizing test code and data

• It helps in reducing maintenance efforts and increasing test coverage

• Examples of Automation Frameworks are Selenium, Appium, and TestNG

• HTTP codes are status codes returned by a server in response to a client's request

• Some common HTTP codes are 200 (OK), 404 (Not Found), and 500 (Internal Server Error)

Random Forest is an ensemble learning algorithm that builds multiple decision trees and combines their outputs.

• Random Forest is a supervised learning algorithm.

• It can be used for both classification and regression tasks.

• It creates multiple decision trees and combines their outputs to make a final prediction.

• Each tree is built on a random subset of the training data and a random subset of the features.

• Random Forest reduces overfitting and improves accuracy compared to a single...read more

Design a URL shortener

• Generate a unique short code for each URL

• Store the mapping of short code to original URL in a database

• Redirect users to the original URL when they access the short code

Merge two sorted arrays into a single sorted array

• Create a new array to store the merged result

• Compare elements from both arrays and add the smaller one to the result array

• Continue this process until all elements from both arrays are merged

Merge overlapping intervals in an array of integers

• Sort the intervals based on the start value

• Iterate through the intervals and merge overlapping ones

• Return the merged intervals

Sort an array of strings containing only 0s, 1s, and 2s.

• Use counting sort algorithm to sort the array in linear time complexity.

• Count the occurrences of 0s, 1s, and 2s in the array.

• Reconstruct the array with the sorted counts.

CAP theorem states that a distributed system cannot guarantee consistency, availability, and partition tolerance at the same time.

• Consistency: all nodes see the same data at the same time

• Availability: every request receives a response, without guarantee that it contains the most recent version of the information

• Partition tolerance: the system continues to function even when network partitions occur

• Examples: Cassandra prioritizes availability and partition tolerance over consi...read more