set | brain

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 898: Bitwise ORs of Subarrays

Problem Restatement We are given an integer array arr . For every non-empty contiguous subarray, compute the bitwise OR of all elements in that subarray. Return the number of distinct OR results. A subarray must be contiguous. The official constraints allow arr.length <= 5 * 10^4 and arr[i] <= 10^9 . ( leetcode.com ) Input and Output Item Meaning Input arr , an integer array Output Number of distinct bitwise...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 771: Jewels and Stones

Problem Restatement We are given two strings: jewels stones Each character in jewels represents a type of stone that is a jewel. Each character in stones represents one stone we have. We need to count how many stones are also jewels. Letters are case-sensitive, so "a" and "A" are different stone types. The official statement also says all characters in jewels are unique. Input and Output Item Meaning Input jewels...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 500: Keyboard Row

Problem Restatement We are given an array of strings words . Return the words that can be typed using letters from only one row of an American keyboard. The keyboard rows are: Row Letters First row qwertyuiop Second row asdfghjkl Third row zxcvbnm Letter case does not matter. For example, A and a belong to the same row. The word must use letters from only one row. The original word...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 414: Third Maximum Number

Problem Restatement We are given an integer array nums . Return the third distinct maximum number in the array. If the array does not contain three distinct numbers, return the maximum number. Duplicates do not count as separate maximums. The problem statement says to return the third distinct maximum number, or the maximum number if the third maximum does not exist. The constraints include 1 <= nums.length <= 10^4 and...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 356: Line Reflection

Problem Restatement We are given a list of points on a 2D plane. Each point is represented as: [x, y] We need to decide whether there exists a vertical line such that reflecting every point across that line gives the same set of points. A vertical line has this form: x = c The line is parallel to the y-axis. When a point (x, y) is reflected across x =...

#set

LeetCode 898: Bitwise ORs of Subarrays

LeetCode 771: Jewels and Stones

LeetCode 500: Keyboard Row

LeetCode 414: Third Maximum Number

LeetCode 356: Line Reflection