1367. Linked List in Binary Tree
1367. Linked List in Binary Tree
Description
Given a binary tree root and a linked list withheadas the first node.
572. Subtree of Another Tree
985C. Liebig's Barrels
3171. Find Subarray With Bitwise AND Closest to K
3171. Find Subarray With Bitwise AND Closest to K
Description
You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise AND of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] AND nums[l + 1] ... AND nums[r])| is minimum.
3170. Lexicographically Minimum String After Removing Stars
3170. Lexicographically Minimum String After Removing Stars
Description
You are given a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.
3169. Count Days Without Meetings
3169. Count Days Without Meetings
Description
You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive).
3168. Minimum Number of Chairs in a Waiting Room
3168. Minimum Number of Chairs in a Waiting Room
Description
You are given a string s. Simulate events at each second i: