난이도: MediumProblem DescriptionYou are given an array nums consisting of positive integers. We call a subarray of nums nice if the bitwise AND of every pair of elements that are in different positions in the subarray is equal to 0. Return the length of the longest nice subarray. A subarray is a contiguous part of an array. Note that subarrays of length 1 are always considered nice.  Problem Examp..

난이도: EasyProblem DescriptionYou are given an integer array nums consisting of 2 * n integers.You need to divide nums into n pairs such that:Each element belongs to exactly one pair.The elements present in a pair are equal.Return true if nums can be divided into n pairs, otherwise return false. Problem ExampleExample 1:Input: nums = [3,2,3,2,2,2]Output: trueExplanation: There are 6 elements in nu..

난이도: MediumProblem Description You are given an integer array ranks representing the ranks of some mechanics.ranksi is the rank of the ith mechanic.  A mechanic with a rank r can repair n cars in r * n2 minutes. You are also given an integer cars representing the total number of cars waiting in the garage to be repaired. Return the minimum time taken to repair all the cars. Note: All the mechani..

난이도: MediumProblem Description You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into any number of sub piles, but you cannot merge two piles together. You are also given an integer k. You should allocate piles of candies to k children such that each child gets the same number of candies. Each child c..

난이도: EasyProblem Description Given an array nums sorted in non-decreasing order, return the maximum between the number of positive integers and the number of negative integers.In other words, if the number of positive integers in nums is pos and the number of negative integers is neg, then return the maximum of pos and neg.Note that 0 is neither positive nor negative. Problem ExampleExample 1:In..

난이도: MediumProblem Description Given a string s consisting only of characters a, b and c. Return the number of substrings containing at least one occurrence of all these characters a, b and c.  Problem ExampleExample 1:Input: s = "abcabc"Output: 10Explanation: The substrings containing at least one occurrence of the characters a, b and c are "abc", "abca", "abcab", "abcabc", "bca", "bcab", "bcab..