CNoodle

摘要： Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal to bound. An integer is powerful 阅读全文

摘要： Given a string s, determine if it is valid. A string s is valid if, starting with an empty string t = "", you can transform t into s after performing 阅读全文

摘要： There are three stones in different positions on the X-axis. You are given three integers a, b, and c, the positions of the stones. In one move, you p 阅读全文

摘要： Given an integer array nums and two integers firstLen and secondLen, return the maximum sum of elements in two non-overlapping subarrays with lengths 阅读全文

摘要： You have a set which contains all positive integers [1, 2, 3, 4, 5, ...]. Implement the SmallestInfiniteSet class: SmallestInfiniteSet() Initializes t 阅读全文

摘要： You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index 阅读全文

摘要： You are given the root of a binary tree. A ZigZag path for a binary tree is defined as follow: Choose any node in the binary tree and a direction (rig 阅读全文

摘要： You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi to garden yi. I 阅读全文

摘要： You are given a string s, which contains stars *. In one operation, you can: Choose a star in s. Remove the closest non-star character to its left, as 阅读全文

摘要： Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears i 阅读全文

摘要： You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell 阅读全文

摘要： Two strings word1 and word2 are considered almost equivalent if the differences between the frequencies of each letter from 'a' to 'z' between word1 a 阅读全文

摘要： You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] 阅读全文

摘要： Design an algorithm that accepts a stream of characters and checks if a suffix of these characters is a string of a given array of strings words. For 阅读全文

摘要： Given an integer array nums, return the number of subarrays filled with 0. A subarray is a contiguous non-empty sequence of elements within an array. 阅读全文

摘要： Given the root of a binary tree, determine if it is a complete binary tree. In a complete binary tree, every level, except possibly the last, is compl 阅读全文

摘要： Given an array of positive integers nums, remove the smallest subarray (possibly empty) such that the sum of the remaining elements is divisible by p. 阅读全文

摘要： You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the ith block. The characters 'W' 阅读全文

摘要： You are given an array time where time[i] denotes the time taken by the ith bus to complete one trip. Each bus can make multiple trips successively; t 阅读全文

摘要： You are given two strings s1 and s2 of equal length consisting of letters "x" and "y" only. Your task is to make these two strings equal to each other 阅读全文