Given a balanced parentheses string s , return the score of the string. The score of a balanced parentheses string is based on the following rules: () h…

Implement function to check if a key exists in a BST recursively and iteratively. Given a binary search tree, determine whether a target key is present…

Given an array of integers, find the maximum possible product of any three numbers in the array. The key insight is that the maximum product may come ei…

Given a linked list, write a function to return the top N largest elements in the list. Return the result in descending order. This problem asks for the…

Given a list of current directories and a list of selected directories, return the selected directories after summarizing. Example: The entire directori…

Given a sequence S of N digits, find a subsequence of K digits such that the number formed by these K digits, in order, is the largest. The task is to s…

You are creating a website where people can track buses and figure out when to go to the station. The buses move between the stations in one direction….

Question description E-commerce detail page Swipe up and down. For each detail page, generate an AI summary by combining the user profile and product in…

There is a string of length N made only of letters a . Whenever there are two identical adjacent letters (e.g. aa ), they can be transformed into a sing…

You are given a table of people with three columns: Name , Start , and End . Each row represents an interval for a person. Create a second table with co…

Modify an Array Given an array of integers, the cost to change an element is the absolute difference between its initial value and its new value. For ex…

Let’s pretend we’re working on a computer vision project. In this project, librarians sent us videos of their bookshelves. Based on frames from these vi…

Amazon products are stored hierarchically within their respective categories. Products have various metadata, such as current price and whether they are…

Suppose you are given 2 unordered lists of Amazon products with product id, price and a gift coupon worth S amount. Can you write a function to find 1 p…

Like Button States A button can appear in three different states: normal , hovered , and clicked . In the normal state, the button is outlined with a ne…

Given the root of a binary tree, return the most frequent subtree sum.If there is a tie, return all the values with the highest frequency in any order.The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself)….

Design a data structure that simulates an in-memory file system. Implement the FileSystem class: Example:FileSystem fileSystem = new FileSystem();fileSystem.ls(“/”); // return []fileSystem.mkdir(“/a/b/c”);fileSystem.ls(“/”); // return [“a”] This problem tests your ability to design a hierarchical data structure that behaves like a real file system. The core idea is to represent directories using a tree-like structure, where…

Problem: Maximum Product Subarray Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product, and return the product. Example:Input:nums = [2,3,-2,4]Output:6Explanation:The subarray [2,3] has the largest product 6. Constraints:1 <= nums.length <= 2 * 10^4-10 <= nums[i] <= 10The product of any prefix…

TikTok is hosting a livestream event with popular creators. Each creator has submitted their preferred start time and end time for their part in the livestream. Only one creator can livestream at the event at a time. Given an array of available time intervals where intervals[i] = [start(i), end(i)], determine if all creators could attend…

Maximum SubarrayGiven an integer array nums[], find the subarray with the largest sum, and return its sum. Input:nums = [-2,1,-3,4,-1,2,1,-5,4]Output:6Explanation:The subarray [4,-1,2,1] has the largest sum 6. This problem is about finding the maximum possible sum among all non-empty contiguous subarrays. The key idea is to scan from left to right and decide at each…