diff --git a/.flake8 b/.flake8 new file mode 100644 index 00000000..dda5ecfd --- /dev/null +++ b/.flake8 @@ -0,0 +1,2 @@ +[flake8] +ignore = E501, W503, E203, F541, W293, W291 diff --git a/.gitattributes b/.gitattributes new file mode 100644 index 00000000..dab4d260 --- /dev/null +++ b/.gitattributes @@ -0,0 +1,4 @@ +*.csv linguist-generated=true +*.json linguist-generated=true +*.jsonl linguist-generated=true +*.ipynb linguist-generated=true diff --git a/.gitignore b/.gitignore index 1378e49e..3e5489cc 100644 --- a/.gitignore +++ b/.gitignore @@ -1,2 +1,7 @@ -**/__pycache__/** +# Local cruft and other .env +*.bak +**/__pycache__/** + +# Local sandbox environments +playground/ diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml new file mode 100644 index 00000000..20096412 --- /dev/null +++ b/.pre-commit-config.yaml @@ -0,0 +1,26 @@ +repos: + - repo: https://github.com/pre-commit/mirrors-mypy + rev: v1.1.1 + hooks: + - id: mypy + additional_dependencies: [types-requests, types-attrs] + - repo: https://github.com/google/yapf + rev: v0.31.0 + hooks: + - id: yapf + args: [--style, google] + - repo: https://github.com/psf/black + rev: 23.1.0 + hooks: + - id: black + language_version: python3.10 # Replace with your Python version + - repo: https://github.com/pycqa/flake8 + rev: 6.0.0 + hooks: + - id: flake8 + - repo: https://github.com/pycqa/isort + rev: 5.12.0 + hooks: + - id: isort + language_version: python3.10 + diff --git a/README.md b/README.md index e7679c40..a4ff18c1 100644 --- a/README.md +++ b/README.md @@ -56,6 +56,7 @@ poetry run python runner.py --provider openai --dataset human-eval --model gpt-4 |----------------------------------|----------------------|----------------------|------------------|------------------------------------------------------------------------| | HumanEval | 87.2 | 84.1 | 67 | [1] | | EvalPlus | 79.2 | 74.4 | N/A | | +| GSM8K | X | X | 87.1 | | | Leetcode Easy | X | X | 72.2-75.6 | [1,2] | | Leetcode Medium | X | X | 26.2-38.7 | [1,2] | | Leetcode Hard | X | X | 6.7-7 | [1,2] | diff --git a/datasets/inputs/leetcode/randomly_sampled_problems.csv b/datasets/inputs/leetcode/randomly_sampled_problems.csv new file mode 100644 index 00000000..e6c6476e --- /dev/null +++ b/datasets/inputs/leetcode/randomly_sampled_problems.csv @@ -0,0 +1,178014 @@ +,question_slug,question_title,frontend_question_id,question_id,raw_content,difficulty,paid_only,cpp_snippet,java_snippet,python_snippet,python3_snippet,c_snippet,csharp_snippet,javascript_snippet,ruby_snippet,swift_snippet,golang_snippet,scala_snippet,kotlin_snippet,rust_snippet,php_snippet,typescript_snippet,racket_snippet,erlang_snippet,elixir_snippet,dart_snippet,react_snippet +0,apply-operations-to-maximize-score,Apply Operations to Maximize Score,2818.0,3001.0,"

You are given an array nums of n positive integers and an integer k.

+ +

Initially, you start with a score of 1. You have to maximize your score by applying the following operation at most k times:

+ + + +

Here, nums[l, ..., r] denotes the subarray of nums starting at index l and ending at the index r, both ends being inclusive.

+ +

The prime score of an integer x is equal to the number of distinct prime factors of x. For example, the prime score of 300 is 3 since 300 = 2 * 2 * 3 * 5 * 5.

+ +

Return the maximum possible score after applying at most k operations.

+ +

Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [8,3,9,3,8], k = 2
+Output: 81
+Explanation: To get a score of 81, we can apply the following operations:
+- Choose subarray nums[2, ..., 2]. nums[2] is the only element in this subarray. Hence, we multiply the score by nums[2]. The score becomes 1 * 9 = 9.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 1, but nums[2] has the smaller index. Hence, we multiply the score by nums[2]. The score becomes 9 * 9 = 81.
+It can be proven that 81 is the highest score one can obtain.
+ +

Example 2:

+ +
+Input: nums = [19,12,14,6,10,18], k = 3
+Output: 4788
+Explanation: To get a score of 4788, we can apply the following operations: 
+- Choose subarray nums[0, ..., 0]. nums[0] is the only element in this subarray. Hence, we multiply the score by nums[0]. The score becomes 1 * 19 = 19.
+- Choose subarray nums[5, ..., 5]. nums[5] is the only element in this subarray. Hence, we multiply the score by nums[5]. The score becomes 19 * 18 = 342.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 2, but nums[2] has the smaller index. Hence, we multipy the score by nums[2]. The score becomes 342 * 14 = 4788.
+It can be proven that 4788 is the highest score one can obtain.
+
+ +

 

+

Constraints:

+ + +",3.0,False,"class Solution { +public: + int maximumScore(vector& nums, int k) { + + } +};","class Solution { + public int maximumScore(List nums, int k) { + + } +}","class Solution(object): + def maximumScore(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumScore(self, nums: List[int], k: int) -> int: + ","int maximumScore(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MaximumScore(IList nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumScore = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def maximum_score(nums, k) + +end","class Solution { + func maximumScore(_ nums: [Int], _ k: Int) -> Int { + + } +}","func maximumScore(nums []int, k int) int { + +}","object Solution { + def maximumScore(nums: List[Int], k: Int): Int = { + + } +}","class Solution { + fun maximumScore(nums: List, k: Int): Int { + + } +}","impl Solution { + pub fn maximum_score(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function maximumScore($nums, $k) { + + } +}","function maximumScore(nums: number[], k: number): number { + +};","(define/contract (maximum-score nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_score(Nums :: [integer()], K :: integer()) -> integer(). +maximum_score(Nums, K) -> + .","defmodule Solution do + @spec maximum_score(nums :: [integer], k :: integer) :: integer + def maximum_score(nums, k) do + + end +end","class Solution { + int maximumScore(List nums, int k) { + + } +}", +2,account-balance-after-rounded-purchase,Account Balance After Rounded Purchase,2806.0,2955.0,"

Initially, you have a bank account balance of 100 dollars.

+ +

You are given an integer purchaseAmount representing the amount you will spend on a purchase in dollars.

+ +

At the store where you will make the purchase, the purchase amount is rounded to the nearest multiple of 10. In other words, you pay a non-negative amount, roundedAmount, such that roundedAmount is a multiple of 10 and abs(roundedAmount - purchaseAmount) is minimized.

+ +

If there is more than one nearest multiple of 10, the largest multiple is chosen.

+ +

Return an integer denoting your account balance after making a purchase worth purchaseAmount dollars from the store.

+ +

Note: 0 is considered to be a multiple of 10 in this problem.

+ +

 

+

Example 1:

+ +
+Input: purchaseAmount = 9
+Output: 90
+Explanation: In this example, the nearest multiple of 10 to 9 is 10. Hence, your account balance becomes 100 - 10 = 90.
+
+ +

Example 2:

+ +
+Input: purchaseAmount = 15
+Output: 80
+Explanation: In this example, there are two nearest multiples of 10 to 15: 10 and 20. So, the larger multiple, 20, is chosen.
+Hence, your account balance becomes 100 - 20 = 80.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= purchaseAmount <= 100
    • +
+",1.0,False,"class Solution { +public: + int accountBalanceAfterPurchase(int purchaseAmount) { + + } +};","class Solution { + public int accountBalanceAfterPurchase(int purchaseAmount) { + + } +}","class Solution(object): + def accountBalanceAfterPurchase(self, purchaseAmount): + """""" + :type purchaseAmount: int + :rtype: int + """""" + ","class Solution: + def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int: + ","int accountBalanceAfterPurchase(int purchaseAmount){ + +}","public class Solution { + public int AccountBalanceAfterPurchase(int purchaseAmount) { + + } +}","/** + * @param {number} purchaseAmount + * @return {number} + */ +var accountBalanceAfterPurchase = function(purchaseAmount) { + +};","# @param {Integer} purchase_amount +# @return {Integer} +def account_balance_after_purchase(purchase_amount) + +end","class Solution { + func accountBalanceAfterPurchase(_ purchaseAmount: Int) -> Int { + + } +}","func accountBalanceAfterPurchase(purchaseAmount int) int { + +}","object Solution { + def accountBalanceAfterPurchase(purchaseAmount: Int): Int = { + + } +}","class Solution { + fun accountBalanceAfterPurchase(purchaseAmount: Int): Int { + + } +}","impl Solution { + pub fn account_balance_after_purchase(purchase_amount: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $purchaseAmount + * @return Integer + */ + function accountBalanceAfterPurchase($purchaseAmount) { + + } +}","function accountBalanceAfterPurchase(purchaseAmount: number): number { + +};","(define/contract (account-balance-after-purchase purchaseAmount) + (-> exact-integer? exact-integer?) + + )","-spec account_balance_after_purchase(PurchaseAmount :: integer()) -> integer(). +account_balance_after_purchase(PurchaseAmount) -> + .","defmodule Solution do + @spec account_balance_after_purchase(purchase_amount :: integer) :: integer + def account_balance_after_purchase(purchase_amount) do + + end +end","class Solution { + int accountBalanceAfterPurchase(int purchaseAmount) { + + } +}", +3,minimum-time-to-make-array-sum-at-most-x,Minimum Time to Make Array Sum At Most x,2809.0,2952.0,"

You are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every second, for all indices 0 <= i < nums1.length, value of nums1[i] is incremented by nums2[i]. After this is done, you can do the following operation:

+ +
    +
  • Choose an index 0 <= i < nums1.length and make nums1[i] = 0.
    • +
+ +

You are also given an integer x.

+ +

Return the minimum time in which you can make the sum of all elements of nums1 to be less than or equal to x, or -1 if this is not possible.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3], nums2 = [1,2,3], x = 4
+Output: 3
+Explanation: 
+For the 1st second, we apply the operation on i = 0. Therefore nums1 = [0,2+2,3+3] = [0,4,6]. 
+For the 2nd second, we apply the operation on i = 1. Therefore nums1 = [0+1,0,6+3] = [1,0,9]. 
+For the 3rd second, we apply the operation on i = 2. Therefore nums1 = [1+1,0+2,0] = [2,2,0]. 
+Now sum of nums1 = 4. It can be shown that these operations are optimal, so we return 3.
+
+
+ +

Example 2:

+ +
+Input: nums1 = [1,2,3], nums2 = [3,3,3], x = 4
+Output: -1
+Explanation: It can be shown that the sum of nums1 will always be greater than x, no matter which operations are performed.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length <= 103
    • +
  • 1 <= nums1[i] <= 103
    • +
  • 0 <= nums2[i] <= 103
    • +
  • nums1.length == nums2.length
    • +
  • 0 <= x <= 106
    • +
+",3.0,False,"class Solution { +public: + int minimumTime(vector& nums1, vector& nums2, int x) { + + } +};","class Solution { + public int minimumTime(List nums1, List nums2, int x) { + + } +}","class Solution(object): + def minimumTime(self, nums1, nums2, x): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type x: int + :rtype: int + """""" + ","class Solution: + def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int: + ","int minimumTime(int* nums1, int nums1Size, int* nums2, int nums2Size, int x){ + +}","public class Solution { + public int MinimumTime(IList nums1, IList nums2, int x) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} x + * @return {number} + */ +var minimumTime = function(nums1, nums2, x) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} x +# @return {Integer} +def minimum_time(nums1, nums2, x) + +end","class Solution { + func minimumTime(_ nums1: [Int], _ nums2: [Int], _ x: Int) -> Int { + + } +}","func minimumTime(nums1 []int, nums2 []int, x int) int { + +}","object Solution { + def minimumTime(nums1: List[Int], nums2: List[Int], x: Int): Int = { + + } +}","class Solution { + fun minimumTime(nums1: List, nums2: List, x: Int): Int { + + } +}","impl Solution { + pub fn minimum_time(nums1: Vec, nums2: Vec, x: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $x + * @return Integer + */ + function minimumTime($nums1, $nums2, $x) { + + } +}","function minimumTime(nums1: number[], nums2: number[], x: number): number { + +};","(define/contract (minimum-time nums1 nums2 x) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec minimum_time(Nums1 :: [integer()], Nums2 :: [integer()], X :: integer()) -> integer(). +minimum_time(Nums1, Nums2, X) -> + .","defmodule Solution do + @spec minimum_time(nums1 :: [integer], nums2 :: [integer], x :: integer) :: integer + def minimum_time(nums1, nums2, x) do + + end +end","class Solution { + int minimumTime(List nums1, List nums2, int x) { + + } +}", +4,count-stepping-numbers-in-range,Count Stepping Numbers in Range,2801.0,2921.0,"

Given two positive integers low and high represented as strings, find the count of stepping numbers in the inclusive range [low, high].

+ +

A stepping number is an integer such that all of its adjacent digits have an absolute difference of exactly 1.

+ +

Return an integer denoting the count of stepping numbers in the inclusive range [low, high].

+ +

Since the answer may be very large, return it modulo 109 + 7.

+ +

Note: A stepping number should not have a leading zero.

+ +

 

+

Example 1:

+ +
+Input: low = "1", high = "11"
+Output: 10
+Explanation: The stepping numbers in the range [1,11] are 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10. There are a total of 10 stepping numbers in the range. Hence, the output is 10.
+ +

Example 2:

+ +
+Input: low = "90", high = "101"
+Output: 2
+Explanation: The stepping numbers in the range [90,101] are 98 and 101. There are a total of 2 stepping numbers in the range. Hence, the output is 2.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= int(low) <= int(high) < 10100
    • +
  • 1 <= low.length, high.length <= 100
    • +
  • low and high consist of only digits.
    • +
  • low and high don't have any leading zeros.
    • +
+",3.0,False,"class Solution { +public: + int countSteppingNumbers(string low, string high) { + + } +};","class Solution { + public int countSteppingNumbers(String low, String high) { + + } +}","class Solution(object): + def countSteppingNumbers(self, low, high): + """""" + :type low: str + :type high: str + :rtype: int + """""" + ","class Solution: + def countSteppingNumbers(self, low: str, high: str) -> int: + ","int countSteppingNumbers(char * low, char * high){ + +}","public class Solution { + public int CountSteppingNumbers(string low, string high) { + + } +}","/** + * @param {string} low + * @param {string} high + * @return {number} + */ +var countSteppingNumbers = function(low, high) { + +};","# @param {String} low +# @param {String} high +# @return {Integer} +def count_stepping_numbers(low, high) + +end","class Solution { + func countSteppingNumbers(_ low: String, _ high: String) -> Int { + + } +}","func countSteppingNumbers(low string, high string) int { + +}","object Solution { + def countSteppingNumbers(low: String, high: String): Int = { + + } +}","class Solution { + fun countSteppingNumbers(low: String, high: String): Int { + + } +}","impl Solution { + pub fn count_stepping_numbers(low: String, high: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $low + * @param String $high + * @return Integer + */ + function countSteppingNumbers($low, $high) { + + } +}","function countSteppingNumbers(low: string, high: string): number { + +};","(define/contract (count-stepping-numbers low high) + (-> string? string? exact-integer?) + + )","-spec count_stepping_numbers(Low :: unicode:unicode_binary(), High :: unicode:unicode_binary()) -> integer(). +count_stepping_numbers(Low, High) -> + .","defmodule Solution do + @spec count_stepping_numbers(low :: String.t, high :: String.t) :: integer + def count_stepping_numbers(low, high) do + + end +end","class Solution { + int countSteppingNumbers(String low, String high) { + + } +}", +5,minimum-seconds-to-equalize-a-circular-array,Minimum Seconds to Equalize a Circular Array,2808.0,2920.0,"

You are given a 0-indexed array nums containing n integers.

+ +

At each second, you perform the following operation on the array:

+ +
    +
  • For every index i in the range [0, n - 1], replace nums[i] with either nums[i], nums[(i - 1 + n) % n], or nums[(i + 1) % n].
    • +
+ +

Note that all the elements get replaced simultaneously.

+ +

Return the minimum number of seconds needed to make all elements in the array nums equal.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2]
+Output: 1
+Explanation: We can equalize the array in 1 second in the following way:
+- At 1st second, replace values at each index with [nums[3],nums[1],nums[3],nums[3]]. After replacement, nums = [2,2,2,2].
+It can be proven that 1 second is the minimum amount of seconds needed for equalizing the array.
+
+ +

Example 2:

+ +
+Input: nums = [2,1,3,3,2]
+Output: 2
+Explanation: We can equalize the array in 2 seconds in the following way:
+- At 1st second, replace values at each index with [nums[0],nums[2],nums[2],nums[2],nums[3]]. After replacement, nums = [2,3,3,3,3].
+- At 2nd second, replace values at each index with [nums[1],nums[1],nums[2],nums[3],nums[4]]. After replacement, nums = [3,3,3,3,3].
+It can be proven that 2 seconds is the minimum amount of seconds needed for equalizing the array.
+
+ +

Example 3:

+ +
+Input: nums = [5,5,5,5]
+Output: 0
+Explanation: We don't need to perform any operations as all elements in the initial array are the same.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int minimumSeconds(vector& nums) { + + } +};","class Solution { + public int minimumSeconds(List nums) { + + } +}","class Solution(object): + def minimumSeconds(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumSeconds(self, nums: List[int]) -> int: + ","int minimumSeconds(int* nums, int numsSize){ + +}","public class Solution { + public int MinimumSeconds(IList nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumSeconds = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_seconds(nums) + +end","class Solution { + func minimumSeconds(_ nums: [Int]) -> Int { + + } +}","func minimumSeconds(nums []int) int { + +}","object Solution { + def minimumSeconds(nums: List[Int]): Int = { + + } +}","class Solution { + fun minimumSeconds(nums: List): Int { + + } +}","impl Solution { + pub fn minimum_seconds(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumSeconds($nums) { + + } +}","function minimumSeconds(nums: number[]): number { + +};","(define/contract (minimum-seconds nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_seconds(Nums :: [integer()]) -> integer(). +minimum_seconds(Nums) -> + .","defmodule Solution do + @spec minimum_seconds(nums :: [integer]) :: integer + def minimum_seconds(nums) do + + end +end","class Solution { + int minimumSeconds(List nums) { + + } +}", +6,maximum-number-of-groups-with-increasing-length,Maximum Number of Groups With Increasing Length,2790.0,2919.0,"

You are given a 0-indexed array usageLimits of length n.

+ +

Your task is to create groups using numbers from 0 to n - 1, ensuring that each number, i, is used no more than usageLimits[i] times in total across all groups. You must also satisfy the following conditions:

+ +
    +
  • Each group must consist of distinct numbers, meaning that no duplicate numbers are allowed within a single group.
    • +
  • Each group (except the first one) must have a length strictly greater than the previous group.
    • +
+ +

Return an integer denoting the maximum number of groups you can create while satisfying these conditions.

+ +

 

+

Example 1:

+ +
+Input: usageLimits = [1,2,5]
+Output: 3
+Explanation: In this example, we can use 0 at most once, 1 at most twice, and 2 at most five times.
+One way of creating the maximum number of groups while satisfying the conditions is: 
+Group 1 contains the number [2].
+Group 2 contains the numbers [1,2].
+Group 3 contains the numbers [0,1,2]. 
+It can be shown that the maximum number of groups is 3. 
+So, the output is 3.
+ +

Example 2:

+ +
+Input: usageLimits = [2,1,2]
+Output: 2
+Explanation: In this example, we can use 0 at most twice, 1 at most once, and 2 at most twice.
+One way of creating the maximum number of groups while satisfying the conditions is:
+Group 1 contains the number [0].
+Group 2 contains the numbers [1,2].
+It can be shown that the maximum number of groups is 2.
+So, the output is 2. 
+
+ +

Example 3:

+ +
+Input: usageLimits = [1,1]
+Output: 1
+Explanation: In this example, we can use both 0 and 1 at most once.
+One way of creating the maximum number of groups while satisfying the conditions is:
+Group 1 contains the number [0].
+It can be shown that the maximum number of groups is 1.
+So, the output is 1. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= usageLimits.length <= 105
    • +
  • 1 <= usageLimits[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int maxIncreasingGroups(vector& usageLimits) { + + } +};","class Solution { + public int maxIncreasingGroups(List usageLimits) { + + } +}","class Solution(object): + def maxIncreasingGroups(self, usageLimits): + """""" + :type usageLimits: List[int] + :rtype: int + """""" + ","class Solution: + def maxIncreasingGroups(self, usageLimits: List[int]) -> int: + ","int maxIncreasingGroups(int* usageLimits, int usageLimitsSize){ + +}","public class Solution { + public int MaxIncreasingGroups(IList usageLimits) { + + } +}","/** + * @param {number[]} usageLimits + * @return {number} + */ +var maxIncreasingGroups = function(usageLimits) { + +};","# @param {Integer[]} usage_limits +# @return {Integer} +def max_increasing_groups(usage_limits) + +end","class Solution { + func maxIncreasingGroups(_ usageLimits: [Int]) -> Int { + + } +}","func maxIncreasingGroups(usageLimits []int) int { + +}","object Solution { + def maxIncreasingGroups(usageLimits: List[Int]): Int = { + + } +}","class Solution { + fun maxIncreasingGroups(usageLimits: List): Int { + + } +}","impl Solution { + pub fn max_increasing_groups(usage_limits: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $usageLimits + * @return Integer + */ + function maxIncreasingGroups($usageLimits) { + + } +}","function maxIncreasingGroups(usageLimits: number[]): number { + +};","(define/contract (max-increasing-groups usageLimits) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_increasing_groups(UsageLimits :: [integer()]) -> integer(). +max_increasing_groups(UsageLimits) -> + .","defmodule Solution do + @spec max_increasing_groups(usage_limits :: [integer]) :: integer + def max_increasing_groups(usage_limits) do + + end +end","class Solution { + int maxIncreasingGroups(List usageLimits) { + + } +}", +7,check-if-it-is-possible-to-split-array,Check if it is Possible to Split Array,2811.0,2916.0,"

You are given an array nums of length n and an integer m. You need to determine if it is possible to split the array into n non-empty arrays by performing a series of steps.

+ +

In each step, you can select an existing array (which may be the result of previous steps) with a length of at least two and split it into two subarrays, if, for each resulting subarray, at least one of the following holds:

+ +
    +
  • The length of the subarray is one, or
    • +
  • The sum of elements of the subarray is greater than or equal to m.
    • +
+ +

Return true if you can split the given array into n arrays, otherwise return false.

+ +

Note: A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2, 2, 1], m = 4
+Output: true
+Explanation: We can split the array into [2, 2] and [1] in the first step. Then, in the second step, we can split [2, 2] into [2] and [2]. As a result, the answer is true.
+ +

Example 2:

+ +
+Input: nums = [2, 1, 3], m = 5 
+Output: false
+Explanation: We can try splitting the array in two different ways: the first way is to have [2, 1] and [3], and the second way is to have [2] and [1, 3]. However, both of these ways are not valid. So, the answer is false.
+ +

Example 3:

+ +
+Input: nums = [2, 3, 3, 2, 3], m = 6
+Output: true
+Explanation: We can split the array into [2, 3, 3, 2] and [3] in the first step. Then, in the second step, we can split [2, 3, 3, 2] into [2, 3, 3] and [2]. Then, in the third step, we can split [2, 3, 3] into [2] and [3, 3]. And in the last step we can split [3, 3] into [3] and [3]. As a result, the answer is true.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == nums.length <= 100
    • +
  • 1 <= nums[i] <= 100
    • +
  • 1 <= m <= 200
    • +
+",2.0,False,"class Solution { +public: + bool canSplitArray(vector& nums, int m) { + + } +};","class Solution { + public boolean canSplitArray(List nums, int m) { + + } +}","class Solution(object): + def canSplitArray(self, nums, m): + """""" + :type nums: List[int] + :type m: int + :rtype: bool + """""" + ","class Solution: + def canSplitArray(self, nums: List[int], m: int) -> bool: + ","bool canSplitArray(int* nums, int numsSize, int m){ + +}","public class Solution { + public bool CanSplitArray(IList nums, int m) { + + } +}","/** + * @param {number[]} nums + * @param {number} m + * @return {boolean} + */ +var canSplitArray = function(nums, m) { + +};","# @param {Integer[]} nums +# @param {Integer} m +# @return {Boolean} +def can_split_array(nums, m) + +end","class Solution { + func canSplitArray(_ nums: [Int], _ m: Int) -> Bool { + + } +}","func canSplitArray(nums []int, m int) bool { + +}","object Solution { + def canSplitArray(nums: List[Int], m: Int): Boolean = { + + } +}","class Solution { + fun canSplitArray(nums: List, m: Int): Boolean { + + } +}","impl Solution { + pub fn can_split_array(nums: Vec, m: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $m + * @return Boolean + */ + function canSplitArray($nums, $m) { + + } +}","function canSplitArray(nums: number[], m: number): boolean { + +};","(define/contract (can-split-array nums m) + (-> (listof exact-integer?) exact-integer? boolean?) + + )","-spec can_split_array(Nums :: [integer()], M :: integer()) -> boolean(). +can_split_array(Nums, M) -> + .","defmodule Solution do + @spec can_split_array(nums :: [integer], m :: integer) :: boolean + def can_split_array(nums, m) do + + end +end","class Solution { + bool canSplitArray(List nums, int m) { + + } +}", +8,find-the-safest-path-in-a-grid,Find the Safest Path in a Grid,2812.0,2914.0,"

You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents:

+ +
    +
  • A cell containing a thief if grid[r][c] = 1
    • +
  • An empty cell if grid[r][c] = 0
    • +
+ +

You are initially positioned at cell (0, 0). In one move, you can move to any adjacent cell in the grid, including cells containing thieves.

+ +

The safeness factor of a path on the grid is defined as the minimum manhattan distance from any cell in the path to any thief in the grid.

+ +

Return the maximum safeness factor of all paths leading to cell (n - 1, n - 1).

+ +

An adjacent cell of cell (r, c), is one of the cells (r, c + 1), (r, c - 1), (r + 1, c) and (r - 1, c) if it exists.

+ +

The Manhattan distance between two cells (a, b) and (x, y) is equal to |a - x| + |b - y|, where |val| denotes the absolute value of val.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,0,0],[0,0,0],[0,0,1]]
+Output: 0
+Explanation: All paths from (0, 0) to (n - 1, n - 1) go through the thieves in cells (0, 0) and (n - 1, n - 1).
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,1],[0,0,0],[0,0,0]]
+Output: 2
+Explanation: The path depicted in the picture above has a safeness factor of 2 since:
+- The closest cell of the path to the thief at cell (0, 2) is cell (0, 0). The distance between them is | 0 - 0 | + | 0 - 2 | = 2.
+It can be shown that there are no other paths with a higher safeness factor.
+
+ +

Example 3:

+ +
+Input: grid = [[0,0,0,1],[0,0,0,0],[0,0,0,0],[1,0,0,0]]
+Output: 2
+Explanation: The path depicted in the picture above has a safeness factor of 2 since:
+- The closest cell of the path to the thief at cell (0, 3) is cell (1, 2). The distance between them is | 0 - 1 | + | 3 - 2 | = 2.
+- The closest cell of the path to the thief at cell (3, 0) is cell (3, 2). The distance between them is | 3 - 3 | + | 0 - 2 | = 2.
+It can be shown that there are no other paths with a higher safeness factor.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= grid.length == n <= 400
    • +
  • grid[i].length == n
    • +
  • grid[i][j] is either 0 or 1.
    • +
  • There is at least one thief in the grid.
    • +
+",2.0,False,"class Solution { +public: + int maximumSafenessFactor(vector>& grid) { + + } +};","class Solution { + public int maximumSafenessFactor(List> grid) { + + } +}","class Solution(object): + def maximumSafenessFactor(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumSafenessFactor(self, grid: List[List[int]]) -> int: + ","int maximumSafenessFactor(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaximumSafenessFactor(IList> grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maximumSafenessFactor = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def maximum_safeness_factor(grid) + +end","class Solution { + func maximumSafenessFactor(_ grid: [[Int]]) -> Int { + + } +}","func maximumSafenessFactor(grid [][]int) int { + +}","object Solution { + def maximumSafenessFactor(grid: List[List[Int]]): Int = { + + } +}","class Solution { + fun maximumSafenessFactor(grid: List>): Int { + + } +}","impl Solution { + pub fn maximum_safeness_factor(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maximumSafenessFactor($grid) { + + } +}","function maximumSafenessFactor(grid: number[][]): number { + +};","(define/contract (maximum-safeness-factor grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_safeness_factor(Grid :: [[integer()]]) -> integer(). +maximum_safeness_factor(Grid) -> + .","defmodule Solution do + @spec maximum_safeness_factor(grid :: [[integer]]) :: integer + def maximum_safeness_factor(grid) do + + end +end","class Solution { + int maximumSafenessFactor(List> grid) { + + } +}", +9,count-paths-that-can-form-a-palindrome-in-a-tree,Count Paths That Can Form a Palindrome in a Tree,2791.0,2905.0,"

You are given a tree (i.e. a connected, undirected graph that has no cycles) rooted at node 0 consisting of n nodes numbered from 0 to n - 1. The tree is represented by a 0-indexed array parent of size n, where parent[i] is the parent of node i. Since node 0 is the root, parent[0] == -1.

+ +

You are also given a string s of length n, where s[i] is the character assigned to the edge between i and parent[i]. s[0] can be ignored.

+ +

Return the number of pairs of nodes (u, v) such that u < v and the characters assigned to edges on the path from u to v can be rearranged to form a palindrome.

+ +

A string is a palindrome when it reads the same backwards as forwards.

+ +

 

+

Example 1:

+ +

+ +
+Input: parent = [-1,0,0,1,1,2], s = "acaabc"
+Output: 8
+Explanation: The valid pairs are:
+- All the pairs (0,1), (0,2), (1,3), (1,4) and (2,5) result in one character which is always a palindrome.
+- The pair (2,3) result in the string "aca" which is a palindrome.
+- The pair (1,5) result in the string "cac" which is a palindrome.
+- The pair (3,5) result in the string "acac" which can be rearranged into the palindrome "acca".
+
+ +

Example 2:

+ +
+Input: parent = [-1,0,0,0,0], s = "aaaaa"
+Output: 10
+Explanation: Any pair of nodes (u,v) where u < v is valid.
+
+ +

 

+

Constraints:

+ +
    +
  • n == parent.length == s.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= parent[i] <= n - 1 for all i >= 1
    • +
  • parent[0] == -1
    • +
  • parent represents a valid tree.
    • +
  • s consists of only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + long long countPalindromePaths(vector& parent, string s) { + + } +};","class Solution { + public long countPalindromePaths(List parent, String s) { + + } +}","class Solution(object): + def countPalindromePaths(self, parent, s): + """""" + :type parent: List[int] + :type s: str + :rtype: int + """""" + ","class Solution: + def countPalindromePaths(self, parent: List[int], s: str) -> int: + ","long long countPalindromePaths(int* parent, int parentSize, char * s){ + +}","public class Solution { + public long CountPalindromePaths(IList parent, string s) { + + } +}","/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +var countPalindromePaths = function(parent, s) { + +};","# @param {Integer[]} parent +# @param {String} s +# @return {Integer} +def count_palindrome_paths(parent, s) + +end","class Solution { + func countPalindromePaths(_ parent: [Int], _ s: String) -> Int { + + } +}","func countPalindromePaths(parent []int, s string) int64 { + +}","object Solution { + def countPalindromePaths(parent: List[Int], s: String): Long = { + + } +}","class Solution { + fun countPalindromePaths(parent: List, s: String): Long { + + } +}","impl Solution { + pub fn count_palindrome_paths(parent: Vec, s: String) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $parent + * @param String $s + * @return Integer + */ + function countPalindromePaths($parent, $s) { + + } +}","function countPalindromePaths(parent: number[], s: string): number { + +};","(define/contract (count-palindrome-paths parent s) + (-> (listof exact-integer?) string? exact-integer?) + + )","-spec count_palindrome_paths(Parent :: [integer()], S :: unicode:unicode_binary()) -> integer(). +count_palindrome_paths(Parent, S) -> + .","defmodule Solution do + @spec count_palindrome_paths(parent :: [integer], s :: String.t) :: integer + def count_palindrome_paths(parent, s) do + + end +end","class Solution { + int countPalindromePaths(List parent, String s) { + + } +}", +10,insert-greatest-common-divisors-in-linked-list,Insert Greatest Common Divisors in Linked List,2807.0,2903.0,"

Given the head of a linked list head, in which each node contains an integer value.

+ +

Between every pair of adjacent nodes, insert a new node with a value equal to the greatest common divisor of them.

+ +

Return the linked list after insertion.

+ +

The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.

+ +

 

+

Example 1:

+ +
+Input: head = [18,6,10,3]
+Output: [18,6,6,2,10,1,3]
+Explanation: The 1st diagram denotes the initial linked list and the 2nd diagram denotes the linked list after inserting the new nodes (nodes in blue are the inserted nodes).
+- We insert the greatest common divisor of 18 and 6 = 6 between the 1st and the 2nd nodes.
+- We insert the greatest common divisor of 6 and 10 = 2 between the 2nd and the 3rd nodes.
+- We insert the greatest common divisor of 10 and 3 = 1 between the 3rd and the 4th nodes.
+There are no more adjacent nodes, so we return the linked list.
+
+ +

Example 2:

+ +
+Input: head = [7]
+Output: [7]
+Explanation: The 1st diagram denotes the initial linked list and the 2nd diagram denotes the linked list after inserting the new nodes.
+There are no pairs of adjacent nodes, so we return the initial linked list.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [1, 5000].
    • +
  • 1 <= Node.val <= 1000
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* insertGreatestCommonDivisors(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode insertGreatestCommonDivisors(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def insertGreatestCommonDivisors(self, head): + """""" + :type head: Optional[ListNode] + :rtype: Optional[ListNode] + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def insertGreatestCommonDivisors(self, head: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* insertGreatestCommonDivisors(struct ListNode* head){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode InsertGreatestCommonDivisors(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var insertGreatestCommonDivisors = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {ListNode} +def insert_greatest_common_divisors(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func insertGreatestCommonDivisors(_ head: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func insertGreatestCommonDivisors(head *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def insertGreatestCommonDivisors(head: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun insertGreatestCommonDivisors(head: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn insert_greatest_common_divisors(head: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return ListNode + */ + function insertGreatestCommonDivisors($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function insertGreatestCommonDivisors(head: ListNode | null): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (insert-greatest-common-divisors head) + (-> (or/c list-node? #f) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec insert_greatest_common_divisors(Head :: #list_node{} | null) -> #list_node{} | null. +insert_greatest_common_divisors(Head) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec insert_greatest_common_divisors(head :: ListNode.t | nil) :: ListNode.t | nil + def insert_greatest_common_divisors(head) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? insertGreatestCommonDivisors(ListNode? head) { + + } +}", +12,maximum-elegance-of-a-k-length-subsequence,Maximum Elegance of a K-Length Subsequence,2813.0,2894.0,"

You are given a 0-indexed 2D integer array items of length n and an integer k.

+ +

items[i] = [profiti, categoryi], where profiti and categoryi denote the profit and category of the ith item respectively.

+ +

Let's define the elegance of a subsequence of items as total_profit + distinct_categories2, where total_profit is the sum of all profits in the subsequence, and distinct_categories is the number of distinct categories from all the categories in the selected subsequence.

+ +

Your task is to find the maximum elegance from all subsequences of size k in items.

+ +

Return an integer denoting the maximum elegance of a subsequence of items with size exactly k.

+ +

Note: A subsequence of an array is a new array generated from the original array by deleting some elements (possibly none) without changing the remaining elements' relative order.

+ +

 

+

Example 1:

+ +
+Input: items = [[3,2],[5,1],[10,1]], k = 2
+Output: 17
+Explanation: In this example, we have to select a subsequence of size 2.
+We can select items[0] = [3,2] and items[2] = [10,1].
+The total profit in this subsequence is 3 + 10 = 13, and the subsequence contains 2 distinct categories [2,1].
+Hence, the elegance is 13 + 22 = 17, and we can show that it is the maximum achievable elegance. 
+
+ +

Example 2:

+ +
+Input: items = [[3,1],[3,1],[2,2],[5,3]], k = 3
+Output: 19
+Explanation: In this example, we have to select a subsequence of size 3. 
+We can select items[0] = [3,1], items[2] = [2,2], and items[3] = [5,3]. 
+The total profit in this subsequence is 3 + 2 + 5 = 10, and the subsequence contains 3 distinct categories [1,2,3]. 
+Hence, the elegance is 10 + 32 = 19, and we can show that it is the maximum achievable elegance.
+ +

Example 3:

+ +
+Input: items = [[1,1],[2,1],[3,1]], k = 3
+Output: 7
+Explanation: In this example, we have to select a subsequence of size 3. 
+We should select all the items. 
+The total profit will be 1 + 2 + 3 = 6, and the subsequence contains 1 distinct category [1]. 
+Hence, the maximum elegance is 6 + 12 = 7.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= items.length == n <= 105
    • +
  • items[i].length == 2
    • +
  • items[i][0] == profiti
    • +
  • items[i][1] == categoryi
    • +
  • 1 <= profiti <= 109
    • +
  • 1 <= categoryi <= n
    • +
  • 1 <= k <= n
    • +
+",3.0,False,"class Solution { +public: + long long findMaximumElegance(vector>& items, int k) { + + } +};","class Solution { + public long findMaximumElegance(int[][] items, int k) { + + } +}","class Solution(object): + def findMaximumElegance(self, items, k): + """""" + :type items: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def findMaximumElegance(self, items: List[List[int]], k: int) -> int: + ","long long findMaximumElegance(int** items, int itemsSize, int* itemsColSize, int k){ + +}","public class Solution { + public long FindMaximumElegance(int[][] items, int k) { + + } +}","/** + * @param {number[][]} items + * @param {number} k + * @return {number} + */ +var findMaximumElegance = function(items, k) { + +};","# @param {Integer[][]} items +# @param {Integer} k +# @return {Integer} +def find_maximum_elegance(items, k) + +end","class Solution { + func findMaximumElegance(_ items: [[Int]], _ k: Int) -> Int { + + } +}","func findMaximumElegance(items [][]int, k int) int64 { + +}","object Solution { + def findMaximumElegance(items: Array[Array[Int]], k: Int): Long = { + + } +}","class Solution { + fun findMaximumElegance(items: Array, k: Int): Long { + + } +}","impl Solution { + pub fn find_maximum_elegance(items: Vec>, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[][] $items + * @param Integer $k + * @return Integer + */ + function findMaximumElegance($items, $k) { + + } +}","function findMaximumElegance(items: number[][], k: number): number { + +};","(define/contract (find-maximum-elegance items k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec find_maximum_elegance(Items :: [[integer()]], K :: integer()) -> integer(). +find_maximum_elegance(Items, K) -> + .","defmodule Solution do + @spec find_maximum_elegance(items :: [[integer]], k :: integer) :: integer + def find_maximum_elegance(items, k) do + + end +end","class Solution { + int findMaximumElegance(List> items, int k) { + + } +}", +14,check-if-array-is-good,Check if Array is Good,2784.0,2892.0,"

You are given an integer array nums. We consider an array good if it is a permutation of an array base[n].

+ +

base[n] = [1, 2, ..., n - 1, n, n] (in other words, it is an array of length n + 1 which contains 1 to n - 1 exactly once, plus two occurrences of n). For example, base[1] = [1, 1] and base[3] = [1, 2, 3, 3].

+ +

Return true if the given array is good, otherwise return false.

+ +

Note: A permutation of integers represents an arrangement of these numbers.

+ +

 

+

Example 1:

+ +
+Input: nums = [2, 1, 3]
+Output: false
+Explanation: Since the maximum element of the array is 3, the only candidate n for which this array could be a permutation of base[n], is n = 3. However, base[3] has four elements but array nums has three. Therefore, it can not be a permutation of base[3] = [1, 2, 3, 3]. So the answer is false.
+
+ +

Example 2:

+ +
+Input: nums = [1, 3, 3, 2]
+Output: true
+Explanation: Since the maximum element of the array is 3, the only candidate n for which this array could be a permutation of base[n], is n = 3. It can be seen that nums is a permutation of base[3] = [1, 2, 3, 3] (by swapping the second and fourth elements in nums, we reach base[3]). Therefore, the answer is true.
+ +

Example 3:

+ +
+Input: nums = [1, 1]
+Output: true
+Explanation: Since the maximum element of the array is 1, the only candidate n for which this array could be a permutation of base[n], is n = 1. It can be seen that nums is a permutation of base[1] = [1, 1]. Therefore, the answer is true.
+ +

Example 4:

+ +
+Input: nums = [3, 4, 4, 1, 2, 1]
+Output: false
+Explanation: Since the maximum element of the array is 4, the only candidate n for which this array could be a permutation of base[n], is n = 4. However, base[4] has five elements but array nums has six. Therefore, it can not be a permutation of base[4] = [1, 2, 3, 4, 4]. So the answer is false.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= num[i] <= 200
    • +
+",1.0,False,"class Solution { +public: + bool isGood(vector& nums) { + + } +};","class Solution { + public boolean isGood(int[] nums) { + + } +}","class Solution(object): + def isGood(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def isGood(self, nums: List[int]) -> bool: + ","bool isGood(int* nums, int numsSize){ + +}","public class Solution { + public bool IsGood(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var isGood = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def is_good(nums) + +end","class Solution { + func isGood(_ nums: [Int]) -> Bool { + + } +}","func isGood(nums []int) bool { + +}","object Solution { + def isGood(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun isGood(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_good(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function isGood($nums) { + + } +}","function isGood(nums: number[]): boolean { + +};","(define/contract (is-good nums) + (-> (listof exact-integer?) boolean?) + + )","-spec is_good(Nums :: [integer()]) -> boolean(). +is_good(Nums) -> + .","defmodule Solution do + @spec is_good(nums :: [integer]) :: boolean + def is_good(nums) do + + end +end","class Solution { + bool isGood(List nums) { + + } +}", +16,number-of-black-blocks,Number of Black Blocks,2768.0,2889.0,"

You are given two integers m and n representing the dimensions of a 0-indexed m x n grid.

+ +

You are also given a 0-indexed 2D integer matrix coordinates, where coordinates[i] = [x, y] indicates that the cell with coordinates [x, y] is colored black. All cells in the grid that do not appear in coordinates are white.

+ +

A block is defined as a 2 x 2 submatrix of the grid. More formally, a block with cell [x, y] as its top-left corner where 0 <= x < m - 1 and 0 <= y < n - 1 contains the coordinates [x, y], [x + 1, y], [x, y + 1], and [x + 1, y + 1].

+ +

Return a 0-indexed integer array arr of size 5 such that arr[i] is the number of blocks that contains exactly i black cells.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 3, coordinates = [[0,0]]
+Output: [3,1,0,0,0]
+Explanation: The grid looks like this:
+
+There is only 1 block with one black cell, and it is the block starting with cell [0,0].
+The other 3 blocks start with cells [0,1], [1,0] and [1,1]. They all have zero black cells. 
+Thus, we return [3,1,0,0,0]. 
+
+ +

Example 2:

+ +
+Input: m = 3, n = 3, coordinates = [[0,0],[1,1],[0,2]]
+Output: [0,2,2,0,0]
+Explanation: The grid looks like this:
+
+There are 2 blocks with two black cells (the ones starting with cell coordinates [0,0] and [0,1]).
+The other 2 blocks have starting cell coordinates of [1,0] and [1,1]. They both have 1 black cell.
+Therefore, we return [0,2,2,0,0].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= m <= 105
    • +
  • 2 <= n <= 105
    • +
  • 0 <= coordinates.length <= 104
    • +
  • coordinates[i].length == 2
    • +
  • 0 <= coordinates[i][0] < m
    • +
  • 0 <= coordinates[i][1] < n
    • +
  • It is guaranteed that coordinates contains pairwise distinct coordinates.
    • +
+",2.0,False,"class Solution { +public: + vector countBlackBlocks(int m, int n, vector>& coordinates) { + + } +};","class Solution { + public long[] countBlackBlocks(int m, int n, int[][] coordinates) { + + } +}","class Solution(object): + def countBlackBlocks(self, m, n, coordinates): + """""" + :type m: int + :type n: int + :type coordinates: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def countBlackBlocks(self, m: int, n: int, coordinates: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* countBlackBlocks(int m, int n, int** coordinates, int coordinatesSize, int* coordinatesColSize, int* returnSize){ + +}","public class Solution { + public long[] CountBlackBlocks(int m, int n, int[][] coordinates) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number[][]} coordinates + * @return {number[]} + */ +var countBlackBlocks = function(m, n, coordinates) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer[][]} coordinates +# @return {Integer[]} +def count_black_blocks(m, n, coordinates) + +end","class Solution { + func countBlackBlocks(_ m: Int, _ n: Int, _ coordinates: [[Int]]) -> [Int] { + + } +}","func countBlackBlocks(m int, n int, coordinates [][]int) []int64 { + +}","object Solution { + def countBlackBlocks(m: Int, n: Int, coordinates: Array[Array[Int]]): Array[Long] = { + + } +}","class Solution { + fun countBlackBlocks(m: Int, n: Int, coordinates: Array): LongArray { + + } +}","impl Solution { + pub fn count_black_blocks(m: i32, n: i32, coordinates: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer[][] $coordinates + * @return Integer[] + */ + function countBlackBlocks($m, $n, $coordinates) { + + } +}","function countBlackBlocks(m: number, n: number, coordinates: number[][]): number[] { + +};","(define/contract (count-black-blocks m n coordinates) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec count_black_blocks(M :: integer(), N :: integer(), Coordinates :: [[integer()]]) -> [integer()]. +count_black_blocks(M, N, Coordinates) -> + .","defmodule Solution do + @spec count_black_blocks(m :: integer, n :: integer, coordinates :: [[integer]]) :: [integer] + def count_black_blocks(m, n, coordinates) do + + end +end","class Solution { + List countBlackBlocks(int m, int n, List> coordinates) { + + } +}", +18,sort-vowels-in-a-string,Sort Vowels in a String,2785.0,2887.0,"

Given a 0-indexed string s, permute s to get a new string t such that:

+ +
    +
  • All consonants remain in their original places. More formally, if there is an index i with 0 <= i < s.length such that s[i] is a consonant, then t[i] = s[i].
    • +
  • The vowels must be sorted in the nondecreasing order of their ASCII values. More formally, for pairs of indices i, j with 0 <= i < j < s.length such that s[i] and s[j] are vowels, then t[i] must not have a higher ASCII value than t[j].
    • +
+ +

Return the resulting string.

+ +

The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in lowercase or uppercase. Consonants comprise all letters that are not vowels.

+ +

 

+

Example 1:

+ +
+Input: s = "lEetcOde"
+Output: "lEOtcede"
+Explanation: 'E', 'O', and 'e' are the vowels in s; 'l', 't', 'c', and 'd' are all consonants. The vowels are sorted according to their ASCII values, and the consonants remain in the same places.
+
+ +

Example 2:

+ +
+Input: s = "lYmpH"
+Output: "lYmpH"
+Explanation: There are no vowels in s (all characters in s are consonants), so we return "lYmpH".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists only of letters of the English alphabet in uppercase and lowercase.
    • +
+",2.0,False,"class Solution { +public: + string sortVowels(string s) { + + } +};","class Solution { + public String sortVowels(String s) { + + } +}","class Solution(object): + def sortVowels(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def sortVowels(self, s: str) -> str: + ","char * sortVowels(char * s){ + +}","public class Solution { + public string SortVowels(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var sortVowels = function(s) { + +};","# @param {String} s +# @return {String} +def sort_vowels(s) + +end","class Solution { + func sortVowels(_ s: String) -> String { + + } +}","func sortVowels(s string) string { + +}","object Solution { + def sortVowels(s: String): String = { + + } +}","class Solution { + fun sortVowels(s: String): String { + + } +}","impl Solution { + pub fn sort_vowels(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function sortVowels($s) { + + } +}","function sortVowels(s: string): string { + +};","(define/contract (sort-vowels s) + (-> string? string?) + + )","-spec sort_vowels(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +sort_vowels(S) -> + .","defmodule Solution do + @spec sort_vowels(s :: String.t) :: String.t + def sort_vowels(s) do + + end +end","class Solution { + String sortVowels(String s) { + + } +}", +20,length-of-the-longest-valid-substring,Length of the Longest Valid Substring,2781.0,2884.0,"

You are given a string word and an array of strings forbidden.

+ +

A string is called valid if none of its substrings are present in forbidden.

+ +

Return the length of the longest valid substring of the string word.

+ +

A substring is a contiguous sequence of characters in a string, possibly empty.

+ +

 

+

Example 1:

+ +
+Input: word = "cbaaaabc", forbidden = ["aaa","cb"]
+Output: 4
+Explanation: There are 11 valid substrings in word: "c", "b", "a", "ba", "aa", "bc", "baa", "aab", "ab", "abc"and "aabc". The length of the longest valid substring is 4. 
+It can be shown that all other substrings contain either "aaa" or "cb" as a substring.
+ +

Example 2:

+ +
+Input: word = "leetcode", forbidden = ["de","le","e"]
+Output: 4
+Explanation: There are 11 valid substrings in word: "l", "t", "c", "o", "d", "tc", "co", "od", "tco", "cod", and "tcod". The length of the longest valid substring is 4.
+It can be shown that all other substrings contain either "de", "le", or "e" as a substring. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length <= 105
    • +
  • word consists only of lowercase English letters.
    • +
  • 1 <= forbidden.length <= 105
    • +
  • 1 <= forbidden[i].length <= 10
    • +
  • forbidden[i] consists only of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int longestValidSubstring(string word, vector& forbidden) { + + } +};","class Solution { + public int longestValidSubstring(String word, List forbidden) { + + } +}","class Solution(object): + def longestValidSubstring(self, word, forbidden): + """""" + :type word: str + :type forbidden: List[str] + :rtype: int + """""" + ","class Solution: + def longestValidSubstring(self, word: str, forbidden: List[str]) -> int: + ","int longestValidSubstring(char * word, char ** forbidden, int forbiddenSize){ + +}","public class Solution { + public int LongestValidSubstring(string word, IList forbidden) { + + } +}","/** + * @param {string} word + * @param {string[]} forbidden + * @return {number} + */ +var longestValidSubstring = function(word, forbidden) { + +};","# @param {String} word +# @param {String[]} forbidden +# @return {Integer} +def longest_valid_substring(word, forbidden) + +end","class Solution { + func longestValidSubstring(_ word: String, _ forbidden: [String]) -> Int { + + } +}","func longestValidSubstring(word string, forbidden []string) int { + +}","object Solution { + def longestValidSubstring(word: String, forbidden: List[String]): Int = { + + } +}","class Solution { + fun longestValidSubstring(word: String, forbidden: List): Int { + + } +}","impl Solution { + pub fn longest_valid_substring(word: String, forbidden: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $word + * @param String[] $forbidden + * @return Integer + */ + function longestValidSubstring($word, $forbidden) { + + } +}","function longestValidSubstring(word: string, forbidden: string[]): number { + +};","(define/contract (longest-valid-substring word forbidden) + (-> string? (listof string?) exact-integer?) + + )","-spec longest_valid_substring(Word :: unicode:unicode_binary(), Forbidden :: [unicode:unicode_binary()]) -> integer(). +longest_valid_substring(Word, Forbidden) -> + .","defmodule Solution do + @spec longest_valid_substring(word :: String.t, forbidden :: [String.t]) :: integer + def longest_valid_substring(word, forbidden) do + + end +end","class Solution { + int longestValidSubstring(String word, List forbidden) { + + } +}", +22,ways-to-express-an-integer-as-sum-of-powers,Ways to Express an Integer as Sum of Powers,2787.0,2882.0,"

Given two positive integers n and x.

+ +

Return the number of ways n can be expressed as the sum of the xth power of unique positive integers, in other words, the number of sets of unique integers [n1, n2, ..., nk] where n = n1x + n2x + ... + nkx.

+ +

Since the result can be very large, return it modulo 109 + 7.

+ +

For example, if n = 160 and x = 3, one way to express n is n = 23 + 33 + 53.

+ +

 

+

Example 1:

+ +
+Input: n = 10, x = 2
+Output: 1
+Explanation: We can express n as the following: n = 32 + 12 = 10.
+It can be shown that it is the only way to express 10 as the sum of the 2nd power of unique integers.
+
+ +

Example 2:

+ +
+Input: n = 4, x = 1
+Output: 2
+Explanation: We can express n in the following ways:
+- n = 41 = 4.
+- n = 31 + 11 = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 300
    • +
  • 1 <= x <= 5
    • +
+",2.0,False,"class Solution { +public: + int numberOfWays(int n, int x) { + + } +};","class Solution { + public int numberOfWays(int n, int x) { + + } +}","class Solution(object): + def numberOfWays(self, n, x): + """""" + :type n: int + :type x: int + :rtype: int + """""" + ","class Solution: + def numberOfWays(self, n: int, x: int) -> int: + ","int numberOfWays(int n, int x){ + +}","public class Solution { + public int NumberOfWays(int n, int x) { + + } +}","/** + * @param {number} n + * @param {number} x + * @return {number} + */ +var numberOfWays = function(n, x) { + +};","# @param {Integer} n +# @param {Integer} x +# @return {Integer} +def number_of_ways(n, x) + +end","class Solution { + func numberOfWays(_ n: Int, _ x: Int) -> Int { + + } +}","func numberOfWays(n int, x int) int { + +}","object Solution { + def numberOfWays(n: Int, x: Int): Int = { + + } +}","class Solution { + fun numberOfWays(n: Int, x: Int): Int { + + } +}","impl Solution { + pub fn number_of_ways(n: i32, x: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $x + * @return Integer + */ + function numberOfWays($n, $x) { + + } +}","function numberOfWays(n: number, x: number): number { + +};","(define/contract (number-of-ways n x) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec number_of_ways(N :: integer(), X :: integer()) -> integer(). +number_of_ways(N, X) -> + .","defmodule Solution do + @spec number_of_ways(n :: integer, x :: integer) :: integer + def number_of_ways(n, x) do + + end +end","class Solution { + int numberOfWays(int n, int x) { + + } +}", +23,split-strings-by-separator,Split Strings by Separator,2788.0,2881.0,"

Given an array of strings words and a character separator, split each string in words by separator.

+ +

Return an array of strings containing the new strings formed after the splits, excluding empty strings.

+ +

Notes

+ +
    +
  • separator is used to determine where the split should occur, but it is not included as part of the resulting strings.
    • +
  • A split may result in more than two strings.
    • +
  • The resulting strings must maintain the same order as they were initially given.
    • +
+ +

 

+

Example 1:

+ +
+Input: words = ["one.two.three","four.five","six"], separator = "."
+Output: ["one","two","three","four","five","six"]
+Explanation: In this example we split as follows:
+
+"one.two.three" splits into "one", "two", "three"
+"four.five" splits into "four", "five"
+"six" splits into "six" 
+
+Hence, the resulting array is ["one","two","three","four","five","six"].
+ +

Example 2:

+ +
+Input: words = ["$easy$","$problem$"], separator = "$"
+Output: ["easy","problem"]
+Explanation: In this example we split as follows: 
+
+"$easy$" splits into "easy" (excluding empty strings)
+"$problem$" splits into "problem" (excluding empty strings)
+
+Hence, the resulting array is ["easy","problem"].
+
+ +

Example 3:

+ +
+Input: words = ["|||"], separator = "|"
+Output: []
+Explanation: In this example the resulting split of "|||" will contain only empty strings, so we return an empty array [].
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
    • +
  • 1 <= words[i].length <= 20
    • +
  • characters in words[i] are either lowercase English letters or characters from the string ".,|$#@" (excluding the quotes)
    • +
  • separator is a character from the string ".,|$#@" (excluding the quotes)
    • +
+",1.0,False,"class Solution { +public: + vector splitWordsBySeparator(vector& words, char separator) { + + } +};","class Solution { + public List splitWordsBySeparator(List words, char separator) { + + } +}","class Solution(object): + def splitWordsBySeparator(self, words, separator): + """""" + :type words: List[str] + :type separator: str + :rtype: List[str] + """""" + ","class Solution: + def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** splitWordsBySeparator(char ** words, int wordsSize, char separator, int* returnSize){ + +}","public class Solution { + public IList SplitWordsBySeparator(IList words, char separator) { + + } +}","/** + * @param {string[]} words + * @param {character} separator + * @return {string[]} + */ +var splitWordsBySeparator = function(words, separator) { + +};","# @param {String[]} words +# @param {Character} separator +# @return {String[]} +def split_words_by_separator(words, separator) + +end","class Solution { + func splitWordsBySeparator(_ words: [String], _ separator: Character) -> [String] { + + } +}","func splitWordsBySeparator(words []string, separator byte) []string { + +}","object Solution { + def splitWordsBySeparator(words: List[String], separator: Char): List[String] = { + + } +}","class Solution { + fun splitWordsBySeparator(words: List, separator: Char): List { + + } +}","impl Solution { + pub fn split_words_by_separator(words: Vec, separator: char) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String $separator + * @return String[] + */ + function splitWordsBySeparator($words, $separator) { + + } +}","function splitWordsBySeparator(words: string[], separator: string): string[] { + +};","(define/contract (split-words-by-separator words separator) + (-> (listof string?) char? (listof string?)) + + )","-spec split_words_by_separator(Words :: [unicode:unicode_binary()], Separator :: char()) -> [unicode:unicode_binary()]. +split_words_by_separator(Words, Separator) -> + .","defmodule Solution do + @spec split_words_by_separator(words :: [String.t], separator :: char) :: [String.t] + def split_words_by_separator(words, separator) do + + end +end","class Solution { + List splitWordsBySeparator(List words, String separator) { + + } +}", +24,apply-operations-to-make-all-array-elements-equal-to-zero,Apply Operations to Make All Array Elements Equal to Zero,2772.0,2878.0,"

You are given a 0-indexed integer array nums and a positive integer k.

+ +

You can apply the following operation on the array any number of times:

+ +
    +
  • Choose any subarray of size k from the array and decrease all its elements by 1.
    • +
+ +

Return true if you can make all the array elements equal to 0, or false otherwise.

+ +

A subarray is a contiguous non-empty part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,2,3,1,1,0], k = 3
+Output: true
+Explanation: We can do the following operations:
+- Choose the subarray [2,2,3]. The resulting array will be nums = [1,1,2,1,1,0].
+- Choose the subarray [2,1,1]. The resulting array will be nums = [1,1,1,0,0,0].
+- Choose the subarray [1,1,1]. The resulting array will be nums = [0,0,0,0,0,0].
+
+ +

Example 2:

+ +
+Input: nums = [1,3,1,1], k = 2
+Output: false
+Explanation: It is not possible to make all the array elements equal to 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + bool checkArray(vector& nums, int k) { + + } +};","class Solution { + public boolean checkArray(int[] nums, int k) { + + } +}","class Solution(object): + def checkArray(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: bool + """""" + ","class Solution: + def checkArray(self, nums: List[int], k: int) -> bool: + ","bool checkArray(int* nums, int numsSize, int k){ + +}","public class Solution { + public bool CheckArray(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {boolean} + */ +var checkArray = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Boolean} +def check_array(nums, k) + +end","class Solution { + func checkArray(_ nums: [Int], _ k: Int) -> Bool { + + } +}","func checkArray(nums []int, k int) bool { + +}","object Solution { + def checkArray(nums: Array[Int], k: Int): Boolean = { + + } +}","class Solution { + fun checkArray(nums: IntArray, k: Int): Boolean { + + } +}","impl Solution { + pub fn check_array(nums: Vec, k: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Boolean + */ + function checkArray($nums, $k) { + + } +}","function checkArray(nums: number[], k: number): boolean { + +};","(define/contract (check-array nums k) + (-> (listof exact-integer?) exact-integer? boolean?) + + )","-spec check_array(Nums :: [integer()], K :: integer()) -> boolean(). +check_array(Nums, K) -> + .","defmodule Solution do + @spec check_array(nums :: [integer], k :: integer) :: boolean + def check_array(nums, k) do + + end +end","class Solution { + bool checkArray(List nums, int k) { + + } +}", +25,shortest-string-that-contains-three-strings,Shortest String That Contains Three Strings,2800.0,2877.0,"Given three strings a, b, and c, your task is to find a string that has the minimum length and contains all three strings as substrings. +

If there are multiple such strings, return the lexicographically smallest one.

+ +

Return a string denoting the answer to the problem.

+ +

Notes

+ +
    +
  • A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b.
    • +
  • A substring is a contiguous sequence of characters within a string.
    • +
+ +

 

+

Example 1:

+ +
+Input: a = "abc", b = "bca", c = "aaa"
+Output: "aaabca"
+Explanation:  We show that "aaabca" contains all the given strings: a = ans[2...4], b = ans[3..5], c = ans[0..2]. It can be shown that the length of the resulting string would be at least 6 and "aaabca" is the lexicographically smallest one.
+ +

Example 2:

+ +
+Input: a = "ab", b = "ba", c = "aba"
+Output: "aba"
+Explanation: We show that the string "aba" contains all the given strings: a = ans[0..1], b = ans[1..2], c = ans[0..2]. Since the length of c is 3, the length of the resulting string would be at least 3. It can be shown that "aba" is the lexicographically smallest one.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a.length, b.length, c.length <= 100
    • +
  • a, b, c consist only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string minimumString(string a, string b, string c) { + + } +};","class Solution { + public String minimumString(String a, String b, String c) { + + } +}","class Solution(object): + def minimumString(self, a, b, c): + """""" + :type a: str + :type b: str + :type c: str + :rtype: str + """""" + ","class Solution: + def minimumString(self, a: str, b: str, c: str) -> str: + ","char * minimumString(char * a, char * b, char * c){ + +}","public class Solution { + public string MinimumString(string a, string b, string c) { + + } +}","/** + * @param {string} a + * @param {string} b + * @param {string} c + * @return {string} + */ +var minimumString = function(a, b, c) { + +};","# @param {String} a +# @param {String} b +# @param {String} c +# @return {String} +def minimum_string(a, b, c) + +end","class Solution { + func minimumString(_ a: String, _ b: String, _ c: String) -> String { + + } +}","func minimumString(a string, b string, c string) string { + +}","object Solution { + def minimumString(a: String, b: String, c: String): String = { + + } +}","class Solution { + fun minimumString(a: String, b: String, c: String): String { + + } +}","impl Solution { + pub fn minimum_string(a: String, b: String, c: String) -> String { + + } +}","class Solution { + + /** + * @param String $a + * @param String $b + * @param String $c + * @return String + */ + function minimumString($a, $b, $c) { + + } +}","function minimumString(a: string, b: string, c: string): string { + +};","(define/contract (minimum-string a b c) + (-> string? string? string? string?) + + )","-spec minimum_string(A :: unicode:unicode_binary(), B :: unicode:unicode_binary(), C :: unicode:unicode_binary()) -> unicode:unicode_binary(). +minimum_string(A, B, C) -> + .","defmodule Solution do + @spec minimum_string(a :: String.t, b :: String.t, c :: String.t) :: String.t + def minimum_string(a, b, c) do + + end +end","class Solution { + String minimumString(String a, String b, String c) { + + } +}", +31,longest-non-decreasing-subarray-from-two-arrays,Longest Non-decreasing Subarray From Two Arrays,2771.0,2869.0,"

You are given two 0-indexed integer arrays nums1 and nums2 of length n.

+ +

Let's define another 0-indexed integer array, nums3, of length n. For each index i in the range [0, n - 1], you can assign either nums1[i] or nums2[i] to nums3[i].

+ +

Your task is to maximize the length of the longest non-decreasing subarray in nums3 by choosing its values optimally.

+ +

Return an integer representing the length of the longest non-decreasing subarray in nums3.

+ +

Note: A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [2,3,1], nums2 = [1,2,1]
+Output: 2
+Explanation: One way to construct nums3 is: 
+nums3 = [nums1[0], nums2[1], nums2[2]] => [2,2,1]. 
+The subarray starting from index 0 and ending at index 1, [2,2], forms a non-decreasing subarray of length 2. 
+We can show that 2 is the maximum achievable length.
+ +

Example 2:

+ +
+Input: nums1 = [1,3,2,1], nums2 = [2,2,3,4]
+Output: 4
+Explanation: One way to construct nums3 is: 
+nums3 = [nums1[0], nums2[1], nums2[2], nums2[3]] => [1,2,3,4]. 
+The entire array forms a non-decreasing subarray of length 4, making it the maximum achievable length.
+
+ +

Example 3:

+ +
+Input: nums1 = [1,1], nums2 = [2,2]
+Output: 2
+Explanation: One way to construct nums3 is: 
+nums3 = [nums1[0], nums1[1]] => [1,1]. 
+The entire array forms a non-decreasing subarray of length 2, making it the maximum achievable length.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length == nums2.length == n <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int maxNonDecreasingLength(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int maxNonDecreasingLength(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def maxNonDecreasingLength(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int: + ","int maxNonDecreasingLength(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MaxNonDecreasingLength(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maxNonDecreasingLength = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def max_non_decreasing_length(nums1, nums2) + +end","class Solution { + func maxNonDecreasingLength(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func maxNonDecreasingLength(nums1 []int, nums2 []int) int { + +}","object Solution { + def maxNonDecreasingLength(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun maxNonDecreasingLength(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn max_non_decreasing_length(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function maxNonDecreasingLength($nums1, $nums2) { + + } +}","function maxNonDecreasingLength(nums1: number[], nums2: number[]): number { + +};","(define/contract (max-non-decreasing-length nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec max_non_decreasing_length(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +max_non_decreasing_length(Nums1, Nums2) -> + .","defmodule Solution do + @spec max_non_decreasing_length(nums1 :: [integer], nums2 :: [integer]) :: integer + def max_non_decreasing_length(nums1, nums2) do + + end +end","class Solution { + int maxNonDecreasingLength(List nums1, List nums2) { + + } +}", +32,continuous-subarrays,Continuous Subarrays,2762.0,2868.0,"

You are given a 0-indexed integer array nums. A subarray of nums is called continuous if:

+ +
    +
  • Let i, i + 1, ..., j be the indices in the subarray. Then, for each pair of indices i <= i1, i2 <= j, 0 <= |nums[i1] - nums[i2]| <= 2.
    • +
+ +

Return the total number of continuous subarrays.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [5,4,2,4]
+Output: 8
+Explanation: 
+Continuous subarray of size 1: [5], [4], [2], [4].
+Continuous subarray of size 2: [5,4], [4,2], [2,4].
+Continuous subarray of size 3: [4,2,4].
+Thereare no subarrys of size 4.
+Total continuous subarrays = 4 + 3 + 1 = 8.
+It can be shown that there are no more continuous subarrays.
+
+ +

 

+ +

Example 2:

+ +
+Input: nums = [1,2,3]
+Output: 6
+Explanation: 
+Continuous subarray of size 1: [1], [2], [3].
+Continuous subarray of size 2: [1,2], [2,3].
+Continuous subarray of size 3: [1,2,3].
+Total continuous subarrays = 3 + 2 + 1 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + long long continuousSubarrays(vector& nums) { + + } +};","class Solution { + public long continuousSubarrays(int[] nums) { + + } +}","class Solution(object): + def continuousSubarrays(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def continuousSubarrays(self, nums: List[int]) -> int: + ","long long continuousSubarrays(int* nums, int numsSize){ + +}","public class Solution { + public long ContinuousSubarrays(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var continuousSubarrays = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def continuous_subarrays(nums) + +end","class Solution { + func continuousSubarrays(_ nums: [Int]) -> Int { + + } +}","func continuousSubarrays(nums []int) int64 { + +}","object Solution { + def continuousSubarrays(nums: Array[Int]): Long = { + + } +}","class Solution { + fun continuousSubarrays(nums: IntArray): Long { + + } +}","impl Solution { + pub fn continuous_subarrays(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function continuousSubarrays($nums) { + + } +}","function continuousSubarrays(nums: number[]): number { + +};","(define/contract (continuous-subarrays nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec continuous_subarrays(Nums :: [integer()]) -> integer(). +continuous_subarrays(Nums) -> + .","defmodule Solution do + @spec continuous_subarrays(nums :: [integer]) :: integer + def continuous_subarrays(nums) do + + end +end","class Solution { + int continuousSubarrays(List nums) { + + } +}", +33,ways-to-split-array-into-good-subarrays,Ways to Split Array Into Good Subarrays,2750.0,2867.0,"

You are given a binary array nums.

+ +

A subarray of an array is good if it contains exactly one element with the value 1.

+ +

Return an integer denoting the number of ways to split the array nums into good subarrays. As the number may be too large, return it modulo 109 + 7.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,0,0,1]
+Output: 3
+Explanation: There are 3 ways to split nums into good subarrays:
+- [0,1] [0,0,1]
+- [0,1,0] [0,1]
+- [0,1,0,0] [1]
+
+ +

Example 2:

+ +
+Input: nums = [0,1,0]
+Output: 1
+Explanation: There is 1 way to split nums into good subarrays:
+- [0,1,0]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 1
    • +
+",2.0,False,"class Solution { +public: + int numberOfGoodSubarraySplits(vector& nums) { + + } +};","class Solution { + public int numberOfGoodSubarraySplits(int[] nums) { + + } +}","class Solution(object): + def numberOfGoodSubarraySplits(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numberOfGoodSubarraySplits(self, nums: List[int]) -> int: + ","int numberOfGoodSubarraySplits(int* nums, int numsSize){ + +}","public class Solution { + public int NumberOfGoodSubarraySplits(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numberOfGoodSubarraySplits = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def number_of_good_subarray_splits(nums) + +end","class Solution { + func numberOfGoodSubarraySplits(_ nums: [Int]) -> Int { + + } +}","func numberOfGoodSubarraySplits(nums []int) int { + +}","object Solution { + def numberOfGoodSubarraySplits(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numberOfGoodSubarraySplits(nums: IntArray): Int { + + } +}","impl Solution { + pub fn number_of_good_subarray_splits(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numberOfGoodSubarraySplits($nums) { + + } +}","function numberOfGoodSubarraySplits(nums: number[]): number { + +};","(define/contract (number-of-good-subarray-splits nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec number_of_good_subarray_splits(Nums :: [integer()]) -> integer(). +number_of_good_subarray_splits(Nums) -> + .","defmodule Solution do + @spec number_of_good_subarray_splits(nums :: [integer]) :: integer + def number_of_good_subarray_splits(nums) do + + end +end","class Solution { + int numberOfGoodSubarraySplits(List nums) { + + } +}", +36,count-complete-subarrays-in-an-array,Count Complete Subarrays in an Array,2799.0,2856.0,"

You are given an array nums consisting of positive integers.

+ +

We call a subarray of an array complete if the following condition is satisfied:

+ +
    +
  • The number of distinct elements in the subarray is equal to the number of distinct elements in the whole array.
    • +
+ +

Return the number of complete subarrays.

+ +

A subarray is a contiguous non-empty part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,1,2,2]
+Output: 4
+Explanation: The complete subarrays are the following: [1,3,1,2], [1,3,1,2,2], [3,1,2] and [3,1,2,2].
+
+ +

Example 2:

+ +
+Input: nums = [5,5,5,5]
+Output: 10
+Explanation: The array consists only of the integer 5, so any subarray is complete. The number of subarrays that we can choose is 10.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 2000
    • +
+",2.0,False,"class Solution { +public: + int countCompleteSubarrays(vector& nums) { + + } +};","class Solution { + public int countCompleteSubarrays(int[] nums) { + + } +}","class Solution(object): + def countCompleteSubarrays(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countCompleteSubarrays(self, nums: List[int]) -> int: + ","int countCompleteSubarrays(int* nums, int numsSize){ + +}","public class Solution { + public int CountCompleteSubarrays(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countCompleteSubarrays = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_complete_subarrays(nums) + +end","class Solution { + func countCompleteSubarrays(_ nums: [Int]) -> Int { + + } +}","func countCompleteSubarrays(nums []int) int { + +}","object Solution { + def countCompleteSubarrays(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countCompleteSubarrays(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_complete_subarrays(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countCompleteSubarrays($nums) { + + } +}","function countCompleteSubarrays(nums: number[]): number { + +};","(define/contract (count-complete-subarrays nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_complete_subarrays(Nums :: [integer()]) -> integer(). +count_complete_subarrays(Nums) -> + .","defmodule Solution do + @spec count_complete_subarrays(nums :: [integer]) :: integer + def count_complete_subarrays(nums) do + + end +end","class Solution { + int countCompleteSubarrays(List nums) { + + } +}", +37,maximum-number-of-jumps-to-reach-the-last-index,Maximum Number of Jumps to Reach the Last Index,2770.0,2855.0,"

You are given a 0-indexed array nums of n integers and an integer target.

+ +

You are initially positioned at index 0. In one step, you can jump from index i to any index j such that:

+ +
    +
  • 0 <= i < j < n
    • +
  • -target <= nums[j] - nums[i] <= target
    • +
+ +

Return the maximum number of jumps you can make to reach index n - 1.

+ +

If there is no way to reach index n - 1, return -1.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,6,4,1,2], target = 2
+Output: 3
+Explanation: To go from index 0 to index n - 1 with the maximum number of jumps, you can perform the following jumping sequence:
+- Jump from index 0 to index 1. 
+- Jump from index 1 to index 3.
+- Jump from index 3 to index 5.
+It can be proven that there is no other jumping sequence that goes from 0 to n - 1 with more than 3 jumps. Hence, the answer is 3.
+ +

Example 2:

+ +
+Input: nums = [1,3,6,4,1,2], target = 3
+Output: 5
+Explanation: To go from index 0 to index n - 1 with the maximum number of jumps, you can perform the following jumping sequence:
+- Jump from index 0 to index 1.
+- Jump from index 1 to index 2.
+- Jump from index 2 to index 3.
+- Jump from index 3 to index 4.
+- Jump from index 4 to index 5.
+It can be proven that there is no other jumping sequence that goes from 0 to n - 1 with more than 5 jumps. Hence, the answer is 5.
+ +

Example 3:

+ +
+Input: nums = [1,3,6,4,1,2], target = 0
+Output: -1
+Explanation: It can be proven that there is no jumping sequence that goes from 0 to n - 1. Hence, the answer is -1. 
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length == n <= 1000
    • +
  • -109 <= nums[i] <= 109
    • +
  • 0 <= target <= 2 * 109
    • +
+",2.0,False,"class Solution { +public: + int maximumJumps(vector& nums, int target) { + + } +};","class Solution { + public int maximumJumps(int[] nums, int target) { + + } +}","class Solution(object): + def maximumJumps(self, nums, target): + """""" + :type nums: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def maximumJumps(self, nums: List[int], target: int) -> int: + ","int maximumJumps(int* nums, int numsSize, int target){ + +}","public class Solution { + public int MaximumJumps(int[] nums, int target) { + + } +}","/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var maximumJumps = function(nums, target) { + +};","# @param {Integer[]} nums +# @param {Integer} target +# @return {Integer} +def maximum_jumps(nums, target) + +end","class Solution { + func maximumJumps(_ nums: [Int], _ target: Int) -> Int { + + } +}","func maximumJumps(nums []int, target int) int { + +}","object Solution { + def maximumJumps(nums: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun maximumJumps(nums: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn maximum_jumps(nums: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $target + * @return Integer + */ + function maximumJumps($nums, $target) { + + } +}","function maximumJumps(nums: number[], target: number): number { + +};","(define/contract (maximum-jumps nums target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_jumps(Nums :: [integer()], Target :: integer()) -> integer(). +maximum_jumps(Nums, Target) -> + .","defmodule Solution do + @spec maximum_jumps(nums :: [integer], target :: integer) :: integer + def maximum_jumps(nums, target) do + + end +end","class Solution { + int maximumJumps(List nums, int target) { + + } +}", +40,sum-of-imbalance-numbers-of-all-subarrays,Sum of Imbalance Numbers of All Subarrays,2763.0,2849.0,"

The imbalance number of a 0-indexed integer array arr of length n is defined as the number of indices in sarr = sorted(arr) such that:

+ +
    +
  • 0 <= i < n - 1, and
    • +
  • sarr[i+1] - sarr[i] > 1
    • +
+ +

Here, sorted(arr) is the function that returns the sorted version of arr.

+ +

Given a 0-indexed integer array nums, return the sum of imbalance numbers of all its subarrays.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,1,4]
+Output: 3
+Explanation: There are 3 subarrays with non-zero imbalance numbers:
+- Subarray [3, 1] with an imbalance number of 1.
+- Subarray [3, 1, 4] with an imbalance number of 1.
+- Subarray [1, 4] with an imbalance number of 1.
+The imbalance number of all other subarrays is 0. Hence, the sum of imbalance numbers of all the subarrays of nums is 3. 
+
+ +

Example 2:

+ +
+Input: nums = [1,3,3,3,5]
+Output: 8
+Explanation: There are 7 subarrays with non-zero imbalance numbers:
+- Subarray [1, 3] with an imbalance number of 1.
+- Subarray [1, 3, 3] with an imbalance number of 1.
+- Subarray [1, 3, 3, 3] with an imbalance number of 1.
+- Subarray [1, 3, 3, 3, 5] with an imbalance number of 2. 
+- Subarray [3, 3, 3, 5] with an imbalance number of 1. 
+- Subarray [3, 3, 5] with an imbalance number of 1.
+- Subarray [3, 5] with an imbalance number of 1.
+The imbalance number of all other subarrays is 0. Hence, the sum of imbalance numbers of all the subarrays of nums is 8.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= nums.length
    • +
+",3.0,False,"class Solution { +public: + int sumImbalanceNumbers(vector& nums) { + + } +};","class Solution { + public int sumImbalanceNumbers(int[] nums) { + + } +}","class Solution(object): + def sumImbalanceNumbers(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumImbalanceNumbers(self, nums: List[int]) -> int: + ","int sumImbalanceNumbers(int* nums, int numsSize){ + +}","public class Solution { + public int SumImbalanceNumbers(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumImbalanceNumbers = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_imbalance_numbers(nums) + +end","class Solution { + func sumImbalanceNumbers(_ nums: [Int]) -> Int { + + } +}","func sumImbalanceNumbers(nums []int) int { + +}","object Solution { + def sumImbalanceNumbers(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumImbalanceNumbers(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_imbalance_numbers(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumImbalanceNumbers($nums) { + + } +}","function sumImbalanceNumbers(nums: number[]): number { + +};","(define/contract (sum-imbalance-numbers nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_imbalance_numbers(Nums :: [integer()]) -> integer(). +sum_imbalance_numbers(Nums) -> + .","defmodule Solution do + @spec sum_imbalance_numbers(nums :: [integer]) :: integer + def sum_imbalance_numbers(nums) do + + end +end","class Solution { + int sumImbalanceNumbers(List nums) { + + } +}", +42,find-maximum-number-of-string-pairs,Find Maximum Number of String Pairs,2744.0,2847.0,"

You are given a 0-indexed array words consisting of distinct strings.

+ +

The string words[i] can be paired with the string words[j] if:

+ +
    +
  • The string words[i] is equal to the reversed string of words[j].
    • +
  • 0 <= i < j < words.length.
    • +
+ +

Return the maximum number of pairs that can be formed from the array words.

+ +

Note that each string can belong in at most one pair.

+ +

 

+

Example 1:

+ +
+Input: words = ["cd","ac","dc","ca","zz"]
+Output: 2
+Explanation: In this example, we can form 2 pair of strings in the following way:
+- We pair the 0th string with the 2nd string, as the reversed string of word[0] is "dc" and is equal to words[2].
+- We pair the 1st string with the 3rd string, as the reversed string of word[1] is "ca" and is equal to words[3].
+It can be proven that 2 is the maximum number of pairs that can be formed.
+ +

Example 2:

+ +
+Input: words = ["ab","ba","cc"]
+Output: 1
+Explanation: In this example, we can form 1 pair of strings in the following way:
+- We pair the 0th string with the 1st string, as the reversed string of words[1] is "ab" and is equal to words[0].
+It can be proven that 1 is the maximum number of pairs that can be formed.
+
+ +

Example 3:

+ +
+Input: words = ["aa","ab"]
+Output: 0
+Explanation: In this example, we are unable to form any pair of strings.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 50
    • +
  • words[i].length == 2
    • +
  • words consists of distinct strings.
    • +
  • words[i] contains only lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + int maximumNumberOfStringPairs(vector& words) { + + } +};","class Solution { + public int maximumNumberOfStringPairs(String[] words) { + + } +}","class Solution(object): + def maximumNumberOfStringPairs(self, words): + """""" + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def maximumNumberOfStringPairs(self, words: List[str]) -> int: + ","int maximumNumberOfStringPairs(char ** words, int wordsSize){ + +}","public class Solution { + public int MaximumNumberOfStringPairs(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number} + */ +var maximumNumberOfStringPairs = function(words) { + +};","# @param {String[]} words +# @return {Integer} +def maximum_number_of_string_pairs(words) + +end","class Solution { + func maximumNumberOfStringPairs(_ words: [String]) -> Int { + + } +}","func maximumNumberOfStringPairs(words []string) int { + +}","object Solution { + def maximumNumberOfStringPairs(words: Array[String]): Int = { + + } +}","class Solution { + fun maximumNumberOfStringPairs(words: Array): Int { + + } +}","impl Solution { + pub fn maximum_number_of_string_pairs(words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer + */ + function maximumNumberOfStringPairs($words) { + + } +}","function maximumNumberOfStringPairs(words: string[]): number { + +};","(define/contract (maximum-number-of-string-pairs words) + (-> (listof string?) exact-integer?) + + )","-spec maximum_number_of_string_pairs(Words :: [unicode:unicode_binary()]) -> integer(). +maximum_number_of_string_pairs(Words) -> + .","defmodule Solution do + @spec maximum_number_of_string_pairs(words :: [String.t]) :: integer + def maximum_number_of_string_pairs(words) do + + end +end","class Solution { + int maximumNumberOfStringPairs(List words) { + + } +}", +43,robot-collisions,Robot Collisions,2751.0,2846.0,"

There are n 1-indexed robots, each having a position on a line, health, and movement direction.

+ +

You are given 0-indexed integer arrays positions, healths, and a string directions (directions[i] is either 'L' for left or 'R' for right). All integers in positions are unique.

+ +

All robots start moving on the line simultaneously at the same speed in their given directions. If two robots ever share the same position while moving, they will collide.

+ +

If two robots collide, the robot with lower health is removed from the line, and the health of the other robot decreases by one. The surviving robot continues in the same direction it was going. If both robots have the same health, they are both removed from the line.

+ +

Your task is to determine the health of the robots that survive the collisions, in the same order that the robots were given, i.e. final heath of robot 1 (if survived), final health of robot 2 (if survived), and so on. If there are no survivors, return an empty array.

+ +

Return an array containing the health of the remaining robots (in the order they were given in the input), after no further collisions can occur.

+ +

Note: The positions may be unsorted.

+ +
 
+ +

 

+

Example 1:

+ +

+ +
+Input: positions = [5,4,3,2,1], healths = [2,17,9,15,10], directions = "RRRRR"
+Output: [2,17,9,15,10]
+Explanation: No collision occurs in this example, since all robots are moving in the same direction. So, the health of the robots in order from the first robot is returned, [2, 17, 9, 15, 10].
+
+ +

Example 2:

+ +

+ +
+Input: positions = [3,5,2,6], healths = [10,10,15,12], directions = "RLRL"
+Output: [14]
+Explanation: There are 2 collisions in this example. Firstly, robot 1 and robot 2 will collide, and since both have the same health, they will be removed from the line. Next, robot 3 and robot 4 will collide and since robot 4's health is smaller, it gets removed, and robot 3's health becomes 15 - 1 = 14. Only robot 3 remains, so we return [14].
+
+ +

Example 3:

+ +

+ +
+Input: positions = [1,2,5,6], healths = [10,10,11,11], directions = "RLRL"
+Output: []
+Explanation: Robot 1 and robot 2 will collide and since both have the same health, they are both removed. Robot 3 and 4 will collide and since both have the same health, they are both removed. So, we return an empty array, [].
+ +

 

+

Constraints:

+ +
    +
  • 1 <= positions.length == healths.length == directions.length == n <= 105
    • +
  • 1 <= positions[i], healths[i] <= 109
    • +
  • directions[i] == 'L' or directions[i] == 'R'
    • +
  • All values in positions are distinct
    • +
+",3.0,False,"class Solution { +public: + vector survivedRobotsHealths(vector& positions, vector& healths, string directions) { + + } +};","class Solution { + public List survivedRobotsHealths(int[] positions, int[] healths, String directions) { + + } +}","class Solution(object): + def survivedRobotsHealths(self, positions, healths, directions): + """""" + :type positions: List[int] + :type healths: List[int] + :type directions: str + :rtype: List[int] + """""" + ","class Solution: + def survivedRobotsHealths(self, positions: List[int], healths: List[int], directions: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* survivedRobotsHealths(int* positions, int positionsSize, int* healths, int healthsSize, char * directions, int* returnSize){ + +}","public class Solution { + public IList SurvivedRobotsHealths(int[] positions, int[] healths, string directions) { + + } +}","/** + * @param {number[]} positions + * @param {number[]} healths + * @param {string} directions + * @return {number[]} + */ +var survivedRobotsHealths = function(positions, healths, directions) { + +};","# @param {Integer[]} positions +# @param {Integer[]} healths +# @param {String} directions +# @return {Integer[]} +def survived_robots_healths(positions, healths, directions) + +end","class Solution { + func survivedRobotsHealths(_ positions: [Int], _ healths: [Int], _ directions: String) -> [Int] { + + } +}","func survivedRobotsHealths(positions []int, healths []int, directions string) []int { + +}","object Solution { + def survivedRobotsHealths(positions: Array[Int], healths: Array[Int], directions: String): List[Int] = { + + } +}","class Solution { + fun survivedRobotsHealths(positions: IntArray, healths: IntArray, directions: String): List { + + } +}","impl Solution { + pub fn survived_robots_healths(positions: Vec, healths: Vec, directions: String) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $positions + * @param Integer[] $healths + * @param String $directions + * @return Integer[] + */ + function survivedRobotsHealths($positions, $healths, $directions) { + + } +}","function survivedRobotsHealths(positions: number[], healths: number[], directions: string): number[] { + +};","(define/contract (survived-robots-healths positions healths directions) + (-> (listof exact-integer?) (listof exact-integer?) string? (listof exact-integer?)) + + )","-spec survived_robots_healths(Positions :: [integer()], Healths :: [integer()], Directions :: unicode:unicode_binary()) -> [integer()]. +survived_robots_healths(Positions, Healths, Directions) -> + .","defmodule Solution do + @spec survived_robots_healths(positions :: [integer], healths :: [integer], directions :: String.t) :: [integer] + def survived_robots_healths(positions, healths, directions) do + + end +end","class Solution { + List survivedRobotsHealths(List positions, List healths, String directions) { + + } +}", +46,maximum-sum-queries,Maximum Sum Queries,2736.0,2839.0,"

You are given two 0-indexed integer arrays nums1 and nums2, each of length n, and a 1-indexed 2D array queries where queries[i] = [xi, yi].

+ +

For the ith query, find the maximum value of nums1[j] + nums2[j] among all indices j (0 <= j < n), where nums1[j] >= xi and nums2[j] >= yi, or -1 if there is no j satisfying the constraints.

+ +

Return an array answer where answer[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [4,3,1,2], nums2 = [2,4,9,5], queries = [[4,1],[1,3],[2,5]]
+Output: [6,10,7]
+Explanation: 
+For the 1st query xi = 4 and yi = 1, we can select index j = 0 since nums1[j] >= 4 and nums2[j] >= 1. The sum nums1[j] + nums2[j] is 6, and we can show that 6 is the maximum we can obtain.
+
+For the 2nd query xi = 1 and yi = 3, we can select index j = 2 since nums1[j] >= 1 and nums2[j] >= 3. The sum nums1[j] + nums2[j] is 10, and we can show that 10 is the maximum we can obtain. 
+
+For the 3rd query xi = 2 and yi = 5, we can select index j = 3 since nums1[j] >= 2 and nums2[j] >= 5. The sum nums1[j] + nums2[j] is 7, and we can show that 7 is the maximum we can obtain.
+
+Therefore, we return [6,10,7].
+
+ +

Example 2:

+ +
+Input: nums1 = [3,2,5], nums2 = [2,3,4], queries = [[4,4],[3,2],[1,1]]
+Output: [9,9,9]
+Explanation: For this example, we can use index j = 2 for all the queries since it satisfies the constraints for each query.
+
+ +

Example 3:

+ +
+Input: nums1 = [2,1], nums2 = [2,3], queries = [[3,3]]
+Output: [-1]
+Explanation: There is one query in this example with xi = 3 and yi = 3. For every index, j, either nums1[j] < xi or nums2[j] < yi. Hence, there is no solution. 
+
+ +

 

+

Constraints:

+ +
    +
  • nums1.length == nums2.length 
    • +
  • n == nums1.length 
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= 109 
    • +
  • 1 <= queries.length <= 105
    • +
  • queries[i].length == 2
    • +
  • xi == queries[i][1]
    • +
  • yi == queries[i][2]
    • +
  • 1 <= xi, yi <= 109
    • +
+",3.0,False,"class Solution { +public: + vector maximumSumQueries(vector& nums1, vector& nums2, vector>& queries) { + + } +};","class Solution { + public int[] maximumSumQueries(int[] nums1, int[] nums2, int[][] queries) { + + } +}","class Solution(object): + def maximumSumQueries(self, nums1, nums2, queries): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maximumSumQueries(int* nums1, int nums1Size, int* nums2, int nums2Size, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] MaximumSumQueries(int[] nums1, int[] nums2, int[][] queries) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[][]} queries + * @return {number[]} + */ +var maximumSumQueries = function(nums1, nums2, queries) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer[][]} queries +# @return {Integer[]} +def maximum_sum_queries(nums1, nums2, queries) + +end","class Solution { + func maximumSumQueries(_ nums1: [Int], _ nums2: [Int], _ queries: [[Int]]) -> [Int] { + + } +}","func maximumSumQueries(nums1 []int, nums2 []int, queries [][]int) []int { + +}","object Solution { + def maximumSumQueries(nums1: Array[Int], nums2: Array[Int], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun maximumSumQueries(nums1: IntArray, nums2: IntArray, queries: Array): IntArray { + + } +}","impl Solution { + pub fn maximum_sum_queries(nums1: Vec, nums2: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer[][] $queries + * @return Integer[] + */ + function maximumSumQueries($nums1, $nums2, $queries) { + + } +}","function maximumSumQueries(nums1: number[], nums2: number[], queries: number[][]): number[] { + +};","(define/contract (maximum-sum-queries nums1 nums2 queries) + (-> (listof exact-integer?) (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec maximum_sum_queries(Nums1 :: [integer()], Nums2 :: [integer()], Queries :: [[integer()]]) -> [integer()]. +maximum_sum_queries(Nums1, Nums2, Queries) -> + .","defmodule Solution do + @spec maximum_sum_queries(nums1 :: [integer], nums2 :: [integer], queries :: [[integer]]) :: [integer] + def maximum_sum_queries(nums1, nums2, queries) do + + end +end","class Solution { + List maximumSumQueries(List nums1, List nums2, List> queries) { + + } +}", +48,minimum-operations-to-make-the-integer-zero,Minimum Operations to Make the Integer Zero,2749.0,2837.0,"

You are given two integers num1 and num2.

+ +

In one operation, you can choose integer i in the range [0, 60] and subtract 2i + num2 from num1.

+ +

Return the integer denoting the minimum number of operations needed to make num1 equal to 0.

+ +

If it is impossible to make num1 equal to 0, return -1.

+ +

 

+

Example 1:

+ +
+Input: num1 = 3, num2 = -2
+Output: 3
+Explanation: We can make 3 equal to 0 with the following operations:
+- We choose i = 2 and substract 22 + (-2) from 3, 3 - (4 + (-2)) = 1.
+- We choose i = 2 and substract 22 + (-2) from 1, 1 - (4 + (-2)) = -1.
+- We choose i = 0 and substract 20 + (-2) from -1, (-1) - (1 + (-2)) = 0.
+It can be proven, that 3 is the minimum number of operations that we need to perform.
+
+ +

Example 2:

+ +
+Input: num1 = 5, num2 = 7
+Output: -1
+Explanation: It can be proven, that it is impossible to make 5 equal to 0 with the given operation.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num1 <= 109
    • +
  • -109 <= num2 <= 109
    • +
+",2.0,False,"class Solution { +public: + int makeTheIntegerZero(int num1, int num2) { + + } +};","class Solution { + public int makeTheIntegerZero(int num1, int num2) { + + } +}","class Solution(object): + def makeTheIntegerZero(self, num1, num2): + """""" + :type num1: int + :type num2: int + :rtype: int + """""" + ","class Solution: + def makeTheIntegerZero(self, num1: int, num2: int) -> int: + ","int makeTheIntegerZero(int num1, int num2){ + +}","public class Solution { + public int MakeTheIntegerZero(int num1, int num2) { + + } +}","/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +var makeTheIntegerZero = function(num1, num2) { + +};","# @param {Integer} num1 +# @param {Integer} num2 +# @return {Integer} +def make_the_integer_zero(num1, num2) + +end","class Solution { + func makeTheIntegerZero(_ num1: Int, _ num2: Int) -> Int { + + } +}","func makeTheIntegerZero(num1 int, num2 int) int { + +}","object Solution { + def makeTheIntegerZero(num1: Int, num2: Int): Int = { + + } +}","class Solution { + fun makeTheIntegerZero(num1: Int, num2: Int): Int { + + } +}","impl Solution { + pub fn make_the_integer_zero(num1: i32, num2: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num1 + * @param Integer $num2 + * @return Integer + */ + function makeTheIntegerZero($num1, $num2) { + + } +}","function makeTheIntegerZero(num1: number, num2: number): number { + +};","(define/contract (make-the-integer-zero num1 num2) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec make_the_integer_zero(Num1 :: integer(), Num2 :: integer()) -> integer(). +make_the_integer_zero(Num1, Num2) -> + .","defmodule Solution do + @spec make_the_integer_zero(num1 :: integer, num2 :: integer) :: integer + def make_the_integer_zero(num1, num2) do + + end +end","class Solution { + int makeTheIntegerZero(int num1, int num2) { + + } +}", +50,relocate-marbles,Relocate Marbles,2766.0,2834.0,"

You are given a 0-indexed integer array nums representing the initial positions of some marbles. You are also given two 0-indexed integer arrays moveFrom and moveTo of equal length.

+ +

Throughout moveFrom.length steps, you will change the positions of the marbles. On the ith step, you will move all marbles at position moveFrom[i] to position moveTo[i].

+ +

After completing all the steps, return the sorted list of occupied positions.

+ +

Notes:

+ +
    +
  • We call a position occupied if there is at least one marble in that position.
    • +
  • There may be multiple marbles in a single position.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,6,7,8], moveFrom = [1,7,2], moveTo = [2,9,5]
+Output: [5,6,8,9]
+Explanation: Initially, the marbles are at positions 1,6,7,8.
+At the i = 0th step, we move the marbles at position 1 to position 2. Then, positions 2,6,7,8 are occupied.
+At the i = 1st step, we move the marbles at position 7 to position 9. Then, positions 2,6,8,9 are occupied.
+At the i = 2nd step, we move the marbles at position 2 to position 5. Then, positions 5,6,8,9 are occupied.
+At the end, the final positions containing at least one marbles are [5,6,8,9].
+ +

Example 2:

+ +
+Input: nums = [1,1,3,3], moveFrom = [1,3], moveTo = [2,2]
+Output: [2]
+Explanation: Initially, the marbles are at positions [1,1,3,3].
+At the i = 0th step, we move all the marbles at position 1 to position 2. Then, the marbles are at positions [2,2,3,3].
+At the i = 1st step, we move all the marbles at position 3 to position 2. Then, the marbles are at positions [2,2,2,2].
+Since 2 is the only occupied position, we return [2].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= moveFrom.length <= 105
    • +
  • moveFrom.length == moveTo.length
    • +
  • 1 <= nums[i], moveFrom[i], moveTo[i] <= 109
    • +
  • The test cases are generated such that there is at least a marble in moveFrom[i] at the moment we want to apply the ith move.
    • +
+",2.0,False,"class Solution { +public: + vector relocateMarbles(vector& nums, vector& moveFrom, vector& moveTo) { + + } +};","class Solution { + public List relocateMarbles(int[] nums, int[] moveFrom, int[] moveTo) { + + } +}","class Solution(object): + def relocateMarbles(self, nums, moveFrom, moveTo): + """""" + :type nums: List[int] + :type moveFrom: List[int] + :type moveTo: List[int] + :rtype: List[int] + """""" + ","class Solution: + def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* relocateMarbles(int* nums, int numsSize, int* moveFrom, int moveFromSize, int* moveTo, int moveToSize, int* returnSize){ + +}","public class Solution { + public IList RelocateMarbles(int[] nums, int[] moveFrom, int[] moveTo) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} moveFrom + * @param {number[]} moveTo + * @return {number[]} + */ +var relocateMarbles = function(nums, moveFrom, moveTo) { + +};","# @param {Integer[]} nums +# @param {Integer[]} move_from +# @param {Integer[]} move_to +# @return {Integer[]} +def relocate_marbles(nums, move_from, move_to) + +end","class Solution { + func relocateMarbles(_ nums: [Int], _ moveFrom: [Int], _ moveTo: [Int]) -> [Int] { + + } +}","func relocateMarbles(nums []int, moveFrom []int, moveTo []int) []int { + +}","object Solution { + def relocateMarbles(nums: Array[Int], moveFrom: Array[Int], moveTo: Array[Int]): List[Int] = { + + } +}","class Solution { + fun relocateMarbles(nums: IntArray, moveFrom: IntArray, moveTo: IntArray): List { + + } +}","impl Solution { + pub fn relocate_marbles(nums: Vec, move_from: Vec, move_to: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $moveFrom + * @param Integer[] $moveTo + * @return Integer[] + */ + function relocateMarbles($nums, $moveFrom, $moveTo) { + + } +}","function relocateMarbles(nums: number[], moveFrom: number[], moveTo: number[]): number[] { + +};","(define/contract (relocate-marbles nums moveFrom moveTo) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec relocate_marbles(Nums :: [integer()], MoveFrom :: [integer()], MoveTo :: [integer()]) -> [integer()]. +relocate_marbles(Nums, MoveFrom, MoveTo) -> + .","defmodule Solution do + @spec relocate_marbles(nums :: [integer], move_from :: [integer], move_to :: [integer]) :: [integer] + def relocate_marbles(nums, move_from, move_to) do + + end +end","class Solution { + List relocateMarbles(List nums, List moveFrom, List moveTo) { + + } +}", +51,count-zero-request-servers,Count Zero Request Servers,2747.0,2833.0,"

You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [server_id, time] denotes that the server with id server_id received a request at time time.

+ +

You are also given an integer x and a 0-indexed integer array queries.

+ +

Return a 0-indexed integer array arr of length queries.length where arr[i] represents the number of servers that did not receive any requests during the time interval [queries[i] - x, queries[i]].

+ +

Note that the time intervals are inclusive.

+ +

 

+

Example 1:

+ +
+Input: n = 3, logs = [[1,3],[2,6],[1,5]], x = 5, queries = [10,11]
+Output: [1,2]
+Explanation: 
+For queries[0]: The servers with ids 1 and 2 get requests in the duration of [5, 10]. Hence, only server 3 gets zero requests.
+For queries[1]: Only the server with id 2 gets a request in duration of [6,11]. Hence, the servers with ids 1 and 3 are the only servers that do not receive any requests during that time period.
+
+
+ +

Example 2:

+ +
+Input: n = 3, logs = [[2,4],[2,1],[1,2],[3,1]], x = 2, queries = [3,4]
+Output: [0,1]
+Explanation: 
+For queries[0]: All servers get at least one request in the duration of [1, 3].
+For queries[1]: Only server with id 3 gets no request in the duration [2,4].
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 1 <= logs.length <= 105
    • +
  • 1 <= queries.length <= 105
    • +
  • logs[i].length == 2
    • +
  • 1 <= logs[i][0] <= n
    • +
  • 1 <= logs[i][1] <= 106
    • +
  • 1 <= x <= 105
    • +
  • x < queries[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + vector countServers(int n, vector>& logs, int x, vector& queries) { + + } +};","class Solution { + public int[] countServers(int n, int[][] logs, int x, int[] queries) { + + } +}","class Solution(object): + def countServers(self, n, logs, x, queries): + """""" + :type n: int + :type logs: List[List[int]] + :type x: int + :type queries: List[int] + :rtype: List[int] + """""" + ","class Solution: + def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countServers(int n, int** logs, int logsSize, int* logsColSize, int x, int* queries, int queriesSize, int* returnSize){ + +}","public class Solution { + public int[] CountServers(int n, int[][] logs, int x, int[] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} logs + * @param {number} x + * @param {number[]} queries + * @return {number[]} + */ +var countServers = function(n, logs, x, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} logs +# @param {Integer} x +# @param {Integer[]} queries +# @return {Integer[]} +def count_servers(n, logs, x, queries) + +end","class Solution { + func countServers(_ n: Int, _ logs: [[Int]], _ x: Int, _ queries: [Int]) -> [Int] { + + } +}","func countServers(n int, logs [][]int, x int, queries []int) []int { + +}","object Solution { + def countServers(n: Int, logs: Array[Array[Int]], x: Int, queries: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun countServers(n: Int, logs: Array, x: Int, queries: IntArray): IntArray { + + } +}","impl Solution { + pub fn count_servers(n: i32, logs: Vec>, x: i32, queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $logs + * @param Integer $x + * @param Integer[] $queries + * @return Integer[] + */ + function countServers($n, $logs, $x, $queries) { + + } +}","function countServers(n: number, logs: number[][], x: number, queries: number[]): number[] { + +};","(define/contract (count-servers n logs x queries) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? (listof exact-integer?) (listof exact-integer?)) + + )","-spec count_servers(N :: integer(), Logs :: [[integer()]], X :: integer(), Queries :: [integer()]) -> [integer()]. +count_servers(N, Logs, X, Queries) -> + .","defmodule Solution do + @spec count_servers(n :: integer, logs :: [[integer]], x :: integer, queries :: [integer]) :: [integer] + def count_servers(n, logs, x, queries) do + + end +end","class Solution { + List countServers(int n, List> logs, int x, List queries) { + + } +}", +53,lexicographically-smallest-string-after-substring-operation,Lexicographically Smallest String After Substring Operation,2734.0,2828.0,"

You are given a string s consisting of only lowercase English letters. In one operation, you can do the following:

+ +
    +
  • Select any non-empty substring of s, possibly the entire string, then replace each one of its characters with the previous character of the English alphabet. For example, 'b' is converted to 'a', and 'a' is converted to 'z'.
    • +
+ +

Return the lexicographically smallest string you can obtain after performing the above operation exactly once.

+ +

A substring is a contiguous sequence of characters in a string.

+A string x is lexicographically smaller than a string y of the same length if x[i] comes before y[i] in alphabetic order for the first position i such that x[i] != y[i]. +

 

+

Example 1:

+ +
+Input: s = "cbabc"
+Output: "baabc"
+Explanation: We apply the operation on the substring starting at index 0, and ending at index 1 inclusive. 
+It can be proven that the resulting string is the lexicographically smallest. 
+
+ +

Example 2:

+ +
+Input: s = "acbbc"
+Output: "abaab"
+Explanation: We apply the operation on the substring starting at index 1, and ending at index 4 inclusive. 
+It can be proven that the resulting string is the lexicographically smallest. 
+
+ +

Example 3:

+ +
+Input: s = "leetcode"
+Output: "kddsbncd"
+Explanation: We apply the operation on the entire string. 
+It can be proven that the resulting string is the lexicographically smallest. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 3 * 105
    • +
  • s consists of lowercase English letters
    • +
+",2.0,False,"class Solution { +public: + string smallestString(string s) { + + } +};","class Solution { + public String smallestString(String s) { + + } +}","class Solution(object): + def smallestString(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def smallestString(self, s: str) -> str: + ","char * smallestString(char * s){ + +}","public class Solution { + public string SmallestString(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var smallestString = function(s) { + +};","# @param {String} s +# @return {String} +def smallest_string(s) + +end","class Solution { + func smallestString(_ s: String) -> String { + + } +}","func smallestString(s string) string { + +}","object Solution { + def smallestString(s: String): String = { + + } +}","class Solution { + fun smallestString(s: String): String { + + } +}","impl Solution { + pub fn smallest_string(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function smallestString($s) { + + } +}","function smallestString(s: string): string { + +};","(define/contract (smallest-string s) + (-> string? string?) + + )","-spec smallest_string(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +smallest_string(S) -> + .","defmodule Solution do + @spec smallest_string(s :: String.t) :: String.t + def smallest_string(s) do + + end +end","class Solution { + String smallestString(String s) { + + } +}", +54,greatest-common-divisor-traversal,Greatest Common Divisor Traversal,2709.0,2827.0,"

You are given a 0-indexed integer array nums, and you are allowed to traverse between its indices. You can traverse between index i and index j, i != j, if and only if gcd(nums[i], nums[j]) > 1, where gcd is the greatest common divisor.

+ +

Your task is to determine if for every pair of indices i and j in nums, where i < j, there exists a sequence of traversals that can take us from i to j.

+ +

Return true if it is possible to traverse between all such pairs of indices, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,6]
+Output: true
+Explanation: In this example, there are 3 possible pairs of indices: (0, 1), (0, 2), and (1, 2).
+To go from index 0 to index 1, we can use the sequence of traversals 0 -> 2 -> 1, where we move from index 0 to index 2 because gcd(nums[0], nums[2]) = gcd(2, 6) = 2 > 1, and then move from index 2 to index 1 because gcd(nums[2], nums[1]) = gcd(6, 3) = 3 > 1.
+To go from index 0 to index 2, we can just go directly because gcd(nums[0], nums[2]) = gcd(2, 6) = 2 > 1. Likewise, to go from index 1 to index 2, we can just go directly because gcd(nums[1], nums[2]) = gcd(3, 6) = 3 > 1.
+
+ +

Example 2:

+ +
+Input: nums = [3,9,5]
+Output: false
+Explanation: No sequence of traversals can take us from index 0 to index 2 in this example. So, we return false.
+
+ +

Example 3:

+ +
+Input: nums = [4,3,12,8]
+Output: true
+Explanation: There are 6 possible pairs of indices to traverse between: (0, 1), (0, 2), (0, 3), (1, 2), (1, 3), and (2, 3). A valid sequence of traversals exists for each pair, so we return true.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + bool canTraverseAllPairs(vector& nums) { + + } +};","class Solution { + public boolean canTraverseAllPairs(int[] nums) { + + } +}","class Solution(object): + def canTraverseAllPairs(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def canTraverseAllPairs(self, nums: List[int]) -> bool: + ","bool canTraverseAllPairs(int* nums, int numsSize){ + +}","public class Solution { + public bool CanTraverseAllPairs(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var canTraverseAllPairs = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def can_traverse_all_pairs(nums) + +end","class Solution { + func canTraverseAllPairs(_ nums: [Int]) -> Bool { + + } +}","func canTraverseAllPairs(nums []int) bool { + +}","object Solution { + def canTraverseAllPairs(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun canTraverseAllPairs(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn can_traverse_all_pairs(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function canTraverseAllPairs($nums) { + + } +}","function canTraverseAllPairs(nums: number[]): boolean { + +};","(define/contract (can-traverse-all-pairs nums) + (-> (listof exact-integer?) boolean?) + + )","-spec can_traverse_all_pairs(Nums :: [integer()]) -> boolean(). +can_traverse_all_pairs(Nums) -> + .","defmodule Solution do + @spec can_traverse_all_pairs(nums :: [integer]) :: boolean + def can_traverse_all_pairs(nums) do + + end +end","class Solution { + bool canTraverseAllPairs(List nums) { + + } +}", +55,find-a-good-subset-of-the-matrix,Find a Good Subset of the Matrix,2732.0,2826.0,"

You are given a 0-indexed m x n binary matrix grid.

+ +

Let us call a non-empty subset of rows good if the sum of each column of the subset is at most half of the length of the subset.

+ +

More formally, if the length of the chosen subset of rows is k, then the sum of each column should be at most floor(k / 2).

+ +

Return an integer array that contains row indices of a good subset sorted in ascending order.

+ +

If there are multiple good subsets, you can return any of them. If there are no good subsets, return an empty array.

+ +

A subset of rows of the matrix grid is any matrix that can be obtained by deleting some (possibly none or all) rows from grid.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,1,0],[0,0,0,1],[1,1,1,1]]
+Output: [0,1]
+Explanation: We can choose the 0th and 1st rows to create a good subset of rows.
+The length of the chosen subset is 2.
+- The sum of the 0th column is 0 + 0 = 0, which is at most half of the length of the subset.
+- The sum of the 1st column is 1 + 0 = 1, which is at most half of the length of the subset.
+- The sum of the 2nd column is 1 + 0 = 1, which is at most half of the length of the subset.
+- The sum of the 3rd column is 0 + 1 = 1, which is at most half of the length of the subset.
+
+ +

Example 2:

+ +
+Input: grid = [[0]]
+Output: [0]
+Explanation: We can choose the 0th row to create a good subset of rows.
+The length of the chosen subset is 1.
+- The sum of the 0th column is 0, which is at most half of the length of the subset.
+
+ +

Example 3:

+ +
+Input: grid = [[1,1,1],[1,1,1]]
+Output: []
+Explanation: It is impossible to choose any subset of rows to create a good subset.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m <= 104
    • +
  • 1 <= n <= 5
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",3.0,False,"class Solution { +public: + vector goodSubsetofBinaryMatrix(vector>& grid) { + + } +};","class Solution { + public List goodSubsetofBinaryMatrix(int[][] grid) { + + } +}","class Solution(object): + def goodSubsetofBinaryMatrix(self, grid): + """""" + :type grid: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def goodSubsetofBinaryMatrix(self, grid: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* goodSubsetofBinaryMatrix(int** grid, int gridSize, int* gridColSize, int* returnSize){ + +}","public class Solution { + public IList GoodSubsetofBinaryMatrix(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number[]} + */ +var goodSubsetofBinaryMatrix = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer[]} +def good_subsetof_binary_matrix(grid) + +end","class Solution { + func goodSubsetofBinaryMatrix(_ grid: [[Int]]) -> [Int] { + + } +}","func goodSubsetofBinaryMatrix(grid [][]int) []int { + +}","object Solution { + def goodSubsetofBinaryMatrix(grid: Array[Array[Int]]): List[Int] = { + + } +}","class Solution { + fun goodSubsetofBinaryMatrix(grid: Array): List { + + } +}","impl Solution { + pub fn good_subsetof_binary_matrix(grid: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer[] + */ + function goodSubsetofBinaryMatrix($grid) { + + } +}","function goodSubsetofBinaryMatrix(grid: number[][]): number[] { + +};","(define/contract (good-subsetof-binary-matrix grid) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec good_subsetof_binary_matrix(Grid :: [[integer()]]) -> [integer()]. +good_subsetof_binary_matrix(Grid) -> + .","defmodule Solution do + @spec good_subsetof_binary_matrix(grid :: [[integer]]) :: [integer] + def good_subsetof_binary_matrix(grid) do + + end +end","class Solution { + List goodSubsetofBinaryMatrix(List> grid) { + + } +}", +56,minimize-string-length,Minimize String Length,2716.0,2825.0,"

Given a 0-indexed string s, repeatedly perform the following operation any number of times:

+ +
    +
  • Choose an index i in the string, and let c be the character in position i. Delete the closest occurrence of c to the left of i (if any) and the closest occurrence of c to the right of i (if any).
    • +
+ +

Your task is to minimize the length of s by performing the above operation any number of times.

+ +

Return an integer denoting the length of the minimized string.

+ +

 

+

Example 1:

+ +
+Input: s = "aaabc"
+Output: 3
+Explanation: In this example, s is "aaabc". We can start by selecting the character 'a' at index 1. We then remove the closest 'a' to the left of index 1, which is at index 0, and the closest 'a' to the right of index 1, which is at index 2. After this operation, the string becomes "abc". Any further operation we perform on the string will leave it unchanged. Therefore, the length of the minimized string is 3.
+ +

Example 2:

+ +
+Input: s = "cbbd"
+Output: 3
+Explanation: For this we can start with character 'b' at index 1. There is no occurrence of 'b' to the left of index 1, but there is one to the right at index 2, so we delete the 'b' at index 2. The string becomes "cbd" and further operations will leave it unchanged. Hence, the minimized length is 3. 
+
+ +

Example 3:

+ +
+Input: s = "dddaaa"
+Output: 2
+Explanation: For this, we can start with the character 'd' at index 1. The closest occurrence of a 'd' to its left is at index 0, and the closest occurrence of a 'd' to its right is at index 2. We delete both index 0 and 2, so the string becomes "daaa". In the new string, we can select the character 'a' at index 2. The closest occurrence of an 'a' to its left is at index 1, and the closest occurrence of an 'a' to its right is at index 3. We delete both of them, and the string becomes "da". We cannot minimize this further, so the minimized length is 2.
+
+ +
 
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 100
    • +
  • s contains only lowercase English letters
    • +
+",1.0,False,"class Solution { +public: + int minimizedStringLength(string s) { + + } +};","class Solution { + public int minimizedStringLength(String s) { + + } +}","class Solution(object): + def minimizedStringLength(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minimizedStringLength(self, s: str) -> int: + ","int minimizedStringLength(char * s){ + +}","public class Solution { + public int MinimizedStringLength(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minimizedStringLength = function(s) { + +};","# @param {String} s +# @return {Integer} +def minimized_string_length(s) + +end","class Solution { + func minimizedStringLength(_ s: String) -> Int { + + } +}","func minimizedStringLength(s string) int { + +}","object Solution { + def minimizedStringLength(s: String): Int = { + + } +}","class Solution { + fun minimizedStringLength(s: String): Int { + + } +}","impl Solution { + pub fn minimized_string_length(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minimizedStringLength($s) { + + } +}","function minimizedStringLength(s: string): number { + +};","(define/contract (minimized-string-length s) + (-> string? exact-integer?) + + )","-spec minimized_string_length(S :: unicode:unicode_binary()) -> integer(). +minimized_string_length(S) -> + .","defmodule Solution do + @spec minimized_string_length(s :: String.t) :: integer + def minimized_string_length(s) do + + end +end","class Solution { + int minimizedStringLength(String s) { + + } +}", +57,check-if-the-number-is-fascinating,Check if The Number is Fascinating,2729.0,2824.0,"

You are given an integer n that consists of exactly 3 digits.

+ +

We call the number n fascinating if, after the following modification, the resulting number contains all the digits from 1 to 9 exactly once and does not contain any 0's:

+ +
    +
  • Concatenate n with the numbers 2 * n and 3 * n.
    • +
+ +

Return true if n is fascinating, or false otherwise.

+ +

Concatenating two numbers means joining them together. For example, the concatenation of 121 and 371 is 121371.

+ +

 

+

Example 1:

+ +
+Input: n = 192
+Output: true
+Explanation: We concatenate the numbers n = 192 and 2 * n = 384 and 3 * n = 576. The resulting number is 192384576. This number contains all the digits from 1 to 9 exactly once.
+
+ +

Example 2:

+ +
+Input: n = 100
+Output: false
+Explanation: We concatenate the numbers n = 100 and 2 * n = 200 and 3 * n = 300. The resulting number is 100200300. This number does not satisfy any of the conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • 100 <= n <= 999
    • +
+",1.0,False,"class Solution { +public: + bool isFascinating(int n) { + + } +};","class Solution { + public boolean isFascinating(int n) { + + } +}","class Solution(object): + def isFascinating(self, n): + """""" + :type n: int + :rtype: bool + """""" + ","class Solution: + def isFascinating(self, n: int) -> bool: + ","bool isFascinating(int n){ + +}","public class Solution { + public bool IsFascinating(int n) { + + } +}","/** + * @param {number} n + * @return {boolean} + */ +var isFascinating = function(n) { + +};","# @param {Integer} n +# @return {Boolean} +def is_fascinating(n) + +end","class Solution { + func isFascinating(_ n: Int) -> Bool { + + } +}","func isFascinating(n int) bool { + +}","object Solution { + def isFascinating(n: Int): Boolean = { + + } +}","class Solution { + fun isFascinating(n: Int): Boolean { + + } +}","impl Solution { + pub fn is_fascinating(n: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Boolean + */ + function isFascinating($n) { + + } +}","function isFascinating(n: number): boolean { + +};","(define/contract (is-fascinating n) + (-> exact-integer? boolean?) + + )","-spec is_fascinating(N :: integer()) -> boolean(). +is_fascinating(N) -> + .","defmodule Solution do + @spec is_fascinating(n :: integer) :: boolean + def is_fascinating(n) do + + end +end","class Solution { + bool isFascinating(int n) { + + } +}", +59,maximum-strictly-increasing-cells-in-a-matrix,Maximum Strictly Increasing Cells in a Matrix,2713.0,2818.0,"

Given a 1-indexed m x n integer matrix mat, you can select any cell in the matrix as your starting cell.

+ +

From the starting cell, you can move to any other cell in the same row or column, but only if the value of the destination cell is strictly greater than the value of the current cell. You can repeat this process as many times as possible, moving from cell to cell until you can no longer make any moves.

+ +

Your task is to find the maximum number of cells that you can visit in the matrix by starting from some cell.

+ +

Return an integer denoting the maximum number of cells that can be visited.

+ +

 

+

Example 1:

+ +

+ +
+Input: mat = [[3,1],[3,4]]
+Output: 2
+Explanation: The image shows how we can visit 2 cells starting from row 1, column 2. It can be shown that we cannot visit more than 2 cells no matter where we start from, so the answer is 2. 
+
+ +

Example 2:

+ +

+ +
+Input: mat = [[1,1],[1,1]]
+Output: 1
+Explanation: Since the cells must be strictly increasing, we can only visit one cell in this example. 
+
+ +

Example 3:

+ +

+ +
+Input: mat = [[3,1,6],[-9,5,7]]
+Output: 4
+Explanation: The image above shows how we can visit 4 cells starting from row 2, column 1. It can be shown that we cannot visit more than 4 cells no matter where we start from, so the answer is 4. 
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length 
    • +
  • n == mat[i].length 
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 105
    • +
  • -105 <= mat[i][j] <= 105
    • +
+",3.0,False,"class Solution { +public: + int maxIncreasingCells(vector>& mat) { + + } +};","class Solution { + public int maxIncreasingCells(int[][] mat) { + + } +}","class Solution(object): + def maxIncreasingCells(self, mat): + """""" + :type mat: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxIncreasingCells(self, mat: List[List[int]]) -> int: + ","int maxIncreasingCells(int** mat, int matSize, int* matColSize){ + +}","public class Solution { + public int MaxIncreasingCells(int[][] mat) { + + } +}","/** + * @param {number[][]} mat + * @return {number} + */ +var maxIncreasingCells = function(mat) { + +};","# @param {Integer[][]} mat +# @return {Integer} +def max_increasing_cells(mat) + +end","class Solution { + func maxIncreasingCells(_ mat: [[Int]]) -> Int { + + } +}","func maxIncreasingCells(mat [][]int) int { + +}","object Solution { + def maxIncreasingCells(mat: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxIncreasingCells(mat: Array): Int { + + } +}","impl Solution { + pub fn max_increasing_cells(mat: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @return Integer + */ + function maxIncreasingCells($mat) { + + } +}","function maxIncreasingCells(mat: number[][]): number { + +};","(define/contract (max-increasing-cells mat) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_increasing_cells(Mat :: [[integer()]]) -> integer(). +max_increasing_cells(Mat) -> + .","defmodule Solution do + @spec max_increasing_cells(mat :: [[integer]]) :: integer + def max_increasing_cells(mat) do + + end +end","class Solution { + int maxIncreasingCells(List> mat) { + + } +}", +60,minimum-cost-to-make-all-characters-equal,Minimum Cost to Make All Characters Equal,2712.0,2817.0,"

You are given a 0-indexed binary string s of length n on which you can apply two types of operations:

+ +
    +
  • Choose an index i and invert all characters from index 0 to index i (both inclusive), with a cost of i + 1
    • +
  • Choose an index i and invert all characters from index i to index n - 1 (both inclusive), with a cost of n - i
    • +
+ +

Return the minimum cost to make all characters of the string equal.

+ +

Invert a character means if its value is '0' it becomes '1' and vice-versa.

+ +

 

+

Example 1:

+ +
+Input: s = "0011"
+Output: 2
+Explanation: Apply the second operation with i = 2 to obtain s = "0000" for a cost of 2. It can be shown that 2 is the minimum cost to make all characters equal.
+
+ +

Example 2:

+ +
+Input: s = "010101"
+Output: 9
+Explanation: Apply the first operation with i = 2 to obtain s = "101101" for a cost of 3.
+Apply the first operation with i = 1 to obtain s = "011101" for a cost of 2. 
+Apply the first operation with i = 0 to obtain s = "111101" for a cost of 1. 
+Apply the second operation with i = 4 to obtain s = "111110" for a cost of 2.
+Apply the second operation with i = 5 to obtain s = "111111" for a cost of 1. 
+The total cost to make all characters equal is 9. It can be shown that 9 is the minimum cost to make all characters equal.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length == n <= 105
    • +
  • s[i] is either '0' or '1'
    • +
+",2.0,False,"class Solution { +public: + long long minimumCost(string s) { + + } +};","class Solution { + public long minimumCost(String s) { + + } +}","class Solution(object): + def minimumCost(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minimumCost(self, s: str) -> int: + ","long long minimumCost(char * s){ + +}","public class Solution { + public long MinimumCost(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minimumCost = function(s) { + +};","# @param {String} s +# @return {Integer} +def minimum_cost(s) + +end","class Solution { + func minimumCost(_ s: String) -> Int { + + } +}","func minimumCost(s string) int64 { + +}","object Solution { + def minimumCost(s: String): Long = { + + } +}","class Solution { + fun minimumCost(s: String): Long { + + } +}","impl Solution { + pub fn minimum_cost(s: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minimumCost($s) { + + } +}","function minimumCost(s: string): number { + +};","(define/contract (minimum-cost s) + (-> string? exact-integer?) + + )","-spec minimum_cost(S :: unicode:unicode_binary()) -> integer(). +minimum_cost(S) -> + .","defmodule Solution do + @spec minimum_cost(s :: String.t) :: integer + def minimum_cost(s) do + + end +end","class Solution { + int minimumCost(String s) { + + } +}", +61,lexicographically-smallest-palindrome,Lexicographically Smallest Palindrome,2697.0,2816.0,"

You are given a string s consisting of lowercase English letters, and you are allowed to perform operations on it. In one operation, you can replace a character in s with another lowercase English letter.

+ +

Your task is to make s a palindrome with the minimum number of operations possible. If there are multiple palindromes that can be made using the minimum number of operations, make the lexicographically smallest one.

+ +

A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b.

+ +

Return the resulting palindrome string.

+ +

 

+

Example 1:

+ +
+Input: s = "egcfe"
+Output: "efcfe"
+Explanation: The minimum number of operations to make "egcfe" a palindrome is 1, and the lexicographically smallest palindrome string we can get by modifying one character is "efcfe", by changing 'g'.
+
+ +

Example 2:

+ +
+Input: s = "abcd"
+Output: "abba"
+Explanation: The minimum number of operations to make "abcd" a palindrome is 2, and the lexicographically smallest palindrome string we can get by modifying two characters is "abba".
+
+ +

Example 3:

+ +
+Input: s = "seven"
+Output: "neven"
+Explanation: The minimum number of operations to make "seven" a palindrome is 1, and the lexicographically smallest palindrome string we can get by modifying one character is "neven".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s consists of only lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + string makeSmallestPalindrome(string s) { + + } +};","class Solution { + public String makeSmallestPalindrome(String s) { + + } +}","class Solution(object): + def makeSmallestPalindrome(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def makeSmallestPalindrome(self, s: str) -> str: + ","char * makeSmallestPalindrome(char * s){ + +}","public class Solution { + public string MakeSmallestPalindrome(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var makeSmallestPalindrome = function(s) { + +};","# @param {String} s +# @return {String} +def make_smallest_palindrome(s) + +end","class Solution { + func makeSmallestPalindrome(_ s: String) -> String { + + } +}","func makeSmallestPalindrome(s string) string { + +}","object Solution { + def makeSmallestPalindrome(s: String): String = { + + } +}","class Solution { + fun makeSmallestPalindrome(s: String): String { + + } +}","impl Solution { + pub fn make_smallest_palindrome(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function makeSmallestPalindrome($s) { + + } +}","function makeSmallestPalindrome(s: string): string { + +};","(define/contract (make-smallest-palindrome s) + (-> string? string?) + + )","-spec make_smallest_palindrome(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +make_smallest_palindrome(S) -> + .","defmodule Solution do + @spec make_smallest_palindrome(s :: String.t) :: String.t + def make_smallest_palindrome(s) do + + end +end","class Solution { + String makeSmallestPalindrome(String s) { + + } +}", +64,painting-the-walls,Painting the Walls,2742.0,2808.0,"

You are given two 0-indexed integer arrays, cost and time, of size n representing the costs and the time taken to paint n different walls respectively. There are two painters available:

+ +
    +
  • A paid painter that paints the ith wall in time[i] units of time and takes cost[i] units of money.
    • +
  • A free painter that paints any wall in 1 unit of time at a cost of 0. But the free painter can only be used if the paid painter is already occupied.
    • +
+ +

Return the minimum amount of money required to paint the n walls.

+ +

 

+

Example 1:

+ +
+Input: cost = [1,2,3,2], time = [1,2,3,2]
+Output: 3
+Explanation: The walls at index 0 and 1 will be painted by the paid painter, and it will take 3 units of time; meanwhile, the free painter will paint the walls at index 2 and 3, free of cost in 2 units of time. Thus, the total cost is 1 + 2 = 3.
+
+ +

Example 2:

+ +
+Input: cost = [2,3,4,2], time = [1,1,1,1]
+Output: 4
+Explanation: The walls at index 0 and 3 will be painted by the paid painter, and it will take 2 units of time; meanwhile, the free painter will paint the walls at index 1 and 2, free of cost in 2 units of time. Thus, the total cost is 2 + 2 = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= cost.length <= 500
    • +
  • cost.length == time.length
    • +
  • 1 <= cost[i] <= 106
    • +
  • 1 <= time[i] <= 500
    • +
+",3.0,False,"class Solution { +public: + int paintWalls(vector& cost, vector& time) { + + } +};","class Solution { + public int paintWalls(int[] cost, int[] time) { + + } +}","class Solution(object): + def paintWalls(self, cost, time): + """""" + :type cost: List[int] + :type time: List[int] + :rtype: int + """""" + ","class Solution: + def paintWalls(self, cost: List[int], time: List[int]) -> int: + ","int paintWalls(int* cost, int costSize, int* time, int timeSize){ + +}","public class Solution { + public int PaintWalls(int[] cost, int[] time) { + + } +}","/** + * @param {number[]} cost + * @param {number[]} time + * @return {number} + */ +var paintWalls = function(cost, time) { + +};","# @param {Integer[]} cost +# @param {Integer[]} time +# @return {Integer} +def paint_walls(cost, time) + +end","class Solution { + func paintWalls(_ cost: [Int], _ time: [Int]) -> Int { + + } +}","func paintWalls(cost []int, time []int) int { + +}","object Solution { + def paintWalls(cost: Array[Int], time: Array[Int]): Int = { + + } +}","class Solution { + fun paintWalls(cost: IntArray, time: IntArray): Int { + + } +}","impl Solution { + pub fn paint_walls(cost: Vec, time: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $cost + * @param Integer[] $time + * @return Integer + */ + function paintWalls($cost, $time) { + + } +}","function paintWalls(cost: number[], time: number[]): number { + +};","(define/contract (paint-walls cost time) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec paint_walls(Cost :: [integer()], Time :: [integer()]) -> integer(). +paint_walls(Cost, Time) -> + .","defmodule Solution do + @spec paint_walls(cost :: [integer], time :: [integer]) :: integer + def paint_walls(cost, time) do + + end +end","class Solution { + int paintWalls(List cost, List time) { + + } +}", +65,modify-graph-edge-weights,Modify Graph Edge Weights,2699.0,2803.0,"

You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array edges where edges[i] = [ai, bi, wi] indicates that there is an edge between nodes ai and bi with weight wi.

+ +

Some edges have a weight of -1 (wi = -1), while others have a positive weight (wi > 0).

+ +

Your task is to modify all edges with a weight of -1 by assigning them positive integer values in the range [1, 2 * 109] so that the shortest distance between the nodes source and destination becomes equal to an integer target. If there are multiple modifications that make the shortest distance between source and destination equal to target, any of them will be considered correct.

+ +

Return an array containing all edges (even unmodified ones) in any order if it is possible to make the shortest distance from source to destination equal to target, or an empty array if it's impossible.

+ +

Note: You are not allowed to modify the weights of edges with initial positive weights.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 5, edges = [[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]], source = 0, destination = 1, target = 5
+Output: [[4,1,1],[2,0,1],[0,3,3],[4,3,1]]
+Explanation: The graph above shows a possible modification to the edges, making the distance from 0 to 1 equal to 5.
+
+ +

Example 2:

+ +

+ +
+Input: n = 3, edges = [[0,1,-1],[0,2,5]], source = 0, destination = 2, target = 6
+Output: []
+Explanation: The graph above contains the initial edges. It is not possible to make the distance from 0 to 2 equal to 6 by modifying the edge with weight -1. So, an empty array is returned.
+
+ +

Example 3:

+ +

+ +
+Input: n = 4, edges = [[1,0,4],[1,2,3],[2,3,5],[0,3,-1]], source = 0, destination = 2, target = 6
+Output: [[1,0,4],[1,2,3],[2,3,5],[0,3,1]]
+Explanation: The graph above shows a modified graph having the shortest distance from 0 to 2 as 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 1 <= edges.length <= n * (n - 1) / 2
    • +
  • edges[i].length == 3
    • +
  • 0 <= ai, bi < n
    • +
  • wi = -1 or 1 <= wi <= 107
    • +
  • ai != bi
    • +
  • 0 <= source, destination < n
    • +
  • source != destination
    • +
  • 1 <= target <= 109
    • +
  • The graph is connected, and there are no self-loops or repeated edges
    • +
+",3.0,False,"class Solution { +public: + vector> modifiedGraphEdges(int n, vector>& edges, int source, int destination, int target) { + + } +};","class Solution { + public int[][] modifiedGraphEdges(int n, int[][] edges, int source, int destination, int target) { + + } +}","class Solution(object): + def modifiedGraphEdges(self, n, edges, source, destination, target): + """""" + :type n: int + :type edges: List[List[int]] + :type source: int + :type destination: int + :type target: int + :rtype: List[List[int]] + """""" + ","class Solution: + def modifiedGraphEdges(self, n: int, edges: List[List[int]], source: int, destination: int, target: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** modifiedGraphEdges(int n, int** edges, int edgesSize, int* edgesColSize, int source, int destination, int target, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] ModifiedGraphEdges(int n, int[][] edges, int source, int destination, int target) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} source + * @param {number} destination + * @param {number} target + * @return {number[][]} + */ +var modifiedGraphEdges = function(n, edges, source, destination, target) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} source +# @param {Integer} destination +# @param {Integer} target +# @return {Integer[][]} +def modified_graph_edges(n, edges, source, destination, target) + +end","class Solution { + func modifiedGraphEdges(_ n: Int, _ edges: [[Int]], _ source: Int, _ destination: Int, _ target: Int) -> [[Int]] { + + } +}","func modifiedGraphEdges(n int, edges [][]int, source int, destination int, target int) [][]int { + +}","object Solution { + def modifiedGraphEdges(n: Int, edges: Array[Array[Int]], source: Int, destination: Int, target: Int): Array[Array[Int]] = { + + } +}","class Solution { + fun modifiedGraphEdges(n: Int, edges: Array, source: Int, destination: Int, target: Int): Array { + + } +}","impl Solution { + pub fn modified_graph_edges(n: i32, edges: Vec>, source: i32, destination: i32, target: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $source + * @param Integer $destination + * @param Integer $target + * @return Integer[][] + */ + function modifiedGraphEdges($n, $edges, $source, $destination, $target) { + + } +}","function modifiedGraphEdges(n: number, edges: number[][], source: number, destination: number, target: number): number[][] { + +};","(define/contract (modified-graph-edges n edges source destination target) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer? (listof (listof exact-integer?))) + + )","-spec modified_graph_edges(N :: integer(), Edges :: [[integer()]], Source :: integer(), Destination :: integer(), Target :: integer()) -> [[integer()]]. +modified_graph_edges(N, Edges, Source, Destination, Target) -> + .","defmodule Solution do + @spec modified_graph_edges(n :: integer, edges :: [[integer]], source :: integer, destination :: integer, target :: integer) :: [[integer]] + def modified_graph_edges(n, edges, source, destination, target) do + + end +end","class Solution { + List> modifiedGraphEdges(int n, List> edges, int source, int destination, int target) { + + } +}", +66,find-the-punishment-number-of-an-integer,Find the Punishment Number of an Integer,2698.0,2802.0,"

Given a positive integer n, return the punishment number of n.

+ +

The punishment number of n is defined as the sum of the squares of all integers i such that:

+ +
    +
  • 1 <= i <= n
    • +
  • The decimal representation of i * i can be partitioned into contiguous substrings such that the sum of the integer values of these substrings equals i.
    • +
+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 182
+Explanation: There are exactly 3 integers i that satisfy the conditions in the statement:
+- 1 since 1 * 1 = 1
+- 9 since 9 * 9 = 81 and 81 can be partitioned into 8 + 1.
+- 10 since 10 * 10 = 100 and 100 can be partitioned into 10 + 0.
+Hence, the punishment number of 10 is 1 + 81 + 100 = 182
+
+ +

Example 2:

+ +
+Input: n = 37
+Output: 1478
+Explanation: There are exactly 4 integers i that satisfy the conditions in the statement:
+- 1 since 1 * 1 = 1. 
+- 9 since 9 * 9 = 81 and 81 can be partitioned into 8 + 1. 
+- 10 since 10 * 10 = 100 and 100 can be partitioned into 10 + 0. 
+- 36 since 36 * 36 = 1296 and 1296 can be partitioned into 1 + 29 + 6.
+Hence, the punishment number of 37 is 1 + 81 + 100 + 1296 = 1478
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",2.0,False,"class Solution { +public: + int punishmentNumber(int n) { + + } +};","class Solution { + public int punishmentNumber(int n) { + + } +}","class Solution(object): + def punishmentNumber(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def punishmentNumber(self, n: int) -> int: + ","int punishmentNumber(int n){ + +}","public class Solution { + public int PunishmentNumber(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var punishmentNumber = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def punishment_number(n) + +end","class Solution { + func punishmentNumber(_ n: Int) -> Int { + + } +}","func punishmentNumber(n int) int { + +}","object Solution { + def punishmentNumber(n: Int): Int = { + + } +}","class Solution { + fun punishmentNumber(n: Int): Int { + + } +}","impl Solution { + pub fn punishment_number(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function punishmentNumber($n) { + + } +}","function punishmentNumber(n: number): number { + +};","(define/contract (punishment-number n) + (-> exact-integer? exact-integer?) + + )","-spec punishment_number(N :: integer()) -> integer(). +punishment_number(N) -> + .","defmodule Solution do + @spec punishment_number(n :: integer) :: integer + def punishment_number(n) do + + end +end","class Solution { + int punishmentNumber(int n) { + + } +}", +74,find-the-longest-semi-repetitive-substring,Find the Longest Semi-Repetitive Substring,2730.0,2786.0,"

You are given a 0-indexed string s that consists of digits from 0 to 9.

+ +

A string t is called a semi-repetitive if there is at most one consecutive pair of the same digits inside t. For example, 0010, 002020, 0123, 2002, and 54944 are semi-repetitive while 00101022, and 1101234883 are not.

+ +

Return the length of the longest semi-repetitive substring inside s.

+ +

A substring is a contiguous non-empty sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "52233"
+Output: 4
+Explanation: The longest semi-repetitive substring is "5223", which starts at i = 0 and ends at j = 3. 
+
+ +

Example 2:

+ +
+Input: s = "5494"
+Output: 4
+Explanation: s is a semi-reptitive string, so the answer is 4.
+
+ +

Example 3:

+ +
+Input: s = "1111111"
+Output: 2
+Explanation: The longest semi-repetitive substring is "11", which starts at i = 0 and ends at j = 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 50
    • +
  • '0' <= s[i] <= '9'
    • +
+",2.0,False,"class Solution { +public: + int longestSemiRepetitiveSubstring(string s) { + + } +};","class Solution { + public int longestSemiRepetitiveSubstring(String s) { + + } +}","class Solution(object): + def longestSemiRepetitiveSubstring(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def longestSemiRepetitiveSubstring(self, s: str) -> int: + ","int longestSemiRepetitiveSubstring(char * s){ + +}","public class Solution { + public int LongestSemiRepetitiveSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var longestSemiRepetitiveSubstring = function(s) { + +};","# @param {String} s +# @return {Integer} +def longest_semi_repetitive_substring(s) + +end","class Solution { + func longestSemiRepetitiveSubstring(_ s: String) -> Int { + + } +}","func longestSemiRepetitiveSubstring(s string) int { + +}","object Solution { + def longestSemiRepetitiveSubstring(s: String): Int = { + + } +}","class Solution { + fun longestSemiRepetitiveSubstring(s: String): Int { + + } +}","impl Solution { + pub fn longest_semi_repetitive_substring(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function longestSemiRepetitiveSubstring($s) { + + } +}","function longestSemiRepetitiveSubstring(s: string): number { + +};","(define/contract (longest-semi-repetitive-substring s) + (-> string? exact-integer?) + + )","-spec longest_semi_repetitive_substring(S :: unicode:unicode_binary()) -> integer(). +longest_semi_repetitive_substring(S) -> + .","defmodule Solution do + @spec longest_semi_repetitive_substring(s :: String.t) :: integer + def longest_semi_repetitive_substring(s) do + + end +end","class Solution { + int longestSemiRepetitiveSubstring(String s) { + + } +}", +76,power-of-heroes,Power of Heroes,2681.0,2784.0,"

You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:

+ +
    +
  • Let i0, i1, ... ,ik be the indices of the heroes in a group. Then, the power of this group is max(nums[i0], nums[i1], ... ,nums[ik])2 * min(nums[i0], nums[i1], ... ,nums[ik]).
    • +
+ +

Return the sum of the power of all non-empty groups of heroes possible. Since the sum could be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,4]
+Output: 141
+Explanation: 
+1st group: [2] has power = 22 * 2 = 8.
+2nd group: [1] has power = 12 * 1 = 1. 
+3rd group: [4] has power = 42 * 4 = 64. 
+4th group: [2,1] has power = 22 * 1 = 4. 
+5th group: [2,4] has power = 42 * 2 = 32. 
+6th group: [1,4] has power = 42 * 1 = 16. 
+​​​​​​​7th group: [2,1,4] has power = 42​​​​​​​ * 1 = 16. 
+The sum of powers of all groups is 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141.
+
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1]
+Output: 7
+Explanation: A total of 7 groups are possible, and the power of each group will be 1. Therefore, the sum of the powers of all groups is 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int sumOfPower(vector& nums) { + + } +};","class Solution { + public int sumOfPower(int[] nums) { + + } +}","class Solution(object): + def sumOfPower(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumOfPower(self, nums: List[int]) -> int: + ","int sumOfPower(int* nums, int numsSize){ + +}","public class Solution { + public int SumOfPower(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumOfPower = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_of_power(nums) + +end","class Solution { + func sumOfPower(_ nums: [Int]) -> Int { + + } +}","func sumOfPower(nums []int) int { + +}","object Solution { + def sumOfPower(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumOfPower(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_of_power(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumOfPower($nums) { + + } +}","function sumOfPower(nums: number[]): number { + +};","(define/contract (sum-of-power nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_of_power(Nums :: [integer()]) -> integer(). +sum_of_power(Nums) -> + .","defmodule Solution do + @spec sum_of_power(nums :: [integer]) :: integer + def sum_of_power(nums) do + + end +end","class Solution { + int sumOfPower(List nums) { + + } +}", +80,find-the-distinct-difference-array,Find the Distinct Difference Array,2670.0,2777.0,"

You are given a 0-indexed array nums of length n.

+ +

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

+ +

Return the distinct difference array of nums.

+ +

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5]
+Output: [-3,-1,1,3,5]
+Explanation: For index i = 0, there is 1 element in the prefix and 4 distinct elements in the suffix. Thus, diff[0] = 1 - 4 = -3.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 3 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 3 - 2 = 1.
+For index i = 3, there are 4 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 4 - 1 = 3.
+For index i = 4, there are 5 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 5 - 0 = 5.
+
+ +

Example 2:

+ +
+Input: nums = [3,2,3,4,2]
+Output: [-2,-1,0,2,3]
+Explanation: For index i = 0, there is 1 element in the prefix and 3 distinct elements in the suffix. Thus, diff[0] = 1 - 3 = -2.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 2 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 2 - 2 = 0.
+For index i = 3, there are 3 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 3 - 1 = 2.
+For index i = 4, there are 3 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 3 - 0 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == nums.length <= 50
    • +
  • 1 <= nums[i] <= 50
    • +
+",1.0,False,"class Solution { +public: + vector distinctDifferenceArray(vector& nums) { + + } +};","class Solution { + public int[] distinctDifferenceArray(int[] nums) { + + } +}","class Solution(object): + def distinctDifferenceArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def distinctDifferenceArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* distinctDifferenceArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] DistinctDifferenceArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var distinctDifferenceArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def distinct_difference_array(nums) + +end","class Solution { + func distinctDifferenceArray(_ nums: [Int]) -> [Int] { + + } +}","func distinctDifferenceArray(nums []int) []int { + +}","object Solution { + def distinctDifferenceArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun distinctDifferenceArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn distinct_difference_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function distinctDifferenceArray($nums) { + + } +}","function distinctDifferenceArray(nums: number[]): number[] { + +};","(define/contract (distinct-difference-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec distinct_difference_array(Nums :: [integer()]) -> [integer()]. +distinct_difference_array(Nums) -> + .","defmodule Solution do + @spec distinct_difference_array(nums :: [integer]) :: [integer] + def distinct_difference_array(nums) do + + end +end","class Solution { + List distinctDifferenceArray(List nums) { + + } +}", +82,find-the-prefix-common-array-of-two-arrays,Find the Prefix Common Array of Two Arrays,2657.0,2766.0,"

You are given two 0-indexed integer permutations A and B of length n.

+ +

A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present at or before the index i in both A and B.

+ +

Return the prefix common array of A and B.

+ +

A sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.

+ +

 

+

Example 1:

+ +
+Input: A = [1,3,2,4], B = [3,1,2,4]
+Output: [0,2,3,4]
+Explanation: At i = 0: no number is common, so C[0] = 0.
+At i = 1: 1 and 3 are common in A and B, so C[1] = 2.
+At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.
+At i = 3: 1, 2, 3, and 4 are common in A and B, so C[3] = 4.
+
+ +

Example 2:

+ +
+Input: A = [2,3,1], B = [3,1,2]
+Output: [0,1,3]
+Explanation: At i = 0: no number is common, so C[0] = 0.
+At i = 1: only 3 is common in A and B, so C[1] = 1.
+At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= A.length == B.length == n <= 50
    • +
  • 1 <= A[i], B[i] <= n
    • +
  • It is guaranteed that A and B are both a permutation of n integers.
    • +
+",2.0,False,"class Solution { +public: + vector findThePrefixCommonArray(vector& A, vector& B) { + + } +};","class Solution { + public int[] findThePrefixCommonArray(int[] A, int[] B) { + + } +}","class Solution(object): + def findThePrefixCommonArray(self, A, B): + """""" + :type A: List[int] + :type B: List[int] + :rtype: List[int] + """""" + ","class Solution: + def findThePrefixCommonArray(self, A: List[int], B: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findThePrefixCommonArray(int* A, int ASize, int* B, int BSize, int* returnSize){ + +}","public class Solution { + public int[] FindThePrefixCommonArray(int[] A, int[] B) { + + } +}","/** + * @param {number[]} A + * @param {number[]} B + * @return {number[]} + */ +var findThePrefixCommonArray = function(A, B) { + +};","# @param {Integer[]} a +# @param {Integer[]} b +# @return {Integer[]} +def find_the_prefix_common_array(a, b) + +end","class Solution { + func findThePrefixCommonArray(_ A: [Int], _ B: [Int]) -> [Int] { + + } +}","func findThePrefixCommonArray(A []int, B []int) []int { + +}","object Solution { + def findThePrefixCommonArray(A: Array[Int], B: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun findThePrefixCommonArray(A: IntArray, B: IntArray): IntArray { + + } +}","impl Solution { + pub fn find_the_prefix_common_array(a: Vec, b: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $A + * @param Integer[] $B + * @return Integer[] + */ + function findThePrefixCommonArray($A, $B) { + + } +}","function findThePrefixCommonArray(A: number[], B: number[]): number[] { + +};","(define/contract (find-the-prefix-common-array A B) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec find_the_prefix_common_array(A :: [integer()], B :: [integer()]) -> [integer()]. +find_the_prefix_common_array(A, B) -> + .","defmodule Solution do + @spec find_the_prefix_common_array(a :: [integer], b :: [integer]) :: [integer] + def find_the_prefix_common_array(a, b) do + + end +end","class Solution { + List findThePrefixCommonArray(List A, List B) { + + } +}", +83,make-array-empty,Make Array Empty,2659.0,2765.0,"

You are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty:

+ +
    +
  • If the first element has the smallest value, remove it
    • +
  • Otherwise, put the first element at the end of the array.
    • +
+ +

Return an integer denoting the number of operations it takes to make nums empty.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,4,-1]
+Output: 5
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
OperationArray
1[4, -1, 3]
2[-1, 3, 4]
3[3, 4]
4[4]
5[]
+ +

Example 2:

+ +
+Input: nums = [1,2,4,3]
+Output: 5
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
OperationArray
1[2, 4, 3]
2[4, 3]
3[3, 4]
4[4]
5[]
+ +

Example 3:

+ +
+Input: nums = [1,2,3]
+Output: 3
+
+ + + + + + + + + + + + + + + + + + + + + + +
OperationArray
1[2, 3]
2[3]
3[]
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
  • All values in nums are distinct.
    • +
+",3.0,False,"class Solution { +public: + long long countOperationsToEmptyArray(vector& nums) { + + } +};","class Solution { + public long countOperationsToEmptyArray(int[] nums) { + + } +}","class Solution(object): + def countOperationsToEmptyArray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countOperationsToEmptyArray(self, nums: List[int]) -> int: + ","long long countOperationsToEmptyArray(int* nums, int numsSize){ + +}","public class Solution { + public long CountOperationsToEmptyArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countOperationsToEmptyArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_operations_to_empty_array(nums) + +end","class Solution { + func countOperationsToEmptyArray(_ nums: [Int]) -> Int { + + } +}","func countOperationsToEmptyArray(nums []int) int64 { + +}","object Solution { + def countOperationsToEmptyArray(nums: Array[Int]): Long = { + + } +}","class Solution { + fun countOperationsToEmptyArray(nums: IntArray): Long { + + } +}","impl Solution { + pub fn count_operations_to_empty_array(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countOperationsToEmptyArray($nums) { + + } +}","function countOperationsToEmptyArray(nums: number[]): number { + +};","(define/contract (count-operations-to-empty-array nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_operations_to_empty_array(Nums :: [integer()]) -> integer(). +count_operations_to_empty_array(Nums) -> + .","defmodule Solution do + @spec count_operations_to_empty_array(nums :: [integer]) :: integer + def count_operations_to_empty_array(nums) do + + end +end","class Solution { + int countOperationsToEmptyArray(List nums) { + + } +}", +84,maximum-number-of-fish-in-a-grid,Maximum Number of Fish in a Grid,2658.0,2764.0,"

You are given a 0-indexed 2D matrix grid of size m x n, where (r, c) represents:

+ +
    +
  • A land cell if grid[r][c] = 0, or
    • +
  • A water cell containing grid[r][c] fish, if grid[r][c] > 0.
    • +
+ +

A fisher can start at any water cell (r, c) and can do the following operations any number of times:

+ +
    +
  • Catch all the fish at cell (r, c), or
    • +
  • Move to any adjacent water cell.
    • +
+ +

Return the maximum number of fish the fisher can catch if he chooses his starting cell optimally, or 0 if no water cell exists.

+ +

An adjacent cell of the cell (r, c), is one of the cells (r, c + 1), (r, c - 1), (r + 1, c) or (r - 1, c) if it exists.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,2,1,0],[4,0,0,3],[1,0,0,4],[0,3,2,0]]
+Output: 7
+Explanation: The fisher can start at cell (1,3) and collect 3 fish, then move to cell (2,3) and collect 4 fish.
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,1]]
+Output: 1
+Explanation: The fisher can start at cells (0,0) or (3,3) and collect a single fish. 
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 10
    • +
  • 0 <= grid[i][j] <= 10
    • +
+",2.0,False,"class Solution { +public: + int findMaxFish(vector>& grid) { + + } +};","class Solution { + public int findMaxFish(int[][] grid) { + + } +}","class Solution(object): + def findMaxFish(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findMaxFish(self, grid: List[List[int]]) -> int: + ","int findMaxFish(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int FindMaxFish(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var findMaxFish = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def find_max_fish(grid) + +end","class Solution { + func findMaxFish(_ grid: [[Int]]) -> Int { + + } +}","func findMaxFish(grid [][]int) int { + +}","object Solution { + def findMaxFish(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findMaxFish(grid: Array): Int { + + } +}","impl Solution { + pub fn find_max_fish(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function findMaxFish($grid) { + + } +}","function findMaxFish(grid: number[][]): number { + +};","(define/contract (find-max-fish grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_max_fish(Grid :: [[integer()]]) -> integer(). +find_max_fish(Grid) -> + .","defmodule Solution do + @spec find_max_fish(grid :: [[integer]]) :: integer + def find_max_fish(grid) do + + end +end","class Solution { + int findMaxFish(List> grid) { + + } +}", +85,count-of-integers,Count of Integers,2719.0,2757.0,"

You are given two numeric strings num1 and num2 and two integers max_sum and min_sum. We denote an integer x to be good if:

+ +
    +
  • num1 <= x <= num2
    • +
  • min_sum <= digit_sum(x) <= max_sum.
    • +
+ +

Return the number of good integers. Since the answer may be large, return it modulo 109 + 7.

+ +

Note that digit_sum(x) denotes the sum of the digits of x.

+ +

 

+

Example 1:

+ +
+Input: num1 = "1", num2 = "12", min_sum = 1, max_sum = 8
+Output: 11
+Explanation: There are 11 integers whose sum of digits lies between 1 and 8 are 1,2,3,4,5,6,7,8,10,11, and 12. Thus, we return 11.
+
+ +

Example 2:

+ +
+Input: num1 = "1", num2 = "5", min_sum = 1, max_sum = 5
+Output: 5
+Explanation: The 5 integers whose sum of digits lies between 1 and 5 are 1,2,3,4, and 5. Thus, we return 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num1 <= num2 <= 1022
    • +
  • 1 <= min_sum <= max_sum <= 400
    • +
+",3.0,False,"class Solution { +public: + int count(string num1, string num2, int min_sum, int max_sum) { + + } +};","class Solution { + public int count(String num1, String num2, int min_sum, int max_sum) { + + } +}","class Solution(object): + def count(self, num1, num2, min_sum, max_sum): + """""" + :type num1: str + :type num2: str + :type min_sum: int + :type max_sum: int + :rtype: int + """""" + ","class Solution: + def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int: + ","int count(char * num1, char * num2, int min_sum, int max_sum){ + +}","public class Solution { + public int Count(string num1, string num2, int min_sum, int max_sum) { + + } +}","/** + * @param {string} num1 + * @param {string} num2 + * @param {number} min_sum + * @param {number} max_sum + * @return {number} + */ +var count = function(num1, num2, min_sum, max_sum) { + +};","# @param {String} num1 +# @param {String} num2 +# @param {Integer} min_sum +# @param {Integer} max_sum +# @return {Integer} +def count(num1, num2, min_sum, max_sum) + +end","class Solution { + func count(_ num1: String, _ num2: String, _ min_sum: Int, _ max_sum: Int) -> Int { + + } +}","func count(num1 string, num2 string, min_sum int, max_sum int) int { + +}","object Solution { + def count(num1: String, num2: String, min_sum: Int, max_sum: Int): Int = { + + } +}","class Solution { + fun count(num1: String, num2: String, min_sum: Int, max_sum: Int): Int { + + } +}","impl Solution { + pub fn count(num1: String, num2: String, min_sum: i32, max_sum: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $num1 + * @param String $num2 + * @param Integer $min_sum + * @param Integer $max_sum + * @return Integer + */ + function count($num1, $num2, $min_sum, $max_sum) { + + } +}","function count(num1: string, num2: string, min_sum: number, max_sum: number): number { + +};","(define/contract (count num1 num2 min_sum max_sum) + (-> string? string? exact-integer? exact-integer? exact-integer?) + + )","-spec count(Num1 :: unicode:unicode_binary(), Num2 :: unicode:unicode_binary(), Min_sum :: integer(), Max_sum :: integer()) -> integer(). +count(Num1, Num2, Min_sum, Max_sum) -> + .","defmodule Solution do + @spec count(num1 :: String.t, num2 :: String.t, min_sum :: integer, max_sum :: integer) :: integer + def count(num1, num2, min_sum, max_sum) do + + end +end","class Solution { + int count(String num1, String num2, int min_sum, int max_sum) { + + } +}", +87,extra-characters-in-a-string,Extra Characters in a String,2707.0,2755.0,"

You are given a 0-indexed string s and a dictionary of words dictionary. You have to break s into one or more non-overlapping substrings such that each substring is present in dictionary. There may be some extra characters in s which are not present in any of the substrings.

+ +

Return the minimum number of extra characters left over if you break up s optimally.

+ +

 

+

Example 1:

+ +
+Input: s = "leetscode", dictionary = ["leet","code","leetcode"]
+Output: 1
+Explanation: We can break s in two substrings: "leet" from index 0 to 3 and "code" from index 5 to 8. There is only 1 unused character (at index 4), so we return 1.
+
+
+ +

Example 2:

+ +
+Input: s = "sayhelloworld", dictionary = ["hello","world"]
+Output: 3
+Explanation: We can break s in two substrings: "hello" from index 3 to 7 and "world" from index 8 to 12. The characters at indices 0, 1, 2 are not used in any substring and thus are considered as extra characters. Hence, we return 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 50
    • +
  • 1 <= dictionary.length <= 50
    • +
  • 1 <= dictionary[i].length <= 50
    • +
  • dictionary[i] and s consists of only lowercase English letters
    • +
  • dictionary contains distinct words
    • +
+",2.0,False,"class Solution { +public: + int minExtraChar(string s, vector& dictionary) { + + } +};","class Solution { + public int minExtraChar(String s, String[] dictionary) { + + } +}","class Solution(object): + def minExtraChar(self, s, dictionary): + """""" + :type s: str + :type dictionary: List[str] + :rtype: int + """""" + ","class Solution: + def minExtraChar(self, s: str, dictionary: List[str]) -> int: + ","int minExtraChar(char * s, char ** dictionary, int dictionarySize){ + +}","public class Solution { + public int MinExtraChar(string s, string[] dictionary) { + + } +}","/** + * @param {string} s + * @param {string[]} dictionary + * @return {number} + */ +var minExtraChar = function(s, dictionary) { + +};","# @param {String} s +# @param {String[]} dictionary +# @return {Integer} +def min_extra_char(s, dictionary) + +end","class Solution { + func minExtraChar(_ s: String, _ dictionary: [String]) -> Int { + + } +}","func minExtraChar(s string, dictionary []string) int { + +}","object Solution { + def minExtraChar(s: String, dictionary: Array[String]): Int = { + + } +}","class Solution { + fun minExtraChar(s: String, dictionary: Array): Int { + + } +}","impl Solution { + pub fn min_extra_char(s: String, dictionary: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $dictionary + * @return Integer + */ + function minExtraChar($s, $dictionary) { + + } +}","function minExtraChar(s: string, dictionary: string[]): number { + +};","(define/contract (min-extra-char s dictionary) + (-> string? (listof string?) exact-integer?) + + )","-spec min_extra_char(S :: unicode:unicode_binary(), Dictionary :: [unicode:unicode_binary()]) -> integer(). +min_extra_char(S, Dictionary) -> + .","defmodule Solution do + @spec min_extra_char(s :: String.t, dictionary :: [String.t]) :: integer + def min_extra_char(s, dictionary) do + + end +end","class Solution { + int minExtraChar(String s, List dictionary) { + + } +}", +88,maximum-strength-of-a-group,Maximum Strength of a Group,2708.0,2754.0,"

You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of students of indices i0, i1, i2, ... , ik is defined as nums[i0] * nums[i1] * nums[i2] * ... * nums[ik​].

+ +

Return the maximum strength of a group the teacher can create.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,-1,-5,2,5,-9]
+Output: 1350
+Explanation: One way to form a group of maximal strength is to group the students at indices [0,2,3,4,5]. Their strength is 3 * (-5) * 2 * 5 * (-9) = 1350, which we can show is optimal.
+
+ +

Example 2:

+ +
+Input: nums = [-4,-5,-4]
+Output: 20
+Explanation: Group the students at indices [0, 1] . Then, we’ll have a resulting strength of 20. We cannot achieve greater strength.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 13
    • +
  • -9 <= nums[i] <= 9
    • +
+",2.0,False,"class Solution { +public: + long long maxStrength(vector& nums) { + + } +};","class Solution { + public long maxStrength(int[] nums) { + + } +}","class Solution(object): + def maxStrength(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxStrength(self, nums: List[int]) -> int: + ","long long maxStrength(int* nums, int numsSize){ + +}","public class Solution { + public long MaxStrength(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxStrength = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_strength(nums) + +end","class Solution { + func maxStrength(_ nums: [Int]) -> Int { + + } +}","func maxStrength(nums []int) int64 { + +}","object Solution { + def maxStrength(nums: Array[Int]): Long = { + + } +}","class Solution { + fun maxStrength(nums: IntArray): Long { + + } +}","impl Solution { + pub fn max_strength(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxStrength($nums) { + + } +}","function maxStrength(nums: number[]): number { + +};","(define/contract (max-strength nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_strength(Nums :: [integer()]) -> integer(). +max_strength(Nums) -> + .","defmodule Solution do + @spec max_strength(nums :: [integer]) :: integer + def max_strength(nums) do + + end +end","class Solution { + int maxStrength(List nums) { + + } +}", +90,sum-multiples,Sum Multiples,2652.0,2752.0,"

Given a positive integer n, find the sum of all integers in the range [1, n] inclusive that are divisible by 3, 5, or 7.

+ +

Return an integer denoting the sum of all numbers in the given range satisfying the constraint.

+ +

 

+

Example 1:

+ +
+Input: n = 7
+Output: 21
+Explanation: Numbers in the range [1, 7] that are divisible by 3, 5, or 7 are 3, 5, 6, 7. The sum of these numbers is 21.
+
+ +

Example 2:

+ +
+Input: n = 10
+Output: 40
+Explanation: Numbers in the range [1, 10] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9, 10. The sum of these numbers is 40.
+
+ +

Example 3:

+ +
+Input: n = 9
+Output: 30
+Explanation: Numbers in the range [1, 9] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9. The sum of these numbers is 30.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 103
    • +
+",1.0,False,"class Solution { +public: + int sumOfMultiples(int n) { + + } +};","class Solution { + public int sumOfMultiples(int n) { + + } +}","class Solution(object): + def sumOfMultiples(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def sumOfMultiples(self, n: int) -> int: + ","int sumOfMultiples(int n){ + +}","public class Solution { + public int SumOfMultiples(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var sumOfMultiples = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def sum_of_multiples(n) + +end","class Solution { + func sumOfMultiples(_ n: Int) -> Int { + + } +}","func sumOfMultiples(n int) int { + +}","object Solution { + def sumOfMultiples(n: Int): Int = { + + } +}","class Solution { + fun sumOfMultiples(n: Int): Int { + + } +}","impl Solution { + pub fn sum_of_multiples(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function sumOfMultiples($n) { + + } +}","function sumOfMultiples(n: number): number { + +};","(define/contract (sum-of-multiples n) + (-> exact-integer? exact-integer?) + + )","-spec sum_of_multiples(N :: integer()) -> integer(). +sum_of_multiples(N) -> + .","defmodule Solution do + @spec sum_of_multiples(n :: integer) :: integer + def sum_of_multiples(n) do + + end +end","class Solution { + int sumOfMultiples(int n) { + + } +}", +91,sliding-subarray-beauty,Sliding Subarray Beauty,2653.0,2751.0,"

Given an integer array nums containing n integers, find the beauty of each subarray of size k.

+ +

The beauty of a subarray is the xth smallest integer in the subarray if it is negative, or 0 if there are fewer than x negative integers.

+ +

Return an integer array containing n - k + 1 integers, which denote the beauty of the subarrays in order from the first index in the array.

+ +
    +
  • +

    A subarray is a contiguous non-empty sequence of elements within an array.

    +
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,-1,-3,-2,3], k = 3, x = 2
+Output: [-1,-2,-2]
+Explanation: There are 3 subarrays with size k = 3. 
+The first subarray is [1, -1, -3] and the 2nd smallest negative integer is -1. 
+The second subarray is [-1, -3, -2] and the 2nd smallest negative integer is -2. 
+The third subarray is [-3, -2, 3] and the 2nd smallest negative integer is -2.
+ +

Example 2:

+ +
+Input: nums = [-1,-2,-3,-4,-5], k = 2, x = 2
+Output: [-1,-2,-3,-4]
+Explanation: There are 4 subarrays with size k = 2.
+For [-1, -2], the 2nd smallest negative integer is -1.
+For [-2, -3], the 2nd smallest negative integer is -2.
+For [-3, -4], the 2nd smallest negative integer is -3.
+For [-4, -5], the 2nd smallest negative integer is -4. 
+ +

Example 3:

+ +
+Input: nums = [-3,1,2,-3,0,-3], k = 2, x = 1
+Output: [-3,0,-3,-3,-3]
+Explanation: There are 5 subarrays with size k = 2.
+For [-3, 1], the 1st smallest negative integer is -3.
+For [1, 2], there is no negative integer so the beauty is 0.
+For [2, -3], the 1st smallest negative integer is -3.
+For [-3, 0], the 1st smallest negative integer is -3.
+For [0, -3], the 1st smallest negative integer is -3.
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length 
    • +
  • 1 <= n <= 105
    • +
  • 1 <= k <= n
    • +
  • 1 <= x <= k 
    • +
  • -50 <= nums[i] <= 50 
    • +
+",2.0,False,"class Solution { +public: + vector getSubarrayBeauty(vector& nums, int k, int x) { + + } +};","class Solution { + public int[] getSubarrayBeauty(int[] nums, int k, int x) { + + } +}","class Solution(object): + def getSubarrayBeauty(self, nums, k, x): + """""" + :type nums: List[int] + :type k: int + :type x: int + :rtype: List[int] + """""" + ","class Solution: + def getSubarrayBeauty(self, nums: List[int], k: int, x: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getSubarrayBeauty(int* nums, int numsSize, int k, int x, int* returnSize){ + +}","public class Solution { + public int[] GetSubarrayBeauty(int[] nums, int k, int x) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @param {number} x + * @return {number[]} + */ +var getSubarrayBeauty = function(nums, k, x) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @param {Integer} x +# @return {Integer[]} +def get_subarray_beauty(nums, k, x) + +end","class Solution { + func getSubarrayBeauty(_ nums: [Int], _ k: Int, _ x: Int) -> [Int] { + + } +}","func getSubarrayBeauty(nums []int, k int, x int) []int { + +}","object Solution { + def getSubarrayBeauty(nums: Array[Int], k: Int, x: Int): Array[Int] = { + + } +}","class Solution { + fun getSubarrayBeauty(nums: IntArray, k: Int, x: Int): IntArray { + + } +}","impl Solution { + pub fn get_subarray_beauty(nums: Vec, k: i32, x: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @param Integer $x + * @return Integer[] + */ + function getSubarrayBeauty($nums, $k, $x) { + + } +}","function getSubarrayBeauty(nums: number[], k: number, x: number): number[] { + +};","(define/contract (get-subarray-beauty nums k x) + (-> (listof exact-integer?) exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec get_subarray_beauty(Nums :: [integer()], K :: integer(), X :: integer()) -> [integer()]. +get_subarray_beauty(Nums, K, X) -> + .","defmodule Solution do + @spec get_subarray_beauty(nums :: [integer], k :: integer, x :: integer) :: [integer] + def get_subarray_beauty(nums, k, x) do + + end +end","class Solution { + List getSubarrayBeauty(List nums, int k, int x) { + + } +}", +92,calculate-delayed-arrival-time,Calculate Delayed Arrival Time,2651.0,2748.0,"

You are given a positive integer arrivalTime denoting the arrival time of a train in hours, and another positive integer delayedTime denoting the amount of delay in hours.

+ +

Return the time when the train will arrive at the station.

+ +

Note that the time in this problem is in 24-hours format.

+ +

 

+

Example 1:

+ +
+Input: arrivalTime = 15, delayedTime = 5 
+Output: 20 
+Explanation: Arrival time of the train was 15:00 hours. It is delayed by 5 hours. Now it will reach at 15+5 = 20 (20:00 hours).
+
+ +

Example 2:

+ +
+Input: arrivalTime = 13, delayedTime = 11
+Output: 0
+Explanation: Arrival time of the train was 13:00 hours. It is delayed by 11 hours. Now it will reach at 13+11=24 (Which is denoted by 00:00 in 24 hours format so return 0).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arrivaltime < 24
    • +
  • 1 <= delayedTime <= 24
    • +
+",1.0,False,"class Solution { +public: + int findDelayedArrivalTime(int arrivalTime, int delayedTime) { + + } +};","class Solution { + public int findDelayedArrivalTime(int arrivalTime, int delayedTime) { + + } +}","class Solution(object): + def findDelayedArrivalTime(self, arrivalTime, delayedTime): + """""" + :type arrivalTime: int + :type delayedTime: int + :rtype: int + """""" + ","class Solution: + def findDelayedArrivalTime(self, arrivalTime: int, delayedTime: int) -> int: + ","int findDelayedArrivalTime(int arrivalTime, int delayedTime){ + +}","public class Solution { + public int FindDelayedArrivalTime(int arrivalTime, int delayedTime) { + + } +}","/** + * @param {number} arrivalTime + * @param {number} delayedTime + * @return {number} + */ +var findDelayedArrivalTime = function(arrivalTime, delayedTime) { + +};","# @param {Integer} arrival_time +# @param {Integer} delayed_time +# @return {Integer} +def find_delayed_arrival_time(arrival_time, delayed_time) + +end","class Solution { + func findDelayedArrivalTime(_ arrivalTime: Int, _ delayedTime: Int) -> Int { + + } +}","func findDelayedArrivalTime(arrivalTime int, delayedTime int) int { + +}","object Solution { + def findDelayedArrivalTime(arrivalTime: Int, delayedTime: Int): Int = { + + } +}","class Solution { + fun findDelayedArrivalTime(arrivalTime: Int, delayedTime: Int): Int { + + } +}","impl Solution { + pub fn find_delayed_arrival_time(arrival_time: i32, delayed_time: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $arrivalTime + * @param Integer $delayedTime + * @return Integer + */ + function findDelayedArrivalTime($arrivalTime, $delayedTime) { + + } +}","function findDelayedArrivalTime(arrivalTime: number, delayedTime: number): number { + +};","(define/contract (find-delayed-arrival-time arrivalTime delayedTime) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec find_delayed_arrival_time(ArrivalTime :: integer(), DelayedTime :: integer()) -> integer(). +find_delayed_arrival_time(ArrivalTime, DelayedTime) -> + .","defmodule Solution do + @spec find_delayed_arrival_time(arrival_time :: integer, delayed_time :: integer) :: integer + def find_delayed_arrival_time(arrival_time, delayed_time) do + + end +end","class Solution { + int findDelayedArrivalTime(int arrivalTime, int delayedTime) { + + } +}", +93,minimize-the-total-price-of-the-trips,Minimize the Total Price of the Trips,2646.0,2739.0,"

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

+ +

The price sum of a given path is the sum of the prices of all nodes lying on that path.

+ +

Additionally, you are given a 2D integer array trips, where trips[i] = [starti, endi] indicates that you start the ith trip from the node starti and travel to the node endi by any path you like.

+ +

Before performing your first trip, you can choose some non-adjacent nodes and halve the prices.

+ +

Return the minimum total price sum to perform all the given trips.

+ +

 

+

Example 1:

+ +
+Input: n = 4, edges = [[0,1],[1,2],[1,3]], price = [2,2,10,6], trips = [[0,3],[2,1],[2,3]]
+Output: 23
+Explanation: The diagram above denotes the tree after rooting it at node 2. The first part shows the initial tree and the second part shows the tree after choosing nodes 0, 2, and 3, and making their price half.
+For the 1st trip, we choose path [0,1,3]. The price sum of that path is 1 + 2 + 3 = 6.
+For the 2nd trip, we choose path [2,1]. The price sum of that path is 2 + 5 = 7.
+For the 3rd trip, we choose path [2,1,3]. The price sum of that path is 5 + 2 + 3 = 10.
+The total price sum of all trips is 6 + 7 + 10 = 23.
+It can be proven, that 23 is the minimum answer that we can achieve.
+
+ +

Example 2:

+ +
+Input: n = 2, edges = [[0,1]], price = [2,2], trips = [[0,0]]
+Output: 1
+Explanation: The diagram above denotes the tree after rooting it at node 0. The first part shows the initial tree and the second part shows the tree after choosing node 0, and making its price half.
+For the 1st trip, we choose path [0]. The price sum of that path is 1.
+The total price sum of all trips is 1. It can be proven, that 1 is the minimum answer that we can achieve.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 50
    • +
  • edges.length == n - 1
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • edges represents a valid tree.
    • +
  • price.length == n
    • +
  • price[i] is an even integer.
    • +
  • 1 <= price[i] <= 1000
    • +
  • 1 <= trips.length <= 100
    • +
  • 0 <= starti, endi <= n - 1
    • +
+",3.0,False,"class Solution { +public: + int minimumTotalPrice(int n, vector>& edges, vector& price, vector>& trips) { + + } +};","class Solution { + public int minimumTotalPrice(int n, int[][] edges, int[] price, int[][] trips) { + + } +}","class Solution(object): + def minimumTotalPrice(self, n, edges, price, trips): + """""" + :type n: int + :type edges: List[List[int]] + :type price: List[int] + :type trips: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumTotalPrice(self, n: int, edges: List[List[int]], price: List[int], trips: List[List[int]]) -> int: + ","int minimumTotalPrice(int n, int** edges, int edgesSize, int* edgesColSize, int* price, int priceSize, int** trips, int tripsSize, int* tripsColSize){ + +}","public class Solution { + public int MinimumTotalPrice(int n, int[][] edges, int[] price, int[][] trips) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} price + * @param {number[][]} trips + * @return {number} + */ +var minimumTotalPrice = function(n, edges, price, trips) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer[]} price +# @param {Integer[][]} trips +# @return {Integer} +def minimum_total_price(n, edges, price, trips) + +end","class Solution { + func minimumTotalPrice(_ n: Int, _ edges: [[Int]], _ price: [Int], _ trips: [[Int]]) -> Int { + + } +}","func minimumTotalPrice(n int, edges [][]int, price []int, trips [][]int) int { + +}","object Solution { + def minimumTotalPrice(n: Int, edges: Array[Array[Int]], price: Array[Int], trips: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumTotalPrice(n: Int, edges: Array, price: IntArray, trips: Array): Int { + + } +}","impl Solution { + pub fn minimum_total_price(n: i32, edges: Vec>, price: Vec, trips: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer[] $price + * @param Integer[][] $trips + * @return Integer + */ + function minimumTotalPrice($n, $edges, $price, $trips) { + + } +}","function minimumTotalPrice(n: number, edges: number[][], price: number[], trips: number[][]): number { + +};","(define/contract (minimum-total-price n edges price trips) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_total_price(N :: integer(), Edges :: [[integer()]], Price :: [integer()], Trips :: [[integer()]]) -> integer(). +minimum_total_price(N, Edges, Price, Trips) -> + .","defmodule Solution do + @spec minimum_total_price(n :: integer, edges :: [[integer]], price :: [integer], trips :: [[integer]]) :: integer + def minimum_total_price(n, edges, price, trips) do + + end +end","class Solution { + int minimumTotalPrice(int n, List> edges, List price, List> trips) { + + } +}", +95,minimum-additions-to-make-valid-string,Minimum Additions to Make Valid String,2645.0,2736.0,"

Given a string word to which you can insert letters "a", "b" or "c" anywhere and any number of times, return the minimum number of letters that must be inserted so that word becomes valid.

+ +

A string is called valid if it can be formed by concatenating the string "abc" several times.

+ +

 

+

Example 1:

+ +
+Input: word = "b"
+Output: 2
+Explanation: Insert the letter "a" right before "b", and the letter "c" right next to "a" to obtain the valid string "abc".
+
+ +

Example 2:

+ +
+Input: word = "aaa"
+Output: 6
+Explanation: Insert letters "b" and "c" next to each "a" to obtain the valid string "abcabcabc".
+
+ +

Example 3:

+ +
+Input: word = "abc"
+Output: 0
+Explanation: word is already valid. No modifications are needed. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length <= 50
    • +
  • word consists of letters "a", "b" and "c" only. 
    • +
+",2.0,False,"class Solution { +public: + int addMinimum(string word) { + + } +};","class Solution { + public int addMinimum(String word) { + + } +}","class Solution(object): + def addMinimum(self, word): + """""" + :type word: str + :rtype: int + """""" + ","class Solution: + def addMinimum(self, word: str) -> int: + ","int addMinimum(char * word){ + +}","public class Solution { + public int AddMinimum(string word) { + + } +}","/** + * @param {string} word + * @return {number} + */ +var addMinimum = function(word) { + +};","# @param {String} word +# @return {Integer} +def add_minimum(word) + +end","class Solution { + func addMinimum(_ word: String) -> Int { + + } +}","func addMinimum(word string) int { + +}","object Solution { + def addMinimum(word: String): Int = { + + } +}","class Solution { + fun addMinimum(word: String): Int { + + } +}","impl Solution { + pub fn add_minimum(word: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word + * @return Integer + */ + function addMinimum($word) { + + } +}","function addMinimum(word: string): number { + +};","(define/contract (add-minimum word) + (-> string? exact-integer?) + + )","-spec add_minimum(Word :: unicode:unicode_binary()) -> integer(). +add_minimum(Word) -> + .","defmodule Solution do + @spec add_minimum(word :: String.t) :: integer + def add_minimum(word) do + + end +end","class Solution { + int addMinimum(String word) { + + } +}", +96,maximum-or,Maximum OR,2680.0,2730.0,"

You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.

+ +

Return the maximum possible value of nums[0] | nums[1] | ... | nums[n - 1] that can be obtained after applying the operation on nums at most k times.

+ +

Note that a | b denotes the bitwise or between two integers a and b.

+ +

 

+

Example 1:

+ +
+Input: nums = [12,9], k = 1
+Output: 30
+Explanation: If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.
+
+ +

Example 2:

+ +
+Input: nums = [8,1,2], k = 2
+Output: 35
+Explanation: If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
  • 1 <= k <= 15
    • +
+",2.0,False,"class Solution { +public: + long long maximumOr(vector& nums, int k) { + + } +};","class Solution { + public long maximumOr(int[] nums, int k) { + + } +}","class Solution(object): + def maximumOr(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumOr(self, nums: List[int], k: int) -> int: + ","long long maximumOr(int* nums, int numsSize, int k){ + +}","public class Solution { + public long MaximumOr(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumOr = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def maximum_or(nums, k) + +end","class Solution { + func maximumOr(_ nums: [Int], _ k: Int) -> Int { + + } +}","func maximumOr(nums []int, k int) int64 { + +}","object Solution { + def maximumOr(nums: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun maximumOr(nums: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn maximum_or(nums: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function maximumOr($nums, $k) { + + } +}","function maximumOr(nums: number[], k: number): number { + +};","(define/contract (maximum-or nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_or(Nums :: [integer()], K :: integer()) -> integer(). +maximum_or(Nums, K) -> + .","defmodule Solution do + @spec maximum_or(nums :: [integer], k :: integer) :: integer + def maximum_or(nums, k) do + + end +end","class Solution { + int maximumOr(List nums, int k) { + + } +}", +99,minimum-reverse-operations,Minimum Reverse Operations,2612.0,2726.0,"

You are given an integer n and an integer p in the range [0, n - 1]. Representing a 0-indexed array arr of length n where all positions are set to 0's, except position p which is set to 1.

+ +

You are also given an integer array banned containing some positions from the array. For the ith position in banned, arr[banned[i]] = 0, and banned[i] != p.

+ +

You can perform multiple operations on arr. In an operation, you can choose a subarray with size k and reverse the subarray. However, the 1 in arr should never go to any of the positions in banned. In other words, after each operation arr[banned[i]] remains 0.

+ +

Return an array ans where for each i from [0, n - 1], ans[i] is the minimum number of reverse operations needed to bring the 1 to position i in arr, or -1 if it is impossible.

+ +
    +
  • A subarray is a contiguous non-empty sequence of elements within an array.
    • +
  • The values of ans[i] are independent for all i's.
    • +
  • The reverse of an array is an array containing the values in reverse order.
    • +
+ +

 

+

Example 1:

+ +
+Input: n = 4, p = 0, banned = [1,2], k = 4
+Output: [0,-1,-1,1]
+Explanation: In this case k = 4 so there is only one possible reverse operation we can perform, which is reversing the whole array. Initially, 1 is placed at position 0 so the amount of operations we need for position 0 is 0. We can never place a 1 on the banned positions, so the answer for positions 1 and 2 is -1. Finally, with one reverse operation we can bring the 1 to index 3, so the answer for position 3 is 1. 
+
+ +

Example 2:

+ +
+Input: n = 5, p = 0, banned = [2,4], k = 3
+Output: [0,-1,-1,-1,-1]
+Explanation: In this case the 1 is initially at position 0, so the answer for that position is 0. We can perform reverse operations of size 3. The 1 is currently located at position 0, so we need to reverse the subarray [0, 2] for it to leave that position, but reversing that subarray makes position 2 have a 1, which shouldn't happen. So, we can't move the 1 from position 0, making the result for all the other positions -1. 
+
+ +

Example 3:

+ +
+Input: n = 4, p = 2, banned = [0,1,3], k = 1
+Output: [-1,-1,0,-1]
+Explanation: In this case we can only perform reverse operations of size 1. So the 1 never changes its position.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 0 <= p <= n - 1
    • +
  • 0 <= banned.length <= n - 1
    • +
  • 0 <= banned[i] <= n - 1
    • +
  • 1 <= k <= n 
    • +
  • banned[i] != p
    • +
  • all values in banned are unique 
    • +
+",3.0,False,"class Solution { +public: + vector minReverseOperations(int n, int p, vector& banned, int k) { + + } +};","class Solution { + public int[] minReverseOperations(int n, int p, int[] banned, int k) { + + } +}","class Solution(object): + def minReverseOperations(self, n, p, banned, k): + """""" + :type n: int + :type p: int + :type banned: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def minReverseOperations(self, n: int, p: int, banned: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* minReverseOperations(int n, int p, int* banned, int bannedSize, int k, int* returnSize){ + +}","public class Solution { + public int[] MinReverseOperations(int n, int p, int[] banned, int k) { + + } +}","/** + * @param {number} n + * @param {number} p + * @param {number[]} banned + * @param {number} k + * @return {number[]} + */ +var minReverseOperations = function(n, p, banned, k) { + +};","# @param {Integer} n +# @param {Integer} p +# @param {Integer[]} banned +# @param {Integer} k +# @return {Integer[]} +def min_reverse_operations(n, p, banned, k) + +end","class Solution { + func minReverseOperations(_ n: Int, _ p: Int, _ banned: [Int], _ k: Int) -> [Int] { + + } +}","func minReverseOperations(n int, p int, banned []int, k int) []int { + +}","object Solution { + def minReverseOperations(n: Int, p: Int, banned: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun minReverseOperations(n: Int, p: Int, banned: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn min_reverse_operations(n: i32, p: i32, banned: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $p + * @param Integer[] $banned + * @param Integer $k + * @return Integer[] + */ + function minReverseOperations($n, $p, $banned, $k) { + + } +}","function minReverseOperations(n: number, p: number, banned: number[], k: number): number[] { + +};","(define/contract (min-reverse-operations n p banned k) + (-> exact-integer? exact-integer? (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec min_reverse_operations(N :: integer(), P :: integer(), Banned :: [integer()], K :: integer()) -> [integer()]. +min_reverse_operations(N, P, Banned, K) -> + .","defmodule Solution do + @spec min_reverse_operations(n :: integer, p :: integer, banned :: [integer], k :: integer) :: [integer] + def min_reverse_operations(n, p, banned, k) do + + end +end","class Solution { + List minReverseOperations(int n, int p, List banned, int k) { + + } +}", +104,sum-of-distances,Sum of Distances,2615.0,2721.0,"

You are given a 0-indexed integer array nums. There exists an array arr of length nums.length, where arr[i] is the sum of |i - j| over all j such that nums[j] == nums[i] and j != i. If there is no such j, set arr[i] to be 0.

+ +

Return the array arr.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,1,1,2]
+Output: [5,0,3,4,0]
+Explanation: 
+When i = 0, nums[0] == nums[2] and nums[0] == nums[3]. Therefore, arr[0] = |0 - 2| + |0 - 3| = 5. 
+When i = 1, arr[1] = 0 because there is no other index with value 3.
+When i = 2, nums[2] == nums[0] and nums[2] == nums[3]. Therefore, arr[2] = |2 - 0| + |2 - 3| = 3. 
+When i = 3, nums[3] == nums[0] and nums[3] == nums[2]. Therefore, arr[3] = |3 - 0| + |3 - 2| = 4. 
+When i = 4, arr[4] = 0 because there is no other index with value 2. 
+
+
+ +

Example 2:

+ +
+Input: nums = [0,5,3]
+Output: [0,0,0]
+Explanation: Since each element in nums is distinct, arr[i] = 0 for all i.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + vector distance(vector& nums) { + + } +};","class Solution { + public long[] distance(int[] nums) { + + } +}","class Solution(object): + def distance(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def distance(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* distance(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public long[] Distance(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var distance = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def distance(nums) + +end","class Solution { + func distance(_ nums: [Int]) -> [Int] { + + } +}","func distance(nums []int) []int64 { + +}","object Solution { + def distance(nums: Array[Int]): Array[Long] = { + + } +}","class Solution { + fun distance(nums: IntArray): LongArray { + + } +}","impl Solution { + pub fn distance(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function distance($nums) { + + } +}","function distance(nums: number[]): number[] { + +};","(define/contract (distance nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec distance(Nums :: [integer()]) -> [integer()]. +distance(Nums) -> + .","defmodule Solution do + @spec distance(nums :: [integer]) :: [integer] + def distance(nums) do + + end +end","class Solution { + List distance(List nums) { + + } +}", +105,minimize-the-maximum-difference-of-pairs,Minimize the Maximum Difference of Pairs,2616.0,2720.0,"

You are given a 0-indexed integer array nums and an integer p. Find p pairs of indices of nums such that the maximum difference amongst all the pairs is minimized. Also, ensure no index appears more than once amongst the p pairs.

+ +

Note that for a pair of elements at the index i and j, the difference of this pair is |nums[i] - nums[j]|, where |x| represents the absolute value of x.

+ +

Return the minimum maximum difference among all p pairs. We define the maximum of an empty set to be zero.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,1,2,7,1,3], p = 2
+Output: 1
+Explanation: The first pair is formed from the indices 1 and 4, and the second pair is formed from the indices 2 and 5. 
+The maximum difference is max(|nums[1] - nums[4]|, |nums[2] - nums[5]|) = max(0, 1) = 1. Therefore, we return 1.
+
+ +

Example 2:

+ +
+Input: nums = [4,2,1,2], p = 1
+Output: 0
+Explanation: Let the indices 1 and 3 form a pair. The difference of that pair is |2 - 2| = 0, which is the minimum we can attain.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
  • 0 <= p <= (nums.length)/2
    • +
+",2.0,False,"class Solution { +public: + int minimizeMax(vector& nums, int p) { + + } +};","class Solution { + public int minimizeMax(int[] nums, int p) { + + } +}","class Solution(object): + def minimizeMax(self, nums, p): + """""" + :type nums: List[int] + :type p: int + :rtype: int + """""" + ","class Solution: + def minimizeMax(self, nums: List[int], p: int) -> int: + ","int minimizeMax(int* nums, int numsSize, int p){ + +}","public class Solution { + public int MinimizeMax(int[] nums, int p) { + + } +}","/** + * @param {number[]} nums + * @param {number} p + * @return {number} + */ +var minimizeMax = function(nums, p) { + +};","# @param {Integer[]} nums +# @param {Integer} p +# @return {Integer} +def minimize_max(nums, p) + +end","class Solution { + func minimizeMax(_ nums: [Int], _ p: Int) -> Int { + + } +}","func minimizeMax(nums []int, p int) int { + +}","object Solution { + def minimizeMax(nums: Array[Int], p: Int): Int = { + + } +}","class Solution { + fun minimizeMax(nums: IntArray, p: Int): Int { + + } +}","impl Solution { + pub fn minimize_max(nums: Vec, p: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $p + * @return Integer + */ + function minimizeMax($nums, $p) { + + } +}","function minimizeMax(nums: number[], p: number): number { + +};","(define/contract (minimize-max nums p) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec minimize_max(Nums :: [integer()], P :: integer()) -> integer(). +minimize_max(Nums, P) -> + .","defmodule Solution do + @spec minimize_max(nums :: [integer], p :: integer) :: integer + def minimize_max(nums, p) do + + end +end","class Solution { + int minimizeMax(List nums, int p) { + + } +}", +107,collect-coins-in-a-tree,Collect Coins in a Tree,2603.0,2717.0,"

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1. You are given an integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree. You are also given an array coins of size n where coins[i] can be either 0 or 1, where 1 indicates the presence of a coin in the vertex i.

+ +

Initially, you choose to start at any vertex in the tree. Then, you can perform the following operations any number of times: 

+ +
    +
  • Collect all the coins that are at a distance of at most 2 from the current vertex, or
    • +
  • Move to any adjacent vertex in the tree.
    • +
+ +

Find the minimum number of edges you need to go through to collect all the coins and go back to the initial vertex.

+ +

Note that if you pass an edge several times, you need to count it into the answer several times.

+ +

 

+

Example 1:

+ +
+Input: coins = [1,0,0,0,0,1], edges = [[0,1],[1,2],[2,3],[3,4],[4,5]]
+Output: 2
+Explanation: Start at vertex 2, collect the coin at vertex 0, move to vertex 3, collect the coin at vertex 5 then move back to vertex 2.
+
+ +

Example 2:

+ +
+Input: coins = [0,0,0,1,1,0,0,1], edges = [[0,1],[0,2],[1,3],[1,4],[2,5],[5,6],[5,7]]
+Output: 2
+Explanation: Start at vertex 0, collect the coins at vertices 4 and 3, move to vertex 2,  collect the coin at vertex 7, then move back to vertex 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == coins.length
    • +
  • 1 <= n <= 3 * 104
    • +
  • 0 <= coins[i] <= 1
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • edges represents a valid tree.
    • +
+",3.0,False,"class Solution { +public: + int collectTheCoins(vector& coins, vector>& edges) { + + } +};","class Solution { + public int collectTheCoins(int[] coins, int[][] edges) { + + } +}","class Solution(object): + def collectTheCoins(self, coins, edges): + """""" + :type coins: List[int] + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def collectTheCoins(self, coins: List[int], edges: List[List[int]]) -> int: + ","int collectTheCoins(int* coins, int coinsSize, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int CollectTheCoins(int[] coins, int[][] edges) { + + } +}","/** + * @param {number[]} coins + * @param {number[][]} edges + * @return {number} + */ +var collectTheCoins = function(coins, edges) { + +};","# @param {Integer[]} coins +# @param {Integer[][]} edges +# @return {Integer} +def collect_the_coins(coins, edges) + +end","class Solution { + func collectTheCoins(_ coins: [Int], _ edges: [[Int]]) -> Int { + + } +}","func collectTheCoins(coins []int, edges [][]int) int { + +}","object Solution { + def collectTheCoins(coins: Array[Int], edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun collectTheCoins(coins: IntArray, edges: Array): Int { + + } +}","impl Solution { + pub fn collect_the_coins(coins: Vec, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $coins + * @param Integer[][] $edges + * @return Integer + */ + function collectTheCoins($coins, $edges) { + + } +}","function collectTheCoins(coins: number[], edges: number[][]): number { + +};","(define/contract (collect-the-coins coins edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec collect_the_coins(Coins :: [integer()], Edges :: [[integer()]]) -> integer(). +collect_the_coins(Coins, Edges) -> + .","defmodule Solution do + @spec collect_the_coins(coins :: [integer], edges :: [[integer]]) :: integer + def collect_the_coins(coins, edges) do + + end +end","class Solution { + int collectTheCoins(List coins, List> edges) { + + } +}", +108,prime-subtraction-operation,Prime Subtraction Operation,2601.0,2716.0,"

You are given a 0-indexed integer array nums of length n.

+ +

You can perform the following operation as many times as you want:

+ +
    +
  • Pick an index i that you haven’t picked before, and pick a prime p strictly less than nums[i], then subtract p from nums[i].
    • +
+ +

Return true if you can make nums a strictly increasing array using the above operation and false otherwise.

+ +

A strictly increasing array is an array whose each element is strictly greater than its preceding element.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,9,6,10]
+Output: true
+Explanation: In the first operation: Pick i = 0 and p = 3, and then subtract 3 from nums[0], so that nums becomes [1,9,6,10].
+In the second operation: i = 1, p = 7, subtract 7 from nums[1], so nums becomes equal to [1,2,6,10].
+After the second operation, nums is sorted in strictly increasing order, so the answer is true.
+ +

Example 2:

+ +
+Input: nums = [6,8,11,12]
+Output: true
+Explanation: Initially nums is sorted in strictly increasing order, so we don't need to make any operations.
+ +

Example 3:

+ +
+Input: nums = [5,8,3]
+Output: false
+Explanation: It can be proven that there is no way to perform operations to make nums sorted in strictly increasing order, so the answer is false.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 1000
    • +
  • nums.length == n
    • +
+",2.0,False,"class Solution { +public: + bool primeSubOperation(vector& nums) { + + } +};","class Solution { + public boolean primeSubOperation(int[] nums) { + + } +}","class Solution(object): + def primeSubOperation(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def primeSubOperation(self, nums: List[int]) -> bool: + ","bool primeSubOperation(int* nums, int numsSize){ + +}","public class Solution { + public bool PrimeSubOperation(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var primeSubOperation = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def prime_sub_operation(nums) + +end","class Solution { + func primeSubOperation(_ nums: [Int]) -> Bool { + + } +}","func primeSubOperation(nums []int) bool { + +}","object Solution { + def primeSubOperation(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun primeSubOperation(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn prime_sub_operation(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function primeSubOperation($nums) { + + } +}","function primeSubOperation(nums: number[]): boolean { + +};","(define/contract (prime-sub-operation nums) + (-> (listof exact-integer?) boolean?) + + )","-spec prime_sub_operation(Nums :: [integer()]) -> boolean(). +prime_sub_operation(Nums) -> + .","defmodule Solution do + @spec prime_sub_operation(nums :: [integer]) :: boolean + def prime_sub_operation(nums) do + + end +end","class Solution { + bool primeSubOperation(List nums) { + + } +}", +112,find-the-maximum-number-of-marked-indices,Find the Maximum Number of Marked Indices,2576.0,2712.0,"

You are given a 0-indexed integer array nums.

+ +

Initially, all of the indices are unmarked. You are allowed to make this operation any number of times:

+ +
    +
  • Pick two different unmarked indices i and j such that 2 * nums[i] <= nums[j], then mark i and j.
    • +
+ +

Return the maximum possible number of marked indices in nums using the above operation any number of times.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,5,2,4]
+Output: 2
+Explanation: In the first operation: pick i = 2 and j = 1, the operation is allowed because 2 * nums[2] <= nums[1]. Then mark index 2 and 1.
+It can be shown that there's no other valid operation so the answer is 2.
+
+ +

Example 2:

+ +
+Input: nums = [9,2,5,4]
+Output: 4
+Explanation: In the first operation: pick i = 3 and j = 0, the operation is allowed because 2 * nums[3] <= nums[0]. Then mark index 3 and 0.
+In the second operation: pick i = 1 and j = 2, the operation is allowed because 2 * nums[1] <= nums[2]. Then mark index 1 and 2.
+Since there is no other operation, the answer is 4.
+
+ +

Example 3:

+ +
+Input: nums = [7,6,8]
+Output: 0
+Explanation: There is no valid operation to do, so the answer is 0.
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+ +

 

+ +",2.0,False,"class Solution { +public: + int maxNumOfMarkedIndices(vector& nums) { + + } +};","class Solution { + public int maxNumOfMarkedIndices(int[] nums) { + + } +}","class Solution(object): + def maxNumOfMarkedIndices(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxNumOfMarkedIndices(self, nums: List[int]) -> int: + ","int maxNumOfMarkedIndices(int* nums, int numsSize){ + +}","public class Solution { + public int MaxNumOfMarkedIndices(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxNumOfMarkedIndices = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_num_of_marked_indices(nums) + +end","class Solution { + func maxNumOfMarkedIndices(_ nums: [Int]) -> Int { + + } +}","func maxNumOfMarkedIndices(nums []int) int { + +}","object Solution { + def maxNumOfMarkedIndices(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxNumOfMarkedIndices(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_num_of_marked_indices(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxNumOfMarkedIndices($nums) { + + } +}","function maxNumOfMarkedIndices(nums: number[]): number { + +};","(define/contract (max-num-of-marked-indices nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_num_of_marked_indices(Nums :: [integer()]) -> integer(). +max_num_of_marked_indices(Nums) -> + .","defmodule Solution do + @spec max_num_of_marked_indices(nums :: [integer]) :: integer + def max_num_of_marked_indices(nums) do + + end +end","class Solution { + int maxNumOfMarkedIndices(List nums) { + + } +}", +113,minimum-time-to-visit-a-cell-in-a-grid,Minimum Time to Visit a Cell In a Grid,2577.0,2711.0,"

You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum time required to be able to visit the cell (row, col), which means you can visit the cell (row, col) only when the time you visit it is greater than or equal to grid[row][col].

+ +

You are standing in the top-left cell of the matrix in the 0th second, and you must move to any adjacent cell in the four directions: up, down, left, and right. Each move you make takes 1 second.

+ +

Return the minimum time required in which you can visit the bottom-right cell of the matrix. If you cannot visit the bottom-right cell, then return -1.

+ +

 

+

Example 1:

+ +

+ +
+Input: grid = [[0,1,3,2],[5,1,2,5],[4,3,8,6]]
+Output: 7
+Explanation: One of the paths that we can take is the following:
+- at t = 0, we are on the cell (0,0).
+- at t = 1, we move to the cell (0,1). It is possible because grid[0][1] <= 1.
+- at t = 2, we move to the cell (1,1). It is possible because grid[1][1] <= 2.
+- at t = 3, we move to the cell (1,2). It is possible because grid[1][2] <= 3.
+- at t = 4, we move to the cell (1,1). It is possible because grid[1][1] <= 4.
+- at t = 5, we move to the cell (1,2). It is possible because grid[1][2] <= 5.
+- at t = 6, we move to the cell (1,3). It is possible because grid[1][3] <= 6.
+- at t = 7, we move to the cell (2,3). It is possible because grid[2][3] <= 7.
+The final time is 7. It can be shown that it is the minimum time possible.
+
+ +

Example 2:

+ +

+ +
+Input: grid = [[0,2,4],[3,2,1],[1,0,4]]
+Output: -1
+Explanation: There is no path from the top left to the bottom-right cell.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 2 <= m, n <= 1000
    • +
  • 4 <= m * n <= 105
    • +
  • 0 <= grid[i][j] <= 105
    • +
  • grid[0][0] == 0
    • +
+ +

 

+ +",3.0,False,"class Solution { +public: + int minimumTime(vector>& grid) { + + } +};","class Solution { + public int minimumTime(int[][] grid) { + + } +}","class Solution(object): + def minimumTime(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumTime(self, grid: List[List[int]]) -> int: + ","int minimumTime(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinimumTime(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minimumTime = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def minimum_time(grid) + +end","class Solution { + func minimumTime(_ grid: [[Int]]) -> Int { + + } +}","func minimumTime(grid [][]int) int { + +}","object Solution { + def minimumTime(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumTime(grid: Array): Int { + + } +}","impl Solution { + pub fn minimum_time(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minimumTime($grid) { + + } +}","function minimumTime(grid: number[][]): number { + +};","(define/contract (minimum-time grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_time(Grid :: [[integer()]]) -> integer(). +minimum_time(Grid) -> + .","defmodule Solution do + @spec minimum_time(grid :: [[integer]]) :: integer + def minimum_time(grid) do + + end +end","class Solution { + int minimumTime(List> grid) { + + } +}", +116,find-the-string-with-lcp,Find the String with LCP,2573.0,2708.0,"

We define the lcp matrix of any 0-indexed string word of n lowercase English letters as an n x n grid such that:

+ +
    +
  • lcp[i][j] is equal to the length of the longest common prefix between the substrings word[i,n-1] and word[j,n-1].
    • +
+ +

Given an n x n matrix lcp, return the alphabetically smallest string word that corresponds to lcp. If there is no such string, return an empty string.

+ +

A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b. For example, "aabd" is lexicographically smaller than "aaca" because the first position they differ is at the third letter, and 'b' comes before 'c'.

+ +

 

+

Example 1:

+ +
+Input: lcp = [[4,0,2,0],[0,3,0,1],[2,0,2,0],[0,1,0,1]]
+Output: "abab"
+Explanation: lcp corresponds to any 4 letter string with two alternating letters. The lexicographically smallest of them is "abab".
+
+ +

Example 2:

+ +
+Input: lcp = [[4,3,2,1],[3,3,2,1],[2,2,2,1],[1,1,1,1]]
+Output: "aaaa"
+Explanation: lcp corresponds to any 4 letter string with a single distinct letter. The lexicographically smallest of them is "aaaa". 
+
+ +

Example 3:

+ +
+Input: lcp = [[4,3,2,1],[3,3,2,1],[2,2,2,1],[1,1,1,3]]
+Output: ""
+Explanation: lcp[3][3] cannot be equal to 3 since word[3,...,3] consists of only a single letter; Thus, no answer exists.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == lcp.length == lcp[i].length <= 1000
    • +
  • 0 <= lcp[i][j] <= n
    • +
+",3.0,False,"class Solution { +public: + string findTheString(vector>& lcp) { + + } +};","class Solution { + public String findTheString(int[][] lcp) { + + } +}","class Solution(object): + def findTheString(self, lcp): + """""" + :type lcp: List[List[int]] + :rtype: str + """""" + ","class Solution: + def findTheString(self, lcp: List[List[int]]) -> str: + ","char * findTheString(int** lcp, int lcpSize, int* lcpColSize){ + +}","public class Solution { + public string FindTheString(int[][] lcp) { + + } +}","/** + * @param {number[][]} lcp + * @return {string} + */ +var findTheString = function(lcp) { + +};","# @param {Integer[][]} lcp +# @return {String} +def find_the_string(lcp) + +end","class Solution { + func findTheString(_ lcp: [[Int]]) -> String { + + } +}","func findTheString(lcp [][]int) string { + +}","object Solution { + def findTheString(lcp: Array[Array[Int]]): String = { + + } +}","class Solution { + fun findTheString(lcp: Array): String { + + } +}","impl Solution { + pub fn find_the_string(lcp: Vec>) -> String { + + } +}","class Solution { + + /** + * @param Integer[][] $lcp + * @return String + */ + function findTheString($lcp) { + + } +}","function findTheString(lcp: number[][]): string { + +};","(define/contract (find-the-string lcp) + (-> (listof (listof exact-integer?)) string?) + + )","-spec find_the_string(Lcp :: [[integer()]]) -> unicode:unicode_binary(). +find_the_string(Lcp) -> + .","defmodule Solution do + @spec find_the_string(lcp :: [[integer]]) :: String.t + def find_the_string(lcp) do + + end +end","class Solution { + String findTheString(List> lcp) { + + } +}", +117,merge-two-2d-arrays-by-summing-values,Merge Two 2D Arrays by Summing Values,2570.0,2707.0,"

You are given two 2D integer arrays nums1 and nums2.

+ +
    +
  • nums1[i] = [idi, vali] indicate that the number with the id idi has a value equal to vali.
    • +
  • nums2[i] = [idi, vali] indicate that the number with the id idi has a value equal to vali.
    • +
+ +

Each array contains unique ids and is sorted in ascending order by id.

+ +

Merge the two arrays into one array that is sorted in ascending order by id, respecting the following conditions:

+ +
    +
  • Only ids that appear in at least one of the two arrays should be included in the resulting array.
    • +
  • Each id should be included only once and its value should be the sum of the values of this id in the two arrays. If the id does not exist in one of the two arrays then its value in that array is considered to be 0.
    • +
+ +

Return the resulting array. The returned array must be sorted in ascending order by id.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [[1,2],[2,3],[4,5]], nums2 = [[1,4],[3,2],[4,1]]
+Output: [[1,6],[2,3],[3,2],[4,6]]
+Explanation: The resulting array contains the following:
+- id = 1, the value of this id is 2 + 4 = 6.
+- id = 2, the value of this id is 3.
+- id = 3, the value of this id is 2.
+- id = 4, the value of this id is 5 + 1 = 6.
+
+ +

Example 2:

+ +
+Input: nums1 = [[2,4],[3,6],[5,5]], nums2 = [[1,3],[4,3]]
+Output: [[1,3],[2,4],[3,6],[4,3],[5,5]]
+Explanation: There are no common ids, so we just include each id with its value in the resulting list.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 200
    • +
  • nums1[i].length == nums2[j].length == 2
    • +
  • 1 <= idi, vali <= 1000
    • +
  • Both arrays contain unique ids.
    • +
  • Both arrays are in strictly ascending order by id.
    • +
+",1.0,False,"class Solution { +public: + vector> mergeArrays(vector>& nums1, vector>& nums2) { + + } +};","class Solution { + public int[][] mergeArrays(int[][] nums1, int[][] nums2) { + + } +}","class Solution(object): + def mergeArrays(self, nums1, nums2): + """""" + :type nums1: List[List[int]] + :type nums2: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def mergeArrays(self, nums1: List[List[int]], nums2: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** mergeArrays(int** nums1, int nums1Size, int* nums1ColSize, int** nums2, int nums2Size, int* nums2ColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] MergeArrays(int[][] nums1, int[][] nums2) { + + } +}","/** + * @param {number[][]} nums1 + * @param {number[][]} nums2 + * @return {number[][]} + */ +var mergeArrays = function(nums1, nums2) { + +};","# @param {Integer[][]} nums1 +# @param {Integer[][]} nums2 +# @return {Integer[][]} +def merge_arrays(nums1, nums2) + +end","class Solution { + func mergeArrays(_ nums1: [[Int]], _ nums2: [[Int]]) -> [[Int]] { + + } +}","func mergeArrays(nums1 [][]int, nums2 [][]int) [][]int { + +}","object Solution { + def mergeArrays(nums1: Array[Array[Int]], nums2: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun mergeArrays(nums1: Array, nums2: Array): Array { + + } +}","impl Solution { + pub fn merge_arrays(nums1: Vec>, nums2: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $nums1 + * @param Integer[][] $nums2 + * @return Integer[][] + */ + function mergeArrays($nums1, $nums2) { + + } +}","function mergeArrays(nums1: number[][], nums2: number[][]): number[][] { + +};","(define/contract (merge-arrays nums1 nums2) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec merge_arrays(Nums1 :: [[integer()]], Nums2 :: [[integer()]]) -> [[integer()]]. +merge_arrays(Nums1, Nums2) -> + .","defmodule Solution do + @spec merge_arrays(nums1 :: [[integer]], nums2 :: [[integer]]) :: [[integer]] + def merge_arrays(nums1, nums2) do + + end +end","class Solution { + List> mergeArrays(List> nums1, List> nums2) { + + } +}", +119,minimum-impossible-or,Minimum Impossible OR,2568.0,2705.0,"

You are given a 0-indexed integer array nums.

+ +

We say that an integer x is expressible from nums if there exist some integers 0 <= index1 < index2 < ... < indexk < nums.length for which nums[index1] | nums[index2] | ... | nums[indexk] = x. In other words, an integer is expressible if it can be written as the bitwise OR of some subsequence of nums.

+ +

Return the minimum positive non-zero integer that is not expressible from nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1]
+Output: 4
+Explanation: 1 and 2 are already present in the array. We know that 3 is expressible, since nums[0] | nums[1] = 2 | 1 = 3. Since 4 is not expressible, we return 4.
+
+ +

Example 2:

+ +
+Input: nums = [5,3,2]
+Output: 1
+Explanation: We can show that 1 is the smallest number that is not expressible.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int minImpossibleOR(vector& nums) { + + } +};","class Solution { + public int minImpossibleOR(int[] nums) { + + } +}","class Solution(object): + def minImpossibleOR(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minImpossibleOR(self, nums: List[int]) -> int: + ","int minImpossibleOR(int* nums, int numsSize){ + +}","public class Solution { + public int MinImpossibleOR(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minImpossibleOR = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_impossible_or(nums) + +end","class Solution { + func minImpossibleOR(_ nums: [Int]) -> Int { + + } +}","func minImpossibleOR(nums []int) int { + +}","object Solution { + def minImpossibleOR(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minImpossibleOR(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_impossible_or(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minImpossibleOR($nums) { + + } +}","function minImpossibleOR(nums: number[]): number { + +};","(define/contract (min-impossible-or nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_impossible_or(Nums :: [integer()]) -> integer(). +min_impossible_or(Nums) -> + .","defmodule Solution do + @spec min_impossible_or(nums :: [integer]) :: integer + def min_impossible_or(nums) do + + end +end","class Solution { + int minImpossibleOR(List nums) { + + } +}", +121,handling-sum-queries-after-update,Handling Sum Queries After Update,2569.0,2703.0,"

You are given two 0-indexed arrays nums1 and nums2 and a 2D array queries of queries. There are three types of queries:

+ +
    +
  1. For a query of type 1, queries[i] = [1, l, r]. Flip the values from 0 to 1 and from 1 to 0 in nums1 from index l to index r. Both l and r are 0-indexed.
    2. +
  2. For a query of type 2, queries[i] = [2, p, 0]. For every index 0 <= i < n, set nums2[i] = nums2[i] + nums1[i] * p.
    3. +
  3. For a query of type 3, queries[i] = [3, 0, 0]. Find the sum of the elements in nums2.
    4. +
+ +

Return an array containing all the answers to the third type queries.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,0,1], nums2 = [0,0,0], queries = [[1,1,1],[2,1,0],[3,0,0]]
+Output: [3]
+Explanation: After the first query nums1 becomes [1,1,1]. After the second query, nums2 becomes [1,1,1], so the answer to the third query is 3. Thus, [3] is returned.
+
+ +

Example 2:

+ +
+Input: nums1 = [1], nums2 = [5], queries = [[2,0,0],[3,0,0]]
+Output: [5]
+Explanation: After the first query, nums2 remains [5], so the answer to the second query is 5. Thus, [5] is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length,nums2.length <= 105
    • +
  • nums1.length = nums2.length
    • +
  • 1 <= queries.length <= 105
    • +
  • queries[i].length = 3
    • +
  • 0 <= l <= r <= nums1.length - 1
    • +
  • 0 <= p <= 106
    • +
  • 0 <= nums1[i] <= 1
    • +
  • 0 <= nums2[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + vector handleQuery(vector& nums1, vector& nums2, vector>& queries) { + + } +};","class Solution { + public long[] handleQuery(int[] nums1, int[] nums2, int[][] queries) { + + } +}","class Solution(object): + def handleQuery(self, nums1, nums2, queries): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def handleQuery(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* handleQuery(int* nums1, int nums1Size, int* nums2, int nums2Size, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public long[] HandleQuery(int[] nums1, int[] nums2, int[][] queries) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[][]} queries + * @return {number[]} + */ +var handleQuery = function(nums1, nums2, queries) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer[][]} queries +# @return {Integer[]} +def handle_query(nums1, nums2, queries) + +end","class Solution { + func handleQuery(_ nums1: [Int], _ nums2: [Int], _ queries: [[Int]]) -> [Int] { + + } +}","func handleQuery(nums1 []int, nums2 []int, queries [][]int) []int64 { + +}","object Solution { + def handleQuery(nums1: Array[Int], nums2: Array[Int], queries: Array[Array[Int]]): Array[Long] = { + + } +}","class Solution { + fun handleQuery(nums1: IntArray, nums2: IntArray, queries: Array): LongArray { + + } +}","impl Solution { + pub fn handle_query(nums1: Vec, nums2: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer[][] $queries + * @return Integer[] + */ + function handleQuery($nums1, $nums2, $queries) { + + } +}","function handleQuery(nums1: number[], nums2: number[], queries: number[][]): number[] { + +};","(define/contract (handle-query nums1 nums2 queries) + (-> (listof exact-integer?) (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec handle_query(Nums1 :: [integer()], Nums2 :: [integer()], Queries :: [[integer()]]) -> [integer()]. +handle_query(Nums1, Nums2, Queries) -> + .","defmodule Solution do + @spec handle_query(nums1 :: [integer], nums2 :: [integer], queries :: [[integer]]) :: [integer] + def handle_query(nums1, nums2, queries) do + + end +end","class Solution { + List handleQuery(List nums1, List nums2, List> queries) { + + } +}", +122,subsequence-with-the-minimum-score,Subsequence With the Minimum Score,2565.0,2701.0,"

You are given two strings s and t.

+ +

You are allowed to remove any number of characters from the string t.

+ +

The score of the string is 0 if no characters are removed from the string t, otherwise:

+ +
    +
  • Let left be the minimum index among all removed characters.
    • +
  • Let right be the maximum index among all removed characters.
    • +
+ +

Then the score of the string is right - left + 1.

+ +

Return the minimum possible score to make t a subsequence of s.

+ +

A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).

+ +

 

+

Example 1:

+ +
+Input: s = "abacaba", t = "bzaa"
+Output: 1
+Explanation: In this example, we remove the character "z" at index 1 (0-indexed).
+The string t becomes "baa" which is a subsequence of the string "abacaba" and the score is 1 - 1 + 1 = 1.
+It can be proven that 1 is the minimum score that we can achieve.
+
+ +

Example 2:

+ +
+Input: s = "cde", t = "xyz"
+Output: 3
+Explanation: In this example, we remove characters "x", "y" and "z" at indices 0, 1, and 2 (0-indexed).
+The string t becomes "" which is a subsequence of the string "cde" and the score is 2 - 0 + 1 = 3.
+It can be proven that 3 is the minimum score that we can achieve.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 105
    • +
  • s and t consist of only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int minimumScore(string s, string t) { + + } +};","class Solution { + public int minimumScore(String s, String t) { + + } +}","class Solution(object): + def minimumScore(self, s, t): + """""" + :type s: str + :type t: str + :rtype: int + """""" + ","class Solution: + def minimumScore(self, s: str, t: str) -> int: + ","int minimumScore(char * s, char * t){ + +}","public class Solution { + public int MinimumScore(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var minimumScore = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Integer} +def minimum_score(s, t) + +end","class Solution { + func minimumScore(_ s: String, _ t: String) -> Int { + + } +}","func minimumScore(s string, t string) int { + +}","object Solution { + def minimumScore(s: String, t: String): Int = { + + } +}","class Solution { + fun minimumScore(s: String, t: String): Int { + + } +}","impl Solution { + pub fn minimum_score(s: String, t: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Integer + */ + function minimumScore($s, $t) { + + } +}","function minimumScore(s: string, t: string): number { + +};","(define/contract (minimum-score s t) + (-> string? string? exact-integer?) + + )","-spec minimum_score(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> integer(). +minimum_score(S, T) -> + .","defmodule Solution do + @spec minimum_score(s :: String.t, t :: String.t) :: integer + def minimum_score(s, t) do + + end +end","class Solution { + int minimumScore(String s, String t) { + + } +}", +123,substring-xor-queries,Substring XOR Queries,2564.0,2700.0,"

You are given a binary string s, and a 2D integer array queries where queries[i] = [firsti, secondi].

+ +

For the ith query, find the shortest substring of s whose decimal value, val, yields secondi when bitwise XORed with firsti. In other words, val ^ firsti == secondi.

+ +

The answer to the ith query is the endpoints (0-indexed) of the substring [lefti, righti] or [-1, -1] if no such substring exists. If there are multiple answers, choose the one with the minimum lefti.

+ +

Return an array ans where ans[i] = [lefti, righti] is the answer to the ith query.

+ +

A substring is a contiguous non-empty sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "101101", queries = [[0,5],[1,2]]
+Output: [[0,2],[2,3]]
+Explanation: For the first query the substring in range [0,2] is "101" which has a decimal value of 5, and 5 ^ 0 = 5, hence the answer to the first query is [0,2]. In the second query, the substring in range [2,3] is "11", and has a decimal value of 3, and 3 ^ 1 = 2. So, [2,3] is returned for the second query. 
+
+
+ +

Example 2:

+ +
+Input: s = "0101", queries = [[12,8]]
+Output: [[-1,-1]]
+Explanation: In this example there is no substring that answers the query, hence [-1,-1] is returned.
+
+ +

Example 3:

+ +
+Input: s = "1", queries = [[4,5]]
+Output: [[0,0]]
+Explanation: For this example, the substring in range [0,0] has a decimal value of 1, and 1 ^ 4 = 5. So, the answer is [0,0].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s[i] is either '0' or '1'.
    • +
  • 1 <= queries.length <= 105
    • +
  • 0 <= firsti, secondi <= 109
    • +
+",2.0,False,"class Solution { +public: + vector> substringXorQueries(string s, vector>& queries) { + + } +};","class Solution { + public int[][] substringXorQueries(String s, int[][] queries) { + + } +}","class Solution(object): + def substringXorQueries(self, s, queries): + """""" + :type s: str + :type queries: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def substringXorQueries(self, s: str, queries: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** substringXorQueries(char * s, int** queries, int queriesSize, int* queriesColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] SubstringXorQueries(string s, int[][] queries) { + + } +}","/** + * @param {string} s + * @param {number[][]} queries + * @return {number[][]} + */ +var substringXorQueries = function(s, queries) { + +};","# @param {String} s +# @param {Integer[][]} queries +# @return {Integer[][]} +def substring_xor_queries(s, queries) + +end","class Solution { + func substringXorQueries(_ s: String, _ queries: [[Int]]) -> [[Int]] { + + } +}","func substringXorQueries(s string, queries [][]int) [][]int { + +}","object Solution { + def substringXorQueries(s: String, queries: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun substringXorQueries(s: String, queries: Array): Array { + + } +}","impl Solution { + pub fn substring_xor_queries(s: String, queries: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[][] $queries + * @return Integer[][] + */ + function substringXorQueries($s, $queries) { + + } +}","function substringXorQueries(s: string, queries: number[][]): number[][] { + +};","(define/contract (substring-xor-queries s queries) + (-> string? (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec substring_xor_queries(S :: unicode:unicode_binary(), Queries :: [[integer()]]) -> [[integer()]]. +substring_xor_queries(S, Queries) -> + .","defmodule Solution do + @spec substring_xor_queries(s :: String.t, queries :: [[integer]]) :: [[integer]] + def substring_xor_queries(s, queries) do + + end +end","class Solution { + List> substringXorQueries(String s, List> queries) { + + } +}", +124,count-the-number-of-fair-pairs,Count the Number of Fair Pairs,2563.0,2699.0,"

Given a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs.

+ +

A pair (i, j) is fair if:

+ +
    +
  • 0 <= i < j < n, and
    • +
  • lower <= nums[i] + nums[j] <= upper
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,7,4,4,5], lower = 3, upper = 6
+Output: 6
+Explanation: There are 6 fair pairs: (0,3), (0,4), (0,5), (1,3), (1,4), and (1,5).
+
+ +

Example 2:

+ +
+Input: nums = [1,7,9,2,5], lower = 11, upper = 11
+Output: 1
+Explanation: There is a single fair pair: (2,3).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • nums.length == n
    • +
  • -109 <= nums[i] <= 109
    • +
  • -109 <= lower <= upper <= 109
    • +
+",2.0,False,"class Solution { +public: + long long countFairPairs(vector& nums, int lower, int upper) { + + } +};","class Solution { + public long countFairPairs(int[] nums, int lower, int upper) { + + } +}","class Solution(object): + def countFairPairs(self, nums, lower, upper): + """""" + :type nums: List[int] + :type lower: int + :type upper: int + :rtype: int + """""" + ","class Solution: + def countFairPairs(self, nums: List[int], lower: int, upper: int) -> int: + ","long long countFairPairs(int* nums, int numsSize, int lower, int upper){ + +}","public class Solution { + public long CountFairPairs(int[] nums, int lower, int upper) { + + } +}","/** + * @param {number[]} nums + * @param {number} lower + * @param {number} upper + * @return {number} + */ +var countFairPairs = function(nums, lower, upper) { + +};","# @param {Integer[]} nums +# @param {Integer} lower +# @param {Integer} upper +# @return {Integer} +def count_fair_pairs(nums, lower, upper) + +end","class Solution { + func countFairPairs(_ nums: [Int], _ lower: Int, _ upper: Int) -> Int { + + } +}","func countFairPairs(nums []int, lower int, upper int) int64 { + +}","object Solution { + def countFairPairs(nums: Array[Int], lower: Int, upper: Int): Long = { + + } +}","class Solution { + fun countFairPairs(nums: IntArray, lower: Int, upper: Int): Long { + + } +}","impl Solution { + pub fn count_fair_pairs(nums: Vec, lower: i32, upper: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $lower + * @param Integer $upper + * @return Integer + */ + function countFairPairs($nums, $lower, $upper) { + + } +}","function countFairPairs(nums: number[], lower: number, upper: number): number { + +};","(define/contract (count-fair-pairs nums lower upper) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec count_fair_pairs(Nums :: [integer()], Lower :: integer(), Upper :: integer()) -> integer(). +count_fair_pairs(Nums, Lower, Upper) -> + .","defmodule Solution do + @spec count_fair_pairs(nums :: [integer], lower :: integer, upper :: integer) :: integer + def count_fair_pairs(nums, lower, upper) do + + end +end","class Solution { + int countFairPairs(List nums, int lower, int upper) { + + } +}", +126,minimum-number-of-visited-cells-in-a-grid,Minimum Number of Visited Cells in a Grid,2617.0,2697.0,"

You are given a 0-indexed m x n integer matrix grid. Your initial position is at the top-left cell (0, 0).

+ +

Starting from the cell (i, j), you can move to one of the following cells:

+ +
    +
  • Cells (i, k) with j < k <= grid[i][j] + j (rightward movement), or
    • +
  • Cells (k, j) with i < k <= grid[i][j] + i (downward movement).
    • +
+ +

Return the minimum number of cells you need to visit to reach the bottom-right cell (m - 1, n - 1). If there is no valid path, return -1.

+ +

 

+

Example 1:

+ +
+Input: grid = [[3,4,2,1],[4,2,3,1],[2,1,0,0],[2,4,0,0]]
+Output: 4
+Explanation: The image above shows one of the paths that visits exactly 4 cells.
+
+ +

Example 2:

+ +
+Input: grid = [[3,4,2,1],[4,2,1,1],[2,1,1,0],[3,4,1,0]]
+Output: 3
+Explanation: The image above shows one of the paths that visits exactly 3 cells.
+
+ +

Example 3:

+ +
+Input: grid = [[2,1,0],[1,0,0]]
+Output: -1
+Explanation: It can be proven that no path exists.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 105
    • +
  • 0 <= grid[i][j] < m * n
    • +
  • grid[m - 1][n - 1] == 0
    • +
+",3.0,False,"class Solution { +public: + int minimumVisitedCells(vector>& grid) { + + } +};","class Solution { + public int minimumVisitedCells(int[][] grid) { + + } +}","class Solution(object): + def minimumVisitedCells(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumVisitedCells(self, grid: List[List[int]]) -> int: + ","int minimumVisitedCells(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinimumVisitedCells(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minimumVisitedCells = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def minimum_visited_cells(grid) + +end","class Solution { + func minimumVisitedCells(_ grid: [[Int]]) -> Int { + + } +}","func minimumVisitedCells(grid [][]int) int { + +}","object Solution { + def minimumVisitedCells(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumVisitedCells(grid: Array): Int { + + } +}","impl Solution { + pub fn minimum_visited_cells(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minimumVisitedCells($grid) { + + } +}","function minimumVisitedCells(grid: number[][]): number { + +};","(define/contract (minimum-visited-cells grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_visited_cells(Grid :: [[integer()]]) -> integer(). +minimum_visited_cells(Grid) -> + .","defmodule Solution do + @spec minimum_visited_cells(grid :: [[integer]]) :: integer + def minimum_visited_cells(grid) do + + end +end","class Solution { + int minimumVisitedCells(List> grid) { + + } +}", +132,house-robber-iv,House Robber IV,2560.0,2690.0,"

There are several consecutive houses along a street, each of which has some money inside. There is also a robber, who wants to steal money from the homes, but he refuses to steal from adjacent homes.

+ +

The capability of the robber is the maximum amount of money he steals from one house of all the houses he robbed.

+ +

You are given an integer array nums representing how much money is stashed in each house. More formally, the ith house from the left has nums[i] dollars.

+ +

You are also given an integer k, representing the minimum number of houses the robber will steal from. It is always possible to steal at least k houses.

+ +

Return the minimum capability of the robber out of all the possible ways to steal at least k houses.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,5,9], k = 2
+Output: 5
+Explanation: 
+There are three ways to rob at least 2 houses:
+- Rob the houses at indices 0 and 2. Capability is max(nums[0], nums[2]) = 5.
+- Rob the houses at indices 0 and 3. Capability is max(nums[0], nums[3]) = 9.
+- Rob the houses at indices 1 and 3. Capability is max(nums[1], nums[3]) = 9.
+Therefore, we return min(5, 9, 9) = 5.
+
+ +

Example 2:

+ +
+Input: nums = [2,7,9,3,1], k = 2
+Output: 2
+Explanation: There are 7 ways to rob the houses. The way which leads to minimum capability is to rob the house at index 0 and 4. Return max(nums[0], nums[4]) = 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
  • 1 <= k <= (nums.length + 1)/2
    • +
+",2.0,False,"class Solution { +public: + int minCapability(vector& nums, int k) { + + } +};","class Solution { + public int minCapability(int[] nums, int k) { + + } +}","class Solution(object): + def minCapability(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minCapability(self, nums: List[int], k: int) -> int: + ","int minCapability(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinCapability(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minCapability = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_capability(nums, k) + +end","class Solution { + func minCapability(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minCapability(nums []int, k int) int { + +}","object Solution { + def minCapability(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minCapability(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_capability(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minCapability($nums, $k) { + + } +}","function minCapability(nums: number[], k: number): number { + +};","(define/contract (min-capability nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_capability(Nums :: [integer()], K :: integer()) -> integer(). +min_capability(Nums, K) -> + .","defmodule Solution do + @spec min_capability(nums :: [integer], k :: integer) :: integer + def min_capability(nums, k) do + + end +end","class Solution { + int minCapability(List nums, int k) { + + } +}", +133,rearranging-fruits,Rearranging Fruits,2561.0,2689.0,"

You have two fruit baskets containing n fruits each. You are given two 0-indexed integer arrays basket1 and basket2 representing the cost of fruit in each basket. You want to make both baskets equal. To do so, you can use the following operation as many times as you want:

+ +
    +
  • Chose two indices i and j, and swap the ith fruit of basket1 with the jth fruit of basket2.
    • +
  • The cost of the swap is min(basket1[i],basket2[j]).
    • +
+ +

Two baskets are considered equal if sorting them according to the fruit cost makes them exactly the same baskets.

+ +

Return the minimum cost to make both the baskets equal or -1 if impossible.

+ +

 

+

Example 1:

+ +
+Input: basket1 = [4,2,2,2], basket2 = [1,4,1,2]
+Output: 1
+Explanation: Swap index 1 of basket1 with index 0 of basket2, which has cost 1. Now basket1 = [4,1,2,2] and basket2 = [2,4,1,2]. Rearranging both the arrays makes them equal.
+
+ +

Example 2:

+ +
+Input: basket1 = [2,3,4,1], basket2 = [3,2,5,1]
+Output: -1
+Explanation: It can be shown that it is impossible to make both the baskets equal.
+
+ +

 

+

Constraints:

+ +
    +
  • basket1.length == bakste2.length
    • +
  • 1 <= basket1.length <= 105
    • +
  • 1 <= basket1[i],basket2[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + long long minCost(vector& basket1, vector& basket2) { + + } +};","class Solution { + public long minCost(int[] basket1, int[] basket2) { + + } +}","class Solution(object): + def minCost(self, basket1, basket2): + """""" + :type basket1: List[int] + :type basket2: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, basket1: List[int], basket2: List[int]) -> int: + ","long long minCost(int* basket1, int basket1Size, int* basket2, int basket2Size){ + +}","public class Solution { + public long MinCost(int[] basket1, int[] basket2) { + + } +}","/** + * @param {number[]} basket1 + * @param {number[]} basket2 + * @return {number} + */ +var minCost = function(basket1, basket2) { + +};","# @param {Integer[]} basket1 +# @param {Integer[]} basket2 +# @return {Integer} +def min_cost(basket1, basket2) + +end","class Solution { + func minCost(_ basket1: [Int], _ basket2: [Int]) -> Int { + + } +}","func minCost(basket1 []int, basket2 []int) int64 { + +}","object Solution { + def minCost(basket1: Array[Int], basket2: Array[Int]): Long = { + + } +}","class Solution { + fun minCost(basket1: IntArray, basket2: IntArray): Long { + + } +}","impl Solution { + pub fn min_cost(basket1: Vec, basket2: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $basket1 + * @param Integer[] $basket2 + * @return Integer + */ + function minCost($basket1, $basket2) { + + } +}","function minCost(basket1: number[], basket2: number[]): number { + +};","(define/contract (min-cost basket1 basket2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_cost(Basket1 :: [integer()], Basket2 :: [integer()]) -> integer(). +min_cost(Basket1, Basket2) -> + .","defmodule Solution do + @spec min_cost(basket1 :: [integer], basket2 :: [integer]) :: integer + def min_cost(basket1, basket2) do + + end +end","class Solution { + int minCost(List basket1, List basket2) { + + } +}", +134,lexicographically-smallest-beautiful-string,Lexicographically Smallest Beautiful String,2663.0,2687.0,"

A string is beautiful if:

+ +
    +
  • It consists of the first k letters of the English lowercase alphabet.
    • +
  • It does not contain any substring of length 2 or more which is a palindrome.
    • +
+ +

You are given a beautiful string s of length n and a positive integer k.

+ +

Return the lexicographically smallest string of length n, which is larger than s and is beautiful. If there is no such string, return an empty string.

+ +

A string a is lexicographically larger than a string b (of the same length) if in the first position where a and b differ, a has a character strictly larger than the corresponding character in b.

+ +
    +
  • For example, "abcd" is lexicographically larger than "abcc" because the first position they differ is at the fourth character, and d is greater than c.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "abcz", k = 26
+Output: "abda"
+Explanation: The string "abda" is beautiful and lexicographically larger than the string "abcz".
+It can be proven that there is no string that is lexicographically larger than the string "abcz", beautiful, and lexicographically smaller than the string "abda".
+
+ +

Example 2:

+ +
+Input: s = "dc", k = 4
+Output: ""
+Explanation: It can be proven that there is no string that is lexicographically larger than the string "dc" and is beautiful.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == s.length <= 105
    • +
  • 4 <= k <= 26
    • +
  • s is a beautiful string.
    • +
+",3.0,False,"class Solution { +public: + string smallestBeautifulString(string s, int k) { + + } +};","class Solution { + public String smallestBeautifulString(String s, int k) { + + } +}","class Solution(object): + def smallestBeautifulString(self, s, k): + """""" + :type s: str + :type k: int + :rtype: str + """""" + ","class Solution: + def smallestBeautifulString(self, s: str, k: int) -> str: + ","char * smallestBeautifulString(char * s, int k){ + +}","public class Solution { + public string SmallestBeautifulString(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var smallestBeautifulString = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {String} +def smallest_beautiful_string(s, k) + +end","class Solution { + func smallestBeautifulString(_ s: String, _ k: Int) -> String { + + } +}","func smallestBeautifulString(s string, k int) string { + +}","object Solution { + def smallestBeautifulString(s: String, k: Int): String = { + + } +}","class Solution { + fun smallestBeautifulString(s: String, k: Int): String { + + } +}","impl Solution { + pub fn smallest_beautiful_string(s: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return String + */ + function smallestBeautifulString($s, $k) { + + } +}","function smallestBeautifulString(s: string, k: number): string { + +};","(define/contract (smallest-beautiful-string s k) + (-> string? exact-integer? string?) + + )","-spec smallest_beautiful_string(S :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +smallest_beautiful_string(S, K) -> + .","defmodule Solution do + @spec smallest_beautiful_string(s :: String.t, k :: integer) :: String.t + def smallest_beautiful_string(s, k) do + + end +end","class Solution { + String smallestBeautifulString(String s, int k) { + + } +}", +138,count-increasing-quadruplets,Count Increasing Quadruplets,2552.0,2682.0,"

Given a 0-indexed integer array nums of size n containing all numbers from 1 to n, return the number of increasing quadruplets.

+ +

A quadruplet (i, j, k, l) is increasing if:

+ +
    +
  • 0 <= i < j < k < l < n, and
    • +
  • nums[i] < nums[k] < nums[j] < nums[l].
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,2,4,5]
+Output: 2
+Explanation: 
+- When i = 0, j = 1, k = 2, and l = 3, nums[i] < nums[k] < nums[j] < nums[l].
+- When i = 0, j = 1, k = 2, and l = 4, nums[i] < nums[k] < nums[j] < nums[l]. 
+There are no other quadruplets, so we return 2.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: 0
+Explanation: There exists only one quadruplet with i = 0, j = 1, k = 2, l = 3, but since nums[j] < nums[k], we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 4 <= nums.length <= 4000
    • +
  • 1 <= nums[i] <= nums.length
    • +
  • All the integers of nums are unique. nums is a permutation.
    • +
+",3.0,False,"class Solution { +public: + long long countQuadruplets(vector& nums) { + + } +};","class Solution { + public long countQuadruplets(int[] nums) { + + } +}","class Solution(object): + def countQuadruplets(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countQuadruplets(self, nums: List[int]) -> int: + ","long long countQuadruplets(int* nums, int numsSize){ + +}","public class Solution { + public long CountQuadruplets(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countQuadruplets = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_quadruplets(nums) + +end","class Solution { + func countQuadruplets(_ nums: [Int]) -> Int { + + } +}","func countQuadruplets(nums []int) int64 { + +}","object Solution { + def countQuadruplets(nums: Array[Int]): Long = { + + } +}","class Solution { + fun countQuadruplets(nums: IntArray): Long { + + } +}","impl Solution { + pub fn count_quadruplets(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countQuadruplets($nums) { + + } +}","function countQuadruplets(nums: number[]): number { + +};","(define/contract (count-quadruplets nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_quadruplets(Nums :: [integer()]) -> integer(). +count_quadruplets(Nums) -> + .","defmodule Solution do + @spec count_quadruplets(nums :: [integer]) :: integer + def count_quadruplets(nums) do + + end +end","class Solution { + int countQuadruplets(List nums) { + + } +}", +139,put-marbles-in-bags,Put Marbles in Bags,2551.0,2681.0,"

You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k.

+ +

Divide the marbles into the k bags according to the following rules:

+ +
    +
  • No bag is empty.
    • +
  • If the ith marble and jth marble are in a bag, then all marbles with an index between the ith and jth indices should also be in that same bag.
    • +
  • If a bag consists of all the marbles with an index from i to j inclusively, then the cost of the bag is weights[i] + weights[j].
    • +
+ +

The score after distributing the marbles is the sum of the costs of all the k bags.

+ +

Return the difference between the maximum and minimum scores among marble distributions.

+ +

 

+

Example 1:

+ +
+Input: weights = [1,3,5,1], k = 2
+Output: 4
+Explanation: 
+The distribution [1],[3,5,1] results in the minimal score of (1+1) + (3+1) = 6. 
+The distribution [1,3],[5,1], results in the maximal score of (1+3) + (5+1) = 10. 
+Thus, we return their difference 10 - 6 = 4.
+
+ +

Example 2:

+ +
+Input: weights = [1, 3], k = 2
+Output: 0
+Explanation: The only distribution possible is [1],[3]. 
+Since both the maximal and minimal score are the same, we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= weights.length <= 105
    • +
  • 1 <= weights[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + long long putMarbles(vector& weights, int k) { + + } +};","class Solution { + public long putMarbles(int[] weights, int k) { + + } +}","class Solution(object): + def putMarbles(self, weights, k): + """""" + :type weights: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def putMarbles(self, weights: List[int], k: int) -> int: + ","long long putMarbles(int* weights, int weightsSize, int k){ + +}","public class Solution { + public long PutMarbles(int[] weights, int k) { + + } +}","/** + * @param {number[]} weights + * @param {number} k + * @return {number} + */ +var putMarbles = function(weights, k) { + +};","# @param {Integer[]} weights +# @param {Integer} k +# @return {Integer} +def put_marbles(weights, k) + +end","class Solution { + func putMarbles(_ weights: [Int], _ k: Int) -> Int { + + } +}","func putMarbles(weights []int, k int) int64 { + +}","object Solution { + def putMarbles(weights: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun putMarbles(weights: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn put_marbles(weights: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $weights + * @param Integer $k + * @return Integer + */ + function putMarbles($weights, $k) { + + } +}","function putMarbles(weights: number[], k: number): number { + +};","(define/contract (put-marbles weights k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec put_marbles(Weights :: [integer()], K :: integer()) -> integer(). +put_marbles(Weights, K) -> + .","defmodule Solution do + @spec put_marbles(weights :: [integer], k :: integer) :: integer + def put_marbles(weights, k) do + + end +end","class Solution { + int putMarbles(List weights, int k) { + + } +}", +140,count-collisions-of-monkeys-on-a-polygon,Count Collisions of Monkeys on a Polygon,2550.0,2680.0,"

There is a regular convex polygon with n vertices. The vertices are labeled from 0 to n - 1 in a clockwise direction, and each vertex has exactly one monkey. The following figure shows a convex polygon of 6 vertices.

+ +

Each monkey moves simultaneously to a neighboring vertex. A neighboring vertex for a vertex i can be:

+ +
    +
  • the vertex (i + 1) % n in the clockwise direction, or
    • +
  • the vertex (i - 1 + n) % n in the counter-clockwise direction.
    • +
+ +

A collision happens if at least two monkeys reside on the same vertex after the movement or intersect on an edge.

+ +

Return the number of ways the monkeys can move so that at least one collision happens. Since the answer may be very large, return it modulo 109 + 7.

+ +

Note that each monkey can only move once.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 6
+Explanation: There are 8 total possible movements.
+Two ways such that they collide at some point are:
+- Monkey 1 moves in a clockwise direction; monkey 2 moves in an anticlockwise direction; monkey 3 moves in a clockwise direction. Monkeys 1 and 2 collide.
+- Monkey 1 moves in an anticlockwise direction; monkey 2 moves in an anticlockwise direction; monkey 3 moves in a clockwise direction. Monkeys 1 and 3 collide.
+It can be shown 6 total movements result in a collision.
+
+ +

Example 2:

+ +
+Input: n = 4
+Output: 14
+Explanation: It can be shown that there are 14 ways for the monkeys to collide.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n <= 109
    • +
+",2.0,False,"class Solution { +public: + int monkeyMove(int n) { + + } +};","class Solution { + public int monkeyMove(int n) { + + } +}","class Solution(object): + def monkeyMove(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def monkeyMove(self, n: int) -> int: + ","int monkeyMove(int n){ + +}","public class Solution { + public int MonkeyMove(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var monkeyMove = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def monkey_move(n) + +end","class Solution { + func monkeyMove(_ n: Int) -> Int { + + } +}","func monkeyMove(n int) int { + +}","object Solution { + def monkeyMove(n: Int): Int = { + + } +}","class Solution { + fun monkeyMove(n: Int): Int { + + } +}","impl Solution { + pub fn monkey_move(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function monkeyMove($n) { + + } +}","function monkeyMove(n: number): number { + +};","(define/contract (monkey-move n) + (-> exact-integer? exact-integer?) + + )","-spec monkey_move(N :: integer()) -> integer(). +monkey_move(N) -> + .","defmodule Solution do + @spec monkey_move(n :: integer) :: integer + def monkey_move(n) do + + end +end","class Solution { + int monkeyMove(int n) { + + } +}", +142,design-graph-with-shortest-path-calculator,Design Graph With Shortest Path Calculator,2642.0,2678.0,"

There is a directed weighted graph that consists of n nodes numbered from 0 to n - 1. The edges of the graph are initially represented by the given array edges where edges[i] = [fromi, toi, edgeCosti] meaning that there is an edge from fromi to toi with the cost edgeCosti.

+ +

Implement the Graph class:

+ +
    +
  • Graph(int n, int[][] edges) initializes the object with n nodes and the given edges.
    • +
  • addEdge(int[] edge) adds an edge to the list of edges where edge = [from, to, edgeCost]. It is guaranteed that there is no edge between the two nodes before adding this one.
    • +
  • int shortestPath(int node1, int node2) returns the minimum cost of a path from node1 to node2. If no path exists, return -1. The cost of a path is the sum of the costs of the edges in the path.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Graph", "shortestPath", "shortestPath", "addEdge", "shortestPath"]
+[[4, [[0, 2, 5], [0, 1, 2], [1, 2, 1], [3, 0, 3]]], [3, 2], [0, 3], [[1, 3, 4]], [0, 3]]
+Output
+[null, 6, -1, null, 6]
+
+Explanation
+Graph g = new Graph(4, [[0, 2, 5], [0, 1, 2], [1, 2, 1], [3, 0, 3]]);
+g.shortestPath(3, 2); // return 6. The shortest path from 3 to 2 in the first diagram above is 3 -> 0 -> 1 -> 2 with a total cost of 3 + 2 + 1 = 6.
+g.shortestPath(0, 3); // return -1. There is no path from 0 to 3.
+g.addEdge([1, 3, 4]); // We add an edge from node 1 to node 3, and we get the second diagram above.
+g.shortestPath(0, 3); // return 6. The shortest path from 0 to 3 now is 0 -> 1 -> 3 with a total cost of 2 + 4 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 0 <= edges.length <= n * (n - 1)
    • +
  • edges[i].length == edge.length == 3
    • +
  • 0 <= fromi, toi, from, to, node1, node2 <= n - 1
    • +
  • 1 <= edgeCosti, edgeCost <= 106
    • +
  • There are no repeated edges and no self-loops in the graph at any point.
    • +
  • At most 100 calls will be made for addEdge.
    • +
  • At most 100 calls will be made for shortestPath.
    • +
+",3.0,False,"class Graph { +public: + Graph(int n, vector>& edges) { + + } + + void addEdge(vector edge) { + + } + + int shortestPath(int node1, int node2) { + + } +}; + +/** + * Your Graph object will be instantiated and called as such: + * Graph* obj = new Graph(n, edges); + * obj->addEdge(edge); + * int param_2 = obj->shortestPath(node1,node2); + */","class Graph { + + public Graph(int n, int[][] edges) { + + } + + public void addEdge(int[] edge) { + + } + + public int shortestPath(int node1, int node2) { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * Graph obj = new Graph(n, edges); + * obj.addEdge(edge); + * int param_2 = obj.shortestPath(node1,node2); + */","class Graph(object): + + def __init__(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + """""" + + + def addEdge(self, edge): + """""" + :type edge: List[int] + :rtype: None + """""" + + + def shortestPath(self, node1, node2): + """""" + :type node1: int + :type node2: int + :rtype: int + """""" + + + +# Your Graph object will be instantiated and called as such: +# obj = Graph(n, edges) +# obj.addEdge(edge) +# param_2 = obj.shortestPath(node1,node2)","class Graph: + + def __init__(self, n: int, edges: List[List[int]]): + + + def addEdge(self, edge: List[int]) -> None: + + + def shortestPath(self, node1: int, node2: int) -> int: + + + +# Your Graph object will be instantiated and called as such: +# obj = Graph(n, edges) +# obj.addEdge(edge) +# param_2 = obj.shortestPath(node1,node2)"," + + +typedef struct { + +} Graph; + + +Graph* graphCreate(int n, int** edges, int edgesSize, int* edgesColSize) { + +} + +void graphAddEdge(Graph* obj, int* edge, int edgeSize) { + +} + +int graphShortestPath(Graph* obj, int node1, int node2) { + +} + +void graphFree(Graph* obj) { + +} + +/** + * Your Graph struct will be instantiated and called as such: + * Graph* obj = graphCreate(n, edges, edgesSize, edgesColSize); + * graphAddEdge(obj, edge, edgeSize); + + * int param_2 = graphShortestPath(obj, node1, node2); + + * graphFree(obj); +*/","public class Graph { + + public Graph(int n, int[][] edges) { + + } + + public void AddEdge(int[] edge) { + + } + + public int ShortestPath(int node1, int node2) { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * Graph obj = new Graph(n, edges); + * obj.AddEdge(edge); + * int param_2 = obj.ShortestPath(node1,node2); + */","/** + * @param {number} n + * @param {number[][]} edges + */ +var Graph = function(n, edges) { + +}; + +/** + * @param {number[]} edge + * @return {void} + */ +Graph.prototype.addEdge = function(edge) { + +}; + +/** + * @param {number} node1 + * @param {number} node2 + * @return {number} + */ +Graph.prototype.shortestPath = function(node1, node2) { + +}; + +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */","class Graph + +=begin + :type n: Integer + :type edges: Integer[][] +=end + def initialize(n, edges) + + end + + +=begin + :type edge: Integer[] + :rtype: Void +=end + def add_edge(edge) + + end + + +=begin + :type node1: Integer + :type node2: Integer + :rtype: Integer +=end + def shortest_path(node1, node2) + + end + + +end + +# Your Graph object will be instantiated and called as such: +# obj = Graph.new(n, edges) +# obj.add_edge(edge) +# param_2 = obj.shortest_path(node1, node2)"," +class Graph { + + init(_ n: Int, _ edges: [[Int]]) { + + } + + func addEdge(_ edge: [Int]) { + + } + + func shortestPath(_ node1: Int, _ node2: Int) -> Int { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * let obj = Graph(n, edges) + * obj.addEdge(edge) + * let ret_2: Int = obj.shortestPath(node1, node2) + */","type Graph struct { + +} + + +func Constructor(n int, edges [][]int) Graph { + +} + + +func (this *Graph) AddEdge(edge []int) { + +} + + +func (this *Graph) ShortestPath(node1 int, node2 int) int { + +} + + +/** + * Your Graph object will be instantiated and called as such: + * obj := Constructor(n, edges); + * obj.AddEdge(edge); + * param_2 := obj.ShortestPath(node1,node2); + */","class Graph(_n: Int, _edges: Array[Array[Int]]) { + + def addEdge(edge: Array[Int]) { + + } + + def shortestPath(node1: Int, node2: Int): Int = { + + } + +} + +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */","class Graph(n: Int, edges: Array) { + + fun addEdge(edge: IntArray) { + + } + + fun shortestPath(node1: Int, node2: Int): Int { + + } + +} + +/** + * Your Graph object will be instantiated and called as such: + * var obj = Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */","struct Graph { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Graph { + + fn new(n: i32, edges: Vec>) -> Self { + + } + + fn add_edge(&self, edge: Vec) { + + } + + fn shortest_path(&self, node1: i32, node2: i32) -> i32 { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * let obj = Graph::new(n, edges); + * obj.add_edge(edge); + * let ret_2: i32 = obj.shortest_path(node1, node2); + */","class Graph { + /** + * @param Integer $n + * @param Integer[][] $edges + */ + function __construct($n, $edges) { + + } + + /** + * @param Integer[] $edge + * @return NULL + */ + function addEdge($edge) { + + } + + /** + * @param Integer $node1 + * @param Integer $node2 + * @return Integer + */ + function shortestPath($node1, $node2) { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * $obj = Graph($n, $edges); + * $obj->addEdge($edge); + * $ret_2 = $obj->shortestPath($node1, $node2); + */","class Graph { + constructor(n: number, edges: number[][]) { + + } + + addEdge(edge: number[]): void { + + } + + shortestPath(node1: number, node2: number): number { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * var obj = new Graph(n, edges) + * obj.addEdge(edge) + * var param_2 = obj.shortestPath(node1,node2) + */","(define graph% + (class object% + (super-new) + + ; n : exact-integer? + ; edges : (listof (listof exact-integer?)) + (init-field + n + edges) + + ; add-edge : (listof exact-integer?) -> void? + (define/public (add-edge edge) + + ) + ; shortest-path : exact-integer? exact-integer? -> exact-integer? + (define/public (shortest-path node1 node2) + + ))) + +;; Your graph% object will be instantiated and called as such: +;; (define obj (new graph% [n n] [edges edges])) +;; (send obj add-edge edge) +;; (define param_2 (send obj shortest-path node1 node2))","-spec graph_init_(N :: integer(), Edges :: [[integer()]]) -> any(). +graph_init_(N, Edges) -> + . + +-spec graph_add_edge(Edge :: [integer()]) -> any(). +graph_add_edge(Edge) -> + . + +-spec graph_shortest_path(Node1 :: integer(), Node2 :: integer()) -> integer(). +graph_shortest_path(Node1, Node2) -> + . + + +%% Your functions will be called as such: +%% graph_init_(N, Edges), +%% graph_add_edge(Edge), +%% Param_2 = graph_shortest_path(Node1, Node2), + +%% graph_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Graph do + @spec init_(n :: integer, edges :: [[integer]]) :: any + def init_(n, edges) do + + end + + @spec add_edge(edge :: [integer]) :: any + def add_edge(edge) do + + end + + @spec shortest_path(node1 :: integer, node2 :: integer) :: integer + def shortest_path(node1, node2) do + + end +end + +# Your functions will be called as such: +# Graph.init_(n, edges) +# Graph.add_edge(edge) +# param_2 = Graph.shortest_path(node1, node2) + +# Graph.init_ will be called before every test case, in which you can do some necessary initializations.","class Graph { + + Graph(int n, List> edges) { + + } + + void addEdge(List edge) { + + } + + int shortestPath(int node1, int node2) { + + } +} + +/** + * Your Graph object will be instantiated and called as such: + * Graph obj = Graph(n, edges); + * obj.addEdge(edge); + * int param2 = obj.shortestPath(node1,node2); + */", +144,find-the-score-of-all-prefixes-of-an-array,Find the Score of All Prefixes of an Array,2640.0,2676.0,"

We define the conversion array conver of an array arr as follows:

+ +
    +
  • conver[i] = arr[i] + max(arr[0..i]) where max(arr[0..i]) is the maximum value of arr[j] over 0 <= j <= i.
    • +
+ +

We also define the score of an array arr as the sum of the values of the conversion array of arr.

+ +

Given a 0-indexed integer array nums of length n, return an array ans of length n where ans[i] is the score of the prefix nums[0..i].

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,7,5,10]
+Output: [4,10,24,36,56]
+Explanation: 
+For the prefix [2], the conversion array is [4] hence the score is 4
+For the prefix [2, 3], the conversion array is [4, 6] hence the score is 10
+For the prefix [2, 3, 7], the conversion array is [4, 6, 14] hence the score is 24
+For the prefix [2, 3, 7, 5], the conversion array is [4, 6, 14, 12] hence the score is 36
+For the prefix [2, 3, 7, 5, 10], the conversion array is [4, 6, 14, 12, 20] hence the score is 56
+
+ +

Example 2:

+ +
+Input: nums = [1,1,2,4,8,16]
+Output: [2,4,8,16,32,64]
+Explanation: 
+For the prefix [1], the conversion array is [2] hence the score is 2
+For the prefix [1, 1], the conversion array is [2, 2] hence the score is 4
+For the prefix [1, 1, 2], the conversion array is [2, 2, 4] hence the score is 8
+For the prefix [1, 1, 2, 4], the conversion array is [2, 2, 4, 8] hence the score is 16
+For the prefix [1, 1, 2, 4, 8], the conversion array is [2, 2, 4, 8, 16] hence the score is 32
+For the prefix [1, 1, 2, 4, 8, 16], the conversion array is [2, 2, 4, 8, 16, 32] hence the score is 64
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + vector findPrefixScore(vector& nums) { + + } +};","class Solution { + public long[] findPrefixScore(int[] nums) { + + } +}","class Solution(object): + def findPrefixScore(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def findPrefixScore(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* findPrefixScore(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public long[] FindPrefixScore(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var findPrefixScore = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def find_prefix_score(nums) + +end","class Solution { + func findPrefixScore(_ nums: [Int]) -> [Int] { + + } +}","func findPrefixScore(nums []int) []int64 { + +}","object Solution { + def findPrefixScore(nums: Array[Int]): Array[Long] = { + + } +}","class Solution { + fun findPrefixScore(nums: IntArray): LongArray { + + } +}","impl Solution { + pub fn find_prefix_score(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function findPrefixScore($nums) { + + } +}","function findPrefixScore(nums: number[]): number[] { + +};","(define/contract (find-prefix-score nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec find_prefix_score(Nums :: [integer()]) -> [integer()]. +find_prefix_score(Nums) -> + .","defmodule Solution do + @spec find_prefix_score(nums :: [integer]) :: [integer] + def find_prefix_score(nums) do + + end +end","class Solution { + List findPrefixScore(List nums) { + + } +}", +146,maximize-win-from-two-segments,Maximize Win From Two Segments,2555.0,2673.0,"

There are some prizes on the X-axis. You are given an integer array prizePositions that is sorted in non-decreasing order, where prizePositions[i] is the position of the ith prize. There could be different prizes at the same position on the line. You are also given an integer k.

+ +

You are allowed to select two segments with integer endpoints. The length of each segment must be k. You will collect all prizes whose position falls within at least one of the two selected segments (including the endpoints of the segments). The two selected segments may intersect.

+ +
    +
  • For example if k = 2, you can choose segments [1, 3] and [2, 4], and you will win any prize i that satisfies 1 <= prizePositions[i] <= 3 or 2 <= prizePositions[i] <= 4.
    • +
+ +

Return the maximum number of prizes you can win if you choose the two segments optimally.

+ +

 

+

Example 1:

+ +
+Input: prizePositions = [1,1,2,2,3,3,5], k = 2
+Output: 7
+Explanation: In this example, you can win all 7 prizes by selecting two segments [1, 3] and [3, 5].
+
+ +

Example 2:

+ +
+Input: prizePositions = [1,2,3,4], k = 0
+Output: 2
+Explanation: For this example, one choice for the segments is [3, 3] and [4, 4], and you will be able to get 2 prizes. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= prizePositions.length <= 105
    • +
  • 1 <= prizePositions[i] <= 109
    • +
  • 0 <= k <= 109
    • +
  • prizePositions is sorted in non-decreasing order.
    • +
+ +

 

+ +",2.0,False,"class Solution { +public: + int maximizeWin(vector& prizePositions, int k) { + + } +};","class Solution { + public int maximizeWin(int[] prizePositions, int k) { + + } +}","class Solution(object): + def maximizeWin(self, prizePositions, k): + """""" + :type prizePositions: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximizeWin(self, prizePositions: List[int], k: int) -> int: + ","int maximizeWin(int* prizePositions, int prizePositionsSize, int k){ + +}","public class Solution { + public int MaximizeWin(int[] prizePositions, int k) { + + } +}","/** + * @param {number[]} prizePositions + * @param {number} k + * @return {number} + */ +var maximizeWin = function(prizePositions, k) { + +};","# @param {Integer[]} prize_positions +# @param {Integer} k +# @return {Integer} +def maximize_win(prize_positions, k) + +end","class Solution { + func maximizeWin(_ prizePositions: [Int], _ k: Int) -> Int { + + } +}","func maximizeWin(prizePositions []int, k int) int { + +}","object Solution { + def maximizeWin(prizePositions: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maximizeWin(prizePositions: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn maximize_win(prize_positions: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $prizePositions + * @param Integer $k + * @return Integer + */ + function maximizeWin($prizePositions, $k) { + + } +}","function maximizeWin(prizePositions: number[], k: number): number { + +};","(define/contract (maximize-win prizePositions k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximize_win(PrizePositions :: [integer()], K :: integer()) -> integer(). +maximize_win(PrizePositions, K) -> + .","defmodule Solution do + @spec maximize_win(prize_positions :: [integer], k :: integer) :: integer + def maximize_win(prize_positions, k) do + + end +end","class Solution { + int maximizeWin(List prizePositions, int k) { + + } +}", +147,shortest-cycle-in-a-graph,Shortest Cycle in a Graph,2608.0,2671.0,"

There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1. The edges in the graph are represented by a given 2D integer array edges, where edges[i] = [ui, vi] denotes an edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself.

+ +

Return the length of the shortest cycle in the graph. If no cycle exists, return -1.

+ +

A cycle is a path that starts and ends at the same node, and each edge in the path is used only once.

+ +

 

+

Example 1:

+ +
+Input: n = 7, edges = [[0,1],[1,2],[2,0],[3,4],[4,5],[5,6],[6,3]]
+Output: 3
+Explanation: The cycle with the smallest length is : 0 -> 1 -> 2 -> 0 
+
+ +

Example 2:

+ +
+Input: n = 4, edges = [[0,1],[0,2]]
+Output: -1
+Explanation: There are no cycles in this graph.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 1000
    • +
  • 1 <= edges.length <= 1000
    • +
  • edges[i].length == 2
    • +
  • 0 <= ui, vi < n
    • +
  • ui != vi
    • +
  • There are no repeated edges.
    • +
+",3.0,False,"class Solution { +public: + int findShortestCycle(int n, vector>& edges) { + + } +};","class Solution { + public int findShortestCycle(int n, int[][] edges) { + + } +}","class Solution(object): + def findShortestCycle(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findShortestCycle(self, n: int, edges: List[List[int]]) -> int: + ","int findShortestCycle(int n, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int FindShortestCycle(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var findShortestCycle = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer} +def find_shortest_cycle(n, edges) + +end","class Solution { + func findShortestCycle(_ n: Int, _ edges: [[Int]]) -> Int { + + } +}","func findShortestCycle(n int, edges [][]int) int { + +}","object Solution { + def findShortestCycle(n: Int, edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findShortestCycle(n: Int, edges: Array): Int { + + } +}","impl Solution { + pub fn find_shortest_cycle(n: i32, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer + */ + function findShortestCycle($n, $edges) { + + } +}","function findShortestCycle(n: number, edges: number[][]): number { + +};","(define/contract (find-shortest-cycle n edges) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_shortest_cycle(N :: integer(), Edges :: [[integer()]]) -> integer(). +find_shortest_cycle(N, Edges) -> + .","defmodule Solution do + @spec find_shortest_cycle(n :: integer, edges :: [[integer]]) :: integer + def find_shortest_cycle(n, edges) do + + end +end","class Solution { + int findShortestCycle(int n, List> edges) { + + } +}", +152,maximize-greatness-of-an-array,Maximize Greatness of an Array,2592.0,2664.0,"

You are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing.

+ +

We define the greatness of nums be the number of indices 0 <= i < nums.length for which perm[i] > nums[i].

+ +

Return the maximum possible greatness you can achieve after permuting nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,5,2,1,3,1]
+Output: 4
+Explanation: One of the optimal rearrangements is perm = [2,5,1,3,3,1,1].
+At indices = 0, 1, 3, and 4, perm[i] > nums[i]. Hence, we return 4.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: 3
+Explanation: We can prove the optimal perm is [2,3,4,1].
+At indices = 0, 1, and 2, perm[i] > nums[i]. Hence, we return 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int maximizeGreatness(vector& nums) { + + } +};","class Solution { + public int maximizeGreatness(int[] nums) { + + } +}","class Solution(object): + def maximizeGreatness(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maximizeGreatness(self, nums: List[int]) -> int: + ","int maximizeGreatness(int* nums, int numsSize){ + +}","public class Solution { + public int MaximizeGreatness(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maximizeGreatness = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def maximize_greatness(nums) + +end","class Solution { + func maximizeGreatness(_ nums: [Int]) -> Int { + + } +}","func maximizeGreatness(nums []int) int { + +}","object Solution { + def maximizeGreatness(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maximizeGreatness(nums: IntArray): Int { + + } +}","impl Solution { + pub fn maximize_greatness(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maximizeGreatness($nums) { + + } +}","function maximizeGreatness(nums: number[]): number { + +};","(define/contract (maximize-greatness nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximize_greatness(Nums :: [integer()]) -> integer(). +maximize_greatness(Nums) -> + .","defmodule Solution do + @spec maximize_greatness(nums :: [integer]) :: integer + def maximize_greatness(nums) do + + end +end","class Solution { + int maximizeGreatness(List nums) { + + } +}", +153,distribute-money-to-maximum-children,Distribute Money to Maximum Children,2591.0,2663.0,"

You are given an integer money denoting the amount of money (in dollars) that you have and another integer children denoting the number of children that you must distribute the money to.

+ +

You have to distribute the money according to the following rules:

+ +
    +
  • All money must be distributed.
    • +
  • Everyone must receive at least 1 dollar.
    • +
  • Nobody receives 4 dollars.
    • +
+ +

Return the maximum number of children who may receive exactly 8 dollars if you distribute the money according to the aforementioned rules. If there is no way to distribute the money, return -1.

+ +

 

+

Example 1:

+ +
+Input: money = 20, children = 3
+Output: 1
+Explanation: 
+The maximum number of children with 8 dollars will be 1. One of the ways to distribute the money is:
+- 8 dollars to the first child.
+- 9 dollars to the second child. 
+- 3 dollars to the third child.
+It can be proven that no distribution exists such that number of children getting 8 dollars is greater than 1.
+
+ +

Example 2:

+ +
+Input: money = 16, children = 2
+Output: 2
+Explanation: Each child can be given 8 dollars.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= money <= 200
    • +
  • 2 <= children <= 30
    • +
+",1.0,False,"class Solution { +public: + int distMoney(int money, int children) { + + } +};","class Solution { + public int distMoney(int money, int children) { + + } +}","class Solution(object): + def distMoney(self, money, children): + """""" + :type money: int + :type children: int + :rtype: int + """""" + ","class Solution: + def distMoney(self, money: int, children: int) -> int: + ","int distMoney(int money, int children){ + +}","public class Solution { + public int DistMoney(int money, int children) { + + } +}","/** + * @param {number} money + * @param {number} children + * @return {number} + */ +var distMoney = function(money, children) { + +};","# @param {Integer} money +# @param {Integer} children +# @return {Integer} +def dist_money(money, children) + +end","class Solution { + func distMoney(_ money: Int, _ children: Int) -> Int { + + } +}","func distMoney(money int, children int) int { + +}","object Solution { + def distMoney(money: Int, children: Int): Int = { + + } +}","class Solution { + fun distMoney(money: Int, children: Int): Int { + + } +}","impl Solution { + pub fn dist_money(money: i32, children: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $money + * @param Integer $children + * @return Integer + */ + function distMoney($money, $children) { + + } +}","function distMoney(money: number, children: number): number { + +};","(define/contract (dist-money money children) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec dist_money(Money :: integer(), Children :: integer()) -> integer(). +dist_money(Money, Children) -> + .","defmodule Solution do + @spec dist_money(money :: integer, children :: integer) :: integer + def dist_money(money, children) do + + end +end","class Solution { + int distMoney(int money, int children) { + + } +}", +157,minimum-time-to-complete-all-tasks,Minimum Time to Complete All Tasks,2589.0,2657.0,"

There is a computer that can run an unlimited number of tasks at the same time. You are given a 2D integer array tasks where tasks[i] = [starti, endi, durationi] indicates that the ith task should run for a total of durationi seconds (not necessarily continuous) within the inclusive time range [starti, endi].

+ +

You may turn on the computer only when it needs to run a task. You can also turn it off if it is idle.

+ +

Return the minimum time during which the computer should be turned on to complete all tasks.

+ +

 

+

Example 1:

+ +
+Input: tasks = [[2,3,1],[4,5,1],[1,5,2]]
+Output: 2
+Explanation: 
+- The first task can be run in the inclusive time range [2, 2].
+- The second task can be run in the inclusive time range [5, 5].
+- The third task can be run in the two inclusive time ranges [2, 2] and [5, 5].
+The computer will be on for a total of 2 seconds.
+
+ +

Example 2:

+ +
+Input: tasks = [[1,3,2],[2,5,3],[5,6,2]]
+Output: 4
+Explanation: 
+- The first task can be run in the inclusive time range [2, 3].
+- The second task can be run in the inclusive time ranges [2, 3] and [5, 5].
+- The third task can be run in the two inclusive time range [5, 6].
+The computer will be on for a total of 4 seconds.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tasks.length <= 2000
    • +
  • tasks[i].length == 3
    • +
  • 1 <= starti, endi <= 2000
    • +
  • 1 <= durationi <= endi - starti + 1
    • +
+",3.0,False,"class Solution { +public: + int findMinimumTime(vector>& tasks) { + + } +};","class Solution { + public int findMinimumTime(int[][] tasks) { + + } +}","class Solution(object): + def findMinimumTime(self, tasks): + """""" + :type tasks: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findMinimumTime(self, tasks: List[List[int]]) -> int: + ","int findMinimumTime(int** tasks, int tasksSize, int* tasksColSize){ + +}","public class Solution { + public int FindMinimumTime(int[][] tasks) { + + } +}","/** + * @param {number[][]} tasks + * @return {number} + */ +var findMinimumTime = function(tasks) { + +};","# @param {Integer[][]} tasks +# @return {Integer} +def find_minimum_time(tasks) + +end","class Solution { + func findMinimumTime(_ tasks: [[Int]]) -> Int { + + } +}","func findMinimumTime(tasks [][]int) int { + +}","object Solution { + def findMinimumTime(tasks: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findMinimumTime(tasks: Array): Int { + + } +}","impl Solution { + pub fn find_minimum_time(tasks: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $tasks + * @return Integer + */ + function findMinimumTime($tasks) { + + } +}","function findMinimumTime(tasks: number[][]): number { + +};","(define/contract (find-minimum-time tasks) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_minimum_time(Tasks :: [[integer()]]) -> integer(). +find_minimum_time(Tasks) -> + .","defmodule Solution do + @spec find_minimum_time(tasks :: [[integer]]) :: integer + def find_minimum_time(tasks) do + + end +end","class Solution { + int findMinimumTime(List> tasks) { + + } +}", +159,rearrange-array-to-maximize-prefix-score,Rearrange Array to Maximize Prefix Score,2587.0,2655.0,"

You are given a 0-indexed integer array nums. You can rearrange the elements of nums to any order (including the given order).

+ +

Let prefix be the array containing the prefix sums of nums after rearranging it. In other words, prefix[i] is the sum of the elements from 0 to i in nums after rearranging it. The score of nums is the number of positive integers in the array prefix.

+ +

Return the maximum score you can achieve.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,-1,0,1,-3,3,-3]
+Output: 6
+Explanation: We can rearrange the array into nums = [2,3,1,-1,-3,0,-3].
+prefix = [2,5,6,5,2,2,-1], so the score is 6.
+It can be shown that 6 is the maximum score we can obtain.
+
+ +

Example 2:

+ +
+Input: nums = [-2,-3,0]
+Output: 0
+Explanation: Any rearrangement of the array will result in a score of 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -106 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + int maxScore(vector& nums) { + + } +};","class Solution { + public int maxScore(int[] nums) { + + } +}","class Solution(object): + def maxScore(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxScore(self, nums: List[int]) -> int: + ","int maxScore(int* nums, int numsSize){ + +}","public class Solution { + public int MaxScore(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxScore = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_score(nums) + +end","class Solution { + func maxScore(_ nums: [Int]) -> Int { + + } +}","func maxScore(nums []int) int { + +}","object Solution { + def maxScore(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxScore(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_score(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxScore($nums) { + + } +}","function maxScore(nums: number[]): number { + +};","(define/contract (max-score nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_score(Nums :: [integer()]) -> integer(). +max_score(Nums) -> + .","defmodule Solution do + @spec max_score(nums :: [integer]) :: integer + def max_score(nums) do + + end +end","class Solution { + int maxScore(List nums) { + + } +}", +161,count-number-of-possible-root-nodes,Count Number of Possible Root Nodes,2581.0,2652.0,"

Alice has an undirected tree with n nodes labeled from 0 to n - 1. The tree is represented as a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Alice wants Bob to find the root of the tree. She allows Bob to make several guesses about her tree. In one guess, he does the following:

+ +
    +
  • Chooses two distinct integers u and v such that there exists an edge [u, v] in the tree.
    • +
  • He tells Alice that u is the parent of v in the tree.
    • +
+ +

Bob's guesses are represented by a 2D integer array guesses where guesses[j] = [uj, vj] indicates Bob guessed uj to be the parent of vj.

+ +

Alice being lazy, does not reply to each of Bob's guesses, but just says that at least k of his guesses are true.

+ +

Given the 2D integer arrays edges, guesses and the integer k, return the number of possible nodes that can be the root of Alice's tree. If there is no such tree, return 0.

+ +

 

+

Example 1:

+ +

+ +
+Input: edges = [[0,1],[1,2],[1,3],[4,2]], guesses = [[1,3],[0,1],[1,0],[2,4]], k = 3
+Output: 3
+Explanation: 
+Root = 0, correct guesses = [1,3], [0,1], [2,4]
+Root = 1, correct guesses = [1,3], [1,0], [2,4]
+Root = 2, correct guesses = [1,3], [1,0], [2,4]
+Root = 3, correct guesses = [1,0], [2,4]
+Root = 4, correct guesses = [1,3], [1,0]
+Considering 0, 1, or 2 as root node leads to 3 correct guesses.
+
+
+ +

Example 2:

+ +

+ +
+Input: edges = [[0,1],[1,2],[2,3],[3,4]], guesses = [[1,0],[3,4],[2,1],[3,2]], k = 1
+Output: 5
+Explanation: 
+Root = 0, correct guesses = [3,4]
+Root = 1, correct guesses = [1,0], [3,4]
+Root = 2, correct guesses = [1,0], [2,1], [3,4]
+Root = 3, correct guesses = [1,0], [2,1], [3,2], [3,4]
+Root = 4, correct guesses = [1,0], [2,1], [3,2]
+Considering any node as root will give at least 1 correct guess. 
+
+
+ +

 

+

Constraints:

+ +
    +
  • edges.length == n - 1
    • +
  • 2 <= n <= 105
    • +
  • 1 <= guesses.length <= 105
    • +
  • 0 <= ai, bi, uj, vj <= n - 1
    • +
  • ai != bi
    • +
  • uj != vj
    • +
  • edges represents a valid tree.
    • +
  • guesses[j] is an edge of the tree.
    • +
  • guesses is unique.
    • +
  • 0 <= k <= guesses.length
    • +
+",3.0,False,"class Solution { +public: + int rootCount(vector>& edges, vector>& guesses, int k) { + + } +};","class Solution { + public int rootCount(int[][] edges, int[][] guesses, int k) { + + } +}","class Solution(object): + def rootCount(self, edges, guesses, k): + """""" + :type edges: List[List[int]] + :type guesses: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def rootCount(self, edges: List[List[int]], guesses: List[List[int]], k: int) -> int: + ","int rootCount(int** edges, int edgesSize, int* edgesColSize, int** guesses, int guessesSize, int* guessesColSize, int k){ + +}","public class Solution { + public int RootCount(int[][] edges, int[][] guesses, int k) { + + } +}","/** + * @param {number[][]} edges + * @param {number[][]} guesses + * @param {number} k + * @return {number} + */ +var rootCount = function(edges, guesses, k) { + +};","# @param {Integer[][]} edges +# @param {Integer[][]} guesses +# @param {Integer} k +# @return {Integer} +def root_count(edges, guesses, k) + +end","class Solution { + func rootCount(_ edges: [[Int]], _ guesses: [[Int]], _ k: Int) -> Int { + + } +}","func rootCount(edges [][]int, guesses [][]int, k int) int { + +}","object Solution { + def rootCount(edges: Array[Array[Int]], guesses: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun rootCount(edges: Array, guesses: Array, k: Int): Int { + + } +}","impl Solution { + pub fn root_count(edges: Vec>, guesses: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $edges + * @param Integer[][] $guesses + * @param Integer $k + * @return Integer + */ + function rootCount($edges, $guesses, $k) { + + } +}","function rootCount(edges: number[][], guesses: number[][], k: number): number { + +};","(define/contract (root-count edges guesses k) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec root_count(Edges :: [[integer()]], Guesses :: [[integer()]], K :: integer()) -> integer(). +root_count(Edges, Guesses, K) -> + .","defmodule Solution do + @spec root_count(edges :: [[integer]], guesses :: [[integer]], k :: integer) :: integer + def root_count(edges, guesses, k) do + + end +end","class Solution { + int rootCount(List> edges, List> guesses, int k) { + + } +}", +164,count-total-number-of-colored-cells,Count Total Number of Colored Cells,2579.0,2649.0,"

There exists an infinitely large two-dimensional grid of uncolored unit cells. You are given a positive integer n, indicating that you must do the following routine for n minutes:

+ +
    +
  • At the first minute, color any arbitrary unit cell blue.
    • +
  • Every minute thereafter, color blue every uncolored cell that touches a blue cell.
    • +
+ +

Below is a pictorial representation of the state of the grid after minutes 1, 2, and 3.

+ +

Return the number of colored cells at the end of n minutes.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 1
+Explanation: After 1 minute, there is only 1 blue cell, so we return 1.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 5
+Explanation: After 2 minutes, there are 4 colored cells on the boundary and 1 in the center, so we return 5. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
+",2.0,False,"class Solution { +public: + long long coloredCells(int n) { + + } +};","class Solution { + public long coloredCells(int n) { + + } +}","class Solution(object): + def coloredCells(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def coloredCells(self, n: int) -> int: + ","long long coloredCells(int n){ + +}","public class Solution { + public long ColoredCells(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var coloredCells = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def colored_cells(n) + +end","class Solution { + func coloredCells(_ n: Int) -> Int { + + } +}","func coloredCells(n int) int64 { + +}","object Solution { + def coloredCells(n: Int): Long = { + + } +}","class Solution { + fun coloredCells(n: Int): Long { + + } +}","impl Solution { + pub fn colored_cells(n: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function coloredCells($n) { + + } +}","function coloredCells(n: number): number { + +};","(define/contract (colored-cells n) + (-> exact-integer? exact-integer?) + + )","-spec colored_cells(N :: integer()) -> integer(). +colored_cells(N) -> + .","defmodule Solution do + @spec colored_cells(n :: integer) :: integer + def colored_cells(n) do + + end +end","class Solution { + int coloredCells(int n) { + + } +}", +165,number-of-ways-to-earn-points,Number of Ways to Earn Points,2585.0,2648.0,"

There is a test that has n types of questions. You are given an integer target and a 0-indexed 2D integer array types where types[i] = [counti, marksi] indicates that there are counti questions of the ith type, and each one of them is worth marksi points.

+ +
    +
+ +

Return the number of ways you can earn exactly target points in the exam. Since the answer may be too large, return it modulo 109 + 7.

+ +

Note that questions of the same type are indistinguishable.

+ +
    +
  • For example, if there are 3 questions of the same type, then solving the 1st and 2nd questions is the same as solving the 1st and 3rd questions, or the 2nd and 3rd questions.
    • +
+ +

 

+

Example 1:

+ +
+Input: target = 6, types = [[6,1],[3,2],[2,3]]
+Output: 7
+Explanation: You can earn 6 points in one of the seven ways:
+- Solve 6 questions of the 0th type: 1 + 1 + 1 + 1 + 1 + 1 = 6
+- Solve 4 questions of the 0th type and 1 question of the 1st type: 1 + 1 + 1 + 1 + 2 = 6
+- Solve 2 questions of the 0th type and 2 questions of the 1st type: 1 + 1 + 2 + 2 = 6
+- Solve 3 questions of the 0th type and 1 question of the 2nd type: 1 + 1 + 1 + 3 = 6
+- Solve 1 question of the 0th type, 1 question of the 1st type and 1 question of the 2nd type: 1 + 2 + 3 = 6
+- Solve 3 questions of the 1st type: 2 + 2 + 2 = 6
+- Solve 2 questions of the 2nd type: 3 + 3 = 6
+
+ +

Example 2:

+ +
+Input: target = 5, types = [[50,1],[50,2],[50,5]]
+Output: 4
+Explanation: You can earn 5 points in one of the four ways:
+- Solve 5 questions of the 0th type: 1 + 1 + 1 + 1 + 1 = 5
+- Solve 3 questions of the 0th type and 1 question of the 1st type: 1 + 1 + 1 + 2 = 5
+- Solve 1 questions of the 0th type and 2 questions of the 1st type: 1 + 2 + 2 = 5
+- Solve 1 question of the 2nd type: 5
+
+ +

Example 3:

+ +
+Input: target = 18, types = [[6,1],[3,2],[2,3]]
+Output: 1
+Explanation: You can only earn 18 points by answering all questions.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target <= 1000
    • +
  • n == types.length
    • +
  • 1 <= n <= 50
    • +
  • types[i].length == 2
    • +
  • 1 <= counti, marksi <= 50
    • +
+",3.0,False,"class Solution { +public: + int waysToReachTarget(int target, vector>& types) { + + } +};","class Solution { + public int waysToReachTarget(int target, int[][] types) { + + } +}","class Solution(object): + def waysToReachTarget(self, target, types): + """""" + :type target: int + :type types: List[List[int]] + :rtype: int + """""" + ","class Solution: + def waysToReachTarget(self, target: int, types: List[List[int]]) -> int: + ","int waysToReachTarget(int target, int** types, int typesSize, int* typesColSize){ + +}","public class Solution { + public int WaysToReachTarget(int target, int[][] types) { + + } +}","/** + * @param {number} target + * @param {number[][]} types + * @return {number} + */ +var waysToReachTarget = function(target, types) { + +};","# @param {Integer} target +# @param {Integer[][]} types +# @return {Integer} +def ways_to_reach_target(target, types) + +end","class Solution { + func waysToReachTarget(_ target: Int, _ types: [[Int]]) -> Int { + + } +}","func waysToReachTarget(target int, types [][]int) int { + +}","object Solution { + def waysToReachTarget(target: Int, types: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun waysToReachTarget(target: Int, types: Array): Int { + + } +}","impl Solution { + pub fn ways_to_reach_target(target: i32, types: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $target + * @param Integer[][] $types + * @return Integer + */ + function waysToReachTarget($target, $types) { + + } +}","function waysToReachTarget(target: number, types: number[][]): number { + +};","(define/contract (ways-to-reach-target target types) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec ways_to_reach_target(Target :: integer(), Types :: [[integer()]]) -> integer(). +ways_to_reach_target(Target, Types) -> + .","defmodule Solution do + @spec ways_to_reach_target(target :: integer, types :: [[integer]]) :: integer + def ways_to_reach_target(target, types) do + + end +end","class Solution { + int waysToReachTarget(int target, List> types) { + + } +}", +166,split-the-array-to-make-coprime-products,Split the Array to Make Coprime Products,2584.0,2647.0,"

You are given a 0-indexed integer array nums of length n.

+ +

A split at an index i where 0 <= i <= n - 2 is called valid if the product of the first i + 1 elements and the product of the remaining elements are coprime.

+ +
    +
  • For example, if nums = [2, 3, 3], then a split at the index i = 0 is valid because 2 and 9 are coprime, while a split at the index i = 1 is not valid because 6 and 3 are not coprime. A split at the index i = 2 is not valid because i == n - 1.
    • +
+ +

Return the smallest index i at which the array can be split validly or -1 if there is no such split.

+ +

Two values val1 and val2 are coprime if gcd(val1, val2) == 1 where gcd(val1, val2) is the greatest common divisor of val1 and val2.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,7,8,15,3,5]
+Output: 2
+Explanation: The table above shows the values of the product of the first i + 1 elements, the remaining elements, and their gcd at each index i.
+The only valid split is at index 2.
+
+ +

Example 2:

+ +
+Input: nums = [4,7,15,8,3,5]
+Output: -1
+Explanation: The table above shows the values of the product of the first i + 1 elements, the remaining elements, and their gcd at each index i.
+There is no valid split.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 104
    • +
  • 1 <= nums[i] <= 106
    • +
+",3.0,False,"class Solution { +public: + int findValidSplit(vector& nums) { + + } +};","class Solution { + public int findValidSplit(int[] nums) { + + } +}","class Solution(object): + def findValidSplit(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findValidSplit(self, nums: List[int]) -> int: + ","int findValidSplit(int* nums, int numsSize){ + +}","public class Solution { + public int FindValidSplit(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findValidSplit = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_valid_split(nums) + +end","class Solution { + func findValidSplit(_ nums: [Int]) -> Int { + + } +}","func findValidSplit(nums []int) int { + +}","object Solution { + def findValidSplit(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findValidSplit(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_valid_split(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findValidSplit($nums) { + + } +}","function findValidSplit(nums: number[]): number { + +};","(define/contract (find-valid-split nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_valid_split(Nums :: [integer()]) -> integer(). +find_valid_split(Nums) -> + .","defmodule Solution do + @spec find_valid_split(nums :: [integer]) :: integer + def find_valid_split(nums) do + + end +end","class Solution { + int findValidSplit(List nums) { + + } +}", +169,time-to-cross-a-bridge,Time to Cross a Bridge,2532.0,2642.0,"

There are k workers who want to move n boxes from an old warehouse to a new one. You are given the two integers n and k, and a 2D integer array time of size k x 4 where time[i] = [leftToRighti, pickOldi, rightToLefti, putNewi].

+ +

The warehouses are separated by a river and connected by a bridge. The old warehouse is on the right bank of the river, and the new warehouse is on the left bank of the river. Initially, all k workers are waiting on the left side of the bridge. To move the boxes, the ith worker (0-indexed) can :

+ +
    +
  • Cross the bridge from the left bank (new warehouse) to the right bank (old warehouse) in leftToRighti minutes.
    • +
  • Pick a box from the old warehouse and return to the bridge in pickOldi minutes. Different workers can pick up their boxes simultaneously.
    • +
  • Cross the bridge from the right bank (old warehouse) to the left bank (new warehouse) in rightToLefti minutes.
    • +
  • Put the box in the new warehouse and return to the bridge in putNewi minutes. Different workers can put their boxes simultaneously.
    • +
+ +

A worker i is less efficient than a worker j if either condition is met:

+ +
    +
  • leftToRighti + rightToLefti > leftToRightj + rightToLeftj
    • +
  • leftToRighti + rightToLefti == leftToRightj + rightToLeftj and i > j
    • +
+ +

The following rules regulate the movement of the workers through the bridge :

+ +
    +
  • If a worker x reaches the bridge while another worker y is crossing the bridge, x waits at their side of the bridge.
    • +
  • If the bridge is free, the worker waiting on the right side of the bridge gets to cross the bridge. If more than one worker is waiting on the right side, the one with the lowest efficiency crosses first.
    • +
  • If the bridge is free and no worker is waiting on the right side, and at least one box remains at the old warehouse, the worker on the left side of the river gets to cross the bridge. If more than one worker is waiting on the left side, the one with the lowest efficiency crosses first.
    • +
+ +

Return the instance of time at which the last worker reaches the left bank of the river after all n boxes have been put in the new warehouse.

+ +

 

+

Example 1:

+ +
+Input: n = 1, k = 3, time = [[1,1,2,1],[1,1,3,1],[1,1,4,1]]
+Output: 6
+Explanation: 
+From 0 to 1: worker 2 crosses the bridge from the left bank to the right bank.
+From 1 to 2: worker 2 picks up a box from the old warehouse.
+From 2 to 6: worker 2 crosses the bridge from the right bank to the left bank.
+From 6 to 7: worker 2 puts a box at the new warehouse.
+The whole process ends after 7 minutes. We return 6 because the problem asks for the instance of time at which the last worker reaches the left bank.
+
+ +

Example 2:

+ +
+Input: n = 3, k = 2, time = [[1,9,1,8],[10,10,10,10]]
+Output: 50
+Explanation: 
+From 0  to 10: worker 1 crosses the bridge from the left bank to the right bank.
+From 10 to 20: worker 1 picks up a box from the old warehouse.
+From 10 to 11: worker 0 crosses the bridge from the left bank to the right bank.
+From 11 to 20: worker 0 picks up a box from the old warehouse.
+From 20 to 30: worker 1 crosses the bridge from the right bank to the left bank.
+From 30 to 40: worker 1 puts a box at the new warehouse.
+From 30 to 31: worker 0 crosses the bridge from the right bank to the left bank.
+From 31 to 39: worker 0 puts a box at the new warehouse.
+From 39 to 40: worker 0 crosses the bridge from the left bank to the right bank.
+From 40 to 49: worker 0 picks up a box from the old warehouse.
+From 49 to 50: worker 0 crosses the bridge from the right bank to the left bank.
+From 50 to 58: worker 0 puts a box at the new warehouse.
+The whole process ends after 58 minutes. We return 50 because the problem asks for the instance of time at which the last worker reaches the left bank.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n, k <= 104
    • +
  • time.length == k
    • +
  • time[i].length == 4
    • +
  • 1 <= leftToRighti, pickOldi, rightToLefti, putNewi <= 1000
    • +
+",3.0,False,"class Solution { +public: + int findCrossingTime(int n, int k, vector>& time) { + + } +};","class Solution { + public int findCrossingTime(int n, int k, int[][] time) { + + } +}","class Solution(object): + def findCrossingTime(self, n, k, time): + """""" + :type n: int + :type k: int + :type time: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findCrossingTime(self, n: int, k: int, time: List[List[int]]) -> int: + ","int findCrossingTime(int n, int k, int** time, int timeSize, int* timeColSize){ + +}","public class Solution { + public int FindCrossingTime(int n, int k, int[][] time) { + + } +}","/** + * @param {number} n + * @param {number} k + * @param {number[][]} time + * @return {number} + */ +var findCrossingTime = function(n, k, time) { + +};","# @param {Integer} n +# @param {Integer} k +# @param {Integer[][]} time +# @return {Integer} +def find_crossing_time(n, k, time) + +end","class Solution { + func findCrossingTime(_ n: Int, _ k: Int, _ time: [[Int]]) -> Int { + + } +}","func findCrossingTime(n int, k int, time [][]int) int { + +}","object Solution { + def findCrossingTime(n: Int, k: Int, time: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findCrossingTime(n: Int, k: Int, time: Array): Int { + + } +}","impl Solution { + pub fn find_crossing_time(n: i32, k: i32, time: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @param Integer[][] $time + * @return Integer + */ + function findCrossingTime($n, $k, $time) { + + } +}","function findCrossingTime(n: number, k: number, time: number[][]): number { + +};","(define/contract (find-crossing-time n k time) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_crossing_time(N :: integer(), K :: integer(), Time :: [[integer()]]) -> integer(). +find_crossing_time(N, K, Time) -> + .","defmodule Solution do + @spec find_crossing_time(n :: integer, k :: integer, time :: [[integer]]) :: integer + def find_crossing_time(n, k, time) do + + end +end","class Solution { + int findCrossingTime(int n, int k, List> time) { + + } +}", +170,disconnect-path-in-a-binary-matrix-by-at-most-one-flip,Disconnect Path in a Binary Matrix by at Most One Flip,2556.0,2641.0,"

You are given a 0-indexed m x n binary matrix grid. You can move from a cell (row, col) to any of the cells (row + 1, col) or (row, col + 1) that has the value 1. The matrix is disconnected if there is no path from (0, 0) to (m - 1, n - 1).

+ +

You can flip the value of at most one (possibly none) cell. You cannot flip the cells (0, 0) and (m - 1, n - 1).

+ +

Return true if it is possible to make the matrix disconnect or false otherwise.

+ +

Note that flipping a cell changes its value from 0 to 1 or from 1 to 0.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1,1],[1,0,0],[1,1,1]]
+Output: true
+Explanation: We can change the cell shown in the diagram above. There is no path from (0, 0) to (2, 2) in the resulting grid.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
+Output: false
+Explanation: It is not possible to change at most one cell such that there is not path from (0, 0) to (2, 2).
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 1000
    • +
  • 1 <= m * n <= 105
    • +
  • grid[i][j] is either 0 or 1.
    • +
  • grid[0][0] == grid[m - 1][n - 1] == 1
    • +
+",2.0,False,"class Solution { +public: + bool isPossibleToCutPath(vector>& grid) { + + } +};","class Solution { + public boolean isPossibleToCutPath(int[][] grid) { + + } +}","class Solution(object): + def isPossibleToCutPath(self, grid): + """""" + :type grid: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def isPossibleToCutPath(self, grid: List[List[int]]) -> bool: + ","bool isPossibleToCutPath(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public bool IsPossibleToCutPath(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {boolean} + */ +var isPossibleToCutPath = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Boolean} +def is_possible_to_cut_path(grid) + +end","class Solution { + func isPossibleToCutPath(_ grid: [[Int]]) -> Bool { + + } +}","func isPossibleToCutPath(grid [][]int) bool { + +}","object Solution { + def isPossibleToCutPath(grid: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun isPossibleToCutPath(grid: Array): Boolean { + + } +}","impl Solution { + pub fn is_possible_to_cut_path(grid: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Boolean + */ + function isPossibleToCutPath($grid) { + + } +}","function isPossibleToCutPath(grid: number[][]): boolean { + +};","(define/contract (is-possible-to-cut-path grid) + (-> (listof (listof exact-integer?)) boolean?) + + )","-spec is_possible_to_cut_path(Grid :: [[integer()]]) -> boolean(). +is_possible_to_cut_path(Grid) -> + .","defmodule Solution do + @spec is_possible_to_cut_path(grid :: [[integer]]) :: boolean + def is_possible_to_cut_path(grid) do + + end +end","class Solution { + bool isPossibleToCutPath(List> grid) { + + } +}", +171,maximum-number-of-integers-to-choose-from-a-range-i,Maximum Number of Integers to Choose From a Range I,2554.0,2640.0,"

You are given an integer array banned and two integers n and maxSum. You are choosing some number of integers following the below rules:

+ +
    +
  • The chosen integers have to be in the range [1, n].
    • +
  • Each integer can be chosen at most once.
    • +
  • The chosen integers should not be in the array banned.
    • +
  • The sum of the chosen integers should not exceed maxSum.
    • +
+ +

Return the maximum number of integers you can choose following the mentioned rules.

+ +

 

+

Example 1:

+ +
+Input: banned = [1,6,5], n = 5, maxSum = 6
+Output: 2
+Explanation: You can choose the integers 2 and 4.
+2 and 4 are from the range [1, 5], both did not appear in banned, and their sum is 6, which did not exceed maxSum.
+
+ +

Example 2:

+ +
+Input: banned = [1,2,3,4,5,6,7], n = 8, maxSum = 1
+Output: 0
+Explanation: You cannot choose any integer while following the mentioned conditions.
+
+ +

Example 3:

+ +
+Input: banned = [11], n = 7, maxSum = 50
+Output: 7
+Explanation: You can choose the integers 1, 2, 3, 4, 5, 6, and 7.
+They are from the range [1, 7], all did not appear in banned, and their sum is 28, which did not exceed maxSum.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= banned.length <= 104
    • +
  • 1 <= banned[i], n <= 104
    • +
  • 1 <= maxSum <= 109
    • +
+",2.0,False,"class Solution { +public: + int maxCount(vector& banned, int n, int maxSum) { + + } +};","class Solution { + public int maxCount(int[] banned, int n, int maxSum) { + + } +}","class Solution(object): + def maxCount(self, banned, n, maxSum): + """""" + :type banned: List[int] + :type n: int + :type maxSum: int + :rtype: int + """""" + ","class Solution: + def maxCount(self, banned: List[int], n: int, maxSum: int) -> int: + ","int maxCount(int* banned, int bannedSize, int n, int maxSum){ + +}","public class Solution { + public int MaxCount(int[] banned, int n, int maxSum) { + + } +}","/** + * @param {number[]} banned + * @param {number} n + * @param {number} maxSum + * @return {number} + */ +var maxCount = function(banned, n, maxSum) { + +};","# @param {Integer[]} banned +# @param {Integer} n +# @param {Integer} max_sum +# @return {Integer} +def max_count(banned, n, max_sum) + +end","class Solution { + func maxCount(_ banned: [Int], _ n: Int, _ maxSum: Int) -> Int { + + } +}","func maxCount(banned []int, n int, maxSum int) int { + +}","object Solution { + def maxCount(banned: Array[Int], n: Int, maxSum: Int): Int = { + + } +}","class Solution { + fun maxCount(banned: IntArray, n: Int, maxSum: Int): Int { + + } +}","impl Solution { + pub fn max_count(banned: Vec, n: i32, max_sum: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $banned + * @param Integer $n + * @param Integer $maxSum + * @return Integer + */ + function maxCount($banned, $n, $maxSum) { + + } +}","function maxCount(banned: number[], n: number, maxSum: number): number { + +};","(define/contract (max-count banned n maxSum) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec max_count(Banned :: [integer()], N :: integer(), MaxSum :: integer()) -> integer(). +max_count(Banned, N, MaxSum) -> + .","defmodule Solution do + @spec max_count(banned :: [integer], n :: integer, max_sum :: integer) :: integer + def max_count(banned, n, max_sum) do + + end +end","class Solution { + int maxCount(List banned, int n, int maxSum) { + + } +}", +174,check-if-point-is-reachable,Check if Point Is Reachable,2543.0,2635.0,"

There exists an infinitely large grid. You are currently at point (1, 1), and you need to reach the point (targetX, targetY) using a finite number of steps.

+ +

In one step, you can move from point (x, y) to any one of the following points:

+ +
    +
  • (x, y - x)
    • +
  • (x - y, y)
    • +
  • (2 * x, y)
    • +
  • (x, 2 * y)
    • +
+ +

Given two integers targetX and targetY representing the X-coordinate and Y-coordinate of your final position, return true if you can reach the point from (1, 1) using some number of steps, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: targetX = 6, targetY = 9
+Output: false
+Explanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.
+
+ +

Example 2:

+ +
+Input: targetX = 4, targetY = 7
+Output: true
+Explanation: You can follow the path (1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= targetX, targetY <= 109
    • +
+",3.0,False,"class Solution { +public: + bool isReachable(int targetX, int targetY) { + + } +};","class Solution { + public boolean isReachable(int targetX, int targetY) { + + } +}","class Solution(object): + def isReachable(self, targetX, targetY): + """""" + :type targetX: int + :type targetY: int + :rtype: bool + """""" + ","class Solution: + def isReachable(self, targetX: int, targetY: int) -> bool: + ","bool isReachable(int targetX, int targetY){ + +}","public class Solution { + public bool IsReachable(int targetX, int targetY) { + + } +}","/** + * @param {number} targetX + * @param {number} targetY + * @return {boolean} + */ +var isReachable = function(targetX, targetY) { + +};","# @param {Integer} target_x +# @param {Integer} target_y +# @return {Boolean} +def is_reachable(target_x, target_y) + +end","class Solution { + func isReachable(_ targetX: Int, _ targetY: Int) -> Bool { + + } +}","func isReachable(targetX int, targetY int) bool { + +}","object Solution { + def isReachable(targetX: Int, targetY: Int): Boolean = { + + } +}","class Solution { + fun isReachable(targetX: Int, targetY: Int): Boolean { + + } +}","impl Solution { + pub fn is_reachable(target_x: i32, target_y: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $targetX + * @param Integer $targetY + * @return Boolean + */ + function isReachable($targetX, $targetY) { + + } +}","function isReachable(targetX: number, targetY: number): boolean { + +};","(define/contract (is-reachable targetX targetY) + (-> exact-integer? exact-integer? boolean?) + + )","-spec is_reachable(TargetX :: integer(), TargetY :: integer()) -> boolean(). +is_reachable(TargetX, TargetY) -> + .","defmodule Solution do + @spec is_reachable(target_x :: integer, target_y :: integer) :: boolean + def is_reachable(target_x, target_y) do + + end +end","class Solution { + bool isReachable(int targetX, int targetY) { + + } +}", +176,minimum-cost-to-split-an-array,Minimum Cost to Split an Array,2547.0,2633.0,"

You are given an integer array nums and an integer k.

+ +

Split the array into some number of non-empty subarrays. The cost of a split is the sum of the importance value of each subarray in the split.

+ +

Let trimmed(subarray) be the version of the subarray where all numbers which appear only once are removed.

+ +
    +
  • For example, trimmed([3,1,2,4,3,4]) = [3,4,3,4].
    • +
+ +

The importance value of a subarray is k + trimmed(subarray).length.

+ +
    +
  • For example, if a subarray is [1,2,3,3,3,4,4], then trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4].The importance value of this subarray will be k + 5.
    • +
+ +

Return the minimum possible cost of a split of nums.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2,1,3,3], k = 2
+Output: 8
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1,3,3].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1,3,3] is 2 + (2 + 2) = 6.
+The cost of the split is 2 + 6 = 8. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,1,2,1], k = 2
+Output: 6
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1] is 2 + (2) = 4.
+The cost of the split is 2 + 4 = 6. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,1,2,1], k = 5
+Output: 10
+Explanation: We split nums to have one subarray: [1,2,1,2,1].
+The importance value of [1,2,1,2,1] is 5 + (3 + 2) = 10.
+The cost of the split is 10. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] < nums.length
    • +
  • 1 <= k <= 109
    • +
+ +

 

+ +",3.0,False,"class Solution { +public: + int minCost(vector& nums, int k) { + + } +};","class Solution { + public int minCost(int[] nums, int k) { + + } +}","class Solution(object): + def minCost(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minCost(self, nums: List[int], k: int) -> int: + ","int minCost(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinCost(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minCost = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_cost(nums, k) + +end","class Solution { + func minCost(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minCost(nums []int, k int) int { + +}","object Solution { + def minCost(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minCost(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_cost(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minCost($nums, $k) { + + } +}","function minCost(nums: number[], k: number): number { + +};","(define/contract (min-cost nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_cost(Nums :: [integer()], K :: integer()) -> integer(). +min_cost(Nums, K) -> + .","defmodule Solution do + @spec min_cost(nums :: [integer], k :: integer) :: integer + def min_cost(nums, k) do + + end +end","class Solution { + int minCost(List nums, int k) { + + } +}", +177,apply-bitwise-operations-to-make-strings-equal,Apply Bitwise Operations to Make Strings Equal,2546.0,2632.0,"

You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:

+ +
    +
  • Choose two different indices i and j where 0 <= i, j < n.
    • +
  • Simultaneously, replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).
    • +
+ +

For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1), so we will have s = "1110".

+ +

Return true if you can make the string s equal to target, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "1010", target = "0110"
+Output: true
+Explanation: We can do the following operations:
+- Choose i = 2 and j = 0. We have now s = "0010".
+- Choose i = 2 and j = 1. We have now s = "0110".
+Since we can make s equal to target, we return true.
+
+ +

Example 2:

+ +
+Input: s = "11", target = "00"
+Output: false
+Explanation: It is not possible to make s equal to target with any number of operations.
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length == target.length
    • +
  • 2 <= n <= 105
    • +
  • s and target consist of only the digits 0 and 1.
    • +
+",2.0,False,"class Solution { +public: + bool makeStringsEqual(string s, string target) { + + } +};","class Solution { + public boolean makeStringsEqual(String s, String target) { + + } +}","class Solution(object): + def makeStringsEqual(self, s, target): + """""" + :type s: str + :type target: str + :rtype: bool + """""" + ","class Solution: + def makeStringsEqual(self, s: str, target: str) -> bool: + ","bool makeStringsEqual(char * s, char * target){ + +}","public class Solution { + public bool MakeStringsEqual(string s, string target) { + + } +}","/** + * @param {string} s + * @param {string} target + * @return {boolean} + */ +var makeStringsEqual = function(s, target) { + +};","# @param {String} s +# @param {String} target +# @return {Boolean} +def make_strings_equal(s, target) + +end","class Solution { + func makeStringsEqual(_ s: String, _ target: String) -> Bool { + + } +}","func makeStringsEqual(s string, target string) bool { + +}","object Solution { + def makeStringsEqual(s: String, target: String): Boolean = { + + } +}","class Solution { + fun makeStringsEqual(s: String, target: String): Boolean { + + } +}","impl Solution { + pub fn make_strings_equal(s: String, target: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $target + * @return Boolean + */ + function makeStringsEqual($s, $target) { + + } +}","function makeStringsEqual(s: string, target: string): boolean { + +};","(define/contract (make-strings-equal s target) + (-> string? string? boolean?) + + )","-spec make_strings_equal(S :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> boolean(). +make_strings_equal(S, Target) -> + .","defmodule Solution do + @spec make_strings_equal(s :: String.t, target :: String.t) :: boolean + def make_strings_equal(s, target) do + + end +end","class Solution { + bool makeStringsEqual(String s, String target) { + + } +}", +178,sort-the-students-by-their-kth-score,Sort the Students by Their Kth Score,2545.0,2631.0,"

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matrix score contains distinct integers only.

+ +

You are also given an integer k. Sort the students (i.e., the rows of the matrix) by their scores in the kth (0-indexed) exam from the highest to the lowest.

+ +

Return the matrix after sorting it.

+ +

 

+

Example 1:

+ +
+Input: score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2
+Output: [[7,5,11,2],[10,6,9,1],[4,8,3,15]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 11 in exam 2, which is the highest score, so they got first place.
+- The student with index 0 scored 9 in exam 2, which is the second highest score, so they got second place.
+- The student with index 2 scored 3 in exam 2, which is the lowest score, so they got third place.
+
+ +

Example 2:

+ +
+Input: score = [[3,4],[5,6]], k = 0
+Output: [[5,6],[3,4]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 5 in exam 0, which is the highest score, so they got first place.
+- The student with index 0 scored 3 in exam 0, which is the lowest score, so they got second place.
+
+ +

 

+

Constraints:

+ +
    +
  • m == score.length
    • +
  • n == score[i].length
    • +
  • 1 <= m, n <= 250
    • +
  • 1 <= score[i][j] <= 105
    • +
  • score consists of distinct integers.
    • +
  • 0 <= k < n
    • +
+",2.0,False,"class Solution { +public: + vector> sortTheStudents(vector>& score, int k) { + + } +};","class Solution { + public int[][] sortTheStudents(int[][] score, int k) { + + } +}","class Solution(object): + def sortTheStudents(self, score, k): + """""" + :type score: List[List[int]] + :type k: int + :rtype: List[List[int]] + """""" + ","class Solution: + def sortTheStudents(self, score: List[List[int]], k: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** sortTheStudents(int** score, int scoreSize, int* scoreColSize, int k, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] SortTheStudents(int[][] score, int k) { + + } +}","/** + * @param {number[][]} score + * @param {number} k + * @return {number[][]} + */ +var sortTheStudents = function(score, k) { + +};","# @param {Integer[][]} score +# @param {Integer} k +# @return {Integer[][]} +def sort_the_students(score, k) + +end","class Solution { + func sortTheStudents(_ score: [[Int]], _ k: Int) -> [[Int]] { + + } +}","func sortTheStudents(score [][]int, k int) [][]int { + +}","object Solution { + def sortTheStudents(score: Array[Array[Int]], k: Int): Array[Array[Int]] = { + + } +}","class Solution { + fun sortTheStudents(score: Array, k: Int): Array { + + } +}","impl Solution { + pub fn sort_the_students(score: Vec>, k: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $score + * @param Integer $k + * @return Integer[][] + */ + function sortTheStudents($score, $k) { + + } +}","function sortTheStudents(score: number[][], k: number): number[][] { + +};","(define/contract (sort-the-students score k) + (-> (listof (listof exact-integer?)) exact-integer? (listof (listof exact-integer?))) + + )","-spec sort_the_students(Score :: [[integer()]], K :: integer()) -> [[integer()]]. +sort_the_students(Score, K) -> + .","defmodule Solution do + @spec sort_the_students(score :: [[integer]], k :: integer) :: [[integer]] + def sort_the_students(score, k) do + + end +end","class Solution { + List> sortTheStudents(List> score, int k) { + + } +}", +180,minimize-the-maximum-of-two-arrays,Minimize the Maximum of Two Arrays,2513.0,2628.0,"

We have two arrays arr1 and arr2 which are initially empty. You need to add positive integers to them such that they satisfy all the following conditions:

+ +
    +
  • arr1 contains uniqueCnt1 distinct positive integers, each of which is not divisible by divisor1.
    • +
  • arr2 contains uniqueCnt2 distinct positive integers, each of which is not divisible by divisor2.
    • +
  • No integer is present in both arr1 and arr2.
    • +
+ +

Given divisor1, divisor2, uniqueCnt1, and uniqueCnt2, return the minimum possible maximum integer that can be present in either array.

+ +

 

+

Example 1:

+ +
+Input: divisor1 = 2, divisor2 = 7, uniqueCnt1 = 1, uniqueCnt2 = 3
+Output: 4
+Explanation: 
+We can distribute the first 4 natural numbers into arr1 and arr2.
+arr1 = [1] and arr2 = [2,3,4].
+We can see that both arrays satisfy all the conditions.
+Since the maximum value is 4, we return it.
+
+ +

Example 2:

+ +
+Input: divisor1 = 3, divisor2 = 5, uniqueCnt1 = 2, uniqueCnt2 = 1
+Output: 3
+Explanation: 
+Here arr1 = [1,2], and arr2 = [3] satisfy all conditions.
+Since the maximum value is 3, we return it.
+ +

Example 3:

+ +
+Input: divisor1 = 2, divisor2 = 4, uniqueCnt1 = 8, uniqueCnt2 = 2
+Output: 15
+Explanation: 
+Here, the final possible arrays can be arr1 = [1,3,5,7,9,11,13,15], and arr2 = [2,6].
+It can be shown that it is not possible to obtain a lower maximum satisfying all conditions. 
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= divisor1, divisor2 <= 105
    • +
  • 1 <= uniqueCnt1, uniqueCnt2 < 109
    • +
  • 2 <= uniqueCnt1 + uniqueCnt2 <= 109
    • +
+",2.0,False,"class Solution { +public: + int minimizeSet(int divisor1, int divisor2, int uniqueCnt1, int uniqueCnt2) { + + } +};","class Solution { + public int minimizeSet(int divisor1, int divisor2, int uniqueCnt1, int uniqueCnt2) { + + } +}","class Solution(object): + def minimizeSet(self, divisor1, divisor2, uniqueCnt1, uniqueCnt2): + """""" + :type divisor1: int + :type divisor2: int + :type uniqueCnt1: int + :type uniqueCnt2: int + :rtype: int + """""" + ","class Solution: + def minimizeSet(self, divisor1: int, divisor2: int, uniqueCnt1: int, uniqueCnt2: int) -> int: + ","int minimizeSet(int divisor1, int divisor2, int uniqueCnt1, int uniqueCnt2){ + +}","public class Solution { + public int MinimizeSet(int divisor1, int divisor2, int uniqueCnt1, int uniqueCnt2) { + + } +}","/** + * @param {number} divisor1 + * @param {number} divisor2 + * @param {number} uniqueCnt1 + * @param {number} uniqueCnt2 + * @return {number} + */ +var minimizeSet = function(divisor1, divisor2, uniqueCnt1, uniqueCnt2) { + +};","# @param {Integer} divisor1 +# @param {Integer} divisor2 +# @param {Integer} unique_cnt1 +# @param {Integer} unique_cnt2 +# @return {Integer} +def minimize_set(divisor1, divisor2, unique_cnt1, unique_cnt2) + +end","class Solution { + func minimizeSet(_ divisor1: Int, _ divisor2: Int, _ uniqueCnt1: Int, _ uniqueCnt2: Int) -> Int { + + } +}","func minimizeSet(divisor1 int, divisor2 int, uniqueCnt1 int, uniqueCnt2 int) int { + +}","object Solution { + def minimizeSet(divisor1: Int, divisor2: Int, uniqueCnt1: Int, uniqueCnt2: Int): Int = { + + } +}","class Solution { + fun minimizeSet(divisor1: Int, divisor2: Int, uniqueCnt1: Int, uniqueCnt2: Int): Int { + + } +}","impl Solution { + pub fn minimize_set(divisor1: i32, divisor2: i32, unique_cnt1: i32, unique_cnt2: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $divisor1 + * @param Integer $divisor2 + * @param Integer $uniqueCnt1 + * @param Integer $uniqueCnt2 + * @return Integer + */ + function minimizeSet($divisor1, $divisor2, $uniqueCnt1, $uniqueCnt2) { + + } +}","function minimizeSet(divisor1: number, divisor2: number, uniqueCnt1: number, uniqueCnt2: number): number { + +};","(define/contract (minimize-set divisor1 divisor2 uniqueCnt1 uniqueCnt2) + (-> exact-integer? exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec minimize_set(Divisor1 :: integer(), Divisor2 :: integer(), UniqueCnt1 :: integer(), UniqueCnt2 :: integer()) -> integer(). +minimize_set(Divisor1, Divisor2, UniqueCnt1, UniqueCnt2) -> + .","defmodule Solution do + @spec minimize_set(divisor1 :: integer, divisor2 :: integer, unique_cnt1 :: integer, unique_cnt2 :: integer) :: integer + def minimize_set(divisor1, divisor2, unique_cnt1, unique_cnt2) do + + end +end","class Solution { + int minimizeSet(int divisor1, int divisor2, int uniqueCnt1, int uniqueCnt2) { + + } +}", +181,difference-between-maximum-and-minimum-price-sum,Difference Between Maximum and Minimum Price Sum,2538.0,2627.0,"

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

+ +

The price sum of a given path is the sum of the prices of all nodes lying on that path.

+ +

The tree can be rooted at any node root of your choice. The incurred cost after choosing root is the difference between the maximum and minimum price sum amongst all paths starting at root.

+ +

Return the maximum possible cost amongst all possible root choices.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]
+Output: 24
+Explanation: The diagram above denotes the tree after rooting it at node 2. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [2,1,3,4]: the prices are [7,8,6,10], and the sum of the prices is 31.
+- The second path contains the node [2] with the price [7].
+The difference between the maximum and minimum price sum is 24. It can be proved that 24 is the maximum cost.
+
+ +

Example 2:

+ +
+Input: n = 3, edges = [[0,1],[1,2]], price = [1,1,1]
+Output: 2
+Explanation: The diagram above denotes the tree after rooting it at node 0. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [0,1,2]: the prices are [1,1,1], and the sum of the prices is 3.
+- The second path contains node [0] with a price [1].
+The difference between the maximum and minimum price sum is 2. It can be proved that 2 is the maximum cost.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • edges.length == n - 1
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • edges represents a valid tree.
    • +
  • price.length == n
    • +
  • 1 <= price[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + long long maxOutput(int n, vector>& edges, vector& price) { + + } +};","class Solution { + public long maxOutput(int n, int[][] edges, int[] price) { + + } +}","class Solution(object): + def maxOutput(self, n, edges, price): + """""" + :type n: int + :type edges: List[List[int]] + :type price: List[int] + :rtype: int + """""" + ","class Solution: + def maxOutput(self, n: int, edges: List[List[int]], price: List[int]) -> int: + ","long long maxOutput(int n, int** edges, int edgesSize, int* edgesColSize, int* price, int priceSize){ + +}","public class Solution { + public long MaxOutput(int n, int[][] edges, int[] price) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} price + * @return {number} + */ +var maxOutput = function(n, edges, price) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer[]} price +# @return {Integer} +def max_output(n, edges, price) + +end","class Solution { + func maxOutput(_ n: Int, _ edges: [[Int]], _ price: [Int]) -> Int { + + } +}","func maxOutput(n int, edges [][]int, price []int) int64 { + +}","object Solution { + def maxOutput(n: Int, edges: Array[Array[Int]], price: Array[Int]): Long = { + + } +}","class Solution { + fun maxOutput(n: Int, edges: Array, price: IntArray): Long { + + } +}","impl Solution { + pub fn max_output(n: i32, edges: Vec>, price: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer[] $price + * @return Integer + */ + function maxOutput($n, $edges, $price) { + + } +}","function maxOutput(n: number, edges: number[][], price: number[]): number { + +};","(define/contract (max-output n edges price) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec max_output(N :: integer(), Edges :: [[integer()]], Price :: [integer()]) -> integer(). +max_output(N, Edges, Price) -> + .","defmodule Solution do + @spec max_output(n :: integer, edges :: [[integer]], price :: [integer]) :: integer + def max_output(n, edges, price) do + + end +end","class Solution { + int maxOutput(int n, List> edges, List price) { + + } +}", +188,maximize-the-minimum-powered-city,Maximize the Minimum Powered City,2528.0,2618.0,"

You are given a 0-indexed integer array stations of length n, where stations[i] represents the number of power stations in the ith city.

+ +

Each power station can provide power to every city in a fixed range. In other words, if the range is denoted by r, then a power station at city i can provide power to all cities j such that |i - j| <= r and 0 <= i, j <= n - 1.

+ +
    +
  • Note that |x| denotes absolute value. For example, |7 - 5| = 2 and |3 - 10| = 7.
    • +
+ +

The power of a city is the total number of power stations it is being provided power from.

+ +

The government has sanctioned building k more power stations, each of which can be built in any city, and have the same range as the pre-existing ones.

+ +

Given the two integers r and k, return the maximum possible minimum power of a city, if the additional power stations are built optimally.

+ +

Note that you can build the k power stations in multiple cities.

+ +

 

+

Example 1:

+ +
+Input: stations = [1,2,4,5,0], r = 1, k = 2
+Output: 5
+Explanation: 
+One of the optimal ways is to install both the power stations at city 1. 
+So stations will become [1,4,4,5,0].
+- City 0 is provided by 1 + 4 = 5 power stations.
+- City 1 is provided by 1 + 4 + 4 = 9 power stations.
+- City 2 is provided by 4 + 4 + 5 = 13 power stations.
+- City 3 is provided by 5 + 4 = 9 power stations.
+- City 4 is provided by 5 + 0 = 5 power stations.
+So the minimum power of a city is 5.
+Since it is not possible to obtain a larger power, we return 5.
+
+ +

Example 2:

+ +
+Input: stations = [4,4,4,4], r = 0, k = 3
+Output: 4
+Explanation: 
+It can be proved that we cannot make the minimum power of a city greater than 4.
+
+ +

 

+

Constraints:

+ +
    +
  • n == stations.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= stations[i] <= 105
    • +
  • 0 <= r <= n - 1
    • +
  • 0 <= k <= 109
    • +
+",3.0,False,"class Solution { +public: + long long maxPower(vector& stations, int r, int k) { + + } +};","class Solution { + public long maxPower(int[] stations, int r, int k) { + + } +}","class Solution(object): + def maxPower(self, stations, r, k): + """""" + :type stations: List[int] + :type r: int + :type k: int + :rtype: int + """""" + ","class Solution: + def maxPower(self, stations: List[int], r: int, k: int) -> int: + ","long long maxPower(int* stations, int stationsSize, int r, int k){ + +}","public class Solution { + public long MaxPower(int[] stations, int r, int k) { + + } +}","/** + * @param {number[]} stations + * @param {number} r + * @param {number} k + * @return {number} + */ +var maxPower = function(stations, r, k) { + +};","# @param {Integer[]} stations +# @param {Integer} r +# @param {Integer} k +# @return {Integer} +def max_power(stations, r, k) + +end","class Solution { + func maxPower(_ stations: [Int], _ r: Int, _ k: Int) -> Int { + + } +}","func maxPower(stations []int, r int, k int) int64 { + +}","object Solution { + def maxPower(stations: Array[Int], r: Int, k: Int): Long = { + + } +}","class Solution { + fun maxPower(stations: IntArray, r: Int, k: Int): Long { + + } +}","impl Solution { + pub fn max_power(stations: Vec, r: i32, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $stations + * @param Integer $r + * @param Integer $k + * @return Integer + */ + function maxPower($stations, $r, $k) { + + } +}","function maxPower(stations: number[], r: number, k: number): number { + +};","(define/contract (max-power stations r k) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec max_power(Stations :: [integer()], R :: integer(), K :: integer()) -> integer(). +max_power(Stations, R, K) -> + .","defmodule Solution do + @spec max_power(stations :: [integer], r :: integer, k :: integer) :: integer + def max_power(stations, r, k) do + + end +end","class Solution { + int maxPower(List stations, int r, int k) { + + } +}", +190,make-number-of-distinct-characters-equal,Make Number of Distinct Characters Equal,2531.0,2615.0,"

You are given two 0-indexed strings word1 and word2.

+ +

A move consists of choosing two indices i and j such that 0 <= i < word1.length and 0 <= j < word2.length and swapping word1[i] with word2[j].

+ +

Return true if it is possible to get the number of distinct characters in word1 and word2 to be equal with exactly one move. Return false otherwise.

+ +

 

+

Example 1:

+ +
+Input: word1 = "ac", word2 = "b"
+Output: false
+Explanation: Any pair of swaps would yield two distinct characters in the first string, and one in the second string.
+
+ +

Example 2:

+ +
+Input: word1 = "abcc", word2 = "aab"
+Output: true
+Explanation: We swap index 2 of the first string with index 0 of the second string. The resulting strings are word1 = "abac" and word2 = "cab", which both have 3 distinct characters.
+
+ +

Example 3:

+ +
+Input: word1 = "abcde", word2 = "fghij"
+Output: true
+Explanation: Both resulting strings will have 5 distinct characters, regardless of which indices we swap.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word1.length, word2.length <= 105
    • +
  • word1 and word2 consist of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + bool isItPossible(string word1, string word2) { + + } +};","class Solution { + public boolean isItPossible(String word1, String word2) { + + } +}","class Solution(object): + def isItPossible(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: bool + """""" + ","class Solution: + def isItPossible(self, word1: str, word2: str) -> bool: + ","bool isItPossible(char * word1, char * word2){ + +}","public class Solution { + public bool IsItPossible(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {boolean} + */ +var isItPossible = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {Boolean} +def is_it_possible(word1, word2) + +end","class Solution { + func isItPossible(_ word1: String, _ word2: String) -> Bool { + + } +}","func isItPossible(word1 string, word2 string) bool { + +}","object Solution { + def isItPossible(word1: String, word2: String): Boolean = { + + } +}","class Solution { + fun isItPossible(word1: String, word2: String): Boolean { + + } +}","impl Solution { + pub fn is_it_possible(word1: String, word2: String) -> bool { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return Boolean + */ + function isItPossible($word1, $word2) { + + } +}","function isItPossible(word1: string, word2: string): boolean { + +};","(define/contract (is-it-possible word1 word2) + (-> string? string? boolean?) + + )","-spec is_it_possible(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> boolean(). +is_it_possible(Word1, Word2) -> + .","defmodule Solution do + @spec is_it_possible(word1 :: String.t, word2 :: String.t) :: boolean + def is_it_possible(word1, word2) do + + end +end","class Solution { + bool isItPossible(String word1, String word2) { + + } +}", +192,closest-prime-numbers-in-range,Closest Prime Numbers in Range,2523.0,2610.0,"

Given two positive integers left and right, find the two integers num1 and num2 such that:

+ +
    +
  • left <= nums1 < nums2 <= right .
    • +
  • nums1 and nums2 are both prime numbers.
    • +
  • nums2 - nums1 is the minimum amongst all other pairs satisfying the above conditions.
    • +
+ +

Return the positive integer array ans = [nums1, nums2]. If there are multiple pairs satisfying these conditions, return the one with the minimum nums1 value or [-1, -1] if such numbers do not exist.

+ +

A number greater than 1 is called prime if it is only divisible by 1 and itself.

+ +

 

+

Example 1:

+ +
+Input: left = 10, right = 19
+Output: [11,13]
+Explanation: The prime numbers between 10 and 19 are 11, 13, 17, and 19.
+The closest gap between any pair is 2, which can be achieved by [11,13] or [17,19].
+Since 11 is smaller than 17, we return the first pair.
+
+ +

Example 2:

+ +
+Input: left = 4, right = 6
+Output: [-1,-1]
+Explanation: There exists only one prime number in the given range, so the conditions cannot be satisfied.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left <= right <= 106
    • +
+ +

 

+ +",2.0,False,"class Solution { +public: + vector closestPrimes(int left, int right) { + + } +};","class Solution { + public int[] closestPrimes(int left, int right) { + + } +}","class Solution(object): + def closestPrimes(self, left, right): + """""" + :type left: int + :type right: int + :rtype: List[int] + """""" + ","class Solution: + def closestPrimes(self, left: int, right: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* closestPrimes(int left, int right, int* returnSize){ + +}","public class Solution { + public int[] ClosestPrimes(int left, int right) { + + } +}","/** + * @param {number} left + * @param {number} right + * @return {number[]} + */ +var closestPrimes = function(left, right) { + +};","# @param {Integer} left +# @param {Integer} right +# @return {Integer[]} +def closest_primes(left, right) + +end","class Solution { + func closestPrimes(_ left: Int, _ right: Int) -> [Int] { + + } +}","func closestPrimes(left int, right int) []int { + +}","object Solution { + def closestPrimes(left: Int, right: Int): Array[Int] = { + + } +}","class Solution { + fun closestPrimes(left: Int, right: Int): IntArray { + + } +}","impl Solution { + pub fn closest_primes(left: i32, right: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $left + * @param Integer $right + * @return Integer[] + */ + function closestPrimes($left, $right) { + + } +}","function closestPrimes(left: number, right: number): number[] { + +};","(define/contract (closest-primes left right) + (-> exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec closest_primes(Left :: integer(), Right :: integer()) -> [integer()]. +closest_primes(Left, Right) -> + .","defmodule Solution do + @spec closest_primes(left :: integer, right :: integer) :: [integer] + def closest_primes(left, right) do + + end +end","class Solution { + List closestPrimes(int left, int right) { + + } +}", +193,distinct-prime-factors-of-product-of-array,Distinct Prime Factors of Product of Array,2521.0,2609.0,"

Given an array of positive integers nums, return the number of distinct prime factors in the product of the elements of nums.

+ +

Note that:

+ +
    +
  • A number greater than 1 is called prime if it is divisible by only 1 and itself.
    • +
  • An integer val1 is a factor of another integer val2 if val2 / val1 is an integer.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [2,4,3,7,10,6]
+Output: 4
+Explanation:
+The product of all the elements in nums is: 2 * 4 * 3 * 7 * 10 * 6 = 10080 = 25 * 32 * 5 * 7.
+There are 4 distinct prime factors so we return 4.
+
+ +

Example 2:

+ +
+Input: nums = [2,4,8,16]
+Output: 1
+Explanation:
+The product of all the elements in nums is: 2 * 4 * 8 * 16 = 1024 = 210.
+There is 1 distinct prime factor so we return 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • 2 <= nums[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int distinctPrimeFactors(vector& nums) { + + } +};","class Solution { + public int distinctPrimeFactors(int[] nums) { + + } +}","class Solution(object): + def distinctPrimeFactors(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def distinctPrimeFactors(self, nums: List[int]) -> int: + ","int distinctPrimeFactors(int* nums, int numsSize){ + +}","public class Solution { + public int DistinctPrimeFactors(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var distinctPrimeFactors = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def distinct_prime_factors(nums) + +end","class Solution { + func distinctPrimeFactors(_ nums: [Int]) -> Int { + + } +}","func distinctPrimeFactors(nums []int) int { + +}","object Solution { + def distinctPrimeFactors(nums: Array[Int]): Int = { + + } +}","class Solution { + fun distinctPrimeFactors(nums: IntArray): Int { + + } +}","impl Solution { + pub fn distinct_prime_factors(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function distinctPrimeFactors($nums) { + + } +}","function distinctPrimeFactors(nums: number[]): number { + +};","(define/contract (distinct-prime-factors nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec distinct_prime_factors(Nums :: [integer()]) -> integer(). +distinct_prime_factors(Nums) -> + .","defmodule Solution do + @spec distinct_prime_factors(nums :: [integer]) :: integer + def distinct_prime_factors(nums) do + + end +end","class Solution { + int distinctPrimeFactors(List nums) { + + } +}", +195,difference-between-ones-and-zeros-in-row-and-column,Difference Between Ones and Zeros in Row and Column,2482.0,2606.0,"

You are given a 0-indexed m x n binary matrix grid.

+ +

A 0-indexed m x n difference matrix diff is created with the following procedure:

+ +
    +
  • Let the number of ones in the ith row be onesRowi.
    • +
  • Let the number of ones in the jth column be onesColj.
    • +
  • Let the number of zeros in the ith row be zerosRowi.
    • +
  • Let the number of zeros in the jth column be zerosColj.
    • +
  • diff[i][j] = onesRowi + onesColj - zerosRowi - zerosColj
    • +
+ +

Return the difference matrix diff.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,1],[1,0,1],[0,0,1]]
+Output: [[0,0,4],[0,0,4],[-2,-2,2]]
+Explanation:
+- diff[0][0] = onesRow0 + onesCol0 - zerosRow0 - zerosCol0 = 2 + 1 - 1 - 2 = 0 
+- diff[0][1] = onesRow0 + onesCol1 - zerosRow0 - zerosCol1 = 2 + 1 - 1 - 2 = 0 
+- diff[0][2] = onesRow0 + onesCol2 - zerosRow0 - zerosCol2 = 2 + 3 - 1 - 0 = 4 
+- diff[1][0] = onesRow1 + onesCol0 - zerosRow1 - zerosCol0 = 2 + 1 - 1 - 2 = 0 
+- diff[1][1] = onesRow1 + onesCol1 - zerosRow1 - zerosCol1 = 2 + 1 - 1 - 2 = 0 
+- diff[1][2] = onesRow1 + onesCol2 - zerosRow1 - zerosCol2 = 2 + 3 - 1 - 0 = 4 
+- diff[2][0] = onesRow2 + onesCol0 - zerosRow2 - zerosCol0 = 1 + 1 - 2 - 2 = -2
+- diff[2][1] = onesRow2 + onesCol1 - zerosRow2 - zerosCol1 = 1 + 1 - 2 - 2 = -2
+- diff[2][2] = onesRow2 + onesCol2 - zerosRow2 - zerosCol2 = 1 + 3 - 2 - 0 = 2
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,1],[1,1,1]]
+Output: [[5,5,5],[5,5,5]]
+Explanation:
+- diff[0][0] = onesRow0 + onesCol0 - zerosRow0 - zerosCol0 = 3 + 2 - 0 - 0 = 5
+- diff[0][1] = onesRow0 + onesCol1 - zerosRow0 - zerosCol1 = 3 + 2 - 0 - 0 = 5
+- diff[0][2] = onesRow0 + onesCol2 - zerosRow0 - zerosCol2 = 3 + 2 - 0 - 0 = 5
+- diff[1][0] = onesRow1 + onesCol0 - zerosRow1 - zerosCol0 = 3 + 2 - 0 - 0 = 5
+- diff[1][1] = onesRow1 + onesCol1 - zerosRow1 - zerosCol1 = 3 + 2 - 0 - 0 = 5
+- diff[1][2] = onesRow1 + onesCol2 - zerosRow1 - zerosCol2 = 3 + 2 - 0 - 0 = 5
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 105
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + vector> onesMinusZeros(vector>& grid) { + + } +};","class Solution { + public int[][] onesMinusZeros(int[][] grid) { + + } +}","class Solution(object): + def onesMinusZeros(self, grid): + """""" + :type grid: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def onesMinusZeros(self, grid: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** onesMinusZeros(int** grid, int gridSize, int* gridColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] OnesMinusZeros(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number[][]} + */ +var onesMinusZeros = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer[][]} +def ones_minus_zeros(grid) + +end","class Solution { + func onesMinusZeros(_ grid: [[Int]]) -> [[Int]] { + + } +}","func onesMinusZeros(grid [][]int) [][]int { + +}","object Solution { + def onesMinusZeros(grid: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun onesMinusZeros(grid: Array): Array { + + } +}","impl Solution { + pub fn ones_minus_zeros(grid: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer[][] + */ + function onesMinusZeros($grid) { + + } +}","function onesMinusZeros(grid: number[][]): number[][] { + +};","(define/contract (ones-minus-zeros grid) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec ones_minus_zeros(Grid :: [[integer()]]) -> [[integer()]]. +ones_minus_zeros(Grid) -> + .","defmodule Solution do + @spec ones_minus_zeros(grid :: [[integer]]) :: [[integer]] + def ones_minus_zeros(grid) do + + end +end","class Solution { + List> onesMinusZeros(List> grid) { + + } +}", +196,count-anagrams,Count Anagrams,2514.0,2605.0,"

You are given a string s containing one or more words. Every consecutive pair of words is separated by a single space ' '.

+ +

A string t is an anagram of string s if the ith word of t is a permutation of the ith word of s.

+ +
    +
  • For example, "acb dfe" is an anagram of "abc def", but "def cab" and "adc bef" are not.
    • +
+ +

Return the number of distinct anagrams of s. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "too hot"
+Output: 18
+Explanation: Some of the anagrams of the given string are "too hot", "oot hot", "oto toh", "too toh", and "too oht".
+
+ +

Example 2:

+ +
+Input: s = "aa"
+Output: 1
+Explanation: There is only one anagram possible for the given string.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters and spaces ' '.
    • +
  • There is single space between consecutive words.
    • +
+",3.0,False,"class Solution { +public: + int countAnagrams(string s) { + + } +};","class Solution { + public int countAnagrams(String s) { + + } +}","class Solution(object): + def countAnagrams(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def countAnagrams(self, s: str) -> int: + ","int countAnagrams(char * s){ + +}","public class Solution { + public int CountAnagrams(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var countAnagrams = function(s) { + +};","# @param {String} s +# @return {Integer} +def count_anagrams(s) + +end","class Solution { + func countAnagrams(_ s: String) -> Int { + + } +}","func countAnagrams(s string) int { + +}","object Solution { + def countAnagrams(s: String): Int = { + + } +}","class Solution { + fun countAnagrams(s: String): Int { + + } +}","impl Solution { + pub fn count_anagrams(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function countAnagrams($s) { + + } +}","function countAnagrams(s: string): number { + +};","(define/contract (count-anagrams s) + (-> string? exact-integer?) + + )","-spec count_anagrams(S :: unicode:unicode_binary()) -> integer(). +count_anagrams(S) -> + .","defmodule Solution do + @spec count_anagrams(s :: String.t) :: integer + def count_anagrams(s) do + + end +end","class Solution { + int countAnagrams(String s) { + + } +}", +198,reward-top-k-students,Reward Top K Students,2512.0,2603.0,"

You are given two string arrays positive_feedback and negative_feedback, containing the words denoting positive and negative feedback, respectively. Note that no word is both positive and negative.

+ +

Initially every student has 0 points. Each positive word in a feedback report increases the points of a student by 3, whereas each negative word decreases the points by 1.

+ +

You are given n feedback reports, represented by a 0-indexed string array report and a 0-indexed integer array student_id, where student_id[i] represents the ID of the student who has received the feedback report report[i]. The ID of each student is unique.

+ +

Given an integer k, return the top k students after ranking them in non-increasing order by their points. In case more than one student has the same points, the one with the lower ID ranks higher.

+ +

 

+

Example 1:

+ +
+Input: positive_feedback = ["smart","brilliant","studious"], negative_feedback = ["not"], report = ["this student is studious","the student is smart"], student_id = [1,2], k = 2
+Output: [1,2]
+Explanation: 
+Both the students have 1 positive feedback and 3 points but since student 1 has a lower ID he ranks higher.
+
+ +

Example 2:

+ +
+Input: positive_feedback = ["smart","brilliant","studious"], negative_feedback = ["not"], report = ["this student is not studious","the student is smart"], student_id = [1,2], k = 2
+Output: [2,1]
+Explanation: 
+- The student with ID 1 has 1 positive feedback and 1 negative feedback, so he has 3-1=2 points. 
+- The student with ID 2 has 1 positive feedback, so he has 3 points. 
+Since student 2 has more points, [2,1] is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= positive_feedback.length, negative_feedback.length <= 104
    • +
  • 1 <= positive_feedback[i].length, negative_feedback[j].length <= 100
    • +
  • Both positive_feedback[i] and negative_feedback[j] consists of lowercase English letters.
    • +
  • No word is present in both positive_feedback and negative_feedback.
    • +
  • n == report.length == student_id.length
    • +
  • 1 <= n <= 104
    • +
  • report[i] consists of lowercase English letters and spaces ' '.
    • +
  • There is a single space between consecutive words of report[i].
    • +
  • 1 <= report[i].length <= 100
    • +
  • 1 <= student_id[i] <= 109
    • +
  • All the values of student_id[i] are unique.
    • +
  • 1 <= k <= n
    • +
+",2.0,False,"class Solution { +public: + vector topStudents(vector& positive_feedback, vector& negative_feedback, vector& report, vector& student_id, int k) { + + } +};","class Solution { + public List topStudents(String[] positive_feedback, String[] negative_feedback, String[] report, int[] student_id, int k) { + + } +}","class Solution(object): + def topStudents(self, positive_feedback, negative_feedback, report, student_id, k): + """""" + :type positive_feedback: List[str] + :type negative_feedback: List[str] + :type report: List[str] + :type student_id: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def topStudents(self, positive_feedback: List[str], negative_feedback: List[str], report: List[str], student_id: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* topStudents(char ** positive_feedback, int positive_feedbackSize, char ** negative_feedback, int negative_feedbackSize, char ** report, int reportSize, int* student_id, int student_idSize, int k, int* returnSize){ + +}","public class Solution { + public IList TopStudents(string[] positive_feedback, string[] negative_feedback, string[] report, int[] student_id, int k) { + + } +}","/** + * @param {string[]} positive_feedback + * @param {string[]} negative_feedback + * @param {string[]} report + * @param {number[]} student_id + * @param {number} k + * @return {number[]} + */ +var topStudents = function(positive_feedback, negative_feedback, report, student_id, k) { + +};","# @param {String[]} positive_feedback +# @param {String[]} negative_feedback +# @param {String[]} report +# @param {Integer[]} student_id +# @param {Integer} k +# @return {Integer[]} +def top_students(positive_feedback, negative_feedback, report, student_id, k) + +end","class Solution { + func topStudents(_ positive_feedback: [String], _ negative_feedback: [String], _ report: [String], _ student_id: [Int], _ k: Int) -> [Int] { + + } +}","func topStudents(positive_feedback []string, negative_feedback []string, report []string, student_id []int, k int) []int { + +}","object Solution { + def topStudents(positive_feedback: Array[String], negative_feedback: Array[String], report: Array[String], student_id: Array[Int], k: Int): List[Int] = { + + } +}","class Solution { + fun topStudents(positive_feedback: Array, negative_feedback: Array, report: Array, student_id: IntArray, k: Int): List { + + } +}","impl Solution { + pub fn top_students(positive_feedback: Vec, negative_feedback: Vec, report: Vec, student_id: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $positive_feedback + * @param String[] $negative_feedback + * @param String[] $report + * @param Integer[] $student_id + * @param Integer $k + * @return Integer[] + */ + function topStudents($positive_feedback, $negative_feedback, $report, $student_id, $k) { + + } +}","function topStudents(positive_feedback: string[], negative_feedback: string[], report: string[], student_id: number[], k: number): number[] { + +};","(define/contract (top-students positive_feedback negative_feedback report student_id k) + (-> (listof string?) (listof string?) (listof string?) (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec top_students(Positive_feedback :: [unicode:unicode_binary()], Negative_feedback :: [unicode:unicode_binary()], Report :: [unicode:unicode_binary()], Student_id :: [integer()], K :: integer()) -> [integer()]. +top_students(Positive_feedback, Negative_feedback, Report, Student_id, K) -> + .","defmodule Solution do + @spec top_students(positive_feedback :: [String.t], negative_feedback :: [String.t], report :: [String.t], student_id :: [integer], k :: integer) :: [integer] + def top_students(positive_feedback, negative_feedback, report, student_id, k) do + + end +end","class Solution { + List topStudents(List positive_feedback, List negative_feedback, List report, List student_id, int k) { + + } +}", +200,number-of-great-partitions,Number of Great Partitions,2518.0,2601.0,"

You are given an array nums consisting of positive integers and an integer k.

+ +

Partition the array into two ordered groups such that each element is in exactly one group. A partition is called great if the sum of elements of each group is greater than or equal to k.

+ +

Return the number of distinct great partitions. Since the answer may be too large, return it modulo 109 + 7.

+ +

Two partitions are considered distinct if some element nums[i] is in different groups in the two partitions.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4], k = 4
+Output: 6
+Explanation: The great partitions are: ([1,2,3], [4]), ([1,3], [2,4]), ([1,4], [2,3]), ([2,3], [1,4]), ([2,4], [1,3]) and ([4], [1,2,3]).
+
+ +

Example 2:

+ +
+Input: nums = [3,3,3], k = 4
+Output: 0
+Explanation: There are no great partitions for this array.
+
+ +

Example 3:

+ +
+Input: nums = [6,6], k = 2
+Output: 2
+Explanation: We can either put nums[0] in the first partition or in the second partition.
+The great partitions will be ([6], [6]) and ([6], [6]).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length, k <= 1000
    • +
  • 1 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int countPartitions(vector& nums, int k) { + + } +};","class Solution { + public int countPartitions(int[] nums, int k) { + + } +}","class Solution(object): + def countPartitions(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countPartitions(self, nums: List[int], k: int) -> int: + ","int countPartitions(int* nums, int numsSize, int k){ + +}","public class Solution { + public int CountPartitions(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countPartitions = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_partitions(nums, k) + +end","class Solution { + func countPartitions(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countPartitions(nums []int, k int) int { + +}","object Solution { + def countPartitions(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun countPartitions(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn count_partitions(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countPartitions($nums, $k) { + + } +}","function countPartitions(nums: number[], k: number): number { + +};","(define/contract (count-partitions nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_partitions(Nums :: [integer()], K :: integer()) -> integer(). +count_partitions(Nums, K) -> + .","defmodule Solution do + @spec count_partitions(nums :: [integer], k :: integer) :: integer + def count_partitions(nums, k) do + + end +end","class Solution { + int countPartitions(List nums, int k) { + + } +}", +201,maximum-tastiness-of-candy-basket,Maximum Tastiness of Candy Basket,2517.0,2600.0,"

You are given an array of positive integers price where price[i] denotes the price of the ith candy and a positive integer k.

+ +

The store sells baskets of k distinct candies. The tastiness of a candy basket is the smallest absolute difference of the prices of any two candies in the basket.

+ +

Return the maximum tastiness of a candy basket.

+ +

 

+

Example 1:

+ +
+Input: price = [13,5,1,8,21,2], k = 3
+Output: 8
+Explanation: Choose the candies with the prices [13,5,21].
+The tastiness of the candy basket is: min(|13 - 5|, |13 - 21|, |5 - 21|) = min(8, 8, 16) = 8.
+It can be proven that 8 is the maximum tastiness that can be achieved.
+
+ +

Example 2:

+ +
+Input: price = [1,3,1], k = 2
+Output: 2
+Explanation: Choose the candies with the prices [1,3].
+The tastiness of the candy basket is: min(|1 - 3|) = min(2) = 2.
+It can be proven that 2 is the maximum tastiness that can be achieved.
+
+ +

Example 3:

+ +
+Input: price = [7,7,7,7], k = 2
+Output: 0
+Explanation: Choosing any two distinct candies from the candies we have will result in a tastiness of 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= k <= price.length <= 105
    • +
  • 1 <= price[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int maximumTastiness(vector& price, int k) { + + } +};","class Solution { + public int maximumTastiness(int[] price, int k) { + + } +}","class Solution(object): + def maximumTastiness(self, price, k): + """""" + :type price: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumTastiness(self, price: List[int], k: int) -> int: + ","int maximumTastiness(int* price, int priceSize, int k){ + +}","public class Solution { + public int MaximumTastiness(int[] price, int k) { + + } +}","/** + * @param {number[]} price + * @param {number} k + * @return {number} + */ +var maximumTastiness = function(price, k) { + +};","# @param {Integer[]} price +# @param {Integer} k +# @return {Integer} +def maximum_tastiness(price, k) + +end","class Solution { + func maximumTastiness(_ price: [Int], _ k: Int) -> Int { + + } +}","func maximumTastiness(price []int, k int) int { + +}","object Solution { + def maximumTastiness(price: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maximumTastiness(price: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn maximum_tastiness(price: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $price + * @param Integer $k + * @return Integer + */ + function maximumTastiness($price, $k) { + + } +}","function maximumTastiness(price: number[], k: number): number { + +};","(define/contract (maximum-tastiness price k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_tastiness(Price :: [integer()], K :: integer()) -> integer(). +maximum_tastiness(Price, K) -> + .","defmodule Solution do + @spec maximum_tastiness(price :: [integer], k :: integer) :: integer + def maximum_tastiness(price, k) do + + end +end","class Solution { + int maximumTastiness(List price, int k) { + + } +}", +202,take-k-of-each-character-from-left-and-right,Take K of Each Character From Left and Right,2516.0,2599.0,"

You are given a string s consisting of the characters 'a', 'b', and 'c' and a non-negative integer k. Each minute, you may take either the leftmost character of s, or the rightmost character of s.

+ +

Return the minimum number of minutes needed for you to take at least k of each character, or return -1 if it is not possible to take k of each character.

+ +

 

+

Example 1:

+ +
+Input: s = "aabaaaacaabc", k = 2
+Output: 8
+Explanation: 
+Take three characters from the left of s. You now have two 'a' characters, and one 'b' character.
+Take five characters from the right of s. You now have four 'a' characters, two 'b' characters, and two 'c' characters.
+A total of 3 + 5 = 8 minutes is needed.
+It can be proven that 8 is the minimum number of minutes needed.
+
+ +

Example 2:

+ +
+Input: s = "a", k = 1
+Output: -1
+Explanation: It is not possible to take one 'b' or 'c' so return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of only the letters 'a', 'b', and 'c'.
    • +
  • 0 <= k <= s.length
    • +
+",2.0,False,"class Solution { +public: + int takeCharacters(string s, int k) { + + } +};","class Solution { + public int takeCharacters(String s, int k) { + + } +}","class Solution(object): + def takeCharacters(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def takeCharacters(self, s: str, k: int) -> int: + ","int takeCharacters(char * s, int k){ + +}","public class Solution { + public int TakeCharacters(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var takeCharacters = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def take_characters(s, k) + +end","class Solution { + func takeCharacters(_ s: String, _ k: Int) -> Int { + + } +}","func takeCharacters(s string, k int) int { + +}","object Solution { + def takeCharacters(s: String, k: Int): Int = { + + } +}","class Solution { + fun takeCharacters(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn take_characters(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function takeCharacters($s, $k) { + + } +}","function takeCharacters(s: string, k: number): number { + +};","(define/contract (take-characters s k) + (-> string? exact-integer? exact-integer?) + + )","-spec take_characters(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +take_characters(S, K) -> + .","defmodule Solution do + @spec take_characters(s :: String.t, k :: integer) :: integer + def take_characters(s, k) do + + end +end","class Solution { + int takeCharacters(String s, int k) { + + } +}", +204,cycle-length-queries-in-a-tree,Cycle Length Queries in a Tree,2509.0,2597.0,"

You are given an integer n. There is a complete binary tree with 2n - 1 nodes. The root of that tree is the node with the value 1, and every node with a value val in the range [1, 2n - 1 - 1] has two children where:

+ +
    +
  • The left node has the value 2 * val, and
    • +
  • The right node has the value 2 * val + 1.
    • +
+ +

You are also given a 2D integer array queries of length m, where queries[i] = [ai, bi]. For each query, solve the following problem:

+ +
    +
  1. Add an edge between the nodes with values ai and bi.
    2. +
  2. Find the length of the cycle in the graph.
    3. +
  3. Remove the added edge between nodes with values ai and bi.
    4. +
+ +

Note that:

+ +
    +
  • A cycle is a path that starts and ends at the same node, and each edge in the path is visited only once.
    • +
  • The length of a cycle is the number of edges visited in the cycle.
    • +
  • There could be multiple edges between two nodes in the tree after adding the edge of the query.
    • +
+ +

Return an array answer of length m where answer[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: n = 3, queries = [[5,3],[4,7],[2,3]]
+Output: [4,5,3]
+Explanation: The diagrams above show the tree of 23 - 1 nodes. Nodes colored in red describe the nodes in the cycle after adding the edge.
+- After adding the edge between nodes 3 and 5, the graph contains a cycle of nodes [5,2,1,3]. Thus answer to the first query is 4. We delete the added edge and process the next query.
+- After adding the edge between nodes 4 and 7, the graph contains a cycle of nodes [4,2,1,3,7]. Thus answer to the second query is 5. We delete the added edge and process the next query.
+- After adding the edge between nodes 2 and 3, the graph contains a cycle of nodes [2,1,3]. Thus answer to the third query is 3. We delete the added edge.
+
+ +

Example 2:

+ +
+Input: n = 2, queries = [[1,2]]
+Output: [2]
+Explanation: The diagram above shows the tree of 22 - 1 nodes. Nodes colored in red describe the nodes in the cycle after adding the edge.
+- After adding the edge between nodes 1 and 2, the graph contains a cycle of nodes [2,1]. Thus answer for the first query is 2. We delete the added edge.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 30
    • +
  • m == queries.length
    • +
  • 1 <= m <= 105
    • +
  • queries[i].length == 2
    • +
  • 1 <= ai, bi <= 2n - 1
    • +
  • ai != bi
    • +
+",3.0,False,"class Solution { +public: + vector cycleLengthQueries(int n, vector>& queries) { + + } +};","class Solution { + public int[] cycleLengthQueries(int n, int[][] queries) { + + } +}","class Solution(object): + def cycleLengthQueries(self, n, queries): + """""" + :type n: int + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def cycleLengthQueries(self, n: int, queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* cycleLengthQueries(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] CycleLengthQueries(int n, int[][] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +var cycleLengthQueries = function(n, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} queries +# @return {Integer[]} +def cycle_length_queries(n, queries) + +end","class Solution { + func cycleLengthQueries(_ n: Int, _ queries: [[Int]]) -> [Int] { + + } +}","func cycleLengthQueries(n int, queries [][]int) []int { + +}","object Solution { + def cycleLengthQueries(n: Int, queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun cycleLengthQueries(n: Int, queries: Array): IntArray { + + } +}","impl Solution { + pub fn cycle_length_queries(n: i32, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $queries + * @return Integer[] + */ + function cycleLengthQueries($n, $queries) { + + } +}","function cycleLengthQueries(n: number, queries: number[][]): number[] { + +};","(define/contract (cycle-length-queries n queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec cycle_length_queries(N :: integer(), Queries :: [[integer()]]) -> [integer()]. +cycle_length_queries(N, Queries) -> + .","defmodule Solution do + @spec cycle_length_queries(n :: integer, queries :: [[integer]]) :: [integer] + def cycle_length_queries(n, queries) do + + end +end","class Solution { + List cycleLengthQueries(int n, List> queries) { + + } +}", +205,add-edges-to-make-degrees-of-all-nodes-even,Add Edges to Make Degrees of All Nodes Even,2508.0,2596.0,"

There is an undirected graph consisting of n nodes numbered from 1 to n. You are given the integer n and a 2D array edges where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi. The graph can be disconnected.

+ +

You can add at most two additional edges (possibly none) to this graph so that there are no repeated edges and no self-loops.

+ +

Return true if it is possible to make the degree of each node in the graph even, otherwise return false.

+ +

The degree of a node is the number of edges connected to it.

+ +

 

+

Example 1:

+ +
+Input: n = 5, edges = [[1,2],[2,3],[3,4],[4,2],[1,4],[2,5]]
+Output: true
+Explanation: The above diagram shows a valid way of adding an edge.
+Every node in the resulting graph is connected to an even number of edges.
+
+ +

Example 2:

+ +
+Input: n = 4, edges = [[1,2],[3,4]]
+Output: true
+Explanation: The above diagram shows a valid way of adding two edges.
+ +

Example 3:

+ +
+Input: n = 4, edges = [[1,2],[1,3],[1,4]]
+Output: false
+Explanation: It is not possible to obtain a valid graph with adding at most 2 edges.
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n <= 105
    • +
  • 2 <= edges.length <= 105
    • +
  • edges[i].length == 2
    • +
  • 1 <= ai, bi <= n
    • +
  • ai != bi
    • +
  • There are no repeated edges.
    • +
+",3.0,False,"class Solution { +public: + bool isPossible(int n, vector>& edges) { + + } +};","class Solution { + public boolean isPossible(int n, List> edges) { + + } +}","class Solution(object): + def isPossible(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def isPossible(self, n: int, edges: List[List[int]]) -> bool: + ","bool isPossible(int n, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public bool IsPossible(int n, IList> edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {boolean} + */ +var isPossible = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Boolean} +def is_possible(n, edges) + +end","class Solution { + func isPossible(_ n: Int, _ edges: [[Int]]) -> Bool { + + } +}","func isPossible(n int, edges [][]int) bool { + +}","object Solution { + def isPossible(n: Int, edges: List[List[Int]]): Boolean = { + + } +}","class Solution { + fun isPossible(n: Int, edges: List>): Boolean { + + } +}","impl Solution { + pub fn is_possible(n: i32, edges: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Boolean + */ + function isPossible($n, $edges) { + + } +}","function isPossible(n: number, edges: number[][]): boolean { + +};","(define/contract (is-possible n edges) + (-> exact-integer? (listof (listof exact-integer?)) boolean?) + + )","-spec is_possible(N :: integer(), Edges :: [[integer()]]) -> boolean(). +is_possible(N, Edges) -> + .","defmodule Solution do + @spec is_possible(n :: integer, edges :: [[integer]]) :: boolean + def is_possible(n, edges) do + + end +end","class Solution { + bool isPossible(int n, List> edges) { + + } +}", +206,smallest-value-after-replacing-with-sum-of-prime-factors,Smallest Value After Replacing With Sum of Prime Factors,2507.0,2595.0,"

You are given a positive integer n.

+ +

Continuously replace n with the sum of its prime factors.

+ +
    +
  • Note that if a prime factor divides n multiple times, it should be included in the sum as many times as it divides n.
    • +
+ +

Return the smallest value n will take on.

+ +

 

+

Example 1:

+ +
+Input: n = 15
+Output: 5
+Explanation: Initially, n = 15.
+15 = 3 * 5, so replace n with 3 + 5 = 8.
+8 = 2 * 2 * 2, so replace n with 2 + 2 + 2 = 6.
+6 = 2 * 3, so replace n with 2 + 3 = 5.
+5 is the smallest value n will take on.
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: 3
+Explanation: Initially, n = 3.
+3 is the smallest value n will take on.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 105
    • +
+",2.0,False,"class Solution { +public: + int smallestValue(int n) { + + } +};","class Solution { + public int smallestValue(int n) { + + } +}","class Solution(object): + def smallestValue(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def smallestValue(self, n: int) -> int: + ","int smallestValue(int n){ + +}","public class Solution { + public int SmallestValue(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var smallestValue = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def smallest_value(n) + +end","class Solution { + func smallestValue(_ n: Int) -> Int { + + } +}","func smallestValue(n int) int { + +}","object Solution { + def smallestValue(n: Int): Int = { + + } +}","class Solution { + fun smallestValue(n: Int): Int { + + } +}","impl Solution { + pub fn smallest_value(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function smallestValue($n) { + + } +}","function smallestValue(n: number): number { + +};","(define/contract (smallest-value n) + (-> exact-integer? exact-integer?) + + )","-spec smallest_value(N :: integer()) -> integer(). +smallest_value(N) -> + .","defmodule Solution do + @spec smallest_value(n :: integer) :: integer + def smallest_value(n) do + + end +end","class Solution { + int smallestValue(int n) { + + } +}", +208,minimum-total-cost-to-make-arrays-unequal,Minimum Total Cost to Make Arrays Unequal,2499.0,2592.0,"

You are given two 0-indexed integer arrays nums1 and nums2, of equal length n.

+ +

In one operation, you can swap the values of any two indices of nums1. The cost of this operation is the sum of the indices.

+ +

Find the minimum total cost of performing the given operation any number of times such that nums1[i] != nums2[i] for all 0 <= i <= n - 1 after performing all the operations.

+ +

Return the minimum total cost such that nums1 and nums2 satisfy the above condition. In case it is not possible, return -1.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,4,5], nums2 = [1,2,3,4,5]
+Output: 10
+Explanation: 
+One of the ways we can perform the operations is:
+- Swap values at indices 0 and 3, incurring cost = 0 + 3 = 3. Now, nums1 = [4,2,3,1,5]
+- Swap values at indices 1 and 2, incurring cost = 1 + 2 = 3. Now, nums1 = [4,3,2,1,5].
+- Swap values at indices 0 and 4, incurring cost = 0 + 4 = 4. Now, nums1 =[5,3,2,1,4].
+We can see that for each index i, nums1[i] != nums2[i]. The cost required here is 10.
+Note that there are other ways to swap values, but it can be proven that it is not possible to obtain a cost less than 10.
+
+ +

Example 2:

+ +
+Input: nums1 = [2,2,2,1,3], nums2 = [1,2,2,3,3]
+Output: 10
+Explanation: 
+One of the ways we can perform the operations is:
+- Swap values at indices 2 and 3, incurring cost = 2 + 3 = 5. Now, nums1 = [2,2,1,2,3].
+- Swap values at indices 1 and 4, incurring cost = 1 + 4 = 5. Now, nums1 = [2,3,1,2,2].
+The total cost needed here is 10, which is the minimum possible.
+
+ +

Example 3:

+ +
+Input: nums1 = [1,2,2], nums2 = [1,2,2]
+Output: -1
+Explanation: 
+It can be shown that it is not possible to satisfy the given conditions irrespective of the number of operations we perform.
+Hence, we return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= n
    • +
+",3.0,False,"class Solution { +public: + long long minimumTotalCost(vector& nums1, vector& nums2) { + + } +};","class Solution { + public long minimumTotalCost(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def minimumTotalCost(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def minimumTotalCost(self, nums1: List[int], nums2: List[int]) -> int: + ","long long minimumTotalCost(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public long MinimumTotalCost(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minimumTotalCost = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def minimum_total_cost(nums1, nums2) + +end","class Solution { + func minimumTotalCost(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func minimumTotalCost(nums1 []int, nums2 []int) int64 { + +}","object Solution { + def minimumTotalCost(nums1: Array[Int], nums2: Array[Int]): Long = { + + } +}","class Solution { + fun minimumTotalCost(nums1: IntArray, nums2: IntArray): Long { + + } +}","impl Solution { + pub fn minimum_total_cost(nums1: Vec, nums2: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function minimumTotalCost($nums1, $nums2) { + + } +}","function minimumTotalCost(nums1: number[], nums2: number[]): number { + +};","(define/contract (minimum-total-cost nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec minimum_total_cost(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +minimum_total_cost(Nums1, Nums2) -> + .","defmodule Solution do + @spec minimum_total_cost(nums1 :: [integer], nums2 :: [integer]) :: integer + def minimum_total_cost(nums1, nums2) do + + end +end","class Solution { + int minimumTotalCost(List nums1, List nums2) { + + } +}", +209,frog-jump-ii,Frog Jump II,2498.0,2591.0,"

You are given a 0-indexed integer array stones sorted in strictly increasing order representing the positions of stones in a river.

+ +

A frog, initially on the first stone, wants to travel to the last stone and then return to the first stone. However, it can jump to any stone at most once.

+ +

The length of a jump is the absolute difference between the position of the stone the frog is currently on and the position of the stone to which the frog jumps.

+ +
    +
  • More formally, if the frog is at stones[i] and is jumping to stones[j], the length of the jump is |stones[i] - stones[j]|.
    • +
+ +

The cost of a path is the maximum length of a jump among all jumps in the path.

+ +

Return the minimum cost of a path for the frog.

+ +

 

+

Example 1:

+ +
+Input: stones = [0,2,5,6,7]
+Output: 5
+Explanation: The above figure represents one of the optimal paths the frog can take.
+The cost of this path is 5, which is the maximum length of a jump.
+Since it is not possible to achieve a cost of less than 5, we return it.
+
+ +

Example 2:

+ +
+Input: stones = [0,3,9]
+Output: 9
+Explanation: 
+The frog can jump directly to the last stone and come back to the first stone. 
+In this case, the length of each jump will be 9. The cost for the path will be max(9, 9) = 9.
+It can be shown that this is the minimum achievable cost.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= stones.length <= 105
    • +
  • 0 <= stones[i] <= 109
    • +
  • stones[0] == 0
    • +
  • stones is sorted in a strictly increasing order.
    • +
+",2.0,False,"class Solution { +public: + int maxJump(vector& stones) { + + } +};","class Solution { + public int maxJump(int[] stones) { + + } +}","class Solution(object): + def maxJump(self, stones): + """""" + :type stones: List[int] + :rtype: int + """""" + ","class Solution: + def maxJump(self, stones: List[int]) -> int: + ","int maxJump(int* stones, int stonesSize){ + +}","public class Solution { + public int MaxJump(int[] stones) { + + } +}","/** + * @param {number[]} stones + * @return {number} + */ +var maxJump = function(stones) { + +};","# @param {Integer[]} stones +# @return {Integer} +def max_jump(stones) + +end","class Solution { + func maxJump(_ stones: [Int]) -> Int { + + } +}","func maxJump(stones []int) int { + +}","object Solution { + def maxJump(stones: Array[Int]): Int = { + + } +}","class Solution { + fun maxJump(stones: IntArray): Int { + + } +}","impl Solution { + pub fn max_jump(stones: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $stones + * @return Integer + */ + function maxJump($stones) { + + } +}","function maxJump(stones: number[]): number { + +};","(define/contract (max-jump stones) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_jump(Stones :: [integer()]) -> integer(). +max_jump(Stones) -> + .","defmodule Solution do + @spec max_jump(stones :: [integer]) :: integer + def max_jump(stones) do + + end +end","class Solution { + int maxJump(List stones) { + + } +}", +210,maximum-star-sum-of-a-graph,Maximum Star Sum of a Graph,2497.0,2590.0,"

There is an undirected graph consisting of n nodes numbered from 0 to n - 1. You are given a 0-indexed integer array vals of length n where vals[i] denotes the value of the ith node.

+ +

You are also given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

+ +

A star graph is a subgraph of the given graph having a center node containing 0 or more neighbors. In other words, it is a subset of edges of the given graph such that there exists a common node for all edges.

+ +

The image below shows star graphs with 3 and 4 neighbors respectively, centered at the blue node.

+ +

The star sum is the sum of the values of all the nodes present in the star graph.

+ +

Given an integer k, return the maximum star sum of a star graph containing at most k edges.

+ +

 

+

Example 1:

+ +
+Input: vals = [1,2,3,4,10,-10,-20], edges = [[0,1],[1,2],[1,3],[3,4],[3,5],[3,6]], k = 2
+Output: 16
+Explanation: The above diagram represents the input graph.
+The star graph with the maximum star sum is denoted by blue. It is centered at 3 and includes its neighbors 1 and 4.
+It can be shown it is not possible to get a star graph with a sum greater than 16.
+
+ +

Example 2:

+ +
+Input: vals = [-5], edges = [], k = 0
+Output: -5
+Explanation: There is only one possible star graph, which is node 0 itself.
+Hence, we return -5.
+
+ +

 

+

Constraints:

+ +
    +
  • n == vals.length
    • +
  • 1 <= n <= 105
    • +
  • -104 <= vals[i] <= 104
    • +
  • 0 <= edges.length <= min(n * (n - 1) / 2, 105)
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • ai != bi
    • +
  • 0 <= k <= n - 1
    • +
+",2.0,False,"class Solution { +public: + int maxStarSum(vector& vals, vector>& edges, int k) { + + } +};","class Solution { + public int maxStarSum(int[] vals, int[][] edges, int k) { + + } +}","class Solution(object): + def maxStarSum(self, vals, edges, k): + """""" + :type vals: List[int] + :type edges: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxStarSum(self, vals: List[int], edges: List[List[int]], k: int) -> int: + ","int maxStarSum(int* vals, int valsSize, int** edges, int edgesSize, int* edgesColSize, int k){ + +}","public class Solution { + public int MaxStarSum(int[] vals, int[][] edges, int k) { + + } +}","/** + * @param {number[]} vals + * @param {number[][]} edges + * @param {number} k + * @return {number} + */ +var maxStarSum = function(vals, edges, k) { + +};","# @param {Integer[]} vals +# @param {Integer[][]} edges +# @param {Integer} k +# @return {Integer} +def max_star_sum(vals, edges, k) + +end","class Solution { + func maxStarSum(_ vals: [Int], _ edges: [[Int]], _ k: Int) -> Int { + + } +}","func maxStarSum(vals []int, edges [][]int, k int) int { + +}","object Solution { + def maxStarSum(vals: Array[Int], edges: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun maxStarSum(vals: IntArray, edges: Array, k: Int): Int { + + } +}","impl Solution { + pub fn max_star_sum(vals: Vec, edges: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $vals + * @param Integer[][] $edges + * @param Integer $k + * @return Integer + */ + function maxStarSum($vals, $edges, $k) { + + } +}","function maxStarSum(vals: number[], edges: number[][], k: number): number { + +};","(define/contract (max-star-sum vals edges k) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec max_star_sum(Vals :: [integer()], Edges :: [[integer()]], K :: integer()) -> integer(). +max_star_sum(Vals, Edges, K) -> + .","defmodule Solution do + @spec max_star_sum(vals :: [integer], edges :: [[integer]], k :: integer) :: integer + def max_star_sum(vals, edges, k) do + + end +end","class Solution { + int maxStarSum(List vals, List> edges, int k) { + + } +}", +212,maximum-number-of-points-from-grid-queries,Maximum Number of Points From Grid Queries,2503.0,2588.0,"

You are given an m x n integer matrix grid and an array queries of size k.

+ +

Find an array answer of size k such that for each integer queries[i] you start in the top left cell of the matrix and repeat the following process:

+ +
    +
  • If queries[i] is strictly greater than the value of the current cell that you are in, then you get one point if it is your first time visiting this cell, and you can move to any adjacent cell in all 4 directions: up, down, left, and right.
    • +
  • Otherwise, you do not get any points, and you end this process.
    • +
+ +

After the process, answer[i] is the maximum number of points you can get. Note that for each query you are allowed to visit the same cell multiple times.

+ +

Return the resulting array answer.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,2,3],[2,5,7],[3,5,1]], queries = [5,6,2]
+Output: [5,8,1]
+Explanation: The diagrams above show which cells we visit to get points for each query.
+ +

Example 2:

+ +
+Input: grid = [[5,2,1],[1,1,2]], queries = [3]
+Output: [0]
+Explanation: We can not get any points because the value of the top left cell is already greater than or equal to 3.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 2 <= m, n <= 1000
    • +
  • 4 <= m * n <= 105
    • +
  • k == queries.length
    • +
  • 1 <= k <= 104
    • +
  • 1 <= grid[i][j], queries[i] <= 106
    • +
+",3.0,False,"class Solution { +public: + vector maxPoints(vector>& grid, vector& queries) { + + } +};","class Solution { + public int[] maxPoints(int[][] grid, int[] queries) { + + } +}","class Solution(object): + def maxPoints(self, grid, queries): + """""" + :type grid: List[List[int]] + :type queries: List[int] + :rtype: List[int] + """""" + ","class Solution: + def maxPoints(self, grid: List[List[int]], queries: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxPoints(int** grid, int gridSize, int* gridColSize, int* queries, int queriesSize, int* returnSize){ + +}","public class Solution { + public int[] MaxPoints(int[][] grid, int[] queries) { + + } +}","/** + * @param {number[][]} grid + * @param {number[]} queries + * @return {number[]} + */ +var maxPoints = function(grid, queries) { + +};","# @param {Integer[][]} grid +# @param {Integer[]} queries +# @return {Integer[]} +def max_points(grid, queries) + +end","class Solution { + func maxPoints(_ grid: [[Int]], _ queries: [Int]) -> [Int] { + + } +}","func maxPoints(grid [][]int, queries []int) []int { + +}","object Solution { + def maxPoints(grid: Array[Array[Int]], queries: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun maxPoints(grid: Array, queries: IntArray): IntArray { + + } +}","impl Solution { + pub fn max_points(grid: Vec>, queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer[] $queries + * @return Integer[] + */ + function maxPoints($grid, $queries) { + + } +}","function maxPoints(grid: number[][], queries: number[]): number[] { + +};","(define/contract (max-points grid queries) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?)) + + )","-spec max_points(Grid :: [[integer()]], Queries :: [integer()]) -> [integer()]. +max_points(Grid, Queries) -> + .","defmodule Solution do + @spec max_points(grid :: [[integer]], queries :: [integer]) :: [integer] + def max_points(grid, queries) do + + end +end","class Solution { + List maxPoints(List> grid, List queries) { + + } +}", +214,longest-square-streak-in-an-array,Longest Square Streak in an Array,2501.0,2586.0,"

You are given an integer array nums. A subsequence of nums is called a square streak if:

+ +
    +
  • The length of the subsequence is at least 2, and
    • +
  • after sorting the subsequence, each element (except the first element) is the square of the previous number.
    • +
+ +

Return the length of the longest square streak in nums, or return -1 if there is no square streak.

+ +

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,3,6,16,8,2]
+Output: 3
+Explanation: Choose the subsequence [4,16,2]. After sorting it, it becomes [2,4,16].
+- 4 = 2 * 2.
+- 16 = 4 * 4.
+Therefore, [4,16,2] is a square streak.
+It can be shown that every subsequence of length 4 is not a square streak.
+
+ +

Example 2:

+ +
+Input: nums = [2,3,5,6,7]
+Output: -1
+Explanation: There is no square streak in nums so return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • 2 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int longestSquareStreak(vector& nums) { + + } +};","class Solution { + public int longestSquareStreak(int[] nums) { + + } +}","class Solution(object): + def longestSquareStreak(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def longestSquareStreak(self, nums: List[int]) -> int: + ","int longestSquareStreak(int* nums, int numsSize){ + +}","public class Solution { + public int LongestSquareStreak(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var longestSquareStreak = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def longest_square_streak(nums) + +end","class Solution { + func longestSquareStreak(_ nums: [Int]) -> Int { + + } +}","func longestSquareStreak(nums []int) int { + +}","object Solution { + def longestSquareStreak(nums: Array[Int]): Int = { + + } +}","class Solution { + fun longestSquareStreak(nums: IntArray): Int { + + } +}","impl Solution { + pub fn longest_square_streak(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function longestSquareStreak($nums) { + + } +}","function longestSquareStreak(nums: number[]): number { + +};","(define/contract (longest-square-streak nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_square_streak(Nums :: [integer()]) -> integer(). +longest_square_streak(Nums) -> + .","defmodule Solution do + @spec longest_square_streak(nums :: [integer]) :: integer + def longest_square_streak(nums) do + + end +end","class Solution { + int longestSquareStreak(List nums) { + + } +}", +216,divide-nodes-into-the-maximum-number-of-groups,Divide Nodes Into the Maximum Number of Groups,2493.0,2583.0,"

You are given a positive integer n representing the number of nodes in an undirected graph. The nodes are labeled from 1 to n.

+ +

You are also given a 2D integer array edges, where edges[i] = [ai, bi] indicates that there is a bidirectional edge between nodes ai and bi. Notice that the given graph may be disconnected.

+ +

Divide the nodes of the graph into m groups (1-indexed) such that:

+ +
    +
  • Each node in the graph belongs to exactly one group.
    • +
  • For every pair of nodes in the graph that are connected by an edge [ai, bi], if ai belongs to the group with index x, and bi belongs to the group with index y, then |y - x| = 1.
    • +
+ +

Return the maximum number of groups (i.e., maximum m) into which you can divide the nodes. Return -1 if it is impossible to group the nodes with the given conditions.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[1,2],[1,4],[1,5],[2,6],[2,3],[4,6]]
+Output: 4
+Explanation: As shown in the image we:
+- Add node 5 to the first group.
+- Add node 1 to the second group.
+- Add nodes 2 and 4 to the third group.
+- Add nodes 3 and 6 to the fourth group.
+We can see that every edge is satisfied.
+It can be shown that that if we create a fifth group and move any node from the third or fourth group to it, at least on of the edges will not be satisfied.
+
+ +

Example 2:

+ +
+Input: n = 3, edges = [[1,2],[2,3],[3,1]]
+Output: -1
+Explanation: If we add node 1 to the first group, node 2 to the second group, and node 3 to the third group to satisfy the first two edges, we can see that the third edge will not be satisfied.
+It can be shown that no grouping is possible.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 500
    • +
  • 1 <= edges.length <= 104
    • +
  • edges[i].length == 2
    • +
  • 1 <= ai, bi <= n
    • +
  • ai != bi
    • +
  • There is at most one edge between any pair of vertices.
    • +
+",3.0,False,"class Solution { +public: + int magnificentSets(int n, vector>& edges) { + + } +};","class Solution { + public int magnificentSets(int n, int[][] edges) { + + } +}","class Solution(object): + def magnificentSets(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def magnificentSets(self, n: int, edges: List[List[int]]) -> int: + ","int magnificentSets(int n, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int MagnificentSets(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var magnificentSets = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer} +def magnificent_sets(n, edges) + +end","class Solution { + func magnificentSets(_ n: Int, _ edges: [[Int]]) -> Int { + + } +}","func magnificentSets(n int, edges [][]int) int { + +}","object Solution { + def magnificentSets(n: Int, edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun magnificentSets(n: Int, edges: Array): Int { + + } +}","impl Solution { + pub fn magnificent_sets(n: i32, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer + */ + function magnificentSets($n, $edges) { + + } +}","function magnificentSets(n: number, edges: number[][]): number { + +};","(define/contract (magnificent-sets n edges) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec magnificent_sets(N :: integer(), Edges :: [[integer()]]) -> integer(). +magnificent_sets(N, Edges) -> + .","defmodule Solution do + @spec magnificent_sets(n :: integer, edges :: [[integer]]) :: integer + def magnificent_sets(n, edges) do + + end +end","class Solution { + int magnificentSets(int n, List> edges) { + + } +}", +220,count-palindromic-subsequences,Count Palindromic Subsequences,2484.0,2577.0,"

Given a string of digits s, return the number of palindromic subsequences of s having length 5. Since the answer may be very large, return it modulo 109 + 7.

+ +

Note:

+ +
    +
  • A string is palindromic if it reads the same forward and backward.
    • +
  • A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "103301"
+Output: 2
+Explanation: 
+There are 6 possible subsequences of length 5: "10330","10331","10301","10301","13301","03301". 
+Two of them (both equal to "10301") are palindromic.
+
+ +

Example 2:

+ +
+Input: s = "0000000"
+Output: 21
+Explanation: All 21 subsequences are "00000", which is palindromic.
+
+ +

Example 3:

+ +
+Input: s = "9999900000"
+Output: 2
+Explanation: The only two palindromic subsequences are "99999" and "00000".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s consists of digits.
    • +
+",3.0,False,"class Solution { +public: + int countPalindromes(string s) { + + } +};","class Solution { + public int countPalindromes(String s) { + + } +}","class Solution(object): + def countPalindromes(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def countPalindromes(self, s: str) -> int: + ","int countPalindromes(char * s){ + +}","public class Solution { + public int CountPalindromes(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var countPalindromes = function(s) { + +};","# @param {String} s +# @return {Integer} +def count_palindromes(s) + +end","class Solution { + func countPalindromes(_ s: String) -> Int { + + } +}","func countPalindromes(s string) int { + +}","object Solution { + def countPalindromes(s: String): Int = { + + } +}","class Solution { + fun countPalindromes(s: String): Int { + + } +}","impl Solution { + pub fn count_palindromes(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function countPalindromes($s) { + + } +}","function countPalindromes(s: string): number { + +};","(define/contract (count-palindromes s) + (-> string? exact-integer?) + + )","-spec count_palindromes(S :: unicode:unicode_binary()) -> integer(). +count_palindromes(S) -> + .","defmodule Solution do + @spec count_palindromes(s :: String.t) :: integer + def count_palindromes(s) do + + end +end","class Solution { + int countPalindromes(String s) { + + } +}", +221,minimum-penalty-for-a-shop,Minimum Penalty for a Shop,2483.0,2576.0,"

You are given the customer visit log of a shop represented by a 0-indexed string customers consisting only of characters 'N' and 'Y':

+ +
    +
  • if the ith character is 'Y', it means that customers come at the ith hour
    • +
  • whereas 'N' indicates that no customers come at the ith hour.
    • +
+ +

If the shop closes at the jth hour (0 <= j <= n), the penalty is calculated as follows:

+ +
    +
  • For every hour when the shop is open and no customers come, the penalty increases by 1.
    • +
  • For every hour when the shop is closed and customers come, the penalty increases by 1.
    • +
+ +

Return the earliest hour at which the shop must be closed to incur a minimum penalty.

+ +

Note that if a shop closes at the jth hour, it means the shop is closed at the hour j.

+ +

 

+

Example 1:

+ +
+Input: customers = "YYNY"
+Output: 2
+Explanation: 
+- Closing the shop at the 0th hour incurs in 1+1+0+1 = 3 penalty.
+- Closing the shop at the 1st hour incurs in 0+1+0+1 = 2 penalty.
+- Closing the shop at the 2nd hour incurs in 0+0+0+1 = 1 penalty.
+- Closing the shop at the 3rd hour incurs in 0+0+1+1 = 2 penalty.
+- Closing the shop at the 4th hour incurs in 0+0+1+0 = 1 penalty.
+Closing the shop at 2nd or 4th hour gives a minimum penalty. Since 2 is earlier, the optimal closing time is 2.
+
+ +

Example 2:

+ +
+Input: customers = "NNNNN"
+Output: 0
+Explanation: It is best to close the shop at the 0th hour as no customers arrive.
+ +

Example 3:

+ +
+Input: customers = "YYYY"
+Output: 4
+Explanation: It is best to close the shop at the 4th hour as customers arrive at each hour.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= customers.length <= 105
    • +
  • customers consists only of characters 'Y' and 'N'.
    • +
+",2.0,False,"class Solution { +public: + int bestClosingTime(string customers) { + + } +};","class Solution { + public int bestClosingTime(String customers) { + + } +}","class Solution(object): + def bestClosingTime(self, customers): + """""" + :type customers: str + :rtype: int + """""" + ","class Solution: + def bestClosingTime(self, customers: str) -> int: + ","int bestClosingTime(char * customers){ + +}","public class Solution { + public int BestClosingTime(string customers) { + + } +}","/** + * @param {string} customers + * @return {number} + */ +var bestClosingTime = function(customers) { + +};","# @param {String} customers +# @return {Integer} +def best_closing_time(customers) + +end","class Solution { + func bestClosingTime(_ customers: String) -> Int { + + } +}","func bestClosingTime(customers string) int { + +}","object Solution { + def bestClosingTime(customers: String): Int = { + + } +}","class Solution { + fun bestClosingTime(customers: String): Int { + + } +}","impl Solution { + pub fn best_closing_time(customers: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $customers + * @return Integer + */ + function bestClosingTime($customers) { + + } +}","function bestClosingTime(customers: string): number { + +};","(define/contract (best-closing-time customers) + (-> string? exact-integer?) + + )","-spec best_closing_time(Customers :: unicode:unicode_binary()) -> integer(). +best_closing_time(Customers) -> + .","defmodule Solution do + @spec best_closing_time(customers :: String.t) :: integer + def best_closing_time(customers) do + + end +end","class Solution { + int bestClosingTime(String customers) { + + } +}", +222,minimum-cuts-to-divide-a-circle,Minimum Cuts to Divide a Circle,2481.0,2575.0,"

A valid cut in a circle can be:

+ +
    +
  • A cut that is represented by a straight line that touches two points on the edge of the circle and passes through its center, or
    • +
  • A cut that is represented by a straight line that touches one point on the edge of the circle and its center.
    • +
+ +

Some valid and invalid cuts are shown in the figures below.

+ +

Given the integer n, return the minimum number of cuts needed to divide a circle into n equal slices.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 2
+Explanation: 
+The above figure shows how cutting the circle twice through the middle divides it into 4 equal slices.
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: 3
+Explanation:
+At least 3 cuts are needed to divide the circle into 3 equal slices. 
+It can be shown that less than 3 cuts cannot result in 3 slices of equal size and shape.
+Also note that the first cut will not divide the circle into distinct parts.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
+",1.0,False,"class Solution { +public: + int numberOfCuts(int n) { + + } +};","class Solution { + public int numberOfCuts(int n) { + + } +}","class Solution(object): + def numberOfCuts(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numberOfCuts(self, n: int) -> int: + ","int numberOfCuts(int n){ + +}","public class Solution { + public int NumberOfCuts(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numberOfCuts = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def number_of_cuts(n) + +end","class Solution { + func numberOfCuts(_ n: Int) -> Int { + + } +}","func numberOfCuts(n int) int { + +}","object Solution { + def numberOfCuts(n: Int): Int = { + + } +}","class Solution { + fun numberOfCuts(n: Int): Int { + + } +}","impl Solution { + pub fn number_of_cuts(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numberOfCuts($n) { + + } +}","function numberOfCuts(n: number): number { + +};","(define/contract (number-of-cuts n) + (-> exact-integer? exact-integer?) + + )","-spec number_of_cuts(N :: integer()) -> integer(). +number_of_cuts(N) -> + .","defmodule Solution do + @spec number_of_cuts(n :: integer) :: integer + def number_of_cuts(n) do + + end +end","class Solution { + int numberOfCuts(int n) { + + } +}", +223,count-subarrays-with-median-k,Count Subarrays With Median K,2488.0,2574.0,"

You are given an array nums of size n consisting of distinct integers from 1 to n and a positive integer k.

+ +

Return the number of non-empty subarrays in nums that have a median equal to k.

+ +

Note:

+ +
    +
  • The median of an array is the middle element after sorting the array in ascending order. If the array is of even length, the median is the left middle element. + +
      +
    • For example, the median of [2,3,1,4] is 2, and the median of [8,4,3,5,1] is 4.
      • +
    +
    • +
  • A subarray is a contiguous part of an array.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,1,4,5], k = 4
+Output: 3
+Explanation: The subarrays that have a median equal to 4 are: [4], [4,5] and [1,4,5].
+
+ +

Example 2:

+ +
+Input: nums = [2,3,1], k = 3
+Output: 1
+Explanation: [3] is the only subarray that has a median equal to 3.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i], k <= n
    • +
  • The integers in nums are distinct.
    • +
+",3.0,False,"class Solution { +public: + int countSubarrays(vector& nums, int k) { + + } +};","class Solution { + public int countSubarrays(int[] nums, int k) { + + } +}","class Solution(object): + def countSubarrays(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countSubarrays(self, nums: List[int], k: int) -> int: + ","int countSubarrays(int* nums, int numsSize, int k){ + +}","public class Solution { + public int CountSubarrays(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countSubarrays = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_subarrays(nums, k) + +end","class Solution { + func countSubarrays(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countSubarrays(nums []int, k int) int { + +}","object Solution { + def countSubarrays(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun countSubarrays(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn count_subarrays(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countSubarrays($nums, $k) { + + } +}","function countSubarrays(nums: number[], k: number): number { + +};","(define/contract (count-subarrays nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_subarrays(Nums :: [integer()], K :: integer()) -> integer(). +count_subarrays(Nums, K) -> + .","defmodule Solution do + @spec count_subarrays(nums :: [integer], k :: integer) :: integer + def count_subarrays(nums, k) do + + end +end","class Solution { + int countSubarrays(List nums, int k) { + + } +}", +224,remove-nodes-from-linked-list,Remove Nodes From Linked List,2487.0,2573.0,"

You are given the head of a linked list.

+ +

Remove every node which has a node with a strictly greater value anywhere to the right side of it.

+ +

Return the head of the modified linked list.

+ +

 

+

Example 1:

+ +
+Input: head = [5,2,13,3,8]
+Output: [13,8]
+Explanation: The nodes that should be removed are 5, 2 and 3.
+- Node 13 is to the right of node 5.
+- Node 13 is to the right of node 2.
+- Node 8 is to the right of node 3.
+
+ +

Example 2:

+ +
+Input: head = [1,1,1,1]
+Output: [1,1,1,1]
+Explanation: Every node has value 1, so no nodes are removed.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of the nodes in the given list is in the range [1, 105].
    • +
  • 1 <= Node.val <= 105
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* removeNodes(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode removeNodes(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def removeNodes(self, head): + """""" + :type head: Optional[ListNode] + :rtype: Optional[ListNode] + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* removeNodes(struct ListNode* head){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode RemoveNodes(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var removeNodes = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {ListNode} +def remove_nodes(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func removeNodes(_ head: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func removeNodes(head *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def removeNodes(head: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun removeNodes(head: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn remove_nodes(head: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return ListNode + */ + function removeNodes($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function removeNodes(head: ListNode | null): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (remove-nodes head) + (-> (or/c list-node? #f) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec remove_nodes(Head :: #list_node{} | null) -> #list_node{} | null. +remove_nodes(Head) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec remove_nodes(head :: ListNode.t | nil) :: ListNode.t | nil + def remove_nodes(head) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? removeNodes(ListNode? head) { + + } +}", +227,number-of-beautiful-partitions,Number of Beautiful Partitions,2478.0,2569.0,"

You are given a string s that consists of the digits '1' to '9' and two integers k and minLength.

+ +

A partition of s is called beautiful if:

+ +
    +
  • s is partitioned into k non-intersecting substrings.
    • +
  • Each substring has a length of at least minLength.
    • +
  • Each substring starts with a prime digit and ends with a non-prime digit. Prime digits are '2', '3', '5', and '7', and the rest of the digits are non-prime.
    • +
+ +

Return the number of beautiful partitions of s. Since the answer may be very large, return it modulo 109 + 7.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "23542185131", k = 3, minLength = 2
+Output: 3
+Explanation: There exists three ways to create a beautiful partition:
+"2354 | 218 | 5131"
+"2354 | 21851 | 31"
+"2354218 | 51 | 31"
+
+ +

Example 2:

+ +
+Input: s = "23542185131", k = 3, minLength = 3
+Output: 1
+Explanation: There exists one way to create a beautiful partition: "2354 | 218 | 5131".
+
+ +

Example 3:

+ +
+Input: s = "3312958", k = 3, minLength = 1
+Output: 1
+Explanation: There exists one way to create a beautiful partition: "331 | 29 | 58".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k, minLength <= s.length <= 1000
    • +
  • s consists of the digits '1' to '9'.
    • +
+",3.0,False,"class Solution { +public: + int beautifulPartitions(string s, int k, int minLength) { + + } +};","class Solution { + public int beautifulPartitions(String s, int k, int minLength) { + + } +}","class Solution(object): + def beautifulPartitions(self, s, k, minLength): + """""" + :type s: str + :type k: int + :type minLength: int + :rtype: int + """""" + ","class Solution: + def beautifulPartitions(self, s: str, k: int, minLength: int) -> int: + ","int beautifulPartitions(char * s, int k, int minLength){ + +}","public class Solution { + public int BeautifulPartitions(string s, int k, int minLength) { + + } +}","/** + * @param {string} s + * @param {number} k + * @param {number} minLength + * @return {number} + */ +var beautifulPartitions = function(s, k, minLength) { + +};","# @param {String} s +# @param {Integer} k +# @param {Integer} min_length +# @return {Integer} +def beautiful_partitions(s, k, min_length) + +end","class Solution { + func beautifulPartitions(_ s: String, _ k: Int, _ minLength: Int) -> Int { + + } +}","func beautifulPartitions(s string, k int, minLength int) int { + +}","object Solution { + def beautifulPartitions(s: String, k: Int, minLength: Int): Int = { + + } +}","class Solution { + fun beautifulPartitions(s: String, k: Int, minLength: Int): Int { + + } +}","impl Solution { + pub fn beautiful_partitions(s: String, k: i32, min_length: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @param Integer $minLength + * @return Integer + */ + function beautifulPartitions($s, $k, $minLength) { + + } +}","function beautifulPartitions(s: string, k: number, minLength: number): number { + +};","(define/contract (beautiful-partitions s k minLength) + (-> string? exact-integer? exact-integer? exact-integer?) + + )","-spec beautiful_partitions(S :: unicode:unicode_binary(), K :: integer(), MinLength :: integer()) -> integer(). +beautiful_partitions(S, K, MinLength) -> + .","defmodule Solution do + @spec beautiful_partitions(s :: String.t, k :: integer, min_length :: integer) :: integer + def beautiful_partitions(s, k, min_length) do + + end +end","class Solution { + int beautifulPartitions(String s, int k, int minLength) { + + } +}", +229,closest-nodes-queries-in-a-binary-search-tree,Closest Nodes Queries in a Binary Search Tree,2476.0,2567.0,"

You are given the root of a binary search tree and an array queries of size n consisting of positive integers.

+ +

Find a 2D array answer of size n where answer[i] = [mini, maxi]:

+ +
    +
  • mini is the largest value in the tree that is smaller than or equal to queries[i]. If a such value does not exist, add -1 instead.
    • +
  • maxi is the smallest value in the tree that is greater than or equal to queries[i]. If a such value does not exist, add -1 instead.
    • +
+ +

Return the array answer.

+ +

 

+

Example 1:

+ +
+Input: root = [6,2,13,1,4,9,15,null,null,null,null,null,null,14], queries = [2,5,16]
+Output: [[2,2],[4,6],[15,-1]]
+Explanation: We answer the queries in the following way:
+- The largest number that is smaller or equal than 2 in the tree is 2, and the smallest number that is greater or equal than 2 is still 2. So the answer for the first query is [2,2].
+- The largest number that is smaller or equal than 5 in the tree is 4, and the smallest number that is greater or equal than 5 is 6. So the answer for the second query is [4,6].
+- The largest number that is smaller or equal than 16 in the tree is 15, and the smallest number that is greater or equal than 16 does not exist. So the answer for the third query is [15,-1].
+
+ +

Example 2:

+ +
+Input: root = [4,null,9], queries = [3]
+Output: [[-1,4]]
+Explanation: The largest number that is smaller or equal to 3 in the tree does not exist, and the smallest number that is greater or equal to 3 is 4. So the answer for the query is [-1,4].
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [2, 105].
    • +
  • 1 <= Node.val <= 106
    • +
  • n == queries.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= queries[i] <= 106
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector> closestNodes(TreeNode* root, vector& queries) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List> closestNodes(TreeNode root, List queries) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def closestNodes(self, root, queries): + """""" + :type root: Optional[TreeNode] + :type queries: List[int] + :rtype: List[List[int]] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def closestNodes(self, root: Optional[TreeNode], queries: List[int]) -> List[List[int]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** closestNodes(struct TreeNode* root, int* queries, int queriesSize, int* returnSize, int** returnColumnSizes){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList> ClosestNodes(TreeNode root, IList queries) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number[]} queries + * @return {number[][]} + */ +var closestNodes = function(root, queries) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer[]} queries +# @return {Integer[][]} +def closest_nodes(root, queries) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func closestNodes(_ root: TreeNode?, _ queries: [Int]) -> [[Int]] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func closestNodes(root *TreeNode, queries []int) [][]int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def closestNodes(root: TreeNode, queries: List[Int]): List[List[Int]] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun closestNodes(root: TreeNode?, queries: List): List> { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn closest_nodes(root: Option>>, queries: Vec) -> Vec> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer[] $queries + * @return Integer[][] + */ + function closestNodes($root, $queries) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function closestNodes(root: TreeNode | null, queries: number[]): number[][] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (closest-nodes root queries) + (-> (or/c tree-node? #f) (listof exact-integer?) (listof (listof exact-integer?))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec closest_nodes(Root :: #tree_node{} | null, Queries :: [integer()]) -> [[integer()]]. +closest_nodes(Root, Queries) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec closest_nodes(root :: TreeNode.t | nil, queries :: [integer]) :: [[integer]] + def closest_nodes(root, queries) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List> closestNodes(TreeNode? root, List queries) { + + } +}", +232,split-message-based-on-limit,Split Message Based on Limit,2468.0,2563.0,"

You are given a string, message, and a positive integer, limit.

+ +

You must split message into one or more parts based on limit. Each resulting part should have the suffix "<a/b>", where "b" is to be replaced with the total number of parts and "a" is to be replaced with the index of the part, starting from 1 and going up to b. Additionally, the length of each resulting part (including its suffix) should be equal to limit, except for the last part whose length can be at most limit.

+ +

The resulting parts should be formed such that when their suffixes are removed and they are all concatenated in order, they should be equal to message. Also, the result should contain as few parts as possible.

+ +

Return the parts message would be split into as an array of strings. If it is impossible to split message as required, return an empty array.

+ +

 

+

Example 1:

+ +
+Input: message = "this is really a very awesome message", limit = 9
+Output: ["thi<1/14>","s i<2/14>","s r<3/14>","eal<4/14>","ly <5/14>","a v<6/14>","ery<7/14>"," aw<8/14>","eso<9/14>","me<10/14>"," m<11/14>","es<12/14>","sa<13/14>","ge<14/14>"]
+Explanation:
+The first 9 parts take 3 characters each from the beginning of message.
+The next 5 parts take 2 characters each to finish splitting message. 
+In this example, each part, including the last, has length 9. 
+It can be shown it is not possible to split message into less than 14 parts.
+
+ +

Example 2:

+ +
+Input: message = "short message", limit = 15
+Output: ["short mess<1/2>","age<2/2>"]
+Explanation:
+Under the given constraints, the string can be split into two parts: 
+- The first part comprises of the first 10 characters, and has a length 15.
+- The next part comprises of the last 3 characters, and has a length 8.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= message.length <= 104
    • +
  • message consists only of lowercase English letters and ' '.
    • +
  • 1 <= limit <= 104
    • +
+",3.0,False,"class Solution { +public: + vector splitMessage(string message, int limit) { + + } +};","class Solution { + public String[] splitMessage(String message, int limit) { + + } +}","class Solution(object): + def splitMessage(self, message, limit): + """""" + :type message: str + :type limit: int + :rtype: List[str] + """""" + ","class Solution: + def splitMessage(self, message: str, limit: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** splitMessage(char * message, int limit, int* returnSize){ + +}","public class Solution { + public string[] SplitMessage(string message, int limit) { + + } +}","/** + * @param {string} message + * @param {number} limit + * @return {string[]} + */ +var splitMessage = function(message, limit) { + +};","# @param {String} message +# @param {Integer} limit +# @return {String[]} +def split_message(message, limit) + +end","class Solution { + func splitMessage(_ message: String, _ limit: Int) -> [String] { + + } +}","func splitMessage(message string, limit int) []string { + +}","object Solution { + def splitMessage(message: String, limit: Int): Array[String] = { + + } +}","class Solution { + fun splitMessage(message: String, limit: Int): Array { + + } +}","impl Solution { + pub fn split_message(message: String, limit: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String $message + * @param Integer $limit + * @return String[] + */ + function splitMessage($message, $limit) { + + } +}","function splitMessage(message: string, limit: number): string[] { + +};","(define/contract (split-message message limit) + (-> string? exact-integer? (listof string?)) + + )","-spec split_message(Message :: unicode:unicode_binary(), Limit :: integer()) -> [unicode:unicode_binary()]. +split_message(Message, Limit) -> + .","defmodule Solution do + @spec split_message(message :: String.t, limit :: integer) :: [String.t] + def split_message(message, limit) do + + end +end","class Solution { + List splitMessage(String message, int limit) { + + } +}", +233,count-ways-to-build-good-strings,Count Ways To Build Good Strings,2466.0,2562.0,"

Given the integers zero, one, low, and high, we can construct a string by starting with an empty string, and then at each step perform either of the following:

+ +
    +
  • Append the character '0' zero times.
    • +
  • Append the character '1' one times.
    • +
+ +

This can be performed any number of times.

+ +

A good string is a string constructed by the above process having a length between low and high (inclusive).

+ +

Return the number of different good strings that can be constructed satisfying these properties. Since the answer can be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: low = 3, high = 3, zero = 1, one = 1
+Output: 8
+Explanation: 
+One possible valid good string is "011". 
+It can be constructed as follows: "" -> "0" -> "01" -> "011". 
+All binary strings from "000" to "111" are good strings in this example.
+
+ +

Example 2:

+ +
+Input: low = 2, high = 3, zero = 1, one = 2
+Output: 5
+Explanation: The good strings are "00", "11", "000", "110", and "011".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= low <= high <= 105
    • +
  • 1 <= zero, one <= low
    • +
+",2.0,False,"class Solution { +public: + int countGoodStrings(int low, int high, int zero, int one) { + + } +};","class Solution { + public int countGoodStrings(int low, int high, int zero, int one) { + + } +}","class Solution(object): + def countGoodStrings(self, low, high, zero, one): + """""" + :type low: int + :type high: int + :type zero: int + :type one: int + :rtype: int + """""" + ","class Solution: + def countGoodStrings(self, low: int, high: int, zero: int, one: int) -> int: + ","int countGoodStrings(int low, int high, int zero, int one){ + +}","public class Solution { + public int CountGoodStrings(int low, int high, int zero, int one) { + + } +}","/** + * @param {number} low + * @param {number} high + * @param {number} zero + * @param {number} one + * @return {number} + */ +var countGoodStrings = function(low, high, zero, one) { + +};","# @param {Integer} low +# @param {Integer} high +# @param {Integer} zero +# @param {Integer} one +# @return {Integer} +def count_good_strings(low, high, zero, one) + +end","class Solution { + func countGoodStrings(_ low: Int, _ high: Int, _ zero: Int, _ one: Int) -> Int { + + } +}","func countGoodStrings(low int, high int, zero int, one int) int { + +}","object Solution { + def countGoodStrings(low: Int, high: Int, zero: Int, one: Int): Int = { + + } +}","class Solution { + fun countGoodStrings(low: Int, high: Int, zero: Int, one: Int): Int { + + } +}","impl Solution { + pub fn count_good_strings(low: i32, high: i32, zero: i32, one: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $low + * @param Integer $high + * @param Integer $zero + * @param Integer $one + * @return Integer + */ + function countGoodStrings($low, $high, $zero, $one) { + + } +}","function countGoodStrings(low: number, high: number, zero: number, one: number): number { + +};","(define/contract (count-good-strings low high zero one) + (-> exact-integer? exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec count_good_strings(Low :: integer(), High :: integer(), Zero :: integer(), One :: integer()) -> integer(). +count_good_strings(Low, High, Zero, One) -> + .","defmodule Solution do + @spec count_good_strings(low :: integer, high :: integer, zero :: integer, one :: integer) :: integer + def count_good_strings(low, high, zero, one) do + + end +end","class Solution { + int countGoodStrings(int low, int high, int zero, int one) { + + } +}", +235,maximum-number-of-non-overlapping-palindrome-substrings,Maximum Number of Non-overlapping Palindrome Substrings,2472.0,2559.0,"

You are given a string s and a positive integer k.

+ +

Select a set of non-overlapping substrings from the string s that satisfy the following conditions:

+ +
    +
  • The length of each substring is at least k.
    • +
  • Each substring is a palindrome.
    • +
+ +

Return the maximum number of substrings in an optimal selection.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "abaccdbbd", k = 3
+Output: 2
+Explanation: We can select the substrings underlined in s = "abaccdbbd". Both "aba" and "dbbd" are palindromes and have a length of at least k = 3.
+It can be shown that we cannot find a selection with more than two valid substrings.
+
+ +

Example 2:

+ +
+Input: s = "adbcda", k = 2
+Output: 0
+Explanation: There is no palindrome substring of length at least 2 in the string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= s.length <= 2000
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int maxPalindromes(string s, int k) { + + } +};","class Solution { + public int maxPalindromes(String s, int k) { + + } +}","class Solution(object): + def maxPalindromes(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def maxPalindromes(self, s: str, k: int) -> int: + ","int maxPalindromes(char * s, int k){ + +}","public class Solution { + public int MaxPalindromes(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var maxPalindromes = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def max_palindromes(s, k) + +end","class Solution { + func maxPalindromes(_ s: String, _ k: Int) -> Int { + + } +}","func maxPalindromes(s string, k int) int { + +}","object Solution { + def maxPalindromes(s: String, k: Int): Int = { + + } +}","class Solution { + fun maxPalindromes(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn max_palindromes(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function maxPalindromes($s, $k) { + + } +}","function maxPalindromes(s: string, k: number): number { + +};","(define/contract (max-palindromes s k) + (-> string? exact-integer? exact-integer?) + + )","-spec max_palindromes(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +max_palindromes(S, K) -> + .","defmodule Solution do + @spec max_palindromes(s :: String.t, k :: integer) :: integer + def max_palindromes(s, k) do + + end +end","class Solution { + int maxPalindromes(String s, int k) { + + } +}", +236,minimum-number-of-operations-to-sort-a-binary-tree-by-level,Minimum Number of Operations to Sort a Binary Tree by Level,2471.0,2558.0,"

You are given the root of a binary tree with unique values.

+ +

In one operation, you can choose any two nodes at the same level and swap their values.

+ +

Return the minimum number of operations needed to make the values at each level sorted in a strictly increasing order.

+ +

The level of a node is the number of edges along the path between it and the root node.

+ +

 

+

Example 1:

+ +
+Input: root = [1,4,3,7,6,8,5,null,null,null,null,9,null,10]
+Output: 3
+Explanation:
+- Swap 4 and 3. The 2nd level becomes [3,4].
+- Swap 7 and 5. The 3rd level becomes [5,6,8,7].
+- Swap 8 and 7. The 3rd level becomes [5,6,7,8].
+We used 3 operations so return 3.
+It can be proven that 3 is the minimum number of operations needed.
+
+ +

Example 2:

+ +
+Input: root = [1,3,2,7,6,5,4]
+Output: 3
+Explanation:
+- Swap 3 and 2. The 2nd level becomes [2,3].
+- Swap 7 and 4. The 3rd level becomes [4,6,5,7].
+- Swap 6 and 5. The 3rd level becomes [4,5,6,7].
+We used 3 operations so return 3.
+It can be proven that 3 is the minimum number of operations needed.
+
+ +

Example 3:

+ +
+Input: root = [1,2,3,4,5,6]
+Output: 0
+Explanation: Each level is already sorted in increasing order so return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 105].
    • +
  • 1 <= Node.val <= 105
    • +
  • All the values of the tree are unique.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int minimumOperations(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int minimumOperations(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def minimumOperations(self, root): + """""" + :type root: Optional[TreeNode] + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def minimumOperations(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int minimumOperations(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int MinimumOperations(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var minimumOperations = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def minimum_operations(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func minimumOperations(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func minimumOperations(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def minimumOperations(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun minimumOperations(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn minimum_operations(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function minimumOperations($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function minimumOperations(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (minimum-operations root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec minimum_operations(Root :: #tree_node{} | null) -> integer(). +minimum_operations(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec minimum_operations(root :: TreeNode.t | nil) :: integer + def minimum_operations(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int minimumOperations(TreeNode? root) { + + } +}", +237,number-of-subarrays-with-lcm-equal-to-k,Number of Subarrays With LCM Equal to K,2470.0,2557.0,"

Given an integer array nums and an integer k, return the number of subarrays of nums where the least common multiple of the subarray's elements is k.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

The least common multiple of an array is the smallest positive integer that is divisible by all the array elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,6,2,7,1], k = 6
+Output: 4
+Explanation: The subarrays of nums where 6 is the least common multiple of all the subarray's elements are:
+- [3,6,2,7,1]
+- [3,6,2,7,1]
+- [3,6,2,7,1]
+- [3,6,2,7,1]
+
+ +

Example 2:

+ +
+Input: nums = [3], k = 2
+Output: 0
+Explanation: There are no subarrays of nums where 2 is the least common multiple of all the subarray's elements.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i], k <= 1000
    • +
+",2.0,False,"class Solution { +public: + int subarrayLCM(vector& nums, int k) { + + } +};","class Solution { + public int subarrayLCM(int[] nums, int k) { + + } +}","class Solution(object): + def subarrayLCM(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def subarrayLCM(self, nums: List[int], k: int) -> int: + ","int subarrayLCM(int* nums, int numsSize, int k){ + +}","public class Solution { + public int SubarrayLCM(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var subarrayLCM = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def subarray_lcm(nums, k) + +end","class Solution { + func subarrayLCM(_ nums: [Int], _ k: Int) -> Int { + + } +}","func subarrayLCM(nums []int, k int) int { + +}","object Solution { + def subarrayLCM(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun subarrayLCM(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn subarray_lcm(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function subarrayLCM($nums, $k) { + + } +}","function subarrayLCM(nums: number[], k: number): number { + +};","(define/contract (subarray-lcm nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec subarray_lcm(Nums :: [integer()], K :: integer()) -> integer(). +subarray_lcm(Nums, K) -> + .","defmodule Solution do + @spec subarray_lcm(nums :: [integer], k :: integer) :: integer + def subarray_lcm(nums, k) do + + end +end","class Solution { + int subarrayLCM(List nums, int k) { + + } +}", +239,minimum-total-distance-traveled,Minimum Total Distance Traveled,2463.0,2554.0,"

There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.

+ +

The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.

+ +

All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.

+ +

At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.

+ +

Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.

+ +

Note that

+ +
    +
  • All robots move at the same speed.
    • +
  • If two robots move in the same direction, they will never collide.
    • +
  • If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
    • +
  • If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
    • +
  • If the robot moved from a position x to a position y, the distance it moved is |y - x|.
    • +
+ +

 

+

Example 1:

+ +
+Input: robot = [0,4,6], factory = [[2,2],[6,2]]
+Output: 4
+Explanation: As shown in the figure:
+- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.
+- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.
+- The third robot at position 6 will be repaired at the second factory. It does not need to move.
+The limit of the first factory is 2, and it fixed 2 robots.
+The limit of the second factory is 2, and it fixed 1 robot.
+The total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.
+
+ +

Example 2:

+ +
+Input: robot = [1,-1], factory = [[-2,1],[2,1]]
+Output: 2
+Explanation: As shown in the figure:
+- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.
+- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.
+The limit of the first factory is 1, and it fixed 1 robot.
+The limit of the second factory is 1, and it fixed 1 robot.
+The total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= robot.length, factory.length <= 100
    • +
  • factory[j].length == 2
    • +
  • -109 <= robot[i], positionj <= 109
    • +
  • 0 <= limitj <= robot.length
    • +
  • The input will be generated such that it is always possible to repair every robot.
    • +
+",3.0,False,"class Solution { +public: + long long minimumTotalDistance(vector& robot, vector>& factory) { + + } +};","class Solution { + public long minimumTotalDistance(List robot, int[][] factory) { + + } +}","class Solution(object): + def minimumTotalDistance(self, robot, factory): + """""" + :type robot: List[int] + :type factory: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumTotalDistance(self, robot: List[int], factory: List[List[int]]) -> int: + ","long long minimumTotalDistance(int* robot, int robotSize, int** factory, int factorySize, int* factoryColSize){ + +}","public class Solution { + public long MinimumTotalDistance(IList robot, int[][] factory) { + + } +}","/** + * @param {number[]} robot + * @param {number[][]} factory + * @return {number} + */ +var minimumTotalDistance = function(robot, factory) { + +};","# @param {Integer[]} robot +# @param {Integer[][]} factory +# @return {Integer} +def minimum_total_distance(robot, factory) + +end","class Solution { + func minimumTotalDistance(_ robot: [Int], _ factory: [[Int]]) -> Int { + + } +}","func minimumTotalDistance(robot []int, factory [][]int) int64 { + +}","object Solution { + def minimumTotalDistance(robot: List[Int], factory: Array[Array[Int]]): Long = { + + } +}","class Solution { + fun minimumTotalDistance(robot: List, factory: Array): Long { + + } +}","impl Solution { + pub fn minimum_total_distance(robot: Vec, factory: Vec>) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $robot + * @param Integer[][] $factory + * @return Integer + */ + function minimumTotalDistance($robot, $factory) { + + } +}","function minimumTotalDistance(robot: number[], factory: number[][]): number { + +};","(define/contract (minimum-total-distance robot factory) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_total_distance(Robot :: [integer()], Factory :: [[integer()]]) -> integer(). +minimum_total_distance(Robot, Factory) -> + .","defmodule Solution do + @spec minimum_total_distance(robot :: [integer], factory :: [[integer]]) :: integer + def minimum_total_distance(robot, factory) do + + end +end","class Solution { + int minimumTotalDistance(List robot, List> factory) { + + } +}", +240,total-cost-to-hire-k-workers,Total Cost to Hire K Workers,2462.0,2553.0,"

You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.

+ +

You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:

+ +
    +
  • You will run k sessions and hire exactly one worker in each session.
    • +
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index. +
      +
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
      • +
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
      • +
    +
    • +
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
    • +
  • A worker can only be chosen once.
    • +
+ +

Return the total cost to hire exactly k workers.

+ +

 

+

Example 1:

+ +
+Input: costs = [17,12,10,2,7,2,11,20,8], k = 3, candidates = 4
+Output: 11
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [17,12,10,2,7,2,11,20,8]. The lowest cost is 2, and we break the tie by the smallest index, which is 3. The total cost = 0 + 2 = 2.
+- In the second hiring round we choose the worker from [17,12,10,7,2,11,20,8]. The lowest cost is 2 (index 4). The total cost = 2 + 2 = 4.
+- In the third hiring round we choose the worker from [17,12,10,7,11,20,8]. The lowest cost is 7 (index 3). The total cost = 4 + 7 = 11. Notice that the worker with index 3 was common in the first and last four workers.
+The total hiring cost is 11.
+
+ +

Example 2:

+ +
+Input: costs = [1,2,4,1], k = 3, candidates = 3
+Output: 4
+Explanation: We hire 3 workers in total. The total cost is initially 0.
+- In the first hiring round we choose the worker from [1,2,4,1]. The lowest cost is 1, and we break the tie by the smallest index, which is 0. The total cost = 0 + 1 = 1. Notice that workers with index 1 and 2 are common in the first and last 3 workers.
+- In the second hiring round we choose the worker from [2,4,1]. The lowest cost is 1 (index 2). The total cost = 1 + 1 = 2.
+- In the third hiring round there are less than three candidates. We choose the worker from the remaining workers [2,4]. The lowest cost is 2 (index 0). The total cost = 2 + 2 = 4.
+The total hiring cost is 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= costs.length <= 105
    • +
  • 1 <= costs[i] <= 105
    • +
  • 1 <= k, candidates <= costs.length
    • +
+",2.0,False,"class Solution { +public: + long long totalCost(vector& costs, int k, int candidates) { + + } +};","class Solution { + public long totalCost(int[] costs, int k, int candidates) { + + } +}","class Solution(object): + def totalCost(self, costs, k, candidates): + """""" + :type costs: List[int] + :type k: int + :type candidates: int + :rtype: int + """""" + ","class Solution: + def totalCost(self, costs: List[int], k: int, candidates: int) -> int: + ","long long totalCost(int* costs, int costsSize, int k, int candidates){ + +}","public class Solution { + public long TotalCost(int[] costs, int k, int candidates) { + + } +}","/** + * @param {number[]} costs + * @param {number} k + * @param {number} candidates + * @return {number} + */ +var totalCost = function(costs, k, candidates) { + +};","# @param {Integer[]} costs +# @param {Integer} k +# @param {Integer} candidates +# @return {Integer} +def total_cost(costs, k, candidates) + +end","class Solution { + func totalCost(_ costs: [Int], _ k: Int, _ candidates: Int) -> Int { + + } +}","func totalCost(costs []int, k int, candidates int) int64 { + +}","object Solution { + def totalCost(costs: Array[Int], k: Int, candidates: Int): Long = { + + } +}","class Solution { + fun totalCost(costs: IntArray, k: Int, candidates: Int): Long { + + } +}","impl Solution { + pub fn total_cost(costs: Vec, k: i32, candidates: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $costs + * @param Integer $k + * @param Integer $candidates + * @return Integer + */ + function totalCost($costs, $k, $candidates) { + + } +}","function totalCost(costs: number[], k: number, candidates: number): number { + +};","(define/contract (total-cost costs k candidates) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec total_cost(Costs :: [integer()], K :: integer(), Candidates :: integer()) -> integer(). +total_cost(Costs, K, Candidates) -> + .","defmodule Solution do + @spec total_cost(costs :: [integer], k :: integer, candidates :: integer) :: integer + def total_cost(costs, k, candidates) do + + end +end","class Solution { + int totalCost(List costs, int k, int candidates) { + + } +}", +241,maximum-sum-of-distinct-subarrays-with-length-k,Maximum Sum of Distinct Subarrays With Length K,2461.0,2552.0,"

You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:

+ +
    +
  • The length of the subarray is k, and
    • +
  • All the elements of the subarray are distinct.
    • +
+ +

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return 0.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,4,2,9,9,9], k = 3
+Output: 15
+Explanation: The subarrays of nums with length 3 are:
+- [1,5,4] which meets the requirements and has a sum of 10.
+- [5,4,2] which meets the requirements and has a sum of 11.
+- [4,2,9] which meets the requirements and has a sum of 15.
+- [2,9,9] which does not meet the requirements because the element 9 is repeated.
+- [9,9,9] which does not meet the requirements because the element 9 is repeated.
+We return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions
+
+ +

Example 2:

+ +
+Input: nums = [4,4,4], k = 3
+Output: 0
+Explanation: The subarrays of nums with length 3 are:
+- [4,4,4] which does not meet the requirements because the element 4 is repeated.
+We return 0 because no subarrays meet the conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + long long maximumSubarraySum(vector& nums, int k) { + + } +};","class Solution { + public long maximumSubarraySum(int[] nums, int k) { + + } +}","class Solution(object): + def maximumSubarraySum(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumSubarraySum(self, nums: List[int], k: int) -> int: + ","long long maximumSubarraySum(int* nums, int numsSize, int k){ + +}","public class Solution { + public long MaximumSubarraySum(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumSubarraySum = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def maximum_subarray_sum(nums, k) + +end","class Solution { + func maximumSubarraySum(_ nums: [Int], _ k: Int) -> Int { + + } +}","func maximumSubarraySum(nums []int, k int) int64 { + +}","object Solution { + def maximumSubarraySum(nums: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun maximumSubarraySum(nums: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn maximum_subarray_sum(nums: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function maximumSubarraySum($nums, $k) { + + } +}","function maximumSubarraySum(nums: number[], k: number): number { + +};","(define/contract (maximum-subarray-sum nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_subarray_sum(Nums :: [integer()], K :: integer()) -> integer(). +maximum_subarray_sum(Nums, K) -> + .","defmodule Solution do + @spec maximum_subarray_sum(nums :: [integer], k :: integer) :: integer + def maximum_subarray_sum(nums, k) do + + end +end","class Solution { + int maximumSubarraySum(List nums, int k) { + + } +}", +244,next-greater-element-iv,Next Greater Element IV,2454.0,2549.0,"

You are given a 0-indexed array of non-negative integers nums. For each integer in nums, you must find its respective second greater integer.

+ +

The second greater integer of nums[i] is nums[j] such that:

+ +
    +
  • j > i
    • +
  • nums[j] > nums[i]
    • +
  • There exists exactly one index k such that nums[k] > nums[i] and i < k < j.
    • +
+ +

If there is no such nums[j], the second greater integer is considered to be -1.

+ +
    +
  • For example, in the array [1, 2, 4, 3], the second greater integer of 1 is 4, 2 is 3, and that of 3 and 4 is -1.
    • +
+ +

Return an integer array answer, where answer[i] is the second greater integer of nums[i].

+ +

 

+

Example 1:

+ +
+Input: nums = [2,4,0,9,6]
+Output: [9,6,6,-1,-1]
+Explanation:
+0th index: 4 is the first integer greater than 2, and 9 is the second integer greater than 2, to the right of 2.
+1st index: 9 is the first, and 6 is the second integer greater than 4, to the right of 4.
+2nd index: 9 is the first, and 6 is the second integer greater than 0, to the right of 0.
+3rd index: There is no integer greater than 9 to its right, so the second greater integer is considered to be -1.
+4th index: There is no integer greater than 6 to its right, so the second greater integer is considered to be -1.
+Thus, we return [9,6,6,-1,-1].
+
+ +

Example 2:

+ +
+Input: nums = [3,3]
+Output: [-1,-1]
+Explanation:
+We return [-1,-1] since neither integer has any integer greater than it.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + vector secondGreaterElement(vector& nums) { + + } +};","class Solution { + public int[] secondGreaterElement(int[] nums) { + + } +}","class Solution(object): + def secondGreaterElement(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def secondGreaterElement(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* secondGreaterElement(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] SecondGreaterElement(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var secondGreaterElement = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def second_greater_element(nums) + +end","class Solution { + func secondGreaterElement(_ nums: [Int]) -> [Int] { + + } +}","func secondGreaterElement(nums []int) []int { + +}","object Solution { + def secondGreaterElement(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun secondGreaterElement(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn second_greater_element(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function secondGreaterElement($nums) { + + } +}","function secondGreaterElement(nums: number[]): number[] { + +};","(define/contract (second-greater-element nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec second_greater_element(Nums :: [integer()]) -> [integer()]. +second_greater_element(Nums) -> + .","defmodule Solution do + @spec second_greater_element(nums :: [integer]) :: [integer] + def second_greater_element(nums) do + + end +end","class Solution { + List secondGreaterElement(List nums) { + + } +}", +248,height-of-binary-tree-after-subtree-removal-queries,Height of Binary Tree After Subtree Removal Queries,2458.0,2545.0,"

You are given the root of a binary tree with n nodes. Each node is assigned a unique value from 1 to n. You are also given an array queries of size m.

+ +

You have to perform m independent queries on the tree where in the ith query you do the following:

+ +
    +
  • Remove the subtree rooted at the node with the value queries[i] from the tree. It is guaranteed that queries[i] will not be equal to the value of the root.
    • +
+ +

Return an array answer of size m where answer[i] is the height of the tree after performing the ith query.

+ +

Note:

+ +
    +
  • The queries are independent, so the tree returns to its initial state after each query.
    • +
  • The height of a tree is the number of edges in the longest simple path from the root to some node in the tree.
    • +
+ +

 

+

Example 1:

+ +
+Input: root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]
+Output: [2]
+Explanation: The diagram above shows the tree after removing the subtree rooted at node with value 4.
+The height of the tree is 2 (The path 1 -> 3 -> 2).
+
+ +

Example 2:

+ +
+Input: root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]
+Output: [3,2,3,2]
+Explanation: We have the following queries:
+- Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).
+- Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).
+- Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).
+- Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
    • +
  • 2 <= n <= 105
    • +
  • 1 <= Node.val <= n
    • +
  • All the values in the tree are unique.
    • +
  • m == queries.length
    • +
  • 1 <= m <= min(n, 104)
    • +
  • 1 <= queries[i] <= n
    • +
  • queries[i] != root.val
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector treeQueries(TreeNode* root, vector& queries) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int[] treeQueries(TreeNode root, int[] queries) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def treeQueries(self, root, queries): + """""" + :type root: Optional[TreeNode] + :type queries: List[int] + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def treeQueries(self, root: Optional[TreeNode], queries: List[int]) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* treeQueries(struct TreeNode* root, int* queries, int queriesSize, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int[] TreeQueries(TreeNode root, int[] queries) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number[]} queries + * @return {number[]} + */ +var treeQueries = function(root, queries) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer[]} queries +# @return {Integer[]} +def tree_queries(root, queries) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func treeQueries(_ root: TreeNode?, _ queries: [Int]) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func treeQueries(root *TreeNode, queries []int) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def treeQueries(root: TreeNode, queries: Array[Int]): Array[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun treeQueries(root: TreeNode?, queries: IntArray): IntArray { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn tree_queries(root: Option>>, queries: Vec) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer[] $queries + * @return Integer[] + */ + function treeQueries($root, $queries) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function treeQueries(root: TreeNode | null, queries: number[]): number[] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (tree-queries root queries) + (-> (or/c tree-node? #f) (listof exact-integer?) (listof exact-integer?)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec tree_queries(Root :: #tree_node{} | null, Queries :: [integer()]) -> [integer()]. +tree_queries(Root, Queries) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec tree_queries(root :: TreeNode.t | nil, queries :: [integer]) :: [integer] + def tree_queries(root, queries) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List treeQueries(TreeNode? root, List queries) { + + } +}", +249,minimum-addition-to-make-integer-beautiful,Minimum Addition to Make Integer Beautiful,2457.0,2544.0,"

You are given two positive integers n and target.

+ +

An integer is considered beautiful if the sum of its digits is less than or equal to target.

+ +

Return the minimum non-negative integer x such that n + x is beautiful. The input will be generated such that it is always possible to make n beautiful.

+ +

 

+

Example 1:

+ +
+Input: n = 16, target = 6
+Output: 4
+Explanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.
+
+ +

Example 2:

+ +
+Input: n = 467, target = 6
+Output: 33
+Explanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.
+
+ +

Example 3:

+ +
+Input: n = 1, target = 1
+Output: 0
+Explanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1012
    • +
  • 1 <= target <= 150
    • +
  • The input will be generated such that it is always possible to make n beautiful.
    • +
+",2.0,False,"class Solution { +public: + long long makeIntegerBeautiful(long long n, int target) { + + } +};","class Solution { + public long makeIntegerBeautiful(long n, int target) { + + } +}","class Solution(object): + def makeIntegerBeautiful(self, n, target): + """""" + :type n: int + :type target: int + :rtype: int + """""" + ","class Solution: + def makeIntegerBeautiful(self, n: int, target: int) -> int: + ","long long makeIntegerBeautiful(long long n, int target){ + +}","public class Solution { + public long MakeIntegerBeautiful(long n, int target) { + + } +}","/** + * @param {number} n + * @param {number} target + * @return {number} + */ +var makeIntegerBeautiful = function(n, target) { + +};","# @param {Integer} n +# @param {Integer} target +# @return {Integer} +def make_integer_beautiful(n, target) + +end","class Solution { + func makeIntegerBeautiful(_ n: Int, _ target: Int) -> Int { + + } +}","func makeIntegerBeautiful(n int64, target int) int64 { + +}","object Solution { + def makeIntegerBeautiful(n: Long, target: Int): Long = { + + } +}","class Solution { + fun makeIntegerBeautiful(n: Long, target: Int): Long { + + } +}","impl Solution { + pub fn make_integer_beautiful(n: i64, target: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $target + * @return Integer + */ + function makeIntegerBeautiful($n, $target) { + + } +}","function makeIntegerBeautiful(n: number, target: number): number { + +};","(define/contract (make-integer-beautiful n target) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec make_integer_beautiful(N :: integer(), Target :: integer()) -> integer(). +make_integer_beautiful(N, Target) -> + .","defmodule Solution do + @spec make_integer_beautiful(n :: integer, target :: integer) :: integer + def make_integer_beautiful(n, target) do + + end +end","class Solution { + int makeIntegerBeautiful(int n, int target) { + + } +}", +251,average-value-of-even-numbers-that-are-divisible-by-three,Average Value of Even Numbers That Are Divisible by Three,2455.0,2542.0,"

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

+ +

Note that the average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,6,10,12,15]
+Output: 9
+Explanation: 6 and 12 are even numbers that are divisible by 3. (6 + 12) / 2 = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,4,7,10]
+Output: 0
+Explanation: There is no single number that satisfies the requirement, so return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 1000
    • +
+",1.0,False,"class Solution { +public: + int averageValue(vector& nums) { + + } +};","class Solution { + public int averageValue(int[] nums) { + + } +}","class Solution(object): + def averageValue(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def averageValue(self, nums: List[int]) -> int: + ","int averageValue(int* nums, int numsSize){ + +}","public class Solution { + public int AverageValue(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var averageValue = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def average_value(nums) + +end","class Solution { + func averageValue(_ nums: [Int]) -> Int { + + } +}","func averageValue(nums []int) int { + +}","object Solution { + def averageValue(nums: Array[Int]): Int = { + + } +}","class Solution { + fun averageValue(nums: IntArray): Int { + + } +}","impl Solution { + pub fn average_value(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function averageValue($nums) { + + } +}","function averageValue(nums: number[]): number { + +};","(define/contract (average-value nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec average_value(Nums :: [integer()]) -> integer(). +average_value(Nums) -> + .","defmodule Solution do + @spec average_value(nums :: [integer]) :: integer + def average_value(nums) do + + end +end","class Solution { + int averageValue(List nums) { + + } +}", +252,sum-of-number-and-its-reverse,Sum of Number and Its Reverse,2443.0,2541.0,"

Given a non-negative integer num, return true if num can be expressed as the sum of any non-negative integer and its reverse, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: num = 443
+Output: true
+Explanation: 172 + 271 = 443 so we return true.
+
+ +

Example 2:

+ +
+Input: num = 63
+Output: false
+Explanation: 63 cannot be expressed as the sum of a non-negative integer and its reverse so we return false.
+
+ +

Example 3:

+ +
+Input: num = 181
+Output: true
+Explanation: 140 + 041 = 181 so we return true. Note that when a number is reversed, there may be leading zeros.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 105
    • +
+",2.0,False,"class Solution { +public: + bool sumOfNumberAndReverse(int num) { + + } +};","class Solution { + public boolean sumOfNumberAndReverse(int num) { + + } +}","class Solution(object): + def sumOfNumberAndReverse(self, num): + """""" + :type num: int + :rtype: bool + """""" + ","class Solution: + def sumOfNumberAndReverse(self, num: int) -> bool: + ","bool sumOfNumberAndReverse(int num){ + +}","public class Solution { + public bool SumOfNumberAndReverse(int num) { + + } +}","/** + * @param {number} num + * @return {boolean} + */ +var sumOfNumberAndReverse = function(num) { + +};","# @param {Integer} num +# @return {Boolean} +def sum_of_number_and_reverse(num) + +end","class Solution { + func sumOfNumberAndReverse(_ num: Int) -> Bool { + + } +}","func sumOfNumberAndReverse(num int) bool { + +}","object Solution { + def sumOfNumberAndReverse(num: Int): Boolean = { + + } +}","class Solution { + fun sumOfNumberAndReverse(num: Int): Boolean { + + } +}","impl Solution { + pub fn sum_of_number_and_reverse(num: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Boolean + */ + function sumOfNumberAndReverse($num) { + + } +}","function sumOfNumberAndReverse(num: number): boolean { + +};","(define/contract (sum-of-number-and-reverse num) + (-> exact-integer? boolean?) + + )","-spec sum_of_number_and_reverse(Num :: integer()) -> boolean(). +sum_of_number_and_reverse(Num) -> + .","defmodule Solution do + @spec sum_of_number_and_reverse(num :: integer) :: boolean + def sum_of_number_and_reverse(num) do + + end +end","class Solution { + bool sumOfNumberAndReverse(int num) { + + } +}", +253,minimum-number-of-operations-to-make-arrays-similar,Minimum Number of Operations to Make Arrays Similar,2449.0,2539.0,"

You are given two positive integer arrays nums and target, of the same length.

+ +

In one operation, you can choose any two distinct indices i and j where 0 <= i, j < nums.length and:

+ +
    +
  • set nums[i] = nums[i] + 2 and
    • +
  • set nums[j] = nums[j] - 2.
    • +
+ +

Two arrays are considered to be similar if the frequency of each element is the same.

+ +

Return the minimum number of operations required to make nums similar to target. The test cases are generated such that nums can always be similar to target.

+ +

 

+

Example 1:

+ +
+Input: nums = [8,12,6], target = [2,14,10]
+Output: 2
+Explanation: It is possible to make nums similar to target in two operations:
+- Choose i = 0 and j = 2, nums = [10,12,4].
+- Choose i = 1 and j = 2, nums = [10,14,2].
+It can be shown that 2 is the minimum number of operations needed.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,5], target = [4,1,3]
+Output: 1
+Explanation: We can make nums similar to target in one operation:
+- Choose i = 1 and j = 2, nums = [1,4,3].
+
+ +

Example 3:

+ +
+Input: nums = [1,1,1,1,1], target = [1,1,1,1,1]
+Output: 0
+Explanation: The array nums is already similiar to target.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length == target.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i], target[i] <= 106
    • +
  • It is possible to make nums similar to target.
    • +
+",3.0,False,"class Solution { +public: + long long makeSimilar(vector& nums, vector& target) { + + } +};","class Solution { + public long makeSimilar(int[] nums, int[] target) { + + } +}","class Solution(object): + def makeSimilar(self, nums, target): + """""" + :type nums: List[int] + :type target: List[int] + :rtype: int + """""" + ","class Solution: + def makeSimilar(self, nums: List[int], target: List[int]) -> int: + ","long long makeSimilar(int* nums, int numsSize, int* target, int targetSize){ + +}","public class Solution { + public long MakeSimilar(int[] nums, int[] target) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} target + * @return {number} + */ +var makeSimilar = function(nums, target) { + +};","# @param {Integer[]} nums +# @param {Integer[]} target +# @return {Integer} +def make_similar(nums, target) + +end","class Solution { + func makeSimilar(_ nums: [Int], _ target: [Int]) -> Int { + + } +}","func makeSimilar(nums []int, target []int) int64 { + +}","object Solution { + def makeSimilar(nums: Array[Int], target: Array[Int]): Long = { + + } +}","class Solution { + fun makeSimilar(nums: IntArray, target: IntArray): Long { + + } +}","impl Solution { + pub fn make_similar(nums: Vec, target: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $target + * @return Integer + */ + function makeSimilar($nums, $target) { + + } +}","function makeSimilar(nums: number[], target: number[]): number { + +};","(define/contract (make-similar nums target) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec make_similar(Nums :: [integer()], Target :: [integer()]) -> integer(). +make_similar(Nums, Target) -> + .","defmodule Solution do + @spec make_similar(nums :: [integer], target :: [integer]) :: integer + def make_similar(nums, target) do + + end +end","class Solution { + int makeSimilar(List nums, List target) { + + } +}", +254,minimum-cost-to-make-array-equal,Minimum Cost to Make Array Equal,2448.0,2538.0,"

You are given two 0-indexed arrays nums and cost consisting each of n positive integers.

+ +

You can do the following operation any number of times:

+ +
    +
  • Increase or decrease any element of the array nums by 1.
    • +
+ +

The cost of doing one operation on the ith element is cost[i].

+ +

Return the minimum total cost such that all the elements of the array nums become equal.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,5,2], cost = [2,3,1,14]
+Output: 8
+Explanation: We can make all the elements equal to 2 in the following way:
+- Increase the 0th element one time. The cost is 2.
+- Decrease the 1st element one time. The cost is 3.
+- Decrease the 2nd element three times. The cost is 1 + 1 + 1 = 3.
+The total cost is 2 + 3 + 3 = 8.
+It can be shown that we cannot make the array equal with a smaller cost.
+
+ +

Example 2:

+ +
+Input: nums = [2,2,2,2,2], cost = [4,2,8,1,3]
+Output: 0
+Explanation: All the elements are already equal, so no operations are needed.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length == cost.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i], cost[i] <= 106
    • +
  • Test cases are generated in a way that the output doesn't exceed 253-1
    • +
+",3.0,False,"class Solution { +public: + long long minCost(vector& nums, vector& cost) { + + } +};","class Solution { + public long minCost(int[] nums, int[] cost) { + + } +}","class Solution(object): + def minCost(self, nums, cost): + """""" + :type nums: List[int] + :type cost: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, nums: List[int], cost: List[int]) -> int: + ","long long minCost(int* nums, int numsSize, int* cost, int costSize){ + +}","public class Solution { + public long MinCost(int[] nums, int[] cost) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} cost + * @return {number} + */ +var minCost = function(nums, cost) { + +};","# @param {Integer[]} nums +# @param {Integer[]} cost +# @return {Integer} +def min_cost(nums, cost) + +end","class Solution { + func minCost(_ nums: [Int], _ cost: [Int]) -> Int { + + } +}","func minCost(nums []int, cost []int) int64 { + +}","object Solution { + def minCost(nums: Array[Int], cost: Array[Int]): Long = { + + } +}","class Solution { + fun minCost(nums: IntArray, cost: IntArray): Long { + + } +}","impl Solution { + pub fn min_cost(nums: Vec, cost: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $cost + * @return Integer + */ + function minCost($nums, $cost) { + + } +}","function minCost(nums: number[], cost: number[]): number { + +};","(define/contract (min-cost nums cost) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_cost(Nums :: [integer()], Cost :: [integer()]) -> integer(). +min_cost(Nums, Cost) -> + .","defmodule Solution do + @spec min_cost(nums :: [integer], cost :: [integer]) :: integer + def min_cost(nums, cost) do + + end +end","class Solution { + int minCost(List nums, List cost) { + + } +}", +256,bitwise-xor-of-all-pairings,Bitwise XOR of All Pairings,2425.0,2533.0,"

You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers between nums1 and nums2 (every integer in nums1 is paired with every integer in nums2 exactly once).

+ +

Return the bitwise XOR of all integers in nums3.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [2,1,3], nums2 = [10,2,5,0]
+Output: 13
+Explanation:
+A possible nums3 array is [8,0,7,2,11,3,4,1,9,1,6,3].
+The bitwise XOR of all these numbers is 13, so we return 13.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,2], nums2 = [3,4]
+Output: 0
+Explanation:
+All possible pairs of bitwise XORs are nums1[0] ^ nums2[0], nums1[0] ^ nums2[1], nums1[1] ^ nums2[0],
+and nums1[1] ^ nums2[1].
+Thus, one possible nums3 array is [2,5,1,6].
+2 ^ 5 ^ 1 ^ 6 = 0, so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
    • +
  • 0 <= nums1[i], nums2[j] <= 109
    • +
+",2.0,False,"class Solution { +public: + int xorAllNums(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int xorAllNums(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def xorAllNums(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def xorAllNums(self, nums1: List[int], nums2: List[int]) -> int: + ","int xorAllNums(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int XorAllNums(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var xorAllNums = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def xor_all_nums(nums1, nums2) + +end","class Solution { + func xorAllNums(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func xorAllNums(nums1 []int, nums2 []int) int { + +}","object Solution { + def xorAllNums(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun xorAllNums(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn xor_all_nums(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function xorAllNums($nums1, $nums2) { + + } +}","function xorAllNums(nums1: number[], nums2: number[]): number { + +};","(define/contract (xor-all-nums nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec xor_all_nums(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +xor_all_nums(Nums1, Nums2) -> + .","defmodule Solution do + @spec xor_all_nums(nums1 :: [integer], nums2 :: [integer]) :: integer + def xor_all_nums(nums1, nums2) do + + end +end","class Solution { + int xorAllNums(List nums1, List nums2) { + + } +}", +258,create-components-with-same-value,Create Components With Same Value,2440.0,2531.0,"

There is an undirected tree with n nodes labeled from 0 to n - 1.

+ +

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

You are allowed to delete some edges, splitting the tree into multiple connected components. Let the value of a component be the sum of all nums[i] for which node i is in the component.

+ +

Return the maximum number of edges you can delete, such that every connected component in the tree has the same value.

+ +

 

+

Example 1:

+ +
+Input: nums = [6,2,2,2,6], edges = [[0,1],[1,2],[1,3],[3,4]] 
+Output: 2 
+Explanation: The above figure shows how we can delete the edges [0,1] and [3,4]. The created components are nodes [0], [1,2,3] and [4]. The sum of the values in each component equals 6. It can be proven that no better deletion exists, so the answer is 2.
+
+ +

Example 2:

+ +
+Input: nums = [2], edges = []
+Output: 0
+Explanation: There are no edges to be deleted.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 104
    • +
  • nums.length == n
    • +
  • 1 <= nums[i] <= 50
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= edges[i][0], edges[i][1] <= n - 1
    • +
  • edges represents a valid tree.
    • +
+",3.0,False,"class Solution { +public: + int componentValue(vector& nums, vector>& edges) { + + } +};","class Solution { + public int componentValue(int[] nums, int[][] edges) { + + } +}","class Solution(object): + def componentValue(self, nums, edges): + """""" + :type nums: List[int] + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def componentValue(self, nums: List[int], edges: List[List[int]]) -> int: + ","int componentValue(int* nums, int numsSize, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int ComponentValue(int[] nums, int[][] edges) { + + } +}","/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +var componentValue = function(nums, edges) { + +};","# @param {Integer[]} nums +# @param {Integer[][]} edges +# @return {Integer} +def component_value(nums, edges) + +end","class Solution { + func componentValue(_ nums: [Int], _ edges: [[Int]]) -> Int { + + } +}","func componentValue(nums []int, edges [][]int) int { + +}","object Solution { + def componentValue(nums: Array[Int], edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun componentValue(nums: IntArray, edges: Array): Int { + + } +}","impl Solution { + pub fn component_value(nums: Vec, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[][] $edges + * @return Integer + */ + function componentValue($nums, $edges) { + + } +}","function componentValue(nums: number[], edges: number[][]): number { + +};","(define/contract (component-value nums edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec component_value(Nums :: [integer()], Edges :: [[integer()]]) -> integer(). +component_value(Nums, Edges) -> + .","defmodule Solution do + @spec component_value(nums :: [integer], edges :: [[integer]]) :: integer + def component_value(nums, edges) do + + end +end","class Solution { + int componentValue(List nums, List> edges) { + + } +}", +260,range-product-queries-of-powers,Range Product Queries of Powers,2438.0,2529.0,"

Given a positive integer n, there exists a 0-indexed array called powers, composed of the minimum number of powers of 2 that sum to n. The array is sorted in non-decreasing order, and there is only one way to form the array.

+ +

You are also given a 0-indexed 2D integer array queries, where queries[i] = [lefti, righti]. Each queries[i] represents a query where you have to find the product of all powers[j] with lefti <= j <= righti.

+ +

Return an array answers, equal in length to queries, where answers[i] is the answer to the ith query. Since the answer to the ith query may be too large, each answers[i] should be returned modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 15, queries = [[0,1],[2,2],[0,3]]
+Output: [2,4,64]
+Explanation:
+For n = 15, powers = [1,2,4,8]. It can be shown that powers cannot be a smaller size.
+Answer to 1st query: powers[0] * powers[1] = 1 * 2 = 2.
+Answer to 2nd query: powers[2] = 4.
+Answer to 3rd query: powers[0] * powers[1] * powers[2] * powers[3] = 1 * 2 * 4 * 8 = 64.
+Each answer modulo 109 + 7 yields the same answer, so [2,4,64] is returned.
+
+ +

Example 2:

+ +
+Input: n = 2, queries = [[0,0]]
+Output: [2]
+Explanation:
+For n = 2, powers = [2].
+The answer to the only query is powers[0] = 2. The answer modulo 109 + 7 is the same, so [2] is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
  • 1 <= queries.length <= 105
    • +
  • 0 <= starti <= endi < powers.length
    • +
+",2.0,False,"class Solution { +public: + vector productQueries(int n, vector>& queries) { + + } +};","class Solution { + public int[] productQueries(int n, int[][] queries) { + + } +}","class Solution(object): + def productQueries(self, n, queries): + """""" + :type n: int + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def productQueries(self, n: int, queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* productQueries(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] ProductQueries(int n, int[][] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} queries + * @return {number[]} + */ +var productQueries = function(n, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} queries +# @return {Integer[]} +def product_queries(n, queries) + +end","class Solution { + func productQueries(_ n: Int, _ queries: [[Int]]) -> [Int] { + + } +}","func productQueries(n int, queries [][]int) []int { + +}","object Solution { + def productQueries(n: Int, queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun productQueries(n: Int, queries: Array): IntArray { + + } +}","impl Solution { + pub fn product_queries(n: i32, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $queries + * @return Integer[] + */ + function productQueries($n, $queries) { + + } +}","function productQueries(n: number, queries: number[][]): number[] { + +};","(define/contract (product-queries n queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec product_queries(N :: integer(), Queries :: [[integer()]]) -> [integer()]. +product_queries(N, Queries) -> + .","defmodule Solution do + @spec product_queries(n :: integer, queries :: [[integer]]) :: [integer] + def product_queries(n, queries) do + + end +end","class Solution { + List productQueries(int n, List> queries) { + + } +}", +262,count-subarrays-with-fixed-bounds,Count Subarrays With Fixed Bounds,2444.0,2527.0,"

You are given an integer array nums and two integers minK and maxK.

+ +

A fixed-bound subarray of nums is a subarray that satisfies the following conditions:

+ +
    +
  • The minimum value in the subarray is equal to minK.
    • +
  • The maximum value in the subarray is equal to maxK.
    • +
+ +

Return the number of fixed-bound subarrays.

+ +

A subarray is a contiguous part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,5,2,7,5], minK = 1, maxK = 5
+Output: 2
+Explanation: The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1,1], minK = 1, maxK = 1
+Output: 10
+Explanation: Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • 1 <= nums[i], minK, maxK <= 106
    • +
+",3.0,False,"class Solution { +public: + long long countSubarrays(vector& nums, int minK, int maxK) { + + } +};","class Solution { + public long countSubarrays(int[] nums, int minK, int maxK) { + + } +}","class Solution(object): + def countSubarrays(self, nums, minK, maxK): + """""" + :type nums: List[int] + :type minK: int + :type maxK: int + :rtype: int + """""" + ","class Solution: + def countSubarrays(self, nums: List[int], minK: int, maxK: int) -> int: + ","long long countSubarrays(int* nums, int numsSize, int minK, int maxK){ + +}","public class Solution { + public long CountSubarrays(int[] nums, int minK, int maxK) { + + } +}","/** + * @param {number[]} nums + * @param {number} minK + * @param {number} maxK + * @return {number} + */ +var countSubarrays = function(nums, minK, maxK) { + +};","# @param {Integer[]} nums +# @param {Integer} min_k +# @param {Integer} max_k +# @return {Integer} +def count_subarrays(nums, min_k, max_k) + +end","class Solution { + func countSubarrays(_ nums: [Int], _ minK: Int, _ maxK: Int) -> Int { + + } +}","func countSubarrays(nums []int, minK int, maxK int) int64 { + +}","object Solution { + def countSubarrays(nums: Array[Int], minK: Int, maxK: Int): Long = { + + } +}","class Solution { + fun countSubarrays(nums: IntArray, minK: Int, maxK: Int): Long { + + } +}","impl Solution { + pub fn count_subarrays(nums: Vec, min_k: i32, max_k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $minK + * @param Integer $maxK + * @return Integer + */ + function countSubarrays($nums, $minK, $maxK) { + + } +}","function countSubarrays(nums: number[], minK: number, maxK: number): number { + +};","(define/contract (count-subarrays nums minK maxK) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec count_subarrays(Nums :: [integer()], MinK :: integer(), MaxK :: integer()) -> integer(). +count_subarrays(Nums, MinK, MaxK) -> + .","defmodule Solution do + @spec count_subarrays(nums :: [integer], min_k :: integer, max_k :: integer) :: integer + def count_subarrays(nums, min_k, max_k) do + + end +end","class Solution { + int countSubarrays(List nums, int minK, int maxK) { + + } +}", +263,longest-increasing-subsequence-ii,Longest Increasing Subsequence II,2407.0,2526.0,"

You are given an integer array nums and an integer k.

+ +

Find the longest subsequence of nums that meets the following requirements:

+ +
    +
  • The subsequence is strictly increasing and
    • +
  • The difference between adjacent elements in the subsequence is at most k.
    • +
+ +

Return the length of the longest subsequence that meets the requirements.

+ +

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,2,1,4,3,4,5,8,15], k = 3
+Output: 5
+Explanation:
+The longest subsequence that meets the requirements is [1,3,4,5,8].
+The subsequence has a length of 5, so we return 5.
+Note that the subsequence [1,3,4,5,8,15] does not meet the requirements because 15 - 8 = 7 is larger than 3.
+
+ +

Example 2:

+ +
+Input: nums = [7,4,5,1,8,12,4,7], k = 5
+Output: 4
+Explanation:
+The longest subsequence that meets the requirements is [4,5,8,12].
+The subsequence has a length of 4, so we return 4.
+
+ +

Example 3:

+ +
+Input: nums = [1,5], k = 1
+Output: 1
+Explanation:
+The longest subsequence that meets the requirements is [1].
+The subsequence has a length of 1, so we return 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i], k <= 105
    • +
+",3.0,False,"class Solution { +public: + int lengthOfLIS(vector& nums, int k) { + + } +};","class Solution { + public int lengthOfLIS(int[] nums, int k) { + + } +}","class Solution(object): + def lengthOfLIS(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def lengthOfLIS(self, nums: List[int], k: int) -> int: + ","int lengthOfLIS(int* nums, int numsSize, int k){ + +}","public class Solution { + public int LengthOfLIS(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var lengthOfLIS = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def length_of_lis(nums, k) + +end","class Solution { + func lengthOfLIS(_ nums: [Int], _ k: Int) -> Int { + + } +}","func lengthOfLIS(nums []int, k int) int { + +}","object Solution { + def lengthOfLIS(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun lengthOfLIS(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn length_of_lis(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function lengthOfLIS($nums, $k) { + + } +}","function lengthOfLIS(nums: number[], k: number): number { + +};","(define/contract (length-of-lis nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec length_of_lis(Nums :: [integer()], K :: integer()) -> integer(). +length_of_lis(Nums, K) -> + .","defmodule Solution do + @spec length_of_lis(nums :: [integer], k :: integer) :: integer + def length_of_lis(nums, k) do + + end +end","class Solution { + int lengthOfLIS(List nums, int k) { + + } +}", +264,count-number-of-distinct-integers-after-reverse-operations,Count Number of Distinct Integers After Reverse Operations,2442.0,2525.0,"

You are given an array nums consisting of positive integers.

+ +

You have to take each integer in the array, reverse its digits, and add it to the end of the array. You should apply this operation to the original integers in nums.

+ +

Return the number of distinct integers in the final array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,13,10,12,31]
+Output: 6
+Explanation: After including the reverse of each number, the resulting array is [1,13,10,12,31,1,31,1,21,13].
+The reversed integers that were added to the end of the array are underlined. Note that for the integer 10, after reversing it, it becomes 01 which is just 1.
+The number of distinct integers in this array is 6 (The numbers 1, 10, 12, 13, 21, and 31).
+ +

Example 2:

+ +
+Input: nums = [2,2,2]
+Output: 1
+Explanation: After including the reverse of each number, the resulting array is [2,2,2,2,2,2].
+The number of distinct integers in this array is 1 (The number 2).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + int countDistinctIntegers(vector& nums) { + + } +};","class Solution { + public int countDistinctIntegers(int[] nums) { + + } +}","class Solution(object): + def countDistinctIntegers(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countDistinctIntegers(self, nums: List[int]) -> int: + ","int countDistinctIntegers(int* nums, int numsSize){ + +}","public class Solution { + public int CountDistinctIntegers(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countDistinctIntegers = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_distinct_integers(nums) + +end","class Solution { + func countDistinctIntegers(_ nums: [Int]) -> Int { + + } +}","func countDistinctIntegers(nums []int) int { + +}","object Solution { + def countDistinctIntegers(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countDistinctIntegers(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_distinct_integers(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countDistinctIntegers($nums) { + + } +}","function countDistinctIntegers(nums: number[]): number { + +};","(define/contract (count-distinct-integers nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_distinct_integers(Nums :: [integer()]) -> integer(). +count_distinct_integers(Nums) -> + .","defmodule Solution do + @spec count_distinct_integers(nums :: [integer]) :: integer + def count_distinct_integers(nums) do + + end +end","class Solution { + int countDistinctIntegers(List nums) { + + } +}", +266,paths-in-matrix-whose-sum-is-divisible-by-k,Paths in Matrix Whose Sum Is Divisible by K,2435.0,2521.0,"

You are given a 0-indexed m x n integer matrix grid and an integer k. You are currently at position (0, 0) and you want to reach position (m - 1, n - 1) moving only down or right.

+ +

Return the number of paths where the sum of the elements on the path is divisible by k. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: grid = [[5,2,4],[3,0,5],[0,7,2]], k = 3
+Output: 2
+Explanation: There are two paths where the sum of the elements on the path is divisible by k.
+The first path highlighted in red has a sum of 5 + 2 + 4 + 5 + 2 = 18 which is divisible by 3.
+The second path highlighted in blue has a sum of 5 + 3 + 0 + 5 + 2 = 15 which is divisible by 3.
+
+ +

Example 2:

+ +
+Input: grid = [[0,0]], k = 5
+Output: 1
+Explanation: The path highlighted in red has a sum of 0 + 0 = 0 which is divisible by 5.
+
+ +

Example 3:

+ +
+Input: grid = [[7,3,4,9],[2,3,6,2],[2,3,7,0]], k = 1
+Output: 10
+Explanation: Every integer is divisible by 1 so the sum of the elements on every possible path is divisible by k.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 5 * 104
    • +
  • 1 <= m * n <= 5 * 104
    • +
  • 0 <= grid[i][j] <= 100
    • +
  • 1 <= k <= 50
    • +
+",3.0,False,"class Solution { +public: + int numberOfPaths(vector>& grid, int k) { + + } +};","class Solution { + public int numberOfPaths(int[][] grid, int k) { + + } +}","class Solution(object): + def numberOfPaths(self, grid, k): + """""" + :type grid: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def numberOfPaths(self, grid: List[List[int]], k: int) -> int: + ","int numberOfPaths(int** grid, int gridSize, int* gridColSize, int k){ + +}","public class Solution { + public int NumberOfPaths(int[][] grid, int k) { + + } +}","/** + * @param {number[][]} grid + * @param {number} k + * @return {number} + */ +var numberOfPaths = function(grid, k) { + +};","# @param {Integer[][]} grid +# @param {Integer} k +# @return {Integer} +def number_of_paths(grid, k) + +end","class Solution { + func numberOfPaths(_ grid: [[Int]], _ k: Int) -> Int { + + } +}","func numberOfPaths(grid [][]int, k int) int { + +}","object Solution { + def numberOfPaths(grid: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun numberOfPaths(grid: Array, k: Int): Int { + + } +}","impl Solution { + pub fn number_of_paths(grid: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer $k + * @return Integer + */ + function numberOfPaths($grid, $k) { + + } +}","function numberOfPaths(grid: number[][], k: number): number { + +};","(define/contract (number-of-paths grid k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec number_of_paths(Grid :: [[integer()]], K :: integer()) -> integer(). +number_of_paths(Grid, K) -> + .","defmodule Solution do + @spec number_of_paths(grid :: [[integer]], k :: integer) :: integer + def number_of_paths(grid, k) do + + end +end","class Solution { + int numberOfPaths(List> grid, int k) { + + } +}", +267,using-a-robot-to-print-the-lexicographically-smallest-string,Using a Robot to Print the Lexicographically Smallest String,2434.0,2520.0,"

You are given a string s and a robot that currently holds an empty string t. Apply one of the following operations until s and t are both empty:

+ +
    +
  • Remove the first character of a string s and give it to the robot. The robot will append this character to the string t.
    • +
  • Remove the last character of a string t and give it to the robot. The robot will write this character on paper.
    • +
+ +

Return the lexicographically smallest string that can be written on the paper.

+ +

 

+

Example 1:

+ +
+Input: s = "zza"
+Output: "azz"
+Explanation: Let p denote the written string.
+Initially p="", s="zza", t="".
+Perform first operation three times p="", s="", t="zza".
+Perform second operation three times p="azz", s="", t="".
+
+ +

Example 2:

+ +
+Input: s = "bac"
+Output: "abc"
+Explanation: Let p denote the written string.
+Perform first operation twice p="", s="c", t="ba". 
+Perform second operation twice p="ab", s="c", t="". 
+Perform first operation p="ab", s="", t="c". 
+Perform second operation p="abc", s="", t="".
+
+ +

Example 3:

+ +
+Input: s = "bdda"
+Output: "addb"
+Explanation: Let p denote the written string.
+Initially p="", s="bdda", t="".
+Perform first operation four times p="", s="", t="bdda".
+Perform second operation four times p="addb", s="", t="".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of only English lowercase letters.
    • +
+",2.0,False,"class Solution { +public: + string robotWithString(string s) { + + } +};","class Solution { + public String robotWithString(String s) { + + } +}","class Solution(object): + def robotWithString(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def robotWithString(self, s: str) -> str: + ","char * robotWithString(char * s){ + +}","public class Solution { + public string RobotWithString(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var robotWithString = function(s) { + +};","# @param {String} s +# @return {String} +def robot_with_string(s) + +end","class Solution { + func robotWithString(_ s: String) -> String { + + } +}","func robotWithString(s string) string { + +}","object Solution { + def robotWithString(s: String): String = { + + } +}","class Solution { + fun robotWithString(s: String): String { + + } +}","impl Solution { + pub fn robot_with_string(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function robotWithString($s) { + + } +}","function robotWithString(s: string): string { + +};","(define/contract (robot-with-string s) + (-> string? string?) + + )","-spec robot_with_string(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +robot_with_string(S) -> + .","defmodule Solution do + @spec robot_with_string(s :: String.t) :: String.t + def robot_with_string(s) do + + end +end","class Solution { + String robotWithString(String s) { + + } +}", +269,the-employee-that-worked-on-the-longest-task,The Employee That Worked on the Longest Task,2432.0,2518.0,"

There are n employees, each with a unique id from 0 to n - 1.

+ +

You are given a 2D integer array logs where logs[i] = [idi, leaveTimei] where:

+ +
    +
  • idi is the id of the employee that worked on the ith task, and
    • +
  • leaveTimei is the time at which the employee finished the ith task. All the values leaveTimei are unique.
    • +
+ +

Note that the ith task starts the moment right after the (i - 1)th task ends, and the 0th task starts at time 0.

+ +

Return the id of the employee that worked the task with the longest time. If there is a tie between two or more employees, return the smallest id among them.

+ +

 

+

Example 1:

+ +
+Input: n = 10, logs = [[0,3],[2,5],[0,9],[1,15]]
+Output: 1
+Explanation: 
+Task 0 started at 0 and ended at 3 with 3 units of times.
+Task 1 started at 3 and ended at 5 with 2 units of times.
+Task 2 started at 5 and ended at 9 with 4 units of times.
+Task 3 started at 9 and ended at 15 with 6 units of times.
+The task with the longest time is task 3 and the employee with id 1 is the one that worked on it, so we return 1.
+
+ +

Example 2:

+ +
+Input: n = 26, logs = [[1,1],[3,7],[2,12],[7,17]]
+Output: 3
+Explanation: 
+Task 0 started at 0 and ended at 1 with 1 unit of times.
+Task 1 started at 1 and ended at 7 with 6 units of times.
+Task 2 started at 7 and ended at 12 with 5 units of times.
+Task 3 started at 12 and ended at 17 with 5 units of times.
+The tasks with the longest time is task 1. The employee that worked on it is 3, so we return 3.
+
+ +

Example 3:

+ +
+Input: n = 2, logs = [[0,10],[1,20]]
+Output: 0
+Explanation: 
+Task 0 started at 0 and ended at 10 with 10 units of times.
+Task 1 started at 10 and ended at 20 with 10 units of times.
+The tasks with the longest time are tasks 0 and 1. The employees that worked on them are 0 and 1, so we return the smallest id 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 500
    • +
  • 1 <= logs.length <= 500
    • +
  • logs[i].length == 2
    • +
  • 0 <= idi <= n - 1
    • +
  • 1 <= leaveTimei <= 500
    • +
  • idi != idi+1
    • +
  • leaveTimei are sorted in a strictly increasing order.
    • +
+",1.0,False,"class Solution { +public: + int hardestWorker(int n, vector>& logs) { + + } +};","class Solution { + public int hardestWorker(int n, int[][] logs) { + + } +}","class Solution(object): + def hardestWorker(self, n, logs): + """""" + :type n: int + :type logs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def hardestWorker(self, n: int, logs: List[List[int]]) -> int: + ","int hardestWorker(int n, int** logs, int logsSize, int* logsColSize){ + +}","public class Solution { + public int HardestWorker(int n, int[][] logs) { + + } +}","/** + * @param {number} n + * @param {number[][]} logs + * @return {number} + */ +var hardestWorker = function(n, logs) { + +};","# @param {Integer} n +# @param {Integer[][]} logs +# @return {Integer} +def hardest_worker(n, logs) + +end","class Solution { + func hardestWorker(_ n: Int, _ logs: [[Int]]) -> Int { + + } +}","func hardestWorker(n int, logs [][]int) int { + +}","object Solution { + def hardestWorker(n: Int, logs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun hardestWorker(n: Int, logs: Array): Int { + + } +}","impl Solution { + pub fn hardest_worker(n: i32, logs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $logs + * @return Integer + */ + function hardestWorker($n, $logs) { + + } +}","function hardestWorker(n: number, logs: number[][]): number { + +};","(define/contract (hardest-worker n logs) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec hardest_worker(N :: integer(), Logs :: [[integer()]]) -> integer(). +hardest_worker(N, Logs) -> + .","defmodule Solution do + @spec hardest_worker(n :: integer, logs :: [[integer]]) :: integer + def hardest_worker(n, logs) do + + end +end","class Solution { + int hardestWorker(int n, List> logs) { + + } +}", +270,number-of-pairs-satisfying-inequality,Number of Pairs Satisfying Inequality,2426.0,2513.0,"

You are given two 0-indexed integer arrays nums1 and nums2, each of size n, and an integer diff. Find the number of pairs (i, j) such that:

+ +
    +
  • 0 <= i < j <= n - 1 and
    • +
  • nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff.
    • +
+ +

Return the number of pairs that satisfy the conditions.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [3,2,5], nums2 = [2,2,1], diff = 1
+Output: 3
+Explanation:
+There are 3 pairs that satisfy the conditions:
+1. i = 0, j = 1: 3 - 2 <= 2 - 2 + 1. Since i < j and 1 <= 1, this pair satisfies the conditions.
+2. i = 0, j = 2: 3 - 5 <= 2 - 1 + 1. Since i < j and -2 <= 2, this pair satisfies the conditions.
+3. i = 1, j = 2: 2 - 5 <= 2 - 1 + 1. Since i < j and -3 <= 2, this pair satisfies the conditions.
+Therefore, we return 3.
+
+ +

Example 2:

+ +
+Input: nums1 = [3,-1], nums2 = [-2,2], diff = -1
+Output: 0
+Explanation:
+Since there does not exist any pair that satisfies the conditions, we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
    • +
  • 2 <= n <= 105
    • +
  • -104 <= nums1[i], nums2[i] <= 104
    • +
  • -104 <= diff <= 104
    • +
+",3.0,False,"class Solution { +public: + long long numberOfPairs(vector& nums1, vector& nums2, int diff) { + + } +};","class Solution { + public long numberOfPairs(int[] nums1, int[] nums2, int diff) { + + } +}","class Solution(object): + def numberOfPairs(self, nums1, nums2, diff): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type diff: int + :rtype: int + """""" + ","class Solution: + def numberOfPairs(self, nums1: List[int], nums2: List[int], diff: int) -> int: + ","long long numberOfPairs(int* nums1, int nums1Size, int* nums2, int nums2Size, int diff){ + +}","public class Solution { + public long NumberOfPairs(int[] nums1, int[] nums2, int diff) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} diff + * @return {number} + */ +var numberOfPairs = function(nums1, nums2, diff) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} diff +# @return {Integer} +def number_of_pairs(nums1, nums2, diff) + +end","class Solution { + func numberOfPairs(_ nums1: [Int], _ nums2: [Int], _ diff: Int) -> Int { + + } +}","func numberOfPairs(nums1 []int, nums2 []int, diff int) int64 { + +}","object Solution { + def numberOfPairs(nums1: Array[Int], nums2: Array[Int], diff: Int): Long = { + + } +}","class Solution { + fun numberOfPairs(nums1: IntArray, nums2: IntArray, diff: Int): Long { + + } +}","impl Solution { + pub fn number_of_pairs(nums1: Vec, nums2: Vec, diff: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $diff + * @return Integer + */ + function numberOfPairs($nums1, $nums2, $diff) { + + } +}","function numberOfPairs(nums1: number[], nums2: number[], diff: number): number { + +};","(define/contract (number-of-pairs nums1 nums2 diff) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec number_of_pairs(Nums1 :: [integer()], Nums2 :: [integer()], Diff :: integer()) -> integer(). +number_of_pairs(Nums1, Nums2, Diff) -> + .","defmodule Solution do + @spec number_of_pairs(nums1 :: [integer], nums2 :: [integer], diff :: integer) :: integer + def number_of_pairs(nums1, nums2, diff) do + + end +end","class Solution { + int numberOfPairs(List nums1, List nums2, int diff) { + + } +}", +271,longest-uploaded-prefix,Longest Uploaded Prefix,2424.0,2512.0,"

You are given a stream of n videos, each represented by a distinct number from 1 to n that you need to "upload" to a server. You need to implement a data structure that calculates the length of the longest uploaded prefix at various points in the upload process.

+ +

We consider i to be an uploaded prefix if all videos in the range 1 to i (inclusive) have been uploaded to the server. The longest uploaded prefix is the maximum value of i that satisfies this definition.
+
+Implement the LUPrefix class:

+ +
    +
  • LUPrefix(int n) Initializes the object for a stream of n videos.
    • +
  • void upload(int video) Uploads video to the server.
    • +
  • int longest() Returns the length of the longest uploaded prefix defined above.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["LUPrefix", "upload", "longest", "upload", "longest", "upload", "longest"]
+[[4], [3], [], [1], [], [2], []]
+Output
+[null, null, 0, null, 1, null, 3]
+
+Explanation
+LUPrefix server = new LUPrefix(4);   // Initialize a stream of 4 videos.
+server.upload(3);                    // Upload video 3.
+server.longest();                    // Since video 1 has not been uploaded yet, there is no prefix.
+                                     // So, we return 0.
+server.upload(1);                    // Upload video 1.
+server.longest();                    // The prefix [1] is the longest uploaded prefix, so we return 1.
+server.upload(2);                    // Upload video 2.
+server.longest();                    // The prefix [1,2,3] is the longest uploaded prefix, so we return 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 1 <= video <= n
    • +
  • All values of video are distinct.
    • +
  • At most 2 * 105 calls in total will be made to upload and longest.
    • +
  • At least one call will be made to longest.
    • +
+",2.0,False,"class LUPrefix { +public: + LUPrefix(int n) { + + } + + void upload(int video) { + + } + + int longest() { + + } +}; + +/** + * Your LUPrefix object will be instantiated and called as such: + * LUPrefix* obj = new LUPrefix(n); + * obj->upload(video); + * int param_2 = obj->longest(); + */","class LUPrefix { + + public LUPrefix(int n) { + + } + + public void upload(int video) { + + } + + public int longest() { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * LUPrefix obj = new LUPrefix(n); + * obj.upload(video); + * int param_2 = obj.longest(); + */","class LUPrefix(object): + + def __init__(self, n): + """""" + :type n: int + """""" + + + def upload(self, video): + """""" + :type video: int + :rtype: None + """""" + + + def longest(self): + """""" + :rtype: int + """""" + + + +# Your LUPrefix object will be instantiated and called as such: +# obj = LUPrefix(n) +# obj.upload(video) +# param_2 = obj.longest()","class LUPrefix: + + def __init__(self, n: int): + + + def upload(self, video: int) -> None: + + + def longest(self) -> int: + + + +# Your LUPrefix object will be instantiated and called as such: +# obj = LUPrefix(n) +# obj.upload(video) +# param_2 = obj.longest()"," + + +typedef struct { + +} LUPrefix; + + +LUPrefix* lUPrefixCreate(int n) { + +} + +void lUPrefixUpload(LUPrefix* obj, int video) { + +} + +int lUPrefixLongest(LUPrefix* obj) { + +} + +void lUPrefixFree(LUPrefix* obj) { + +} + +/** + * Your LUPrefix struct will be instantiated and called as such: + * LUPrefix* obj = lUPrefixCreate(n); + * lUPrefixUpload(obj, video); + + * int param_2 = lUPrefixLongest(obj); + + * lUPrefixFree(obj); +*/","public class LUPrefix { + + public LUPrefix(int n) { + + } + + public void Upload(int video) { + + } + + public int Longest() { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * LUPrefix obj = new LUPrefix(n); + * obj.Upload(video); + * int param_2 = obj.Longest(); + */","/** + * @param {number} n + */ +var LUPrefix = function(n) { + +}; + +/** + * @param {number} video + * @return {void} + */ +LUPrefix.prototype.upload = function(video) { + +}; + +/** + * @return {number} + */ +LUPrefix.prototype.longest = function() { + +}; + +/** + * Your LUPrefix object will be instantiated and called as such: + * var obj = new LUPrefix(n) + * obj.upload(video) + * var param_2 = obj.longest() + */","class LUPrefix + +=begin + :type n: Integer +=end + def initialize(n) + + end + + +=begin + :type video: Integer + :rtype: Void +=end + def upload(video) + + end + + +=begin + :rtype: Integer +=end + def longest() + + end + + +end + +# Your LUPrefix object will be instantiated and called as such: +# obj = LUPrefix.new(n) +# obj.upload(video) +# param_2 = obj.longest()"," +class LUPrefix { + + init(_ n: Int) { + + } + + func upload(_ video: Int) { + + } + + func longest() -> Int { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * let obj = LUPrefix(n) + * obj.upload(video) + * let ret_2: Int = obj.longest() + */","type LUPrefix struct { + +} + + +func Constructor(n int) LUPrefix { + +} + + +func (this *LUPrefix) Upload(video int) { + +} + + +func (this *LUPrefix) Longest() int { + +} + + +/** + * Your LUPrefix object will be instantiated and called as such: + * obj := Constructor(n); + * obj.Upload(video); + * param_2 := obj.Longest(); + */","class LUPrefix(_n: Int) { + + def upload(video: Int) { + + } + + def longest(): Int = { + + } + +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * var obj = new LUPrefix(n) + * obj.upload(video) + * var param_2 = obj.longest() + */","class LUPrefix(n: Int) { + + fun upload(video: Int) { + + } + + fun longest(): Int { + + } + +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * var obj = LUPrefix(n) + * obj.upload(video) + * var param_2 = obj.longest() + */","struct LUPrefix { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl LUPrefix { + + fn new(n: i32) -> Self { + + } + + fn upload(&self, video: i32) { + + } + + fn longest(&self) -> i32 { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * let obj = LUPrefix::new(n); + * obj.upload(video); + * let ret_2: i32 = obj.longest(); + */","class LUPrefix { + /** + * @param Integer $n + */ + function __construct($n) { + + } + + /** + * @param Integer $video + * @return NULL + */ + function upload($video) { + + } + + /** + * @return Integer + */ + function longest() { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * $obj = LUPrefix($n); + * $obj->upload($video); + * $ret_2 = $obj->longest(); + */","class LUPrefix { + constructor(n: number) { + + } + + upload(video: number): void { + + } + + longest(): number { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * var obj = new LUPrefix(n) + * obj.upload(video) + * var param_2 = obj.longest() + */","(define lu-prefix% + (class object% + (super-new) + + ; n : exact-integer? + (init-field + n) + + ; upload : exact-integer? -> void? + (define/public (upload video) + + ) + ; longest : -> exact-integer? + (define/public (longest) + + ))) + +;; Your lu-prefix% object will be instantiated and called as such: +;; (define obj (new lu-prefix% [n n])) +;; (send obj upload video) +;; (define param_2 (send obj longest))","-spec lu_prefix_init_(N :: integer()) -> any(). +lu_prefix_init_(N) -> + . + +-spec lu_prefix_upload(Video :: integer()) -> any(). +lu_prefix_upload(Video) -> + . + +-spec lu_prefix_longest() -> integer(). +lu_prefix_longest() -> + . + + +%% Your functions will be called as such: +%% lu_prefix_init_(N), +%% lu_prefix_upload(Video), +%% Param_2 = lu_prefix_longest(), + +%% lu_prefix_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule LUPrefix do + @spec init_(n :: integer) :: any + def init_(n) do + + end + + @spec upload(video :: integer) :: any + def upload(video) do + + end + + @spec longest() :: integer + def longest() do + + end +end + +# Your functions will be called as such: +# LUPrefix.init_(n) +# LUPrefix.upload(video) +# param_2 = LUPrefix.longest() + +# LUPrefix.init_ will be called before every test case, in which you can do some necessary initializations.","class LUPrefix { + + LUPrefix(int n) { + + } + + void upload(int video) { + + } + + int longest() { + + } +} + +/** + * Your LUPrefix object will be instantiated and called as such: + * LUPrefix obj = LUPrefix(n); + * obj.upload(video); + * int param2 = obj.longest(); + */", +273,maximum-deletions-on-a-string,Maximum Deletions on a String,2430.0,2510.0,"

You are given a string s consisting of only lowercase English letters. In one operation, you can:

+ +
    +
  • Delete the entire string s, or
    • +
  • Delete the first i letters of s if the first i letters of s are equal to the following i letters in s, for any i in the range 1 <= i <= s.length / 2.
    • +
+ +

For example, if s = "ababc", then in one operation, you could delete the first two letters of s to get "abc", since the first two letters of s and the following two letters of s are both equal to "ab".

+ +

Return the maximum number of operations needed to delete all of s.

+ +

 

+

Example 1:

+ +
+Input: s = "abcabcdabc"
+Output: 2
+Explanation:
+- Delete the first 3 letters ("abc") since the next 3 letters are equal. Now, s = "abcdabc".
+- Delete all the letters.
+We used 2 operations so return 2. It can be proven that 2 is the maximum number of operations needed.
+Note that in the second operation we cannot delete "abc" again because the next occurrence of "abc" does not happen in the next 3 letters.
+
+ +

Example 2:

+ +
+Input: s = "aaabaab"
+Output: 4
+Explanation:
+- Delete the first letter ("a") since the next letter is equal. Now, s = "aabaab".
+- Delete the first 3 letters ("aab") since the next 3 letters are equal. Now, s = "aab".
+- Delete the first letter ("a") since the next letter is equal. Now, s = "ab".
+- Delete all the letters.
+We used 4 operations so return 4. It can be proven that 4 is the maximum number of operations needed.
+
+ +

Example 3:

+ +
+Input: s = "aaaaa"
+Output: 5
+Explanation: In each operation, we can delete the first letter of s.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 4000
    • +
  • s consists only of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int deleteString(string s) { + + } +};","class Solution { + public int deleteString(String s) { + + } +}","class Solution(object): + def deleteString(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def deleteString(self, s: str) -> int: + ","int deleteString(char * s){ + +}","public class Solution { + public int DeleteString(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var deleteString = function(s) { + +};","# @param {String} s +# @return {Integer} +def delete_string(s) + +end","class Solution { + func deleteString(_ s: String) -> Int { + + } +}","func deleteString(s string) int { + +}","object Solution { + def deleteString(s: String): Int = { + + } +}","class Solution { + fun deleteString(s: String): Int { + + } +}","impl Solution { + pub fn delete_string(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function deleteString($s) { + + } +}","function deleteString(s: string): number { + +};","(define/contract (delete-string s) + (-> string? exact-integer?) + + )","-spec delete_string(S :: unicode:unicode_binary()) -> integer(). +delete_string(S) -> + .","defmodule Solution do + @spec delete_string(s :: String.t) :: integer + def delete_string(s) do + + end +end","class Solution { + int deleteString(String s) { + + } +}", +274,minimize-xor,Minimize XOR,2429.0,2509.0,"

Given two positive integers num1 and num2, find the positive integer x such that:

+ +
    +
  • x has the same number of set bits as num2, and
    • +
  • The value x XOR num1 is minimal.
    • +
+ +

Note that XOR is the bitwise XOR operation.

+ +

Return the integer x. The test cases are generated such that x is uniquely determined.

+ +

The number of set bits of an integer is the number of 1's in its binary representation.

+ +

 

+

Example 1:

+ +
+Input: num1 = 3, num2 = 5
+Output: 3
+Explanation:
+The binary representations of num1 and num2 are 0011 and 0101, respectively.
+The integer 3 has the same number of set bits as num2, and the value 3 XOR 3 = 0 is minimal.
+
+ +

Example 2:

+ +
+Input: num1 = 1, num2 = 12
+Output: 3
+Explanation:
+The binary representations of num1 and num2 are 0001 and 1100, respectively.
+The integer 3 has the same number of set bits as num2, and the value 3 XOR 1 = 2 is minimal.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num1, num2 <= 109
    • +
+",2.0,False,"class Solution { +public: + int minimizeXor(int num1, int num2) { + + } +};","class Solution { + public int minimizeXor(int num1, int num2) { + + } +}","class Solution(object): + def minimizeXor(self, num1, num2): + """""" + :type num1: int + :type num2: int + :rtype: int + """""" + ","class Solution: + def minimizeXor(self, num1: int, num2: int) -> int: + ","int minimizeXor(int num1, int num2){ + +}","public class Solution { + public int MinimizeXor(int num1, int num2) { + + } +}","/** + * @param {number} num1 + * @param {number} num2 + * @return {number} + */ +var minimizeXor = function(num1, num2) { + +};","# @param {Integer} num1 +# @param {Integer} num2 +# @return {Integer} +def minimize_xor(num1, num2) + +end","class Solution { + func minimizeXor(_ num1: Int, _ num2: Int) -> Int { + + } +}","func minimizeXor(num1 int, num2 int) int { + +}","object Solution { + def minimizeXor(num1: Int, num2: Int): Int = { + + } +}","class Solution { + fun minimizeXor(num1: Int, num2: Int): Int { + + } +}","impl Solution { + pub fn minimize_xor(num1: i32, num2: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num1 + * @param Integer $num2 + * @return Integer + */ + function minimizeXor($num1, $num2) { + + } +}","function minimizeXor(num1: number, num2: number): number { + +};","(define/contract (minimize-xor num1 num2) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec minimize_xor(Num1 :: integer(), Num2 :: integer()) -> integer(). +minimize_xor(Num1, Num2) -> + .","defmodule Solution do + @spec minimize_xor(num1 :: integer, num2 :: integer) :: integer + def minimize_xor(num1, num2) do + + end +end","class Solution { + int minimizeXor(int num1, int num2) { + + } +}", +276,number-of-common-factors,Number of Common Factors,2427.0,2507.0,"

Given two positive integers a and b, return the number of common factors of a and b.

+ +

An integer x is a common factor of a and b if x divides both a and b.

+ +

 

+

Example 1:

+ +
+Input: a = 12, b = 6
+Output: 4
+Explanation: The common factors of 12 and 6 are 1, 2, 3, 6.
+
+ +

Example 2:

+ +
+Input: a = 25, b = 30
+Output: 2
+Explanation: The common factors of 25 and 30 are 1, 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a, b <= 1000
    • +
+",1.0,False,"class Solution { +public: + int commonFactors(int a, int b) { + + } +};","class Solution { + public int commonFactors(int a, int b) { + + } +}","class Solution(object): + def commonFactors(self, a, b): + """""" + :type a: int + :type b: int + :rtype: int + """""" + ","class Solution: + def commonFactors(self, a: int, b: int) -> int: + ","int commonFactors(int a, int b){ + +}","public class Solution { + public int CommonFactors(int a, int b) { + + } +}","/** + * @param {number} a + * @param {number} b + * @return {number} + */ +var commonFactors = function(a, b) { + +};","# @param {Integer} a +# @param {Integer} b +# @return {Integer} +def common_factors(a, b) + +end","class Solution { + func commonFactors(_ a: Int, _ b: Int) -> Int { + + } +}","func commonFactors(a int, b int) int { + +}","object Solution { + def commonFactors(a: Int, b: Int): Int = { + + } +}","class Solution { + fun commonFactors(a: Int, b: Int): Int { + + } +}","impl Solution { + pub fn common_factors(a: i32, b: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer $b + * @return Integer + */ + function commonFactors($a, $b) { + + } +}","function commonFactors(a: number, b: number): number { + +};","(define/contract (common-factors a b) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec common_factors(A :: integer(), B :: integer()) -> integer(). +common_factors(A, B) -> + .","defmodule Solution do + @spec common_factors(a :: integer, b :: integer) :: integer + def common_factors(a, b) do + + end +end","class Solution { + int commonFactors(int a, int b) { + + } +}", +277,number-of-good-paths,Number of Good Paths,2421.0,2505.0,"

There is a tree (i.e. a connected, undirected graph with no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges.

+ +

You are given a 0-indexed integer array vals of length n where vals[i] denotes the value of the ith node. You are also given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

+ +

A good path is a simple path that satisfies the following conditions:

+ +
    +
  1. The starting node and the ending node have the same value.
    2. +
  2. All nodes between the starting node and the ending node have values less than or equal to the starting node (i.e. the starting node's value should be the maximum value along the path).
    3. +
+ +

Return the number of distinct good paths.

+ +

Note that a path and its reverse are counted as the same path. For example, 0 -> 1 is considered to be the same as 1 -> 0. A single node is also considered as a valid path.

+ +

 

+

Example 1:

+ +
+Input: vals = [1,3,2,1,3], edges = [[0,1],[0,2],[2,3],[2,4]]
+Output: 6
+Explanation: There are 5 good paths consisting of a single node.
+There is 1 additional good path: 1 -> 0 -> 2 -> 4.
+(The reverse path 4 -> 2 -> 0 -> 1 is treated as the same as 1 -> 0 -> 2 -> 4.)
+Note that 0 -> 2 -> 3 is not a good path because vals[2] > vals[0].
+
+ +

Example 2:

+ +
+Input: vals = [1,1,2,2,3], edges = [[0,1],[1,2],[2,3],[2,4]]
+Output: 7
+Explanation: There are 5 good paths consisting of a single node.
+There are 2 additional good paths: 0 -> 1 and 2 -> 3.
+
+ +

Example 3:

+ +
+Input: vals = [1], edges = []
+Output: 1
+Explanation: The tree consists of only one node, so there is one good path.
+
+ +

 

+

Constraints:

+ +
    +
  • n == vals.length
    • +
  • 1 <= n <= 3 * 104
    • +
  • 0 <= vals[i] <= 105
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • edges represents a valid tree.
    • +
+",3.0,False,"class Solution { +public: + int numberOfGoodPaths(vector& vals, vector>& edges) { + + } +};","class Solution { + public int numberOfGoodPaths(int[] vals, int[][] edges) { + + } +}","class Solution(object): + def numberOfGoodPaths(self, vals, edges): + """""" + :type vals: List[int] + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numberOfGoodPaths(self, vals: List[int], edges: List[List[int]]) -> int: + ","int numberOfGoodPaths(int* vals, int valsSize, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int NumberOfGoodPaths(int[] vals, int[][] edges) { + + } +}","/** + * @param {number[]} vals + * @param {number[][]} edges + * @return {number} + */ +var numberOfGoodPaths = function(vals, edges) { + +};","# @param {Integer[]} vals +# @param {Integer[][]} edges +# @return {Integer} +def number_of_good_paths(vals, edges) + +end","class Solution { + func numberOfGoodPaths(_ vals: [Int], _ edges: [[Int]]) -> Int { + + } +}","func numberOfGoodPaths(vals []int, edges [][]int) int { + +}","object Solution { + def numberOfGoodPaths(vals: Array[Int], edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numberOfGoodPaths(vals: IntArray, edges: Array): Int { + + } +}","impl Solution { + pub fn number_of_good_paths(vals: Vec, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $vals + * @param Integer[][] $edges + * @return Integer + */ + function numberOfGoodPaths($vals, $edges) { + + } +}","function numberOfGoodPaths(vals: number[], edges: number[][]): number { + +};","(define/contract (number-of-good-paths vals edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec number_of_good_paths(Vals :: [integer()], Edges :: [[integer()]]) -> integer(). +number_of_good_paths(Vals, Edges) -> + .","defmodule Solution do + @spec number_of_good_paths(vals :: [integer], edges :: [[integer]]) :: integer + def number_of_good_paths(vals, edges) do + + end +end","class Solution { + int numberOfGoodPaths(List vals, List> edges) { + + } +}", +279,longest-subarray-with-maximum-bitwise-and,Longest Subarray With Maximum Bitwise AND,2419.0,2503.0,"

You are given an integer array nums of size n.

+ +

Consider a non-empty subarray from nums that has the maximum possible bitwise AND.

+ +
    +
  • In other words, let k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should be considered.
    • +
+ +

Return the length of the longest such subarray.

+ +

The bitwise AND of an array is the bitwise AND of all the numbers in it.

+ +

A subarray is a contiguous sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,3,2,2]
+Output: 2
+Explanation:
+The maximum possible bitwise AND of a subarray is 3.
+The longest subarray with that value is [3,3], so we return 2.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: 1
+Explanation:
+The maximum possible bitwise AND of a subarray is 4.
+The longest subarray with that value is [4], so we return 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + int longestSubarray(vector& nums) { + + } +};","class Solution { + public int longestSubarray(int[] nums) { + + } +}","class Solution(object): + def longestSubarray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def longestSubarray(self, nums: List[int]) -> int: + ","int longestSubarray(int* nums, int numsSize){ + +}","public class Solution { + public int LongestSubarray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var longestSubarray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def longest_subarray(nums) + +end","class Solution { + func longestSubarray(_ nums: [Int]) -> Int { + + } +}","func longestSubarray(nums []int) int { + +}","object Solution { + def longestSubarray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun longestSubarray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn longest_subarray(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function longestSubarray($nums) { + + } +}","function longestSubarray(nums: number[]): number { + +};","(define/contract (longest-subarray nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_subarray(Nums :: [integer()]) -> integer(). +longest_subarray(Nums) -> + .","defmodule Solution do + @spec longest_subarray(nums :: [integer]) :: integer + def longest_subarray(nums) do + + end +end","class Solution { + int longestSubarray(List nums) { + + } +}", +281,minimum-money-required-before-transactions,Minimum Money Required Before Transactions,2412.0,2499.0,"

You are given a 0-indexed 2D integer array transactions, where transactions[i] = [costi, cashbacki].

+ +

The array describes transactions, where each transaction must be completed exactly once in some order. At any given moment, you have a certain amount of money. In order to complete transaction i, money >= costi must hold true. After performing a transaction, money becomes money - costi + cashbacki.

+ +

Return the minimum amount of money required before any transaction so that all of the transactions can be completed regardless of the order of the transactions.

+ +

 

+

Example 1:

+ +
+Input: transactions = [[2,1],[5,0],[4,2]]
+Output: 10
+Explanation:
+Starting with money = 10, the transactions can be performed in any order.
+It can be shown that starting with money < 10 will fail to complete all transactions in some order.
+
+ +

Example 2:

+ +
+Input: transactions = [[3,0],[0,3]]
+Output: 3
+Explanation:
+- If transactions are in the order [[3,0],[0,3]], the minimum money required to complete the transactions is 3.
+- If transactions are in the order [[0,3],[3,0]], the minimum money required to complete the transactions is 0.
+Thus, starting with money = 3, the transactions can be performed in any order.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= transactions.length <= 105
    • +
  • transactions[i].length == 2
    • +
  • 0 <= costi, cashbacki <= 109
    • +
+",3.0,False,"class Solution { +public: + long long minimumMoney(vector>& transactions) { + + } +};","class Solution { + public long minimumMoney(int[][] transactions) { + + } +}","class Solution(object): + def minimumMoney(self, transactions): + """""" + :type transactions: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumMoney(self, transactions: List[List[int]]) -> int: + ","long long minimumMoney(int** transactions, int transactionsSize, int* transactionsColSize){ + +}","public class Solution { + public long MinimumMoney(int[][] transactions) { + + } +}","/** + * @param {number[][]} transactions + * @return {number} + */ +var minimumMoney = function(transactions) { + +};","# @param {Integer[][]} transactions +# @return {Integer} +def minimum_money(transactions) + +end","class Solution { + func minimumMoney(_ transactions: [[Int]]) -> Int { + + } +}","func minimumMoney(transactions [][]int) int64 { + +}","object Solution { + def minimumMoney(transactions: Array[Array[Int]]): Long = { + + } +}","class Solution { + fun minimumMoney(transactions: Array): Long { + + } +}","impl Solution { + pub fn minimum_money(transactions: Vec>) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[][] $transactions + * @return Integer + */ + function minimumMoney($transactions) { + + } +}","function minimumMoney(transactions: number[][]): number { + +};","(define/contract (minimum-money transactions) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_money(Transactions :: [[integer()]]) -> integer(). +minimum_money(Transactions) -> + .","defmodule Solution do + @spec minimum_money(transactions :: [[integer]]) :: integer + def minimum_money(transactions) do + + end +end","class Solution { + int minimumMoney(List> transactions) { + + } +}", +284,count-days-spent-together,Count Days Spent Together,2409.0,2496.0,"

Alice and Bob are traveling to Rome for separate business meetings.

+ +

You are given 4 strings arriveAlice, leaveAlice, arriveBob, and leaveBob. Alice will be in the city from the dates arriveAlice to leaveAlice (inclusive), while Bob will be in the city from the dates arriveBob to leaveBob (inclusive). Each will be a 5-character string in the format "MM-DD", corresponding to the month and day of the date.

+ +

Return the total number of days that Alice and Bob are in Rome together.

+ +

You can assume that all dates occur in the same calendar year, which is not a leap year. Note that the number of days per month can be represented as: [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31].

+ +

 

+

Example 1:

+ +
+Input: arriveAlice = "08-15", leaveAlice = "08-18", arriveBob = "08-16", leaveBob = "08-19"
+Output: 3
+Explanation: Alice will be in Rome from August 15 to August 18. Bob will be in Rome from August 16 to August 19. They are both in Rome together on August 16th, 17th, and 18th, so the answer is 3.
+
+ +

Example 2:

+ +
+Input: arriveAlice = "10-01", leaveAlice = "10-31", arriveBob = "11-01", leaveBob = "12-31"
+Output: 0
+Explanation: There is no day when Alice and Bob are in Rome together, so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • All dates are provided in the format "MM-DD".
    • +
  • Alice and Bob's arrival dates are earlier than or equal to their leaving dates.
    • +
  • The given dates are valid dates of a non-leap year.
    • +
+",1.0,False,"class Solution { +public: + int countDaysTogether(string arriveAlice, string leaveAlice, string arriveBob, string leaveBob) { + + } +};","class Solution { + public int countDaysTogether(String arriveAlice, String leaveAlice, String arriveBob, String leaveBob) { + + } +}","class Solution(object): + def countDaysTogether(self, arriveAlice, leaveAlice, arriveBob, leaveBob): + """""" + :type arriveAlice: str + :type leaveAlice: str + :type arriveBob: str + :type leaveBob: str + :rtype: int + """""" + ","class Solution: + def countDaysTogether(self, arriveAlice: str, leaveAlice: str, arriveBob: str, leaveBob: str) -> int: + ","int countDaysTogether(char * arriveAlice, char * leaveAlice, char * arriveBob, char * leaveBob){ + +}","public class Solution { + public int CountDaysTogether(string arriveAlice, string leaveAlice, string arriveBob, string leaveBob) { + + } +}","/** + * @param {string} arriveAlice + * @param {string} leaveAlice + * @param {string} arriveBob + * @param {string} leaveBob + * @return {number} + */ +var countDaysTogether = function(arriveAlice, leaveAlice, arriveBob, leaveBob) { + +};","# @param {String} arrive_alice +# @param {String} leave_alice +# @param {String} arrive_bob +# @param {String} leave_bob +# @return {Integer} +def count_days_together(arrive_alice, leave_alice, arrive_bob, leave_bob) + +end","class Solution { + func countDaysTogether(_ arriveAlice: String, _ leaveAlice: String, _ arriveBob: String, _ leaveBob: String) -> Int { + + } +}","func countDaysTogether(arriveAlice string, leaveAlice string, arriveBob string, leaveBob string) int { + +}","object Solution { + def countDaysTogether(arriveAlice: String, leaveAlice: String, arriveBob: String, leaveBob: String): Int = { + + } +}","class Solution { + fun countDaysTogether(arriveAlice: String, leaveAlice: String, arriveBob: String, leaveBob: String): Int { + + } +}","impl Solution { + pub fn count_days_together(arrive_alice: String, leave_alice: String, arrive_bob: String, leave_bob: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $arriveAlice + * @param String $leaveAlice + * @param String $arriveBob + * @param String $leaveBob + * @return Integer + */ + function countDaysTogether($arriveAlice, $leaveAlice, $arriveBob, $leaveBob) { + + } +}","function countDaysTogether(arriveAlice: string, leaveAlice: string, arriveBob: string, leaveBob: string): number { + +};","(define/contract (count-days-together arriveAlice leaveAlice arriveBob leaveBob) + (-> string? string? string? string? exact-integer?) + + )","-spec count_days_together(ArriveAlice :: unicode:unicode_binary(), LeaveAlice :: unicode:unicode_binary(), ArriveBob :: unicode:unicode_binary(), LeaveBob :: unicode:unicode_binary()) -> integer(). +count_days_together(ArriveAlice, LeaveAlice, ArriveBob, LeaveBob) -> + .","defmodule Solution do + @spec count_days_together(arrive_alice :: String.t, leave_alice :: String.t, arrive_bob :: String.t, leave_bob :: String.t) :: integer + def count_days_together(arrive_alice, leave_alice, arrive_bob, leave_bob) do + + end +end","class Solution { + int countDaysTogether(String arriveAlice, String leaveAlice, String arriveBob, String leaveBob) { + + } +}", +285,sum-of-prefix-scores-of-strings,Sum of Prefix Scores of Strings,2416.0,2494.0,"

You are given an array words of size n consisting of non-empty strings.

+ +

We define the score of a string word as the number of strings words[i] such that word is a prefix of words[i].

+ +
    +
  • For example, if words = ["a", "ab", "abc", "cab"], then the score of "ab" is 2, since "ab" is a prefix of both "ab" and "abc".
    • +
+ +

Return an array answer of size n where answer[i] is the sum of scores of every non-empty prefix of words[i].

+ +

Note that a string is considered as a prefix of itself.

+ +

 

+

Example 1:

+ +
+Input: words = ["abc","ab","bc","b"]
+Output: [5,4,3,2]
+Explanation: The answer for each string is the following:
+- "abc" has 3 prefixes: "a", "ab", and "abc".
+- There are 2 strings with the prefix "a", 2 strings with the prefix "ab", and 1 string with the prefix "abc".
+The total is answer[0] = 2 + 2 + 1 = 5.
+- "ab" has 2 prefixes: "a" and "ab".
+- There are 2 strings with the prefix "a", and 2 strings with the prefix "ab".
+The total is answer[1] = 2 + 2 = 4.
+- "bc" has 2 prefixes: "b" and "bc".
+- There are 2 strings with the prefix "b", and 1 string with the prefix "bc".
+The total is answer[2] = 2 + 1 = 3.
+- "b" has 1 prefix: "b".
+- There are 2 strings with the prefix "b".
+The total is answer[3] = 2.
+
+ +

Example 2:

+ +
+Input: words = ["abcd"]
+Output: [4]
+Explanation:
+"abcd" has 4 prefixes: "a", "ab", "abc", and "abcd".
+Each prefix has a score of one, so the total is answer[0] = 1 + 1 + 1 + 1 = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 1000
    • +
  • 1 <= words[i].length <= 1000
    • +
  • words[i] consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + vector sumPrefixScores(vector& words) { + + } +};","class Solution { + public int[] sumPrefixScores(String[] words) { + + } +}","class Solution(object): + def sumPrefixScores(self, words): + """""" + :type words: List[str] + :rtype: List[int] + """""" + ","class Solution: + def sumPrefixScores(self, words: List[str]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sumPrefixScores(char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public int[] SumPrefixScores(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number[]} + */ +var sumPrefixScores = function(words) { + +};","# @param {String[]} words +# @return {Integer[]} +def sum_prefix_scores(words) + +end","class Solution { + func sumPrefixScores(_ words: [String]) -> [Int] { + + } +}","func sumPrefixScores(words []string) []int { + +}","object Solution { + def sumPrefixScores(words: Array[String]): Array[Int] = { + + } +}","class Solution { + fun sumPrefixScores(words: Array): IntArray { + + } +}","impl Solution { + pub fn sum_prefix_scores(words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer[] + */ + function sumPrefixScores($words) { + + } +}","function sumPrefixScores(words: string[]): number[] { + +};","(define/contract (sum-prefix-scores words) + (-> (listof string?) (listof exact-integer?)) + + )","-spec sum_prefix_scores(Words :: [unicode:unicode_binary()]) -> [integer()]. +sum_prefix_scores(Words) -> + .","defmodule Solution do + @spec sum_prefix_scores(words :: [String.t]) :: [integer] + def sum_prefix_scores(words) do + + end +end","class Solution { + List sumPrefixScores(List words) { + + } +}", +286,reverse-odd-levels-of-binary-tree,Reverse Odd Levels of Binary Tree,2415.0,2493.0,"

Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.

+ +
    +
  • For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2].
    • +
+ +

Return the root of the reversed tree.

+ +

A binary tree is perfect if all parent nodes have two children and all leaves are on the same level.

+ +

The level of a node is the number of edges along the path between it and the root node.

+ +

 

+

Example 1:

+ +
+Input: root = [2,3,5,8,13,21,34]
+Output: [2,5,3,8,13,21,34]
+Explanation: 
+The tree has only one odd level.
+The nodes at level 1 are 3, 5 respectively, which are reversed and become 5, 3.
+
+ +

Example 2:

+ +
+Input: root = [7,13,11]
+Output: [7,11,13]
+Explanation: 
+The nodes at level 1 are 13, 11, which are reversed and become 11, 13.
+
+ +

Example 3:

+ +
+Input: root = [0,1,2,0,0,0,0,1,1,1,1,2,2,2,2]
+Output: [0,2,1,0,0,0,0,2,2,2,2,1,1,1,1]
+Explanation: 
+The odd levels have non-zero values.
+The nodes at level 1 were 1, 2, and are 2, 1 after the reversal.
+The nodes at level 3 were 1, 1, 1, 1, 2, 2, 2, 2, and are 2, 2, 2, 2, 1, 1, 1, 1 after the reversal.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 214].
    • +
  • 0 <= Node.val <= 105
    • +
  • root is a perfect binary tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* reverseOddLevels(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode reverseOddLevels(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def reverseOddLevels(self, root): + """""" + :type root: Optional[TreeNode] + :rtype: Optional[TreeNode] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def reverseOddLevels(self, root: Optional[TreeNode]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* reverseOddLevels(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode ReverseOddLevels(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {TreeNode} + */ +var reverseOddLevels = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {TreeNode} +def reverse_odd_levels(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func reverseOddLevels(_ root: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func reverseOddLevels(root *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def reverseOddLevels(root: TreeNode): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun reverseOddLevels(root: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn reverse_odd_levels(root: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return TreeNode + */ + function reverseOddLevels($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function reverseOddLevels(root: TreeNode | null): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (reverse-odd-levels root) + (-> (or/c tree-node? #f) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec reverse_odd_levels(Root :: #tree_node{} | null) -> #tree_node{} | null. +reverse_odd_levels(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec reverse_odd_levels(root :: TreeNode.t | nil) :: TreeNode.t | nil + def reverse_odd_levels(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? reverseOddLevels(TreeNode? root) { + + } +}", +287,length-of-the-longest-alphabetical-continuous-substring,Length of the Longest Alphabetical Continuous Substring,2414.0,2492.0,"

An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string "abcdefghijklmnopqrstuvwxyz".

+ +
    +
  • For example, "abc" is an alphabetical continuous string, while "acb" and "za" are not.
    • +
+ +

Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.

+ +

 

+

Example 1:

+ +
+Input: s = "abacaba"
+Output: 2
+Explanation: There are 4 distinct continuous substrings: "a", "b", "c" and "ab".
+"ab" is the longest continuous substring.
+
+ +

Example 2:

+ +
+Input: s = "abcde"
+Output: 5
+Explanation: "abcde" is the longest continuous substring.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of only English lowercase letters.
    • +
+",2.0,False,"class Solution { +public: + int longestContinuousSubstring(string s) { + + } +};","class Solution { + public int longestContinuousSubstring(String s) { + + } +}","class Solution(object): + def longestContinuousSubstring(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def longestContinuousSubstring(self, s: str) -> int: + ","int longestContinuousSubstring(char * s){ + +}","public class Solution { + public int LongestContinuousSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var longestContinuousSubstring = function(s) { + +};","# @param {String} s +# @return {Integer} +def longest_continuous_substring(s) + +end","class Solution { + func longestContinuousSubstring(_ s: String) -> Int { + + } +}","func longestContinuousSubstring(s string) int { + +}","object Solution { + def longestContinuousSubstring(s: String): Int = { + + } +}","class Solution { + fun longestContinuousSubstring(s: String): Int { + + } +}","impl Solution { + pub fn longest_continuous_substring(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function longestContinuousSubstring($s) { + + } +}","function longestContinuousSubstring(s: string): number { + +};","(define/contract (longest-continuous-substring s) + (-> string? exact-integer?) + + )","-spec longest_continuous_substring(S :: unicode:unicode_binary()) -> integer(). +longest_continuous_substring(S) -> + .","defmodule Solution do + @spec longest_continuous_substring(s :: String.t) :: integer + def longest_continuous_substring(s) do + + end +end","class Solution { + int longestContinuousSubstring(String s) { + + } +}", +288,smallest-even-multiple,Smallest Even Multiple,2413.0,2491.0,"Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n. +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 10
+Explanation: The smallest multiple of both 5 and 2 is 10.
+
+ +

Example 2:

+ +
+Input: n = 6
+Output: 6
+Explanation: The smallest multiple of both 6 and 2 is 6. Note that a number is a multiple of itself.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 150
    • +
+",1.0,False,"class Solution { +public: + int smallestEvenMultiple(int n) { + + } +};","class Solution { + public int smallestEvenMultiple(int n) { + + } +}","class Solution(object): + def smallestEvenMultiple(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def smallestEvenMultiple(self, n: int) -> int: + ","int smallestEvenMultiple(int n){ + +}","public class Solution { + public int SmallestEvenMultiple(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var smallestEvenMultiple = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def smallest_even_multiple(n) + +end","class Solution { + func smallestEvenMultiple(_ n: Int) -> Int { + + } +}","func smallestEvenMultiple(n int) int { + +}","object Solution { + def smallestEvenMultiple(n: Int): Int = { + + } +}","class Solution { + fun smallestEvenMultiple(n: Int): Int { + + } +}","impl Solution { + pub fn smallest_even_multiple(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function smallestEvenMultiple($n) { + + } +}","function smallestEvenMultiple(n: number): number { + +};","(define/contract (smallest-even-multiple n) + (-> exact-integer? exact-integer?) + + )","-spec smallest_even_multiple(N :: integer()) -> integer(). +smallest_even_multiple(N) -> + .","defmodule Solution do + @spec smallest_even_multiple(n :: integer) :: integer + def smallest_even_multiple(n) do + + end +end","class Solution { + int smallestEvenMultiple(int n) { + + } +}", +292,task-scheduler-ii,Task Scheduler II,2365.0,2483.0,"

You are given a 0-indexed array of positive integers tasks, representing tasks that need to be completed in order, where tasks[i] represents the type of the ith task.

+ +

You are also given a positive integer space, which represents the minimum number of days that must pass after the completion of a task before another task of the same type can be performed.

+ +

Each day, until all tasks have been completed, you must either:

+ +
    +
  • Complete the next task from tasks, or
    • +
  • Take a break.
    • +
+ +

Return the minimum number of days needed to complete all tasks.

+ +

 

+

Example 1:

+ +
+Input: tasks = [1,2,1,2,3,1], space = 3
+Output: 9
+Explanation:
+One way to complete all tasks in 9 days is as follows:
+Day 1: Complete the 0th task.
+Day 2: Complete the 1st task.
+Day 3: Take a break.
+Day 4: Take a break.
+Day 5: Complete the 2nd task.
+Day 6: Complete the 3rd task.
+Day 7: Take a break.
+Day 8: Complete the 4th task.
+Day 9: Complete the 5th task.
+It can be shown that the tasks cannot be completed in less than 9 days.
+
+ +

Example 2:

+ +
+Input: tasks = [5,8,8,5], space = 2
+Output: 6
+Explanation:
+One way to complete all tasks in 6 days is as follows:
+Day 1: Complete the 0th task.
+Day 2: Complete the 1st task.
+Day 3: Take a break.
+Day 4: Take a break.
+Day 5: Complete the 2nd task.
+Day 6: Complete the 3rd task.
+It can be shown that the tasks cannot be completed in less than 6 days.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tasks.length <= 105
    • +
  • 1 <= tasks[i] <= 109
    • +
  • 1 <= space <= tasks.length
    • +
+",2.0,False,"class Solution { +public: + long long taskSchedulerII(vector& tasks, int space) { + + } +};","class Solution { + public long taskSchedulerII(int[] tasks, int space) { + + } +}","class Solution(object): + def taskSchedulerII(self, tasks, space): + """""" + :type tasks: List[int] + :type space: int + :rtype: int + """""" + ","class Solution: + def taskSchedulerII(self, tasks: List[int], space: int) -> int: + ","long long taskSchedulerII(int* tasks, int tasksSize, int space){ + +}","public class Solution { + public long TaskSchedulerII(int[] tasks, int space) { + + } +}","/** + * @param {number[]} tasks + * @param {number} space + * @return {number} + */ +var taskSchedulerII = function(tasks, space) { + +};","# @param {Integer[]} tasks +# @param {Integer} space +# @return {Integer} +def task_scheduler_ii(tasks, space) + +end","class Solution { + func taskSchedulerII(_ tasks: [Int], _ space: Int) -> Int { + + } +}","func taskSchedulerII(tasks []int, space int) int64 { + +}","object Solution { + def taskSchedulerII(tasks: Array[Int], space: Int): Long = { + + } +}","class Solution { + fun taskSchedulerII(tasks: IntArray, space: Int): Long { + + } +}","impl Solution { + pub fn task_scheduler_ii(tasks: Vec, space: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $tasks + * @param Integer $space + * @return Integer + */ + function taskSchedulerII($tasks, $space) { + + } +}","function taskSchedulerII(tasks: number[], space: number): number { + +};","(define/contract (task-scheduler-ii tasks space) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec task_scheduler_ii(Tasks :: [integer()], Space :: integer()) -> integer(). +task_scheduler_ii(Tasks, Space) -> + .","defmodule Solution do + @spec task_scheduler_ii(tasks :: [integer], space :: integer) :: integer + def task_scheduler_ii(tasks, space) do + + end +end","class Solution { + int taskSchedulerII(List tasks, int space) { + + } +}", +293,maximum-rows-covered-by-columns,Maximum Rows Covered by Columns,2397.0,2482.0,"

You are given a 0-indexed m x n binary matrix matrix and an integer numSelect, which denotes the number of distinct columns you must select from matrix.

+ +

Let us consider s = {c1, c2, ...., cnumSelect} as the set of columns selected by you. A row row is covered by s if:

+ +
    +
  • For each cell matrix[row][col] (0 <= col <= n - 1) where matrix[row][col] == 1, col is present in s or,
    • +
  • No cell in row has a value of 1.
    • +
+ +

You need to choose numSelect columns such that the number of rows that are covered is maximized.

+ +

Return the maximum number of rows that can be covered by a set of numSelect columns.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[0,0,0],[1,0,1],[0,1,1],[0,0,1]], numSelect = 2
+Output: 3
+Explanation: One possible way to cover 3 rows is shown in the diagram above.
+We choose s = {0, 2}.
+- Row 0 is covered because it has no occurrences of 1.
+- Row 1 is covered because the columns with value 1, i.e. 0 and 2 are present in s.
+- Row 2 is not covered because matrix[2][1] == 1 but 1 is not present in s.
+- Row 3 is covered because matrix[2][2] == 1 and 2 is present in s.
+Thus, we can cover three rows.
+Note that s = {1, 2} will also cover 3 rows, but it can be shown that no more than three rows can be covered.
+
+ +

Example 2:

+ +
+Input: matrix = [[1],[0]], numSelect = 1
+Output: 2
+Explanation: Selecting the only column will result in both rows being covered since the entire matrix is selected.
+Therefore, we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 12
    • +
  • matrix[i][j] is either 0 or 1.
    • +
  • 1 <= numSelect <= n
    • +
+",2.0,False,"class Solution { +public: + int maximumRows(vector>& matrix, int numSelect) { + + } +};","class Solution { + public int maximumRows(int[][] matrix, int numSelect) { + + } +}","class Solution(object): + def maximumRows(self, matrix, numSelect): + """""" + :type matrix: List[List[int]] + :type numSelect: int + :rtype: int + """""" + ","class Solution: + def maximumRows(self, matrix: List[List[int]], numSelect: int) -> int: + ","int maximumRows(int** matrix, int matrixSize, int* matrixColSize, int numSelect){ + +}","public class Solution { + public int MaximumRows(int[][] matrix, int numSelect) { + + } +}","/** + * @param {number[][]} matrix + * @param {number} numSelect + * @return {number} + */ +var maximumRows = function(matrix, numSelect) { + +};","# @param {Integer[][]} matrix +# @param {Integer} num_select +# @return {Integer} +def maximum_rows(matrix, num_select) + +end","class Solution { + func maximumRows(_ matrix: [[Int]], _ numSelect: Int) -> Int { + + } +}","func maximumRows(matrix [][]int, numSelect int) int { + +}","object Solution { + def maximumRows(matrix: Array[Array[Int]], numSelect: Int): Int = { + + } +}","class Solution { + fun maximumRows(matrix: Array, numSelect: Int): Int { + + } +}","impl Solution { + pub fn maximum_rows(matrix: Vec>, num_select: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @param Integer $numSelect + * @return Integer + */ + function maximumRows($matrix, $numSelect) { + + } +}","function maximumRows(matrix: number[][], numSelect: number): number { + +};","(define/contract (maximum-rows matrix numSelect) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec maximum_rows(Matrix :: [[integer()]], NumSelect :: integer()) -> integer(). +maximum_rows(Matrix, NumSelect) -> + .","defmodule Solution do + @spec maximum_rows(matrix :: [[integer]], num_select :: integer) :: integer + def maximum_rows(matrix, num_select) do + + end +end","class Solution { + int maximumRows(List> matrix, int numSelect) { + + } +}", +294,strictly-palindromic-number,Strictly Palindromic Number,2396.0,2481.0,"

An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), the string representation of the integer n in base b is palindromic.

+ +

Given an integer n, return true if n is strictly palindromic and false otherwise.

+ +

A string is palindromic if it reads the same forward and backward.

+ +

 

+

Example 1:

+ +
+Input: n = 9
+Output: false
+Explanation: In base 2: 9 = 1001 (base 2), which is palindromic.
+In base 3: 9 = 100 (base 3), which is not palindromic.
+Therefore, 9 is not strictly palindromic so we return false.
+Note that in bases 4, 5, 6, and 7, n = 9 is also not palindromic.
+
+ +

Example 2:

+ +
+Input: n = 4
+Output: false
+Explanation: We only consider base 2: 4 = 100 (base 2), which is not palindromic.
+Therefore, we return false.
+
+
+ +

 

+

Constraints:

+ +
    +
  • 4 <= n <= 105
    • +
+",2.0,False,"class Solution { +public: + bool isStrictlyPalindromic(int n) { + + } +};","class Solution { + public boolean isStrictlyPalindromic(int n) { + + } +}","class Solution(object): + def isStrictlyPalindromic(self, n): + """""" + :type n: int + :rtype: bool + """""" + ","class Solution: + def isStrictlyPalindromic(self, n: int) -> bool: + ","bool isStrictlyPalindromic(int n){ + +}","public class Solution { + public bool IsStrictlyPalindromic(int n) { + + } +}","/** + * @param {number} n + * @return {boolean} + */ +var isStrictlyPalindromic = function(n) { + +};","# @param {Integer} n +# @return {Boolean} +def is_strictly_palindromic(n) + +end","class Solution { + func isStrictlyPalindromic(_ n: Int) -> Bool { + + } +}","func isStrictlyPalindromic(n int) bool { + +}","object Solution { + def isStrictlyPalindromic(n: Int): Boolean = { + + } +}","class Solution { + fun isStrictlyPalindromic(n: Int): Boolean { + + } +}","impl Solution { + pub fn is_strictly_palindromic(n: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Boolean + */ + function isStrictlyPalindromic($n) { + + } +}","function isStrictlyPalindromic(n: number): boolean { + +};","(define/contract (is-strictly-palindromic n) + (-> exact-integer? boolean?) + + )","-spec is_strictly_palindromic(N :: integer()) -> boolean(). +is_strictly_palindromic(N) -> + .","defmodule Solution do + @spec is_strictly_palindromic(n :: integer) :: boolean + def is_strictly_palindromic(n) do + + end +end","class Solution { + bool isStrictlyPalindromic(int n) { + + } +}", +296,meeting-rooms-iii,Meeting Rooms III,2402.0,2479.0,"

You are given an integer n. There are n rooms numbered from 0 to n - 1.

+ +

You are given a 2D integer array meetings where meetings[i] = [starti, endi] means that a meeting will be held during the half-closed time interval [starti, endi). All the values of starti are unique.

+ +

Meetings are allocated to rooms in the following manner:

+ +
    +
  1. Each meeting will take place in the unused room with the lowest number.
    2. +
  2. If there are no available rooms, the meeting will be delayed until a room becomes free. The delayed meeting should have the same duration as the original meeting.
    3. +
  3. When a room becomes unused, meetings that have an earlier original start time should be given the room.
    4. +
+ +

Return the number of the room that held the most meetings. If there are multiple rooms, return the room with the lowest number.

+ +

A half-closed interval [a, b) is the interval between a and b including a and not including b.

+ +

 

+

Example 1:

+ +
+Input: n = 2, meetings = [[0,10],[1,5],[2,7],[3,4]]
+Output: 0
+Explanation:
+- At time 0, both rooms are not being used. The first meeting starts in room 0.
+- At time 1, only room 1 is not being used. The second meeting starts in room 1.
+- At time 2, both rooms are being used. The third meeting is delayed.
+- At time 3, both rooms are being used. The fourth meeting is delayed.
+- At time 5, the meeting in room 1 finishes. The third meeting starts in room 1 for the time period [5,10).
+- At time 10, the meetings in both rooms finish. The fourth meeting starts in room 0 for the time period [10,11).
+Both rooms 0 and 1 held 2 meetings, so we return 0. 
+
+ +

Example 2:

+ +
+Input: n = 3, meetings = [[1,20],[2,10],[3,5],[4,9],[6,8]]
+Output: 1
+Explanation:
+- At time 1, all three rooms are not being used. The first meeting starts in room 0.
+- At time 2, rooms 1 and 2 are not being used. The second meeting starts in room 1.
+- At time 3, only room 2 is not being used. The third meeting starts in room 2.
+- At time 4, all three rooms are being used. The fourth meeting is delayed.
+- At time 5, the meeting in room 2 finishes. The fourth meeting starts in room 2 for the time period [5,10).
+- At time 6, all three rooms are being used. The fifth meeting is delayed.
+- At time 10, the meetings in rooms 1 and 2 finish. The fifth meeting starts in room 1 for the time period [10,12).
+Room 0 held 1 meeting while rooms 1 and 2 each held 2 meetings, so we return 1. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 1 <= meetings.length <= 105
    • +
  • meetings[i].length == 2
    • +
  • 0 <= starti < endi <= 5 * 105
    • +
  • All the values of starti are unique.
    • +
+",3.0,False,"class Solution { +public: + int mostBooked(int n, vector>& meetings) { + + } +};","class Solution { + public int mostBooked(int n, int[][] meetings) { + + } +}","class Solution(object): + def mostBooked(self, n, meetings): + """""" + :type n: int + :type meetings: List[List[int]] + :rtype: int + """""" + ","class Solution: + def mostBooked(self, n: int, meetings: List[List[int]]) -> int: + ","int mostBooked(int n, int** meetings, int meetingsSize, int* meetingsColSize){ + +}","public class Solution { + public int MostBooked(int n, int[][] meetings) { + + } +}","/** + * @param {number} n + * @param {number[][]} meetings + * @return {number} + */ +var mostBooked = function(n, meetings) { + +};","# @param {Integer} n +# @param {Integer[][]} meetings +# @return {Integer} +def most_booked(n, meetings) + +end","class Solution { + func mostBooked(_ n: Int, _ meetings: [[Int]]) -> Int { + + } +}","func mostBooked(n int, meetings [][]int) int { + +}","object Solution { + def mostBooked(n: Int, meetings: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun mostBooked(n: Int, meetings: Array): Int { + + } +}","impl Solution { + pub fn most_booked(n: i32, meetings: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $meetings + * @return Integer + */ + function mostBooked($n, $meetings) { + + } +}","function mostBooked(n: number, meetings: number[][]): number { + +};","(define/contract (most-booked n meetings) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec most_booked(N :: integer(), Meetings :: [[integer()]]) -> integer(). +most_booked(N, Meetings) -> + .","defmodule Solution do + @spec most_booked(n :: integer, meetings :: [[integer]]) :: integer + def most_booked(n, meetings) do + + end +end","class Solution { + int mostBooked(int n, List> meetings) { + + } +}", +297,longest-nice-subarray,Longest Nice Subarray,2401.0,2478.0,"

You 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.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,8,48,10]
+Output: 3
+Explanation: The longest nice subarray is [3,8,48]. This subarray satisfies the conditions:
+- 3 AND 8 = 0.
+- 3 AND 48 = 0.
+- 8 AND 48 = 0.
+It can be proven that no longer nice subarray can be obtained, so we return 3.
+ +

Example 2:

+ +
+Input: nums = [3,1,5,11,13]
+Output: 1
+Explanation: The length of the longest nice subarray is 1. Any subarray of length 1 can be chosen.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int longestNiceSubarray(vector& nums) { + + } +};","class Solution { + public int longestNiceSubarray(int[] nums) { + + } +}","class Solution(object): + def longestNiceSubarray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def longestNiceSubarray(self, nums: List[int]) -> int: + ","int longestNiceSubarray(int* nums, int numsSize){ + +}","public class Solution { + public int LongestNiceSubarray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var longestNiceSubarray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def longest_nice_subarray(nums) + +end","class Solution { + func longestNiceSubarray(_ nums: [Int]) -> Int { + + } +}","func longestNiceSubarray(nums []int) int { + +}","object Solution { + def longestNiceSubarray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun longestNiceSubarray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn longest_nice_subarray(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function longestNiceSubarray($nums) { + + } +}","function longestNiceSubarray(nums: number[]): number { + +};","(define/contract (longest-nice-subarray nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_nice_subarray(Nums :: [integer()]) -> integer(). +longest_nice_subarray(Nums) -> + .","defmodule Solution do + @spec longest_nice_subarray(nums :: [integer]) :: integer + def longest_nice_subarray(nums) do + + end +end","class Solution { + int longestNiceSubarray(List nums) { + + } +}", +299,check-distances-between-same-letters,Check Distances Between Same Letters,2399.0,2476.0,"

You are given a 0-indexed string s consisting of only lowercase English letters, where each letter in s appears exactly twice. You are also given a 0-indexed integer array distance of length 26.

+ +

Each letter in the alphabet is numbered from 0 to 25 (i.e. 'a' -> 0, 'b' -> 1, 'c' -> 2, ... , 'z' -> 25).

+ +

In a well-spaced string, the number of letters between the two occurrences of the ith letter is distance[i]. If the ith letter does not appear in s, then distance[i] can be ignored.

+ +

Return true if s is a well-spaced string, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: s = "abaccb", distance = [1,3,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+Output: true
+Explanation:
+- 'a' appears at indices 0 and 2 so it satisfies distance[0] = 1.
+- 'b' appears at indices 1 and 5 so it satisfies distance[1] = 3.
+- 'c' appears at indices 3 and 4 so it satisfies distance[2] = 0.
+Note that distance[3] = 5, but since 'd' does not appear in s, it can be ignored.
+Return true because s is a well-spaced string.
+
+ +

Example 2:

+ +
+Input: s = "aa", distance = [1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+Output: false
+Explanation:
+- 'a' appears at indices 0 and 1 so there are zero letters between them.
+Because distance[0] = 1, s is not a well-spaced string.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 52
    • +
  • s consists only of lowercase English letters.
    • +
  • Each letter appears in s exactly twice.
    • +
  • distance.length == 26
    • +
  • 0 <= distance[i] <= 50
    • +
+",1.0,False,"class Solution { +public: + bool checkDistances(string s, vector& distance) { + + } +};","class Solution { + public boolean checkDistances(String s, int[] distance) { + + } +}","class Solution(object): + def checkDistances(self, s, distance): + """""" + :type s: str + :type distance: List[int] + :rtype: bool + """""" + ","class Solution: + def checkDistances(self, s: str, distance: List[int]) -> bool: + ","bool checkDistances(char * s, int* distance, int distanceSize){ + +}","public class Solution { + public bool CheckDistances(string s, int[] distance) { + + } +}","/** + * @param {string} s + * @param {number[]} distance + * @return {boolean} + */ +var checkDistances = function(s, distance) { + +};","# @param {String} s +# @param {Integer[]} distance +# @return {Boolean} +def check_distances(s, distance) + +end","class Solution { + func checkDistances(_ s: String, _ distance: [Int]) -> Bool { + + } +}","func checkDistances(s string, distance []int) bool { + +}","object Solution { + def checkDistances(s: String, distance: Array[Int]): Boolean = { + + } +}","class Solution { + fun checkDistances(s: String, distance: IntArray): Boolean { + + } +}","impl Solution { + pub fn check_distances(s: String, distance: Vec) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[] $distance + * @return Boolean + */ + function checkDistances($s, $distance) { + + } +}","function checkDistances(s: string, distance: number[]): boolean { + +};","(define/contract (check-distances s distance) + (-> string? (listof exact-integer?) boolean?) + + )","-spec check_distances(S :: unicode:unicode_binary(), Distance :: [integer()]) -> boolean(). +check_distances(S, Distance) -> + .","defmodule Solution do + @spec check_distances(s :: String.t, distance :: [integer]) :: boolean + def check_distances(s, distance) do + + end +end","class Solution { + bool checkDistances(String s, List distance) { + + } +}", +301,max-sum-of-a-pair-with-equal-sum-of-digits,Max Sum of a Pair With Equal Sum of Digits,2342.0,2473.0,"

You are given a 0-indexed array nums consisting of positive integers. You can choose two indices i and j, such that i != j, and the sum of digits of the number nums[i] is equal to that of nums[j].

+ +

Return the maximum value of nums[i] + nums[j] that you can obtain over all possible indices i and j that satisfy the conditions.

+ +

 

+

Example 1:

+ +
+Input: nums = [18,43,36,13,7]
+Output: 54
+Explanation: The pairs (i, j) that satisfy the conditions are:
+- (0, 2), both numbers have a sum of digits equal to 9, and their sum is 18 + 36 = 54.
+- (1, 4), both numbers have a sum of digits equal to 7, and their sum is 43 + 7 = 50.
+So the maximum sum that we can obtain is 54.
+
+ +

Example 2:

+ +
+Input: nums = [10,12,19,14]
+Output: -1
+Explanation: There are no two numbers that satisfy the conditions, so we return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int maximumSum(vector& nums) { + + } +};","class Solution { + public int maximumSum(int[] nums) { + + } +}","class Solution(object): + def maximumSum(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maximumSum(self, nums: List[int]) -> int: + ","int maximumSum(int* nums, int numsSize){ + +}","public class Solution { + public int MaximumSum(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maximumSum = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def maximum_sum(nums) + +end","class Solution { + func maximumSum(_ nums: [Int]) -> Int { + + } +}","func maximumSum(nums []int) int { + +}","object Solution { + def maximumSum(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maximumSum(nums: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_sum(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maximumSum($nums) { + + } +}","function maximumSum(nums: number[]): number { + +};","(define/contract (maximum-sum nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_sum(Nums :: [integer()]) -> integer(). +maximum_sum(Nums) -> + .","defmodule Solution do + @spec maximum_sum(nums :: [integer]) :: integer + def maximum_sum(nums) do + + end +end","class Solution { + int maximumSum(List nums) { + + } +}", +302,build-a-matrix-with-conditions,Build a Matrix With Conditions,2392.0,2472.0,"

You are given a positive integer k. You are also given:

+ +
    +
  • a 2D integer array rowConditions of size n where rowConditions[i] = [abovei, belowi], and
    • +
  • a 2D integer array colConditions of size m where colConditions[i] = [lefti, righti].
    • +
+ +

The two arrays contain integers from 1 to k.

+ +

You have to build a k x k matrix that contains each of the numbers from 1 to k exactly once. The remaining cells should have the value 0.

+ +

The matrix should also satisfy the following conditions:

+ +
    +
  • The number abovei should appear in a row that is strictly above the row at which the number belowi appears for all i from 0 to n - 1.
    • +
  • The number lefti should appear in a column that is strictly left of the column at which the number righti appears for all i from 0 to m - 1.
    • +
+ +

Return any matrix that satisfies the conditions. If no answer exists, return an empty matrix.

+ +

 

+

Example 1:

+ +
+Input: k = 3, rowConditions = [[1,2],[3,2]], colConditions = [[2,1],[3,2]]
+Output: [[3,0,0],[0,0,1],[0,2,0]]
+Explanation: The diagram above shows a valid example of a matrix that satisfies all the conditions.
+The row conditions are the following:
+- Number 1 is in row 1, and number 2 is in row 2, so 1 is above 2 in the matrix.
+- Number 3 is in row 0, and number 2 is in row 2, so 3 is above 2 in the matrix.
+The column conditions are the following:
+- Number 2 is in column 1, and number 1 is in column 2, so 2 is left of 1 in the matrix.
+- Number 3 is in column 0, and number 2 is in column 1, so 3 is left of 2 in the matrix.
+Note that there may be multiple correct answers.
+
+ +

Example 2:

+ +
+Input: k = 3, rowConditions = [[1,2],[2,3],[3,1],[2,3]], colConditions = [[2,1]]
+Output: []
+Explanation: From the first two conditions, 3 has to be below 1 but the third conditions needs 3 to be above 1 to be satisfied.
+No matrix can satisfy all the conditions, so we return the empty matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= k <= 400
    • +
  • 1 <= rowConditions.length, colConditions.length <= 104
    • +
  • rowConditions[i].length == colConditions[i].length == 2
    • +
  • 1 <= abovei, belowi, lefti, righti <= k
    • +
  • abovei != belowi
    • +
  • lefti != righti
    • +
+",3.0,False,"class Solution { +public: + vector> buildMatrix(int k, vector>& rowConditions, vector>& colConditions) { + + } +};","class Solution { + public int[][] buildMatrix(int k, int[][] rowConditions, int[][] colConditions) { + + } +}","class Solution(object): + def buildMatrix(self, k, rowConditions, colConditions): + """""" + :type k: int + :type rowConditions: List[List[int]] + :type colConditions: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def buildMatrix(self, k: int, rowConditions: List[List[int]], colConditions: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** buildMatrix(int k, int** rowConditions, int rowConditionsSize, int* rowConditionsColSize, int** colConditions, int colConditionsSize, int* colConditionsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] BuildMatrix(int k, int[][] rowConditions, int[][] colConditions) { + + } +}","/** + * @param {number} k + * @param {number[][]} rowConditions + * @param {number[][]} colConditions + * @return {number[][]} + */ +var buildMatrix = function(k, rowConditions, colConditions) { + +};","# @param {Integer} k +# @param {Integer[][]} row_conditions +# @param {Integer[][]} col_conditions +# @return {Integer[][]} +def build_matrix(k, row_conditions, col_conditions) + +end","class Solution { + func buildMatrix(_ k: Int, _ rowConditions: [[Int]], _ colConditions: [[Int]]) -> [[Int]] { + + } +}","func buildMatrix(k int, rowConditions [][]int, colConditions [][]int) [][]int { + +}","object Solution { + def buildMatrix(k: Int, rowConditions: Array[Array[Int]], colConditions: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun buildMatrix(k: Int, rowConditions: Array, colConditions: Array): Array { + + } +}","impl Solution { + pub fn build_matrix(k: i32, row_conditions: Vec>, col_conditions: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer[][] $rowConditions + * @param Integer[][] $colConditions + * @return Integer[][] + */ + function buildMatrix($k, $rowConditions, $colConditions) { + + } +}","function buildMatrix(k: number, rowConditions: number[][], colConditions: number[][]): number[][] { + +};","(define/contract (build-matrix k rowConditions colConditions) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec build_matrix(K :: integer(), RowConditions :: [[integer()]], ColConditions :: [[integer()]]) -> [[integer()]]. +build_matrix(K, RowConditions, ColConditions) -> + .","defmodule Solution do + @spec build_matrix(k :: integer, row_conditions :: [[integer]], col_conditions :: [[integer]]) :: [[integer]] + def build_matrix(k, row_conditions, col_conditions) do + + end +end","class Solution { + List> buildMatrix(int k, List> rowConditions, List> colConditions) { + + } +}", +304,removing-stars-from-a-string,Removing Stars From a String,2390.0,2470.0,"

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 well as remove the star itself.
    • +
+ +

Return the string after all stars have been removed.

+ +

Note:

+ +
    +
  • The input will be generated such that the operation is always possible.
    • +
  • It can be shown that the resulting string will always be unique.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "leet**cod*e"
+Output: "lecoe"
+Explanation: Performing the removals from left to right:
+- The closest character to the 1st star is 't' in "leet**cod*e". s becomes "lee*cod*e".
+- The closest character to the 2nd star is 'e' in "lee*cod*e". s becomes "lecod*e".
+- The closest character to the 3rd star is 'd' in "lecod*e". s becomes "lecoe".
+There are no more stars, so we return "lecoe".
+ +

Example 2:

+ +
+Input: s = "erase*****"
+Output: ""
+Explanation: The entire string is removed, so we return an empty string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters and stars *.
    • +
  • The operation above can be performed on s.
    • +
+",2.0,False,"class Solution { +public: + string removeStars(string s) { + + } +};","class Solution { + public String removeStars(String s) { + + } +}","class Solution(object): + def removeStars(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def removeStars(self, s: str) -> str: + ","char * removeStars(char * s){ + +}","public class Solution { + public string RemoveStars(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var removeStars = function(s) { + +};","# @param {String} s +# @return {String} +def remove_stars(s) + +end","class Solution { + func removeStars(_ s: String) -> String { + + } +}","func removeStars(s string) string { + +}","object Solution { + def removeStars(s: String): String = { + + } +}","class Solution { + fun removeStars(s: String): String { + + } +}","impl Solution { + pub fn remove_stars(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function removeStars($s) { + + } +}","function removeStars(s: string): string { + +};","(define/contract (remove-stars s) + (-> string? string?) + + )","-spec remove_stars(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +remove_stars(S) -> + .","defmodule Solution do + @spec remove_stars(s :: String.t) :: String.t + def remove_stars(s) do + + end +end","class Solution { + String removeStars(String s) { + + } +}", +306,maximum-segment-sum-after-removals,Maximum Segment Sum After Removals,2382.0,2466.0,"

You are given two 0-indexed integer arrays nums and removeQueries, both of length n. For the ith query, the element in nums at the index removeQueries[i] is removed, splitting nums into different segments.

+ +

A segment is a contiguous sequence of positive integers in nums. A segment sum is the sum of every element in a segment.

+ +

Return an integer array answer, of length n, where answer[i] is the maximum segment sum after applying the ith removal.

+ +

Note: The same index will not be removed more than once.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,5,6,1], removeQueries = [0,3,2,4,1]
+Output: [14,7,2,2,0]
+Explanation: Using 0 to indicate a removed element, the answer is as follows:
+Query 1: Remove the 0th element, nums becomes [0,2,5,6,1] and the maximum segment sum is 14 for segment [2,5,6,1].
+Query 2: Remove the 3rd element, nums becomes [0,2,5,0,1] and the maximum segment sum is 7 for segment [2,5].
+Query 3: Remove the 2nd element, nums becomes [0,2,0,0,1] and the maximum segment sum is 2 for segment [2]. 
+Query 4: Remove the 4th element, nums becomes [0,2,0,0,0] and the maximum segment sum is 2 for segment [2]. 
+Query 5: Remove the 1st element, nums becomes [0,0,0,0,0] and the maximum segment sum is 0, since there are no segments.
+Finally, we return [14,7,2,2,0].
+ +

Example 2:

+ +
+Input: nums = [3,2,11,1], removeQueries = [3,2,1,0]
+Output: [16,5,3,0]
+Explanation: Using 0 to indicate a removed element, the answer is as follows:
+Query 1: Remove the 3rd element, nums becomes [3,2,11,0] and the maximum segment sum is 16 for segment [3,2,11].
+Query 2: Remove the 2nd element, nums becomes [3,2,0,0] and the maximum segment sum is 5 for segment [3,2].
+Query 3: Remove the 1st element, nums becomes [3,0,0,0] and the maximum segment sum is 3 for segment [3].
+Query 4: Remove the 0th element, nums becomes [0,0,0,0] and the maximum segment sum is 0, since there are no segments.
+Finally, we return [16,5,3,0].
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length == removeQueries.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
  • 0 <= removeQueries[i] < n
    • +
  • All the values of removeQueries are unique.
    • +
+",3.0,False,"class Solution { +public: + vector maximumSegmentSum(vector& nums, vector& removeQueries) { + + } +};","class Solution { + public long[] maximumSegmentSum(int[] nums, int[] removeQueries) { + + } +}","class Solution(object): + def maximumSegmentSum(self, nums, removeQueries): + """""" + :type nums: List[int] + :type removeQueries: List[int] + :rtype: List[int] + """""" + ","class Solution: + def maximumSegmentSum(self, nums: List[int], removeQueries: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* maximumSegmentSum(int* nums, int numsSize, int* removeQueries, int removeQueriesSize, int* returnSize){ + +}","public class Solution { + public long[] MaximumSegmentSum(int[] nums, int[] removeQueries) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} removeQueries + * @return {number[]} + */ +var maximumSegmentSum = function(nums, removeQueries) { + +};","# @param {Integer[]} nums +# @param {Integer[]} remove_queries +# @return {Integer[]} +def maximum_segment_sum(nums, remove_queries) + +end","class Solution { + func maximumSegmentSum(_ nums: [Int], _ removeQueries: [Int]) -> [Int] { + + } +}","func maximumSegmentSum(nums []int, removeQueries []int) []int64 { + +}","object Solution { + def maximumSegmentSum(nums: Array[Int], removeQueries: Array[Int]): Array[Long] = { + + } +}","class Solution { + fun maximumSegmentSum(nums: IntArray, removeQueries: IntArray): LongArray { + + } +}","impl Solution { + pub fn maximum_segment_sum(nums: Vec, remove_queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $removeQueries + * @return Integer[] + */ + function maximumSegmentSum($nums, $removeQueries) { + + } +}","function maximumSegmentSum(nums: number[], removeQueries: number[]): number[] { + +};","(define/contract (maximum-segment-sum nums removeQueries) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec maximum_segment_sum(Nums :: [integer()], RemoveQueries :: [integer()]) -> [integer()]. +maximum_segment_sum(Nums, RemoveQueries) -> + .","defmodule Solution do + @spec maximum_segment_sum(nums :: [integer], remove_queries :: [integer]) :: [integer] + def maximum_segment_sum(nums, remove_queries) do + + end +end","class Solution { + List maximumSegmentSum(List nums, List removeQueries) { + + } +}", +310,find-the-k-sum-of-an-array,Find the K-Sum of an Array,2386.0,2462.0,"

You are given an integer array nums and a positive integer k. You can choose any subsequence of the array and sum all of its elements together.

+ +

We define the K-Sum of the array as the kth largest subsequence sum that can be obtained (not necessarily distinct).

+ +

Return the K-Sum of the array.

+ +

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

+ +

Note that the empty subsequence is considered to have a sum of 0.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,4,-2], k = 5
+Output: 2
+Explanation: All the possible subsequence sums that we can obtain are the following sorted in decreasing order:
+- 6, 4, 4, 2, 2, 0, 0, -2.
+The 5-Sum of the array is 2.
+
+ +

Example 2:

+ +
+Input: nums = [1,-2,3,4,-10,12], k = 16
+Output: 10
+Explanation: The 16-Sum of the array is 10.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
  • 1 <= k <= min(2000, 2n)
    • +
+",3.0,False,"class Solution { +public: + long long kSum(vector& nums, int k) { + + } +};","class Solution { + public long kSum(int[] nums, int k) { + + } +}","class Solution(object): + def kSum(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def kSum(self, nums: List[int], k: int) -> int: + ","long long kSum(int* nums, int numsSize, int k){ + +}","public class Solution { + public long KSum(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var kSum = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def k_sum(nums, k) + +end","class Solution { + func kSum(_ nums: [Int], _ k: Int) -> Int { + + } +}","func kSum(nums []int, k int) int64 { + +}","object Solution { + def kSum(nums: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun kSum(nums: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn k_sum(nums: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function kSum($nums, $k) { + + } +}","function kSum(nums: number[], k: number): number { + +};","(define/contract (k-sum nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec k_sum(Nums :: [integer()], K :: integer()) -> integer(). +k_sum(Nums, K) -> + .","defmodule Solution do + @spec k_sum(nums :: [integer], k :: integer) :: integer + def k_sum(nums, k) do + + end +end","class Solution { + int kSum(List nums, int k) { + + } +}", +311,amount-of-time-for-binary-tree-to-be-infected,Amount of Time for Binary Tree to Be Infected,2385.0,2461.0,"

You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from the node with value start.

+ +

Each minute, a node becomes infected if:

+ +
    +
  • The node is currently uninfected.
    • +
  • The node is adjacent to an infected node.
    • +
+ +

Return the number of minutes needed for the entire tree to be infected.

+ +

 

+

Example 1:

+ +
+Input: root = [1,5,3,null,4,10,6,9,2], start = 3
+Output: 4
+Explanation: The following nodes are infected during:
+- Minute 0: Node 3
+- Minute 1: Nodes 1, 10 and 6
+- Minute 2: Node 5
+- Minute 3: Node 4
+- Minute 4: Nodes 9 and 2
+It takes 4 minutes for the whole tree to be infected so we return 4.
+
+ +

Example 2:

+ +
+Input: root = [1], start = 1
+Output: 0
+Explanation: At minute 0, the only node in the tree is infected so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 105].
    • +
  • 1 <= Node.val <= 105
    • +
  • Each node has a unique value.
    • +
  • A node with a value of start exists in the tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int amountOfTime(TreeNode* root, int start) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int amountOfTime(TreeNode root, int start) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def amountOfTime(self, root, start): + """""" + :type root: Optional[TreeNode] + :type start: int + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def amountOfTime(self, root: Optional[TreeNode], start: int) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int amountOfTime(struct TreeNode* root, int start){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int AmountOfTime(TreeNode root, int start) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} start + * @return {number} + */ +var amountOfTime = function(root, start) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} start +# @return {Integer} +def amount_of_time(root, start) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func amountOfTime(_ root: TreeNode?, _ start: Int) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func amountOfTime(root *TreeNode, start int) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def amountOfTime(root: TreeNode, start: Int): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun amountOfTime(root: TreeNode?, start: Int): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn amount_of_time(root: Option>>, start: i32) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $start + * @return Integer + */ + function amountOfTime($root, $start) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function amountOfTime(root: TreeNode | null, start: number): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (amount-of-time root start) + (-> (or/c tree-node? #f) exact-integer? exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec amount_of_time(Root :: #tree_node{} | null, Start :: integer()) -> integer(). +amount_of_time(Root, Start) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec amount_of_time(root :: TreeNode.t | nil, start :: integer) :: integer + def amount_of_time(root, start) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int amountOfTime(TreeNode? root, int start) { + + } +}", +313,count-special-integers,Count Special Integers,2376.0,2457.0,"

We call a positive integer special if all of its digits are distinct.

+ +

Given a positive integer n, return the number of special integers that belong to the interval [1, n].

+ +

 

+

Example 1:

+ +
+Input: n = 20
+Output: 19
+Explanation: All the integers from 1 to 20, except 11, are special. Thus, there are 19 special integers.
+
+ +

Example 2:

+ +
+Input: n = 5
+Output: 5
+Explanation: All the integers from 1 to 5 are special.
+
+ +

Example 3:

+ +
+Input: n = 135
+Output: 110
+Explanation: There are 110 integers from 1 to 135 that are special.
+Some of the integers that are not special are: 22, 114, and 131.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 109
    • +
+",3.0,False,"class Solution { +public: + int countSpecialNumbers(int n) { + + } +};","class Solution { + public int countSpecialNumbers(int n) { + + } +}","class Solution(object): + def countSpecialNumbers(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countSpecialNumbers(self, n: int) -> int: + ","int countSpecialNumbers(int n){ + +}","public class Solution { + public int CountSpecialNumbers(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countSpecialNumbers = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_special_numbers(n) + +end","class Solution { + func countSpecialNumbers(_ n: Int) -> Int { + + } +}","func countSpecialNumbers(n int) int { + +}","object Solution { + def countSpecialNumbers(n: Int): Int = { + + } +}","class Solution { + fun countSpecialNumbers(n: Int): Int { + + } +}","impl Solution { + pub fn count_special_numbers(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countSpecialNumbers($n) { + + } +}","function countSpecialNumbers(n: number): number { + +};","(define/contract (count-special-numbers n) + (-> exact-integer? exact-integer?) + + )","-spec count_special_numbers(N :: integer()) -> integer(). +count_special_numbers(N) -> + .","defmodule Solution do + @spec count_special_numbers(n :: integer) :: integer + def count_special_numbers(n) do + + end +end","class Solution { + int countSpecialNumbers(int n) { + + } +}", +317,minimum-replacements-to-sort-the-array,Minimum Replacements to Sort the Array,2366.0,2450.0,"

You are given a 0-indexed integer array nums. In one operation you can replace any element of the array with any two elements that sum to it.

+ +
    +
  • For example, consider nums = [5,6,7]. In one operation, we can replace nums[1] with 2 and 4 and convert nums to [5,2,4,7].
    • +
+ +

Return the minimum number of operations to make an array that is sorted in non-decreasing order.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,9,3]
+Output: 2
+Explanation: Here are the steps to sort the array in non-decreasing order:
+- From [3,9,3], replace the 9 with 3 and 6 so the array becomes [3,3,6,3]
+- From [3,3,6,3], replace the 6 with 3 and 3 so the array becomes [3,3,3,3,3]
+There are 2 steps to sort the array in non-decreasing order. Therefore, we return 2.
+
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,5]
+Output: 0
+Explanation: The array is already in non-decreasing order. Therefore, we return 0. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + long long minimumReplacement(vector& nums) { + + } +};","class Solution { + public long minimumReplacement(int[] nums) { + + } +}","class Solution(object): + def minimumReplacement(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumReplacement(self, nums: List[int]) -> int: + ","long long minimumReplacement(int* nums, int numsSize){ + +}","public class Solution { + public long MinimumReplacement(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumReplacement = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_replacement(nums) + +end","class Solution { + func minimumReplacement(_ nums: [Int]) -> Int { + + } +}","func minimumReplacement(nums []int) int64 { + +}","object Solution { + def minimumReplacement(nums: Array[Int]): Long = { + + } +}","class Solution { + fun minimumReplacement(nums: IntArray): Long { + + } +}","impl Solution { + pub fn minimum_replacement(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumReplacement($nums) { + + } +}","function minimumReplacement(nums: number[]): number { + +};","(define/contract (minimum-replacement nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_replacement(Nums :: [integer()]) -> integer(). +minimum_replacement(Nums) -> + .","defmodule Solution do + @spec minimum_replacement(nums :: [integer]) :: integer + def minimum_replacement(nums) do + + end +end","class Solution { + int minimumReplacement(List nums) { + + } +}", +318,maximum-number-of-robots-within-budget,Maximum Number of Robots Within Budget,2398.0,2449.0,"

You have n robots. You are given two 0-indexed integer arrays, chargeTimes and runningCosts, both of length n. The ith robot costs chargeTimes[i] units to charge and costs runningCosts[i] units to run. You are also given an integer budget.

+ +

The total cost of running k chosen robots is equal to max(chargeTimes) + k * sum(runningCosts), where max(chargeTimes) is the largest charge cost among the k robots and sum(runningCosts) is the sum of running costs among the k robots.

+ +

Return the maximum number of consecutive robots you can run such that the total cost does not exceed budget.

+ +

 

+

Example 1:

+ +
+Input: chargeTimes = [3,6,1,3,4], runningCosts = [2,1,3,4,5], budget = 25
+Output: 3
+Explanation: 
+It is possible to run all individual and consecutive pairs of robots within budget.
+To obtain answer 3, consider the first 3 robots. The total cost will be max(3,6,1) + 3 * sum(2,1,3) = 6 + 3 * 6 = 24 which is less than 25.
+It can be shown that it is not possible to run more than 3 consecutive robots within budget, so we return 3.
+
+ +

Example 2:

+ +
+Input: chargeTimes = [11,12,19], runningCosts = [10,8,7], budget = 19
+Output: 0
+Explanation: No robot can be run that does not exceed the budget, so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • chargeTimes.length == runningCosts.length == n
    • +
  • 1 <= n <= 5 * 104
    • +
  • 1 <= chargeTimes[i], runningCosts[i] <= 105
    • +
  • 1 <= budget <= 1015
    • +
+",3.0,False,"class Solution { +public: + int maximumRobots(vector& chargeTimes, vector& runningCosts, long long budget) { + + } +};","class Solution { + public int maximumRobots(int[] chargeTimes, int[] runningCosts, long budget) { + + } +}","class Solution(object): + def maximumRobots(self, chargeTimes, runningCosts, budget): + """""" + :type chargeTimes: List[int] + :type runningCosts: List[int] + :type budget: int + :rtype: int + """""" + ","class Solution: + def maximumRobots(self, chargeTimes: List[int], runningCosts: List[int], budget: int) -> int: + ","int maximumRobots(int* chargeTimes, int chargeTimesSize, int* runningCosts, int runningCostsSize, long long budget){ + +}","public class Solution { + public int MaximumRobots(int[] chargeTimes, int[] runningCosts, long budget) { + + } +}","/** + * @param {number[]} chargeTimes + * @param {number[]} runningCosts + * @param {number} budget + * @return {number} + */ +var maximumRobots = function(chargeTimes, runningCosts, budget) { + +};","# @param {Integer[]} charge_times +# @param {Integer[]} running_costs +# @param {Integer} budget +# @return {Integer} +def maximum_robots(charge_times, running_costs, budget) + +end","class Solution { + func maximumRobots(_ chargeTimes: [Int], _ runningCosts: [Int], _ budget: Int) -> Int { + + } +}","func maximumRobots(chargeTimes []int, runningCosts []int, budget int64) int { + +}","object Solution { + def maximumRobots(chargeTimes: Array[Int], runningCosts: Array[Int], budget: Long): Int = { + + } +}","class Solution { + fun maximumRobots(chargeTimes: IntArray, runningCosts: IntArray, budget: Long): Int { + + } +}","impl Solution { + pub fn maximum_robots(charge_times: Vec, running_costs: Vec, budget: i64) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $chargeTimes + * @param Integer[] $runningCosts + * @param Integer $budget + * @return Integer + */ + function maximumRobots($chargeTimes, $runningCosts, $budget) { + + } +}","function maximumRobots(chargeTimes: number[], runningCosts: number[], budget: number): number { + +};","(define/contract (maximum-robots chargeTimes runningCosts budget) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_robots(ChargeTimes :: [integer()], RunningCosts :: [integer()], Budget :: integer()) -> integer(). +maximum_robots(ChargeTimes, RunningCosts, Budget) -> + .","defmodule Solution do + @spec maximum_robots(charge_times :: [integer], running_costs :: [integer], budget :: integer) :: integer + def maximum_robots(charge_times, running_costs, budget) do + + end +end","class Solution { + int maximumRobots(List chargeTimes, List runningCosts, int budget) { + + } +}", +321,reachable-nodes-with-restrictions,Reachable Nodes With Restrictions,2368.0,2445.0,"

There is an undirected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

+ +

You are given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree. You are also given an integer array restricted which represents restricted nodes.

+ +

Return the maximum number of nodes you can reach from node 0 without visiting a restricted node.

+ +

Note that node 0 will not be a restricted node.

+ +

 

+

Example 1:

+ +
+Input: n = 7, edges = [[0,1],[1,2],[3,1],[4,0],[0,5],[5,6]], restricted = [4,5]
+Output: 4
+Explanation: The diagram above shows the tree.
+We have that [0,1,2,3] are the only nodes that can be reached from node 0 without visiting a restricted node.
+
+ +

Example 2:

+ +
+Input: n = 7, edges = [[0,1],[0,2],[0,5],[0,4],[3,2],[6,5]], restricted = [4,2,1]
+Output: 3
+Explanation: The diagram above shows the tree.
+We have that [0,5,6] are the only nodes that can be reached from node 0 without visiting a restricted node.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 105
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • edges represents a valid tree.
    • +
  • 1 <= restricted.length < n
    • +
  • 1 <= restricted[i] < n
    • +
  • All the values of restricted are unique.
    • +
+",2.0,False,"class Solution { +public: + int reachableNodes(int n, vector>& edges, vector& restricted) { + + } +};","class Solution { + public int reachableNodes(int n, int[][] edges, int[] restricted) { + + } +}","class Solution(object): + def reachableNodes(self, n, edges, restricted): + """""" + :type n: int + :type edges: List[List[int]] + :type restricted: List[int] + :rtype: int + """""" + ","class Solution: + def reachableNodes(self, n: int, edges: List[List[int]], restricted: List[int]) -> int: + ","int reachableNodes(int n, int** edges, int edgesSize, int* edgesColSize, int* restricted, int restrictedSize){ + +}","public class Solution { + public int ReachableNodes(int n, int[][] edges, int[] restricted) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} restricted + * @return {number} + */ +var reachableNodes = function(n, edges, restricted) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer[]} restricted +# @return {Integer} +def reachable_nodes(n, edges, restricted) + +end","class Solution { + func reachableNodes(_ n: Int, _ edges: [[Int]], _ restricted: [Int]) -> Int { + + } +}","func reachableNodes(n int, edges [][]int, restricted []int) int { + +}","object Solution { + def reachableNodes(n: Int, edges: Array[Array[Int]], restricted: Array[Int]): Int = { + + } +}","class Solution { + fun reachableNodes(n: Int, edges: Array, restricted: IntArray): Int { + + } +}","impl Solution { + pub fn reachable_nodes(n: i32, edges: Vec>, restricted: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer[] $restricted + * @return Integer + */ + function reachableNodes($n, $edges, $restricted) { + + } +}","function reachableNodes(n: number, edges: number[][], restricted: number[]): number { + +};","(define/contract (reachable-nodes n edges restricted) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec reachable_nodes(N :: integer(), Edges :: [[integer()]], Restricted :: [integer()]) -> integer(). +reachable_nodes(N, Edges, Restricted) -> + .","defmodule Solution do + @spec reachable_nodes(n :: integer, edges :: [[integer]], restricted :: [integer]) :: integer + def reachable_nodes(n, edges, restricted) do + + end +end","class Solution { + int reachableNodes(int n, List> edges, List restricted) { + + } +}", +325,longest-cycle-in-a-graph,Longest Cycle in a Graph,2360.0,2439.0,"

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

+ +

The graph is represented with a given 0-indexed array edges of size n, indicating that there is a directed edge from node i to node edges[i]. If there is no outgoing edge from node i, then edges[i] == -1.

+ +

Return the length of the longest cycle in the graph. If no cycle exists, return -1.

+ +

A cycle is a path that starts and ends at the same node.

+ +

 

+

Example 1:

+ +
+Input: edges = [3,3,4,2,3]
+Output: 3
+Explanation: The longest cycle in the graph is the cycle: 2 -> 4 -> 3 -> 2.
+The length of this cycle is 3, so 3 is returned.
+
+ +

Example 2:

+ +
+Input: edges = [2,-1,3,1]
+Output: -1
+Explanation: There are no cycles in this graph.
+
+ +

 

+

Constraints:

+ +
    +
  • n == edges.length
    • +
  • 2 <= n <= 105
    • +
  • -1 <= edges[i] < n
    • +
  • edges[i] != i
    • +
+",3.0,False,"class Solution { +public: + int longestCycle(vector& edges) { + + } +};","class Solution { + public int longestCycle(int[] edges) { + + } +}","class Solution(object): + def longestCycle(self, edges): + """""" + :type edges: List[int] + :rtype: int + """""" + ","class Solution: + def longestCycle(self, edges: List[int]) -> int: + ","int longestCycle(int* edges, int edgesSize){ + +}","public class Solution { + public int LongestCycle(int[] edges) { + + } +}","/** + * @param {number[]} edges + * @return {number} + */ +var longestCycle = function(edges) { + +};","# @param {Integer[]} edges +# @return {Integer} +def longest_cycle(edges) + +end","class Solution { + func longestCycle(_ edges: [Int]) -> Int { + + } +}","func longestCycle(edges []int) int { + +}","object Solution { + def longestCycle(edges: Array[Int]): Int = { + + } +}","class Solution { + fun longestCycle(edges: IntArray): Int { + + } +}","impl Solution { + pub fn longest_cycle(edges: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $edges + * @return Integer + */ + function longestCycle($edges) { + + } +}","function longestCycle(edges: number[]): number { + +};","(define/contract (longest-cycle edges) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_cycle(Edges :: [integer()]) -> integer(). +longest_cycle(Edges) -> + .","defmodule Solution do + @spec longest_cycle(edges :: [integer]) :: integer + def longest_cycle(edges) do + + end +end","class Solution { + int longestCycle(List edges) { + + } +}", +326,find-closest-node-to-given-two-nodes,Find Closest Node to Given Two Nodes,2359.0,2438.0,"

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

+ +

The graph is represented with a given 0-indexed array edges of size n, indicating that there is a directed edge from node i to node edges[i]. If there is no outgoing edge from i, then edges[i] == -1.

+ +

You are also given two integers node1 and node2.

+ +

Return the index of the node that can be reached from both node1 and node2, such that the maximum between the distance from node1 to that node, and from node2 to that node is minimized. If there are multiple answers, return the node with the smallest index, and if no possible answer exists, return -1.

+ +

Note that edges may contain cycles.

+ +

 

+

Example 1:

+ +
+Input: edges = [2,2,3,-1], node1 = 0, node2 = 1
+Output: 2
+Explanation: The distance from node 0 to node 2 is 1, and the distance from node 1 to node 2 is 1.
+The maximum of those two distances is 1. It can be proven that we cannot get a node with a smaller maximum distance than 1, so we return node 2.
+
+ +

Example 2:

+ +
+Input: edges = [1,2,-1], node1 = 0, node2 = 2
+Output: 2
+Explanation: The distance from node 0 to node 2 is 2, and the distance from node 2 to itself is 0.
+The maximum of those two distances is 2. It can be proven that we cannot get a node with a smaller maximum distance than 2, so we return node 2.
+
+ +

 

+

Constraints:

+ +
    +
  • n == edges.length
    • +
  • 2 <= n <= 105
    • +
  • -1 <= edges[i] < n
    • +
  • edges[i] != i
    • +
  • 0 <= node1, node2 < n
    • +
+",2.0,False,"class Solution { +public: + int closestMeetingNode(vector& edges, int node1, int node2) { + + } +};","class Solution { + public int closestMeetingNode(int[] edges, int node1, int node2) { + + } +}","class Solution(object): + def closestMeetingNode(self, edges, node1, node2): + """""" + :type edges: List[int] + :type node1: int + :type node2: int + :rtype: int + """""" + ","class Solution: + def closestMeetingNode(self, edges: List[int], node1: int, node2: int) -> int: + ","int closestMeetingNode(int* edges, int edgesSize, int node1, int node2){ + +}","public class Solution { + public int ClosestMeetingNode(int[] edges, int node1, int node2) { + + } +}","/** + * @param {number[]} edges + * @param {number} node1 + * @param {number} node2 + * @return {number} + */ +var closestMeetingNode = function(edges, node1, node2) { + +};","# @param {Integer[]} edges +# @param {Integer} node1 +# @param {Integer} node2 +# @return {Integer} +def closest_meeting_node(edges, node1, node2) + +end","class Solution { + func closestMeetingNode(_ edges: [Int], _ node1: Int, _ node2: Int) -> Int { + + } +}","func closestMeetingNode(edges []int, node1 int, node2 int) int { + +}","object Solution { + def closestMeetingNode(edges: Array[Int], node1: Int, node2: Int): Int = { + + } +}","class Solution { + fun closestMeetingNode(edges: IntArray, node1: Int, node2: Int): Int { + + } +}","impl Solution { + pub fn closest_meeting_node(edges: Vec, node1: i32, node2: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $edges + * @param Integer $node1 + * @param Integer $node2 + * @return Integer + */ + function closestMeetingNode($edges, $node1, $node2) { + + } +}","function closestMeetingNode(edges: number[], node1: number, node2: number): number { + +};","(define/contract (closest-meeting-node edges node1 node2) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec closest_meeting_node(Edges :: [integer()], Node1 :: integer(), Node2 :: integer()) -> integer(). +closest_meeting_node(Edges, Node1, Node2) -> + .","defmodule Solution do + @spec closest_meeting_node(edges :: [integer], node1 :: integer, node2 :: integer) :: integer + def closest_meeting_node(edges, node1, node2) do + + end +end","class Solution { + int closestMeetingNode(List edges, int node1, int node2) { + + } +}", +329,shortest-impossible-sequence-of-rolls,Shortest Impossible Sequence of Rolls,2350.0,2435.0,"

You are given an integer array rolls of length n and an integer k. You roll a k sided dice numbered from 1 to k, n times, where the result of the ith roll is rolls[i].

+ +

Return the length of the shortest sequence of rolls that cannot be taken from rolls.

+ +

A sequence of rolls of length len is the result of rolling a k sided dice len times.

+ +

Note that the sequence taken does not have to be consecutive as long as it is in order.

+ +

 

+

Example 1:

+ +
+Input: rolls = [4,2,1,2,3,3,2,4,1], k = 4
+Output: 3
+Explanation: Every sequence of rolls of length 1, [1], [2], [3], [4], can be taken from rolls.
+Every sequence of rolls of length 2, [1, 1], [1, 2], ..., [4, 4], can be taken from rolls.
+The sequence [1, 4, 2] cannot be taken from rolls, so we return 3.
+Note that there are other sequences that cannot be taken from rolls.
+ +

Example 2:

+ +
+Input: rolls = [1,1,2,2], k = 2
+Output: 2
+Explanation: Every sequence of rolls of length 1, [1], [2], can be taken from rolls.
+The sequence [2, 1] cannot be taken from rolls, so we return 2.
+Note that there are other sequences that cannot be taken from rolls but [2, 1] is the shortest.
+
+ +

Example 3:

+ +
+Input: rolls = [1,1,3,2,2,2,3,3], k = 4
+Output: 1
+Explanation: The sequence [4] cannot be taken from rolls, so we return 1.
+Note that there are other sequences that cannot be taken from rolls but [4] is the shortest.
+
+ +

 

+

Constraints:

+ +
    +
  • n == rolls.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= rolls[i] <= k <= 105
    • +
+",3.0,False,"class Solution { +public: + int shortestSequence(vector& rolls, int k) { + + } +};","class Solution { + public int shortestSequence(int[] rolls, int k) { + + } +}","class Solution(object): + def shortestSequence(self, rolls, k): + """""" + :type rolls: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def shortestSequence(self, rolls: List[int], k: int) -> int: + ","int shortestSequence(int* rolls, int rollsSize, int k){ + +}","public class Solution { + public int ShortestSequence(int[] rolls, int k) { + + } +}","/** + * @param {number[]} rolls + * @param {number} k + * @return {number} + */ +var shortestSequence = function(rolls, k) { + +};","# @param {Integer[]} rolls +# @param {Integer} k +# @return {Integer} +def shortest_sequence(rolls, k) + +end","class Solution { + func shortestSequence(_ rolls: [Int], _ k: Int) -> Int { + + } +}","func shortestSequence(rolls []int, k int) int { + +}","object Solution { + def shortestSequence(rolls: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun shortestSequence(rolls: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn shortest_sequence(rolls: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $rolls + * @param Integer $k + * @return Integer + */ + function shortestSequence($rolls, $k) { + + } +}","function shortestSequence(rolls: number[], k: number): number { + +};","(define/contract (shortest-sequence rolls k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec shortest_sequence(Rolls :: [integer()], K :: integer()) -> integer(). +shortest_sequence(Rolls, K) -> + .","defmodule Solution do + @spec shortest_sequence(rolls :: [integer], k :: integer) :: integer + def shortest_sequence(rolls, k) do + + end +end","class Solution { + int shortestSequence(List rolls, int k) { + + } +}", +330,design-a-number-container-system,Design a Number Container System,2349.0,2434.0,"

Design a number container system that can do the following:

+ +
    +
  • Insert or Replace a number at the given index in the system.
    • +
  • Return the smallest index for the given number in the system.
    • +
+ +

Implement the NumberContainers class:

+ +
    +
  • NumberContainers() Initializes the number container system.
    • +
  • void change(int index, int number) Fills the container at index with the number. If there is already a number at that index, replace it.
    • +
  • int find(int number) Returns the smallest index for the given number, or -1 if there is no index that is filled by number in the system.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["NumberContainers", "find", "change", "change", "change", "change", "find", "change", "find"]
+[[], [10], [2, 10], [1, 10], [3, 10], [5, 10], [10], [1, 20], [10]]
+Output
+[null, -1, null, null, null, null, 1, null, 2]
+
+Explanation
+NumberContainers nc = new NumberContainers();
+nc.find(10); // There is no index that is filled with number 10. Therefore, we return -1.
+nc.change(2, 10); // Your container at index 2 will be filled with number 10.
+nc.change(1, 10); // Your container at index 1 will be filled with number 10.
+nc.change(3, 10); // Your container at index 3 will be filled with number 10.
+nc.change(5, 10); // Your container at index 5 will be filled with number 10.
+nc.find(10); // Number 10 is at the indices 1, 2, 3, and 5. Since the smallest index that is filled with 10 is 1, we return 1.
+nc.change(1, 20); // Your container at index 1 will be filled with number 20. Note that index 1 was filled with 10 and then replaced with 20. 
+nc.find(10); // Number 10 is at the indices 2, 3, and 5. The smallest index that is filled with 10 is 2. Therefore, we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= index, number <= 109
    • +
  • At most 105 calls will be made in total to change and find.
    • +
+",2.0,False,"class NumberContainers { +public: + NumberContainers() { + + } + + void change(int index, int number) { + + } + + int find(int number) { + + } +}; + +/** + * Your NumberContainers object will be instantiated and called as such: + * NumberContainers* obj = new NumberContainers(); + * obj->change(index,number); + * int param_2 = obj->find(number); + */","class NumberContainers { + + public NumberContainers() { + + } + + public void change(int index, int number) { + + } + + public int find(int number) { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * NumberContainers obj = new NumberContainers(); + * obj.change(index,number); + * int param_2 = obj.find(number); + */","class NumberContainers(object): + + def __init__(self): + + + def change(self, index, number): + """""" + :type index: int + :type number: int + :rtype: None + """""" + + + def find(self, number): + """""" + :type number: int + :rtype: int + """""" + + + +# Your NumberContainers object will be instantiated and called as such: +# obj = NumberContainers() +# obj.change(index,number) +# param_2 = obj.find(number)","class NumberContainers: + + def __init__(self): + + + def change(self, index: int, number: int) -> None: + + + def find(self, number: int) -> int: + + + +# Your NumberContainers object will be instantiated and called as such: +# obj = NumberContainers() +# obj.change(index,number) +# param_2 = obj.find(number)"," + + +typedef struct { + +} NumberContainers; + + +NumberContainers* numberContainersCreate() { + +} + +void numberContainersChange(NumberContainers* obj, int index, int number) { + +} + +int numberContainersFind(NumberContainers* obj, int number) { + +} + +void numberContainersFree(NumberContainers* obj) { + +} + +/** + * Your NumberContainers struct will be instantiated and called as such: + * NumberContainers* obj = numberContainersCreate(); + * numberContainersChange(obj, index, number); + + * int param_2 = numberContainersFind(obj, number); + + * numberContainersFree(obj); +*/","public class NumberContainers { + + public NumberContainers() { + + } + + public void Change(int index, int number) { + + } + + public int Find(int number) { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * NumberContainers obj = new NumberContainers(); + * obj.Change(index,number); + * int param_2 = obj.Find(number); + */"," +var NumberContainers = function() { + +}; + +/** + * @param {number} index + * @param {number} number + * @return {void} + */ +NumberContainers.prototype.change = function(index, number) { + +}; + +/** + * @param {number} number + * @return {number} + */ +NumberContainers.prototype.find = function(number) { + +}; + +/** + * Your NumberContainers object will be instantiated and called as such: + * var obj = new NumberContainers() + * obj.change(index,number) + * var param_2 = obj.find(number) + */","class NumberContainers + def initialize() + + end + + +=begin + :type index: Integer + :type number: Integer + :rtype: Void +=end + def change(index, number) + + end + + +=begin + :type number: Integer + :rtype: Integer +=end + def find(number) + + end + + +end + +# Your NumberContainers object will be instantiated and called as such: +# obj = NumberContainers.new() +# obj.change(index, number) +# param_2 = obj.find(number)"," +class NumberContainers { + + init() { + + } + + func change(_ index: Int, _ number: Int) { + + } + + func find(_ number: Int) -> Int { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * let obj = NumberContainers() + * obj.change(index, number) + * let ret_2: Int = obj.find(number) + */","type NumberContainers struct { + +} + + +func Constructor() NumberContainers { + +} + + +func (this *NumberContainers) Change(index int, number int) { + +} + + +func (this *NumberContainers) Find(number int) int { + +} + + +/** + * Your NumberContainers object will be instantiated and called as such: + * obj := Constructor(); + * obj.Change(index,number); + * param_2 := obj.Find(number); + */","class NumberContainers() { + + def change(index: Int, number: Int) { + + } + + def find(number: Int): Int = { + + } + +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * var obj = new NumberContainers() + * obj.change(index,number) + * var param_2 = obj.find(number) + */","class NumberContainers() { + + fun change(index: Int, number: Int) { + + } + + fun find(number: Int): Int { + + } + +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * var obj = NumberContainers() + * obj.change(index,number) + * var param_2 = obj.find(number) + */","struct NumberContainers { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl NumberContainers { + + fn new() -> Self { + + } + + fn change(&self, index: i32, number: i32) { + + } + + fn find(&self, number: i32) -> i32 { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * let obj = NumberContainers::new(); + * obj.change(index, number); + * let ret_2: i32 = obj.find(number); + */","class NumberContainers { + /** + */ + function __construct() { + + } + + /** + * @param Integer $index + * @param Integer $number + * @return NULL + */ + function change($index, $number) { + + } + + /** + * @param Integer $number + * @return Integer + */ + function find($number) { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * $obj = NumberContainers(); + * $obj->change($index, $number); + * $ret_2 = $obj->find($number); + */","class NumberContainers { + constructor() { + + } + + change(index: number, number: number): void { + + } + + find(number: number): number { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * var obj = new NumberContainers() + * obj.change(index,number) + * var param_2 = obj.find(number) + */","(define number-containers% + (class object% + (super-new) + + (init-field) + + ; change : exact-integer? exact-integer? -> void? + (define/public (change index number) + + ) + ; find : exact-integer? -> exact-integer? + (define/public (find number) + + ))) + +;; Your number-containers% object will be instantiated and called as such: +;; (define obj (new number-containers%)) +;; (send obj change index number) +;; (define param_2 (send obj find number))","-spec number_containers_init_() -> any(). +number_containers_init_() -> + . + +-spec number_containers_change(Index :: integer(), Number :: integer()) -> any(). +number_containers_change(Index, Number) -> + . + +-spec number_containers_find(Number :: integer()) -> integer(). +number_containers_find(Number) -> + . + + +%% Your functions will be called as such: +%% number_containers_init_(), +%% number_containers_change(Index, Number), +%% Param_2 = number_containers_find(Number), + +%% number_containers_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule NumberContainers do + @spec init_() :: any + def init_() do + + end + + @spec change(index :: integer, number :: integer) :: any + def change(index, number) do + + end + + @spec find(number :: integer) :: integer + def find(number) do + + end +end + +# Your functions will be called as such: +# NumberContainers.init_() +# NumberContainers.change(index, number) +# param_2 = NumberContainers.find(number) + +# NumberContainers.init_ will be called before every test case, in which you can do some necessary initializations.","class NumberContainers { + + NumberContainers() { + + } + + void change(int index, int number) { + + } + + int find(int number) { + + } +} + +/** + * Your NumberContainers object will be instantiated and called as such: + * NumberContainers obj = NumberContainers(); + * obj.change(index,number); + * int param2 = obj.find(number); + */", +333,number-of-excellent-pairs,Number of Excellent Pairs,2354.0,2430.0,"

You are given a 0-indexed positive integer array nums and a positive integer k.

+ +

A pair of numbers (num1, num2) is called excellent if the following conditions are satisfied:

+ +
    +
  • Both the numbers num1 and num2 exist in the array nums.
    • +
  • The sum of the number of set bits in num1 OR num2 and num1 AND num2 is greater than or equal to k, where OR is the bitwise OR operation and AND is the bitwise AND operation.
    • +
+ +

Return the number of distinct excellent pairs.

+ +

Two pairs (a, b) and (c, d) are considered distinct if either a != c or b != d. For example, (1, 2) and (2, 1) are distinct.

+ +

Note that a pair (num1, num2) such that num1 == num2 can also be excellent if you have at least one occurrence of num1 in the array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,1], k = 3
+Output: 5
+Explanation: The excellent pairs are the following:
+- (3, 3). (3 AND 3) and (3 OR 3) are both equal to (11) in binary. The total number of set bits is 2 + 2 = 4, which is greater than or equal to k = 3.
+- (2, 3) and (3, 2). (2 AND 3) is equal to (10) in binary, and (2 OR 3) is equal to (11) in binary. The total number of set bits is 1 + 2 = 3.
+- (1, 3) and (3, 1). (1 AND 3) is equal to (01) in binary, and (1 OR 3) is equal to (11) in binary. The total number of set bits is 1 + 2 = 3.
+So the number of excellent pairs is 5.
+ +

Example 2:

+ +
+Input: nums = [5,1,1], k = 10
+Output: 0
+Explanation: There are no excellent pairs for this array.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
  • 1 <= k <= 60
    • +
+",3.0,False,"class Solution { +public: + long long countExcellentPairs(vector& nums, int k) { + + } +};","class Solution { + public long countExcellentPairs(int[] nums, int k) { + + } +}","class Solution(object): + def countExcellentPairs(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countExcellentPairs(self, nums: List[int], k: int) -> int: + ","long long countExcellentPairs(int* nums, int numsSize, int k){ + +}","public class Solution { + public long CountExcellentPairs(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countExcellentPairs = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_excellent_pairs(nums, k) + +end","class Solution { + func countExcellentPairs(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countExcellentPairs(nums []int, k int) int64 { + +}","object Solution { + def countExcellentPairs(nums: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun countExcellentPairs(nums: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn count_excellent_pairs(nums: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countExcellentPairs($nums, $k) { + + } +}","function countExcellentPairs(nums: number[], k: number): number { + +};","(define/contract (count-excellent-pairs nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_excellent_pairs(Nums :: [integer()], K :: integer()) -> integer(). +count_excellent_pairs(Nums, K) -> + .","defmodule Solution do + @spec count_excellent_pairs(nums :: [integer], k :: integer) :: integer + def count_excellent_pairs(nums, k) do + + end +end","class Solution { + int countExcellentPairs(List nums, int k) { + + } +}", +334,design-a-food-rating-system,Design a Food Rating System,2353.0,2429.0,"

Design a food rating system that can do the following:

+ +
    +
  • Modify the rating of a food item listed in the system.
    • +
  • Return the highest-rated food item for a type of cuisine in the system.
    • +
+ +

Implement the FoodRatings class:

+ +
    +
  • FoodRatings(String[] foods, String[] cuisines, int[] ratings) Initializes the system. The food items are described by foods, cuisines and ratings, all of which have a length of n. + +
      +
    • foods[i] is the name of the ith food,
      • +
    • cuisines[i] is the type of cuisine of the ith food, and
      • +
    • ratings[i] is the initial rating of the ith food.
      • +
    +
    • +
  • void changeRating(String food, int newRating) Changes the rating of the food item with the name food.
    • +
  • String highestRated(String cuisine) Returns the name of the food item that has the highest rating for the given type of cuisine. If there is a tie, return the item with the lexicographically smaller name.
    • +
+ +

Note that a string x is lexicographically smaller than string y if x comes before y in dictionary order, that is, either x is a prefix of y, or if i is the first position such that x[i] != y[i], then x[i] comes before y[i] in alphabetic order.

+ +

 

+

Example 1:

+ +
+Input
+["FoodRatings", "highestRated", "highestRated", "changeRating", "highestRated", "changeRating", "highestRated"]
+[[["kimchi", "miso", "sushi", "moussaka", "ramen", "bulgogi"], ["korean", "japanese", "japanese", "greek", "japanese", "korean"], [9, 12, 8, 15, 14, 7]], ["korean"], ["japanese"], ["sushi", 16], ["japanese"], ["ramen", 16], ["japanese"]]
+Output
+[null, "kimchi", "ramen", null, "sushi", null, "ramen"]
+
+Explanation
+FoodRatings foodRatings = new FoodRatings(["kimchi", "miso", "sushi", "moussaka", "ramen", "bulgogi"], ["korean", "japanese", "japanese", "greek", "japanese", "korean"], [9, 12, 8, 15, 14, 7]);
+foodRatings.highestRated("korean"); // return "kimchi"
+                                    // "kimchi" is the highest rated korean food with a rating of 9.
+foodRatings.highestRated("japanese"); // return "ramen"
+                                      // "ramen" is the highest rated japanese food with a rating of 14.
+foodRatings.changeRating("sushi", 16); // "sushi" now has a rating of 16.
+foodRatings.highestRated("japanese"); // return "sushi"
+                                      // "sushi" is the highest rated japanese food with a rating of 16.
+foodRatings.changeRating("ramen", 16); // "ramen" now has a rating of 16.
+foodRatings.highestRated("japanese"); // return "ramen"
+                                      // Both "sushi" and "ramen" have a rating of 16.
+                                      // However, "ramen" is lexicographically smaller than "sushi".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 104
    • +
  • n == foods.length == cuisines.length == ratings.length
    • +
  • 1 <= foods[i].length, cuisines[i].length <= 10
    • +
  • foods[i], cuisines[i] consist of lowercase English letters.
    • +
  • 1 <= ratings[i] <= 108
    • +
  • All the strings in foods are distinct.
    • +
  • food will be the name of a food item in the system across all calls to changeRating.
    • +
  • cuisine will be a type of cuisine of at least one food item in the system across all calls to highestRated.
    • +
  • At most 2 * 104 calls in total will be made to changeRating and highestRated.
    • +
+",2.0,False,"class FoodRatings { +public: + FoodRatings(vector& foods, vector& cuisines, vector& ratings) { + + } + + void changeRating(string food, int newRating) { + + } + + string highestRated(string cuisine) { + + } +}; + +/** + * Your FoodRatings object will be instantiated and called as such: + * FoodRatings* obj = new FoodRatings(foods, cuisines, ratings); + * obj->changeRating(food,newRating); + * string param_2 = obj->highestRated(cuisine); + */","class FoodRatings { + + public FoodRatings(String[] foods, String[] cuisines, int[] ratings) { + + } + + public void changeRating(String food, int newRating) { + + } + + public String highestRated(String cuisine) { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * FoodRatings obj = new FoodRatings(foods, cuisines, ratings); + * obj.changeRating(food,newRating); + * String param_2 = obj.highestRated(cuisine); + */","class FoodRatings(object): + + def __init__(self, foods, cuisines, ratings): + """""" + :type foods: List[str] + :type cuisines: List[str] + :type ratings: List[int] + """""" + + + def changeRating(self, food, newRating): + """""" + :type food: str + :type newRating: int + :rtype: None + """""" + + + def highestRated(self, cuisine): + """""" + :type cuisine: str + :rtype: str + """""" + + + +# Your FoodRatings object will be instantiated and called as such: +# obj = FoodRatings(foods, cuisines, ratings) +# obj.changeRating(food,newRating) +# param_2 = obj.highestRated(cuisine)","class FoodRatings: + + def __init__(self, foods: List[str], cuisines: List[str], ratings: List[int]): + + + def changeRating(self, food: str, newRating: int) -> None: + + + def highestRated(self, cuisine: str) -> str: + + + +# Your FoodRatings object will be instantiated and called as such: +# obj = FoodRatings(foods, cuisines, ratings) +# obj.changeRating(food,newRating) +# param_2 = obj.highestRated(cuisine)"," + + +typedef struct { + +} FoodRatings; + + +FoodRatings* foodRatingsCreate(char ** foods, int foodsSize, char ** cuisines, int cuisinesSize, int* ratings, int ratingsSize) { + +} + +void foodRatingsChangeRating(FoodRatings* obj, char * food, int newRating) { + +} + +char * foodRatingsHighestRated(FoodRatings* obj, char * cuisine) { + +} + +void foodRatingsFree(FoodRatings* obj) { + +} + +/** + * Your FoodRatings struct will be instantiated and called as such: + * FoodRatings* obj = foodRatingsCreate(foods, foodsSize, cuisines, cuisinesSize, ratings, ratingsSize); + * foodRatingsChangeRating(obj, food, newRating); + + * char * param_2 = foodRatingsHighestRated(obj, cuisine); + + * foodRatingsFree(obj); +*/","public class FoodRatings { + + public FoodRatings(string[] foods, string[] cuisines, int[] ratings) { + + } + + public void ChangeRating(string food, int newRating) { + + } + + public string HighestRated(string cuisine) { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * FoodRatings obj = new FoodRatings(foods, cuisines, ratings); + * obj.ChangeRating(food,newRating); + * string param_2 = obj.HighestRated(cuisine); + */","/** + * @param {string[]} foods + * @param {string[]} cuisines + * @param {number[]} ratings + */ +var FoodRatings = function(foods, cuisines, ratings) { + +}; + +/** + * @param {string} food + * @param {number} newRating + * @return {void} + */ +FoodRatings.prototype.changeRating = function(food, newRating) { + +}; + +/** + * @param {string} cuisine + * @return {string} + */ +FoodRatings.prototype.highestRated = function(cuisine) { + +}; + +/** + * Your FoodRatings object will be instantiated and called as such: + * var obj = new FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food,newRating) + * var param_2 = obj.highestRated(cuisine) + */","class FoodRatings + +=begin + :type foods: String[] + :type cuisines: String[] + :type ratings: Integer[] +=end + def initialize(foods, cuisines, ratings) + + end + + +=begin + :type food: String + :type new_rating: Integer + :rtype: Void +=end + def change_rating(food, new_rating) + + end + + +=begin + :type cuisine: String + :rtype: String +=end + def highest_rated(cuisine) + + end + + +end + +# Your FoodRatings object will be instantiated and called as such: +# obj = FoodRatings.new(foods, cuisines, ratings) +# obj.change_rating(food, new_rating) +# param_2 = obj.highest_rated(cuisine)"," +class FoodRatings { + + init(_ foods: [String], _ cuisines: [String], _ ratings: [Int]) { + + } + + func changeRating(_ food: String, _ newRating: Int) { + + } + + func highestRated(_ cuisine: String) -> String { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * let obj = FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food, newRating) + * let ret_2: String = obj.highestRated(cuisine) + */","type FoodRatings struct { + +} + + +func Constructor(foods []string, cuisines []string, ratings []int) FoodRatings { + +} + + +func (this *FoodRatings) ChangeRating(food string, newRating int) { + +} + + +func (this *FoodRatings) HighestRated(cuisine string) string { + +} + + +/** + * Your FoodRatings object will be instantiated and called as such: + * obj := Constructor(foods, cuisines, ratings); + * obj.ChangeRating(food,newRating); + * param_2 := obj.HighestRated(cuisine); + */","class FoodRatings(_foods: Array[String], _cuisines: Array[String], _ratings: Array[Int]) { + + def changeRating(food: String, newRating: Int) { + + } + + def highestRated(cuisine: String): String = { + + } + +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * var obj = new FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food,newRating) + * var param_2 = obj.highestRated(cuisine) + */","class FoodRatings(foods: Array, cuisines: Array, ratings: IntArray) { + + fun changeRating(food: String, newRating: Int) { + + } + + fun highestRated(cuisine: String): String { + + } + +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * var obj = FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food,newRating) + * var param_2 = obj.highestRated(cuisine) + */","struct FoodRatings { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl FoodRatings { + + fn new(foods: Vec, cuisines: Vec, ratings: Vec) -> Self { + + } + + fn change_rating(&self, food: String, new_rating: i32) { + + } + + fn highest_rated(&self, cuisine: String) -> String { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * let obj = FoodRatings::new(foods, cuisines, ratings); + * obj.change_rating(food, newRating); + * let ret_2: String = obj.highest_rated(cuisine); + */","class FoodRatings { + /** + * @param String[] $foods + * @param String[] $cuisines + * @param Integer[] $ratings + */ + function __construct($foods, $cuisines, $ratings) { + + } + + /** + * @param String $food + * @param Integer $newRating + * @return NULL + */ + function changeRating($food, $newRating) { + + } + + /** + * @param String $cuisine + * @return String + */ + function highestRated($cuisine) { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * $obj = FoodRatings($foods, $cuisines, $ratings); + * $obj->changeRating($food, $newRating); + * $ret_2 = $obj->highestRated($cuisine); + */","class FoodRatings { + constructor(foods: string[], cuisines: string[], ratings: number[]) { + + } + + changeRating(food: string, newRating: number): void { + + } + + highestRated(cuisine: string): string { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * var obj = new FoodRatings(foods, cuisines, ratings) + * obj.changeRating(food,newRating) + * var param_2 = obj.highestRated(cuisine) + */","(define food-ratings% + (class object% + (super-new) + + ; foods : (listof string?) + ; cuisines : (listof string?) + ; ratings : (listof exact-integer?) + (init-field + foods + cuisines + ratings) + + ; change-rating : string? exact-integer? -> void? + (define/public (change-rating food new-rating) + + ) + ; highest-rated : string? -> string? + (define/public (highest-rated cuisine) + + ))) + +;; Your food-ratings% object will be instantiated and called as such: +;; (define obj (new food-ratings% [foods foods] [cuisines cuisines] [ratings ratings])) +;; (send obj change-rating food new-rating) +;; (define param_2 (send obj highest-rated cuisine))","-spec food_ratings_init_(Foods :: [unicode:unicode_binary()], Cuisines :: [unicode:unicode_binary()], Ratings :: [integer()]) -> any(). +food_ratings_init_(Foods, Cuisines, Ratings) -> + . + +-spec food_ratings_change_rating(Food :: unicode:unicode_binary(), NewRating :: integer()) -> any(). +food_ratings_change_rating(Food, NewRating) -> + . + +-spec food_ratings_highest_rated(Cuisine :: unicode:unicode_binary()) -> unicode:unicode_binary(). +food_ratings_highest_rated(Cuisine) -> + . + + +%% Your functions will be called as such: +%% food_ratings_init_(Foods, Cuisines, Ratings), +%% food_ratings_change_rating(Food, NewRating), +%% Param_2 = food_ratings_highest_rated(Cuisine), + +%% food_ratings_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule FoodRatings do + @spec init_(foods :: [String.t], cuisines :: [String.t], ratings :: [integer]) :: any + def init_(foods, cuisines, ratings) do + + end + + @spec change_rating(food :: String.t, new_rating :: integer) :: any + def change_rating(food, new_rating) do + + end + + @spec highest_rated(cuisine :: String.t) :: String.t + def highest_rated(cuisine) do + + end +end + +# Your functions will be called as such: +# FoodRatings.init_(foods, cuisines, ratings) +# FoodRatings.change_rating(food, new_rating) +# param_2 = FoodRatings.highest_rated(cuisine) + +# FoodRatings.init_ will be called before every test case, in which you can do some necessary initializations.","class FoodRatings { + + FoodRatings(List foods, List cuisines, List ratings) { + + } + + void changeRating(String food, int newRating) { + + } + + String highestRated(String cuisine) { + + } +} + +/** + * Your FoodRatings object will be instantiated and called as such: + * FoodRatings obj = FoodRatings(foods, cuisines, ratings); + * obj.changeRating(food,newRating); + * String param2 = obj.highestRated(cuisine); + */", +337,minimum-deletions-to-make-array-divisible,Minimum Deletions to Make Array Divisible,2344.0,2423.0,"

You are given two positive integer arrays nums and numsDivide. You can delete any number of elements from nums.

+ +

Return the minimum number of deletions such that the smallest element in nums divides all the elements of numsDivide. If this is not possible, return -1.

+ +

Note that an integer x divides y if y % x == 0.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,2,4,3], numsDivide = [9,6,9,3,15]
+Output: 2
+Explanation: 
+The smallest element in [2,3,2,4,3] is 2, which does not divide all the elements of numsDivide.
+We use 2 deletions to delete the elements in nums that are equal to 2 which makes nums = [3,4,3].
+The smallest element in [3,4,3] is 3, which divides all the elements of numsDivide.
+It can be shown that 2 is the minimum number of deletions needed.
+
+ +

Example 2:

+ +
+Input: nums = [4,3,6], numsDivide = [8,2,6,10]
+Output: -1
+Explanation: 
+We want the smallest element in nums to divide all the elements of numsDivide.
+There is no way to delete elements from nums to allow this.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length, numsDivide.length <= 105
    • +
  • 1 <= nums[i], numsDivide[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int minOperations(vector& nums, vector& numsDivide) { + + } +};","class Solution { + public int minOperations(int[] nums, int[] numsDivide) { + + } +}","class Solution(object): + def minOperations(self, nums, numsDivide): + """""" + :type nums: List[int] + :type numsDivide: List[int] + :rtype: int + """""" + ","class Solution: + def minOperations(self, nums: List[int], numsDivide: List[int]) -> int: + ","int minOperations(int* nums, int numsSize, int* numsDivide, int numsDivideSize){ + +}","public class Solution { + public int MinOperations(int[] nums, int[] numsDivide) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} numsDivide + * @return {number} + */ +var minOperations = function(nums, numsDivide) { + +};","# @param {Integer[]} nums +# @param {Integer[]} nums_divide +# @return {Integer} +def min_operations(nums, nums_divide) + +end","class Solution { + func minOperations(_ nums: [Int], _ numsDivide: [Int]) -> Int { + + } +}","func minOperations(nums []int, numsDivide []int) int { + +}","object Solution { + def minOperations(nums: Array[Int], numsDivide: Array[Int]): Int = { + + } +}","class Solution { + fun minOperations(nums: IntArray, numsDivide: IntArray): Int { + + } +}","impl Solution { + pub fn min_operations(nums: Vec, nums_divide: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $numsDivide + * @return Integer + */ + function minOperations($nums, $numsDivide) { + + } +}","function minOperations(nums: number[], numsDivide: number[]): number { + +};","(define/contract (min-operations nums numsDivide) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_operations(Nums :: [integer()], NumsDivide :: [integer()]) -> integer(). +min_operations(Nums, NumsDivide) -> + .","defmodule Solution do + @spec min_operations(nums :: [integer], nums_divide :: [integer]) :: integer + def min_operations(nums, nums_divide) do + + end +end","class Solution { + int minOperations(List nums, List numsDivide) { + + } +}", +338,query-kth-smallest-trimmed-number,Query Kth Smallest Trimmed Number,2343.0,2422.0,"

You are given a 0-indexed array of strings nums, where each string is of equal length and consists of only digits.

+ +

You are also given a 0-indexed 2D integer array queries where queries[i] = [ki, trimi]. For each queries[i], you need to:

+ +
    +
  • Trim each number in nums to its rightmost trimi digits.
    • +
  • Determine the index of the kith smallest trimmed number in nums. If two trimmed numbers are equal, the number with the lower index is considered to be smaller.
    • +
  • Reset each number in nums to its original length.
    • +
+ +

Return an array answer of the same length as queries, where answer[i] is the answer to the ith query.

+ +

Note:

+ +
    +
  • To trim to the rightmost x digits means to keep removing the leftmost digit, until only x digits remain.
    • +
  • Strings in nums may contain leading zeros.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = ["102","473","251","814"], queries = [[1,1],[2,3],[4,2],[1,2]]
+Output: [2,2,1,0]
+Explanation:
+1. After trimming to the last digit, nums = ["2","3","1","4"]. The smallest number is 1 at index 2.
+2. Trimmed to the last 3 digits, nums is unchanged. The 2nd smallest number is 251 at index 2.
+3. Trimmed to the last 2 digits, nums = ["02","73","51","14"]. The 4th smallest number is 73.
+4. Trimmed to the last 2 digits, the smallest number is 2 at index 0.
+   Note that the trimmed number "02" is evaluated as 2.
+
+ +

Example 2:

+ +
+Input: nums = ["24","37","96","04"], queries = [[2,1],[2,2]]
+Output: [3,0]
+Explanation:
+1. Trimmed to the last digit, nums = ["4","7","6","4"]. The 2nd smallest number is 4 at index 3.
+   There are two occurrences of 4, but the one at index 0 is considered smaller than the one at index 3.
+2. Trimmed to the last 2 digits, nums is unchanged. The 2nd smallest number is 24.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= nums[i].length <= 100
    • +
  • nums[i] consists of only digits.
    • +
  • All nums[i].length are equal.
    • +
  • 1 <= queries.length <= 100
    • +
  • queries[i].length == 2
    • +
  • 1 <= ki <= nums.length
    • +
  • 1 <= trimi <= nums[i].length
    • +
+ +

 

+

Follow up: Could you use the Radix Sort Algorithm to solve this problem? What will be the complexity of that solution?

+",2.0,False,"class Solution { +public: + vector smallestTrimmedNumbers(vector& nums, vector>& queries) { + + } +};","class Solution { + public int[] smallestTrimmedNumbers(String[] nums, int[][] queries) { + + } +}","class Solution(object): + def smallestTrimmedNumbers(self, nums, queries): + """""" + :type nums: List[str] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def smallestTrimmedNumbers(self, nums: List[str], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* smallestTrimmedNumbers(char ** nums, int numsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] SmallestTrimmedNumbers(string[] nums, int[][] queries) { + + } +}","/** + * @param {string[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var smallestTrimmedNumbers = function(nums, queries) { + +};","# @param {String[]} nums +# @param {Integer[][]} queries +# @return {Integer[]} +def smallest_trimmed_numbers(nums, queries) + +end","class Solution { + func smallestTrimmedNumbers(_ nums: [String], _ queries: [[Int]]) -> [Int] { + + } +}","func smallestTrimmedNumbers(nums []string, queries [][]int) []int { + +}","object Solution { + def smallestTrimmedNumbers(nums: Array[String], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun smallestTrimmedNumbers(nums: Array, queries: Array): IntArray { + + } +}","impl Solution { + pub fn smallest_trimmed_numbers(nums: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $nums + * @param Integer[][] $queries + * @return Integer[] + */ + function smallestTrimmedNumbers($nums, $queries) { + + } +}","function smallestTrimmedNumbers(nums: string[], queries: number[][]): number[] { + +};","(define/contract (smallest-trimmed-numbers nums queries) + (-> (listof string?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec smallest_trimmed_numbers(Nums :: [unicode:unicode_binary()], Queries :: [[integer()]]) -> [integer()]. +smallest_trimmed_numbers(Nums, Queries) -> + .","defmodule Solution do + @spec smallest_trimmed_numbers(nums :: [String.t], queries :: [[integer]]) :: [integer] + def smallest_trimmed_numbers(nums, queries) do + + end +end","class Solution { + List smallestTrimmedNumbers(List nums, List> queries) { + + } +}", +340,subarray-with-elements-greater-than-varying-threshold,Subarray With Elements Greater Than Varying Threshold,2334.0,2419.0,"

You are given an integer array nums and an integer threshold.

+ +

Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k.

+ +

Return the size of any such subarray. If there is no such subarray, return -1.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,4,3,1], threshold = 6
+Output: 3
+Explanation: The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.
+Note that this is the only valid subarray.
+
+ +

Example 2:

+ +
+Input: nums = [6,5,6,5,8], threshold = 7
+Output: 1
+Explanation: The subarray [8] has a size of 1, and 8 > 7 / 1 = 7. So 1 is returned.
+Note that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. 
+Similarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.
+Therefore, 2, 3, 4, or 5 may also be returned.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i], threshold <= 109
    • +
+",3.0,False,"class Solution { +public: + int validSubarraySize(vector& nums, int threshold) { + + } +};","class Solution { + public int validSubarraySize(int[] nums, int threshold) { + + } +}","class Solution(object): + def validSubarraySize(self, nums, threshold): + """""" + :type nums: List[int] + :type threshold: int + :rtype: int + """""" + ","class Solution: + def validSubarraySize(self, nums: List[int], threshold: int) -> int: + ","int validSubarraySize(int* nums, int numsSize, int threshold){ + +}","public class Solution { + public int ValidSubarraySize(int[] nums, int threshold) { + + } +}","/** + * @param {number[]} nums + * @param {number} threshold + * @return {number} + */ +var validSubarraySize = function(nums, threshold) { + +};","# @param {Integer[]} nums +# @param {Integer} threshold +# @return {Integer} +def valid_subarray_size(nums, threshold) + +end","class Solution { + func validSubarraySize(_ nums: [Int], _ threshold: Int) -> Int { + + } +}","func validSubarraySize(nums []int, threshold int) int { + +}","object Solution { + def validSubarraySize(nums: Array[Int], threshold: Int): Int = { + + } +}","class Solution { + fun validSubarraySize(nums: IntArray, threshold: Int): Int { + + } +}","impl Solution { + pub fn valid_subarray_size(nums: Vec, threshold: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $threshold + * @return Integer + */ + function validSubarraySize($nums, $threshold) { + + } +}","function validSubarraySize(nums: number[], threshold: number): number { + +};","(define/contract (valid-subarray-size nums threshold) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec valid_subarray_size(Nums :: [integer()], Threshold :: integer()) -> integer(). +valid_subarray_size(Nums, Threshold) -> + .","defmodule Solution do + @spec valid_subarray_size(nums :: [integer], threshold :: integer) :: integer + def valid_subarray_size(nums, threshold) do + + end +end","class Solution { + int validSubarraySize(List nums, int threshold) { + + } +}", +341,minimum-sum-of-squared-difference,Minimum Sum of Squared Difference,2333.0,2418.0,"

You are given two positive 0-indexed integer arrays nums1 and nums2, both of length n.

+ +

The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n.

+ +

You are also given two positive integers k1 and k2. You can modify any of the elements of nums1 by +1 or -1 at most k1 times. Similarly, you can modify any of the elements of nums2 by +1 or -1 at most k2 times.

+ +

Return the minimum sum of squared difference after modifying array nums1 at most k1 times and modifying array nums2 at most k2 times.

+ +

Note: You are allowed to modify the array elements to become negative integers.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0
+Output: 579
+Explanation: The elements in nums1 and nums2 cannot be modified because k1 = 0 and k2 = 0. 
+The sum of square difference will be: (1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1
+Output: 43
+Explanation: One way to obtain the minimum sum of square difference is: 
+- Increase nums1[0] once.
+- Increase nums2[2] once.
+The minimum of the sum of square difference will be: 
+(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43.
+Note that, there are other ways to obtain the minimum of the sum of square difference, but there is no way to obtain a sum smaller than 43.
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= nums1[i], nums2[i] <= 105
    • +
  • 0 <= k1, k2 <= 109
    • +
+",2.0,False,"class Solution { +public: + long long minSumSquareDiff(vector& nums1, vector& nums2, int k1, int k2) { + + } +};","class Solution { + public long minSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) { + + } +}","class Solution(object): + def minSumSquareDiff(self, nums1, nums2, k1, k2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type k1: int + :type k2: int + :rtype: int + """""" + ","class Solution: + def minSumSquareDiff(self, nums1: List[int], nums2: List[int], k1: int, k2: int) -> int: + ","long long minSumSquareDiff(int* nums1, int nums1Size, int* nums2, int nums2Size, int k1, int k2){ + +}","public class Solution { + public long MinSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k1 + * @param {number} k2 + * @return {number} + */ +var minSumSquareDiff = function(nums1, nums2, k1, k2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} k1 +# @param {Integer} k2 +# @return {Integer} +def min_sum_square_diff(nums1, nums2, k1, k2) + +end","class Solution { + func minSumSquareDiff(_ nums1: [Int], _ nums2: [Int], _ k1: Int, _ k2: Int) -> Int { + + } +}","func minSumSquareDiff(nums1 []int, nums2 []int, k1 int, k2 int) int64 { + +}","object Solution { + def minSumSquareDiff(nums1: Array[Int], nums2: Array[Int], k1: Int, k2: Int): Long = { + + } +}","class Solution { + fun minSumSquareDiff(nums1: IntArray, nums2: IntArray, k1: Int, k2: Int): Long { + + } +}","impl Solution { + pub fn min_sum_square_diff(nums1: Vec, nums2: Vec, k1: i32, k2: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $k1 + * @param Integer $k2 + * @return Integer + */ + function minSumSquareDiff($nums1, $nums2, $k1, $k2) { + + } +}","function minSumSquareDiff(nums1: number[], nums2: number[], k1: number, k2: number): number { + +};","(define/contract (min-sum-square-diff nums1 nums2 k1 k2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec min_sum_square_diff(Nums1 :: [integer()], Nums2 :: [integer()], K1 :: integer(), K2 :: integer()) -> integer(). +min_sum_square_diff(Nums1, Nums2, K1, K2) -> + .","defmodule Solution do + @spec min_sum_square_diff(nums1 :: [integer], nums2 :: [integer], k1 :: integer, k2 :: integer) :: integer + def min_sum_square_diff(nums1, nums2, k1, k2) do + + end +end","class Solution { + int minSumSquareDiff(List nums1, List nums2, int k1, int k2) { + + } +}", +344,count-the-number-of-ideal-arrays,Count the Number of Ideal Arrays,2338.0,2415.0,"

You are given two integers n and maxValue, which are used to describe an ideal array.

+ +

A 0-indexed integer array arr of length n is considered ideal if the following conditions hold:

+ +
    +
  • Every arr[i] is a value from 1 to maxValue, for 0 <= i < n.
    • +
  • Every arr[i] is divisible by arr[i - 1], for 0 < i < n.
    • +
+ +

Return the number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2, maxValue = 5
+Output: 10
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (5 arrays): [1,1], [1,2], [1,3], [1,4], [1,5]
+- Arrays starting with the value 2 (2 arrays): [2,2], [2,4]
+- Arrays starting with the value 3 (1 array): [3,3]
+- Arrays starting with the value 4 (1 array): [4,4]
+- Arrays starting with the value 5 (1 array): [5,5]
+There are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.
+
+ +

Example 2:

+ +
+Input: n = 5, maxValue = 3
+Output: 11
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (9 arrays): 
+   - With no other distinct values (1 array): [1,1,1,1,1] 
+   - With 2nd distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
+   - With 2nd distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
+- Arrays starting with the value 2 (1 array): [2,2,2,2,2]
+- Arrays starting with the value 3 (1 array): [3,3,3,3,3]
+There are a total of 9 + 1 + 1 = 11 distinct ideal arrays.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 104
    • +
  • 1 <= maxValue <= 104
    • +
+",3.0,False,"class Solution { +public: + int idealArrays(int n, int maxValue) { + + } +};","class Solution { + public int idealArrays(int n, int maxValue) { + + } +}","class Solution(object): + def idealArrays(self, n, maxValue): + """""" + :type n: int + :type maxValue: int + :rtype: int + """""" + ","class Solution: + def idealArrays(self, n: int, maxValue: int) -> int: + ","int idealArrays(int n, int maxValue){ + +}","public class Solution { + public int IdealArrays(int n, int maxValue) { + + } +}","/** + * @param {number} n + * @param {number} maxValue + * @return {number} + */ +var idealArrays = function(n, maxValue) { + +};","# @param {Integer} n +# @param {Integer} max_value +# @return {Integer} +def ideal_arrays(n, max_value) + +end","class Solution { + func idealArrays(_ n: Int, _ maxValue: Int) -> Int { + + } +}","func idealArrays(n int, maxValue int) int { + +}","object Solution { + def idealArrays(n: Int, maxValue: Int): Int = { + + } +}","class Solution { + fun idealArrays(n: Int, maxValue: Int): Int { + + } +}","impl Solution { + pub fn ideal_arrays(n: i32, max_value: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $maxValue + * @return Integer + */ + function idealArrays($n, $maxValue) { + + } +}","function idealArrays(n: number, maxValue: number): number { + +};","(define/contract (ideal-arrays n maxValue) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec ideal_arrays(N :: integer(), MaxValue :: integer()) -> integer(). +ideal_arrays(N, MaxValue) -> + .","defmodule Solution do + @spec ideal_arrays(n :: integer, max_value :: integer) :: integer + def ideal_arrays(n, max_value) do + + end +end","class Solution { + int idealArrays(int n, int maxValue) { + + } +}", +349,number-of-increasing-paths-in-a-grid,Number of Increasing Paths in a Grid,2328.0,2409.0,"

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

+ +

Return the number of strictly increasing paths in the grid such that you can start from any cell and end at any cell. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two paths are considered different if they do not have exactly the same sequence of visited cells.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1],[3,4]]
+Output: 8
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [1], [3], [4].
+- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].
+- Paths with length 3: [1 -> 3 -> 4].
+The total number of paths is 4 + 3 + 1 = 8.
+
+ +

Example 2:

+ +
+Input: grid = [[1],[2]]
+Output: 3
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [2].
+- Paths with length 2: [1 -> 2].
+The total number of paths is 2 + 1 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 1000
    • +
  • 1 <= m * n <= 105
    • +
  • 1 <= grid[i][j] <= 105
    • +
+",3.0,False,"class Solution { +public: + int countPaths(vector>& grid) { + + } +};","class Solution { + public int countPaths(int[][] grid) { + + } +}","class Solution(object): + def countPaths(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def countPaths(self, grid: List[List[int]]) -> int: + ","int countPaths(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int CountPaths(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var countPaths = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def count_paths(grid) + +end","class Solution { + func countPaths(_ grid: [[Int]]) -> Int { + + } +}","func countPaths(grid [][]int) int { + +}","object Solution { + def countPaths(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun countPaths(grid: Array): Int { + + } +}","impl Solution { + pub fn count_paths(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function countPaths($grid) { + + } +}","function countPaths(grid: number[][]): number { + +};","(define/contract (count-paths grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec count_paths(Grid :: [[integer()]]) -> integer(). +count_paths(Grid) -> + .","defmodule Solution do + @spec count_paths(grid :: [[integer]]) :: integer + def count_paths(grid) do + + end +end","class Solution { + int countPaths(List> grid) { + + } +}", +351,decode-the-message,Decode the Message,2325.0,2406.0,"

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

+ +
    +
  1. Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table.
    2. +
  2. Align the substitution table with the regular English alphabet.
    3. +
  3. Each letter in message is then substituted using the table.
    4. +
  4. Spaces ' ' are transformed to themselves.
    5. +
+ +
    +
  • For example, given key = "happy boy" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').
    • +
+ +

Return the decoded message.

+ +

 

+

Example 1:

+ +
+Input: key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"
+Output: "this is a secret"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "the quick brown fox jumps over the lazy dog".
+
+ +

Example 2:

+ +
+Input: key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
+Output: "the five boxing wizards jump quickly"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "eljuxhpwnyrdgtqkviszcfmabo".
+
+ +

 

+

Constraints:

+ +
    +
  • 26 <= key.length <= 2000
    • +
  • key consists of lowercase English letters and ' '.
    • +
  • key contains every letter in the English alphabet ('a' to 'z') at least once.
    • +
  • 1 <= message.length <= 2000
    • +
  • message consists of lowercase English letters and ' '.
    • +
+",1.0,False,"class Solution { +public: + string decodeMessage(string key, string message) { + + } +};","class Solution { + public String decodeMessage(String key, String message) { + + } +}","class Solution(object): + def decodeMessage(self, key, message): + """""" + :type key: str + :type message: str + :rtype: str + """""" + ","class Solution: + def decodeMessage(self, key: str, message: str) -> str: + ","char * decodeMessage(char * key, char * message){ + +}","public class Solution { + public string DecodeMessage(string key, string message) { + + } +}","/** + * @param {string} key + * @param {string} message + * @return {string} + */ +var decodeMessage = function(key, message) { + +};","# @param {String} key +# @param {String} message +# @return {String} +def decode_message(key, message) + +end","class Solution { + func decodeMessage(_ key: String, _ message: String) -> String { + + } +}","func decodeMessage(key string, message string) string { + +}","object Solution { + def decodeMessage(key: String, message: String): String = { + + } +}","class Solution { + fun decodeMessage(key: String, message: String): String { + + } +}","impl Solution { + pub fn decode_message(key: String, message: String) -> String { + + } +}","class Solution { + + /** + * @param String $key + * @param String $message + * @return String + */ + function decodeMessage($key, $message) { + + } +}","function decodeMessage(key: string, message: string): string { + +};","(define/contract (decode-message key message) + (-> string? string? string?) + + )","-spec decode_message(Key :: unicode:unicode_binary(), Message :: unicode:unicode_binary()) -> unicode:unicode_binary(). +decode_message(Key, Message) -> + .","defmodule Solution do + @spec decode_message(key :: String.t, message :: String.t) :: String.t + def decode_message(key, message) do + + end +end","class Solution { + String decodeMessage(String key, String message) { + + } +}", +352,number-of-distinct-roll-sequences,Number of Distinct Roll Sequences,2318.0,2404.0,"

You are given an integer n. You roll a fair 6-sided dice n times. Determine the total number of distinct sequences of rolls possible such that the following conditions are satisfied:

+ +
    +
  1. The greatest common divisor of any adjacent values in the sequence is equal to 1.
    2. +
  2. There is at least a gap of 2 rolls between equal valued rolls. More formally, if the value of the ith roll is equal to the value of the jth roll, then abs(i - j) > 2.
    3. +
+ +

Return the total number of distinct sequences possible. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two sequences are considered distinct if at least one element is different.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 184
+Explanation: Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.
+Some invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).
+(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).
+(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.
+There are a total of 184 distinct sequences possible, so we return 184.
+ +

Example 2:

+ +
+Input: n = 2
+Output: 22
+Explanation: Some of the possible sequences are (1, 2), (2, 1), (3, 2).
+Some invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.
+There are a total of 22 distinct sequences possible, so we return 22.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",3.0,False,"class Solution { +public: + int distinctSequences(int n) { + + } +};","class Solution { + public int distinctSequences(int n) { + + } +}","class Solution(object): + def distinctSequences(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def distinctSequences(self, n: int) -> int: + ","int distinctSequences(int n){ + +}","public class Solution { + public int DistinctSequences(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var distinctSequences = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def distinct_sequences(n) + +end","class Solution { + func distinctSequences(_ n: Int) -> Int { + + } +}","func distinctSequences(n int) int { + +}","object Solution { + def distinctSequences(n: Int): Int = { + + } +}","class Solution { + fun distinctSequences(n: Int): Int { + + } +}","impl Solution { + pub fn distinct_sequences(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function distinctSequences($n) { + + } +}","function distinctSequences(n: number): number { + +};","(define/contract (distinct-sequences n) + (-> exact-integer? exact-integer?) + + )","-spec distinct_sequences(N :: integer()) -> integer(). +distinct_sequences(N) -> + .","defmodule Solution do + @spec distinct_sequences(n :: integer) :: integer + def distinct_sequences(n) do + + end +end","class Solution { + int distinctSequences(int n) { + + } +}", +354,maximum-xor-after-operations,Maximum XOR After Operations ,2317.0,2402.0,"

You are given a 0-indexed integer array nums. In one operation, select any non-negative integer x and an index i, then update nums[i] to be equal to nums[i] AND (nums[i] XOR x).

+ +

Note that AND is the bitwise AND operation and XOR is the bitwise XOR operation.

+ +

Return the maximum possible bitwise XOR of all elements of nums after applying the operation any number of times.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,4,6]
+Output: 7
+Explanation: Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.
+Now, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.
+It can be shown that 7 is the maximum possible bitwise XOR.
+Note that other operations may be used to achieve a bitwise XOR of 7.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,9,2]
+Output: 11
+Explanation: Apply the operation zero times.
+The bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.
+It can be shown that 11 is the maximum possible bitwise XOR.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 108
    • +
+",2.0,False,"class Solution { +public: + int maximumXOR(vector& nums) { + + } +};","class Solution { + public int maximumXOR(int[] nums) { + + } +}","class Solution(object): + def maximumXOR(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maximumXOR(self, nums: List[int]) -> int: + ","int maximumXOR(int* nums, int numsSize){ + +}","public class Solution { + public int MaximumXOR(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maximumXOR = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def maximum_xor(nums) + +end","class Solution { + func maximumXOR(_ nums: [Int]) -> Int { + + } +}","func maximumXOR(nums []int) int { + +}","object Solution { + def maximumXOR(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maximumXOR(nums: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_xor(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maximumXOR($nums) { + + } +}","function maximumXOR(nums: number[]): number { + +};","(define/contract (maximum-xor nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_xor(Nums :: [integer()]) -> integer(). +maximum_xor(Nums) -> + .","defmodule Solution do + @spec maximum_xor(nums :: [integer]) :: integer + def maximum_xor(nums) do + + end +end","class Solution { + int maximumXOR(List nums) { + + } +}", +356,minimum-score-after-removals-on-a-tree,Minimum Score After Removals on a Tree,2322.0,2400.0,"

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

+ +

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

+ +
    +
  1. Get the XOR of all the values of the nodes for each of the three components respectively.
    2. +
  2. The difference between the largest XOR value and the smallest XOR value is the score of the pair.
    3. +
+ +
    +
  • For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.
    • +
+ +

Return the minimum score of any possible pair of edge removals on the given tree.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]
+Output: 9
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.
+- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.
+- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.
+The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.
+It can be shown that no other pair of removals will obtain a smaller score than 9.
+
+ +

Example 2:

+ +
+Input: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]
+Output: 0
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.
+- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.
+- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.
+The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.
+We cannot obtain a smaller score than 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 3 <= n <= 1000
    • +
  • 1 <= nums[i] <= 108
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • edges represents a valid tree.
    • +
+",3.0,False,"class Solution { +public: + int minimumScore(vector& nums, vector>& edges) { + + } +};","class Solution { + public int minimumScore(int[] nums, int[][] edges) { + + } +}","class Solution(object): + def minimumScore(self, nums, edges): + """""" + :type nums: List[int] + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumScore(self, nums: List[int], edges: List[List[int]]) -> int: + ","int minimumScore(int* nums, int numsSize, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int MinimumScore(int[] nums, int[][] edges) { + + } +}","/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number} + */ +var minimumScore = function(nums, edges) { + +};","# @param {Integer[]} nums +# @param {Integer[][]} edges +# @return {Integer} +def minimum_score(nums, edges) + +end","class Solution { + func minimumScore(_ nums: [Int], _ edges: [[Int]]) -> Int { + + } +}","func minimumScore(nums []int, edges [][]int) int { + +}","object Solution { + def minimumScore(nums: Array[Int], edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumScore(nums: IntArray, edges: Array): Int { + + } +}","impl Solution { + pub fn minimum_score(nums: Vec, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[][] $edges + * @return Integer + */ + function minimumScore($nums, $edges) { + + } +}","function minimumScore(nums: number[], edges: number[][]): number { + +};","(define/contract (minimum-score nums edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_score(Nums :: [integer()], Edges :: [[integer()]]) -> integer(). +minimum_score(Nums, Edges) -> + .","defmodule Solution do + @spec minimum_score(nums :: [integer], edges :: [[integer]]) :: integer + def minimum_score(nums, edges) do + + end +end","class Solution { + int minimumScore(List nums, List> edges) { + + } +}", +358,count-number-of-ways-to-place-houses,Count Number of Ways to Place Houses,2320.0,2397.0,"

There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed.

+ +

Return the number of ways houses can be placed such that no two houses are adjacent to each other on the same side of the street. Since the answer may be very large, return it modulo 109 + 7.

+ +

Note that if a house is placed on the ith plot on one side of the street, a house can also be placed on the ith plot on the other side of the street.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 4
+Explanation: 
+Possible arrangements:
+1. All plots are empty.
+2. A house is placed on one side of the street.
+3. A house is placed on the other side of the street.
+4. Two houses are placed, one on each side of the street.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 9
+Explanation: The 9 possible arrangements are shown in the diagram above.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",2.0,False,"class Solution { +public: + int countHousePlacements(int n) { + + } +};","class Solution { + public int countHousePlacements(int n) { + + } +}","class Solution(object): + def countHousePlacements(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countHousePlacements(self, n: int) -> int: + ","int countHousePlacements(int n){ + +}","public class Solution { + public int CountHousePlacements(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countHousePlacements = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_house_placements(n) + +end","class Solution { + func countHousePlacements(_ n: Int) -> Int { + + } +}","func countHousePlacements(n int) int { + +}","object Solution { + def countHousePlacements(n: Int): Int = { + + } +}","class Solution { + fun countHousePlacements(n: Int): Int { + + } +}","impl Solution { + pub fn count_house_placements(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countHousePlacements($n) { + + } +}","function countHousePlacements(n: number): number { + +};","(define/contract (count-house-placements n) + (-> exact-integer? exact-integer?) + + )","-spec count_house_placements(N :: integer()) -> integer(). +count_house_placements(N) -> + .","defmodule Solution do + @spec count_house_placements(n :: integer) :: integer + def count_house_placements(n) do + + end +end","class Solution { + int countHousePlacements(int n) { + + } +}", +360,count-subarrays-with-score-less-than-k,Count Subarrays With Score Less Than K,2302.0,2394.0,"

The score of an array is defined as the product of its sum and its length.

+ +
    +
  • For example, the score of [1, 2, 3, 4, 5] is (1 + 2 + 3 + 4 + 5) * 5 = 75.
    • +
+ +

Given a positive integer array nums and an integer k, return the number of non-empty subarrays of nums whose score is strictly less than k.

+ +

A subarray is a contiguous sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,4,3,5], k = 10
+Output: 6
+Explanation:
+The 6 subarrays having scores less than 10 are:
+- [2] with score 2 * 1 = 2.
+- [1] with score 1 * 1 = 1.
+- [4] with score 4 * 1 = 4.
+- [3] with score 3 * 1 = 3. 
+- [5] with score 5 * 1 = 5.
+- [2,1] with score (2 + 1) * 2 = 6.
+Note that subarrays such as [1,4] and [4,3,5] are not considered because their scores are 10 and 36 respectively, while we need scores strictly less than 10.
+ +

Example 2:

+ +
+Input: nums = [1,1,1], k = 5
+Output: 5
+Explanation:
+Every subarray except [1,1,1] has a score less than 5.
+[1,1,1] has a score (1 + 1 + 1) * 3 = 9, which is greater than 5.
+Thus, there are 5 subarrays having scores less than 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
  • 1 <= k <= 1015
    • +
+",3.0,False,"class Solution { +public: + long long countSubarrays(vector& nums, long long k) { + + } +};","class Solution { + public long countSubarrays(int[] nums, long k) { + + } +}","class Solution(object): + def countSubarrays(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countSubarrays(self, nums: List[int], k: int) -> int: + ","long long countSubarrays(int* nums, int numsSize, long long k){ + +}","public class Solution { + public long CountSubarrays(int[] nums, long k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countSubarrays = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_subarrays(nums, k) + +end","class Solution { + func countSubarrays(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countSubarrays(nums []int, k int64) int64 { + +}","object Solution { + def countSubarrays(nums: Array[Int], k: Long): Long = { + + } +}","class Solution { + fun countSubarrays(nums: IntArray, k: Long): Long { + + } +}","impl Solution { + pub fn count_subarrays(nums: Vec, k: i64) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countSubarrays($nums, $k) { + + } +}","function countSubarrays(nums: number[], k: number): number { + +};","(define/contract (count-subarrays nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_subarrays(Nums :: [integer()], K :: integer()) -> integer(). +count_subarrays(Nums, K) -> + .","defmodule Solution do + @spec count_subarrays(nums :: [integer], k :: integer) :: integer + def count_subarrays(nums, k) do + + end +end","class Solution { + int countSubarrays(List nums, int k) { + + } +}", +361,match-substring-after-replacement,Match Substring After Replacement,2301.0,2393.0,"

You are given two strings s and sub. You are also given a 2D character array mappings where mappings[i] = [oldi, newi] indicates that you may perform the following operation any number of times:

+ +
    +
  • Replace a character oldi of sub with newi.
    • +
+ +

Each character in sub cannot be replaced more than once.

+ +

Return true if it is possible to make sub a substring of s by replacing zero or more characters according to mappings. Otherwise, return false.

+ +

A substring is a contiguous non-empty sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "fool3e7bar", sub = "leet", mappings = [["e","3"],["t","7"],["t","8"]]
+Output: true
+Explanation: Replace the first 'e' in sub with '3' and 't' in sub with '7'.
+Now sub = "l3e7" is a substring of s, so we return true.
+ +

Example 2:

+ +
+Input: s = "fooleetbar", sub = "f00l", mappings = [["o","0"]]
+Output: false
+Explanation: The string "f00l" is not a substring of s and no replacements can be made.
+Note that we cannot replace '0' with 'o'.
+
+ +

Example 3:

+ +
+Input: s = "Fool33tbaR", sub = "leetd", mappings = [["e","3"],["t","7"],["t","8"],["d","b"],["p","b"]]
+Output: true
+Explanation: Replace the first and second 'e' in sub with '3' and 'd' in sub with 'b'.
+Now sub = "l33tb" is a substring of s, so we return true.
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= sub.length <= s.length <= 5000
    • +
  • 0 <= mappings.length <= 1000
    • +
  • mappings[i].length == 2
    • +
  • oldi != newi
    • +
  • s and sub consist of uppercase and lowercase English letters and digits.
    • +
  • oldi and newi are either uppercase or lowercase English letters or digits.
    • +
+",3.0,False,"class Solution { +public: + bool matchReplacement(string s, string sub, vector>& mappings) { + + } +};","class Solution { + public boolean matchReplacement(String s, String sub, char[][] mappings) { + + } +}","class Solution(object): + def matchReplacement(self, s, sub, mappings): + """""" + :type s: str + :type sub: str + :type mappings: List[List[str]] + :rtype: bool + """""" + ","class Solution: + def matchReplacement(self, s: str, sub: str, mappings: List[List[str]]) -> bool: + ","bool matchReplacement(char * s, char * sub, char** mappings, int mappingsSize, int* mappingsColSize){ + +}","public class Solution { + public bool MatchReplacement(string s, string sub, char[][] mappings) { + + } +}","/** + * @param {string} s + * @param {string} sub + * @param {character[][]} mappings + * @return {boolean} + */ +var matchReplacement = function(s, sub, mappings) { + +};","# @param {String} s +# @param {String} sub +# @param {Character[][]} mappings +# @return {Boolean} +def match_replacement(s, sub, mappings) + +end","class Solution { + func matchReplacement(_ s: String, _ sub: String, _ mappings: [[Character]]) -> Bool { + + } +}","func matchReplacement(s string, sub string, mappings [][]byte) bool { + +}","object Solution { + def matchReplacement(s: String, sub: String, mappings: Array[Array[Char]]): Boolean = { + + } +}","class Solution { + fun matchReplacement(s: String, sub: String, mappings: Array): Boolean { + + } +}","impl Solution { + pub fn match_replacement(s: String, sub: String, mappings: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $sub + * @param String[][] $mappings + * @return Boolean + */ + function matchReplacement($s, $sub, $mappings) { + + } +}","function matchReplacement(s: string, sub: string, mappings: string[][]): boolean { + +};","(define/contract (match-replacement s sub mappings) + (-> string? string? (listof (listof char?)) boolean?) + + )","-spec match_replacement(S :: unicode:unicode_binary(), Sub :: unicode:unicode_binary(), Mappings :: [[char()]]) -> boolean(). +match_replacement(S, Sub, Mappings) -> + .","defmodule Solution do + @spec match_replacement(s :: String.t, sub :: String.t, mappings :: [[char]]) :: boolean + def match_replacement(s, sub, mappings) do + + end +end","class Solution { + bool matchReplacement(String s, String sub, List> mappings) { + + } +}", +364,naming-a-company,Naming a Company,2306.0,2390.0,"

You are given an array of strings ideas that represents a list of names to be used in the process of naming a company. The process of naming a company is as follows:

+ +
    +
  1. Choose 2 distinct names from ideas, call them ideaA and ideaB.
    2. +
  2. Swap the first letters of ideaA and ideaB with each other.
    3. +
  3. If both of the new names are not found in the original ideas, then the name ideaA ideaB (the concatenation of ideaA and ideaB, separated by a space) is a valid company name.
    4. +
  4. Otherwise, it is not a valid name.
    5. +
+ +

Return the number of distinct valid names for the company.

+ +

 

+

Example 1:

+ +
+Input: ideas = ["coffee","donuts","time","toffee"]
+Output: 6
+Explanation: The following selections are valid:
+- ("coffee", "donuts"): The company name created is "doffee conuts".
+- ("donuts", "coffee"): The company name created is "conuts doffee".
+- ("donuts", "time"): The company name created is "tonuts dime".
+- ("donuts", "toffee"): The company name created is "tonuts doffee".
+- ("time", "donuts"): The company name created is "dime tonuts".
+- ("toffee", "donuts"): The company name created is "doffee tonuts".
+Therefore, there are a total of 6 distinct company names.
+
+The following are some examples of invalid selections:
+- ("coffee", "time"): The name "toffee" formed after swapping already exists in the original array.
+- ("time", "toffee"): Both names are still the same after swapping and exist in the original array.
+- ("coffee", "toffee"): Both names formed after swapping already exist in the original array.
+
+ +

Example 2:

+ +
+Input: ideas = ["lack","back"]
+Output: 0
+Explanation: There are no valid selections. Therefore, 0 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= ideas.length <= 5 * 104
    • +
  • 1 <= ideas[i].length <= 10
    • +
  • ideas[i] consists of lowercase English letters.
    • +
  • All the strings in ideas are unique.
    • +
+",3.0,False,"class Solution { +public: + long long distinctNames(vector& ideas) { + + } +};","class Solution { + public long distinctNames(String[] ideas) { + + } +}","class Solution(object): + def distinctNames(self, ideas): + """""" + :type ideas: List[str] + :rtype: int + """""" + ","class Solution: + def distinctNames(self, ideas: List[str]) -> int: + ","long long distinctNames(char ** ideas, int ideasSize){ + +}","public class Solution { + public long DistinctNames(string[] ideas) { + + } +}","/** + * @param {string[]} ideas + * @return {number} + */ +var distinctNames = function(ideas) { + +};","# @param {String[]} ideas +# @return {Integer} +def distinct_names(ideas) + +end","class Solution { + func distinctNames(_ ideas: [String]) -> Int { + + } +}","func distinctNames(ideas []string) int64 { + +}","object Solution { + def distinctNames(ideas: Array[String]): Long = { + + } +}","class Solution { + fun distinctNames(ideas: Array): Long { + + } +}","impl Solution { + pub fn distinct_names(ideas: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param String[] $ideas + * @return Integer + */ + function distinctNames($ideas) { + + } +}","function distinctNames(ideas: string[]): number { + +};","(define/contract (distinct-names ideas) + (-> (listof string?) exact-integer?) + + )","-spec distinct_names(Ideas :: [unicode:unicode_binary()]) -> integer(). +distinct_names(Ideas) -> + .","defmodule Solution do + @spec distinct_names(ideas :: [String.t]) :: integer + def distinct_names(ideas) do + + end +end","class Solution { + int distinctNames(List ideas) { + + } +}", +365,design-a-text-editor,Design a Text Editor,2296.0,2389.0,"

Design a text editor with a cursor that can do the following:

+ +
    +
  • Add text to where the cursor is.
    • +
  • Delete text from where the cursor is (simulating the backspace key).
    • +
  • Move the cursor either left or right.
    • +
+ +

When deleting text, only characters to the left of the cursor will be deleted. The cursor will also remain within the actual text and cannot be moved beyond it. More formally, we have that 0 <= cursor.position <= currentText.length always holds.

+ +

Implement the TextEditor class:

+ +
    +
  • TextEditor() Initializes the object with empty text.
    • +
  • void addText(string text) Appends text to where the cursor is. The cursor ends to the right of text.
    • +
  • int deleteText(int k) Deletes k characters to the left of the cursor. Returns the number of characters actually deleted.
    • +
  • string cursorLeft(int k) Moves the cursor to the left k times. Returns the last min(10, len) characters to the left of the cursor, where len is the number of characters to the left of the cursor.
    • +
  • string cursorRight(int k) Moves the cursor to the right k times. Returns the last min(10, len) characters to the left of the cursor, where len is the number of characters to the left of the cursor.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["TextEditor", "addText", "deleteText", "addText", "cursorRight", "cursorLeft", "deleteText", "cursorLeft", "cursorRight"]
+[[], ["leetcode"], [4], ["practice"], [3], [8], [10], [2], [6]]
+Output
+[null, null, 4, null, "etpractice", "leet", 4, "", "practi"]
+
+Explanation
+TextEditor textEditor = new TextEditor(); // The current text is "|". (The '|' character represents the cursor)
+textEditor.addText("leetcode"); // The current text is "leetcode|".
+textEditor.deleteText(4); // return 4
+                          // The current text is "leet|". 
+                          // 4 characters were deleted.
+textEditor.addText("practice"); // The current text is "leetpractice|". 
+textEditor.cursorRight(3); // return "etpractice"
+                           // The current text is "leetpractice|". 
+                           // The cursor cannot be moved beyond the actual text and thus did not move.
+                           // "etpractice" is the last 10 characters to the left of the cursor.
+textEditor.cursorLeft(8); // return "leet"
+                          // The current text is "leet|practice".
+                          // "leet" is the last min(10, 4) = 4 characters to the left of the cursor.
+textEditor.deleteText(10); // return 4
+                           // The current text is "|practice".
+                           // Only 4 characters were deleted.
+textEditor.cursorLeft(2); // return ""
+                          // The current text is "|practice".
+                          // The cursor cannot be moved beyond the actual text and thus did not move. 
+                          // "" is the last min(10, 0) = 0 characters to the left of the cursor.
+textEditor.cursorRight(6); // return "practi"
+                           // The current text is "practi|ce".
+                           // "practi" is the last min(10, 6) = 6 characters to the left of the cursor.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= text.length, k <= 40
    • +
  • text consists of lowercase English letters.
    • +
  • At most 2 * 104 calls in total will be made to addText, deleteText, cursorLeft and cursorRight.
    • +
+ +

 

+

Follow-up: Could you find a solution with time complexity of O(k) per call?

+",3.0,False,"class TextEditor { +public: + TextEditor() { + + } + + void addText(string text) { + + } + + int deleteText(int k) { + + } + + string cursorLeft(int k) { + + } + + string cursorRight(int k) { + + } +}; + +/** + * Your TextEditor object will be instantiated and called as such: + * TextEditor* obj = new TextEditor(); + * obj->addText(text); + * int param_2 = obj->deleteText(k); + * string param_3 = obj->cursorLeft(k); + * string param_4 = obj->cursorRight(k); + */","class TextEditor { + + public TextEditor() { + + } + + public void addText(String text) { + + } + + public int deleteText(int k) { + + } + + public String cursorLeft(int k) { + + } + + public String cursorRight(int k) { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * TextEditor obj = new TextEditor(); + * obj.addText(text); + * int param_2 = obj.deleteText(k); + * String param_3 = obj.cursorLeft(k); + * String param_4 = obj.cursorRight(k); + */","class TextEditor(object): + + def __init__(self): + + + def addText(self, text): + """""" + :type text: str + :rtype: None + """""" + + + def deleteText(self, k): + """""" + :type k: int + :rtype: int + """""" + + + def cursorLeft(self, k): + """""" + :type k: int + :rtype: str + """""" + + + def cursorRight(self, k): + """""" + :type k: int + :rtype: str + """""" + + + +# Your TextEditor object will be instantiated and called as such: +# obj = TextEditor() +# obj.addText(text) +# param_2 = obj.deleteText(k) +# param_3 = obj.cursorLeft(k) +# param_4 = obj.cursorRight(k)","class TextEditor: + + def __init__(self): + + + def addText(self, text: str) -> None: + + + def deleteText(self, k: int) -> int: + + + def cursorLeft(self, k: int) -> str: + + + def cursorRight(self, k: int) -> str: + + + +# Your TextEditor object will be instantiated and called as such: +# obj = TextEditor() +# obj.addText(text) +# param_2 = obj.deleteText(k) +# param_3 = obj.cursorLeft(k) +# param_4 = obj.cursorRight(k)"," + + +typedef struct { + +} TextEditor; + + +TextEditor* textEditorCreate() { + +} + +void textEditorAddText(TextEditor* obj, char * text) { + +} + +int textEditorDeleteText(TextEditor* obj, int k) { + +} + +char * textEditorCursorLeft(TextEditor* obj, int k) { + +} + +char * textEditorCursorRight(TextEditor* obj, int k) { + +} + +void textEditorFree(TextEditor* obj) { + +} + +/** + * Your TextEditor struct will be instantiated and called as such: + * TextEditor* obj = textEditorCreate(); + * textEditorAddText(obj, text); + + * int param_2 = textEditorDeleteText(obj, k); + + * char * param_3 = textEditorCursorLeft(obj, k); + + * char * param_4 = textEditorCursorRight(obj, k); + + * textEditorFree(obj); +*/","public class TextEditor { + + public TextEditor() { + + } + + public void AddText(string text) { + + } + + public int DeleteText(int k) { + + } + + public string CursorLeft(int k) { + + } + + public string CursorRight(int k) { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * TextEditor obj = new TextEditor(); + * obj.AddText(text); + * int param_2 = obj.DeleteText(k); + * string param_3 = obj.CursorLeft(k); + * string param_4 = obj.CursorRight(k); + */"," +var TextEditor = function() { + +}; + +/** + * @param {string} text + * @return {void} + */ +TextEditor.prototype.addText = function(text) { + +}; + +/** + * @param {number} k + * @return {number} + */ +TextEditor.prototype.deleteText = function(k) { + +}; + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorLeft = function(k) { + +}; + +/** + * @param {number} k + * @return {string} + */ +TextEditor.prototype.cursorRight = function(k) { + +}; + +/** + * Your TextEditor object will be instantiated and called as such: + * var obj = new TextEditor() + * obj.addText(text) + * var param_2 = obj.deleteText(k) + * var param_3 = obj.cursorLeft(k) + * var param_4 = obj.cursorRight(k) + */","class TextEditor + def initialize() + + end + + +=begin + :type text: String + :rtype: Void +=end + def add_text(text) + + end + + +=begin + :type k: Integer + :rtype: Integer +=end + def delete_text(k) + + end + + +=begin + :type k: Integer + :rtype: String +=end + def cursor_left(k) + + end + + +=begin + :type k: Integer + :rtype: String +=end + def cursor_right(k) + + end + + +end + +# Your TextEditor object will be instantiated and called as such: +# obj = TextEditor.new() +# obj.add_text(text) +# param_2 = obj.delete_text(k) +# param_3 = obj.cursor_left(k) +# param_4 = obj.cursor_right(k)"," +class TextEditor { + + init() { + + } + + func addText(_ text: String) { + + } + + func deleteText(_ k: Int) -> Int { + + } + + func cursorLeft(_ k: Int) -> String { + + } + + func cursorRight(_ k: Int) -> String { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * let obj = TextEditor() + * obj.addText(text) + * let ret_2: Int = obj.deleteText(k) + * let ret_3: String = obj.cursorLeft(k) + * let ret_4: String = obj.cursorRight(k) + */","type TextEditor struct { + +} + + +func Constructor() TextEditor { + +} + + +func (this *TextEditor) AddText(text string) { + +} + + +func (this *TextEditor) DeleteText(k int) int { + +} + + +func (this *TextEditor) CursorLeft(k int) string { + +} + + +func (this *TextEditor) CursorRight(k int) string { + +} + + +/** + * Your TextEditor object will be instantiated and called as such: + * obj := Constructor(); + * obj.AddText(text); + * param_2 := obj.DeleteText(k); + * param_3 := obj.CursorLeft(k); + * param_4 := obj.CursorRight(k); + */","class TextEditor() { + + def addText(text: String) { + + } + + def deleteText(k: Int): Int = { + + } + + def cursorLeft(k: Int): String = { + + } + + def cursorRight(k: Int): String = { + + } + +} + +/** + * Your TextEditor object will be instantiated and called as such: + * var obj = new TextEditor() + * obj.addText(text) + * var param_2 = obj.deleteText(k) + * var param_3 = obj.cursorLeft(k) + * var param_4 = obj.cursorRight(k) + */","class TextEditor() { + + fun addText(text: String) { + + } + + fun deleteText(k: Int): Int { + + } + + fun cursorLeft(k: Int): String { + + } + + fun cursorRight(k: Int): String { + + } + +} + +/** + * Your TextEditor object will be instantiated and called as such: + * var obj = TextEditor() + * obj.addText(text) + * var param_2 = obj.deleteText(k) + * var param_3 = obj.cursorLeft(k) + * var param_4 = obj.cursorRight(k) + */","struct TextEditor { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl TextEditor { + + fn new() -> Self { + + } + + fn add_text(&self, text: String) { + + } + + fn delete_text(&self, k: i32) -> i32 { + + } + + fn cursor_left(&self, k: i32) -> String { + + } + + fn cursor_right(&self, k: i32) -> String { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * let obj = TextEditor::new(); + * obj.add_text(text); + * let ret_2: i32 = obj.delete_text(k); + * let ret_3: String = obj.cursor_left(k); + * let ret_4: String = obj.cursor_right(k); + */","class TextEditor { + /** + */ + function __construct() { + + } + + /** + * @param String $text + * @return NULL + */ + function addText($text) { + + } + + /** + * @param Integer $k + * @return Integer + */ + function deleteText($k) { + + } + + /** + * @param Integer $k + * @return String + */ + function cursorLeft($k) { + + } + + /** + * @param Integer $k + * @return String + */ + function cursorRight($k) { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * $obj = TextEditor(); + * $obj->addText($text); + * $ret_2 = $obj->deleteText($k); + * $ret_3 = $obj->cursorLeft($k); + * $ret_4 = $obj->cursorRight($k); + */","class TextEditor { + constructor() { + + } + + addText(text: string): void { + + } + + deleteText(k: number): number { + + } + + cursorLeft(k: number): string { + + } + + cursorRight(k: number): string { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * var obj = new TextEditor() + * obj.addText(text) + * var param_2 = obj.deleteText(k) + * var param_3 = obj.cursorLeft(k) + * var param_4 = obj.cursorRight(k) + */","(define text-editor% + (class object% + (super-new) + + (init-field) + + ; add-text : string? -> void? + (define/public (add-text text) + + ) + ; delete-text : exact-integer? -> exact-integer? + (define/public (delete-text k) + + ) + ; cursor-left : exact-integer? -> string? + (define/public (cursor-left k) + + ) + ; cursor-right : exact-integer? -> string? + (define/public (cursor-right k) + + ))) + +;; Your text-editor% object will be instantiated and called as such: +;; (define obj (new text-editor%)) +;; (send obj add-text text) +;; (define param_2 (send obj delete-text k)) +;; (define param_3 (send obj cursor-left k)) +;; (define param_4 (send obj cursor-right k))","-spec text_editor_init_() -> any(). +text_editor_init_() -> + . + +-spec text_editor_add_text(Text :: unicode:unicode_binary()) -> any(). +text_editor_add_text(Text) -> + . + +-spec text_editor_delete_text(K :: integer()) -> integer(). +text_editor_delete_text(K) -> + . + +-spec text_editor_cursor_left(K :: integer()) -> unicode:unicode_binary(). +text_editor_cursor_left(K) -> + . + +-spec text_editor_cursor_right(K :: integer()) -> unicode:unicode_binary(). +text_editor_cursor_right(K) -> + . + + +%% Your functions will be called as such: +%% text_editor_init_(), +%% text_editor_add_text(Text), +%% Param_2 = text_editor_delete_text(K), +%% Param_3 = text_editor_cursor_left(K), +%% Param_4 = text_editor_cursor_right(K), + +%% text_editor_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule TextEditor do + @spec init_() :: any + def init_() do + + end + + @spec add_text(text :: String.t) :: any + def add_text(text) do + + end + + @spec delete_text(k :: integer) :: integer + def delete_text(k) do + + end + + @spec cursor_left(k :: integer) :: String.t + def cursor_left(k) do + + end + + @spec cursor_right(k :: integer) :: String.t + def cursor_right(k) do + + end +end + +# Your functions will be called as such: +# TextEditor.init_() +# TextEditor.add_text(text) +# param_2 = TextEditor.delete_text(k) +# param_3 = TextEditor.cursor_left(k) +# param_4 = TextEditor.cursor_right(k) + +# TextEditor.init_ will be called before every test case, in which you can do some necessary initializations.","class TextEditor { + + TextEditor() { + + } + + void addText(String text) { + + } + + int deleteText(int k) { + + } + + String cursorLeft(int k) { + + } + + String cursorRight(int k) { + + } +} + +/** + * Your TextEditor object will be instantiated and called as such: + * TextEditor obj = TextEditor(); + * obj.addText(text); + * int param2 = obj.deleteText(k); + * String param3 = obj.cursorLeft(k); + * String param4 = obj.cursorRight(k); + */", +367,partition-array-such-that-maximum-difference-is-k,Partition Array Such That Maximum Difference Is K,2294.0,2387.0,"

You are given an integer array nums and an integer k. You may partition nums into one or more subsequences such that each element in nums appears in exactly one of the subsequences.

+ +

Return the minimum number of subsequences needed such that the difference between the maximum and minimum values in each subsequence is at most k.

+ +

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,6,1,2,5], k = 2
+Output: 2
+Explanation:
+We can partition nums into the two subsequences [3,1,2] and [6,5].
+The difference between the maximum and minimum value in the first subsequence is 3 - 1 = 2.
+The difference between the maximum and minimum value in the second subsequence is 6 - 5 = 1.
+Since two subsequences were created, we return 2. It can be shown that 2 is the minimum number of subsequences needed.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3], k = 1
+Output: 2
+Explanation:
+We can partition nums into the two subsequences [1,2] and [3].
+The difference between the maximum and minimum value in the first subsequence is 2 - 1 = 1.
+The difference between the maximum and minimum value in the second subsequence is 3 - 3 = 0.
+Since two subsequences were created, we return 2. Note that another optimal solution is to partition nums into the two subsequences [1] and [2,3].
+
+ +

Example 3:

+ +
+Input: nums = [2,2,4,5], k = 0
+Output: 3
+Explanation:
+We can partition nums into the three subsequences [2,2], [4], and [5].
+The difference between the maximum and minimum value in the first subsequences is 2 - 2 = 0.
+The difference between the maximum and minimum value in the second subsequences is 4 - 4 = 0.
+The difference between the maximum and minimum value in the third subsequences is 5 - 5 = 0.
+Since three subsequences were created, we return 3. It can be shown that 3 is the minimum number of subsequences needed.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 105
    • +
  • 0 <= k <= 105
    • +
+",2.0,False,"class Solution { +public: + int partitionArray(vector& nums, int k) { + + } +};","class Solution { + public int partitionArray(int[] nums, int k) { + + } +}","class Solution(object): + def partitionArray(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def partitionArray(self, nums: List[int], k: int) -> int: + ","int partitionArray(int* nums, int numsSize, int k){ + +}","public class Solution { + public int PartitionArray(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var partitionArray = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def partition_array(nums, k) + +end","class Solution { + func partitionArray(_ nums: [Int], _ k: Int) -> Int { + + } +}","func partitionArray(nums []int, k int) int { + +}","object Solution { + def partitionArray(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun partitionArray(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn partition_array(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function partitionArray($nums, $k) { + + } +}","function partitionArray(nums: number[], k: number): number { + +};","(define/contract (partition-array nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec partition_array(Nums :: [integer()], K :: integer()) -> integer(). +partition_array(Nums, K) -> + .","defmodule Solution do + @spec partition_array(nums :: [integer], k :: integer) :: integer + def partition_array(nums, k) do + + end +end","class Solution { + int partitionArray(List nums, int k) { + + } +}", +371,booking-concert-tickets-in-groups,Booking Concert Tickets in Groups,2286.0,2380.0,"

A concert hall has n rows numbered from 0 to n - 1, each with m seats, numbered from 0 to m - 1. You need to design a ticketing system that can allocate seats in the following cases:

+ +
    +
  • If a group of k spectators can sit together in a row.
    • +
  • If every member of a group of k spectators can get a seat. They may or may not sit together.
    • +
+ +

Note that the spectators are very picky. Hence:

+ +
    +
  • They will book seats only if each member of their group can get a seat with row number less than or equal to maxRow. maxRow can vary from group to group.
    • +
  • In case there are multiple rows to choose from, the row with the smallest number is chosen. If there are multiple seats to choose in the same row, the seat with the smallest number is chosen.
    • +
+ +

Implement the BookMyShow class:

+ +
    +
  • BookMyShow(int n, int m) Initializes the object with n as number of rows and m as number of seats per row.
    • +
  • int[] gather(int k, int maxRow) Returns an array of length 2 denoting the row and seat number (respectively) of the first seat being allocated to the k members of the group, who must sit together. In other words, it returns the smallest possible r and c such that all [c, c + k - 1] seats are valid and empty in row r, and r <= maxRow. Returns [] in case it is not possible to allocate seats to the group.
    • +
  • boolean scatter(int k, int maxRow) Returns true if all k members of the group can be allocated seats in rows 0 to maxRow, who may or may not sit together. If the seats can be allocated, it allocates k seats to the group with the smallest row numbers, and the smallest possible seat numbers in each row. Otherwise, returns false.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["BookMyShow", "gather", "gather", "scatter", "scatter"]
+[[2, 5], [4, 0], [2, 0], [5, 1], [5, 1]]
+Output
+[null, [0, 0], [], true, false]
+
+Explanation
+BookMyShow bms = new BookMyShow(2, 5); // There are 2 rows with 5 seats each 
+bms.gather(4, 0); // return [0, 0]
+                  // The group books seats [0, 3] of row 0. 
+bms.gather(2, 0); // return []
+                  // There is only 1 seat left in row 0,
+                  // so it is not possible to book 2 consecutive seats. 
+bms.scatter(5, 1); // return True
+                   // The group books seat 4 of row 0 and seats [0, 3] of row 1. 
+bms.scatter(5, 1); // return False
+                   // There is only one seat left in the hall.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 5 * 104
    • +
  • 1 <= m, k <= 109
    • +
  • 0 <= maxRow <= n - 1
    • +
  • At most 5 * 104 calls in total will be made to gather and scatter.
    • +
+",3.0,False,"class BookMyShow { +public: + BookMyShow(int n, int m) { + + } + + vector gather(int k, int maxRow) { + + } + + bool scatter(int k, int maxRow) { + + } +}; + +/** + * Your BookMyShow object will be instantiated and called as such: + * BookMyShow* obj = new BookMyShow(n, m); + * vector param_1 = obj->gather(k,maxRow); + * bool param_2 = obj->scatter(k,maxRow); + */","class BookMyShow { + + public BookMyShow(int n, int m) { + + } + + public int[] gather(int k, int maxRow) { + + } + + public boolean scatter(int k, int maxRow) { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * BookMyShow obj = new BookMyShow(n, m); + * int[] param_1 = obj.gather(k,maxRow); + * boolean param_2 = obj.scatter(k,maxRow); + */","class BookMyShow(object): + + def __init__(self, n, m): + """""" + :type n: int + :type m: int + """""" + + + def gather(self, k, maxRow): + """""" + :type k: int + :type maxRow: int + :rtype: List[int] + """""" + + + def scatter(self, k, maxRow): + """""" + :type k: int + :type maxRow: int + :rtype: bool + """""" + + + +# Your BookMyShow object will be instantiated and called as such: +# obj = BookMyShow(n, m) +# param_1 = obj.gather(k,maxRow) +# param_2 = obj.scatter(k,maxRow)","class BookMyShow: + + def __init__(self, n: int, m: int): + + + def gather(self, k: int, maxRow: int) -> List[int]: + + + def scatter(self, k: int, maxRow: int) -> bool: + + + +# Your BookMyShow object will be instantiated and called as such: +# obj = BookMyShow(n, m) +# param_1 = obj.gather(k,maxRow) +# param_2 = obj.scatter(k,maxRow)"," + + +typedef struct { + +} BookMyShow; + + +BookMyShow* bookMyShowCreate(int n, int m) { + +} + +int* bookMyShowGather(BookMyShow* obj, int k, int maxRow, int* retSize) { + +} + +bool bookMyShowScatter(BookMyShow* obj, int k, int maxRow) { + +} + +void bookMyShowFree(BookMyShow* obj) { + +} + +/** + * Your BookMyShow struct will be instantiated and called as such: + * BookMyShow* obj = bookMyShowCreate(n, m); + * int* param_1 = bookMyShowGather(obj, k, maxRow, retSize); + + * bool param_2 = bookMyShowScatter(obj, k, maxRow); + + * bookMyShowFree(obj); +*/","public class BookMyShow { + + public BookMyShow(int n, int m) { + + } + + public int[] Gather(int k, int maxRow) { + + } + + public bool Scatter(int k, int maxRow) { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * BookMyShow obj = new BookMyShow(n, m); + * int[] param_1 = obj.Gather(k,maxRow); + * bool param_2 = obj.Scatter(k,maxRow); + */","/** + * @param {number} n + * @param {number} m + */ +var BookMyShow = function(n, m) { + +}; + +/** + * @param {number} k + * @param {number} maxRow + * @return {number[]} + */ +BookMyShow.prototype.gather = function(k, maxRow) { + +}; + +/** + * @param {number} k + * @param {number} maxRow + * @return {boolean} + */ +BookMyShow.prototype.scatter = function(k, maxRow) { + +}; + +/** + * Your BookMyShow object will be instantiated and called as such: + * var obj = new BookMyShow(n, m) + * var param_1 = obj.gather(k,maxRow) + * var param_2 = obj.scatter(k,maxRow) + */","class BookMyShow + +=begin + :type n: Integer + :type m: Integer +=end + def initialize(n, m) + + end + + +=begin + :type k: Integer + :type max_row: Integer + :rtype: Integer[] +=end + def gather(k, max_row) + + end + + +=begin + :type k: Integer + :type max_row: Integer + :rtype: Boolean +=end + def scatter(k, max_row) + + end + + +end + +# Your BookMyShow object will be instantiated and called as such: +# obj = BookMyShow.new(n, m) +# param_1 = obj.gather(k, max_row) +# param_2 = obj.scatter(k, max_row)"," +class BookMyShow { + + init(_ n: Int, _ m: Int) { + + } + + func gather(_ k: Int, _ maxRow: Int) -> [Int] { + + } + + func scatter(_ k: Int, _ maxRow: Int) -> Bool { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * let obj = BookMyShow(n, m) + * let ret_1: [Int] = obj.gather(k, maxRow) + * let ret_2: Bool = obj.scatter(k, maxRow) + */","type BookMyShow struct { + +} + + +func Constructor(n int, m int) BookMyShow { + +} + + +func (this *BookMyShow) Gather(k int, maxRow int) []int { + +} + + +func (this *BookMyShow) Scatter(k int, maxRow int) bool { + +} + + +/** + * Your BookMyShow object will be instantiated and called as such: + * obj := Constructor(n, m); + * param_1 := obj.Gather(k,maxRow); + * param_2 := obj.Scatter(k,maxRow); + */","class BookMyShow(_n: Int, _m: Int) { + + def gather(k: Int, maxRow: Int): Array[Int] = { + + } + + def scatter(k: Int, maxRow: Int): Boolean = { + + } + +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * var obj = new BookMyShow(n, m) + * var param_1 = obj.gather(k,maxRow) + * var param_2 = obj.scatter(k,maxRow) + */","class BookMyShow(n: Int, m: Int) { + + fun gather(k: Int, maxRow: Int): IntArray { + + } + + fun scatter(k: Int, maxRow: Int): Boolean { + + } + +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * var obj = BookMyShow(n, m) + * var param_1 = obj.gather(k,maxRow) + * var param_2 = obj.scatter(k,maxRow) + */","struct BookMyShow { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl BookMyShow { + + fn new(n: i32, m: i32) -> Self { + + } + + fn gather(&self, k: i32, max_row: i32) -> Vec { + + } + + fn scatter(&self, k: i32, max_row: i32) -> bool { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * let obj = BookMyShow::new(n, m); + * let ret_1: Vec = obj.gather(k, maxRow); + * let ret_2: bool = obj.scatter(k, maxRow); + */","class BookMyShow { + /** + * @param Integer $n + * @param Integer $m + */ + function __construct($n, $m) { + + } + + /** + * @param Integer $k + * @param Integer $maxRow + * @return Integer[] + */ + function gather($k, $maxRow) { + + } + + /** + * @param Integer $k + * @param Integer $maxRow + * @return Boolean + */ + function scatter($k, $maxRow) { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * $obj = BookMyShow($n, $m); + * $ret_1 = $obj->gather($k, $maxRow); + * $ret_2 = $obj->scatter($k, $maxRow); + */","class BookMyShow { + constructor(n: number, m: number) { + + } + + gather(k: number, maxRow: number): number[] { + + } + + scatter(k: number, maxRow: number): boolean { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * var obj = new BookMyShow(n, m) + * var param_1 = obj.gather(k,maxRow) + * var param_2 = obj.scatter(k,maxRow) + */","(define book-my-show% + (class object% + (super-new) + + ; n : exact-integer? + ; m : exact-integer? + (init-field + n + m) + + ; gather : exact-integer? exact-integer? -> (listof exact-integer?) + (define/public (gather k max-row) + + ) + ; scatter : exact-integer? exact-integer? -> boolean? + (define/public (scatter k max-row) + + ))) + +;; Your book-my-show% object will be instantiated and called as such: +;; (define obj (new book-my-show% [n n] [m m])) +;; (define param_1 (send obj gather k max-row)) +;; (define param_2 (send obj scatter k max-row))","-spec book_my_show_init_(N :: integer(), M :: integer()) -> any(). +book_my_show_init_(N, M) -> + . + +-spec book_my_show_gather(K :: integer(), MaxRow :: integer()) -> [integer()]. +book_my_show_gather(K, MaxRow) -> + . + +-spec book_my_show_scatter(K :: integer(), MaxRow :: integer()) -> boolean(). +book_my_show_scatter(K, MaxRow) -> + . + + +%% Your functions will be called as such: +%% book_my_show_init_(N, M), +%% Param_1 = book_my_show_gather(K, MaxRow), +%% Param_2 = book_my_show_scatter(K, MaxRow), + +%% book_my_show_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule BookMyShow do + @spec init_(n :: integer, m :: integer) :: any + def init_(n, m) do + + end + + @spec gather(k :: integer, max_row :: integer) :: [integer] + def gather(k, max_row) do + + end + + @spec scatter(k :: integer, max_row :: integer) :: boolean + def scatter(k, max_row) do + + end +end + +# Your functions will be called as such: +# BookMyShow.init_(n, m) +# param_1 = BookMyShow.gather(k, max_row) +# param_2 = BookMyShow.scatter(k, max_row) + +# BookMyShow.init_ will be called before every test case, in which you can do some necessary initializations.","class BookMyShow { + + BookMyShow(int n, int m) { + + } + + List gather(int k, int maxRow) { + + } + + bool scatter(int k, int maxRow) { + + } +} + +/** + * Your BookMyShow object will be instantiated and called as such: + * BookMyShow obj = BookMyShow(n, m); + * List param1 = obj.gather(k,maxRow); + * bool param2 = obj.scatter(k,maxRow); + */", +373,sender-with-largest-word-count,Sender With Largest Word Count,2284.0,2378.0,"

You have a chat log of n messages. You are given two string arrays messages and senders where messages[i] is a message sent by senders[i].

+ +

A message is list of words that are separated by a single space with no leading or trailing spaces. The word count of a sender is the total number of words sent by the sender. Note that a sender may send more than one message.

+ +

Return the sender with the largest word count. If there is more than one sender with the largest word count, return the one with the lexicographically largest name.

+ +

Note:

+ +
    +
  • Uppercase letters come before lowercase letters in lexicographical order.
    • +
  • "Alice" and "alice" are distinct.
    • +
+ +

 

+

Example 1:

+ +
+Input: messages = ["Hello userTwooo","Hi userThree","Wonderful day Alice","Nice day userThree"], senders = ["Alice","userTwo","userThree","Alice"]
+Output: "Alice"
+Explanation: Alice sends a total of 2 + 3 = 5 words.
+userTwo sends a total of 2 words.
+userThree sends a total of 3 words.
+Since Alice has the largest word count, we return "Alice".
+
+ +

Example 2:

+ +
+Input: messages = ["How is leetcode for everyone","Leetcode is useful for practice"], senders = ["Bob","Charlie"]
+Output: "Charlie"
+Explanation: Bob sends a total of 5 words.
+Charlie sends a total of 5 words.
+Since there is a tie for the largest word count, we return the sender with the lexicographically larger name, Charlie.
+ +

 

+

Constraints:

+ +
    +
  • n == messages.length == senders.length
    • +
  • 1 <= n <= 104
    • +
  • 1 <= messages[i].length <= 100
    • +
  • 1 <= senders[i].length <= 10
    • +
  • messages[i] consists of uppercase and lowercase English letters and ' '.
    • +
  • All the words in messages[i] are separated by a single space.
    • +
  • messages[i] does not have leading or trailing spaces.
    • +
  • senders[i] consists of uppercase and lowercase English letters only.
    • +
+",2.0,False,"class Solution { +public: + string largestWordCount(vector& messages, vector& senders) { + + } +};","class Solution { + public String largestWordCount(String[] messages, String[] senders) { + + } +}","class Solution(object): + def largestWordCount(self, messages, senders): + """""" + :type messages: List[str] + :type senders: List[str] + :rtype: str + """""" + ","class Solution: + def largestWordCount(self, messages: List[str], senders: List[str]) -> str: + ","char * largestWordCount(char ** messages, int messagesSize, char ** senders, int sendersSize){ + +}","public class Solution { + public string LargestWordCount(string[] messages, string[] senders) { + + } +}","/** + * @param {string[]} messages + * @param {string[]} senders + * @return {string} + */ +var largestWordCount = function(messages, senders) { + +};","# @param {String[]} messages +# @param {String[]} senders +# @return {String} +def largest_word_count(messages, senders) + +end","class Solution { + func largestWordCount(_ messages: [String], _ senders: [String]) -> String { + + } +}","func largestWordCount(messages []string, senders []string) string { + +}","object Solution { + def largestWordCount(messages: Array[String], senders: Array[String]): String = { + + } +}","class Solution { + fun largestWordCount(messages: Array, senders: Array): String { + + } +}","impl Solution { + pub fn largest_word_count(messages: Vec, senders: Vec) -> String { + + } +}","class Solution { + + /** + * @param String[] $messages + * @param String[] $senders + * @return String + */ + function largestWordCount($messages, $senders) { + + } +}","function largestWordCount(messages: string[], senders: string[]): string { + +};","(define/contract (largest-word-count messages senders) + (-> (listof string?) (listof string?) string?) + + )","-spec largest_word_count(Messages :: [unicode:unicode_binary()], Senders :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +largest_word_count(Messages, Senders) -> + .","defmodule Solution do + @spec largest_word_count(messages :: [String.t], senders :: [String.t]) :: String.t + def largest_word_count(messages, senders) do + + end +end","class Solution { + String largestWordCount(List messages, List senders) { + + } +}", +375,minimum-obstacle-removal-to-reach-corner,Minimum Obstacle Removal to Reach Corner,2290.0,2375.0,"

You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values:

+ +
    +
  • 0 represents an empty cell,
    • +
  • 1 represents an obstacle that may be removed.
    • +
+ +

You can move up, down, left, or right from and to an empty cell.

+ +

Return the minimum number of obstacles to remove so you can move from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1).

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,1],[1,1,0],[1,1,0]]
+Output: 2
+Explanation: We can remove the obstacles at (0, 1) and (0, 2) to create a path from (0, 0) to (2, 2).
+It can be shown that we need to remove at least 2 obstacles, so we return 2.
+Note that there may be other ways to remove 2 obstacles to create a path.
+
+ +

Example 2:

+ +
+Input: grid = [[0,1,0,0,0],[0,1,0,1,0],[0,0,0,1,0]]
+Output: 0
+Explanation: We can move from (0, 0) to (2, 4) without removing any obstacles, so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 105
    • +
  • 2 <= m * n <= 105
    • +
  • grid[i][j] is either 0 or 1.
    • +
  • grid[0][0] == grid[m - 1][n - 1] == 0
    • +
+",3.0,False,"class Solution { +public: + int minimumObstacles(vector>& grid) { + + } +};","class Solution { + public int minimumObstacles(int[][] grid) { + + } +}","class Solution(object): + def minimumObstacles(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumObstacles(self, grid: List[List[int]]) -> int: + ","int minimumObstacles(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinimumObstacles(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minimumObstacles = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def minimum_obstacles(grid) + +end","class Solution { + func minimumObstacles(_ grid: [[Int]]) -> Int { + + } +}","func minimumObstacles(grid [][]int) int { + +}","object Solution { + def minimumObstacles(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumObstacles(grid: Array): Int { + + } +}","impl Solution { + pub fn minimum_obstacles(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minimumObstacles($grid) { + + } +}","function minimumObstacles(grid: number[][]): number { + +};","(define/contract (minimum-obstacles grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_obstacles(Grid :: [[integer()]]) -> integer(). +minimum_obstacles(Grid) -> + .","defmodule Solution do + @spec minimum_obstacles(grid :: [[integer]]) :: integer + def minimum_obstacles(grid) do + + end +end","class Solution { + int minimumObstacles(List> grid) { + + } +}", +379,sum-of-total-strength-of-wizards,Sum of Total Strength of Wizards,2281.0,2368.0,"

As the ruler of a kingdom, you have an army of wizards at your command.

+ +

You are given a 0-indexed integer array strength, where strength[i] denotes the strength of the ith wizard. For a contiguous group of wizards (i.e. the wizards' strengths form a subarray of strength), the total strength is defined as the product of the following two values:

+ +
    +
  • The strength of the weakest wizard in the group.
    • +
  • The total of all the individual strengths of the wizards in the group.
    • +
+ +

Return the sum of the total strengths of all contiguous groups of wizards. Since the answer may be very large, return it modulo 109 + 7.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: strength = [1,3,1,2]
+Output: 44
+Explanation: The following are all the contiguous groups of wizards:
+- [1] from [1,3,1,2] has a total strength of min([1]) * sum([1]) = 1 * 1 = 1
+- [3] from [1,3,1,2] has a total strength of min([3]) * sum([3]) = 3 * 3 = 9
+- [1] from [1,3,1,2] has a total strength of min([1]) * sum([1]) = 1 * 1 = 1
+- [2] from [1,3,1,2] has a total strength of min([2]) * sum([2]) = 2 * 2 = 4
+- [1,3] from [1,3,1,2] has a total strength of min([1,3]) * sum([1,3]) = 1 * 4 = 4
+- [3,1] from [1,3,1,2] has a total strength of min([3,1]) * sum([3,1]) = 1 * 4 = 4
+- [1,2] from [1,3,1,2] has a total strength of min([1,2]) * sum([1,2]) = 1 * 3 = 3
+- [1,3,1] from [1,3,1,2] has a total strength of min([1,3,1]) * sum([1,3,1]) = 1 * 5 = 5
+- [3,1,2] from [1,3,1,2] has a total strength of min([3,1,2]) * sum([3,1,2]) = 1 * 6 = 6
+- [1,3,1,2] from [1,3,1,2] has a total strength of min([1,3,1,2]) * sum([1,3,1,2]) = 1 * 7 = 7
+The sum of all the total strengths is 1 + 9 + 1 + 4 + 4 + 4 + 3 + 5 + 6 + 7 = 44.
+
+ +

Example 2:

+ +
+Input: strength = [5,4,6]
+Output: 213
+Explanation: The following are all the contiguous groups of wizards: 
+- [5] from [5,4,6] has a total strength of min([5]) * sum([5]) = 5 * 5 = 25
+- [4] from [5,4,6] has a total strength of min([4]) * sum([4]) = 4 * 4 = 16
+- [6] from [5,4,6] has a total strength of min([6]) * sum([6]) = 6 * 6 = 36
+- [5,4] from [5,4,6] has a total strength of min([5,4]) * sum([5,4]) = 4 * 9 = 36
+- [4,6] from [5,4,6] has a total strength of min([4,6]) * sum([4,6]) = 4 * 10 = 40
+- [5,4,6] from [5,4,6] has a total strength of min([5,4,6]) * sum([5,4,6]) = 4 * 15 = 60
+The sum of all the total strengths is 25 + 16 + 36 + 36 + 40 + 60 = 213.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= strength.length <= 105
    • +
  • 1 <= strength[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int totalStrength(vector& strength) { + + } +};","class Solution { + public int totalStrength(int[] strength) { + + } +}","class Solution(object): + def totalStrength(self, strength): + """""" + :type strength: List[int] + :rtype: int + """""" + ","class Solution: + def totalStrength(self, strength: List[int]) -> int: + ","int totalStrength(int* strength, int strengthSize){ + +}","public class Solution { + public int TotalStrength(int[] strength) { + + } +}","/** + * @param {number[]} strength + * @return {number} + */ +var totalStrength = function(strength) { + +};","# @param {Integer[]} strength +# @return {Integer} +def total_strength(strength) + +end","class Solution { + func totalStrength(_ strength: [Int]) -> Int { + + } +}","func totalStrength(strength []int) int { + +}","object Solution { + def totalStrength(strength: Array[Int]): Int = { + + } +}","class Solution { + fun totalStrength(strength: IntArray): Int { + + } +}","impl Solution { + pub fn total_strength(strength: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $strength + * @return Integer + */ + function totalStrength($strength) { + + } +}","function totalStrength(strength: number[]): number { + +};","(define/contract (total-strength strength) + (-> (listof exact-integer?) exact-integer?) + + )","-spec total_strength(Strength :: [integer()]) -> integer(). +total_strength(Strength) -> + .","defmodule Solution do + @spec total_strength(strength :: [integer]) :: integer + def total_strength(strength) do + + end +end","class Solution { + int totalStrength(List strength) { + + } +}", +381,maximum-bags-with-full-capacity-of-rocks,Maximum Bags With Full Capacity of Rocks,2279.0,2366.0,"

You have n bags numbered from 0 to n - 1. You are given two 0-indexed integer arrays capacity and rocks. The ith bag can hold a maximum of capacity[i] rocks and currently contains rocks[i] rocks. You are also given an integer additionalRocks, the number of additional rocks you can place in any of the bags.

+ +

Return the maximum number of bags that could have full capacity after placing the additional rocks in some bags.

+ +

 

+

Example 1:

+ +
+Input: capacity = [2,3,4,5], rocks = [1,2,4,4], additionalRocks = 2
+Output: 3
+Explanation:
+Place 1 rock in bag 0 and 1 rock in bag 1.
+The number of rocks in each bag are now [2,3,4,4].
+Bags 0, 1, and 2 have full capacity.
+There are 3 bags at full capacity, so we return 3.
+It can be shown that it is not possible to have more than 3 bags at full capacity.
+Note that there may be other ways of placing the rocks that result in an answer of 3.
+
+ +

Example 2:

+ +
+Input: capacity = [10,2,2], rocks = [2,2,0], additionalRocks = 100
+Output: 3
+Explanation:
+Place 8 rocks in bag 0 and 2 rocks in bag 2.
+The number of rocks in each bag are now [10,2,2].
+Bags 0, 1, and 2 have full capacity.
+There are 3 bags at full capacity, so we return 3.
+It can be shown that it is not possible to have more than 3 bags at full capacity.
+Note that we did not use all of the additional rocks.
+
+ +

 

+

Constraints:

+ +
    +
  • n == capacity.length == rocks.length
    • +
  • 1 <= n <= 5 * 104
    • +
  • 1 <= capacity[i] <= 109
    • +
  • 0 <= rocks[i] <= capacity[i]
    • +
  • 1 <= additionalRocks <= 109
    • +
+",2.0,False,"class Solution { +public: + int maximumBags(vector& capacity, vector& rocks, int additionalRocks) { + + } +};","class Solution { + public int maximumBags(int[] capacity, int[] rocks, int additionalRocks) { + + } +}","class Solution(object): + def maximumBags(self, capacity, rocks, additionalRocks): + """""" + :type capacity: List[int] + :type rocks: List[int] + :type additionalRocks: int + :rtype: int + """""" + ","class Solution: + def maximumBags(self, capacity: List[int], rocks: List[int], additionalRocks: int) -> int: + ","int maximumBags(int* capacity, int capacitySize, int* rocks, int rocksSize, int additionalRocks){ + +}","public class Solution { + public int MaximumBags(int[] capacity, int[] rocks, int additionalRocks) { + + } +}","/** + * @param {number[]} capacity + * @param {number[]} rocks + * @param {number} additionalRocks + * @return {number} + */ +var maximumBags = function(capacity, rocks, additionalRocks) { + +};","# @param {Integer[]} capacity +# @param {Integer[]} rocks +# @param {Integer} additional_rocks +# @return {Integer} +def maximum_bags(capacity, rocks, additional_rocks) + +end","class Solution { + func maximumBags(_ capacity: [Int], _ rocks: [Int], _ additionalRocks: Int) -> Int { + + } +}","func maximumBags(capacity []int, rocks []int, additionalRocks int) int { + +}","object Solution { + def maximumBags(capacity: Array[Int], rocks: Array[Int], additionalRocks: Int): Int = { + + } +}","class Solution { + fun maximumBags(capacity: IntArray, rocks: IntArray, additionalRocks: Int): Int { + + } +}","impl Solution { + pub fn maximum_bags(capacity: Vec, rocks: Vec, additional_rocks: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $capacity + * @param Integer[] $rocks + * @param Integer $additionalRocks + * @return Integer + */ + function maximumBags($capacity, $rocks, $additionalRocks) { + + } +}","function maximumBags(capacity: number[], rocks: number[], additionalRocks: number): number { + +};","(define/contract (maximum-bags capacity rocks additionalRocks) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_bags(Capacity :: [integer()], Rocks :: [integer()], AdditionalRocks :: integer()) -> integer(). +maximum_bags(Capacity, Rocks, AdditionalRocks) -> + .","defmodule Solution do + @spec maximum_bags(capacity :: [integer], rocks :: [integer], additional_rocks :: integer) :: integer + def maximum_bags(capacity, rocks, additional_rocks) do + + end +end","class Solution { + int maximumBags(List capacity, List rocks, int additionalRocks) { + + } +}", +383,longest-path-with-different-adjacent-characters,Longest Path With Different Adjacent Characters,2246.0,2364.0,"

You are given a tree (i.e. a connected, undirected graph that has no cycles) rooted at node 0 consisting of n nodes numbered from 0 to n - 1. The tree is represented by a 0-indexed array parent of size n, where parent[i] is the parent of node i. Since node 0 is the root, parent[0] == -1.

+ +

You are also given a string s of length n, where s[i] is the character assigned to node i.

+ +

Return the length of the longest path in the tree such that no pair of adjacent nodes on the path have the same character assigned to them.

+ +

 

+

Example 1:

+ +
+Input: parent = [-1,0,0,1,1,2], s = "abacbe"
+Output: 3
+Explanation: The longest path where each two adjacent nodes have different characters in the tree is the path: 0 -> 1 -> 3. The length of this path is 3, so 3 is returned.
+It can be proven that there is no longer path that satisfies the conditions. 
+
+ +

Example 2:

+ +
+Input: parent = [-1,0,0,0], s = "aabc"
+Output: 3
+Explanation: The longest path where each two adjacent nodes have different characters is the path: 2 -> 0 -> 3. The length of this path is 3, so 3 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • n == parent.length == s.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= parent[i] <= n - 1 for all i >= 1
    • +
  • parent[0] == -1
    • +
  • parent represents a valid tree.
    • +
  • s consists of only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int longestPath(vector& parent, string s) { + + } +};","class Solution { + public int longestPath(int[] parent, String s) { + + } +}","class Solution(object): + def longestPath(self, parent, s): + """""" + :type parent: List[int] + :type s: str + :rtype: int + """""" + ","class Solution: + def longestPath(self, parent: List[int], s: str) -> int: + ","int longestPath(int* parent, int parentSize, char * s){ + +}","public class Solution { + public int LongestPath(int[] parent, string s) { + + } +}","/** + * @param {number[]} parent + * @param {string} s + * @return {number} + */ +var longestPath = function(parent, s) { + +};","# @param {Integer[]} parent +# @param {String} s +# @return {Integer} +def longest_path(parent, s) + +end","class Solution { + func longestPath(_ parent: [Int], _ s: String) -> Int { + + } +}","func longestPath(parent []int, s string) int { + +}","object Solution { + def longestPath(parent: Array[Int], s: String): Int = { + + } +}","class Solution { + fun longestPath(parent: IntArray, s: String): Int { + + } +}","impl Solution { + pub fn longest_path(parent: Vec, s: String) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $parent + * @param String $s + * @return Integer + */ + function longestPath($parent, $s) { + + } +}","function longestPath(parent: number[], s: string): number { + +};","(define/contract (longest-path parent s) + (-> (listof exact-integer?) string? exact-integer?) + + )","-spec longest_path(Parent :: [integer()], S :: unicode:unicode_binary()) -> integer(). +longest_path(Parent, S) -> + .","defmodule Solution do + @spec longest_path(parent :: [integer], s :: String.t) :: integer + def longest_path(parent, s) do + + end +end","class Solution { + int longestPath(List parent, String s) { + + } +}", +384,maximum-trailing-zeros-in-a-cornered-path,Maximum Trailing Zeros in a Cornered Path,2245.0,2363.0,"

You are given a 2D integer array grid of size m x n, where each cell contains a positive integer.

+ +

A cornered path is defined as a set of adjacent cells with at most one turn. More specifically, the path should exclusively move either horizontally or vertically up to the turn (if there is one), without returning to a previously visited cell. After the turn, the path will then move exclusively in the alternate direction: move vertically if it moved horizontally, and vice versa, also without returning to a previously visited cell.

+ +

The product of a path is defined as the product of all the values in the path.

+ +

Return the maximum number of trailing zeros in the product of a cornered path found in grid.

+ +

Note:

+ +
    +
  • Horizontal movement means moving in either the left or right direction.
    • +
  • Vertical movement means moving in either the up or down direction.
    • +
+ +

 

+

Example 1:

+ +
+Input: grid = [[23,17,15,3,20],[8,1,20,27,11],[9,4,6,2,21],[40,9,1,10,6],[22,7,4,5,3]]
+Output: 3
+Explanation: The grid on the left shows a valid cornered path.
+It has a product of 15 * 20 * 6 * 1 * 10 = 18000 which has 3 trailing zeros.
+It can be shown that this is the maximum trailing zeros in the product of a cornered path.
+
+The grid in the middle is not a cornered path as it has more than one turn.
+The grid on the right is not a cornered path as it requires a return to a previously visited cell.
+
+ +

Example 2:

+ +
+Input: grid = [[4,3,2],[7,6,1],[8,8,8]]
+Output: 0
+Explanation: The grid is shown in the figure above.
+There are no cornered paths in the grid that result in a product with a trailing zero.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 105
    • +
  • 1 <= grid[i][j] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int maxTrailingZeros(vector>& grid) { + + } +};","class Solution { + public int maxTrailingZeros(int[][] grid) { + + } +}","class Solution(object): + def maxTrailingZeros(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxTrailingZeros(self, grid: List[List[int]]) -> int: + ","int maxTrailingZeros(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaxTrailingZeros(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maxTrailingZeros = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def max_trailing_zeros(grid) + +end","class Solution { + func maxTrailingZeros(_ grid: [[Int]]) -> Int { + + } +}","func maxTrailingZeros(grid [][]int) int { + +}","object Solution { + def maxTrailingZeros(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxTrailingZeros(grid: Array): Int { + + } +}","impl Solution { + pub fn max_trailing_zeros(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maxTrailingZeros($grid) { + + } +}","function maxTrailingZeros(grid: number[][]): number { + +};","(define/contract (max-trailing-zeros grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_trailing_zeros(Grid :: [[integer()]]) -> integer(). +max_trailing_zeros(Grid) -> + .","defmodule Solution do + @spec max_trailing_zeros(grid :: [[integer]]) :: integer + def max_trailing_zeros(grid) do + + end +end","class Solution { + int maxTrailingZeros(List> grid) { + + } +}", +387,substring-with-largest-variance,Substring With Largest Variance,2272.0,2360.0,"

The variance of a string is defined as the largest difference between the number of occurrences of any 2 characters present in the string. Note the two characters may or may not be the same.

+ +

Given a string s consisting of lowercase English letters only, return the largest variance possible among all substrings of s.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "aababbb"
+Output: 3
+Explanation:
+All possible variances along with their respective substrings are listed below:
+- Variance 0 for substrings "a", "aa", "ab", "abab", "aababb", "ba", "b", "bb", and "bbb".
+- Variance 1 for substrings "aab", "aba", "abb", "aabab", "ababb", "aababbb", and "bab".
+- Variance 2 for substrings "aaba", "ababbb", "abbb", and "babb".
+- Variance 3 for substring "babbb".
+Since the largest possible variance is 3, we return it.
+
+ +

Example 2:

+ +
+Input: s = "abcde"
+Output: 0
+Explanation:
+No letter occurs more than once in s, so the variance of every substring is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int largestVariance(string s) { + + } +};","class Solution { + public int largestVariance(String s) { + + } +}","class Solution(object): + def largestVariance(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def largestVariance(self, s: str) -> int: + ","int largestVariance(char * s){ + +}","public class Solution { + public int LargestVariance(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var largestVariance = function(s) { + +};","# @param {String} s +# @return {Integer} +def largest_variance(s) + +end","class Solution { + func largestVariance(_ s: String) -> Int { + + } +}","func largestVariance(s string) int { + +}","object Solution { + def largestVariance(s: String): Int = { + + } +}","class Solution { + fun largestVariance(s: String): Int { + + } +}","impl Solution { + pub fn largest_variance(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function largestVariance($s) { + + } +}","function largestVariance(s: string): number { + +};","(define/contract (largest-variance s) + (-> string? exact-integer?) + + )","-spec largest_variance(S :: unicode:unicode_binary()) -> integer(). +largest_variance(S) -> + .","defmodule Solution do + @spec largest_variance(s :: String.t) :: integer + def largest_variance(s) do + + end +end","class Solution { + int largestVariance(String s) { + + } +}", +388,maximum-white-tiles-covered-by-a-carpet,Maximum White Tiles Covered by a Carpet,2271.0,2359.0,"

You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white.

+ +

You are also given an integer carpetLen, the length of a single carpet that can be placed anywhere.

+ +

Return the maximum number of white tiles that can be covered by the carpet.

+ +

 

+

Example 1:

+ +
+Input: tiles = [[1,5],[10,11],[12,18],[20,25],[30,32]], carpetLen = 10
+Output: 9
+Explanation: Place the carpet starting on tile 10. 
+It covers 9 white tiles, so we return 9.
+Note that there may be other places where the carpet covers 9 white tiles.
+It can be shown that the carpet cannot cover more than 9 white tiles.
+
+ +

Example 2:

+ +
+Input: tiles = [[10,11],[1,1]], carpetLen = 2
+Output: 2
+Explanation: Place the carpet starting on tile 10. 
+It covers 2 white tiles, so we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tiles.length <= 5 * 104
    • +
  • tiles[i].length == 2
    • +
  • 1 <= li <= ri <= 109
    • +
  • 1 <= carpetLen <= 109
    • +
  • The tiles are non-overlapping.
    • +
+",2.0,False,"class Solution { +public: + int maximumWhiteTiles(vector>& tiles, int carpetLen) { + + } +};","class Solution { + public int maximumWhiteTiles(int[][] tiles, int carpetLen) { + + } +}","class Solution(object): + def maximumWhiteTiles(self, tiles, carpetLen): + """""" + :type tiles: List[List[int]] + :type carpetLen: int + :rtype: int + """""" + ","class Solution: + def maximumWhiteTiles(self, tiles: List[List[int]], carpetLen: int) -> int: + ","int maximumWhiteTiles(int** tiles, int tilesSize, int* tilesColSize, int carpetLen){ + +}","public class Solution { + public int MaximumWhiteTiles(int[][] tiles, int carpetLen) { + + } +}","/** + * @param {number[][]} tiles + * @param {number} carpetLen + * @return {number} + */ +var maximumWhiteTiles = function(tiles, carpetLen) { + +};","# @param {Integer[][]} tiles +# @param {Integer} carpet_len +# @return {Integer} +def maximum_white_tiles(tiles, carpet_len) + +end","class Solution { + func maximumWhiteTiles(_ tiles: [[Int]], _ carpetLen: Int) -> Int { + + } +}","func maximumWhiteTiles(tiles [][]int, carpetLen int) int { + +}","object Solution { + def maximumWhiteTiles(tiles: Array[Array[Int]], carpetLen: Int): Int = { + + } +}","class Solution { + fun maximumWhiteTiles(tiles: Array, carpetLen: Int): Int { + + } +}","impl Solution { + pub fn maximum_white_tiles(tiles: Vec>, carpet_len: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $tiles + * @param Integer $carpetLen + * @return Integer + */ + function maximumWhiteTiles($tiles, $carpetLen) { + + } +}","function maximumWhiteTiles(tiles: number[][], carpetLen: number): number { + +};","(define/contract (maximum-white-tiles tiles carpetLen) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec maximum_white_tiles(Tiles :: [[integer()]], CarpetLen :: integer()) -> integer(). +maximum_white_tiles(Tiles, CarpetLen) -> + .","defmodule Solution do + @spec maximum_white_tiles(tiles :: [[integer]], carpet_len :: integer) :: integer + def maximum_white_tiles(tiles, carpet_len) do + + end +end","class Solution { + int maximumWhiteTiles(List> tiles, int carpetLen) { + + } +}", +389,number-of-ways-to-split-array,Number of Ways to Split Array,2270.0,2358.0,"

You are given a 0-indexed integer array nums of length n.

+ +

nums contains a valid split at index i if the following are true:

+ +
    +
  • The sum of the first i + 1 elements is greater than or equal to the sum of the last n - i - 1 elements.
    • +
  • There is at least one element to the right of i. That is, 0 <= i < n - 1.
    • +
+ +

Return the number of valid splits in nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,4,-8,7]
+Output: 2
+Explanation: 
+There are three ways of splitting nums into two non-empty parts:
+- Split nums at index 0. Then, the first part is [10], and its sum is 10. The second part is [4,-8,7], and its sum is 3. Since 10 >= 3, i = 0 is a valid split.
+- Split nums at index 1. Then, the first part is [10,4], and its sum is 14. The second part is [-8,7], and its sum is -1. Since 14 >= -1, i = 1 is a valid split.
+- Split nums at index 2. Then, the first part is [10,4,-8], and its sum is 6. The second part is [7], and its sum is 7. Since 6 < 7, i = 2 is not a valid split.
+Thus, the number of valid splits in nums is 2.
+
+ +

Example 2:

+ +
+Input: nums = [2,3,1,0]
+Output: 2
+Explanation: 
+There are two valid splits in nums:
+- Split nums at index 1. Then, the first part is [2,3], and its sum is 5. The second part is [1,0], and its sum is 1. Since 5 >= 1, i = 1 is a valid split. 
+- Split nums at index 2. Then, the first part is [2,3,1], and its sum is 6. The second part is [0], and its sum is 0. Since 6 >= 0, i = 2 is a valid split.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • -105 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int waysToSplitArray(vector& nums) { + + } +};","class Solution { + public int waysToSplitArray(int[] nums) { + + } +}","class Solution(object): + def waysToSplitArray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def waysToSplitArray(self, nums: List[int]) -> int: + ","int waysToSplitArray(int* nums, int numsSize){ + +}","public class Solution { + public int WaysToSplitArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var waysToSplitArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def ways_to_split_array(nums) + +end","class Solution { + func waysToSplitArray(_ nums: [Int]) -> Int { + + } +}","func waysToSplitArray(nums []int) int { + +}","object Solution { + def waysToSplitArray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun waysToSplitArray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn ways_to_split_array(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function waysToSplitArray($nums) { + + } +}","function waysToSplitArray(nums: number[]): number { + +};","(define/contract (ways-to-split-array nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec ways_to_split_array(Nums :: [integer()]) -> integer(). +ways_to_split_array(Nums) -> + .","defmodule Solution do + @spec ways_to_split_array(nums :: [integer]) :: integer + def ways_to_split_array(nums) do + + end +end","class Solution { + int waysToSplitArray(List nums) { + + } +}", +390,count-integers-in-intervals,Count Integers in Intervals,2276.0,2357.0,"

Given an empty set of intervals, implement a data structure that can:

+ +
    +
  • Add an interval to the set of intervals.
    • +
  • Count the number of integers that are present in at least one interval.
    • +
+ +

Implement the CountIntervals class:

+ +
    +
  • CountIntervals() Initializes the object with an empty set of intervals.
    • +
  • void add(int left, int right) Adds the interval [left, right] to the set of intervals.
    • +
  • int count() Returns the number of integers that are present in at least one interval.
    • +
+ +

Note that an interval [left, right] denotes all the integers x where left <= x <= right.

+ +

 

+

Example 1:

+ +
+Input
+["CountIntervals", "add", "add", "count", "add", "count"]
+[[], [2, 3], [7, 10], [], [5, 8], []]
+Output
+[null, null, null, 6, null, 8]
+
+Explanation
+CountIntervals countIntervals = new CountIntervals(); // initialize the object with an empty set of intervals. 
+countIntervals.add(2, 3);  // add [2, 3] to the set of intervals.
+countIntervals.add(7, 10); // add [7, 10] to the set of intervals.
+countIntervals.count();    // return 6
+                           // the integers 2 and 3 are present in the interval [2, 3].
+                           // the integers 7, 8, 9, and 10 are present in the interval [7, 10].
+countIntervals.add(5, 8);  // add [5, 8] to the set of intervals.
+countIntervals.count();    // return 8
+                           // the integers 2 and 3 are present in the interval [2, 3].
+                           // the integers 5 and 6 are present in the interval [5, 8].
+                           // the integers 7 and 8 are present in the intervals [5, 8] and [7, 10].
+                           // the integers 9 and 10 are present in the interval [7, 10].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left <= right <= 109
    • +
  • At most 105 calls in total will be made to add and count.
    • +
  • At least one call will be made to count.
    • +
+",3.0,False,"class CountIntervals { +public: + CountIntervals() { + + } + + void add(int left, int right) { + + } + + int count() { + + } +}; + +/** + * Your CountIntervals object will be instantiated and called as such: + * CountIntervals* obj = new CountIntervals(); + * obj->add(left,right); + * int param_2 = obj->count(); + */","class CountIntervals { + + public CountIntervals() { + + } + + public void add(int left, int right) { + + } + + public int count() { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * CountIntervals obj = new CountIntervals(); + * obj.add(left,right); + * int param_2 = obj.count(); + */","class CountIntervals(object): + + def __init__(self): + + + def add(self, left, right): + """""" + :type left: int + :type right: int + :rtype: None + """""" + + + def count(self): + """""" + :rtype: int + """""" + + + +# Your CountIntervals object will be instantiated and called as such: +# obj = CountIntervals() +# obj.add(left,right) +# param_2 = obj.count()","class CountIntervals: + + def __init__(self): + + + def add(self, left: int, right: int) -> None: + + + def count(self) -> int: + + + +# Your CountIntervals object will be instantiated and called as such: +# obj = CountIntervals() +# obj.add(left,right) +# param_2 = obj.count()"," + + +typedef struct { + +} CountIntervals; + + +CountIntervals* countIntervalsCreate() { + +} + +void countIntervalsAdd(CountIntervals* obj, int left, int right) { + +} + +int countIntervalsCount(CountIntervals* obj) { + +} + +void countIntervalsFree(CountIntervals* obj) { + +} + +/** + * Your CountIntervals struct will be instantiated and called as such: + * CountIntervals* obj = countIntervalsCreate(); + * countIntervalsAdd(obj, left, right); + + * int param_2 = countIntervalsCount(obj); + + * countIntervalsFree(obj); +*/","public class CountIntervals { + + public CountIntervals() { + + } + + public void Add(int left, int right) { + + } + + public int Count() { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * CountIntervals obj = new CountIntervals(); + * obj.Add(left,right); + * int param_2 = obj.Count(); + */"," +var CountIntervals = function() { + +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +CountIntervals.prototype.add = function(left, right) { + +}; + +/** + * @return {number} + */ +CountIntervals.prototype.count = function() { + +}; + +/** + * Your CountIntervals object will be instantiated and called as such: + * var obj = new CountIntervals() + * obj.add(left,right) + * var param_2 = obj.count() + */","class CountIntervals + def initialize() + + end + + +=begin + :type left: Integer + :type right: Integer + :rtype: Void +=end + def add(left, right) + + end + + +=begin + :rtype: Integer +=end + def count() + + end + + +end + +# Your CountIntervals object will be instantiated and called as such: +# obj = CountIntervals.new() +# obj.add(left, right) +# param_2 = obj.count()"," +class CountIntervals { + + init() { + + } + + func add(_ left: Int, _ right: Int) { + + } + + func count() -> Int { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * let obj = CountIntervals() + * obj.add(left, right) + * let ret_2: Int = obj.count() + */","type CountIntervals struct { + +} + + +func Constructor() CountIntervals { + +} + + +func (this *CountIntervals) Add(left int, right int) { + +} + + +func (this *CountIntervals) Count() int { + +} + + +/** + * Your CountIntervals object will be instantiated and called as such: + * obj := Constructor(); + * obj.Add(left,right); + * param_2 := obj.Count(); + */","class CountIntervals() { + + def add(left: Int, right: Int) { + + } + + def count(): Int = { + + } + +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * var obj = new CountIntervals() + * obj.add(left,right) + * var param_2 = obj.count() + */","class CountIntervals() { + + fun add(left: Int, right: Int) { + + } + + fun count(): Int { + + } + +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * var obj = CountIntervals() + * obj.add(left,right) + * var param_2 = obj.count() + */","struct CountIntervals { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl CountIntervals { + + fn new() -> Self { + + } + + fn add(&self, left: i32, right: i32) { + + } + + fn count(&self) -> i32 { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * let obj = CountIntervals::new(); + * obj.add(left, right); + * let ret_2: i32 = obj.count(); + */","class CountIntervals { + /** + */ + function __construct() { + + } + + /** + * @param Integer $left + * @param Integer $right + * @return NULL + */ + function add($left, $right) { + + } + + /** + * @return Integer + */ + function count() { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * $obj = CountIntervals(); + * $obj->add($left, $right); + * $ret_2 = $obj->count(); + */","class CountIntervals { + constructor() { + + } + + add(left: number, right: number): void { + + } + + count(): number { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * var obj = new CountIntervals() + * obj.add(left,right) + * var param_2 = obj.count() + */","(define count-intervals% + (class object% + (super-new) + + (init-field) + + ; add : exact-integer? exact-integer? -> void? + (define/public (add left right) + + ) + ; count : -> exact-integer? + (define/public (count) + + ))) + +;; Your count-intervals% object will be instantiated and called as such: +;; (define obj (new count-intervals%)) +;; (send obj add left right) +;; (define param_2 (send obj count))","-spec count_intervals_init_() -> any(). +count_intervals_init_() -> + . + +-spec count_intervals_add(Left :: integer(), Right :: integer()) -> any(). +count_intervals_add(Left, Right) -> + . + +-spec count_intervals_count() -> integer(). +count_intervals_count() -> + . + + +%% Your functions will be called as such: +%% count_intervals_init_(), +%% count_intervals_add(Left, Right), +%% Param_2 = count_intervals_count(), + +%% count_intervals_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule CountIntervals do + @spec init_() :: any + def init_() do + + end + + @spec add(left :: integer, right :: integer) :: any + def add(left, right) do + + end + + @spec count() :: integer + def count() do + + end +end + +# Your functions will be called as such: +# CountIntervals.init_() +# CountIntervals.add(left, right) +# param_2 = CountIntervals.count() + +# CountIntervals.init_ will be called before every test case, in which you can do some necessary initializations.","class CountIntervals { + + CountIntervals() { + + } + + void add(int left, int right) { + + } + + int count() { + + } +} + +/** + * Your CountIntervals object will be instantiated and called as such: + * CountIntervals obj = CountIntervals(); + * obj.add(left,right); + * int param2 = obj.count(); + */", +391,largest-combination-with-bitwise-and-greater-than-zero,Largest Combination With Bitwise AND Greater Than Zero,2275.0,2356.0,"

The bitwise AND of an array nums is the bitwise AND of all integers in nums.

+ +
    +
  • For example, for nums = [1, 5, 3], the bitwise AND is equal to 1 & 5 & 3 = 1.
    • +
  • Also, for nums = [7], the bitwise AND is 7.
    • +
+ +

You are given an array of positive integers candidates. Evaluate the bitwise AND of every combination of numbers of candidates. Each number in candidates may only be used once in each combination.

+ +

Return the size of the largest combination of candidates with a bitwise AND greater than 0.

+ +

 

+

Example 1:

+ +
+Input: candidates = [16,17,71,62,12,24,14]
+Output: 4
+Explanation: The combination [16,17,62,24] has a bitwise AND of 16 & 17 & 62 & 24 = 16 > 0.
+The size of the combination is 4.
+It can be shown that no combination with a size greater than 4 has a bitwise AND greater than 0.
+Note that more than one combination may have the largest size.
+For example, the combination [62,12,24,14] has a bitwise AND of 62 & 12 & 24 & 14 = 8 > 0.
+
+ +

Example 2:

+ +
+Input: candidates = [8,8]
+Output: 2
+Explanation: The largest combination [8,8] has a bitwise AND of 8 & 8 = 8 > 0.
+The size of the combination is 2, so we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= candidates.length <= 105
    • +
  • 1 <= candidates[i] <= 107
    • +
+",2.0,False,"class Solution { +public: + int largestCombination(vector& candidates) { + + } +};","class Solution { + public int largestCombination(int[] candidates) { + + } +}","class Solution(object): + def largestCombination(self, candidates): + """""" + :type candidates: List[int] + :rtype: int + """""" + ","class Solution: + def largestCombination(self, candidates: List[int]) -> int: + ","int largestCombination(int* candidates, int candidatesSize){ + +}","public class Solution { + public int LargestCombination(int[] candidates) { + + } +}","/** + * @param {number[]} candidates + * @return {number} + */ +var largestCombination = function(candidates) { + +};","# @param {Integer[]} candidates +# @return {Integer} +def largest_combination(candidates) + +end","class Solution { + func largestCombination(_ candidates: [Int]) -> Int { + + } +}","func largestCombination(candidates []int) int { + +}","object Solution { + def largestCombination(candidates: Array[Int]): Int = { + + } +}","class Solution { + fun largestCombination(candidates: IntArray): Int { + + } +}","impl Solution { + pub fn largest_combination(candidates: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $candidates + * @return Integer + */ + function largestCombination($candidates) { + + } +}","function largestCombination(candidates: number[]): number { + +};","(define/contract (largest-combination candidates) + (-> (listof exact-integer?) exact-integer?) + + )","-spec largest_combination(Candidates :: [integer()]) -> integer(). +largest_combination(Candidates) -> + .","defmodule Solution do + @spec largest_combination(candidates :: [integer]) :: integer + def largest_combination(candidates) do + + end +end","class Solution { + int largestCombination(List candidates) { + + } +}", +393,maximum-score-of-a-node-sequence,Maximum Score of a Node Sequence,2242.0,2353.0,"

There is an undirected graph with n nodes, numbered from 0 to n - 1.

+ +

You are given a 0-indexed integer array scores of length n where scores[i] denotes the score of node i. You are also given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

+ +

A node sequence is valid if it meets the following conditions:

+ +
    +
  • There is an edge connecting every pair of adjacent nodes in the sequence.
    • +
  • No node appears more than once in the sequence.
    • +
+ +

The score of a node sequence is defined as the sum of the scores of the nodes in the sequence.

+ +

Return the maximum score of a valid node sequence with a length of 4. If no such sequence exists, return -1.

+ +

 

+

Example 1:

+ +
+Input: scores = [5,2,9,8,4], edges = [[0,1],[1,2],[2,3],[0,2],[1,3],[2,4]]
+Output: 24
+Explanation: The figure above shows the graph and the chosen node sequence [0,1,2,3].
+The score of the node sequence is 5 + 2 + 9 + 8 = 24.
+It can be shown that no other node sequence has a score of more than 24.
+Note that the sequences [3,1,2,0] and [1,0,2,3] are also valid and have a score of 24.
+The sequence [0,3,2,4] is not valid since no edge connects nodes 0 and 3.
+
+ +

Example 2:

+ +
+Input: scores = [9,20,6,4,11,12], edges = [[0,3],[5,3],[2,4],[1,3]]
+Output: -1
+Explanation: The figure above shows the graph.
+There are no valid node sequences of length 4, so we return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • n == scores.length
    • +
  • 4 <= n <= 5 * 104
    • +
  • 1 <= scores[i] <= 108
    • +
  • 0 <= edges.length <= 5 * 104
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • ai != bi
    • +
  • There are no duplicate edges.
    • +
+",3.0,False,"class Solution { +public: + int maximumScore(vector& scores, vector>& edges) { + + } +};","class Solution { + public int maximumScore(int[] scores, int[][] edges) { + + } +}","class Solution(object): + def maximumScore(self, scores, edges): + """""" + :type scores: List[int] + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumScore(self, scores: List[int], edges: List[List[int]]) -> int: + ","int maximumScore(int* scores, int scoresSize, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int MaximumScore(int[] scores, int[][] edges) { + + } +}","/** + * @param {number[]} scores + * @param {number[][]} edges + * @return {number} + */ +var maximumScore = function(scores, edges) { + +};","# @param {Integer[]} scores +# @param {Integer[][]} edges +# @return {Integer} +def maximum_score(scores, edges) + +end","class Solution { + func maximumScore(_ scores: [Int], _ edges: [[Int]]) -> Int { + + } +}","func maximumScore(scores []int, edges [][]int) int { + +}","object Solution { + def maximumScore(scores: Array[Int], edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumScore(scores: IntArray, edges: Array): Int { + + } +}","impl Solution { + pub fn maximum_score(scores: Vec, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $scores + * @param Integer[][] $edges + * @return Integer + */ + function maximumScore($scores, $edges) { + + } +}","function maximumScore(scores: number[], edges: number[][]): number { + +};","(define/contract (maximum-score scores edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_score(Scores :: [integer()], Edges :: [[integer()]]) -> integer(). +maximum_score(Scores, Edges) -> + .","defmodule Solution do + @spec maximum_score(scores :: [integer], edges :: [[integer]]) :: integer + def maximum_score(scores, edges) do + + end +end","class Solution { + int maximumScore(List scores, List> edges) { + + } +}", +394,design-an-atm-machine,Design an ATM Machine,2241.0,2352.0,"

There is an ATM machine that stores banknotes of 5 denominations: 20, 50, 100, 200, and 500 dollars. Initially the ATM is empty. The user can use the machine to deposit or withdraw any amount of money.

+ +

When withdrawing, the machine prioritizes using banknotes of larger values.

+ +
    +
  • For example, if you want to withdraw $300 and there are 2 $50 banknotes, 1 $100 banknote, and 1 $200 banknote, then the machine will use the $100 and $200 banknotes.
    • +
  • However, if you try to withdraw $600 and there are 3 $200 banknotes and 1 $500 banknote, then the withdraw request will be rejected because the machine will first try to use the $500 banknote and then be unable to use banknotes to complete the remaining $100. Note that the machine is not allowed to use the $200 banknotes instead of the $500 banknote.
    • +
+ +

Implement the ATM class:

+ +
    +
  • ATM() Initializes the ATM object.
    • +
  • void deposit(int[] banknotesCount) Deposits new banknotes in the order $20, $50, $100, $200, and $500.
    • +
  • int[] withdraw(int amount) Returns an array of length 5 of the number of banknotes that will be handed to the user in the order $20, $50, $100, $200, and $500, and update the number of banknotes in the ATM after withdrawing. Returns [-1] if it is not possible (do not withdraw any banknotes in this case).
    • +
+ +

 

+

Example 1:

+ +
+Input
+["ATM", "deposit", "withdraw", "deposit", "withdraw", "withdraw"]
+[[], [[0,0,1,2,1]], [600], [[0,1,0,1,1]], [600], [550]]
+Output
+[null, null, [0,0,1,0,1], null, [-1], [0,1,0,0,1]]
+
+Explanation
+ATM atm = new ATM();
+atm.deposit([0,0,1,2,1]); // Deposits 1 $100 banknote, 2 $200 banknotes,
+                          // and 1 $500 banknote.
+atm.withdraw(600);        // Returns [0,0,1,0,1]. The machine uses 1 $100 banknote
+                          // and 1 $500 banknote. The banknotes left over in the
+                          // machine are [0,0,0,2,0].
+atm.deposit([0,1,0,1,1]); // Deposits 1 $50, $200, and $500 banknote.
+                          // The banknotes in the machine are now [0,1,0,3,1].
+atm.withdraw(600);        // Returns [-1]. The machine will try to use a $500 banknote
+                          // and then be unable to complete the remaining $100,
+                          // so the withdraw request will be rejected.
+                          // Since the request is rejected, the number of banknotes
+                          // in the machine is not modified.
+atm.withdraw(550);        // Returns [0,1,0,0,1]. The machine uses 1 $50 banknote
+                          // and 1 $500 banknote.
+ +

 

+

Constraints:

+ +
    +
  • banknotesCount.length == 5
    • +
  • 0 <= banknotesCount[i] <= 109
    • +
  • 1 <= amount <= 109
    • +
  • At most 5000 calls in total will be made to withdraw and deposit.
    • +
  • At least one call will be made to each function withdraw and deposit.
    • +
+",2.0,False,"class ATM { +public: + ATM() { + + } + + void deposit(vector banknotesCount) { + + } + + vector withdraw(int amount) { + + } +}; + +/** + * Your ATM object will be instantiated and called as such: + * ATM* obj = new ATM(); + * obj->deposit(banknotesCount); + * vector param_2 = obj->withdraw(amount); + */","class ATM { + + public ATM() { + + } + + public void deposit(int[] banknotesCount) { + + } + + public int[] withdraw(int amount) { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * ATM obj = new ATM(); + * obj.deposit(banknotesCount); + * int[] param_2 = obj.withdraw(amount); + */","class ATM(object): + + def __init__(self): + + + def deposit(self, banknotesCount): + """""" + :type banknotesCount: List[int] + :rtype: None + """""" + + + def withdraw(self, amount): + """""" + :type amount: int + :rtype: List[int] + """""" + + + +# Your ATM object will be instantiated and called as such: +# obj = ATM() +# obj.deposit(banknotesCount) +# param_2 = obj.withdraw(amount)","class ATM: + + def __init__(self): + + + def deposit(self, banknotesCount: List[int]) -> None: + + + def withdraw(self, amount: int) -> List[int]: + + + +# Your ATM object will be instantiated and called as such: +# obj = ATM() +# obj.deposit(banknotesCount) +# param_2 = obj.withdraw(amount)"," + + +typedef struct { + +} ATM; + + +ATM* aTMCreate() { + +} + +void aTMDeposit(ATM* obj, int* banknotesCount, int banknotesCountSize) { + +} + +int* aTMWithdraw(ATM* obj, int amount, int* retSize) { + +} + +void aTMFree(ATM* obj) { + +} + +/** + * Your ATM struct will be instantiated and called as such: + * ATM* obj = aTMCreate(); + * aTMDeposit(obj, banknotesCount, banknotesCountSize); + + * int* param_2 = aTMWithdraw(obj, amount, retSize); + + * aTMFree(obj); +*/","public class ATM { + + public ATM() { + + } + + public void Deposit(int[] banknotesCount) { + + } + + public int[] Withdraw(int amount) { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * ATM obj = new ATM(); + * obj.Deposit(banknotesCount); + * int[] param_2 = obj.Withdraw(amount); + */"," +var ATM = function() { + +}; + +/** + * @param {number[]} banknotesCount + * @return {void} + */ +ATM.prototype.deposit = function(banknotesCount) { + +}; + +/** + * @param {number} amount + * @return {number[]} + */ +ATM.prototype.withdraw = function(amount) { + +}; + +/** + * Your ATM object will be instantiated and called as such: + * var obj = new ATM() + * obj.deposit(banknotesCount) + * var param_2 = obj.withdraw(amount) + */","class ATM + def initialize() + + end + + +=begin + :type banknotes_count: Integer[] + :rtype: Void +=end + def deposit(banknotes_count) + + end + + +=begin + :type amount: Integer + :rtype: Integer[] +=end + def withdraw(amount) + + end + + +end + +# Your ATM object will be instantiated and called as such: +# obj = ATM.new() +# obj.deposit(banknotes_count) +# param_2 = obj.withdraw(amount)"," +class ATM { + + init() { + + } + + func deposit(_ banknotesCount: [Int]) { + + } + + func withdraw(_ amount: Int) -> [Int] { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * let obj = ATM() + * obj.deposit(banknotesCount) + * let ret_2: [Int] = obj.withdraw(amount) + */","type ATM struct { + +} + + +func Constructor() ATM { + +} + + +func (this *ATM) Deposit(banknotesCount []int) { + +} + + +func (this *ATM) Withdraw(amount int) []int { + +} + + +/** + * Your ATM object will be instantiated and called as such: + * obj := Constructor(); + * obj.Deposit(banknotesCount); + * param_2 := obj.Withdraw(amount); + */","class ATM() { + + def deposit(banknotesCount: Array[Int]) { + + } + + def withdraw(amount: Int): Array[Int] = { + + } + +} + +/** + * Your ATM object will be instantiated and called as such: + * var obj = new ATM() + * obj.deposit(banknotesCount) + * var param_2 = obj.withdraw(amount) + */","class ATM() { + + fun deposit(banknotesCount: IntArray) { + + } + + fun withdraw(amount: Int): IntArray { + + } + +} + +/** + * Your ATM object will be instantiated and called as such: + * var obj = ATM() + * obj.deposit(banknotesCount) + * var param_2 = obj.withdraw(amount) + */","struct ATM { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl ATM { + + fn new() -> Self { + + } + + fn deposit(&self, banknotes_count: Vec) { + + } + + fn withdraw(&self, amount: i32) -> Vec { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * let obj = ATM::new(); + * obj.deposit(banknotesCount); + * let ret_2: Vec = obj.withdraw(amount); + */","class ATM { + /** + */ + function __construct() { + + } + + /** + * @param Integer[] $banknotesCount + * @return NULL + */ + function deposit($banknotesCount) { + + } + + /** + * @param Integer $amount + * @return Integer[] + */ + function withdraw($amount) { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * $obj = ATM(); + * $obj->deposit($banknotesCount); + * $ret_2 = $obj->withdraw($amount); + */","class ATM { + constructor() { + + } + + deposit(banknotesCount: number[]): void { + + } + + withdraw(amount: number): number[] { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * var obj = new ATM() + * obj.deposit(banknotesCount) + * var param_2 = obj.withdraw(amount) + */","(define atm% + (class object% + (super-new) + + (init-field) + + ; deposit : (listof exact-integer?) -> void? + (define/public (deposit banknotes-count) + + ) + ; withdraw : exact-integer? -> (listof exact-integer?) + (define/public (withdraw amount) + + ))) + +;; Your atm% object will be instantiated and called as such: +;; (define obj (new atm%)) +;; (send obj deposit banknotes-count) +;; (define param_2 (send obj withdraw amount))","-spec atm_init_() -> any(). +atm_init_() -> + . + +-spec atm_deposit(BanknotesCount :: [integer()]) -> any(). +atm_deposit(BanknotesCount) -> + . + +-spec atm_withdraw(Amount :: integer()) -> [integer()]. +atm_withdraw(Amount) -> + . + + +%% Your functions will be called as such: +%% atm_init_(), +%% atm_deposit(BanknotesCount), +%% Param_2 = atm_withdraw(Amount), + +%% atm_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule ATM do + @spec init_() :: any + def init_() do + + end + + @spec deposit(banknotes_count :: [integer]) :: any + def deposit(banknotes_count) do + + end + + @spec withdraw(amount :: integer) :: [integer] + def withdraw(amount) do + + end +end + +# Your functions will be called as such: +# ATM.init_() +# ATM.deposit(banknotes_count) +# param_2 = ATM.withdraw(amount) + +# ATM.init_ will be called before every test case, in which you can do some necessary initializations.","class ATM { + + ATM() { + + } + + void deposit(List banknotesCount) { + + } + + List withdraw(int amount) { + + } +} + +/** + * Your ATM object will be instantiated and called as such: + * ATM obj = ATM(); + * obj.deposit(banknotesCount); + * List param2 = obj.withdraw(amount); + */", +395,number-of-ways-to-buy-pens-and-pencils,Number of Ways to Buy Pens and Pencils,2240.0,2351.0,"

You are given an integer total indicating the amount of money you have. You are also given two integers cost1 and cost2 indicating the price of a pen and pencil respectively. You can spend part or all of your money to buy multiple quantities (or none) of each kind of writing utensil.

+ +

Return the number of distinct ways you can buy some number of pens and pencils.

+ +

 

+

Example 1:

+ +
+Input: total = 20, cost1 = 10, cost2 = 5
+Output: 9
+Explanation: The price of a pen is 10 and the price of a pencil is 5.
+- If you buy 0 pens, you can buy 0, 1, 2, 3, or 4 pencils.
+- If you buy 1 pen, you can buy 0, 1, or 2 pencils.
+- If you buy 2 pens, you cannot buy any pencils.
+The total number of ways to buy pens and pencils is 5 + 3 + 1 = 9.
+
+ +

Example 2:

+ +
+Input: total = 5, cost1 = 10, cost2 = 10
+Output: 1
+Explanation: The price of both pens and pencils are 10, which cost more than total, so you cannot buy any writing utensils. Therefore, there is only 1 way: buy 0 pens and 0 pencils.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= total, cost1, cost2 <= 106
    • +
+",2.0,False,"class Solution { +public: + long long waysToBuyPensPencils(int total, int cost1, int cost2) { + + } +};","class Solution { + public long waysToBuyPensPencils(int total, int cost1, int cost2) { + + } +}","class Solution(object): + def waysToBuyPensPencils(self, total, cost1, cost2): + """""" + :type total: int + :type cost1: int + :type cost2: int + :rtype: int + """""" + ","class Solution: + def waysToBuyPensPencils(self, total: int, cost1: int, cost2: int) -> int: + ","long long waysToBuyPensPencils(int total, int cost1, int cost2){ + +}","public class Solution { + public long WaysToBuyPensPencils(int total, int cost1, int cost2) { + + } +}","/** + * @param {number} total + * @param {number} cost1 + * @param {number} cost2 + * @return {number} + */ +var waysToBuyPensPencils = function(total, cost1, cost2) { + +};","# @param {Integer} total +# @param {Integer} cost1 +# @param {Integer} cost2 +# @return {Integer} +def ways_to_buy_pens_pencils(total, cost1, cost2) + +end","class Solution { + func waysToBuyPensPencils(_ total: Int, _ cost1: Int, _ cost2: Int) -> Int { + + } +}","func waysToBuyPensPencils(total int, cost1 int, cost2 int) int64 { + +}","object Solution { + def waysToBuyPensPencils(total: Int, cost1: Int, cost2: Int): Long = { + + } +}","class Solution { + fun waysToBuyPensPencils(total: Int, cost1: Int, cost2: Int): Long { + + } +}","impl Solution { + pub fn ways_to_buy_pens_pencils(total: i32, cost1: i32, cost2: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $total + * @param Integer $cost1 + * @param Integer $cost2 + * @return Integer + */ + function waysToBuyPensPencils($total, $cost1, $cost2) { + + } +}","function waysToBuyPensPencils(total: number, cost1: number, cost2: number): number { + +};","(define/contract (ways-to-buy-pens-pencils total cost1 cost2) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec ways_to_buy_pens_pencils(Total :: integer(), Cost1 :: integer(), Cost2 :: integer()) -> integer(). +ways_to_buy_pens_pencils(Total, Cost1, Cost2) -> + .","defmodule Solution do + @spec ways_to_buy_pens_pencils(total :: integer, cost1 :: integer, cost2 :: integer) :: integer + def ways_to_buy_pens_pencils(total, cost1, cost2) do + + end +end","class Solution { + int waysToBuyPensPencils(int total, int cost1, int cost2) { + + } +}", +397,check-if-there-is-a-valid-parentheses-string-path, Check if There Is a Valid Parentheses String Path,2267.0,2349.0,"

A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true:

+ +
    +
  • It is ().
    • +
  • It can be written as AB (A concatenated with B), where A and B are valid parentheses strings.
    • +
  • It can be written as (A), where A is a valid parentheses string.
    • +
+ +

You are given an m x n matrix of parentheses grid. A valid parentheses string path in the grid is a path satisfying all of the following conditions:

+ +
    +
  • The path starts from the upper left cell (0, 0).
    • +
  • The path ends at the bottom-right cell (m - 1, n - 1).
    • +
  • The path only ever moves down or right.
    • +
  • The resulting parentheses string formed by the path is valid.
    • +
+ +

Return true if there exists a valid parentheses string path in the grid. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: grid = [["(","(","("],[")","(",")"],["(","(",")"],["(","(",")"]]
+Output: true
+Explanation: The above diagram shows two possible paths that form valid parentheses strings.
+The first path shown results in the valid parentheses string "()(())".
+The second path shown results in the valid parentheses string "((()))".
+Note that there may be other valid parentheses string paths.
+
+ +

Example 2:

+ +
+Input: grid = [[")",")"],["(","("]]
+Output: false
+Explanation: The two possible paths form the parentheses strings "))(" and ")((". Since neither of them are valid parentheses strings, we return false.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 100
    • +
  • grid[i][j] is either '(' or ')'.
    • +
+",3.0,False,"class Solution { +public: + bool hasValidPath(vector>& grid) { + + } +};","class Solution { + public boolean hasValidPath(char[][] grid) { + + } +}","class Solution(object): + def hasValidPath(self, grid): + """""" + :type grid: List[List[str]] + :rtype: bool + """""" + ","class Solution: + def hasValidPath(self, grid: List[List[str]]) -> bool: + ","bool hasValidPath(char** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public bool HasValidPath(char[][] grid) { + + } +}","/** + * @param {character[][]} grid + * @return {boolean} + */ +var hasValidPath = function(grid) { + +};","# @param {Character[][]} grid +# @return {Boolean} +def has_valid_path(grid) + +end","class Solution { + func hasValidPath(_ grid: [[Character]]) -> Bool { + + } +}","func hasValidPath(grid [][]byte) bool { + +}","object Solution { + def hasValidPath(grid: Array[Array[Char]]): Boolean = { + + } +}","class Solution { + fun hasValidPath(grid: Array): Boolean { + + } +}","impl Solution { + pub fn has_valid_path(grid: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param String[][] $grid + * @return Boolean + */ + function hasValidPath($grid) { + + } +}","function hasValidPath(grid: string[][]): boolean { + +};","(define/contract (has-valid-path grid) + (-> (listof (listof char?)) boolean?) + + )","-spec has_valid_path(Grid :: [[char()]]) -> boolean(). +has_valid_path(Grid) -> + .","defmodule Solution do + @spec has_valid_path(grid :: [[char]]) :: boolean + def has_valid_path(grid) do + + end +end","class Solution { + bool hasValidPath(List> grid) { + + } +}", +398,count-number-of-texts,Count Number of Texts,2266.0,2348.0,"

Alice is texting Bob using her phone. The mapping of digits to letters is shown in the figure below.

+ +

In order to add a letter, Alice has to press the key of the corresponding digit i times, where i is the position of the letter in the key.

+ +
    +
  • For example, to add the letter 's', Alice has to press '7' four times. Similarly, to add the letter 'k', Alice has to press '5' twice.
    • +
  • Note that the digits '0' and '1' do not map to any letters, so Alice does not use them.
    • +
+ +

However, due to an error in transmission, Bob did not receive Alice's text message but received a string of pressed keys instead.

+ +
    +
  • For example, when Alice sent the message "bob", Bob received the string "2266622".
    • +
+ +

Given a string pressedKeys representing the string received by Bob, return the total number of possible text messages Alice could have sent.

+ +

Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: pressedKeys = "22233"
+Output: 8
+Explanation:
+The possible text messages Alice could have sent are:
+"aaadd", "abdd", "badd", "cdd", "aaae", "abe", "bae", and "ce".
+Since there are 8 possible messages, we return 8.
+
+ +

Example 2:

+ +
+Input: pressedKeys = "222222222222222222222222222222222222"
+Output: 82876089
+Explanation:
+There are 2082876103 possible text messages Alice could have sent.
+Since we need to return the answer modulo 109 + 7, we return 2082876103 % (109 + 7) = 82876089.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pressedKeys.length <= 105
    • +
  • pressedKeys only consists of digits from '2' - '9'.
    • +
+",2.0,False,"class Solution { +public: + int countTexts(string pressedKeys) { + + } +};","class Solution { + public int countTexts(String pressedKeys) { + + } +}","class Solution(object): + def countTexts(self, pressedKeys): + """""" + :type pressedKeys: str + :rtype: int + """""" + ","class Solution: + def countTexts(self, pressedKeys: str) -> int: + ","int countTexts(char * pressedKeys){ + +}","public class Solution { + public int CountTexts(string pressedKeys) { + + } +}","/** + * @param {string} pressedKeys + * @return {number} + */ +var countTexts = function(pressedKeys) { + +};","# @param {String} pressed_keys +# @return {Integer} +def count_texts(pressed_keys) + +end","class Solution { + func countTexts(_ pressedKeys: String) -> Int { + + } +}","func countTexts(pressedKeys string) int { + +}","object Solution { + def countTexts(pressedKeys: String): Int = { + + } +}","class Solution { + fun countTexts(pressedKeys: String): Int { + + } +}","impl Solution { + pub fn count_texts(pressed_keys: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $pressedKeys + * @return Integer + */ + function countTexts($pressedKeys) { + + } +}","function countTexts(pressedKeys: string): number { + +};","(define/contract (count-texts pressedKeys) + (-> string? exact-integer?) + + )","-spec count_texts(PressedKeys :: unicode:unicode_binary()) -> integer(). +count_texts(PressedKeys) -> + .","defmodule Solution do + @spec count_texts(pressed_keys :: String.t) :: integer + def count_texts(pressed_keys) do + + end +end","class Solution { + int countTexts(String pressedKeys) { + + } +}", +402,escape-the-spreading-fire,Escape the Spreading Fire,2258.0,2344.0,"

You are given a 0-indexed 2D integer array grid of size m x n which represents a field. Each cell has one of three values:

+ +
    +
  • 0 represents grass,
    • +
  • 1 represents fire,
    • +
  • 2 represents a wall that you and fire cannot pass through.
    • +
+ +

You are situated in the top-left cell, (0, 0), and you want to travel to the safehouse at the bottom-right cell, (m - 1, n - 1). Every minute, you may move to an adjacent grass cell. After your move, every fire cell will spread to all adjacent cells that are not walls.

+ +

Return the maximum number of minutes that you can stay in your initial position before moving while still safely reaching the safehouse. If this is impossible, return -1. If you can always reach the safehouse regardless of the minutes stayed, return 109.

+ +

Note that even if the fire spreads to the safehouse immediately after you have reached it, it will be counted as safely reaching the safehouse.

+ +

A cell is adjacent to another cell if the former is directly north, east, south, or west of the latter (i.e., their sides are touching).

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,2,0,0,0,0,0],[0,0,0,2,2,1,0],[0,2,0,0,1,2,0],[0,0,2,2,2,0,2],[0,0,0,0,0,0,0]]
+Output: 3
+Explanation: The figure above shows the scenario where you stay in the initial position for 3 minutes.
+You will still be able to safely reach the safehouse.
+Staying for more than 3 minutes will not allow you to safely reach the safehouse.
+ +

Example 2:

+ +
+Input: grid = [[0,0,0,0],[0,1,2,0],[0,2,0,0]]
+Output: -1
+Explanation: The figure above shows the scenario where you immediately move towards the safehouse.
+Fire will spread to any cell you move towards and it is impossible to safely reach the safehouse.
+Thus, -1 is returned.
+
+ +

Example 3:

+ +
+Input: grid = [[0,0,0],[2,2,0],[1,2,0]]
+Output: 1000000000
+Explanation: The figure above shows the initial grid.
+Notice that the fire is contained by walls and you will always be able to safely reach the safehouse.
+Thus, 109 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 2 <= m, n <= 300
    • +
  • 4 <= m * n <= 2 * 104
    • +
  • grid[i][j] is either 0, 1, or 2.
    • +
  • grid[0][0] == grid[m - 1][n - 1] == 0
    • +
+",3.0,False,"class Solution { +public: + int maximumMinutes(vector>& grid) { + + } +};","class Solution { + public int maximumMinutes(int[][] grid) { + + } +}","class Solution(object): + def maximumMinutes(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumMinutes(self, grid: List[List[int]]) -> int: + ","int maximumMinutes(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaximumMinutes(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maximumMinutes = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def maximum_minutes(grid) + +end","class Solution { + func maximumMinutes(_ grid: [[Int]]) -> Int { + + } +}","func maximumMinutes(grid [][]int) int { + +}","object Solution { + def maximumMinutes(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumMinutes(grid: Array): Int { + + } +}","impl Solution { + pub fn maximum_minutes(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maximumMinutes($grid) { + + } +}","function maximumMinutes(grid: number[][]): number { + +};","(define/contract (maximum-minutes grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_minutes(Grid :: [[integer()]]) -> integer(). +maximum_minutes(Grid) -> + .","defmodule Solution do + @spec maximum_minutes(grid :: [[integer]]) :: integer + def maximum_minutes(grid) do + + end +end","class Solution { + int maximumMinutes(List> grid) { + + } +}", +403,count-unguarded-cells-in-the-grid,Count Unguarded Cells in the Grid,2257.0,2343.0,"

You are given two integers m and n representing a 0-indexed m x n grid. You are also given two 2D integer arrays guards and walls where guards[i] = [rowi, coli] and walls[j] = [rowj, colj] represent the positions of the ith guard and jth wall respectively.

+ +

A guard can see every cell in the four cardinal directions (north, east, south, or west) starting from their position unless obstructed by a wall or another guard. A cell is guarded if there is at least one guard that can see it.

+ +

Return the number of unoccupied cells that are not guarded.

+ +

 

+

Example 1:

+ +
+Input: m = 4, n = 6, guards = [[0,0],[1,1],[2,3]], walls = [[0,1],[2,2],[1,4]]
+Output: 7
+Explanation: The guarded and unguarded cells are shown in red and green respectively in the above diagram.
+There are a total of 7 unguarded cells, so we return 7.
+
+ +

Example 2:

+ +
+Input: m = 3, n = 3, guards = [[1,1]], walls = [[0,1],[1,0],[2,1],[1,2]]
+Output: 4
+Explanation: The unguarded cells are shown in green in the above diagram.
+There are a total of 4 unguarded cells, so we return 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 105
    • +
  • 2 <= m * n <= 105
    • +
  • 1 <= guards.length, walls.length <= 5 * 104
    • +
  • 2 <= guards.length + walls.length <= m * n
    • +
  • guards[i].length == walls[j].length == 2
    • +
  • 0 <= rowi, rowj < m
    • +
  • 0 <= coli, colj < n
    • +
  • All the positions in guards and walls are unique.
    • +
+",2.0,False,"class Solution { +public: + int countUnguarded(int m, int n, vector>& guards, vector>& walls) { + + } +};","class Solution { + public int countUnguarded(int m, int n, int[][] guards, int[][] walls) { + + } +}","class Solution(object): + def countUnguarded(self, m, n, guards, walls): + """""" + :type m: int + :type n: int + :type guards: List[List[int]] + :type walls: List[List[int]] + :rtype: int + """""" + ","class Solution: + def countUnguarded(self, m: int, n: int, guards: List[List[int]], walls: List[List[int]]) -> int: + ","int countUnguarded(int m, int n, int** guards, int guardsSize, int* guardsColSize, int** walls, int wallsSize, int* wallsColSize){ + +}","public class Solution { + public int CountUnguarded(int m, int n, int[][] guards, int[][] walls) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number[][]} guards + * @param {number[][]} walls + * @return {number} + */ +var countUnguarded = function(m, n, guards, walls) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer[][]} guards +# @param {Integer[][]} walls +# @return {Integer} +def count_unguarded(m, n, guards, walls) + +end","class Solution { + func countUnguarded(_ m: Int, _ n: Int, _ guards: [[Int]], _ walls: [[Int]]) -> Int { + + } +}","func countUnguarded(m int, n int, guards [][]int, walls [][]int) int { + +}","object Solution { + def countUnguarded(m: Int, n: Int, guards: Array[Array[Int]], walls: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun countUnguarded(m: Int, n: Int, guards: Array, walls: Array): Int { + + } +}","impl Solution { + pub fn count_unguarded(m: i32, n: i32, guards: Vec>, walls: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer[][] $guards + * @param Integer[][] $walls + * @return Integer + */ + function countUnguarded($m, $n, $guards, $walls) { + + } +}","function countUnguarded(m: number, n: number, guards: number[][], walls: number[][]): number { + +};","(define/contract (count-unguarded m n guards walls) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?) + + )","-spec count_unguarded(M :: integer(), N :: integer(), Guards :: [[integer()]], Walls :: [[integer()]]) -> integer(). +count_unguarded(M, N, Guards, Walls) -> + .","defmodule Solution do + @spec count_unguarded(m :: integer, n :: integer, guards :: [[integer]], walls :: [[integer]]) :: integer + def count_unguarded(m, n, guards, walls) do + + end +end","class Solution { + int countUnguarded(int m, int n, List> guards, List> walls) { + + } +}", +404,minimum-average-difference,Minimum Average Difference,2256.0,2342.0,"

You are given a 0-indexed integer array nums of length n.

+ +

The average difference of the index i is the absolute difference between the average of the first i + 1 elements of nums and the average of the last n - i - 1 elements. Both averages should be rounded down to the nearest integer.

+ +

Return the index with the minimum average difference. If there are multiple such indices, return the smallest one.

+ +

Note:

+ +
    +
  • The absolute difference of two numbers is the absolute value of their difference.
    • +
  • The average of n elements is the sum of the n elements divided (integer division) by n.
    • +
  • The average of 0 elements is considered to be 0.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [2,5,3,9,5,3]
+Output: 3
+Explanation:
+- The average difference of index 0 is: |2 / 1 - (5 + 3 + 9 + 5 + 3) / 5| = |2 / 1 - 25 / 5| = |2 - 5| = 3.
+- The average difference of index 1 is: |(2 + 5) / 2 - (3 + 9 + 5 + 3) / 4| = |7 / 2 - 20 / 4| = |3 - 5| = 2.
+- The average difference of index 2 is: |(2 + 5 + 3) / 3 - (9 + 5 + 3) / 3| = |10 / 3 - 17 / 3| = |3 - 5| = 2.
+- The average difference of index 3 is: |(2 + 5 + 3 + 9) / 4 - (5 + 3) / 2| = |19 / 4 - 8 / 2| = |4 - 4| = 0.
+- The average difference of index 4 is: |(2 + 5 + 3 + 9 + 5) / 5 - 3 / 1| = |24 / 5 - 3 / 1| = |4 - 3| = 1.
+- The average difference of index 5 is: |(2 + 5 + 3 + 9 + 5 + 3) / 6 - 0| = |27 / 6 - 0| = |4 - 0| = 4.
+The average difference of index 3 is the minimum average difference so return 3.
+
+ +

Example 2:

+ +
+Input: nums = [0]
+Output: 0
+Explanation:
+The only index is 0 so return 0.
+The average difference of index 0 is: |0 / 1 - 0| = |0 - 0| = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int minimumAverageDifference(vector& nums) { + + } +};","class Solution { + public int minimumAverageDifference(int[] nums) { + + } +}","class Solution(object): + def minimumAverageDifference(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumAverageDifference(self, nums: List[int]) -> int: + ","int minimumAverageDifference(int* nums, int numsSize){ + +}","public class Solution { + public int MinimumAverageDifference(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumAverageDifference = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_average_difference(nums) + +end","class Solution { + func minimumAverageDifference(_ nums: [Int]) -> Int { + + } +}","func minimumAverageDifference(nums []int) int { + +}","object Solution { + def minimumAverageDifference(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minimumAverageDifference(nums: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_average_difference(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumAverageDifference($nums) { + + } +}","function minimumAverageDifference(nums: number[]): number { + +};","(define/contract (minimum-average-difference nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_average_difference(Nums :: [integer()]) -> integer(). +minimum_average_difference(Nums) -> + .","defmodule Solution do + @spec minimum_average_difference(nums :: [integer]) :: integer + def minimum_average_difference(nums) do + + end +end","class Solution { + int minimumAverageDifference(List nums) { + + } +}", +406,total-appeal-of-a-string,Total Appeal of A String,2262.0,2340.0,"

The appeal of a string is the number of distinct characters found in the string.

+ +
    +
  • For example, the appeal of "abbca" is 3 because it has 3 distinct characters: 'a', 'b', and 'c'.
    • +
+ +

Given a string s, return the total appeal of all of its substrings.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "abbca"
+Output: 28
+Explanation: The following are the substrings of "abbca":
+- Substrings of length 1: "a", "b", "b", "c", "a" have an appeal of 1, 1, 1, 1, and 1 respectively. The sum is 5.
+- Substrings of length 2: "ab", "bb", "bc", "ca" have an appeal of 2, 1, 2, and 2 respectively. The sum is 7.
+- Substrings of length 3: "abb", "bbc", "bca" have an appeal of 2, 2, and 3 respectively. The sum is 7.
+- Substrings of length 4: "abbc", "bbca" have an appeal of 3 and 3 respectively. The sum is 6.
+- Substrings of length 5: "abbca" has an appeal of 3. The sum is 3.
+The total sum is 5 + 7 + 7 + 6 + 3 = 28.
+
+ +

Example 2:

+ +
+Input: s = "code"
+Output: 20
+Explanation: The following are the substrings of "code":
+- Substrings of length 1: "c", "o", "d", "e" have an appeal of 1, 1, 1, and 1 respectively. The sum is 4.
+- Substrings of length 2: "co", "od", "de" have an appeal of 2, 2, and 2 respectively. The sum is 6.
+- Substrings of length 3: "cod", "ode" have an appeal of 3 and 3 respectively. The sum is 6.
+- Substrings of length 4: "code" has an appeal of 4. The sum is 4.
+The total sum is 4 + 6 + 6 + 4 = 20.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + long long appealSum(string s) { + + } +};","class Solution { + public long appealSum(String s) { + + } +}","class Solution(object): + def appealSum(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def appealSum(self, s: str) -> int: + ","long long appealSum(char * s){ + +}","public class Solution { + public long AppealSum(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var appealSum = function(s) { + +};","# @param {String} s +# @return {Integer} +def appeal_sum(s) + +end","class Solution { + func appealSum(_ s: String) -> Int { + + } +}","func appealSum(s string) int64 { + +}","object Solution { + def appealSum(s: String): Long = { + + } +}","class Solution { + fun appealSum(s: String): Long { + + } +}","impl Solution { + pub fn appeal_sum(s: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function appealSum($s) { + + } +}","function appealSum(s: string): number { + +};","(define/contract (appeal-sum s) + (-> string? exact-integer?) + + )","-spec appeal_sum(S :: unicode:unicode_binary()) -> integer(). +appeal_sum(S) -> + .","defmodule Solution do + @spec appeal_sum(s :: String.t) :: integer + def appeal_sum(s) do + + end +end","class Solution { + int appealSum(String s) { + + } +}", +408,minimum-consecutive-cards-to-pick-up,Minimum Consecutive Cards to Pick Up,2260.0,2338.0,"

You are given an integer array cards where cards[i] represents the value of the ith card. A pair of cards are matching if the cards have the same value.

+ +

Return the minimum number of consecutive cards you have to pick up to have a pair of matching cards among the picked cards. If it is impossible to have matching cards, return -1.

+ +

 

+

Example 1:

+ +
+Input: cards = [3,4,2,3,4,7]
+Output: 4
+Explanation: We can pick up the cards [3,4,2,3] which contain a matching pair of cards with value 3. Note that picking up the cards [4,2,3,4] is also optimal.
+
+ +

Example 2:

+ +
+Input: cards = [1,0,5,3]
+Output: -1
+Explanation: There is no way to pick up a set of consecutive cards that contain a pair of matching cards.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= cards.length <= 105
    • +
  • 0 <= cards[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + int minimumCardPickup(vector& cards) { + + } +};","class Solution { + public int minimumCardPickup(int[] cards) { + + } +}","class Solution(object): + def minimumCardPickup(self, cards): + """""" + :type cards: List[int] + :rtype: int + """""" + ","class Solution: + def minimumCardPickup(self, cards: List[int]) -> int: + ","int minimumCardPickup(int* cards, int cardsSize){ + +}","public class Solution { + public int MinimumCardPickup(int[] cards) { + + } +}","/** + * @param {number[]} cards + * @return {number} + */ +var minimumCardPickup = function(cards) { + +};","# @param {Integer[]} cards +# @return {Integer} +def minimum_card_pickup(cards) + +end","class Solution { + func minimumCardPickup(_ cards: [Int]) -> Int { + + } +}","func minimumCardPickup(cards []int) int { + +}","object Solution { + def minimumCardPickup(cards: Array[Int]): Int = { + + } +}","class Solution { + fun minimumCardPickup(cards: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_card_pickup(cards: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $cards + * @return Integer + */ + function minimumCardPickup($cards) { + + } +}","function minimumCardPickup(cards: number[]): number { + +};","(define/contract (minimum-card-pickup cards) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_card_pickup(Cards :: [integer()]) -> integer(). +minimum_card_pickup(Cards) -> + .","defmodule Solution do + @spec minimum_card_pickup(cards :: [integer]) :: integer + def minimum_card_pickup(cards) do + + end +end","class Solution { + int minimumCardPickup(List cards) { + + } +}", +409,remove-digit-from-number-to-maximize-result,Remove Digit From Number to Maximize Result,2259.0,2337.0,"

You are given a string number representing a positive integer and a character digit.

+ +

Return the resulting string after removing exactly one occurrence of digit from number such that the value of the resulting string in decimal form is maximized. The test cases are generated such that digit occurs at least once in number.

+ +

 

+

Example 1:

+ +
+Input: number = "123", digit = "3"
+Output: "12"
+Explanation: There is only one '3' in "123". After removing '3', the result is "12".
+
+ +

Example 2:

+ +
+Input: number = "1231", digit = "1"
+Output: "231"
+Explanation: We can remove the first '1' to get "231" or remove the second '1' to get "123".
+Since 231 > 123, we return "231".
+
+ +

Example 3:

+ +
+Input: number = "551", digit = "5"
+Output: "51"
+Explanation: We can remove either the first or second '5' from "551".
+Both result in the string "51".
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= number.length <= 100
    • +
  • number consists of digits from '1' to '9'.
    • +
  • digit is a digit from '1' to '9'.
    • +
  • digit occurs at least once in number.
    • +
+",1.0,False,"class Solution { +public: + string removeDigit(string number, char digit) { + + } +};","class Solution { + public String removeDigit(String number, char digit) { + + } +}","class Solution(object): + def removeDigit(self, number, digit): + """""" + :type number: str + :type digit: str + :rtype: str + """""" + ","class Solution: + def removeDigit(self, number: str, digit: str) -> str: + ","char * removeDigit(char * number, char digit){ + +}","public class Solution { + public string RemoveDigit(string number, char digit) { + + } +}","/** + * @param {string} number + * @param {character} digit + * @return {string} + */ +var removeDigit = function(number, digit) { + +};","# @param {String} number +# @param {Character} digit +# @return {String} +def remove_digit(number, digit) + +end","class Solution { + func removeDigit(_ number: String, _ digit: Character) -> String { + + } +}","func removeDigit(number string, digit byte) string { + +}","object Solution { + def removeDigit(number: String, digit: Char): String = { + + } +}","class Solution { + fun removeDigit(number: String, digit: Char): String { + + } +}","impl Solution { + pub fn remove_digit(number: String, digit: char) -> String { + + } +}","class Solution { + + /** + * @param String $number + * @param String $digit + * @return String + */ + function removeDigit($number, $digit) { + + } +}","function removeDigit(number: string, digit: string): string { + +};","(define/contract (remove-digit number digit) + (-> string? char? string?) + + )","-spec remove_digit(Number :: unicode:unicode_binary(), Digit :: char()) -> unicode:unicode_binary(). +remove_digit(Number, Digit) -> + .","defmodule Solution do + @spec remove_digit(number :: String.t, digit :: char) :: String.t + def remove_digit(number, digit) do + + end +end","class Solution { + String removeDigit(String number, String digit) { + + } +}", +410,number-of-flowers-in-full-bloom,Number of Flowers in Full Bloom,2251.0,2334.0,"

You are given a 0-indexed 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from starti to endi (inclusive). You are also given a 0-indexed integer array people of size n, where poeple[i] is the time that the ith person will arrive to see the flowers.

+ +

Return an integer array answer of size n, where answer[i] is the number of flowers that are in full bloom when the ith person arrives.

+ +

 

+

Example 1:

+ +
+Input: flowers = [[1,6],[3,7],[9,12],[4,13]], poeple = [2,3,7,11]
+Output: [1,2,2,2]
+Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
+For each person, we return the number of flowers in full bloom during their arrival.
+
+ +

Example 2:

+ +
+Input: flowers = [[1,10],[3,3]], poeple = [3,3,2]
+Output: [2,2,1]
+Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
+For each person, we return the number of flowers in full bloom during their arrival.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= flowers.length <= 5 * 104
    • +
  • flowers[i].length == 2
    • +
  • 1 <= starti <= endi <= 109
    • +
  • 1 <= people.length <= 5 * 104
    • +
  • 1 <= people[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + vector fullBloomFlowers(vector>& flowers, vector& people) { + + } +};","class Solution { + public int[] fullBloomFlowers(int[][] flowers, int[] people) { + + } +}","class Solution(object): + def fullBloomFlowers(self, flowers, people): + """""" + :type flowers: List[List[int]] + :type people: List[int] + :rtype: List[int] + """""" + ","class Solution: + def fullBloomFlowers(self, flowers: List[List[int]], people: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* fullBloomFlowers(int** flowers, int flowersSize, int* flowersColSize, int* people, int peopleSize, int* returnSize){ + +}","public class Solution { + public int[] FullBloomFlowers(int[][] flowers, int[] people) { + + } +}","/** + * @param {number[][]} flowers + * @param {number[]} people + * @return {number[]} + */ +var fullBloomFlowers = function(flowers, people) { + +};","# @param {Integer[][]} flowers +# @param {Integer[]} people +# @return {Integer[]} +def full_bloom_flowers(flowers, people) + +end","class Solution { + func fullBloomFlowers(_ flowers: [[Int]], _ people: [Int]) -> [Int] { + + } +}","func fullBloomFlowers(flowers [][]int, people []int) []int { + +}","object Solution { + def fullBloomFlowers(flowers: Array[Array[Int]], people: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun fullBloomFlowers(flowers: Array, people: IntArray): IntArray { + + } +}","impl Solution { + pub fn full_bloom_flowers(flowers: Vec>, people: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $flowers + * @param Integer[] $people + * @return Integer[] + */ + function fullBloomFlowers($flowers, $people) { + + } +}","function fullBloomFlowers(flowers: number[][], people: number[]): number[] { + +};","(define/contract (full-bloom-flowers flowers people) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?)) + + )","-spec full_bloom_flowers(Flowers :: [[integer()]], People :: [integer()]) -> [integer()]. +full_bloom_flowers(Flowers, People) -> + .","defmodule Solution do + @spec full_bloom_flowers(flowers :: [[integer]], people :: [integer]) :: [integer] + def full_bloom_flowers(flowers, people) do + + end +end","class Solution { + List fullBloomFlowers(List> flowers, List people) { + + } +}", +413,intersection-of-multiple-arrays,Intersection of Multiple Arrays,2248.0,2331.0,"Given a 2D integer array nums where nums[i] is a non-empty array of distinct positive integers, return the list of integers that are present in each array of nums sorted in ascending order. +

 

+

Example 1:

+ +
+Input: nums = [[3,1,2,4,5],[1,2,3,4],[3,4,5,6]]
+Output: [3,4]
+Explanation: 
+The only integers present in each of nums[0] = [3,1,2,4,5], nums[1] = [1,2,3,4], and nums[2] = [3,4,5,6] are 3 and 4, so we return [3,4].
+ +

Example 2:

+ +
+Input: nums = [[1,2,3],[4,5,6]]
+Output: []
+Explanation: 
+There does not exist any integer present both in nums[0] and nums[1], so we return an empty list [].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= sum(nums[i].length) <= 1000
    • +
  • 1 <= nums[i][j] <= 1000
    • +
  • All the values of nums[i] are unique.
    • +
+",1.0,False,"class Solution { +public: + vector intersection(vector>& nums) { + + } +};","class Solution { + public List intersection(int[][] nums) { + + } +}","class Solution(object): + def intersection(self, nums): + """""" + :type nums: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def intersection(self, nums: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* intersection(int** nums, int numsSize, int* numsColSize, int* returnSize){ + +}","public class Solution { + public IList Intersection(int[][] nums) { + + } +}","/** + * @param {number[][]} nums + * @return {number[]} + */ +var intersection = function(nums) { + +};","# @param {Integer[][]} nums +# @return {Integer[]} +def intersection(nums) + +end","class Solution { + func intersection(_ nums: [[Int]]) -> [Int] { + + } +}","func intersection(nums [][]int) []int { + +}","object Solution { + def intersection(nums: Array[Array[Int]]): List[Int] = { + + } +}","class Solution { + fun intersection(nums: Array): List { + + } +}","impl Solution { + pub fn intersection(nums: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $nums + * @return Integer[] + */ + function intersection($nums) { + + } +}","function intersection(nums: number[][]): number[] { + +};","(define/contract (intersection nums) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec intersection(Nums :: [[integer()]]) -> [integer()]. +intersection(Nums) -> + .","defmodule Solution do + @spec intersection(nums :: [[integer]]) :: [integer] + def intersection(nums) do + + end +end","class Solution { + List intersection(List> nums) { + + } +}", +414,maximum-total-beauty-of-the-gardens,Maximum Total Beauty of the Gardens,2234.0,2330.0,"

Alice is a caretaker of n gardens and she wants to plant flowers to maximize the total beauty of all her gardens.

+ +

You are given a 0-indexed integer array flowers of size n, where flowers[i] is the number of flowers already planted in the ith garden. Flowers that are already planted cannot be removed. You are then given another integer newFlowers, which is the maximum number of flowers that Alice can additionally plant. You are also given the integers target, full, and partial.

+ +

A garden is considered complete if it has at least target flowers. The total beauty of the gardens is then determined as the sum of the following:

+ +
    +
  • The number of complete gardens multiplied by full.
    • +
  • The minimum number of flowers in any of the incomplete gardens multiplied by partial. If there are no incomplete gardens, then this value will be 0.
    • +
+ +

Return the maximum total beauty that Alice can obtain after planting at most newFlowers flowers.

+ +

 

+

Example 1:

+ +
+Input: flowers = [1,3,1,1], newFlowers = 7, target = 6, full = 12, partial = 1
+Output: 14
+Explanation: Alice can plant
+- 2 flowers in the 0th garden
+- 3 flowers in the 1st garden
+- 1 flower in the 2nd garden
+- 1 flower in the 3rd garden
+The gardens will then be [3,6,2,2]. She planted a total of 2 + 3 + 1 + 1 = 7 flowers.
+There is 1 garden that is complete.
+The minimum number of flowers in the incomplete gardens is 2.
+Thus, the total beauty is 1 * 12 + 2 * 1 = 12 + 2 = 14.
+No other way of planting flowers can obtain a total beauty higher than 14.
+
+ +

Example 2:

+ +
+Input: flowers = [2,4,5,3], newFlowers = 10, target = 5, full = 2, partial = 6
+Output: 30
+Explanation: Alice can plant
+- 3 flowers in the 0th garden
+- 0 flowers in the 1st garden
+- 0 flowers in the 2nd garden
+- 2 flowers in the 3rd garden
+The gardens will then be [5,4,5,5]. She planted a total of 3 + 0 + 0 + 2 = 5 flowers.
+There are 3 gardens that are complete.
+The minimum number of flowers in the incomplete gardens is 4.
+Thus, the total beauty is 3 * 2 + 4 * 6 = 6 + 24 = 30.
+No other way of planting flowers can obtain a total beauty higher than 30.
+Note that Alice could make all the gardens complete but in this case, she would obtain a lower total beauty.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= flowers.length <= 105
    • +
  • 1 <= flowers[i], target <= 105
    • +
  • 1 <= newFlowers <= 1010
    • +
  • 1 <= full, partial <= 105
    • +
+",3.0,False,"class Solution { +public: + long long maximumBeauty(vector& flowers, long long newFlowers, int target, int full, int partial) { + + } +};","class Solution { + public long maximumBeauty(int[] flowers, long newFlowers, int target, int full, int partial) { + + } +}","class Solution(object): + def maximumBeauty(self, flowers, newFlowers, target, full, partial): + """""" + :type flowers: List[int] + :type newFlowers: int + :type target: int + :type full: int + :type partial: int + :rtype: int + """""" + ","class Solution: + def maximumBeauty(self, flowers: List[int], newFlowers: int, target: int, full: int, partial: int) -> int: + ","long long maximumBeauty(int* flowers, int flowersSize, long long newFlowers, int target, int full, int partial){ + +}","public class Solution { + public long MaximumBeauty(int[] flowers, long newFlowers, int target, int full, int partial) { + + } +}","/** + * @param {number[]} flowers + * @param {number} newFlowers + * @param {number} target + * @param {number} full + * @param {number} partial + * @return {number} + */ +var maximumBeauty = function(flowers, newFlowers, target, full, partial) { + +};","# @param {Integer[]} flowers +# @param {Integer} new_flowers +# @param {Integer} target +# @param {Integer} full +# @param {Integer} partial +# @return {Integer} +def maximum_beauty(flowers, new_flowers, target, full, partial) + +end","class Solution { + func maximumBeauty(_ flowers: [Int], _ newFlowers: Int, _ target: Int, _ full: Int, _ partial: Int) -> Int { + + } +}","func maximumBeauty(flowers []int, newFlowers int64, target int, full int, partial int) int64 { + +}","object Solution { + def maximumBeauty(flowers: Array[Int], newFlowers: Long, target: Int, full: Int, partial: Int): Long = { + + } +}","class Solution { + fun maximumBeauty(flowers: IntArray, newFlowers: Long, target: Int, full: Int, partial: Int): Long { + + } +}","impl Solution { + pub fn maximum_beauty(flowers: Vec, new_flowers: i64, target: i32, full: i32, partial: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $flowers + * @param Integer $newFlowers + * @param Integer $target + * @param Integer $full + * @param Integer $partial + * @return Integer + */ + function maximumBeauty($flowers, $newFlowers, $target, $full, $partial) { + + } +}","function maximumBeauty(flowers: number[], newFlowers: number, target: number, full: number, partial: number): number { + +};","(define/contract (maximum-beauty flowers newFlowers target full partial) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec maximum_beauty(Flowers :: [integer()], NewFlowers :: integer(), Target :: integer(), Full :: integer(), Partial :: integer()) -> integer(). +maximum_beauty(Flowers, NewFlowers, Target, Full, Partial) -> + .","defmodule Solution do + @spec maximum_beauty(flowers :: [integer], new_flowers :: integer, target :: integer, full :: integer, partial :: integer) :: integer + def maximum_beauty(flowers, new_flowers, target, full, partial) do + + end +end","class Solution { + int maximumBeauty(List flowers, int newFlowers, int target, int full, int partial) { + + } +}", +415,maximum-product-after-k-increments,Maximum Product After K Increments,2233.0,2329.0,"

You are given an array of non-negative integers nums and an integer k. In one operation, you may choose any element from nums and increment it by 1.

+ +

Return the maximum product of nums after at most k operations. Since the answer may be very large, return it modulo 109 + 7. Note that you should maximize the product before taking the modulo. 

+ +

 

+

Example 1:

+ +
+Input: nums = [0,4], k = 5
+Output: 20
+Explanation: Increment the first number 5 times.
+Now nums = [5, 4], with a product of 5 * 4 = 20.
+It can be shown that 20 is maximum product possible, so we return 20.
+Note that there may be other ways to increment nums to have the maximum product.
+
+ +

Example 2:

+ +
+Input: nums = [6,3,3,2], k = 2
+Output: 216
+Explanation: Increment the second number 1 time and increment the fourth number 1 time.
+Now nums = [6, 4, 3, 3], with a product of 6 * 4 * 3 * 3 = 216.
+It can be shown that 216 is maximum product possible, so we return 216.
+Note that there may be other ways to increment nums to have the maximum product.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length, k <= 105
    • +
  • 0 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + int maximumProduct(vector& nums, int k) { + + } +};","class Solution { + public int maximumProduct(int[] nums, int k) { + + } +}","class Solution(object): + def maximumProduct(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumProduct(self, nums: List[int], k: int) -> int: + ","int maximumProduct(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MaximumProduct(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumProduct = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def maximum_product(nums, k) + +end","class Solution { + func maximumProduct(_ nums: [Int], _ k: Int) -> Int { + + } +}","func maximumProduct(nums []int, k int) int { + +}","object Solution { + def maximumProduct(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maximumProduct(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn maximum_product(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function maximumProduct($nums, $k) { + + } +}","function maximumProduct(nums: number[], k: number): number { + +};","(define/contract (maximum-product nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_product(Nums :: [integer()], K :: integer()) -> integer(). +maximum_product(Nums, K) -> + .","defmodule Solution do + @spec maximum_product(nums :: [integer], k :: integer) :: integer + def maximum_product(nums, k) do + + end +end","class Solution { + int maximumProduct(List nums, int k) { + + } +}", +418,sum-of-scores-of-built-strings,Sum of Scores of Built Strings,2223.0,2326.0,"

You are building a string s of length n one character at a time, prepending each new character to the front of the string. The strings are labeled from 1 to n, where the string with length i is labeled si.

+ +
    +
  • For example, for s = "abaca", s1 == "a", s2 == "ca", s3 == "aca", etc.
    • +
+ +

The score of si is the length of the longest common prefix between si and sn (Note that s == sn).

+ +

Given the final string s, return the sum of the score of every si.

+ +

 

+

Example 1:

+ +
+Input: s = "babab"
+Output: 9
+Explanation:
+For s1 == "b", the longest common prefix is "b" which has a score of 1.
+For s2 == "ab", there is no common prefix so the score is 0.
+For s3 == "bab", the longest common prefix is "bab" which has a score of 3.
+For s4 == "abab", there is no common prefix so the score is 0.
+For s5 == "babab", the longest common prefix is "babab" which has a score of 5.
+The sum of the scores is 1 + 0 + 3 + 0 + 5 = 9, so we return 9.
+ +

Example 2:

+ +
+Input: s = "azbazbzaz"
+Output: 14
+Explanation: 
+For s2 == "az", the longest common prefix is "az" which has a score of 2.
+For s6 == "azbzaz", the longest common prefix is "azb" which has a score of 3.
+For s9 == "azbazbzaz", the longest common prefix is "azbazbzaz" which has a score of 9.
+For all other si, the score is 0.
+The sum of the scores is 2 + 3 + 9 = 14, so we return 14.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + long long sumScores(string s) { + + } +};","class Solution { + public long sumScores(String s) { + + } +}","class Solution(object): + def sumScores(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def sumScores(self, s: str) -> int: + ","long long sumScores(char * s){ + +}","public class Solution { + public long SumScores(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var sumScores = function(s) { + +};","# @param {String} s +# @return {Integer} +def sum_scores(s) + +end","class Solution { + func sumScores(_ s: String) -> Int { + + } +}","func sumScores(s string) int64 { + +}","object Solution { + def sumScores(s: String): Long = { + + } +}","class Solution { + fun sumScores(s: String): Long { + + } +}","impl Solution { + pub fn sum_scores(s: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function sumScores($s) { + + } +}","function sumScores(s: string): number { + +};","(define/contract (sum-scores s) + (-> string? exact-integer?) + + )","-spec sum_scores(S :: unicode:unicode_binary()) -> integer(). +sum_scores(S) -> + .","defmodule Solution do + @spec sum_scores(s :: String.t) :: integer + def sum_scores(s) do + + end +end","class Solution { + int sumScores(String s) { + + } +}", +419,number-of-ways-to-select-buildings,Number of Ways to Select Buildings,2222.0,2325.0,"

You are given a 0-indexed binary string s which represents the types of buildings along a street where:

+ +
    +
  • s[i] = '0' denotes that the ith building is an office and
    • +
  • s[i] = '1' denotes that the ith building is a restaurant.
    • +
+ +

As a city official, you would like to select 3 buildings for random inspection. However, to ensure variety, no two consecutive buildings out of the selected buildings can be of the same type.

+ +
    +
  • For example, given s = "001101", we cannot select the 1st, 3rd, and 5th buildings as that would form "011" which is not allowed due to having two consecutive buildings of the same type.
    • +
+ +

Return the number of valid ways to select 3 buildings.

+ +

 

+

Example 1:

+ +
+Input: s = "001101"
+Output: 6
+Explanation: 
+The following sets of indices selected are valid:
+- [0,2,4] from "001101" forms "010"
+- [0,3,4] from "001101" forms "010"
+- [1,2,4] from "001101" forms "010"
+- [1,3,4] from "001101" forms "010"
+- [2,4,5] from "001101" forms "101"
+- [3,4,5] from "001101" forms "101"
+No other selection is valid. Thus, there are 6 total ways.
+
+ +

Example 2:

+ +
+Input: s = "11100"
+Output: 0
+Explanation: It can be shown that there are no valid selections.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 105
    • +
  • s[i] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + long long numberOfWays(string s) { + + } +};","class Solution { + public long numberOfWays(String s) { + + } +}","class Solution(object): + def numberOfWays(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def numberOfWays(self, s: str) -> int: + ","long long numberOfWays(char * s){ + +}","public class Solution { + public long NumberOfWays(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var numberOfWays = function(s) { + +};","# @param {String} s +# @return {Integer} +def number_of_ways(s) + +end","class Solution { + func numberOfWays(_ s: String) -> Int { + + } +}","func numberOfWays(s string) int64 { + +}","object Solution { + def numberOfWays(s: String): Long = { + + } +}","class Solution { + fun numberOfWays(s: String): Long { + + } +}","impl Solution { + pub fn number_of_ways(s: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function numberOfWays($s) { + + } +}","function numberOfWays(s: string): number { + +};","(define/contract (number-of-ways s) + (-> string? exact-integer?) + + )","-spec number_of_ways(S :: unicode:unicode_binary()) -> integer(). +number_of_ways(S) -> + .","defmodule Solution do + @spec number_of_ways(s :: String.t) :: integer + def number_of_ways(s) do + + end +end","class Solution { + int numberOfWays(String s) { + + } +}", +422,minimum-weighted-subgraph-with-the-required-paths,Minimum Weighted Subgraph With the Required Paths,2203.0,2321.0,"

You are given an integer n denoting the number of nodes of a weighted directed graph. The nodes are numbered from 0 to n - 1.

+ +

You are also given a 2D integer array edges where edges[i] = [fromi, toi, weighti] denotes that there exists a directed edge from fromi to toi with weight weighti.

+ +

Lastly, you are given three distinct integers src1, src2, and dest denoting three distinct nodes of the graph.

+ +

Return the minimum weight of a subgraph of the graph such that it is possible to reach dest from both src1 and src2 via a set of edges of this subgraph. In case such a subgraph does not exist, return -1.

+ +

A subgraph is a graph whose vertices and edges are subsets of the original graph. The weight of a subgraph is the sum of weights of its constituent edges.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[0,2,2],[0,5,6],[1,0,3],[1,4,5],[2,1,1],[2,3,3],[2,3,4],[3,4,2],[4,5,1]], src1 = 0, src2 = 1, dest = 5
+Output: 9
+Explanation:
+The above figure represents the input graph.
+The blue edges represent one of the subgraphs that yield the optimal answer.
+Note that the subgraph [[1,0,3],[0,5,6]] also yields the optimal answer. It is not possible to get a subgraph with less weight satisfying all the constraints.
+
+ +

Example 2:

+ +
+Input: n = 3, edges = [[0,1,1],[2,1,1]], src1 = 0, src2 = 1, dest = 2
+Output: -1
+Explanation:
+The above figure represents the input graph.
+It can be seen that there does not exist any path from node 1 to node 2, hence there are no subgraphs satisfying all the constraints.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n <= 105
    • +
  • 0 <= edges.length <= 105
    • +
  • edges[i].length == 3
    • +
  • 0 <= fromi, toi, src1, src2, dest <= n - 1
    • +
  • fromi != toi
    • +
  • src1, src2, and dest are pairwise distinct.
    • +
  • 1 <= weight[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + long long minimumWeight(int n, vector>& edges, int src1, int src2, int dest) { + + } +};","class Solution { + public long minimumWeight(int n, int[][] edges, int src1, int src2, int dest) { + + } +}","class Solution(object): + def minimumWeight(self, n, edges, src1, src2, dest): + """""" + :type n: int + :type edges: List[List[int]] + :type src1: int + :type src2: int + :type dest: int + :rtype: int + """""" + ","class Solution: + def minimumWeight(self, n: int, edges: List[List[int]], src1: int, src2: int, dest: int) -> int: + ","long long minimumWeight(int n, int** edges, int edgesSize, int* edgesColSize, int src1, int src2, int dest){ + +}","public class Solution { + public long MinimumWeight(int n, int[][] edges, int src1, int src2, int dest) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} src1 + * @param {number} src2 + * @param {number} dest + * @return {number} + */ +var minimumWeight = function(n, edges, src1, src2, dest) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} src1 +# @param {Integer} src2 +# @param {Integer} dest +# @return {Integer} +def minimum_weight(n, edges, src1, src2, dest) + +end","class Solution { + func minimumWeight(_ n: Int, _ edges: [[Int]], _ src1: Int, _ src2: Int, _ dest: Int) -> Int { + + } +}","func minimumWeight(n int, edges [][]int, src1 int, src2 int, dest int) int64 { + +}","object Solution { + def minimumWeight(n: Int, edges: Array[Array[Int]], src1: Int, src2: Int, dest: Int): Long = { + + } +}","class Solution { + fun minimumWeight(n: Int, edges: Array, src1: Int, src2: Int, dest: Int): Long { + + } +}","impl Solution { + pub fn minimum_weight(n: i32, edges: Vec>, src1: i32, src2: i32, dest: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $src1 + * @param Integer $src2 + * @param Integer $dest + * @return Integer + */ + function minimumWeight($n, $edges, $src1, $src2, $dest) { + + } +}","function minimumWeight(n: number, edges: number[][], src1: number, src2: number, dest: number): number { + +};","(define/contract (minimum-weight n edges src1 src2 dest) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec minimum_weight(N :: integer(), Edges :: [[integer()]], Src1 :: integer(), Src2 :: integer(), Dest :: integer()) -> integer(). +minimum_weight(N, Edges, Src1, Src2, Dest) -> + .","defmodule Solution do + @spec minimum_weight(n :: integer, edges :: [[integer]], src1 :: integer, src2 :: integer, dest :: integer) :: integer + def minimum_weight(n, edges, src1, src2, dest) do + + end +end","class Solution { + int minimumWeight(int n, List> edges, int src1, int src2, int dest) { + + } +}", +424,longest-substring-of-one-repeating-character,Longest Substring of One Repeating Character,2213.0,2319.0,"

You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries.

+ +

The ith query updates the character in s at index queryIndices[i] to the character queryCharacters[i].

+ +

Return an array lengths of length k where lengths[i] is the length of the longest substring of s consisting of only one repeating character after the ith query is performed.

+ +

 

+

Example 1:

+ +
+Input: s = "babacc", queryCharacters = "bcb", queryIndices = [1,3,3]
+Output: [3,3,4]
+Explanation: 
+- 1st query updates s = "bbbacc". The longest substring consisting of one repeating character is "bbb" with length 3.
+- 2nd query updates s = "bbbccc". 
+  The longest substring consisting of one repeating character can be "bbb" or "ccc" with length 3.
+- 3rd query updates s = "bbbbcc". The longest substring consisting of one repeating character is "bbbb" with length 4.
+Thus, we return [3,3,4].
+
+ +

Example 2:

+ +
+Input: s = "abyzz", queryCharacters = "aa", queryIndices = [2,1]
+Output: [2,3]
+Explanation:
+- 1st query updates s = "abazz". The longest substring consisting of one repeating character is "zz" with length 2.
+- 2nd query updates s = "aaazz". The longest substring consisting of one repeating character is "aaa" with length 3.
+Thus, we return [2,3].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
  • k == queryCharacters.length == queryIndices.length
    • +
  • 1 <= k <= 105
    • +
  • queryCharacters consists of lowercase English letters.
    • +
  • 0 <= queryIndices[i] < s.length
    • +
+",3.0,False,"class Solution { +public: + vector longestRepeating(string s, string queryCharacters, vector& queryIndices) { + + } +};","class Solution { + public int[] longestRepeating(String s, String queryCharacters, int[] queryIndices) { + + } +}","class Solution(object): + def longestRepeating(self, s, queryCharacters, queryIndices): + """""" + :type s: str + :type queryCharacters: str + :type queryIndices: List[int] + :rtype: List[int] + """""" + ","class Solution: + def longestRepeating(self, s: str, queryCharacters: str, queryIndices: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* longestRepeating(char * s, char * queryCharacters, int* queryIndices, int queryIndicesSize, int* returnSize){ + +}","public class Solution { + public int[] LongestRepeating(string s, string queryCharacters, int[] queryIndices) { + + } +}","/** + * @param {string} s + * @param {string} queryCharacters + * @param {number[]} queryIndices + * @return {number[]} + */ +var longestRepeating = function(s, queryCharacters, queryIndices) { + +};","# @param {String} s +# @param {String} query_characters +# @param {Integer[]} query_indices +# @return {Integer[]} +def longest_repeating(s, query_characters, query_indices) + +end","class Solution { + func longestRepeating(_ s: String, _ queryCharacters: String, _ queryIndices: [Int]) -> [Int] { + + } +}","func longestRepeating(s string, queryCharacters string, queryIndices []int) []int { + +}","object Solution { + def longestRepeating(s: String, queryCharacters: String, queryIndices: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun longestRepeating(s: String, queryCharacters: String, queryIndices: IntArray): IntArray { + + } +}","impl Solution { + pub fn longest_repeating(s: String, query_characters: String, query_indices: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @param String $queryCharacters + * @param Integer[] $queryIndices + * @return Integer[] + */ + function longestRepeating($s, $queryCharacters, $queryIndices) { + + } +}","function longestRepeating(s: string, queryCharacters: string, queryIndices: number[]): number[] { + +};","(define/contract (longest-repeating s queryCharacters queryIndices) + (-> string? string? (listof exact-integer?) (listof exact-integer?)) + + )","-spec longest_repeating(S :: unicode:unicode_binary(), QueryCharacters :: unicode:unicode_binary(), QueryIndices :: [integer()]) -> [integer()]. +longest_repeating(S, QueryCharacters, QueryIndices) -> + .","defmodule Solution do + @spec longest_repeating(s :: String.t, query_characters :: String.t, query_indices :: [integer]) :: [integer] + def longest_repeating(s, query_characters, query_indices) do + + end +end","class Solution { + List longestRepeating(String s, String queryCharacters, List queryIndices) { + + } +}", +425,maximum-points-in-an-archery-competition,Maximum Points in an Archery Competition,2212.0,2318.0,"

Alice and Bob are opponents in an archery competition. The competition has set the following rules:

+ +
    +
  1. Alice first shoots numArrows arrows and then Bob shoots numArrows arrows.
    2. +
  2. The points are then calculated as follows: +
      +
    1. The target has integer scoring sections ranging from 0 to 11 inclusive.
      2. +
    2. For each section of the target with score k (in between 0 to 11), say Alice and Bob have shot ak and bk arrows on that section respectively. If ak >= bk, then Alice takes k points. If ak < bk, then Bob takes k points.
      3. +
    3. However, if ak == bk == 0, then nobody takes k points.
      4. +
    +
    3. +
+ +
    +
  • +

    For example, if Alice and Bob both shot 2 arrows on the section with score 11, then Alice takes 11 points. On the other hand, if Alice shot 0 arrows on the section with score 11 and Bob shot 2 arrows on that same section, then Bob takes 11 points.

    +
    • +
+ +

You are given the integer numArrows and an integer array aliceArrows of size 12, which represents the number of arrows Alice shot on each scoring section from 0 to 11. Now, Bob wants to maximize the total number of points he can obtain.

+ +

Return the array bobArrows which represents the number of arrows Bob shot on each scoring section from 0 to 11. The sum of the values in bobArrows should equal numArrows.

+ +

If there are multiple ways for Bob to earn the maximum total points, return any one of them.

+ +

 

+

Example 1:

+ +
+Input: numArrows = 9, aliceArrows = [1,1,0,1,0,0,2,1,0,1,2,0]
+Output: [0,0,0,0,1,1,0,0,1,2,3,1]
+Explanation: The table above shows how the competition is scored. 
+Bob earns a total point of 4 + 5 + 8 + 9 + 10 + 11 = 47.
+It can be shown that Bob cannot obtain a score higher than 47 points.
+
+ +

Example 2:

+ +
+Input: numArrows = 3, aliceArrows = [0,0,1,0,0,0,0,0,0,0,0,2]
+Output: [0,0,0,0,0,0,0,0,1,1,1,0]
+Explanation: The table above shows how the competition is scored.
+Bob earns a total point of 8 + 9 + 10 = 27.
+It can be shown that Bob cannot obtain a score higher than 27 points.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= numArrows <= 105
    • +
  • aliceArrows.length == bobArrows.length == 12
    • +
  • 0 <= aliceArrows[i], bobArrows[i] <= numArrows
    • +
  • sum(aliceArrows[i]) == numArrows
    • +
+",2.0,False,"class Solution { +public: + vector maximumBobPoints(int numArrows, vector& aliceArrows) { + + } +};","class Solution { + public int[] maximumBobPoints(int numArrows, int[] aliceArrows) { + + } +}","class Solution(object): + def maximumBobPoints(self, numArrows, aliceArrows): + """""" + :type numArrows: int + :type aliceArrows: List[int] + :rtype: List[int] + """""" + ","class Solution: + def maximumBobPoints(self, numArrows: int, aliceArrows: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maximumBobPoints(int numArrows, int* aliceArrows, int aliceArrowsSize, int* returnSize){ + +}","public class Solution { + public int[] MaximumBobPoints(int numArrows, int[] aliceArrows) { + + } +}","/** + * @param {number} numArrows + * @param {number[]} aliceArrows + * @return {number[]} + */ +var maximumBobPoints = function(numArrows, aliceArrows) { + +};","# @param {Integer} num_arrows +# @param {Integer[]} alice_arrows +# @return {Integer[]} +def maximum_bob_points(num_arrows, alice_arrows) + +end","class Solution { + func maximumBobPoints(_ numArrows: Int, _ aliceArrows: [Int]) -> [Int] { + + } +}","func maximumBobPoints(numArrows int, aliceArrows []int) []int { + +}","object Solution { + def maximumBobPoints(numArrows: Int, aliceArrows: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun maximumBobPoints(numArrows: Int, aliceArrows: IntArray): IntArray { + + } +}","impl Solution { + pub fn maximum_bob_points(num_arrows: i32, alice_arrows: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $numArrows + * @param Integer[] $aliceArrows + * @return Integer[] + */ + function maximumBobPoints($numArrows, $aliceArrows) { + + } +}","function maximumBobPoints(numArrows: number, aliceArrows: number[]): number[] { + +};","(define/contract (maximum-bob-points numArrows aliceArrows) + (-> exact-integer? (listof exact-integer?) (listof exact-integer?)) + + )","-spec maximum_bob_points(NumArrows :: integer(), AliceArrows :: [integer()]) -> [integer()]. +maximum_bob_points(NumArrows, AliceArrows) -> + .","defmodule Solution do + @spec maximum_bob_points(num_arrows :: integer, alice_arrows :: [integer]) :: [integer] + def maximum_bob_points(num_arrows, alice_arrows) do + + end +end","class Solution { + List maximumBobPoints(int numArrows, List aliceArrows) { + + } +}", +426,count-collisions-on-a-road,Count Collisions on a Road,2211.0,2317.0,"

There are n cars on an infinitely long road. The cars are numbered from 0 to n - 1 from left to right and each car is present at a unique point.

+ +

You are given a 0-indexed string directions of length n. directions[i] can be either 'L', 'R', or 'S' denoting whether the ith car is moving towards the left, towards the right, or staying at its current point respectively. Each moving car has the same speed.

+ +

The number of collisions can be calculated as follows:

+ +
    +
  • When two cars moving in opposite directions collide with each other, the number of collisions increases by 2.
    • +
  • When a moving car collides with a stationary car, the number of collisions increases by 1.
    • +
+ +

After a collision, the cars involved can no longer move and will stay at the point where they collided. Other than that, cars cannot change their state or direction of motion.

+ +

Return the total number of collisions that will happen on the road.

+ +

 

+

Example 1:

+ +
+Input: directions = "RLRSLL"
+Output: 5
+Explanation:
+The collisions that will happen on the road are:
+- Cars 0 and 1 will collide with each other. Since they are moving in opposite directions, the number of collisions becomes 0 + 2 = 2.
+- Cars 2 and 3 will collide with each other. Since car 3 is stationary, the number of collisions becomes 2 + 1 = 3.
+- Cars 3 and 4 will collide with each other. Since car 3 is stationary, the number of collisions becomes 3 + 1 = 4.
+- Cars 4 and 5 will collide with each other. After car 4 collides with car 3, it will stay at the point of collision and get hit by car 5. The number of collisions becomes 4 + 1 = 5.
+Thus, the total number of collisions that will happen on the road is 5. 
+
+ +

Example 2:

+ +
+Input: directions = "LLRR"
+Output: 0
+Explanation:
+No cars will collide with each other. Thus, the total number of collisions that will happen on the road is 0.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= directions.length <= 105
    • +
  • directions[i] is either 'L', 'R', or 'S'.
    • +
+",2.0,False,"class Solution { +public: + int countCollisions(string directions) { + + } +};","class Solution { + public int countCollisions(String directions) { + + } +}","class Solution(object): + def countCollisions(self, directions): + """""" + :type directions: str + :rtype: int + """""" + ","class Solution: + def countCollisions(self, directions: str) -> int: + ","int countCollisions(char * directions){ + +}","public class Solution { + public int CountCollisions(string directions) { + + } +}","/** + * @param {string} directions + * @return {number} + */ +var countCollisions = function(directions) { + +};","# @param {String} directions +# @return {Integer} +def count_collisions(directions) + +end","class Solution { + func countCollisions(_ directions: String) -> Int { + + } +}","func countCollisions(directions string) int { + +}","object Solution { + def countCollisions(directions: String): Int = { + + } +}","class Solution { + fun countCollisions(directions: String): Int { + + } +}","impl Solution { + pub fn count_collisions(directions: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $directions + * @return Integer + */ + function countCollisions($directions) { + + } +}","function countCollisions(directions: string): number { + +};","(define/contract (count-collisions directions) + (-> string? exact-integer?) + + )","-spec count_collisions(Directions :: unicode:unicode_binary()) -> integer(). +count_collisions(Directions) -> + .","defmodule Solution do + @spec count_collisions(directions :: String.t) :: integer + def count_collisions(directions) do + + end +end","class Solution { + int countCollisions(String directions) { + + } +}", +429,minimum-white-tiles-after-covering-with-carpets,Minimum White Tiles After Covering With Carpets,2209.0,2311.0,"

You are given a 0-indexed binary string floor, which represents the colors of tiles on a floor:

+ +
    +
  • floor[i] = '0' denotes that the ith tile of the floor is colored black.
    • +
  • On the other hand, floor[i] = '1' denotes that the ith tile of the floor is colored white.
    • +
+ +

You are also given numCarpets and carpetLen. You have numCarpets black carpets, each of length carpetLen tiles. Cover the tiles with the given carpets such that the number of white tiles still visible is minimum. Carpets may overlap one another.

+ +

Return the minimum number of white tiles still visible.

+ +

 

+

Example 1:

+ +
+Input: floor = "10110101", numCarpets = 2, carpetLen = 2
+Output: 2
+Explanation: 
+The figure above shows one way of covering the tiles with the carpets such that only 2 white tiles are visible.
+No other way of covering the tiles with the carpets can leave less than 2 white tiles visible.
+
+ +

Example 2:

+ +
+Input: floor = "11111", numCarpets = 2, carpetLen = 3
+Output: 0
+Explanation: 
+The figure above shows one way of covering the tiles with the carpets such that no white tiles are visible.
+Note that the carpets are able to overlap one another.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= carpetLen <= floor.length <= 1000
    • +
  • floor[i] is either '0' or '1'.
    • +
  • 1 <= numCarpets <= 1000
    • +
+",3.0,False,"class Solution { +public: + int minimumWhiteTiles(string floor, int numCarpets, int carpetLen) { + + } +};","class Solution { + public int minimumWhiteTiles(String floor, int numCarpets, int carpetLen) { + + } +}","class Solution(object): + def minimumWhiteTiles(self, floor, numCarpets, carpetLen): + """""" + :type floor: str + :type numCarpets: int + :type carpetLen: int + :rtype: int + """""" + ","class Solution: + def minimumWhiteTiles(self, floor: str, numCarpets: int, carpetLen: int) -> int: + ","int minimumWhiteTiles(char * floor, int numCarpets, int carpetLen){ + +}","public class Solution { + public int MinimumWhiteTiles(string floor, int numCarpets, int carpetLen) { + + } +}","/** + * @param {string} floor + * @param {number} numCarpets + * @param {number} carpetLen + * @return {number} + */ +var minimumWhiteTiles = function(floor, numCarpets, carpetLen) { + +};","# @param {String} floor +# @param {Integer} num_carpets +# @param {Integer} carpet_len +# @return {Integer} +def minimum_white_tiles(floor, num_carpets, carpet_len) + +end","class Solution { + func minimumWhiteTiles(_ floor: String, _ numCarpets: Int, _ carpetLen: Int) -> Int { + + } +}","func minimumWhiteTiles(floor string, numCarpets int, carpetLen int) int { + +}","object Solution { + def minimumWhiteTiles(floor: String, numCarpets: Int, carpetLen: Int): Int = { + + } +}","class Solution { + fun minimumWhiteTiles(floor: String, numCarpets: Int, carpetLen: Int): Int { + + } +}","impl Solution { + pub fn minimum_white_tiles(floor: String, num_carpets: i32, carpet_len: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $floor + * @param Integer $numCarpets + * @param Integer $carpetLen + * @return Integer + */ + function minimumWhiteTiles($floor, $numCarpets, $carpetLen) { + + } +}","function minimumWhiteTiles(floor: string, numCarpets: number, carpetLen: number): number { + +};","(define/contract (minimum-white-tiles floor numCarpets carpetLen) + (-> string? exact-integer? exact-integer? exact-integer?) + + )","-spec minimum_white_tiles(Floor :: unicode:unicode_binary(), NumCarpets :: integer(), CarpetLen :: integer()) -> integer(). +minimum_white_tiles(Floor, NumCarpets, CarpetLen) -> + .","defmodule Solution do + @spec minimum_white_tiles(floor :: String.t, num_carpets :: integer, carpet_len :: integer) :: integer + def minimum_white_tiles(floor, num_carpets, carpet_len) do + + end +end","class Solution { + int minimumWhiteTiles(String floor, int numCarpets, int carpetLen) { + + } +}", +431,maximize-number-of-subsequences-in-a-string,Maximize Number of Subsequences in a String,2207.0,2309.0,"

You are given a 0-indexed string text and another 0-indexed string pattern of length 2, both of which consist of only lowercase English letters.

+ +

You can add either pattern[0] or pattern[1] anywhere in text exactly once. Note that the character can be added even at the beginning or at the end of text.

+ +

Return the maximum number of times pattern can occur as a subsequence of the modified text.

+ +

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

+ +

 

+

Example 1:

+ +
+Input: text = "abdcdbc", pattern = "ac"
+Output: 4
+Explanation:
+If we add pattern[0] = 'a' in between text[1] and text[2], we get "abadcdbc". Now, the number of times "ac" occurs as a subsequence is 4.
+Some other strings which have 4 subsequences "ac" after adding a character to text are "aabdcdbc" and "abdacdbc".
+However, strings such as "abdcadbc", "abdccdbc", and "abdcdbcc", although obtainable, have only 3 subsequences "ac" and are thus suboptimal.
+It can be shown that it is not possible to get more than 4 subsequences "ac" by adding only one character.
+
+ +

Example 2:

+ +
+Input: text = "aabb", pattern = "ab"
+Output: 6
+Explanation:
+Some of the strings which can be obtained from text and have 6 subsequences "ab" are "aaabb", "aaabb", and "aabbb".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= text.length <= 105
    • +
  • pattern.length == 2
    • +
  • text and pattern consist only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + long long maximumSubsequenceCount(string text, string pattern) { + + } +};","class Solution { + public long maximumSubsequenceCount(String text, String pattern) { + + } +}","class Solution(object): + def maximumSubsequenceCount(self, text, pattern): + """""" + :type text: str + :type pattern: str + :rtype: int + """""" + ","class Solution: + def maximumSubsequenceCount(self, text: str, pattern: str) -> int: + ","long long maximumSubsequenceCount(char * text, char * pattern){ + +}","public class Solution { + public long MaximumSubsequenceCount(string text, string pattern) { + + } +}","/** + * @param {string} text + * @param {string} pattern + * @return {number} + */ +var maximumSubsequenceCount = function(text, pattern) { + +};","# @param {String} text +# @param {String} pattern +# @return {Integer} +def maximum_subsequence_count(text, pattern) + +end","class Solution { + func maximumSubsequenceCount(_ text: String, _ pattern: String) -> Int { + + } +}","func maximumSubsequenceCount(text string, pattern string) int64 { + +}","object Solution { + def maximumSubsequenceCount(text: String, pattern: String): Long = { + + } +}","class Solution { + fun maximumSubsequenceCount(text: String, pattern: String): Long { + + } +}","impl Solution { + pub fn maximum_subsequence_count(text: String, pattern: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $text + * @param String $pattern + * @return Integer + */ + function maximumSubsequenceCount($text, $pattern) { + + } +}","function maximumSubsequenceCount(text: string, pattern: string): number { + +};","(define/contract (maximum-subsequence-count text pattern) + (-> string? string? exact-integer?) + + )","-spec maximum_subsequence_count(Text :: unicode:unicode_binary(), Pattern :: unicode:unicode_binary()) -> integer(). +maximum_subsequence_count(Text, Pattern) -> + .","defmodule Solution do + @spec maximum_subsequence_count(text :: String.t, pattern :: String.t) :: integer + def maximum_subsequence_count(text, pattern) do + + end +end","class Solution { + int maximumSubsequenceCount(String text, String pattern) { + + } +}", +432,divide-array-into-equal-pairs,Divide Array Into Equal Pairs,2206.0,2308.0,"

You 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.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,3,2,2,2]
+Output: true
+Explanation: 
+There are 6 elements in nums, so they should be divided into 6 / 2 = 3 pairs.
+If nums is divided into the pairs (2, 2), (3, 3), and (2, 2), it will satisfy all the conditions.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: false
+Explanation: 
+There is no way to divide nums into 4 / 2 = 2 pairs such that the pairs satisfy every condition.
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == 2 * n
    • +
  • 1 <= n <= 500
    • +
  • 1 <= nums[i] <= 500
    • +
+",1.0,False,"class Solution { +public: + bool divideArray(vector& nums) { + + } +};","class Solution { + public boolean divideArray(int[] nums) { + + } +}","class Solution(object): + def divideArray(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def divideArray(self, nums: List[int]) -> bool: + ","bool divideArray(int* nums, int numsSize){ + +}","public class Solution { + public bool DivideArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var divideArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def divide_array(nums) + +end","class Solution { + func divideArray(_ nums: [Int]) -> Bool { + + } +}","func divideArray(nums []int) bool { + +}","object Solution { + def divideArray(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun divideArray(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn divide_array(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function divideArray($nums) { + + } +}","function divideArray(nums: number[]): boolean { + +};","(define/contract (divide-array nums) + (-> (listof exact-integer?) boolean?) + + )","-spec divide_array(Nums :: [integer()]) -> boolean(). +divide_array(Nums) -> + .","defmodule Solution do + @spec divide_array(nums :: [integer]) :: boolean + def divide_array(nums) do + + end +end","class Solution { + bool divideArray(List nums) { + + } +}", +433,replace-non-coprime-numbers-in-array,Replace Non-Coprime Numbers in Array,2197.0,2307.0,"

You are given an array of integers nums. Perform the following steps:

+ +
    +
  1. Find any two adjacent numbers in nums that are non-coprime.
    2. +
  2. If no such numbers are found, stop the process.
    3. +
  3. Otherwise, delete the two numbers and replace them with their LCM (Least Common Multiple).
    4. +
  4. Repeat this process as long as you keep finding two adjacent non-coprime numbers.
    5. +
+ +

Return the final modified array. It can be shown that replacing adjacent non-coprime numbers in any arbitrary order will lead to the same result.

+ +

The test cases are generated such that the values in the final array are less than or equal to 108.

+ +

Two values x and y are non-coprime if GCD(x, y) > 1 where GCD(x, y) is the Greatest Common Divisor of x and y.

+ +

 

+

Example 1:

+ +
+Input: nums = [6,4,3,2,7,6,2]
+Output: [12,7,6]
+Explanation: 
+- (6, 4) are non-coprime with LCM(6, 4) = 12. Now, nums = [12,3,2,7,6,2].
+- (12, 3) are non-coprime with LCM(12, 3) = 12. Now, nums = [12,2,7,6,2].
+- (12, 2) are non-coprime with LCM(12, 2) = 12. Now, nums = [12,7,6,2].
+- (6, 2) are non-coprime with LCM(6, 2) = 6. Now, nums = [12,7,6].
+There are no more adjacent non-coprime numbers in nums.
+Thus, the final modified array is [12,7,6].
+Note that there are other ways to obtain the same resultant array.
+
+ +

Example 2:

+ +
+Input: nums = [2,2,1,1,3,3,3]
+Output: [2,1,1,3]
+Explanation: 
+- (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,3,3].
+- (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,3].
+- (2, 2) are non-coprime with LCM(2, 2) = 2. Now, nums = [2,1,1,3].
+There are no more adjacent non-coprime numbers in nums.
+Thus, the final modified array is [2,1,1,3].
+Note that there are other ways to obtain the same resultant array.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
  • The test cases are generated such that the values in the final array are less than or equal to 108.
    • +
+",3.0,False,"class Solution { +public: + vector replaceNonCoprimes(vector& nums) { + + } +};","class Solution { + public List replaceNonCoprimes(int[] nums) { + + } +}","class Solution(object): + def replaceNonCoprimes(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def replaceNonCoprimes(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* replaceNonCoprimes(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public IList ReplaceNonCoprimes(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var replaceNonCoprimes = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def replace_non_coprimes(nums) + +end","class Solution { + func replaceNonCoprimes(_ nums: [Int]) -> [Int] { + + } +}","func replaceNonCoprimes(nums []int) []int { + +}","object Solution { + def replaceNonCoprimes(nums: Array[Int]): List[Int] = { + + } +}","class Solution { + fun replaceNonCoprimes(nums: IntArray): List { + + } +}","impl Solution { + pub fn replace_non_coprimes(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function replaceNonCoprimes($nums) { + + } +}","function replaceNonCoprimes(nums: number[]): number[] { + +};","(define/contract (replace-non-coprimes nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec replace_non_coprimes(Nums :: [integer()]) -> [integer()]. +replace_non_coprimes(Nums) -> + .","defmodule Solution do + @spec replace_non_coprimes(nums :: [integer]) :: [integer] + def replace_non_coprimes(nums) do + + end +end","class Solution { + List replaceNonCoprimes(List nums) { + + } +}", +434,create-binary-tree-from-descriptions,Create Binary Tree From Descriptions,2196.0,2306.0,"

You are given a 2D integer array descriptions where descriptions[i] = [parenti, childi, isLefti] indicates that parenti is the parent of childi in a binary tree of unique values. Furthermore,

+ +
    +
  • If isLefti == 1, then childi is the left child of parenti.
    • +
  • If isLefti == 0, then childi is the right child of parenti.
    • +
+ +

Construct the binary tree described by descriptions and return its root.

+ +

The test cases will be generated such that the binary tree is valid.

+ +

 

+

Example 1:

+ +
+Input: descriptions = [[20,15,1],[20,17,0],[50,20,1],[50,80,0],[80,19,1]]
+Output: [50,20,80,15,17,19]
+Explanation: The root node is the node with value 50 since it has no parent.
+The resulting binary tree is shown in the diagram.
+
+ +

Example 2:

+ +
+Input: descriptions = [[1,2,1],[2,3,0],[3,4,1]]
+Output: [1,2,null,null,3,4]
+Explanation: The root node is the node with value 1 since it has no parent.
+The resulting binary tree is shown in the diagram.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= descriptions.length <= 104
    • +
  • descriptions[i].length == 3
    • +
  • 1 <= parenti, childi <= 105
    • +
  • 0 <= isLefti <= 1
    • +
  • The binary tree described by descriptions is valid.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* createBinaryTree(vector>& descriptions) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode createBinaryTree(int[][] descriptions) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def createBinaryTree(self, descriptions): + """""" + :type descriptions: List[List[int]] + :rtype: Optional[TreeNode] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def createBinaryTree(self, descriptions: List[List[int]]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* createBinaryTree(int** descriptions, int descriptionsSize, int* descriptionsColSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode CreateBinaryTree(int[][] descriptions) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {number[][]} descriptions + * @return {TreeNode} + */ +var createBinaryTree = function(descriptions) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {Integer[][]} descriptions +# @return {TreeNode} +def create_binary_tree(descriptions) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func createBinaryTree(_ descriptions: [[Int]]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func createBinaryTree(descriptions [][]int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def createBinaryTree(descriptions: Array[Array[Int]]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun createBinaryTree(descriptions: Array): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn create_binary_tree(descriptions: Vec>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param Integer[][] $descriptions + * @return TreeNode + */ + function createBinaryTree($descriptions) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function createBinaryTree(descriptions: number[][]): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (create-binary-tree descriptions) + (-> (listof (listof exact-integer?)) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec create_binary_tree(Descriptions :: [[integer()]]) -> #tree_node{} | null. +create_binary_tree(Descriptions) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec create_binary_tree(descriptions :: [[integer]]) :: TreeNode.t | nil + def create_binary_tree(descriptions) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? createBinaryTree(List> descriptions) { + + } +}", +437,count-array-pairs-divisible-by-k,Count Array Pairs Divisible by K,2183.0,2301.0,"

Given a 0-indexed integer array nums of length n and an integer k, return the number of pairs (i, j) such that:

+ +
    +
  • 0 <= i < j <= n - 1 and
    • +
  • nums[i] * nums[j] is divisible by k.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5], k = 2
+Output: 7
+Explanation: 
+The 7 pairs of indices whose corresponding products are divisible by 2 are
+(0, 1), (0, 3), (1, 2), (1, 3), (1, 4), (2, 3), and (3, 4).
+Their products are 2, 4, 6, 8, 10, 12, and 20 respectively.
+Other pairs such as (0, 2) and (2, 4) have products 3 and 15 respectively, which are not divisible by 2.    
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4], k = 5
+Output: 0
+Explanation: There does not exist any pair of indices whose corresponding product is divisible by 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i], k <= 105
    • +
+",3.0,False,"class Solution { +public: + long long countPairs(vector& nums, int k) { + + } +};","class Solution { + public long countPairs(int[] nums, int k) { + + } +}","class Solution(object): + def countPairs(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countPairs(self, nums: List[int], k: int) -> int: + ","long long countPairs(int* nums, int numsSize, int k){ + +}","public class Solution { + public long CountPairs(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countPairs = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_pairs(nums, k) + +end","class Solution { + func countPairs(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countPairs(nums []int, k int) int64 { + +}","object Solution { + def countPairs(nums: Array[Int], k: Int): Long = { + + } +}","class Solution { + fun countPairs(nums: IntArray, k: Int): Long { + + } +}","impl Solution { + pub fn count_pairs(nums: Vec, k: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countPairs($nums, $k) { + + } +}","function countPairs(nums: number[], k: number): number { + +};","(define/contract (count-pairs nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_pairs(Nums :: [integer()], K :: integer()) -> integer(). +count_pairs(Nums, K) -> + .","defmodule Solution do + @spec count_pairs(nums :: [integer], k :: integer) :: integer + def count_pairs(nums, k) do + + end +end","class Solution { + int countPairs(List nums, int k) { + + } +}", +439,merge-nodes-in-between-zeros,Merge Nodes in Between Zeros,2181.0,2299.0,"

You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.

+ +

For every two consecutive 0's, merge all the nodes lying in between them into a single node whose value is the sum of all the merged nodes. The modified list should not contain any 0's.

+ +

Return the head of the modified linked list.

+ +

 

+

Example 1:

+ +
+Input: head = [0,3,1,0,4,5,2,0]
+Output: [4,11]
+Explanation: 
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 3 + 1 = 4.
+- The sum of the nodes marked in red: 4 + 5 + 2 = 11.
+
+ +

Example 2:

+ +
+Input: head = [0,1,0,3,0,2,2,0]
+Output: [1,3,4]
+Explanation: 
+The above figure represents the given linked list. The modified list contains
+- The sum of the nodes marked in green: 1 = 1.
+- The sum of the nodes marked in red: 3 = 3.
+- The sum of the nodes marked in yellow: 2 + 2 = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [3, 2 * 105].
    • +
  • 0 <= Node.val <= 1000
    • +
  • There are no two consecutive nodes with Node.val == 0.
    • +
  • The beginning and end of the linked list have Node.val == 0.
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* mergeNodes(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode mergeNodes(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def mergeNodes(self, head): + """""" + :type head: Optional[ListNode] + :rtype: Optional[ListNode] + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def mergeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* mergeNodes(struct ListNode* head){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeNodes(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var mergeNodes = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {ListNode} +def merge_nodes(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func mergeNodes(_ head: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func mergeNodes(head *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def mergeNodes(head: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun mergeNodes(head: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn merge_nodes(head: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return ListNode + */ + function mergeNodes($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function mergeNodes(head: ListNode | null): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (merge-nodes head) + (-> (or/c list-node? #f) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec merge_nodes(Head :: #list_node{} | null) -> #list_node{} | null. +merge_nodes(Head) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec merge_nodes(head :: ListNode.t | nil) :: ListNode.t | nil + def merge_nodes(head) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? mergeNodes(ListNode? head) { + + } +}", +441,minimum-time-to-finish-the-race,Minimum Time to Finish the Race,2188.0,2295.0,"

You are given a 0-indexed 2D integer array tires where tires[i] = [fi, ri] indicates that the ith tire can finish its xth successive lap in fi * ri(x-1) seconds.

+ +
    +
  • For example, if fi = 3 and ri = 2, then the tire would finish its 1st lap in 3 seconds, its 2nd lap in 3 * 2 = 6 seconds, its 3rd lap in 3 * 22 = 12 seconds, etc.
    • +
+ +

You are also given an integer changeTime and an integer numLaps.

+ +

The race consists of numLaps laps and you may start the race with any tire. You have an unlimited supply of each tire and after every lap, you may change to any given tire (including the current tire type) if you wait changeTime seconds.

+ +

Return the minimum time to finish the race.

+ +

 

+

Example 1:

+ +
+Input: tires = [[2,3],[3,4]], changeTime = 5, numLaps = 4
+Output: 21
+Explanation: 
+Lap 1: Start with tire 0 and finish the lap in 2 seconds.
+Lap 2: Continue with tire 0 and finish the lap in 2 * 3 = 6 seconds.
+Lap 3: Change tires to a new tire 0 for 5 seconds and then finish the lap in another 2 seconds.
+Lap 4: Continue with tire 0 and finish the lap in 2 * 3 = 6 seconds.
+Total time = 2 + 6 + 5 + 2 + 6 = 21 seconds.
+The minimum time to complete the race is 21 seconds.
+
+ +

Example 2:

+ +
+Input: tires = [[1,10],[2,2],[3,4]], changeTime = 6, numLaps = 5
+Output: 25
+Explanation: 
+Lap 1: Start with tire 1 and finish the lap in 2 seconds.
+Lap 2: Continue with tire 1 and finish the lap in 2 * 2 = 4 seconds.
+Lap 3: Change tires to a new tire 1 for 6 seconds and then finish the lap in another 2 seconds.
+Lap 4: Continue with tire 1 and finish the lap in 2 * 2 = 4 seconds.
+Lap 5: Change tires to tire 0 for 6 seconds then finish the lap in another 1 second.
+Total time = 2 + 4 + 6 + 2 + 4 + 6 + 1 = 25 seconds.
+The minimum time to complete the race is 25 seconds. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tires.length <= 105
    • +
  • tires[i].length == 2
    • +
  • 1 <= fi, changeTime <= 105
    • +
  • 2 <= ri <= 105
    • +
  • 1 <= numLaps <= 1000
    • +
+",3.0,False,"class Solution { +public: + int minimumFinishTime(vector>& tires, int changeTime, int numLaps) { + + } +};","class Solution { + public int minimumFinishTime(int[][] tires, int changeTime, int numLaps) { + + } +}","class Solution(object): + def minimumFinishTime(self, tires, changeTime, numLaps): + """""" + :type tires: List[List[int]] + :type changeTime: int + :type numLaps: int + :rtype: int + """""" + ","class Solution: + def minimumFinishTime(self, tires: List[List[int]], changeTime: int, numLaps: int) -> int: + ","int minimumFinishTime(int** tires, int tiresSize, int* tiresColSize, int changeTime, int numLaps){ + +}","public class Solution { + public int MinimumFinishTime(int[][] tires, int changeTime, int numLaps) { + + } +}","/** + * @param {number[][]} tires + * @param {number} changeTime + * @param {number} numLaps + * @return {number} + */ +var minimumFinishTime = function(tires, changeTime, numLaps) { + +};","# @param {Integer[][]} tires +# @param {Integer} change_time +# @param {Integer} num_laps +# @return {Integer} +def minimum_finish_time(tires, change_time, num_laps) + +end","class Solution { + func minimumFinishTime(_ tires: [[Int]], _ changeTime: Int, _ numLaps: Int) -> Int { + + } +}","func minimumFinishTime(tires [][]int, changeTime int, numLaps int) int { + +}","object Solution { + def minimumFinishTime(tires: Array[Array[Int]], changeTime: Int, numLaps: Int): Int = { + + } +}","class Solution { + fun minimumFinishTime(tires: Array, changeTime: Int, numLaps: Int): Int { + + } +}","impl Solution { + pub fn minimum_finish_time(tires: Vec>, change_time: i32, num_laps: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $tires + * @param Integer $changeTime + * @param Integer $numLaps + * @return Integer + */ + function minimumFinishTime($tires, $changeTime, $numLaps) { + + } +}","function minimumFinishTime(tires: number[][], changeTime: number, numLaps: number): number { + +};","(define/contract (minimum-finish-time tires changeTime numLaps) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec minimum_finish_time(Tires :: [[integer()]], ChangeTime :: integer(), NumLaps :: integer()) -> integer(). +minimum_finish_time(Tires, ChangeTime, NumLaps) -> + .","defmodule Solution do + @spec minimum_finish_time(tires :: [[integer]], change_time :: integer, num_laps :: integer) :: integer + def minimum_finish_time(tires, change_time, num_laps) do + + end +end","class Solution { + int minimumFinishTime(List> tires, int changeTime, int numLaps) { + + } +}", +443,minimum-number-of-steps-to-make-two-strings-anagram-ii,Minimum Number of Steps to Make Two Strings Anagram II,2186.0,2293.0,"

You are given two strings s and t. In one step, you can append any character to either s or t.

+ +

Return the minimum number of steps to make s and t anagrams of each other.

+ +

An anagram of a string is a string that contains the same characters with a different (or the same) ordering.

+ +

 

+

Example 1:

+ +
+Input: s = "leetcode", t = "coats"
+Output: 7
+Explanation: 
+- In 2 steps, we can append the letters in "as" onto s = "leetcode", forming s = "leetcodeas".
+- In 5 steps, we can append the letters in "leede" onto t = "coats", forming t = "coatsleede".
+"leetcodeas" and "coatsleede" are now anagrams of each other.
+We used a total of 2 + 5 = 7 steps.
+It can be shown that there is no way to make them anagrams of each other with less than 7 steps.
+
+ +

Example 2:

+ +
+Input: s = "night", t = "thing"
+Output: 0
+Explanation: The given strings are already anagrams of each other. Thus, we do not need any further steps.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 2 * 105
    • +
  • s and t consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minSteps(string s, string t) { + + } +};","class Solution { + public int minSteps(String s, String t) { + + } +}","class Solution(object): + def minSteps(self, s, t): + """""" + :type s: str + :type t: str + :rtype: int + """""" + ","class Solution: + def minSteps(self, s: str, t: str) -> int: + ","int minSteps(char * s, char * t){ + +}","public class Solution { + public int MinSteps(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var minSteps = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Integer} +def min_steps(s, t) + +end","class Solution { + func minSteps(_ s: String, _ t: String) -> Int { + + } +}","func minSteps(s string, t string) int { + +}","object Solution { + def minSteps(s: String, t: String): Int = { + + } +}","class Solution { + fun minSteps(s: String, t: String): Int { + + } +}","impl Solution { + pub fn min_steps(s: String, t: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Integer + */ + function minSteps($s, $t) { + + } +}","function minSteps(s: string, t: string): number { + +};","(define/contract (min-steps s t) + (-> string? string? exact-integer?) + + )","-spec min_steps(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> integer(). +min_steps(S, T) -> + .","defmodule Solution do + @spec min_steps(s :: String.t, t :: String.t) :: integer + def min_steps(s, t) do + + end +end","class Solution { + int minSteps(String s, String t) { + + } +}", +445,maximum-and-sum-of-array,Maximum AND Sum of Array,2172.0,2291.0,"

You are given an integer array nums of length n and an integer numSlots such that 2 * numSlots >= n. There are numSlots slots numbered from 1 to numSlots.

+ +

You have to place all n integers into the slots such that each slot contains at most two numbers. The AND sum of a given placement is the sum of the bitwise AND of every number with its respective slot number.

+ +
    +
  • For example, the AND sum of placing the numbers [1, 3] into slot 1 and [4, 6] into slot 2 is equal to (1 AND 1) + (3 AND 1) + (4 AND 2) + (6 AND 2) = 1 + 1 + 0 + 2 = 4.
    • +
+ +

Return the maximum possible AND sum of nums given numSlots slots.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5,6], numSlots = 3
+Output: 9
+Explanation: One possible placement is [1, 4] into slot 1, [2, 6] into slot 2, and [3, 5] into slot 3. 
+This gives the maximum AND sum of (1 AND 1) + (4 AND 1) + (2 AND 2) + (6 AND 2) + (3 AND 3) + (5 AND 3) = 1 + 0 + 2 + 2 + 3 + 1 = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,10,4,7,1], numSlots = 9
+Output: 24
+Explanation: One possible placement is [1, 1] into slot 1, [3] into slot 3, [4] into slot 4, [7] into slot 7, and [10] into slot 9.
+This gives the maximum AND sum of (1 AND 1) + (1 AND 1) + (3 AND 3) + (4 AND 4) + (7 AND 7) + (10 AND 9) = 1 + 1 + 3 + 4 + 7 + 8 = 24.
+Note that slots 2, 5, 6, and 8 are empty which is permitted.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= numSlots <= 9
    • +
  • 1 <= n <= 2 * numSlots
    • +
  • 1 <= nums[i] <= 15
    • +
+",3.0,False,"class Solution { +public: + int maximumANDSum(vector& nums, int numSlots) { + + } +};","class Solution { + public int maximumANDSum(int[] nums, int numSlots) { + + } +}","class Solution(object): + def maximumANDSum(self, nums, numSlots): + """""" + :type nums: List[int] + :type numSlots: int + :rtype: int + """""" + ","class Solution: + def maximumANDSum(self, nums: List[int], numSlots: int) -> int: + ","int maximumANDSum(int* nums, int numsSize, int numSlots){ + +}","public class Solution { + public int MaximumANDSum(int[] nums, int numSlots) { + + } +}","/** + * @param {number[]} nums + * @param {number} numSlots + * @return {number} + */ +var maximumANDSum = function(nums, numSlots) { + +};","# @param {Integer[]} nums +# @param {Integer} num_slots +# @return {Integer} +def maximum_and_sum(nums, num_slots) + +end","class Solution { + func maximumANDSum(_ nums: [Int], _ numSlots: Int) -> Int { + + } +}","func maximumANDSum(nums []int, numSlots int) int { + +}","object Solution { + def maximumANDSum(nums: Array[Int], numSlots: Int): Int = { + + } +}","class Solution { + fun maximumANDSum(nums: IntArray, numSlots: Int): Int { + + } +}","impl Solution { + pub fn maximum_and_sum(nums: Vec, num_slots: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $numSlots + * @return Integer + */ + function maximumANDSum($nums, $numSlots) { + + } +}","function maximumANDSum(nums: number[], numSlots: number): number { + +};","(define/contract (maximum-and-sum nums numSlots) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_and_sum(Nums :: [integer()], NumSlots :: integer()) -> integer(). +maximum_and_sum(Nums, NumSlots) -> + .","defmodule Solution do + @spec maximum_and_sum(nums :: [integer], num_slots :: integer) :: integer + def maximum_and_sum(nums, num_slots) do + + end +end","class Solution { + int maximumANDSum(List nums, int numSlots) { + + } +}", +449,minimum-time-to-remove-all-cars-containing-illegal-goods,Minimum Time to Remove All Cars Containing Illegal Goods,2167.0,2286.0,"

You are given a 0-indexed binary string s which represents a sequence of train cars. s[i] = '0' denotes that the ith car does not contain illegal goods and s[i] = '1' denotes that the ith car does contain illegal goods.

+ +

As the train conductor, you would like to get rid of all the cars containing illegal goods. You can do any of the following three operations any number of times:

+ +
    +
  1. Remove a train car from the left end (i.e., remove s[0]) which takes 1 unit of time.
    2. +
  2. Remove a train car from the right end (i.e., remove s[s.length - 1]) which takes 1 unit of time.
    3. +
  3. Remove a train car from anywhere in the sequence which takes 2 units of time.
    4. +
+ +

Return the minimum time to remove all the cars containing illegal goods.

+ +

Note that an empty sequence of cars is considered to have no cars containing illegal goods.

+ +

 

+

Example 1:

+ +
+Input: s = "1100101"
+Output: 5
+Explanation: 
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end. Time taken is 1.
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2 + 1 + 2 = 5. 
+
+An alternative way is to
+- remove a car from the left end 2 times. Time taken is 2 * 1 = 2.
+- remove a car from the right end 3 times. Time taken is 3 * 1 = 3.
+This also obtains a total time of 2 + 3 = 5.
+
+5 is the minimum time taken to remove all the cars containing illegal goods. 
+There are no other ways to remove them with less time.
+
+ +

Example 2:

+ +
+Input: s = "0010"
+Output: 2
+Explanation:
+One way to remove all the cars containing illegal goods from the sequence is to
+- remove a car from the left end 3 times. Time taken is 3 * 1 = 3.
+This obtains a total time of 3.
+
+Another way to remove all the cars containing illegal goods from the sequence is to
+- remove the car containing illegal goods found in the middle. Time taken is 2.
+This obtains a total time of 2.
+
+Another way to remove all the cars containing illegal goods from the sequence is to 
+- remove a car from the right end 2 times. Time taken is 2 * 1 = 2. 
+This obtains a total time of 2.
+
+2 is the minimum time taken to remove all the cars containing illegal goods. 
+There are no other ways to remove them with less time.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2 * 105
    • +
  • s[i] is either '0' or '1'.
    • +
+",3.0,False,"class Solution { +public: + int minimumTime(string s) { + + } +};","class Solution { + public int minimumTime(String s) { + + } +}","class Solution(object): + def minimumTime(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minimumTime(self, s: str) -> int: + ","int minimumTime(char * s){ + +}","public class Solution { + public int MinimumTime(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minimumTime = function(s) { + +};","# @param {String} s +# @return {Integer} +def minimum_time(s) + +end","class Solution { + func minimumTime(_ s: String) -> Int { + + } +}","func minimumTime(s string) int { + +}","object Solution { + def minimumTime(s: String): Int = { + + } +}","class Solution { + fun minimumTime(s: String): Int { + + } +}","impl Solution { + pub fn minimum_time(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minimumTime($s) { + + } +}","function minimumTime(s: string): number { + +};","(define/contract (minimum-time s) + (-> string? exact-integer?) + + )","-spec minimum_time(S :: unicode:unicode_binary()) -> integer(). +minimum_time(S) -> + .","defmodule Solution do + @spec minimum_time(s :: String.t) :: integer + def minimum_time(s) do + + end +end","class Solution { + int minimumTime(String s) { + + } +}", +453,count-good-triplets-in-an-array,Count Good Triplets in an Array,2179.0,2280.0,"

You are given two 0-indexed arrays nums1 and nums2 of length n, both of which are permutations of [0, 1, ..., n - 1].

+ +

A good triplet is a set of 3 distinct values which are present in increasing order by position both in nums1 and nums2. In other words, if we consider pos1v as the index of the value v in nums1 and pos2v as the index of the value v in nums2, then a good triplet will be a set (x, y, z) where 0 <= x, y, z <= n - 1, such that pos1x < pos1y < pos1z and pos2x < pos2y < pos2z.

+ +

Return the total number of good triplets.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [2,0,1,3], nums2 = [0,1,2,3]
+Output: 1
+Explanation: 
+There are 4 triplets (x,y,z) such that pos1x < pos1y < pos1z. They are (2,0,1), (2,0,3), (2,1,3), and (0,1,3). 
+Out of those triplets, only the triplet (0,1,3) satisfies pos2x < pos2y < pos2z. Hence, there is only 1 good triplet.
+
+ +

Example 2:

+ +
+Input: nums1 = [4,0,1,3,2], nums2 = [4,1,0,2,3]
+Output: 4
+Explanation: The 4 good triplets are (4,0,3), (4,0,2), (4,1,3), and (4,1,2).
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
    • +
  • 3 <= n <= 105
    • +
  • 0 <= nums1[i], nums2[i] <= n - 1
    • +
  • nums1 and nums2 are permutations of [0, 1, ..., n - 1].
    • +
+",3.0,False,"class Solution { +public: + long long goodTriplets(vector& nums1, vector& nums2) { + + } +};","class Solution { + public long goodTriplets(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def goodTriplets(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def goodTriplets(self, nums1: List[int], nums2: List[int]) -> int: + ","long long goodTriplets(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public long GoodTriplets(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var goodTriplets = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def good_triplets(nums1, nums2) + +end","class Solution { + func goodTriplets(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func goodTriplets(nums1 []int, nums2 []int) int64 { + +}","object Solution { + def goodTriplets(nums1: Array[Int], nums2: Array[Int]): Long = { + + } +}","class Solution { + fun goodTriplets(nums1: IntArray, nums2: IntArray): Long { + + } +}","impl Solution { + pub fn good_triplets(nums1: Vec, nums2: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function goodTriplets($nums1, $nums2) { + + } +}","function goodTriplets(nums1: number[], nums2: number[]): number { + +};","(define/contract (good-triplets nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec good_triplets(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +good_triplets(Nums1, Nums2) -> + .","defmodule Solution do + @spec good_triplets(nums1 :: [integer], nums2 :: [integer]) :: integer + def good_triplets(nums1, nums2) do + + end +end","class Solution { + int goodTriplets(List nums1, List nums2) { + + } +}", +455,find-three-consecutive-integers-that-sum-to-a-given-number,Find Three Consecutive Integers That Sum to a Given Number,2177.0,2278.0,"

Given an integer num, return three consecutive integers (as a sorted array) that sum to num. If num cannot be expressed as the sum of three consecutive integers, return an empty array.

+ +

 

+

Example 1:

+ +
+Input: num = 33
+Output: [10,11,12]
+Explanation: 33 can be expressed as 10 + 11 + 12 = 33.
+10, 11, 12 are 3 consecutive integers, so we return [10, 11, 12].
+
+ +

Example 2:

+ +
+Input: num = 4
+Output: []
+Explanation: There is no way to express 4 as the sum of 3 consecutive integers.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 1015
    • +
+",2.0,False,"class Solution { +public: + vector sumOfThree(long long num) { + + } +};","class Solution { + public long[] sumOfThree(long num) { + + } +}","class Solution(object): + def sumOfThree(self, num): + """""" + :type num: int + :rtype: List[int] + """""" + ","class Solution: + def sumOfThree(self, num: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* sumOfThree(long long num, int* returnSize){ + +}","public class Solution { + public long[] SumOfThree(long num) { + + } +}","/** + * @param {number} num + * @return {number[]} + */ +var sumOfThree = function(num) { + +};","# @param {Integer} num +# @return {Integer[]} +def sum_of_three(num) + +end","class Solution { + func sumOfThree(_ num: Int) -> [Int] { + + } +}","func sumOfThree(num int64) []int64 { + +}","object Solution { + def sumOfThree(num: Long): Array[Long] = { + + } +}","class Solution { + fun sumOfThree(num: Long): LongArray { + + } +}","impl Solution { + pub fn sum_of_three(num: i64) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Integer[] + */ + function sumOfThree($num) { + + } +}","function sumOfThree(num: number): number[] { + +};","(define/contract (sum-of-three num) + (-> exact-integer? (listof exact-integer?)) + + )","-spec sum_of_three(Num :: integer()) -> [integer()]. +sum_of_three(Num) -> + .","defmodule Solution do + @spec sum_of_three(num :: integer) :: [integer] + def sum_of_three(num) do + + end +end","class Solution { + List sumOfThree(int num) { + + } +}", +457,groups-of-strings,Groups of Strings,2157.0,2276.0,"

You are given a 0-indexed array of strings words. Each string consists of lowercase English letters only. No letter occurs more than once in any string of words.

+ +

Two strings s1 and s2 are said to be connected if the set of letters of s2 can be obtained from the set of letters of s1 by any one of the following operations:

+ +
    +
  • Adding exactly one letter to the set of the letters of s1.
    • +
  • Deleting exactly one letter from the set of the letters of s1.
    • +
  • Replacing exactly one letter from the set of the letters of s1 with any letter, including itself.
    • +
+ +

The array words can be divided into one or more non-intersecting groups. A string belongs to a group if any one of the following is true:

+ +
    +
  • It is connected to at least one other string of the group.
    • +
  • It is the only string present in the group.
    • +
+ +

Note that the strings in words should be grouped in such a manner that a string belonging to a group cannot be connected to a string present in any other group. It can be proved that such an arrangement is always unique.

+ +

Return an array ans of size 2 where:

+ +
    +
  • ans[0] is the maximum number of groups words can be divided into, and
    • +
  • ans[1] is the size of the largest group.
    • +
+ +

 

+

Example 1:

+ +
+Input: words = ["a","b","ab","cde"]
+Output: [2,3]
+Explanation:
+- words[0] can be used to obtain words[1] (by replacing 'a' with 'b'), and words[2] (by adding 'b'). So words[0] is connected to words[1] and words[2].
+- words[1] can be used to obtain words[0] (by replacing 'b' with 'a'), and words[2] (by adding 'a'). So words[1] is connected to words[0] and words[2].
+- words[2] can be used to obtain words[0] (by deleting 'b'), and words[1] (by deleting 'a'). So words[2] is connected to words[0] and words[1].
+- words[3] is not connected to any string in words.
+Thus, words can be divided into 2 groups ["a","b","ab"] and ["cde"]. The size of the largest group is 3.  
+
+ +

Example 2:

+ +
+Input: words = ["a","ab","abc"]
+Output: [1,3]
+Explanation:
+- words[0] is connected to words[1].
+- words[1] is connected to words[0] and words[2].
+- words[2] is connected to words[1].
+Since all strings are connected to each other, they should be grouped together.
+Thus, the size of the largest group is 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 2 * 104
    • +
  • 1 <= words[i].length <= 26
    • +
  • words[i] consists of lowercase English letters only.
    • +
  • No letter occurs more than once in words[i].
    • +
+",3.0,False,"class Solution { +public: + vector groupStrings(vector& words) { + + } +};","class Solution { + public int[] groupStrings(String[] words) { + + } +}","class Solution(object): + def groupStrings(self, words): + """""" + :type words: List[str] + :rtype: List[int] + """""" + ","class Solution: + def groupStrings(self, words: List[str]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* groupStrings(char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public int[] GroupStrings(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number[]} + */ +var groupStrings = function(words) { + +};","# @param {String[]} words +# @return {Integer[]} +def group_strings(words) + +end","class Solution { + func groupStrings(_ words: [String]) -> [Int] { + + } +}","func groupStrings(words []string) []int { + +}","object Solution { + def groupStrings(words: Array[String]): Array[Int] = { + + } +}","class Solution { + fun groupStrings(words: Array): IntArray { + + } +}","impl Solution { + pub fn group_strings(words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer[] + */ + function groupStrings($words) { + + } +}","function groupStrings(words: string[]): number[] { + +};","(define/contract (group-strings words) + (-> (listof string?) (listof exact-integer?)) + + )","-spec group_strings(Words :: [unicode:unicode_binary()]) -> [integer()]. +group_strings(Words) -> + .","defmodule Solution do + @spec group_strings(words :: [String.t]) :: [integer] + def group_strings(words) do + + end +end","class Solution { + List groupStrings(List words) { + + } +}", +458,find-substring-with-given-hash-value,Find Substring With Given Hash Value,2156.0,2275.0,"

The hash of a 0-indexed string s of length k, given integers p and m, is computed using the following function:

+ +
    +
  • hash(s, p, m) = (val(s[0]) * p0 + val(s[1]) * p1 + ... + val(s[k-1]) * pk-1) mod m.
    • +
+ +

Where val(s[i]) represents the index of s[i] in the alphabet from val('a') = 1 to val('z') = 26.

+ +

You are given a string s and the integers power, modulo, k, and hashValue. Return sub, the first substring of s of length k such that hash(sub, power, modulo) == hashValue.

+ +

The test cases will be generated such that an answer always exists.

+ +

A substring is a contiguous non-empty sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "leetcode", power = 7, modulo = 20, k = 2, hashValue = 0
+Output: "ee"
+Explanation: The hash of "ee" can be computed to be hash("ee", 7, 20) = (5 * 1 + 5 * 7) mod 20 = 40 mod 20 = 0. 
+"ee" is the first substring of length 2 with hashValue 0. Hence, we return "ee".
+
+ +

Example 2:

+ +
+Input: s = "fbxzaad", power = 31, modulo = 100, k = 3, hashValue = 32
+Output: "fbx"
+Explanation: The hash of "fbx" can be computed to be hash("fbx", 31, 100) = (6 * 1 + 2 * 31 + 24 * 312) mod 100 = 23132 mod 100 = 32. 
+The hash of "bxz" can be computed to be hash("bxz", 31, 100) = (2 * 1 + 24 * 31 + 26 * 312) mod 100 = 25732 mod 100 = 32. 
+"fbx" is the first substring of length 3 with hashValue 32. Hence, we return "fbx".
+Note that "bxz" also has a hash of 32 but it appears later than "fbx".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= s.length <= 2 * 104
    • +
  • 1 <= power, modulo <= 109
    • +
  • 0 <= hashValue < modulo
    • +
  • s consists of lowercase English letters only.
    • +
  • The test cases are generated such that an answer always exists.
    • +
+",3.0,False,"class Solution { +public: + string subStrHash(string s, int power, int modulo, int k, int hashValue) { + + } +};","class Solution { + public String subStrHash(String s, int power, int modulo, int k, int hashValue) { + + } +}","class Solution(object): + def subStrHash(self, s, power, modulo, k, hashValue): + """""" + :type s: str + :type power: int + :type modulo: int + :type k: int + :type hashValue: int + :rtype: str + """""" + ","class Solution: + def subStrHash(self, s: str, power: int, modulo: int, k: int, hashValue: int) -> str: + ","char * subStrHash(char * s, int power, int modulo, int k, int hashValue){ + +}","public class Solution { + public string SubStrHash(string s, int power, int modulo, int k, int hashValue) { + + } +}","/** + * @param {string} s + * @param {number} power + * @param {number} modulo + * @param {number} k + * @param {number} hashValue + * @return {string} + */ +var subStrHash = function(s, power, modulo, k, hashValue) { + +};","# @param {String} s +# @param {Integer} power +# @param {Integer} modulo +# @param {Integer} k +# @param {Integer} hash_value +# @return {String} +def sub_str_hash(s, power, modulo, k, hash_value) + +end","class Solution { + func subStrHash(_ s: String, _ power: Int, _ modulo: Int, _ k: Int, _ hashValue: Int) -> String { + + } +}","func subStrHash(s string, power int, modulo int, k int, hashValue int) string { + +}","object Solution { + def subStrHash(s: String, power: Int, modulo: Int, k: Int, hashValue: Int): String = { + + } +}","class Solution { + fun subStrHash(s: String, power: Int, modulo: Int, k: Int, hashValue: Int): String { + + } +}","impl Solution { + pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $power + * @param Integer $modulo + * @param Integer $k + * @param Integer $hashValue + * @return String + */ + function subStrHash($s, $power, $modulo, $k, $hashValue) { + + } +}","function subStrHash(s: string, power: number, modulo: number, k: number, hashValue: number): string { + +};","(define/contract (sub-str-hash s power modulo k hashValue) + (-> string? exact-integer? exact-integer? exact-integer? exact-integer? string?) + + )","-spec sub_str_hash(S :: unicode:unicode_binary(), Power :: integer(), Modulo :: integer(), K :: integer(), HashValue :: integer()) -> unicode:unicode_binary(). +sub_str_hash(S, Power, Modulo, K, HashValue) -> + .","defmodule Solution do + @spec sub_str_hash(s :: String.t, power :: integer, modulo :: integer, k :: integer, hash_value :: integer) :: String.t + def sub_str_hash(s, power, modulo, k, hash_value) do + + end +end","class Solution { + String subStrHash(String s, int power, int modulo, int k, int hashValue) { + + } +}", +460,maximum-good-people-based-on-statements,Maximum Good People Based on Statements,2151.0,2272.0,"

There are two types of persons:

+ +
    +
  • The good person: The person who always tells the truth.
    • +
  • The bad person: The person who might tell the truth and might lie.
    • +
+ +

You are given a 0-indexed 2D integer array statements of size n x n that represents the statements made by n people about each other. More specifically, statements[i][j] could be one of the following:

+ +
    +
  • 0 which represents a statement made by person i that person j is a bad person.
    • +
  • 1 which represents a statement made by person i that person j is a good person.
    • +
  • 2 represents that no statement is made by person i about person j.
    • +
+ +

Additionally, no person ever makes a statement about themselves. Formally, we have that statements[i][i] = 2 for all 0 <= i < n.

+ +

Return the maximum number of people who can be good based on the statements made by the n people.

+ +

 

+

Example 1:

+ +
+Input: statements = [[2,1,2],[1,2,2],[2,0,2]]
+Output: 2
+Explanation: Each person makes a single statement.
+- Person 0 states that person 1 is good.
+- Person 1 states that person 0 is good.
+- Person 2 states that person 1 is bad.
+Let's take person 2 as the key.
+- Assuming that person 2 is a good person:
+    - Based on the statement made by person 2, person 1 is a bad person.
+    - Now we know for sure that person 1 is bad and person 2 is good.
+    - Based on the statement made by person 1, and since person 1 is bad, they could be:
+        - telling the truth. There will be a contradiction in this case and this assumption is invalid.
+        - lying. In this case, person 0 is also a bad person and lied in their statement.
+    - Following that person 2 is a good person, there will be only one good person in the group.
+- Assuming that person 2 is a bad person:
+    - Based on the statement made by person 2, and since person 2 is bad, they could be:
+        - telling the truth. Following this scenario, person 0 and 1 are both bad as explained before.
+            - Following that person 2 is bad but told the truth, there will be no good persons in the group.
+        - lying. In this case person 1 is a good person.
+            - Since person 1 is a good person, person 0 is also a good person.
+            - Following that person 2 is bad and lied, there will be two good persons in the group.
+We can see that at most 2 persons are good in the best case, so we return 2.
+Note that there is more than one way to arrive at this conclusion.
+
+ +

Example 2:

+ +
+Input: statements = [[2,0],[0,2]]
+Output: 1
+Explanation: Each person makes a single statement.
+- Person 0 states that person 1 is bad.
+- Person 1 states that person 0 is bad.
+Let's take person 0 as the key.
+- Assuming that person 0 is a good person:
+    - Based on the statement made by person 0, person 1 is a bad person and was lying.
+    - Following that person 0 is a good person, there will be only one good person in the group.
+- Assuming that person 0 is a bad person:
+    - Based on the statement made by person 0, and since person 0 is bad, they could be:
+        - telling the truth. Following this scenario, person 0 and 1 are both bad.
+            - Following that person 0 is bad but told the truth, there will be no good persons in the group.
+        - lying. In this case person 1 is a good person.
+            - Following that person 0 is bad and lied, there will be only one good person in the group.
+We can see that at most, one person is good in the best case, so we return 1.
+Note that there is more than one way to arrive at this conclusion.
+
+ +

 

+

Constraints:

+ +
    +
  • n == statements.length == statements[i].length
    • +
  • 2 <= n <= 15
    • +
  • statements[i][j] is either 0, 1, or 2.
    • +
  • statements[i][i] == 2
    • +
+",3.0,False,"class Solution { +public: + int maximumGood(vector>& statements) { + + } +};","class Solution { + public int maximumGood(int[][] statements) { + + } +}","class Solution(object): + def maximumGood(self, statements): + """""" + :type statements: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumGood(self, statements: List[List[int]]) -> int: + ","int maximumGood(int** statements, int statementsSize, int* statementsColSize){ + +}","public class Solution { + public int MaximumGood(int[][] statements) { + + } +}","/** + * @param {number[][]} statements + * @return {number} + */ +var maximumGood = function(statements) { + +};","# @param {Integer[][]} statements +# @return {Integer} +def maximum_good(statements) + +end","class Solution { + func maximumGood(_ statements: [[Int]]) -> Int { + + } +}","func maximumGood(statements [][]int) int { + +}","object Solution { + def maximumGood(statements: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumGood(statements: Array): Int { + + } +}","impl Solution { + pub fn maximum_good(statements: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $statements + * @return Integer + */ + function maximumGood($statements) { + + } +}","function maximumGood(statements: number[][]): number { + +};","(define/contract (maximum-good statements) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_good(Statements :: [[integer()]]) -> integer(). +maximum_good(Statements) -> + .","defmodule Solution do + @spec maximum_good(statements :: [[integer]]) :: integer + def maximum_good(statements) do + + end +end","class Solution { + int maximumGood(List> statements) { + + } +}", +461,rearrange-array-elements-by-sign,Rearrange Array Elements by Sign,2149.0,2271.0,"

You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.

+ +

You should rearrange the elements of nums such that the modified array follows the given conditions:

+ +
    +
  1. Every consecutive pair of integers have opposite signs.
    2. +
  2. For all integers with the same sign, the order in which they were present in nums is preserved.
    3. +
  3. The rearranged array begins with a positive integer.
    4. +
+ +

Return the modified array after rearranging the elements to satisfy the aforementioned conditions.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,1,-2,-5,2,-4]
+Output: [3,-2,1,-5,2,-4]
+Explanation:
+The positive integers in nums are [3,1,2]. The negative integers are [-2,-5,-4].
+The only possible way to rearrange them such that they satisfy all conditions is [3,-2,1,-5,2,-4].
+Other ways such as [1,-2,2,-5,3,-4], [3,1,2,-2,-5,-4], [-2,3,-5,1,-4,2] are incorrect because they do not satisfy one or more conditions.  
+
+ +

Example 2:

+ +
+Input: nums = [-1,1]
+Output: [1,-1]
+Explanation:
+1 is the only positive integer and -1 the only negative integer in nums.
+So nums is rearranged to [1,-1].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 2 * 105
    • +
  • nums.length is even
    • +
  • 1 <= |nums[i]| <= 105
    • +
  • nums consists of equal number of positive and negative integers.
    • +
+",2.0,False,"class Solution { +public: + vector rearrangeArray(vector& nums) { + + } +};","class Solution { + public int[] rearrangeArray(int[] nums) { + + } +}","class Solution(object): + def rearrangeArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def rearrangeArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* rearrangeArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] RearrangeArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var rearrangeArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def rearrange_array(nums) + +end","class Solution { + func rearrangeArray(_ nums: [Int]) -> [Int] { + + } +}","func rearrangeArray(nums []int) []int { + +}","object Solution { + def rearrangeArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun rearrangeArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn rearrange_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function rearrangeArray($nums) { + + } +}","function rearrangeArray(nums: number[]): number[] { + +};","(define/contract (rearrange-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec rearrange_array(Nums :: [integer()]) -> [integer()]. +rearrange_array(Nums) -> + .","defmodule Solution do + @spec rearrange_array(nums :: [integer]) :: [integer] + def rearrange_array(nums) do + + end +end","class Solution { + List rearrangeArray(List nums) { + + } +}", +462,find-all-lonely-numbers-in-the-array,Find All Lonely Numbers in the Array,2150.0,2270.0,"

You are given an integer array nums. A number x is lonely when it appears only once, and no adjacent numbers (i.e. x + 1 and x - 1) appear in the array.

+ +

Return all lonely numbers in nums. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,6,5,8]
+Output: [10,8]
+Explanation: 
+- 10 is a lonely number since it appears exactly once and 9 and 11 does not appear in nums.
+- 8 is a lonely number since it appears exactly once and 7 and 9 does not appear in nums.
+- 5 is not a lonely number since 6 appears in nums and vice versa.
+Hence, the lonely numbers in nums are [10, 8].
+Note that [8, 10] may also be returned.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,5,3]
+Output: [1,5]
+Explanation: 
+- 1 is a lonely number since it appears exactly once and 0 and 2 does not appear in nums.
+- 5 is a lonely number since it appears exactly once and 4 and 6 does not appear in nums.
+- 3 is not a lonely number since it appears twice.
+Hence, the lonely numbers in nums are [1, 5].
+Note that [5, 1] may also be returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 106
    • +
+",2.0,False,"class Solution { +public: + vector findLonely(vector& nums) { + + } +};","class Solution { + public List findLonely(int[] nums) { + + } +}","class Solution(object): + def findLonely(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def findLonely(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findLonely(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public IList FindLonely(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var findLonely = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def find_lonely(nums) + +end","class Solution { + func findLonely(_ nums: [Int]) -> [Int] { + + } +}","func findLonely(nums []int) []int { + +}","object Solution { + def findLonely(nums: Array[Int]): List[Int] = { + + } +}","class Solution { + fun findLonely(nums: IntArray): List { + + } +}","impl Solution { + pub fn find_lonely(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function findLonely($nums) { + + } +}","function findLonely(nums: number[]): number[] { + +};","(define/contract (find-lonely nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec find_lonely(Nums :: [integer()]) -> [integer()]. +find_lonely(Nums) -> + .","defmodule Solution do + @spec find_lonely(nums :: [integer]) :: [integer] + def find_lonely(nums) do + + end +end","class Solution { + List findLonely(List nums) { + + } +}", +463,count-elements-with-strictly-smaller-and-greater-elements,Count Elements With Strictly Smaller and Greater Elements ,2148.0,2269.0,"

Given an integer array nums, return the number of elements that have both a strictly smaller and a strictly greater element appear in nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [11,7,2,15]
+Output: 2
+Explanation: The element 7 has the element 2 strictly smaller than it and the element 11 strictly greater than it.
+Element 11 has element 7 strictly smaller than it and element 15 strictly greater than it.
+In total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.
+
+ +

Example 2:

+ +
+Input: nums = [-3,3,3,90]
+Output: 2
+Explanation: The element 3 has the element -3 strictly smaller than it and the element 90 strictly greater than it.
+Since there are two elements with the value 3, in total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • -105 <= nums[i] <= 105
    • +
+",1.0,False,"class Solution { +public: + int countElements(vector& nums) { + + } +};","class Solution { + public int countElements(int[] nums) { + + } +}","class Solution(object): + def countElements(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countElements(self, nums: List[int]) -> int: + ","int countElements(int* nums, int numsSize){ + +}","public class Solution { + public int CountElements(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countElements = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_elements(nums) + +end","class Solution { + func countElements(_ nums: [Int]) -> Int { + + } +}","func countElements(nums []int) int { + +}","object Solution { + def countElements(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countElements(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_elements(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countElements($nums) { + + } +}","function countElements(nums: number[]): number { + +};","(define/contract (count-elements nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_elements(Nums :: [integer()]) -> integer(). +count_elements(Nums) -> + .","defmodule Solution do + @spec count_elements(nums :: [integer]) :: integer + def count_elements(nums) do + + end +end","class Solution { + int countElements(List nums) { + + } +}", +464,minimum-difference-in-sums-after-removal-of-elements,Minimum Difference in Sums After Removal of Elements,2163.0,2267.0,"

You are given a 0-indexed integer array nums consisting of 3 * n elements.

+ +

You are allowed to remove any subsequence of elements of size exactly n from nums. The remaining 2 * n elements will be divided into two equal parts:

+ +
    +
  • The first n elements belonging to the first part and their sum is sumfirst.
    • +
  • The next n elements belonging to the second part and their sum is sumsecond.
    • +
+ +

The difference in sums of the two parts is denoted as sumfirst - sumsecond.

+ +
    +
  • For example, if sumfirst = 3 and sumsecond = 2, their difference is 1.
    • +
  • Similarly, if sumfirst = 2 and sumsecond = 3, their difference is -1.
    • +
+ +

Return the minimum difference possible between the sums of the two parts after the removal of n elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,1,2]
+Output: -1
+Explanation: Here, nums has 3 elements, so n = 1. 
+Thus we have to remove 1 element from nums and divide the array into two equal parts.
+- If we remove nums[0] = 3, the array will be [1,2]. The difference in sums of the two parts will be 1 - 2 = -1.
+- If we remove nums[1] = 1, the array will be [3,2]. The difference in sums of the two parts will be 3 - 2 = 1.
+- If we remove nums[2] = 2, the array will be [3,1]. The difference in sums of the two parts will be 3 - 1 = 2.
+The minimum difference between sums of the two parts is min(-1,1,2) = -1. 
+
+ +

Example 2:

+ +
+Input: nums = [7,9,5,8,1,3]
+Output: 1
+Explanation: Here n = 2. So we must remove 2 elements and divide the remaining array into two parts containing two elements each.
+If we remove nums[2] = 5 and nums[3] = 8, the resultant array will be [7,9,1,3]. The difference in sums will be (7+9) - (1+3) = 12.
+To obtain the minimum difference, we should remove nums[1] = 9 and nums[4] = 1. The resultant array becomes [7,5,8,3]. The difference in sums of the two parts is (7+5) - (8+3) = 1.
+It can be shown that it is not possible to obtain a difference smaller than 1.
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == 3 * n
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + long long minimumDifference(vector& nums) { + + } +};","class Solution { + public long minimumDifference(int[] nums) { + + } +}","class Solution(object): + def minimumDifference(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumDifference(self, nums: List[int]) -> int: + ","long long minimumDifference(int* nums, int numsSize){ + +}","public class Solution { + public long MinimumDifference(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumDifference = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_difference(nums) + +end","class Solution { + func minimumDifference(_ nums: [Int]) -> Int { + + } +}","func minimumDifference(nums []int) int64 { + +}","object Solution { + def minimumDifference(nums: Array[Int]): Long = { + + } +}","class Solution { + fun minimumDifference(nums: IntArray): Long { + + } +}","impl Solution { + pub fn minimum_difference(nums: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumDifference($nums) { + + } +}","function minimumDifference(nums: number[]): number { + +};","(define/contract (minimum-difference nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_difference(Nums :: [integer()]) -> integer(). +minimum_difference(Nums) -> + .","defmodule Solution do + @spec minimum_difference(nums :: [integer]) :: integer + def minimum_difference(nums) do + + end +end","class Solution { + int minimumDifference(List nums) { + + } +}", +466,partition-array-according-to-given-pivot,Partition Array According to Given Pivot,2161.0,2265.0,"

You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums such that the following conditions are satisfied:

+ +
    +
  • Every element less than pivot appears before every element greater than pivot.
    • +
  • Every element equal to pivot appears in between the elements less than and greater than pivot.
    • +
  • The relative order of the elements less than pivot and the elements greater than pivot is maintained. +
      +
    • More formally, consider every pi, pj where pi is the new position of the ith element and pj is the new position of the jth element. For elements less than pivot, if i < j and nums[i] < pivot and nums[j] < pivot, then pi < pj. Similarly for elements greater than pivot, if i < j and nums[i] > pivot and nums[j] > pivot, then pi < pj.
      • +
    +
    • +
+ +

Return nums after the rearrangement.

+ +

 

+

Example 1:

+ +
+Input: nums = [9,12,5,10,14,3,10], pivot = 10
+Output: [9,5,3,10,10,12,14]
+Explanation: 
+The elements 9, 5, and 3 are less than the pivot so they are on the left side of the array.
+The elements 12 and 14 are greater than the pivot so they are on the right side of the array.
+The relative ordering of the elements less than and greater than pivot is also maintained. [9, 5, 3] and [12, 14] are the respective orderings.
+
+ +

Example 2:

+ +
+Input: nums = [-3,4,3,2], pivot = 2
+Output: [-3,2,4,3]
+Explanation: 
+The element -3 is less than the pivot so it is on the left side of the array.
+The elements 4 and 3 are greater than the pivot so they are on the right side of the array.
+The relative ordering of the elements less than and greater than pivot is also maintained. [-3] and [4, 3] are the respective orderings.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -106 <= nums[i] <= 106
    • +
  • pivot equals to an element of nums.
    • +
+",2.0,False,"class Solution { +public: + vector pivotArray(vector& nums, int pivot) { + + } +};","class Solution { + public int[] pivotArray(int[] nums, int pivot) { + + } +}","class Solution(object): + def pivotArray(self, nums, pivot): + """""" + :type nums: List[int] + :type pivot: int + :rtype: List[int] + """""" + ","class Solution: + def pivotArray(self, nums: List[int], pivot: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* pivotArray(int* nums, int numsSize, int pivot, int* returnSize){ + +}","public class Solution { + public int[] PivotArray(int[] nums, int pivot) { + + } +}","/** + * @param {number[]} nums + * @param {number} pivot + * @return {number[]} + */ +var pivotArray = function(nums, pivot) { + +};","# @param {Integer[]} nums +# @param {Integer} pivot +# @return {Integer[]} +def pivot_array(nums, pivot) + +end","class Solution { + func pivotArray(_ nums: [Int], _ pivot: Int) -> [Int] { + + } +}","func pivotArray(nums []int, pivot int) []int { + +}","object Solution { + def pivotArray(nums: Array[Int], pivot: Int): Array[Int] = { + + } +}","class Solution { + fun pivotArray(nums: IntArray, pivot: Int): IntArray { + + } +}","impl Solution { + pub fn pivot_array(nums: Vec, pivot: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $pivot + * @return Integer[] + */ + function pivotArray($nums, $pivot) { + + } +}","function pivotArray(nums: number[], pivot: number): number[] { + +};","(define/contract (pivot-array nums pivot) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec pivot_array(Nums :: [integer()], Pivot :: integer()) -> [integer()]. +pivot_array(Nums, Pivot) -> + .","defmodule Solution do + @spec pivot_array(nums :: [integer], pivot :: integer) :: [integer] + def pivot_array(nums, pivot) do + + end +end","class Solution { + List pivotArray(List nums, int pivot) { + + } +}", +467,minimum-sum-of-four-digit-number-after-splitting-digits,Minimum Sum of Four Digit Number After Splitting Digits,2160.0,2264.0,"

You are given a positive integer num consisting of exactly four digits. Split num into two new integers new1 and new2 by using the digits found in num. Leading zeros are allowed in new1 and new2, and all the digits found in num must be used.

+ +
    +
  • For example, given num = 2932, you have the following digits: two 2's, one 9 and one 3. Some of the possible pairs [new1, new2] are [22, 93], [23, 92], [223, 9] and [2, 329].
    • +
+ +

Return the minimum possible sum of new1 and new2.

+ +

 

+

Example 1:

+ +
+Input: num = 2932
+Output: 52
+Explanation: Some possible pairs [new1, new2] are [29, 23], [223, 9], etc.
+The minimum sum can be obtained by the pair [29, 23]: 29 + 23 = 52.
+
+ +

Example 2:

+ +
+Input: num = 4009
+Output: 13
+Explanation: Some possible pairs [new1, new2] are [0, 49], [490, 0], etc. 
+The minimum sum can be obtained by the pair [4, 9]: 4 + 9 = 13.
+
+ +

 

+

Constraints:

+ +
    +
  • 1000 <= num <= 9999
    • +
+",1.0,False,"class Solution { +public: + int minimumSum(int num) { + + } +};","class Solution { + public int minimumSum(int num) { + + } +}","class Solution(object): + def minimumSum(self, num): + """""" + :type num: int + :rtype: int + """""" + ","class Solution: + def minimumSum(self, num: int) -> int: + ","int minimumSum(int num){ + +}","public class Solution { + public int MinimumSum(int num) { + + } +}","/** + * @param {number} num + * @return {number} + */ +var minimumSum = function(num) { + +};","# @param {Integer} num +# @return {Integer} +def minimum_sum(num) + +end","class Solution { + func minimumSum(_ num: Int) -> Int { + + } +}","func minimumSum(num int) int { + +}","object Solution { + def minimumSum(num: Int): Int = { + + } +}","class Solution { + fun minimumSum(num: Int): Int { + + } +}","impl Solution { + pub fn minimum_sum(num: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Integer + */ + function minimumSum($num) { + + } +}","function minimumSum(num: number): number { + +};","(define/contract (minimum-sum num) + (-> exact-integer? exact-integer?) + + )","-spec minimum_sum(Num :: integer()) -> integer(). +minimum_sum(Num) -> + .","defmodule Solution do + @spec minimum_sum(num :: integer) :: integer + def minimum_sum(num) do + + end +end","class Solution { + int minimumSum(int num) { + + } +}", +468,maximum-running-time-of-n-computers,Maximum Running Time of N Computers,2141.0,2263.0,"

You have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You are interested in running all n computers simultaneously using the given batteries.

+ +

Initially, you can insert at most one battery into each computer. After that and at any integer time moment, you can remove a battery from a computer and insert another battery any number of times. The inserted battery can be a totally new battery or a battery from another computer. You may assume that the removing and inserting processes take no time.

+ +

Note that the batteries cannot be recharged.

+ +

Return the maximum number of minutes you can run all the n computers simultaneously.

+ +

 

+

Example 1:

+ +
+Input: n = 2, batteries = [3,3,3]
+Output: 4
+Explanation: 
+Initially, insert battery 0 into the first computer and battery 1 into the second computer.
+After two minutes, remove battery 1 from the second computer and insert battery 2 instead. Note that battery 1 can still run for one minute.
+At the end of the third minute, battery 0 is drained, and you need to remove it from the first computer and insert battery 1 instead.
+By the end of the fourth minute, battery 1 is also drained, and the first computer is no longer running.
+We can run the two computers simultaneously for at most 4 minutes, so we return 4.
+
+
+ +

Example 2:

+ +
+Input: n = 2, batteries = [1,1,1,1]
+Output: 2
+Explanation: 
+Initially, insert battery 0 into the first computer and battery 2 into the second computer. 
+After one minute, battery 0 and battery 2 are drained so you need to remove them and insert battery 1 into the first computer and battery 3 into the second computer. 
+After another minute, battery 1 and battery 3 are also drained so the first and second computers are no longer running.
+We can run the two computers simultaneously for at most 2 minutes, so we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= batteries.length <= 105
    • +
  • 1 <= batteries[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + long long maxRunTime(int n, vector& batteries) { + + } +};","class Solution { + public long maxRunTime(int n, int[] batteries) { + + } +}","class Solution(object): + def maxRunTime(self, n, batteries): + """""" + :type n: int + :type batteries: List[int] + :rtype: int + """""" + ","class Solution: + def maxRunTime(self, n: int, batteries: List[int]) -> int: + ","long long maxRunTime(int n, int* batteries, int batteriesSize){ + +}","public class Solution { + public long MaxRunTime(int n, int[] batteries) { + + } +}","/** + * @param {number} n + * @param {number[]} batteries + * @return {number} + */ +var maxRunTime = function(n, batteries) { + +};","# @param {Integer} n +# @param {Integer[]} batteries +# @return {Integer} +def max_run_time(n, batteries) + +end","class Solution { + func maxRunTime(_ n: Int, _ batteries: [Int]) -> Int { + + } +}","func maxRunTime(n int, batteries []int) int64 { + +}","object Solution { + def maxRunTime(n: Int, batteries: Array[Int]): Long = { + + } +}","class Solution { + fun maxRunTime(n: Int, batteries: IntArray): Long { + + } +}","impl Solution { + pub fn max_run_time(n: i32, batteries: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $batteries + * @return Integer + */ + function maxRunTime($n, $batteries) { + + } +}","function maxRunTime(n: number, batteries: number[]): number { + +};","(define/contract (max-run-time n batteries) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec max_run_time(N :: integer(), Batteries :: [integer()]) -> integer(). +max_run_time(N, Batteries) -> + .","defmodule Solution do + @spec max_run_time(n :: integer, batteries :: [integer]) :: integer + def max_run_time(n, batteries) do + + end +end","class Solution { + int maxRunTime(int n, List batteries) { + + } +}", +472,earliest-possible-day-of-full-bloom,Earliest Possible Day of Full Bloom,2136.0,2257.0,"

You have n flower seeds. Every seed must be planted first before it can begin to grow, then bloom. Planting a seed takes time and so does the growth of a seed. You are given two 0-indexed integer arrays plantTime and growTime, of length n each:

+ +
    +
  • plantTime[i] is the number of full days it takes you to plant the ith seed. Every day, you can work on planting exactly one seed. You do not have to work on planting the same seed on consecutive days, but the planting of a seed is not complete until you have worked plantTime[i] days on planting it in total.
    • +
  • growTime[i] is the number of full days it takes the ith seed to grow after being completely planted. After the last day of its growth, the flower blooms and stays bloomed forever.
    • +
+ +

From the beginning of day 0, you can plant the seeds in any order.

+ +

Return the earliest possible day where all seeds are blooming.

+ +

 

+

Example 1:

+ +
+Input: plantTime = [1,4,3], growTime = [2,3,1]
+Output: 9
+Explanation: The grayed out pots represent planting days, colored pots represent growing days, and the flower represents the day it blooms.
+One optimal way is:
+On day 0, plant the 0th seed. The seed grows for 2 full days and blooms on day 3.
+On days 1, 2, 3, and 4, plant the 1st seed. The seed grows for 3 full days and blooms on day 8.
+On days 5, 6, and 7, plant the 2nd seed. The seed grows for 1 full day and blooms on day 9.
+Thus, on day 9, all the seeds are blooming.
+
+ +

Example 2:

+ +
+Input: plantTime = [1,2,3,2], growTime = [2,1,2,1]
+Output: 9
+Explanation: The grayed out pots represent planting days, colored pots represent growing days, and the flower represents the day it blooms.
+One optimal way is:
+On day 1, plant the 0th seed. The seed grows for 2 full days and blooms on day 4.
+On days 0 and 3, plant the 1st seed. The seed grows for 1 full day and blooms on day 5.
+On days 2, 4, and 5, plant the 2nd seed. The seed grows for 2 full days and blooms on day 8.
+On days 6 and 7, plant the 3rd seed. The seed grows for 1 full day and blooms on day 9.
+Thus, on day 9, all the seeds are blooming.
+
+ +

Example 3:

+ +
+Input: plantTime = [1], growTime = [1]
+Output: 2
+Explanation: On day 0, plant the 0th seed. The seed grows for 1 full day and blooms on day 2.
+Thus, on day 2, all the seeds are blooming.
+
+ +

 

+

Constraints:

+ +
    +
  • n == plantTime.length == growTime.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= plantTime[i], growTime[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + int earliestFullBloom(vector& plantTime, vector& growTime) { + + } +};","class Solution { + public int earliestFullBloom(int[] plantTime, int[] growTime) { + + } +}","class Solution(object): + def earliestFullBloom(self, plantTime, growTime): + """""" + :type plantTime: List[int] + :type growTime: List[int] + :rtype: int + """""" + ","class Solution: + def earliestFullBloom(self, plantTime: List[int], growTime: List[int]) -> int: + ","int earliestFullBloom(int* plantTime, int plantTimeSize, int* growTime, int growTimeSize){ + +}","public class Solution { + public int EarliestFullBloom(int[] plantTime, int[] growTime) { + + } +}","/** + * @param {number[]} plantTime + * @param {number[]} growTime + * @return {number} + */ +var earliestFullBloom = function(plantTime, growTime) { + +};","# @param {Integer[]} plant_time +# @param {Integer[]} grow_time +# @return {Integer} +def earliest_full_bloom(plant_time, grow_time) + +end","class Solution { + func earliestFullBloom(_ plantTime: [Int], _ growTime: [Int]) -> Int { + + } +}","func earliestFullBloom(plantTime []int, growTime []int) int { + +}","object Solution { + def earliestFullBloom(plantTime: Array[Int], growTime: Array[Int]): Int = { + + } +}","class Solution { + fun earliestFullBloom(plantTime: IntArray, growTime: IntArray): Int { + + } +}","impl Solution { + pub fn earliest_full_bloom(plant_time: Vec, grow_time: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $plantTime + * @param Integer[] $growTime + * @return Integer + */ + function earliestFullBloom($plantTime, $growTime) { + + } +}","function earliestFullBloom(plantTime: number[], growTime: number[]): number { + +};","(define/contract (earliest-full-bloom plantTime growTime) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec earliest_full_bloom(PlantTime :: [integer()], GrowTime :: [integer()]) -> integer(). +earliest_full_bloom(PlantTime, GrowTime) -> + .","defmodule Solution do + @spec earliest_full_bloom(plant_time :: [integer], grow_time :: [integer]) :: integer + def earliest_full_bloom(plant_time, grow_time) do + + end +end","class Solution { + int earliestFullBloom(List plantTime, List growTime) { + + } +}", +476,number-of-ways-to-divide-a-long-corridor,Number of Ways to Divide a Long Corridor,2147.0,2251.0,"

Along a long library corridor, there is a line of seats and decorative plants. You are given a 0-indexed string corridor of length n consisting of letters 'S' and 'P' where each 'S' represents a seat and each 'P' represents a plant.

+ +

One room divider has already been installed to the left of index 0, and another to the right of index n - 1. Additional room dividers can be installed. For each position between indices i - 1 and i (1 <= i <= n - 1), at most one divider can be installed.

+ +

Divide the corridor into non-overlapping sections, where each section has exactly two seats with any number of plants. There may be multiple ways to perform the division. Two ways are different if there is a position with a room divider installed in the first way but not in the second way.

+ +

Return the number of ways to divide the corridor. Since the answer may be very large, return it modulo 109 + 7. If there is no way, return 0.

+ +

 

+

Example 1:

+ +
+Input: corridor = "SSPPSPS"
+Output: 3
+Explanation: There are 3 different ways to divide the corridor.
+The black bars in the above image indicate the two room dividers already installed.
+Note that in each of the ways, each section has exactly two seats.
+
+ +

Example 2:

+ +
+Input: corridor = "PPSPSP"
+Output: 1
+Explanation: There is only 1 way to divide the corridor, by not installing any additional dividers.
+Installing any would create some section that does not have exactly two seats.
+
+ +

Example 3:

+ +
+Input: corridor = "S"
+Output: 0
+Explanation: There is no way to divide the corridor because there will always be a section that does not have exactly two seats.
+
+ +

 

+

Constraints:

+ +
    +
  • n == corridor.length
    • +
  • 1 <= n <= 105
    • +
  • corridor[i] is either 'S' or 'P'.
    • +
+",3.0,False,"class Solution { +public: + int numberOfWays(string corridor) { + + } +};","class Solution { + public int numberOfWays(String corridor) { + + } +}","class Solution(object): + def numberOfWays(self, corridor): + """""" + :type corridor: str + :rtype: int + """""" + ","class Solution: + def numberOfWays(self, corridor: str) -> int: + ","int numberOfWays(char * corridor){ + +}","public class Solution { + public int NumberOfWays(string corridor) { + + } +}","/** + * @param {string} corridor + * @return {number} + */ +var numberOfWays = function(corridor) { + +};","# @param {String} corridor +# @return {Integer} +def number_of_ways(corridor) + +end","class Solution { + func numberOfWays(_ corridor: String) -> Int { + + } +}","func numberOfWays(corridor string) int { + +}","object Solution { + def numberOfWays(corridor: String): Int = { + + } +}","class Solution { + fun numberOfWays(corridor: String): Int { + + } +}","impl Solution { + pub fn number_of_ways(corridor: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $corridor + * @return Integer + */ + function numberOfWays($corridor) { + + } +}","function numberOfWays(corridor: string): number { + +};","(define/contract (number-of-ways corridor) + (-> string? exact-integer?) + + )","-spec number_of_ways(Corridor :: unicode:unicode_binary()) -> integer(). +number_of_ways(Corridor) -> + .","defmodule Solution do + @spec number_of_ways(corridor :: String.t) :: integer + def number_of_ways(corridor) do + + end +end","class Solution { + int numberOfWays(String corridor) { + + } +}", +480,maximum-employees-to-be-invited-to-a-meeting,Maximum Employees to Be Invited to a Meeting,2127.0,2246.0,"

A company is organizing a meeting and has a list of n employees, waiting to be invited. They have arranged for a large circular table, capable of seating any number of employees.

+ +

The employees are numbered from 0 to n - 1. Each employee has a favorite person and they will attend the meeting only if they can sit next to their favorite person at the table. The favorite person of an employee is not themself.

+ +

Given a 0-indexed integer array favorite, where favorite[i] denotes the favorite person of the ith employee, return the maximum number of employees that can be invited to the meeting.

+ +

 

+

Example 1:

+ +
+Input: favorite = [2,2,1,2]
+Output: 3
+Explanation:
+The above figure shows how the company can invite employees 0, 1, and 2, and seat them at the round table.
+All employees cannot be invited because employee 2 cannot sit beside employees 0, 1, and 3, simultaneously.
+Note that the company can also invite employees 1, 2, and 3, and give them their desired seats.
+The maximum number of employees that can be invited to the meeting is 3. 
+
+ +

Example 2:

+ +
+Input: favorite = [1,2,0]
+Output: 3
+Explanation: 
+Each employee is the favorite person of at least one other employee, and the only way the company can invite them is if they invite every employee.
+The seating arrangement will be the same as that in the figure given in example 1:
+- Employee 0 will sit between employees 2 and 1.
+- Employee 1 will sit between employees 0 and 2.
+- Employee 2 will sit between employees 1 and 0.
+The maximum number of employees that can be invited to the meeting is 3.
+
+ +

Example 3:

+ +
+Input: favorite = [3,0,1,4,1]
+Output: 4
+Explanation:
+The above figure shows how the company will invite employees 0, 1, 3, and 4, and seat them at the round table.
+Employee 2 cannot be invited because the two spots next to their favorite employee 1 are taken.
+So the company leaves them out of the meeting.
+The maximum number of employees that can be invited to the meeting is 4.
+
+ +

 

+

Constraints:

+ +
    +
  • n == favorite.length
    • +
  • 2 <= n <= 105
    • +
  • 0 <= favorite[i] <= n - 1
    • +
  • favorite[i] != i
    • +
+",3.0,False,"class Solution { +public: + int maximumInvitations(vector& favorite) { + + } +};","class Solution { + public int maximumInvitations(int[] favorite) { + + } +}","class Solution(object): + def maximumInvitations(self, favorite): + """""" + :type favorite: List[int] + :rtype: int + """""" + ","class Solution: + def maximumInvitations(self, favorite: List[int]) -> int: + ","int maximumInvitations(int* favorite, int favoriteSize){ + +}","public class Solution { + public int MaximumInvitations(int[] favorite) { + + } +}","/** + * @param {number[]} favorite + * @return {number} + */ +var maximumInvitations = function(favorite) { + +};","# @param {Integer[]} favorite +# @return {Integer} +def maximum_invitations(favorite) + +end","class Solution { + func maximumInvitations(_ favorite: [Int]) -> Int { + + } +}","func maximumInvitations(favorite []int) int { + +}","object Solution { + def maximumInvitations(favorite: Array[Int]): Int = { + + } +}","class Solution { + fun maximumInvitations(favorite: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_invitations(favorite: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $favorite + * @return Integer + */ + function maximumInvitations($favorite) { + + } +}","function maximumInvitations(favorite: number[]): number { + +};","(define/contract (maximum-invitations favorite) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_invitations(Favorite :: [integer()]) -> integer(). +maximum_invitations(Favorite) -> + .","defmodule Solution do + @spec maximum_invitations(favorite :: [integer]) :: integer + def maximum_invitations(favorite) do + + end +end","class Solution { + int maximumInvitations(List favorite) { + + } +}", +481,destroying-asteroids,Destroying Asteroids,2126.0,2245.0,"

You are given an integer mass, which represents the original mass of a planet. You are further given an integer array asteroids, where asteroids[i] is the mass of the ith asteroid.

+ +

You can arrange for the planet to collide with the asteroids in any arbitrary order. If the mass of the planet is greater than or equal to the mass of the asteroid, the asteroid is destroyed and the planet gains the mass of the asteroid. Otherwise, the planet is destroyed.

+ +

Return true if all asteroids can be destroyed. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: mass = 10, asteroids = [3,9,19,5,21]
+Output: true
+Explanation: One way to order the asteroids is [9,19,5,3,21]:
+- The planet collides with the asteroid with a mass of 9. New planet mass: 10 + 9 = 19
+- The planet collides with the asteroid with a mass of 19. New planet mass: 19 + 19 = 38
+- The planet collides with the asteroid with a mass of 5. New planet mass: 38 + 5 = 43
+- The planet collides with the asteroid with a mass of 3. New planet mass: 43 + 3 = 46
+- The planet collides with the asteroid with a mass of 21. New planet mass: 46 + 21 = 67
+All asteroids are destroyed.
+
+ +

Example 2:

+ +
+Input: mass = 5, asteroids = [4,9,23,4]
+Output: false
+Explanation: 
+The planet cannot ever gain enough mass to destroy the asteroid with a mass of 23.
+After the planet destroys the other asteroids, it will have a mass of 5 + 4 + 9 + 4 = 22.
+This is less than 23, so a collision would not destroy the last asteroid.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= mass <= 105
    • +
  • 1 <= asteroids.length <= 105
    • +
  • 1 <= asteroids[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + bool asteroidsDestroyed(int mass, vector& asteroids) { + + } +};","class Solution { + public boolean asteroidsDestroyed(int mass, int[] asteroids) { + + } +}","class Solution(object): + def asteroidsDestroyed(self, mass, asteroids): + """""" + :type mass: int + :type asteroids: List[int] + :rtype: bool + """""" + ","class Solution: + def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool: + ","bool asteroidsDestroyed(int mass, int* asteroids, int asteroidsSize){ + +}","public class Solution { + public bool AsteroidsDestroyed(int mass, int[] asteroids) { + + } +}","/** + * @param {number} mass + * @param {number[]} asteroids + * @return {boolean} + */ +var asteroidsDestroyed = function(mass, asteroids) { + +};","# @param {Integer} mass +# @param {Integer[]} asteroids +# @return {Boolean} +def asteroids_destroyed(mass, asteroids) + +end","class Solution { + func asteroidsDestroyed(_ mass: Int, _ asteroids: [Int]) -> Bool { + + } +}","func asteroidsDestroyed(mass int, asteroids []int) bool { + +}","object Solution { + def asteroidsDestroyed(mass: Int, asteroids: Array[Int]): Boolean = { + + } +}","class Solution { + fun asteroidsDestroyed(mass: Int, asteroids: IntArray): Boolean { + + } +}","impl Solution { + pub fn asteroids_destroyed(mass: i32, asteroids: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer $mass + * @param Integer[] $asteroids + * @return Boolean + */ + function asteroidsDestroyed($mass, $asteroids) { + + } +}","function asteroidsDestroyed(mass: number, asteroids: number[]): boolean { + +};","(define/contract (asteroids-destroyed mass asteroids) + (-> exact-integer? (listof exact-integer?) boolean?) + + )","-spec asteroids_destroyed(Mass :: integer(), Asteroids :: [integer()]) -> boolean(). +asteroids_destroyed(Mass, Asteroids) -> + .","defmodule Solution do + @spec asteroids_destroyed(mass :: integer, asteroids :: [integer]) :: boolean + def asteroids_destroyed(mass, asteroids) do + + end +end","class Solution { + bool asteroidsDestroyed(int mass, List asteroids) { + + } +}", +482,number-of-laser-beams-in-a-bank,Number of Laser Beams in a Bank,2125.0,2244.0,"

Anti-theft security devices are activated inside a bank. You are given a 0-indexed binary string array bank representing the floor plan of the bank, which is an m x n 2D matrix. bank[i] represents the ith row, consisting of '0's and '1's. '0' means the cell is empty, while'1' means the cell has a security device.

+ +

There is one laser beam between any two security devices if both conditions are met:

+ +
    +
  • The two devices are located on two different rows: r1 and r2, where r1 < r2.
    • +
  • For each row i where r1 < i < r2, there are no security devices in the ith row.
    • +
+ +

Laser beams are independent, i.e., one beam does not interfere nor join with another.

+ +

Return the total number of laser beams in the bank.

+ +

 

+

Example 1:

+ +
+Input: bank = ["011001","000000","010100","001000"]
+Output: 8
+Explanation: Between each of the following device pairs, there is one beam. In total, there are 8 beams:
+ * bank[0][1] -- bank[2][1]
+ * bank[0][1] -- bank[2][3]
+ * bank[0][2] -- bank[2][1]
+ * bank[0][2] -- bank[2][3]
+ * bank[0][5] -- bank[2][1]
+ * bank[0][5] -- bank[2][3]
+ * bank[2][1] -- bank[3][2]
+ * bank[2][3] -- bank[3][2]
+Note that there is no beam between any device on the 0th row with any on the 3rd row.
+This is because the 2nd row contains security devices, which breaks the second condition.
+
+ +

Example 2:

+ +
+Input: bank = ["000","111","000"]
+Output: 0
+Explanation: There does not exist two devices located on two different rows.
+
+ +

 

+

Constraints:

+ +
    +
  • m == bank.length
    • +
  • n == bank[i].length
    • +
  • 1 <= m, n <= 500
    • +
  • bank[i][j] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + int numberOfBeams(vector& bank) { + + } +};","class Solution { + public int numberOfBeams(String[] bank) { + + } +}","class Solution(object): + def numberOfBeams(self, bank): + """""" + :type bank: List[str] + :rtype: int + """""" + ","class Solution: + def numberOfBeams(self, bank: List[str]) -> int: + ","int numberOfBeams(char ** bank, int bankSize){ + +}","public class Solution { + public int NumberOfBeams(string[] bank) { + + } +}","/** + * @param {string[]} bank + * @return {number} + */ +var numberOfBeams = function(bank) { + +};","# @param {String[]} bank +# @return {Integer} +def number_of_beams(bank) + +end","class Solution { + func numberOfBeams(_ bank: [String]) -> Int { + + } +}","func numberOfBeams(bank []string) int { + +}","object Solution { + def numberOfBeams(bank: Array[String]): Int = { + + } +}","class Solution { + fun numberOfBeams(bank: Array): Int { + + } +}","impl Solution { + pub fn number_of_beams(bank: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $bank + * @return Integer + */ + function numberOfBeams($bank) { + + } +}","function numberOfBeams(bank: string[]): number { + +};","(define/contract (number-of-beams bank) + (-> (listof string?) exact-integer?) + + )","-spec number_of_beams(Bank :: [unicode:unicode_binary()]) -> integer(). +number_of_beams(Bank) -> + .","defmodule Solution do + @spec number_of_beams(bank :: [String.t]) :: integer + def number_of_beams(bank) do + + end +end","class Solution { + int numberOfBeams(List bank) { + + } +}", +484,recover-the-original-array,Recover the Original Array,2122.0,2241.0,"

Alice had a 0-indexed array arr consisting of n positive integers. She chose an arbitrary positive integer k and created two new 0-indexed integer arrays lower and higher in the following manner:

+ +
    +
  1. lower[i] = arr[i] - k, for every index i where 0 <= i < n
    2. +
  2. higher[i] = arr[i] + k, for every index i where 0 <= i < n
    3. +
+ +

Unfortunately, Alice lost all three arrays. However, she remembers the integers that were present in the arrays lower and higher, but not the array each integer belonged to. Help Alice and recover the original array.

+ +

Given an array nums consisting of 2n integers, where exactly n of the integers were present in lower and the remaining in higher, return the original array arr. In case the answer is not unique, return any valid array.

+ +

Note: The test cases are generated such that there exists at least one valid array arr.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,10,6,4,8,12]
+Output: [3,7,11]
+Explanation:
+If arr = [3,7,11] and k = 1, we get lower = [2,6,10] and higher = [4,8,12].
+Combining lower and higher gives us [2,6,10,4,8,12], which is a permutation of nums.
+Another valid possibility is that arr = [5,7,9] and k = 3. In that case, lower = [2,4,6] and higher = [8,10,12]. 
+
+ +

Example 2:

+ +
+Input: nums = [1,1,3,3]
+Output: [2,2]
+Explanation:
+If arr = [2,2] and k = 1, we get lower = [1,1] and higher = [3,3].
+Combining lower and higher gives us [1,1,3,3], which is equal to nums.
+Note that arr cannot be [1,3] because in that case, the only possible way to obtain [1,1,3,3] is with k = 0.
+This is invalid since k must be positive.
+
+ +

Example 3:

+ +
+Input: nums = [5,435]
+Output: [220]
+Explanation:
+The only possible combination is arr = [220] and k = 215. Using them, we get lower = [5] and higher = [435].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 * n == nums.length
    • +
  • 1 <= n <= 1000
    • +
  • 1 <= nums[i] <= 109
    • +
  • The test cases are generated such that there exists at least one valid array arr.
    • +
+",3.0,False,"class Solution { +public: + vector recoverArray(vector& nums) { + + } +};","class Solution { + public int[] recoverArray(int[] nums) { + + } +}","class Solution(object): + def recoverArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def recoverArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* recoverArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] RecoverArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var recoverArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def recover_array(nums) + +end","class Solution { + func recoverArray(_ nums: [Int]) -> [Int] { + + } +}","func recoverArray(nums []int) []int { + +}","object Solution { + def recoverArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun recoverArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn recover_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function recoverArray($nums) { + + } +}","function recoverArray(nums: number[]): number[] { + +};","(define/contract (recover-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec recover_array(Nums :: [integer()]) -> [integer()]. +recover_array(Nums) -> + .","defmodule Solution do + @spec recover_array(nums :: [integer]) :: [integer] + def recover_array(nums) do + + end +end","class Solution { + List recoverArray(List nums) { + + } +}", +491,minimum-operations-to-make-the-array-k-increasing,Minimum Operations to Make the Array K-Increasing,2111.0,2234.0,"

You are given a 0-indexed array arr consisting of n positive integers, and a positive integer k.

+ +

The array arr is called K-increasing if arr[i-k] <= arr[i] holds for every index i, where k <= i <= n-1.

+ +
    +
  • For example, arr = [4, 1, 5, 2, 6, 2] is K-increasing for k = 2 because: + +
      +
    • arr[0] <= arr[2] (4 <= 5)
      • +
    • arr[1] <= arr[3] (1 <= 2)
      • +
    • arr[2] <= arr[4] (5 <= 6)
      • +
    • arr[3] <= arr[5] (2 <= 2)
      • +
    +
    • +
  • However, the same arr is not K-increasing for k = 1 (because arr[0] > arr[1]) or k = 3 (because arr[0] > arr[3]).
    • +
+ +

In one operation, you can choose an index i and change arr[i] into any positive integer.

+ +

Return the minimum number of operations required to make the array K-increasing for the given k.

+ +

 

+

Example 1:

+ +
+Input: arr = [5,4,3,2,1], k = 1
+Output: 4
+Explanation:
+For k = 1, the resultant array has to be non-decreasing.
+Some of the K-increasing arrays that can be formed are [5,6,7,8,9], [1,1,1,1,1], [2,2,3,4,4]. All of them require 4 operations.
+It is suboptimal to change the array to, for example, [6,7,8,9,10] because it would take 5 operations.
+It can be shown that we cannot make the array K-increasing in less than 4 operations.
+
+ +

Example 2:

+ +
+Input: arr = [4,1,5,2,6,2], k = 2
+Output: 0
+Explanation:
+This is the same example as the one in the problem description.
+Here, for every index i where 2 <= i <= 5, arr[i-2] <= arr[i].
+Since the given array is already K-increasing, we do not need to perform any operations.
+ +

Example 3:

+ +
+Input: arr = [4,1,5,2,6,2], k = 3
+Output: 2
+Explanation:
+Indices 3 and 5 are the only ones not satisfying arr[i-3] <= arr[i] for 3 <= i <= 5.
+One of the ways we can make the array K-increasing is by changing arr[3] to 4 and arr[5] to 5.
+The array will now be [4,1,5,4,6,5].
+Note that there can be other ways to make the array K-increasing, but none of them require less than 2 operations.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 1 <= arr[i], k <= arr.length
    • +
+",3.0,False,"class Solution { +public: + int kIncreasing(vector& arr, int k) { + + } +};","class Solution { + public int kIncreasing(int[] arr, int k) { + + } +}","class Solution(object): + def kIncreasing(self, arr, k): + """""" + :type arr: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def kIncreasing(self, arr: List[int], k: int) -> int: + ","int kIncreasing(int* arr, int arrSize, int k){ + +}","public class Solution { + public int KIncreasing(int[] arr, int k) { + + } +}","/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +var kIncreasing = function(arr, k) { + +};","# @param {Integer[]} arr +# @param {Integer} k +# @return {Integer} +def k_increasing(arr, k) + +end","class Solution { + func kIncreasing(_ arr: [Int], _ k: Int) -> Int { + + } +}","func kIncreasing(arr []int, k int) int { + +}","object Solution { + def kIncreasing(arr: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun kIncreasing(arr: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn k_increasing(arr: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $k + * @return Integer + */ + function kIncreasing($arr, $k) { + + } +}","function kIncreasing(arr: number[], k: number): number { + +};","(define/contract (k-increasing arr k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec k_increasing(Arr :: [integer()], K :: integer()) -> integer(). +k_increasing(Arr, K) -> + .","defmodule Solution do + @spec k_increasing(arr :: [integer], k :: integer) :: integer + def k_increasing(arr, k) do + + end +end","class Solution { + int kIncreasing(List arr, int k) { + + } +}", +492,number-of-smooth-descent-periods-of-a-stock,Number of Smooth Descent Periods of a Stock,2110.0,2233.0,"

You are given an integer array prices representing the daily price history of a stock, where prices[i] is the stock price on the ith day.

+ +

A smooth descent period of a stock consists of one or more contiguous days such that the price on each day is lower than the price on the preceding day by exactly 1. The first day of the period is exempted from this rule.

+ +

Return the number of smooth descent periods.

+ +

 

+

Example 1:

+ +
+Input: prices = [3,2,1,4]
+Output: 7
+Explanation: There are 7 smooth descent periods:
+[3], [2], [1], [4], [3,2], [2,1], and [3,2,1]
+Note that a period with one day is a smooth descent period by the definition.
+
+ +

Example 2:

+ +
+Input: prices = [8,6,7,7]
+Output: 4
+Explanation: There are 4 smooth descent periods: [8], [6], [7], and [7]
+Note that [8,6] is not a smooth descent period as 8 - 6 ≠ 1.
+
+ +

Example 3:

+ +
+Input: prices = [1]
+Output: 1
+Explanation: There is 1 smooth descent period: [1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= prices.length <= 105
    • +
  • 1 <= prices[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + long long getDescentPeriods(vector& prices) { + + } +};","class Solution { + public long getDescentPeriods(int[] prices) { + + } +}","class Solution(object): + def getDescentPeriods(self, prices): + """""" + :type prices: List[int] + :rtype: int + """""" + ","class Solution: + def getDescentPeriods(self, prices: List[int]) -> int: + ","long long getDescentPeriods(int* prices, int pricesSize){ + +}","public class Solution { + public long GetDescentPeriods(int[] prices) { + + } +}","/** + * @param {number[]} prices + * @return {number} + */ +var getDescentPeriods = function(prices) { + +};","# @param {Integer[]} prices +# @return {Integer} +def get_descent_periods(prices) + +end","class Solution { + func getDescentPeriods(_ prices: [Int]) -> Int { + + } +}","func getDescentPeriods(prices []int) int64 { + +}","object Solution { + def getDescentPeriods(prices: Array[Int]): Long = { + + } +}","class Solution { + fun getDescentPeriods(prices: IntArray): Long { + + } +}","impl Solution { + pub fn get_descent_periods(prices: Vec) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $prices + * @return Integer + */ + function getDescentPeriods($prices) { + + } +}","function getDescentPeriods(prices: number[]): number { + +};","(define/contract (get-descent-periods prices) + (-> (listof exact-integer?) exact-integer?) + + )","-spec get_descent_periods(Prices :: [integer()]) -> integer(). +get_descent_periods(Prices) -> + .","defmodule Solution do + @spec get_descent_periods(prices :: [integer]) :: integer + def get_descent_periods(prices) do + + end +end","class Solution { + int getDescentPeriods(List prices) { + + } +}", +493,adding-spaces-to-a-string,Adding Spaces to a String,2109.0,2232.0,"

You are given a 0-indexed string s and a 0-indexed integer array spaces that describes the indices in the original string where spaces will be added. Each space should be inserted before the character at the given index.

+ +
    +
  • For example, given s = "EnjoyYourCoffee" and spaces = [5, 9], we place spaces before 'Y' and 'C', which are at indices 5 and 9 respectively. Thus, we obtain "Enjoy Your Coffee".
    • +
+ +

Return the modified string after the spaces have been added.

+ +

 

+

Example 1:

+ +
+Input: s = "LeetcodeHelpsMeLearn", spaces = [8,13,15]
+Output: "Leetcode Helps Me Learn"
+Explanation: 
+The indices 8, 13, and 15 correspond to the underlined characters in "LeetcodeHelpsMeLearn".
+We then place spaces before those characters.
+
+ +

Example 2:

+ +
+Input: s = "icodeinpython", spaces = [1,5,7,9]
+Output: "i code in py thon"
+Explanation:
+The indices 1, 5, 7, and 9 correspond to the underlined characters in "icodeinpython".
+We then place spaces before those characters.
+
+ +

Example 3:

+ +
+Input: s = "spacing", spaces = [0,1,2,3,4,5,6]
+Output: " s p a c i n g"
+Explanation:
+We are also able to place spaces before the first character of the string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 3 * 105
    • +
  • s consists only of lowercase and uppercase English letters.
    • +
  • 1 <= spaces.length <= 3 * 105
    • +
  • 0 <= spaces[i] <= s.length - 1
    • +
  • All the values of spaces are strictly increasing.
    • +
+",2.0,False,"class Solution { +public: + string addSpaces(string s, vector& spaces) { + + } +};","class Solution { + public String addSpaces(String s, int[] spaces) { + + } +}","class Solution(object): + def addSpaces(self, s, spaces): + """""" + :type s: str + :type spaces: List[int] + :rtype: str + """""" + ","class Solution: + def addSpaces(self, s: str, spaces: List[int]) -> str: + ","char * addSpaces(char * s, int* spaces, int spacesSize){ + +}","public class Solution { + public string AddSpaces(string s, int[] spaces) { + + } +}","/** + * @param {string} s + * @param {number[]} spaces + * @return {string} + */ +var addSpaces = function(s, spaces) { + +};","# @param {String} s +# @param {Integer[]} spaces +# @return {String} +def add_spaces(s, spaces) + +end","class Solution { + func addSpaces(_ s: String, _ spaces: [Int]) -> String { + + } +}","func addSpaces(s string, spaces []int) string { + +}","object Solution { + def addSpaces(s: String, spaces: Array[Int]): String = { + + } +}","class Solution { + fun addSpaces(s: String, spaces: IntArray): String { + + } +}","impl Solution { + pub fn add_spaces(s: String, spaces: Vec) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[] $spaces + * @return String + */ + function addSpaces($s, $spaces) { + + } +}","function addSpaces(s: string, spaces: number[]): string { + +};","(define/contract (add-spaces s spaces) + (-> string? (listof exact-integer?) string?) + + )","-spec add_spaces(S :: unicode:unicode_binary(), Spaces :: [integer()]) -> unicode:unicode_binary(). +add_spaces(S, Spaces) -> + .","defmodule Solution do + @spec add_spaces(s :: String.t, spaces :: [integer]) :: String.t + def add_spaces(s, spaces) do + + end +end","class Solution { + String addSpaces(String s, List spaces) { + + } +}", +495,maximum-fruits-harvested-after-at-most-k-steps,Maximum Fruits Harvested After at Most K Steps,2106.0,2229.0,"

Fruits are available at some positions on an infinite x-axis. You are given a 2D integer array fruits where fruits[i] = [positioni, amounti] depicts amounti fruits at the position positioni. fruits is already sorted by positioni in ascending order, and each positioni is unique.

+ +

You are also given an integer startPos and an integer k. Initially, you are at the position startPos. From any position, you can either walk to the left or right. It takes one step to move one unit on the x-axis, and you can walk at most k steps in total. For every position you reach, you harvest all the fruits at that position, and the fruits will disappear from that position.

+ +

Return the maximum total number of fruits you can harvest.

+ +

 

+

Example 1:

+ +
+Input: fruits = [[2,8],[6,3],[8,6]], startPos = 5, k = 4
+Output: 9
+Explanation: 
+The optimal way is to:
+- Move right to position 6 and harvest 3 fruits
+- Move right to position 8 and harvest 6 fruits
+You moved 3 steps and harvested 3 + 6 = 9 fruits in total.
+
+ +

Example 2:

+ +
+Input: fruits = [[0,9],[4,1],[5,7],[6,2],[7,4],[10,9]], startPos = 5, k = 4
+Output: 14
+Explanation: 
+You can move at most k = 4 steps, so you cannot reach position 0 nor 10.
+The optimal way is to:
+- Harvest the 7 fruits at the starting position 5
+- Move left to position 4 and harvest 1 fruit
+- Move right to position 6 and harvest 2 fruits
+- Move right to position 7 and harvest 4 fruits
+You moved 1 + 3 = 4 steps and harvested 7 + 1 + 2 + 4 = 14 fruits in total.
+
+ +

Example 3:

+ +
+Input: fruits = [[0,3],[6,4],[8,5]], startPos = 3, k = 2
+Output: 0
+Explanation:
+You can move at most k = 2 steps and cannot reach any position with fruits.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= fruits.length <= 105
    • +
  • fruits[i].length == 2
    • +
  • 0 <= startPos, positioni <= 2 * 105
    • +
  • positioni-1 < positioni for any i > 0 (0-indexed)
    • +
  • 1 <= amounti <= 104
    • +
  • 0 <= k <= 2 * 105
    • +
+",3.0,False,"class Solution { +public: + int maxTotalFruits(vector>& fruits, int startPos, int k) { + + } +};","class Solution { + public int maxTotalFruits(int[][] fruits, int startPos, int k) { + + } +}","class Solution(object): + def maxTotalFruits(self, fruits, startPos, k): + """""" + :type fruits: List[List[int]] + :type startPos: int + :type k: int + :rtype: int + """""" + ","class Solution: + def maxTotalFruits(self, fruits: List[List[int]], startPos: int, k: int) -> int: + ","int maxTotalFruits(int** fruits, int fruitsSize, int* fruitsColSize, int startPos, int k){ + +}","public class Solution { + public int MaxTotalFruits(int[][] fruits, int startPos, int k) { + + } +}","/** + * @param {number[][]} fruits + * @param {number} startPos + * @param {number} k + * @return {number} + */ +var maxTotalFruits = function(fruits, startPos, k) { + +};","# @param {Integer[][]} fruits +# @param {Integer} start_pos +# @param {Integer} k +# @return {Integer} +def max_total_fruits(fruits, start_pos, k) + +end","class Solution { + func maxTotalFruits(_ fruits: [[Int]], _ startPos: Int, _ k: Int) -> Int { + + } +}","func maxTotalFruits(fruits [][]int, startPos int, k int) int { + +}","object Solution { + def maxTotalFruits(fruits: Array[Array[Int]], startPos: Int, k: Int): Int = { + + } +}","class Solution { + fun maxTotalFruits(fruits: Array, startPos: Int, k: Int): Int { + + } +}","impl Solution { + pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $fruits + * @param Integer $startPos + * @param Integer $k + * @return Integer + */ + function maxTotalFruits($fruits, $startPos, $k) { + + } +}","function maxTotalFruits(fruits: number[][], startPos: number, k: number): number { + +};","(define/contract (max-total-fruits fruits startPos k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec max_total_fruits(Fruits :: [[integer()]], StartPos :: integer(), K :: integer()) -> integer(). +max_total_fruits(Fruits, StartPos, K) -> + .","defmodule Solution do + @spec max_total_fruits(fruits :: [[integer]], start_pos :: integer, k :: integer) :: integer + def max_total_fruits(fruits, start_pos, k) do + + end +end","class Solution { + int maxTotalFruits(List> fruits, int startPos, int k) { + + } +}", +499,abbreviating-the-product-of-a-range,Abbreviating the Product of a Range,2117.0,2222.0,"

You are given two positive integers left and right with left <= right. Calculate the product of all integers in the inclusive range [left, right].

+ +

Since the product may be very large, you will abbreviate it following these steps:

+ +
    +
  1. Count all trailing zeros in the product and remove them. Let us denote this count as C. + +
      +
    • For example, there are 3 trailing zeros in 1000, and there are 0 trailing zeros in 546.
      • +
    +
    2. +
  2. Denote the remaining number of digits in the product as d. If d > 10, then express the product as <pre>...<suf> where <pre> denotes the first 5 digits of the product, and <suf> denotes the last 5 digits of the product after removing all trailing zeros. If d <= 10, we keep it unchanged. +
      +
    • For example, we express 1234567654321 as 12345...54321, but 1234567 is represented as 1234567.
      • +
    +
    3. +
  3. Finally, represent the product as a string "<pre>...<suf>eC". +
      +
    • For example, 12345678987600000 will be represented as "12345...89876e5".
      • +
    +
    4. +
+ +

Return a string denoting the abbreviated product of all integers in the inclusive range [left, right].

+ +

 

+

Example 1:

+ +
+Input: left = 1, right = 4
+Output: "24e0"
+Explanation: The product is 1 × 2 × 3 × 4 = 24.
+There are no trailing zeros, so 24 remains the same. The abbreviation will end with "e0".
+Since the number of digits is 2, which is less than 10, we do not have to abbreviate it further.
+Thus, the final representation is "24e0".
+
+ +

Example 2:

+ +
+Input: left = 2, right = 11
+Output: "399168e2"
+Explanation: The product is 39916800.
+There are 2 trailing zeros, which we remove to get 399168. The abbreviation will end with "e2".
+The number of digits after removing the trailing zeros is 6, so we do not abbreviate it further.
+Hence, the abbreviated product is "399168e2".
+
+ +

Example 3:

+ +
+Input: left = 371, right = 375
+Output: "7219856259e3"
+Explanation: The product is 7219856259000.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left <= right <= 104
    • +
+",3.0,False,"class Solution { +public: + string abbreviateProduct(int left, int right) { + + } +};","class Solution { + public String abbreviateProduct(int left, int right) { + + } +}","class Solution(object): + def abbreviateProduct(self, left, right): + """""" + :type left: int + :type right: int + :rtype: str + """""" + ","class Solution: + def abbreviateProduct(self, left: int, right: int) -> str: + ","char * abbreviateProduct(int left, int right){ + +}","public class Solution { + public string AbbreviateProduct(int left, int right) { + + } +}","/** + * @param {number} left + * @param {number} right + * @return {string} + */ +var abbreviateProduct = function(left, right) { + +};","# @param {Integer} left +# @param {Integer} right +# @return {String} +def abbreviate_product(left, right) + +end","class Solution { + func abbreviateProduct(_ left: Int, _ right: Int) -> String { + + } +}","func abbreviateProduct(left int, right int) string { + +}","object Solution { + def abbreviateProduct(left: Int, right: Int): String = { + + } +}","class Solution { + fun abbreviateProduct(left: Int, right: Int): String { + + } +}","impl Solution { + pub fn abbreviate_product(left: i32, right: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $left + * @param Integer $right + * @return String + */ + function abbreviateProduct($left, $right) { + + } +}","function abbreviateProduct(left: number, right: number): string { + +};","(define/contract (abbreviate-product left right) + (-> exact-integer? exact-integer? string?) + + )","-spec abbreviate_product(Left :: integer(), Right :: integer()) -> unicode:unicode_binary(). +abbreviate_product(Left, Right) -> + .","defmodule Solution do + @spec abbreviate_product(left :: integer, right :: integer) :: String.t + def abbreviate_product(left, right) do + + end +end","class Solution { + String abbreviateProduct(int left, int right) { + + } +}", +500,check-if-a-parentheses-string-can-be-valid,Check if a Parentheses String Can Be Valid,2116.0,2221.0,"

A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true:

+ +
    +
  • It is ().
    • +
  • It can be written as AB (A concatenated with B), where A and B are valid parentheses strings.
    • +
  • It can be written as (A), where A is a valid parentheses string.
    • +
+ +

You are given a parentheses string s and a string locked, both of length n. locked is a binary string consisting only of '0's and '1's. For each index i of locked,

+ +
    +
  • If locked[i] is '1', you cannot change s[i].
    • +
  • But if locked[i] is '0', you can change s[i] to either '(' or ')'.
    • +
+ +

Return true if you can make s a valid parentheses string. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: s = "))()))", locked = "010100"
+Output: true
+Explanation: locked[1] == '1' and locked[3] == '1', so we cannot change s[1] or s[3].
+We change s[0] and s[4] to '(' while leaving s[2] and s[5] unchanged to make s valid.
+ +

Example 2:

+ +
+Input: s = "()()", locked = "0000"
+Output: true
+Explanation: We do not need to make any changes because s is already valid.
+
+ +

Example 3:

+ +
+Input: s = ")", locked = "0"
+Output: false
+Explanation: locked permits us to change s[0]. 
+Changing s[0] to either '(' or ')' will not make s valid.
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length == locked.length
    • +
  • 1 <= n <= 105
    • +
  • s[i] is either '(' or ')'.
    • +
  • locked[i] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + bool canBeValid(string s, string locked) { + + } +};","class Solution { + public boolean canBeValid(String s, String locked) { + + } +}","class Solution(object): + def canBeValid(self, s, locked): + """""" + :type s: str + :type locked: str + :rtype: bool + """""" + ","class Solution: + def canBeValid(self, s: str, locked: str) -> bool: + ","bool canBeValid(char * s, char * locked){ + +}","public class Solution { + public bool CanBeValid(string s, string locked) { + + } +}","/** + * @param {string} s + * @param {string} locked + * @return {boolean} + */ +var canBeValid = function(s, locked) { + +};","# @param {String} s +# @param {String} locked +# @return {Boolean} +def can_be_valid(s, locked) + +end","class Solution { + func canBeValid(_ s: String, _ locked: String) -> Bool { + + } +}","func canBeValid(s string, locked string) bool { + +}","object Solution { + def canBeValid(s: String, locked: String): Boolean = { + + } +}","class Solution { + fun canBeValid(s: String, locked: String): Boolean { + + } +}","impl Solution { + pub fn can_be_valid(s: String, locked: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $locked + * @return Boolean + */ + function canBeValid($s, $locked) { + + } +}","function canBeValid(s: string, locked: string): boolean { + +};","(define/contract (can-be-valid s locked) + (-> string? string? boolean?) + + )","-spec can_be_valid(S :: unicode:unicode_binary(), Locked :: unicode:unicode_binary()) -> boolean(). +can_be_valid(S, Locked) -> + .","defmodule Solution do + @spec can_be_valid(s :: String.t, locked :: String.t) :: boolean + def can_be_valid(s, locked) do + + end +end","class Solution { + bool canBeValid(String s, String locked) { + + } +}", +503,step-by-step-directions-from-a-binary-tree-node-to-another,Step-By-Step Directions From a Binary Tree Node to Another,2096.0,2217.0,"

You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer startValue representing the value of the start node s, and a different integer destValue representing the value of the destination node t.

+ +

Find the shortest path starting from node s and ending at node t. Generate step-by-step directions of such path as a string consisting of only the uppercase letters 'L', 'R', and 'U'. Each letter indicates a specific direction:

+ +
    +
  • 'L' means to go from a node to its left child node.
    • +
  • 'R' means to go from a node to its right child node.
    • +
  • 'U' means to go from a node to its parent node.
    • +
+ +

Return the step-by-step directions of the shortest path from node s to node t.

+ +

 

+

Example 1:

+ +
+Input: root = [5,1,2,3,null,6,4], startValue = 3, destValue = 6
+Output: "UURL"
+Explanation: The shortest path is: 3 → 1 → 5 → 2 → 6.
+
+ +

Example 2:

+ +
+Input: root = [2,1], startValue = 2, destValue = 1
+Output: "L"
+Explanation: The shortest path is: 2 → 1.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
    • +
  • 2 <= n <= 105
    • +
  • 1 <= Node.val <= n
    • +
  • All the values in the tree are unique.
    • +
  • 1 <= startValue, destValue <= n
    • +
  • startValue != destValue
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + string getDirections(TreeNode* root, int startValue, int destValue) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public String getDirections(TreeNode root, int startValue, int destValue) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def getDirections(self, root, startValue, destValue): + """""" + :type root: Optional[TreeNode] + :type startValue: int + :type destValue: int + :rtype: str + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def getDirections(self, root: Optional[TreeNode], startValue: int, destValue: int) -> str: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +char * getDirections(struct TreeNode* root, int startValue, int destValue){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public string GetDirections(TreeNode root, int startValue, int destValue) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} startValue + * @param {number} destValue + * @return {string} + */ +var getDirections = function(root, startValue, destValue) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} start_value +# @param {Integer} dest_value +# @return {String} +def get_directions(root, start_value, dest_value) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func getDirections(_ root: TreeNode?, _ startValue: Int, _ destValue: Int) -> String { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func getDirections(root *TreeNode, startValue int, destValue int) string { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def getDirections(root: TreeNode, startValue: Int, destValue: Int): String = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun getDirections(root: TreeNode?, startValue: Int, destValue: Int): String { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn get_directions(root: Option>>, start_value: i32, dest_value: i32) -> String { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $startValue + * @param Integer $destValue + * @return String + */ + function getDirections($root, $startValue, $destValue) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function getDirections(root: TreeNode | null, startValue: number, destValue: number): string { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (get-directions root startValue destValue) + (-> (or/c tree-node? #f) exact-integer? exact-integer? string?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec get_directions(Root :: #tree_node{} | null, StartValue :: integer(), DestValue :: integer()) -> unicode:unicode_binary(). +get_directions(Root, StartValue, DestValue) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec get_directions(root :: TreeNode.t | nil, start_value :: integer, dest_value :: integer) :: String.t + def get_directions(root, start_value, dest_value) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + String getDirections(TreeNode? root, int startValue, int destValue) { + + } +}", +506,find-all-people-with-secret,Find All People With Secret,2092.0,2213.0,"

You are given an integer n indicating there are n people numbered from 0 to n - 1. You are also given a 0-indexed 2D integer array meetings where meetings[i] = [xi, yi, timei] indicates that person xi and person yi have a meeting at timei. A person may attend multiple meetings at the same time. Finally, you are given an integer firstPerson.

+ +

Person 0 has a secret and initially shares the secret with a person firstPerson at time 0. This secret is then shared every time a meeting takes place with a person that has the secret. More formally, for every meeting, if a person xi has the secret at timei, then they will share the secret with person yi, and vice versa.

+ +

The secrets are shared instantaneously. That is, a person may receive the secret and share it with people in other meetings within the same time frame.

+ +

Return a list of all the people that have the secret after all the meetings have taken place. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: n = 6, meetings = [[1,2,5],[2,3,8],[1,5,10]], firstPerson = 1
+Output: [0,1,2,3,5]
+Explanation:
+At time 0, person 0 shares the secret with person 1.
+At time 5, person 1 shares the secret with person 2.
+At time 8, person 2 shares the secret with person 3.
+At time 10, person 1 shares the secret with person 5.​​​​
+Thus, people 0, 1, 2, 3, and 5 know the secret after all the meetings.
+
+ +

Example 2:

+ +
+Input: n = 4, meetings = [[3,1,3],[1,2,2],[0,3,3]], firstPerson = 3
+Output: [0,1,3]
+Explanation:
+At time 0, person 0 shares the secret with person 3.
+At time 2, neither person 1 nor person 2 know the secret.
+At time 3, person 3 shares the secret with person 0 and person 1.
+Thus, people 0, 1, and 3 know the secret after all the meetings.
+
+ +

Example 3:

+ +
+Input: n = 5, meetings = [[3,4,2],[1,2,1],[2,3,1]], firstPerson = 1
+Output: [0,1,2,3,4]
+Explanation:
+At time 0, person 0 shares the secret with person 1.
+At time 1, person 1 shares the secret with person 2, and person 2 shares the secret with person 3.
+Note that person 2 can share the secret at the same time as receiving it.
+At time 2, person 3 shares the secret with person 4.
+Thus, people 0, 1, 2, 3, and 4 know the secret after all the meetings.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 105
    • +
  • 1 <= meetings.length <= 105
    • +
  • meetings[i].length == 3
    • +
  • 0 <= xi, yi <= n - 1
    • +
  • xi != yi
    • +
  • 1 <= timei <= 105
    • +
  • 1 <= firstPerson <= n - 1
    • +
+",3.0,False,"class Solution { +public: + vector findAllPeople(int n, vector>& meetings, int firstPerson) { + + } +};","class Solution { + public List findAllPeople(int n, int[][] meetings, int firstPerson) { + + } +}","class Solution(object): + def findAllPeople(self, n, meetings, firstPerson): + """""" + :type n: int + :type meetings: List[List[int]] + :type firstPerson: int + :rtype: List[int] + """""" + ","class Solution: + def findAllPeople(self, n: int, meetings: List[List[int]], firstPerson: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findAllPeople(int n, int** meetings, int meetingsSize, int* meetingsColSize, int firstPerson, int* returnSize){ + +}","public class Solution { + public IList FindAllPeople(int n, int[][] meetings, int firstPerson) { + + } +}","/** + * @param {number} n + * @param {number[][]} meetings + * @param {number} firstPerson + * @return {number[]} + */ +var findAllPeople = function(n, meetings, firstPerson) { + +};","# @param {Integer} n +# @param {Integer[][]} meetings +# @param {Integer} first_person +# @return {Integer[]} +def find_all_people(n, meetings, first_person) + +end","class Solution { + func findAllPeople(_ n: Int, _ meetings: [[Int]], _ firstPerson: Int) -> [Int] { + + } +}","func findAllPeople(n int, meetings [][]int, firstPerson int) []int { + +}","object Solution { + def findAllPeople(n: Int, meetings: Array[Array[Int]], firstPerson: Int): List[Int] = { + + } +}","class Solution { + fun findAllPeople(n: Int, meetings: Array, firstPerson: Int): List { + + } +}","impl Solution { + pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $meetings + * @param Integer $firstPerson + * @return Integer[] + */ + function findAllPeople($n, $meetings, $firstPerson) { + + } +}","function findAllPeople(n: number, meetings: number[][], firstPerson: number): number[] { + +};","(define/contract (find-all-people n meetings firstPerson) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? (listof exact-integer?)) + + )","-spec find_all_people(N :: integer(), Meetings :: [[integer()]], FirstPerson :: integer()) -> [integer()]. +find_all_people(N, Meetings, FirstPerson) -> + .","defmodule Solution do + @spec find_all_people(n :: integer, meetings :: [[integer]], first_person :: integer) :: [integer] + def find_all_people(n, meetings, first_person) do + + end +end","class Solution { + List findAllPeople(int n, List> meetings, int firstPerson) { + + } +}", +508,k-radius-subarray-averages,K Radius Subarray Averages,2090.0,2211.0,"

You are given a 0-indexed array nums of n integers, and an integer k.

+ +

The k-radius average for a subarray of nums centered at some index i with the radius k is the average of all elements in nums between the indices i - k and i + k (inclusive). If there are less than k elements before or after the index i, then the k-radius average is -1.

+ +

Build and return an array avgs of length n where avgs[i] is the k-radius average for the subarray centered at index i.

+ +

The average of x elements is the sum of the x elements divided by x, using integer division. The integer division truncates toward zero, which means losing its fractional part.

+ +
    +
  • For example, the average of four elements 2, 3, 1, and 5 is (2 + 3 + 1 + 5) / 4 = 11 / 4 = 2.75, which truncates to 2.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [7,4,3,9,1,8,5,2,6], k = 3
+Output: [-1,-1,-1,5,4,4,-1,-1,-1]
+Explanation:
+- avg[0], avg[1], and avg[2] are -1 because there are less than k elements before each index.
+- The sum of the subarray centered at index 3 with radius 3 is: 7 + 4 + 3 + 9 + 1 + 8 + 5 = 37.
+  Using integer division, avg[3] = 37 / 7 = 5.
+- For the subarray centered at index 4, avg[4] = (4 + 3 + 9 + 1 + 8 + 5 + 2) / 7 = 4.
+- For the subarray centered at index 5, avg[5] = (3 + 9 + 1 + 8 + 5 + 2 + 6) / 7 = 4.
+- avg[6], avg[7], and avg[8] are -1 because there are less than k elements after each index.
+
+ +

Example 2:

+ +
+Input: nums = [100000], k = 0
+Output: [100000]
+Explanation:
+- The sum of the subarray centered at index 0 with radius 0 is: 100000.
+  avg[0] = 100000 / 1 = 100000.
+
+ +

Example 3:

+ +
+Input: nums = [8], k = 100000
+Output: [-1]
+Explanation: 
+- avg[0] is -1 because there are less than k elements before and after index 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= nums[i], k <= 105
    • +
+",2.0,False,"class Solution { +public: + vector getAverages(vector& nums, int k) { + + } +};","class Solution { + public int[] getAverages(int[] nums, int k) { + + } +}","class Solution(object): + def getAverages(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def getAverages(self, nums: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getAverages(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public int[] GetAverages(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var getAverages = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer[]} +def get_averages(nums, k) + +end","class Solution { + func getAverages(_ nums: [Int], _ k: Int) -> [Int] { + + } +}","func getAverages(nums []int, k int) []int { + +}","object Solution { + def getAverages(nums: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun getAverages(nums: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn get_averages(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer[] + */ + function getAverages($nums, $k) { + + } +}","function getAverages(nums: number[], k: number): number[] { + +};","(define/contract (get-averages nums k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec get_averages(Nums :: [integer()], K :: integer()) -> [integer()]. +get_averages(Nums, K) -> + .","defmodule Solution do + @spec get_averages(nums :: [integer], k :: integer) :: [integer] + def get_averages(nums, k) do + + end +end","class Solution { + List getAverages(List nums, int k) { + + } +}", +510,sequentially-ordinal-rank-tracker,Sequentially Ordinal Rank Tracker,2102.0,2207.0,"

A scenic location is represented by its name and attractiveness score, where name is a unique string among all locations and score is an integer. Locations can be ranked from the best to the worst. The higher the score, the better the location. If the scores of two locations are equal, then the location with the lexicographically smaller name is better.

+ +

You are building a system that tracks the ranking of locations with the system initially starting with no locations. It supports:

+ +
    +
  • Adding scenic locations, one at a time.
    • +
  • Querying the ith best location of all locations already added, where i is the number of times the system has been queried (including the current query). +
      +
    • For example, when the system is queried for the 4th time, it returns the 4th best location of all locations already added.
      • +
    +
    • +
+ +

Note that the test data are generated so that at any time, the number of queries does not exceed the number of locations added to the system.

+ +

Implement the SORTracker class:

+ +
    +
  • SORTracker() Initializes the tracker system.
    • +
  • void add(string name, int score) Adds a scenic location with name and score to the system.
    • +
  • string get() Queries and returns the ith best location, where i is the number of times this method has been invoked (including this invocation).
    • +
+ +

 

+

Example 1:

+ +
+Input
+["SORTracker", "add", "add", "get", "add", "get", "add", "get", "add", "get", "add", "get", "get"]
+[[], ["bradford", 2], ["branford", 3], [], ["alps", 2], [], ["orland", 2], [], ["orlando", 3], [], ["alpine", 2], [], []]
+Output
+[null, null, null, "branford", null, "alps", null, "bradford", null, "bradford", null, "bradford", "orland"]
+
+Explanation
+SORTracker tracker = new SORTracker(); // Initialize the tracker system.
+tracker.add("bradford", 2); // Add location with name="bradford" and score=2 to the system.
+tracker.add("branford", 3); // Add location with name="branford" and score=3 to the system.
+tracker.get();              // The sorted locations, from best to worst, are: branford, bradford.
+                            // Note that branford precedes bradford due to its higher score (3 > 2).
+                            // This is the 1st time get() is called, so return the best location: "branford".
+tracker.add("alps", 2);     // Add location with name="alps" and score=2 to the system.
+tracker.get();              // Sorted locations: branford, alps, bradford.
+                            // Note that alps precedes bradford even though they have the same score (2).
+                            // This is because "alps" is lexicographically smaller than "bradford".
+                            // Return the 2nd best location "alps", as it is the 2nd time get() is called.
+tracker.add("orland", 2);   // Add location with name="orland" and score=2 to the system.
+tracker.get();              // Sorted locations: branford, alps, bradford, orland.
+                            // Return "bradford", as it is the 3rd time get() is called.
+tracker.add("orlando", 3);  // Add location with name="orlando" and score=3 to the system.
+tracker.get();              // Sorted locations: branford, orlando, alps, bradford, orland.
+                            // Return "bradford".
+tracker.add("alpine", 2);   // Add location with name="alpine" and score=2 to the system.
+tracker.get();              // Sorted locations: branford, orlando, alpine, alps, bradford, orland.
+                            // Return "bradford".
+tracker.get();              // Sorted locations: branford, orlando, alpine, alps, bradford, orland.
+                            // Return "orland".
+
+ +

 

+

Constraints:

+ +
    +
  • name consists of lowercase English letters, and is unique among all locations.
    • +
  • 1 <= name.length <= 10
    • +
  • 1 <= score <= 105
    • +
  • At any time, the number of calls to get does not exceed the number of calls to add.
    • +
  • At most 4 * 104 calls in total will be made to add and get.
    • +
+",3.0,False,"class SORTracker { +public: + SORTracker() { + + } + + void add(string name, int score) { + + } + + string get() { + + } +}; + +/** + * Your SORTracker object will be instantiated and called as such: + * SORTracker* obj = new SORTracker(); + * obj->add(name,score); + * string param_2 = obj->get(); + */","class SORTracker { + + public SORTracker() { + + } + + public void add(String name, int score) { + + } + + public String get() { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * SORTracker obj = new SORTracker(); + * obj.add(name,score); + * String param_2 = obj.get(); + */","class SORTracker(object): + + def __init__(self): + + + def add(self, name, score): + """""" + :type name: str + :type score: int + :rtype: None + """""" + + + def get(self): + """""" + :rtype: str + """""" + + + +# Your SORTracker object will be instantiated and called as such: +# obj = SORTracker() +# obj.add(name,score) +# param_2 = obj.get()","class SORTracker: + + def __init__(self): + + + def add(self, name: str, score: int) -> None: + + + def get(self) -> str: + + + +# Your SORTracker object will be instantiated and called as such: +# obj = SORTracker() +# obj.add(name,score) +# param_2 = obj.get()"," + + +typedef struct { + +} SORTracker; + + +SORTracker* sORTrackerCreate() { + +} + +void sORTrackerAdd(SORTracker* obj, char * name, int score) { + +} + +char * sORTrackerGet(SORTracker* obj) { + +} + +void sORTrackerFree(SORTracker* obj) { + +} + +/** + * Your SORTracker struct will be instantiated and called as such: + * SORTracker* obj = sORTrackerCreate(); + * sORTrackerAdd(obj, name, score); + + * char * param_2 = sORTrackerGet(obj); + + * sORTrackerFree(obj); +*/","public class SORTracker { + + public SORTracker() { + + } + + public void Add(string name, int score) { + + } + + public string Get() { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * SORTracker obj = new SORTracker(); + * obj.Add(name,score); + * string param_2 = obj.Get(); + */"," +var SORTracker = function() { + +}; + +/** + * @param {string} name + * @param {number} score + * @return {void} + */ +SORTracker.prototype.add = function(name, score) { + +}; + +/** + * @return {string} + */ +SORTracker.prototype.get = function() { + +}; + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */","class SORTracker + def initialize() + + end + + +=begin + :type name: String + :type score: Integer + :rtype: Void +=end + def add(name, score) + + end + + +=begin + :rtype: String +=end + def get() + + end + + +end + +# Your SORTracker object will be instantiated and called as such: +# obj = SORTracker.new() +# obj.add(name, score) +# param_2 = obj.get()"," +class SORTracker { + + init() { + + } + + func add(_ name: String, _ score: Int) { + + } + + func get() -> String { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * let obj = SORTracker() + * obj.add(name, score) + * let ret_2: String = obj.get() + */","type SORTracker struct { + +} + + +func Constructor() SORTracker { + +} + + +func (this *SORTracker) Add(name string, score int) { + +} + + +func (this *SORTracker) Get() string { + +} + + +/** + * Your SORTracker object will be instantiated and called as such: + * obj := Constructor(); + * obj.Add(name,score); + * param_2 := obj.Get(); + */","class SORTracker() { + + def add(name: String, score: Int) { + + } + + def get(): String = { + + } + +} + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */","class SORTracker() { + + fun add(name: String, score: Int) { + + } + + fun get(): String { + + } + +} + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */","struct SORTracker { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl SORTracker { + + fn new() -> Self { + + } + + fn add(&self, name: String, score: i32) { + + } + + fn get(&self) -> String { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * let obj = SORTracker::new(); + * obj.add(name, score); + * let ret_2: String = obj.get(); + */","class SORTracker { + /** + */ + function __construct() { + + } + + /** + * @param String $name + * @param Integer $score + * @return NULL + */ + function add($name, $score) { + + } + + /** + * @return String + */ + function get() { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * $obj = SORTracker(); + * $obj->add($name, $score); + * $ret_2 = $obj->get(); + */","class SORTracker { + constructor() { + + } + + add(name: string, score: number): void { + + } + + get(): string { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * var obj = new SORTracker() + * obj.add(name,score) + * var param_2 = obj.get() + */","(define sor-tracker% + (class object% + (super-new) + + (init-field) + + ; add : string? exact-integer? -> void? + (define/public (add name score) + + ) + ; get : -> string? + (define/public (get) + + ))) + +;; Your sor-tracker% object will be instantiated and called as such: +;; (define obj (new sor-tracker%)) +;; (send obj add name score) +;; (define param_2 (send obj get))","-spec sor_tracker_init_() -> any(). +sor_tracker_init_() -> + . + +-spec sor_tracker_add(Name :: unicode:unicode_binary(), Score :: integer()) -> any(). +sor_tracker_add(Name, Score) -> + . + +-spec sor_tracker_get() -> unicode:unicode_binary(). +sor_tracker_get() -> + . + + +%% Your functions will be called as such: +%% sor_tracker_init_(), +%% sor_tracker_add(Name, Score), +%% Param_2 = sor_tracker_get(), + +%% sor_tracker_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule SORTracker do + @spec init_() :: any + def init_() do + + end + + @spec add(name :: String.t, score :: integer) :: any + def add(name, score) do + + end + + @spec get() :: String.t + def get() do + + end +end + +# Your functions will be called as such: +# SORTracker.init_() +# SORTracker.add(name, score) +# param_2 = SORTracker.get() + +# SORTracker.init_ will be called before every test case, in which you can do some necessary initializations.","class SORTracker { + + SORTracker() { + + } + + void add(String name, int score) { + + } + + String get() { + + } +} + +/** + * Your SORTracker object will be instantiated and called as such: + * SORTracker obj = SORTracker(); + * obj.add(name,score); + * String param2 = obj.get(); + */", +511,detonate-the-maximum-bombs,Detonate the Maximum Bombs,2101.0,2206.0,"

You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb.

+ +

The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range.

+ +

You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range. These bombs will further detonate the bombs that lie in their ranges.

+ +

Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb.

+ +

 

+

Example 1:

+ +
+Input: bombs = [[2,1,3],[6,1,4]]
+Output: 2
+Explanation:
+The above figure shows the positions and ranges of the 2 bombs.
+If we detonate the left bomb, the right bomb will not be affected.
+But if we detonate the right bomb, both bombs will be detonated.
+So the maximum bombs that can be detonated is max(1, 2) = 2.
+
+ +

Example 2:

+ +
+Input: bombs = [[1,1,5],[10,10,5]]
+Output: 1
+Explanation:
+Detonating either bomb will not detonate the other bomb, so the maximum number of bombs that can be detonated is 1.
+
+ +

Example 3:

+ +
+Input: bombs = [[1,2,3],[2,3,1],[3,4,2],[4,5,3],[5,6,4]]
+Output: 5
+Explanation:
+The best bomb to detonate is bomb 0 because:
+- Bomb 0 detonates bombs 1 and 2. The red circle denotes the range of bomb 0.
+- Bomb 2 detonates bomb 3. The blue circle denotes the range of bomb 2.
+- Bomb 3 detonates bomb 4. The green circle denotes the range of bomb 3.
+Thus all 5 bombs are detonated.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= bombs.length <= 100
    • +
  • bombs[i].length == 3
    • +
  • 1 <= xi, yi, ri <= 105
    • +
+",2.0,False,"class Solution { +public: + int maximumDetonation(vector>& bombs) { + + } +};","class Solution { + public int maximumDetonation(int[][] bombs) { + + } +}","class Solution(object): + def maximumDetonation(self, bombs): + """""" + :type bombs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumDetonation(self, bombs: List[List[int]]) -> int: + ","int maximumDetonation(int** bombs, int bombsSize, int* bombsColSize){ + +}","public class Solution { + public int MaximumDetonation(int[][] bombs) { + + } +}","/** + * @param {number[][]} bombs + * @return {number} + */ +var maximumDetonation = function(bombs) { + +};","# @param {Integer[][]} bombs +# @return {Integer} +def maximum_detonation(bombs) + +end","class Solution { + func maximumDetonation(_ bombs: [[Int]]) -> Int { + + } +}","func maximumDetonation(bombs [][]int) int { + +}","object Solution { + def maximumDetonation(bombs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumDetonation(bombs: Array): Int { + + } +}","impl Solution { + pub fn maximum_detonation(bombs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $bombs + * @return Integer + */ + function maximumDetonation($bombs) { + + } +}","function maximumDetonation(bombs: number[][]): number { + +};","(define/contract (maximum-detonation bombs) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_detonation(Bombs :: [[integer()]]) -> integer(). +maximum_detonation(Bombs) -> + .","defmodule Solution do + @spec maximum_detonation(bombs :: [[integer]]) :: integer + def maximum_detonation(bombs) do + + end +end","class Solution { + int maximumDetonation(List> bombs) { + + } +}", +512,find-good-days-to-rob-the-bank,Find Good Days to Rob the Bank,2100.0,2205.0,"

You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array security, where security[i] is the number of guards on duty on the ith day. The days are numbered starting from 0. You are also given an integer time.

+ +

The ith day is a good day to rob the bank if:

+ +
    +
  • There are at least time days before and after the ith day,
    • +
  • The number of guards at the bank for the time days before i are non-increasing, and
    • +
  • The number of guards at the bank for the time days after i are non-decreasing.
    • +
+ +

More formally, this means day i is a good day to rob the bank if and only if security[i - time] >= security[i - time + 1] >= ... >= security[i] <= ... <= security[i + time - 1] <= security[i + time].

+ +

Return a list of all days (0-indexed) that are good days to rob the bank. The order that the days are returned in does not matter.

+ +

 

+

Example 1:

+ +
+Input: security = [5,3,3,3,5,6,2], time = 2
+Output: [2,3]
+Explanation:
+On day 2, we have security[0] >= security[1] >= security[2] <= security[3] <= security[4].
+On day 3, we have security[1] >= security[2] >= security[3] <= security[4] <= security[5].
+No other days satisfy this condition, so days 2 and 3 are the only good days to rob the bank.
+
+ +

Example 2:

+ +
+Input: security = [1,1,1,1,1], time = 0
+Output: [0,1,2,3,4]
+Explanation:
+Since time equals 0, every day is a good day to rob the bank, so return every day.
+
+ +

Example 3:

+ +
+Input: security = [1,2,3,4,5,6], time = 2
+Output: []
+Explanation:
+No day has 2 days before it that have a non-increasing number of guards.
+Thus, no day is a good day to rob the bank, so return an empty list.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= security.length <= 105
    • +
  • 0 <= security[i], time <= 105
    • +
+",2.0,False,"class Solution { +public: + vector goodDaysToRobBank(vector& security, int time) { + + } +};","class Solution { + public List goodDaysToRobBank(int[] security, int time) { + + } +}","class Solution(object): + def goodDaysToRobBank(self, security, time): + """""" + :type security: List[int] + :type time: int + :rtype: List[int] + """""" + ","class Solution: + def goodDaysToRobBank(self, security: List[int], time: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* goodDaysToRobBank(int* security, int securitySize, int time, int* returnSize){ + +}","public class Solution { + public IList GoodDaysToRobBank(int[] security, int time) { + + } +}","/** + * @param {number[]} security + * @param {number} time + * @return {number[]} + */ +var goodDaysToRobBank = function(security, time) { + +};","# @param {Integer[]} security +# @param {Integer} time +# @return {Integer[]} +def good_days_to_rob_bank(security, time) + +end","class Solution { + func goodDaysToRobBank(_ security: [Int], _ time: Int) -> [Int] { + + } +}","func goodDaysToRobBank(security []int, time int) []int { + +}","object Solution { + def goodDaysToRobBank(security: Array[Int], time: Int): List[Int] = { + + } +}","class Solution { + fun goodDaysToRobBank(security: IntArray, time: Int): List { + + } +}","impl Solution { + pub fn good_days_to_rob_bank(security: Vec, time: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $security + * @param Integer $time + * @return Integer[] + */ + function goodDaysToRobBank($security, $time) { + + } +}","function goodDaysToRobBank(security: number[], time: number): number[] { + +};","(define/contract (good-days-to-rob-bank security time) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec good_days_to_rob_bank(Security :: [integer()], Time :: integer()) -> [integer()]. +good_days_to_rob_bank(Security, Time) -> + .","defmodule Solution do + @spec good_days_to_rob_bank(security :: [integer], time :: integer) :: [integer] + def good_days_to_rob_bank(security, time) do + + end +end","class Solution { + List goodDaysToRobBank(List security, int time) { + + } +}", +514,sum-of-k-mirror-numbers,Sum of k-Mirror Numbers,2081.0,2202.0,"

A k-mirror number is a positive integer without leading zeros that reads the same both forward and backward in base-10 as well as in base-k.

+ +
    +
  • For example, 9 is a 2-mirror number. The representation of 9 in base-10 and base-2 are 9 and 1001 respectively, which read the same both forward and backward.
    • +
  • On the contrary, 4 is not a 2-mirror number. The representation of 4 in base-2 is 100, which does not read the same both forward and backward.
    • +
+ +

Given the base k and the number n, return the sum of the n smallest k-mirror numbers.

+ +

 

+

Example 1:

+ +
+Input: k = 2, n = 5
+Output: 25
+Explanation:
+The 5 smallest 2-mirror numbers and their representations in base-2 are listed as follows:
+  base-10    base-2
+    1          1
+    3          11
+    5          101
+    7          111
+    9          1001
+Their sum = 1 + 3 + 5 + 7 + 9 = 25. 
+
+ +

Example 2:

+ +
+Input: k = 3, n = 7
+Output: 499
+Explanation:
+The 7 smallest 3-mirror numbers are and their representations in base-3 are listed as follows:
+  base-10    base-3
+    1          1
+    2          2
+    4          11
+    8          22
+    121        11111
+    151        12121
+    212        21212
+Their sum = 1 + 2 + 4 + 8 + 121 + 151 + 212 = 499.
+
+ +

Example 3:

+ +
+Input: k = 7, n = 17
+Output: 20379000
+Explanation: The 17 smallest 7-mirror numbers are:
+1, 2, 3, 4, 5, 6, 8, 121, 171, 242, 292, 16561, 65656, 2137312, 4602064, 6597956, 6958596
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= k <= 9
    • +
  • 1 <= n <= 30
    • +
+",3.0,False,"class Solution { +public: + long long kMirror(int k, int n) { + + } +};","class Solution { + public long kMirror(int k, int n) { + + } +}","class Solution(object): + def kMirror(self, k, n): + """""" + :type k: int + :type n: int + :rtype: int + """""" + ","class Solution: + def kMirror(self, k: int, n: int) -> int: + ","long long kMirror(int k, int n){ + +}","public class Solution { + public long KMirror(int k, int n) { + + } +}","/** + * @param {number} k + * @param {number} n + * @return {number} + */ +var kMirror = function(k, n) { + +};","# @param {Integer} k +# @param {Integer} n +# @return {Integer} +def k_mirror(k, n) + +end","class Solution { + func kMirror(_ k: Int, _ n: Int) -> Int { + + } +}","func kMirror(k int, n int) int64 { + +}","object Solution { + def kMirror(k: Int, n: Int): Long = { + + } +}","class Solution { + fun kMirror(k: Int, n: Int): Long { + + } +}","impl Solution { + pub fn k_mirror(k: i32, n: i32) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer $n + * @return Integer + */ + function kMirror($k, $n) { + + } +}","function kMirror(k: number, n: number): number { + +};","(define/contract (k-mirror k n) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec k_mirror(K :: integer(), N :: integer()) -> integer(). +k_mirror(K, N) -> + .","defmodule Solution do + @spec k_mirror(k :: integer, n :: integer) :: integer + def k_mirror(k, n) do + + end +end","class Solution { + int kMirror(int k, int n) { + + } +}", +515,valid-arrangement-of-pairs,Valid Arrangement of Pairs,2097.0,2201.0,"

You are given a 0-indexed 2D integer array pairs where pairs[i] = [starti, endi]. An arrangement of pairs is valid if for every index i where 1 <= i < pairs.length, we have endi-1 == starti.

+ +

Return any valid arrangement of pairs.

+ +

Note: The inputs will be generated such that there exists a valid arrangement of pairs.

+ +

 

+

Example 1:

+ +
+Input: pairs = [[5,1],[4,5],[11,9],[9,4]]
+Output: [[11,9],[9,4],[4,5],[5,1]]
+Explanation:
+This is a valid arrangement since endi-1 always equals starti.
+end0 = 9 == 9 = start1 
+end1 = 4 == 4 = start2
+end2 = 5 == 5 = start3
+
+ +

Example 2:

+ +
+Input: pairs = [[1,3],[3,2],[2,1]]
+Output: [[1,3],[3,2],[2,1]]
+Explanation:
+This is a valid arrangement since endi-1 always equals starti.
+end0 = 3 == 3 = start1
+end1 = 2 == 2 = start2
+The arrangements [[2,1],[1,3],[3,2]] and [[3,2],[2,1],[1,3]] are also valid.
+
+ +

Example 3:

+ +
+Input: pairs = [[1,2],[1,3],[2,1]]
+Output: [[1,2],[2,1],[1,3]]
+Explanation:
+This is a valid arrangement since endi-1 always equals starti.
+end0 = 2 == 2 = start1
+end1 = 1 == 1 = start2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pairs.length <= 105
    • +
  • pairs[i].length == 2
    • +
  • 0 <= starti, endi <= 109
    • +
  • starti != endi
    • +
  • No two pairs are exactly the same.
    • +
  • There exists a valid arrangement of pairs.
    • +
+",3.0,False,"class Solution { +public: + vector> validArrangement(vector>& pairs) { + + } +};","class Solution { + public int[][] validArrangement(int[][] pairs) { + + } +}","class Solution(object): + def validArrangement(self, pairs): + """""" + :type pairs: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def validArrangement(self, pairs: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** validArrangement(int** pairs, int pairsSize, int* pairsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] ValidArrangement(int[][] pairs) { + + } +}","/** + * @param {number[][]} pairs + * @return {number[][]} + */ +var validArrangement = function(pairs) { + +};","# @param {Integer[][]} pairs +# @return {Integer[][]} +def valid_arrangement(pairs) + +end","class Solution { + func validArrangement(_ pairs: [[Int]]) -> [[Int]] { + + } +}","func validArrangement(pairs [][]int) [][]int { + +}","object Solution { + def validArrangement(pairs: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun validArrangement(pairs: Array): Array { + + } +}","impl Solution { + pub fn valid_arrangement(pairs: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $pairs + * @return Integer[][] + */ + function validArrangement($pairs) { + + } +}","function validArrangement(pairs: number[][]): number[][] { + +};","(define/contract (valid-arrangement pairs) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec valid_arrangement(Pairs :: [[integer()]]) -> [[integer()]]. +valid_arrangement(Pairs) -> + .","defmodule Solution do + @spec valid_arrangement(pairs :: [[integer]]) :: [[integer]] + def valid_arrangement(pairs) do + + end +end","class Solution { + List> validArrangement(List> pairs) { + + } +}", +516,stamping-the-grid,Stamping the Grid,2132.0,2200.0,"

You are given an m x n binary matrix grid where each cell is either 0 (empty) or 1 (occupied).

+ +

You are then given stamps of size stampHeight x stampWidth. We want to fit the stamps such that they follow the given restrictions and requirements:

+ +
    +
  1. Cover all the empty cells.
    2. +
  2. Do not cover any of the occupied cells.
    3. +
  3. We can put as many stamps as we want.
    4. +
  4. Stamps can overlap with each other.
    5. +
  5. Stamps are not allowed to be rotated.
    6. +
  6. Stamps must stay completely inside the grid.
    7. +
+ +

Return true if it is possible to fit the stamps while following the given restrictions and requirements. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,0,0,0],[1,0,0,0],[1,0,0,0],[1,0,0,0],[1,0,0,0]], stampHeight = 4, stampWidth = 3
+Output: true
+Explanation: We have two overlapping stamps (labeled 1 and 2 in the image) that are able to cover all the empty cells.
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2 
+Output: false 
+Explanation: There is no way to fit the stamps onto all the empty cells without the stamps going outside the grid.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[r].length
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 2 * 105
    • +
  • grid[r][c] is either 0 or 1.
    • +
  • 1 <= stampHeight, stampWidth <= 105
    • +
+",3.0,False,"class Solution { +public: + bool possibleToStamp(vector>& grid, int stampHeight, int stampWidth) { + + } +};","class Solution { + public boolean possibleToStamp(int[][] grid, int stampHeight, int stampWidth) { + + } +}","class Solution(object): + def possibleToStamp(self, grid, stampHeight, stampWidth): + """""" + :type grid: List[List[int]] + :type stampHeight: int + :type stampWidth: int + :rtype: bool + """""" + ","class Solution: + def possibleToStamp(self, grid: List[List[int]], stampHeight: int, stampWidth: int) -> bool: + ","bool possibleToStamp(int** grid, int gridSize, int* gridColSize, int stampHeight, int stampWidth){ + +}","public class Solution { + public bool PossibleToStamp(int[][] grid, int stampHeight, int stampWidth) { + + } +}","/** + * @param {number[][]} grid + * @param {number} stampHeight + * @param {number} stampWidth + * @return {boolean} + */ +var possibleToStamp = function(grid, stampHeight, stampWidth) { + +};","# @param {Integer[][]} grid +# @param {Integer} stamp_height +# @param {Integer} stamp_width +# @return {Boolean} +def possible_to_stamp(grid, stamp_height, stamp_width) + +end","class Solution { + func possibleToStamp(_ grid: [[Int]], _ stampHeight: Int, _ stampWidth: Int) -> Bool { + + } +}","func possibleToStamp(grid [][]int, stampHeight int, stampWidth int) bool { + +}","object Solution { + def possibleToStamp(grid: Array[Array[Int]], stampHeight: Int, stampWidth: Int): Boolean = { + + } +}","class Solution { + fun possibleToStamp(grid: Array, stampHeight: Int, stampWidth: Int): Boolean { + + } +}","impl Solution { + pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer $stampHeight + * @param Integer $stampWidth + * @return Boolean + */ + function possibleToStamp($grid, $stampHeight, $stampWidth) { + + } +}","function possibleToStamp(grid: number[][], stampHeight: number, stampWidth: number): boolean { + +};","(define/contract (possible-to-stamp grid stampHeight stampWidth) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? boolean?) + + )","-spec possible_to_stamp(Grid :: [[integer()]], StampHeight :: integer(), StampWidth :: integer()) -> boolean(). +possible_to_stamp(Grid, StampHeight, StampWidth) -> + .","defmodule Solution do + @spec possible_to_stamp(grid :: [[integer]], stamp_height :: integer, stamp_width :: integer) :: boolean + def possible_to_stamp(grid, stamp_height, stamp_width) do + + end +end","class Solution { + bool possibleToStamp(List> grid, int stampHeight, int stampWidth) { + + } +}", +518,process-restricted-friend-requests,Process Restricted Friend Requests,2076.0,2198.0,"

You are given an integer n indicating the number of people in a network. Each person is labeled from 0 to n - 1.

+ +

You are also given a 0-indexed 2D integer array restrictions, where restrictions[i] = [xi, yi] means that person xi and person yi cannot become friends, either directly or indirectly through other people.

+ +

Initially, no one is friends with each other. You are given a list of friend requests as a 0-indexed 2D integer array requests, where requests[j] = [uj, vj] is a friend request between person uj and person vj.

+ +

A friend request is successful if uj and vj can be friends. Each friend request is processed in the given order (i.e., requests[j] occurs before requests[j + 1]), and upon a successful request, uj and vj become direct friends for all future friend requests.

+ +

Return a boolean array result, where each result[j] is true if the jth friend request is successful or false if it is not.

+ +

Note: If uj and vj are already direct friends, the request is still successful.

+ +

 

+

Example 1:

+ +
+Input: n = 3, restrictions = [[0,1]], requests = [[0,2],[2,1]]
+Output: [true,false]
+Explanation:
+Request 0: Person 0 and person 2 can be friends, so they become direct friends. 
+Request 1: Person 2 and person 1 cannot be friends since person 0 and person 1 would be indirect friends (1--2--0).
+
+ +

Example 2:

+ +
+Input: n = 3, restrictions = [[0,1]], requests = [[1,2],[0,2]]
+Output: [true,false]
+Explanation:
+Request 0: Person 1 and person 2 can be friends, so they become direct friends.
+Request 1: Person 0 and person 2 cannot be friends since person 0 and person 1 would be indirect friends (0--2--1).
+
+ +

Example 3:

+ +
+Input: n = 5, restrictions = [[0,1],[1,2],[2,3]], requests = [[0,4],[1,2],[3,1],[3,4]]
+Output: [true,false,true,false]
+Explanation:
+Request 0: Person 0 and person 4 can be friends, so they become direct friends.
+Request 1: Person 1 and person 2 cannot be friends since they are directly restricted.
+Request 2: Person 3 and person 1 can be friends, so they become direct friends.
+Request 3: Person 3 and person 4 cannot be friends since person 0 and person 1 would be indirect friends (0--4--3--1).
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 1000
    • +
  • 0 <= restrictions.length <= 1000
    • +
  • restrictions[i].length == 2
    • +
  • 0 <= xi, yi <= n - 1
    • +
  • xi != yi
    • +
  • 1 <= requests.length <= 1000
    • +
  • requests[j].length == 2
    • +
  • 0 <= uj, vj <= n - 1
    • +
  • uj != vj
    • +
+",3.0,False,"class Solution { +public: + vector friendRequests(int n, vector>& restrictions, vector>& requests) { + + } +};","class Solution { + public boolean[] friendRequests(int n, int[][] restrictions, int[][] requests) { + + } +}","class Solution(object): + def friendRequests(self, n, restrictions, requests): + """""" + :type n: int + :type restrictions: List[List[int]] + :type requests: List[List[int]] + :rtype: List[bool] + """""" + ","class Solution: + def friendRequests(self, n: int, restrictions: List[List[int]], requests: List[List[int]]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* friendRequests(int n, int** restrictions, int restrictionsSize, int* restrictionsColSize, int** requests, int requestsSize, int* requestsColSize, int* returnSize){ + +}","public class Solution { + public bool[] FriendRequests(int n, int[][] restrictions, int[][] requests) { + + } +}","/** + * @param {number} n + * @param {number[][]} restrictions + * @param {number[][]} requests + * @return {boolean[]} + */ +var friendRequests = function(n, restrictions, requests) { + +};","# @param {Integer} n +# @param {Integer[][]} restrictions +# @param {Integer[][]} requests +# @return {Boolean[]} +def friend_requests(n, restrictions, requests) + +end","class Solution { + func friendRequests(_ n: Int, _ restrictions: [[Int]], _ requests: [[Int]]) -> [Bool] { + + } +}","func friendRequests(n int, restrictions [][]int, requests [][]int) []bool { + +}","object Solution { + def friendRequests(n: Int, restrictions: Array[Array[Int]], requests: Array[Array[Int]]): Array[Boolean] = { + + } +}","class Solution { + fun friendRequests(n: Int, restrictions: Array, requests: Array): BooleanArray { + + } +}","impl Solution { + pub fn friend_requests(n: i32, restrictions: Vec>, requests: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $restrictions + * @param Integer[][] $requests + * @return Boolean[] + */ + function friendRequests($n, $restrictions, $requests) { + + } +}","function friendRequests(n: number, restrictions: number[][], requests: number[][]): boolean[] { + +};","(define/contract (friend-requests n restrictions requests) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof boolean?)) + + )","-spec friend_requests(N :: integer(), Restrictions :: [[integer()]], Requests :: [[integer()]]) -> [boolean()]. +friend_requests(N, Restrictions, Requests) -> + .","defmodule Solution do + @spec friend_requests(n :: integer, restrictions :: [[integer]], requests :: [[integer]]) :: [boolean] + def friend_requests(n, restrictions, requests) do + + end +end","class Solution { + List friendRequests(int n, List> restrictions, List> requests) { + + } +}", +519,decode-the-slanted-ciphertext,Decode the Slanted Ciphertext,2075.0,2197.0,"

A string originalText is encoded using a slanted transposition cipher to a string encodedText with the help of a matrix having a fixed number of rows rows.

+ +

originalText is placed first in a top-left to bottom-right manner.

+ +

The blue cells are filled first, followed by the red cells, then the yellow cells, and so on, until we reach the end of originalText. The arrow indicates the order in which the cells are filled. All empty cells are filled with ' '. The number of columns is chosen such that the rightmost column will not be empty after filling in originalText.

+ +

encodedText is then formed by appending all characters of the matrix in a row-wise fashion.

+ +

The characters in the blue cells are appended first to encodedText, then the red cells, and so on, and finally the yellow cells. The arrow indicates the order in which the cells are accessed.

+ +

For example, if originalText = "cipher" and rows = 3, then we encode it in the following manner:

+ +

The blue arrows depict how originalText is placed in the matrix, and the red arrows denote the order in which encodedText is formed. In the above example, encodedText = "ch ie pr".

+ +

Given the encoded string encodedText and number of rows rows, return the original string originalText.

+ +

Note: originalText does not have any trailing spaces ' '. The test cases are generated such that there is only one possible originalText.

+ +

 

+

Example 1:

+ +
+Input: encodedText = "ch   ie   pr", rows = 3
+Output: "cipher"
+Explanation: This is the same example described in the problem description.
+
+ +

Example 2:

+ +
+Input: encodedText = "iveo    eed   l te   olc", rows = 4
+Output: "i love leetcode"
+Explanation: The figure above denotes the matrix that was used to encode originalText. 
+The blue arrows show how we can find originalText from encodedText.
+
+ +

Example 3:

+ +
+Input: encodedText = "coding", rows = 1
+Output: "coding"
+Explanation: Since there is only 1 row, both originalText and encodedText are the same.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= encodedText.length <= 106
    • +
  • encodedText consists of lowercase English letters and ' ' only.
    • +
  • encodedText is a valid encoding of some originalText that does not have trailing spaces.
    • +
  • 1 <= rows <= 1000
    • +
  • The testcases are generated such that there is only one possible originalText.
    • +
+",2.0,False,"class Solution { +public: + string decodeCiphertext(string encodedText, int rows) { + + } +};","class Solution { + public String decodeCiphertext(String encodedText, int rows) { + + } +}","class Solution(object): + def decodeCiphertext(self, encodedText, rows): + """""" + :type encodedText: str + :type rows: int + :rtype: str + """""" + ","class Solution: + def decodeCiphertext(self, encodedText: str, rows: int) -> str: + ","char * decodeCiphertext(char * encodedText, int rows){ + +}","public class Solution { + public string DecodeCiphertext(string encodedText, int rows) { + + } +}","/** + * @param {string} encodedText + * @param {number} rows + * @return {string} + */ +var decodeCiphertext = function(encodedText, rows) { + +};","# @param {String} encoded_text +# @param {Integer} rows +# @return {String} +def decode_ciphertext(encoded_text, rows) + +end","class Solution { + func decodeCiphertext(_ encodedText: String, _ rows: Int) -> String { + + } +}","func decodeCiphertext(encodedText string, rows int) string { + +}","object Solution { + def decodeCiphertext(encodedText: String, rows: Int): String = { + + } +}","class Solution { + fun decodeCiphertext(encodedText: String, rows: Int): String { + + } +}","impl Solution { + pub fn decode_ciphertext(encoded_text: String, rows: i32) -> String { + + } +}","class Solution { + + /** + * @param String $encodedText + * @param Integer $rows + * @return String + */ + function decodeCiphertext($encodedText, $rows) { + + } +}","function decodeCiphertext(encodedText: string, rows: number): string { + +};","(define/contract (decode-ciphertext encodedText rows) + (-> string? exact-integer? string?) + + )","-spec decode_ciphertext(EncodedText :: unicode:unicode_binary(), Rows :: integer()) -> unicode:unicode_binary(). +decode_ciphertext(EncodedText, Rows) -> + .","defmodule Solution do + @spec decode_ciphertext(encoded_text :: String.t, rows :: integer) :: String.t + def decode_ciphertext(encoded_text, rows) do + + end +end","class Solution { + String decodeCiphertext(String encodedText, int rows) { + + } +}", +520,reverse-nodes-in-even-length-groups,Reverse Nodes in Even Length Groups,2074.0,2196.0,"

You are given the head of a linked list.

+ +

The nodes in the linked list are sequentially assigned to non-empty groups whose lengths form the sequence of the natural numbers (1, 2, 3, 4, ...). The length of a group is the number of nodes assigned to it. In other words,

+ +
    +
  • The 1st node is assigned to the first group.
    • +
  • The 2nd and the 3rd nodes are assigned to the second group.
    • +
  • The 4th, 5th, and 6th nodes are assigned to the third group, and so on.
    • +
+ +

Note that the length of the last group may be less than or equal to 1 + the length of the second to last group.

+ +

Reverse the nodes in each group with an even length, and return the head of the modified linked list.

+ +

 

+

Example 1:

+ +
+Input: head = [5,2,6,3,9,1,7,3,8,4]
+Output: [5,6,2,3,9,1,4,8,3,7]
+Explanation:
+- The length of the first group is 1, which is odd, hence no reversal occurs.
+- The length of the second group is 2, which is even, hence the nodes are reversed.
+- The length of the third group is 3, which is odd, hence no reversal occurs.
+- The length of the last group is 4, which is even, hence the nodes are reversed.
+
+ +

Example 2:

+ +
+Input: head = [1,1,0,6]
+Output: [1,0,1,6]
+Explanation:
+- The length of the first group is 1. No reversal occurs.
+- The length of the second group is 2. The nodes are reversed.
+- The length of the last group is 1. No reversal occurs.
+
+ +

Example 3:

+ +
+Input: head = [1,1,0,6,5]
+Output: [1,0,1,5,6]
+Explanation:
+- The length of the first group is 1. No reversal occurs.
+- The length of the second group is 2. The nodes are reversed.
+- The length of the last group is 2. The nodes are reversed.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [1, 105].
    • +
  • 0 <= Node.val <= 105
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* reverseEvenLengthGroups(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode reverseEvenLengthGroups(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def reverseEvenLengthGroups(self, head): + """""" + :type head: Optional[ListNode] + :rtype: Optional[ListNode] + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def reverseEvenLengthGroups(self, head: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* reverseEvenLengthGroups(struct ListNode* head){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode ReverseEvenLengthGroups(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {ListNode} + */ +var reverseEvenLengthGroups = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {ListNode} +def reverse_even_length_groups(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func reverseEvenLengthGroups(_ head: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func reverseEvenLengthGroups(head *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def reverseEvenLengthGroups(head: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun reverseEvenLengthGroups(head: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn reverse_even_length_groups(head: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return ListNode + */ + function reverseEvenLengthGroups($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function reverseEvenLengthGroups(head: ListNode | null): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (reverse-even-length-groups head) + (-> (or/c list-node? #f) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec reverse_even_length_groups(Head :: #list_node{} | null) -> #list_node{} | null. +reverse_even_length_groups(Head) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec reverse_even_length_groups(head :: ListNode.t | nil) :: ListNode.t | nil + def reverse_even_length_groups(head) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? reverseEvenLengthGroups(ListNode? head) { + + } +}", +522,count-fertile-pyramids-in-a-land,Count Fertile Pyramids in a Land,2088.0,2193.0,"

A farmer has a rectangular grid of land with m rows and n columns that can be divided into unit cells. Each cell is either fertile (represented by a 1) or barren (represented by a 0). All cells outside the grid are considered barren.

+ +

A pyramidal plot of land can be defined as a set of cells with the following criteria:

+ +
    +
  1. The number of cells in the set has to be greater than 1 and all cells must be fertile.
    2. +
  2. The apex of a pyramid is the topmost cell of the pyramid. The height of a pyramid is the number of rows it covers. Let (r, c) be the apex of the pyramid, and its height be h. Then, the plot comprises of cells (i, j) where r <= i <= r + h - 1 and c - (i - r) <= j <= c + (i - r).
    3. +
+ +

An inverse pyramidal plot of land can be defined as a set of cells with similar criteria:

+ +
    +
  1. The number of cells in the set has to be greater than 1 and all cells must be fertile.
    2. +
  2. The apex of an inverse pyramid is the bottommost cell of the inverse pyramid. The height of an inverse pyramid is the number of rows it covers. Let (r, c) be the apex of the pyramid, and its height be h. Then, the plot comprises of cells (i, j) where r - h + 1 <= i <= r and c - (r - i) <= j <= c + (r - i).
    3. +
+ +

Some examples of valid and invalid pyramidal (and inverse pyramidal) plots are shown below. Black cells indicate fertile cells.

+ +

Given a 0-indexed m x n binary matrix grid representing the farmland, return the total number of pyramidal and inverse pyramidal plots that can be found in grid.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,1,0],[1,1,1,1]]
+Output: 2
+Explanation: The 2 possible pyramidal plots are shown in blue and red respectively.
+There are no inverse pyramidal plots in this grid. 
+Hence total number of pyramidal and inverse pyramidal plots is 2 + 0 = 2.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,1],[1,1,1]]
+Output: 2
+Explanation: The pyramidal plot is shown in blue, and the inverse pyramidal plot is shown in red. 
+Hence the total number of plots is 1 + 1 = 2.
+
+ +

Example 3:

+ +
+Input: grid = [[1,1,1,1,0],[1,1,1,1,1],[1,1,1,1,1],[0,1,0,0,1]]
+Output: 13
+Explanation: There are 7 pyramidal plots, 3 of which are shown in the 2nd and 3rd figures.
+There are 6 inverse pyramidal plots, 2 of which are shown in the last figure.
+The total number of plots is 7 + 6 = 13.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 1000
    • +
  • 1 <= m * n <= 105
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",3.0,False,"class Solution { +public: + int countPyramids(vector>& grid) { + + } +};","class Solution { + public int countPyramids(int[][] grid) { + + } +}","class Solution(object): + def countPyramids(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def countPyramids(self, grid: List[List[int]]) -> int: + ","int countPyramids(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int CountPyramids(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var countPyramids = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def count_pyramids(grid) + +end","class Solution { + func countPyramids(_ grid: [[Int]]) -> Int { + + } +}","func countPyramids(grid [][]int) int { + +}","object Solution { + def countPyramids(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun countPyramids(grid: Array): Int { + + } +}","impl Solution { + pub fn count_pyramids(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function countPyramids($grid) { + + } +}","function countPyramids(grid: number[][]): number { + +};","(define/contract (count-pyramids grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec count_pyramids(Grid :: [[integer()]]) -> integer(). +count_pyramids(Grid) -> + .","defmodule Solution do + @spec count_pyramids(grid :: [[integer]]) :: integer + def count_pyramids(grid) do + + end +end","class Solution { + int countPyramids(List> grid) { + + } +}", +523,minimum-cost-homecoming-of-a-robot-in-a-grid,Minimum Cost Homecoming of a Robot in a Grid,2087.0,2192.0,"

There is an m x n grid, where (0, 0) is the top-left cell and (m - 1, n - 1) is the bottom-right cell. You are given an integer array startPos where startPos = [startrow, startcol] indicates that initially, a robot is at the cell (startrow, startcol). You are also given an integer array homePos where homePos = [homerow, homecol] indicates that its home is at the cell (homerow, homecol).

+ +

The robot needs to go to its home. It can move one cell in four directions: left, right, up, or down, and it can not move outside the boundary. Every move incurs some cost. You are further given two 0-indexed integer arrays: rowCosts of length m and colCosts of length n.

+ +
    +
  • If the robot moves up or down into a cell whose row is r, then this move costs rowCosts[r].
    • +
  • If the robot moves left or right into a cell whose column is c, then this move costs colCosts[c].
    • +
+ +

Return the minimum total cost for this robot to return home.

+ +

 

+

Example 1:

+ +
+Input: startPos = [1, 0], homePos = [2, 3], rowCosts = [5, 4, 3], colCosts = [8, 2, 6, 7]
+Output: 18
+Explanation: One optimal path is that:
+Starting from (1, 0)
+-> It goes down to (2, 0). This move costs rowCosts[2] = 3.
+-> It goes right to (2, 1). This move costs colCosts[1] = 2.
+-> It goes right to (2, 2). This move costs colCosts[2] = 6.
+-> It goes right to (2, 3). This move costs colCosts[3] = 7.
+The total cost is 3 + 2 + 6 + 7 = 18
+ +

Example 2:

+ +
+Input: startPos = [0, 0], homePos = [0, 0], rowCosts = [5], colCosts = [26]
+Output: 0
+Explanation: The robot is already at its home. Since no moves occur, the total cost is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • m == rowCosts.length
    • +
  • n == colCosts.length
    • +
  • 1 <= m, n <= 105
    • +
  • 0 <= rowCosts[r], colCosts[c] <= 104
    • +
  • startPos.length == 2
    • +
  • homePos.length == 2
    • +
  • 0 <= startrow, homerow < m
    • +
  • 0 <= startcol, homecol < n
    • +
+",2.0,False,"class Solution { +public: + int minCost(vector& startPos, vector& homePos, vector& rowCosts, vector& colCosts) { + + } +};","class Solution { + public int minCost(int[] startPos, int[] homePos, int[] rowCosts, int[] colCosts) { + + } +}","class Solution(object): + def minCost(self, startPos, homePos, rowCosts, colCosts): + """""" + :type startPos: List[int] + :type homePos: List[int] + :type rowCosts: List[int] + :type colCosts: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, startPos: List[int], homePos: List[int], rowCosts: List[int], colCosts: List[int]) -> int: + ","int minCost(int* startPos, int startPosSize, int* homePos, int homePosSize, int* rowCosts, int rowCostsSize, int* colCosts, int colCostsSize){ + +}","public class Solution { + public int MinCost(int[] startPos, int[] homePos, int[] rowCosts, int[] colCosts) { + + } +}","/** + * @param {number[]} startPos + * @param {number[]} homePos + * @param {number[]} rowCosts + * @param {number[]} colCosts + * @return {number} + */ +var minCost = function(startPos, homePos, rowCosts, colCosts) { + +};","# @param {Integer[]} start_pos +# @param {Integer[]} home_pos +# @param {Integer[]} row_costs +# @param {Integer[]} col_costs +# @return {Integer} +def min_cost(start_pos, home_pos, row_costs, col_costs) + +end","class Solution { + func minCost(_ startPos: [Int], _ homePos: [Int], _ rowCosts: [Int], _ colCosts: [Int]) -> Int { + + } +}","func minCost(startPos []int, homePos []int, rowCosts []int, colCosts []int) int { + +}","object Solution { + def minCost(startPos: Array[Int], homePos: Array[Int], rowCosts: Array[Int], colCosts: Array[Int]): Int = { + + } +}","class Solution { + fun minCost(startPos: IntArray, homePos: IntArray, rowCosts: IntArray, colCosts: IntArray): Int { + + } +}","impl Solution { + pub fn min_cost(start_pos: Vec, home_pos: Vec, row_costs: Vec, col_costs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $startPos + * @param Integer[] $homePos + * @param Integer[] $rowCosts + * @param Integer[] $colCosts + * @return Integer + */ + function minCost($startPos, $homePos, $rowCosts, $colCosts) { + + } +}","function minCost(startPos: number[], homePos: number[], rowCosts: number[], colCosts: number[]): number { + +};","(define/contract (min-cost startPos homePos rowCosts colCosts) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_cost(StartPos :: [integer()], HomePos :: [integer()], RowCosts :: [integer()], ColCosts :: [integer()]) -> integer(). +min_cost(StartPos, HomePos, RowCosts, ColCosts) -> + .","defmodule Solution do + @spec min_cost(start_pos :: [integer], home_pos :: [integer], row_costs :: [integer], col_costs :: [integer]) :: integer + def min_cost(start_pos, home_pos, row_costs, col_costs) do + + end +end","class Solution { + int minCost(List startPos, List homePos, List rowCosts, List colCosts) { + + } +}", +524,minimum-number-of-food-buckets-to-feed-the-hamsters,Minimum Number of Food Buckets to Feed the Hamsters,2086.0,2191.0,"

You are given a 0-indexed string hamsters where hamsters[i] is either:

+ +
    +
  • 'H' indicating that there is a hamster at index i, or
    • +
  • '.' indicating that index i is empty.
    • +
+ +

You will add some number of food buckets at the empty indices in order to feed the hamsters. A hamster can be fed if there is at least one food bucket to its left or to its right. More formally, a hamster at index i can be fed if you place a food bucket at index i - 1 and/or at index i + 1.

+ +

Return the minimum number of food buckets you should place at empty indices to feed all the hamsters or -1 if it is impossible to feed all of them.

+ +

 

+

Example 1:

+ +
+Input: hamsters = "H..H"
+Output: 2
+Explanation: We place two food buckets at indices 1 and 2.
+It can be shown that if we place only one food bucket, one of the hamsters will not be fed.
+
+ +

Example 2:

+ +
+Input: hamsters = ".H.H."
+Output: 1
+Explanation: We place one food bucket at index 2.
+
+ +

Example 3:

+ +
+Input: hamsters = ".HHH."
+Output: -1
+Explanation: If we place a food bucket at every empty index as shown, the hamster at index 2 will not be able to eat.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= hamsters.length <= 105
    • +
  • hamsters[i] is either'H' or '.'.
    • +
+",2.0,False,"class Solution { +public: + int minimumBuckets(string hamsters) { + + } +};","class Solution { + public int minimumBuckets(String hamsters) { + + } +}","class Solution(object): + def minimumBuckets(self, hamsters): + """""" + :type hamsters: str + :rtype: int + """""" + ","class Solution: + def minimumBuckets(self, hamsters: str) -> int: + ","int minimumBuckets(char * hamsters){ + +}","public class Solution { + public int MinimumBuckets(string hamsters) { + + } +}","/** + * @param {string} hamsters + * @return {number} + */ +var minimumBuckets = function(hamsters) { + +};","# @param {String} hamsters +# @return {Integer} +def minimum_buckets(hamsters) + +end","class Solution { + func minimumBuckets(_ hamsters: String) -> Int { + + } +}","func minimumBuckets(hamsters string) int { + +}","object Solution { + def minimumBuckets(hamsters: String): Int = { + + } +}","class Solution { + fun minimumBuckets(hamsters: String): Int { + + } +}","impl Solution { + pub fn minimum_buckets(hamsters: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $hamsters + * @return Integer + */ + function minimumBuckets($hamsters) { + + } +}","function minimumBuckets(hamsters: string): number { + +};","(define/contract (minimum-buckets hamsters) + (-> string? exact-integer?) + + )","-spec minimum_buckets(Hamsters :: unicode:unicode_binary()) -> integer(). +minimum_buckets(Hamsters) -> + .","defmodule Solution do + @spec minimum_buckets(hamsters :: String.t) :: integer + def minimum_buckets(hamsters) do + + end +end","class Solution { + int minimumBuckets(String hamsters) { + + } +}", +526,maximum-path-quality-of-a-graph,Maximum Path Quality of a Graph,2065.0,2189.0,"

There is an undirected graph with n nodes numbered from 0 to n - 1 (inclusive). You are given a 0-indexed integer array values where values[i] is the value of the ith node. You are also given a 0-indexed 2D integer array edges, where each edges[j] = [uj, vj, timej] indicates that there is an undirected edge between the nodes uj and vj, and it takes timej seconds to travel between the two nodes. Finally, you are given an integer maxTime.

+ +

A valid path in the graph is any path that starts at node 0, ends at node 0, and takes at most maxTime seconds to complete. You may visit the same node multiple times. The quality of a valid path is the sum of the values of the unique nodes visited in the path (each node's value is added at most once to the sum).

+ +

Return the maximum quality of a valid path.

+ +

Note: There are at most four edges connected to each node.

+ +

 

+

Example 1:

+ +
+Input: values = [0,32,10,43], edges = [[0,1,10],[1,2,15],[0,3,10]], maxTime = 49
+Output: 75
+Explanation:
+One possible path is 0 -> 1 -> 0 -> 3 -> 0. The total time taken is 10 + 10 + 10 + 10 = 40 <= 49.
+The nodes visited are 0, 1, and 3, giving a maximal path quality of 0 + 32 + 43 = 75.
+
+ +

Example 2:

+ +
+Input: values = [5,10,15,20], edges = [[0,1,10],[1,2,10],[0,3,10]], maxTime = 30
+Output: 25
+Explanation:
+One possible path is 0 -> 3 -> 0. The total time taken is 10 + 10 = 20 <= 30.
+The nodes visited are 0 and 3, giving a maximal path quality of 5 + 20 = 25.
+
+ +

Example 3:

+ +
+Input: values = [1,2,3,4], edges = [[0,1,10],[1,2,11],[2,3,12],[1,3,13]], maxTime = 50
+Output: 7
+Explanation:
+One possible path is 0 -> 1 -> 3 -> 1 -> 0. The total time taken is 10 + 13 + 13 + 10 = 46 <= 50.
+The nodes visited are 0, 1, and 3, giving a maximal path quality of 1 + 2 + 4 = 7.
+
+ +

 

+

Constraints:

+ +
    +
  • n == values.length
    • +
  • 1 <= n <= 1000
    • +
  • 0 <= values[i] <= 108
    • +
  • 0 <= edges.length <= 2000
    • +
  • edges[j].length == 3
    • +
  • 0 <= uj < vj <= n - 1
    • +
  • 10 <= timej, maxTime <= 100
    • +
  • All the pairs [uj, vj] are unique.
    • +
  • There are at most four edges connected to each node.
    • +
  • The graph may not be connected.
    • +
+",3.0,False,"class Solution { +public: + int maximalPathQuality(vector& values, vector>& edges, int maxTime) { + + } +};","class Solution { + public int maximalPathQuality(int[] values, int[][] edges, int maxTime) { + + } +}","class Solution(object): + def maximalPathQuality(self, values, edges, maxTime): + """""" + :type values: List[int] + :type edges: List[List[int]] + :type maxTime: int + :rtype: int + """""" + ","class Solution: + def maximalPathQuality(self, values: List[int], edges: List[List[int]], maxTime: int) -> int: + ","int maximalPathQuality(int* values, int valuesSize, int** edges, int edgesSize, int* edgesColSize, int maxTime){ + +}","public class Solution { + public int MaximalPathQuality(int[] values, int[][] edges, int maxTime) { + + } +}","/** + * @param {number[]} values + * @param {number[][]} edges + * @param {number} maxTime + * @return {number} + */ +var maximalPathQuality = function(values, edges, maxTime) { + +};","# @param {Integer[]} values +# @param {Integer[][]} edges +# @param {Integer} max_time +# @return {Integer} +def maximal_path_quality(values, edges, max_time) + +end","class Solution { + func maximalPathQuality(_ values: [Int], _ edges: [[Int]], _ maxTime: Int) -> Int { + + } +}","func maximalPathQuality(values []int, edges [][]int, maxTime int) int { + +}","object Solution { + def maximalPathQuality(values: Array[Int], edges: Array[Array[Int]], maxTime: Int): Int = { + + } +}","class Solution { + fun maximalPathQuality(values: IntArray, edges: Array, maxTime: Int): Int { + + } +}","impl Solution { + pub fn maximal_path_quality(values: Vec, edges: Vec>, max_time: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $values + * @param Integer[][] $edges + * @param Integer $maxTime + * @return Integer + */ + function maximalPathQuality($values, $edges, $maxTime) { + + } +}","function maximalPathQuality(values: number[], edges: number[][], maxTime: number): number { + +};","(define/contract (maximal-path-quality values edges maxTime) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec maximal_path_quality(Values :: [integer()], Edges :: [[integer()]], MaxTime :: integer()) -> integer(). +maximal_path_quality(Values, Edges, MaxTime) -> + .","defmodule Solution do + @spec maximal_path_quality(values :: [integer], edges :: [[integer]], max_time :: integer) :: integer + def maximal_path_quality(values, edges, max_time) do + + end +end","class Solution { + int maximalPathQuality(List values, List> edges, int maxTime) { + + } +}", +527,minimized-maximum-of-products-distributed-to-any-store,Minimized Maximum of Products Distributed to Any Store,2064.0,2188.0,"

You are given an integer n indicating there are n specialty retail stores. There are m product types of varying amounts, which are given as a 0-indexed integer array quantities, where quantities[i] represents the number of products of the ith product type.

+ +

You need to distribute all products to the retail stores following these rules:

+ +
    +
  • A store can only be given at most one product type but can be given any amount of it.
    • +
  • After distribution, each store will have been given some number of products (possibly 0). Let x represent the maximum number of products given to any store. You want x to be as small as possible, i.e., you want to minimize the maximum number of products that are given to any store.
    • +
+ +

Return the minimum possible x.

+ +

 

+

Example 1:

+ +
+Input: n = 6, quantities = [11,6]
+Output: 3
+Explanation: One optimal way is:
+- The 11 products of type 0 are distributed to the first four stores in these amounts: 2, 3, 3, 3
+- The 6 products of type 1 are distributed to the other two stores in these amounts: 3, 3
+The maximum number of products given to any store is max(2, 3, 3, 3, 3, 3) = 3.
+
+ +

Example 2:

+ +
+Input: n = 7, quantities = [15,10,10]
+Output: 5
+Explanation: One optimal way is:
+- The 15 products of type 0 are distributed to the first three stores in these amounts: 5, 5, 5
+- The 10 products of type 1 are distributed to the next two stores in these amounts: 5, 5
+- The 10 products of type 2 are distributed to the last two stores in these amounts: 5, 5
+The maximum number of products given to any store is max(5, 5, 5, 5, 5, 5, 5) = 5.
+
+ +

Example 3:

+ +
+Input: n = 1, quantities = [100000]
+Output: 100000
+Explanation: The only optimal way is:
+- The 100000 products of type 0 are distributed to the only store.
+The maximum number of products given to any store is max(100000) = 100000.
+
+ +

 

+

Constraints:

+ +
    +
  • m == quantities.length
    • +
  • 1 <= m <= n <= 105
    • +
  • 1 <= quantities[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int minimizedMaximum(int n, vector& quantities) { + + } +};","class Solution { + public int minimizedMaximum(int n, int[] quantities) { + + } +}","class Solution(object): + def minimizedMaximum(self, n, quantities): + """""" + :type n: int + :type quantities: List[int] + :rtype: int + """""" + ","class Solution: + def minimizedMaximum(self, n: int, quantities: List[int]) -> int: + ","int minimizedMaximum(int n, int* quantities, int quantitiesSize){ + +}","public class Solution { + public int MinimizedMaximum(int n, int[] quantities) { + + } +}","/** + * @param {number} n + * @param {number[]} quantities + * @return {number} + */ +var minimizedMaximum = function(n, quantities) { + +};","# @param {Integer} n +# @param {Integer[]} quantities +# @return {Integer} +def minimized_maximum(n, quantities) + +end","class Solution { + func minimizedMaximum(_ n: Int, _ quantities: [Int]) -> Int { + + } +}","func minimizedMaximum(n int, quantities []int) int { + +}","object Solution { + def minimizedMaximum(n: Int, quantities: Array[Int]): Int = { + + } +}","class Solution { + fun minimizedMaximum(n: Int, quantities: IntArray): Int { + + } +}","impl Solution { + pub fn minimized_maximum(n: i32, quantities: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $quantities + * @return Integer + */ + function minimizedMaximum($n, $quantities) { + + } +}","function minimizedMaximum(n: number, quantities: number[]): number { + +};","(define/contract (minimized-maximum n quantities) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec minimized_maximum(N :: integer(), Quantities :: [integer()]) -> integer(). +minimized_maximum(N, Quantities) -> + .","defmodule Solution do + @spec minimized_maximum(n :: integer, quantities :: [integer]) :: integer + def minimized_maximum(n, quantities) do + + end +end","class Solution { + int minimizedMaximum(int n, List quantities) { + + } +}", +530,check-if-an-original-string-exists-given-two-encoded-strings,Check if an Original String Exists Given Two Encoded Strings,2060.0,2184.0,"

An original string, consisting of lowercase English letters, can be encoded by the following steps:

+ +
    +
  • Arbitrarily split it into a sequence of some number of non-empty substrings.
    • +
  • Arbitrarily choose some elements (possibly none) of the sequence, and replace each with its length (as a numeric string).
    • +
  • Concatenate the sequence as the encoded string.
    • +
+ +

For example, one way to encode an original string "abcdefghijklmnop" might be:

+ +
    +
  • Split it as a sequence: ["ab", "cdefghijklmn", "o", "p"].
    • +
  • Choose the second and third elements to be replaced by their lengths, respectively. The sequence becomes ["ab", "12", "1", "p"].
    • +
  • Concatenate the elements of the sequence to get the encoded string: "ab121p".
    • +
+ +

Given two encoded strings s1 and s2, consisting of lowercase English letters and digits 1-9 (inclusive), return true if there exists an original string that could be encoded as both s1 and s2. Otherwise, return false.

+ +

Note: The test cases are generated such that the number of consecutive digits in s1 and s2 does not exceed 3.

+ +

 

+

Example 1:

+ +
+Input: s1 = "internationalization", s2 = "i18n"
+Output: true
+Explanation: It is possible that "internationalization" was the original string.
+- "internationalization" 
+  -> Split:       ["internationalization"]
+  -> Do not replace any element
+  -> Concatenate:  "internationalization", which is s1.
+- "internationalization"
+  -> Split:       ["i", "nternationalizatio", "n"]
+  -> Replace:     ["i", "18",                 "n"]
+  -> Concatenate:  "i18n", which is s2
+
+ +

Example 2:

+ +
+Input: s1 = "l123e", s2 = "44"
+Output: true
+Explanation: It is possible that "leetcode" was the original string.
+- "leetcode" 
+  -> Split:      ["l", "e", "et", "cod", "e"]
+  -> Replace:    ["l", "1", "2",  "3",   "e"]
+  -> Concatenate: "l123e", which is s1.
+- "leetcode" 
+  -> Split:      ["leet", "code"]
+  -> Replace:    ["4",    "4"]
+  -> Concatenate: "44", which is s2.
+
+ +

Example 3:

+ +
+Input: s1 = "a5b", s2 = "c5b"
+Output: false
+Explanation: It is impossible.
+- The original string encoded as s1 must start with the letter 'a'.
+- The original string encoded as s2 must start with the letter 'c'.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length <= 40
    • +
  • s1 and s2 consist of digits 1-9 (inclusive), and lowercase English letters only.
    • +
  • The number of consecutive digits in s1 and s2 does not exceed 3.
    • +
+",3.0,False,"class Solution { +public: + bool possiblyEquals(string s1, string s2) { + + } +};","class Solution { + public boolean possiblyEquals(String s1, String s2) { + + } +}","class Solution(object): + def possiblyEquals(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: bool + """""" + ","class Solution: + def possiblyEquals(self, s1: str, s2: str) -> bool: + ","bool possiblyEquals(char * s1, char * s2){ + +}","public class Solution { + public bool PossiblyEquals(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {boolean} + */ +var possiblyEquals = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Boolean} +def possibly_equals(s1, s2) + +end","class Solution { + func possiblyEquals(_ s1: String, _ s2: String) -> Bool { + + } +}","func possiblyEquals(s1 string, s2 string) bool { + +}","object Solution { + def possiblyEquals(s1: String, s2: String): Boolean = { + + } +}","class Solution { + fun possiblyEquals(s1: String, s2: String): Boolean { + + } +}","impl Solution { + pub fn possibly_equals(s1: String, s2: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Boolean + */ + function possiblyEquals($s1, $s2) { + + } +}","function possiblyEquals(s1: string, s2: string): boolean { + +};","(define/contract (possibly-equals s1 s2) + (-> string? string? boolean?) + + )","-spec possibly_equals(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> boolean(). +possibly_equals(S1, S2) -> + .","defmodule Solution do + @spec possibly_equals(s1 :: String.t, s2 :: String.t) :: boolean + def possibly_equals(s1, s2) do + + end +end","class Solution { + bool possiblyEquals(String s1, String s2) { + + } +}", +534,maximum-number-of-tasks-you-can-assign,Maximum Number of Tasks You Can Assign,2071.0,2180.0,"

You have n tasks and m workers. Each task has a strength requirement stored in a 0-indexed integer array tasks, with the ith task requiring tasks[i] strength to complete. The strength of each worker is stored in a 0-indexed integer array workers, with the jth worker having workers[j] strength. Each worker can only be assigned to a single task and must have a strength greater than or equal to the task's strength requirement (i.e., workers[j] >= tasks[i]).

+ +

Additionally, you have pills magical pills that will increase a worker's strength by strength. You can decide which workers receive the magical pills, however, you may only give each worker at most one magical pill.

+ +

Given the 0-indexed integer arrays tasks and workers and the integers pills and strength, return the maximum number of tasks that can be completed.

+ +

 

+

Example 1:

+ +
+Input: tasks = [3,2,1], workers = [0,3,3], pills = 1, strength = 1
+Output: 3
+Explanation:
+We can assign the magical pill and tasks as follows:
+- Give the magical pill to worker 0.
+- Assign worker 0 to task 2 (0 + 1 >= 1)
+- Assign worker 1 to task 1 (3 >= 2)
+- Assign worker 2 to task 0 (3 >= 3)
+
+ +

Example 2:

+ +
+Input: tasks = [5,4], workers = [0,0,0], pills = 1, strength = 5
+Output: 1
+Explanation:
+We can assign the magical pill and tasks as follows:
+- Give the magical pill to worker 0.
+- Assign worker 0 to task 0 (0 + 5 >= 5)
+
+ +

Example 3:

+ +
+Input: tasks = [10,15,30], workers = [0,10,10,10,10], pills = 3, strength = 10
+Output: 2
+Explanation:
+We can assign the magical pills and tasks as follows:
+- Give the magical pill to worker 0 and worker 1.
+- Assign worker 0 to task 0 (0 + 10 >= 10)
+- Assign worker 1 to task 1 (10 + 10 >= 15)
+The last pill is not given because it will not make any worker strong enough for the last task.
+
+ +

 

+

Constraints:

+ +
    +
  • n == tasks.length
    • +
  • m == workers.length
    • +
  • 1 <= n, m <= 5 * 104
    • +
  • 0 <= pills <= m
    • +
  • 0 <= tasks[i], workers[j], strength <= 109
    • +
+",3.0,False,"class Solution { +public: + int maxTaskAssign(vector& tasks, vector& workers, int pills, int strength) { + + } +};","class Solution { + public int maxTaskAssign(int[] tasks, int[] workers, int pills, int strength) { + + } +}","class Solution(object): + def maxTaskAssign(self, tasks, workers, pills, strength): + """""" + :type tasks: List[int] + :type workers: List[int] + :type pills: int + :type strength: int + :rtype: int + """""" + ","class Solution: + def maxTaskAssign(self, tasks: List[int], workers: List[int], pills: int, strength: int) -> int: + ","int maxTaskAssign(int* tasks, int tasksSize, int* workers, int workersSize, int pills, int strength){ + +}","public class Solution { + public int MaxTaskAssign(int[] tasks, int[] workers, int pills, int strength) { + + } +}","/** + * @param {number[]} tasks + * @param {number[]} workers + * @param {number} pills + * @param {number} strength + * @return {number} + */ +var maxTaskAssign = function(tasks, workers, pills, strength) { + +};","# @param {Integer[]} tasks +# @param {Integer[]} workers +# @param {Integer} pills +# @param {Integer} strength +# @return {Integer} +def max_task_assign(tasks, workers, pills, strength) + +end","class Solution { + func maxTaskAssign(_ tasks: [Int], _ workers: [Int], _ pills: Int, _ strength: Int) -> Int { + + } +}","func maxTaskAssign(tasks []int, workers []int, pills int, strength int) int { + +}","object Solution { + def maxTaskAssign(tasks: Array[Int], workers: Array[Int], pills: Int, strength: Int): Int = { + + } +}","class Solution { + fun maxTaskAssign(tasks: IntArray, workers: IntArray, pills: Int, strength: Int): Int { + + } +}","impl Solution { + pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $tasks + * @param Integer[] $workers + * @param Integer $pills + * @param Integer $strength + * @return Integer + */ + function maxTaskAssign($tasks, $workers, $pills, $strength) { + + } +}","function maxTaskAssign(tasks: number[], workers: number[], pills: number, strength: number): number { + +};","(define/contract (max-task-assign tasks workers pills strength) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec max_task_assign(Tasks :: [integer()], Workers :: [integer()], Pills :: integer(), Strength :: integer()) -> integer(). +max_task_assign(Tasks, Workers, Pills, Strength) -> + .","defmodule Solution do + @spec max_task_assign(tasks :: [integer], workers :: [integer], pills :: integer, strength :: integer) :: integer + def max_task_assign(tasks, workers, pills, strength) do + + end +end","class Solution { + int maxTaskAssign(List tasks, List workers, int pills, int strength) { + + } +}", +536,walking-robot-simulation-ii,Walking Robot Simulation II,2069.0,2178.0,"

A width x height grid is on an XY-plane with the bottom-left cell at (0, 0) and the top-right cell at (width - 1, height - 1). The grid is aligned with the four cardinal directions ("North", "East", "South", and "West"). A robot is initially at cell (0, 0) facing direction "East".

+ +

The robot can be instructed to move for a specific number of steps. For each step, it does the following.

+ +
    +
  1. Attempts to move forward one cell in the direction it is facing.
    2. +
  2. If the cell the robot is moving to is out of bounds, the robot instead turns 90 degrees counterclockwise and retries the step.
    3. +
+ +

After the robot finishes moving the number of steps required, it stops and awaits the next instruction.

+ +

Implement the Robot class:

+ +
    +
  • Robot(int width, int height) Initializes the width x height grid with the robot at (0, 0) facing "East".
    • +
  • void step(int num) Instructs the robot to move forward num steps.
    • +
  • int[] getPos() Returns the current cell the robot is at, as an array of length 2, [x, y].
    • +
  • String getDir() Returns the current direction of the robot, "North", "East", "South", or "West".
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Robot", "step", "step", "getPos", "getDir", "step", "step", "step", "getPos", "getDir"]
+[[6, 3], [2], [2], [], [], [2], [1], [4], [], []]
+Output
+[null, null, null, [4, 0], "East", null, null, null, [1, 2], "West"]
+
+Explanation
+Robot robot = new Robot(6, 3); // Initialize the grid and the robot at (0, 0) facing East.
+robot.step(2);  // It moves two steps East to (2, 0), and faces East.
+robot.step(2);  // It moves two steps East to (4, 0), and faces East.
+robot.getPos(); // return [4, 0]
+robot.getDir(); // return "East"
+robot.step(2);  // It moves one step East to (5, 0), and faces East.
+                // Moving the next step East would be out of bounds, so it turns and faces North.
+                // Then, it moves one step North to (5, 1), and faces North.
+robot.step(1);  // It moves one step North to (5, 2), and faces North (not West).
+robot.step(4);  // Moving the next step North would be out of bounds, so it turns and faces West.
+                // Then, it moves four steps West to (1, 2), and faces West.
+robot.getPos(); // return [1, 2]
+robot.getDir(); // return "West"
+
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= width, height <= 100
    • +
  • 1 <= num <= 105
    • +
  • At most 104 calls in total will be made to step, getPos, and getDir.
    • +
+",2.0,False,"class Robot { +public: + Robot(int width, int height) { + + } + + void step(int num) { + + } + + vector getPos() { + + } + + string getDir() { + + } +}; + +/** + * Your Robot object will be instantiated and called as such: + * Robot* obj = new Robot(width, height); + * obj->step(num); + * vector param_2 = obj->getPos(); + * string param_3 = obj->getDir(); + */","class Robot { + + public Robot(int width, int height) { + + } + + public void step(int num) { + + } + + public int[] getPos() { + + } + + public String getDir() { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * Robot obj = new Robot(width, height); + * obj.step(num); + * int[] param_2 = obj.getPos(); + * String param_3 = obj.getDir(); + */","class Robot(object): + + def __init__(self, width, height): + """""" + :type width: int + :type height: int + """""" + + + def step(self, num): + """""" + :type num: int + :rtype: None + """""" + + + def getPos(self): + """""" + :rtype: List[int] + """""" + + + def getDir(self): + """""" + :rtype: str + """""" + + + +# Your Robot object will be instantiated and called as such: +# obj = Robot(width, height) +# obj.step(num) +# param_2 = obj.getPos() +# param_3 = obj.getDir()","class Robot: + + def __init__(self, width: int, height: int): + + + def step(self, num: int) -> None: + + + def getPos(self) -> List[int]: + + + def getDir(self) -> str: + + + +# Your Robot object will be instantiated and called as such: +# obj = Robot(width, height) +# obj.step(num) +# param_2 = obj.getPos() +# param_3 = obj.getDir()"," + + +typedef struct { + +} Robot; + + +Robot* robotCreate(int width, int height) { + +} + +void robotStep(Robot* obj, int num) { + +} + +int* robotGetPos(Robot* obj, int* retSize) { + +} + +char * robotGetDir(Robot* obj) { + +} + +void robotFree(Robot* obj) { + +} + +/** + * Your Robot struct will be instantiated and called as such: + * Robot* obj = robotCreate(width, height); + * robotStep(obj, num); + + * int* param_2 = robotGetPos(obj, retSize); + + * char * param_3 = robotGetDir(obj); + + * robotFree(obj); +*/","public class Robot { + + public Robot(int width, int height) { + + } + + public void Step(int num) { + + } + + public int[] GetPos() { + + } + + public string GetDir() { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * Robot obj = new Robot(width, height); + * obj.Step(num); + * int[] param_2 = obj.GetPos(); + * string param_3 = obj.GetDir(); + */","/** + * @param {number} width + * @param {number} height + */ +var Robot = function(width, height) { + +}; + +/** + * @param {number} num + * @return {void} + */ +Robot.prototype.step = function(num) { + +}; + +/** + * @return {number[]} + */ +Robot.prototype.getPos = function() { + +}; + +/** + * @return {string} + */ +Robot.prototype.getDir = function() { + +}; + +/** + * Your Robot object will be instantiated and called as such: + * var obj = new Robot(width, height) + * obj.step(num) + * var param_2 = obj.getPos() + * var param_3 = obj.getDir() + */","class Robot + +=begin + :type width: Integer + :type height: Integer +=end + def initialize(width, height) + + end + + +=begin + :type num: Integer + :rtype: Void +=end + def step(num) + + end + + +=begin + :rtype: Integer[] +=end + def get_pos() + + end + + +=begin + :rtype: String +=end + def get_dir() + + end + + +end + +# Your Robot object will be instantiated and called as such: +# obj = Robot.new(width, height) +# obj.step(num) +# param_2 = obj.get_pos() +# param_3 = obj.get_dir()"," +class Robot { + + init(_ width: Int, _ height: Int) { + + } + + func step(_ num: Int) { + + } + + func getPos() -> [Int] { + + } + + func getDir() -> String { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * let obj = Robot(width, height) + * obj.step(num) + * let ret_2: [Int] = obj.getPos() + * let ret_3: String = obj.getDir() + */","type Robot struct { + +} + + +func Constructor(width int, height int) Robot { + +} + + +func (this *Robot) Step(num int) { + +} + + +func (this *Robot) GetPos() []int { + +} + + +func (this *Robot) GetDir() string { + +} + + +/** + * Your Robot object will be instantiated and called as such: + * obj := Constructor(width, height); + * obj.Step(num); + * param_2 := obj.GetPos(); + * param_3 := obj.GetDir(); + */","class Robot(_width: Int, _height: Int) { + + def step(num: Int) { + + } + + def getPos(): Array[Int] = { + + } + + def getDir(): String = { + + } + +} + +/** + * Your Robot object will be instantiated and called as such: + * var obj = new Robot(width, height) + * obj.step(num) + * var param_2 = obj.getPos() + * var param_3 = obj.getDir() + */","class Robot(width: Int, height: Int) { + + fun step(num: Int) { + + } + + fun getPos(): IntArray { + + } + + fun getDir(): String { + + } + +} + +/** + * Your Robot object will be instantiated and called as such: + * var obj = Robot(width, height) + * obj.step(num) + * var param_2 = obj.getPos() + * var param_3 = obj.getDir() + */","struct Robot { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Robot { + + fn new(width: i32, height: i32) -> Self { + + } + + fn step(&self, num: i32) { + + } + + fn get_pos(&self) -> Vec { + + } + + fn get_dir(&self) -> String { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * let obj = Robot::new(width, height); + * obj.step(num); + * let ret_2: Vec = obj.get_pos(); + * let ret_3: String = obj.get_dir(); + */","class Robot { + /** + * @param Integer $width + * @param Integer $height + */ + function __construct($width, $height) { + + } + + /** + * @param Integer $num + * @return NULL + */ + function step($num) { + + } + + /** + * @return Integer[] + */ + function getPos() { + + } + + /** + * @return String + */ + function getDir() { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * $obj = Robot($width, $height); + * $obj->step($num); + * $ret_2 = $obj->getPos(); + * $ret_3 = $obj->getDir(); + */","class Robot { + constructor(width: number, height: number) { + + } + + step(num: number): void { + + } + + getPos(): number[] { + + } + + getDir(): string { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * var obj = new Robot(width, height) + * obj.step(num) + * var param_2 = obj.getPos() + * var param_3 = obj.getDir() + */","(define robot% + (class object% + (super-new) + + ; width : exact-integer? + ; height : exact-integer? + (init-field + width + height) + + ; step : exact-integer? -> void? + (define/public (step num) + + ) + ; get-pos : -> (listof exact-integer?) + (define/public (get-pos) + + ) + ; get-dir : -> string? + (define/public (get-dir) + + ))) + +;; Your robot% object will be instantiated and called as such: +;; (define obj (new robot% [width width] [height height])) +;; (send obj step num) +;; (define param_2 (send obj get-pos)) +;; (define param_3 (send obj get-dir))","-spec robot_init_(Width :: integer(), Height :: integer()) -> any(). +robot_init_(Width, Height) -> + . + +-spec robot_step(Num :: integer()) -> any(). +robot_step(Num) -> + . + +-spec robot_get_pos() -> [integer()]. +robot_get_pos() -> + . + +-spec robot_get_dir() -> unicode:unicode_binary(). +robot_get_dir() -> + . + + +%% Your functions will be called as such: +%% robot_init_(Width, Height), +%% robot_step(Num), +%% Param_2 = robot_get_pos(), +%% Param_3 = robot_get_dir(), + +%% robot_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Robot do + @spec init_(width :: integer, height :: integer) :: any + def init_(width, height) do + + end + + @spec step(num :: integer) :: any + def step(num) do + + end + + @spec get_pos() :: [integer] + def get_pos() do + + end + + @spec get_dir() :: String.t + def get_dir() do + + end +end + +# Your functions will be called as such: +# Robot.init_(width, height) +# Robot.step(num) +# param_2 = Robot.get_pos() +# param_3 = Robot.get_dir() + +# Robot.init_ will be called before every test case, in which you can do some necessary initializations.","class Robot { + + Robot(int width, int height) { + + } + + void step(int num) { + + } + + List getPos() { + + } + + String getDir() { + + } +} + +/** + * Your Robot object will be instantiated and called as such: + * Robot obj = Robot(width, height); + * obj.step(num); + * List param2 = obj.getPos(); + * String param3 = obj.getDir(); + */", +537,check-whether-two-strings-are-almost-equivalent,Check Whether Two Strings are Almost Equivalent,2068.0,2177.0,"

Two strings word1 and word2 are considered almost equivalent if the differences between the frequencies of each letter from 'a' to 'z' between word1 and word2 is at most 3.

+ +

Given two strings word1 and word2, each of length n, return true if word1 and word2 are almost equivalent, or false otherwise.

+ +

The frequency of a letter x is the number of times it occurs in the string.

+ +

 

+

Example 1:

+ +
+Input: word1 = "aaaa", word2 = "bccb"
+Output: false
+Explanation: There are 4 'a's in "aaaa" but 0 'a's in "bccb".
+The difference is 4, which is more than the allowed 3.
+
+ +

Example 2:

+ +
+Input: word1 = "abcdeef", word2 = "abaaacc"
+Output: true
+Explanation: The differences between the frequencies of each letter in word1 and word2 are at most 3:
+- 'a' appears 1 time in word1 and 4 times in word2. The difference is 3.
+- 'b' appears 1 time in word1 and 1 time in word2. The difference is 0.
+- 'c' appears 1 time in word1 and 2 times in word2. The difference is 1.
+- 'd' appears 1 time in word1 and 0 times in word2. The difference is 1.
+- 'e' appears 2 times in word1 and 0 times in word2. The difference is 2.
+- 'f' appears 1 time in word1 and 0 times in word2. The difference is 1.
+
+ +

Example 3:

+ +
+Input: word1 = "cccddabba", word2 = "babababab"
+Output: true
+Explanation: The differences between the frequencies of each letter in word1 and word2 are at most 3:
+- 'a' appears 2 times in word1 and 4 times in word2. The difference is 2.
+- 'b' appears 2 times in word1 and 5 times in word2. The difference is 3.
+- 'c' appears 3 times in word1 and 0 times in word2. The difference is 3.
+- 'd' appears 2 times in word1 and 0 times in word2. The difference is 2.
+
+ +

 

+

Constraints:

+ +
    +
  • n == word1.length == word2.length
    • +
  • 1 <= n <= 100
    • +
  • word1 and word2 consist only of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + bool checkAlmostEquivalent(string word1, string word2) { + + } +};","class Solution { + public boolean checkAlmostEquivalent(String word1, String word2) { + + } +}","class Solution(object): + def checkAlmostEquivalent(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: bool + """""" + ","class Solution: + def checkAlmostEquivalent(self, word1: str, word2: str) -> bool: + ","bool checkAlmostEquivalent(char * word1, char * word2){ + +}","public class Solution { + public bool CheckAlmostEquivalent(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {boolean} + */ +var checkAlmostEquivalent = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {Boolean} +def check_almost_equivalent(word1, word2) + +end","class Solution { + func checkAlmostEquivalent(_ word1: String, _ word2: String) -> Bool { + + } +}","func checkAlmostEquivalent(word1 string, word2 string) bool { + +}","object Solution { + def checkAlmostEquivalent(word1: String, word2: String): Boolean = { + + } +}","class Solution { + fun checkAlmostEquivalent(word1: String, word2: String): Boolean { + + } +}","impl Solution { + pub fn check_almost_equivalent(word1: String, word2: String) -> bool { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return Boolean + */ + function checkAlmostEquivalent($word1, $word2) { + + } +}","function checkAlmostEquivalent(word1: string, word2: string): boolean { + +};","(define/contract (check-almost-equivalent word1 word2) + (-> string? string? boolean?) + + )","-spec check_almost_equivalent(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> boolean(). +check_almost_equivalent(Word1, Word2) -> + .","defmodule Solution do + @spec check_almost_equivalent(word1 :: String.t, word2 :: String.t) :: boolean + def check_almost_equivalent(word1, word2) do + + end +end","class Solution { + bool checkAlmostEquivalent(String word1, String word2) { + + } +}", +538,parallel-courses-iii,Parallel Courses III,2050.0,2176.0,"

You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [prevCoursej, nextCoursej] denotes that course prevCoursej has to be completed before course nextCoursej (prerequisite relationship). Furthermore, you are given a 0-indexed integer array time where time[i] denotes how many months it takes to complete the (i+1)th course.

+ +

You must find the minimum number of months needed to complete all the courses following these rules:

+ +
    +
  • You may start taking a course at any time if the prerequisites are met.
    • +
  • Any number of courses can be taken at the same time.
    • +
+ +

Return the minimum number of months needed to complete all the courses.

+ +

Note: The test cases are generated such that it is possible to complete every course (i.e., the graph is a directed acyclic graph).

+ +

 

+

Example 1:

+ + +
+Input: n = 3, relations = [[1,3],[2,3]], time = [3,2,5]
+Output: 8
+Explanation: The figure above represents the given graph and the time required to complete each course. 
+We start course 1 and course 2 simultaneously at month 0.
+Course 1 takes 3 months and course 2 takes 2 months to complete respectively.
+Thus, the earliest time we can start course 3 is at month 3, and the total time required is 3 + 5 = 8 months.
+
+ +

Example 2:

+ + +
+Input: n = 5, relations = [[1,5],[2,5],[3,5],[3,4],[4,5]], time = [1,2,3,4,5]
+Output: 12
+Explanation: The figure above represents the given graph and the time required to complete each course.
+You can start courses 1, 2, and 3 at month 0.
+You can complete them after 1, 2, and 3 months respectively.
+Course 4 can be taken only after course 3 is completed, i.e., after 3 months. It is completed after 3 + 4 = 7 months.
+Course 5 can be taken only after courses 1, 2, 3, and 4 have been completed, i.e., after max(1,2,3,7) = 7 months.
+Thus, the minimum time needed to complete all the courses is 7 + 5 = 12 months.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 5 * 104
    • +
  • 0 <= relations.length <= min(n * (n - 1) / 2, 5 * 104)
    • +
  • relations[j].length == 2
    • +
  • 1 <= prevCoursej, nextCoursej <= n
    • +
  • prevCoursej != nextCoursej
    • +
  • All the pairs [prevCoursej, nextCoursej] are unique.
    • +
  • time.length == n
    • +
  • 1 <= time[i] <= 104
    • +
  • The given graph is a directed acyclic graph.
    • +
+",3.0,False,"class Solution { +public: + int minimumTime(int n, vector>& relations, vector& time) { + + } +};","class Solution { + public int minimumTime(int n, int[][] relations, int[] time) { + + } +}","class Solution(object): + def minimumTime(self, n, relations, time): + """""" + :type n: int + :type relations: List[List[int]] + :type time: List[int] + :rtype: int + """""" + ","class Solution: + def minimumTime(self, n: int, relations: List[List[int]], time: List[int]) -> int: + ","int minimumTime(int n, int** relations, int relationsSize, int* relationsColSize, int* time, int timeSize){ + +}","public class Solution { + public int MinimumTime(int n, int[][] relations, int[] time) { + + } +}","/** + * @param {number} n + * @param {number[][]} relations + * @param {number[]} time + * @return {number} + */ +var minimumTime = function(n, relations, time) { + +};","# @param {Integer} n +# @param {Integer[][]} relations +# @param {Integer[]} time +# @return {Integer} +def minimum_time(n, relations, time) + +end","class Solution { + func minimumTime(_ n: Int, _ relations: [[Int]], _ time: [Int]) -> Int { + + } +}","func minimumTime(n int, relations [][]int, time []int) int { + +}","object Solution { + def minimumTime(n: Int, relations: Array[Array[Int]], time: Array[Int]): Int = { + + } +}","class Solution { + fun minimumTime(n: Int, relations: Array, time: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_time(n: i32, relations: Vec>, time: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $relations + * @param Integer[] $time + * @return Integer + */ + function minimumTime($n, $relations, $time) { + + } +}","function minimumTime(n: number, relations: number[][], time: number[]): number { + +};","(define/contract (minimum-time n relations time) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec minimum_time(N :: integer(), Relations :: [[integer()]], Time :: [integer()]) -> integer(). +minimum_time(N, Relations, Time) -> + .","defmodule Solution do + @spec minimum_time(n :: integer, relations :: [[integer]], time :: [integer]) :: integer + def minimum_time(n, relations, time) do + + end +end","class Solution { + int minimumTime(int n, List> relations, List time) { + + } +}", +542,second-minimum-time-to-reach-destination,Second Minimum Time to Reach Destination,2045.0,2171.0,"

A city is represented as a bi-directional connected graph with n vertices where each vertex is labeled from 1 to n (inclusive). The edges in the graph are represented as a 2D integer array edges, where each edges[i] = [ui, vi] denotes a bi-directional edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself. The time taken to traverse any edge is time minutes.

+ +

Each vertex has a traffic signal which changes its color from green to red and vice versa every change minutes. All signals change at the same time. You can enter a vertex at any time, but can leave a vertex only when the signal is green. You cannot wait at a vertex if the signal is green.

+ +

The second minimum value is defined as the smallest value strictly larger than the minimum value.

+ +
    +
  • For example the second minimum value of [2, 3, 4] is 3, and the second minimum value of [2, 2, 4] is 4.
    • +
+ +

Given n, edges, time, and change, return the second minimum time it will take to go from vertex 1 to vertex n.

+ +

Notes:

+ +
    +
  • You can go through any vertex any number of times, including 1 and n.
    • +
  • You can assume that when the journey starts, all signals have just turned green.
    • +
+ +

 

+

Example 1:

+         +
+Input: n = 5, edges = [[1,2],[1,3],[1,4],[3,4],[4,5]], time = 3, change = 5
+Output: 13
+Explanation:
+The figure on the left shows the given graph.
+The blue path in the figure on the right is the minimum time path.
+The time taken is:
+- Start at 1, time elapsed=0
+- 1 -> 4: 3 minutes, time elapsed=3
+- 4 -> 5: 3 minutes, time elapsed=6
+Hence the minimum time needed is 6 minutes.
+
+The red path shows the path to get the second minimum time.
+- Start at 1, time elapsed=0
+- 1 -> 3: 3 minutes, time elapsed=3
+- 3 -> 4: 3 minutes, time elapsed=6
+- Wait at 4 for 4 minutes, time elapsed=10
+- 4 -> 5: 3 minutes, time elapsed=13
+Hence the second minimum time is 13 minutes.      
+
+ +

Example 2:

+ +
+Input: n = 2, edges = [[1,2]], time = 3, change = 2
+Output: 11
+Explanation:
+The minimum time path is 1 -> 2 with time = 3 minutes.
+The second minimum time path is 1 -> 2 -> 1 -> 2 with time = 11 minutes.
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 104
    • +
  • n - 1 <= edges.length <= min(2 * 104, n * (n - 1) / 2)
    • +
  • edges[i].length == 2
    • +
  • 1 <= ui, vi <= n
    • +
  • ui != vi
    • +
  • There are no duplicate edges.
    • +
  • Each vertex can be reached directly or indirectly from every other vertex.
    • +
  • 1 <= time, change <= 103
    • +
+",3.0,False,"class Solution { +public: + int secondMinimum(int n, vector>& edges, int time, int change) { + + } +};","class Solution { + public int secondMinimum(int n, int[][] edges, int time, int change) { + + } +}","class Solution(object): + def secondMinimum(self, n, edges, time, change): + """""" + :type n: int + :type edges: List[List[int]] + :type time: int + :type change: int + :rtype: int + """""" + ","class Solution: + def secondMinimum(self, n: int, edges: List[List[int]], time: int, change: int) -> int: + ","int secondMinimum(int n, int** edges, int edgesSize, int* edgesColSize, int time, int change){ + +}","public class Solution { + public int SecondMinimum(int n, int[][] edges, int time, int change) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} time + * @param {number} change + * @return {number} + */ +var secondMinimum = function(n, edges, time, change) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} time +# @param {Integer} change +# @return {Integer} +def second_minimum(n, edges, time, change) + +end","class Solution { + func secondMinimum(_ n: Int, _ edges: [[Int]], _ time: Int, _ change: Int) -> Int { + + } +}","func secondMinimum(n int, edges [][]int, time int, change int) int { + +}","object Solution { + def secondMinimum(n: Int, edges: Array[Array[Int]], time: Int, change: Int): Int = { + + } +}","class Solution { + fun secondMinimum(n: Int, edges: Array, time: Int, change: Int): Int { + + } +}","impl Solution { + pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $time + * @param Integer $change + * @return Integer + */ + function secondMinimum($n, $edges, $time, $change) { + + } +}","function secondMinimum(n: number, edges: number[][], time: number, change: number): number { + +};","(define/contract (second-minimum n edges time change) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec second_minimum(N :: integer(), Edges :: [[integer()]], Time :: integer(), Change :: integer()) -> integer(). +second_minimum(N, Edges, Time, Change) -> + .","defmodule Solution do + @spec second_minimum(n :: integer, edges :: [[integer]], time :: integer, change :: integer) :: integer + def second_minimum(n, edges, time, change) do + + end +end","class Solution { + int secondMinimum(int n, List> edges, int time, int change) { + + } +}", +544,simple-bank-system,Simple Bank System,2043.0,2169.0,"

You have been tasked with writing a program for a popular bank that will automate all its incoming transactions (transfer, deposit, and withdraw). The bank has n accounts numbered from 1 to n. The initial balance of each account is stored in a 0-indexed integer array balance, with the (i + 1)th account having an initial balance of balance[i].

+ +

Execute all the valid transactions. A transaction is valid if:

+ +
    +
  • The given account number(s) are between 1 and n, and
    • +
  • The amount of money withdrawn or transferred from is less than or equal to the balance of the account.
    • +
+ +

Implement the Bank class:

+ +
    +
  • Bank(long[] balance) Initializes the object with the 0-indexed integer array balance.
    • +
  • boolean transfer(int account1, int account2, long money) Transfers money dollars from the account numbered account1 to the account numbered account2. Return true if the transaction was successful, false otherwise.
    • +
  • boolean deposit(int account, long money) Deposit money dollars into the account numbered account. Return true if the transaction was successful, false otherwise.
    • +
  • boolean withdraw(int account, long money) Withdraw money dollars from the account numbered account. Return true if the transaction was successful, false otherwise.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Bank", "withdraw", "transfer", "deposit", "transfer", "withdraw"]
+[[[10, 100, 20, 50, 30]], [3, 10], [5, 1, 20], [5, 20], [3, 4, 15], [10, 50]]
+Output
+[null, true, true, true, false, false]
+
+Explanation
+Bank bank = new Bank([10, 100, 20, 50, 30]);
+bank.withdraw(3, 10);    // return true, account 3 has a balance of $20, so it is valid to withdraw $10.
+                         // Account 3 has $20 - $10 = $10.
+bank.transfer(5, 1, 20); // return true, account 5 has a balance of $30, so it is valid to transfer $20.
+                         // Account 5 has $30 - $20 = $10, and account 1 has $10 + $20 = $30.
+bank.deposit(5, 20);     // return true, it is valid to deposit $20 to account 5.
+                         // Account 5 has $10 + $20 = $30.
+bank.transfer(3, 4, 15); // return false, the current balance of account 3 is $10,
+                         // so it is invalid to transfer $15 from it.
+bank.withdraw(10, 50);   // return false, it is invalid because account 10 does not exist.
+
+ +

 

+

Constraints:

+ +
    +
  • n == balance.length
    • +
  • 1 <= n, account, account1, account2 <= 105
    • +
  • 0 <= balance[i], money <= 1012
    • +
  • At most 104 calls will be made to each function transfer, deposit, withdraw.
    • +
+",2.0,False,"class Bank { +public: + Bank(vector& balance) { + + } + + bool transfer(int account1, int account2, long long money) { + + } + + bool deposit(int account, long long money) { + + } + + bool withdraw(int account, long long money) { + + } +}; + +/** + * Your Bank object will be instantiated and called as such: + * Bank* obj = new Bank(balance); + * bool param_1 = obj->transfer(account1,account2,money); + * bool param_2 = obj->deposit(account,money); + * bool param_3 = obj->withdraw(account,money); + */","class Bank { + + public Bank(long[] balance) { + + } + + public boolean transfer(int account1, int account2, long money) { + + } + + public boolean deposit(int account, long money) { + + } + + public boolean withdraw(int account, long money) { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * Bank obj = new Bank(balance); + * boolean param_1 = obj.transfer(account1,account2,money); + * boolean param_2 = obj.deposit(account,money); + * boolean param_3 = obj.withdraw(account,money); + */","class Bank(object): + + def __init__(self, balance): + """""" + :type balance: List[int] + """""" + + + def transfer(self, account1, account2, money): + """""" + :type account1: int + :type account2: int + :type money: int + :rtype: bool + """""" + + + def deposit(self, account, money): + """""" + :type account: int + :type money: int + :rtype: bool + """""" + + + def withdraw(self, account, money): + """""" + :type account: int + :type money: int + :rtype: bool + """""" + + + +# Your Bank object will be instantiated and called as such: +# obj = Bank(balance) +# param_1 = obj.transfer(account1,account2,money) +# param_2 = obj.deposit(account,money) +# param_3 = obj.withdraw(account,money)","class Bank: + + def __init__(self, balance: List[int]): + + + def transfer(self, account1: int, account2: int, money: int) -> bool: + + + def deposit(self, account: int, money: int) -> bool: + + + def withdraw(self, account: int, money: int) -> bool: + + + +# Your Bank object will be instantiated and called as such: +# obj = Bank(balance) +# param_1 = obj.transfer(account1,account2,money) +# param_2 = obj.deposit(account,money) +# param_3 = obj.withdraw(account,money)"," + + +typedef struct { + +} Bank; + + +Bank* bankCreate(long long* balance, int balanceSize) { + +} + +bool bankTransfer(Bank* obj, int account1, int account2, long long money) { + +} + +bool bankDeposit(Bank* obj, int account, long long money) { + +} + +bool bankWithdraw(Bank* obj, int account, long long money) { + +} + +void bankFree(Bank* obj) { + +} + +/** + * Your Bank struct will be instantiated and called as such: + * Bank* obj = bankCreate(balance, balanceSize); + * bool param_1 = bankTransfer(obj, account1, account2, money); + + * bool param_2 = bankDeposit(obj, account, money); + + * bool param_3 = bankWithdraw(obj, account, money); + + * bankFree(obj); +*/","public class Bank { + + public Bank(long[] balance) { + + } + + public bool Transfer(int account1, int account2, long money) { + + } + + public bool Deposit(int account, long money) { + + } + + public bool Withdraw(int account, long money) { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * Bank obj = new Bank(balance); + * bool param_1 = obj.Transfer(account1,account2,money); + * bool param_2 = obj.Deposit(account,money); + * bool param_3 = obj.Withdraw(account,money); + */","/** + * @param {number[]} balance + */ +var Bank = function(balance) { + +}; + +/** + * @param {number} account1 + * @param {number} account2 + * @param {number} money + * @return {boolean} + */ +Bank.prototype.transfer = function(account1, account2, money) { + +}; + +/** + * @param {number} account + * @param {number} money + * @return {boolean} + */ +Bank.prototype.deposit = function(account, money) { + +}; + +/** + * @param {number} account + * @param {number} money + * @return {boolean} + */ +Bank.prototype.withdraw = function(account, money) { + +}; + +/** + * Your Bank object will be instantiated and called as such: + * var obj = new Bank(balance) + * var param_1 = obj.transfer(account1,account2,money) + * var param_2 = obj.deposit(account,money) + * var param_3 = obj.withdraw(account,money) + */","class Bank + +=begin + :type balance: Integer[] +=end + def initialize(balance) + + end + + +=begin + :type account1: Integer + :type account2: Integer + :type money: Integer + :rtype: Boolean +=end + def transfer(account1, account2, money) + + end + + +=begin + :type account: Integer + :type money: Integer + :rtype: Boolean +=end + def deposit(account, money) + + end + + +=begin + :type account: Integer + :type money: Integer + :rtype: Boolean +=end + def withdraw(account, money) + + end + + +end + +# Your Bank object will be instantiated and called as such: +# obj = Bank.new(balance) +# param_1 = obj.transfer(account1, account2, money) +# param_2 = obj.deposit(account, money) +# param_3 = obj.withdraw(account, money)"," +class Bank { + + init(_ balance: [Int]) { + + } + + func transfer(_ account1: Int, _ account2: Int, _ money: Int) -> Bool { + + } + + func deposit(_ account: Int, _ money: Int) -> Bool { + + } + + func withdraw(_ account: Int, _ money: Int) -> Bool { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * let obj = Bank(balance) + * let ret_1: Bool = obj.transfer(account1, account2, money) + * let ret_2: Bool = obj.deposit(account, money) + * let ret_3: Bool = obj.withdraw(account, money) + */","type Bank struct { + +} + + +func Constructor(balance []int64) Bank { + +} + + +func (this *Bank) Transfer(account1 int, account2 int, money int64) bool { + +} + + +func (this *Bank) Deposit(account int, money int64) bool { + +} + + +func (this *Bank) Withdraw(account int, money int64) bool { + +} + + +/** + * Your Bank object will be instantiated and called as such: + * obj := Constructor(balance); + * param_1 := obj.Transfer(account1,account2,money); + * param_2 := obj.Deposit(account,money); + * param_3 := obj.Withdraw(account,money); + */","class Bank(_balance: Array[Long]) { + + def transfer(account1: Int, account2: Int, money: Long): Boolean = { + + } + + def deposit(account: Int, money: Long): Boolean = { + + } + + def withdraw(account: Int, money: Long): Boolean = { + + } + +} + +/** + * Your Bank object will be instantiated and called as such: + * var obj = new Bank(balance) + * var param_1 = obj.transfer(account1,account2,money) + * var param_2 = obj.deposit(account,money) + * var param_3 = obj.withdraw(account,money) + */","class Bank(balance: LongArray) { + + fun transfer(account1: Int, account2: Int, money: Long): Boolean { + + } + + fun deposit(account: Int, money: Long): Boolean { + + } + + fun withdraw(account: Int, money: Long): Boolean { + + } + +} + +/** + * Your Bank object will be instantiated and called as such: + * var obj = Bank(balance) + * var param_1 = obj.transfer(account1,account2,money) + * var param_2 = obj.deposit(account,money) + * var param_3 = obj.withdraw(account,money) + */","struct Bank { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Bank { + + fn new(balance: Vec) -> Self { + + } + + fn transfer(&self, account1: i32, account2: i32, money: i64) -> bool { + + } + + fn deposit(&self, account: i32, money: i64) -> bool { + + } + + fn withdraw(&self, account: i32, money: i64) -> bool { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * let obj = Bank::new(balance); + * let ret_1: bool = obj.transfer(account1, account2, money); + * let ret_2: bool = obj.deposit(account, money); + * let ret_3: bool = obj.withdraw(account, money); + */","class Bank { + /** + * @param Integer[] $balance + */ + function __construct($balance) { + + } + + /** + * @param Integer $account1 + * @param Integer $account2 + * @param Integer $money + * @return Boolean + */ + function transfer($account1, $account2, $money) { + + } + + /** + * @param Integer $account + * @param Integer $money + * @return Boolean + */ + function deposit($account, $money) { + + } + + /** + * @param Integer $account + * @param Integer $money + * @return Boolean + */ + function withdraw($account, $money) { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * $obj = Bank($balance); + * $ret_1 = $obj->transfer($account1, $account2, $money); + * $ret_2 = $obj->deposit($account, $money); + * $ret_3 = $obj->withdraw($account, $money); + */","class Bank { + constructor(balance: number[]) { + + } + + transfer(account1: number, account2: number, money: number): boolean { + + } + + deposit(account: number, money: number): boolean { + + } + + withdraw(account: number, money: number): boolean { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * var obj = new Bank(balance) + * var param_1 = obj.transfer(account1,account2,money) + * var param_2 = obj.deposit(account,money) + * var param_3 = obj.withdraw(account,money) + */","(define bank% + (class object% + (super-new) + + ; balance : (listof exact-integer?) + (init-field + balance) + + ; transfer : exact-integer? exact-integer? exact-integer? -> boolean? + (define/public (transfer account1 account2 money) + + ) + ; deposit : exact-integer? exact-integer? -> boolean? + (define/public (deposit account money) + + ) + ; withdraw : exact-integer? exact-integer? -> boolean? + (define/public (withdraw account money) + + ))) + +;; Your bank% object will be instantiated and called as such: +;; (define obj (new bank% [balance balance])) +;; (define param_1 (send obj transfer account1 account2 money)) +;; (define param_2 (send obj deposit account money)) +;; (define param_3 (send obj withdraw account money))","-spec bank_init_(Balance :: [integer()]) -> any(). +bank_init_(Balance) -> + . + +-spec bank_transfer(Account1 :: integer(), Account2 :: integer(), Money :: integer()) -> boolean(). +bank_transfer(Account1, Account2, Money) -> + . + +-spec bank_deposit(Account :: integer(), Money :: integer()) -> boolean(). +bank_deposit(Account, Money) -> + . + +-spec bank_withdraw(Account :: integer(), Money :: integer()) -> boolean(). +bank_withdraw(Account, Money) -> + . + + +%% Your functions will be called as such: +%% bank_init_(Balance), +%% Param_1 = bank_transfer(Account1, Account2, Money), +%% Param_2 = bank_deposit(Account, Money), +%% Param_3 = bank_withdraw(Account, Money), + +%% bank_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Bank do + @spec init_(balance :: [integer]) :: any + def init_(balance) do + + end + + @spec transfer(account1 :: integer, account2 :: integer, money :: integer) :: boolean + def transfer(account1, account2, money) do + + end + + @spec deposit(account :: integer, money :: integer) :: boolean + def deposit(account, money) do + + end + + @spec withdraw(account :: integer, money :: integer) :: boolean + def withdraw(account, money) do + + end +end + +# Your functions will be called as such: +# Bank.init_(balance) +# param_1 = Bank.transfer(account1, account2, money) +# param_2 = Bank.deposit(account, money) +# param_3 = Bank.withdraw(account, money) + +# Bank.init_ will be called before every test case, in which you can do some necessary initializations.","class Bank { + + Bank(List balance) { + + } + + bool transfer(int account1, int account2, int money) { + + } + + bool deposit(int account, int money) { + + } + + bool withdraw(int account, int money) { + + } +} + +/** + * Your Bank object will be instantiated and called as such: + * Bank obj = Bank(balance); + * bool param1 = obj.transfer(account1,account2,money); + * bool param2 = obj.deposit(account,money); + * bool param3 = obj.withdraw(account,money); + */", +546,number-of-valid-move-combinations-on-chessboard,Number of Valid Move Combinations On Chessboard,2056.0,2166.0,"

There is an 8 x 8 chessboard containing n pieces (rooks, queens, or bishops). You are given a string array pieces of length n, where pieces[i] describes the type (rook, queen, or bishop) of the ith piece. In addition, you are given a 2D integer array positions also of length n, where positions[i] = [ri, ci] indicates that the ith piece is currently at the 1-based coordinate (ri, ci) on the chessboard.

+ +

When making a move for a piece, you choose a destination square that the piece will travel toward and stop on.

+ +
    +
  • A rook can only travel horizontally or vertically from (r, c) to the direction of (r+1, c), (r-1, c), (r, c+1), or (r, c-1).
    • +
  • A queen can only travel horizontally, vertically, or diagonally from (r, c) to the direction of (r+1, c), (r-1, c), (r, c+1), (r, c-1), (r+1, c+1), (r+1, c-1), (r-1, c+1), (r-1, c-1).
    • +
  • A bishop can only travel diagonally from (r, c) to the direction of (r+1, c+1), (r+1, c-1), (r-1, c+1), (r-1, c-1).
    • +
+ +

You must make a move for every piece on the board simultaneously. A move combination consists of all the moves performed on all the given pieces. Every second, each piece will instantaneously travel one square towards their destination if they are not already at it. All pieces start traveling at the 0th second. A move combination is invalid if, at a given time, two or more pieces occupy the same square.

+ +

Return the number of valid move combinations​​​​​.

+ +

Notes:

+ +
    +
  • No two pieces will start in the same square.
    • +
  • You may choose the square a piece is already on as its destination.
    • +
  • If two pieces are directly adjacent to each other, it is valid for them to move past each other and swap positions in one second.
    • +
+ +

 

+

Example 1:

+ +
+Input: pieces = ["rook"], positions = [[1,1]]
+Output: 15
+Explanation: The image above shows the possible squares the piece can move to.
+
+ +

Example 2:

+ +
+Input: pieces = ["queen"], positions = [[1,1]]
+Output: 22
+Explanation: The image above shows the possible squares the piece can move to.
+
+ +

Example 3:

+ +
+Input: pieces = ["bishop"], positions = [[4,3]]
+Output: 12
+Explanation: The image above shows the possible squares the piece can move to.
+
+ +

 

+

Constraints:

+ +
    +
  • n == pieces.length
    • +
  • n == positions.length
    • +
  • 1 <= n <= 4
    • +
  • pieces only contains the strings "rook", "queen", and "bishop".
    • +
  • There will be at most one queen on the chessboard.
    • +
  • 1 <= xi, yi <= 8
    • +
  • Each positions[i] is distinct.
    • +
+",3.0,False,"class Solution { +public: + int countCombinations(vector& pieces, vector>& positions) { + + } +};","class Solution { + public int countCombinations(String[] pieces, int[][] positions) { + + } +}","class Solution(object): + def countCombinations(self, pieces, positions): + """""" + :type pieces: List[str] + :type positions: List[List[int]] + :rtype: int + """""" + ","class Solution: + def countCombinations(self, pieces: List[str], positions: List[List[int]]) -> int: + ","int countCombinations(char ** pieces, int piecesSize, int** positions, int positionsSize, int* positionsColSize){ + +}","public class Solution { + public int CountCombinations(string[] pieces, int[][] positions) { + + } +}","/** + * @param {string[]} pieces + * @param {number[][]} positions + * @return {number} + */ +var countCombinations = function(pieces, positions) { + +};","# @param {String[]} pieces +# @param {Integer[][]} positions +# @return {Integer} +def count_combinations(pieces, positions) + +end","class Solution { + func countCombinations(_ pieces: [String], _ positions: [[Int]]) -> Int { + + } +}","func countCombinations(pieces []string, positions [][]int) int { + +}","object Solution { + def countCombinations(pieces: Array[String], positions: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun countCombinations(pieces: Array, positions: Array): Int { + + } +}","impl Solution { + pub fn count_combinations(pieces: Vec, positions: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $pieces + * @param Integer[][] $positions + * @return Integer + */ + function countCombinations($pieces, $positions) { + + } +}","function countCombinations(pieces: string[], positions: number[][]): number { + +};","(define/contract (count-combinations pieces positions) + (-> (listof string?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec count_combinations(Pieces :: [unicode:unicode_binary()], Positions :: [[integer()]]) -> integer(). +count_combinations(Pieces, Positions) -> + .","defmodule Solution do + @spec count_combinations(pieces :: [String.t], positions :: [[integer]]) :: integer + def count_combinations(pieces, positions) do + + end +end","class Solution { + int countCombinations(List pieces, List> positions) { + + } +}", +549,kth-distinct-string-in-an-array,Kth Distinct String in an Array,2053.0,2163.0,"

A distinct string is a string that is present only once in an array.

+ +

Given an array of strings arr, and an integer k, return the kth distinct string present in arr. If there are fewer than k distinct strings, return an empty string "".

+ +

Note that the strings are considered in the order in which they appear in the array.

+ +

 

+

Example 1:

+ +
+Input: arr = ["d","b","c","b","c","a"], k = 2
+Output: "a"
+Explanation:
+The only distinct strings in arr are "d" and "a".
+"d" appears 1st, so it is the 1st distinct string.
+"a" appears 2nd, so it is the 2nd distinct string.
+Since k == 2, "a" is returned. 
+
+ +

Example 2:

+ +
+Input: arr = ["aaa","aa","a"], k = 1
+Output: "aaa"
+Explanation:
+All strings in arr are distinct, so the 1st string "aaa" is returned.
+
+ +

Example 3:

+ +
+Input: arr = ["a","b","a"], k = 3
+Output: ""
+Explanation:
+The only distinct string is "b". Since there are fewer than 3 distinct strings, we return an empty string "".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= arr.length <= 1000
    • +
  • 1 <= arr[i].length <= 5
    • +
  • arr[i] consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + string kthDistinct(vector& arr, int k) { + + } +};","class Solution { + public String kthDistinct(String[] arr, int k) { + + } +}","class Solution(object): + def kthDistinct(self, arr, k): + """""" + :type arr: List[str] + :type k: int + :rtype: str + """""" + ","class Solution: + def kthDistinct(self, arr: List[str], k: int) -> str: + ","char * kthDistinct(char ** arr, int arrSize, int k){ + +}","public class Solution { + public string KthDistinct(string[] arr, int k) { + + } +}","/** + * @param {string[]} arr + * @param {number} k + * @return {string} + */ +var kthDistinct = function(arr, k) { + +};","# @param {String[]} arr +# @param {Integer} k +# @return {String} +def kth_distinct(arr, k) + +end","class Solution { + func kthDistinct(_ arr: [String], _ k: Int) -> String { + + } +}","func kthDistinct(arr []string, k int) string { + +}","object Solution { + def kthDistinct(arr: Array[String], k: Int): String = { + + } +}","class Solution { + fun kthDistinct(arr: Array, k: Int): String { + + } +}","impl Solution { + pub fn kth_distinct(arr: Vec, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String[] $arr + * @param Integer $k + * @return String + */ + function kthDistinct($arr, $k) { + + } +}","function kthDistinct(arr: string[], k: number): string { + +};","(define/contract (kth-distinct arr k) + (-> (listof string?) exact-integer? string?) + + )","-spec kth_distinct(Arr :: [unicode:unicode_binary()], K :: integer()) -> unicode:unicode_binary(). +kth_distinct(Arr, K) -> + .","defmodule Solution do + @spec kth_distinct(arr :: [String.t], k :: integer) :: String.t + def kth_distinct(arr, k) do + + end +end","class Solution { + String kthDistinct(List arr, int k) { + + } +}", +550,partition-array-into-two-arrays-to-minimize-sum-difference,Partition Array Into Two Arrays to Minimize Sum Difference,2035.0,2162.0,"

You are given an integer array nums of 2 * n integers. You need to partition nums into two arrays of length n to minimize the absolute difference of the sums of the arrays. To partition nums, put each element of nums into one of the two arrays.

+ +

Return the minimum possible absolute difference.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,9,7,3]
+Output: 2
+Explanation: One optimal partition is: [3,9] and [7,3].
+The absolute difference between the sums of the arrays is abs((3 + 9) - (7 + 3)) = 2.
+
+ +

Example 2:

+ +
+Input: nums = [-36,36]
+Output: 72
+Explanation: One optimal partition is: [-36] and [36].
+The absolute difference between the sums of the arrays is abs((-36) - (36)) = 72.
+
+ +

Example 3:

+ +
+Input: nums = [2,-1,0,4,-2,-9]
+Output: 0
+Explanation: One optimal partition is: [2,4,-9] and [-1,0,-2].
+The absolute difference between the sums of the arrays is abs((2 + 4 + -9) - (-1 + 0 + -2)) = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 15
    • +
  • nums.length == 2 * n
    • +
  • -107 <= nums[i] <= 107
    • +
+",3.0,False,"class Solution { +public: + int minimumDifference(vector& nums) { + + } +};","class Solution { + public int minimumDifference(int[] nums) { + + } +}","class Solution(object): + def minimumDifference(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumDifference(self, nums: List[int]) -> int: + ","int minimumDifference(int* nums, int numsSize){ + +}","public class Solution { + public int MinimumDifference(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumDifference = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_difference(nums) + +end","class Solution { + func minimumDifference(_ nums: [Int]) -> Int { + + } +}","func minimumDifference(nums []int) int { + +}","object Solution { + def minimumDifference(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minimumDifference(nums: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_difference(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumDifference($nums) { + + } +}","function minimumDifference(nums: number[]): number { + +};","(define/contract (minimum-difference nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_difference(Nums :: [integer()]) -> integer(). +minimum_difference(Nums) -> + .","defmodule Solution do + @spec minimum_difference(nums :: [integer]) :: integer + def minimum_difference(nums) do + + end +end","class Solution { + int minimumDifference(List nums) { + + } +}", +552,minimum-operations-to-make-a-uni-value-grid,Minimum Operations to Make a Uni-Value Grid,2033.0,2160.0,"

You are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x to or subtract x from any element in the grid.

+ +

A uni-value grid is a grid where all the elements of it are equal.

+ +

Return the minimum number of operations to make the grid uni-value. If it is not possible, return -1.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,4],[6,8]], x = 2
+Output: 4
+Explanation: We can make every element equal to 4 by doing the following: 
+- Add x to 2 once.
+- Subtract x from 6 once.
+- Subtract x from 8 twice.
+A total of 4 operations were used.
+
+ +

Example 2:

+ +
+Input: grid = [[1,5],[2,3]], x = 1
+Output: 5
+Explanation: We can make every element equal to 3.
+
+ +

Example 3:

+ +
+Input: grid = [[1,2],[3,4]], x = 2
+Output: -1
+Explanation: It is impossible to make every element equal.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 105
    • +
  • 1 <= m * n <= 105
    • +
  • 1 <= x, grid[i][j] <= 104
    • +
+",2.0,False,"class Solution { +public: + int minOperations(vector>& grid, int x) { + + } +};","class Solution { + public int minOperations(int[][] grid, int x) { + + } +}","class Solution(object): + def minOperations(self, grid, x): + """""" + :type grid: List[List[int]] + :type x: int + :rtype: int + """""" + ","class Solution: + def minOperations(self, grid: List[List[int]], x: int) -> int: + ","int minOperations(int** grid, int gridSize, int* gridColSize, int x){ + +}","public class Solution { + public int MinOperations(int[][] grid, int x) { + + } +}","/** + * @param {number[][]} grid + * @param {number} x + * @return {number} + */ +var minOperations = function(grid, x) { + +};","# @param {Integer[][]} grid +# @param {Integer} x +# @return {Integer} +def min_operations(grid, x) + +end","class Solution { + func minOperations(_ grid: [[Int]], _ x: Int) -> Int { + + } +}","func minOperations(grid [][]int, x int) int { + +}","object Solution { + def minOperations(grid: Array[Array[Int]], x: Int): Int = { + + } +}","class Solution { + fun minOperations(grid: Array, x: Int): Int { + + } +}","impl Solution { + pub fn min_operations(grid: Vec>, x: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer $x + * @return Integer + */ + function minOperations($grid, $x) { + + } +}","function minOperations(grid: number[][], x: number): number { + +};","(define/contract (min-operations grid x) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec min_operations(Grid :: [[integer()]], X :: integer()) -> integer(). +min_operations(Grid, X) -> + .","defmodule Solution do + @spec min_operations(grid :: [[integer]], x :: integer) :: integer + def min_operations(grid, x) do + + end +end","class Solution { + int minOperations(List> grid, int x) { + + } +}", +553,two-out-of-three,Two Out of Three,2032.0,2159.0,"Given three integer arrays nums1, nums2, and nums3, return a distinct array containing all the values that are present in at least two out of the three arrays. You may return the values in any order. +

 

+

Example 1:

+ +
+Input: nums1 = [1,1,3,2], nums2 = [2,3], nums3 = [3]
+Output: [3,2]
+Explanation: The values that are present in at least two arrays are:
+- 3, in all three arrays.
+- 2, in nums1 and nums2.
+
+ +

Example 2:

+ +
+Input: nums1 = [3,1], nums2 = [2,3], nums3 = [1,2]
+Output: [2,3,1]
+Explanation: The values that are present in at least two arrays are:
+- 2, in nums2 and nums3.
+- 3, in nums1 and nums2.
+- 1, in nums1 and nums3.
+
+ +

Example 3:

+ +
+Input: nums1 = [1,2,2], nums2 = [4,3,3], nums3 = [5]
+Output: []
+Explanation: No value is present in at least two arrays.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length, nums3.length <= 100
    • +
  • 1 <= nums1[i], nums2[j], nums3[k] <= 100
    • +
+",1.0,False,"class Solution { +public: + vector twoOutOfThree(vector& nums1, vector& nums2, vector& nums3) { + + } +};","class Solution { + public List twoOutOfThree(int[] nums1, int[] nums2, int[] nums3) { + + } +}","class Solution(object): + def twoOutOfThree(self, nums1, nums2, nums3): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type nums3: List[int] + :rtype: List[int] + """""" + ","class Solution: + def twoOutOfThree(self, nums1: List[int], nums2: List[int], nums3: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* twoOutOfThree(int* nums1, int nums1Size, int* nums2, int nums2Size, int* nums3, int nums3Size, int* returnSize){ + +}","public class Solution { + public IList TwoOutOfThree(int[] nums1, int[] nums2, int[] nums3) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[]} nums3 + * @return {number[]} + */ +var twoOutOfThree = function(nums1, nums2, nums3) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer[]} nums3 +# @return {Integer[]} +def two_out_of_three(nums1, nums2, nums3) + +end","class Solution { + func twoOutOfThree(_ nums1: [Int], _ nums2: [Int], _ nums3: [Int]) -> [Int] { + + } +}","func twoOutOfThree(nums1 []int, nums2 []int, nums3 []int) []int { + +}","object Solution { + def twoOutOfThree(nums1: Array[Int], nums2: Array[Int], nums3: Array[Int]): List[Int] = { + + } +}","class Solution { + fun twoOutOfThree(nums1: IntArray, nums2: IntArray, nums3: IntArray): List { + + } +}","impl Solution { + pub fn two_out_of_three(nums1: Vec, nums2: Vec, nums3: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer[] $nums3 + * @return Integer[] + */ + function twoOutOfThree($nums1, $nums2, $nums3) { + + } +}","function twoOutOfThree(nums1: number[], nums2: number[], nums3: number[]): number[] { + +};","(define/contract (two-out-of-three nums1 nums2 nums3) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec two_out_of_three(Nums1 :: [integer()], Nums2 :: [integer()], Nums3 :: [integer()]) -> [integer()]. +two_out_of_three(Nums1, Nums2, Nums3) -> + .","defmodule Solution do + @spec two_out_of_three(nums1 :: [integer], nums2 :: [integer], nums3 :: [integer]) :: [integer] + def two_out_of_three(nums1, nums2, nums3) do + + end +end","class Solution { + List twoOutOfThree(List nums1, List nums2, List nums3) { + + } +}", +554,smallest-k-length-subsequence-with-occurrences-of-a-letter,Smallest K-Length Subsequence With Occurrences of a Letter,2030.0,2157.0,"

You are given a string s, an integer k, a letter letter, and an integer repetition.

+ +

Return the lexicographically smallest subsequence of s of length k that has the letter letter appear at least repetition times. The test cases are generated so that the letter appears in s at least repetition times.

+ +

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

+ +

A string a is lexicographically smaller than a string b if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b.

+ +

 

+

Example 1:

+ +
+Input: s = "leet", k = 3, letter = "e", repetition = 1
+Output: "eet"
+Explanation: There are four subsequences of length 3 that have the letter 'e' appear at least 1 time:
+- "lee" (from "leet")
+- "let" (from "leet")
+- "let" (from "leet")
+- "eet" (from "leet")
+The lexicographically smallest subsequence among them is "eet".
+
+ +

Example 2:

+ +
+Input: s = "leetcode", k = 4, letter = "e", repetition = 2
+Output: "ecde"
+Explanation: "ecde" is the lexicographically smallest subsequence of length 4 that has the letter "e" appear at least 2 times.
+
+ +

Example 3:

+ +
+Input: s = "bb", k = 2, letter = "b", repetition = 2
+Output: "bb"
+Explanation: "bb" is the only subsequence of length 2 that has the letter "b" appear at least 2 times.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= repetition <= k <= s.length <= 5 * 104
    • +
  • s consists of lowercase English letters.
    • +
  • letter is a lowercase English letter, and appears in s at least repetition times.
    • +
+",3.0,False,"class Solution { +public: + string smallestSubsequence(string s, int k, char letter, int repetition) { + + } +};","class Solution { + public String smallestSubsequence(String s, int k, char letter, int repetition) { + + } +}","class Solution(object): + def smallestSubsequence(self, s, k, letter, repetition): + """""" + :type s: str + :type k: int + :type letter: str + :type repetition: int + :rtype: str + """""" + ","class Solution: + def smallestSubsequence(self, s: str, k: int, letter: str, repetition: int) -> str: + ","char * smallestSubsequence(char * s, int k, char letter, int repetition){ + +}","public class Solution { + public string SmallestSubsequence(string s, int k, char letter, int repetition) { + + } +}","/** + * @param {string} s + * @param {number} k + * @param {character} letter + * @param {number} repetition + * @return {string} + */ +var smallestSubsequence = function(s, k, letter, repetition) { + +};","# @param {String} s +# @param {Integer} k +# @param {Character} letter +# @param {Integer} repetition +# @return {String} +def smallest_subsequence(s, k, letter, repetition) + +end","class Solution { + func smallestSubsequence(_ s: String, _ k: Int, _ letter: Character, _ repetition: Int) -> String { + + } +}","func smallestSubsequence(s string, k int, letter byte, repetition int) string { + +}","object Solution { + def smallestSubsequence(s: String, k: Int, letter: Char, repetition: Int): String = { + + } +}","class Solution { + fun smallestSubsequence(s: String, k: Int, letter: Char, repetition: Int): String { + + } +}","impl Solution { + pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @param String $letter + * @param Integer $repetition + * @return String + */ + function smallestSubsequence($s, $k, $letter, $repetition) { + + } +}","function smallestSubsequence(s: string, k: number, letter: string, repetition: number): string { + +};","(define/contract (smallest-subsequence s k letter repetition) + (-> string? exact-integer? char? exact-integer? string?) + + )","-spec smallest_subsequence(S :: unicode:unicode_binary(), K :: integer(), Letter :: char(), Repetition :: integer()) -> unicode:unicode_binary(). +smallest_subsequence(S, K, Letter, Repetition) -> + .","defmodule Solution do + @spec smallest_subsequence(s :: String.t, k :: integer, letter :: char, repetition :: integer) :: String.t + def smallest_subsequence(s, k, letter, repetition) do + + end +end","class Solution { + String smallestSubsequence(String s, int k, String letter, int repetition) { + + } +}", +557,minimum-moves-to-convert-string,Minimum Moves to Convert String,2027.0,2154.0,"

You are given a string s consisting of n characters which are either 'X' or 'O'.

+ +

A move is defined as selecting three consecutive characters of s and converting them to 'O'. Note that if a move is applied to the character 'O', it will stay the same.

+ +

Return the minimum number of moves required so that all the characters of s are converted to 'O'.

+ +

 

+

Example 1:

+ +
+Input: s = "XXX"
+Output: 1
+Explanation: XXX -> OOO
+We select all the 3 characters and convert them in one move.
+
+ +

Example 2:

+ +
+Input: s = "XXOX"
+Output: 2
+Explanation: XXOX -> OOOX -> OOOO
+We select the first 3 characters in the first move, and convert them to 'O'.
+Then we select the last 3 characters and convert them so that the final string contains all 'O's.
+ +

Example 3:

+ +
+Input: s = "OOOO"
+Output: 0
+Explanation: There are no 'X's in s to convert.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 1000
    • +
  • s[i] is either 'X' or 'O'.
    • +
+",1.0,False,"class Solution { +public: + int minimumMoves(string s) { + + } +};","class Solution { + public int minimumMoves(String s) { + + } +}","class Solution(object): + def minimumMoves(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minimumMoves(self, s: str) -> int: + ","int minimumMoves(char * s){ + +}","public class Solution { + public int MinimumMoves(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minimumMoves = function(s) { + +};","# @param {String} s +# @return {Integer} +def minimum_moves(s) + +end","class Solution { + func minimumMoves(_ s: String) -> Int { + + } +}","func minimumMoves(s string) int { + +}","object Solution { + def minimumMoves(s: String): Int = { + + } +}","class Solution { + fun minimumMoves(s: String): Int { + + } +}","impl Solution { + pub fn minimum_moves(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minimumMoves($s) { + + } +}","function minimumMoves(s: string): number { + +};","(define/contract (minimum-moves s) + (-> string? exact-integer?) + + )","-spec minimum_moves(S :: unicode:unicode_binary()) -> integer(). +minimum_moves(S) -> + .","defmodule Solution do + @spec minimum_moves(s :: String.t) :: integer + def minimum_moves(s) do + + end +end","class Solution { + int minimumMoves(String s) { + + } +}", +558,the-time-when-the-network-becomes-idle,The Time When the Network Becomes Idle,2039.0,2151.0,"

There is a network of n servers, labeled from 0 to n - 1. You are given a 2D integer array edges, where edges[i] = [ui, vi] indicates there is a message channel between servers ui and vi, and they can pass any number of messages to each other directly in one second. You are also given a 0-indexed integer array patience of length n.

+ +

All servers are connected, i.e., a message can be passed from one server to any other server(s) directly or indirectly through the message channels.

+ +

The server labeled 0 is the master server. The rest are data servers. Each data server needs to send its message to the master server for processing and wait for a reply. Messages move between servers optimally, so every message takes the least amount of time to arrive at the master server. The master server will process all newly arrived messages instantly and send a reply to the originating server via the reversed path the message had gone through.

+ +

At the beginning of second 0, each data server sends its message to be processed. Starting from second 1, at the beginning of every second, each data server will check if it has received a reply to the message it sent (including any newly arrived replies) from the master server:

+ +
    +
  • If it has not, it will resend the message periodically. The data server i will resend the message every patience[i] second(s), i.e., the data server i will resend the message if patience[i] second(s) have elapsed since the last time the message was sent from this server.
    • +
  • Otherwise, no more resending will occur from this server.
    • +
+ +

The network becomes idle when there are no messages passing between servers or arriving at servers.

+ +

Return the earliest second starting from which the network becomes idle.

+ +

 

+

Example 1:

+ +
+Input: edges = [[0,1],[1,2]], patience = [0,2,1]
+Output: 8
+Explanation:
+At (the beginning of) second 0,
+- Data server 1 sends its message (denoted 1A) to the master server.
+- Data server 2 sends its message (denoted 2A) to the master server.
+
+At second 1,
+- Message 1A arrives at the master server. Master server processes message 1A instantly and sends a reply 1A back.
+- Server 1 has not received any reply. 1 second (1 < patience[1] = 2) elapsed since this server has sent the message, therefore it does not resend the message.
+- Server 2 has not received any reply. 1 second (1 == patience[2] = 1) elapsed since this server has sent the message, therefore it resends the message (denoted 2B).
+
+At second 2,
+- The reply 1A arrives at server 1. No more resending will occur from server 1.
+- Message 2A arrives at the master server. Master server processes message 2A instantly and sends a reply 2A back.
+- Server 2 resends the message (denoted 2C).
+...
+At second 4,
+- The reply 2A arrives at server 2. No more resending will occur from server 2.
+...
+At second 7, reply 2D arrives at server 2.
+
+Starting from the beginning of the second 8, there are no messages passing between servers or arriving at servers.
+This is the time when the network becomes idle.
+
+ +

Example 2:

+ +
+Input: edges = [[0,1],[0,2],[1,2]], patience = [0,10,10]
+Output: 3
+Explanation: Data servers 1 and 2 receive a reply back at the beginning of second 2.
+From the beginning of the second 3, the network becomes idle.
+
+ +

 

+

Constraints:

+ +
    +
  • n == patience.length
    • +
  • 2 <= n <= 105
    • +
  • patience[0] == 0
    • +
  • 1 <= patience[i] <= 105 for 1 <= i < n
    • +
  • 1 <= edges.length <= min(105, n * (n - 1) / 2)
    • +
  • edges[i].length == 2
    • +
  • 0 <= ui, vi < n
    • +
  • ui != vi
    • +
  • There are no duplicate edges.
    • +
  • Each server can directly or indirectly reach another server.
    • +
+",2.0,False,"class Solution { +public: + int networkBecomesIdle(vector>& edges, vector& patience) { + + } +};","class Solution { + public int networkBecomesIdle(int[][] edges, int[] patience) { + + } +}","class Solution(object): + def networkBecomesIdle(self, edges, patience): + """""" + :type edges: List[List[int]] + :type patience: List[int] + :rtype: int + """""" + ","class Solution: + def networkBecomesIdle(self, edges: List[List[int]], patience: List[int]) -> int: + ","int networkBecomesIdle(int** edges, int edgesSize, int* edgesColSize, int* patience, int patienceSize){ + +}","public class Solution { + public int NetworkBecomesIdle(int[][] edges, int[] patience) { + + } +}","/** + * @param {number[][]} edges + * @param {number[]} patience + * @return {number} + */ +var networkBecomesIdle = function(edges, patience) { + +};","# @param {Integer[][]} edges +# @param {Integer[]} patience +# @return {Integer} +def network_becomes_idle(edges, patience) + +end","class Solution { + func networkBecomesIdle(_ edges: [[Int]], _ patience: [Int]) -> Int { + + } +}","func networkBecomesIdle(edges [][]int, patience []int) int { + +}","object Solution { + def networkBecomesIdle(edges: Array[Array[Int]], patience: Array[Int]): Int = { + + } +}","class Solution { + fun networkBecomesIdle(edges: Array, patience: IntArray): Int { + + } +}","impl Solution { + pub fn network_becomes_idle(edges: Vec>, patience: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $edges + * @param Integer[] $patience + * @return Integer + */ + function networkBecomesIdle($edges, $patience) { + + } +}","function networkBecomesIdle(edges: number[][], patience: number[]): number { + +};","(define/contract (network-becomes-idle edges patience) + (-> (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec network_becomes_idle(Edges :: [[integer()]], Patience :: [integer()]) -> integer(). +network_becomes_idle(Edges, Patience) -> + .","defmodule Solution do + @spec network_becomes_idle(edges :: [[integer]], patience :: [integer]) :: integer + def network_becomes_idle(edges, patience) do + + end +end","class Solution { + int networkBecomesIdle(List> edges, List patience) { + + } +}", +559,kth-smallest-product-of-two-sorted-arrays,Kth Smallest Product of Two Sorted Arrays,2040.0,2150.0,"Given two sorted 0-indexed integer arrays nums1 and nums2 as well as an integer k, return the kth (1-based) smallest product of nums1[i] * nums2[j] where 0 <= i < nums1.length and 0 <= j < nums2.length. +

 

+

Example 1:

+ +
+Input: nums1 = [2,5], nums2 = [3,4], k = 2
+Output: 8
+Explanation: The 2 smallest products are:
+- nums1[0] * nums2[0] = 2 * 3 = 6
+- nums1[0] * nums2[1] = 2 * 4 = 8
+The 2nd smallest product is 8.
+
+ +

Example 2:

+ +
+Input: nums1 = [-4,-2,0,3], nums2 = [2,4], k = 6
+Output: 0
+Explanation: The 6 smallest products are:
+- nums1[0] * nums2[1] = (-4) * 4 = -16
+- nums1[0] * nums2[0] = (-4) * 2 = -8
+- nums1[1] * nums2[1] = (-2) * 4 = -8
+- nums1[1] * nums2[0] = (-2) * 2 = -4
+- nums1[2] * nums2[0] = 0 * 2 = 0
+- nums1[2] * nums2[1] = 0 * 4 = 0
+The 6th smallest product is 0.
+
+ +

Example 3:

+ +
+Input: nums1 = [-2,-1,0,1,2], nums2 = [-3,-1,2,4,5], k = 3
+Output: -6
+Explanation: The 3 smallest products are:
+- nums1[0] * nums2[4] = (-2) * 5 = -10
+- nums1[0] * nums2[3] = (-2) * 4 = -8
+- nums1[4] * nums2[0] = 2 * (-3) = -6
+The 3rd smallest product is -6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 5 * 104
    • +
  • -105 <= nums1[i], nums2[j] <= 105
    • +
  • 1 <= k <= nums1.length * nums2.length
    • +
  • nums1 and nums2 are sorted.
    • +
+",3.0,False,"class Solution { +public: + long long kthSmallestProduct(vector& nums1, vector& nums2, long long k) { + + } +};","class Solution { + public long kthSmallestProduct(int[] nums1, int[] nums2, long k) { + + } +}","class Solution(object): + def kthSmallestProduct(self, nums1, nums2, k): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def kthSmallestProduct(self, nums1: List[int], nums2: List[int], k: int) -> int: + ","long long kthSmallestProduct(int* nums1, int nums1Size, int* nums2, int nums2Size, long long k){ + +}","public class Solution { + public long KthSmallestProduct(int[] nums1, int[] nums2, long k) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number} + */ +var kthSmallestProduct = function(nums1, nums2, k) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} k +# @return {Integer} +def kth_smallest_product(nums1, nums2, k) + +end","class Solution { + func kthSmallestProduct(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int { + + } +}","func kthSmallestProduct(nums1 []int, nums2 []int, k int64) int64 { + +}","object Solution { + def kthSmallestProduct(nums1: Array[Int], nums2: Array[Int], k: Long): Long = { + + } +}","class Solution { + fun kthSmallestProduct(nums1: IntArray, nums2: IntArray, k: Long): Long { + + } +}","impl Solution { + pub fn kth_smallest_product(nums1: Vec, nums2: Vec, k: i64) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $k + * @return Integer + */ + function kthSmallestProduct($nums1, $nums2, $k) { + + } +}","function kthSmallestProduct(nums1: number[], nums2: number[], k: number): number { + +};","(define/contract (kth-smallest-product nums1 nums2 k) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec kth_smallest_product(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer(). +kth_smallest_product(Nums1, Nums2, K) -> + .","defmodule Solution do + @spec kth_smallest_product(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer + def kth_smallest_product(nums1, nums2, k) do + + end +end","class Solution { + int kthSmallestProduct(List nums1, List nums2, int k) { + + } +}", +560,remove-colored-pieces-if-both-neighbors-are-the-same-color,Remove Colored Pieces if Both Neighbors are the Same Color,2038.0,2149.0,"

There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color of the ith piece.

+ +

Alice and Bob are playing a game where they take alternating turns removing pieces from the line. In this game, Alice moves first.

+ +
    +
  • Alice is only allowed to remove a piece colored 'A' if both its neighbors are also colored 'A'. She is not allowed to remove pieces that are colored 'B'.
    • +
  • Bob is only allowed to remove a piece colored 'B' if both its neighbors are also colored 'B'. He is not allowed to remove pieces that are colored 'A'.
    • +
  • Alice and Bob cannot remove pieces from the edge of the line.
    • +
  • If a player cannot make a move on their turn, that player loses and the other player wins.
    • +
+ +

Assuming Alice and Bob play optimally, return true if Alice wins, or return false if Bob wins.

+ +

 

+

Example 1:

+ +
+Input: colors = "AAABABB"
+Output: true
+Explanation:
+AAABABB -> AABABB
+Alice moves first.
+She removes the second 'A' from the left since that is the only 'A' whose neighbors are both 'A'.
+
+Now it's Bob's turn.
+Bob cannot make a move on his turn since there are no 'B's whose neighbors are both 'B'.
+Thus, Alice wins, so return true.
+
+ +

Example 2:

+ +
+Input: colors = "AA"
+Output: false
+Explanation:
+Alice has her turn first.
+There are only two 'A's and both are on the edge of the line, so she cannot move on her turn.
+Thus, Bob wins, so return false.
+
+ +

Example 3:

+ +
+Input: colors = "ABBBBBBBAAA"
+Output: false
+Explanation:
+ABBBBBBBAAA -> ABBBBBBBAA
+Alice moves first.
+Her only option is to remove the second to last 'A' from the right.
+
+ABBBBBBBAA -> ABBBBBBAA
+Next is Bob's turn.
+He has many options for which 'B' piece to remove. He can pick any.
+
+On Alice's second turn, she has no more pieces that she can remove.
+Thus, Bob wins, so return false.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= colors.length <= 105
    • +
  • colors consists of only the letters 'A' and 'B'
    • +
+",2.0,False,"class Solution { +public: + bool winnerOfGame(string colors) { + + } +};","class Solution { + public boolean winnerOfGame(String colors) { + + } +}","class Solution(object): + def winnerOfGame(self, colors): + """""" + :type colors: str + :rtype: bool + """""" + ","class Solution: + def winnerOfGame(self, colors: str) -> bool: + ","bool winnerOfGame(char * colors){ + +}","public class Solution { + public bool WinnerOfGame(string colors) { + + } +}","/** + * @param {string} colors + * @return {boolean} + */ +var winnerOfGame = function(colors) { + +};","# @param {String} colors +# @return {Boolean} +def winner_of_game(colors) + +end","class Solution { + func winnerOfGame(_ colors: String) -> Bool { + + } +}","func winnerOfGame(colors string) bool { + +}","object Solution { + def winnerOfGame(colors: String): Boolean = { + + } +}","class Solution { + fun winnerOfGame(colors: String): Boolean { + + } +}","impl Solution { + pub fn winner_of_game(colors: String) -> bool { + + } +}","class Solution { + + /** + * @param String $colors + * @return Boolean + */ + function winnerOfGame($colors) { + + } +}","function winnerOfGame(colors: string): boolean { + +};","(define/contract (winner-of-game colors) + (-> string? boolean?) + + )","-spec winner_of_game(Colors :: unicode:unicode_binary()) -> boolean(). +winner_of_game(Colors) -> + .","defmodule Solution do + @spec winner_of_game(colors :: String.t) :: boolean + def winner_of_game(colors) do + + end +end","class Solution { + bool winnerOfGame(String colors) { + + } +}", +562,the-score-of-students-solving-math-expression,The Score of Students Solving Math Expression,2019.0,2147.0,"

You are given a string s that contains digits 0-9, addition symbols '+', and multiplication symbols '*' only, representing a valid math expression of single digit numbers (e.g., 3+5*2). This expression was given to n elementary school students. The students were instructed to get the answer of the expression by following this order of operations:

+ +
    +
  1. Compute multiplication, reading from left to right; Then,
    2. +
  2. Compute addition, reading from left to right.
    3. +
+ +

You are given an integer array answers of length n, which are the submitted answers of the students in no particular order. You are asked to grade the answers, by following these rules:

+ +
    +
  • If an answer equals the correct answer of the expression, this student will be rewarded 5 points;
    • +
  • Otherwise, if the answer could be interpreted as if the student applied the operators in the wrong order but had correct arithmetic, this student will be rewarded 2 points;
    • +
  • Otherwise, this student will be rewarded 0 points.
    • +
+ +

Return the sum of the points of the students.

+ +

 

+

Example 1:

+ +
+Input: s = "7+3*1*2", answers = [20,13,42]
+Output: 7
+Explanation: As illustrated above, the correct answer of the expression is 13, therefore one student is rewarded 5 points: [20,13,42]
+A student might have applied the operators in this wrong order: ((7+3)*1)*2 = 20. Therefore one student is rewarded 2 points: [20,13,42]
+The points for the students are: [2,5,0]. The sum of the points is 2+5+0=7.
+
+ +

Example 2:

+ +
+Input: s = "3+5*2", answers = [13,0,10,13,13,16,16]
+Output: 19
+Explanation: The correct answer of the expression is 13, therefore three students are rewarded 5 points each: [13,0,10,13,13,16,16]
+A student might have applied the operators in this wrong order: ((3+5)*2 = 16. Therefore two students are rewarded 2 points: [13,0,10,13,13,16,16]
+The points for the students are: [5,0,0,5,5,2,2]. The sum of the points is 5+0+0+5+5+2+2=19.
+
+ +

Example 3:

+ +
+Input: s = "6+0*1", answers = [12,9,6,4,8,6]
+Output: 10
+Explanation: The correct answer of the expression is 6.
+If a student had incorrectly done (6+0)*1, the answer would also be 6.
+By the rules of grading, the students will still be rewarded 5 points (as they got the correct answer), not 2 points.
+The points for the students are: [0,0,5,0,0,5]. The sum of the points is 10.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 31
    • +
  • s represents a valid expression that contains only digits 0-9, '+', and '*' only.
    • +
  • All the integer operands in the expression are in the inclusive range [0, 9].
    • +
  • 1 <= The count of all operators ('+' and '*') in the math expression <= 15
    • +
  • Test data are generated such that the correct answer of the expression is in the range of [0, 1000].
    • +
  • n == answers.length
    • +
  • 1 <= n <= 104
    • +
  • 0 <= answers[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int scoreOfStudents(string s, vector& answers) { + + } +};","class Solution { + public int scoreOfStudents(String s, int[] answers) { + + } +}","class Solution(object): + def scoreOfStudents(self, s, answers): + """""" + :type s: str + :type answers: List[int] + :rtype: int + """""" + ","class Solution: + def scoreOfStudents(self, s: str, answers: List[int]) -> int: + ","int scoreOfStudents(char * s, int* answers, int answersSize){ + +}","public class Solution { + public int ScoreOfStudents(string s, int[] answers) { + + } +}","/** + * @param {string} s + * @param {number[]} answers + * @return {number} + */ +var scoreOfStudents = function(s, answers) { + +};","# @param {String} s +# @param {Integer[]} answers +# @return {Integer} +def score_of_students(s, answers) + +end","class Solution { + func scoreOfStudents(_ s: String, _ answers: [Int]) -> Int { + + } +}","func scoreOfStudents(s string, answers []int) int { + +}","object Solution { + def scoreOfStudents(s: String, answers: Array[Int]): Int = { + + } +}","class Solution { + fun scoreOfStudents(s: String, answers: IntArray): Int { + + } +}","impl Solution { + pub fn score_of_students(s: String, answers: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[] $answers + * @return Integer + */ + function scoreOfStudents($s, $answers) { + + } +}","function scoreOfStudents(s: string, answers: number[]): number { + +};","(define/contract (score-of-students s answers) + (-> string? (listof exact-integer?) exact-integer?) + + )","-spec score_of_students(S :: unicode:unicode_binary(), Answers :: [integer()]) -> integer(). +score_of_students(S, Answers) -> + .","defmodule Solution do + @spec score_of_students(s :: String.t, answers :: [integer]) :: integer + def score_of_students(s, answers) do + + end +end","class Solution { + int scoreOfStudents(String s, List answers) { + + } +}", +563,check-if-word-can-be-placed-in-crossword,Check if Word Can Be Placed In Crossword,2018.0,2146.0,"

You are given an m x n matrix board, representing the current state of a crossword puzzle. The crossword contains lowercase English letters (from solved words), ' ' to represent any empty cells, and '#' to represent any blocked cells.

+ +

A word can be placed horizontally (left to right or right to left) or vertically (top to bottom or bottom to top) in the board if:

+ +
    +
  • It does not occupy a cell containing the character '#'.
    • +
  • The cell each letter is placed in must either be ' ' (empty) or match the letter already on the board.
    • +
  • There must not be any empty cells ' ' or other lowercase letters directly left or right of the word if the word was placed horizontally.
    • +
  • There must not be any empty cells ' ' or other lowercase letters directly above or below the word if the word was placed vertically.
    • +
+ +

Given a string word, return true if word can be placed in board, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: board = [["#", " ", "#"], [" ", " ", "#"], ["#", "c", " "]], word = "abc"
+Output: true
+Explanation: The word "abc" can be placed as shown above (top to bottom).
+
+ +

Example 2:

+ +
+Input: board = [[" ", "#", "a"], [" ", "#", "c"], [" ", "#", "a"]], word = "ac"
+Output: false
+Explanation: It is impossible to place the word because there will always be a space/letter above or below it.
+ +

Example 3:

+ +
+Input: board = [["#", " ", "#"], [" ", " ", "#"], ["#", " ", "c"]], word = "ca"
+Output: true
+Explanation: The word "ca" can be placed as shown above (right to left). 
+
+ +

 

+

Constraints:

+ +
    +
  • m == board.length
    • +
  • n == board[i].length
    • +
  • 1 <= m * n <= 2 * 105
    • +
  • board[i][j] will be ' ', '#', or a lowercase English letter.
    • +
  • 1 <= word.length <= max(m, n)
    • +
  • word will contain only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + bool placeWordInCrossword(vector>& board, string word) { + + } +};","class Solution { + public boolean placeWordInCrossword(char[][] board, String word) { + + } +}","class Solution(object): + def placeWordInCrossword(self, board, word): + """""" + :type board: List[List[str]] + :type word: str + :rtype: bool + """""" + ","class Solution: + def placeWordInCrossword(self, board: List[List[str]], word: str) -> bool: + ","bool placeWordInCrossword(char** board, int boardSize, int* boardColSize, char * word){ + +}","public class Solution { + public bool PlaceWordInCrossword(char[][] board, string word) { + + } +}","/** + * @param {character[][]} board + * @param {string} word + * @return {boolean} + */ +var placeWordInCrossword = function(board, word) { + +};","# @param {Character[][]} board +# @param {String} word +# @return {Boolean} +def place_word_in_crossword(board, word) + +end","class Solution { + func placeWordInCrossword(_ board: [[Character]], _ word: String) -> Bool { + + } +}","func placeWordInCrossword(board [][]byte, word string) bool { + +}","object Solution { + def placeWordInCrossword(board: Array[Array[Char]], word: String): Boolean = { + + } +}","class Solution { + fun placeWordInCrossword(board: Array, word: String): Boolean { + + } +}","impl Solution { + pub fn place_word_in_crossword(board: Vec>, word: String) -> bool { + + } +}","class Solution { + + /** + * @param String[][] $board + * @param String $word + * @return Boolean + */ + function placeWordInCrossword($board, $word) { + + } +}","function placeWordInCrossword(board: string[][], word: string): boolean { + +};","(define/contract (place-word-in-crossword board word) + (-> (listof (listof char?)) string? boolean?) + + )","-spec place_word_in_crossword(Board :: [[char()]], Word :: unicode:unicode_binary()) -> boolean(). +place_word_in_crossword(Board, Word) -> + .","defmodule Solution do + @spec place_word_in_crossword(board :: [[char]], word :: String.t) :: boolean + def place_word_in_crossword(board, word) do + + end +end","class Solution { + bool placeWordInCrossword(List> board, String word) { + + } +}", +564,grid-game,Grid Game,2017.0,2145.0,"

You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (r, c) on the matrix. Two robots are playing a game on this matrix.

+ +

Both robots initially start at (0, 0) and want to reach (1, n-1). Each robot may only move to the right ((r, c) to (r, c + 1)) or down ((r, c) to (r + 1, c)).

+ +

At the start of the game, the first robot moves from (0, 0) to (1, n-1), collecting all the points from the cells on its path. For all cells (r, c) traversed on the path, grid[r][c] is set to 0. Then, the second robot moves from (0, 0) to (1, n-1), collecting the points on its path. Note that their paths may intersect with one another.

+ +

The first robot wants to minimize the number of points collected by the second robot. In contrast, the second robot wants to maximize the number of points it collects. If both robots play optimally, return the number of points collected by the second robot.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,5,4],[1,5,1]]
+Output: 4
+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.
+The cells visited by the first robot are set to 0.
+The second robot will collect 0 + 0 + 4 + 0 = 4 points.
+
+ +

Example 2:

+ +
+Input: grid = [[3,3,1],[8,5,2]]
+Output: 4
+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.
+The cells visited by the first robot are set to 0.
+The second robot will collect 0 + 3 + 1 + 0 = 4 points.
+
+ +

Example 3:

+ +
+Input: grid = [[1,3,1,15],[1,3,3,1]]
+Output: 7
+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.
+The cells visited by the first robot are set to 0.
+The second robot will collect 0 + 1 + 3 + 3 + 0 = 7 points.
+
+ +

 

+

Constraints:

+ +
    +
  • grid.length == 2
    • +
  • n == grid[r].length
    • +
  • 1 <= n <= 5 * 104
    • +
  • 1 <= grid[r][c] <= 105
    • +
+",2.0,False,"class Solution { +public: + long long gridGame(vector>& grid) { + + } +};","class Solution { + public long gridGame(int[][] grid) { + + } +}","class Solution(object): + def gridGame(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def gridGame(self, grid: List[List[int]]) -> int: + ","long long gridGame(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public long GridGame(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var gridGame = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def grid_game(grid) + +end","class Solution { + func gridGame(_ grid: [[Int]]) -> Int { + + } +}","func gridGame(grid [][]int) int64 { + +}","object Solution { + def gridGame(grid: Array[Array[Int]]): Long = { + + } +}","class Solution { + fun gridGame(grid: Array): Long { + + } +}","impl Solution { + pub fn grid_game(grid: Vec>) -> i64 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function gridGame($grid) { + + } +}","function gridGame(grid: number[][]): number { + +};","(define/contract (grid-game grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec grid_game(Grid :: [[integer()]]) -> integer(). +grid_game(Grid) -> + .","defmodule Solution do + @spec grid_game(grid :: [[integer]]) :: integer + def grid_game(grid) do + + end +end","class Solution { + int gridGame(List> grid) { + + } +}", +566,longest-subsequence-repeated-k-times,Longest Subsequence Repeated k Times,2014.0,2140.0,"

You are given a string s of length n, and an integer k. You are tasked to find the longest subsequence repeated k times in string s.

+ +

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

+ +

A subsequence seq is repeated k times in the string s if seq * k is a subsequence of s, where seq * k represents a string constructed by concatenating seq k times.

+ +
    +
  • For example, "bba" is repeated 2 times in the string "bababcba", because the string "bbabba", constructed by concatenating "bba" 2 times, is a subsequence of the string "bababcba".
    • +
+ +

Return the longest subsequence repeated k times in string s. If multiple such subsequences are found, return the lexicographically largest one. If there is no such subsequence, return an empty string.

+ +

 

+

Example 1:

+ +
+Input: s = "letsleetcode", k = 2
+Output: "let"
+Explanation: There are two longest subsequences repeated 2 times: "let" and "ete".
+"let" is the lexicographically largest one.
+
+ +

Example 2:

+ +
+Input: s = "bb", k = 2
+Output: "b"
+Explanation: The longest subsequence repeated 2 times is "b".
+
+ +

Example 3:

+ +
+Input: s = "ab", k = 2
+Output: ""
+Explanation: There is no subsequence repeated 2 times. Empty string is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length
    • +
  • 2 <= n, k <= 2000
    • +
  • 2 <= n < k * 8
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string longestSubsequenceRepeatedK(string s, int k) { + + } +};","class Solution { + public String longestSubsequenceRepeatedK(String s, int k) { + + } +}","class Solution(object): + def longestSubsequenceRepeatedK(self, s, k): + """""" + :type s: str + :type k: int + :rtype: str + """""" + ","class Solution: + def longestSubsequenceRepeatedK(self, s: str, k: int) -> str: + ","char * longestSubsequenceRepeatedK(char * s, int k){ + +}","public class Solution { + public string LongestSubsequenceRepeatedK(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var longestSubsequenceRepeatedK = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {String} +def longest_subsequence_repeated_k(s, k) + +end","class Solution { + func longestSubsequenceRepeatedK(_ s: String, _ k: Int) -> String { + + } +}","func longestSubsequenceRepeatedK(s string, k int) string { + +}","object Solution { + def longestSubsequenceRepeatedK(s: String, k: Int): String = { + + } +}","class Solution { + fun longestSubsequenceRepeatedK(s: String, k: Int): String { + + } +}","impl Solution { + pub fn longest_subsequence_repeated_k(s: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return String + */ + function longestSubsequenceRepeatedK($s, $k) { + + } +}","function longestSubsequenceRepeatedK(s: string, k: number): string { + +};","(define/contract (longest-subsequence-repeated-k s k) + (-> string? exact-integer? string?) + + )","-spec longest_subsequence_repeated_k(S :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +longest_subsequence_repeated_k(S, K) -> + .","defmodule Solution do + @spec longest_subsequence_repeated_k(s :: String.t, k :: integer) :: String.t + def longest_subsequence_repeated_k(s, k) do + + end +end","class Solution { + String longestSubsequenceRepeatedK(String s, int k) { + + } +}", +567,detect-squares,Detect Squares,2013.0,2139.0,"

You are given a stream of points on the X-Y plane. Design an algorithm that:

+ +
    +
  • Adds new points from the stream into a data structure. Duplicate points are allowed and should be treated as different points.
    • +
  • Given a query point, counts the number of ways to choose three points from the data structure such that the three points and the query point form an axis-aligned square with positive area.
    • +
+ +

An axis-aligned square is a square whose edges are all the same length and are either parallel or perpendicular to the x-axis and y-axis.

+ +

Implement the DetectSquares class:

+ +
    +
  • DetectSquares() Initializes the object with an empty data structure.
    • +
  • void add(int[] point) Adds a new point point = [x, y] to the data structure.
    • +
  • int count(int[] point) Counts the number of ways to form axis-aligned squares with point point = [x, y] as described above.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["DetectSquares", "add", "add", "add", "count", "count", "add", "count"]
+[[], [[3, 10]], [[11, 2]], [[3, 2]], [[11, 10]], [[14, 8]], [[11, 2]], [[11, 10]]]
+Output
+[null, null, null, null, 1, 0, null, 2]
+
+Explanation
+DetectSquares detectSquares = new DetectSquares();
+detectSquares.add([3, 10]);
+detectSquares.add([11, 2]);
+detectSquares.add([3, 2]);
+detectSquares.count([11, 10]); // return 1. You can choose:
+                               //   - The first, second, and third points
+detectSquares.count([14, 8]);  // return 0. The query point cannot form a square with any points in the data structure.
+detectSquares.add([11, 2]);    // Adding duplicate points is allowed.
+detectSquares.count([11, 10]); // return 2. You can choose:
+                               //   - The first, second, and third points
+                               //   - The first, third, and fourth points
+
+ +

 

+

Constraints:

+ +
    +
  • point.length == 2
    • +
  • 0 <= x, y <= 1000
    • +
  • At most 3000 calls in total will be made to add and count.
    • +
+",2.0,False,"class DetectSquares { +public: + DetectSquares() { + + } + + void add(vector point) { + + } + + int count(vector point) { + + } +}; + +/** + * Your DetectSquares object will be instantiated and called as such: + * DetectSquares* obj = new DetectSquares(); + * obj->add(point); + * int param_2 = obj->count(point); + */","class DetectSquares { + + public DetectSquares() { + + } + + public void add(int[] point) { + + } + + public int count(int[] point) { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * DetectSquares obj = new DetectSquares(); + * obj.add(point); + * int param_2 = obj.count(point); + */","class DetectSquares(object): + + def __init__(self): + + + def add(self, point): + """""" + :type point: List[int] + :rtype: None + """""" + + + def count(self, point): + """""" + :type point: List[int] + :rtype: int + """""" + + + +# Your DetectSquares object will be instantiated and called as such: +# obj = DetectSquares() +# obj.add(point) +# param_2 = obj.count(point)","class DetectSquares: + + def __init__(self): + + + def add(self, point: List[int]) -> None: + + + def count(self, point: List[int]) -> int: + + + +# Your DetectSquares object will be instantiated and called as such: +# obj = DetectSquares() +# obj.add(point) +# param_2 = obj.count(point)"," + + +typedef struct { + +} DetectSquares; + + +DetectSquares* detectSquaresCreate() { + +} + +void detectSquaresAdd(DetectSquares* obj, int* point, int pointSize) { + +} + +int detectSquaresCount(DetectSquares* obj, int* point, int pointSize) { + +} + +void detectSquaresFree(DetectSquares* obj) { + +} + +/** + * Your DetectSquares struct will be instantiated and called as such: + * DetectSquares* obj = detectSquaresCreate(); + * detectSquaresAdd(obj, point, pointSize); + + * int param_2 = detectSquaresCount(obj, point, pointSize); + + * detectSquaresFree(obj); +*/","public class DetectSquares { + + public DetectSquares() { + + } + + public void Add(int[] point) { + + } + + public int Count(int[] point) { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * DetectSquares obj = new DetectSquares(); + * obj.Add(point); + * int param_2 = obj.Count(point); + */"," +var DetectSquares = function() { + +}; + +/** + * @param {number[]} point + * @return {void} + */ +DetectSquares.prototype.add = function(point) { + +}; + +/** + * @param {number[]} point + * @return {number} + */ +DetectSquares.prototype.count = function(point) { + +}; + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */","class DetectSquares + def initialize() + + end + + +=begin + :type point: Integer[] + :rtype: Void +=end + def add(point) + + end + + +=begin + :type point: Integer[] + :rtype: Integer +=end + def count(point) + + end + + +end + +# Your DetectSquares object will be instantiated and called as such: +# obj = DetectSquares.new() +# obj.add(point) +# param_2 = obj.count(point)"," +class DetectSquares { + + init() { + + } + + func add(_ point: [Int]) { + + } + + func count(_ point: [Int]) -> Int { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * let obj = DetectSquares() + * obj.add(point) + * let ret_2: Int = obj.count(point) + */","type DetectSquares struct { + +} + + +func Constructor() DetectSquares { + +} + + +func (this *DetectSquares) Add(point []int) { + +} + + +func (this *DetectSquares) Count(point []int) int { + +} + + +/** + * Your DetectSquares object will be instantiated and called as such: + * obj := Constructor(); + * obj.Add(point); + * param_2 := obj.Count(point); + */","class DetectSquares() { + + def add(point: Array[Int]) { + + } + + def count(point: Array[Int]): Int = { + + } + +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */","class DetectSquares() { + + fun add(point: IntArray) { + + } + + fun count(point: IntArray): Int { + + } + +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */","struct DetectSquares { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl DetectSquares { + + fn new() -> Self { + + } + + fn add(&self, point: Vec) { + + } + + fn count(&self, point: Vec) -> i32 { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * let obj = DetectSquares::new(); + * obj.add(point); + * let ret_2: i32 = obj.count(point); + */","class DetectSquares { + /** + */ + function __construct() { + + } + + /** + * @param Integer[] $point + * @return NULL + */ + function add($point) { + + } + + /** + * @param Integer[] $point + * @return Integer + */ + function count($point) { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * $obj = DetectSquares(); + * $obj->add($point); + * $ret_2 = $obj->count($point); + */","class DetectSquares { + constructor() { + + } + + add(point: number[]): void { + + } + + count(point: number[]): number { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * var obj = new DetectSquares() + * obj.add(point) + * var param_2 = obj.count(point) + */","(define detect-squares% + (class object% + (super-new) + (init-field) + + ; add : (listof exact-integer?) -> void? + (define/public (add point) + + ) + ; count : (listof exact-integer?) -> exact-integer? + (define/public (count point) + + ))) + +;; Your detect-squares% object will be instantiated and called as such: +;; (define obj (new detect-squares%)) +;; (send obj add point) +;; (define param_2 (send obj count point))","-spec detect_squares_init_() -> any(). +detect_squares_init_() -> + . + +-spec detect_squares_add(Point :: [integer()]) -> any(). +detect_squares_add(Point) -> + . + +-spec detect_squares_count(Point :: [integer()]) -> integer(). +detect_squares_count(Point) -> + . + + +%% Your functions will be called as such: +%% detect_squares_init_(), +%% detect_squares_add(Point), +%% Param_2 = detect_squares_count(Point), + +%% detect_squares_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule DetectSquares do + @spec init_() :: any + def init_() do + + end + + @spec add(point :: [integer]) :: any + def add(point) do + + end + + @spec count(point :: [integer]) :: integer + def count(point) do + + end +end + +# Your functions will be called as such: +# DetectSquares.init_() +# DetectSquares.add(point) +# param_2 = DetectSquares.count(point) + +# DetectSquares.init_ will be called before every test case, in which you can do some necessary initializations.","class DetectSquares { + + DetectSquares() { + + } + + void add(List point) { + + } + + int count(List point) { + + } +} + +/** + * Your DetectSquares object will be instantiated and called as such: + * DetectSquares obj = DetectSquares(); + * obj.add(point); + * int param2 = obj.count(point); + */", +568,sum-of-beauty-in-the-array,Sum of Beauty in the Array,2012.0,2138.0,"

You are given a 0-indexed integer array nums. For each index i (1 <= i <= nums.length - 2) the beauty of nums[i] equals:

+ +
    +
  • 2, if nums[j] < nums[i] < nums[k], for all 0 <= j < i and for all i < k <= nums.length - 1.
    • +
  • 1, if nums[i - 1] < nums[i] < nums[i + 1], and the previous condition is not satisfied.
    • +
  • 0, if none of the previous conditions holds.
    • +
+ +

Return the sum of beauty of all nums[i] where 1 <= i <= nums.length - 2.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3]
+Output: 2
+Explanation: For each index i in the range 1 <= i <= 1:
+- The beauty of nums[1] equals 2.
+
+ +

Example 2:

+ +
+Input: nums = [2,4,6,4]
+Output: 1
+Explanation: For each index i in the range 1 <= i <= 2:
+- The beauty of nums[1] equals 1.
+- The beauty of nums[2] equals 0.
+
+ +

Example 3:

+ +
+Input: nums = [3,2,1]
+Output: 0
+Explanation: For each index i in the range 1 <= i <= 1:
+- The beauty of nums[1] equals 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int sumOfBeauties(vector& nums) { + + } +};","class Solution { + public int sumOfBeauties(int[] nums) { + + } +}","class Solution(object): + def sumOfBeauties(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumOfBeauties(self, nums: List[int]) -> int: + ","int sumOfBeauties(int* nums, int numsSize){ + +}","public class Solution { + public int SumOfBeauties(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumOfBeauties = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_of_beauties(nums) + +end","class Solution { + func sumOfBeauties(_ nums: [Int]) -> Int { + + } +}","func sumOfBeauties(nums []int) int { + +}","object Solution { + def sumOfBeauties(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumOfBeauties(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_of_beauties(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumOfBeauties($nums) { + + } +}","function sumOfBeauties(nums: number[]): number { + +};","(define/contract (sum-of-beauties nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_of_beauties(Nums :: [integer()]) -> integer(). +sum_of_beauties(Nums) -> + .","defmodule Solution do + @spec sum_of_beauties(nums :: [integer]) :: integer + def sum_of_beauties(nums) do + + end +end","class Solution { + int sumOfBeauties(List nums) { + + } +}", +570,maximum-number-of-ways-to-partition-an-array,Maximum Number of Ways to Partition an Array,2025.0,2135.0,"

You are given a 0-indexed integer array nums of length n. The number of ways to partition nums is the number of pivot indices that satisfy both conditions:

+ +
    +
  • 1 <= pivot < n
    • +
  • nums[0] + nums[1] + ... + nums[pivot - 1] == nums[pivot] + nums[pivot + 1] + ... + nums[n - 1]
    • +
+ +

You are also given an integer k. You can choose to change the value of one element of nums to k, or to leave the array unchanged.

+ +

Return the maximum possible number of ways to partition nums to satisfy both conditions after changing at most one element.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,-1,2], k = 3
+Output: 1
+Explanation: One optimal approach is to change nums[0] to k. The array becomes [3,-1,2].
+There is one way to partition the array:
+- For pivot = 2, we have the partition [3,-1 | 2]: 3 + -1 == 2.
+
+ +

Example 2:

+ +
+Input: nums = [0,0,0], k = 1
+Output: 2
+Explanation: The optimal approach is to leave the array unchanged.
+There are two ways to partition the array:
+- For pivot = 1, we have the partition [0 | 0,0]: 0 == 0 + 0.
+- For pivot = 2, we have the partition [0,0 | 0]: 0 + 0 == 0.
+
+ +

Example 3:

+ +
+Input: nums = [22,4,-25,-20,-15,15,-16,7,19,-10,0,-13,-14], k = -33
+Output: 4
+Explanation: One optimal approach is to change nums[2] to k. The array becomes [22,4,-33,-20,-15,15,-16,7,19,-10,0,-13,-14].
+There are four ways to partition the array.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 2 <= n <= 105
    • +
  • -105 <= k, nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int waysToPartition(vector& nums, int k) { + + } +};","class Solution { + public int waysToPartition(int[] nums, int k) { + + } +}","class Solution(object): + def waysToPartition(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def waysToPartition(self, nums: List[int], k: int) -> int: + ","int waysToPartition(int* nums, int numsSize, int k){ + +}","public class Solution { + public int WaysToPartition(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var waysToPartition = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def ways_to_partition(nums, k) + +end","class Solution { + func waysToPartition(_ nums: [Int], _ k: Int) -> Int { + + } +}","func waysToPartition(nums []int, k int) int { + +}","object Solution { + def waysToPartition(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun waysToPartition(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn ways_to_partition(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function waysToPartition($nums, $k) { + + } +}","function waysToPartition(nums: number[], k: number): number { + +};","(define/contract (ways-to-partition nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec ways_to_partition(Nums :: [integer()], K :: integer()) -> integer(). +ways_to_partition(Nums, K) -> + .","defmodule Solution do + @spec ways_to_partition(nums :: [integer], k :: integer) :: integer + def ways_to_partition(nums, k) do + + end +end","class Solution { + int waysToPartition(List nums, int k) { + + } +}", +572,number-of-pairs-of-strings-with-concatenation-equal-to-target,Number of Pairs of Strings With Concatenation Equal to Target,2023.0,2133.0,"

Given an array of digit strings nums and a digit string target, return the number of pairs of indices (i, j) (where i != j) such that the concatenation of nums[i] + nums[j] equals target.

+ +

 

+

Example 1:

+ +
+Input: nums = ["777","7","77","77"], target = "7777"
+Output: 4
+Explanation: Valid pairs are:
+- (0, 1): "777" + "7"
+- (1, 0): "7" + "777"
+- (2, 3): "77" + "77"
+- (3, 2): "77" + "77"
+
+ +

Example 2:

+ +
+Input: nums = ["123","4","12","34"], target = "1234"
+Output: 2
+Explanation: Valid pairs are:
+- (0, 1): "123" + "4"
+- (2, 3): "12" + "34"
+
+ +

Example 3:

+ +
+Input: nums = ["1","1","1"], target = "11"
+Output: 6
+Explanation: Valid pairs are:
+- (0, 1): "1" + "1"
+- (1, 0): "1" + "1"
+- (0, 2): "1" + "1"
+- (2, 0): "1" + "1"
+- (1, 2): "1" + "1"
+- (2, 1): "1" + "1"
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 100
    • +
  • 1 <= nums[i].length <= 100
    • +
  • 2 <= target.length <= 100
    • +
  • nums[i] and target consist of digits.
    • +
  • nums[i] and target do not have leading zeros.
    • +
+",2.0,False,"class Solution { +public: + int numOfPairs(vector& nums, string target) { + + } +};","class Solution { + public int numOfPairs(String[] nums, String target) { + + } +}","class Solution(object): + def numOfPairs(self, nums, target): + """""" + :type nums: List[str] + :type target: str + :rtype: int + """""" + ","class Solution: + def numOfPairs(self, nums: List[str], target: str) -> int: + ","int numOfPairs(char ** nums, int numsSize, char * target){ + +}","public class Solution { + public int NumOfPairs(string[] nums, string target) { + + } +}","/** + * @param {string[]} nums + * @param {string} target + * @return {number} + */ +var numOfPairs = function(nums, target) { + +};","# @param {String[]} nums +# @param {String} target +# @return {Integer} +def num_of_pairs(nums, target) + +end","class Solution { + func numOfPairs(_ nums: [String], _ target: String) -> Int { + + } +}","func numOfPairs(nums []string, target string) int { + +}","object Solution { + def numOfPairs(nums: Array[String], target: String): Int = { + + } +}","class Solution { + fun numOfPairs(nums: Array, target: String): Int { + + } +}","impl Solution { + pub fn num_of_pairs(nums: Vec, target: String) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $nums + * @param String $target + * @return Integer + */ + function numOfPairs($nums, $target) { + + } +}","function numOfPairs(nums: string[], target: string): number { + +};","(define/contract (num-of-pairs nums target) + (-> (listof string?) string? exact-integer?) + + )","-spec num_of_pairs(Nums :: [unicode:unicode_binary()], Target :: unicode:unicode_binary()) -> integer(). +num_of_pairs(Nums, Target) -> + .","defmodule Solution do + @spec num_of_pairs(nums :: [String.t], target :: String.t) :: integer + def num_of_pairs(nums, target) do + + end +end","class Solution { + int numOfPairs(List nums, String target) { + + } +}", +574,smallest-missing-genetic-value-in-each-subtree,Smallest Missing Genetic Value in Each Subtree,2003.0,2131.0,"

There is a family tree rooted at 0 consisting of n nodes numbered 0 to n - 1. You are given a 0-indexed integer array parents, where parents[i] is the parent for node i. Since node 0 is the root, parents[0] == -1.

+ +

There are 105 genetic values, each represented by an integer in the inclusive range [1, 105]. You are given a 0-indexed integer array nums, where nums[i] is a distinct genetic value for node i.

+ +

Return an array ans of length n where ans[i] is the smallest genetic value that is missing from the subtree rooted at node i.

+ +

The subtree rooted at a node x contains node x and all of its descendant nodes.

+ +

 

+

Example 1:

+ +
+Input: parents = [-1,0,0,2], nums = [1,2,3,4]
+Output: [5,1,1,1]
+Explanation: The answer for each subtree is calculated as follows:
+- 0: The subtree contains nodes [0,1,2,3] with values [1,2,3,4]. 5 is the smallest missing value.
+- 1: The subtree contains only node 1 with value 2. 1 is the smallest missing value.
+- 2: The subtree contains nodes [2,3] with values [3,4]. 1 is the smallest missing value.
+- 3: The subtree contains only node 3 with value 4. 1 is the smallest missing value.
+
+ +

Example 2:

+ +
+Input: parents = [-1,0,1,0,3,3], nums = [5,4,6,2,1,3]
+Output: [7,1,1,4,2,1]
+Explanation: The answer for each subtree is calculated as follows:
+- 0: The subtree contains nodes [0,1,2,3,4,5] with values [5,4,6,2,1,3]. 7 is the smallest missing value.
+- 1: The subtree contains nodes [1,2] with values [4,6]. 1 is the smallest missing value.
+- 2: The subtree contains only node 2 with value 6. 1 is the smallest missing value.
+- 3: The subtree contains nodes [3,4,5] with values [2,1,3]. 4 is the smallest missing value.
+- 4: The subtree contains only node 4 with value 1. 2 is the smallest missing value.
+- 5: The subtree contains only node 5 with value 3. 1 is the smallest missing value.
+
+ +

Example 3:

+ +
+Input: parents = [-1,2,3,0,2,4,1], nums = [2,3,4,5,6,7,8]
+Output: [1,1,1,1,1,1,1]
+Explanation: The value 1 is missing from all the subtrees.
+
+ +

 

+

Constraints:

+ +
    +
  • n == parents.length == nums.length
    • +
  • 2 <= n <= 105
    • +
  • 0 <= parents[i] <= n - 1 for i != 0
    • +
  • parents[0] == -1
    • +
  • parents represents a valid tree.
    • +
  • 1 <= nums[i] <= 105
    • +
  • Each nums[i] is distinct.
    • +
+",3.0,False,"class Solution { +public: + vector smallestMissingValueSubtree(vector& parents, vector& nums) { + + } +};","class Solution { + public int[] smallestMissingValueSubtree(int[] parents, int[] nums) { + + } +}","class Solution(object): + def smallestMissingValueSubtree(self, parents, nums): + """""" + :type parents: List[int] + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def smallestMissingValueSubtree(self, parents: List[int], nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* smallestMissingValueSubtree(int* parents, int parentsSize, int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] SmallestMissingValueSubtree(int[] parents, int[] nums) { + + } +}","/** + * @param {number[]} parents + * @param {number[]} nums + * @return {number[]} + */ +var smallestMissingValueSubtree = function(parents, nums) { + +};","# @param {Integer[]} parents +# @param {Integer[]} nums +# @return {Integer[]} +def smallest_missing_value_subtree(parents, nums) + +end","class Solution { + func smallestMissingValueSubtree(_ parents: [Int], _ nums: [Int]) -> [Int] { + + } +}","func smallestMissingValueSubtree(parents []int, nums []int) []int { + +}","object Solution { + def smallestMissingValueSubtree(parents: Array[Int], nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun smallestMissingValueSubtree(parents: IntArray, nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn smallest_missing_value_subtree(parents: Vec, nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $parents + * @param Integer[] $nums + * @return Integer[] + */ + function smallestMissingValueSubtree($parents, $nums) { + + } +}","function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] { + +};","(define/contract (smallest-missing-value-subtree parents nums) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec smallest_missing_value_subtree(Parents :: [integer()], Nums :: [integer()]) -> [integer()]. +smallest_missing_value_subtree(Parents, Nums) -> + .","defmodule Solution do + @spec smallest_missing_value_subtree(parents :: [integer], nums :: [integer]) :: [integer] + def smallest_missing_value_subtree(parents, nums) do + + end +end","class Solution { + List smallestMissingValueSubtree(List parents, List nums) { + + } +}", +578,gcd-sort-of-an-array,GCD Sort of an Array,1998.0,2125.0,"

You are given an integer array nums, and you can perform the following operation any number of times on nums:

+ +
    +
  • Swap the positions of two elements nums[i] and nums[j] if gcd(nums[i], nums[j]) > 1 where gcd(nums[i], nums[j]) is the greatest common divisor of nums[i] and nums[j].
    • +
+ +

Return true if it is possible to sort nums in non-decreasing order using the above swap method, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [7,21,3]
+Output: true
+Explanation: We can sort [7,21,3] by performing the following operations:
+- Swap 7 and 21 because gcd(7,21) = 7. nums = [21,7,3]
+- Swap 21 and 3 because gcd(21,3) = 3. nums = [3,7,21]
+
+ +

Example 2:

+ +
+Input: nums = [5,2,6,2]
+Output: false
+Explanation: It is impossible to sort the array because 5 cannot be swapped with any other element.
+
+ +

Example 3:

+ +
+Input: nums = [10,5,9,3,15]
+Output: true
+We can sort [10,5,9,3,15] by performing the following operations:
+- Swap 10 and 15 because gcd(10,15) = 5. nums = [15,5,9,3,10]
+- Swap 15 and 3 because gcd(15,3) = 3. nums = [3,5,9,15,10]
+- Swap 10 and 15 because gcd(10,15) = 5. nums = [3,5,9,10,15]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • 2 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + bool gcdSort(vector& nums) { + + } +};","class Solution { + public boolean gcdSort(int[] nums) { + + } +}","class Solution(object): + def gcdSort(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def gcdSort(self, nums: List[int]) -> bool: + ","bool gcdSort(int* nums, int numsSize){ + +}","public class Solution { + public bool GcdSort(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var gcdSort = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def gcd_sort(nums) + +end","class Solution { + func gcdSort(_ nums: [Int]) -> Bool { + + } +}","func gcdSort(nums []int) bool { + +}","object Solution { + def gcdSort(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun gcdSort(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn gcd_sort(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function gcdSort($nums) { + + } +}","function gcdSort(nums: number[]): boolean { + +};","(define/contract (gcd-sort nums) + (-> (listof exact-integer?) boolean?) + + )","-spec gcd_sort(Nums :: [integer()]) -> boolean(). +gcd_sort(Nums) -> + .","defmodule Solution do + @spec gcd_sort(nums :: [integer]) :: boolean + def gcd_sort(nums) do + + end +end","class Solution { + bool gcdSort(List nums) { + + } +}", +580,the-number-of-weak-characters-in-the-game,The Number of Weak Characters in the Game,1996.0,2123.0,"

You are playing a game that contains multiple characters, and each of the characters has two main properties: attack and defense. You are given a 2D integer array properties where properties[i] = [attacki, defensei] represents the properties of the ith character in the game.

+ +

A character is said to be weak if any other character has both attack and defense levels strictly greater than this character's attack and defense levels. More formally, a character i is said to be weak if there exists another character j where attackj > attacki and defensej > defensei.

+ +

Return the number of weak characters.

+ +

 

+

Example 1:

+ +
+Input: properties = [[5,5],[6,3],[3,6]]
+Output: 0
+Explanation: No character has strictly greater attack and defense than the other.
+
+ +

Example 2:

+ +
+Input: properties = [[2,2],[3,3]]
+Output: 1
+Explanation: The first character is weak because the second character has a strictly greater attack and defense.
+
+ +

Example 3:

+ +
+Input: properties = [[1,5],[10,4],[4,3]]
+Output: 1
+Explanation: The third character is weak because the second character has a strictly greater attack and defense.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= properties.length <= 105
    • +
  • properties[i].length == 2
    • +
  • 1 <= attacki, defensei <= 105
    • +
+",2.0,False,"class Solution { +public: + int numberOfWeakCharacters(vector>& properties) { + + } +};","class Solution { + public int numberOfWeakCharacters(int[][] properties) { + + } +}","class Solution(object): + def numberOfWeakCharacters(self, properties): + """""" + :type properties: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numberOfWeakCharacters(self, properties: List[List[int]]) -> int: + ","int numberOfWeakCharacters(int** properties, int propertiesSize, int* propertiesColSize){ + +}","public class Solution { + public int NumberOfWeakCharacters(int[][] properties) { + + } +}","/** + * @param {number[][]} properties + * @return {number} + */ +var numberOfWeakCharacters = function(properties) { + +};","# @param {Integer[][]} properties +# @return {Integer} +def number_of_weak_characters(properties) + +end","class Solution { + func numberOfWeakCharacters(_ properties: [[Int]]) -> Int { + + } +}","func numberOfWeakCharacters(properties [][]int) int { + +}","object Solution { + def numberOfWeakCharacters(properties: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numberOfWeakCharacters(properties: Array): Int { + + } +}","impl Solution { + pub fn number_of_weak_characters(properties: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $properties + * @return Integer + */ + function numberOfWeakCharacters($properties) { + + } +}","function numberOfWeakCharacters(properties: number[][]): number { + +};","(define/contract (number-of-weak-characters properties) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec number_of_weak_characters(Properties :: [[integer()]]) -> integer(). +number_of_weak_characters(Properties) -> + .","defmodule Solution do + @spec number_of_weak_characters(properties :: [[integer]]) :: integer + def number_of_weak_characters(properties) do + + end +end","class Solution { + int numberOfWeakCharacters(List> properties) { + + } +}", +581,count-special-quadruplets,Count Special Quadruplets,1995.0,2122.0,"

Given a 0-indexed integer array nums, return the number of distinct quadruplets (a, b, c, d) such that:

+ +
    +
  • nums[a] + nums[b] + nums[c] == nums[d], and
    • +
  • a < b < c < d
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,6]
+Output: 1
+Explanation: The only quadruplet that satisfies the requirement is (0, 1, 2, 3) because 1 + 2 + 3 == 6.
+
+ +

Example 2:

+ +
+Input: nums = [3,3,6,4,5]
+Output: 0
+Explanation: There are no such quadruplets in [3,3,6,4,5].
+
+ +

Example 3:

+ +
+Input: nums = [1,1,1,3,5]
+Output: 4
+Explanation: The 4 quadruplets that satisfy the requirement are:
+- (0, 1, 2, 3): 1 + 1 + 1 == 3
+- (0, 1, 3, 4): 1 + 1 + 3 == 5
+- (0, 2, 3, 4): 1 + 1 + 3 == 5
+- (1, 2, 3, 4): 1 + 1 + 3 == 5
+
+ +

 

+

Constraints:

+ +
    +
  • 4 <= nums.length <= 50
    • +
  • 1 <= nums[i] <= 100
    • +
+",1.0,False,"class Solution { +public: + int countQuadruplets(vector& nums) { + + } +};","class Solution { + public int countQuadruplets(int[] nums) { + + } +}","class Solution(object): + def countQuadruplets(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countQuadruplets(self, nums: List[int]) -> int: + ","int countQuadruplets(int* nums, int numsSize){ + +}","public class Solution { + public int CountQuadruplets(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countQuadruplets = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_quadruplets(nums) + +end","class Solution { + func countQuadruplets(_ nums: [Int]) -> Int { + + } +}","func countQuadruplets(nums []int) int { + +}","object Solution { + def countQuadruplets(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countQuadruplets(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_quadruplets(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countQuadruplets($nums) { + + } +}","function countQuadruplets(nums: number[]): number { + +};","(define/contract (count-quadruplets nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_quadruplets(Nums :: [integer()]) -> integer(). +count_quadruplets(Nums) -> + .","defmodule Solution do + @spec count_quadruplets(nums :: [integer]) :: integer + def count_quadruplets(nums) do + + end +end","class Solution { + int countQuadruplets(List nums) { + + } +}", +582,find-if-path-exists-in-graph,Find if Path Exists in Graph,1971.0,2121.0,"

There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive). The edges in the graph are represented as a 2D integer array edges, where each edges[i] = [ui, vi] denotes a bi-directional edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself.

+ +

You want to determine if there is a valid path that exists from vertex source to vertex destination.

+ +

Given edges and the integers n, source, and destination, return true if there is a valid path from source to destination, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: n = 3, edges = [[0,1],[1,2],[2,0]], source = 0, destination = 2
+Output: true
+Explanation: There are two paths from vertex 0 to vertex 2:
+- 0 → 1 → 2
+- 0 → 2
+
+ +

Example 2:

+ +
+Input: n = 6, edges = [[0,1],[0,2],[3,5],[5,4],[4,3]], source = 0, destination = 5
+Output: false
+Explanation: There is no path from vertex 0 to vertex 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 105
    • +
  • 0 <= edges.length <= 2 * 105
    • +
  • edges[i].length == 2
    • +
  • 0 <= ui, vi <= n - 1
    • +
  • ui != vi
    • +
  • 0 <= source, destination <= n - 1
    • +
  • There are no duplicate edges.
    • +
  • There are no self edges.
    • +
+",1.0,False,"class Solution { +public: + bool validPath(int n, vector>& edges, int source, int destination) { + + } +};","class Solution { + public boolean validPath(int n, int[][] edges, int source, int destination) { + + } +}","class Solution(object): + def validPath(self, n, edges, source, destination): + """""" + :type n: int + :type edges: List[List[int]] + :type source: int + :type destination: int + :rtype: bool + """""" + ","class Solution: + def validPath(self, n: int, edges: List[List[int]], source: int, destination: int) -> bool: + ","bool validPath(int n, int** edges, int edgesSize, int* edgesColSize, int source, int destination){ + +}","public class Solution { + public bool ValidPath(int n, int[][] edges, int source, int destination) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} source + * @param {number} destination + * @return {boolean} + */ +var validPath = function(n, edges, source, destination) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} source +# @param {Integer} destination +# @return {Boolean} +def valid_path(n, edges, source, destination) + +end","class Solution { + func validPath(_ n: Int, _ edges: [[Int]], _ source: Int, _ destination: Int) -> Bool { + + } +}","func validPath(n int, edges [][]int, source int, destination int) bool { + +}","object Solution { + def validPath(n: Int, edges: Array[Array[Int]], source: Int, destination: Int): Boolean = { + + } +}","class Solution { + fun validPath(n: Int, edges: Array, source: Int, destination: Int): Boolean { + + } +}","impl Solution { + pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $source + * @param Integer $destination + * @return Boolean + */ + function validPath($n, $edges, $source, $destination) { + + } +}","function validPath(n: number, edges: number[][], source: number, destination: number): boolean { + +};","(define/contract (valid-path n edges source destination) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer? boolean?) + + )","-spec valid_path(N :: integer(), Edges :: [[integer()]], Source :: integer(), Destination :: integer()) -> boolean(). +valid_path(N, Edges, Source, Destination) -> + .","defmodule Solution do + @spec valid_path(n :: integer, edges :: [[integer]], source :: integer, destination :: integer) :: boolean + def valid_path(n, edges, source, destination) do + + end +end","class Solution { + bool validPath(int n, List> edges, int source, int destination) { + + } +}", +583,minimum-number-of-operations-to-make-array-continuous,Minimum Number of Operations to Make Array Continuous,2009.0,2119.0,"

You are given an integer array nums. In one operation, you can replace any element in nums with any integer.

+ +

nums is considered continuous if both of the following conditions are fulfilled:

+ +
    +
  • All elements in nums are unique.
    • +
  • The difference between the maximum element and the minimum element in nums equals nums.length - 1.
    • +
+ +

For example, nums = [4, 2, 5, 3] is continuous, but nums = [1, 2, 3, 5, 6] is not continuous.

+ +

Return the minimum number of operations to make nums continuous.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,2,5,3]
+Output: 0
+Explanation: nums is already continuous.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,5,6]
+Output: 1
+Explanation: One possible solution is to change the last element to 4.
+The resulting array is [1,2,3,5,4], which is continuous.
+
+ +

Example 3:

+ +
+Input: nums = [1,10,100,1000]
+Output: 3
+Explanation: One possible solution is to:
+- Change the second element to 2.
+- Change the third element to 3.
+- Change the fourth element to 4.
+The resulting array is [1,2,3,4], which is continuous.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int minOperations(vector& nums) { + + } +};","class Solution { + public int minOperations(int[] nums) { + + } +}","class Solution(object): + def minOperations(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minOperations(self, nums: List[int]) -> int: + ","int minOperations(int* nums, int numsSize){ + +}","public class Solution { + public int MinOperations(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_operations(nums) + +end","class Solution { + func minOperations(_ nums: [Int]) -> Int { + + } +}","func minOperations(nums []int) int { + +}","object Solution { + def minOperations(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minOperations(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_operations(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minOperations($nums) { + + } +}","function minOperations(nums: number[]): number { + +};","(define/contract (min-operations nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_operations(Nums :: [integer()]) -> integer(). +min_operations(Nums) -> + .","defmodule Solution do + @spec min_operations(nums :: [integer]) :: integer + def min_operations(nums) do + + end +end","class Solution { + int minOperations(List nums) { + + } +}", +584,maximum-earnings-from-taxi,Maximum Earnings From Taxi,2008.0,2118.0,"

There are n points on a road you are driving your taxi on. The n points on the road are labeled from 1 to n in the direction you are going, and you want to drive from point 1 to point n to make money by picking up passengers. You cannot change the direction of the taxi.

+ +

The passengers are represented by a 0-indexed 2D integer array rides, where rides[i] = [starti, endi, tipi] denotes the ith passenger requesting a ride from point starti to point endi who is willing to give a tipi dollar tip.

+ +

For each passenger i you pick up, you earn endi - starti + tipi dollars. You may only drive at most one passenger at a time.

+ +

Given n and rides, return the maximum number of dollars you can earn by picking up the passengers optimally.

+ +

Note: You may drop off a passenger and pick up a different passenger at the same point.

+ +

 

+

Example 1:

+ +
+Input: n = 5, rides = [[2,5,4],[1,5,1]]
+Output: 7
+Explanation: We can pick up passenger 0 to earn 5 - 2 + 4 = 7 dollars.
+
+ +

Example 2:

+ +
+Input: n = 20, rides = [[1,6,1],[3,10,2],[10,12,3],[11,12,2],[12,15,2],[13,18,1]]
+Output: 20
+Explanation: We will pick up the following passengers:
+- Drive passenger 1 from point 3 to point 10 for a profit of 10 - 3 + 2 = 9 dollars.
+- Drive passenger 2 from point 10 to point 12 for a profit of 12 - 10 + 3 = 5 dollars.
+- Drive passenger 5 from point 13 to point 18 for a profit of 18 - 13 + 1 = 6 dollars.
+We earn 9 + 5 + 6 = 20 dollars in total.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 1 <= rides.length <= 3 * 104
    • +
  • rides[i].length == 3
    • +
  • 1 <= starti < endi <= n
    • +
  • 1 <= tipi <= 105
    • +
+",2.0,False,"class Solution { +public: + long long maxTaxiEarnings(int n, vector>& rides) { + + } +};","class Solution { + public long maxTaxiEarnings(int n, int[][] rides) { + + } +}","class Solution(object): + def maxTaxiEarnings(self, n, rides): + """""" + :type n: int + :type rides: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxTaxiEarnings(self, n: int, rides: List[List[int]]) -> int: + ","long long maxTaxiEarnings(int n, int** rides, int ridesSize, int* ridesColSize){ + +}","public class Solution { + public long MaxTaxiEarnings(int n, int[][] rides) { + + } +}","/** + * @param {number} n + * @param {number[][]} rides + * @return {number} + */ +var maxTaxiEarnings = function(n, rides) { + +};","# @param {Integer} n +# @param {Integer[][]} rides +# @return {Integer} +def max_taxi_earnings(n, rides) + +end","class Solution { + func maxTaxiEarnings(_ n: Int, _ rides: [[Int]]) -> Int { + + } +}","func maxTaxiEarnings(n int, rides [][]int) int64 { + +}","object Solution { + def maxTaxiEarnings(n: Int, rides: Array[Array[Int]]): Long = { + + } +}","class Solution { + fun maxTaxiEarnings(n: Int, rides: Array): Long { + + } +}","impl Solution { + pub fn max_taxi_earnings(n: i32, rides: Vec>) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $rides + * @return Integer + */ + function maxTaxiEarnings($n, $rides) { + + } +}","function maxTaxiEarnings(n: number, rides: number[][]): number { + +};","(define/contract (max-taxi-earnings n rides) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_taxi_earnings(N :: integer(), Rides :: [[integer()]]) -> integer(). +max_taxi_earnings(N, Rides) -> + .","defmodule Solution do + @spec max_taxi_earnings(n :: integer, rides :: [[integer]]) :: integer + def max_taxi_earnings(n, rides) do + + end +end","class Solution { + int maxTaxiEarnings(int n, List> rides) { + + } +}", +585,find-original-array-from-doubled-array,Find Original Array From Doubled Array,2007.0,2117.0,"

An integer array original is transformed into a doubled array changed by appending twice the value of every element in original, and then randomly shuffling the resulting array.

+ +

Given an array changed, return original if changed is a doubled array. If changed is not a doubled array, return an empty array. The elements in original may be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: changed = [1,3,4,2,6,8]
+Output: [1,3,4]
+Explanation: One possible original array could be [1,3,4]:
+- Twice the value of 1 is 1 * 2 = 2.
+- Twice the value of 3 is 3 * 2 = 6.
+- Twice the value of 4 is 4 * 2 = 8.
+Other original arrays could be [4,3,1] or [3,1,4].
+
+ +

Example 2:

+ +
+Input: changed = [6,3,0,1]
+Output: []
+Explanation: changed is not a doubled array.
+
+ +

Example 3:

+ +
+Input: changed = [1]
+Output: []
+Explanation: changed is not a doubled array.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= changed.length <= 105
    • +
  • 0 <= changed[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + vector findOriginalArray(vector& changed) { + + } +};","class Solution { + public int[] findOriginalArray(int[] changed) { + + } +}","class Solution(object): + def findOriginalArray(self, changed): + """""" + :type changed: List[int] + :rtype: List[int] + """""" + ","class Solution: + def findOriginalArray(self, changed: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findOriginalArray(int* changed, int changedSize, int* returnSize){ + +}","public class Solution { + public int[] FindOriginalArray(int[] changed) { + + } +}","/** + * @param {number[]} changed + * @return {number[]} + */ +var findOriginalArray = function(changed) { + +};","# @param {Integer[]} changed +# @return {Integer[]} +def find_original_array(changed) + +end","class Solution { + func findOriginalArray(_ changed: [Int]) -> [Int] { + + } +}","func findOriginalArray(changed []int) []int { + +}","object Solution { + def findOriginalArray(changed: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun findOriginalArray(changed: IntArray): IntArray { + + } +}","impl Solution { + pub fn find_original_array(changed: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $changed + * @return Integer[] + */ + function findOriginalArray($changed) { + + } +}","function findOriginalArray(changed: number[]): number[] { + +};","(define/contract (find-original-array changed) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec find_original_array(Changed :: [integer()]) -> [integer()]. +find_original_array(Changed) -> + .","defmodule Solution do + @spec find_original_array(changed :: [integer]) :: [integer] + def find_original_array(changed) do + + end +end","class Solution { + List findOriginalArray(List changed) { + + } +}", +586,count-number-of-pairs-with-absolute-difference-k,Count Number of Pairs With Absolute Difference K,2006.0,2116.0,"

Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j such that |nums[i] - nums[j]| == k.

+ +

The value of |x| is defined as:

+ +
    +
  • x if x >= 0.
    • +
  • -x if x < 0.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,2,1], k = 1
+Output: 4
+Explanation: The pairs with an absolute difference of 1 are:
+- [1,2,2,1]
+- [1,2,2,1]
+- [1,2,2,1]
+- [1,2,2,1]
+
+ +

Example 2:

+ +
+Input: nums = [1,3], k = 3
+Output: 0
+Explanation: There are no pairs with an absolute difference of 3.
+
+ +

Example 3:

+ +
+Input: nums = [3,2,1,5,4], k = 2
+Output: 3
+Explanation: The pairs with an absolute difference of 2 are:
+- [3,2,1,5,4]
+- [3,2,1,5,4]
+- [3,2,1,5,4]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 200
    • +
  • 1 <= nums[i] <= 100
    • +
  • 1 <= k <= 99
    • +
+",1.0,False,"class Solution { +public: + int countKDifference(vector& nums, int k) { + + } +};","class Solution { + public int countKDifference(int[] nums, int k) { + + } +}","class Solution(object): + def countKDifference(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def countKDifference(self, nums: List[int], k: int) -> int: + ","int countKDifference(int* nums, int numsSize, int k){ + +}","public class Solution { + public int CountKDifference(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var countKDifference = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def count_k_difference(nums, k) + +end","class Solution { + func countKDifference(_ nums: [Int], _ k: Int) -> Int { + + } +}","func countKDifference(nums []int, k int) int { + +}","object Solution { + def countKDifference(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun countKDifference(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn count_k_difference(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function countKDifference($nums, $k) { + + } +}","function countKDifference(nums: number[], k: number): number { + +};","(define/contract (count-k-difference nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec count_k_difference(Nums :: [integer()], K :: integer()) -> integer(). +count_k_difference(Nums, K) -> + .","defmodule Solution do + @spec count_k_difference(nums :: [integer], k :: integer) :: integer + def count_k_difference(nums, k) do + + end +end","class Solution { + int countKDifference(List nums, int k) { + + } +}", +587,number-of-unique-good-subsequences,Number of Unique Good Subsequences,1987.0,2115.0,"

You are given a binary string binary. A subsequence of binary is considered good if it is not empty and has no leading zeros (with the exception of "0").

+ +

Find the number of unique good subsequences of binary.

+ +
    +
  • For example, if binary = "001", then all the good subsequences are ["0", "0", "1"], so the unique good subsequences are "0" and "1". Note that subsequences "00", "01", and "001" are not good because they have leading zeros.
    • +
+ +

Return the number of unique good subsequences of binary. Since the answer may be very large, return it modulo 109 + 7.

+ +

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: binary = "001"
+Output: 2
+Explanation: The good subsequences of binary are ["0", "0", "1"].
+The unique good subsequences are "0" and "1".
+
+ +

Example 2:

+ +
+Input: binary = "11"
+Output: 2
+Explanation: The good subsequences of binary are ["1", "1", "11"].
+The unique good subsequences are "1" and "11".
+ +

Example 3:

+ +
+Input: binary = "101"
+Output: 5
+Explanation: The good subsequences of binary are ["1", "0", "1", "10", "11", "101"]. 
+The unique good subsequences are "0", "1", "10", "11", and "101".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= binary.length <= 105
    • +
  • binary consists of only '0's and '1's.
    • +
+",3.0,False,"class Solution { +public: + int numberOfUniqueGoodSubsequences(string binary) { + + } +};","class Solution { + public int numberOfUniqueGoodSubsequences(String binary) { + + } +}","class Solution(object): + def numberOfUniqueGoodSubsequences(self, binary): + """""" + :type binary: str + :rtype: int + """""" + ","class Solution: + def numberOfUniqueGoodSubsequences(self, binary: str) -> int: + ","int numberOfUniqueGoodSubsequences(char * binary){ + +}","public class Solution { + public int NumberOfUniqueGoodSubsequences(string binary) { + + } +}","/** + * @param {string} binary + * @return {number} + */ +var numberOfUniqueGoodSubsequences = function(binary) { + +};","# @param {String} binary +# @return {Integer} +def number_of_unique_good_subsequences(binary) + +end","class Solution { + func numberOfUniqueGoodSubsequences(_ binary: String) -> Int { + + } +}","func numberOfUniqueGoodSubsequences(binary string) int { + +}","object Solution { + def numberOfUniqueGoodSubsequences(binary: String): Int = { + + } +}","class Solution { + fun numberOfUniqueGoodSubsequences(binary: String): Int { + + } +}","impl Solution { + pub fn number_of_unique_good_subsequences(binary: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $binary + * @return Integer + */ + function numberOfUniqueGoodSubsequences($binary) { + + } +}","function numberOfUniqueGoodSubsequences(binary: string): number { + +};","(define/contract (number-of-unique-good-subsequences binary) + (-> string? exact-integer?) + + )","-spec number_of_unique_good_subsequences(Binary :: unicode:unicode_binary()) -> integer(). +number_of_unique_good_subsequences(Binary) -> + .","defmodule Solution do + @spec number_of_unique_good_subsequences(binary :: String.t) :: integer + def number_of_unique_good_subsequences(binary) do + + end +end","class Solution { + int numberOfUniqueGoodSubsequences(String binary) { + + } +}", +591,find-array-given-subset-sums,Find Array Given Subset Sums,1982.0,2109.0,"

You are given an integer n representing the length of an unknown array that you are trying to recover. You are also given an array sums containing the values of all 2n subset sums of the unknown array (in no particular order).

+ +

Return the array ans of length n representing the unknown array. If multiple answers exist, return any of them.

+ +

An array sub is a subset of an array arr if sub can be obtained from arr by deleting some (possibly zero or all) elements of arr. The sum of the elements in sub is one possible subset sum of arr. The sum of an empty array is considered to be 0.

+ +

Note: Test cases are generated such that there will always be at least one correct answer.

+ +

 

+

Example 1:

+ +
+Input: n = 3, sums = [-3,-2,-1,0,0,1,2,3]
+Output: [1,2,-3]
+Explanation: [1,2,-3] is able to achieve the given subset sums:
+- []: sum is 0
+- [1]: sum is 1
+- [2]: sum is 2
+- [1,2]: sum is 3
+- [-3]: sum is -3
+- [1,-3]: sum is -2
+- [2,-3]: sum is -1
+- [1,2,-3]: sum is 0
+Note that any permutation of [1,2,-3] and also any permutation of [-1,-2,3] will also be accepted.
+
+ +

Example 2:

+ +
+Input: n = 2, sums = [0,0,0,0]
+Output: [0,0]
+Explanation: The only correct answer is [0,0].
+
+ +

Example 3:

+ +
+Input: n = 4, sums = [0,0,5,5,4,-1,4,9,9,-1,4,3,4,8,3,8]
+Output: [0,-1,4,5]
+Explanation: [0,-1,4,5] is able to achieve the given subset sums.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 15
    • +
  • sums.length == 2n
    • +
  • -104 <= sums[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + vector recoverArray(int n, vector& sums) { + + } +};","class Solution { + public int[] recoverArray(int n, int[] sums) { + + } +}","class Solution(object): + def recoverArray(self, n, sums): + """""" + :type n: int + :type sums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def recoverArray(self, n: int, sums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* recoverArray(int n, int* sums, int sumsSize, int* returnSize){ + +}","public class Solution { + public int[] RecoverArray(int n, int[] sums) { + + } +}","/** + * @param {number} n + * @param {number[]} sums + * @return {number[]} + */ +var recoverArray = function(n, sums) { + +};","# @param {Integer} n +# @param {Integer[]} sums +# @return {Integer[]} +def recover_array(n, sums) + +end","class Solution { + func recoverArray(_ n: Int, _ sums: [Int]) -> [Int] { + + } +}","func recoverArray(n int, sums []int) []int { + +}","object Solution { + def recoverArray(n: Int, sums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun recoverArray(n: Int, sums: IntArray): IntArray { + + } +}","impl Solution { + pub fn recover_array(n: i32, sums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $sums + * @return Integer[] + */ + function recoverArray($n, $sums) { + + } +}","function recoverArray(n: number, sums: number[]): number[] { + +};","(define/contract (recover-array n sums) + (-> exact-integer? (listof exact-integer?) (listof exact-integer?)) + + )","-spec recover_array(N :: integer(), Sums :: [integer()]) -> [integer()]. +recover_array(N, Sums) -> + .","defmodule Solution do + @spec recover_array(n :: integer, sums :: [integer]) :: [integer] + def recover_array(n, sums) do + + end +end","class Solution { + List recoverArray(int n, List sums) { + + } +}", +593,find-unique-binary-string,Find Unique Binary String,1980.0,2107.0,"

Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. If there are multiple answers, you may return any of them.

+ +

 

+

Example 1:

+ +
+Input: nums = ["01","10"]
+Output: "11"
+Explanation: "11" does not appear in nums. "00" would also be correct.
+
+ +

Example 2:

+ +
+Input: nums = ["00","01"]
+Output: "11"
+Explanation: "11" does not appear in nums. "10" would also be correct.
+
+ +

Example 3:

+ +
+Input: nums = ["111","011","001"]
+Output: "101"
+Explanation: "101" does not appear in nums. "000", "010", "100", and "110" would also be correct.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 16
    • +
  • nums[i].length == n
    • +
  • nums[i] is either '0' or '1'.
    • +
  • All the strings of nums are unique.
    • +
+",2.0,False,"class Solution { +public: + string findDifferentBinaryString(vector& nums) { + + } +};","class Solution { + public String findDifferentBinaryString(String[] nums) { + + } +}","class Solution(object): + def findDifferentBinaryString(self, nums): + """""" + :type nums: List[str] + :rtype: str + """""" + ","class Solution: + def findDifferentBinaryString(self, nums: List[str]) -> str: + ","char * findDifferentBinaryString(char ** nums, int numsSize){ + +}","public class Solution { + public string FindDifferentBinaryString(string[] nums) { + + } +}","/** + * @param {string[]} nums + * @return {string} + */ +var findDifferentBinaryString = function(nums) { + +};","# @param {String[]} nums +# @return {String} +def find_different_binary_string(nums) + +end","class Solution { + func findDifferentBinaryString(_ nums: [String]) -> String { + + } +}","func findDifferentBinaryString(nums []string) string { + +}","object Solution { + def findDifferentBinaryString(nums: Array[String]): String = { + + } +}","class Solution { + fun findDifferentBinaryString(nums: Array): String { + + } +}","impl Solution { + pub fn find_different_binary_string(nums: Vec) -> String { + + } +}","class Solution { + + /** + * @param String[] $nums + * @return String + */ + function findDifferentBinaryString($nums) { + + } +}","function findDifferentBinaryString(nums: string[]): string { + +};","(define/contract (find-different-binary-string nums) + (-> (listof string?) string?) + + )","-spec find_different_binary_string(Nums :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +find_different_binary_string(Nums) -> + .","defmodule Solution do + @spec find_different_binary_string(nums :: [String.t]) :: String.t + def find_different_binary_string(nums) do + + end +end","class Solution { + String findDifferentBinaryString(List nums) { + + } +}", +595,the-number-of-good-subsets,The Number of Good Subsets,1994.0,2105.0,"

You are given an integer array nums. We call a subset of nums good if its product can be represented as a product of one or more distinct prime numbers.

+ +
    +
  • For example, if nums = [1, 2, 3, 4]: + +
      +
    • [2, 3], [1, 2, 3], and [1, 3] are good subsets with products 6 = 2*3, 6 = 2*3, and 3 = 3 respectively.
      • +
    • [1, 4] and [4] are not good subsets with products 4 = 2*2 and 4 = 2*2 respectively.
      • +
    +
    • +
+ +

Return the number of different good subsets in nums modulo 109 + 7.

+ +

A subset of nums is any array that can be obtained by deleting some (possibly none or all) elements from nums. Two subsets are different if and only if the chosen indices to delete are different.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4]
+Output: 6
+Explanation: The good subsets are:
+- [1,2]: product is 2, which is the product of distinct prime 2.
+- [1,2,3]: product is 6, which is the product of distinct primes 2 and 3.
+- [1,3]: product is 3, which is the product of distinct prime 3.
+- [2]: product is 2, which is the product of distinct prime 2.
+- [2,3]: product is 6, which is the product of distinct primes 2 and 3.
+- [3]: product is 3, which is the product of distinct prime 3.
+
+ +

Example 2:

+ +
+Input: nums = [4,2,3,15]
+Output: 5
+Explanation: The good subsets are:
+- [2]: product is 2, which is the product of distinct prime 2.
+- [2,3]: product is 6, which is the product of distinct primes 2 and 3.
+- [2,15]: product is 30, which is the product of distinct primes 2, 3, and 5.
+- [3]: product is 3, which is the product of distinct prime 3.
+- [15]: product is 15, which is the product of distinct primes 3 and 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 30
    • +
+",3.0,False,"class Solution { +public: + int numberOfGoodSubsets(vector& nums) { + + } +};","class Solution { + public int numberOfGoodSubsets(int[] nums) { + + } +}","class Solution(object): + def numberOfGoodSubsets(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numberOfGoodSubsets(self, nums: List[int]) -> int: + ","int numberOfGoodSubsets(int* nums, int numsSize){ + +}","public class Solution { + public int NumberOfGoodSubsets(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numberOfGoodSubsets = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def number_of_good_subsets(nums) + +end","class Solution { + func numberOfGoodSubsets(_ nums: [Int]) -> Int { + + } +}","func numberOfGoodSubsets(nums []int) int { + +}","object Solution { + def numberOfGoodSubsets(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numberOfGoodSubsets(nums: IntArray): Int { + + } +}","impl Solution { + pub fn number_of_good_subsets(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numberOfGoodSubsets($nums) { + + } +}","function numberOfGoodSubsets(nums: number[]): number { + +};","(define/contract (number-of-good-subsets nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec number_of_good_subsets(Nums :: [integer()]) -> integer(). +number_of_good_subsets(Nums) -> + .","defmodule Solution do + @spec number_of_good_subsets(nums :: [integer]) :: integer + def number_of_good_subsets(nums) do + + end +end","class Solution { + int numberOfGoodSubsets(List nums) { + + } +}", +596,operations-on-tree,Operations on Tree,1993.0,2104.0,"

You are given a tree with n nodes numbered from 0 to n - 1 in the form of a parent array parent where parent[i] is the parent of the ith node. The root of the tree is node 0, so parent[0] = -1 since it has no parent. You want to design a data structure that allows users to lock, unlock, and upgrade nodes in the tree.

+ +

The data structure should support the following functions:

+ +
    +
  • Lock: Locks the given node for the given user and prevents other users from locking the same node. You may only lock a node using this function if the node is unlocked.
    • +
  • Unlock: Unlocks the given node for the given user. You may only unlock a node using this function if it is currently locked by the same user.
    • +
  • Upgrade: Locks the given node for the given user and unlocks all of its descendants regardless of who locked it. You may only upgrade a node if all 3 conditions are true: +
      +
    • The node is unlocked,
      • +
    • It has at least one locked descendant (by any user), and
      • +
    • It does not have any locked ancestors.
      • +
    +
    • +
+ +

Implement the LockingTree class:

+ +
    +
  • LockingTree(int[] parent) initializes the data structure with the parent array.
    • +
  • lock(int num, int user) returns true if it is possible for the user with id user to lock the node num, or false otherwise. If it is possible, the node num will become locked by the user with id user.
    • +
  • unlock(int num, int user) returns true if it is possible for the user with id user to unlock the node num, or false otherwise. If it is possible, the node num will become unlocked.
    • +
  • upgrade(int num, int user) returns true if it is possible for the user with id user to upgrade the node num, or false otherwise. If it is possible, the node num will be upgraded.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["LockingTree", "lock", "unlock", "unlock", "lock", "upgrade", "lock"]
+[[[-1, 0, 0, 1, 1, 2, 2]], [2, 2], [2, 3], [2, 2], [4, 5], [0, 1], [0, 1]]
+Output
+[null, true, false, true, true, true, false]
+
+Explanation
+LockingTree lockingTree = new LockingTree([-1, 0, 0, 1, 1, 2, 2]);
+lockingTree.lock(2, 2);    // return true because node 2 is unlocked.
+                           // Node 2 will now be locked by user 2.
+lockingTree.unlock(2, 3);  // return false because user 3 cannot unlock a node locked by user 2.
+lockingTree.unlock(2, 2);  // return true because node 2 was previously locked by user 2.
+                           // Node 2 will now be unlocked.
+lockingTree.lock(4, 5);    // return true because node 4 is unlocked.
+                           // Node 4 will now be locked by user 5.
+lockingTree.upgrade(0, 1); // return true because node 0 is unlocked and has at least one locked descendant (node 4).
+                           // Node 0 will now be locked by user 1 and node 4 will now be unlocked.
+lockingTree.lock(0, 1);    // return false because node 0 is already locked.
+
+ +

 

+

Constraints:

+ +
    +
  • n == parent.length
    • +
  • 2 <= n <= 2000
    • +
  • 0 <= parent[i] <= n - 1 for i != 0
    • +
  • parent[0] == -1
    • +
  • 0 <= num <= n - 1
    • +
  • 1 <= user <= 104
    • +
  • parent represents a valid tree.
    • +
  • At most 2000 calls in total will be made to lock, unlock, and upgrade.
    • +
+",2.0,False,"class LockingTree { +public: + LockingTree(vector& parent) { + + } + + bool lock(int num, int user) { + + } + + bool unlock(int num, int user) { + + } + + bool upgrade(int num, int user) { + + } +}; + +/** + * Your LockingTree object will be instantiated and called as such: + * LockingTree* obj = new LockingTree(parent); + * bool param_1 = obj->lock(num,user); + * bool param_2 = obj->unlock(num,user); + * bool param_3 = obj->upgrade(num,user); + */","class LockingTree { + + public LockingTree(int[] parent) { + + } + + public boolean lock(int num, int user) { + + } + + public boolean unlock(int num, int user) { + + } + + public boolean upgrade(int num, int user) { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * LockingTree obj = new LockingTree(parent); + * boolean param_1 = obj.lock(num,user); + * boolean param_2 = obj.unlock(num,user); + * boolean param_3 = obj.upgrade(num,user); + */","class LockingTree(object): + + def __init__(self, parent): + """""" + :type parent: List[int] + """""" + + + def lock(self, num, user): + """""" + :type num: int + :type user: int + :rtype: bool + """""" + + + def unlock(self, num, user): + """""" + :type num: int + :type user: int + :rtype: bool + """""" + + + def upgrade(self, num, user): + """""" + :type num: int + :type user: int + :rtype: bool + """""" + + + +# Your LockingTree object will be instantiated and called as such: +# obj = LockingTree(parent) +# param_1 = obj.lock(num,user) +# param_2 = obj.unlock(num,user) +# param_3 = obj.upgrade(num,user)","class LockingTree: + + def __init__(self, parent: List[int]): + + + def lock(self, num: int, user: int) -> bool: + + + def unlock(self, num: int, user: int) -> bool: + + + def upgrade(self, num: int, user: int) -> bool: + + + +# Your LockingTree object will be instantiated and called as such: +# obj = LockingTree(parent) +# param_1 = obj.lock(num,user) +# param_2 = obj.unlock(num,user) +# param_3 = obj.upgrade(num,user)"," + + +typedef struct { + +} LockingTree; + + +LockingTree* lockingTreeCreate(int* parent, int parentSize) { + +} + +bool lockingTreeLock(LockingTree* obj, int num, int user) { + +} + +bool lockingTreeUnlock(LockingTree* obj, int num, int user) { + +} + +bool lockingTreeUpgrade(LockingTree* obj, int num, int user) { + +} + +void lockingTreeFree(LockingTree* obj) { + +} + +/** + * Your LockingTree struct will be instantiated and called as such: + * LockingTree* obj = lockingTreeCreate(parent, parentSize); + * bool param_1 = lockingTreeLock(obj, num, user); + + * bool param_2 = lockingTreeUnlock(obj, num, user); + + * bool param_3 = lockingTreeUpgrade(obj, num, user); + + * lockingTreeFree(obj); +*/","public class LockingTree { + + public LockingTree(int[] parent) { + + } + + public bool Lock(int num, int user) { + + } + + public bool Unlock(int num, int user) { + + } + + public bool Upgrade(int num, int user) { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * LockingTree obj = new LockingTree(parent); + * bool param_1 = obj.Lock(num,user); + * bool param_2 = obj.Unlock(num,user); + * bool param_3 = obj.Upgrade(num,user); + */","/** + * @param {number[]} parent + */ +var LockingTree = function(parent) { + +}; + +/** + * @param {number} num + * @param {number} user + * @return {boolean} + */ +LockingTree.prototype.lock = function(num, user) { + +}; + +/** + * @param {number} num + * @param {number} user + * @return {boolean} + */ +LockingTree.prototype.unlock = function(num, user) { + +}; + +/** + * @param {number} num + * @param {number} user + * @return {boolean} + */ +LockingTree.prototype.upgrade = function(num, user) { + +}; + +/** + * Your LockingTree object will be instantiated and called as such: + * var obj = new LockingTree(parent) + * var param_1 = obj.lock(num,user) + * var param_2 = obj.unlock(num,user) + * var param_3 = obj.upgrade(num,user) + */","class LockingTree + +=begin + :type parent: Integer[] +=end + def initialize(parent) + + end + + +=begin + :type num: Integer + :type user: Integer + :rtype: Boolean +=end + def lock(num, user) + + end + + +=begin + :type num: Integer + :type user: Integer + :rtype: Boolean +=end + def unlock(num, user) + + end + + +=begin + :type num: Integer + :type user: Integer + :rtype: Boolean +=end + def upgrade(num, user) + + end + + +end + +# Your LockingTree object will be instantiated and called as such: +# obj = LockingTree.new(parent) +# param_1 = obj.lock(num, user) +# param_2 = obj.unlock(num, user) +# param_3 = obj.upgrade(num, user)"," +class LockingTree { + + init(_ parent: [Int]) { + + } + + func lock(_ num: Int, _ user: Int) -> Bool { + + } + + func unlock(_ num: Int, _ user: Int) -> Bool { + + } + + func upgrade(_ num: Int, _ user: Int) -> Bool { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * let obj = LockingTree(parent) + * let ret_1: Bool = obj.lock(num, user) + * let ret_2: Bool = obj.unlock(num, user) + * let ret_3: Bool = obj.upgrade(num, user) + */","type LockingTree struct { + +} + + +func Constructor(parent []int) LockingTree { + +} + + +func (this *LockingTree) Lock(num int, user int) bool { + +} + + +func (this *LockingTree) Unlock(num int, user int) bool { + +} + + +func (this *LockingTree) Upgrade(num int, user int) bool { + +} + + +/** + * Your LockingTree object will be instantiated and called as such: + * obj := Constructor(parent); + * param_1 := obj.Lock(num,user); + * param_2 := obj.Unlock(num,user); + * param_3 := obj.Upgrade(num,user); + */","class LockingTree(_parent: Array[Int]) { + + def lock(num: Int, user: Int): Boolean = { + + } + + def unlock(num: Int, user: Int): Boolean = { + + } + + def upgrade(num: Int, user: Int): Boolean = { + + } + +} + +/** + * Your LockingTree object will be instantiated and called as such: + * var obj = new LockingTree(parent) + * var param_1 = obj.lock(num,user) + * var param_2 = obj.unlock(num,user) + * var param_3 = obj.upgrade(num,user) + */","class LockingTree(parent: IntArray) { + + fun lock(num: Int, user: Int): Boolean { + + } + + fun unlock(num: Int, user: Int): Boolean { + + } + + fun upgrade(num: Int, user: Int): Boolean { + + } + +} + +/** + * Your LockingTree object will be instantiated and called as such: + * var obj = LockingTree(parent) + * var param_1 = obj.lock(num,user) + * var param_2 = obj.unlock(num,user) + * var param_3 = obj.upgrade(num,user) + */","struct LockingTree { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl LockingTree { + + fn new(parent: Vec) -> Self { + + } + + fn lock(&self, num: i32, user: i32) -> bool { + + } + + fn unlock(&self, num: i32, user: i32) -> bool { + + } + + fn upgrade(&self, num: i32, user: i32) -> bool { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * let obj = LockingTree::new(parent); + * let ret_1: bool = obj.lock(num, user); + * let ret_2: bool = obj.unlock(num, user); + * let ret_3: bool = obj.upgrade(num, user); + */","class LockingTree { + /** + * @param Integer[] $parent + */ + function __construct($parent) { + + } + + /** + * @param Integer $num + * @param Integer $user + * @return Boolean + */ + function lock($num, $user) { + + } + + /** + * @param Integer $num + * @param Integer $user + * @return Boolean + */ + function unlock($num, $user) { + + } + + /** + * @param Integer $num + * @param Integer $user + * @return Boolean + */ + function upgrade($num, $user) { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * $obj = LockingTree($parent); + * $ret_1 = $obj->lock($num, $user); + * $ret_2 = $obj->unlock($num, $user); + * $ret_3 = $obj->upgrade($num, $user); + */","class LockingTree { + constructor(parent: number[]) { + + } + + lock(num: number, user: number): boolean { + + } + + unlock(num: number, user: number): boolean { + + } + + upgrade(num: number, user: number): boolean { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * var obj = new LockingTree(parent) + * var param_1 = obj.lock(num,user) + * var param_2 = obj.unlock(num,user) + * var param_3 = obj.upgrade(num,user) + */","(define locking-tree% + (class object% + (super-new) + + ; parent : (listof exact-integer?) + (init-field + parent) + + ; lock : exact-integer? exact-integer? -> boolean? + (define/public (lock num user) + + ) + ; unlock : exact-integer? exact-integer? -> boolean? + (define/public (unlock num user) + + ) + ; upgrade : exact-integer? exact-integer? -> boolean? + (define/public (upgrade num user) + + ))) + +;; Your locking-tree% object will be instantiated and called as such: +;; (define obj (new locking-tree% [parent parent])) +;; (define param_1 (send obj lock num user)) +;; (define param_2 (send obj unlock num user)) +;; (define param_3 (send obj upgrade num user))","-spec locking_tree_init_(Parent :: [integer()]) -> any(). +locking_tree_init_(Parent) -> + . + +-spec locking_tree_lock(Num :: integer(), User :: integer()) -> boolean(). +locking_tree_lock(Num, User) -> + . + +-spec locking_tree_unlock(Num :: integer(), User :: integer()) -> boolean(). +locking_tree_unlock(Num, User) -> + . + +-spec locking_tree_upgrade(Num :: integer(), User :: integer()) -> boolean(). +locking_tree_upgrade(Num, User) -> + . + + +%% Your functions will be called as such: +%% locking_tree_init_(Parent), +%% Param_1 = locking_tree_lock(Num, User), +%% Param_2 = locking_tree_unlock(Num, User), +%% Param_3 = locking_tree_upgrade(Num, User), + +%% locking_tree_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule LockingTree do + @spec init_(parent :: [integer]) :: any + def init_(parent) do + + end + + @spec lock(num :: integer, user :: integer) :: boolean + def lock(num, user) do + + end + + @spec unlock(num :: integer, user :: integer) :: boolean + def unlock(num, user) do + + end + + @spec upgrade(num :: integer, user :: integer) :: boolean + def upgrade(num, user) do + + end +end + +# Your functions will be called as such: +# LockingTree.init_(parent) +# param_1 = LockingTree.lock(num, user) +# param_2 = LockingTree.unlock(num, user) +# param_3 = LockingTree.upgrade(num, user) + +# LockingTree.init_ will be called before every test case, in which you can do some necessary initializations.","class LockingTree { + + LockingTree(List parent) { + + } + + bool lock(int num, int user) { + + } + + bool unlock(int num, int user) { + + } + + bool upgrade(int num, int user) { + + } +} + +/** + * Your LockingTree object will be instantiated and called as such: + * LockingTree obj = LockingTree(parent); + * bool param1 = obj.lock(num,user); + * bool param2 = obj.unlock(num,user); + * bool param3 = obj.upgrade(num,user); + */", +597,find-all-groups-of-farmland,Find All Groups of Farmland,1992.0,2103.0,"

You are given a 0-indexed m x n binary matrix land where a 0 represents a hectare of forested land and a 1 represents a hectare of farmland.

+ +

To keep the land organized, there are designated rectangular areas of hectares that consist entirely of farmland. These rectangular areas are called groups. No two groups are adjacent, meaning farmland in one group is not four-directionally adjacent to another farmland in a different group.

+ +

land can be represented by a coordinate system where the top left corner of land is (0, 0) and the bottom right corner of land is (m-1, n-1). Find the coordinates of the top left and bottom right corner of each group of farmland. A group of farmland with a top left corner at (r1, c1) and a bottom right corner at (r2, c2) is represented by the 4-length array [r1, c1, r2, c2].

+ +

Return a 2D array containing the 4-length arrays described above for each group of farmland in land. If there are no groups of farmland, return an empty array. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: land = [[1,0,0],[0,1,1],[0,1,1]]
+Output: [[0,0,0,0],[1,1,2,2]]
+Explanation:
+The first group has a top left corner at land[0][0] and a bottom right corner at land[0][0].
+The second group has a top left corner at land[1][1] and a bottom right corner at land[2][2].
+
+ +

Example 2:

+ +
+Input: land = [[1,1],[1,1]]
+Output: [[0,0,1,1]]
+Explanation:
+The first group has a top left corner at land[0][0] and a bottom right corner at land[1][1].
+
+ +

Example 3:

+ +
+Input: land = [[0]]
+Output: []
+Explanation:
+There are no groups of farmland.
+
+ +

 

+

Constraints:

+ +
    +
  • m == land.length
    • +
  • n == land[i].length
    • +
  • 1 <= m, n <= 300
    • +
  • land consists of only 0's and 1's.
    • +
  • Groups of farmland are rectangular in shape.
    • +
+",2.0,False,"class Solution { +public: + vector> findFarmland(vector>& land) { + + } +};","class Solution { + public int[][] findFarmland(int[][] land) { + + } +}","class Solution(object): + def findFarmland(self, land): + """""" + :type land: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def findFarmland(self, land: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** findFarmland(int** land, int landSize, int* landColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] FindFarmland(int[][] land) { + + } +}","/** + * @param {number[][]} land + * @return {number[][]} + */ +var findFarmland = function(land) { + +};","# @param {Integer[][]} land +# @return {Integer[][]} +def find_farmland(land) + +end","class Solution { + func findFarmland(_ land: [[Int]]) -> [[Int]] { + + } +}","func findFarmland(land [][]int) [][]int { + +}","object Solution { + def findFarmland(land: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun findFarmland(land: Array): Array { + + } +}","impl Solution { + pub fn find_farmland(land: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $land + * @return Integer[][] + */ + function findFarmland($land) { + + } +}","function findFarmland(land: number[][]): number[][] { + +};","(define/contract (find-farmland land) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec find_farmland(Land :: [[integer()]]) -> [[integer()]]. +find_farmland(Land) -> + .","defmodule Solution do + @spec find_farmland(land :: [[integer]]) :: [[integer]] + def find_farmland(land) do + + end +end","class Solution { + List> findFarmland(List> land) { + + } +}", +599,last-day-where-you-can-still-cross,Last Day Where You Can Still Cross,1970.0,2101.0,"

There is a 1-based binary matrix where 0 represents land and 1 represents water. You are given integers row and col representing the number of rows and columns in the matrix, respectively.

+ +

Initially on day 0, the entire matrix is land. However, each day a new cell becomes flooded with water. You are given a 1-based 2D array cells, where cells[i] = [ri, ci] represents that on the ith day, the cell on the rith row and cith column (1-based coordinates) will be covered with water (i.e., changed to 1).

+ +

You want to find the last day that it is possible to walk from the top to the bottom by only walking on land cells. You can start from any cell in the top row and end at any cell in the bottom row. You can only travel in the four cardinal directions (left, right, up, and down).

+ +

Return the last day where it is possible to walk from the top to the bottom by only walking on land cells.

+ +

 

+

Example 1:

+ +
+Input: row = 2, col = 2, cells = [[1,1],[2,1],[1,2],[2,2]]
+Output: 2
+Explanation: The above image depicts how the matrix changes each day starting from day 0.
+The last day where it is possible to cross from top to bottom is on day 2.
+
+ +

Example 2:

+ +
+Input: row = 2, col = 2, cells = [[1,1],[1,2],[2,1],[2,2]]
+Output: 1
+Explanation: The above image depicts how the matrix changes each day starting from day 0.
+The last day where it is possible to cross from top to bottom is on day 1.
+
+ +

Example 3:

+ +
+Input: row = 3, col = 3, cells = [[1,2],[2,1],[3,3],[2,2],[1,1],[1,3],[2,3],[3,2],[3,1]]
+Output: 3
+Explanation: The above image depicts how the matrix changes each day starting from day 0.
+The last day where it is possible to cross from top to bottom is on day 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= row, col <= 2 * 104
    • +
  • 4 <= row * col <= 2 * 104
    • +
  • cells.length == row * col
    • +
  • 1 <= ri <= row
    • +
  • 1 <= ci <= col
    • +
  • All the values of cells are unique.
    • +
+",3.0,False,"class Solution { +public: + int latestDayToCross(int row, int col, vector>& cells) { + + } +};","class Solution { + public int latestDayToCross(int row, int col, int[][] cells) { + + } +}","class Solution(object): + def latestDayToCross(self, row, col, cells): + """""" + :type row: int + :type col: int + :type cells: List[List[int]] + :rtype: int + """""" + ","class Solution: + def latestDayToCross(self, row: int, col: int, cells: List[List[int]]) -> int: + ","int latestDayToCross(int row, int col, int** cells, int cellsSize, int* cellsColSize){ + +}","public class Solution { + public int LatestDayToCross(int row, int col, int[][] cells) { + + } +}","/** + * @param {number} row + * @param {number} col + * @param {number[][]} cells + * @return {number} + */ +var latestDayToCross = function(row, col, cells) { + +};","# @param {Integer} row +# @param {Integer} col +# @param {Integer[][]} cells +# @return {Integer} +def latest_day_to_cross(row, col, cells) + +end","class Solution { + func latestDayToCross(_ row: Int, _ col: Int, _ cells: [[Int]]) -> Int { + + } +}","func latestDayToCross(row int, col int, cells [][]int) int { + +}","object Solution { + def latestDayToCross(row: Int, col: Int, cells: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun latestDayToCross(row: Int, col: Int, cells: Array): Int { + + } +}","impl Solution { + pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $row + * @param Integer $col + * @param Integer[][] $cells + * @return Integer + */ + function latestDayToCross($row, $col, $cells) { + + } +}","function latestDayToCross(row: number, col: number, cells: number[][]): number { + +};","(define/contract (latest-day-to-cross row col cells) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec latest_day_to_cross(Row :: integer(), Col :: integer(), Cells :: [[integer()]]) -> integer(). +latest_day_to_cross(Row, Col, Cells) -> + .","defmodule Solution do + @spec latest_day_to_cross(row :: integer, col :: integer, cells :: [[integer]]) :: integer + def latest_day_to_cross(row, col, cells) do + + end +end","class Solution { + int latestDayToCross(int row, int col, List> cells) { + + } +}", +600,minimum-non-zero-product-of-the-array-elements,Minimum Non-Zero Product of the Array Elements,1969.0,2100.0,"

You are given a positive integer p. Consider an array nums (1-indexed) that consists of the integers in the inclusive range [1, 2p - 1] in their binary representations. You are allowed to do the following operation any number of times:

+ +
    +
  • Choose two elements x and y from nums.
    • +
  • Choose a bit in x and swap it with its corresponding bit in y. Corresponding bit refers to the bit that is in the same position in the other integer.
    • +
+ +

For example, if x = 1101 and y = 0011, after swapping the 2nd bit from the right, we have x = 1111 and y = 0001.

+ +

Find the minimum non-zero product of nums after performing the above operation any number of times. Return this product modulo 109 + 7.

+ +

Note: The answer should be the minimum product before the modulo operation is done.

+ +

 

+

Example 1:

+ +
+Input: p = 1
+Output: 1
+Explanation: nums = [1].
+There is only one element, so the product equals that element.
+
+ +

Example 2:

+ +
+Input: p = 2
+Output: 6
+Explanation: nums = [01, 10, 11].
+Any swap would either make the product 0 or stay the same.
+Thus, the array product of 1 * 2 * 3 = 6 is already minimized.
+
+ +

Example 3:

+ +
+Input: p = 3
+Output: 1512
+Explanation: nums = [001, 010, 011, 100, 101, 110, 111]
+- In the first operation we can swap the leftmost bit of the second and fifth elements.
+    - The resulting array is [001, 110, 011, 100, 001, 110, 111].
+- In the second operation we can swap the middle bit of the third and fourth elements.
+    - The resulting array is [001, 110, 001, 110, 001, 110, 111].
+The array product is 1 * 6 * 1 * 6 * 1 * 6 * 7 = 1512, which is the minimum possible product.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= p <= 60
    • +
+",2.0,False,"class Solution { +public: + int minNonZeroProduct(int p) { + + } +};","class Solution { + public int minNonZeroProduct(int p) { + + } +}","class Solution(object): + def minNonZeroProduct(self, p): + """""" + :type p: int + :rtype: int + """""" + ","class Solution: + def minNonZeroProduct(self, p: int) -> int: + ","int minNonZeroProduct(int p){ + +}","public class Solution { + public int MinNonZeroProduct(int p) { + + } +}","/** + * @param {number} p + * @return {number} + */ +var minNonZeroProduct = function(p) { + +};","# @param {Integer} p +# @return {Integer} +def min_non_zero_product(p) + +end","class Solution { + func minNonZeroProduct(_ p: Int) -> Int { + + } +}","func minNonZeroProduct(p int) int { + +}","object Solution { + def minNonZeroProduct(p: Int): Int = { + + } +}","class Solution { + fun minNonZeroProduct(p: Int): Int { + + } +}","impl Solution { + pub fn min_non_zero_product(p: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $p + * @return Integer + */ + function minNonZeroProduct($p) { + + } +}","function minNonZeroProduct(p: number): number { + +};","(define/contract (min-non-zero-product p) + (-> exact-integer? exact-integer?) + + )","-spec min_non_zero_product(P :: integer()) -> integer(). +min_non_zero_product(P) -> + .","defmodule Solution do + @spec min_non_zero_product(p :: integer) :: integer + def min_non_zero_product(p) do + + end +end","class Solution { + int minNonZeroProduct(int p) { + + } +}", +602,find-the-longest-valid-obstacle-course-at-each-position,Find the Longest Valid Obstacle Course at Each Position,1964.0,2096.0,"

You want to build some obstacle courses. You are given a 0-indexed integer array obstacles of length n, where obstacles[i] describes the height of the ith obstacle.

+ +

For every index i between 0 and n - 1 (inclusive), find the length of the longest obstacle course in obstacles such that:

+ +
    +
  • You choose any number of obstacles between 0 and i inclusive.
    • +
  • You must include the ith obstacle in the course.
    • +
  • You must put the chosen obstacles in the same order as they appear in obstacles.
    • +
  • Every obstacle (except the first) is taller than or the same height as the obstacle immediately before it.
    • +
+ +

Return an array ans of length n, where ans[i] is the length of the longest obstacle course for index i as described above.

+ +

 

+

Example 1:

+ +
+Input: obstacles = [1,2,3,2]
+Output: [1,2,3,3]
+Explanation: The longest valid obstacle course at each position is:
+- i = 0: [1], [1] has length 1.
+- i = 1: [1,2], [1,2] has length 2.
+- i = 2: [1,2,3], [1,2,3] has length 3.
+- i = 3: [1,2,3,2], [1,2,2] has length 3.
+
+ +

Example 2:

+ +
+Input: obstacles = [2,2,1]
+Output: [1,2,1]
+Explanation: The longest valid obstacle course at each position is:
+- i = 0: [2], [2] has length 1.
+- i = 1: [2,2], [2,2] has length 2.
+- i = 2: [2,2,1], [1] has length 1.
+
+ +

Example 3:

+ +
+Input: obstacles = [3,1,5,6,4,2]
+Output: [1,1,2,3,2,2]
+Explanation: The longest valid obstacle course at each position is:
+- i = 0: [3], [3] has length 1.
+- i = 1: [3,1], [1] has length 1.
+- i = 2: [3,1,5], [3,5] has length 2. [1,5] is also valid.
+- i = 3: [3,1,5,6], [3,5,6] has length 3. [1,5,6] is also valid.
+- i = 4: [3,1,5,6,4], [3,4] has length 2. [1,4] is also valid.
+- i = 5: [3,1,5,6,4,2], [1,2] has length 2.
+
+ +

 

+

Constraints:

+ +
    +
  • n == obstacles.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= obstacles[i] <= 107
    • +
+",3.0,False,"class Solution { +public: + vector longestObstacleCourseAtEachPosition(vector& obstacles) { + + } +};","class Solution { + public int[] longestObstacleCourseAtEachPosition(int[] obstacles) { + + } +}","class Solution(object): + def longestObstacleCourseAtEachPosition(self, obstacles): + """""" + :type obstacles: List[int] + :rtype: List[int] + """""" + ","class Solution: + def longestObstacleCourseAtEachPosition(self, obstacles: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* longestObstacleCourseAtEachPosition(int* obstacles, int obstaclesSize, int* returnSize){ + +}","public class Solution { + public int[] LongestObstacleCourseAtEachPosition(int[] obstacles) { + + } +}","/** + * @param {number[]} obstacles + * @return {number[]} + */ +var longestObstacleCourseAtEachPosition = function(obstacles) { + +};","# @param {Integer[]} obstacles +# @return {Integer[]} +def longest_obstacle_course_at_each_position(obstacles) + +end","class Solution { + func longestObstacleCourseAtEachPosition(_ obstacles: [Int]) -> [Int] { + + } +}","func longestObstacleCourseAtEachPosition(obstacles []int) []int { + +}","object Solution { + def longestObstacleCourseAtEachPosition(obstacles: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun longestObstacleCourseAtEachPosition(obstacles: IntArray): IntArray { + + } +}","impl Solution { + pub fn longest_obstacle_course_at_each_position(obstacles: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $obstacles + * @return Integer[] + */ + function longestObstacleCourseAtEachPosition($obstacles) { + + } +}","function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] { + +};","(define/contract (longest-obstacle-course-at-each-position obstacles) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec longest_obstacle_course_at_each_position(Obstacles :: [integer()]) -> [integer()]. +longest_obstacle_course_at_each_position(Obstacles) -> + .","defmodule Solution do + @spec longest_obstacle_course_at_each_position(obstacles :: [integer]) :: [integer] + def longest_obstacle_course_at_each_position(obstacles) do + + end +end","class Solution { + List longestObstacleCourseAtEachPosition(List obstacles) { + + } +}", +606,number-of-ways-to-separate-numbers,Number of Ways to Separate Numbers,1977.0,2091.0,"

You wrote down many positive integers in a string called num. However, you realized that you forgot to add commas to seperate the different numbers. You remember that the list of integers was non-decreasing and that no integer had leading zeros.

+ +

Return the number of possible lists of integers that you could have written down to get the string num. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: num = "327"
+Output: 2
+Explanation: You could have written down the numbers:
+3, 27
+327
+
+ +

Example 2:

+ +
+Input: num = "094"
+Output: 0
+Explanation: No numbers can have leading zeros and all numbers must be positive.
+
+ +

Example 3:

+ +
+Input: num = "0"
+Output: 0
+Explanation: No numbers can have leading zeros and all numbers must be positive.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num.length <= 3500
    • +
  • num consists of digits '0' through '9'.
    • +
+",3.0,False,"class Solution { +public: + int numberOfCombinations(string num) { + + } +};","class Solution { + public int numberOfCombinations(String num) { + + } +}","class Solution(object): + def numberOfCombinations(self, num): + """""" + :type num: str + :rtype: int + """""" + ","class Solution: + def numberOfCombinations(self, num: str) -> int: + ","int numberOfCombinations(char * num){ + +}","public class Solution { + public int NumberOfCombinations(string num) { + + } +}","/** + * @param {string} num + * @return {number} + */ +var numberOfCombinations = function(num) { + +};","# @param {String} num +# @return {Integer} +def number_of_combinations(num) + +end","class Solution { + func numberOfCombinations(_ num: String) -> Int { + + } +}","func numberOfCombinations(num string) int { + +}","object Solution { + def numberOfCombinations(num: String): Int = { + + } +}","class Solution { + fun numberOfCombinations(num: String): Int { + + } +}","impl Solution { + pub fn number_of_combinations(num: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $num + * @return Integer + */ + function numberOfCombinations($num) { + + } +}","function numberOfCombinations(num: string): number { + +};","(define/contract (number-of-combinations num) + (-> string? exact-integer?) + + )","-spec number_of_combinations(Num :: unicode:unicode_binary()) -> integer(). +number_of_combinations(Num) -> + .","defmodule Solution do + @spec number_of_combinations(num :: String.t) :: integer + def number_of_combinations(num) do + + end +end","class Solution { + int numberOfCombinations(String num) { + + } +}", +607,number-of-ways-to-arrive-at-destination,Number of Ways to Arrive at Destination,1976.0,2090.0,"

You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. The inputs are generated such that you can reach any intersection from any other intersection and that there is at most one road between any two intersections.

+ +

You are given an integer n and a 2D integer array roads where roads[i] = [ui, vi, timei] means that there is a road between intersections ui and vi that takes timei minutes to travel. You want to know in how many ways you can travel from intersection 0 to intersection n - 1 in the shortest amount of time.

+ +

Return the number of ways you can arrive at your destination in the shortest amount of time. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 7, roads = [[0,6,7],[0,1,2],[1,2,3],[1,3,3],[6,3,3],[3,5,1],[6,5,1],[2,5,1],[0,4,5],[4,6,2]]
+Output: 4
+Explanation: The shortest amount of time it takes to go from intersection 0 to intersection 6 is 7 minutes.
+The four ways to get there in 7 minutes are:
+- 0 ➝ 6
+- 0 ➝ 4 ➝ 6
+- 0 ➝ 1 ➝ 2 ➝ 5 ➝ 6
+- 0 ➝ 1 ➝ 3 ➝ 5 ➝ 6
+
+ +

Example 2:

+ +
+Input: n = 2, roads = [[1,0,10]]
+Output: 1
+Explanation: There is only one way to go from intersection 0 to intersection 1, and it takes 10 minutes.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 200
    • +
  • n - 1 <= roads.length <= n * (n - 1) / 2
    • +
  • roads[i].length == 3
    • +
  • 0 <= ui, vi <= n - 1
    • +
  • 1 <= timei <= 109
    • +
  • ui != vi
    • +
  • There is at most one road connecting any two intersections.
    • +
  • You can reach any intersection from any other intersection.
    • +
+",2.0,False,"class Solution { +public: + int countPaths(int n, vector>& roads) { + + } +};","class Solution { + public int countPaths(int n, int[][] roads) { + + } +}","class Solution(object): + def countPaths(self, n, roads): + """""" + :type n: int + :type roads: List[List[int]] + :rtype: int + """""" + ","class Solution: + def countPaths(self, n: int, roads: List[List[int]]) -> int: + ","int countPaths(int n, int** roads, int roadsSize, int* roadsColSize){ + +}","public class Solution { + public int CountPaths(int n, int[][] roads) { + + } +}","/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +var countPaths = function(n, roads) { + +};","# @param {Integer} n +# @param {Integer[][]} roads +# @return {Integer} +def count_paths(n, roads) + +end","class Solution { + func countPaths(_ n: Int, _ roads: [[Int]]) -> Int { + + } +}","func countPaths(n int, roads [][]int) int { + +}","object Solution { + def countPaths(n: Int, roads: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun countPaths(n: Int, roads: Array): Int { + + } +}","impl Solution { + pub fn count_paths(n: i32, roads: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $roads + * @return Integer + */ + function countPaths($n, $roads) { + + } +}","function countPaths(n: number, roads: number[][]): number { + +};","(define/contract (count-paths n roads) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec count_paths(N :: integer(), Roads :: [[integer()]]) -> integer(). +count_paths(N, Roads) -> + .","defmodule Solution do + @spec count_paths(n :: integer, roads :: [[integer]]) :: integer + def count_paths(n, roads) do + + end +end","class Solution { + int countPaths(int n, List> roads) { + + } +}", +609,minimum-time-to-type-word-using-special-typewriter,Minimum Time to Type Word Using Special Typewriter,1974.0,2088.0,"

There is a special typewriter with lowercase English letters 'a' to 'z' arranged in a circle with a pointer. A character can only be typed if the pointer is pointing to that character. The pointer is initially pointing to the character 'a'.

+ +

Each second, you may perform one of the following operations:

+ +
    +
  • Move the pointer one character counterclockwise or clockwise.
    • +
  • Type the character the pointer is currently on.
    • +
+ +

Given a string word, return the minimum number of seconds to type out the characters in word.

+ +

 

+

Example 1:

+ +
+Input: word = "abc"
+Output: 5
+Explanation: 
+The characters are printed as follows:
+- Type the character 'a' in 1 second since the pointer is initially on 'a'.
+- Move the pointer clockwise to 'b' in 1 second.
+- Type the character 'b' in 1 second.
+- Move the pointer clockwise to 'c' in 1 second.
+- Type the character 'c' in 1 second.
+
+ +

Example 2:

+ +
+Input: word = "bza"
+Output: 7
+Explanation:
+The characters are printed as follows:
+- Move the pointer clockwise to 'b' in 1 second.
+- Type the character 'b' in 1 second.
+- Move the pointer counterclockwise to 'z' in 2 seconds.
+- Type the character 'z' in 1 second.
+- Move the pointer clockwise to 'a' in 1 second.
+- Type the character 'a' in 1 second.
+
+ +

Example 3:

+ +
+Input: word = "zjpc"
+Output: 34
+Explanation:
+The characters are printed as follows:
+- Move the pointer counterclockwise to 'z' in 1 second.
+- Type the character 'z' in 1 second.
+- Move the pointer clockwise to 'j' in 10 seconds.
+- Type the character 'j' in 1 second.
+- Move the pointer clockwise to 'p' in 6 seconds.
+- Type the character 'p' in 1 second.
+- Move the pointer counterclockwise to 'c' in 13 seconds.
+- Type the character 'c' in 1 second.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length <= 100
    • +
  • word consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + int minTimeToType(string word) { + + } +};","class Solution { + public int minTimeToType(String word) { + + } +}","class Solution(object): + def minTimeToType(self, word): + """""" + :type word: str + :rtype: int + """""" + ","class Solution: + def minTimeToType(self, word: str) -> int: + ","int minTimeToType(char * word){ + +}","public class Solution { + public int MinTimeToType(string word) { + + } +}","/** + * @param {string} word + * @return {number} + */ +var minTimeToType = function(word) { + +};","# @param {String} word +# @return {Integer} +def min_time_to_type(word) + +end","class Solution { + func minTimeToType(_ word: String) -> Int { + + } +}","func minTimeToType(word string) int { + +}","object Solution { + def minTimeToType(word: String): Int = { + + } +}","class Solution { + fun minTimeToType(word: String): Int { + + } +}","impl Solution { + pub fn min_time_to_type(word: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word + * @return Integer + */ + function minTimeToType($word) { + + } +}","function minTimeToType(word: string): number { + +};","(define/contract (min-time-to-type word) + (-> string? exact-integer?) + + )","-spec min_time_to_type(Word :: unicode:unicode_binary()) -> integer(). +min_time_to_type(Word) -> + .","defmodule Solution do + @spec min_time_to_type(word :: String.t) :: integer + def min_time_to_type(word) do + + end +end","class Solution { + int minTimeToType(String word) { + + } +}", +610,count-number-of-special-subsequences,Count Number of Special Subsequences,1955.0,2086.0,"

A sequence is special if it consists of a positive number of 0s, followed by a positive number of 1s, then a positive number of 2s.

+ +
    +
  • For example, [0,1,2] and [0,0,1,1,1,2] are special.
    • +
  • In contrast, [2,1,0], [1], and [0,1,2,0] are not special.
    • +
+ +

Given an array nums (consisting of only integers 0, 1, and 2), return the number of different subsequences that are special. Since the answer may be very large, return it modulo 109 + 7.

+ +

A subsequence of an array is a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements. Two subsequences are different if the set of indices chosen are different.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,2,2]
+Output: 3
+Explanation: The special subsequences are bolded [0,1,2,2], [0,1,2,2], and [0,1,2,2].
+
+ +

Example 2:

+ +
+Input: nums = [2,2,0,0]
+Output: 0
+Explanation: There are no special subsequences in [2,2,0,0].
+
+ +

Example 3:

+ +
+Input: nums = [0,1,2,0,1,2]
+Output: 7
+Explanation: The special subsequences are bolded:
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+- [0,1,2,0,1,2]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 2
    • +
+",3.0,False,"class Solution { +public: + int countSpecialSubsequences(vector& nums) { + + } +};","class Solution { + public int countSpecialSubsequences(int[] nums) { + + } +}","class Solution(object): + def countSpecialSubsequences(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countSpecialSubsequences(self, nums: List[int]) -> int: + ","int countSpecialSubsequences(int* nums, int numsSize){ + +}","public class Solution { + public int CountSpecialSubsequences(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countSpecialSubsequences = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_special_subsequences(nums) + +end","class Solution { + func countSpecialSubsequences(_ nums: [Int]) -> Int { + + } +}","func countSpecialSubsequences(nums []int) int { + +}","object Solution { + def countSpecialSubsequences(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countSpecialSubsequences(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_special_subsequences(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countSpecialSubsequences($nums) { + + } +}","function countSpecialSubsequences(nums: number[]): number { + +};","(define/contract (count-special-subsequences nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_special_subsequences(Nums :: [integer()]) -> integer(). +count_special_subsequences(Nums) -> + .","defmodule Solution do + @spec count_special_subsequences(nums :: [integer]) :: integer + def count_special_subsequences(nums) do + + end +end","class Solution { + int countSpecialSubsequences(List nums) { + + } +}", +611,array-with-elements-not-equal-to-average-of-neighbors,Array With Elements Not Equal to Average of Neighbors,1968.0,2085.0,"

You are given a 0-indexed array nums of distinct integers. You want to rearrange the elements in the array such that every element in the rearranged array is not equal to the average of its neighbors.

+ +

More formally, the rearranged array should have the property such that for every i in the range 1 <= i < nums.length - 1, (nums[i-1] + nums[i+1]) / 2 is not equal to nums[i].

+ +

Return any rearrangement of nums that meets the requirements.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5]
+Output: [1,2,4,5,3]
+Explanation:
+When i=1, nums[i] = 2, and the average of its neighbors is (1+4) / 2 = 2.5.
+When i=2, nums[i] = 4, and the average of its neighbors is (2+5) / 2 = 3.5.
+When i=3, nums[i] = 5, and the average of its neighbors is (4+3) / 2 = 3.5.
+
+ +

Example 2:

+ +
+Input: nums = [6,2,0,9,7]
+Output: [9,7,6,2,0]
+Explanation:
+When i=1, nums[i] = 7, and the average of its neighbors is (9+6) / 2 = 7.5.
+When i=2, nums[i] = 6, and the average of its neighbors is (7+2) / 2 = 4.5.
+When i=3, nums[i] = 2, and the average of its neighbors is (6+0) / 2 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + vector rearrangeArray(vector& nums) { + + } +};","class Solution { + public int[] rearrangeArray(int[] nums) { + + } +}","class Solution(object): + def rearrangeArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def rearrangeArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* rearrangeArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] RearrangeArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var rearrangeArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def rearrange_array(nums) + +end","class Solution { + func rearrangeArray(_ nums: [Int]) -> [Int] { + + } +}","func rearrangeArray(nums []int) []int { + +}","object Solution { + def rearrangeArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun rearrangeArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn rearrange_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function rearrangeArray($nums) { + + } +}","function rearrangeArray(nums: number[]): number[] { + +};","(define/contract (rearrange-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec rearrange_array(Nums :: [integer()]) -> [integer()]. +rearrange_array(Nums) -> + .","defmodule Solution do + @spec rearrange_array(nums :: [integer]) :: [integer] + def rearrange_array(nums) do + + end +end","class Solution { + List rearrangeArray(List nums) { + + } +}", +614,minimum-total-space-wasted-with-k-resizing-operations,Minimum Total Space Wasted With K Resizing Operations,1959.0,2081.0,"

You are currently designing a dynamic array. You are given a 0-indexed integer array nums, where nums[i] is the number of elements that will be in the array at time i. In addition, you are given an integer k, the maximum number of times you can resize the array (to any size).

+ +

The size of the array at time t, sizet, must be at least nums[t] because there needs to be enough space in the array to hold all the elements. The space wasted at time t is defined as sizet - nums[t], and the total space wasted is the sum of the space wasted across every time t where 0 <= t < nums.length.

+ +

Return the minimum total space wasted if you can resize the array at most k times.

+ +

Note: The array can have any size at the start and does not count towards the number of resizing operations.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,20], k = 0
+Output: 10
+Explanation: size = [20,20].
+We can set the initial size to be 20.
+The total wasted space is (20 - 10) + (20 - 20) = 10.
+
+ +

Example 2:

+ +
+Input: nums = [10,20,30], k = 1
+Output: 10
+Explanation: size = [20,20,30].
+We can set the initial size to be 20 and resize to 30 at time 2. 
+The total wasted space is (20 - 10) + (20 - 20) + (30 - 30) = 10.
+
+ +

Example 3:

+ +
+Input: nums = [10,20,15,30,20], k = 2
+Output: 15
+Explanation: size = [10,20,20,30,30].
+We can set the initial size to 10, resize to 20 at time 1, and resize to 30 at time 3.
+The total wasted space is (10 - 10) + (20 - 20) + (20 - 15) + (30 - 30) + (30 - 20) = 15.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 200
    • +
  • 1 <= nums[i] <= 106
    • +
  • 0 <= k <= nums.length - 1
    • +
+",2.0,False,"class Solution { +public: + int minSpaceWastedKResizing(vector& nums, int k) { + + } +};","class Solution { + public int minSpaceWastedKResizing(int[] nums, int k) { + + } +}","class Solution(object): + def minSpaceWastedKResizing(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minSpaceWastedKResizing(self, nums: List[int], k: int) -> int: + ","int minSpaceWastedKResizing(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinSpaceWastedKResizing(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minSpaceWastedKResizing = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_space_wasted_k_resizing(nums, k) + +end","class Solution { + func minSpaceWastedKResizing(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minSpaceWastedKResizing(nums []int, k int) int { + +}","object Solution { + def minSpaceWastedKResizing(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minSpaceWastedKResizing(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_space_wasted_k_resizing(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minSpaceWastedKResizing($nums, $k) { + + } +}","function minSpaceWastedKResizing(nums: number[], k: number): number { + +};","(define/contract (min-space-wasted-k-resizing nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_space_wasted_k_resizing(Nums :: [integer()], K :: integer()) -> integer(). +min_space_wasted_k_resizing(Nums, K) -> + .","defmodule Solution do + @spec min_space_wasted_k_resizing(nums :: [integer], k :: integer) :: integer + def min_space_wasted_k_resizing(nums, k) do + + end +end","class Solution { + int minSpaceWastedKResizing(List nums, int k) { + + } +}", +616,delete-duplicate-folders-in-system,Delete Duplicate Folders in System,1948.0,2079.0,"

Due to a bug, there are many duplicate folders in a file system. You are given a 2D array paths, where paths[i] is an array representing an absolute path to the ith folder in the file system.

+ +
    +
  • For example, ["one", "two", "three"] represents the path "/one/two/three".
    • +
+ +

Two folders (not necessarily on the same level) are identical if they contain the same non-empty set of identical subfolders and underlying subfolder structure. The folders do not need to be at the root level to be identical. If two or more folders are identical, then mark the folders as well as all their subfolders.

+ +
    +
  • For example, folders "/a" and "/b" in the file structure below are identical. They (as well as their subfolders) should all be marked: + +
      +
    • /a
      • +
    • /a/x
      • +
    • /a/x/y
      • +
    • /a/z
      • +
    • /b
      • +
    • /b/x
      • +
    • /b/x/y
      • +
    • /b/z
      • +
    +
    • +
  • However, if the file structure also included the path "/b/w", then the folders "/a" and "/b" would not be identical. Note that "/a/x" and "/b/x" would still be considered identical even with the added folder.
    • +
+ +

Once all the identical folders and their subfolders have been marked, the file system will delete all of them. The file system only runs the deletion once, so any folders that become identical after the initial deletion are not deleted.

+ +

Return the 2D array ans containing the paths of the remaining folders after deleting all the marked folders. The paths may be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: paths = [["a"],["c"],["d"],["a","b"],["c","b"],["d","a"]]
+Output: [["d"],["d","a"]]
+Explanation: The file structure is as shown.
+Folders "/a" and "/c" (and their subfolders) are marked for deletion because they both contain an empty
+folder named "b".
+
+ +

Example 2:

+ +
+Input: paths = [["a"],["c"],["a","b"],["c","b"],["a","b","x"],["a","b","x","y"],["w"],["w","y"]]
+Output: [["c"],["c","b"],["a"],["a","b"]]
+Explanation: The file structure is as shown. 
+Folders "/a/b/x" and "/w" (and their subfolders) are marked for deletion because they both contain an empty folder named "y".
+Note that folders "/a" and "/c" are identical after the deletion, but they are not deleted because they were not marked beforehand.
+
+ +

Example 3:

+ +
+Input: paths = [["a","b"],["c","d"],["c"],["a"]]
+Output: [["c"],["c","d"],["a"],["a","b"]]
+Explanation: All folders are unique in the file system.
+Note that the returned array can be in a different order as the order does not matter.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= paths.length <= 2 * 104
    • +
  • 1 <= paths[i].length <= 500
    • +
  • 1 <= paths[i][j].length <= 10
    • +
  • 1 <= sum(paths[i][j].length) <= 2 * 105
    • +
  • path[i][j] consists of lowercase English letters.
    • +
  • No two paths lead to the same folder.
    • +
  • For any folder not at the root level, its parent folder will also be in the input.
    • +
+",3.0,False,"class Solution { +public: + vector> deleteDuplicateFolder(vector>& paths) { + + } +};","class Solution { + public List> deleteDuplicateFolder(List> paths) { + + } +}","class Solution(object): + def deleteDuplicateFolder(self, paths): + """""" + :type paths: List[List[str]] + :rtype: List[List[str]] + """""" + ","class Solution: + def deleteDuplicateFolder(self, paths: List[List[str]]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** deleteDuplicateFolder(char *** paths, int pathsSize, int* pathsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> DeleteDuplicateFolder(IList> paths) { + + } +}","/** + * @param {string[][]} paths + * @return {string[][]} + */ +var deleteDuplicateFolder = function(paths) { + +};","# @param {String[][]} paths +# @return {String[][]} +def delete_duplicate_folder(paths) + +end","class Solution { + func deleteDuplicateFolder(_ paths: [[String]]) -> [[String]] { + + } +}","func deleteDuplicateFolder(paths [][]string) [][]string { + +}","object Solution { + def deleteDuplicateFolder(paths: List[List[String]]): List[List[String]] = { + + } +}","class Solution { + fun deleteDuplicateFolder(paths: List>): List> { + + } +}","impl Solution { + pub fn delete_duplicate_folder(paths: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param String[][] $paths + * @return String[][] + */ + function deleteDuplicateFolder($paths) { + + } +}","function deleteDuplicateFolder(paths: string[][]): string[][] { + +};","(define/contract (delete-duplicate-folder paths) + (-> (listof (listof string?)) (listof (listof string?))) + + )","-spec delete_duplicate_folder(Paths :: [[unicode:unicode_binary()]]) -> [[unicode:unicode_binary()]]. +delete_duplicate_folder(Paths) -> + .","defmodule Solution do + @spec delete_duplicate_folder(paths :: [[String.t]]) :: [[String.t]] + def delete_duplicate_folder(paths) do + + end +end","class Solution { + List> deleteDuplicateFolder(List> paths) { + + } +}", +617,maximum-compatibility-score-sum,Maximum Compatibility Score Sum,1947.0,2078.0,"

There is a survey that consists of n questions where each question's answer is either 0 (no) or 1 (yes).

+ +

The survey was given to m students numbered from 0 to m - 1 and m mentors numbered from 0 to m - 1. The answers of the students are represented by a 2D integer array students where students[i] is an integer array that contains the answers of the ith student (0-indexed). The answers of the mentors are represented by a 2D integer array mentors where mentors[j] is an integer array that contains the answers of the jth mentor (0-indexed).

+ +

Each student will be assigned to one mentor, and each mentor will have one student assigned to them. The compatibility score of a student-mentor pair is the number of answers that are the same for both the student and the mentor.

+ +
    +
  • For example, if the student's answers were [1, 0, 1] and the mentor's answers were [0, 0, 1], then their compatibility score is 2 because only the second and the third answers are the same.
    • +
+ +

You are tasked with finding the optimal student-mentor pairings to maximize the sum of the compatibility scores.

+ +

Given students and mentors, return the maximum compatibility score sum that can be achieved.

+ +

 

+

Example 1:

+ +
+Input: students = [[1,1,0],[1,0,1],[0,0,1]], mentors = [[1,0,0],[0,0,1],[1,1,0]]
+Output: 8
+Explanation: We assign students to mentors in the following way:
+- student 0 to mentor 2 with a compatibility score of 3.
+- student 1 to mentor 0 with a compatibility score of 2.
+- student 2 to mentor 1 with a compatibility score of 3.
+The compatibility score sum is 3 + 2 + 3 = 8.
+
+ +

Example 2:

+ +
+Input: students = [[0,0],[0,0],[0,0]], mentors = [[1,1],[1,1],[1,1]]
+Output: 0
+Explanation: The compatibility score of any student-mentor pair is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • m == students.length == mentors.length
    • +
  • n == students[i].length == mentors[j].length
    • +
  • 1 <= m, n <= 8
    • +
  • students[i][k] is either 0 or 1.
    • +
  • mentors[j][k] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int maxCompatibilitySum(vector>& students, vector>& mentors) { + + } +};","class Solution { + public int maxCompatibilitySum(int[][] students, int[][] mentors) { + + } +}","class Solution(object): + def maxCompatibilitySum(self, students, mentors): + """""" + :type students: List[List[int]] + :type mentors: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxCompatibilitySum(self, students: List[List[int]], mentors: List[List[int]]) -> int: + ","int maxCompatibilitySum(int** students, int studentsSize, int* studentsColSize, int** mentors, int mentorsSize, int* mentorsColSize){ + +}","public class Solution { + public int MaxCompatibilitySum(int[][] students, int[][] mentors) { + + } +}","/** + * @param {number[][]} students + * @param {number[][]} mentors + * @return {number} + */ +var maxCompatibilitySum = function(students, mentors) { + +};","# @param {Integer[][]} students +# @param {Integer[][]} mentors +# @return {Integer} +def max_compatibility_sum(students, mentors) + +end","class Solution { + func maxCompatibilitySum(_ students: [[Int]], _ mentors: [[Int]]) -> Int { + + } +}","func maxCompatibilitySum(students [][]int, mentors [][]int) int { + +}","object Solution { + def maxCompatibilitySum(students: Array[Array[Int]], mentors: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxCompatibilitySum(students: Array, mentors: Array): Int { + + } +}","impl Solution { + pub fn max_compatibility_sum(students: Vec>, mentors: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $students + * @param Integer[][] $mentors + * @return Integer + */ + function maxCompatibilitySum($students, $mentors) { + + } +}","function maxCompatibilitySum(students: number[][], mentors: number[][]): number { + +};","(define/contract (max-compatibility-sum students mentors) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_compatibility_sum(Students :: [[integer()]], Mentors :: [[integer()]]) -> integer(). +max_compatibility_sum(Students, Mentors) -> + .","defmodule Solution do + @spec max_compatibility_sum(students :: [[integer]], mentors :: [[integer]]) :: integer + def max_compatibility_sum(students, mentors) do + + end +end","class Solution { + int maxCompatibilitySum(List> students, List> mentors) { + + } +}", +618,largest-number-after-mutating-substring,Largest Number After Mutating Substring,1946.0,2077.0,"

You are given a string num, which represents a large integer. You are also given a 0-indexed integer array change of length 10 that maps each digit 0-9 to another digit. More formally, digit d maps to digit change[d].

+ +

You may choose to mutate a single substring of num. To mutate a substring, replace each digit num[i] with the digit it maps to in change (i.e. replace num[i] with change[num[i]]).

+ +

Return a string representing the largest possible integer after mutating (or choosing not to) a single substring of num.

+ +

A substring is a contiguous sequence of characters within the string.

+ +

 

+

Example 1:

+ +
+Input: num = "132", change = [9,8,5,0,3,6,4,2,6,8]
+Output: "832"
+Explanation: Replace the substring "1":
+- 1 maps to change[1] = 8.
+Thus, "132" becomes "832".
+"832" is the largest number that can be created, so return it.
+
+ +

Example 2:

+ +
+Input: num = "021", change = [9,4,3,5,7,2,1,9,0,6]
+Output: "934"
+Explanation: Replace the substring "021":
+- 0 maps to change[0] = 9.
+- 2 maps to change[2] = 3.
+- 1 maps to change[1] = 4.
+Thus, "021" becomes "934".
+"934" is the largest number that can be created, so return it.
+
+ +

Example 3:

+ +
+Input: num = "5", change = [1,4,7,5,3,2,5,6,9,4]
+Output: "5"
+Explanation: "5" is already the largest number that can be created, so return it.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num.length <= 105
    • +
  • num consists of only digits 0-9.
    • +
  • change.length == 10
    • +
  • 0 <= change[d] <= 9
    • +
+",2.0,False,"class Solution { +public: + string maximumNumber(string num, vector& change) { + + } +};","class Solution { + public String maximumNumber(String num, int[] change) { + + } +}","class Solution(object): + def maximumNumber(self, num, change): + """""" + :type num: str + :type change: List[int] + :rtype: str + """""" + ","class Solution: + def maximumNumber(self, num: str, change: List[int]) -> str: + ","char * maximumNumber(char * num, int* change, int changeSize){ + +}","public class Solution { + public string MaximumNumber(string num, int[] change) { + + } +}","/** + * @param {string} num + * @param {number[]} change + * @return {string} + */ +var maximumNumber = function(num, change) { + +};","# @param {String} num +# @param {Integer[]} change +# @return {String} +def maximum_number(num, change) + +end","class Solution { + func maximumNumber(_ num: String, _ change: [Int]) -> String { + + } +}","func maximumNumber(num string, change []int) string { + +}","object Solution { + def maximumNumber(num: String, change: Array[Int]): String = { + + } +}","class Solution { + fun maximumNumber(num: String, change: IntArray): String { + + } +}","impl Solution { + pub fn maximum_number(num: String, change: Vec) -> String { + + } +}","class Solution { + + /** + * @param String $num + * @param Integer[] $change + * @return String + */ + function maximumNumber($num, $change) { + + } +}","function maximumNumber(num: string, change: number[]): string { + +};","(define/contract (maximum-number num change) + (-> string? (listof exact-integer?) string?) + + )","-spec maximum_number(Num :: unicode:unicode_binary(), Change :: [integer()]) -> unicode:unicode_binary(). +maximum_number(Num, Change) -> + .","defmodule Solution do + @spec maximum_number(num :: String.t, change :: [integer]) :: String.t + def maximum_number(num, change) do + + end +end","class Solution { + String maximumNumber(String num, List change) { + + } +}", +620,maximum-genetic-difference-query,Maximum Genetic Difference Query,1938.0,2068.0,"

There is a rooted tree consisting of n nodes numbered 0 to n - 1. Each node's number denotes its unique genetic value (i.e. the genetic value of node x is x). The genetic difference between two genetic values is defined as the bitwise-XOR of their values. You are given the integer array parents, where parents[i] is the parent for node i. If node x is the root of the tree, then parents[x] == -1.

+ +

You are also given the array queries where queries[i] = [nodei, vali]. For each query i, find the maximum genetic difference between vali and pi, where pi is the genetic value of any node that is on the path between nodei and the root (including nodei and the root). More formally, you want to maximize vali XOR pi.

+ +

Return an array ans where ans[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: parents = [-1,0,1,1], queries = [[0,2],[3,2],[2,5]]
+Output: [2,3,7]
+Explanation: The queries are processed as follows:
+- [0,2]: The node with the maximum genetic difference is 0, with a difference of 2 XOR 0 = 2.
+- [3,2]: The node with the maximum genetic difference is 1, with a difference of 2 XOR 1 = 3.
+- [2,5]: The node with the maximum genetic difference is 2, with a difference of 5 XOR 2 = 7.
+
+ +

Example 2:

+ +
+Input: parents = [3,7,-1,2,0,7,0,2], queries = [[4,6],[1,15],[0,5]]
+Output: [6,14,7]
+Explanation: The queries are processed as follows:
+- [4,6]: The node with the maximum genetic difference is 0, with a difference of 6 XOR 0 = 6.
+- [1,15]: The node with the maximum genetic difference is 1, with a difference of 15 XOR 1 = 14.
+- [0,5]: The node with the maximum genetic difference is 2, with a difference of 5 XOR 2 = 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= parents.length <= 105
    • +
  • 0 <= parents[i] <= parents.length - 1 for every node i that is not the root.
    • +
  • parents[root] == -1
    • +
  • 1 <= queries.length <= 3 * 104
    • +
  • 0 <= nodei <= parents.length - 1
    • +
  • 0 <= vali <= 2 * 105
    • +
+",3.0,False,"class Solution { +public: + vector maxGeneticDifference(vector& parents, vector>& queries) { + + } +};","class Solution { + public int[] maxGeneticDifference(int[] parents, int[][] queries) { + + } +}","class Solution(object): + def maxGeneticDifference(self, parents, queries): + """""" + :type parents: List[int] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def maxGeneticDifference(self, parents: List[int], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxGeneticDifference(int* parents, int parentsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] MaxGeneticDifference(int[] parents, int[][] queries) { + + } +}","/** + * @param {number[]} parents + * @param {number[][]} queries + * @return {number[]} + */ +var maxGeneticDifference = function(parents, queries) { + +};","# @param {Integer[]} parents +# @param {Integer[][]} queries +# @return {Integer[]} +def max_genetic_difference(parents, queries) + +end","class Solution { + func maxGeneticDifference(_ parents: [Int], _ queries: [[Int]]) -> [Int] { + + } +}","func maxGeneticDifference(parents []int, queries [][]int) []int { + +}","object Solution { + def maxGeneticDifference(parents: Array[Int], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun maxGeneticDifference(parents: IntArray, queries: Array): IntArray { + + } +}","impl Solution { + pub fn max_genetic_difference(parents: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $parents + * @param Integer[][] $queries + * @return Integer[] + */ + function maxGeneticDifference($parents, $queries) { + + } +}","function maxGeneticDifference(parents: number[], queries: number[][]): number[] { + +};","(define/contract (max-genetic-difference parents queries) + (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec max_genetic_difference(Parents :: [integer()], Queries :: [[integer()]]) -> [integer()]. +max_genetic_difference(Parents, Queries) -> + .","defmodule Solution do + @spec max_genetic_difference(parents :: [integer], queries :: [[integer]]) :: [integer] + def max_genetic_difference(parents, queries) do + + end +end","class Solution { + List maxGeneticDifference(List parents, List> queries) { + + } +}", +622,add-minimum-number-of-rungs,Add Minimum Number of Rungs,1936.0,2066.0,"

You are given a strictly increasing integer array rungs that represents the height of rungs on a ladder. You are currently on the floor at height 0, and you want to reach the last rung.

+ +

You are also given an integer dist. You can only climb to the next highest rung if the distance between where you are currently at (the floor or on a rung) and the next rung is at most dist. You are able to insert rungs at any positive integer height if a rung is not already there.

+ +

Return the minimum number of rungs that must be added to the ladder in order for you to climb to the last rung.

+ +

 

+

Example 1:

+ +
+Input: rungs = [1,3,5,10], dist = 2
+Output: 2
+Explanation:
+You currently cannot reach the last rung.
+Add rungs at heights 7 and 8 to climb this ladder. 
+The ladder will now have rungs at [1,3,5,7,8,10].
+
+ +

Example 2:

+ +
+Input: rungs = [3,6,8,10], dist = 3
+Output: 0
+Explanation:
+This ladder can be climbed without adding additional rungs.
+
+ +

Example 3:

+ +
+Input: rungs = [3,4,6,7], dist = 2
+Output: 1
+Explanation:
+You currently cannot reach the first rung from the ground.
+Add a rung at height 1 to climb this ladder.
+The ladder will now have rungs at [1,3,4,6,7].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rungs.length <= 105
    • +
  • 1 <= rungs[i] <= 109
    • +
  • 1 <= dist <= 109
    • +
  • rungs is strictly increasing.
    • +
+",2.0,False,"class Solution { +public: + int addRungs(vector& rungs, int dist) { + + } +};","class Solution { + public int addRungs(int[] rungs, int dist) { + + } +}","class Solution(object): + def addRungs(self, rungs, dist): + """""" + :type rungs: List[int] + :type dist: int + :rtype: int + """""" + ","class Solution: + def addRungs(self, rungs: List[int], dist: int) -> int: + ","int addRungs(int* rungs, int rungsSize, int dist){ + +}","public class Solution { + public int AddRungs(int[] rungs, int dist) { + + } +}","/** + * @param {number[]} rungs + * @param {number} dist + * @return {number} + */ +var addRungs = function(rungs, dist) { + +};","# @param {Integer[]} rungs +# @param {Integer} dist +# @return {Integer} +def add_rungs(rungs, dist) + +end","class Solution { + func addRungs(_ rungs: [Int], _ dist: Int) -> Int { + + } +}","func addRungs(rungs []int, dist int) int { + +}","object Solution { + def addRungs(rungs: Array[Int], dist: Int): Int = { + + } +}","class Solution { + fun addRungs(rungs: IntArray, dist: Int): Int { + + } +}","impl Solution { + pub fn add_rungs(rungs: Vec, dist: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $rungs + * @param Integer $dist + * @return Integer + */ + function addRungs($rungs, $dist) { + + } +}","function addRungs(rungs: number[], dist: number): number { + +};","(define/contract (add-rungs rungs dist) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec add_rungs(Rungs :: [integer()], Dist :: integer()) -> integer(). +add_rungs(Rungs, Dist) -> + .","defmodule Solution do + @spec add_rungs(rungs :: [integer], dist :: integer) :: integer + def add_rungs(rungs, dist) do + + end +end","class Solution { + int addRungs(List rungs, int dist) { + + } +}", +623,painting-a-grid-with-three-different-colors,Painting a Grid With Three Different Colors,1931.0,2061.0,"

You are given two integers m and n. Consider an m x n grid where each cell is initially white. You can paint each cell red, green, or blue. All cells must be painted.

+ +

Return the number of ways to color the grid with no two adjacent cells having the same color. Since the answer can be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: m = 1, n = 1
+Output: 3
+Explanation: The three possible colorings are shown in the image above.
+
+ +

Example 2:

+ +
+Input: m = 1, n = 2
+Output: 6
+Explanation: The six possible colorings are shown in the image above.
+
+ +

Example 3:

+ +
+Input: m = 5, n = 5
+Output: 580986
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m <= 5
    • +
  • 1 <= n <= 1000
    • +
+",3.0,False,"class Solution { +public: + int colorTheGrid(int m, int n) { + + } +};","class Solution { + public int colorTheGrid(int m, int n) { + + } +}","class Solution(object): + def colorTheGrid(self, m, n): + """""" + :type m: int + :type n: int + :rtype: int + """""" + ","class Solution: + def colorTheGrid(self, m: int, n: int) -> int: + ","int colorTheGrid(int m, int n){ + +}","public class Solution { + public int ColorTheGrid(int m, int n) { + + } +}","/** + * @param {number} m + * @param {number} n + * @return {number} + */ +var colorTheGrid = function(m, n) { + +};","# @param {Integer} m +# @param {Integer} n +# @return {Integer} +def color_the_grid(m, n) + +end","class Solution { + func colorTheGrid(_ m: Int, _ n: Int) -> Int { + + } +}","func colorTheGrid(m int, n int) int { + +}","object Solution { + def colorTheGrid(m: Int, n: Int): Int = { + + } +}","class Solution { + fun colorTheGrid(m: Int, n: Int): Int { + + } +}","impl Solution { + pub fn color_the_grid(m: i32, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @return Integer + */ + function colorTheGrid($m, $n) { + + } +}","function colorTheGrid(m: number, n: number): number { + +};","(define/contract (color-the-grid m n) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec color_the_grid(M :: integer(), N :: integer()) -> integer(). +color_the_grid(M, N) -> + .","defmodule Solution do + @spec color_the_grid(m :: integer, n :: integer) :: integer + def color_the_grid(m, n) do + + end +end","class Solution { + int colorTheGrid(int m, int n) { + + } +}", +624,merge-bsts-to-create-single-bst,Merge BSTs to Create Single BST,1932.0,2060.0,"

You are given n BST (binary search tree) root nodes for n separate BSTs stored in an array trees (0-indexed). Each BST in trees has at most 3 nodes, and no two roots have the same value. In one operation, you can:

+ +
    +
  • Select two distinct indices i and j such that the value stored at one of the leaves of trees[i] is equal to the root value of trees[j].
    • +
  • Replace the leaf node in trees[i] with trees[j].
    • +
  • Remove trees[j] from trees.
    • +
+ +

Return the root of the resulting BST if it is possible to form a valid BST after performing n - 1 operations, or null if it is impossible to create a valid BST.

+ +

A BST (binary search tree) is a binary tree where each node satisfies the following property:

+ +
    +
  • Every node in the node's left subtree has a value strictly less than the node's value.
    • +
  • Every node in the node's right subtree has a value strictly greater than the node's value.
    • +
+ +

A leaf is a node that has no children.

+ +

 

+

Example 1:

+ +
+Input: trees = [[2,1],[3,2,5],[5,4]]
+Output: [3,2,5,1,null,4]
+Explanation:
+In the first operation, pick i=1 and j=0, and merge trees[0] into trees[1].
+Delete trees[0], so trees = [[3,2,5,1],[5,4]].
+
+In the second operation, pick i=0 and j=1, and merge trees[1] into trees[0].
+Delete trees[1], so trees = [[3,2,5,1,null,4]].
+
+The resulting tree, shown above, is a valid BST, so return its root.
+ +

Example 2:

+ +
+Input: trees = [[5,3,8],[3,2,6]]
+Output: []
+Explanation:
+Pick i=0 and j=1 and merge trees[1] into trees[0].
+Delete trees[1], so trees = [[5,3,8,2,6]].
+
+The resulting tree is shown above. This is the only valid operation that can be performed, but the resulting tree is not a valid BST, so return null.
+
+ +

Example 3:

+ +
+Input: trees = [[5,4],[3]]
+Output: []
+Explanation: It is impossible to perform any operations.
+
+ +

 

+

Constraints:

+ +
    +
  • n == trees.length
    • +
  • 1 <= n <= 5 * 104
    • +
  • The number of nodes in each tree is in the range [1, 3].
    • +
  • Each node in the input may have children but no grandchildren.
    • +
  • No two roots of trees have the same value.
    • +
  • All the trees in the input are valid BSTs.
    • +
  • 1 <= TreeNode.val <= 5 * 104.
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* canMerge(vector& trees) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode canMerge(List trees) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def canMerge(self, trees): + """""" + :type trees: List[TreeNode] + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def canMerge(self, trees: List[TreeNode]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ + + +struct TreeNode* canMerge(struct TreeNode** trees, int treesSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode CanMerge(IList trees) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode[]} trees + * @return {TreeNode} + */ +var canMerge = function(trees) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode[]} trees +# @return {TreeNode} +def can_merge(trees) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func canMerge(_ trees: [TreeNode?]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func canMerge(trees []*TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def canMerge(trees: List[TreeNode]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun canMerge(trees: List): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn can_merge(trees: Vec>>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode[] $trees + * @return TreeNode + */ + function canMerge($trees) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function canMerge(trees: Array): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (can-merge trees) + (-> (listof (or/c tree-node? #f)) (or/c tree-node? #f)) + + )",,,, +625,unique-length-3-palindromic-subsequences,Unique Length-3 Palindromic Subsequences,1930.0,2059.0,"

Given a string s, return the number of unique palindromes of length three that are a subsequence of s.

+ +

Note that even if there are multiple ways to obtain the same subsequence, it is still only counted once.

+ +

A palindrome is a string that reads the same forwards and backwards.

+ +

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

+ +
    +
  • For example, "ace" is a subsequence of "abcde".
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "aabca"
+Output: 3
+Explanation: The 3 palindromic subsequences of length 3 are:
+- "aba" (subsequence of "aabca")
+- "aaa" (subsequence of "aabca")
+- "aca" (subsequence of "aabca")
+
+ +

Example 2:

+ +
+Input: s = "adc"
+Output: 0
+Explanation: There are no palindromic subsequences of length 3 in "adc".
+
+ +

Example 3:

+ +
+Input: s = "bbcbaba"
+Output: 4
+Explanation: The 4 palindromic subsequences of length 3 are:
+- "bbb" (subsequence of "bbcbaba")
+- "bcb" (subsequence of "bbcbaba")
+- "bab" (subsequence of "bbcbaba")
+- "aba" (subsequence of "bbcbaba")
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 105
    • +
  • s consists of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int countPalindromicSubsequence(string s) { + + } +};","class Solution { + public int countPalindromicSubsequence(String s) { + + } +}","class Solution(object): + def countPalindromicSubsequence(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def countPalindromicSubsequence(self, s: str) -> int: + ","int countPalindromicSubsequence(char * s){ + +}","public class Solution { + public int CountPalindromicSubsequence(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var countPalindromicSubsequence = function(s) { + +};","# @param {String} s +# @return {Integer} +def count_palindromic_subsequence(s) + +end","class Solution { + func countPalindromicSubsequence(_ s: String) -> Int { + + } +}","func countPalindromicSubsequence(s string) int { + +}","object Solution { + def countPalindromicSubsequence(s: String): Int = { + + } +}","class Solution { + fun countPalindromicSubsequence(s: String): Int { + + } +}","impl Solution { + pub fn count_palindromic_subsequence(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function countPalindromicSubsequence($s) { + + } +}","function countPalindromicSubsequence(s: string): number { + +};","(define/contract (count-palindromic-subsequence s) + (-> string? exact-integer?) + + )","-spec count_palindromic_subsequence(S :: unicode:unicode_binary()) -> integer(). +count_palindromic_subsequence(S) -> + .","defmodule Solution do + @spec count_palindromic_subsequence(s :: String.t) :: integer + def count_palindromic_subsequence(s) do + + end +end","class Solution { + int countPalindromicSubsequence(String s) { + + } +}", +627,describe-the-painting,Describe the Painting,1943.0,2055.0,"

There is a long and thin painting that can be represented by a number line. The painting was painted with multiple overlapping segments where each segment was painted with a unique color. You are given a 2D integer array segments, where segments[i] = [starti, endi, colori] represents the half-closed segment [starti, endi) with colori as the color.

+ +

The colors in the overlapping segments of the painting were mixed when it was painted. When two or more colors mix, they form a new color that can be represented as a set of mixed colors.

+ +
    +
  • For example, if colors 2, 4, and 6 are mixed, then the resulting mixed color is {2,4,6}.
    • +
+ +

For the sake of simplicity, you should only output the sum of the elements in the set rather than the full set.

+ +

You want to describe the painting with the minimum number of non-overlapping half-closed segments of these mixed colors. These segments can be represented by the 2D array painting where painting[j] = [leftj, rightj, mixj] describes a half-closed segment [leftj, rightj) with the mixed color sum of mixj.

+ +
    +
  • For example, the painting created with segments = [[1,4,5],[1,7,7]] can be described by painting = [[1,4,12],[4,7,7]] because: + +
      +
    • [1,4) is colored {5,7} (with a sum of 12) from both the first and second segments.
      • +
    • [4,7) is colored {7} from only the second segment.
      • +
    +
    • +
+ +

Return the 2D array painting describing the finished painting (excluding any parts that are not painted). You may return the segments in any order.

+ +

A half-closed segment [a, b) is the section of the number line between points a and b including point a and not including point b.

+ +

 

+

Example 1:

+ +
+Input: segments = [[1,4,5],[4,7,7],[1,7,9]]
+Output: [[1,4,14],[4,7,16]]
+Explanation: The painting can be described as follows:
+- [1,4) is colored {5,9} (with a sum of 14) from the first and third segments.
+- [4,7) is colored {7,9} (with a sum of 16) from the second and third segments.
+
+ +

Example 2:

+ +
+Input: segments = [[1,7,9],[6,8,15],[8,10,7]]
+Output: [[1,6,9],[6,7,24],[7,8,15],[8,10,7]]
+Explanation: The painting can be described as follows:
+- [1,6) is colored 9 from the first segment.
+- [6,7) is colored {9,15} (with a sum of 24) from the first and second segments.
+- [7,8) is colored 15 from the second segment.
+- [8,10) is colored 7 from the third segment.
+
+ +

Example 3:

+ +
+Input: segments = [[1,4,5],[1,4,7],[4,7,1],[4,7,11]]
+Output: [[1,4,12],[4,7,12]]
+Explanation: The painting can be described as follows:
+- [1,4) is colored {5,7} (with a sum of 12) from the first and second segments.
+- [4,7) is colored {1,11} (with a sum of 12) from the third and fourth segments.
+Note that returning a single segment [1,7) is incorrect because the mixed color sets are different.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= segments.length <= 2 * 104
    • +
  • segments[i].length == 3
    • +
  • 1 <= starti < endi <= 105
    • +
  • 1 <= colori <= 109
    • +
  • Each colori is distinct.
    • +
+",2.0,False,"class Solution { +public: + vector> splitPainting(vector>& segments) { + + } +};","class Solution { + public List> splitPainting(int[][] segments) { + + } +}","class Solution(object): + def splitPainting(self, segments): + """""" + :type segments: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def splitPainting(self, segments: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +long long** splitPainting(int** segments, int segmentsSize, int* segmentsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> SplitPainting(int[][] segments) { + + } +}","/** + * @param {number[][]} segments + * @return {number[][]} + */ +var splitPainting = function(segments) { + +};","# @param {Integer[][]} segments +# @return {Integer[][]} +def split_painting(segments) + +end","class Solution { + func splitPainting(_ segments: [[Int]]) -> [[Int]] { + + } +}","func splitPainting(segments [][]int) [][]int64 { + +}","object Solution { + def splitPainting(segments: Array[Array[Int]]): List[List[Long]] = { + + } +}","class Solution { + fun splitPainting(segments: Array): List> { + + } +}","impl Solution { + pub fn split_painting(segments: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $segments + * @return Integer[][] + */ + function splitPainting($segments) { + + } +}","function splitPainting(segments: number[][]): number[][] { + +};","(define/contract (split-painting segments) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec split_painting(Segments :: [[integer()]]) -> [[integer()]]. +split_painting(Segments) -> + .","defmodule Solution do + @spec split_painting(segments :: [[integer]]) :: [[integer]] + def split_painting(segments) do + + end +end","class Solution { + List> splitPainting(List> segments) { + + } +}", +630,longest-common-subpath,Longest Common Subpath,1923.0,2051.0,"

There is a country of n cities numbered from 0 to n - 1. In this country, there is a road connecting every pair of cities.

+ +

There are m friends numbered from 0 to m - 1 who are traveling through the country. Each one of them will take a path consisting of some cities. Each path is represented by an integer array that contains the visited cities in order. The path may contain a city more than once, but the same city will not be listed consecutively.

+ +

Given an integer n and a 2D integer array paths where paths[i] is an integer array representing the path of the ith friend, return the length of the longest common subpath that is shared by every friend's path, or 0 if there is no common subpath at all.

+ +

A subpath of a path is a contiguous sequence of cities within that path.

+ +

 

+

Example 1:

+ +
+Input: n = 5, paths = [[0,1,2,3,4],
+                       [2,3,4],
+                       [4,0,1,2,3]]
+Output: 2
+Explanation: The longest common subpath is [2,3].
+
+ +

Example 2:

+ +
+Input: n = 3, paths = [[0],[1],[2]]
+Output: 0
+Explanation: There is no common subpath shared by the three paths.
+
+ +

Example 3:

+ +
+Input: n = 5, paths = [[0,1,2,3,4],
+                       [4,3,2,1,0]]
+Output: 1
+Explanation: The possible longest common subpaths are [0], [1], [2], [3], and [4]. All have a length of 1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • m == paths.length
    • +
  • 2 <= m <= 105
    • +
  • sum(paths[i].length) <= 105
    • +
  • 0 <= paths[i][j] < n
    • +
  • The same city is not listed multiple times consecutively in paths[i].
    • +
+",3.0,False,"class Solution { +public: + int longestCommonSubpath(int n, vector>& paths) { + + } +};","class Solution { + public int longestCommonSubpath(int n, int[][] paths) { + + } +}","class Solution(object): + def longestCommonSubpath(self, n, paths): + """""" + :type n: int + :type paths: List[List[int]] + :rtype: int + """""" + ","class Solution: + def longestCommonSubpath(self, n: int, paths: List[List[int]]) -> int: + ","int longestCommonSubpath(int n, int** paths, int pathsSize, int* pathsColSize){ + +}","public class Solution { + public int LongestCommonSubpath(int n, int[][] paths) { + + } +}","/** + * @param {number} n + * @param {number[][]} paths + * @return {number} + */ +var longestCommonSubpath = function(n, paths) { + +};","# @param {Integer} n +# @param {Integer[][]} paths +# @return {Integer} +def longest_common_subpath(n, paths) + +end","class Solution { + func longestCommonSubpath(_ n: Int, _ paths: [[Int]]) -> Int { + + } +}","func longestCommonSubpath(n int, paths [][]int) int { + +}","object Solution { + def longestCommonSubpath(n: Int, paths: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun longestCommonSubpath(n: Int, paths: Array): Int { + + } +}","impl Solution { + pub fn longest_common_subpath(n: i32, paths: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $paths + * @return Integer + */ + function longestCommonSubpath($n, $paths) { + + } +}","function longestCommonSubpath(n: number, paths: number[][]): number { + +};","(define/contract (longest-common-subpath n paths) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec longest_common_subpath(N :: integer(), Paths :: [[integer()]]) -> integer(). +longest_common_subpath(N, Paths) -> + .","defmodule Solution do + @spec longest_common_subpath(n :: integer, paths :: [[integer]]) :: integer + def longest_common_subpath(n, paths) do + + end +end","class Solution { + int longestCommonSubpath(int n, List> paths) { + + } +}", +632,eliminate-maximum-number-of-monsters,Eliminate Maximum Number of Monsters,1921.0,2049.0,"

You are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, where dist[i] is the initial distance in kilometers of the ith monster from the city.

+ +

The monsters walk toward the city at a constant speed. The speed of each monster is given to you in an integer array speed of size n, where speed[i] is the speed of the ith monster in kilometers per minute.

+ +

You have a weapon that, once fully charged, can eliminate a single monster. However, the weapon takes one minute to charge.The weapon is fully charged at the very start.

+ +

You lose when any monster reaches your city. If a monster reaches the city at the exact moment the weapon is fully charged, it counts as a loss, and the game ends before you can use your weapon.

+ +

Return the maximum number of monsters that you can eliminate before you lose, or n if you can eliminate all the monsters before they reach the city.

+ +

 

+

Example 1:

+ +
+Input: dist = [1,3,4], speed = [1,1,1]
+Output: 3
+Explanation:
+In the beginning, the distances of the monsters are [1,3,4]. You eliminate the first monster.
+After a minute, the distances of the monsters are [X,2,3]. You eliminate the second monster.
+After a minute, the distances of the monsters are [X,X,2]. You eliminate the thrid monster.
+All 3 monsters can be eliminated.
+ +

Example 2:

+ +
+Input: dist = [1,1,2,3], speed = [1,1,1,1]
+Output: 1
+Explanation:
+In the beginning, the distances of the monsters are [1,1,2,3]. You eliminate the first monster.
+After a minute, the distances of the monsters are [X,0,1,2], so you lose.
+You can only eliminate 1 monster.
+
+ +

Example 3:

+ +
+Input: dist = [3,2,4], speed = [5,3,2]
+Output: 1
+Explanation:
+In the beginning, the distances of the monsters are [3,2,4]. You eliminate the first monster.
+After a minute, the distances of the monsters are [X,0,2], so you lose.
+You can only eliminate 1 monster.
+
+ +

 

+

Constraints:

+ +
    +
  • n == dist.length == speed.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= dist[i], speed[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int eliminateMaximum(vector& dist, vector& speed) { + + } +};","class Solution { + public int eliminateMaximum(int[] dist, int[] speed) { + + } +}","class Solution(object): + def eliminateMaximum(self, dist, speed): + """""" + :type dist: List[int] + :type speed: List[int] + :rtype: int + """""" + ","class Solution: + def eliminateMaximum(self, dist: List[int], speed: List[int]) -> int: + ","int eliminateMaximum(int* dist, int distSize, int* speed, int speedSize){ + +}","public class Solution { + public int EliminateMaximum(int[] dist, int[] speed) { + + } +}","/** + * @param {number[]} dist + * @param {number[]} speed + * @return {number} + */ +var eliminateMaximum = function(dist, speed) { + +};","# @param {Integer[]} dist +# @param {Integer[]} speed +# @return {Integer} +def eliminate_maximum(dist, speed) + +end","class Solution { + func eliminateMaximum(_ dist: [Int], _ speed: [Int]) -> Int { + + } +}","func eliminateMaximum(dist []int, speed []int) int { + +}","object Solution { + def eliminateMaximum(dist: Array[Int], speed: Array[Int]): Int = { + + } +}","class Solution { + fun eliminateMaximum(dist: IntArray, speed: IntArray): Int { + + } +}","impl Solution { + pub fn eliminate_maximum(dist: Vec, speed: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $dist + * @param Integer[] $speed + * @return Integer + */ + function eliminateMaximum($dist, $speed) { + + } +}","function eliminateMaximum(dist: number[], speed: number[]): number { + +};","(define/contract (eliminate-maximum dist speed) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec eliminate_maximum(Dist :: [integer()], Speed :: [integer()]) -> integer(). +eliminate_maximum(Dist, Speed) -> + .","defmodule Solution do + @spec eliminate_maximum(dist :: [integer], speed :: [integer]) :: integer + def eliminate_maximum(dist, speed) do + + end +end","class Solution { + int eliminateMaximum(List dist, List speed) { + + } +}", +633,build-array-from-permutation,Build Array from Permutation,1920.0,2048.0,"

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it.

+ +

A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive).

+ +

 

+

Example 1:

+ +
+Input: nums = [0,2,1,5,3,4]
+Output: [0,1,2,4,5,3]
+Explanation: The array ans is built as follows: 
+ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
+    = [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]]
+    = [0,1,2,4,5,3]
+ +

Example 2:

+ +
+Input: nums = [5,0,1,2,3,4]
+Output: [4,5,0,1,2,3]
+Explanation: The array ans is built as follows:
+ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
+    = [nums[5], nums[0], nums[1], nums[2], nums[3], nums[4]]
+    = [4,5,0,1,2,3]
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] < nums.length
    • +
  • The elements in nums are distinct.
    • +
+ +

 

+

Follow-up: Can you solve it without using an extra space (i.e., O(1) memory)?

+",1.0,False,"class Solution { +public: + vector buildArray(vector& nums) { + + } +};","class Solution { + public int[] buildArray(int[] nums) { + + } +}","class Solution(object): + def buildArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def buildArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* buildArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] BuildArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var buildArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def build_array(nums) + +end","class Solution { + func buildArray(_ nums: [Int]) -> [Int] { + + } +}","func buildArray(nums []int) []int { + +}","object Solution { + def buildArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun buildArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn build_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function buildArray($nums) { + + } +}","function buildArray(nums: number[]): number[] { + +};","(define/contract (build-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec build_array(Nums :: [integer()]) -> [integer()]. +build_array(Nums) -> + .","defmodule Solution do + @spec build_array(nums :: [integer]) :: [integer] + def build_array(nums) do + + end +end","class Solution { + List buildArray(List nums) { + + } +}", +634,find-a-peak-element-ii,Find a Peak Element II,1901.0,2047.0,"

A peak element in a 2D grid is an element that is strictly greater than all of its adjacent neighbors to the left, right, top, and bottom.

+ +

Given a 0-indexed m x n matrix mat where no two adjacent cells are equal, find any peak element mat[i][j] and return the length 2 array [i,j].

+ +

You may assume that the entire matrix is surrounded by an outer perimeter with the value -1 in each cell.

+ +

You must write an algorithm that runs in O(m log(n)) or O(n log(m)) time.

+ +

 

+

Example 1:

+ +

+ +
+Input: mat = [[1,4],[3,2]]
+Output: [0,1]
+Explanation: Both 3 and 4 are peak elements so [1,0] and [0,1] are both acceptable answers.
+
+ +

Example 2:

+ +

+ +
+Input: mat = [[10,20,15],[21,30,14],[7,16,32]]
+Output: [1,1]
+Explanation: Both 30 and 32 are peak elements so [1,1] and [2,2] are both acceptable answers.
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length
    • +
  • n == mat[i].length
    • +
  • 1 <= m, n <= 500
    • +
  • 1 <= mat[i][j] <= 105
    • +
  • No two adjacent cells are equal.
    • +
+",2.0,False,"class Solution { +public: + vector findPeakGrid(vector>& mat) { + + } +};","class Solution { + public int[] findPeakGrid(int[][] mat) { + + } +}","class Solution(object): + def findPeakGrid(self, mat): + """""" + :type mat: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findPeakGrid(self, mat: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findPeakGrid(int** mat, int matSize, int* matColSize, int* returnSize){ + +}","public class Solution { + public int[] FindPeakGrid(int[][] mat) { + + } +}","/** + * @param {number[][]} mat + * @return {number[]} + */ +var findPeakGrid = function(mat) { + +};","# @param {Integer[][]} mat +# @return {Integer[]} +def find_peak_grid(mat) + +end","class Solution { + func findPeakGrid(_ mat: [[Int]]) -> [Int] { + + } +}","func findPeakGrid(mat [][]int) []int { + +}","object Solution { + def findPeakGrid(mat: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun findPeakGrid(mat: Array): IntArray { + + } +}","impl Solution { + pub fn find_peak_grid(mat: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @return Integer[] + */ + function findPeakGrid($mat) { + + } +}","function findPeakGrid(mat: number[][]): number[] { + +};","(define/contract (find-peak-grid mat) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_peak_grid(Mat :: [[integer()]]) -> [integer()]. +find_peak_grid(Mat) -> + .","defmodule Solution do + @spec find_peak_grid(mat :: [[integer]]) :: [integer] + def find_peak_grid(mat) do + + end +end","class Solution { + List findPeakGrid(List> mat) { + + } +}", +635,number-of-wonderful-substrings,Number of Wonderful Substrings,1915.0,2044.0,"

A wonderful string is a string where at most one letter appears an odd number of times.

+ +
    +
  • For example, "ccjjc" and "abab" are wonderful, but "ab" is not.
    • +
+ +

Given a string word that consists of the first ten lowercase English letters ('a' through 'j'), return the number of wonderful non-empty substrings in word. If the same substring appears multiple times in word, then count each occurrence separately.

+ +

A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: word = "aba"
+Output: 4
+Explanation: The four wonderful substrings are underlined below:
+- "aba" -> "a"
+- "aba" -> "b"
+- "aba" -> "a"
+- "aba" -> "aba"
+
+ +

Example 2:

+ +
+Input: word = "aabb"
+Output: 9
+Explanation: The nine wonderful substrings are underlined below:
+- "aabb" -> "a"
+- "aabb" -> "aa"
+- "aabb" -> "aab"
+- "aabb" -> "aabb"
+- "aabb" -> "a"
+- "aabb" -> "abb"
+- "aabb" -> "b"
+- "aabb" -> "bb"
+- "aabb" -> "b"
+
+ +

Example 3:

+ +
+Input: word = "he"
+Output: 2
+Explanation: The two wonderful substrings are underlined below:
+- "he" -> "h"
+- "he" -> "e"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length <= 105
    • +
  • word consists of lowercase English letters from 'a' to 'j'.
    • +
",2.0,False,"class Solution { +public: + long long wonderfulSubstrings(string word) { + + } +};","class Solution { + public long wonderfulSubstrings(String word) { + + } +}","class Solution(object): + def wonderfulSubstrings(self, word): + """""" + :type word: str + :rtype: int + """"""","class Solution: + def wonderfulSubstrings(self, word: str) -> int:","long long wonderfulSubstrings(char * word){ + +}","public class Solution { + public long WonderfulSubstrings(string word) { + + } +}","/** + * @param {string} word + * @return {number} + */ +var wonderfulSubstrings = function(word) { + +};","# @param {String} word +# @return {Integer} +def wonderful_substrings(word) + +end","class Solution { + func wonderfulSubstrings(_ word: String) -> Int { + + } +}","func wonderfulSubstrings(word string) int64 { + +}","object Solution { + def wonderfulSubstrings(word: String): Long = { + + } +}","class Solution { + fun wonderfulSubstrings(word: String): Long { + + } +}","impl Solution { + pub fn wonderful_substrings(word: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $word + * @return Integer + */ + function wonderfulSubstrings($word) { + + } +}","function wonderfulSubstrings(word: string): number { + +};","(define/contract (wonderful-substrings word) + (-> string? exact-integer?) + + )",,,, +638,minimum-cost-to-reach-destination-in-time,Minimum Cost to Reach Destination in Time,1928.0,2040.0,"

There is a country of n cities numbered from 0 to n - 1 where all the cities are connected by bi-directional roads. The roads are represented as a 2D integer array edges where edges[i] = [xi, yi, timei] denotes a road between cities xi and yi that takes timei minutes to travel. There may be multiple roads of differing travel times connecting the same two cities, but no road connects a city to itself.

+ +

Each time you pass through a city, you must pay a passing fee. This is represented as a 0-indexed integer array passingFees of length n where passingFees[j] is the amount of dollars you must pay when you pass through city j.

+ +

In the beginning, you are at city 0 and want to reach city n - 1 in maxTime minutes or less. The cost of your journey is the summation of passing fees for each city that you passed through at some moment of your journey (including the source and destination cities).

+ +

Given maxTime, edges, and passingFees, return the minimum cost to complete your journey, or -1 if you cannot complete it within maxTime minutes.

+ +

 

+

Example 1:

+ +

+ +
+Input: maxTime = 30, edges = [[0,1,10],[1,2,10],[2,5,10],[0,3,1],[3,4,10],[4,5,15]], passingFees = [5,1,2,20,20,3]
+Output: 11
+Explanation: The path to take is 0 -> 1 -> 2 -> 5, which takes 30 minutes and has $11 worth of passing fees.
+
+ +

Example 2:

+ +

+ +
+Input: maxTime = 29, edges = [[0,1,10],[1,2,10],[2,5,10],[0,3,1],[3,4,10],[4,5,15]], passingFees = [5,1,2,20,20,3]
+Output: 48
+Explanation: The path to take is 0 -> 3 -> 4 -> 5, which takes 26 minutes and has $48 worth of passing fees.
+You cannot take path 0 -> 1 -> 2 -> 5 since it would take too long.
+
+ +

Example 3:

+ +
+Input: maxTime = 25, edges = [[0,1,10],[1,2,10],[2,5,10],[0,3,1],[3,4,10],[4,5,15]], passingFees = [5,1,2,20,20,3]
+Output: -1
+Explanation: There is no way to reach city 5 from city 0 within 25 minutes.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= maxTime <= 1000
    • +
  • n == passingFees.length
    • +
  • 2 <= n <= 1000
    • +
  • n - 1 <= edges.length <= 1000
    • +
  • 0 <= xi, yi <= n - 1
    • +
  • 1 <= timei <= 1000
    • +
  • 1 <= passingFees[j] <= 1000 
    • +
  • The graph may contain multiple edges between two nodes.
    • +
  • The graph does not contain self loops.
    • +
+",3.0,False,"class Solution { +public: + int minCost(int maxTime, vector>& edges, vector& passingFees) { + + } +};","class Solution { + public int minCost(int maxTime, int[][] edges, int[] passingFees) { + + } +}","class Solution(object): + def minCost(self, maxTime, edges, passingFees): + """""" + :type maxTime: int + :type edges: List[List[int]] + :type passingFees: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, maxTime: int, edges: List[List[int]], passingFees: List[int]) -> int: + ","int minCost(int maxTime, int** edges, int edgesSize, int* edgesColSize, int* passingFees, int passingFeesSize){ + +}","public class Solution { + public int MinCost(int maxTime, int[][] edges, int[] passingFees) { + + } +}","/** + * @param {number} maxTime + * @param {number[][]} edges + * @param {number[]} passingFees + * @return {number} + */ +var minCost = function(maxTime, edges, passingFees) { + +};","# @param {Integer} max_time +# @param {Integer[][]} edges +# @param {Integer[]} passing_fees +# @return {Integer} +def min_cost(max_time, edges, passing_fees) + +end","class Solution { + func minCost(_ maxTime: Int, _ edges: [[Int]], _ passingFees: [Int]) -> Int { + + } +}","func minCost(maxTime int, edges [][]int, passingFees []int) int { + +}","object Solution { + def minCost(maxTime: Int, edges: Array[Array[Int]], passingFees: Array[Int]): Int = { + + } +}","class Solution { + fun minCost(maxTime: Int, edges: Array, passingFees: IntArray): Int { + + } +}","impl Solution { + pub fn min_cost(max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $maxTime + * @param Integer[][] $edges + * @param Integer[] $passingFees + * @return Integer + */ + function minCost($maxTime, $edges, $passingFees) { + + } +}","function minCost(maxTime: number, edges: number[][], passingFees: number[]): number { + +};","(define/contract (min-cost maxTime edges passingFees) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec min_cost(MaxTime :: integer(), Edges :: [[integer()]], PassingFees :: [integer()]) -> integer(). +min_cost(MaxTime, Edges, PassingFees) -> + .","defmodule Solution do + @spec min_cost(max_time :: integer, edges :: [[integer]], passing_fees :: [integer]) :: integer + def min_cost(max_time, edges, passing_fees) do + + end +end","class Solution { + int minCost(int maxTime, List> edges, List passingFees) { + + } +}", +640,nearest-exit-from-entrance-in-maze,Nearest Exit from Entrance in Maze,1926.0,2038.0,"

You are given an m x n matrix maze (0-indexed) with empty cells (represented as '.') and walls (represented as '+'). You are also given the entrance of the maze, where entrance = [entrancerow, entrancecol] denotes the row and column of the cell you are initially standing at.

+ +

In one step, you can move one cell up, down, left, or right. You cannot step into a cell with a wall, and you cannot step outside the maze. Your goal is to find the nearest exit from the entrance. An exit is defined as an empty cell that is at the border of the maze. The entrance does not count as an exit.

+ +

Return the number of steps in the shortest path from the entrance to the nearest exit, or -1 if no such path exists.

+ +

 

+

Example 1:

+ +
+Input: maze = [["+","+",".","+"],[".",".",".","+"],["+","+","+","."]], entrance = [1,2]
+Output: 1
+Explanation: There are 3 exits in this maze at [1,0], [0,2], and [2,3].
+Initially, you are at the entrance cell [1,2].
+- You can reach [1,0] by moving 2 steps left.
+- You can reach [0,2] by moving 1 step up.
+It is impossible to reach [2,3] from the entrance.
+Thus, the nearest exit is [0,2], which is 1 step away.
+
+ +

Example 2:

+ +
+Input: maze = [["+","+","+"],[".",".","."],["+","+","+"]], entrance = [1,0]
+Output: 2
+Explanation: There is 1 exit in this maze at [1,2].
+[1,0] does not count as an exit since it is the entrance cell.
+Initially, you are at the entrance cell [1,0].
+- You can reach [1,2] by moving 2 steps right.
+Thus, the nearest exit is [1,2], which is 2 steps away.
+
+ +

Example 3:

+ +
+Input: maze = [[".","+"]], entrance = [0,0]
+Output: -1
+Explanation: There are no exits in this maze.
+
+ +

 

+

Constraints:

+ +
    +
  • maze.length == m
    • +
  • maze[i].length == n
    • +
  • 1 <= m, n <= 100
    • +
  • maze[i][j] is either '.' or '+'.
    • +
  • entrance.length == 2
    • +
  • 0 <= entrancerow < m
    • +
  • 0 <= entrancecol < n
    • +
  • entrance will always be an empty cell.
    • +
+",2.0,False,"class Solution { +public: + int nearestExit(vector>& maze, vector& entrance) { + + } +};","class Solution { + public int nearestExit(char[][] maze, int[] entrance) { + + } +}","class Solution(object): + def nearestExit(self, maze, entrance): + """""" + :type maze: List[List[str]] + :type entrance: List[int] + :rtype: int + """""" + ","class Solution: + def nearestExit(self, maze: List[List[str]], entrance: List[int]) -> int: + ","int nearestExit(char** maze, int mazeSize, int* mazeColSize, int* entrance, int entranceSize){ + +}","public class Solution { + public int NearestExit(char[][] maze, int[] entrance) { + + } +}","/** + * @param {character[][]} maze + * @param {number[]} entrance + * @return {number} + */ +var nearestExit = function(maze, entrance) { + +};","# @param {Character[][]} maze +# @param {Integer[]} entrance +# @return {Integer} +def nearest_exit(maze, entrance) + +end","class Solution { + func nearestExit(_ maze: [[Character]], _ entrance: [Int]) -> Int { + + } +}","func nearestExit(maze [][]byte, entrance []int) int { + +}","object Solution { + def nearestExit(maze: Array[Array[Char]], entrance: Array[Int]): Int = { + + } +}","class Solution { + fun nearestExit(maze: Array, entrance: IntArray): Int { + + } +}","impl Solution { + pub fn nearest_exit(maze: Vec>, entrance: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[][] $maze + * @param Integer[] $entrance + * @return Integer + */ + function nearestExit($maze, $entrance) { + + } +}","function nearestExit(maze: string[][], entrance: number[]): number { + +};","(define/contract (nearest-exit maze entrance) + (-> (listof (listof char?)) (listof exact-integer?) exact-integer?) + + )","-spec nearest_exit(Maze :: [[char()]], Entrance :: [integer()]) -> integer(). +nearest_exit(Maze, Entrance) -> + .","defmodule Solution do + @spec nearest_exit(maze :: [[char]], entrance :: [integer]) :: integer + def nearest_exit(maze, entrance) do + + end +end","class Solution { + int nearestExit(List> maze, List entrance) { + + } +}", +641,count-square-sum-triples,Count Square Sum Triples,1925.0,2037.0,"

A square triple (a,b,c) is a triple where a, b, and c are integers and a2 + b2 = c2.

+ +

Given an integer n, return the number of square triples such that 1 <= a, b, c <= n.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 2
+Explanation: The square triples are (3,4,5) and (4,3,5).
+
+ +

Example 2:

+ +
+Input: n = 10
+Output: 4
+Explanation: The square triples are (3,4,5), (4,3,5), (6,8,10), and (8,6,10).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 250
    • +
+",1.0,False,"class Solution { +public: + int countTriples(int n) { + + } +};","class Solution { + public int countTriples(int n) { + + } +}","class Solution(object): + def countTriples(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countTriples(self, n: int) -> int: + ","int countTriples(int n){ + +}","public class Solution { + public int CountTriples(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countTriples = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_triples(n) + +end","class Solution { + func countTriples(_ n: Int) -> Int { + + } +}","func countTriples(n int) int { + +}","object Solution { + def countTriples(n: Int): Int = { + + } +}","class Solution { + fun countTriples(n: Int): Int { + + } +}","impl Solution { + pub fn count_triples(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countTriples($n) { + + } +}","function countTriples(n: number): number { + +};","(define/contract (count-triples n) + (-> exact-integer? exact-integer?) + + )","-spec count_triples(N :: integer()) -> integer(). +count_triples(N) -> + .","defmodule Solution do + @spec count_triples(n :: integer) :: integer + def count_triples(n) do + + end +end","class Solution { + int countTriples(int n) { + + } +}", +644,the-number-of-full-rounds-you-have-played,The Number of Full Rounds You Have Played,1904.0,2033.0,"

You are participating in an online chess tournament. There is a chess round that starts every 15 minutes. The first round of the day starts at 00:00, and after every 15 minutes, a new round starts.

+ +
    +
  • For example, the second round starts at 00:15, the fourth round starts at 00:45, and the seventh round starts at 01:30.
    • +
+ +

You are given two strings loginTime and logoutTime where:

+ +
    +
  • loginTime is the time you will login to the game, and
    • +
  • logoutTime is the time you will logout from the game.
    • +
+ +

If logoutTime is earlier than loginTime, this means you have played from loginTime to midnight and from midnight to logoutTime.

+ +

Return the number of full chess rounds you have played in the tournament.

+ +

Note: All the given times follow the 24-hour clock. That means the first round of the day starts at 00:00 and the last round of the day starts at 23:45.

+ +

 

+

Example 1:

+ +
+Input: loginTime = "09:31", logoutTime = "10:14"
+Output: 1
+Explanation: You played one full round from 09:45 to 10:00.
+You did not play the full round from 09:30 to 09:45 because you logged in at 09:31 after it began.
+You did not play the full round from 10:00 to 10:15 because you logged out at 10:14 before it ended.
+
+ +

Example 2:

+ +
+Input: loginTime = "21:30", logoutTime = "03:00"
+Output: 22
+Explanation: You played 10 full rounds from 21:30 to 00:00 and 12 full rounds from 00:00 to 03:00.
+10 + 12 = 22.
+
+ +

 

+

Constraints:

+ +
    +
  • loginTime and logoutTime are in the format hh:mm.
    • +
  • 00 <= hh <= 23
    • +
  • 00 <= mm <= 59
    • +
  • loginTime and logoutTime are not equal.
    • +
+",2.0,False,"class Solution { +public: + int numberOfRounds(string loginTime, string logoutTime) { + + } +};","class Solution { + public int numberOfRounds(String loginTime, String logoutTime) { + + } +}","class Solution(object): + def numberOfRounds(self, loginTime, logoutTime): + """""" + :type loginTime: str + :type logoutTime: str + :rtype: int + """""" + ","class Solution: + def numberOfRounds(self, loginTime: str, logoutTime: str) -> int: + ","int numberOfRounds(char * loginTime, char * logoutTime){ + +}","public class Solution { + public int NumberOfRounds(string loginTime, string logoutTime) { + + } +}","/** + * @param {string} loginTime + * @param {string} logoutTime + * @return {number} + */ +var numberOfRounds = function(loginTime, logoutTime) { + +};","# @param {String} login_time +# @param {String} logout_time +# @return {Integer} +def number_of_rounds(login_time, logout_time) + +end","class Solution { + func numberOfRounds(_ loginTime: String, _ logoutTime: String) -> Int { + + } +}","func numberOfRounds(loginTime string, logoutTime string) int { + +}","object Solution { + def numberOfRounds(loginTime: String, logoutTime: String): Int = { + + } +}","class Solution { + fun numberOfRounds(loginTime: String, logoutTime: String): Int { + + } +}","impl Solution { + pub fn number_of_rounds(login_time: String, logout_time: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $loginTime + * @param String $logoutTime + * @return Integer + */ + function numberOfRounds($loginTime, $logoutTime) { + + } +}","function numberOfRounds(loginTime: string, logoutTime: string): number { + +};","(define/contract (number-of-rounds loginTime logoutTime) + (-> string? string? exact-integer?) + + )","-spec number_of_rounds(LoginTime :: unicode:unicode_binary(), LogoutTime :: unicode:unicode_binary()) -> integer(). +number_of_rounds(LoginTime, LogoutTime) -> + .","defmodule Solution do + @spec number_of_rounds(login_time :: String.t, logout_time :: String.t) :: integer + def number_of_rounds(login_time, logout_time) do + + end +end","class Solution { + int numberOfRounds(String loginTime, String logoutTime) { + + } +}", +646,egg-drop-with-2-eggs-and-n-floors,Egg Drop With 2 Eggs and N Floors,1884.0,2031.0,"

You are given two identical eggs and you have access to a building with n floors labeled from 1 to n.

+ +

You know that there exists a floor f where 0 <= f <= n such that any egg dropped at a floor higher than f will break, and any egg dropped at or below floor f will not break.

+ +

In each move, you may take an unbroken egg and drop it from any floor x (where 1 <= x <= n). If the egg breaks, you can no longer use it. However, if the egg does not break, you may reuse it in future moves.

+ +

Return the minimum number of moves that you need to determine with certainty what the value of f is.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: 2
+Explanation: We can drop the first egg from floor 1 and the second egg from floor 2.
+If the first egg breaks, we know that f = 0.
+If the second egg breaks but the first egg didn't, we know that f = 1.
+Otherwise, if both eggs survive, we know that f = 2.
+
+ +

Example 2:

+ +
+Input: n = 100
+Output: 14
+Explanation: One optimal strategy is:
+- Drop the 1st egg at floor 9. If it breaks, we know f is between 0 and 8. Drop the 2nd egg starting from floor 1 and going up one at a time to find f within 8 more drops. Total drops is 1 + 8 = 9.
+- If the 1st egg does not break, drop the 1st egg again at floor 22. If it breaks, we know f is between 9 and 21. Drop the 2nd egg starting from floor 10 and going up one at a time to find f within 12 more drops. Total drops is 2 + 12 = 14.
+- If the 1st egg does not break again, follow a similar process dropping the 1st egg from floors 34, 45, 55, 64, 72, 79, 85, 90, 94, 97, 99, and 100.
+Regardless of the outcome, it takes at most 14 drops to determine f.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",2.0,False,"class Solution { +public: + int twoEggDrop(int n) { + + } +};","class Solution { + public int twoEggDrop(int n) { + + } +}","class Solution(object): + def twoEggDrop(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def twoEggDrop(self, n: int) -> int: + ","int twoEggDrop(int n){ + +}","public class Solution { + public int TwoEggDrop(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var twoEggDrop = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def two_egg_drop(n) + +end","class Solution { + func twoEggDrop(_ n: Int) -> Int { + + } +}","func twoEggDrop(n int) int { + +}","object Solution { + def twoEggDrop(n: Int): Int = { + + } +}","class Solution { + fun twoEggDrop(n: Int): Int { + + } +}","impl Solution { + pub fn two_egg_drop(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function twoEggDrop($n) { + + } +}","function twoEggDrop(n: number): number { + +};","(define/contract (two-egg-drop n) + (-> exact-integer? exact-integer?) + + )","-spec two_egg_drop(N :: integer()) -> integer(). +two_egg_drop(N) -> + .","defmodule Solution do + @spec two_egg_drop(n :: integer) :: integer + def two_egg_drop(n) do + + end +end","class Solution { + int twoEggDrop(int n) { + + } +}", +647,the-earliest-and-latest-rounds-where-players-compete,The Earliest and Latest Rounds Where Players Compete,1900.0,2028.0,"

There is a tournament where n players are participating. The players are standing in a single row and are numbered from 1 to n based on their initial standing position (player 1 is the first player in the row, player 2 is the second player in the row, etc.).

+ +

The tournament consists of multiple rounds (starting from round number 1). In each round, the ith player from the front of the row competes against the ith player from the end of the row, and the winner advances to the next round. When the number of players is odd for the current round, the player in the middle automatically advances to the next round.

+ +
    +
  • For example, if the row consists of players 1, 2, 4, 6, 7 + +
      +
    • Player 1 competes against player 7.
      • +
    • Player 2 competes against player 6.
      • +
    • Player 4 automatically advances to the next round.
      • +
    +
    • +
+ +

After each round is over, the winners are lined back up in the row based on the original ordering assigned to them initially (ascending order).

+ +

The players numbered firstPlayer and secondPlayer are the best in the tournament. They can win against any other player before they compete against each other. If any two other players compete against each other, either of them might win, and thus you may choose the outcome of this round.

+ +

Given the integers n, firstPlayer, and secondPlayer, return an integer array containing two values, the earliest possible round number and the latest possible round number in which these two players will compete against each other, respectively.

+ +

 

+

Example 1:

+ +
+Input: n = 11, firstPlayer = 2, secondPlayer = 4
+Output: [3,4]
+Explanation:
+One possible scenario which leads to the earliest round number:
+First round: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
+Second round: 2, 3, 4, 5, 6, 11
+Third round: 2, 3, 4
+One possible scenario which leads to the latest round number:
+First round: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
+Second round: 1, 2, 3, 4, 5, 6
+Third round: 1, 2, 4
+Fourth round: 2, 4
+
+ +

Example 2:

+ +
+Input: n = 5, firstPlayer = 1, secondPlayer = 5
+Output: [1,1]
+Explanation: The players numbered 1 and 5 compete in the first round.
+There is no way to make them compete in any other round.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 28
    • +
  • 1 <= firstPlayer < secondPlayer <= n
    • +
+",3.0,False,"class Solution { +public: + vector earliestAndLatest(int n, int firstPlayer, int secondPlayer) { + + } +};","class Solution { + public int[] earliestAndLatest(int n, int firstPlayer, int secondPlayer) { + + } +}","class Solution(object): + def earliestAndLatest(self, n, firstPlayer, secondPlayer): + """""" + :type n: int + :type firstPlayer: int + :type secondPlayer: int + :rtype: List[int] + """""" + ","class Solution: + def earliestAndLatest(self, n: int, firstPlayer: int, secondPlayer: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* earliestAndLatest(int n, int firstPlayer, int secondPlayer, int* returnSize){ + +}","public class Solution { + public int[] EarliestAndLatest(int n, int firstPlayer, int secondPlayer) { + + } +}","/** + * @param {number} n + * @param {number} firstPlayer + * @param {number} secondPlayer + * @return {number[]} + */ +var earliestAndLatest = function(n, firstPlayer, secondPlayer) { + +};","# @param {Integer} n +# @param {Integer} first_player +# @param {Integer} second_player +# @return {Integer[]} +def earliest_and_latest(n, first_player, second_player) + +end","class Solution { + func earliestAndLatest(_ n: Int, _ firstPlayer: Int, _ secondPlayer: Int) -> [Int] { + + } +}","func earliestAndLatest(n int, firstPlayer int, secondPlayer int) []int { + +}","object Solution { + def earliestAndLatest(n: Int, firstPlayer: Int, secondPlayer: Int): Array[Int] = { + + } +}","class Solution { + fun earliestAndLatest(n: Int, firstPlayer: Int, secondPlayer: Int): IntArray { + + } +}","impl Solution { + pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $firstPlayer + * @param Integer $secondPlayer + * @return Integer[] + */ + function earliestAndLatest($n, $firstPlayer, $secondPlayer) { + + } +}","function earliestAndLatest(n: number, firstPlayer: number, secondPlayer: number): number[] { + +};","(define/contract (earliest-and-latest n firstPlayer secondPlayer) + (-> exact-integer? exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec earliest_and_latest(N :: integer(), FirstPlayer :: integer(), SecondPlayer :: integer()) -> [integer()]. +earliest_and_latest(N, FirstPlayer, SecondPlayer) -> + .","defmodule Solution do + @spec earliest_and_latest(n :: integer, first_player :: integer, second_player :: integer) :: [integer] + def earliest_and_latest(n, first_player, second_player) do + + end +end","class Solution { + List earliestAndLatest(int n, int firstPlayer, int secondPlayer) { + + } +}", +648,maximum-number-of-removable-characters,Maximum Number of Removable Characters,1898.0,2027.0,"

You are given two strings s and p where p is a subsequence of s. You are also given a distinct 0-indexed integer array removable containing a subset of indices of s (s is also 0-indexed).

+ +

You want to choose an integer k (0 <= k <= removable.length) such that, after removing k characters from s using the first k indices in removable, p is still a subsequence of s. More formally, you will mark the character at s[removable[i]] for each 0 <= i < k, then remove all marked characters and check if p is still a subsequence.

+ +

Return the maximum k you can choose such that p is still a subsequence of s after the removals.

+ +

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

+ +

 

+

Example 1:

+ +
+Input: s = "abcacb", p = "ab", removable = [3,1,0]
+Output: 2
+Explanation: After removing the characters at indices 3 and 1, "abcacb" becomes "accb".
+"ab" is a subsequence of "accb".
+If we remove the characters at indices 3, 1, and 0, "abcacb" becomes "ccb", and "ab" is no longer a subsequence.
+Hence, the maximum k is 2.
+
+ +

Example 2:

+ +
+Input: s = "abcbddddd", p = "abcd", removable = [3,2,1,4,5,6]
+Output: 1
+Explanation: After removing the character at index 3, "abcbddddd" becomes "abcddddd".
+"abcd" is a subsequence of "abcddddd".
+
+ +

Example 3:

+ +
+Input: s = "abcab", p = "abc", removable = [0,1,2,3,4]
+Output: 0
+Explanation: If you remove the first index in the array removable, "abc" is no longer a subsequence.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= p.length <= s.length <= 105
    • +
  • 0 <= removable.length < s.length
    • +
  • 0 <= removable[i] < s.length
    • +
  • p is a subsequence of s.
    • +
  • s and p both consist of lowercase English letters.
    • +
  • The elements in removable are distinct.
    • +
+",2.0,False,"class Solution { +public: + int maximumRemovals(string s, string p, vector& removable) { + + } +};","class Solution { + public int maximumRemovals(String s, String p, int[] removable) { + + } +}","class Solution(object): + def maximumRemovals(self, s, p, removable): + """""" + :type s: str + :type p: str + :type removable: List[int] + :rtype: int + """""" + ","class Solution: + def maximumRemovals(self, s: str, p: str, removable: List[int]) -> int: + ","int maximumRemovals(char * s, char * p, int* removable, int removableSize){ + +}","public class Solution { + public int MaximumRemovals(string s, string p, int[] removable) { + + } +}","/** + * @param {string} s + * @param {string} p + * @param {number[]} removable + * @return {number} + */ +var maximumRemovals = function(s, p, removable) { + +};","# @param {String} s +# @param {String} p +# @param {Integer[]} removable +# @return {Integer} +def maximum_removals(s, p, removable) + +end","class Solution { + func maximumRemovals(_ s: String, _ p: String, _ removable: [Int]) -> Int { + + } +}","func maximumRemovals(s string, p string, removable []int) int { + +}","object Solution { + def maximumRemovals(s: String, p: String, removable: Array[Int]): Int = { + + } +}","class Solution { + fun maximumRemovals(s: String, p: String, removable: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_removals(s: String, p: String, removable: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String $p + * @param Integer[] $removable + * @return Integer + */ + function maximumRemovals($s, $p, $removable) { + + } +}","function maximumRemovals(s: string, p: string, removable: number[]): number { + +};","(define/contract (maximum-removals s p removable) + (-> string? string? (listof exact-integer?) exact-integer?) + + )","-spec maximum_removals(S :: unicode:unicode_binary(), P :: unicode:unicode_binary(), Removable :: [integer()]) -> integer(). +maximum_removals(S, P, Removable) -> + .","defmodule Solution do + @spec maximum_removals(s :: String.t, p :: String.t, removable :: [integer]) :: integer + def maximum_removals(s, p, removable) do + + end +end","class Solution { + int maximumRemovals(String s, String p, List removable) { + + } +}", +651,design-movie-rental-system,Design Movie Rental System,1912.0,2023.0,"

You have a movie renting company consisting of n shops. You want to implement a renting system that supports searching for, booking, and returning movies. The system should also support generating a report of the currently rented movies.

+ +

Each movie is given as a 2D integer array entries where entries[i] = [shopi, moviei, pricei] indicates that there is a copy of movie moviei at shop shopi with a rental price of pricei. Each shop carries at most one copy of a movie moviei.

+ +

The system should support the following functions:

+ +
    +
  • Search: Finds the cheapest 5 shops that have an unrented copy of a given movie. The shops should be sorted by price in ascending order, and in case of a tie, the one with the smaller shopi should appear first. If there are less than 5 matching shops, then all of them should be returned. If no shop has an unrented copy, then an empty list should be returned.
    • +
  • Rent: Rents an unrented copy of a given movie from a given shop.
    • +
  • Drop: Drops off a previously rented copy of a given movie at a given shop.
    • +
  • Report: Returns the cheapest 5 rented movies (possibly of the same movie ID) as a 2D list res where res[j] = [shopj, moviej] describes that the jth cheapest rented movie moviej was rented from the shop shopj. The movies in res should be sorted by price in ascending order, and in case of a tie, the one with the smaller shopj should appear first, and if there is still tie, the one with the smaller moviej should appear first. If there are fewer than 5 rented movies, then all of them should be returned. If no movies are currently being rented, then an empty list should be returned.
    • +
+ +

Implement the MovieRentingSystem class:

+ +
    +
  • MovieRentingSystem(int n, int[][] entries) Initializes the MovieRentingSystem object with n shops and the movies in entries.
    • +
  • List<Integer> search(int movie) Returns a list of shops that have an unrented copy of the given movie as described above.
    • +
  • void rent(int shop, int movie) Rents the given movie from the given shop.
    • +
  • void drop(int shop, int movie) Drops off a previously rented movie at the given shop.
    • +
  • List<List<Integer>> report() Returns a list of cheapest rented movies as described above.
    • +
+ +

Note: The test cases will be generated such that rent will only be called if the shop has an unrented copy of the movie, and drop will only be called if the shop had previously rented out the movie.

+ +

 

+

Example 1:

+ +
+Input
+["MovieRentingSystem", "search", "rent", "rent", "report", "drop", "search"]
+[[3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]], [1], [0, 1], [1, 2], [], [1, 2], [2]]
+Output
+[null, [1, 0, 2], null, null, [[0, 1], [1, 2]], null, [0, 1]]
+
+Explanation
+MovieRentingSystem movieRentingSystem = new MovieRentingSystem(3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]);
+movieRentingSystem.search(1);  // return [1, 0, 2], Movies of ID 1 are unrented at shops 1, 0, and 2. Shop 1 is cheapest; shop 0 and 2 are the same price, so order by shop number.
+movieRentingSystem.rent(0, 1); // Rent movie 1 from shop 0. Unrented movies at shop 0 are now [2,3].
+movieRentingSystem.rent(1, 2); // Rent movie 2 from shop 1. Unrented movies at shop 1 are now [1].
+movieRentingSystem.report();   // return [[0, 1], [1, 2]]. Movie 1 from shop 0 is cheapest, followed by movie 2 from shop 1.
+movieRentingSystem.drop(1, 2); // Drop off movie 2 at shop 1. Unrented movies at shop 1 are now [1,2].
+movieRentingSystem.search(2);  // return [0, 1]. Movies of ID 2 are unrented at shops 0 and 1. Shop 0 is cheapest, followed by shop 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 3 * 105
    • +
  • 1 <= entries.length <= 105
    • +
  • 0 <= shopi < n
    • +
  • 1 <= moviei, pricei <= 104
    • +
  • Each shop carries at most one copy of a movie moviei.
    • +
  • At most 105 calls in total will be made to search, rent, drop and report.
    • +
+",3.0,False,"class MovieRentingSystem { +public: + MovieRentingSystem(int n, vector>& entries) { + + } + + vector search(int movie) { + + } + + void rent(int shop, int movie) { + + } + + void drop(int shop, int movie) { + + } + + vector> report() { + + } +}; + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * MovieRentingSystem* obj = new MovieRentingSystem(n, entries); + * vector param_1 = obj->search(movie); + * obj->rent(shop,movie); + * obj->drop(shop,movie); + * vector> param_4 = obj->report(); + */","class MovieRentingSystem { + + public MovieRentingSystem(int n, int[][] entries) { + + } + + public List search(int movie) { + + } + + public void rent(int shop, int movie) { + + } + + public void drop(int shop, int movie) { + + } + + public List> report() { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * MovieRentingSystem obj = new MovieRentingSystem(n, entries); + * List param_1 = obj.search(movie); + * obj.rent(shop,movie); + * obj.drop(shop,movie); + * List> param_4 = obj.report(); + */","class MovieRentingSystem(object): + + def __init__(self, n, entries): + """""" + :type n: int + :type entries: List[List[int]] + """""" + + + def search(self, movie): + """""" + :type movie: int + :rtype: List[int] + """""" + + + def rent(self, shop, movie): + """""" + :type shop: int + :type movie: int + :rtype: None + """""" + + + def drop(self, shop, movie): + """""" + :type shop: int + :type movie: int + :rtype: None + """""" + + + def report(self): + """""" + :rtype: List[List[int]] + """""" + + + +# Your MovieRentingSystem object will be instantiated and called as such: +# obj = MovieRentingSystem(n, entries) +# param_1 = obj.search(movie) +# obj.rent(shop,movie) +# obj.drop(shop,movie) +# param_4 = obj.report()","class MovieRentingSystem: + + def __init__(self, n: int, entries: List[List[int]]): + + + def search(self, movie: int) -> List[int]: + + + def rent(self, shop: int, movie: int) -> None: + + + def drop(self, shop: int, movie: int) -> None: + + + def report(self) -> List[List[int]]: + + + +# Your MovieRentingSystem object will be instantiated and called as such: +# obj = MovieRentingSystem(n, entries) +# param_1 = obj.search(movie) +# obj.rent(shop,movie) +# obj.drop(shop,movie) +# param_4 = obj.report()"," + + +typedef struct { + +} MovieRentingSystem; + + +MovieRentingSystem* movieRentingSystemCreate(int n, int** entries, int entriesSize, int* entriesColSize) { + +} + +int* movieRentingSystemSearch(MovieRentingSystem* obj, int movie, int* retSize) { + +} + +void movieRentingSystemRent(MovieRentingSystem* obj, int shop, int movie) { + +} + +void movieRentingSystemDrop(MovieRentingSystem* obj, int shop, int movie) { + +} + +int** movieRentingSystemReport(MovieRentingSystem* obj, int* retSize, int** retColSize) { + +} + +void movieRentingSystemFree(MovieRentingSystem* obj) { + +} + +/** + * Your MovieRentingSystem struct will be instantiated and called as such: + * MovieRentingSystem* obj = movieRentingSystemCreate(n, entries, entriesSize, entriesColSize); + * int* param_1 = movieRentingSystemSearch(obj, movie, retSize); + + * movieRentingSystemRent(obj, shop, movie); + + * movieRentingSystemDrop(obj, shop, movie); + + * int** param_4 = movieRentingSystemReport(obj, retSize, retColSize); + + * movieRentingSystemFree(obj); +*/","public class MovieRentingSystem { + + public MovieRentingSystem(int n, int[][] entries) { + + } + + public IList Search(int movie) { + + } + + public void Rent(int shop, int movie) { + + } + + public void Drop(int shop, int movie) { + + } + + public IList> Report() { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * MovieRentingSystem obj = new MovieRentingSystem(n, entries); + * IList param_1 = obj.Search(movie); + * obj.Rent(shop,movie); + * obj.Drop(shop,movie); + * IList> param_4 = obj.Report(); + */","/** + * @param {number} n + * @param {number[][]} entries + */ +var MovieRentingSystem = function(n, entries) { + +}; + +/** + * @param {number} movie + * @return {number[]} + */ +MovieRentingSystem.prototype.search = function(movie) { + +}; + +/** + * @param {number} shop + * @param {number} movie + * @return {void} + */ +MovieRentingSystem.prototype.rent = function(shop, movie) { + +}; + +/** + * @param {number} shop + * @param {number} movie + * @return {void} + */ +MovieRentingSystem.prototype.drop = function(shop, movie) { + +}; + +/** + * @return {number[][]} + */ +MovieRentingSystem.prototype.report = function() { + +}; + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * var obj = new MovieRentingSystem(n, entries) + * var param_1 = obj.search(movie) + * obj.rent(shop,movie) + * obj.drop(shop,movie) + * var param_4 = obj.report() + */","class MovieRentingSystem + +=begin + :type n: Integer + :type entries: Integer[][] +=end + def initialize(n, entries) + + end + + +=begin + :type movie: Integer + :rtype: Integer[] +=end + def search(movie) + + end + + +=begin + :type shop: Integer + :type movie: Integer + :rtype: Void +=end + def rent(shop, movie) + + end + + +=begin + :type shop: Integer + :type movie: Integer + :rtype: Void +=end + def drop(shop, movie) + + end + + +=begin + :rtype: Integer[][] +=end + def report() + + end + + +end + +# Your MovieRentingSystem object will be instantiated and called as such: +# obj = MovieRentingSystem.new(n, entries) +# param_1 = obj.search(movie) +# obj.rent(shop, movie) +# obj.drop(shop, movie) +# param_4 = obj.report()"," +class MovieRentingSystem { + + init(_ n: Int, _ entries: [[Int]]) { + + } + + func search(_ movie: Int) -> [Int] { + + } + + func rent(_ shop: Int, _ movie: Int) { + + } + + func drop(_ shop: Int, _ movie: Int) { + + } + + func report() -> [[Int]] { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * let obj = MovieRentingSystem(n, entries) + * let ret_1: [Int] = obj.search(movie) + * obj.rent(shop, movie) + * obj.drop(shop, movie) + * let ret_4: [[Int]] = obj.report() + */","type MovieRentingSystem struct { + +} + + +func Constructor(n int, entries [][]int) MovieRentingSystem { + +} + + +func (this *MovieRentingSystem) Search(movie int) []int { + +} + + +func (this *MovieRentingSystem) Rent(shop int, movie int) { + +} + + +func (this *MovieRentingSystem) Drop(shop int, movie int) { + +} + + +func (this *MovieRentingSystem) Report() [][]int { + +} + + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * obj := Constructor(n, entries); + * param_1 := obj.Search(movie); + * obj.Rent(shop,movie); + * obj.Drop(shop,movie); + * param_4 := obj.Report(); + */","class MovieRentingSystem(_n: Int, _entries: Array[Array[Int]]) { + + def search(movie: Int): List[Int] = { + + } + + def rent(shop: Int, movie: Int) { + + } + + def drop(shop: Int, movie: Int) { + + } + + def report(): List[List[Int]] = { + + } + +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * var obj = new MovieRentingSystem(n, entries) + * var param_1 = obj.search(movie) + * obj.rent(shop,movie) + * obj.drop(shop,movie) + * var param_4 = obj.report() + */","class MovieRentingSystem(n: Int, entries: Array) { + + fun search(movie: Int): List { + + } + + fun rent(shop: Int, movie: Int) { + + } + + fun drop(shop: Int, movie: Int) { + + } + + fun report(): List> { + + } + +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * var obj = MovieRentingSystem(n, entries) + * var param_1 = obj.search(movie) + * obj.rent(shop,movie) + * obj.drop(shop,movie) + * var param_4 = obj.report() + */","struct MovieRentingSystem { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MovieRentingSystem { + + fn new(n: i32, entries: Vec>) -> Self { + + } + + fn search(&self, movie: i32) -> Vec { + + } + + fn rent(&self, shop: i32, movie: i32) { + + } + + fn drop(&self, shop: i32, movie: i32) { + + } + + fn report(&self) -> Vec> { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * let obj = MovieRentingSystem::new(n, entries); + * let ret_1: Vec = obj.search(movie); + * obj.rent(shop, movie); + * obj.drop(shop, movie); + * let ret_4: Vec> = obj.report(); + */","class MovieRentingSystem { + /** + * @param Integer $n + * @param Integer[][] $entries + */ + function __construct($n, $entries) { + + } + + /** + * @param Integer $movie + * @return Integer[] + */ + function search($movie) { + + } + + /** + * @param Integer $shop + * @param Integer $movie + * @return NULL + */ + function rent($shop, $movie) { + + } + + /** + * @param Integer $shop + * @param Integer $movie + * @return NULL + */ + function drop($shop, $movie) { + + } + + /** + * @return Integer[][] + */ + function report() { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * $obj = MovieRentingSystem($n, $entries); + * $ret_1 = $obj->search($movie); + * $obj->rent($shop, $movie); + * $obj->drop($shop, $movie); + * $ret_4 = $obj->report(); + */","class MovieRentingSystem { + constructor(n: number, entries: number[][]) { + + } + + search(movie: number): number[] { + + } + + rent(shop: number, movie: number): void { + + } + + drop(shop: number, movie: number): void { + + } + + report(): number[][] { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * var obj = new MovieRentingSystem(n, entries) + * var param_1 = obj.search(movie) + * obj.rent(shop,movie) + * obj.drop(shop,movie) + * var param_4 = obj.report() + */","(define movie-renting-system% + (class object% + (super-new) + + ; n : exact-integer? + + ; entries : (listof (listof exact-integer?)) + (init-field + n + entries) + + ; search : exact-integer? -> (listof exact-integer?) + (define/public (search movie) + + ) + ; rent : exact-integer? exact-integer? -> void? + (define/public (rent shop movie) + + ) + ; drop : exact-integer? exact-integer? -> void? + (define/public (drop shop movie) + + ) + ; report : -> (listof (listof exact-integer?)) + (define/public (report) + + ))) + +;; Your movie-renting-system% object will be instantiated and called as such: +;; (define obj (new movie-renting-system% [n n] [entries entries])) +;; (define param_1 (send obj search movie)) +;; (send obj rent shop movie) +;; (send obj drop shop movie) +;; (define param_4 (send obj report))",,,"class MovieRentingSystem { + + MovieRentingSystem(int n, List> entries) { + + } + + List search(int movie) { + + } + + void rent(int shop, int movie) { + + } + + void drop(int shop, int movie) { + + } + + List> report() { + + } +} + +/** + * Your MovieRentingSystem object will be instantiated and called as such: + * MovieRentingSystem obj = MovieRentingSystem(n, entries); + * List param1 = obj.search(movie); + * obj.rent(shop,movie); + * obj.drop(shop,movie); + * List> param4 = obj.report(); + */", +653,remove-all-occurrences-of-a-substring,Remove All Occurrences of a Substring,1910.0,2021.0,"

Given two strings s and part, perform the following operation on s until all occurrences of the substring part are removed:

+ +
    +
  • Find the leftmost occurrence of the substring part and remove it from s.
    • +
+ +

Return s after removing all occurrences of part.

+ +

A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: s = "daabcbaabcbc", part = "abc"
+Output: "dab"
+Explanation: The following operations are done:
+- s = "daabcbaabcbc", remove "abc" starting at index 2, so s = "dabaabcbc".
+- s = "dabaabcbc", remove "abc" starting at index 4, so s = "dababc".
+- s = "dababc", remove "abc" starting at index 3, so s = "dab".
+Now s has no occurrences of "abc".
+
+ +

Example 2:

+ +
+Input: s = "axxxxyyyyb", part = "xy"
+Output: "ab"
+Explanation: The following operations are done:
+- s = "axxxxyyyyb", remove "xy" starting at index 4 so s = "axxxyyyb".
+- s = "axxxyyyb", remove "xy" starting at index 3 so s = "axxyyb".
+- s = "axxyyb", remove "xy" starting at index 2 so s = "axyb".
+- s = "axyb", remove "xy" starting at index 1 so s = "ab".
+Now s has no occurrences of "xy".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • 1 <= part.length <= 1000
    • +
  • s​​​​​​ and part consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string removeOccurrences(string s, string part) { + + } +};","class Solution { + public String removeOccurrences(String s, String part) { + + } +}","class Solution(object): + def removeOccurrences(self, s, part): + """""" + :type s: str + :type part: str + :rtype: str + """""" + ","class Solution: + def removeOccurrences(self, s: str, part: str) -> str: + ","char * removeOccurrences(char * s, char * part){ + +}","public class Solution { + public string RemoveOccurrences(string s, string part) { + + } +}","/** + * @param {string} s + * @param {string} part + * @return {string} + */ +var removeOccurrences = function(s, part) { + +};","# @param {String} s +# @param {String} part +# @return {String} +def remove_occurrences(s, part) + +end","class Solution { + func removeOccurrences(_ s: String, _ part: String) -> String { + + } +}","func removeOccurrences(s string, part string) string { + +}","object Solution { + def removeOccurrences(s: String, part: String): String = { + + } +}","class Solution { + fun removeOccurrences(s: String, part: String): String { + + } +}","impl Solution { + pub fn remove_occurrences(s: String, part: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param String $part + * @return String + */ + function removeOccurrences($s, $part) { + + } +}","function removeOccurrences(s: string, part: string): string { + +};","(define/contract (remove-occurrences s part) + (-> string? string? string?) + + )","-spec remove_occurrences(S :: unicode:unicode_binary(), Part :: unicode:unicode_binary()) -> unicode:unicode_binary(). +remove_occurrences(S, Part) -> + .","defmodule Solution do + @spec remove_occurrences(s :: String.t, part :: String.t) :: String.t + def remove_occurrences(s, part) do + + end +end","class Solution { + String removeOccurrences(String s, String part) { + + } +}", +655,minimum-space-wasted-from-packaging,Minimum Space Wasted From Packaging,1889.0,2018.0,"

You have n packages that you are trying to place in boxes, one package in each box. There are m suppliers that each produce boxes of different sizes (with infinite supply). A package can be placed in a box if the size of the package is less than or equal to the size of the box.

+ +

The package sizes are given as an integer array packages, where packages[i] is the size of the ith package. The suppliers are given as a 2D integer array boxes, where boxes[j] is an array of box sizes that the jth supplier produces.

+ +

You want to choose a single supplier and use boxes from them such that the total wasted space is minimized. For each package in a box, we define the space wasted to be size of the box - size of the package. The total wasted space is the sum of the space wasted in all the boxes.

+ +
    +
  • For example, if you have to fit packages with sizes [2,3,5] and the supplier offers boxes of sizes [4,8], you can fit the packages of size-2 and size-3 into two boxes of size-4 and the package with size-5 into a box of size-8. This would result in a waste of (4-2) + (4-3) + (8-5) = 6.
    • +
+ +

Return the minimum total wasted space by choosing the box supplier optimally, or -1 if it is impossible to fit all the packages inside boxes. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: packages = [2,3,5], boxes = [[4,8],[2,8]]
+Output: 6
+Explanation: It is optimal to choose the first supplier, using two size-4 boxes and one size-8 box.
+The total waste is (4-2) + (4-3) + (8-5) = 6.
+
+ +

Example 2:

+ +
+Input: packages = [2,3,5], boxes = [[1,4],[2,3],[3,4]]
+Output: -1
+Explanation: There is no box that the package of size 5 can fit in.
+
+ +

Example 3:

+ +
+Input: packages = [3,5,8,10,11,12], boxes = [[12],[11,9],[10,5,14]]
+Output: 9
+Explanation: It is optimal to choose the third supplier, using two size-5 boxes, two size-10 boxes, and two size-14 boxes.
+The total waste is (5-3) + (5-5) + (10-8) + (10-10) + (14-11) + (14-12) = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • n == packages.length
    • +
  • m == boxes.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= m <= 105
    • +
  • 1 <= packages[i] <= 105
    • +
  • 1 <= boxes[j].length <= 105
    • +
  • 1 <= boxes[j][k] <= 105
    • +
  • sum(boxes[j].length) <= 105
    • +
  • The elements in boxes[j] are distinct.
    • +
+",3.0,False,"class Solution { +public: + int minWastedSpace(vector& packages, vector>& boxes) { + + } +};","class Solution { + public int minWastedSpace(int[] packages, int[][] boxes) { + + } +}","class Solution(object): + def minWastedSpace(self, packages, boxes): + """""" + :type packages: List[int] + :type boxes: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minWastedSpace(self, packages: List[int], boxes: List[List[int]]) -> int: + ","int minWastedSpace(int* packages, int packagesSize, int** boxes, int boxesSize, int* boxesColSize){ + +}","public class Solution { + public int MinWastedSpace(int[] packages, int[][] boxes) { + + } +}","/** + * @param {number[]} packages + * @param {number[][]} boxes + * @return {number} + */ +var minWastedSpace = function(packages, boxes) { + +};","# @param {Integer[]} packages +# @param {Integer[][]} boxes +# @return {Integer} +def min_wasted_space(packages, boxes) + +end","class Solution { + func minWastedSpace(_ packages: [Int], _ boxes: [[Int]]) -> Int { + + } +}","func minWastedSpace(packages []int, boxes [][]int) int { + +}","object Solution { + def minWastedSpace(packages: Array[Int], boxes: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minWastedSpace(packages: IntArray, boxes: Array): Int { + + } +}","impl Solution { + pub fn min_wasted_space(packages: Vec, boxes: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $packages + * @param Integer[][] $boxes + * @return Integer + */ + function minWastedSpace($packages, $boxes) { + + } +}","function minWastedSpace(packages: number[], boxes: number[][]): number { + +};","(define/contract (min-wasted-space packages boxes) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_wasted_space(Packages :: [integer()], Boxes :: [[integer()]]) -> integer(). +min_wasted_space(Packages, Boxes) -> + .","defmodule Solution do + @spec min_wasted_space(packages :: [integer], boxes :: [[integer]]) :: integer + def min_wasted_space(packages, boxes) do + + end +end","class Solution { + int minWastedSpace(List packages, List> boxes) { + + } +}", +657,reduction-operations-to-make-the-array-elements-equal,Reduction Operations to Make the Array Elements Equal,1887.0,2016.0,"

Given an integer array nums, your goal is to make all elements in nums equal. To complete one operation, follow these steps:

+ +
    +
  1. Find the largest value in nums. Let its index be i (0-indexed) and its value be largest. If there are multiple elements with the largest value, pick the smallest i.
    2. +
  2. Find the next largest value in nums strictly smaller than largest. Let its value be nextLargest.
    3. +
  3. Reduce nums[i] to nextLargest.
    4. +
+ +

Return the number of operations to make all elements in nums equal.

+ +

 

+

Example 1:

+ +
+Input: nums = [5,1,3]
+Output: 3
+Explanation: It takes 3 operations to make all elements in nums equal:
+1. largest = 5 at index 0. nextLargest = 3. Reduce nums[0] to 3. nums = [3,1,3].
+2. largest = 3 at index 0. nextLargest = 1. Reduce nums[0] to 1. nums = [1,1,3].
+3. largest = 3 at index 2. nextLargest = 1. Reduce nums[2] to 1. nums = [1,1,1].
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1]
+Output: 0
+Explanation: All elements in nums are already equal.
+
+ +

Example 3:

+ +
+Input: nums = [1,1,2,2,3]
+Output: 4
+Explanation: It takes 4 operations to make all elements in nums equal:
+1. largest = 3 at index 4. nextLargest = 2. Reduce nums[4] to 2. nums = [1,1,2,2,2].
+2. largest = 2 at index 2. nextLargest = 1. Reduce nums[2] to 1. nums = [1,1,1,2,2].
+3. largest = 2 at index 3. nextLargest = 1. Reduce nums[3] to 1. nums = [1,1,1,1,2].
+4. largest = 2 at index 4. nextLargest = 1. Reduce nums[4] to 1. nums = [1,1,1,1,1].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5 * 104
    • +
  • 1 <= nums[i] <= 5 * 104
    • +
+",2.0,False,"class Solution { +public: + int reductionOperations(vector& nums) { + + } +};","class Solution { + public int reductionOperations(int[] nums) { + + } +}","class Solution(object): + def reductionOperations(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def reductionOperations(self, nums: List[int]) -> int: + ","int reductionOperations(int* nums, int numsSize){ + +}","public class Solution { + public int ReductionOperations(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var reductionOperations = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def reduction_operations(nums) + +end","class Solution { + func reductionOperations(_ nums: [Int]) -> Int { + + } +}","func reductionOperations(nums []int) int { + +}","object Solution { + def reductionOperations(nums: Array[Int]): Int = { + + } +}","class Solution { + fun reductionOperations(nums: IntArray): Int { + + } +}","impl Solution { + pub fn reduction_operations(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function reductionOperations($nums) { + + } +}","function reductionOperations(nums: number[]): number { + +};","(define/contract (reduction-operations nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec reduction_operations(Nums :: [integer()]) -> integer(). +reduction_operations(Nums) -> + .","defmodule Solution do + @spec reduction_operations(nums :: [integer]) :: integer + def reduction_operations(nums) do + + end +end","class Solution { + int reductionOperations(List nums) { + + } +}", +658,determine-whether-matrix-can-be-obtained-by-rotation,Determine Whether Matrix Can Be Obtained By Rotation,1886.0,2015.0,"

Given two n x n binary matrices mat and target, return true if it is possible to make mat equal to target by rotating mat in 90-degree increments, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: mat = [[0,1],[1,0]], target = [[1,0],[0,1]]
+Output: true
+Explanation: We can rotate mat 90 degrees clockwise to make mat equal target.
+
+ +

Example 2:

+ +
+Input: mat = [[0,1],[1,1]], target = [[1,0],[0,1]]
+Output: false
+Explanation: It is impossible to make mat equal to target by rotating mat.
+
+ +

Example 3:

+ +
+Input: mat = [[0,0,0],[0,1,0],[1,1,1]], target = [[1,1,1],[0,1,0],[0,0,0]]
+Output: true
+Explanation: We can rotate mat 90 degrees clockwise two times to make mat equal target.
+
+ +

 

+

Constraints:

+ +
    +
  • n == mat.length == target.length
    • +
  • n == mat[i].length == target[i].length
    • +
  • 1 <= n <= 10
    • +
  • mat[i][j] and target[i][j] are either 0 or 1.
    • +
+",1.0,False,"class Solution { +public: + bool findRotation(vector>& mat, vector>& target) { + + } +};","class Solution { + public boolean findRotation(int[][] mat, int[][] target) { + + } +}","class Solution(object): + def findRotation(self, mat, target): + """""" + :type mat: List[List[int]] + :type target: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def findRotation(self, mat: List[List[int]], target: List[List[int]]) -> bool: + ","bool findRotation(int** mat, int matSize, int* matColSize, int** target, int targetSize, int* targetColSize){ + +}","public class Solution { + public bool FindRotation(int[][] mat, int[][] target) { + + } +}","/** + * @param {number[][]} mat + * @param {number[][]} target + * @return {boolean} + */ +var findRotation = function(mat, target) { + +};","# @param {Integer[][]} mat +# @param {Integer[][]} target +# @return {Boolean} +def find_rotation(mat, target) + +end","class Solution { + func findRotation(_ mat: [[Int]], _ target: [[Int]]) -> Bool { + + } +}","func findRotation(mat [][]int, target [][]int) bool { + +}","object Solution { + def findRotation(mat: Array[Array[Int]], target: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun findRotation(mat: Array, target: Array): Boolean { + + } +}","impl Solution { + pub fn find_rotation(mat: Vec>, target: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @param Integer[][] $target + * @return Boolean + */ + function findRotation($mat, $target) { + + } +}","function findRotation(mat: number[][], target: number[][]): boolean { + +};","(define/contract (find-rotation mat target) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) boolean?) + + )","-spec find_rotation(Mat :: [[integer()]], Target :: [[integer()]]) -> boolean(). +find_rotation(Mat, Target) -> + .","defmodule Solution do + @spec find_rotation(mat :: [[integer]], target :: [[integer]]) :: boolean + def find_rotation(mat, target) do + + end +end","class Solution { + bool findRotation(List> mat, List> target) { + + } +}", +659,minimum-skips-to-arrive-at-meeting-on-time,Minimum Skips to Arrive at Meeting On Time,1883.0,2013.0,"

You are given an integer hoursBefore, the number of hours you have to travel to your meeting. To arrive at your meeting, you have to travel through n roads. The road lengths are given as an integer array dist of length n, where dist[i] describes the length of the ith road in kilometers. In addition, you are given an integer speed, which is the speed (in km/h) you will travel at.

+ +

After you travel road i, you must rest and wait for the next integer hour before you can begin traveling on the next road. Note that you do not have to rest after traveling the last road because you are already at the meeting.

+ +
    +
  • For example, if traveling a road takes 1.4 hours, you must wait until the 2 hour mark before traveling the next road. If traveling a road takes exactly 2 hours, you do not need to wait.
    • +
+ +

However, you are allowed to skip some rests to be able to arrive on time, meaning you do not need to wait for the next integer hour. Note that this means you may finish traveling future roads at different hour marks.

+ +
    +
  • For example, suppose traveling the first road takes 1.4 hours and traveling the second road takes 0.6 hours. Skipping the rest after the first road will mean you finish traveling the second road right at the 2 hour mark, letting you start traveling the third road immediately.
    • +
+ +

Return the minimum number of skips required to arrive at the meeting on time, or -1 if it is impossible.

+ +

 

+

Example 1:

+ +
+Input: dist = [1,3,2], speed = 4, hoursBefore = 2
+Output: 1
+Explanation:
+Without skipping any rests, you will arrive in (1/4 + 3/4) + (3/4 + 1/4) + (2/4) = 2.5 hours.
+You can skip the first rest to arrive in ((1/4 + 0) + (3/4 + 0)) + (2/4) = 1.5 hours.
+Note that the second rest is shortened because you finish traveling the second road at an integer hour due to skipping the first rest.
+
+ +

Example 2:

+ +
+Input: dist = [7,3,5,5], speed = 2, hoursBefore = 10
+Output: 2
+Explanation:
+Without skipping any rests, you will arrive in (7/2 + 1/2) + (3/2 + 1/2) + (5/2 + 1/2) + (5/2) = 11.5 hours.
+You can skip the first and third rest to arrive in ((7/2 + 0) + (3/2 + 0)) + ((5/2 + 0) + (5/2)) = 10 hours.
+
+ +

Example 3:

+ +
+Input: dist = [7,3,5,5], speed = 1, hoursBefore = 10
+Output: -1
+Explanation: It is impossible to arrive at the meeting on time even if you skip all the rests.
+
+ +

 

+

Constraints:

+ +
    +
  • n == dist.length
    • +
  • 1 <= n <= 1000
    • +
  • 1 <= dist[i] <= 105
    • +
  • 1 <= speed <= 106
    • +
  • 1 <= hoursBefore <= 107
    • +
+",3.0,False,"class Solution { +public: + int minSkips(vector& dist, int speed, int hoursBefore) { + + } +};","class Solution { + public int minSkips(int[] dist, int speed, int hoursBefore) { + + } +}","class Solution(object): + def minSkips(self, dist, speed, hoursBefore): + """""" + :type dist: List[int] + :type speed: int + :type hoursBefore: int + :rtype: int + """""" + ","class Solution: + def minSkips(self, dist: List[int], speed: int, hoursBefore: int) -> int: + ","int minSkips(int* dist, int distSize, int speed, int hoursBefore){ + +}","public class Solution { + public int MinSkips(int[] dist, int speed, int hoursBefore) { + + } +}","/** + * @param {number[]} dist + * @param {number} speed + * @param {number} hoursBefore + * @return {number} + */ +var minSkips = function(dist, speed, hoursBefore) { + +};","# @param {Integer[]} dist +# @param {Integer} speed +# @param {Integer} hours_before +# @return {Integer} +def min_skips(dist, speed, hours_before) + +end","class Solution { + func minSkips(_ dist: [Int], _ speed: Int, _ hoursBefore: Int) -> Int { + + } +}","func minSkips(dist []int, speed int, hoursBefore int) int { + +}","object Solution { + def minSkips(dist: Array[Int], speed: Int, hoursBefore: Int): Int = { + + } +}","class Solution { + fun minSkips(dist: IntArray, speed: Int, hoursBefore: Int): Int { + + } +}","impl Solution { + pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $dist + * @param Integer $speed + * @param Integer $hoursBefore + * @return Integer + */ + function minSkips($dist, $speed, $hoursBefore) { + + } +}","function minSkips(dist: number[], speed: number, hoursBefore: number): number { + +};","(define/contract (min-skips dist speed hoursBefore) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec min_skips(Dist :: [integer()], Speed :: integer(), HoursBefore :: integer()) -> integer(). +min_skips(Dist, Speed, HoursBefore) -> + .","defmodule Solution do + @spec min_skips(dist :: [integer], speed :: integer, hours_before :: integer) :: integer + def min_skips(dist, speed, hours_before) do + + end +end","class Solution { + int minSkips(List dist, int speed, int hoursBefore) { + + } +}", +662,check-if-word-equals-summation-of-two-words,Check if Word Equals Summation of Two Words,1880.0,2010.0,"

The letter value of a letter is its position in the alphabet starting from 0 (i.e. 'a' -> 0, 'b' -> 1, 'c' -> 2, etc.).

+ +

The numerical value of some string of lowercase English letters s is the concatenation of the letter values of each letter in s, which is then converted into an integer.

+ +
    +
  • For example, if s = "acb", we concatenate each letter's letter value, resulting in "021". After converting it, we get 21.
    • +
+ +

You are given three strings firstWord, secondWord, and targetWord, each consisting of lowercase English letters 'a' through 'j' inclusive.

+ +

Return true if the summation of the numerical values of firstWord and secondWord equals the numerical value of targetWord, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: firstWord = "acb", secondWord = "cba", targetWord = "cdb"
+Output: true
+Explanation:
+The numerical value of firstWord is "acb" -> "021" -> 21.
+The numerical value of secondWord is "cba" -> "210" -> 210.
+The numerical value of targetWord is "cdb" -> "231" -> 231.
+We return true because 21 + 210 == 231.
+
+ +

Example 2:

+ +
+Input: firstWord = "aaa", secondWord = "a", targetWord = "aab"
+Output: false
+Explanation: 
+The numerical value of firstWord is "aaa" -> "000" -> 0.
+The numerical value of secondWord is "a" -> "0" -> 0.
+The numerical value of targetWord is "aab" -> "001" -> 1.
+We return false because 0 + 0 != 1.
+
+ +

Example 3:

+ +
+Input: firstWord = "aaa", secondWord = "a", targetWord = "aaaa"
+Output: true
+Explanation: 
+The numerical value of firstWord is "aaa" -> "000" -> 0.
+The numerical value of secondWord is "a" -> "0" -> 0.
+The numerical value of targetWord is "aaaa" -> "0000" -> 0.
+We return true because 0 + 0 == 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= firstWord.length, secondWord.length, targetWord.length <= 8
    • +
  • firstWord, secondWord, and targetWord consist of lowercase English letters from 'a' to 'j' inclusive.
    • +
+",1.0,False,"class Solution { +public: + bool isSumEqual(string firstWord, string secondWord, string targetWord) { + + } +};","class Solution { + public boolean isSumEqual(String firstWord, String secondWord, String targetWord) { + + } +}","class Solution(object): + def isSumEqual(self, firstWord, secondWord, targetWord): + """""" + :type firstWord: str + :type secondWord: str + :type targetWord: str + :rtype: bool + """""" + ","class Solution: + def isSumEqual(self, firstWord: str, secondWord: str, targetWord: str) -> bool: + ","bool isSumEqual(char * firstWord, char * secondWord, char * targetWord){ + +}","public class Solution { + public bool IsSumEqual(string firstWord, string secondWord, string targetWord) { + + } +}","/** + * @param {string} firstWord + * @param {string} secondWord + * @param {string} targetWord + * @return {boolean} + */ +var isSumEqual = function(firstWord, secondWord, targetWord) { + +};","# @param {String} first_word +# @param {String} second_word +# @param {String} target_word +# @return {Boolean} +def is_sum_equal(first_word, second_word, target_word) + +end","class Solution { + func isSumEqual(_ firstWord: String, _ secondWord: String, _ targetWord: String) -> Bool { + + } +}","func isSumEqual(firstWord string, secondWord string, targetWord string) bool { + +}","object Solution { + def isSumEqual(firstWord: String, secondWord: String, targetWord: String): Boolean = { + + } +}","class Solution { + fun isSumEqual(firstWord: String, secondWord: String, targetWord: String): Boolean { + + } +}","impl Solution { + pub fn is_sum_equal(first_word: String, second_word: String, target_word: String) -> bool { + + } +}","class Solution { + + /** + * @param String $firstWord + * @param String $secondWord + * @param String $targetWord + * @return Boolean + */ + function isSumEqual($firstWord, $secondWord, $targetWord) { + + } +}","function isSumEqual(firstWord: string, secondWord: string, targetWord: string): boolean { + +};","(define/contract (is-sum-equal firstWord secondWord targetWord) + (-> string? string? string? boolean?) + + )","-spec is_sum_equal(FirstWord :: unicode:unicode_binary(), SecondWord :: unicode:unicode_binary(), TargetWord :: unicode:unicode_binary()) -> boolean(). +is_sum_equal(FirstWord, SecondWord, TargetWord) -> + .","defmodule Solution do + @spec is_sum_equal(first_word :: String.t, second_word :: String.t, target_word :: String.t) :: boolean + def is_sum_equal(first_word, second_word, target_word) do + + end +end","class Solution { + bool isSumEqual(String firstWord, String secondWord, String targetWord) { + + } +}", +663,minimum-cost-to-change-the-final-value-of-expression,Minimum Cost to Change the Final Value of Expression,1896.0,2008.0,"

You are given a valid boolean expression as a string expression consisting of the characters '1','0','&' (bitwise AND operator),'|' (bitwise OR operator),'(', and ')'.

+ +
    +
  • For example, "()1|1" and "(1)&()" are not valid while "1", "(((1))|(0))", and "1|(0&(1))" are valid expressions.
    • +
+ +

Return the minimum cost to change the final value of the expression.

+ +
    +
  • For example, if expression = "1|1|(0&0)&1", its value is 1|1|(0&0)&1 = 1|1|0&1 = 1|0&1 = 1&1 = 1. We want to apply operations so that the new expression evaluates to 0.
    • +
+ +

The cost of changing the final value of an expression is the number of operations performed on the expression. The types of operations are described as follows:

+ +
    +
  • Turn a '1' into a '0'.
    • +
  • Turn a '0' into a '1'.
    • +
  • Turn a '&' into a '|'.
    • +
  • Turn a '|' into a '&'.
    • +
+ +

Note: '&' does not take precedence over '|' in the order of calculation. Evaluate parentheses first, then in left-to-right order.

+ +

 

+

Example 1:

+ +
+Input: expression = "1&(0|1)"
+Output: 1
+Explanation: We can turn "1&(0|1)" into "1&(0&1)" by changing the '|' to a '&' using 1 operation.
+The new expression evaluates to 0. 
+
+ +

Example 2:

+ +
+Input: expression = "(0&0)&(0&0&0)"
+Output: 3
+Explanation: We can turn "(0&0)&(0&0&0)" into "(0|1)|(0&0&0)" using 3 operations.
+The new expression evaluates to 1.
+
+ +

Example 3:

+ +
+Input: expression = "(0|(1|0&1))"
+Output: 1
+Explanation: We can turn "(0|(1|0&1))" into "(0|(0|0&1))" using 1 operation.
+The new expression evaluates to 0.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= expression.length <= 105
    • +
  • expression only contains '1','0','&','|','(', and ')'
    • +
  • All parentheses are properly matched.
    • +
  • There will be no empty parentheses (i.e: "()" is not a substring of expression).
    • +
+",3.0,False,"class Solution { +public: + int minOperationsToFlip(string expression) { + + } +};","class Solution { + public int minOperationsToFlip(String expression) { + + } +}","class Solution(object): + def minOperationsToFlip(self, expression): + """""" + :type expression: str + :rtype: int + """""" + ","class Solution: + def minOperationsToFlip(self, expression: str) -> int: + ","int minOperationsToFlip(char * expression){ + +}","public class Solution { + public int MinOperationsToFlip(string expression) { + + } +}","/** + * @param {string} expression + * @return {number} + */ +var minOperationsToFlip = function(expression) { + +};","# @param {String} expression +# @return {Integer} +def min_operations_to_flip(expression) + +end","class Solution { + func minOperationsToFlip(_ expression: String) -> Int { + + } +}","func minOperationsToFlip(expression string) int { + +}","object Solution { + def minOperationsToFlip(expression: String): Int = { + + } +}","class Solution { + fun minOperationsToFlip(expression: String): Int { + + } +}","impl Solution { + pub fn min_operations_to_flip(expression: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $expression + * @return Integer + */ + function minOperationsToFlip($expression) { + + } +}","function minOperationsToFlip(expression: string): number { + +};","(define/contract (min-operations-to-flip expression) + (-> string? exact-integer?) + + )","-spec min_operations_to_flip(Expression :: unicode:unicode_binary()) -> integer(). +min_operations_to_flip(Expression) -> + .","defmodule Solution do + @spec min_operations_to_flip(expression :: String.t) :: integer + def min_operations_to_flip(expression) do + + end +end","class Solution { + int minOperationsToFlip(String expression) { + + } +}", +664,find-the-student-that-will-replace-the-chalk,Find the Student that Will Replace the Chalk,1894.0,2006.0,"

There are n students in a class numbered from 0 to n - 1. The teacher will give each student a problem starting with the student number 0, then the student number 1, and so on until the teacher reaches the student number n - 1. After that, the teacher will restart the process, starting with the student number 0 again.

+ +

You are given a 0-indexed integer array chalk and an integer k. There are initially k pieces of chalk. When the student number i is given a problem to solve, they will use chalk[i] pieces of chalk to solve that problem. However, if the current number of chalk pieces is strictly less than chalk[i], then the student number i will be asked to replace the chalk.

+ +

Return the index of the student that will replace the chalk pieces.

+ +

 

+

Example 1:

+ +
+Input: chalk = [5,1,5], k = 22
+Output: 0
+Explanation: The students go in turns as follows:
+- Student number 0 uses 5 chalk, so k = 17.
+- Student number 1 uses 1 chalk, so k = 16.
+- Student number 2 uses 5 chalk, so k = 11.
+- Student number 0 uses 5 chalk, so k = 6.
+- Student number 1 uses 1 chalk, so k = 5.
+- Student number 2 uses 5 chalk, so k = 0.
+Student number 0 does not have enough chalk, so they will have to replace it.
+ +

Example 2:

+ +
+Input: chalk = [3,4,1,2], k = 25
+Output: 1
+Explanation: The students go in turns as follows:
+- Student number 0 uses 3 chalk so k = 22.
+- Student number 1 uses 4 chalk so k = 18.
+- Student number 2 uses 1 chalk so k = 17.
+- Student number 3 uses 2 chalk so k = 15.
+- Student number 0 uses 3 chalk so k = 12.
+- Student number 1 uses 4 chalk so k = 8.
+- Student number 2 uses 1 chalk so k = 7.
+- Student number 3 uses 2 chalk so k = 5.
+- Student number 0 uses 3 chalk so k = 2.
+Student number 1 does not have enough chalk, so they will have to replace it.
+
+ +

 

+

Constraints:

+ +
    +
  • chalk.length == n
    • +
  • 1 <= n <= 105
    • +
  • 1 <= chalk[i] <= 105
    • +
  • 1 <= k <= 109
    • +
+",2.0,False,"class Solution { +public: + int chalkReplacer(vector& chalk, int k) { + + } +};","class Solution { + public int chalkReplacer(int[] chalk, int k) { + + } +}","class Solution(object): + def chalkReplacer(self, chalk, k): + """""" + :type chalk: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def chalkReplacer(self, chalk: List[int], k: int) -> int: + ","int chalkReplacer(int* chalk, int chalkSize, int k){ + +}","public class Solution { + public int ChalkReplacer(int[] chalk, int k) { + + } +}","/** + * @param {number[]} chalk + * @param {number} k + * @return {number} + */ +var chalkReplacer = function(chalk, k) { + +};","# @param {Integer[]} chalk +# @param {Integer} k +# @return {Integer} +def chalk_replacer(chalk, k) + +end","class Solution { + func chalkReplacer(_ chalk: [Int], _ k: Int) -> Int { + + } +}","func chalkReplacer(chalk []int, k int) int { + +}","object Solution { + def chalkReplacer(chalk: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun chalkReplacer(chalk: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn chalk_replacer(chalk: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $chalk + * @param Integer $k + * @return Integer + */ + function chalkReplacer($chalk, $k) { + + } +}","function chalkReplacer(chalk: number[], k: number): number { + +};","(define/contract (chalk-replacer chalk k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec chalk_replacer(Chalk :: [integer()], K :: integer()) -> integer(). +chalk_replacer(Chalk, K) -> + .","defmodule Solution do + @spec chalk_replacer(chalk :: [integer], k :: integer) :: integer + def chalk_replacer(chalk, k) do + + end +end","class Solution { + int chalkReplacer(List chalk, int k) { + + } +}", +666,stone-game-viii,Stone Game VIII,1872.0,2002.0,"

Alice and Bob take turns playing a game, with Alice starting first.

+ +

There are n stones arranged in a row. On each player's turn, while the number of stones is more than one, they will do the following:

+ +
    +
  1. Choose an integer x > 1, and remove the leftmost x stones from the row.
    2. +
  2. Add the sum of the removed stones' values to the player's score.
    3. +
  3. Place a new stone, whose value is equal to that sum, on the left side of the row.
    4. +
+ +

The game stops when only one stone is left in the row.

+ +

The score difference between Alice and Bob is (Alice's score - Bob's score). Alice's goal is to maximize the score difference, and Bob's goal is the minimize the score difference.

+ +

Given an integer array stones of length n where stones[i] represents the value of the ith stone from the left, return the score difference between Alice and Bob if they both play optimally.

+ +

 

+

Example 1:

+ +
+Input: stones = [-1,2,-3,4,-5]
+Output: 5
+Explanation:
+- Alice removes the first 4 stones, adds (-1) + 2 + (-3) + 4 = 2 to her score, and places a stone of
+  value 2 on the left. stones = [2,-5].
+- Bob removes the first 2 stones, adds 2 + (-5) = -3 to his score, and places a stone of value -3 on
+  the left. stones = [-3].
+The difference between their scores is 2 - (-3) = 5.
+
+ +

Example 2:

+ +
+Input: stones = [7,-6,5,10,5,-2,-6]
+Output: 13
+Explanation:
+- Alice removes all stones, adds 7 + (-6) + 5 + 10 + 5 + (-2) + (-6) = 13 to her score, and places a
+  stone of value 13 on the left. stones = [13].
+The difference between their scores is 13 - 0 = 13.
+
+ +

Example 3:

+ +
+Input: stones = [-10,-12]
+Output: -22
+Explanation:
+- Alice can only make one move, which is to remove both stones. She adds (-10) + (-12) = -22 to her
+  score and places a stone of value -22 on the left. stones = [-22].
+The difference between their scores is (-22) - 0 = -22.
+
+ +

 

+

Constraints:

+ +
    +
  • n == stones.length
    • +
  • 2 <= n <= 105
    • +
  • -104 <= stones[i] <= 104
    • +
",3.0,False,"class Solution { +public: + int stoneGameVIII(vector& stones) { + + } +};","class Solution { + public int stoneGameVIII(int[] stones) { + + } +}","class Solution(object): + def stoneGameVIII(self, stones): + """""" + :type stones: List[int] + :rtype: int + """""" + ","class Solution: + def stoneGameVIII(self, stones: List[int]) -> int: + "," + +int stoneGameVIII(int* stones, int stonesSize){ + +}","public class Solution { + public int StoneGameVIII(int[] stones) { + + } +}","/** + * @param {number[]} stones + * @return {number} + */ +var stoneGameVIII = function(stones) { + +};","# @param {Integer[]} stones +# @return {Integer} +def stone_game_viii(stones) + +end","class Solution { + func stoneGameVIII(_ stones: [Int]) -> Int { + + } +}","func stoneGameVIII(stones []int) int { + +}","object Solution { + def stoneGameVIII(stones: Array[Int]): Int = { + + } +}","class Solution { + fun stoneGameVIII(stones: IntArray): Int { + + } +}","impl Solution { + pub fn stone_game_viii(stones: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $stones + * @return Integer + */ + function stoneGameVIII($stones) { + + } +}","function stoneGameVIII(stones: number[]): number { + +};","(define/contract (stone-game-viii stones) + (-> (listof exact-integer?) exact-integer?) + + )",,,, +668,minimum-speed-to-arrive-on-time,Minimum Speed to Arrive on Time,1870.0,2000.0,"

You are given a floating-point number hour, representing the amount of time you have to reach the office. To commute to the office, you must take n trains in sequential order. You are also given an integer array dist of length n, where dist[i] describes the distance (in kilometers) of the ith train ride.

+ +

Each train can only depart at an integer hour, so you may need to wait in between each train ride.

+ +
    +
  • For example, if the 1st train ride takes 1.5 hours, you must wait for an additional 0.5 hours before you can depart on the 2nd train ride at the 2 hour mark.
    • +
+ +

Return the minimum positive integer speed (in kilometers per hour) that all the trains must travel at for you to reach the office on time, or -1 if it is impossible to be on time.

+ +

Tests are generated such that the answer will not exceed 107 and hour will have at most two digits after the decimal point.

+ +

 

+

Example 1:

+ +
+Input: dist = [1,3,2], hour = 6
+Output: 1
+Explanation: At speed 1:
+- The first train ride takes 1/1 = 1 hour.
+- Since we are already at an integer hour, we depart immediately at the 1 hour mark. The second train takes 3/1 = 3 hours.
+- Since we are already at an integer hour, we depart immediately at the 4 hour mark. The third train takes 2/1 = 2 hours.
+- You will arrive at exactly the 6 hour mark.
+
+ +

Example 2:

+ +
+Input: dist = [1,3,2], hour = 2.7
+Output: 3
+Explanation: At speed 3:
+- The first train ride takes 1/3 = 0.33333 hours.
+- Since we are not at an integer hour, we wait until the 1 hour mark to depart. The second train ride takes 3/3 = 1 hour.
+- Since we are already at an integer hour, we depart immediately at the 2 hour mark. The third train takes 2/3 = 0.66667 hours.
+- You will arrive at the 2.66667 hour mark.
+
+ +

Example 3:

+ +
+Input: dist = [1,3,2], hour = 1.9
+Output: -1
+Explanation: It is impossible because the earliest the third train can depart is at the 2 hour mark.
+
+ +

 

+

Constraints:

+ +
    +
  • n == dist.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= dist[i] <= 105
    • +
  • 1 <= hour <= 109
    • +
  • There will be at most two digits after the decimal point in hour.
    • +
+",2.0,False,"class Solution { +public: + int minSpeedOnTime(vector& dist, double hour) { + + } +};","class Solution { + public int minSpeedOnTime(int[] dist, double hour) { + + } +}","class Solution(object): + def minSpeedOnTime(self, dist, hour): + """""" + :type dist: List[int] + :type hour: float + :rtype: int + """""" + ","class Solution: + def minSpeedOnTime(self, dist: List[int], hour: float) -> int: + ","int minSpeedOnTime(int* dist, int distSize, double hour){ + +}","public class Solution { + public int MinSpeedOnTime(int[] dist, double hour) { + + } +}","/** + * @param {number[]} dist + * @param {number} hour + * @return {number} + */ +var minSpeedOnTime = function(dist, hour) { + +};","# @param {Integer[]} dist +# @param {Float} hour +# @return {Integer} +def min_speed_on_time(dist, hour) + +end","class Solution { + func minSpeedOnTime(_ dist: [Int], _ hour: Double) -> Int { + + } +}","func minSpeedOnTime(dist []int, hour float64) int { + +}","object Solution { + def minSpeedOnTime(dist: Array[Int], hour: Double): Int = { + + } +}","class Solution { + fun minSpeedOnTime(dist: IntArray, hour: Double): Int { + + } +}","impl Solution { + pub fn min_speed_on_time(dist: Vec, hour: f64) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $dist + * @param Float $hour + * @return Integer + */ + function minSpeedOnTime($dist, $hour) { + + } +}","function minSpeedOnTime(dist: number[], hour: number): number { + +};","(define/contract (min-speed-on-time dist hour) + (-> (listof exact-integer?) flonum? exact-integer?) + + )","-spec min_speed_on_time(Dist :: [integer()], Hour :: float()) -> integer(). +min_speed_on_time(Dist, Hour) -> + .","defmodule Solution do + @spec min_speed_on_time(dist :: [integer], hour :: float) :: integer + def min_speed_on_time(dist, hour) do + + end +end","class Solution { + int minSpeedOnTime(List dist, double hour) { + + } +}", +670,number-of-ways-to-rearrange-sticks-with-k-sticks-visible,Number of Ways to Rearrange Sticks With K Sticks Visible,1866.0,1996.0,"

There are n uniquely-sized sticks whose lengths are integers from 1 to n. You want to arrange the sticks such that exactly k sticks are visible from the left. A stick is visible from the left if there are no longer sticks to the left of it.

+ +
    +
  • For example, if the sticks are arranged [1,3,2,5,4], then the sticks with lengths 1, 3, and 5 are visible from the left.
    • +
+ +

Given n and k, return the number of such arrangements. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 3, k = 2
+Output: 3
+Explanation: [1,3,2], [2,3,1], and [2,1,3] are the only arrangements such that exactly 2 sticks are visible.
+The visible sticks are underlined.
+
+ +

Example 2:

+ +
+Input: n = 5, k = 5
+Output: 1
+Explanation: [1,2,3,4,5] is the only arrangement such that all 5 sticks are visible.
+The visible sticks are underlined.
+
+ +

Example 3:

+ +
+Input: n = 20, k = 11
+Output: 647427950
+Explanation: There are 647427950 (mod 109 + 7) ways to rearrange the sticks such that exactly 11 sticks are visible.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
  • 1 <= k <= n
    • +
+",3.0,False,"class Solution { +public: + int rearrangeSticks(int n, int k) { + + } +};","class Solution { + public int rearrangeSticks(int n, int k) { + + } +}","class Solution(object): + def rearrangeSticks(self, n, k): + """""" + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def rearrangeSticks(self, n: int, k: int) -> int: + ","int rearrangeSticks(int n, int k){ + +}","public class Solution { + public int RearrangeSticks(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var rearrangeSticks = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def rearrange_sticks(n, k) + +end","class Solution { + func rearrangeSticks(_ n: Int, _ k: Int) -> Int { + + } +}","func rearrangeSticks(n int, k int) int { + +}","object Solution { + def rearrangeSticks(n: Int, k: Int): Int = { + + } +}","class Solution { + fun rearrangeSticks(n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn rearrange_sticks(n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function rearrangeSticks($n, $k) { + + } +}","function rearrangeSticks(n: number, k: number): number { + +};","(define/contract (rearrange-sticks n k) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec rearrange_sticks(N :: integer(), K :: integer()) -> integer(). +rearrange_sticks(N, K) -> + .","defmodule Solution do + @spec rearrange_sticks(n :: integer, k :: integer) :: integer + def rearrange_sticks(n, k) do + + end +end","class Solution { + int rearrangeSticks(int n, int k) { + + } +}", +672,minimum-number-of-swaps-to-make-the-binary-string-alternating,Minimum Number of Swaps to Make the Binary String Alternating,1864.0,1994.0,"

Given a binary string s, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.

+ +

The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.

+ +

Any two characters may be swapped, even if they are not adjacent.

+ +

 

+

Example 1:

+ +
+Input: s = "111000"
+Output: 1
+Explanation: Swap positions 1 and 4: "111000" -> "101010"
+The string is now alternating.
+
+ +

Example 2:

+ +
+Input: s = "010"
+Output: 0
+Explanation: The string is already alternating, no swaps are needed.
+
+ +

Example 3:

+ +
+Input: s = "1110"
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s[i] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + int minSwaps(string s) { + + } +};","class Solution { + public int minSwaps(String s) { + + } +}","class Solution(object): + def minSwaps(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minSwaps(self, s: str) -> int: + ","int minSwaps(char * s){ + +}","public class Solution { + public int MinSwaps(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minSwaps = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_swaps(s) + +end","class Solution { + func minSwaps(_ s: String) -> Int { + + } +}","func minSwaps(s string) int { + +}","object Solution { + def minSwaps(s: String): Int = { + + } +}","class Solution { + fun minSwaps(s: String): Int { + + } +}","impl Solution { + pub fn min_swaps(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minSwaps($s) { + + } +}","function minSwaps(s: string): number { + +};","(define/contract (min-swaps s) + (-> string? exact-integer?) + + )","-spec min_swaps(S :: unicode:unicode_binary()) -> integer(). +min_swaps(S) -> + .","defmodule Solution do + @spec min_swaps(s :: String.t) :: integer + def min_swaps(s) do + + end +end","class Solution { + int minSwaps(String s) { + + } +}", +674,get-biggest-three-rhombus-sums-in-a-grid,Get Biggest Three Rhombus Sums in a Grid,1878.0,1990.0,"

You are given an m x n integer matrix grid​​​.

+ +

A rhombus sum is the sum of the elements that form the border of a regular rhombus shape in grid​​​. The rhombus must have the shape of a square rotated 45 degrees with each of the corners centered in a grid cell. Below is an image of four valid rhombus shapes with the corresponding colored cells that should be included in each rhombus sum:

+ +

Note that the rhombus can have an area of 0, which is depicted by the purple rhombus in the bottom right corner.

+ +

Return the biggest three distinct rhombus sums in the grid in descending order. If there are less than three distinct values, return all of them.

+ +

 

+

Example 1:

+ +
+Input: grid = [[3,4,5,1,3],[3,3,4,2,3],[20,30,200,40,10],[1,5,5,4,1],[4,3,2,2,5]]
+Output: [228,216,211]
+Explanation: The rhombus shapes for the three biggest distinct rhombus sums are depicted above.
+- Blue: 20 + 3 + 200 + 5 = 228
+- Red: 200 + 2 + 10 + 4 = 216
+- Green: 5 + 200 + 4 + 2 = 211
+
+ +

Example 2:

+ +
+Input: grid = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [20,9,8]
+Explanation: The rhombus shapes for the three biggest distinct rhombus sums are depicted above.
+- Blue: 4 + 2 + 6 + 8 = 20
+- Red: 9 (area 0 rhombus in the bottom right corner)
+- Green: 8 (area 0 rhombus in the bottom middle)
+
+ +

Example 3:

+ +
+Input: grid = [[7,7,7]]
+Output: [7]
+Explanation: All three possible rhombus sums are the same, so return [7].
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • 1 <= grid[i][j] <= 105
    • +
+",2.0,False,"class Solution { +public: + vector getBiggestThree(vector>& grid) { + + } +};","class Solution { + public int[] getBiggestThree(int[][] grid) { + + } +}","class Solution(object): + def getBiggestThree(self, grid): + """""" + :type grid: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def getBiggestThree(self, grid: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getBiggestThree(int** grid, int gridSize, int* gridColSize, int* returnSize){ + +}","public class Solution { + public int[] GetBiggestThree(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number[]} + */ +var getBiggestThree = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer[]} +def get_biggest_three(grid) + +end","class Solution { + func getBiggestThree(_ grid: [[Int]]) -> [Int] { + + } +}","func getBiggestThree(grid [][]int) []int { + +}","object Solution { + def getBiggestThree(grid: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun getBiggestThree(grid: Array): IntArray { + + } +}","impl Solution { + pub fn get_biggest_three(grid: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer[] + */ + function getBiggestThree($grid) { + + } +}","function getBiggestThree(grid: number[][]): number[] { + +};","(define/contract (get-biggest-three grid) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec get_biggest_three(Grid :: [[integer()]]) -> [integer()]. +get_biggest_three(Grid) -> + .","defmodule Solution do + @spec get_biggest_three(grid :: [[integer]]) :: [integer] + def get_biggest_three(grid) do + + end +end","class Solution { + List getBiggestThree(List> grid) { + + } +}", +675,minimum-xor-sum-of-two-arrays,Minimum XOR Sum of Two Arrays,1879.0,1989.0,"

You are given two integer arrays nums1 and nums2 of length n.

+ +

The XOR sum of the two integer arrays is (nums1[0] XOR nums2[0]) + (nums1[1] XOR nums2[1]) + ... + (nums1[n - 1] XOR nums2[n - 1]) (0-indexed).

+ +
    +
  • For example, the XOR sum of [1,2,3] and [3,2,1] is equal to (1 XOR 3) + (2 XOR 2) + (3 XOR 1) = 2 + 0 + 2 = 4.
    • +
+ +

Rearrange the elements of nums2 such that the resulting XOR sum is minimized.

+ +

Return the XOR sum after the rearrangement.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2], nums2 = [2,3]
+Output: 2
+Explanation: Rearrange nums2 so that it becomes [3,2].
+The XOR sum is (1 XOR 3) + (2 XOR 2) = 2 + 0 = 2.
+ +

Example 2:

+ +
+Input: nums1 = [1,0,3], nums2 = [5,3,4]
+Output: 8
+Explanation: Rearrange nums2 so that it becomes [5,4,3]. 
+The XOR sum is (1 XOR 5) + (0 XOR 4) + (3 XOR 3) = 4 + 4 + 0 = 8.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length
    • +
  • n == nums2.length
    • +
  • 1 <= n <= 14
    • +
  • 0 <= nums1[i], nums2[i] <= 107
    • +
+",3.0,False,"class Solution { +public: + int minimumXORSum(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int minimumXORSum(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def minimumXORSum(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def minimumXORSum(self, nums1: List[int], nums2: List[int]) -> int: + ","int minimumXORSum(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MinimumXORSum(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minimumXORSum = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def minimum_xor_sum(nums1, nums2) + +end","class Solution { + func minimumXORSum(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func minimumXORSum(nums1 []int, nums2 []int) int { + +}","object Solution { + def minimumXORSum(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun minimumXORSum(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_xor_sum(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function minimumXORSum($nums1, $nums2) { + + } +}","function minimumXORSum(nums1: number[], nums2: number[]): number { + +};","(define/contract (minimum-xor-sum nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec minimum_xor_sum(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +minimum_xor_sum(Nums1, Nums2) -> + .","defmodule Solution do + @spec minimum_xor_sum(nums1 :: [integer], nums2 :: [integer]) :: integer + def minimum_xor_sum(nums1, nums2) do + + end +end","class Solution { + int minimumXORSum(List nums1, List nums2) { + + } +}", +676,minimize-maximum-pair-sum-in-array,Minimize Maximum Pair Sum in Array,1877.0,1988.0,"

The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs.

+ +
    +
  • For example, if we have pairs (1,5), (2,3), and (4,4), the maximum pair sum would be max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8.
    • +
+ +

Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that:

+ +
    +
  • Each element of nums is in exactly one pair, and
    • +
  • The maximum pair sum is minimized.
    • +
+ +

Return the minimized maximum pair sum after optimally pairing up the elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,5,2,3]
+Output: 7
+Explanation: The elements can be paired up into pairs (3,3) and (5,2).
+The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7.
+
+ +

Example 2:

+ +
+Input: nums = [3,5,4,2,4,6]
+Output: 8
+Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2).
+The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 2 <= n <= 105
    • +
  • n is even.
    • +
  • 1 <= nums[i] <= 105
    • +
",2.0,False,"class Solution { +public: + int minPairSum(vector& nums) { + + } +};","class Solution { + public int minPairSum(int[] nums) { + + } +}","class Solution(object): + def minPairSum(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minPairSum(self, nums: List[int]) -> int: + "," + +int minPairSum(int* nums, int numsSize){ + +}","public class Solution { + public int MinPairSum(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minPairSum = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_pair_sum(nums) + +end","class Solution { + func minPairSum(_ nums: [Int]) -> Int { + + } +}","func minPairSum(nums []int) int { + +}","object Solution { + def minPairSum(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minPairSum(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_pair_sum(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minPairSum($nums) { + + } +}","function minPairSum(nums: number[]): number { + +};","(define/contract (min-pair-sum nums) + (-> (listof exact-integer?) exact-integer?) + + )",,,, +678,largest-color-value-in-a-directed-graph,Largest Color Value in a Directed Graph,1857.0,1986.0,"

There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.

+ +

You are given a string colors where colors[i] is a lowercase English letter representing the color of the ith node in this graph (0-indexed). You are also given a 2D array edges where edges[j] = [aj, bj] indicates that there is a directed edge from node aj to node bj.

+ +

A valid path in the graph is a sequence of nodes x1 -> x2 -> x3 -> ... -> xk such that there is a directed edge from xi to xi+1 for every 1 <= i < k. The color value of the path is the number of nodes that are colored the most frequently occurring color along that path.

+ +

Return the largest color value of any valid path in the given graph, or -1 if the graph contains a cycle.

+ +

 

+

Example 1:

+ +

+ +
+Input: colors = "abaca", edges = [[0,1],[0,2],[2,3],[3,4]]
+Output: 3
+Explanation: The path 0 -> 2 -> 3 -> 4 contains 3 nodes that are colored "a" (red in the above image).
+
+ +

Example 2:

+ +

+ +
+Input: colors = "a", edges = [[0,0]]
+Output: -1
+Explanation: There is a cycle from 0 to 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == colors.length
    • +
  • m == edges.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= m <= 105
    • +
  • colors consists of lowercase English letters.
    • +
  • 0 <= aj, bj < n
    • +
",3.0,False,"class Solution { +public: + int largestPathValue(string colors, vector>& edges) { + + } +};","class Solution { + public int largestPathValue(String colors, int[][] edges) { + + } +}","class Solution(object): + def largestPathValue(self, colors, edges): + """""" + :type colors: str + :type edges: List[List[int]] + :rtype: int + """"""","class Solution: + def largestPathValue(self, colors: str, edges: List[List[int]]) -> int:","int largestPathValue(char * colors, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int LargestPathValue(string colors, int[][] edges) { + + } +}","/** + * @param {string} colors + * @param {number[][]} edges + * @return {number} + */ +var largestPathValue = function(colors, edges) { + +};","# @param {String} colors +# @param {Integer[][]} edges +# @return {Integer} +def largest_path_value(colors, edges) + +end","class Solution { + func largestPathValue(_ colors: String, _ edges: [[Int]]) -> Int { + + } +}","func largestPathValue(colors string, edges [][]int) int { + +}","object Solution { + def largestPathValue(colors: String, edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun largestPathValue(colors: String, edges: Array): Int { + + } +}","impl Solution { + pub fn largest_path_value(colors: String, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String $colors + * @param Integer[][] $edges + * @return Integer + */ + function largestPathValue($colors, $edges) { + + } +}","function largestPathValue(colors: string, edges: number[][]): number { + +};","(define/contract (largest-path-value colors edges) + (-> string? (listof (listof exact-integer?)) exact-integer?) + + )",,,, +679,maximum-subarray-min-product,Maximum Subarray Min-Product,1856.0,1985.0,"

The min-product of an array is equal to the minimum value in the array multiplied by the array's sum.

+ +
    +
  • For example, the array [3,2,5] (minimum value is 2) has a min-product of 2 * (3+2+5) = 2 * 10 = 20.
    • +
+ +

Given an array of integers nums, return the maximum min-product of any non-empty subarray of nums. Since the answer may be large, return it modulo 109 + 7.

+ +

Note that the min-product should be maximized before performing the modulo operation. Testcases are generated such that the maximum min-product without modulo will fit in a 64-bit signed integer.

+ +

A subarray is a contiguous part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,2]
+Output: 14
+Explanation: The maximum min-product is achieved with the subarray [2,3,2] (minimum value is 2).
+2 * (2+3+2) = 2 * 7 = 14.
+
+ +

Example 2:

+ +
+Input: nums = [2,3,3,1,2]
+Output: 18
+Explanation: The maximum min-product is achieved with the subarray [3,3] (minimum value is 3).
+3 * (3+3) = 3 * 6 = 18.
+
+ +

Example 3:

+ +
+Input: nums = [3,1,5,6,4,2]
+Output: 60
+Explanation: The maximum min-product is achieved with the subarray [5,6,4] (minimum value is 4).
+4 * (5+6+4) = 4 * 15 = 60.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 107
    • +
+",2.0,False,"class Solution { +public: + int maxSumMinProduct(vector& nums) { + + } +};","class Solution { + public int maxSumMinProduct(int[] nums) { + + } +}","class Solution(object): + def maxSumMinProduct(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxSumMinProduct(self, nums: List[int]) -> int: + ","int maxSumMinProduct(int* nums, int numsSize){ + +}","public class Solution { + public int MaxSumMinProduct(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxSumMinProduct = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_sum_min_product(nums) + +end","class Solution { + func maxSumMinProduct(_ nums: [Int]) -> Int { + + } +}","func maxSumMinProduct(nums []int) int { + +}","object Solution { + def maxSumMinProduct(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxSumMinProduct(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_sum_min_product(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxSumMinProduct($nums) { + + } +}","function maxSumMinProduct(nums: number[]): number { + +};","(define/contract (max-sum-min-product nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_sum_min_product(Nums :: [integer()]) -> integer(). +max_sum_min_product(Nums) -> + .","defmodule Solution do + @spec max_sum_min_product(nums :: [integer]) :: integer + def max_sum_min_product(nums) do + + end +end","class Solution { + int maxSumMinProduct(List nums) { + + } +}", +680,maximum-distance-between-a-pair-of-values,Maximum Distance Between a Pair of Values,1855.0,1984.0,"

You are given two non-increasing 0-indexed integer arrays nums1​​​​​​ and nums2​​​​​​.

+ +

A pair of indices (i, j), where 0 <= i < nums1.length and 0 <= j < nums2.length, is valid if both i <= j and nums1[i] <= nums2[j]. The distance of the pair is j - i​​​​.

+ +

Return the maximum distance of any valid pair (i, j). If there are no valid pairs, return 0.

+ +

An array arr is non-increasing if arr[i-1] >= arr[i] for every 1 <= i < arr.length.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [55,30,5,4,2], nums2 = [100,20,10,10,5]
+Output: 2
+Explanation: The valid pairs are (0,0), (2,2), (2,3), (2,4), (3,3), (3,4), and (4,4).
+The maximum distance is 2 with pair (2,4).
+
+ +

Example 2:

+ +
+Input: nums1 = [2,2,2], nums2 = [10,10,1]
+Output: 1
+Explanation: The valid pairs are (0,0), (0,1), and (1,1).
+The maximum distance is 1 with pair (0,1).
+
+ +

Example 3:

+ +
+Input: nums1 = [30,29,19,5], nums2 = [25,25,25,25,25]
+Output: 2
+Explanation: The valid pairs are (2,2), (2,3), (2,4), (3,3), and (3,4).
+The maximum distance is 2 with pair (2,4).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
    • +
  • 1 <= nums1[i], nums2[j] <= 105
    • +
  • Both nums1 and nums2 are non-increasing.
    • +
+",2.0,False,"class Solution { +public: + int maxDistance(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int maxDistance(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def maxDistance(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def maxDistance(self, nums1: List[int], nums2: List[int]) -> int: + ","int maxDistance(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MaxDistance(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maxDistance = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def max_distance(nums1, nums2) + +end","class Solution { + func maxDistance(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func maxDistance(nums1 []int, nums2 []int) int { + +}","object Solution { + def maxDistance(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun maxDistance(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn max_distance(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function maxDistance($nums1, $nums2) { + + } +}","function maxDistance(nums1: number[], nums2: number[]): number { + +};","(define/contract (max-distance nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec max_distance(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +max_distance(Nums1, Nums2) -> + .","defmodule Solution do + @spec max_distance(nums1 :: [integer], nums2 :: [integer]) :: integer + def max_distance(nums1, nums2) do + + end +end","class Solution { + int maxDistance(List nums1, List nums2) { + + } +}", +681,maximum-population-year,Maximum Population Year,1854.0,1983.0,"

You are given a 2D integer array logs where each logs[i] = [birthi, deathi] indicates the birth and death years of the ith person.

+ +

The population of some year x is the number of people alive during that year. The ith person is counted in year x's population if x is in the inclusive range [birthi, deathi - 1]. Note that the person is not counted in the year that they die.

+ +

Return the earliest year with the maximum population.

+ +

 

+

Example 1:

+ +
+Input: logs = [[1993,1999],[2000,2010]]
+Output: 1993
+Explanation: The maximum population is 1, and 1993 is the earliest year with this population.
+
+ +

Example 2:

+ +
+Input: logs = [[1950,1961],[1960,1971],[1970,1981]]
+Output: 1960
+Explanation: 
+The maximum population is 2, and it had happened in years 1960 and 1970.
+The earlier year between them is 1960.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= logs.length <= 100
    • +
  • 1950 <= birthi < deathi <= 2050
    • +
+",1.0,False,"class Solution { +public: + int maximumPopulation(vector>& logs) { + + } +};","class Solution { + public int maximumPopulation(int[][] logs) { + + } +}","class Solution(object): + def maximumPopulation(self, logs): + """""" + :type logs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumPopulation(self, logs: List[List[int]]) -> int: + ","int maximumPopulation(int** logs, int logsSize, int* logsColSize){ + +}","public class Solution { + public int MaximumPopulation(int[][] logs) { + + } +}","/** + * @param {number[][]} logs + * @return {number} + */ +var maximumPopulation = function(logs) { + +};","# @param {Integer[][]} logs +# @return {Integer} +def maximum_population(logs) + +end","class Solution { + func maximumPopulation(_ logs: [[Int]]) -> Int { + + } +}","func maximumPopulation(logs [][]int) int { + +}","object Solution { + def maximumPopulation(logs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumPopulation(logs: Array): Int { + + } +}","impl Solution { + pub fn maximum_population(logs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $logs + * @return Integer + */ + function maximumPopulation($logs) { + + } +}","function maximumPopulation(logs: number[][]): number { + +};","(define/contract (maximum-population logs) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_population(Logs :: [[integer()]]) -> integer(). +maximum_population(Logs) -> + .","defmodule Solution do + @spec maximum_population(logs :: [[integer]]) :: integer + def maximum_population(logs) do + + end +end","class Solution { + int maximumPopulation(List> logs) { + + } +}", +683,minimum-interval-to-include-each-query,Minimum Interval to Include Each Query,1851.0,1977.0,"

You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] describes the ith interval starting at lefti and ending at righti (inclusive). The size of an interval is defined as the number of integers it contains, or more formally righti - lefti + 1.

+ +

You are also given an integer array queries. The answer to the jth query is the size of the smallest interval i such that lefti <= queries[j] <= righti. If no such interval exists, the answer is -1.

+ +

Return an array containing the answers to the queries.

+ +

 

+

Example 1:

+ +
+Input: intervals = [[1,4],[2,4],[3,6],[4,4]], queries = [2,3,4,5]
+Output: [3,3,1,4]
+Explanation: The queries are processed as follows:
+- Query = 2: The interval [2,4] is the smallest interval containing 2. The answer is 4 - 2 + 1 = 3.
+- Query = 3: The interval [2,4] is the smallest interval containing 3. The answer is 4 - 2 + 1 = 3.
+- Query = 4: The interval [4,4] is the smallest interval containing 4. The answer is 4 - 4 + 1 = 1.
+- Query = 5: The interval [3,6] is the smallest interval containing 5. The answer is 6 - 3 + 1 = 4.
+
+ +

Example 2:

+ +
+Input: intervals = [[2,3],[2,5],[1,8],[20,25]], queries = [2,19,5,22]
+Output: [2,-1,4,6]
+Explanation: The queries are processed as follows:
+- Query = 2: The interval [2,3] is the smallest interval containing 2. The answer is 3 - 2 + 1 = 2.
+- Query = 19: None of the intervals contain 19. The answer is -1.
+- Query = 5: The interval [2,5] is the smallest interval containing 5. The answer is 5 - 2 + 1 = 4.
+- Query = 22: The interval [20,25] is the smallest interval containing 22. The answer is 25 - 20 + 1 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= intervals.length <= 105
    • +
  • 1 <= queries.length <= 105
    • +
  • intervals[i].length == 2
    • +
  • 1 <= lefti <= righti <= 107
    • +
  • 1 <= queries[j] <= 107
    • +
+",3.0,False,"class Solution { +public: + vector minInterval(vector>& intervals, vector& queries) { + + } +};","class Solution { + public int[] minInterval(int[][] intervals, int[] queries) { + + } +}","class Solution(object): + def minInterval(self, intervals, queries): + """""" + :type intervals: List[List[int]] + :type queries: List[int] + :rtype: List[int] + """""" + ","class Solution: + def minInterval(self, intervals: List[List[int]], queries: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* minInterval(int** intervals, int intervalsSize, int* intervalsColSize, int* queries, int queriesSize, int* returnSize){ + +}","public class Solution { + public int[] MinInterval(int[][] intervals, int[] queries) { + + } +}","/** + * @param {number[][]} intervals + * @param {number[]} queries + * @return {number[]} + */ +var minInterval = function(intervals, queries) { + +};","# @param {Integer[][]} intervals +# @param {Integer[]} queries +# @return {Integer[]} +def min_interval(intervals, queries) + +end","class Solution { + func minInterval(_ intervals: [[Int]], _ queries: [Int]) -> [Int] { + + } +}","func minInterval(intervals [][]int, queries []int) []int { + +}","object Solution { + def minInterval(intervals: Array[Array[Int]], queries: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun minInterval(intervals: Array, queries: IntArray): IntArray { + + } +}","impl Solution { + pub fn min_interval(intervals: Vec>, queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $intervals + * @param Integer[] $queries + * @return Integer[] + */ + function minInterval($intervals, $queries) { + + } +}","function minInterval(intervals: number[][], queries: number[]): number[] { + +};","(define/contract (min-interval intervals queries) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?)) + + )","-spec min_interval(Intervals :: [[integer()]], Queries :: [integer()]) -> [integer()]. +min_interval(Intervals, Queries) -> + .","defmodule Solution do + @spec min_interval(intervals :: [[integer]], queries :: [integer]) :: [integer] + def min_interval(intervals, queries) do + + end +end","class Solution { + List minInterval(List> intervals, List queries) { + + } +}", +684,splitting-a-string-into-descending-consecutive-values,Splitting a String Into Descending Consecutive Values,1849.0,1976.0,"

You are given a string s that consists of only digits.

+ +

Check if we can split s into two or more non-empty substrings such that the numerical values of the substrings are in descending order and the difference between numerical values of every two adjacent substrings is equal to 1.

+ +
    +
  • For example, the string s = "0090089" can be split into ["0090", "089"] with numerical values [90,89]. The values are in descending order and adjacent values differ by 1, so this way is valid.
    • +
  • Another example, the string s = "001" can be split into ["0", "01"], ["00", "1"], or ["0", "0", "1"]. However all the ways are invalid because they have numerical values [0,1], [0,1], and [0,0,1] respectively, all of which are not in descending order.
    • +
+ +

Return true if it is possible to split s​​​​​​ as described above, or false otherwise.

+ +

A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: s = "1234"
+Output: false
+Explanation: There is no valid way to split s.
+
+ +

Example 2:

+ +
+Input: s = "050043"
+Output: true
+Explanation: s can be split into ["05", "004", "3"] with numerical values [5,4,3].
+The values are in descending order with adjacent values differing by 1.
+
+ +

Example 3:

+ +
+Input: s = "9080701"
+Output: false
+Explanation: There is no valid way to split s.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 20
    • +
  • s only consists of digits.
    • +
+",2.0,False,"class Solution { +public: + bool splitString(string s) { + + } +};","class Solution { + public boolean splitString(String s) { + + } +}","class Solution(object): + def splitString(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def splitString(self, s: str) -> bool: + ","bool splitString(char * s){ + +}","public class Solution { + public bool SplitString(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var splitString = function(s) { + +};","# @param {String} s +# @return {Boolean} +def split_string(s) + +end","class Solution { + func splitString(_ s: String) -> Bool { + + } +}","func splitString(s string) bool { + +}","object Solution { + def splitString(s: String): Boolean = { + + } +}","class Solution { + fun splitString(s: String): Boolean { + + } +}","impl Solution { + pub fn split_string(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function splitString($s) { + + } +}","function splitString(s: string): boolean { + +};","(define/contract (split-string s) + (-> string? boolean?) + + )","-spec split_string(S :: unicode:unicode_binary()) -> boolean(). +split_string(S) -> + .","defmodule Solution do + @spec split_string(s :: String.t) :: boolean + def split_string(s) do + + end +end","class Solution { + bool splitString(String s) { + + } +}", +689,maximum-building-height,Maximum Building Height,1840.0,1968.0,"

You want to build n new buildings in a city. The new buildings will be built in a line and are labeled from 1 to n.

+ +

However, there are city restrictions on the heights of the new buildings:

+ +
    +
  • The height of each building must be a non-negative integer.
    • +
  • The height of the first building must be 0.
    • +
  • The height difference between any two adjacent buildings cannot exceed 1.
    • +
+ +

Additionally, there are city restrictions on the maximum height of specific buildings. These restrictions are given as a 2D integer array restrictions where restrictions[i] = [idi, maxHeighti] indicates that building idi must have a height less than or equal to maxHeighti.

+ +

It is guaranteed that each building will appear at most once in restrictions, and building 1 will not be in restrictions.

+ +

Return the maximum possible height of the tallest building.

+ +

 

+

Example 1:

+ +
+Input: n = 5, restrictions = [[2,1],[4,1]]
+Output: 2
+Explanation: The green area in the image indicates the maximum allowed height for each building.
+We can build the buildings with heights [0,1,2,1,2], and the tallest building has a height of 2.
+ +

Example 2:

+ +
+Input: n = 6, restrictions = []
+Output: 5
+Explanation: The green area in the image indicates the maximum allowed height for each building.
+We can build the buildings with heights [0,1,2,3,4,5], and the tallest building has a height of 5.
+
+ +

Example 3:

+ +
+Input: n = 10, restrictions = [[5,3],[2,5],[7,4],[10,3]]
+Output: 5
+Explanation: The green area in the image indicates the maximum allowed height for each building.
+We can build the buildings with heights [0,1,2,3,3,4,4,5,4,3], and the tallest building has a height of 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 109
    • +
  • 0 <= restrictions.length <= min(n - 1, 105)
    • +
  • 2 <= idi <= n
    • +
  • idi is unique.
    • +
  • 0 <= maxHeighti <= 109
    • +
+",3.0,False,"class Solution { +public: + int maxBuilding(int n, vector>& restrictions) { + + } +};","class Solution { + public int maxBuilding(int n, int[][] restrictions) { + + } +}","class Solution(object): + def maxBuilding(self, n, restrictions): + """""" + :type n: int + :type restrictions: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxBuilding(self, n: int, restrictions: List[List[int]]) -> int: + ","int maxBuilding(int n, int** restrictions, int restrictionsSize, int* restrictionsColSize){ + +}","public class Solution { + public int MaxBuilding(int n, int[][] restrictions) { + + } +}","/** + * @param {number} n + * @param {number[][]} restrictions + * @return {number} + */ +var maxBuilding = function(n, restrictions) { + +};","# @param {Integer} n +# @param {Integer[][]} restrictions +# @return {Integer} +def max_building(n, restrictions) + +end","class Solution { + func maxBuilding(_ n: Int, _ restrictions: [[Int]]) -> Int { + + } +}","func maxBuilding(n int, restrictions [][]int) int { + +}","object Solution { + def maxBuilding(n: Int, restrictions: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxBuilding(n: Int, restrictions: Array): Int { + + } +}","impl Solution { + pub fn max_building(n: i32, restrictions: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $restrictions + * @return Integer + */ + function maxBuilding($n, $restrictions) { + + } +}","function maxBuilding(n: number, restrictions: number[][]): number { + +};","(define/contract (max-building n restrictions) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_building(N :: integer(), Restrictions :: [[integer()]]) -> integer(). +max_building(N, Restrictions) -> + .","defmodule Solution do + @spec max_building(n :: integer, restrictions :: [[integer]]) :: integer + def max_building(n, restrictions) do + + end +end","class Solution { + int maxBuilding(int n, List> restrictions) { + + } +}", +692,sum-of-digits-in-base-k,Sum of Digits in Base K,1837.0,1965.0,"

Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n from base 10 to base k.

+ +

After converting, each digit should be interpreted as a base 10 number, and the sum should be returned in base 10.

+ +

 

+

Example 1:

+ +
+Input: n = 34, k = 6
+Output: 9
+Explanation: 34 (base 10) expressed in base 6 is 54. 5 + 4 = 9.
+
+ +

Example 2:

+ +
+Input: n = 10, k = 10
+Output: 1
+Explanation: n is already in base 10. 1 + 0 = 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 2 <= k <= 10
    • +
+",1.0,False,"class Solution { +public: + int sumBase(int n, int k) { + + } +};","class Solution { + public int sumBase(int n, int k) { + + } +}","class Solution(object): + def sumBase(self, n, k): + """""" + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def sumBase(self, n: int, k: int) -> int: + ","int sumBase(int n, int k){ + +}","public class Solution { + public int SumBase(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var sumBase = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def sum_base(n, k) + +end","class Solution { + func sumBase(_ n: Int, _ k: Int) -> Int { + + } +}","func sumBase(n int, k int) int { + +}","object Solution { + def sumBase(n: Int, k: Int): Int = { + + } +}","class Solution { + fun sumBase(n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn sum_base(n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function sumBase($n, $k) { + + } +}","function sumBase(n: number, k: number): number { + +};","(define/contract (sum-base n k) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec sum_base(N :: integer(), K :: integer()) -> integer(). +sum_base(N, K) -> + .","defmodule Solution do + @spec sum_base(n :: integer, k :: integer) :: integer + def sum_base(n, k) do + + end +end","class Solution { + int sumBase(int n, int k) { + + } +}", +693,find-xor-sum-of-all-pairs-bitwise-and,Find XOR Sum of All Pairs Bitwise AND,1835.0,1963.0,"

The XOR sum of a list is the bitwise XOR of all its elements. If the list only contains one element, then its XOR sum will be equal to this element.

+ +
    +
  • For example, the XOR sum of [1,2,3,4] is equal to 1 XOR 2 XOR 3 XOR 4 = 4, and the XOR sum of [3] is equal to 3.
    • +
+ +

You are given two 0-indexed arrays arr1 and arr2 that consist only of non-negative integers.

+ +

Consider the list containing the result of arr1[i] AND arr2[j] (bitwise AND) for every (i, j) pair where 0 <= i < arr1.length and 0 <= j < arr2.length.

+ +

Return the XOR sum of the aforementioned list.

+ +

 

+

Example 1:

+ +
+Input: arr1 = [1,2,3], arr2 = [6,5]
+Output: 0
+Explanation: The list = [1 AND 6, 1 AND 5, 2 AND 6, 2 AND 5, 3 AND 6, 3 AND 5] = [0,1,2,0,2,1].
+The XOR sum = 0 XOR 1 XOR 2 XOR 0 XOR 2 XOR 1 = 0.
+
+ +

Example 2:

+ +
+Input: arr1 = [12], arr2 = [4]
+Output: 4
+Explanation: The list = [12 AND 4] = [4]. The XOR sum = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr1.length, arr2.length <= 105
    • +
  • 0 <= arr1[i], arr2[j] <= 109
    • +
+",3.0,False,"class Solution { +public: + int getXORSum(vector& arr1, vector& arr2) { + + } +};","class Solution { + public int getXORSum(int[] arr1, int[] arr2) { + + } +}","class Solution(object): + def getXORSum(self, arr1, arr2): + """""" + :type arr1: List[int] + :type arr2: List[int] + :rtype: int + """""" + ","class Solution: + def getXORSum(self, arr1: List[int], arr2: List[int]) -> int: + ","int getXORSum(int* arr1, int arr1Size, int* arr2, int arr2Size){ + +}","public class Solution { + public int GetXORSum(int[] arr1, int[] arr2) { + + } +}","/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +var getXORSum = function(arr1, arr2) { + +};","# @param {Integer[]} arr1 +# @param {Integer[]} arr2 +# @return {Integer} +def get_xor_sum(arr1, arr2) + +end","class Solution { + func getXORSum(_ arr1: [Int], _ arr2: [Int]) -> Int { + + } +}","func getXORSum(arr1 []int, arr2 []int) int { + +}","object Solution { + def getXORSum(arr1: Array[Int], arr2: Array[Int]): Int = { + + } +}","class Solution { + fun getXORSum(arr1: IntArray, arr2: IntArray): Int { + + } +}","impl Solution { + pub fn get_xor_sum(arr1: Vec, arr2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr1 + * @param Integer[] $arr2 + * @return Integer + */ + function getXORSum($arr1, $arr2) { + + } +}","function getXORSum(arr1: number[], arr2: number[]): number { + +};","(define/contract (get-xor-sum arr1 arr2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec get_xor_sum(Arr1 :: [integer()], Arr2 :: [integer()]) -> integer(). +get_xor_sum(Arr1, Arr2) -> + .","defmodule Solution do + @spec get_xor_sum(arr1 :: [integer], arr2 :: [integer]) :: integer + def get_xor_sum(arr1, arr2) do + + end +end","class Solution { + int getXORSum(List arr1, List arr2) { + + } +}", +697,closest-room,Closest Room,1847.0,1957.0,"

There is a hotel with n rooms. The rooms are represented by a 2D integer array rooms where rooms[i] = [roomIdi, sizei] denotes that there is a room with room number roomIdi and size equal to sizei. Each roomIdi is guaranteed to be unique.

+ +

You are also given k queries in a 2D array queries where queries[j] = [preferredj, minSizej]. The answer to the jth query is the room number id of a room such that:

+ +
    +
  • The room has a size of at least minSizej, and
    • +
  • abs(id - preferredj) is minimized, where abs(x) is the absolute value of x.
    • +
+ +

If there is a tie in the absolute difference, then use the room with the smallest such id. If there is no such room, the answer is -1.

+ +

Return an array answer of length k where answer[j] contains the answer to the jth query.

+ +

 

+

Example 1:

+ +
+Input: rooms = [[2,2],[1,2],[3,2]], queries = [[3,1],[3,3],[5,2]]
+Output: [3,-1,3]
+Explanation: The answers to the queries are as follows:
+Query = [3,1]: Room number 3 is the closest as abs(3 - 3) = 0, and its size of 2 is at least 1. The answer is 3.
+Query = [3,3]: There are no rooms with a size of at least 3, so the answer is -1.
+Query = [5,2]: Room number 3 is the closest as abs(3 - 5) = 2, and its size of 2 is at least 2. The answer is 3.
+ +

Example 2:

+ +
+Input: rooms = [[1,4],[2,3],[3,5],[4,1],[5,2]], queries = [[2,3],[2,4],[2,5]]
+Output: [2,1,3]
+Explanation: The answers to the queries are as follows:
+Query = [2,3]: Room number 2 is the closest as abs(2 - 2) = 0, and its size of 3 is at least 3. The answer is 2.
+Query = [2,4]: Room numbers 1 and 3 both have sizes of at least 4. The answer is 1 since it is smaller.
+Query = [2,5]: Room number 3 is the only room with a size of at least 5. The answer is 3.
+ +

 

+

Constraints:

+ +
    +
  • n == rooms.length
    • +
  • 1 <= n <= 105
    • +
  • k == queries.length
    • +
  • 1 <= k <= 104
    • +
  • 1 <= roomIdi, preferredj <= 107
    • +
  • 1 <= sizei, minSizej <= 107
    • +
+",3.0,False,"class Solution { +public: + vector closestRoom(vector>& rooms, vector>& queries) { + + } +};","class Solution { + public int[] closestRoom(int[][] rooms, int[][] queries) { + + } +}","class Solution(object): + def closestRoom(self, rooms, queries): + """""" + :type rooms: List[List[int]] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def closestRoom(self, rooms: List[List[int]], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* closestRoom(int** rooms, int roomsSize, int* roomsColSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] ClosestRoom(int[][] rooms, int[][] queries) { + + } +}","/** + * @param {number[][]} rooms + * @param {number[][]} queries + * @return {number[]} + */ +var closestRoom = function(rooms, queries) { + +};","# @param {Integer[][]} rooms +# @param {Integer[][]} queries +# @return {Integer[]} +def closest_room(rooms, queries) + +end","class Solution { + func closestRoom(_ rooms: [[Int]], _ queries: [[Int]]) -> [Int] { + + } +}","func closestRoom(rooms [][]int, queries [][]int) []int { + +}","object Solution { + def closestRoom(rooms: Array[Array[Int]], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun closestRoom(rooms: Array, queries: Array): IntArray { + + } +}","impl Solution { + pub fn closest_room(rooms: Vec>, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $rooms + * @param Integer[][] $queries + * @return Integer[] + */ + function closestRoom($rooms, $queries) { + + } +}","function closestRoom(rooms: number[][], queries: number[][]): number[] { + +};","(define/contract (closest-room rooms queries) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec closest_room(Rooms :: [[integer()]], Queries :: [[integer()]]) -> [integer()]. +closest_room(Rooms, Queries) -> + .","defmodule Solution do + @spec closest_room(rooms :: [[integer]], queries :: [[integer]]) :: [integer] + def closest_room(rooms, queries) do + + end +end","class Solution { + List closestRoom(List> rooms, List> queries) { + + } +}", +701,finding-mk-average,Finding MK Average,1825.0,1953.0,"

You are given two integers, m and k, and a stream of integers. You are tasked to implement a data structure that calculates the MKAverage for the stream.

+ +

The MKAverage can be calculated using these steps:

+ +
    +
  1. If the number of the elements in the stream is less than m you should consider the MKAverage to be -1. Otherwise, copy the last m elements of the stream to a separate container.
    2. +
  2. Remove the smallest k elements and the largest k elements from the container.
    3. +
  3. Calculate the average value for the rest of the elements rounded down to the nearest integer.
    4. +
+ +

Implement the MKAverage class:

+ +
    +
  • MKAverage(int m, int k) Initializes the MKAverage object with an empty stream and the two integers m and k.
    • +
  • void addElement(int num) Inserts a new element num into the stream.
    • +
  • int calculateMKAverage() Calculates and returns the MKAverage for the current stream rounded down to the nearest integer.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MKAverage", "addElement", "addElement", "calculateMKAverage", "addElement", "calculateMKAverage", "addElement", "addElement", "addElement", "calculateMKAverage"]
+[[3, 1], [3], [1], [], [10], [], [5], [5], [5], []]
+Output
+[null, null, null, -1, null, 3, null, null, null, 5]
+
+Explanation
+MKAverage obj = new MKAverage(3, 1); 
+obj.addElement(3);        // current elements are [3]
+obj.addElement(1);        // current elements are [3,1]
+obj.calculateMKAverage(); // return -1, because m = 3 and only 2 elements exist.
+obj.addElement(10);       // current elements are [3,1,10]
+obj.calculateMKAverage(); // The last 3 elements are [3,1,10].
+                          // After removing smallest and largest 1 element the container will be [3].
+                          // The average of [3] equals 3/1 = 3, return 3
+obj.addElement(5);        // current elements are [3,1,10,5]
+obj.addElement(5);        // current elements are [3,1,10,5,5]
+obj.addElement(5);        // current elements are [3,1,10,5,5,5]
+obj.calculateMKAverage(); // The last 3 elements are [5,5,5].
+                          // After removing smallest and largest 1 element the container will be [5].
+                          // The average of [5] equals 5/1 = 5, return 5
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= m <= 105
    • +
  • 1 <= k*2 < m
    • +
  • 1 <= num <= 105
    • +
  • At most 105 calls will be made to addElement and calculateMKAverage.
    • +
+",3.0,False,"class MKAverage { +public: + MKAverage(int m, int k) { + + } + + void addElement(int num) { + + } + + int calculateMKAverage() { + + } +}; + +/** + * Your MKAverage object will be instantiated and called as such: + * MKAverage* obj = new MKAverage(m, k); + * obj->addElement(num); + * int param_2 = obj->calculateMKAverage(); + */","class MKAverage { + + public MKAverage(int m, int k) { + + } + + public void addElement(int num) { + + } + + public int calculateMKAverage() { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * MKAverage obj = new MKAverage(m, k); + * obj.addElement(num); + * int param_2 = obj.calculateMKAverage(); + */","class MKAverage(object): + + def __init__(self, m, k): + """""" + :type m: int + :type k: int + """""" + + + def addElement(self, num): + """""" + :type num: int + :rtype: None + """""" + + + def calculateMKAverage(self): + """""" + :rtype: int + """""" + + + +# Your MKAverage object will be instantiated and called as such: +# obj = MKAverage(m, k) +# obj.addElement(num) +# param_2 = obj.calculateMKAverage()","class MKAverage: + + def __init__(self, m: int, k: int): + + + def addElement(self, num: int) -> None: + + + def calculateMKAverage(self) -> int: + + + +# Your MKAverage object will be instantiated and called as such: +# obj = MKAverage(m, k) +# obj.addElement(num) +# param_2 = obj.calculateMKAverage()"," + + +typedef struct { + +} MKAverage; + + +MKAverage* mKAverageCreate(int m, int k) { + +} + +void mKAverageAddElement(MKAverage* obj, int num) { + +} + +int mKAverageCalculateMKAverage(MKAverage* obj) { + +} + +void mKAverageFree(MKAverage* obj) { + +} + +/** + * Your MKAverage struct will be instantiated and called as such: + * MKAverage* obj = mKAverageCreate(m, k); + * mKAverageAddElement(obj, num); + + * int param_2 = mKAverageCalculateMKAverage(obj); + + * mKAverageFree(obj); +*/","public class MKAverage { + + public MKAverage(int m, int k) { + + } + + public void AddElement(int num) { + + } + + public int CalculateMKAverage() { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * MKAverage obj = new MKAverage(m, k); + * obj.AddElement(num); + * int param_2 = obj.CalculateMKAverage(); + */","/** + * @param {number} m + * @param {number} k + */ +var MKAverage = function(m, k) { + +}; + +/** + * @param {number} num + * @return {void} + */ +MKAverage.prototype.addElement = function(num) { + +}; + +/** + * @return {number} + */ +MKAverage.prototype.calculateMKAverage = function() { + +}; + +/** + * Your MKAverage object will be instantiated and called as such: + * var obj = new MKAverage(m, k) + * obj.addElement(num) + * var param_2 = obj.calculateMKAverage() + */","class MKAverage + +=begin + :type m: Integer + :type k: Integer +=end + def initialize(m, k) + + end + + +=begin + :type num: Integer + :rtype: Void +=end + def add_element(num) + + end + + +=begin + :rtype: Integer +=end + def calculate_mk_average() + + end + + +end + +# Your MKAverage object will be instantiated and called as such: +# obj = MKAverage.new(m, k) +# obj.add_element(num) +# param_2 = obj.calculate_mk_average()"," +class MKAverage { + + init(_ m: Int, _ k: Int) { + + } + + func addElement(_ num: Int) { + + } + + func calculateMKAverage() -> Int { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * let obj = MKAverage(m, k) + * obj.addElement(num) + * let ret_2: Int = obj.calculateMKAverage() + */","type MKAverage struct { + +} + + +func Constructor(m int, k int) MKAverage { + +} + + +func (this *MKAverage) AddElement(num int) { + +} + + +func (this *MKAverage) CalculateMKAverage() int { + +} + + +/** + * Your MKAverage object will be instantiated and called as such: + * obj := Constructor(m, k); + * obj.AddElement(num); + * param_2 := obj.CalculateMKAverage(); + */","class MKAverage(_m: Int, _k: Int) { + + def addElement(num: Int) { + + } + + def calculateMKAverage(): Int = { + + } + +} + +/** + * Your MKAverage object will be instantiated and called as such: + * var obj = new MKAverage(m, k) + * obj.addElement(num) + * var param_2 = obj.calculateMKAverage() + */","class MKAverage(m: Int, k: Int) { + + fun addElement(num: Int) { + + } + + fun calculateMKAverage(): Int { + + } + +} + +/** + * Your MKAverage object will be instantiated and called as such: + * var obj = MKAverage(m, k) + * obj.addElement(num) + * var param_2 = obj.calculateMKAverage() + */","struct MKAverage { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MKAverage { + + fn new(m: i32, k: i32) -> Self { + + } + + fn add_element(&self, num: i32) { + + } + + fn calculate_mk_average(&self) -> i32 { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * let obj = MKAverage::new(m, k); + * obj.add_element(num); + * let ret_2: i32 = obj.calculate_mk_average(); + */","class MKAverage { + /** + * @param Integer $m + * @param Integer $k + */ + function __construct($m, $k) { + + } + + /** + * @param Integer $num + * @return NULL + */ + function addElement($num) { + + } + + /** + * @return Integer + */ + function calculateMKAverage() { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * $obj = MKAverage($m, $k); + * $obj->addElement($num); + * $ret_2 = $obj->calculateMKAverage(); + */","class MKAverage { + constructor(m: number, k: number) { + + } + + addElement(num: number): void { + + } + + calculateMKAverage(): number { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * var obj = new MKAverage(m, k) + * obj.addElement(num) + * var param_2 = obj.calculateMKAverage() + */","(define mk-average% + (class object% + (super-new) + + ; m : exact-integer? + + ; k : exact-integer? + (init-field + m + k) + + ; add-element : exact-integer? -> void? + (define/public (add-element num) + + ) + ; calculate-mk-average : -> exact-integer? + (define/public (calculate-mk-average) + + ))) + +;; Your mk-average% object will be instantiated and called as such: +;; (define obj (new mk-average% [m m] [k k])) +;; (send obj add-element num) +;; (define param_2 (send obj calculate-mk-average))","-spec mk_average_init_(M :: integer(), K :: integer()) -> any(). +mk_average_init_(M, K) -> + . + +-spec mk_average_add_element(Num :: integer()) -> any(). +mk_average_add_element(Num) -> + . + +-spec mk_average_calculate_mk_average() -> integer(). +mk_average_calculate_mk_average() -> + . + + +%% Your functions will be called as such: +%% mk_average_init_(M, K), +%% mk_average_add_element(Num), +%% Param_2 = mk_average_calculate_mk_average(), + +%% mk_average_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MKAverage do + @spec init_(m :: integer, k :: integer) :: any + def init_(m, k) do + + end + + @spec add_element(num :: integer) :: any + def add_element(num) do + + end + + @spec calculate_mk_average() :: integer + def calculate_mk_average() do + + end +end + +# Your functions will be called as such: +# MKAverage.init_(m, k) +# MKAverage.add_element(num) +# param_2 = MKAverage.calculate_mk_average() + +# MKAverage.init_ will be called before every test case, in which you can do some necessary initializations.","class MKAverage { + + MKAverage(int m, int k) { + + } + + void addElement(int num) { + + } + + int calculateMKAverage() { + + } +} + +/** + * Your MKAverage object will be instantiated and called as such: + * MKAverage obj = MKAverage(m, k); + * obj.addElement(num); + * int param2 = obj.calculateMKAverage(); + */", +702,minimum-sideway-jumps,Minimum Sideway Jumps,1824.0,1952.0,"

There is a 3 lane road of length n that consists of n + 1 points labeled from 0 to n. A frog starts at point 0 in the second lane and wants to jump to point n. However, there could be obstacles along the way.

+ +

You are given an array obstacles of length n + 1 where each obstacles[i] (ranging from 0 to 3) describes an obstacle on the lane obstacles[i] at point i. If obstacles[i] == 0, there are no obstacles at point i. There will be at most one obstacle in the 3 lanes at each point.

+ +
    +
  • For example, if obstacles[2] == 1, then there is an obstacle on lane 1 at point 2.
    • +
+ +

The frog can only travel from point i to point i + 1 on the same lane if there is not an obstacle on the lane at point i + 1. To avoid obstacles, the frog can also perform a side jump to jump to another lane (even if they are not adjacent) at the same point if there is no obstacle on the new lane.

+ +
    +
  • For example, the frog can jump from lane 3 at point 3 to lane 1 at point 3.
    • +
+ +

Return the minimum number of side jumps the frog needs to reach any lane at point n starting from lane 2 at point 0.

+ +

Note: There will be no obstacles on points 0 and n.

+ +

 

+

Example 1:

+ +
+Input: obstacles = [0,1,2,3,0]
+Output: 2 
+Explanation: The optimal solution is shown by the arrows above. There are 2 side jumps (red arrows).
+Note that the frog can jump over obstacles only when making side jumps (as shown at point 2).
+
+ +

Example 2:

+ +
+Input: obstacles = [0,1,1,3,3,0]
+Output: 0
+Explanation: There are no obstacles on lane 2. No side jumps are required.
+
+ +

Example 3:

+ +
+Input: obstacles = [0,2,1,0,3,0]
+Output: 2
+Explanation: The optimal solution is shown by the arrows above. There are 2 side jumps.
+
+ +

 

+

Constraints:

+ +
    +
  • obstacles.length == n + 1
    • +
  • 1 <= n <= 5 * 105
    • +
  • 0 <= obstacles[i] <= 3
    • +
  • obstacles[0] == obstacles[n] == 0
    • +
+",2.0,False,"class Solution { +public: + int minSideJumps(vector& obstacles) { + + } +};","class Solution { + public int minSideJumps(int[] obstacles) { + + } +}","class Solution(object): + def minSideJumps(self, obstacles): + """""" + :type obstacles: List[int] + :rtype: int + """""" + ","class Solution: + def minSideJumps(self, obstacles: List[int]) -> int: + ","int minSideJumps(int* obstacles, int obstaclesSize){ + +}","public class Solution { + public int MinSideJumps(int[] obstacles) { + + } +}","/** + * @param {number[]} obstacles + * @return {number} + */ +var minSideJumps = function(obstacles) { + +};","# @param {Integer[]} obstacles +# @return {Integer} +def min_side_jumps(obstacles) + +end","class Solution { + func minSideJumps(_ obstacles: [Int]) -> Int { + + } +}","func minSideJumps(obstacles []int) int { + +}","object Solution { + def minSideJumps(obstacles: Array[Int]): Int = { + + } +}","class Solution { + fun minSideJumps(obstacles: IntArray): Int { + + } +}","impl Solution { + pub fn min_side_jumps(obstacles: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $obstacles + * @return Integer + */ + function minSideJumps($obstacles) { + + } +}","function minSideJumps(obstacles: number[]): number { + +};","(define/contract (min-side-jumps obstacles) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_side_jumps(Obstacles :: [integer()]) -> integer(). +min_side_jumps(Obstacles) -> + .","defmodule Solution do + @spec min_side_jumps(obstacles :: [integer]) :: integer + def min_side_jumps(obstacles) do + + end +end","class Solution { + int minSideJumps(List obstacles) { + + } +}", +705,number-of-different-subsequences-gcds,Number of Different Subsequences GCDs,1819.0,1947.0,"

You are given an array nums that consists of positive integers.

+ +

The GCD of a sequence of numbers is defined as the greatest integer that divides all the numbers in the sequence evenly.

+ +
    +
  • For example, the GCD of the sequence [4,6,16] is 2.
    • +
+ +

A subsequence of an array is a sequence that can be formed by removing some elements (possibly none) of the array.

+ +
    +
  • For example, [2,5,10] is a subsequence of [1,2,1,2,4,1,5,10].
    • +
+ +

Return the number of different GCDs among all non-empty subsequences of nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [6,10,3]
+Output: 5
+Explanation: The figure shows all the non-empty subsequences and their GCDs.
+The different GCDs are 6, 10, 3, 2, and 1.
+
+ +

Example 2:

+ +
+Input: nums = [5,15,40,5,6]
+Output: 7
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 2 * 105
    • +
+",3.0,False,"class Solution { +public: + int countDifferentSubsequenceGCDs(vector& nums) { + + } +};","class Solution { + public int countDifferentSubsequenceGCDs(int[] nums) { + + } +}","class Solution(object): + def countDifferentSubsequenceGCDs(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countDifferentSubsequenceGCDs(self, nums: List[int]) -> int: + ","int countDifferentSubsequenceGCDs(int* nums, int numsSize){ + +}","public class Solution { + public int CountDifferentSubsequenceGCDs(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countDifferentSubsequenceGCDs = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_different_subsequence_gc_ds(nums) + +end","class Solution { + func countDifferentSubsequenceGCDs(_ nums: [Int]) -> Int { + + } +}","func countDifferentSubsequenceGCDs(nums []int) int { + +}","object Solution { + def countDifferentSubsequenceGCDs(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countDifferentSubsequenceGCDs(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_different_subsequence_gc_ds(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countDifferentSubsequenceGCDs($nums) { + + } +}","function countDifferentSubsequenceGCDs(nums: number[]): number { + +};","(define/contract (count-different-subsequence-gc-ds nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_different_subsequence_gc_ds(Nums :: [integer()]) -> integer(). +count_different_subsequence_gc_ds(Nums) -> + .","defmodule Solution do + @spec count_different_subsequence_gc_ds(nums :: [integer]) :: integer + def count_different_subsequence_gc_ds(nums) do + + end +end","class Solution { + int countDifferentSubsequenceGCDs(List nums) { + + } +}", +707,finding-the-users-active-minutes,Finding the Users Active Minutes,1817.0,1945.0,"

You are given the logs for users' actions on LeetCode, and an integer k. The logs are represented by a 2D integer array logs where each logs[i] = [IDi, timei] indicates that the user with IDi performed an action at the minute timei.

+ +

Multiple users can perform actions simultaneously, and a single user can perform multiple actions in the same minute.

+ +

The user active minutes (UAM) for a given user is defined as the number of unique minutes in which the user performed an action on LeetCode. A minute can only be counted once, even if multiple actions occur during it.

+ +

You are to calculate a 1-indexed array answer of size k such that, for each j (1 <= j <= k), answer[j] is the number of users whose UAM equals j.

+ +

Return the array answer as described above.

+ +

 

+

Example 1:

+ +
+Input: logs = [[0,5],[1,2],[0,2],[0,5],[1,3]], k = 5
+Output: [0,2,0,0,0]
+Explanation:
+The user with ID=0 performed actions at minutes 5, 2, and 5 again. Hence, they have a UAM of 2 (minute 5 is only counted once).
+The user with ID=1 performed actions at minutes 2 and 3. Hence, they have a UAM of 2.
+Since both users have a UAM of 2, answer[2] is 2, and the remaining answer[j] values are 0.
+
+ +

Example 2:

+ +
+Input: logs = [[1,1],[2,2],[2,3]], k = 4
+Output: [1,1,0,0]
+Explanation:
+The user with ID=1 performed a single action at minute 1. Hence, they have a UAM of 1.
+The user with ID=2 performed actions at minutes 2 and 3. Hence, they have a UAM of 2.
+There is one user with a UAM of 1 and one with a UAM of 2.
+Hence, answer[1] = 1, answer[2] = 1, and the remaining values are 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= logs.length <= 104
    • +
  • 0 <= IDi <= 109
    • +
  • 1 <= timei <= 105
    • +
  • k is in the range [The maximum UAM for a user, 105].
    • +
+",2.0,False,"class Solution { +public: + vector findingUsersActiveMinutes(vector>& logs, int k) { + + } +};","class Solution { + public int[] findingUsersActiveMinutes(int[][] logs, int k) { + + } +}","class Solution(object): + def findingUsersActiveMinutes(self, logs, k): + """""" + :type logs: List[List[int]] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def findingUsersActiveMinutes(self, logs: List[List[int]], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findingUsersActiveMinutes(int** logs, int logsSize, int* logsColSize, int k, int* returnSize){ + +}","public class Solution { + public int[] FindingUsersActiveMinutes(int[][] logs, int k) { + + } +}","/** + * @param {number[][]} logs + * @param {number} k + * @return {number[]} + */ +var findingUsersActiveMinutes = function(logs, k) { + +};","# @param {Integer[][]} logs +# @param {Integer} k +# @return {Integer[]} +def finding_users_active_minutes(logs, k) + +end","class Solution { + func findingUsersActiveMinutes(_ logs: [[Int]], _ k: Int) -> [Int] { + + } +}","func findingUsersActiveMinutes(logs [][]int, k int) []int { + +}","object Solution { + def findingUsersActiveMinutes(logs: Array[Array[Int]], k: Int): Array[Int] = { + + } +}","class Solution { + fun findingUsersActiveMinutes(logs: Array, k: Int): IntArray { + + } +}","impl Solution { + pub fn finding_users_active_minutes(logs: Vec>, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $logs + * @param Integer $k + * @return Integer[] + */ + function findingUsersActiveMinutes($logs, $k) { + + } +}","function findingUsersActiveMinutes(logs: number[][], k: number): number[] { + +};","(define/contract (finding-users-active-minutes logs k) + (-> (listof (listof exact-integer?)) exact-integer? (listof exact-integer?)) + + )","-spec finding_users_active_minutes(Logs :: [[integer()]], K :: integer()) -> [integer()]. +finding_users_active_minutes(Logs, K) -> + .","defmodule Solution do + @spec finding_users_active_minutes(logs :: [[integer]], k :: integer) :: [integer] + def finding_users_active_minutes(logs, k) do + + end +end","class Solution { + List findingUsersActiveMinutes(List> logs, int k) { + + } +}", +709,minimum-number-of-operations-to-make-string-sorted,Minimum Number of Operations to Make String Sorted,1830.0,1941.0,"

You are given a string s (0-indexed)​​​​​​. You are asked to perform the following operation on s​​​​​​ until you get a sorted string:

+ +
    +
  1. Find the largest index i such that 1 <= i < s.length and s[i] < s[i - 1].
    2. +
  2. Find the largest index j such that i <= j < s.length and s[k] < s[i - 1] for all the possible values of k in the range [i, j] inclusive.
    3. +
  3. Swap the two characters at indices i - 1​​​​ and j​​​​​.
    4. +
  4. Reverse the suffix starting at index i​​​​​​.
    5. +
+ +

Return the number of operations needed to make the string sorted. Since the answer can be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "cba"
+Output: 5
+Explanation: The simulation goes as follows:
+Operation 1: i=2, j=2. Swap s[1] and s[2] to get s="cab", then reverse the suffix starting at 2. Now, s="cab".
+Operation 2: i=1, j=2. Swap s[0] and s[2] to get s="bac", then reverse the suffix starting at 1. Now, s="bca".
+Operation 3: i=2, j=2. Swap s[1] and s[2] to get s="bac", then reverse the suffix starting at 2. Now, s="bac".
+Operation 4: i=1, j=1. Swap s[0] and s[1] to get s="abc", then reverse the suffix starting at 1. Now, s="acb".
+Operation 5: i=2, j=2. Swap s[1] and s[2] to get s="abc", then reverse the suffix starting at 2. Now, s="abc".
+
+ +

Example 2:

+ +
+Input: s = "aabaa"
+Output: 2
+Explanation: The simulation goes as follows:
+Operation 1: i=3, j=4. Swap s[2] and s[4] to get s="aaaab", then reverse the substring starting at 3. Now, s="aaaba".
+Operation 2: i=4, j=4. Swap s[3] and s[4] to get s="aaaab", then reverse the substring starting at 4. Now, s="aaaab".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 3000
    • +
  • s​​​​​​ consists only of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int makeStringSorted(string s) { + + } +};","class Solution { + public int makeStringSorted(String s) { + + } +}","class Solution(object): + def makeStringSorted(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def makeStringSorted(self, s: str) -> int: + ","int makeStringSorted(char * s){ + +}","public class Solution { + public int MakeStringSorted(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var makeStringSorted = function(s) { + +};","# @param {String} s +# @return {Integer} +def make_string_sorted(s) + +end","class Solution { + func makeStringSorted(_ s: String) -> Int { + + } +}","func makeStringSorted(s string) int { + +}","object Solution { + def makeStringSorted(s: String): Int = { + + } +}","class Solution { + fun makeStringSorted(s: String): Int { + + } +}","impl Solution { + pub fn make_string_sorted(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function makeStringSorted($s) { + + } +}","function makeStringSorted(s: string): number { + +};","(define/contract (make-string-sorted s) + (-> string? exact-integer?) + + )","-spec make_string_sorted(S :: unicode:unicode_binary()) -> integer(). +make_string_sorted(S) -> + .","defmodule Solution do + @spec make_string_sorted(s :: String.t) :: integer + def make_string_sorted(s) do + + end +end","class Solution { + int makeStringSorted(String s) { + + } +}", +710,maximum-xor-for-each-query,Maximum XOR for Each Query,1829.0,1940.0,"

You are given a sorted array nums of n non-negative integers and an integer maximumBit. You want to perform the following query n times:

+ +
    +
  1. Find a non-negative integer k < 2maximumBit such that nums[0] XOR nums[1] XOR ... XOR nums[nums.length-1] XOR k is maximized. k is the answer to the ith query.
    2. +
  2. Remove the last element from the current array nums.
    3. +
+ +

Return an array answer, where answer[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,1,3], maximumBit = 2
+Output: [0,3,2,3]
+Explanation: The queries are answered as follows:
+1st query: nums = [0,1,1,3], k = 0 since 0 XOR 1 XOR 1 XOR 3 XOR 0 = 3.
+2nd query: nums = [0,1,1], k = 3 since 0 XOR 1 XOR 1 XOR 3 = 3.
+3rd query: nums = [0,1], k = 2 since 0 XOR 1 XOR 2 = 3.
+4th query: nums = [0], k = 3 since 0 XOR 3 = 3.
+
+ +

Example 2:

+ +
+Input: nums = [2,3,4,7], maximumBit = 3
+Output: [5,2,6,5]
+Explanation: The queries are answered as follows:
+1st query: nums = [2,3,4,7], k = 5 since 2 XOR 3 XOR 4 XOR 7 XOR 5 = 7.
+2nd query: nums = [2,3,4], k = 2 since 2 XOR 3 XOR 4 XOR 2 = 7.
+3rd query: nums = [2,3], k = 6 since 2 XOR 3 XOR 6 = 7.
+4th query: nums = [2], k = 5 since 2 XOR 5 = 7.
+
+ +

Example 3:

+ +
+Input: nums = [0,1,2,2,5,7], maximumBit = 3
+Output: [4,3,6,4,6,7]
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == n
    • +
  • 1 <= n <= 105
    • +
  • 1 <= maximumBit <= 20
    • +
  • 0 <= nums[i] < 2maximumBit
    • +
  • nums​​​ is sorted in ascending order.
    • +
+",2.0,False,"class Solution { +public: + vector getMaximumXor(vector& nums, int maximumBit) { + + } +};","class Solution { + public int[] getMaximumXor(int[] nums, int maximumBit) { + + } +}","class Solution(object): + def getMaximumXor(self, nums, maximumBit): + """""" + :type nums: List[int] + :type maximumBit: int + :rtype: List[int] + """""" + ","class Solution: + def getMaximumXor(self, nums: List[int], maximumBit: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getMaximumXor(int* nums, int numsSize, int maximumBit, int* returnSize){ + +}","public class Solution { + public int[] GetMaximumXor(int[] nums, int maximumBit) { + + } +}","/** + * @param {number[]} nums + * @param {number} maximumBit + * @return {number[]} + */ +var getMaximumXor = function(nums, maximumBit) { + +};","# @param {Integer[]} nums +# @param {Integer} maximum_bit +# @return {Integer[]} +def get_maximum_xor(nums, maximum_bit) + +end","class Solution { + func getMaximumXor(_ nums: [Int], _ maximumBit: Int) -> [Int] { + + } +}","func getMaximumXor(nums []int, maximumBit int) []int { + +}","object Solution { + def getMaximumXor(nums: Array[Int], maximumBit: Int): Array[Int] = { + + } +}","class Solution { + fun getMaximumXor(nums: IntArray, maximumBit: Int): IntArray { + + } +}","impl Solution { + pub fn get_maximum_xor(nums: Vec, maximum_bit: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $maximumBit + * @return Integer[] + */ + function getMaximumXor($nums, $maximumBit) { + + } +}","function getMaximumXor(nums: number[], maximumBit: number): number[] { + +};","(define/contract (get-maximum-xor nums maximumBit) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec get_maximum_xor(Nums :: [integer()], MaximumBit :: integer()) -> [integer()]. +get_maximum_xor(Nums, MaximumBit) -> + .","defmodule Solution do + @spec get_maximum_xor(nums :: [integer], maximum_bit :: integer) :: [integer] + def get_maximum_xor(nums, maximum_bit) do + + end +end","class Solution { + List getMaximumXor(List nums, int maximumBit) { + + } +}", +713,maximize-number-of-nice-divisors,Maximize Number of Nice Divisors,1808.0,1936.0,"

You are given a positive integer primeFactors. You are asked to construct a positive integer n that satisfies the following conditions:

+ +
    +
  • The number of prime factors of n (not necessarily distinct) is at most primeFactors.
    • +
  • The number of nice divisors of n is maximized. Note that a divisor of n is nice if it is divisible by every prime factor of n. For example, if n = 12, then its prime factors are [2,2,3], then 6 and 12 are nice divisors, while 3 and 4 are not.
    • +
+ +

Return the number of nice divisors of n. Since that number can be too large, return it modulo 109 + 7.

+ +

Note that a prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. The prime factors of a number n is a list of prime numbers such that their product equals n.

+ +

 

+

Example 1:

+ +
+Input: primeFactors = 5
+Output: 6
+Explanation: 200 is a valid value of n.
+It has 5 prime factors: [2,2,2,5,5], and it has 6 nice divisors: [10,20,40,50,100,200].
+There is not other value of n that has at most 5 prime factors and more nice divisors.
+
+ +

Example 2:

+ +
+Input: primeFactors = 8
+Output: 18
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= primeFactors <= 109
    • +
",3.0,False,"class Solution { +public: + int maxNiceDivisors(int primeFactors) { + + } +};","class Solution { + public int maxNiceDivisors(int primeFactors) { + + } +}","class Solution(object): + def maxNiceDivisors(self, primeFactors): + """""" + :type primeFactors: int + :rtype: int + """""" + ","class Solution: + def maxNiceDivisors(self, primeFactors: int) -> int: + "," + +int maxNiceDivisors(int primeFactors){ + +}","public class Solution { + public int MaxNiceDivisors(int primeFactors) { + + } +}","/** + * @param {number} primeFactors + * @return {number} + */ +var maxNiceDivisors = function(primeFactors) { + +};","# @param {Integer} prime_factors +# @return {Integer} +def max_nice_divisors(prime_factors) + +end","class Solution { + func maxNiceDivisors(_ primeFactors: Int) -> Int { + + } +}","func maxNiceDivisors(primeFactors int) int { + +}","object Solution { + def maxNiceDivisors(primeFactors: Int): Int = { + + } +}","class Solution { + fun maxNiceDivisors(primeFactors: Int): Int { + + } +}","impl Solution { + pub fn max_nice_divisors(prime_factors: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $primeFactors + * @return Integer + */ + function maxNiceDivisors($primeFactors) { + + } +}","function maxNiceDivisors(primeFactors: number): number { + +};","(define/contract (max-nice-divisors primeFactors) + (-> exact-integer? exact-integer?) + + )",,,, +720,maximum-ascending-subarray-sum,Maximum Ascending Subarray Sum,1800.0,1927.0,"

Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.

+ +

A subarray is defined as a contiguous sequence of numbers in an array.

+ +

A subarray [numsl, numsl+1, ..., numsr-1, numsr] is ascending if for all i where l <= i < r, numsi < numsi+1. Note that a subarray of size 1 is ascending.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,20,30,5,10,50]
+Output: 65
+Explanation: [5,10,50] is the ascending subarray with the maximum sum of 65.
+
+ +

Example 2:

+ +
+Input: nums = [10,20,30,40,50]
+Output: 150
+Explanation: [10,20,30,40,50] is the ascending subarray with the maximum sum of 150.
+
+ +

Example 3:

+ +
+Input: nums = [12,17,15,13,10,11,12]
+Output: 33
+Explanation: [10,11,12] is the ascending subarray with the maximum sum of 33.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= nums[i] <= 100
    • +
+",1.0,False,"class Solution { +public: + int maxAscendingSum(vector& nums) { + + } +};","class Solution { + public int maxAscendingSum(int[] nums) { + + } +}","class Solution(object): + def maxAscendingSum(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxAscendingSum(self, nums: List[int]) -> int: + ","int maxAscendingSum(int* nums, int numsSize){ + +}","public class Solution { + public int MaxAscendingSum(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxAscendingSum = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_ascending_sum(nums) + +end","class Solution { + func maxAscendingSum(_ nums: [Int]) -> Int { + + } +}","func maxAscendingSum(nums []int) int { + +}","object Solution { + def maxAscendingSum(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxAscendingSum(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_ascending_sum(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxAscendingSum($nums) { + + } +}","function maxAscendingSum(nums: number[]): number { + +};","(define/contract (max-ascending-sum nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_ascending_sum(Nums :: [integer()]) -> integer(). +max_ascending_sum(Nums) -> + .","defmodule Solution do + @spec max_ascending_sum(nums :: [integer]) :: integer + def max_ascending_sum(nums) do + + end +end","class Solution { + int maxAscendingSum(List nums) { + + } +}", +721,count-nice-pairs-in-an-array,Count Nice Pairs in an Array,1814.0,1925.0,"

You are given an array nums that consists of non-negative integers. Let us define rev(x) as the reverse of the non-negative integer x. For example, rev(123) = 321, and rev(120) = 21. A pair of indices (i, j) is nice if it satisfies all of the following conditions:

+ +
    +
  • 0 <= i < j < nums.length
    • +
  • nums[i] + rev(nums[j]) == nums[j] + rev(nums[i])
    • +
+ +

Return the number of nice pairs of indices. Since that number can be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [42,11,1,97]
+Output: 2
+Explanation: The two pairs are:
+ - (0,3) : 42 + rev(97) = 42 + 79 = 121, 97 + rev(42) = 97 + 24 = 121.
+ - (1,2) : 11 + rev(1) = 11 + 1 = 12, 1 + rev(11) = 1 + 11 = 12.
+
+ +

Example 2:

+ +
+Input: nums = [13,10,35,24,76]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int countNicePairs(vector& nums) { + + } +};","class Solution { + public int countNicePairs(int[] nums) { + + } +}","class Solution(object): + def countNicePairs(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countNicePairs(self, nums: List[int]) -> int: + ","int countNicePairs(int* nums, int numsSize){ + +}","public class Solution { + public int CountNicePairs(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countNicePairs = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_nice_pairs(nums) + +end","class Solution { + func countNicePairs(_ nums: [Int]) -> Int { + + } +}","func countNicePairs(nums []int) int { + +}","object Solution { + def countNicePairs(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countNicePairs(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_nice_pairs(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countNicePairs($nums) { + + } +}","function countNicePairs(nums: number[]): number { + +};","(define/contract (count-nice-pairs nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_nice_pairs(Nums :: [integer()]) -> integer(). +count_nice_pairs(Nums) -> + .","defmodule Solution do + @spec count_nice_pairs(nums :: [integer]) :: integer + def count_nice_pairs(nums) do + + end +end","class Solution { + int countNicePairs(List nums) { + + } +}", +722,maximum-number-of-groups-getting-fresh-donuts,Maximum Number of Groups Getting Fresh Donuts,1815.0,1924.0,"

There is a donuts shop that bakes donuts in batches of batchSize. They have a rule where they must serve all of the donuts of a batch before serving any donuts of the next batch. You are given an integer batchSize and an integer array groups, where groups[i] denotes that there is a group of groups[i] customers that will visit the shop. Each customer will get exactly one donut.

+ +

When a group visits the shop, all customers of the group must be served before serving any of the following groups. A group will be happy if they all get fresh donuts. That is, the first customer of the group does not receive a donut that was left over from the previous group.

+ +

You can freely rearrange the ordering of the groups. Return the maximum possible number of happy groups after rearranging the groups.

+ +

 

+

Example 1:

+ +
+Input: batchSize = 3, groups = [1,2,3,4,5,6]
+Output: 4
+Explanation: You can arrange the groups as [6,2,4,5,1,3]. Then the 1st, 2nd, 4th, and 6th groups will be happy.
+
+ +

Example 2:

+ +
+Input: batchSize = 4, groups = [1,3,2,5,2,2,1,6]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= batchSize <= 9
    • +
  • 1 <= groups.length <= 30
    • +
  • 1 <= groups[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int maxHappyGroups(int batchSize, vector& groups) { + + } +};","class Solution { + public int maxHappyGroups(int batchSize, int[] groups) { + + } +}","class Solution(object): + def maxHappyGroups(self, batchSize, groups): + """""" + :type batchSize: int + :type groups: List[int] + :rtype: int + """""" + ","class Solution: + def maxHappyGroups(self, batchSize: int, groups: List[int]) -> int: + ","int maxHappyGroups(int batchSize, int* groups, int groupsSize){ + +}","public class Solution { + public int MaxHappyGroups(int batchSize, int[] groups) { + + } +}","/** + * @param {number} batchSize + * @param {number[]} groups + * @return {number} + */ +var maxHappyGroups = function(batchSize, groups) { + +};","# @param {Integer} batch_size +# @param {Integer[]} groups +# @return {Integer} +def max_happy_groups(batch_size, groups) + +end","class Solution { + func maxHappyGroups(_ batchSize: Int, _ groups: [Int]) -> Int { + + } +}","func maxHappyGroups(batchSize int, groups []int) int { + +}","object Solution { + def maxHappyGroups(batchSize: Int, groups: Array[Int]): Int = { + + } +}","class Solution { + fun maxHappyGroups(batchSize: Int, groups: IntArray): Int { + + } +}","impl Solution { + pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $batchSize + * @param Integer[] $groups + * @return Integer + */ + function maxHappyGroups($batchSize, $groups) { + + } +}","function maxHappyGroups(batchSize: number, groups: number[]): number { + +};","(define/contract (max-happy-groups batchSize groups) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec max_happy_groups(BatchSize :: integer(), Groups :: [integer()]) -> integer(). +max_happy_groups(BatchSize, Groups) -> + .","defmodule Solution do + @spec max_happy_groups(batch_size :: integer, groups :: [integer]) :: integer + def max_happy_groups(batch_size, groups) do + + end +end","class Solution { + int maxHappyGroups(int batchSize, List groups) { + + } +}", +725,maximum-score-of-a-good-subarray,Maximum Score of a Good Subarray,1793.0,1918.0,"

You are given an array of integers nums (0-indexed) and an integer k.

+ +

The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1). A good subarray is a subarray where i <= k <= j.

+ +

Return the maximum possible score of a good subarray.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,4,3,7,4,5], k = 3
+Output: 15
+Explanation: The optimal subarray is (1, 5) with a score of min(4,3,7,4,5) * (5-1+1) = 3 * 5 = 15. 
+
+ +

Example 2:

+ +
+Input: nums = [5,5,4,5,4,1,1,1], k = 0
+Output: 20
+Explanation: The optimal subarray is (0, 4) with a score of min(5,5,4,5,4) * (4-0+1) = 4 * 5 = 20.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 2 * 104
    • +
  • 0 <= k < nums.length
    • +
+",3.0,False,"class Solution { +public: + int maximumScore(vector& nums, int k) { + + } +};","class Solution { + public int maximumScore(int[] nums, int k) { + + } +}","class Solution(object): + def maximumScore(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maximumScore(self, nums: List[int], k: int) -> int: + ","int maximumScore(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MaximumScore(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var maximumScore = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def maximum_score(nums, k) + +end","class Solution { + func maximumScore(_ nums: [Int], _ k: Int) -> Int { + + } +}","func maximumScore(nums []int, k int) int { + +}","object Solution { + def maximumScore(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maximumScore(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn maximum_score(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function maximumScore($nums, $k) { + + } +}","function maximumScore(nums: number[], k: number): number { + +};","(define/contract (maximum-score nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec maximum_score(Nums :: [integer()], K :: integer()) -> integer(). +maximum_score(Nums, K) -> + .","defmodule Solution do + @spec maximum_score(nums :: [integer], k :: integer) :: integer + def maximum_score(nums, k) do + + end +end","class Solution { + int maximumScore(List nums, int k) { + + } +}", +729,make-the-xor-of-all-segments-equal-to-zero,Make the XOR of All Segments Equal to Zero,1787.0,1913.0,"

You are given an array nums​​​ and an integer k​​​​​. The XOR of a segment [left, right] where left <= right is the XOR of all the elements with indices between left and right, inclusive: nums[left] XOR nums[left+1] XOR ... XOR nums[right].

+ +

Return the minimum number of elements to change in the array such that the XOR of all segments of size k​​​​​​ is equal to zero.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,0,3,0], k = 1
+Output: 3
+Explanation: Modify the array from [1,2,0,3,0] to from [0,0,0,0,0].
+
+ +

Example 2:

+ +
+Input: nums = [3,4,5,2,1,7,3,4,7], k = 3
+Output: 3
+Explanation: Modify the array from [3,4,5,2,1,7,3,4,7] to [3,4,7,3,4,7,3,4,7].
+
+ +

Example 3:

+ +
+Input: nums = [1,2,4,1,2,5,1,2,6], k = 3
+Output: 3
+Explanation: Modify the array from [1,2,4,1,2,5,1,2,6] to [1,2,3,1,2,3,1,2,3].
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 2000
    • +
  • ​​​​​​0 <= nums[i] < 210
    • +
+",3.0,False,"class Solution { +public: + int minChanges(vector& nums, int k) { + + } +};","class Solution { + public int minChanges(int[] nums, int k) { + + } +}","class Solution(object): + def minChanges(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minChanges(self, nums: List[int], k: int) -> int: + ","int minChanges(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinChanges(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minChanges = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_changes(nums, k) + +end","class Solution { + func minChanges(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minChanges(nums []int, k int) int { + +}","object Solution { + def minChanges(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minChanges(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_changes(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minChanges($nums, $k) { + + } +}","function minChanges(nums: number[], k: number): number { + +};","(define/contract (min-changes nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_changes(Nums :: [integer()], K :: integer()) -> integer(). +min_changes(Nums, K) -> + .","defmodule Solution do + @spec min_changes(nums :: [integer], k :: integer) :: integer + def min_changes(nums, k) do + + end +end","class Solution { + int minChanges(List nums, int k) { + + } +}", +731,minimum-elements-to-add-to-form-a-given-sum,Minimum Elements to Add to Form a Given Sum,1785.0,1911.0,"

You are given an integer array nums and two integers limit and goal. The array nums has an interesting property that abs(nums[i]) <= limit.

+ +

Return the minimum number of elements you need to add to make the sum of the array equal to goal. The array must maintain its property that abs(nums[i]) <= limit.

+ +

Note that abs(x) equals x if x >= 0, and -x otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,-1,1], limit = 3, goal = -4
+Output: 2
+Explanation: You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.
+
+ +

Example 2:

+ +
+Input: nums = [1,-10,9,1], limit = 100, goal = 0
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= limit <= 106
    • +
  • -limit <= nums[i] <= limit
    • +
  • -109 <= goal <= 109
    • +
+",2.0,False,"class Solution { +public: + int minElements(vector& nums, int limit, int goal) { + + } +};","class Solution { + public int minElements(int[] nums, int limit, int goal) { + + } +}","class Solution(object): + def minElements(self, nums, limit, goal): + """""" + :type nums: List[int] + :type limit: int + :type goal: int + :rtype: int + """""" + ","class Solution: + def minElements(self, nums: List[int], limit: int, goal: int) -> int: + ","int minElements(int* nums, int numsSize, int limit, int goal){ + +}","public class Solution { + public int MinElements(int[] nums, int limit, int goal) { + + } +}","/** + * @param {number[]} nums + * @param {number} limit + * @param {number} goal + * @return {number} + */ +var minElements = function(nums, limit, goal) { + +};","# @param {Integer[]} nums +# @param {Integer} limit +# @param {Integer} goal +# @return {Integer} +def min_elements(nums, limit, goal) + +end","class Solution { + func minElements(_ nums: [Int], _ limit: Int, _ goal: Int) -> Int { + + } +}","func minElements(nums []int, limit int, goal int) int { + +}","object Solution { + def minElements(nums: Array[Int], limit: Int, goal: Int): Int = { + + } +}","class Solution { + fun minElements(nums: IntArray, limit: Int, goal: Int): Int { + + } +}","impl Solution { + pub fn min_elements(nums: Vec, limit: i32, goal: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $limit + * @param Integer $goal + * @return Integer + */ + function minElements($nums, $limit, $goal) { + + } +}","function minElements(nums: number[], limit: number, goal: number): number { + +};","(define/contract (min-elements nums limit goal) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec min_elements(Nums :: [integer()], Limit :: integer(), Goal :: integer()) -> integer(). +min_elements(Nums, Limit, Goal) -> + .","defmodule Solution do + @spec min_elements(nums :: [integer], limit :: integer, goal :: integer) :: integer + def min_elements(nums, limit, goal) do + + end +end","class Solution { + int minElements(List nums, int limit, int goal) { + + } +}", +733,count-pairs-with-xor-in-a-range,Count Pairs With XOR in a Range,1803.0,1907.0,"

Given a (0-indexed) integer array nums and two integers low and high, return the number of nice pairs.

+ +

A nice pair is a pair (i, j) where 0 <= i < j < nums.length and low <= (nums[i] XOR nums[j]) <= high.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,4,2,7], low = 2, high = 6
+Output: 6
+Explanation: All nice pairs (i, j) are as follows:
+    - (0, 1): nums[0] XOR nums[1] = 5 
+    - (0, 2): nums[0] XOR nums[2] = 3
+    - (0, 3): nums[0] XOR nums[3] = 6
+    - (1, 2): nums[1] XOR nums[2] = 6
+    - (1, 3): nums[1] XOR nums[3] = 3
+    - (2, 3): nums[2] XOR nums[3] = 5
+
+ +

Example 2:

+ +
+Input: nums = [9,8,4,2,1], low = 5, high = 14
+Output: 8
+Explanation: All nice pairs (i, j) are as follows:
+​​​​​    - (0, 2): nums[0] XOR nums[2] = 13
+    - (0, 3): nums[0] XOR nums[3] = 11
+    - (0, 4): nums[0] XOR nums[4] = 8
+    - (1, 2): nums[1] XOR nums[2] = 12
+    - (1, 3): nums[1] XOR nums[3] = 10
+    - (1, 4): nums[1] XOR nums[4] = 9
+    - (2, 3): nums[2] XOR nums[3] = 6
+    - (2, 4): nums[2] XOR nums[4] = 5
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 104
    • +
  • 1 <= nums[i] <= 2 * 104
    • +
  • 1 <= low <= high <= 2 * 104
    • +
",3.0,False,"class Solution { +public: + int countPairs(vector& nums, int low, int high) { + + } +};","class Solution { + public int countPairs(int[] nums, int low, int high) { + + } +}","class Solution(object): + def countPairs(self, nums, low, high): + """""" + :type nums: List[int] + :type low: int + :type high: int + :rtype: int + """""" + ","class Solution: + def countPairs(self, nums: List[int], low: int, high: int) -> int: + "," + +int countPairs(int* nums, int numsSize, int low, int high){ + +}","public class Solution { + public int CountPairs(int[] nums, int low, int high) { + + } +}","/** + * @param {number[]} nums + * @param {number} low + * @param {number} high + * @return {number} + */ +var countPairs = function(nums, low, high) { + +};","# @param {Integer[]} nums +# @param {Integer} low +# @param {Integer} high +# @return {Integer} +def count_pairs(nums, low, high) + +end","class Solution { + func countPairs(_ nums: [Int], _ low: Int, _ high: Int) -> Int { + + } +}","func countPairs(nums []int, low int, high int) int { + +}","object Solution { + def countPairs(nums: Array[Int], low: Int, high: Int): Int = { + + } +}","class Solution { + fun countPairs(nums: IntArray, low: Int, high: Int): Int { + + } +}","impl Solution { + pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $low + * @param Integer $high + * @return Integer + */ + function countPairs($nums, $low, $high) { + + } +}","function countPairs(nums: number[], low: number, high: number): number { + +};","(define/contract (count-pairs nums low high) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )",,,, +734,maximize-score-after-n-operations,Maximize Score After N Operations,1799.0,1906.0,"

You are given nums, an array of positive integers of size 2 * n. You must perform n operations on this array.

+ +

In the ith operation (1-indexed), you will:

+ +
    +
  • Choose two elements, x and y.
    • +
  • Receive a score of i * gcd(x, y).
    • +
  • Remove x and y from nums.
    • +
+ +

Return the maximum score you can receive after performing n operations.

+ +

The function gcd(x, y) is the greatest common divisor of x and y.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2]
+Output: 1
+Explanation: The optimal choice of operations is:
+(1 * gcd(1, 2)) = 1
+
+ +

Example 2:

+ +
+Input: nums = [3,4,6,8]
+Output: 11
+Explanation: The optimal choice of operations is:
+(1 * gcd(3, 6)) + (2 * gcd(4, 8)) = 3 + 8 = 11
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,5,6]
+Output: 14
+Explanation: The optimal choice of operations is:
+(1 * gcd(1, 5)) + (2 * gcd(2, 4)) + (3 * gcd(3, 6)) = 1 + 4 + 9 = 14
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 7
    • +
  • nums.length == 2 * n
    • +
  • 1 <= nums[i] <= 106
    • +
+",3.0,False,"class Solution { +public: + int maxScore(vector& nums) { + + } +};","class Solution { + public int maxScore(int[] nums) { + + } +}","class Solution(object): + def maxScore(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxScore(self, nums: List[int]) -> int: + ","int maxScore(int* nums, int numsSize){ + +}","public class Solution { + public int MaxScore(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxScore = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_score(nums) + +end","class Solution { + func maxScore(_ nums: [Int]) -> Int { + + } +}","func maxScore(nums []int) int { + +}","object Solution { + def maxScore(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxScore(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_score(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxScore($nums) { + + } +}","function maxScore(nums: number[]): number { + +};","(define/contract (max-score nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_score(Nums :: [integer()]) -> integer(). +max_score(Nums) -> + .","defmodule Solution do + @spec max_score(nums :: [integer]) :: integer + def max_score(nums) do + + end +end","class Solution { + int maxScore(List nums) { + + } +}", +737,car-fleet-ii,Car Fleet II,1776.0,1902.0,"

There are n cars traveling at different speeds in the same direction along a one-lane road. You are given an array cars of length n, where cars[i] = [positioni, speedi] represents:

+ +
    +
  • positioni is the distance between the ith car and the beginning of the road in meters. It is guaranteed that positioni < positioni+1.
    • +
  • speedi is the initial speed of the ith car in meters per second.
    • +
+ +

For simplicity, cars can be considered as points moving along the number line. Two cars collide when they occupy the same position. Once a car collides with another car, they unite and form a single car fleet. The cars in the formed fleet will have the same position and the same speed, which is the initial speed of the slowest car in the fleet.

+ +

Return an array answer, where answer[i] is the time, in seconds, at which the ith car collides with the next car, or -1 if the car does not collide with the next car. Answers within 10-5 of the actual answers are accepted.

+ +

 

+

Example 1:

+ +
+Input: cars = [[1,2],[2,1],[4,3],[7,2]]
+Output: [1.00000,-1.00000,3.00000,-1.00000]
+Explanation: After exactly one second, the first car will collide with the second car, and form a car fleet with speed 1 m/s. After exactly 3 seconds, the third car will collide with the fourth car, and form a car fleet with speed 2 m/s.
+
+ +

Example 2:

+ +
+Input: cars = [[3,4],[5,4],[6,3],[9,1]]
+Output: [2.00000,1.00000,1.50000,-1.00000]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= cars.length <= 105
    • +
  • 1 <= positioni, speedi <= 106
    • +
  • positioni < positioni+1
    • +
+",3.0,False,"class Solution { +public: + vector getCollisionTimes(vector>& cars) { + + } +};","class Solution { + public double[] getCollisionTimes(int[][] cars) { + + } +}","class Solution(object): + def getCollisionTimes(self, cars): + """""" + :type cars: List[List[int]] + :rtype: List[float] + """""" + ","class Solution: + def getCollisionTimes(self, cars: List[List[int]]) -> List[float]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +double* getCollisionTimes(int** cars, int carsSize, int* carsColSize, int* returnSize){ + +}","public class Solution { + public double[] GetCollisionTimes(int[][] cars) { + + } +}","/** + * @param {number[][]} cars + * @return {number[]} + */ +var getCollisionTimes = function(cars) { + +};","# @param {Integer[][]} cars +# @return {Float[]} +def get_collision_times(cars) + +end","class Solution { + func getCollisionTimes(_ cars: [[Int]]) -> [Double] { + + } +}","func getCollisionTimes(cars [][]int) []float64 { + +}","object Solution { + def getCollisionTimes(cars: Array[Array[Int]]): Array[Double] = { + + } +}","class Solution { + fun getCollisionTimes(cars: Array): DoubleArray { + + } +}","impl Solution { + pub fn get_collision_times(cars: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $cars + * @return Float[] + */ + function getCollisionTimes($cars) { + + } +}","function getCollisionTimes(cars: number[][]): number[] { + +};","(define/contract (get-collision-times cars) + (-> (listof (listof exact-integer?)) (listof flonum?)) + + )","-spec get_collision_times(Cars :: [[integer()]]) -> [float()]. +get_collision_times(Cars) -> + .","defmodule Solution do + @spec get_collision_times(cars :: [[integer]]) :: [float] + def get_collision_times(cars) do + + end +end","class Solution { + List getCollisionTimes(List> cars) { + + } +}", +738,equal-sum-arrays-with-minimum-number-of-operations,Equal Sum Arrays With Minimum Number of Operations,1775.0,1901.0,"

You are given two arrays of integers nums1 and nums2, possibly of different lengths. The values in the arrays are between 1 and 6, inclusive.

+ +

In one operation, you can change any integer's value in any of the arrays to any value between 1 and 6, inclusive.

+ +

Return the minimum number of operations required to make the sum of values in nums1 equal to the sum of values in nums2. Return -1​​​​​ if it is not possible to make the sum of the two arrays equal.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,4,5,6], nums2 = [1,1,2,2,2,2]
+Output: 3
+Explanation: You can make the sums of nums1 and nums2 equal with 3 operations. All indices are 0-indexed.
+- Change nums2[0] to 6. nums1 = [1,2,3,4,5,6], nums2 = [6,1,2,2,2,2].
+- Change nums1[5] to 1. nums1 = [1,2,3,4,5,1], nums2 = [6,1,2,2,2,2].
+- Change nums1[2] to 2. nums1 = [1,2,2,4,5,1], nums2 = [6,1,2,2,2,2].
+
+ +

Example 2:

+ +
+Input: nums1 = [1,1,1,1,1,1,1], nums2 = [6]
+Output: -1
+Explanation: There is no way to decrease the sum of nums1 or to increase the sum of nums2 to make them equal.
+
+ +

Example 3:

+ +
+Input: nums1 = [6,6], nums2 = [1]
+Output: 3
+Explanation: You can make the sums of nums1 and nums2 equal with 3 operations. All indices are 0-indexed. 
+- Change nums1[0] to 2. nums1 = [2,6], nums2 = [1].
+- Change nums1[1] to 2. nums1 = [2,2], nums2 = [1].
+- Change nums2[0] to 4. nums1 = [2,2], nums2 = [4].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= 6
    • +
+",2.0,False,"class Solution { +public: + int minOperations(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int minOperations(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def minOperations(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def minOperations(self, nums1: List[int], nums2: List[int]) -> int: + ","int minOperations(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MinOperations(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minOperations = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def min_operations(nums1, nums2) + +end","class Solution { + func minOperations(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func minOperations(nums1 []int, nums2 []int) int { + +}","object Solution { + def minOperations(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun minOperations(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn min_operations(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function minOperations($nums1, $nums2) { + + } +}","function minOperations(nums1: number[], nums2: number[]): number { + +};","(define/contract (min-operations nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_operations(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +min_operations(Nums1, Nums2) -> + .","defmodule Solution do + @spec min_operations(nums1 :: [integer], nums2 :: [integer]) :: integer + def min_operations(nums1, nums2) do + + end +end","class Solution { + int minOperations(List nums1, List nums2) { + + } +}", +741,maximize-palindrome-length-from-subsequences,Maximize Palindrome Length From Subsequences,1771.0,1897.0,"

You are given two strings, word1 and word2. You want to construct a string in the following manner:

+ +
    +
  • Choose some non-empty subsequence subsequence1 from word1.
    • +
  • Choose some non-empty subsequence subsequence2 from word2.
    • +
  • Concatenate the subsequences: subsequence1 + subsequence2, to make the string.
    • +
+ +

Return the length of the longest palindrome that can be constructed in the described manner. If no palindromes can be constructed, return 0.

+ +

A subsequence of a string s is a string that can be made by deleting some (possibly none) characters from s without changing the order of the remaining characters.

+ +

A palindrome is a string that reads the same forward as well as backward.

+ +

 

+

Example 1:

+ +
+Input: word1 = "cacb", word2 = "cbba"
+Output: 5
+Explanation: Choose "ab" from word1 and "cba" from word2 to make "abcba", which is a palindrome.
+ +

Example 2:

+ +
+Input: word1 = "ab", word2 = "ab"
+Output: 3
+Explanation: Choose "ab" from word1 and "a" from word2 to make "aba", which is a palindrome.
+ +

Example 3:

+ +
+Input: word1 = "aa", word2 = "bb"
+Output: 0
+Explanation: You cannot construct a palindrome from the described method, so return 0.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word1.length, word2.length <= 1000
    • +
  • word1 and word2 consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int longestPalindrome(string word1, string word2) { + + } +};","class Solution { + public int longestPalindrome(String word1, String word2) { + + } +}","class Solution(object): + def longestPalindrome(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: int + """""" + ","class Solution: + def longestPalindrome(self, word1: str, word2: str) -> int: + ","int longestPalindrome(char * word1, char * word2){ + +}","public class Solution { + public int LongestPalindrome(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var longestPalindrome = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {Integer} +def longest_palindrome(word1, word2) + +end","class Solution { + func longestPalindrome(_ word1: String, _ word2: String) -> Int { + + } +}","func longestPalindrome(word1 string, word2 string) int { + +}","object Solution { + def longestPalindrome(word1: String, word2: String): Int = { + + } +}","class Solution { + fun longestPalindrome(word1: String, word2: String): Int { + + } +}","impl Solution { + pub fn longest_palindrome(word1: String, word2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return Integer + */ + function longestPalindrome($word1, $word2) { + + } +}","function longestPalindrome(word1: string, word2: string): number { + +};","(define/contract (longest-palindrome word1 word2) + (-> string? string? exact-integer?) + + )","-spec longest_palindrome(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> integer(). +longest_palindrome(Word1, Word2) -> + .","defmodule Solution do + @spec longest_palindrome(word1 :: String.t, word2 :: String.t) :: integer + def longest_palindrome(word1, word2) do + + end +end","class Solution { + int longestPalindrome(String word1, String word2) { + + } +}", +742,maximum-score-from-performing-multiplication-operations,Maximum Score from Performing Multiplication Operations,1770.0,1896.0,"

You are given two 0-indexed integer arrays nums and multipliers of size n and m respectively, where n >= m.

+ +

You begin with a score of 0. You want to perform exactly m operations. On the ith operation (0-indexed) you will:

+ +
    +
  • Choose one integer x from either the start or the end of the array nums.
    • +
  • Add multipliers[i] * x to your score. +
      +
    • Note that multipliers[0] corresponds to the first operation, multipliers[1] to the second operation, and so on.
      • +
    +
    • +
  • Remove x from nums.
    • +
+ +

Return the maximum score after performing m operations.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3], multipliers = [3,2,1]
+Output: 14
+Explanation: An optimal solution is as follows:
+- Choose from the end, [1,2,3], adding 3 * 3 = 9 to the score.
+- Choose from the end, [1,2], adding 2 * 2 = 4 to the score.
+- Choose from the end, [1], adding 1 * 1 = 1 to the score.
+The total score is 9 + 4 + 1 = 14.
+ +

Example 2:

+ +
+Input: nums = [-5,-3,-3,-2,7,1], multipliers = [-10,-5,3,4,6]
+Output: 102
+Explanation: An optimal solution is as follows:
+- Choose from the start, [-5,-3,-3,-2,7,1], adding -5 * -10 = 50 to the score.
+- Choose from the start, [-3,-3,-2,7,1], adding -3 * -5 = 15 to the score.
+- Choose from the start, [-3,-2,7,1], adding -3 * 3 = -9 to the score.
+- Choose from the end, [-2,7,1], adding 1 * 4 = 4 to the score.
+- Choose from the end, [-2,7], adding 7 * 6 = 42 to the score. 
+The total score is 50 + 15 - 9 + 4 + 42 = 102.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • m == multipliers.length
    • +
  • 1 <= m <= 300
    • +
  • m <= n <= 105
    • +
  • -1000 <= nums[i], multipliers[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int maximumScore(vector& nums, vector& multipliers) { + + } +};","class Solution { + public int maximumScore(int[] nums, int[] multipliers) { + + } +}","class Solution(object): + def maximumScore(self, nums, multipliers): + """""" + :type nums: List[int] + :type multipliers: List[int] + :rtype: int + """""" + ","class Solution: + def maximumScore(self, nums: List[int], multipliers: List[int]) -> int: + ","int maximumScore(int* nums, int numsSize, int* multipliers, int multipliersSize){ + +}","public class Solution { + public int MaximumScore(int[] nums, int[] multipliers) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} multipliers + * @return {number} + */ +var maximumScore = function(nums, multipliers) { + +};","# @param {Integer[]} nums +# @param {Integer[]} multipliers +# @return {Integer} +def maximum_score(nums, multipliers) + +end","class Solution { + func maximumScore(_ nums: [Int], _ multipliers: [Int]) -> Int { + + } +}","func maximumScore(nums []int, multipliers []int) int { + +}","object Solution { + def maximumScore(nums: Array[Int], multipliers: Array[Int]): Int = { + + } +}","class Solution { + fun maximumScore(nums: IntArray, multipliers: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_score(nums: Vec, multipliers: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $multipliers + * @return Integer + */ + function maximumScore($nums, $multipliers) { + + } +}","function maximumScore(nums: number[], multipliers: number[]): number { + +};","(define/contract (maximum-score nums multipliers) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec maximum_score(Nums :: [integer()], Multipliers :: [integer()]) -> integer(). +maximum_score(Nums, Multipliers) -> + .","defmodule Solution do + @spec maximum_score(nums :: [integer], multipliers :: [integer]) :: integer + def maximum_score(nums, multipliers) do + + end +end","class Solution { + int maximumScore(List nums, List multipliers) { + + } +}", +744,merge-strings-alternately,Merge Strings Alternately,1768.0,1894.0,"

You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.

+ +

Return the merged string.

+ +

 

+

Example 1:

+ +
+Input: word1 = "abc", word2 = "pqr"
+Output: "apbqcr"
+Explanation: The merged string will be merged as so:
+word1:  a   b   c
+word2:    p   q   r
+merged: a p b q c r
+
+ +

Example 2:

+ +
+Input: word1 = "ab", word2 = "pqrs"
+Output: "apbqrs"
+Explanation: Notice that as word2 is longer, "rs" is appended to the end.
+word1:  a   b 
+word2:    p   q   r   s
+merged: a p b q   r   s
+
+ +

Example 3:

+ +
+Input: word1 = "abcd", word2 = "pq"
+Output: "apbqcd"
+Explanation: Notice that as word1 is longer, "cd" is appended to the end.
+word1:  a   b   c   d
+word2:    p   q 
+merged: a p b q c   d
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word1.length, word2.length <= 100
    • +
  • word1 and word2 consist of lowercase English letters.
    • +
",1.0,False,"class Solution { +public: + string mergeAlternately(string word1, string word2) { + + } +};","class Solution { + public String mergeAlternately(String word1, String word2) { + + } +}","class Solution(object): + def mergeAlternately(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: str + """""" + ","class Solution: + def mergeAlternately(self, word1: str, word2: str) -> str: + "," + +char * mergeAlternately(char * word1, char * word2){ + +}","public class Solution { + public string MergeAlternately(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {string} + */ +var mergeAlternately = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {String} +def merge_alternately(word1, word2) + +end","class Solution { + func mergeAlternately(_ word1: String, _ word2: String) -> String { + + } +}","func mergeAlternately(word1 string, word2 string) string { + +}","object Solution { + def mergeAlternately(word1: String, word2: String): String = { + + } +}","class Solution { + fun mergeAlternately(word1: String, word2: String): String { + + } +}","impl Solution { + pub fn merge_alternately(word1: String, word2: String) -> String { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return String + */ + function mergeAlternately($word1, $word2) { + + } +}","function mergeAlternately(word1: string, word2: string): string { + +};","(define/contract (merge-alternately word1 word2) + (-> string? string? string?) + + )",,,, +745,count-pairs-of-nodes,Count Pairs Of Nodes,1782.0,1891.0,"

You are given an undirected graph defined by an integer n, the number of nodes, and a 2D integer array edges, the edges in the graph, where edges[i] = [ui, vi] indicates that there is an undirected edge between ui and vi. You are also given an integer array queries.

+ +

Let incident(a, b) be defined as the number of edges that are connected to either node a or b.

+ +

The answer to the jth query is the number of pairs of nodes (a, b) that satisfy both of the following conditions:

+ +
    +
  • a < b
    • +
  • incident(a, b) > queries[j]
    • +
+ +

Return an array answers such that answers.length == queries.length and answers[j] is the answer of the jth query.

+ +

Note that there can be multiple edges between the same two nodes.

+ +

 

+

Example 1:

+ +
+Input: n = 4, edges = [[1,2],[2,4],[1,3],[2,3],[2,1]], queries = [2,3]
+Output: [6,5]
+Explanation: The calculations for incident(a, b) are shown in the table above.
+The answers for each of the queries are as follows:
+- answers[0] = 6. All the pairs have an incident(a, b) value greater than 2.
+- answers[1] = 5. All the pairs except (3, 4) have an incident(a, b) value greater than 3.
+
+ +

Example 2:

+ +
+Input: n = 5, edges = [[1,5],[1,5],[3,4],[2,5],[1,3],[5,1],[2,3],[2,5]], queries = [1,2,3,4,5]
+Output: [10,10,9,8,6]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 2 * 104
    • +
  • 1 <= edges.length <= 105
    • +
  • 1 <= ui, vi <= n
    • +
  • ui != vi
    • +
  • 1 <= queries.length <= 20
    • +
  • 0 <= queries[j] < edges.length
    • +
+",3.0,False,"class Solution { +public: + vector countPairs(int n, vector>& edges, vector& queries) { + + } +};","class Solution { + public int[] countPairs(int n, int[][] edges, int[] queries) { + + } +}","class Solution(object): + def countPairs(self, n, edges, queries): + """""" + :type n: int + :type edges: List[List[int]] + :type queries: List[int] + :rtype: List[int] + """""" + ","class Solution: + def countPairs(self, n: int, edges: List[List[int]], queries: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countPairs(int n, int** edges, int edgesSize, int* edgesColSize, int* queries, int queriesSize, int* returnSize){ + +}","public class Solution { + public int[] CountPairs(int n, int[][] edges, int[] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number[]} queries + * @return {number[]} + */ +var countPairs = function(n, edges, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer[]} queries +# @return {Integer[]} +def count_pairs(n, edges, queries) + +end","class Solution { + func countPairs(_ n: Int, _ edges: [[Int]], _ queries: [Int]) -> [Int] { + + } +}","func countPairs(n int, edges [][]int, queries []int) []int { + +}","object Solution { + def countPairs(n: Int, edges: Array[Array[Int]], queries: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun countPairs(n: Int, edges: Array, queries: IntArray): IntArray { + + } +}","impl Solution { + pub fn count_pairs(n: i32, edges: Vec>, queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer[] $queries + * @return Integer[] + */ + function countPairs($n, $edges, $queries) { + + } +}","function countPairs(n: number, edges: number[][], queries: number[]): number[] { + +};","(define/contract (count-pairs n edges queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?)) + + )","-spec count_pairs(N :: integer(), Edges :: [[integer()]], Queries :: [integer()]) -> [integer()]. +count_pairs(N, Edges, Queries) -> + .","defmodule Solution do + @spec count_pairs(n :: integer, edges :: [[integer]], queries :: [integer]) :: [integer] + def count_pairs(n, edges, queries) do + + end +end","class Solution { + List countPairs(int n, List> edges, List queries) { + + } +}", +749,minimum-degree-of-a-connected-trio-in-a-graph,Minimum Degree of a Connected Trio in a Graph,1761.0,1887.0,"

You are given an undirected graph. You are given an integer n which is the number of nodes in the graph and an array edges, where each edges[i] = [ui, vi] indicates that there is an undirected edge between ui and vi.

+ +

A connected trio is a set of three nodes where there is an edge between every pair of them.

+ +

The degree of a connected trio is the number of edges where one endpoint is in the trio, and the other is not.

+ +

Return the minimum degree of a connected trio in the graph, or -1 if the graph has no connected trios.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[1,2],[1,3],[3,2],[4,1],[5,2],[3,6]]
+Output: 3
+Explanation: There is exactly one trio, which is [1,2,3]. The edges that form its degree are bolded in the figure above.
+
+ +

Example 2:

+ +
+Input: n = 7, edges = [[1,3],[4,1],[4,3],[2,5],[5,6],[6,7],[7,5],[2,6]]
+Output: 0
+Explanation: There are exactly three trios:
+1) [1,4,3] with degree 0.
+2) [2,5,6] with degree 2.
+3) [5,6,7] with degree 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 400
    • +
  • edges[i].length == 2
    • +
  • 1 <= edges.length <= n * (n-1) / 2
    • +
  • 1 <= ui, vi <= n
    • +
  • ui != vi
    • +
  • There are no repeated edges.
    • +
+",3.0,False,"class Solution { +public: + int minTrioDegree(int n, vector>& edges) { + + } +};","class Solution { + public int minTrioDegree(int n, int[][] edges) { + + } +}","class Solution(object): + def minTrioDegree(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minTrioDegree(self, n: int, edges: List[List[int]]) -> int: + ","int minTrioDegree(int n, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int MinTrioDegree(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var minTrioDegree = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer} +def min_trio_degree(n, edges) + +end","class Solution { + func minTrioDegree(_ n: Int, _ edges: [[Int]]) -> Int { + + } +}","func minTrioDegree(n int, edges [][]int) int { + +}","object Solution { + def minTrioDegree(n: Int, edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minTrioDegree(n: Int, edges: Array): Int { + + } +}","impl Solution { + pub fn min_trio_degree(n: i32, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer + */ + function minTrioDegree($n, $edges) { + + } +}","function minTrioDegree(n: number, edges: number[][]): number { + +};","(define/contract (min-trio-degree n edges) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_trio_degree(N :: integer(), Edges :: [[integer()]]) -> integer(). +min_trio_degree(N, Edges) -> + .","defmodule Solution do + @spec min_trio_degree(n :: integer, edges :: [[integer]]) :: integer + def min_trio_degree(n, edges) do + + end +end","class Solution { + int minTrioDegree(int n, List> edges) { + + } +}", +752,minimum-changes-to-make-alternating-binary-string,Minimum Changes To Make Alternating Binary String,1758.0,1884.0,"

You are given a string s consisting only of the characters '0' and '1'. In one operation, you can change any '0' to '1' or vice versa.

+ +

The string is called alternating if no two adjacent characters are equal. For example, the string "010" is alternating, while the string "0100" is not.

+ +

Return the minimum number of operations needed to make s alternating.

+ +

 

+

Example 1:

+ +
+Input: s = "0100"
+Output: 1
+Explanation: If you change the last character to '1', s will be "0101", which is alternating.
+
+ +

Example 2:

+ +
+Input: s = "10"
+Output: 0
+Explanation: s is already alternating.
+
+ +

Example 3:

+ +
+Input: s = "1111"
+Output: 2
+Explanation: You need two operations to reach "0101" or "1010".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s[i] is either '0' or '1'.
    • +
+",1.0,False,"class Solution { +public: + int minOperations(string s) { + + } +};","class Solution { + public int minOperations(String s) { + + } +}","class Solution(object): + def minOperations(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minOperations(self, s: str) -> int: + ","int minOperations(char * s){ + +}","public class Solution { + public int MinOperations(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minOperations = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_operations(s) + +end","class Solution { + func minOperations(_ s: String) -> Int { + + } +}","func minOperations(s string) int { + +}","object Solution { + def minOperations(s: String): Int = { + + } +}","class Solution { + fun minOperations(s: String): Int { + + } +}","impl Solution { + pub fn min_operations(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minOperations($s) { + + } +}","function minOperations(s: string): number { + +};","(define/contract (min-operations s) + (-> string? exact-integer?) + + )","-spec min_operations(S :: unicode:unicode_binary()) -> integer(). +min_operations(S) -> + .","defmodule Solution do + @spec min_operations(s :: String.t) :: integer + def min_operations(s) do + + end +end","class Solution { + int minOperations(String s) { + + } +}", +753,closest-subsequence-sum,Closest Subsequence Sum,1755.0,1881.0,"

You are given an integer array nums and an integer goal.

+ +

You want to choose a subsequence of nums such that the sum of its elements is the closest possible to goal. That is, if the sum of the subsequence's elements is sum, then you want to minimize the absolute difference abs(sum - goal).

+ +

Return the minimum possible value of abs(sum - goal).

+ +

Note that a subsequence of an array is an array formed by removing some elements (possibly all or none) of the original array.

+ +

 

+

Example 1:

+ +
+Input: nums = [5,-7,3,5], goal = 6
+Output: 0
+Explanation: Choose the whole array as a subsequence, with a sum of 6.
+This is equal to the goal, so the absolute difference is 0.
+
+ +

Example 2:

+ +
+Input: nums = [7,-9,15,-2], goal = -5
+Output: 1
+Explanation: Choose the subsequence [7,-9,-2], with a sum of -4.
+The absolute difference is abs(-4 - (-5)) = abs(1) = 1, which is the minimum.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3], goal = -7
+Output: 7
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 40
    • +
  • -107 <= nums[i] <= 107
    • +
  • -109 <= goal <= 109
    • +
+",3.0,False,"class Solution { +public: + int minAbsDifference(vector& nums, int goal) { + + } +};","class Solution { + public int minAbsDifference(int[] nums, int goal) { + + } +}","class Solution(object): + def minAbsDifference(self, nums, goal): + """""" + :type nums: List[int] + :type goal: int + :rtype: int + """""" + ","class Solution: + def minAbsDifference(self, nums: List[int], goal: int) -> int: + ","int minAbsDifference(int* nums, int numsSize, int goal){ + +}","public class Solution { + public int MinAbsDifference(int[] nums, int goal) { + + } +}","/** + * @param {number[]} nums + * @param {number} goal + * @return {number} + */ +var minAbsDifference = function(nums, goal) { + +};","# @param {Integer[]} nums +# @param {Integer} goal +# @return {Integer} +def min_abs_difference(nums, goal) + +end","class Solution { + func minAbsDifference(_ nums: [Int], _ goal: Int) -> Int { + + } +}","func minAbsDifference(nums []int, goal int) int { + +}","object Solution { + def minAbsDifference(nums: Array[Int], goal: Int): Int = { + + } +}","class Solution { + fun minAbsDifference(nums: IntArray, goal: Int): Int { + + } +}","impl Solution { + pub fn min_abs_difference(nums: Vec, goal: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $goal + * @return Integer + */ + function minAbsDifference($nums, $goal) { + + } +}","function minAbsDifference(nums: number[], goal: number): number { + +};","(define/contract (min-abs-difference nums goal) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_abs_difference(Nums :: [integer()], Goal :: integer()) -> integer(). +min_abs_difference(Nums, Goal) -> + .","defmodule Solution do + @spec min_abs_difference(nums :: [integer], goal :: integer) :: integer + def min_abs_difference(nums, goal) do + + end +end","class Solution { + int minAbsDifference(List nums, int goal) { + + } +}", +754,largest-merge-of-two-strings,Largest Merge Of Two Strings,1754.0,1880.0,"

You are given two strings word1 and word2. You want to construct a string merge in the following way: while either word1 or word2 are non-empty, choose one of the following options:

+ +
    +
  • If word1 is non-empty, append the first character in word1 to merge and delete it from word1. + +
      +
    • For example, if word1 = "abc" and merge = "dv", then after choosing this operation, word1 = "bc" and merge = "dva".
      • +
    +
    • +
  • If word2 is non-empty, append the first character in word2 to merge and delete it from word2. +
      +
    • For example, if word2 = "abc" and merge = "", then after choosing this operation, word2 = "bc" and merge = "a".
      • +
    +
    • +
+ +

Return the lexicographically largest merge you can construct.

+ +

A string a is lexicographically larger than a string b (of the same length) if in the first position where a and b differ, a has a character strictly larger than the corresponding character in b. For example, "abcd" is lexicographically larger than "abcc" because the first position they differ is at the fourth character, and d is greater than c.

+ +

 

+

Example 1:

+ +
+Input: word1 = "cabaa", word2 = "bcaaa"
+Output: "cbcabaaaaa"
+Explanation: One way to get the lexicographically largest merge is:
+- Take from word1: merge = "c", word1 = "abaa", word2 = "bcaaa"
+- Take from word2: merge = "cb", word1 = "abaa", word2 = "caaa"
+- Take from word2: merge = "cbc", word1 = "abaa", word2 = "aaa"
+- Take from word1: merge = "cbca", word1 = "baa", word2 = "aaa"
+- Take from word1: merge = "cbcab", word1 = "aa", word2 = "aaa"
+- Append the remaining 5 a's from word1 and word2 at the end of merge.
+
+ +

Example 2:

+ +
+Input: word1 = "abcabc", word2 = "abdcaba"
+Output: "abdcabcabcaba"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word1.length, word2.length <= 3000
    • +
  • word1 and word2 consist only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string largestMerge(string word1, string word2) { + + } +};","class Solution { + public String largestMerge(String word1, String word2) { + + } +}","class Solution(object): + def largestMerge(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: str + """""" + ","class Solution: + def largestMerge(self, word1: str, word2: str) -> str: + ","char * largestMerge(char * word1, char * word2){ + +}","public class Solution { + public string LargestMerge(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {string} + */ +var largestMerge = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {String} +def largest_merge(word1, word2) + +end","class Solution { + func largestMerge(_ word1: String, _ word2: String) -> String { + + } +}","func largestMerge(word1 string, word2 string) string { + +}","object Solution { + def largestMerge(word1: String, word2: String): String = { + + } +}","class Solution { + fun largestMerge(word1: String, word2: String): String { + + } +}","impl Solution { + pub fn largest_merge(word1: String, word2: String) -> String { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return String + */ + function largestMerge($word1, $word2) { + + } +}","function largestMerge(word1: string, word2: string): string { + +};","(define/contract (largest-merge word1 word2) + (-> string? string? string?) + + )","-spec largest_merge(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> unicode:unicode_binary(). +largest_merge(Word1, Word2) -> + .","defmodule Solution do + @spec largest_merge(word1 :: String.t, word2 :: String.t) :: String.t + def largest_merge(word1, word2) do + + end +end","class Solution { + String largestMerge(String word1, String word2) { + + } +}", +758,tree-of-coprimes,Tree of Coprimes,1766.0,1875.0,"

There is a tree (i.e., a connected, undirected graph that has no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges. Each node has a value associated with it, and the root of the tree is node 0.

+ +

To represent this tree, you are given an integer array nums and a 2D array edges. Each nums[i] represents the ith node's value, and each edges[j] = [uj, vj] represents an edge between nodes uj and vj in the tree.

+ +

Two values x and y are coprime if gcd(x, y) == 1 where gcd(x, y) is the greatest common divisor of x and y.

+ +

An ancestor of a node i is any other node on the shortest path from node i to the root. A node is not considered an ancestor of itself.

+ +

Return an array ans of size n, where ans[i] is the closest ancestor to node i such that nums[i] and nums[ans[i]] are coprime, or -1 if there is no such ancestor.

+ +

 

+

Example 1:

+ +

+ +
+Input: nums = [2,3,3,2], edges = [[0,1],[1,2],[1,3]]
+Output: [-1,0,0,1]
+Explanation: In the above figure, each node's value is in parentheses.
+- Node 0 has no coprime ancestors.
+- Node 1 has only one ancestor, node 0. Their values are coprime (gcd(2,3) == 1).
+- Node 2 has two ancestors, nodes 1 and 0. Node 1's value is not coprime (gcd(3,3) == 3), but node 0's
+  value is (gcd(2,3) == 1), so node 0 is the closest valid ancestor.
+- Node 3 has two ancestors, nodes 1 and 0. It is coprime with node 1 (gcd(3,2) == 1), so node 1 is its
+  closest valid ancestor.
+
+ +

Example 2:

+ +

+ +
+Input: nums = [5,6,10,2,3,6,15], edges = [[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]]
+Output: [-1,0,-1,0,0,0,-1]
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == n
    • +
  • 1 <= nums[i] <= 50
    • +
  • 1 <= n <= 105
    • +
  • edges.length == n - 1
    • +
  • edges[j].length == 2
    • +
  • 0 <= uj, vj < n
    • +
  • uj != vj
    • +
+",3.0,False,"class Solution { +public: + vector getCoprimes(vector& nums, vector>& edges) { + + } +};","class Solution { + public int[] getCoprimes(int[] nums, int[][] edges) { + + } +}","class Solution(object): + def getCoprimes(self, nums, edges): + """""" + :type nums: List[int] + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def getCoprimes(self, nums: List[int], edges: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getCoprimes(int* nums, int numsSize, int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public int[] GetCoprimes(int[] nums, int[][] edges) { + + } +}","/** + * @param {number[]} nums + * @param {number[][]} edges + * @return {number[]} + */ +var getCoprimes = function(nums, edges) { + +};","# @param {Integer[]} nums +# @param {Integer[][]} edges +# @return {Integer[]} +def get_coprimes(nums, edges) + +end","class Solution { + func getCoprimes(_ nums: [Int], _ edges: [[Int]]) -> [Int] { + + } +}","func getCoprimes(nums []int, edges [][]int) []int { + +}","object Solution { + def getCoprimes(nums: Array[Int], edges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun getCoprimes(nums: IntArray, edges: Array): IntArray { + + } +}","impl Solution { + pub fn get_coprimes(nums: Vec, edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[][] $edges + * @return Integer[] + */ + function getCoprimes($nums, $edges) { + + } +}","function getCoprimes(nums: number[], edges: number[][]): number[] { + +};","(define/contract (get-coprimes nums edges) + (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec get_coprimes(Nums :: [integer()], Edges :: [[integer()]]) -> [integer()]. +get_coprimes(Nums, Edges) -> + .","defmodule Solution do + @spec get_coprimes(nums :: [integer], edges :: [[integer]]) :: [integer] + def get_coprimes(nums, edges) do + + end +end","class Solution { + List getCoprimes(List nums, List> edges) { + + } +}", +761,can-you-eat-your-favorite-candy-on-your-favorite-day,Can You Eat Your Favorite Candy on Your Favorite Day?,1744.0,1872.0,"

You are given a (0-indexed) array of positive integers candiesCount where candiesCount[i] represents the number of candies of the ith type you have. You are also given a 2D array queries where queries[i] = [favoriteTypei, favoriteDayi, dailyCapi].

+ +

You play a game with the following rules:

+ +
    +
  • You start eating candies on day 0.
    • +
  • You cannot eat any candy of type i unless you have eaten all candies of type i - 1.
    • +
  • You must eat at least one candy per day until you have eaten all the candies.
    • +
+ +

Construct a boolean array answer such that answer.length == queries.length and answer[i] is true if you can eat a candy of type favoriteTypei on day favoriteDayi without eating more than dailyCapi candies on any day, and false otherwise. Note that you can eat different types of candy on the same day, provided that you follow rule 2.

+ +

Return the constructed array answer.

+ +

 

+

Example 1:

+ +
+Input: candiesCount = [7,4,5,3,8], queries = [[0,2,2],[4,2,4],[2,13,1000000000]]
+Output: [true,false,true]
+Explanation:
+1- If you eat 2 candies (type 0) on day 0 and 2 candies (type 0) on day 1, you will eat a candy of type 0 on day 2.
+2- You can eat at most 4 candies each day.
+   If you eat 4 candies every day, you will eat 4 candies (type 0) on day 0 and 4 candies (type 0 and type 1) on day 1.
+   On day 2, you can only eat 4 candies (type 1 and type 2), so you cannot eat a candy of type 4 on day 2.
+3- If you eat 1 candy each day, you will eat a candy of type 2 on day 13.
+
+ +

Example 2:

+ +
+Input: candiesCount = [5,2,6,4,1], queries = [[3,1,2],[4,10,3],[3,10,100],[4,100,30],[1,3,1]]
+Output: [false,true,true,false,false]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= candiesCount.length <= 105
    • +
  • 1 <= candiesCount[i] <= 105
    • +
  • 1 <= queries.length <= 105
    • +
  • queries[i].length == 3
    • +
  • 0 <= favoriteTypei < candiesCount.length
    • +
  • 0 <= favoriteDayi <= 109
    • +
  • 1 <= dailyCapi <= 109
    • +
+",2.0,False,"class Solution { +public: + vector canEat(vector& candiesCount, vector>& queries) { + + } +};","class Solution { + public boolean[] canEat(int[] candiesCount, int[][] queries) { + + } +}","class Solution(object): + def canEat(self, candiesCount, queries): + """""" + :type candiesCount: List[int] + :type queries: List[List[int]] + :rtype: List[bool] + """""" + ","class Solution: + def canEat(self, candiesCount: List[int], queries: List[List[int]]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* canEat(int* candiesCount, int candiesCountSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public bool[] CanEat(int[] candiesCount, int[][] queries) { + + } +}","/** + * @param {number[]} candiesCount + * @param {number[][]} queries + * @return {boolean[]} + */ +var canEat = function(candiesCount, queries) { + +};","# @param {Integer[]} candies_count +# @param {Integer[][]} queries +# @return {Boolean[]} +def can_eat(candies_count, queries) + +end","class Solution { + func canEat(_ candiesCount: [Int], _ queries: [[Int]]) -> [Bool] { + + } +}","func canEat(candiesCount []int, queries [][]int) []bool { + +}","object Solution { + def canEat(candiesCount: Array[Int], queries: Array[Array[Int]]): Array[Boolean] = { + + } +}","class Solution { + fun canEat(candiesCount: IntArray, queries: Array): BooleanArray { + + } +}","impl Solution { + pub fn can_eat(candies_count: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $candiesCount + * @param Integer[][] $queries + * @return Boolean[] + */ + function canEat($candiesCount, $queries) { + + } +}","function canEat(candiesCount: number[], queries: number[][]): boolean[] { + +};","(define/contract (can-eat candiesCount queries) + (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof boolean?)) + + )","-spec can_eat(CandiesCount :: [integer()], Queries :: [[integer()]]) -> [boolean()]. +can_eat(CandiesCount, Queries) -> + .","defmodule Solution do + @spec can_eat(candies_count :: [integer], queries :: [[integer]]) :: [boolean] + def can_eat(candies_count, queries) do + + end +end","class Solution { + List canEat(List candiesCount, List> queries) { + + } +}", +762,palindrome-partitioning-iv,Palindrome Partitioning IV,1745.0,1871.0,"

Given a string s, return true if it is possible to split the string s into three non-empty palindromic substrings. Otherwise, return false.​​​​​

+ +

A string is said to be palindrome if it the same string when reversed.

+ +

 

+

Example 1:

+ +
+Input: s = "abcbdd"
+Output: true
+Explanation: "abcbdd" = "a" + "bcb" + "dd", and all three substrings are palindromes.
+
+ +

Example 2:

+ +
+Input: s = "bcbddxy"
+Output: false
+Explanation: s cannot be split into 3 palindromes.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 2000
    • +
  • s​​​​​​ consists only of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + bool checkPartitioning(string s) { + + } +};","class Solution { + public boolean checkPartitioning(String s) { + + } +}","class Solution(object): + def checkPartitioning(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def checkPartitioning(self, s: str) -> bool: + ","bool checkPartitioning(char * s){ + +}","public class Solution { + public bool CheckPartitioning(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var checkPartitioning = function(s) { + +};","# @param {String} s +# @return {Boolean} +def check_partitioning(s) + +end","class Solution { + func checkPartitioning(_ s: String) -> Bool { + + } +}","func checkPartitioning(s string) bool { + +}","object Solution { + def checkPartitioning(s: String): Boolean = { + + } +}","class Solution { + fun checkPartitioning(s: String): Boolean { + + } +}","impl Solution { + pub fn check_partitioning(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function checkPartitioning($s) { + + } +}","function checkPartitioning(s: string): boolean { + +};","(define/contract (check-partitioning s) + (-> string? boolean?) + + )","-spec check_partitioning(S :: unicode:unicode_binary()) -> boolean(). +check_partitioning(S) -> + .","defmodule Solution do + @spec check_partitioning(s :: String.t) :: boolean + def check_partitioning(s) do + + end +end","class Solution { + bool checkPartitioning(String s) { + + } +}", +763,restore-the-array-from-adjacent-pairs,Restore the Array From Adjacent Pairs,1743.0,1866.0,"

There is an integer array nums that consists of n unique elements, but you have forgotten it. However, you do remember every pair of adjacent elements in nums.

+ +

You are given a 2D integer array adjacentPairs of size n - 1 where each adjacentPairs[i] = [ui, vi] indicates that the elements ui and vi are adjacent in nums.

+ +

It is guaranteed that every adjacent pair of elements nums[i] and nums[i+1] will exist in adjacentPairs, either as [nums[i], nums[i+1]] or [nums[i+1], nums[i]]. The pairs can appear in any order.

+ +

Return the original array nums. If there are multiple solutions, return any of them.

+ +

 

+

Example 1:

+ +
+Input: adjacentPairs = [[2,1],[3,4],[3,2]]
+Output: [1,2,3,4]
+Explanation: This array has all its adjacent pairs in adjacentPairs.
+Notice that adjacentPairs[i] may not be in left-to-right order.
+
+ +

Example 2:

+ +
+Input: adjacentPairs = [[4,-2],[1,4],[-3,1]]
+Output: [-2,4,1,-3]
+Explanation: There can be negative numbers.
+Another solution is [-3,1,4,-2], which would also be accepted.
+
+ +

Example 3:

+ +
+Input: adjacentPairs = [[100000,-100000]]
+Output: [100000,-100000]
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == n
    • +
  • adjacentPairs.length == n - 1
    • +
  • adjacentPairs[i].length == 2
    • +
  • 2 <= n <= 105
    • +
  • -105 <= nums[i], ui, vi <= 105
    • +
  • There exists some nums that has adjacentPairs as its pairs.
    • +
+",2.0,False,"class Solution { +public: + vector restoreArray(vector>& adjacentPairs) { + + } +};","class Solution { + public int[] restoreArray(int[][] adjacentPairs) { + + } +}","class Solution(object): + def restoreArray(self, adjacentPairs): + """""" + :type adjacentPairs: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def restoreArray(self, adjacentPairs: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* restoreArray(int** adjacentPairs, int adjacentPairsSize, int* adjacentPairsColSize, int* returnSize){ + +}","public class Solution { + public int[] RestoreArray(int[][] adjacentPairs) { + + } +}","/** + * @param {number[][]} adjacentPairs + * @return {number[]} + */ +var restoreArray = function(adjacentPairs) { + +};","# @param {Integer[][]} adjacent_pairs +# @return {Integer[]} +def restore_array(adjacent_pairs) + +end","class Solution { + func restoreArray(_ adjacentPairs: [[Int]]) -> [Int] { + + } +}","func restoreArray(adjacentPairs [][]int) []int { + +}","object Solution { + def restoreArray(adjacentPairs: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun restoreArray(adjacentPairs: Array): IntArray { + + } +}","impl Solution { + pub fn restore_array(adjacent_pairs: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $adjacentPairs + * @return Integer[] + */ + function restoreArray($adjacentPairs) { + + } +}","function restoreArray(adjacentPairs: number[][]): number[] { + +};","(define/contract (restore-array adjacentPairs) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec restore_array(AdjacentPairs :: [[integer()]]) -> [integer()]. +restore_array(AdjacentPairs) -> + .","defmodule Solution do + @spec restore_array(adjacent_pairs :: [[integer]]) :: [integer] + def restore_array(adjacent_pairs) do + + end +end","class Solution { + List restoreArray(List> adjacentPairs) { + + } +}", +764,building-boxes,Building Boxes,1739.0,1861.0,"

You have a cubic storeroom where the width, length, and height of the room are all equal to n units. You are asked to place n boxes in this room where each box is a cube of unit side length. There are however some rules to placing the boxes:

+ +
    +
  • You can place the boxes anywhere on the floor.
    • +
  • If box x is placed on top of the box y, then each side of the four vertical sides of the box y must either be adjacent to another box or to a wall.
    • +
+ +

Given an integer n, return the minimum possible number of boxes touching the floor.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 3
+Output: 3
+Explanation: The figure above is for the placement of the three boxes.
+These boxes are placed in the corner of the room, where the corner is on the left side.
+
+ +

Example 2:

+ +

+ +
+Input: n = 4
+Output: 3
+Explanation: The figure above is for the placement of the four boxes.
+These boxes are placed in the corner of the room, where the corner is on the left side.
+
+ +

Example 3:

+ +

+ +
+Input: n = 10
+Output: 6
+Explanation: The figure above is for the placement of the ten boxes.
+These boxes are placed in the corner of the room, where the corner is on the back side.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int minimumBoxes(int n) { + + } +};","class Solution { + public int minimumBoxes(int n) { + + } +}","class Solution(object): + def minimumBoxes(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def minimumBoxes(self, n: int) -> int: + ","int minimumBoxes(int n){ + +}","public class Solution { + public int MinimumBoxes(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var minimumBoxes = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def minimum_boxes(n) + +end","class Solution { + func minimumBoxes(_ n: Int) -> Int { + + } +}","func minimumBoxes(n int) int { + +}","object Solution { + def minimumBoxes(n: Int): Int = { + + } +}","class Solution { + fun minimumBoxes(n: Int): Int { + + } +}","impl Solution { + pub fn minimum_boxes(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function minimumBoxes($n) { + + } +}","function minimumBoxes(n: number): number { + +};","(define/contract (minimum-boxes n) + (-> exact-integer? exact-integer?) + + )","-spec minimum_boxes(N :: integer()) -> integer(). +minimum_boxes(N) -> + .","defmodule Solution do + @spec minimum_boxes(n :: integer) :: integer + def minimum_boxes(n) do + + end +end","class Solution { + int minimumBoxes(int n) { + + } +}", +765,find-kth-largest-xor-coordinate-value,Find Kth Largest XOR Coordinate Value,1738.0,1860.0,"

You are given a 2D matrix of size m x n, consisting of non-negative integers. You are also given an integer k.

+ +

The value of coordinate (a, b) of the matrix is the XOR of all matrix[i][j] where 0 <= i <= a < m and 0 <= j <= b < n (0-indexed).

+ +

Find the kth largest value (1-indexed) of all the coordinates of matrix.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[5,2],[1,6]], k = 1
+Output: 7
+Explanation: The value of coordinate (0,1) is 5 XOR 2 = 7, which is the largest value.
+
+ +

Example 2:

+ +
+Input: matrix = [[5,2],[1,6]], k = 2
+Output: 5
+Explanation: The value of coordinate (0,0) is 5 = 5, which is the 2nd largest value.
+
+ +

Example 3:

+ +
+Input: matrix = [[5,2],[1,6]], k = 3
+Output: 4
+Explanation: The value of coordinate (1,0) is 5 XOR 1 = 4, which is the 3rd largest value.
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 1000
    • +
  • 0 <= matrix[i][j] <= 106
    • +
  • 1 <= k <= m * n
    • +
+",2.0,False,"class Solution { +public: + int kthLargestValue(vector>& matrix, int k) { + + } +};","class Solution { + public int kthLargestValue(int[][] matrix, int k) { + + } +}","class Solution(object): + def kthLargestValue(self, matrix, k): + """""" + :type matrix: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def kthLargestValue(self, matrix: List[List[int]], k: int) -> int: + ","int kthLargestValue(int** matrix, int matrixSize, int* matrixColSize, int k){ + +}","public class Solution { + public int KthLargestValue(int[][] matrix, int k) { + + } +}","/** + * @param {number[][]} matrix + * @param {number} k + * @return {number} + */ +var kthLargestValue = function(matrix, k) { + +};","# @param {Integer[][]} matrix +# @param {Integer} k +# @return {Integer} +def kth_largest_value(matrix, k) + +end","class Solution { + func kthLargestValue(_ matrix: [[Int]], _ k: Int) -> Int { + + } +}","func kthLargestValue(matrix [][]int, k int) int { + +}","object Solution { + def kthLargestValue(matrix: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun kthLargestValue(matrix: Array, k: Int): Int { + + } +}","impl Solution { + pub fn kth_largest_value(matrix: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @param Integer $k + * @return Integer + */ + function kthLargestValue($matrix, $k) { + + } +}","function kthLargestValue(matrix: number[][], k: number): number { + +};","(define/contract (kth-largest-value matrix k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec kth_largest_value(Matrix :: [[integer()]], K :: integer()) -> integer(). +kth_largest_value(Matrix, K) -> + .","defmodule Solution do + @spec kth_largest_value(matrix :: [[integer]], k :: integer) :: integer + def kth_largest_value(matrix, k) do + + end +end","class Solution { + int kthLargestValue(List> matrix, int k) { + + } +}", +768,maximum-number-of-events-that-can-be-attended-ii,Maximum Number of Events That Can Be Attended II,1751.0,1851.0,"

You are given an array of events where events[i] = [startDayi, endDayi, valuei]. The ith event starts at startDayi and ends at endDayi, and if you attend this event, you will receive a value of valuei. You are also given an integer k which represents the maximum number of events you can attend.

+ +

You can only attend one event at a time. If you choose to attend an event, you must attend the entire event. Note that the end day is inclusive: that is, you cannot attend two events where one of them starts and the other ends on the same day.

+ +

Return the maximum sum of values that you can receive by attending events.

+ +

 

+

Example 1:

+ +

+ +
+Input: events = [[1,2,4],[3,4,3],[2,3,1]], k = 2
+Output: 7
+Explanation: Choose the green events, 0 and 1 (0-indexed) for a total value of 4 + 3 = 7.
+ +

Example 2:

+ +

+ +
+Input: events = [[1,2,4],[3,4,3],[2,3,10]], k = 2
+Output: 10
+Explanation: Choose event 2 for a total value of 10.
+Notice that you cannot attend any other event as they overlap, and that you do not have to attend k events.
+ +

Example 3:

+ +

+ +
+Input: events = [[1,1,1],[2,2,2],[3,3,3],[4,4,4]], k = 3
+Output: 9
+Explanation: Although the events do not overlap, you can only attend 3 events. Pick the highest valued three.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= events.length
    • +
  • 1 <= k * events.length <= 106
    • +
  • 1 <= startDayi <= endDayi <= 109
    • +
  • 1 <= valuei <= 106
    • +
+",3.0,False,"class Solution { +public: + int maxValue(vector>& events, int k) { + + } +};","class Solution { + public int maxValue(int[][] events, int k) { + + } +}","class Solution(object): + def maxValue(self, events, k): + """""" + :type events: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxValue(self, events: List[List[int]], k: int) -> int: + ","int maxValue(int** events, int eventsSize, int* eventsColSize, int k){ + +}","public class Solution { + public int MaxValue(int[][] events, int k) { + + } +}","/** + * @param {number[][]} events + * @param {number} k + * @return {number} + */ +var maxValue = function(events, k) { + +};","# @param {Integer[][]} events +# @param {Integer} k +# @return {Integer} +def max_value(events, k) + +end","class Solution { + func maxValue(_ events: [[Int]], _ k: Int) -> Int { + + } +}","func maxValue(events [][]int, k int) int { + +}","object Solution { + def maxValue(events: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun maxValue(events: Array, k: Int): Int { + + } +}","impl Solution { + pub fn max_value(events: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $events + * @param Integer $k + * @return Integer + */ + function maxValue($events, $k) { + + } +}","function maxValue(events: number[][], k: number): number { + +};","(define/contract (max-value events k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec max_value(Events :: [[integer()]], K :: integer()) -> integer(). +max_value(Events, K) -> + .","defmodule Solution do + @spec max_value(events :: [[integer]], k :: integer) :: integer + def max_value(events, k) do + + end +end","class Solution { + int maxValue(List> events, int k) { + + } +}", +771,sum-of-unique-elements,Sum of Unique Elements,1748.0,1848.0,"

You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in the array.

+ +

Return the sum of all the unique elements of nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,2]
+Output: 4
+Explanation: The unique elements are [1,3], and the sum is 4.
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1,1,1]
+Output: 0
+Explanation: There are no unique elements, and the sum is 0.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,5]
+Output: 15
+Explanation: The unique elements are [1,2,3,4,5], and the sum is 15.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= nums[i] <= 100
    • +
+",1.0,False,"class Solution { +public: + int sumOfUnique(vector& nums) { + + } +};","class Solution { + public int sumOfUnique(int[] nums) { + + } +}","class Solution(object): + def sumOfUnique(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumOfUnique(self, nums: List[int]) -> int: + ","int sumOfUnique(int* nums, int numsSize){ + +}","public class Solution { + public int SumOfUnique(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumOfUnique = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_of_unique(nums) + +end","class Solution { + func sumOfUnique(_ nums: [Int]) -> Int { + + } +}","func sumOfUnique(nums []int) int { + +}","object Solution { + def sumOfUnique(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumOfUnique(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_of_unique(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumOfUnique($nums) { + + } +}","function sumOfUnique(nums: number[]): number { + +};","(define/contract (sum-of-unique nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_of_unique(Nums :: [integer()]) -> integer(). +sum_of_unique(Nums) -> + .","defmodule Solution do + @spec sum_of_unique(nums :: [integer]) :: integer + def sum_of_unique(nums) do + + end +end","class Solution { + int sumOfUnique(List nums) { + + } +}", +777,count-ways-to-make-array-with-product,Count Ways to Make Array With Product,1735.0,1836.0,"

You are given a 2D integer array, queries. For each queries[i], where queries[i] = [ni, ki], find the number of different ways you can place positive integers into an array of size ni such that the product of the integers is ki. As the number of ways may be too large, the answer to the ith query is the number of ways modulo 109 + 7.

+ +

Return an integer array answer where answer.length == queries.length, and answer[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: queries = [[2,6],[5,1],[73,660]]
+Output: [4,1,50734910]
+Explanation: Each query is independent.
+[2,6]: There are 4 ways to fill an array of size 2 that multiply to 6: [1,6], [2,3], [3,2], [6,1].
+[5,1]: There is 1 way to fill an array of size 5 that multiply to 1: [1,1,1,1,1].
+[73,660]: There are 1050734917 ways to fill an array of size 73 that multiply to 660. 1050734917 modulo 109 + 7 = 50734910.
+
+ +

Example 2:

+ +
+Input: queries = [[1,1],[2,2],[3,3],[4,4],[5,5]]
+Output: [1,2,3,10,5]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= queries.length <= 104
    • +
  • 1 <= ni, ki <= 104
    • +
+",3.0,False,"class Solution { +public: + vector waysToFillArray(vector>& queries) { + + } +};","class Solution { + public int[] waysToFillArray(int[][] queries) { + + } +}","class Solution(object): + def waysToFillArray(self, queries): + """""" + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def waysToFillArray(self, queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* waysToFillArray(int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] WaysToFillArray(int[][] queries) { + + } +}","/** + * @param {number[][]} queries + * @return {number[]} + */ +var waysToFillArray = function(queries) { + +};","# @param {Integer[][]} queries +# @return {Integer[]} +def ways_to_fill_array(queries) + +end","class Solution { + func waysToFillArray(_ queries: [[Int]]) -> [Int] { + + } +}","func waysToFillArray(queries [][]int) []int { + +}","object Solution { + def waysToFillArray(queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun waysToFillArray(queries: Array): IntArray { + + } +}","impl Solution { + pub fn ways_to_fill_array(queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $queries + * @return Integer[] + */ + function waysToFillArray($queries) { + + } +}","function waysToFillArray(queries: number[][]): number[] { + +};","(define/contract (ways-to-fill-array queries) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec ways_to_fill_array(Queries :: [[integer()]]) -> [integer()]. +ways_to_fill_array(Queries) -> + .","defmodule Solution do + @spec ways_to_fill_array(queries :: [[integer]]) :: [integer] + def ways_to_fill_array(queries) do + + end +end","class Solution { + List waysToFillArray(List> queries) { + + } +}", +778,decode-xored-permutation,Decode XORed Permutation,1734.0,1835.0,"

There is an integer array perm that is a permutation of the first n positive integers, where n is always odd.

+ +

It was encoded into another integer array encoded of length n - 1, such that encoded[i] = perm[i] XOR perm[i + 1]. For example, if perm = [1,3,2], then encoded = [2,1].

+ +

Given the encoded array, return the original array perm. It is guaranteed that the answer exists and is unique.

+ +

 

+

Example 1:

+ +
+Input: encoded = [3,1]
+Output: [1,2,3]
+Explanation: If perm = [1,2,3], then encoded = [1 XOR 2,2 XOR 3] = [3,1]
+
+ +

Example 2:

+ +
+Input: encoded = [6,5,4,6]
+Output: [2,4,1,5,3]
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n < 105
    • +
  • n is odd.
    • +
  • encoded.length == n - 1
    • +
+",2.0,False,"class Solution { +public: + vector decode(vector& encoded) { + + } +};","class Solution { + public int[] decode(int[] encoded) { + + } +}","class Solution(object): + def decode(self, encoded): + """""" + :type encoded: List[int] + :rtype: List[int] + """""" + ","class Solution: + def decode(self, encoded: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* decode(int* encoded, int encodedSize, int* returnSize){ + +}","public class Solution { + public int[] Decode(int[] encoded) { + + } +}","/** + * @param {number[]} encoded + * @return {number[]} + */ +var decode = function(encoded) { + +};","# @param {Integer[]} encoded +# @return {Integer[]} +def decode(encoded) + +end","class Solution { + func decode(_ encoded: [Int]) -> [Int] { + + } +}","func decode(encoded []int) []int { + +}","object Solution { + def decode(encoded: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun decode(encoded: IntArray): IntArray { + + } +}","impl Solution { + pub fn decode(encoded: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $encoded + * @return Integer[] + */ + function decode($encoded) { + + } +}","function decode(encoded: number[]): number[] { + +};","(define/contract (decode encoded) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec decode(Encoded :: [integer()]) -> [integer()]. +decode(Encoded) -> + .","defmodule Solution do + @spec decode(encoded :: [integer]) :: [integer] + def decode(encoded) do + + end +end","class Solution { + List decode(List encoded) { + + } +}", +779,minimum-number-of-people-to-teach,Minimum Number of People to Teach,1733.0,1834.0,"

On a social network consisting of m users and some friendships between users, two users can communicate with each other if they know a common language.

+ +

You are given an integer n, an array languages, and an array friendships where:

+ +
    +
  • There are n languages numbered 1 through n,
    • +
  • languages[i] is the set of languages the i​​​​​​th​​​​ user knows, and
    • +
  • friendships[i] = [u​​​​​​i​​​, v​​​​​​i] denotes a friendship between the users u​​​​​​​​​​​i​​​​​ and vi.
    • +
+ +

You can choose one language and teach it to some users so that all friends can communicate with each other. Return the minimum number of users you need to teach.

+Note that friendships are not transitive, meaning if x is a friend of y and y is a friend of z, this doesn't guarantee that x is a friend of z. +

 

+

Example 1:

+ +
+Input: n = 2, languages = [[1],[2],[1,2]], friendships = [[1,2],[1,3],[2,3]]
+Output: 1
+Explanation: You can either teach user 1 the second language or user 2 the first language.
+
+ +

Example 2:

+ +
+Input: n = 3, languages = [[2],[1,3],[1,2],[3]], friendships = [[1,4],[1,2],[3,4],[2,3]]
+Output: 2
+Explanation: Teach the third language to users 1 and 3, yielding two users to teach.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 500
    • +
  • languages.length == m
    • +
  • 1 <= m <= 500
    • +
  • 1 <= languages[i].length <= n
    • +
  • 1 <= languages[i][j] <= n
    • +
  • 1 <= u​​​​​​i < v​​​​​​i <= languages.length
    • +
  • 1 <= friendships.length <= 500
    • +
  • All tuples (u​​​​​i, v​​​​​​i) are unique
    • +
  • languages[i] contains only unique values
    • +
+",2.0,False,"class Solution { +public: + int minimumTeachings(int n, vector>& languages, vector>& friendships) { + + } +};","class Solution { + public int minimumTeachings(int n, int[][] languages, int[][] friendships) { + + } +}","class Solution(object): + def minimumTeachings(self, n, languages, friendships): + """""" + :type n: int + :type languages: List[List[int]] + :type friendships: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumTeachings(self, n: int, languages: List[List[int]], friendships: List[List[int]]) -> int: + ","int minimumTeachings(int n, int** languages, int languagesSize, int* languagesColSize, int** friendships, int friendshipsSize, int* friendshipsColSize){ + +}","public class Solution { + public int MinimumTeachings(int n, int[][] languages, int[][] friendships) { + + } +}","/** + * @param {number} n + * @param {number[][]} languages + * @param {number[][]} friendships + * @return {number} + */ +var minimumTeachings = function(n, languages, friendships) { + +};","# @param {Integer} n +# @param {Integer[][]} languages +# @param {Integer[][]} friendships +# @return {Integer} +def minimum_teachings(n, languages, friendships) + +end","class Solution { + func minimumTeachings(_ n: Int, _ languages: [[Int]], _ friendships: [[Int]]) -> Int { + + } +}","func minimumTeachings(n int, languages [][]int, friendships [][]int) int { + +}","object Solution { + def minimumTeachings(n: Int, languages: Array[Array[Int]], friendships: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumTeachings(n: Int, languages: Array, friendships: Array): Int { + + } +}","impl Solution { + pub fn minimum_teachings(n: i32, languages: Vec>, friendships: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $languages + * @param Integer[][] $friendships + * @return Integer + */ + function minimumTeachings($n, $languages, $friendships) { + + } +}","function minimumTeachings(n: number, languages: number[][], friendships: number[][]): number { + +};","(define/contract (minimum-teachings n languages friendships) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_teachings(N :: integer(), Languages :: [[integer()]], Friendships :: [[integer()]]) -> integer(). +minimum_teachings(N, Languages, Friendships) -> + .","defmodule Solution do + @spec minimum_teachings(n :: integer, languages :: [[integer]], friendships :: [[integer]]) :: integer + def minimum_teachings(n, languages, friendships) do + + end +end","class Solution { + int minimumTeachings(int n, List> languages, List> friendships) { + + } +}", +781,minimum-operations-to-make-a-subsequence,Minimum Operations to Make a Subsequence,1713.0,1832.0,"

You are given an array target that consists of distinct integers and another integer array arr that can have duplicates.

+ +

In one operation, you can insert any integer at any position in arr. For example, if arr = [1,4,1,2], you can add 3 in the middle and make it [1,4,3,1,2]. Note that you can insert the integer at the very beginning or end of the array.

+ +

Return the minimum number of operations needed to make target a subsequence of arr.

+ +

A subsequence of an array is a new array generated from the original array by deleting some elements (possibly none) without changing the remaining elements' relative order. For example, [2,7,4] is a subsequence of [4,2,3,7,2,1,4] (the underlined elements), while [2,4,2] is not.

+ +

 

+

Example 1:

+ +
+Input: target = [5,1,3], arr = [9,4,2,3,4]
+Output: 2
+Explanation: You can add 5 and 1 in such a way that makes arr = [5,9,4,1,2,3,4], then target will be a subsequence of arr.
+
+ +

Example 2:

+ +
+Input: target = [6,4,8,1,3,2], arr = [4,7,6,2,3,8,6,1]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target.length, arr.length <= 105
    • +
  • 1 <= target[i], arr[i] <= 109
    • +
  • target contains no duplicates.
    • +
+",3.0,False,"class Solution { +public: + int minOperations(vector& target, vector& arr) { + + } +};","class Solution { + public int minOperations(int[] target, int[] arr) { + + } +}","class Solution(object): + def minOperations(self, target, arr): + """""" + :type target: List[int] + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def minOperations(self, target: List[int], arr: List[int]) -> int: + ","int minOperations(int* target, int targetSize, int* arr, int arrSize){ + +}","public class Solution { + public int MinOperations(int[] target, int[] arr) { + + } +}","/** + * @param {number[]} target + * @param {number[]} arr + * @return {number} + */ +var minOperations = function(target, arr) { + +};","# @param {Integer[]} target +# @param {Integer[]} arr +# @return {Integer} +def min_operations(target, arr) + +end","class Solution { + func minOperations(_ target: [Int], _ arr: [Int]) -> Int { + + } +}","func minOperations(target []int, arr []int) int { + +}","object Solution { + def minOperations(target: Array[Int], arr: Array[Int]): Int = { + + } +}","class Solution { + fun minOperations(target: IntArray, arr: IntArray): Int { + + } +}","impl Solution { + pub fn min_operations(target: Vec, arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $target + * @param Integer[] $arr + * @return Integer + */ + function minOperations($target, $arr) { + + } +}","function minOperations(target: number[], arr: number[]): number { + +};","(define/contract (min-operations target arr) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_operations(Target :: [integer()], Arr :: [integer()]) -> integer(). +min_operations(Target, Arr) -> + .","defmodule Solution do + @spec min_operations(target :: [integer], arr :: [integer]) :: integer + def min_operations(target, arr) do + + end +end","class Solution { + int minOperations(List target, List arr) { + + } +}", +785,maximum-xor-with-an-element-from-array,Maximum XOR With an Element From Array,1707.0,1826.0,"

You are given an array nums consisting of non-negative integers. You are also given a queries array, where queries[i] = [xi, mi].

+ +

The answer to the ith query is the maximum bitwise XOR value of xi and any element of nums that does not exceed mi. In other words, the answer is max(nums[j] XOR xi) for all j such that nums[j] <= mi. If all elements in nums are larger than mi, then the answer is -1.

+ +

Return an integer array answer where answer.length == queries.length and answer[i] is the answer to the ith query.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
+Output: [3,3,7]
+Explanation:
+1) 0 and 1 are the only two integers not greater than 1. 0 XOR 3 = 3 and 1 XOR 3 = 2. The larger of the two is 3.
+2) 1 XOR 2 = 3.
+3) 5 XOR 2 = 7.
+
+ +

Example 2:

+ +
+Input: nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
+Output: [15,-1,5]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length, queries.length <= 105
    • +
  • queries[i].length == 2
    • +
  • 0 <= nums[j], xi, mi <= 109
    • +
+",3.0,False,"class Solution { +public: + vector maximizeXor(vector& nums, vector>& queries) { + + } +};","class Solution { + public int[] maximizeXor(int[] nums, int[][] queries) { + + } +}","class Solution(object): + def maximizeXor(self, nums, queries): + """""" + :type nums: List[int] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def maximizeXor(self, nums: List[int], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maximizeXor(int* nums, int numsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] MaximizeXor(int[] nums, int[][] queries) { + + } +}","/** + * @param {number[]} nums + * @param {number[][]} queries + * @return {number[]} + */ +var maximizeXor = function(nums, queries) { + +};","# @param {Integer[]} nums +# @param {Integer[][]} queries +# @return {Integer[]} +def maximize_xor(nums, queries) + +end","class Solution { + func maximizeXor(_ nums: [Int], _ queries: [[Int]]) -> [Int] { + + } +}","func maximizeXor(nums []int, queries [][]int) []int { + +}","object Solution { + def maximizeXor(nums: Array[Int], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun maximizeXor(nums: IntArray, queries: Array): IntArray { + + } +}","impl Solution { + pub fn maximize_xor(nums: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[][] $queries + * @return Integer[] + */ + function maximizeXor($nums, $queries) { + + } +}","function maximizeXor(nums: number[], queries: number[][]): number[] { + +};","(define/contract (maximize-xor nums queries) + (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec maximize_xor(Nums :: [integer()], Queries :: [[integer()]]) -> [integer()]. +maximize_xor(Nums, Queries) -> + .","defmodule Solution do + @spec maximize_xor(nums :: [integer], queries :: [[integer]]) :: [integer] + def maximize_xor(nums, queries) do + + end +end","class Solution { + List maximizeXor(List nums, List> queries) { + + } +}", +786,find-minimum-time-to-finish-all-jobs,Find Minimum Time to Finish All Jobs,1723.0,1825.0,"

You are given an integer array jobs, where jobs[i] is the amount of time it takes to complete the ith job.

+ +

There are k workers that you can assign jobs to. Each job should be assigned to exactly one worker. The working time of a worker is the sum of the time it takes to complete all jobs assigned to them. Your goal is to devise an optimal assignment such that the maximum working time of any worker is minimized.

+ +

Return the minimum possible maximum working time of any assignment.

+ +

 

+

Example 1:

+ +
+Input: jobs = [3,2,3], k = 3
+Output: 3
+Explanation: By assigning each person one job, the maximum time is 3.
+
+ +

Example 2:

+ +
+Input: jobs = [1,2,4,7,8], k = 2
+Output: 11
+Explanation: Assign the jobs the following way:
+Worker 1: 1, 2, 8 (working time = 1 + 2 + 8 = 11)
+Worker 2: 4, 7 (working time = 4 + 7 = 11)
+The maximum working time is 11.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= jobs.length <= 12
    • +
  • 1 <= jobs[i] <= 107
    • +
+",3.0,False,"class Solution { +public: + int minimumTimeRequired(vector& jobs, int k) { + + } +};","class Solution { + public int minimumTimeRequired(int[] jobs, int k) { + + } +}","class Solution(object): + def minimumTimeRequired(self, jobs, k): + """""" + :type jobs: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minimumTimeRequired(self, jobs: List[int], k: int) -> int: + ","int minimumTimeRequired(int* jobs, int jobsSize, int k){ + +}","public class Solution { + public int MinimumTimeRequired(int[] jobs, int k) { + + } +}","/** + * @param {number[]} jobs + * @param {number} k + * @return {number} + */ +var minimumTimeRequired = function(jobs, k) { + +};","# @param {Integer[]} jobs +# @param {Integer} k +# @return {Integer} +def minimum_time_required(jobs, k) + +end","class Solution { + func minimumTimeRequired(_ jobs: [Int], _ k: Int) -> Int { + + } +}","func minimumTimeRequired(jobs []int, k int) int { + +}","object Solution { + def minimumTimeRequired(jobs: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minimumTimeRequired(jobs: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn minimum_time_required(jobs: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $jobs + * @param Integer $k + * @return Integer + */ + function minimumTimeRequired($jobs, $k) { + + } +}","function minimumTimeRequired(jobs: number[], k: number): number { + +};","(define/contract (minimum-time-required jobs k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec minimum_time_required(Jobs :: [integer()], K :: integer()) -> integer(). +minimum_time_required(Jobs, K) -> + .","defmodule Solution do + @spec minimum_time_required(jobs :: [integer], k :: integer) :: integer + def minimum_time_required(jobs, k) do + + end +end","class Solution { + int minimumTimeRequired(List jobs, int k) { + + } +}", +789,number-of-ways-to-reconstruct-a-tree,Number Of Ways To Reconstruct A Tree,1719.0,1820.0,"

You are given an array pairs, where pairs[i] = [xi, yi], and:

+ +
    +
  • There are no duplicates.
    • +
  • xi < yi
    • +
+ +

Let ways be the number of rooted trees that satisfy the following conditions:

+ +
    +
  • The tree consists of nodes whose values appeared in pairs.
    • +
  • A pair [xi, yi] exists in pairs if and only if xi is an ancestor of yi or yi is an ancestor of xi.
    • +
  • Note: the tree does not have to be a binary tree.
    • +
+ +

Two ways are considered to be different if there is at least one node that has different parents in both ways.

+ +

Return:

+ +
    +
  • 0 if ways == 0
    • +
  • 1 if ways == 1
    • +
  • 2 if ways > 1
    • +
+ +

A rooted tree is a tree that has a single root node, and all edges are oriented to be outgoing from the root.

+ +

An ancestor of a node is any node on the path from the root to that node (excluding the node itself). The root has no ancestors.

+ +

 

+

Example 1:

+ +
+Input: pairs = [[1,2],[2,3]]
+Output: 1
+Explanation: There is exactly one valid rooted tree, which is shown in the above figure.
+
+ +

Example 2:

+ +
+Input: pairs = [[1,2],[2,3],[1,3]]
+Output: 2
+Explanation: There are multiple valid rooted trees. Three of them are shown in the above figures.
+
+ +

Example 3:

+ +
+Input: pairs = [[1,2],[2,3],[2,4],[1,5]]
+Output: 0
+Explanation: There are no valid rooted trees.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pairs.length <= 105
    • +
  • 1 <= xi < yi <= 500
    • +
  • The elements in pairs are unique.
    • +
+",3.0,False,"class Solution { +public: + int checkWays(vector>& pairs) { + + } +};","class Solution { + public int checkWays(int[][] pairs) { + + } +}","class Solution(object): + def checkWays(self, pairs): + """""" + :type pairs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def checkWays(self, pairs: List[List[int]]) -> int: + ","int checkWays(int** pairs, int pairsSize, int* pairsColSize){ + +}","public class Solution { + public int CheckWays(int[][] pairs) { + + } +}","/** + * @param {number[][]} pairs + * @return {number} + */ +var checkWays = function(pairs) { + +};","# @param {Integer[][]} pairs +# @return {Integer} +def check_ways(pairs) + +end","class Solution { + func checkWays(_ pairs: [[Int]]) -> Int { + + } +}","func checkWays(pairs [][]int) int { + +}","object Solution { + def checkWays(pairs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun checkWays(pairs: Array): Int { + + } +}","impl Solution { + pub fn check_ways(pairs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $pairs + * @return Integer + */ + function checkWays($pairs) { + + } +}","function checkWays(pairs: number[][]): number { + +};","(define/contract (check-ways pairs) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec check_ways(Pairs :: [[integer()]]) -> integer(). +check_ways(Pairs) -> + .","defmodule Solution do + @spec check_ways(pairs :: [[integer]]) :: integer + def check_ways(pairs) do + + end +end","class Solution { + int checkWays(List> pairs) { + + } +}", +790,construct-the-lexicographically-largest-valid-sequence,Construct the Lexicographically Largest Valid Sequence,1718.0,1819.0,"

Given an integer n, find a sequence that satisfies all of the following:

+ +
    +
  • The integer 1 occurs once in the sequence.
    • +
  • Each integer between 2 and n occurs twice in the sequence.
    • +
  • For every integer i between 2 and n, the distance between the two occurrences of i is exactly i.
    • +
+ +

The distance between two numbers on the sequence, a[i] and a[j], is the absolute difference of their indices, |j - i|.

+ +

Return the lexicographically largest sequence. It is guaranteed that under the given constraints, there is always a solution.

+ +

A sequence a is lexicographically larger than a sequence b (of the same length) if in the first position where a and b differ, sequence a has a number greater than the corresponding number in b. For example, [0,1,9,0] is lexicographically larger than [0,1,5,6] because the first position they differ is at the third number, and 9 is greater than 5.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: [3,1,2,3,2]
+Explanation: [2,3,2,1,3] is also a valid sequence, but [3,1,2,3,2] is the lexicographically largest valid sequence.
+
+ +

Example 2:

+ +
+Input: n = 5
+Output: [5,3,1,4,3,5,2,4,2]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 20
    • +
+",2.0,False,"class Solution { +public: + vector constructDistancedSequence(int n) { + + } +};","class Solution { + public int[] constructDistancedSequence(int n) { + + } +}","class Solution(object): + def constructDistancedSequence(self, n): + """""" + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def constructDistancedSequence(self, n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* constructDistancedSequence(int n, int* returnSize){ + +}","public class Solution { + public int[] ConstructDistancedSequence(int n) { + + } +}","/** + * @param {number} n + * @return {number[]} + */ +var constructDistancedSequence = function(n) { + +};","# @param {Integer} n +# @return {Integer[]} +def construct_distanced_sequence(n) + +end","class Solution { + func constructDistancedSequence(_ n: Int) -> [Int] { + + } +}","func constructDistancedSequence(n int) []int { + +}","object Solution { + def constructDistancedSequence(n: Int): Array[Int] = { + + } +}","class Solution { + fun constructDistancedSequence(n: Int): IntArray { + + } +}","impl Solution { + pub fn construct_distanced_sequence(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer[] + */ + function constructDistancedSequence($n) { + + } +}","function constructDistancedSequence(n: number): number[] { + +};","(define/contract (construct-distanced-sequence n) + (-> exact-integer? (listof exact-integer?)) + + )","-spec construct_distanced_sequence(N :: integer()) -> [integer()]. +construct_distanced_sequence(N) -> + .","defmodule Solution do + @spec construct_distanced_sequence(n :: integer) :: [integer] + def construct_distanced_sequence(n) do + + end +end","class Solution { + List constructDistancedSequence(int n) { + + } +}", +793,checking-existence-of-edge-length-limited-paths,Checking Existence of Edge Length Limited Paths,1697.0,1815.0,"

An undirected graph of n nodes is defined by edgeList, where edgeList[i] = [ui, vi, disi] denotes an edge between nodes ui and vi with distance disi. Note that there may be multiple edges between two nodes.

+ +

Given an array queries, where queries[j] = [pj, qj, limitj], your task is to determine for each queries[j] whether there is a path between pj and qj such that each edge on the path has a distance strictly less than limitj .

+ +

Return a boolean array answer, where answer.length == queries.length and the jth value of answer is true if there is a path for queries[j] is true, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: n = 3, edgeList = [[0,1,2],[1,2,4],[2,0,8],[1,0,16]], queries = [[0,1,2],[0,2,5]]
+Output: [false,true]
+Explanation: The above figure shows the given graph. Note that there are two overlapping edges between 0 and 1 with distances 2 and 16.
+For the first query, between 0 and 1 there is no path where each distance is less than 2, thus we return false for this query.
+For the second query, there is a path (0 -> 1 -> 2) of two edges with distances less than 5, thus we return true for this query.
+
+ +

Example 2:

+ +
+Input: n = 5, edgeList = [[0,1,10],[1,2,5],[2,3,9],[3,4,13]], queries = [[0,4,14],[1,4,13]]
+Output: [true,false]
+Explanation: The above figure shows the given graph.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 105
    • +
  • 1 <= edgeList.length, queries.length <= 105
    • +
  • edgeList[i].length == 3
    • +
  • queries[j].length == 3
    • +
  • 0 <= ui, vi, pj, qj <= n - 1
    • +
  • ui != vi
    • +
  • pj != qj
    • +
  • 1 <= disi, limitj <= 109
    • +
  • There may be multiple edges between two nodes.
    • +
+",3.0,False,"class Solution { +public: + vector distanceLimitedPathsExist(int n, vector>& edgeList, vector>& queries) { + + } +};","class Solution { + public boolean[] distanceLimitedPathsExist(int n, int[][] edgeList, int[][] queries) { + + } +}","class Solution(object): + def distanceLimitedPathsExist(self, n, edgeList, queries): + """""" + :type n: int + :type edgeList: List[List[int]] + :type queries: List[List[int]] + :rtype: List[bool] + """""" + ","class Solution: + def distanceLimitedPathsExist(self, n: int, edgeList: List[List[int]], queries: List[List[int]]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* distanceLimitedPathsExist(int n, int** edgeList, int edgeListSize, int* edgeListColSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public bool[] DistanceLimitedPathsExist(int n, int[][] edgeList, int[][] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} edgeList + * @param {number[][]} queries + * @return {boolean[]} + */ +var distanceLimitedPathsExist = function(n, edgeList, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} edge_list +# @param {Integer[][]} queries +# @return {Boolean[]} +def distance_limited_paths_exist(n, edge_list, queries) + +end","class Solution { + func distanceLimitedPathsExist(_ n: Int, _ edgeList: [[Int]], _ queries: [[Int]]) -> [Bool] { + + } +}","func distanceLimitedPathsExist(n int, edgeList [][]int, queries [][]int) []bool { + +}","object Solution { + def distanceLimitedPathsExist(n: Int, edgeList: Array[Array[Int]], queries: Array[Array[Int]]): Array[Boolean] = { + + } +}","class Solution { + fun distanceLimitedPathsExist(n: Int, edgeList: Array, queries: Array): BooleanArray { + + } +}","impl Solution { + pub fn distance_limited_paths_exist(n: i32, edge_list: Vec>, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edgeList + * @param Integer[][] $queries + * @return Boolean[] + */ + function distanceLimitedPathsExist($n, $edgeList, $queries) { + + } +}","function distanceLimitedPathsExist(n: number, edgeList: number[][], queries: number[][]): boolean[] { + +};","(define/contract (distance-limited-paths-exist n edgeList queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof boolean?)) + + )","-spec distance_limited_paths_exist(N :: integer(), EdgeList :: [[integer()]], Queries :: [[integer()]]) -> [boolean()]. +distance_limited_paths_exist(N, EdgeList, Queries) -> + .","defmodule Solution do + @spec distance_limited_paths_exist(n :: integer, edge_list :: [[integer]], queries :: [[integer]]) :: [boolean] + def distance_limited_paths_exist(n, edge_list, queries) do + + end +end","class Solution { + List distanceLimitedPathsExist(int n, List> edgeList, List> queries) { + + } +}", +795,maximum-erasure-value,Maximum Erasure Value,1695.0,1813.0,"

You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.

+ +

Return the maximum score you can get by erasing exactly one subarray.

+ +

An array b is called to be a subarray of a if it forms a contiguous subsequence of a, that is, if it is equal to a[l],a[l+1],...,a[r] for some (l,r).

+ +

 

+

Example 1:

+ +
+Input: nums = [4,2,4,5,6]
+Output: 17
+Explanation: The optimal subarray here is [2,4,5,6].
+
+ +

Example 2:

+ +
+Input: nums = [5,2,1,2,5,2,1,2,5]
+Output: 8
+Explanation: The optimal subarray here is [5,2,1] or [1,2,5].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int maximumUniqueSubarray(vector& nums) { + + } +};","class Solution { + public int maximumUniqueSubarray(int[] nums) { + + } +}","class Solution(object): + def maximumUniqueSubarray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maximumUniqueSubarray(self, nums: List[int]) -> int: + ","int maximumUniqueSubarray(int* nums, int numsSize){ + +}","public class Solution { + public int MaximumUniqueSubarray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maximumUniqueSubarray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def maximum_unique_subarray(nums) + +end","class Solution { + func maximumUniqueSubarray(_ nums: [Int]) -> Int { + + } +}","func maximumUniqueSubarray(nums []int) int { + +}","object Solution { + def maximumUniqueSubarray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maximumUniqueSubarray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_unique_subarray(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maximumUniqueSubarray($nums) { + + } +}","function maximumUniqueSubarray(nums: number[]): number { + +};","(define/contract (maximum-unique-subarray nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_unique_subarray(Nums :: [integer()]) -> integer(). +maximum_unique_subarray(Nums) -> + .","defmodule Solution do + @spec maximum_unique_subarray(nums :: [integer]) :: integer + def maximum_unique_subarray(nums) do + + end +end","class Solution { + int maximumUniqueSubarray(List nums) { + + } +}", +800,minimum-adjacent-swaps-for-k-consecutive-ones,Minimum Adjacent Swaps for K Consecutive Ones,1703.0,1805.0,"

You are given an integer array, nums, and an integer k. nums comprises of only 0's and 1's. In one move, you can choose two adjacent indices and swap their values.

+ +

Return the minimum number of moves required so that nums has k consecutive 1's.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,0,0,1,0,1], k = 2
+Output: 1
+Explanation: In 1 move, nums could be [1,0,0,0,1,1] and have 2 consecutive 1's.
+
+ +

Example 2:

+ +
+Input: nums = [1,0,0,0,0,0,1,1], k = 3
+Output: 5
+Explanation: In 5 moves, the leftmost 1 can be shifted right until nums = [0,0,0,0,0,1,1,1].
+
+ +

Example 3:

+ +
+Input: nums = [1,1,0,1], k = 2
+Output: 0
+Explanation: nums already has 2 consecutive 1's.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • nums[i] is 0 or 1.
    • +
  • 1 <= k <= sum(nums)
    • +
+",3.0,False,"class Solution { +public: + int minMoves(vector& nums, int k) { + + } +};","class Solution { + public int minMoves(int[] nums, int k) { + + } +}","class Solution(object): + def minMoves(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minMoves(self, nums: List[int], k: int) -> int: + ","int minMoves(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinMoves(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minMoves = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_moves(nums, k) + +end","class Solution { + func minMoves(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minMoves(nums []int, k int) int { + +}","object Solution { + def minMoves(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minMoves(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_moves(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minMoves($nums, $k) { + + } +}","function minMoves(nums: number[], k: number): number { + +};","(define/contract (min-moves nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_moves(Nums :: [integer()], K :: integer()) -> integer(). +min_moves(Nums, K) -> + .","defmodule Solution do + @spec min_moves(nums :: [integer], k :: integer) :: integer + def min_moves(nums, k) do + + end +end","class Solution { + int minMoves(List nums, int k) { + + } +}", +801,maximum-binary-string-after-change,Maximum Binary String After Change,1702.0,1804.0,"

You are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of times:

+ +
    +
  • Operation 1: If the number contains the substring "00", you can replace it with "10". + +
      +
    • For example, "00010" -> "10010"
      • +
    +
    • +
  • Operation 2: If the number contains the substring "10", you can replace it with "01". +
      +
    • For example, "00010" -> "00001"
      • +
    +
    • +
+ +

Return the maximum binary string you can obtain after any number of operations. Binary string x is greater than binary string y if x's decimal representation is greater than y's decimal representation.

+ +

 

+

Example 1:

+ +
+Input: binary = "000110"
+Output: "111011"
+Explanation: A valid transformation sequence can be:
+"000110" -> "000101" 
+"000101" -> "100101" 
+"100101" -> "110101" 
+"110101" -> "110011" 
+"110011" -> "111011"
+
+ +

Example 2:

+ +
+Input: binary = "01"
+Output: "01"
+Explanation: "01" cannot be transformed any further.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= binary.length <= 105
    • +
  • binary consist of '0' and '1'.
    • +
+",2.0,False,"class Solution { +public: + string maximumBinaryString(string binary) { + + } +};","class Solution { + public String maximumBinaryString(String binary) { + + } +}","class Solution(object): + def maximumBinaryString(self, binary): + """""" + :type binary: str + :rtype: str + """""" + ","class Solution: + def maximumBinaryString(self, binary: str) -> str: + ","char * maximumBinaryString(char * binary){ + +}","public class Solution { + public string MaximumBinaryString(string binary) { + + } +}","/** + * @param {string} binary + * @return {string} + */ +var maximumBinaryString = function(binary) { + +};","# @param {String} binary +# @return {String} +def maximum_binary_string(binary) + +end","class Solution { + func maximumBinaryString(_ binary: String) -> String { + + } +}","func maximumBinaryString(binary string) string { + +}","object Solution { + def maximumBinaryString(binary: String): String = { + + } +}","class Solution { + fun maximumBinaryString(binary: String): String { + + } +}","impl Solution { + pub fn maximum_binary_string(binary: String) -> String { + + } +}","class Solution { + + /** + * @param String $binary + * @return String + */ + function maximumBinaryString($binary) { + + } +}","function maximumBinaryString(binary: string): string { + +};","(define/contract (maximum-binary-string binary) + (-> string? string?) + + )","-spec maximum_binary_string(Binary :: unicode:unicode_binary()) -> unicode:unicode_binary(). +maximum_binary_string(Binary) -> + .","defmodule Solution do + @spec maximum_binary_string(binary :: String.t) :: String.t + def maximum_binary_string(binary) do + + end +end","class Solution { + String maximumBinaryString(String binary) { + + } +}", +804,concatenation-of-consecutive-binary-numbers,Concatenation of Consecutive Binary Numbers,1680.0,1800.0,"

Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of 1 to n in order, modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 1
+Explanation: "1" in binary corresponds to the decimal value 1. 
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: 27
+Explanation: In binary, 1, 2, and 3 corresponds to "1", "10", and "11".
+After concatenating them, we have "11011", which corresponds to the decimal value 27.
+
+ +

Example 3:

+ +
+Input: n = 12
+Output: 505379714
+Explanation: The concatenation results in "1101110010111011110001001101010111100".
+The decimal value of that is 118505380540.
+After modulo 109 + 7, the result is 505379714.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
+",2.0,False,"class Solution { +public: + int concatenatedBinary(int n) { + + } +};","class Solution { + public int concatenatedBinary(int n) { + + } +}","class Solution(object): + def concatenatedBinary(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def concatenatedBinary(self, n: int) -> int: + "," + +int concatenatedBinary(int n){ + +}","public class Solution { + public int ConcatenatedBinary(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var concatenatedBinary = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def concatenated_binary(n) + +end","class Solution { + func concatenatedBinary(_ n: Int) -> Int { + + } +}","func concatenatedBinary(n int) int { + +}","object Solution { + def concatenatedBinary(n: Int): Int = { + + } +}","class Solution { + fun concatenatedBinary(n: Int): Int { + + } +}","impl Solution { + pub fn concatenated_binary(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function concatenatedBinary($n) { + + } +}","function concatenatedBinary(n: number): number { + +};",,,,, +805,minimum-incompatibility,Minimum Incompatibility,1681.0,1799.0,"

You are given an integer array nums​​​ and an integer k. You are asked to distribute this array into k subsets of equal size such that there are no two equal elements in the same subset.

+ +

A subset's incompatibility is the difference between the maximum and minimum elements in that array.

+ +

Return the minimum possible sum of incompatibilities of the k subsets after distributing the array optimally, or return -1 if it is not possible.

+ +

A subset is a group integers that appear in the array with no particular order.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,4], k = 2
+Output: 4
+Explanation: The optimal distribution of subsets is [1,2] and [1,4].
+The incompatibility is (2-1) + (4-1) = 4.
+Note that [1,1] and [2,4] would result in a smaller sum, but the first subset contains 2 equal elements.
+ +

Example 2:

+ +
+Input: nums = [6,3,8,1,3,1,2,2], k = 4
+Output: 6
+Explanation: The optimal distribution of subsets is [1,2], [2,3], [6,8], and [1,3].
+The incompatibility is (2-1) + (3-2) + (8-6) + (3-1) = 6.
+
+ +

Example 3:

+ +
+Input: nums = [5,3,3,6,3,3], k = 3
+Output: -1
+Explanation: It is impossible to distribute nums into 3 subsets where no two elements are equal in the same subset.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 16
    • +
  • nums.length is divisible by k
    • +
  • 1 <= nums[i] <= nums.length
    • +
+",3.0,False,"class Solution { +public: + int minimumIncompatibility(vector& nums, int k) { + + } +};","class Solution { + public int minimumIncompatibility(int[] nums, int k) { + + } +}","class Solution(object): + def minimumIncompatibility(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minimumIncompatibility(self, nums: List[int], k: int) -> int: + ","int minimumIncompatibility(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinimumIncompatibility(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minimumIncompatibility = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def minimum_incompatibility(nums, k) + +end","class Solution { + func minimumIncompatibility(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minimumIncompatibility(nums []int, k int) int { + +}","object Solution { + def minimumIncompatibility(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minimumIncompatibility(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn minimum_incompatibility(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minimumIncompatibility($nums, $k) { + + } +}","function minimumIncompatibility(nums: number[], k: number): number { + +};",,"-spec minimum_incompatibility(Nums :: [integer()], K :: integer()) -> integer(). +minimum_incompatibility(Nums, K) -> + .","defmodule Solution do + @spec minimum_incompatibility(nums :: [integer], k :: integer) :: integer + def minimum_incompatibility(nums, k) do + + end +end","class Solution { + int minimumIncompatibility(List nums, int k) { + + } +}", +808,minimize-deviation-in-array,Minimize Deviation in Array,1675.0,1794.0,"

You are given an array nums of n positive integers.

+ +

You can perform two types of operations on any element of the array any number of times:

+ +
    +
  • If the element is even, divide it by 2. + +
      +
    • For example, if the array is [1,2,3,4], then you can do this operation on the last element, and the array will be [1,2,3,2].
      • +
    +
    • +
  • If the element is odd, multiply it by 2. +
      +
    • For example, if the array is [1,2,3,4], then you can do this operation on the first element, and the array will be [2,2,3,4].
      • +
    +
    • +
+ +

The deviation of the array is the maximum difference between any two elements in the array.

+ +

Return the minimum deviation the array can have after performing some number of operations.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4]
+Output: 1
+Explanation: You can transform the array to [1,2,3,2], then to [2,2,3,2], then the deviation will be 3 - 2 = 1.
+
+ +

Example 2:

+ +
+Input: nums = [4,1,5,20,3]
+Output: 3
+Explanation: You can transform the array after two operations to [4,2,5,5,3], then the deviation will be 5 - 2 = 3.
+
+ +

Example 3:

+ +
+Input: nums = [2,10,8]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 2 <= n <= 5 * 104
    • +
  • 1 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int minimumDeviation(vector& nums) { + + } +};","class Solution { + public int minimumDeviation(int[] nums) { + + } +}","class Solution(object): + def minimumDeviation(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumDeviation(self, nums: List[int]) -> int: + ","int minimumDeviation(int* nums, int numsSize){ + +}","public class Solution { + public int MinimumDeviation(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumDeviation = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_deviation(nums) + +end","class Solution { + func minimumDeviation(_ nums: [Int]) -> Int { + + } +}","func minimumDeviation(nums []int) int { + +}","object Solution { + def minimumDeviation(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minimumDeviation(nums: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_deviation(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumDeviation($nums) { + + } +}","function minimumDeviation(nums: number[]): number { + +};","(define/contract (minimum-deviation nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_deviation(Nums :: [integer()]) -> integer(). +minimum_deviation(Nums) -> + .","defmodule Solution do + @spec minimum_deviation(nums :: [integer]) :: integer + def minimum_deviation(nums) do + + end +end","class Solution { + int minimumDeviation(List nums) { + + } +}", +810,find-the-most-competitive-subsequence,Find the Most Competitive Subsequence,1673.0,1792.0,"

Given an integer array nums and a positive integer k, return the most competitive subsequence of nums of size k.

+ +

An array's subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.

+ +

We define that a subsequence a is more competitive than a subsequence b (of the same length) if in the first position where a and b differ, subsequence a has a number less than the corresponding number in b. For example, [1,3,4] is more competitive than [1,3,5] because the first position they differ is at the final number, and 4 is less than 5.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,5,2,6], k = 2
+Output: [2,6]
+Explanation: Among the set of every possible subsequence: {[3,5], [3,2], [3,6], [5,2], [5,6], [2,6]}, [2,6] is the most competitive.
+
+ +

Example 2:

+ +
+Input: nums = [2,4,3,3,5,4,9,6], k = 4
+Output: [2,3,3,4]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
  • 1 <= k <= nums.length
    • +
+",2.0,False,"class Solution { +public: + vector mostCompetitive(vector& nums, int k) { + + } +};","class Solution { + public int[] mostCompetitive(int[] nums, int k) { + + } +}","class Solution(object): + def mostCompetitive(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def mostCompetitive(self, nums: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* mostCompetitive(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public int[] MostCompetitive(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var mostCompetitive = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer[]} +def most_competitive(nums, k) + +end","class Solution { + func mostCompetitive(_ nums: [Int], _ k: Int) -> [Int] { + + } +}","func mostCompetitive(nums []int, k int) []int { + +}","object Solution { + def mostCompetitive(nums: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun mostCompetitive(nums: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn most_competitive(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer[] + */ + function mostCompetitive($nums, $k) { + + } +}","function mostCompetitive(nums: number[], k: number): number[] { + +};","(define/contract (most-competitive nums k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec most_competitive(Nums :: [integer()], K :: integer()) -> [integer()]. +most_competitive(Nums, K) -> + .","defmodule Solution do + @spec most_competitive(nums :: [integer], k :: integer) :: [integer] + def most_competitive(nums, k) do + + end +end","class Solution { + List mostCompetitive(List nums, int k) { + + } +}", +812,delivering-boxes-from-storage-to-ports,Delivering Boxes from Storage to Ports,1687.0,1789.0,"

You have the task of delivering some boxes from storage to their ports using only one ship. However, this ship has a limit on the number of boxes and the total weight that it can carry.

+ +

You are given an array boxes, where boxes[i] = [ports​​i​, weighti], and three integers portsCount, maxBoxes, and maxWeight.

+ +
    +
  • ports​​i is the port where you need to deliver the ith box and weightsi is the weight of the ith box.
    • +
  • portsCount is the number of ports.
    • +
  • maxBoxes and maxWeight are the respective box and weight limits of the ship.
    • +
+ +

The boxes need to be delivered in the order they are given. The ship will follow these steps:

+ +
    +
  • The ship will take some number of boxes from the boxes queue, not violating the maxBoxes and maxWeight constraints.
    • +
  • For each loaded box in order, the ship will make a trip to the port the box needs to be delivered to and deliver it. If the ship is already at the correct port, no trip is needed, and the box can immediately be delivered.
    • +
  • The ship then makes a return trip to storage to take more boxes from the queue.
    • +
+ +

The ship must end at storage after all the boxes have been delivered.

+ +

Return the minimum number of trips the ship needs to make to deliver all boxes to their respective ports.

+ +

 

+

Example 1:

+ +
+Input: boxes = [[1,1],[2,1],[1,1]], portsCount = 2, maxBoxes = 3, maxWeight = 3
+Output: 4
+Explanation: The optimal strategy is as follows: 
+- The ship takes all the boxes in the queue, goes to port 1, then port 2, then port 1 again, then returns to storage. 4 trips.
+So the total number of trips is 4.
+Note that the first and third boxes cannot be delivered together because the boxes need to be delivered in order (i.e. the second box needs to be delivered at port 2 before the third box).
+
+ +

Example 2:

+ +
+Input: boxes = [[1,2],[3,3],[3,1],[3,1],[2,4]], portsCount = 3, maxBoxes = 3, maxWeight = 6
+Output: 6
+Explanation: The optimal strategy is as follows: 
+- The ship takes the first box, goes to port 1, then returns to storage. 2 trips.
+- The ship takes the second, third and fourth boxes, goes to port 3, then returns to storage. 2 trips.
+- The ship takes the fifth box, goes to port 2, then returns to storage. 2 trips.
+So the total number of trips is 2 + 2 + 2 = 6.
+
+ +

Example 3:

+ +
+Input: boxes = [[1,4],[1,2],[2,1],[2,1],[3,2],[3,4]], portsCount = 3, maxBoxes = 6, maxWeight = 7
+Output: 6
+Explanation: The optimal strategy is as follows:
+- The ship takes the first and second boxes, goes to port 1, then returns to storage. 2 trips.
+- The ship takes the third and fourth boxes, goes to port 2, then returns to storage. 2 trips.
+- The ship takes the fifth and sixth boxes, goes to port 3, then returns to storage. 2 trips.
+So the total number of trips is 2 + 2 + 2 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= boxes.length <= 105
    • +
  • 1 <= portsCount, maxBoxes, maxWeight <= 105
    • +
  • 1 <= ports​​i <= portsCount
    • +
  • 1 <= weightsi <= maxWeight
    • +
+",3.0,False,"class Solution { +public: + int boxDelivering(vector>& boxes, int portsCount, int maxBoxes, int maxWeight) { + + } +};","class Solution { + public int boxDelivering(int[][] boxes, int portsCount, int maxBoxes, int maxWeight) { + + } +}","class Solution(object): + def boxDelivering(self, boxes, portsCount, maxBoxes, maxWeight): + """""" + :type boxes: List[List[int]] + :type portsCount: int + :type maxBoxes: int + :type maxWeight: int + :rtype: int + """""" + ","class Solution: + def boxDelivering(self, boxes: List[List[int]], portsCount: int, maxBoxes: int, maxWeight: int) -> int: + ","int boxDelivering(int** boxes, int boxesSize, int* boxesColSize, int portsCount, int maxBoxes, int maxWeight){ + +}","public class Solution { + public int BoxDelivering(int[][] boxes, int portsCount, int maxBoxes, int maxWeight) { + + } +}","/** + * @param {number[][]} boxes + * @param {number} portsCount + * @param {number} maxBoxes + * @param {number} maxWeight + * @return {number} + */ +var boxDelivering = function(boxes, portsCount, maxBoxes, maxWeight) { + +};","# @param {Integer[][]} boxes +# @param {Integer} ports_count +# @param {Integer} max_boxes +# @param {Integer} max_weight +# @return {Integer} +def box_delivering(boxes, ports_count, max_boxes, max_weight) + +end","class Solution { + func boxDelivering(_ boxes: [[Int]], _ portsCount: Int, _ maxBoxes: Int, _ maxWeight: Int) -> Int { + + } +}","func boxDelivering(boxes [][]int, portsCount int, maxBoxes int, maxWeight int) int { + +}","object Solution { + def boxDelivering(boxes: Array[Array[Int]], portsCount: Int, maxBoxes: Int, maxWeight: Int): Int = { + + } +}","class Solution { + fun boxDelivering(boxes: Array, portsCount: Int, maxBoxes: Int, maxWeight: Int): Int { + + } +}","impl Solution { + pub fn box_delivering(boxes: Vec>, ports_count: i32, max_boxes: i32, max_weight: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $boxes + * @param Integer $portsCount + * @param Integer $maxBoxes + * @param Integer $maxWeight + * @return Integer + */ + function boxDelivering($boxes, $portsCount, $maxBoxes, $maxWeight) { + + } +}","function boxDelivering(boxes: number[][], portsCount: number, maxBoxes: number, maxWeight: number): number { + +};",,,,"class Solution { + int boxDelivering(List> boxes, int portsCount, int maxBoxes, int maxWeight) { + + } +}", +813,stone-game-vi,Stone Game VI,1686.0,1788.0,"

Alice and Bob take turns playing a game, with Alice starting first.

+ +

There are n stones in a pile. On each player's turn, they can remove a stone from the pile and receive points based on the stone's value. Alice and Bob may value the stones differently.

+ +

You are given two integer arrays of length n, aliceValues and bobValues. Each aliceValues[i] and bobValues[i] represents how Alice and Bob, respectively, value the ith stone.

+ +

The winner is the person with the most points after all the stones are chosen. If both players have the same amount of points, the game results in a draw. Both players will play optimally. Both players know the other's values.

+ +

Determine the result of the game, and:

+ +
    +
  • If Alice wins, return 1.
    • +
  • If Bob wins, return -1.
    • +
  • If the game results in a draw, return 0.
    • +
+ +

 

+

Example 1:

+ +
+Input: aliceValues = [1,3], bobValues = [2,1]
+Output: 1
+Explanation:
+If Alice takes stone 1 (0-indexed) first, Alice will receive 3 points.
+Bob can only choose stone 0, and will only receive 2 points.
+Alice wins.
+
+ +

Example 2:

+ +
+Input: aliceValues = [1,2], bobValues = [3,1]
+Output: 0
+Explanation:
+If Alice takes stone 0, and Bob takes stone 1, they will both have 1 point.
+Draw.
+
+ +

Example 3:

+ +
+Input: aliceValues = [2,4,3], bobValues = [1,6,7]
+Output: -1
+Explanation:
+Regardless of how Alice plays, Bob will be able to have more points than Alice.
+For example, if Alice takes stone 1, Bob can take stone 2, and Alice takes stone 0, Alice will have 6 points to Bob's 7.
+Bob wins.
+
+ +

 

+

Constraints:

+ +
    +
  • n == aliceValues.length == bobValues.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= aliceValues[i], bobValues[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + int stoneGameVI(vector& aliceValues, vector& bobValues) { + + } +};","class Solution { + public int stoneGameVI(int[] aliceValues, int[] bobValues) { + + } +}","class Solution(object): + def stoneGameVI(self, aliceValues, bobValues): + """""" + :type aliceValues: List[int] + :type bobValues: List[int] + :rtype: int + """""" + ","class Solution: + def stoneGameVI(self, aliceValues: List[int], bobValues: List[int]) -> int: + ","int stoneGameVI(int* aliceValues, int aliceValuesSize, int* bobValues, int bobValuesSize){ + +}","public class Solution { + public int StoneGameVI(int[] aliceValues, int[] bobValues) { + + } +}","/** + * @param {number[]} aliceValues + * @param {number[]} bobValues + * @return {number} + */ +var stoneGameVI = function(aliceValues, bobValues) { + +};","# @param {Integer[]} alice_values +# @param {Integer[]} bob_values +# @return {Integer} +def stone_game_vi(alice_values, bob_values) + +end","class Solution { + func stoneGameVI(_ aliceValues: [Int], _ bobValues: [Int]) -> Int { + + } +}","func stoneGameVI(aliceValues []int, bobValues []int) int { + +}","object Solution { + def stoneGameVI(aliceValues: Array[Int], bobValues: Array[Int]): Int = { + + } +}","class Solution { + fun stoneGameVI(aliceValues: IntArray, bobValues: IntArray): Int { + + } +}","impl Solution { + pub fn stone_game_vi(alice_values: Vec, bob_values: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $aliceValues + * @param Integer[] $bobValues + * @return Integer + */ + function stoneGameVI($aliceValues, $bobValues) { + + } +}","function stoneGameVI(aliceValues: number[], bobValues: number[]): number { + +};","(define/contract (stone-game-vi aliceValues bobValues) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec stone_game_vi(AliceValues :: [integer()], BobValues :: [integer()]) -> integer(). +stone_game_vi(AliceValues, BobValues) -> + .","defmodule Solution do + @spec stone_game_vi(alice_values :: [integer], bob_values :: [integer]) :: integer + def stone_game_vi(alice_values, bob_values) do + + end +end","class Solution { + int stoneGameVI(List aliceValues, List bobValues) { + + } +}", +814,sum-of-absolute-differences-in-a-sorted-array,Sum of Absolute Differences in a Sorted Array,1685.0,1787.0,"

You are given an integer array nums sorted in non-decreasing order.

+ +

Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array.

+ +

In other words, result[i] is equal to sum(|nums[i]-nums[j]|) where 0 <= j < nums.length and j != i (0-indexed).

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,5]
+Output: [4,3,5]
+Explanation: Assuming the arrays are 0-indexed, then
+result[0] = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,
+result[1] = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,
+result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.
+
+ +

Example 2:

+ +
+Input: nums = [1,4,6,8,10]
+Output: [24,15,13,15,21]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= nums[i + 1] <= 104
    • +
+",2.0,False,"class Solution { +public: + vector getSumAbsoluteDifferences(vector& nums) { + + } +};","class Solution { + public int[] getSumAbsoluteDifferences(int[] nums) { + + } +}","class Solution(object): + def getSumAbsoluteDifferences(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]: + "," + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getSumAbsoluteDifferences(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] GetSumAbsoluteDifferences(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var getSumAbsoluteDifferences = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def get_sum_absolute_differences(nums) + +end","class Solution { + func getSumAbsoluteDifferences(_ nums: [Int]) -> [Int] { + + } +}","func getSumAbsoluteDifferences(nums []int) []int { + +}","object Solution { + def getSumAbsoluteDifferences(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun getSumAbsoluteDifferences(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn get_sum_absolute_differences(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function getSumAbsoluteDifferences($nums) { + + } +}","function getSumAbsoluteDifferences(nums: number[]): number[] { + +};",,,,, +816,minimum-initial-energy-to-finish-tasks,Minimum Initial Energy to Finish Tasks,1665.0,1784.0,"

You are given an array tasks where tasks[i] = [actuali, minimumi]:

+ +
    +
  • actuali is the actual amount of energy you spend to finish the ith task.
    • +
  • minimumi is the minimum amount of energy you require to begin the ith task.
    • +
+ +

For example, if the task is [10, 12] and your current energy is 11, you cannot start this task. However, if your current energy is 13, you can complete this task, and your energy will be 3 after finishing it.

+ +

You can finish the tasks in any order you like.

+ +

Return the minimum initial amount of energy you will need to finish all the tasks.

+ +

 

+

Example 1:

+ +
+Input: tasks = [[1,2],[2,4],[4,8]]
+Output: 8
+Explanation:
+Starting with 8 energy, we finish the tasks in the following order:
+    - 3rd task. Now energy = 8 - 4 = 4.
+    - 2nd task. Now energy = 4 - 2 = 2.
+    - 1st task. Now energy = 2 - 1 = 1.
+Notice that even though we have leftover energy, starting with 7 energy does not work because we cannot do the 3rd task.
+ +

Example 2:

+ +
+Input: tasks = [[1,3],[2,4],[10,11],[10,12],[8,9]]
+Output: 32
+Explanation:
+Starting with 32 energy, we finish the tasks in the following order:
+    - 1st task. Now energy = 32 - 1 = 31.
+    - 2nd task. Now energy = 31 - 2 = 29.
+    - 3rd task. Now energy = 29 - 10 = 19.
+    - 4th task. Now energy = 19 - 10 = 9.
+    - 5th task. Now energy = 9 - 8 = 1.
+ +

Example 3:

+ +
+Input: tasks = [[1,7],[2,8],[3,9],[4,10],[5,11],[6,12]]
+Output: 27
+Explanation:
+Starting with 27 energy, we finish the tasks in the following order:
+    - 5th task. Now energy = 27 - 5 = 22.
+    - 2nd task. Now energy = 22 - 2 = 20.
+    - 3rd task. Now energy = 20 - 3 = 17.
+    - 1st task. Now energy = 17 - 1 = 16.
+    - 4th task. Now energy = 16 - 4 = 12.
+    - 6th task. Now energy = 12 - 6 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tasks.length <= 105
    • +
  • 1 <= actual​i <= minimumi <= 104
    • +
+",3.0,False,"class Solution { +public: + int minimumEffort(vector>& tasks) { + + } +};","class Solution { + public int minimumEffort(int[][] tasks) { + + } +}","class Solution(object): + def minimumEffort(self, tasks): + """""" + :type tasks: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumEffort(self, tasks: List[List[int]]) -> int: + ","int minimumEffort(int** tasks, int tasksSize, int* tasksColSize){ + +}","public class Solution { + public int MinimumEffort(int[][] tasks) { + + } +}","/** + * @param {number[][]} tasks + * @return {number} + */ +var minimumEffort = function(tasks) { + +};","# @param {Integer[][]} tasks +# @return {Integer} +def minimum_effort(tasks) + +end","class Solution { + func minimumEffort(_ tasks: [[Int]]) -> Int { + + } +}","func minimumEffort(tasks [][]int) int { + +}","object Solution { + def minimumEffort(tasks: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumEffort(tasks: Array): Int { + + } +}","impl Solution { + pub fn minimum_effort(tasks: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $tasks + * @return Integer + */ + function minimumEffort($tasks) { + + } +}","function minimumEffort(tasks: number[][]): number { + +};","(define/contract (minimum-effort tasks) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec minimum_effort(Tasks :: [[integer()]]) -> integer(). +minimum_effort(Tasks) -> + .","defmodule Solution do + @spec minimum_effort(tasks :: [[integer]]) :: integer + def minimum_effort(tasks) do + + end +end","class Solution { + int minimumEffort(List> tasks) { + + } +}", +820,maximize-grid-happiness,Maximize Grid Happiness,1659.0,1778.0,"

You are given four integers, m, n, introvertsCount, and extrovertsCount. You have an m x n grid, and there are two types of people: introverts and extroverts. There are introvertsCount introverts and extrovertsCount extroverts.

+ +

You should decide how many people you want to live in the grid and assign each of them one grid cell. Note that you do not have to have all the people living in the grid.

+ +

The happiness of each person is calculated as follows:

+ +
    +
  • Introverts start with 120 happiness and lose 30 happiness for each neighbor (introvert or extrovert).
    • +
  • Extroverts start with 40 happiness and gain 20 happiness for each neighbor (introvert or extrovert).
    • +
+ +

Neighbors live in the directly adjacent cells north, east, south, and west of a person's cell.

+ +

The grid happiness is the sum of each person's happiness. Return the maximum possible grid happiness.

+ +

 

+

Example 1:

+ +
+Input: m = 2, n = 3, introvertsCount = 1, extrovertsCount = 2
+Output: 240
+Explanation: Assume the grid is 1-indexed with coordinates (row, column).
+We can put the introvert in cell (1,1) and put the extroverts in cells (1,3) and (2,3).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (0 * 30) (0 neighbors) = 120
+- Extrovert at (1,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+- Extrovert at (2,3) happiness: 40 (starting happiness) + (1 * 20) (1 neighbor) = 60
+The grid happiness is 120 + 60 + 60 = 240.
+The above figure shows the grid in this example with each person's happiness. The introvert stays in the light green cell while the extroverts live on the light purple cells.
+
+ +

Example 2:

+ +
+Input: m = 3, n = 1, introvertsCount = 2, extrovertsCount = 1
+Output: 260
+Explanation: Place the two introverts in (1,1) and (3,1) and the extrovert at (2,1).
+- Introvert at (1,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+- Extrovert at (2,1) happiness: 40 (starting happiness) + (2 * 20) (2 neighbors) = 80
+- Introvert at (3,1) happiness: 120 (starting happiness) - (1 * 30) (1 neighbor) = 90
+The grid happiness is 90 + 80 + 90 = 260.
+
+ +

Example 3:

+ +
+Input: m = 2, n = 2, introvertsCount = 4, extrovertsCount = 0
+Output: 240
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 5
    • +
  • 0 <= introvertsCount, extrovertsCount <= min(m * n, 6)
    • +
+",3.0,False,"class Solution { +public: + int getMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount) { + + } +};","class Solution { + public int getMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount) { + + } +}","class Solution(object): + def getMaxGridHappiness(self, m, n, introvertsCount, extrovertsCount): + """""" + :type m: int + :type n: int + :type introvertsCount: int + :type extrovertsCount: int + :rtype: int + """""" + ","class Solution: + def getMaxGridHappiness(self, m: int, n: int, introvertsCount: int, extrovertsCount: int) -> int: + ","int getMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount){ + +}","public class Solution { + public int GetMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number} introvertsCount + * @param {number} extrovertsCount + * @return {number} + */ +var getMaxGridHappiness = function(m, n, introvertsCount, extrovertsCount) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer} introverts_count +# @param {Integer} extroverts_count +# @return {Integer} +def get_max_grid_happiness(m, n, introverts_count, extroverts_count) + +end","class Solution { + func getMaxGridHappiness(_ m: Int, _ n: Int, _ introvertsCount: Int, _ extrovertsCount: Int) -> Int { + + } +}","func getMaxGridHappiness(m int, n int, introvertsCount int, extrovertsCount int) int { + +}","object Solution { + def getMaxGridHappiness(m: Int, n: Int, introvertsCount: Int, extrovertsCount: Int): Int = { + + } +}","class Solution { + fun getMaxGridHappiness(m: Int, n: Int, introvertsCount: Int, extrovertsCount: Int): Int { + + } +}","impl Solution { + pub fn get_max_grid_happiness(m: i32, n: i32, introverts_count: i32, extroverts_count: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer $introvertsCount + * @param Integer $extrovertsCount + * @return Integer + */ + function getMaxGridHappiness($m, $n, $introvertsCount, $extrovertsCount) { + + } +}","function getMaxGridHappiness(m: number, n: number, introvertsCount: number, extrovertsCount: number): number { + +};","(define/contract (get-max-grid-happiness m n introvertsCount extrovertsCount) + (-> exact-integer? exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec get_max_grid_happiness(M :: integer(), N :: integer(), IntrovertsCount :: integer(), ExtrovertsCount :: integer()) -> integer(). +get_max_grid_happiness(M, N, IntrovertsCount, ExtrovertsCount) -> + .","defmodule Solution do + @spec get_max_grid_happiness(m :: integer, n :: integer, introverts_count :: integer, extroverts_count :: integer) :: integer + def get_max_grid_happiness(m, n, introverts_count, extroverts_count) do + + end +end","class Solution { + int getMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount) { + + } +}", +823,design-an-ordered-stream,Design an Ordered Stream,1656.0,1775.0,"

There is a stream of n (idKey, value) pairs arriving in an arbitrary order, where idKey is an integer between 1 and n and value is a string. No two pairs have the same id.

+ +

Design a stream that returns the values in increasing order of their IDs by returning a chunk (list) of values after each insertion. The concatenation of all the chunks should result in a list of the sorted values.

+ +

Implement the OrderedStream class:

+ +
    +
  • OrderedStream(int n) Constructs the stream to take n values.
    • +
  • String[] insert(int idKey, String value) Inserts the pair (idKey, value) into the stream, then returns the largest possible chunk of currently inserted values that appear next in the order.
    • +
+ +

 

+

Example:

+ +

+ +
+Input
+["OrderedStream", "insert", "insert", "insert", "insert", "insert"]
+[[5], [3, "ccccc"], [1, "aaaaa"], [2, "bbbbb"], [5, "eeeee"], [4, "ddddd"]]
+Output
+[null, [], ["aaaaa"], ["bbbbb", "ccccc"], [], ["ddddd", "eeeee"]]
+
+Explanation
+// Note that the values ordered by ID is ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"].
+OrderedStream os = new OrderedStream(5);
+os.insert(3, "ccccc"); // Inserts (3, "ccccc"), returns [].
+os.insert(1, "aaaaa"); // Inserts (1, "aaaaa"), returns ["aaaaa"].
+os.insert(2, "bbbbb"); // Inserts (2, "bbbbb"), returns ["bbbbb", "ccccc"].
+os.insert(5, "eeeee"); // Inserts (5, "eeeee"), returns [].
+os.insert(4, "ddddd"); // Inserts (4, "ddddd"), returns ["ddddd", "eeeee"].
+// Concatentating all the chunks returned:
+// [] + ["aaaaa"] + ["bbbbb", "ccccc"] + [] + ["ddddd", "eeeee"] = ["aaaaa", "bbbbb", "ccccc", "ddddd", "eeeee"]
+// The resulting order is the same as the order above.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
  • 1 <= id <= n
    • +
  • value.length == 5
    • +
  • value consists only of lowercase letters.
    • +
  • Each call to insert will have a unique id.
    • +
  • Exactly n calls will be made to insert.
    • +
+",1.0,False,"class OrderedStream { +public: + OrderedStream(int n) { + + } + + vector insert(int idKey, string value) { + + } +}; + +/** + * Your OrderedStream object will be instantiated and called as such: + * OrderedStream* obj = new OrderedStream(n); + * vector param_1 = obj->insert(idKey,value); + */","class OrderedStream { + + public OrderedStream(int n) { + + } + + public List insert(int idKey, String value) { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * OrderedStream obj = new OrderedStream(n); + * List param_1 = obj.insert(idKey,value); + */","class OrderedStream(object): + + def __init__(self, n): + """""" + :type n: int + """""" + + + def insert(self, idKey, value): + """""" + :type idKey: int + :type value: str + :rtype: List[str] + """""" + + + +# Your OrderedStream object will be instantiated and called as such: +# obj = OrderedStream(n) +# param_1 = obj.insert(idKey,value)","class OrderedStream: + + def __init__(self, n: int): + + + def insert(self, idKey: int, value: str) -> List[str]: + + + +# Your OrderedStream object will be instantiated and called as such: +# obj = OrderedStream(n) +# param_1 = obj.insert(idKey,value)"," + + +typedef struct { + +} OrderedStream; + + +OrderedStream* orderedStreamCreate(int n) { + +} + +char ** orderedStreamInsert(OrderedStream* obj, int idKey, char * value, int* retSize) { + +} + +void orderedStreamFree(OrderedStream* obj) { + +} + +/** + * Your OrderedStream struct will be instantiated and called as such: + * OrderedStream* obj = orderedStreamCreate(n); + * char ** param_1 = orderedStreamInsert(obj, idKey, value, retSize); + + * orderedStreamFree(obj); +*/","public class OrderedStream { + + public OrderedStream(int n) { + + } + + public IList Insert(int idKey, string value) { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * OrderedStream obj = new OrderedStream(n); + * IList param_1 = obj.Insert(idKey,value); + */","/** + * @param {number} n + */ +var OrderedStream = function(n) { + +}; + +/** + * @param {number} idKey + * @param {string} value + * @return {string[]} + */ +OrderedStream.prototype.insert = function(idKey, value) { + +}; + +/** + * Your OrderedStream object will be instantiated and called as such: + * var obj = new OrderedStream(n) + * var param_1 = obj.insert(idKey,value) + */","class OrderedStream + +=begin + :type n: Integer +=end + def initialize(n) + + end + + +=begin + :type id_key: Integer + :type value: String + :rtype: String[] +=end + def insert(id_key, value) + + end + + +end + +# Your OrderedStream object will be instantiated and called as such: +# obj = OrderedStream.new(n) +# param_1 = obj.insert(id_key, value)"," +class OrderedStream { + + init(_ n: Int) { + + } + + func insert(_ idKey: Int, _ value: String) -> [String] { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * let obj = OrderedStream(n) + * let ret_1: [String] = obj.insert(idKey, value) + */","type OrderedStream struct { + +} + + +func Constructor(n int) OrderedStream { + +} + + +func (this *OrderedStream) Insert(idKey int, value string) []string { + +} + + +/** + * Your OrderedStream object will be instantiated and called as such: + * obj := Constructor(n); + * param_1 := obj.Insert(idKey,value); + */","class OrderedStream(_n: Int) { + + def insert(idKey: Int, value: String): List[String] = { + + } + +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * var obj = new OrderedStream(n) + * var param_1 = obj.insert(idKey,value) + */","class OrderedStream(n: Int) { + + fun insert(idKey: Int, value: String): List { + + } + +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * var obj = OrderedStream(n) + * var param_1 = obj.insert(idKey,value) + */","struct OrderedStream { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl OrderedStream { + + fn new(n: i32) -> Self { + + } + + fn insert(&self, id_key: i32, value: String) -> Vec { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * let obj = OrderedStream::new(n); + * let ret_1: Vec = obj.insert(idKey, value); + */","class OrderedStream { + /** + * @param Integer $n + */ + function __construct($n) { + + } + + /** + * @param Integer $idKey + * @param String $value + * @return String[] + */ + function insert($idKey, $value) { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * $obj = OrderedStream($n); + * $ret_1 = $obj->insert($idKey, $value); + */","class OrderedStream { + constructor(n: number) { + + } + + insert(idKey: number, value: string): string[] { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * var obj = new OrderedStream(n) + * var param_1 = obj.insert(idKey,value) + */","(define ordered-stream% + (class object% + (super-new) + + ; n : exact-integer? + (init-field + n) + + ; insert : exact-integer? string? -> (listof string?) + (define/public (insert id-key value) + + ))) + +;; Your ordered-stream% object will be instantiated and called as such: +;; (define obj (new ordered-stream% [n n])) +;; (define param_1 (send obj insert id-key value))","-spec ordered_stream_init_(N :: integer()) -> any(). +ordered_stream_init_(N) -> + . + +-spec ordered_stream_insert(IdKey :: integer(), Value :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +ordered_stream_insert(IdKey, Value) -> + . + + +%% Your functions will be called as such: +%% ordered_stream_init_(N), +%% Param_1 = ordered_stream_insert(IdKey, Value), + +%% ordered_stream_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule OrderedStream do + @spec init_(n :: integer) :: any + def init_(n) do + + end + + @spec insert(id_key :: integer, value :: String.t) :: [String.t] + def insert(id_key, value) do + + end +end + +# Your functions will be called as such: +# OrderedStream.init_(n) +# param_1 = OrderedStream.insert(id_key, value) + +# OrderedStream.init_ will be called before every test case, in which you can do some necessary initializations.","class OrderedStream { + + OrderedStream(int n) { + + } + + List insert(int idKey, String value) { + + } +} + +/** + * Your OrderedStream object will be instantiated and called as such: + * OrderedStream obj = OrderedStream(n); + * List param1 = obj.insert(idKey,value); + */", +824,create-sorted-array-through-instructions,Create Sorted Array through Instructions,1649.0,1772.0,"

Given an integer array instructions, you are asked to create a sorted array from the elements in instructions. You start with an empty container nums. For each element from left to right in instructions, insert it into nums. The cost of each insertion is the minimum of the following:

+ +
    +
  • The number of elements currently in nums that are strictly less than instructions[i].
    • +
  • The number of elements currently in nums that are strictly greater than instructions[i].
    • +
+ +

For example, if inserting element 3 into nums = [1,2,3,5], the cost of insertion is min(2, 1) (elements 1 and 2 are less than 3, element 5 is greater than 3) and nums will become [1,2,3,3,5].

+ +

Return the total cost to insert all elements from instructions into nums. Since the answer may be large, return it modulo 109 + 7

+ +

 

+

Example 1:

+ +
+Input: instructions = [1,5,6,2]
+Output: 1
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 5 with cost min(1, 0) = 0, now nums = [1,5].
+Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6].
+Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6].
+The total cost is 0 + 0 + 0 + 1 = 1.
+ +

Example 2:

+ +
+Input: instructions = [1,2,3,6,5,4]
+Output: 3
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 2 with cost min(1, 0) = 0, now nums = [1,2].
+Insert 3 with cost min(2, 0) = 0, now nums = [1,2,3].
+Insert 6 with cost min(3, 0) = 0, now nums = [1,2,3,6].
+Insert 5 with cost min(3, 1) = 1, now nums = [1,2,3,5,6].
+Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6].
+The total cost is 0 + 0 + 0 + 0 + 1 + 2 = 3.
+
+ +

Example 3:

+ +
+Input: instructions = [1,3,3,3,2,4,2,1,2]
+Output: 4
+Explanation: Begin with nums = [].
+Insert 1 with cost min(0, 0) = 0, now nums = [1].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3].
+Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3,3].
+Insert 2 with cost min(1, 3) = 1, now nums = [1,2,3,3,3].
+Insert 4 with cost min(5, 0) = 0, now nums = [1,2,3,3,3,4].
+​​​​​​​Insert 2 with cost min(1, 4) = 1, now nums = [1,2,2,3,3,3,4].
+​​​​​​​Insert 1 with cost min(0, 6) = 0, now nums = [1,1,2,2,3,3,3,4].
+​​​​​​​Insert 2 with cost min(2, 4) = 2, now nums = [1,1,2,2,2,3,3,3,4].
+The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= instructions.length <= 105
    • +
  • 1 <= instructions[i] <= 105
    • +
",3.0,False,"class Solution { +public: + int createSortedArray(vector& instructions) { + + } +};","class Solution { + public int createSortedArray(int[] instructions) { + + } +}","class Solution(object): + def createSortedArray(self, instructions): + """""" + :type instructions: List[int] + :rtype: int + """""" + ","class Solution: + def createSortedArray(self, instructions: List[int]) -> int: + "," + +int createSortedArray(int* instructions, int instructionsSize){ + +}","public class Solution { + public int CreateSortedArray(int[] instructions) { + + } +}","/** + * @param {number[]} instructions + * @return {number} + */ +var createSortedArray = function(instructions) { + +};","# @param {Integer[]} instructions +# @return {Integer} +def create_sorted_array(instructions) + +end","class Solution { + func createSortedArray(_ instructions: [Int]) -> Int { + + } +}","func createSortedArray(instructions []int) int { + +}","object Solution { + def createSortedArray(instructions: Array[Int]): Int = { + + } +}","class Solution { + fun createSortedArray(instructions: IntArray): Int { + + } +}","impl Solution { + pub fn create_sorted_array(instructions: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $instructions + * @return Integer + */ + function createSortedArray($instructions) { + + } +}","function createSortedArray(instructions: number[]): number { + +};",,,,, +825,sell-diminishing-valued-colored-balls,Sell Diminishing-Valued Colored Balls,1648.0,1771.0,"

You have an inventory of different colored balls, and there is a customer that wants orders balls of any color.

+ +

The customer weirdly values the colored balls. Each colored ball's value is the number of balls of that color you currently have in your inventory. For example, if you own 6 yellow balls, the customer would pay 6 for the first yellow ball. After the transaction, there are only 5 yellow balls left, so the next yellow ball is then valued at 5 (i.e., the value of the balls decreases as you sell more to the customer).

+ +

You are given an integer array, inventory, where inventory[i] represents the number of balls of the ith color that you initially own. You are also given an integer orders, which represents the total number of balls that the customer wants. You can sell the balls in any order.

+ +

Return the maximum total value that you can attain after selling orders colored balls. As the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: inventory = [2,5], orders = 4
+Output: 14
+Explanation: Sell the 1st color 1 time (2) and the 2nd color 3 times (5 + 4 + 3).
+The maximum total value is 2 + 5 + 4 + 3 = 14.
+
+ +

Example 2:

+ +
+Input: inventory = [3,5], orders = 6
+Output: 19
+Explanation: Sell the 1st color 2 times (3 + 2) and the 2nd color 4 times (5 + 4 + 3 + 2).
+The maximum total value is 3 + 2 + 5 + 4 + 3 + 2 = 19.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= inventory.length <= 105
    • +
  • 1 <= inventory[i] <= 109
    • +
  • 1 <= orders <= min(sum(inventory[i]), 109)
    • +
+",2.0,False,"class Solution { +public: + int maxProfit(vector& inventory, int orders) { + + } +};","class Solution { + public int maxProfit(int[] inventory, int orders) { + + } +}","class Solution(object): + def maxProfit(self, inventory, orders): + """""" + :type inventory: List[int] + :type orders: int + :rtype: int + """""" + ","class Solution: + def maxProfit(self, inventory: List[int], orders: int) -> int: + ","int maxProfit(int* inventory, int inventorySize, int orders){ + +}","public class Solution { + public int MaxProfit(int[] inventory, int orders) { + + } +}","/** + * @param {number[]} inventory + * @param {number} orders + * @return {number} + */ +var maxProfit = function(inventory, orders) { + +};","# @param {Integer[]} inventory +# @param {Integer} orders +# @return {Integer} +def max_profit(inventory, orders) + +end","class Solution { + func maxProfit(_ inventory: [Int], _ orders: Int) -> Int { + + } +}","func maxProfit(inventory []int, orders int) int { + +}","object Solution { + def maxProfit(inventory: Array[Int], orders: Int): Int = { + + } +}","class Solution { + fun maxProfit(inventory: IntArray, orders: Int): Int { + + } +}","impl Solution { + pub fn max_profit(inventory: Vec, orders: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $inventory + * @param Integer $orders + * @return Integer + */ + function maxProfit($inventory, $orders) { + + } +}","function maxProfit(inventory: number[], orders: number): number { + +};","(define/contract (max-profit inventory orders) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec max_profit(Inventory :: [integer()], Orders :: integer()) -> integer(). +max_profit(Inventory, Orders) -> + .","defmodule Solution do + @spec max_profit(inventory :: [integer], orders :: integer) :: integer + def max_profit(inventory, orders) do + + end +end","class Solution { + int maxProfit(List inventory, int orders) { + + } +}", +828,design-front-middle-back-queue,Design Front Middle Back Queue,1670.0,1767.0,"

Design a queue that supports push and pop operations in the front, middle, and back.

+ +

Implement the FrontMiddleBack class:

+ +
    +
  • FrontMiddleBack() Initializes the queue.
    • +
  • void pushFront(int val) Adds val to the front of the queue.
    • +
  • void pushMiddle(int val) Adds val to the middle of the queue.
    • +
  • void pushBack(int val) Adds val to the back of the queue.
    • +
  • int popFront() Removes the front element of the queue and returns it. If the queue is empty, return -1.
    • +
  • int popMiddle() Removes the middle element of the queue and returns it. If the queue is empty, return -1.
    • +
  • int popBack() Removes the back element of the queue and returns it. If the queue is empty, return -1.
    • +
+ +

Notice that when there are two middle position choices, the operation is performed on the frontmost middle position choice. For example:

+ +
    +
  • Pushing 6 into the middle of [1, 2, 3, 4, 5] results in [1, 2, 6, 3, 4, 5].
    • +
  • Popping the middle from [1, 2, 3, 4, 5, 6] returns 3 and results in [1, 2, 4, 5, 6].
    • +
+ +

 

+

Example 1:

+ +
+Input:
+["FrontMiddleBackQueue", "pushFront", "pushBack", "pushMiddle", "pushMiddle", "popFront", "popMiddle", "popMiddle", "popBack", "popFront"]
+[[], [1], [2], [3], [4], [], [], [], [], []]
+Output:
+[null, null, null, null, null, 1, 3, 4, 2, -1]
+
+Explanation:
+FrontMiddleBackQueue q = new FrontMiddleBackQueue();
+q.pushFront(1);   // [1]
+q.pushBack(2);    // [1, 2]
+q.pushMiddle(3);  // [1, 3, 2]
+q.pushMiddle(4);  // [1, 4, 3, 2]
+q.popFront();     // return 1 -> [4, 3, 2]
+q.popMiddle();    // return 3 -> [4, 2]
+q.popMiddle();    // return 4 -> [2]
+q.popBack();      // return 2 -> []
+q.popFront();     // return -1 -> [] (The queue is empty)
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= val <= 109
    • +
  • At most 1000 calls will be made to pushFront, pushMiddle, pushBack, popFront, popMiddle, and popBack.
    • +
+",2.0,False,"class FrontMiddleBackQueue { +public: + FrontMiddleBackQueue() { + + } + + void pushFront(int val) { + + } + + void pushMiddle(int val) { + + } + + void pushBack(int val) { + + } + + int popFront() { + + } + + int popMiddle() { + + } + + int popBack() { + + } +}; + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * FrontMiddleBackQueue* obj = new FrontMiddleBackQueue(); + * obj->pushFront(val); + * obj->pushMiddle(val); + * obj->pushBack(val); + * int param_4 = obj->popFront(); + * int param_5 = obj->popMiddle(); + * int param_6 = obj->popBack(); + */","class FrontMiddleBackQueue { + + public FrontMiddleBackQueue() { + + } + + public void pushFront(int val) { + + } + + public void pushMiddle(int val) { + + } + + public void pushBack(int val) { + + } + + public int popFront() { + + } + + public int popMiddle() { + + } + + public int popBack() { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * FrontMiddleBackQueue obj = new FrontMiddleBackQueue(); + * obj.pushFront(val); + * obj.pushMiddle(val); + * obj.pushBack(val); + * int param_4 = obj.popFront(); + * int param_5 = obj.popMiddle(); + * int param_6 = obj.popBack(); + */","class FrontMiddleBackQueue(object): + + def __init__(self): + + + def pushFront(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def pushMiddle(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def pushBack(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def popFront(self): + """""" + :rtype: int + """""" + + + def popMiddle(self): + """""" + :rtype: int + """""" + + + def popBack(self): + """""" + :rtype: int + """""" + + + +# Your FrontMiddleBackQueue object will be instantiated and called as such: +# obj = FrontMiddleBackQueue() +# obj.pushFront(val) +# obj.pushMiddle(val) +# obj.pushBack(val) +# param_4 = obj.popFront() +# param_5 = obj.popMiddle() +# param_6 = obj.popBack()","class FrontMiddleBackQueue: + + def __init__(self): + + + def pushFront(self, val: int) -> None: + + + def pushMiddle(self, val: int) -> None: + + + def pushBack(self, val: int) -> None: + + + def popFront(self) -> int: + + + def popMiddle(self) -> int: + + + def popBack(self) -> int: + + + +# Your FrontMiddleBackQueue object will be instantiated and called as such: +# obj = FrontMiddleBackQueue() +# obj.pushFront(val) +# obj.pushMiddle(val) +# obj.pushBack(val) +# param_4 = obj.popFront() +# param_5 = obj.popMiddle() +# param_6 = obj.popBack()"," + + +typedef struct { + +} FrontMiddleBackQueue; + + +FrontMiddleBackQueue* frontMiddleBackQueueCreate() { + +} + +void frontMiddleBackQueuePushFront(FrontMiddleBackQueue* obj, int val) { + +} + +void frontMiddleBackQueuePushMiddle(FrontMiddleBackQueue* obj, int val) { + +} + +void frontMiddleBackQueuePushBack(FrontMiddleBackQueue* obj, int val) { + +} + +int frontMiddleBackQueuePopFront(FrontMiddleBackQueue* obj) { + +} + +int frontMiddleBackQueuePopMiddle(FrontMiddleBackQueue* obj) { + +} + +int frontMiddleBackQueuePopBack(FrontMiddleBackQueue* obj) { + +} + +void frontMiddleBackQueueFree(FrontMiddleBackQueue* obj) { + +} + +/** + * Your FrontMiddleBackQueue struct will be instantiated and called as such: + * FrontMiddleBackQueue* obj = frontMiddleBackQueueCreate(); + * frontMiddleBackQueuePushFront(obj, val); + + * frontMiddleBackQueuePushMiddle(obj, val); + + * frontMiddleBackQueuePushBack(obj, val); + + * int param_4 = frontMiddleBackQueuePopFront(obj); + + * int param_5 = frontMiddleBackQueuePopMiddle(obj); + + * int param_6 = frontMiddleBackQueuePopBack(obj); + + * frontMiddleBackQueueFree(obj); +*/","public class FrontMiddleBackQueue { + + public FrontMiddleBackQueue() { + + } + + public void PushFront(int val) { + + } + + public void PushMiddle(int val) { + + } + + public void PushBack(int val) { + + } + + public int PopFront() { + + } + + public int PopMiddle() { + + } + + public int PopBack() { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * FrontMiddleBackQueue obj = new FrontMiddleBackQueue(); + * obj.PushFront(val); + * obj.PushMiddle(val); + * obj.PushBack(val); + * int param_4 = obj.PopFront(); + * int param_5 = obj.PopMiddle(); + * int param_6 = obj.PopBack(); + */"," +var FrontMiddleBackQueue = function() { + +}; + +/** + * @param {number} val + * @return {void} + */ +FrontMiddleBackQueue.prototype.pushFront = function(val) { + +}; + +/** + * @param {number} val + * @return {void} + */ +FrontMiddleBackQueue.prototype.pushMiddle = function(val) { + +}; + +/** + * @param {number} val + * @return {void} + */ +FrontMiddleBackQueue.prototype.pushBack = function(val) { + +}; + +/** + * @return {number} + */ +FrontMiddleBackQueue.prototype.popFront = function() { + +}; + +/** + * @return {number} + */ +FrontMiddleBackQueue.prototype.popMiddle = function() { + +}; + +/** + * @return {number} + */ +FrontMiddleBackQueue.prototype.popBack = function() { + +}; + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * var obj = new FrontMiddleBackQueue() + * obj.pushFront(val) + * obj.pushMiddle(val) + * obj.pushBack(val) + * var param_4 = obj.popFront() + * var param_5 = obj.popMiddle() + * var param_6 = obj.popBack() + */","class FrontMiddleBackQueue + def initialize() + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def push_front(val) + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def push_middle(val) + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def push_back(val) + + end + + +=begin + :rtype: Integer +=end + def pop_front() + + end + + +=begin + :rtype: Integer +=end + def pop_middle() + + end + + +=begin + :rtype: Integer +=end + def pop_back() + + end + + +end + +# Your FrontMiddleBackQueue object will be instantiated and called as such: +# obj = FrontMiddleBackQueue.new() +# obj.push_front(val) +# obj.push_middle(val) +# obj.push_back(val) +# param_4 = obj.pop_front() +# param_5 = obj.pop_middle() +# param_6 = obj.pop_back()"," +class FrontMiddleBackQueue { + + init() { + + } + + func pushFront(_ val: Int) { + + } + + func pushMiddle(_ val: Int) { + + } + + func pushBack(_ val: Int) { + + } + + func popFront() -> Int { + + } + + func popMiddle() -> Int { + + } + + func popBack() -> Int { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * let obj = FrontMiddleBackQueue() + * obj.pushFront(val) + * obj.pushMiddle(val) + * obj.pushBack(val) + * let ret_4: Int = obj.popFront() + * let ret_5: Int = obj.popMiddle() + * let ret_6: Int = obj.popBack() + */","type FrontMiddleBackQueue struct { + +} + + +func Constructor() FrontMiddleBackQueue { + +} + + +func (this *FrontMiddleBackQueue) PushFront(val int) { + +} + + +func (this *FrontMiddleBackQueue) PushMiddle(val int) { + +} + + +func (this *FrontMiddleBackQueue) PushBack(val int) { + +} + + +func (this *FrontMiddleBackQueue) PopFront() int { + +} + + +func (this *FrontMiddleBackQueue) PopMiddle() int { + +} + + +func (this *FrontMiddleBackQueue) PopBack() int { + +} + + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * obj := Constructor(); + * obj.PushFront(val); + * obj.PushMiddle(val); + * obj.PushBack(val); + * param_4 := obj.PopFront(); + * param_5 := obj.PopMiddle(); + * param_6 := obj.PopBack(); + */","class FrontMiddleBackQueue() { + + def pushFront(`val`: Int) { + + } + + def pushMiddle(`val`: Int) { + + } + + def pushBack(`val`: Int) { + + } + + def popFront(): Int = { + + } + + def popMiddle(): Int = { + + } + + def popBack(): Int = { + + } + +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * var obj = new FrontMiddleBackQueue() + * obj.pushFront(`val`) + * obj.pushMiddle(`val`) + * obj.pushBack(`val`) + * var param_4 = obj.popFront() + * var param_5 = obj.popMiddle() + * var param_6 = obj.popBack() + */","class FrontMiddleBackQueue() { + + fun pushFront(`val`: Int) { + + } + + fun pushMiddle(`val`: Int) { + + } + + fun pushBack(`val`: Int) { + + } + + fun popFront(): Int { + + } + + fun popMiddle(): Int { + + } + + fun popBack(): Int { + + } + +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * var obj = FrontMiddleBackQueue() + * obj.pushFront(`val`) + * obj.pushMiddle(`val`) + * obj.pushBack(`val`) + * var param_4 = obj.popFront() + * var param_5 = obj.popMiddle() + * var param_6 = obj.popBack() + */","struct FrontMiddleBackQueue { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl FrontMiddleBackQueue { + + fn new() -> Self { + + } + + fn push_front(&self, val: i32) { + + } + + fn push_middle(&self, val: i32) { + + } + + fn push_back(&self, val: i32) { + + } + + fn pop_front(&self) -> i32 { + + } + + fn pop_middle(&self) -> i32 { + + } + + fn pop_back(&self) -> i32 { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * let obj = FrontMiddleBackQueue::new(); + * obj.push_front(val); + * obj.push_middle(val); + * obj.push_back(val); + * let ret_4: i32 = obj.pop_front(); + * let ret_5: i32 = obj.pop_middle(); + * let ret_6: i32 = obj.pop_back(); + */","class FrontMiddleBackQueue { + /** + */ + function __construct() { + + } + + /** + * @param Integer $val + * @return NULL + */ + function pushFront($val) { + + } + + /** + * @param Integer $val + * @return NULL + */ + function pushMiddle($val) { + + } + + /** + * @param Integer $val + * @return NULL + */ + function pushBack($val) { + + } + + /** + * @return Integer + */ + function popFront() { + + } + + /** + * @return Integer + */ + function popMiddle() { + + } + + /** + * @return Integer + */ + function popBack() { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * $obj = FrontMiddleBackQueue(); + * $obj->pushFront($val); + * $obj->pushMiddle($val); + * $obj->pushBack($val); + * $ret_4 = $obj->popFront(); + * $ret_5 = $obj->popMiddle(); + * $ret_6 = $obj->popBack(); + */","class FrontMiddleBackQueue { + constructor() { + + } + + pushFront(val: number): void { + + } + + pushMiddle(val: number): void { + + } + + pushBack(val: number): void { + + } + + popFront(): number { + + } + + popMiddle(): number { + + } + + popBack(): number { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * var obj = new FrontMiddleBackQueue() + * obj.pushFront(val) + * obj.pushMiddle(val) + * obj.pushBack(val) + * var param_4 = obj.popFront() + * var param_5 = obj.popMiddle() + * var param_6 = obj.popBack() + */","(define front-middle-back-queue% + (class object% + (super-new) + (init-field) + + ; push-front : exact-integer? -> void? + (define/public (push-front val) + + ) + ; push-middle : exact-integer? -> void? + (define/public (push-middle val) + + ) + ; push-back : exact-integer? -> void? + (define/public (push-back val) + + ) + ; pop-front : -> exact-integer? + (define/public (pop-front) + + ) + ; pop-middle : -> exact-integer? + (define/public (pop-middle) + + ) + ; pop-back : -> exact-integer? + (define/public (pop-back) + + ))) + +;; Your front-middle-back-queue% object will be instantiated and called as such: +;; (define obj (new front-middle-back-queue%)) +;; (send obj push-front val) +;; (send obj push-middle val) +;; (send obj push-back val) +;; (define param_4 (send obj pop-front)) +;; (define param_5 (send obj pop-middle)) +;; (define param_6 (send obj pop-back))","-spec front_middle_back_queue_init_() -> any(). +front_middle_back_queue_init_() -> + . + +-spec front_middle_back_queue_push_front(Val :: integer()) -> any(). +front_middle_back_queue_push_front(Val) -> + . + +-spec front_middle_back_queue_push_middle(Val :: integer()) -> any(). +front_middle_back_queue_push_middle(Val) -> + . + +-spec front_middle_back_queue_push_back(Val :: integer()) -> any(). +front_middle_back_queue_push_back(Val) -> + . + +-spec front_middle_back_queue_pop_front() -> integer(). +front_middle_back_queue_pop_front() -> + . + +-spec front_middle_back_queue_pop_middle() -> integer(). +front_middle_back_queue_pop_middle() -> + . + +-spec front_middle_back_queue_pop_back() -> integer(). +front_middle_back_queue_pop_back() -> + . + + +%% Your functions will be called as such: +%% front_middle_back_queue_init_(), +%% front_middle_back_queue_push_front(Val), +%% front_middle_back_queue_push_middle(Val), +%% front_middle_back_queue_push_back(Val), +%% Param_4 = front_middle_back_queue_pop_front(), +%% Param_5 = front_middle_back_queue_pop_middle(), +%% Param_6 = front_middle_back_queue_pop_back(), + +%% front_middle_back_queue_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule FrontMiddleBackQueue do + @spec init_() :: any + def init_() do + + end + + @spec push_front(val :: integer) :: any + def push_front(val) do + + end + + @spec push_middle(val :: integer) :: any + def push_middle(val) do + + end + + @spec push_back(val :: integer) :: any + def push_back(val) do + + end + + @spec pop_front() :: integer + def pop_front() do + + end + + @spec pop_middle() :: integer + def pop_middle() do + + end + + @spec pop_back() :: integer + def pop_back() do + + end +end + +# Your functions will be called as such: +# FrontMiddleBackQueue.init_() +# FrontMiddleBackQueue.push_front(val) +# FrontMiddleBackQueue.push_middle(val) +# FrontMiddleBackQueue.push_back(val) +# param_4 = FrontMiddleBackQueue.pop_front() +# param_5 = FrontMiddleBackQueue.pop_middle() +# param_6 = FrontMiddleBackQueue.pop_back() + +# FrontMiddleBackQueue.init_ will be called before every test case, in which you can do some necessary initializations.","class FrontMiddleBackQueue { + + FrontMiddleBackQueue() { + + } + + void pushFront(int val) { + + } + + void pushMiddle(int val) { + + } + + void pushBack(int val) { + + } + + int popFront() { + + } + + int popMiddle() { + + } + + int popBack() { + + } +} + +/** + * Your FrontMiddleBackQueue object will be instantiated and called as such: + * FrontMiddleBackQueue obj = FrontMiddleBackQueue(); + * obj.pushFront(val); + * obj.pushMiddle(val); + * obj.pushBack(val); + * int param4 = obj.popFront(); + * int param5 = obj.popMiddle(); + * int param6 = obj.popBack(); + */", +829,minimum-number-of-removals-to-make-mountain-array,Minimum Number of Removals to Make Mountain Array,1671.0,1766.0,"

You may recall that an array arr is a mountain array if and only if:

+ +
    +
  • arr.length >= 3
    • +
  • There exists some index i (0-indexed) with 0 < i < arr.length - 1 such that: +
      +
    • arr[0] < arr[1] < ... < arr[i - 1] < arr[i]
      • +
    • arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
      • +
    +
    • +
+ +

Given an integer array nums​​​, return the minimum number of elements to remove to make nums​​​ a mountain array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,1]
+Output: 0
+Explanation: The array itself is a mountain array so we do not need to remove any elements.
+
+ +

Example 2:

+ +
+Input: nums = [2,1,1,5,6,2,3,1]
+Output: 3
+Explanation: One solution is to remove the elements at indices 0, 1, and 5, making the array nums = [1,5,6,3,1].
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 109
    • +
  • It is guaranteed that you can make a mountain array out of nums.
    • +
+",3.0,False,"class Solution { +public: + int minimumMountainRemovals(vector& nums) { + + } +};","class Solution { + public int minimumMountainRemovals(int[] nums) { + + } +}","class Solution(object): + def minimumMountainRemovals(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minimumMountainRemovals(self, nums: List[int]) -> int: + ","int minimumMountainRemovals(int* nums, int numsSize){ + +}","public class Solution { + public int MinimumMountainRemovals(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minimumMountainRemovals = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def minimum_mountain_removals(nums) + +end","class Solution { + func minimumMountainRemovals(_ nums: [Int]) -> Int { + + } +}","func minimumMountainRemovals(nums []int) int { + +}","object Solution { + def minimumMountainRemovals(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minimumMountainRemovals(nums: IntArray): Int { + + } +}","impl Solution { + pub fn minimum_mountain_removals(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minimumMountainRemovals($nums) { + + } +}","function minimumMountainRemovals(nums: number[]): number { + +};","(define/contract (minimum-mountain-removals nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec minimum_mountain_removals(Nums :: [integer()]) -> integer(). +minimum_mountain_removals(Nums) -> + .","defmodule Solution do + @spec minimum_mountain_removals(nums :: [integer]) :: integer + def minimum_mountain_removals(nums) do + + end +end","class Solution { + int minimumMountainRemovals(List nums) { + + } +}", +830,merge-in-between-linked-lists,Merge In Between Linked Lists,1669.0,1765.0,"

You are given two linked lists: list1 and list2 of sizes n and m respectively.

+ +

Remove list1's nodes from the ath node to the bth node, and put list2 in their place.

+ +

The blue edges and nodes in the following figure indicate the result:

+ +

Build the result list and return its head.

+ +

 

+

Example 1:

+ +
+Input: list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002]
+Output: [0,1,2,1000000,1000001,1000002,5]
+Explanation: We remove the nodes 3 and 4 and put the entire list2 in their place. The blue edges and nodes in the above figure indicate the result.
+
+ +

Example 2:

+ +
+Input: list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,1000003,1000004]
+Output: [0,1,1000000,1000001,1000002,1000003,1000004,6]
+Explanation: The blue edges and nodes in the above figure indicate the result.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= list1.length <= 104
    • +
  • 1 <= a <= b < list1.length - 1
    • +
  • 1 <= list2.length <= 104
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def mergeInBetween(self, list1, a, b, list2): + """""" + :type list1: ListNode + :type a: int + :type b: int + :type list2: ListNode + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ + + +struct ListNode* mergeInBetween(struct ListNode* list1, int a, int b, struct ListNode* list2){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeInBetween(ListNode list1, int a, int b, ListNode list2) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} list1 + * @param {number} a + * @param {number} b + * @param {ListNode} list2 + * @return {ListNode} + */ +var mergeInBetween = function(list1, a, b, list2) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} list1 +# @param {Integer} a +# @param {Integer} b +# @param {ListNode} list2 +# @return {ListNode} +def merge_in_between(list1, a, b, list2) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func mergeInBetween(_ list1: ListNode?, _ a: Int, _ b: Int, _ list2: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def mergeInBetween(list1: ListNode, a: Int, b: Int, list2: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun mergeInBetween(list1: ListNode?, a: Int, b: Int, list2: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn merge_in_between(list1: Option>, a: i32, b: i32, list2: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $list1 + * @param Integer $a + * @param Integer $b + * @param ListNode $list2 + * @return ListNode + */ + function mergeInBetween($list1, $a, $b, $list2) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function mergeInBetween(list1: ListNode | null, a: number, b: number, list2: ListNode | null): ListNode | null { + +};",,,,, +832,furthest-building-you-can-reach,Furthest Building You Can Reach,1642.0,1762.0,"

You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.

+ +

You start your journey from building 0 and move to the next building by possibly using bricks or ladders.

+ +

While moving from building i to building i+1 (0-indexed),

+ +
    +
  • If the current building's height is greater than or equal to the next building's height, you do not need a ladder or bricks.
    • +
  • If the current building's height is less than the next building's height, you can either use one ladder or (h[i+1] - h[i]) bricks.
    • +
+ +

Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.

+ +

 

+

Example 1:

+ +
+Input: heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1
+Output: 4
+Explanation: Starting at building 0, you can follow these steps:
+- Go to building 1 without using ladders nor bricks since 4 >= 2.
+- Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.
+- Go to building 3 without using ladders nor bricks since 7 >= 6.
+- Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.
+It is impossible to go beyond building 4 because you do not have any more bricks or ladders.
+
+ +

Example 2:

+ +
+Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
+Output: 7
+
+ +

Example 3:

+ +
+Input: heights = [14,3,19,3], bricks = 17, ladders = 0
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= heights.length <= 105
    • +
  • 1 <= heights[i] <= 106
    • +
  • 0 <= bricks <= 109
    • +
  • 0 <= ladders <= heights.length
    • +
+",2.0,False,"class Solution { +public: + int furthestBuilding(vector& heights, int bricks, int ladders) { + + } +};","class Solution { + public int furthestBuilding(int[] heights, int bricks, int ladders) { + + } +}","class Solution(object): + def furthestBuilding(self, heights, bricks, ladders): + """""" + :type heights: List[int] + :type bricks: int + :type ladders: int + :rtype: int + """""" + ","class Solution: + def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int: + ","int furthestBuilding(int* heights, int heightsSize, int bricks, int ladders){ + +}","public class Solution { + public int FurthestBuilding(int[] heights, int bricks, int ladders) { + + } +}","/** + * @param {number[]} heights + * @param {number} bricks + * @param {number} ladders + * @return {number} + */ +var furthestBuilding = function(heights, bricks, ladders) { + +};","# @param {Integer[]} heights +# @param {Integer} bricks +# @param {Integer} ladders +# @return {Integer} +def furthest_building(heights, bricks, ladders) + +end","class Solution { + func furthestBuilding(_ heights: [Int], _ bricks: Int, _ ladders: Int) -> Int { + + } +}","func furthestBuilding(heights []int, bricks int, ladders int) int { + +}","object Solution { + def furthestBuilding(heights: Array[Int], bricks: Int, ladders: Int): Int = { + + } +}","class Solution { + fun furthestBuilding(heights: IntArray, bricks: Int, ladders: Int): Int { + + } +}","impl Solution { + pub fn furthest_building(heights: Vec, bricks: i32, ladders: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $heights + * @param Integer $bricks + * @param Integer $ladders + * @return Integer + */ + function furthestBuilding($heights, $bricks, $ladders) { + + } +}","function furthestBuilding(heights: number[], bricks: number, ladders: number): number { + +};","(define/contract (furthest-building heights bricks ladders) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec furthest_building(Heights :: [integer()], Bricks :: integer(), Ladders :: integer()) -> integer(). +furthest_building(Heights, Bricks, Ladders) -> + .","defmodule Solution do + @spec furthest_building(heights :: [integer], bricks :: integer, ladders :: integer) :: integer + def furthest_building(heights, bricks, ladders) do + + end +end","class Solution { + int furthestBuilding(List heights, int bricks, int ladders) { + + } +}", +834,check-array-formation-through-concatenation,Check Array Formation Through Concatenation,1640.0,1760.0,"

You are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct. Your goal is to form arr by concatenating the arrays in pieces in any order. However, you are not allowed to reorder the integers in each array pieces[i].

+ +

Return true if it is possible to form the array arr from pieces. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: arr = [15,88], pieces = [[88],[15]]
+Output: true
+Explanation: Concatenate [15] then [88]
+
+ +

Example 2:

+ +
+Input: arr = [49,18,16], pieces = [[16,18,49]]
+Output: false
+Explanation: Even though the numbers match, we cannot reorder pieces[0].
+
+ +

Example 3:

+ +
+Input: arr = [91,4,64,78], pieces = [[78],[4,64],[91]]
+Output: true
+Explanation: Concatenate [91] then [4,64] then [78]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pieces.length <= arr.length <= 100
    • +
  • sum(pieces[i].length) == arr.length
    • +
  • 1 <= pieces[i].length <= arr.length
    • +
  • 1 <= arr[i], pieces[i][j] <= 100
    • +
  • The integers in arr are distinct.
    • +
  • The integers in pieces are distinct (i.e., If we flatten pieces in a 1D array, all the integers in this array are distinct).
    • +
+",1.0,False,"class Solution { +public: + bool canFormArray(vector& arr, vector>& pieces) { + + } +};","class Solution { + public boolean canFormArray(int[] arr, int[][] pieces) { + + } +}","class Solution(object): + def canFormArray(self, arr, pieces): + """""" + :type arr: List[int] + :type pieces: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def canFormArray(self, arr: List[int], pieces: List[List[int]]) -> bool: + ","bool canFormArray(int* arr, int arrSize, int** pieces, int piecesSize, int* piecesColSize){ + +}","public class Solution { + public bool CanFormArray(int[] arr, int[][] pieces) { + + } +}","/** + * @param {number[]} arr + * @param {number[][]} pieces + * @return {boolean} + */ +var canFormArray = function(arr, pieces) { + +};","# @param {Integer[]} arr +# @param {Integer[][]} pieces +# @return {Boolean} +def can_form_array(arr, pieces) + +end","class Solution { + func canFormArray(_ arr: [Int], _ pieces: [[Int]]) -> Bool { + + } +}","func canFormArray(arr []int, pieces [][]int) bool { + +}","object Solution { + def canFormArray(arr: Array[Int], pieces: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun canFormArray(arr: IntArray, pieces: Array): Boolean { + + } +}","impl Solution { + pub fn can_form_array(arr: Vec, pieces: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer[][] $pieces + * @return Boolean + */ + function canFormArray($arr, $pieces) { + + } +}","function canFormArray(arr: number[], pieces: number[][]): boolean { + +};","(define/contract (can-form-array arr pieces) + (-> (listof exact-integer?) (listof (listof exact-integer?)) boolean?) + + )","-spec can_form_array(Arr :: [integer()], Pieces :: [[integer()]]) -> boolean(). +can_form_array(Arr, Pieces) -> + .","defmodule Solution do + @spec can_form_array(arr :: [integer], pieces :: [[integer]]) :: boolean + def can_form_array(arr, pieces) do + + end +end","class Solution { + bool canFormArray(List arr, List> pieces) { + + } +}", +835,distribute-repeating-integers,Distribute Repeating Integers,1655.0,1758.0,"

You are given an array of n integers, nums, where there are at most 50 unique values in the array. You are also given an array of m customer order quantities, quantity, where quantity[i] is the amount of integers the ith customer ordered. Determine if it is possible to distribute nums such that:

+ +
    +
  • The ith customer gets exactly quantity[i] integers,
    • +
  • The integers the ith customer gets are all equal, and
    • +
  • Every customer is satisfied.
    • +
+ +

Return true if it is possible to distribute nums according to the above conditions.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4], quantity = [2]
+Output: false
+Explanation: The 0th customer cannot be given two different integers.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,3], quantity = [2]
+Output: true
+Explanation: The 0th customer is given [3,3]. The integers [1,2] are not used.
+
+ +

Example 3:

+ +
+Input: nums = [1,1,2,2], quantity = [2,2]
+Output: true
+Explanation: The 0th customer is given [1,1], and the 1st customer is given [2,2].
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums[i] <= 1000
    • +
  • m == quantity.length
    • +
  • 1 <= m <= 10
    • +
  • 1 <= quantity[i] <= 105
    • +
  • There are at most 50 unique values in nums.
    • +
+",3.0,False,"class Solution { +public: + bool canDistribute(vector& nums, vector& quantity) { + + } +};","class Solution { + public boolean canDistribute(int[] nums, int[] quantity) { + + } +}","class Solution(object): + def canDistribute(self, nums, quantity): + """""" + :type nums: List[int] + :type quantity: List[int] + :rtype: bool + """""" + ","class Solution: + def canDistribute(self, nums: List[int], quantity: List[int]) -> bool: + ","bool canDistribute(int* nums, int numsSize, int* quantity, int quantitySize){ + +}","public class Solution { + public bool CanDistribute(int[] nums, int[] quantity) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} quantity + * @return {boolean} + */ +var canDistribute = function(nums, quantity) { + +};","# @param {Integer[]} nums +# @param {Integer[]} quantity +# @return {Boolean} +def can_distribute(nums, quantity) + +end","class Solution { + func canDistribute(_ nums: [Int], _ quantity: [Int]) -> Bool { + + } +}","func canDistribute(nums []int, quantity []int) bool { + +}","object Solution { + def canDistribute(nums: Array[Int], quantity: Array[Int]): Boolean = { + + } +}","class Solution { + fun canDistribute(nums: IntArray, quantity: IntArray): Boolean { + + } +}","impl Solution { + pub fn can_distribute(nums: Vec, quantity: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $quantity + * @return Boolean + */ + function canDistribute($nums, $quantity) { + + } +}","function canDistribute(nums: number[], quantity: number[]): boolean { + +};","(define/contract (can-distribute nums quantity) + (-> (listof exact-integer?) (listof exact-integer?) boolean?) + + )","-spec can_distribute(Nums :: [integer()], Quantity :: [integer()]) -> boolean(). +can_distribute(Nums, Quantity) -> + .","defmodule Solution do + @spec can_distribute(nums :: [integer], quantity :: [integer]) :: boolean + def can_distribute(nums, quantity) do + + end +end","class Solution { + bool canDistribute(List nums, List quantity) { + + } +}", +836,minimum-jumps-to-reach-home,Minimum Jumps to Reach Home,1654.0,1757.0,"

A certain bug's home is on the x-axis at position x. Help them get there from position 0.

+ +

The bug jumps according to the following rules:

+ +
    +
  • It can jump exactly a positions forward (to the right).
    • +
  • It can jump exactly b positions backward (to the left).
    • +
  • It cannot jump backward twice in a row.
    • +
  • It cannot jump to any forbidden positions.
    • +
+ +

The bug may jump forward beyond its home, but it cannot jump to positions numbered with negative integers.

+ +

Given an array of integers forbidden, where forbidden[i] means that the bug cannot jump to the position forbidden[i], and integers a, b, and x, return the minimum number of jumps needed for the bug to reach its home. If there is no possible sequence of jumps that lands the bug on position x, return -1.

+ +

 

+

Example 1:

+ +
+Input: forbidden = [14,4,18,1,15], a = 3, b = 15, x = 9
+Output: 3
+Explanation: 3 jumps forward (0 -> 3 -> 6 -> 9) will get the bug home.
+
+ +

Example 2:

+ +
+Input: forbidden = [8,3,16,6,12,20], a = 15, b = 13, x = 11
+Output: -1
+
+ +

Example 3:

+ +
+Input: forbidden = [1,6,2,14,5,17,4], a = 16, b = 9, x = 7
+Output: 2
+Explanation: One jump forward (0 -> 16) then one jump backward (16 -> 7) will get the bug home.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= forbidden.length <= 1000
    • +
  • 1 <= a, b, forbidden[i] <= 2000
    • +
  • 0 <= x <= 2000
    • +
  • All the elements in forbidden are distinct.
    • +
  • Position x is not forbidden.
    • +
+",2.0,False,"class Solution { +public: + int minimumJumps(vector& forbidden, int a, int b, int x) { + + } +};","class Solution { + public int minimumJumps(int[] forbidden, int a, int b, int x) { + + } +}","class Solution(object): + def minimumJumps(self, forbidden, a, b, x): + """""" + :type forbidden: List[int] + :type a: int + :type b: int + :type x: int + :rtype: int + """""" + ","class Solution: + def minimumJumps(self, forbidden: List[int], a: int, b: int, x: int) -> int: + ","int minimumJumps(int* forbidden, int forbiddenSize, int a, int b, int x){ + +}","public class Solution { + public int MinimumJumps(int[] forbidden, int a, int b, int x) { + + } +}","/** + * @param {number[]} forbidden + * @param {number} a + * @param {number} b + * @param {number} x + * @return {number} + */ +var minimumJumps = function(forbidden, a, b, x) { + +};","# @param {Integer[]} forbidden +# @param {Integer} a +# @param {Integer} b +# @param {Integer} x +# @return {Integer} +def minimum_jumps(forbidden, a, b, x) + +end","class Solution { + func minimumJumps(_ forbidden: [Int], _ a: Int, _ b: Int, _ x: Int) -> Int { + + } +}","func minimumJumps(forbidden []int, a int, b int, x int) int { + +}","object Solution { + def minimumJumps(forbidden: Array[Int], a: Int, b: Int, x: Int): Int = { + + } +}","class Solution { + fun minimumJumps(forbidden: IntArray, a: Int, b: Int, x: Int): Int { + + } +}","impl Solution { + pub fn minimum_jumps(forbidden: Vec, a: i32, b: i32, x: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $forbidden + * @param Integer $a + * @param Integer $b + * @param Integer $x + * @return Integer + */ + function minimumJumps($forbidden, $a, $b, $x) { + + } +}","function minimumJumps(forbidden: number[], a: number, b: number, x: number): number { + +};","(define/contract (minimum-jumps forbidden a b x) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec minimum_jumps(Forbidden :: [integer()], A :: integer(), B :: integer(), X :: integer()) -> integer(). +minimum_jumps(Forbidden, A, B, X) -> + .","defmodule Solution do + @spec minimum_jumps(forbidden :: [integer], a :: integer, b :: integer, x :: integer) :: integer + def minimum_jumps(forbidden, a, b, x) do + + end +end","class Solution { + int minimumJumps(List forbidden, int a, int b, int x) { + + } +}", +839,path-with-minimum-effort,Path With Minimum Effort,1631.0,1753.0,"

You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move up, down, left, or right, and you wish to find a route that requires the minimum effort.

+ +

A route's effort is the maximum absolute difference in heights between two consecutive cells of the route.

+ +

Return the minimum effort required to travel from the top-left cell to the bottom-right cell.

+ +

 

+

Example 1:

+ +

+ +
+Input: heights = [[1,2,2],[3,8,2],[5,3,5]]
+Output: 2
+Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells.
+This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3.
+
+ +

Example 2:

+ +

+ +
+Input: heights = [[1,2,3],[3,8,4],[5,3,5]]
+Output: 1
+Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5].
+
+ +

Example 3:

+ +
+Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]]
+Output: 0
+Explanation: This route does not require any effort.
+
+ +

 

+

Constraints:

+ +
    +
  • rows == heights.length
    • +
  • columns == heights[i].length
    • +
  • 1 <= rows, columns <= 100
    • +
  • 1 <= heights[i][j] <= 106
    • +
",2.0,False,"class Solution { +public: + int minimumEffortPath(vector>& heights) { + + } +};","class Solution { + public int minimumEffortPath(int[][] heights) { + + } +}","class Solution(object): + def minimumEffortPath(self, heights): + """""" + :type heights: List[List[int]] + :rtype: int + """"""","class Solution: + def minimumEffortPath(self, heights: List[List[int]]) -> int:","int minimumEffortPath(int** heights, int heightsSize, int* heightsColSize){ + +}","public class Solution { + public int MinimumEffortPath(int[][] heights) { + + } +}","/** + * @param {number[][]} heights + * @return {number} + */ +var minimumEffortPath = function(heights) { + +};","# @param {Integer[][]} heights +# @return {Integer} +def minimum_effort_path(heights) + +end","class Solution { + func minimumEffortPath(_ heights: [[Int]]) -> Int { + + } +}","func minimumEffortPath(heights [][]int) int { + +}","object Solution { + def minimumEffortPath(heights: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumEffortPath(heights: Array): Int { + + } +}","impl Solution { + pub fn minimum_effort_path(heights: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $heights + * @return Integer + */ + function minimumEffortPath($heights) { + + } +}","function minimumEffortPath(heights: number[][]): number { + +};","(define/contract (minimum-effort-path heights) + (-> (listof (listof exact-integer?)) exact-integer?) + + )",,,, +840,arithmetic-subarrays,Arithmetic Subarrays,1630.0,1752.0,"

A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is the same. More formally, a sequence s is arithmetic if and only if s[i+1] - s[i] == s[1] - s[0] for all valid i.

+ +

For example, these are arithmetic sequences:

+ +
+1, 3, 5, 7, 9
+7, 7, 7, 7
+3, -1, -5, -9
+ +

The following sequence is not arithmetic:

+ +
+1, 1, 2, 5, 7
+ +

You are given an array of n integers, nums, and two arrays of m integers each, l and r, representing the m range queries, where the ith query is the range [l[i], r[i]]. All the arrays are 0-indexed.

+ +

Return a list of boolean elements answer, where answer[i] is true if the subarray nums[l[i]], nums[l[i]+1], ... , nums[r[i]] can be rearranged to form an arithmetic sequence, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,6,5,9,3,7], l = [0,0,2], r = [2,3,5]
+Output: [true,false,true]
+Explanation:
+In the 0th query, the subarray is [4,6,5]. This can be rearranged as [6,5,4], which is an arithmetic sequence.
+In the 1st query, the subarray is [4,6,5,9]. This cannot be rearranged as an arithmetic sequence.
+In the 2nd query, the subarray is [5,9,3,7]. This can be rearranged as [3,5,7,9], which is an arithmetic sequence.
+ +

Example 2:

+ +
+Input: nums = [-12,-9,-3,-12,-6,15,20,-25,-20,-15,-10], l = [0,1,6,4,8,7], r = [4,4,9,7,9,10]
+Output: [false,true,false,false,true,true]
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • m == l.length
    • +
  • m == r.length
    • +
  • 2 <= n <= 500
    • +
  • 1 <= m <= 500
    • +
  • 0 <= l[i] < r[i] < n
    • +
  • -105 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + vector checkArithmeticSubarrays(vector& nums, vector& l, vector& r) { + + } +};","class Solution { + public List checkArithmeticSubarrays(int[] nums, int[] l, int[] r) { + + } +}","class Solution(object): + def checkArithmeticSubarrays(self, nums, l, r): + """""" + :type nums: List[int] + :type l: List[int] + :type r: List[int] + :rtype: List[bool] + """""" + ","class Solution: + def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* checkArithmeticSubarrays(int* nums, int numsSize, int* l, int lSize, int* r, int rSize, int* returnSize){ + +}","public class Solution { + public IList CheckArithmeticSubarrays(int[] nums, int[] l, int[] r) { + + } +}","/** + * @param {number[]} nums + * @param {number[]} l + * @param {number[]} r + * @return {boolean[]} + */ +var checkArithmeticSubarrays = function(nums, l, r) { + +};","# @param {Integer[]} nums +# @param {Integer[]} l +# @param {Integer[]} r +# @return {Boolean[]} +def check_arithmetic_subarrays(nums, l, r) + +end","class Solution { + func checkArithmeticSubarrays(_ nums: [Int], _ l: [Int], _ r: [Int]) -> [Bool] { + + } +}","func checkArithmeticSubarrays(nums []int, l []int, r []int) []bool { + +}","object Solution { + def checkArithmeticSubarrays(nums: Array[Int], l: Array[Int], r: Array[Int]): List[Boolean] = { + + } +}","class Solution { + fun checkArithmeticSubarrays(nums: IntArray, l: IntArray, r: IntArray): List { + + } +}","impl Solution { + pub fn check_arithmetic_subarrays(nums: Vec, l: Vec, r: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[] $l + * @param Integer[] $r + * @return Boolean[] + */ + function checkArithmeticSubarrays($nums, $l, $r) { + + } +}","function checkArithmeticSubarrays(nums: number[], l: number[], r: number[]): boolean[] { + +};","(define/contract (check-arithmetic-subarrays nums l r) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) (listof boolean?)) + + )","-spec check_arithmetic_subarrays(Nums :: [integer()], L :: [integer()], R :: [integer()]) -> [boolean()]. +check_arithmetic_subarrays(Nums, L, R) -> + .","defmodule Solution do + @spec check_arithmetic_subarrays(nums :: [integer], l :: [integer], r :: [integer]) :: [boolean] + def check_arithmetic_subarrays(nums, l, r) do + + end +end","class Solution { + List checkArithmeticSubarrays(List nums, List l, List r) { + + } +}", +843,lexicographically-smallest-string-after-applying-operations,Lexicographically Smallest String After Applying Operations,1625.0,1747.0,"

You are given a string s of even length consisting of digits from 0 to 9, and two integers a and b.

+ +

You can apply either of the following two operations any number of times and in any order on s:

+ +
    +
  • Add a to all odd indices of s (0-indexed). Digits post 9 are cycled back to 0. For example, if s = "3456" and a = 5, s becomes "3951".
    • +
  • Rotate s to the right by b positions. For example, if s = "3456" and b = 1, s becomes "6345".
    • +
+ +

Return the lexicographically smallest string you can obtain by applying the above operations any number of times on s.

+ +

A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b. For example, "0158" is lexicographically smaller than "0190" because the first position they differ is at the third letter, and '5' comes before '9'.

+ +

 

+

Example 1:

+ +
+Input: s = "5525", a = 9, b = 2
+Output: "2050"
+Explanation: We can apply the following operations:
+Start:  "5525"
+Rotate: "2555"
+Add:    "2454"
+Add:    "2353"
+Rotate: "5323"
+Add:    "5222"
+Add:    "5121"
+Rotate: "2151"
+Add:    "2050"​​​​​
+There is no way to obtain a string that is lexicographically smaller than "2050".
+
+ +

Example 2:

+ +
+Input: s = "74", a = 5, b = 1
+Output: "24"
+Explanation: We can apply the following operations:
+Start:  "74"
+Rotate: "47"
+​​​​​​​Add:    "42"
+​​​​​​​Rotate: "24"​​​​​​​​​​​​
+There is no way to obtain a string that is lexicographically smaller than "24".
+
+ +

Example 3:

+ +
+Input: s = "0011", a = 4, b = 2
+Output: "0011"
+Explanation: There are no sequence of operations that will give us a lexicographically smaller string than "0011".
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 100
    • +
  • s.length is even.
    • +
  • s consists of digits from 0 to 9 only.
    • +
  • 1 <= a <= 9
    • +
  • 1 <= b <= s.length - 1
    • +
+",2.0,False,"class Solution { +public: + string findLexSmallestString(string s, int a, int b) { + + } +};","class Solution { + public String findLexSmallestString(String s, int a, int b) { + + } +}","class Solution(object): + def findLexSmallestString(self, s, a, b): + """""" + :type s: str + :type a: int + :type b: int + :rtype: str + """""" + ","class Solution: + def findLexSmallestString(self, s: str, a: int, b: int) -> str: + ","char * findLexSmallestString(char * s, int a, int b){ + +}","public class Solution { + public string FindLexSmallestString(string s, int a, int b) { + + } +}","/** + * @param {string} s + * @param {number} a + * @param {number} b + * @return {string} + */ +var findLexSmallestString = function(s, a, b) { + +};","# @param {String} s +# @param {Integer} a +# @param {Integer} b +# @return {String} +def find_lex_smallest_string(s, a, b) + +end","class Solution { + func findLexSmallestString(_ s: String, _ a: Int, _ b: Int) -> String { + + } +}","func findLexSmallestString(s string, a int, b int) string { + +}","object Solution { + def findLexSmallestString(s: String, a: Int, b: Int): String = { + + } +}","class Solution { + fun findLexSmallestString(s: String, a: Int, b: Int): String { + + } +}","impl Solution { + pub fn find_lex_smallest_string(s: String, a: i32, b: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $a + * @param Integer $b + * @return String + */ + function findLexSmallestString($s, $a, $b) { + + } +}","function findLexSmallestString(s: string, a: number, b: number): string { + +};",,,,"class Solution { + String findLexSmallestString(String s, int a, int b) { + + } +}", +845,number-of-ways-to-form-a-target-string-given-a-dictionary,Number of Ways to Form a Target String Given a Dictionary,1639.0,1744.0,"

You are given a list of strings of the same length words and a string target.

+ +

Your task is to form target using the given words under the following rules:

+ +
    +
  • target should be formed from left to right.
    • +
  • To form the ith character (0-indexed) of target, you can choose the kth character of the jth string in words if target[i] = words[j][k].
    • +
  • Once you use the kth character of the jth string of words, you can no longer use the xth character of any string in words where x <= k. In other words, all characters to the left of or at index k become unusuable for every string.
    • +
  • Repeat the process until you form the string target.
    • +
+ +

Notice that you can use multiple characters from the same string in words provided the conditions above are met.

+ +

Return the number of ways to form target from words. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: words = ["acca","bbbb","caca"], target = "aba"
+Output: 6
+Explanation: There are 6 ways to form target.
+"aba" -> index 0 ("acca"), index 1 ("bbbb"), index 3 ("caca")
+"aba" -> index 0 ("acca"), index 2 ("bbbb"), index 3 ("caca")
+"aba" -> index 0 ("acca"), index 1 ("bbbb"), index 3 ("acca")
+"aba" -> index 0 ("acca"), index 2 ("bbbb"), index 3 ("acca")
+"aba" -> index 1 ("caca"), index 2 ("bbbb"), index 3 ("acca")
+"aba" -> index 1 ("caca"), index 2 ("bbbb"), index 3 ("caca")
+
+ +

Example 2:

+ +
+Input: words = ["abba","baab"], target = "bab"
+Output: 4
+Explanation: There are 4 ways to form target.
+"bab" -> index 0 ("baab"), index 1 ("baab"), index 2 ("abba")
+"bab" -> index 0 ("baab"), index 1 ("baab"), index 3 ("baab")
+"bab" -> index 0 ("baab"), index 2 ("baab"), index 3 ("baab")
+"bab" -> index 1 ("abba"), index 2 ("baab"), index 3 ("baab")
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 1000
    • +
  • 1 <= words[i].length <= 1000
    • +
  • All strings in words have the same length.
    • +
  • 1 <= target.length <= 1000
    • +
  • words[i] and target contain only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int numWays(vector& words, string target) { + + } +};","class Solution { + public int numWays(String[] words, String target) { + + } +}","class Solution(object): + def numWays(self, words, target): + """""" + :type words: List[str] + :type target: str + :rtype: int + """""" + ","class Solution: + def numWays(self, words: List[str], target: str) -> int: + ","int numWays(char ** words, int wordsSize, char * target){ + +}","public class Solution { + public int NumWays(string[] words, string target) { + + } +}","/** + * @param {string[]} words + * @param {string} target + * @return {number} + */ +var numWays = function(words, target) { + +};","# @param {String[]} words +# @param {String} target +# @return {Integer} +def num_ways(words, target) + +end","class Solution { + func numWays(_ words: [String], _ target: String) -> Int { + + } +}","func numWays(words []string, target string) int { + +}","object Solution { + def numWays(words: Array[String], target: String): Int = { + + } +}","class Solution { + fun numWays(words: Array, target: String): Int { + + } +}","impl Solution { + pub fn num_ways(words: Vec, target: String) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String $target + * @return Integer + */ + function numWays($words, $target) { + + } +}","function numWays(words: string[], target: string): number { + +};","(define/contract (num-ways words target) + (-> (listof string?) string? exact-integer?) + + )","-spec num_ways(Words :: [unicode:unicode_binary()], Target :: unicode:unicode_binary()) -> integer(). +num_ways(Words, Target) -> + .","defmodule Solution do + @spec num_ways(words :: [String.t], target :: String.t) :: integer + def num_ways(words, target) do + + end +end","class Solution { + int numWays(List words, String target) { + + } +}", +847,widest-vertical-area-between-two-points-containing-no-points,Widest Vertical Area Between Two Points Containing No Points,1637.0,1742.0,"

Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area.

+ +

A vertical area is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width.

+ +

Note that points on the edge of a vertical area are not considered included in the area.

+ +

 

+

Example 1:

+​ +
+Input: points = [[8,7],[9,9],[7,4],[9,7]]
+Output: 1
+Explanation: Both the red and the blue area are optimal.
+
+ +

Example 2:

+ +
+Input: points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • n == points.length
    • +
  • 2 <= n <= 105
    • +
  • points[i].length == 2
    • +
  • 0 <= xi, yi <= 109
    • +
+",2.0,False,"class Solution { +public: + int maxWidthOfVerticalArea(vector>& points) { + + } +};","class Solution { + public int maxWidthOfVerticalArea(int[][] points) { + + } +}","class Solution(object): + def maxWidthOfVerticalArea(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int: + ","int maxWidthOfVerticalArea(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int MaxWidthOfVerticalArea(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var maxWidthOfVerticalArea = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def max_width_of_vertical_area(points) + +end","class Solution { + func maxWidthOfVerticalArea(_ points: [[Int]]) -> Int { + + } +}","func maxWidthOfVerticalArea(points [][]int) int { + +}","object Solution { + def maxWidthOfVerticalArea(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxWidthOfVerticalArea(points: Array): Int { + + } +}","impl Solution { + pub fn max_width_of_vertical_area(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function maxWidthOfVerticalArea($points) { + + } +}","function maxWidthOfVerticalArea(points: number[][]): number { + +};","(define/contract (max-width-of-vertical-area points) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_width_of_vertical_area(Points :: [[integer()]]) -> integer(). +max_width_of_vertical_area(Points) -> + .","defmodule Solution do + @spec max_width_of_vertical_area(points :: [[integer]]) :: integer + def max_width_of_vertical_area(points) do + + end +end","class Solution { + int maxWidthOfVerticalArea(List> points) { + + } +}", +849,count-subtrees-with-max-distance-between-cities,Count Subtrees With Max Distance Between Cities,1617.0,1740.0,"

There are n cities numbered from 1 to n. You are given an array edges of size n-1, where edges[i] = [ui, vi] represents a bidirectional edge between cities ui and vi. There exists a unique path between each pair of cities. In other words, the cities form a tree.

+ +

A subtree is a subset of cities where every city is reachable from every other city in the subset, where the path between each pair passes through only the cities from the subset. Two subtrees are different if there is a city in one subtree that is not present in the other.

+ +

For each d from 1 to n-1, find the number of subtrees in which the maximum distance between any two cities in the subtree is equal to d.

+ +

Return an array of size n-1 where the dth element (1-indexed) is the number of subtrees in which the maximum distance between any two cities is equal to d.

+ +

Notice that the distance between the two cities is the number of edges in the path between them.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 4, edges = [[1,2],[2,3],[2,4]]
+Output: [3,4,0]
+Explanation:
+The subtrees with subsets {1,2}, {2,3} and {2,4} have a max distance of 1.
+The subtrees with subsets {1,2,3}, {1,2,4}, {2,3,4} and {1,2,3,4} have a max distance of 2.
+No subtree has two nodes where the max distance between them is 3.
+
+ +

Example 2:

+ +
+Input: n = 2, edges = [[1,2]]
+Output: [1]
+
+ +

Example 3:

+ +
+Input: n = 3, edges = [[1,2],[2,3]]
+Output: [2,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 15
    • +
  • edges.length == n-1
    • +
  • edges[i].length == 2
    • +
  • 1 <= ui, vi <= n
    • +
  • All pairs (ui, vi) are distinct.
    • +
",3.0,False,"class Solution { +public: + vector countSubgraphsForEachDiameter(int n, vector>& edges) { + + } +};","class Solution { + public int[] countSubgraphsForEachDiameter(int n, int[][] edges) { + + } +}","class Solution(object): + def countSubgraphsForEachDiameter(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def countSubgraphsForEachDiameter(self, n: int, edges: List[List[int]]) -> List[int]: + "," + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countSubgraphsForEachDiameter(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public int[] CountSubgraphsForEachDiameter(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var countSubgraphsForEachDiameter = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer[]} +def count_subgraphs_for_each_diameter(n, edges) + +end","class Solution { + func countSubgraphsForEachDiameter(_ n: Int, _ edges: [[Int]]) -> [Int] { + + } +}","func countSubgraphsForEachDiameter(n int, edges [][]int) []int { + +}","object Solution { + def countSubgraphsForEachDiameter(n: Int, edges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun countSubgraphsForEachDiameter(n: Int, edges: Array): IntArray { + + } +}","impl Solution { + pub fn count_subgraphs_for_each_diameter(n: i32, edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer[] + */ + function countSubgraphsForEachDiameter($n, $edges) { + + } +}","function countSubgraphsForEachDiameter(n: number, edges: number[][]): number[] { + +};",,,,, +850,split-two-strings-to-make-palindrome,Split Two Strings to Make Palindrome,1616.0,1739.0,"

You are given two strings a and b of the same length. Choose an index and split both strings at the same index, splitting a into two strings: aprefix and asuffix where a = aprefix + asuffix, and splitting b into two strings: bprefix and bsuffix where b = bprefix + bsuffix. Check if aprefix + bsuffix or bprefix + asuffix forms a palindrome.

+ +

When you split a string s into sprefix and ssuffix, either ssuffix or sprefix is allowed to be empty. For example, if s = "abc", then "" + "abc", "a" + "bc", "ab" + "c" , and "abc" + "" are valid splits.

+ +

Return true if it is possible to form a palindrome string, otherwise return false.

+ +

Notice that x + y denotes the concatenation of strings x and y.

+ +

 

+

Example 1:

+ +
+Input: a = "x", b = "y"
+Output: true
+Explaination: If either a or b are palindromes the answer is true since you can split in the following way:
+aprefix = "", asuffix = "x"
+bprefix = "", bsuffix = "y"
+Then, aprefix + bsuffix = "" + "y" = "y", which is a palindrome.
+
+ +

Example 2:

+ +
+Input: a = "xbdef", b = "xecab"
+Output: false
+
+ +

Example 3:

+ +
+Input: a = "ulacfd", b = "jizalu"
+Output: true
+Explaination: Split them at index 3:
+aprefix = "ula", asuffix = "cfd"
+bprefix = "jiz", bsuffix = "alu"
+Then, aprefix + bsuffix = "ula" + "alu" = "ulaalu", which is a palindrome.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a.length, b.length <= 105
    • +
  • a.length == b.length
    • +
  • a and b consist of lowercase English letters
    • +
+",2.0,False,"class Solution { +public: + bool checkPalindromeFormation(string a, string b) { + + } +};","class Solution { + public boolean checkPalindromeFormation(String a, String b) { + + } +}","class Solution(object): + def checkPalindromeFormation(self, a, b): + """""" + :type a: str + :type b: str + :rtype: bool + """""" + ","class Solution: + def checkPalindromeFormation(self, a: str, b: str) -> bool: + ","bool checkPalindromeFormation(char * a, char * b){ + +}","public class Solution { + public bool CheckPalindromeFormation(string a, string b) { + + } +}","/** + * @param {string} a + * @param {string} b + * @return {boolean} + */ +var checkPalindromeFormation = function(a, b) { + +};","# @param {String} a +# @param {String} b +# @return {Boolean} +def check_palindrome_formation(a, b) + +end","class Solution { + func checkPalindromeFormation(_ a: String, _ b: String) -> Bool { + + } +}","func checkPalindromeFormation(a string, b string) bool { + +}","object Solution { + def checkPalindromeFormation(a: String, b: String): Boolean = { + + } +}","class Solution { + fun checkPalindromeFormation(a: String, b: String): Boolean { + + } +}","impl Solution { + pub fn check_palindrome_formation(a: String, b: String) -> bool { + + } +}","class Solution { + + /** + * @param String $a + * @param String $b + * @return Boolean + */ + function checkPalindromeFormation($a, $b) { + + } +}","function checkPalindromeFormation(a: string, b: string): boolean { + +};","(define/contract (check-palindrome-formation a b) + (-> string? string? boolean?) + + )","-spec check_palindrome_formation(A :: unicode:unicode_binary(), B :: unicode:unicode_binary()) -> boolean(). +check_palindrome_formation(A, B) -> + .","defmodule Solution do + @spec check_palindrome_formation(a :: String.t, b :: String.t) :: boolean + def check_palindrome_formation(a, b) do + + end +end","class Solution { + bool checkPalindromeFormation(String a, String b) { + + } +}", +851,maximal-network-rank,Maximal Network Rank,1615.0,1738.0,"

There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road between cities ai and bi.

+ +

The network rank of two different cities is defined as the total number of directly connected roads to either city. If a road is directly connected to both cities, it is only counted once.

+ +

The maximal network rank of the infrastructure is the maximum network rank of all pairs of different cities.

+ +

Given the integer n and the array roads, return the maximal network rank of the entire infrastructure.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 4, roads = [[0,1],[0,3],[1,2],[1,3]]
+Output: 4
+Explanation: The network rank of cities 0 and 1 is 4 as there are 4 roads that are connected to either 0 or 1. The road between 0 and 1 is only counted once.
+
+ +

Example 2:

+ +

+ +
+Input: n = 5, roads = [[0,1],[0,3],[1,2],[1,3],[2,3],[2,4]]
+Output: 5
+Explanation: There are 5 roads that are connected to cities 1 or 2.
+
+ +

Example 3:

+ +
+Input: n = 8, roads = [[0,1],[1,2],[2,3],[2,4],[5,6],[5,7]]
+Output: 5
+Explanation: The network rank of 2 and 5 is 5. Notice that all the cities do not have to be connected.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 100
    • +
  • 0 <= roads.length <= n * (n - 1) / 2
    • +
  • roads[i].length == 2
    • +
  • 0 <= ai, bi <= n-1
    • +
  • ai != bi
    • +
  • Each pair of cities has at most one road connecting them.
    • +
+",2.0,False,"class Solution { +public: + int maximalNetworkRank(int n, vector>& roads) { + + } +};","class Solution { + public int maximalNetworkRank(int n, int[][] roads) { + + } +}","class Solution(object): + def maximalNetworkRank(self, n, roads): + """""" + :type n: int + :type roads: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximalNetworkRank(self, n: int, roads: List[List[int]]) -> int: + ","int maximalNetworkRank(int n, int** roads, int roadsSize, int* roadsColSize){ + +}","public class Solution { + public int MaximalNetworkRank(int n, int[][] roads) { + + } +}","/** + * @param {number} n + * @param {number[][]} roads + * @return {number} + */ +var maximalNetworkRank = function(n, roads) { + +};","# @param {Integer} n +# @param {Integer[][]} roads +# @return {Integer} +def maximal_network_rank(n, roads) + +end","class Solution { + func maximalNetworkRank(_ n: Int, _ roads: [[Int]]) -> Int { + + } +}","func maximalNetworkRank(n int, roads [][]int) int { + +}","object Solution { + def maximalNetworkRank(n: Int, roads: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximalNetworkRank(n: Int, roads: Array): Int { + + } +}","impl Solution { + pub fn maximal_network_rank(n: i32, roads: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $roads + * @return Integer + */ + function maximalNetworkRank($n, $roads) { + + } +}","function maximalNetworkRank(n: number, roads: number[][]): number { + +};","(define/contract (maximal-network-rank n roads) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximal_network_rank(N :: integer(), Roads :: [[integer()]]) -> integer(). +maximal_network_rank(N, Roads) -> + .","defmodule Solution do + @spec maximal_network_rank(n :: integer, roads :: [[integer]]) :: integer + def maximal_network_rank(n, roads) do + + end +end","class Solution { + int maximalNetworkRank(int n, List> roads) { + + } +}", +852,maximum-nesting-depth-of-the-parentheses,Maximum Nesting Depth of the Parentheses,1614.0,1737.0,"

A string is a valid parentheses string (denoted VPS) if it meets one of the following:

+ +
    +
  • It is an empty string "", or a single character not equal to "(" or ")",
    • +
  • It can be written as AB (A concatenated with B), where A and B are VPS's, or
    • +
  • It can be written as (A), where A is a VPS.
    • +
+ +

We can similarly define the nesting depth depth(S) of any VPS S as follows:

+ +
    +
  • depth("") = 0
    • +
  • depth(C) = 0, where C is a string with a single character not equal to "(" or ")".
    • +
  • depth(A + B) = max(depth(A), depth(B)), where A and B are VPS's.
    • +
  • depth("(" + A + ")") = 1 + depth(A), where A is a VPS.
    • +
+ +

For example, "", "()()", and "()(()())" are VPS's (with nesting depths 0, 1, and 2), and ")(" and "(()" are not VPS's.

+ +

Given a VPS represented as string s, return the nesting depth of s.

+ +

 

+

Example 1:

+ +
+Input: s = "(1+(2*3)+((8)/4))+1"
+Output: 3
+Explanation: Digit 8 is inside of 3 nested parentheses in the string.
+
+ +

Example 2:

+ +
+Input: s = "(1)+((2))+(((3)))"
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 100
    • +
  • s consists of digits 0-9 and characters '+', '-', '*', '/', '(', and ')'.
    • +
  • It is guaranteed that parentheses expression s is a VPS.
    • +
+",1.0,False,"class Solution { +public: + int maxDepth(string s) { + + } +};","class Solution { + public int maxDepth(String s) { + + } +}","class Solution(object): + def maxDepth(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def maxDepth(self, s: str) -> int: + ","int maxDepth(char * s){ + +}","public class Solution { + public int MaxDepth(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var maxDepth = function(s) { + +};","# @param {String} s +# @return {Integer} +def max_depth(s) + +end","class Solution { + func maxDepth(_ s: String) -> Int { + + } +}","func maxDepth(s string) int { + +}","object Solution { + def maxDepth(s: String): Int = { + + } +}","class Solution { + fun maxDepth(s: String): Int { + + } +}","impl Solution { + pub fn max_depth(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function maxDepth($s) { + + } +}","function maxDepth(s: string): number { + +};","(define/contract (max-depth s) + (-> string? exact-integer?) + + )","-spec max_depth(S :: unicode:unicode_binary()) -> integer(). +max_depth(S) -> + .","defmodule Solution do + @spec max_depth(s :: String.t) :: integer + def max_depth(s) do + + end +end","class Solution { + int maxDepth(String s) { + + } +}", +853,maximum-number-of-visible-points,Maximum Number of Visible Points,1610.0,1733.0,"

You are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on the X-Y plane.

+ +

Initially, you are facing directly east from your position. You cannot move from your position, but you can rotate. In other words, posx and posy cannot be changed. Your field of view in degrees is represented by angle, determining how wide you can see from any given view direction. Let d be the amount in degrees that you rotate counterclockwise. Then, your field of view is the inclusive range of angles [d - angle/2, d + angle/2].

+ +

+ +

+ +

You can see some set of points if, for each point, the angle formed by the point, your position, and the immediate east direction from your position is in your field of view.

+ +

There can be multiple points at one coordinate. There may be points at your location, and you can always see these points regardless of your rotation. Points do not obstruct your vision to other points.

+ +

Return the maximum number of points you can see.

+ +

 

+

Example 1:

+ +
+Input: points = [[2,1],[2,2],[3,3]], angle = 90, location = [1,1]
+Output: 3
+Explanation: The shaded region represents your field of view. All points can be made visible in your field of view, including [3,3] even though [2,2] is in front and in the same line of sight.
+
+ +

Example 2:

+ +
+Input: points = [[2,1],[2,2],[3,4],[1,1]], angle = 90, location = [1,1]
+Output: 4
+Explanation: All points can be made visible in your field of view, including the one at your location.
+
+ +

Example 3:

+ +
+Input: points = [[1,0],[2,1]], angle = 13, location = [1,1]
+Output: 1
+Explanation: You can only see one of the two points, as shown above.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= points.length <= 105
    • +
  • points[i].length == 2
    • +
  • location.length == 2
    • +
  • 0 <= angle < 360
    • +
  • 0 <= posx, posy, xi, yi <= 100
    • +
+",3.0,False,"class Solution { +public: + int visiblePoints(vector>& points, int angle, vector& location) { + + } +};","class Solution { + public int visiblePoints(List> points, int angle, List location) { + + } +}","class Solution(object): + def visiblePoints(self, points, angle, location): + """""" + :type points: List[List[int]] + :type angle: int + :type location: List[int] + :rtype: int + """""" + ","class Solution: + def visiblePoints(self, points: List[List[int]], angle: int, location: List[int]) -> int: + ","int visiblePoints(int** points, int pointsSize, int* pointsColSize, int angle, int* location, int locationSize){ + +}","public class Solution { + public int VisiblePoints(IList> points, int angle, IList location) { + + } +}","/** + * @param {number[][]} points + * @param {number} angle + * @param {number[]} location + * @return {number} + */ +var visiblePoints = function(points, angle, location) { + +};","# @param {Integer[][]} points +# @param {Integer} angle +# @param {Integer[]} location +# @return {Integer} +def visible_points(points, angle, location) + +end","class Solution { + func visiblePoints(_ points: [[Int]], _ angle: Int, _ location: [Int]) -> Int { + + } +}","func visiblePoints(points [][]int, angle int, location []int) int { + +}","object Solution { + def visiblePoints(points: List[List[Int]], angle: Int, location: List[Int]): Int = { + + } +}","class Solution { + fun visiblePoints(points: List>, angle: Int, location: List): Int { + + } +}","impl Solution { + pub fn visible_points(points: Vec>, angle: i32, location: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @param Integer $angle + * @param Integer[] $location + * @return Integer + */ + function visiblePoints($points, $angle, $location) { + + } +}","function visiblePoints(points: number[][], angle: number, location: number[]): number { + +};","(define/contract (visible-points points angle location) + (-> (listof (listof exact-integer?)) exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec visible_points(Points :: [[integer()]], Angle :: integer(), Location :: [integer()]) -> integer(). +visible_points(Points, Angle, Location) -> + .","defmodule Solution do + @spec visible_points(points :: [[integer]], angle :: integer, location :: [integer]) :: integer + def visible_points(points, angle, location) do + + end +end","class Solution { + int visiblePoints(List> points, int angle, List location) { + + } +}", +854,minimum-one-bit-operations-to-make-integers-zero,Minimum One Bit Operations to Make Integers Zero,1611.0,1732.0,"

Given an integer n, you must transform it into 0 using the following operations any number of times:

+ +
    +
  • Change the rightmost (0th) bit in the binary representation of n.
    • +
  • Change the ith bit in the binary representation of n if the (i-1)th bit is set to 1 and the (i-2)th through 0th bits are set to 0.
    • +
+ +

Return the minimum number of operations to transform n into 0.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 2
+Explanation: The binary representation of 3 is "11".
+"11" -> "01" with the 2nd operation since the 0th bit is 1.
+"01" -> "00" with the 1st operation.
+
+ +

Example 2:

+ +
+Input: n = 6
+Output: 4
+Explanation: The binary representation of 6 is "110".
+"110" -> "010" with the 2nd operation since the 1st bit is 1 and 0th through 0th bits are 0.
+"010" -> "011" with the 1st operation.
+"011" -> "001" with the 2nd operation since the 0th bit is 1.
+"001" -> "000" with the 1st operation.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int minimumOneBitOperations(int n) { + + } +};","class Solution { + public int minimumOneBitOperations(int n) { + + } +}","class Solution(object): + def minimumOneBitOperations(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def minimumOneBitOperations(self, n: int) -> int: + ","int minimumOneBitOperations(int n){ + +}","public class Solution { + public int MinimumOneBitOperations(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var minimumOneBitOperations = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def minimum_one_bit_operations(n) + +end","class Solution { + func minimumOneBitOperations(_ n: Int) -> Int { + + } +}","func minimumOneBitOperations(n int) int { + +}","object Solution { + def minimumOneBitOperations(n: Int): Int = { + + } +}","class Solution { + fun minimumOneBitOperations(n: Int): Int { + + } +}","impl Solution { + pub fn minimum_one_bit_operations(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function minimumOneBitOperations($n) { + + } +}","function minimumOneBitOperations(n: number): number { + +};","(define/contract (minimum-one-bit-operations n) + (-> exact-integer? exact-integer?) + + )","-spec minimum_one_bit_operations(N :: integer()) -> integer(). +minimum_one_bit_operations(N) -> + .","defmodule Solution do + @spec minimum_one_bit_operations(n :: integer) :: integer + def minimum_one_bit_operations(n) do + + end +end","class Solution { + int minimumOneBitOperations(int n) { + + } +}", +855,even-odd-tree,Even Odd Tree,1609.0,1731.0,"

A binary tree is named Even-Odd if it meets the following conditions:

+ +
    +
  • The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc.
    • +
  • For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
    • +
  • For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
    • +
+ +

Given the root of a binary tree, return true if the binary tree is Even-Odd, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: root = [1,10,4,3,null,7,9,12,8,6,null,null,2]
+Output: true
+Explanation: The node values on each level are:
+Level 0: [1]
+Level 1: [10,4]
+Level 2: [3,7,9]
+Level 3: [12,8,6,2]
+Since levels 0 and 2 are all odd and increasing and levels 1 and 3 are all even and decreasing, the tree is Even-Odd.
+
+ +

Example 2:

+ +
+Input: root = [5,4,2,3,3,7]
+Output: false
+Explanation: The node values on each level are:
+Level 0: [5]
+Level 1: [4,2]
+Level 2: [3,3,7]
+Node values in level 2 must be in strictly increasing order, so the tree is not Even-Odd.
+
+ +

Example 3:

+ +
+Input: root = [5,9,1,3,5,7]
+Output: false
+Explanation: Node values in the level 1 should be even integers.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 105].
    • +
  • 1 <= Node.val <= 106
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isEvenOddTree(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isEvenOddTree(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isEvenOddTree(self, root): + """""" + :type root: TreeNode + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isEvenOddTree(self, root: Optional[TreeNode]) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isEvenOddTree(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsEvenOddTree(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {boolean} + */ +var isEvenOddTree = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Boolean} +def is_even_odd_tree(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isEvenOddTree(_ root: TreeNode?) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isEvenOddTree(root *TreeNode) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isEvenOddTree(root: TreeNode): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isEvenOddTree(root: TreeNode?): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_even_odd_tree(root: Option>>) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Boolean + */ + function isEvenOddTree($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isEvenOddTree(root: TreeNode | null): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-even-odd-tree root) + (-> (or/c tree-node? #f) boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_even_odd_tree(Root :: #tree_node{} | null) -> boolean(). +is_even_odd_tree(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_even_odd_tree(root :: TreeNode.t | nil) :: boolean + def is_even_odd_tree(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isEvenOddTree(TreeNode? root) { + + } +}", +857,fancy-sequence,Fancy Sequence,1622.0,1728.0,"

Write an API that generates fancy sequences using the append, addAll, and multAll operations.

+ +

Implement the Fancy class:

+ +
    +
  • Fancy() Initializes the object with an empty sequence.
    • +
  • void append(val) Appends an integer val to the end of the sequence.
    • +
  • void addAll(inc) Increments all existing values in the sequence by an integer inc.
    • +
  • void multAll(m) Multiplies all existing values in the sequence by an integer m.
    • +
  • int getIndex(idx) Gets the current value at index idx (0-indexed) of the sequence modulo 109 + 7. If the index is greater or equal than the length of the sequence, return -1.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Fancy", "append", "addAll", "append", "multAll", "getIndex", "addAll", "append", "multAll", "getIndex", "getIndex", "getIndex"]
+[[], [2], [3], [7], [2], [0], [3], [10], [2], [0], [1], [2]]
+Output
+[null, null, null, null, null, 10, null, null, null, 26, 34, 20]
+
+Explanation
+Fancy fancy = new Fancy();
+fancy.append(2);   // fancy sequence: [2]
+fancy.addAll(3);   // fancy sequence: [2+3] -> [5]
+fancy.append(7);   // fancy sequence: [5, 7]
+fancy.multAll(2);  // fancy sequence: [5*2, 7*2] -> [10, 14]
+fancy.getIndex(0); // return 10
+fancy.addAll(3);   // fancy sequence: [10+3, 14+3] -> [13, 17]
+fancy.append(10);  // fancy sequence: [13, 17, 10]
+fancy.multAll(2);  // fancy sequence: [13*2, 17*2, 10*2] -> [26, 34, 20]
+fancy.getIndex(0); // return 26
+fancy.getIndex(1); // return 34
+fancy.getIndex(2); // return 20
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= val, inc, m <= 100
    • +
  • 0 <= idx <= 105
    • +
  • At most 105 calls total will be made to append, addAll, multAll, and getIndex.
    • +
+",3.0,False,"class Fancy { +public: + Fancy() { + + } + + void append(int val) { + + } + + void addAll(int inc) { + + } + + void multAll(int m) { + + } + + int getIndex(int idx) { + + } +}; + +/** + * Your Fancy object will be instantiated and called as such: + * Fancy* obj = new Fancy(); + * obj->append(val); + * obj->addAll(inc); + * obj->multAll(m); + * int param_4 = obj->getIndex(idx); + */","class Fancy { + + public Fancy() { + + } + + public void append(int val) { + + } + + public void addAll(int inc) { + + } + + public void multAll(int m) { + + } + + public int getIndex(int idx) { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * Fancy obj = new Fancy(); + * obj.append(val); + * obj.addAll(inc); + * obj.multAll(m); + * int param_4 = obj.getIndex(idx); + */","class Fancy(object): + + def __init__(self): + + + def append(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def addAll(self, inc): + """""" + :type inc: int + :rtype: None + """""" + + + def multAll(self, m): + """""" + :type m: int + :rtype: None + """""" + + + def getIndex(self, idx): + """""" + :type idx: int + :rtype: int + """""" + + + +# Your Fancy object will be instantiated and called as such: +# obj = Fancy() +# obj.append(val) +# obj.addAll(inc) +# obj.multAll(m) +# param_4 = obj.getIndex(idx)","class Fancy: + + def __init__(self): + + + def append(self, val: int) -> None: + + + def addAll(self, inc: int) -> None: + + + def multAll(self, m: int) -> None: + + + def getIndex(self, idx: int) -> int: + + + +# Your Fancy object will be instantiated and called as such: +# obj = Fancy() +# obj.append(val) +# obj.addAll(inc) +# obj.multAll(m) +# param_4 = obj.getIndex(idx)"," + + +typedef struct { + +} Fancy; + + +Fancy* fancyCreate() { + +} + +void fancyAppend(Fancy* obj, int val) { + +} + +void fancyAddAll(Fancy* obj, int inc) { + +} + +void fancyMultAll(Fancy* obj, int m) { + +} + +int fancyGetIndex(Fancy* obj, int idx) { + +} + +void fancyFree(Fancy* obj) { + +} + +/** + * Your Fancy struct will be instantiated and called as such: + * Fancy* obj = fancyCreate(); + * fancyAppend(obj, val); + + * fancyAddAll(obj, inc); + + * fancyMultAll(obj, m); + + * int param_4 = fancyGetIndex(obj, idx); + + * fancyFree(obj); +*/","public class Fancy { + + public Fancy() { + + } + + public void Append(int val) { + + } + + public void AddAll(int inc) { + + } + + public void MultAll(int m) { + + } + + public int GetIndex(int idx) { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * Fancy obj = new Fancy(); + * obj.Append(val); + * obj.AddAll(inc); + * obj.MultAll(m); + * int param_4 = obj.GetIndex(idx); + */"," +var Fancy = function() { + +}; + +/** + * @param {number} val + * @return {void} + */ +Fancy.prototype.append = function(val) { + +}; + +/** + * @param {number} inc + * @return {void} + */ +Fancy.prototype.addAll = function(inc) { + +}; + +/** + * @param {number} m + * @return {void} + */ +Fancy.prototype.multAll = function(m) { + +}; + +/** + * @param {number} idx + * @return {number} + */ +Fancy.prototype.getIndex = function(idx) { + +}; + +/** + * Your Fancy object will be instantiated and called as such: + * var obj = new Fancy() + * obj.append(val) + * obj.addAll(inc) + * obj.multAll(m) + * var param_4 = obj.getIndex(idx) + */","class Fancy + def initialize() + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def append(val) + + end + + +=begin + :type inc: Integer + :rtype: Void +=end + def add_all(inc) + + end + + +=begin + :type m: Integer + :rtype: Void +=end + def mult_all(m) + + end + + +=begin + :type idx: Integer + :rtype: Integer +=end + def get_index(idx) + + end + + +end + +# Your Fancy object will be instantiated and called as such: +# obj = Fancy.new() +# obj.append(val) +# obj.add_all(inc) +# obj.mult_all(m) +# param_4 = obj.get_index(idx)"," +class Fancy { + + init() { + + } + + func append(_ val: Int) { + + } + + func addAll(_ inc: Int) { + + } + + func multAll(_ m: Int) { + + } + + func getIndex(_ idx: Int) -> Int { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * let obj = Fancy() + * obj.append(val) + * obj.addAll(inc) + * obj.multAll(m) + * let ret_4: Int = obj.getIndex(idx) + */","type Fancy struct { + +} + + +func Constructor() Fancy { + +} + + +func (this *Fancy) Append(val int) { + +} + + +func (this *Fancy) AddAll(inc int) { + +} + + +func (this *Fancy) MultAll(m int) { + +} + + +func (this *Fancy) GetIndex(idx int) int { + +} + + +/** + * Your Fancy object will be instantiated and called as such: + * obj := Constructor(); + * obj.Append(val); + * obj.AddAll(inc); + * obj.MultAll(m); + * param_4 := obj.GetIndex(idx); + */","class Fancy() { + + def append(`val`: Int) { + + } + + def addAll(inc: Int) { + + } + + def multAll(m: Int) { + + } + + def getIndex(idx: Int): Int = { + + } + +} + +/** + * Your Fancy object will be instantiated and called as such: + * var obj = new Fancy() + * obj.append(`val`) + * obj.addAll(inc) + * obj.multAll(m) + * var param_4 = obj.getIndex(idx) + */","class Fancy() { + + fun append(`val`: Int) { + + } + + fun addAll(inc: Int) { + + } + + fun multAll(m: Int) { + + } + + fun getIndex(idx: Int): Int { + + } + +} + +/** + * Your Fancy object will be instantiated and called as such: + * var obj = Fancy() + * obj.append(`val`) + * obj.addAll(inc) + * obj.multAll(m) + * var param_4 = obj.getIndex(idx) + */","struct Fancy { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Fancy { + + fn new() -> Self { + + } + + fn append(&self, val: i32) { + + } + + fn add_all(&self, inc: i32) { + + } + + fn mult_all(&self, m: i32) { + + } + + fn get_index(&self, idx: i32) -> i32 { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * let obj = Fancy::new(); + * obj.append(val); + * obj.add_all(inc); + * obj.mult_all(m); + * let ret_4: i32 = obj.get_index(idx); + */","class Fancy { + /** + */ + function __construct() { + + } + + /** + * @param Integer $val + * @return NULL + */ + function append($val) { + + } + + /** + * @param Integer $inc + * @return NULL + */ + function addAll($inc) { + + } + + /** + * @param Integer $m + * @return NULL + */ + function multAll($m) { + + } + + /** + * @param Integer $idx + * @return Integer + */ + function getIndex($idx) { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * $obj = Fancy(); + * $obj->append($val); + * $obj->addAll($inc); + * $obj->multAll($m); + * $ret_4 = $obj->getIndex($idx); + */","class Fancy { + constructor() { + + } + + append(val: number): void { + + } + + addAll(inc: number): void { + + } + + multAll(m: number): void { + + } + + getIndex(idx: number): number { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * var obj = new Fancy() + * obj.append(val) + * obj.addAll(inc) + * obj.multAll(m) + * var param_4 = obj.getIndex(idx) + */","(define fancy% + (class object% + (super-new) + (init-field) + + ; append : exact-integer? -> void? + (define/public (append val) + + ) + ; add-all : exact-integer? -> void? + (define/public (add-all inc) + + ) + ; mult-all : exact-integer? -> void? + (define/public (mult-all m) + + ) + ; get-index : exact-integer? -> exact-integer? + (define/public (get-index idx) + + ))) + +;; Your fancy% object will be instantiated and called as such: +;; (define obj (new fancy%)) +;; (send obj append val) +;; (send obj add-all inc) +;; (send obj mult-all m) +;; (define param_4 (send obj get-index idx))","-spec fancy_init_() -> any(). +fancy_init_() -> + . + +-spec fancy_append(Val :: integer()) -> any(). +fancy_append(Val) -> + . + +-spec fancy_add_all(Inc :: integer()) -> any(). +fancy_add_all(Inc) -> + . + +-spec fancy_mult_all(M :: integer()) -> any(). +fancy_mult_all(M) -> + . + +-spec fancy_get_index(Idx :: integer()) -> integer(). +fancy_get_index(Idx) -> + . + + +%% Your functions will be called as such: +%% fancy_init_(), +%% fancy_append(Val), +%% fancy_add_all(Inc), +%% fancy_mult_all(M), +%% Param_4 = fancy_get_index(Idx), + +%% fancy_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Fancy do + @spec init_() :: any + def init_() do + + end + + @spec append(val :: integer) :: any + def append(val) do + + end + + @spec add_all(inc :: integer) :: any + def add_all(inc) do + + end + + @spec mult_all(m :: integer) :: any + def mult_all(m) do + + end + + @spec get_index(idx :: integer) :: integer + def get_index(idx) do + + end +end + +# Your functions will be called as such: +# Fancy.init_() +# Fancy.append(val) +# Fancy.add_all(inc) +# Fancy.mult_all(m) +# param_4 = Fancy.get_index(idx) + +# Fancy.init_ will be called before every test case, in which you can do some necessary initializations.","class Fancy { + + Fancy() { + + } + + void append(int val) { + + } + + void addAll(int inc) { + + } + + void multAll(int m) { + + } + + int getIndex(int idx) { + + } +} + +/** + * Your Fancy object will be instantiated and called as such: + * Fancy obj = Fancy(); + * obj.append(val); + * obj.addAll(inc); + * obj.multAll(m); + * int param4 = obj.getIndex(idx); + */", +858,cat-and-mouse-ii,Cat and Mouse II,1728.0,1727.0,"

A game is played by a cat and a mouse named Cat and Mouse.

+ +

The environment is represented by a grid of size rows x cols, where each element is a wall, floor, player (Cat, Mouse), or food.

+ +
    +
  • Players are represented by the characters 'C'(Cat),'M'(Mouse).
    • +
  • Floors are represented by the character '.' and can be walked on.
    • +
  • Walls are represented by the character '#' and cannot be walked on.
    • +
  • Food is represented by the character 'F' and can be walked on.
    • +
  • There is only one of each character 'C', 'M', and 'F' in grid.
    • +
+ +

Mouse and Cat play according to the following rules:

+ +
    +
  • Mouse moves first, then they take turns to move.
    • +
  • During each turn, Cat and Mouse can jump in one of the four directions (left, right, up, down). They cannot jump over the wall nor outside of the grid.
    • +
  • catJump, mouseJump are the maximum lengths Cat and Mouse can jump at a time, respectively. Cat and Mouse can jump less than the maximum length.
    • +
  • Staying in the same position is allowed.
    • +
  • Mouse can jump over Cat.
    • +
+ +

The game can end in 4 ways:

+ +
    +
  • If Cat occupies the same position as Mouse, Cat wins.
    • +
  • If Cat reaches the food first, Cat wins.
    • +
  • If Mouse reaches the food first, Mouse wins.
    • +
  • If Mouse cannot get to the food within 1000 turns, Cat wins.
    • +
+ +

Given a rows x cols matrix grid and two integers catJump and mouseJump, return true if Mouse can win the game if both Cat and Mouse play optimally, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: grid = ["####F","#C...","M...."], catJump = 1, mouseJump = 2
+Output: true
+Explanation: Cat cannot catch Mouse on its turn nor can it get the food before Mouse.
+
+ +

Example 2:

+ +
+Input: grid = ["M.C...F"], catJump = 1, mouseJump = 4
+Output: true
+
+ +

Example 3:

+ +
+Input: grid = ["M.C...F"], catJump = 1, mouseJump = 3
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • rows == grid.length
    • +
  • cols = grid[i].length
    • +
  • 1 <= rows, cols <= 8
    • +
  • grid[i][j] consist only of characters 'C', 'M', 'F', '.', and '#'.
    • +
  • There is only one of each character 'C', 'M', and 'F' in grid.
    • +
  • 1 <= catJump, mouseJump <= 8
    • +
+",3.0,False,"class Solution { +public: + bool canMouseWin(vector& grid, int catJump, int mouseJump) { + + } +};","class Solution { + public boolean canMouseWin(String[] grid, int catJump, int mouseJump) { + + } +}","class Solution(object): + def canMouseWin(self, grid, catJump, mouseJump): + """""" + :type grid: List[str] + :type catJump: int + :type mouseJump: int + :rtype: bool + """""" + ","class Solution: + def canMouseWin(self, grid: List[str], catJump: int, mouseJump: int) -> bool: + ","bool canMouseWin(char ** grid, int gridSize, int catJump, int mouseJump){ + +}","public class Solution { + public bool CanMouseWin(string[] grid, int catJump, int mouseJump) { + + } +}","/** + * @param {string[]} grid + * @param {number} catJump + * @param {number} mouseJump + * @return {boolean} + */ +var canMouseWin = function(grid, catJump, mouseJump) { + +};","# @param {String[]} grid +# @param {Integer} cat_jump +# @param {Integer} mouse_jump +# @return {Boolean} +def can_mouse_win(grid, cat_jump, mouse_jump) + +end","class Solution { + func canMouseWin(_ grid: [String], _ catJump: Int, _ mouseJump: Int) -> Bool { + + } +}","func canMouseWin(grid []string, catJump int, mouseJump int) bool { + +}","object Solution { + def canMouseWin(grid: Array[String], catJump: Int, mouseJump: Int): Boolean = { + + } +}","class Solution { + fun canMouseWin(grid: Array, catJump: Int, mouseJump: Int): Boolean { + + } +}","impl Solution { + pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { + + } +}","class Solution { + + /** + * @param String[] $grid + * @param Integer $catJump + * @param Integer $mouseJump + * @return Boolean + */ + function canMouseWin($grid, $catJump, $mouseJump) { + + } +}","function canMouseWin(grid: string[], catJump: number, mouseJump: number): boolean { + +};","(define/contract (can-mouse-win grid catJump mouseJump) + (-> (listof string?) exact-integer? exact-integer? boolean?) + + )","-spec can_mouse_win(Grid :: [unicode:unicode_binary()], CatJump :: integer(), MouseJump :: integer()) -> boolean(). +can_mouse_win(Grid, CatJump, MouseJump) -> + .","defmodule Solution do + @spec can_mouse_win(grid :: [String.t], cat_jump :: integer, mouse_jump :: integer) :: boolean + def can_mouse_win(grid, cat_jump, mouse_jump) do + + end +end","class Solution { + bool canMouseWin(List grid, int catJump, int mouseJump) { + + } +}", +859,coordinate-with-maximum-network-quality,Coordinate With Maximum Network Quality,1620.0,1726.0,"

You are given an array of network towers towers, where towers[i] = [xi, yi, qi] denotes the ith network tower with location (xi, yi) and quality factor qi. All the coordinates are integral coordinates on the X-Y plane, and the distance between the two coordinates is the Euclidean distance.

+ +

You are also given an integer radius where a tower is reachable if the distance is less than or equal to radius. Outside that distance, the signal becomes garbled, and the tower is not reachable.

+ +

The signal quality of the ith tower at a coordinate (x, y) is calculated with the formula ⌊qi / (1 + d)⌋, where d is the distance between the tower and the coordinate. The network quality at a coordinate is the sum of the signal qualities from all the reachable towers.

+ +

Return the array [cx, cy] representing the integral coordinate (cx, cy) where the network quality is maximum. If there are multiple coordinates with the same network quality, return the lexicographically minimum non-negative coordinate.

+ +

Note:

+ +
    +
  • A coordinate (x1, y1) is lexicographically smaller than (x2, y2) if either: + +
      +
    • x1 < x2, or
      • +
    • x1 == x2 and y1 < y2.
      • +
    +
    • +
  • ⌊val⌋ is the greatest integer less than or equal to val (the floor function).
    • +
+ +

 

+

Example 1:

+ +
+Input: towers = [[1,2,5],[2,1,7],[3,1,9]], radius = 2
+Output: [2,1]
+Explanation: At coordinate (2, 1) the total quality is 13.
+- Quality of 7 from (2, 1) results in ⌊7 / (1 + sqrt(0)⌋ = ⌊7⌋ = 7
+- Quality of 5 from (1, 2) results in ⌊5 / (1 + sqrt(2)⌋ = ⌊2.07⌋ = 2
+- Quality of 9 from (3, 1) results in ⌊9 / (1 + sqrt(1)⌋ = ⌊4.5⌋ = 4
+No other coordinate has a higher network quality.
+ +

Example 2:

+ +
+Input: towers = [[23,11,21]], radius = 9
+Output: [23,11]
+Explanation: Since there is only one tower, the network quality is highest right at the tower's location.
+
+ +

Example 3:

+ +
+Input: towers = [[1,2,13],[2,1,7],[0,1,9]], radius = 2
+Output: [1,2]
+Explanation: Coordinate (1, 2) has the highest network quality.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= towers.length <= 50
    • +
  • towers[i].length == 3
    • +
  • 0 <= xi, yi, qi <= 50
    • +
  • 1 <= radius <= 50
    • +
+",2.0,False,"class Solution { +public: + vector bestCoordinate(vector>& towers, int radius) { + + } +};","class Solution { + public int[] bestCoordinate(int[][] towers, int radius) { + + } +}","class Solution(object): + def bestCoordinate(self, towers, radius): + """""" + :type towers: List[List[int]] + :type radius: int + :rtype: List[int] + """""" + ","class Solution: + def bestCoordinate(self, towers: List[List[int]], radius: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* bestCoordinate(int** towers, int towersSize, int* towersColSize, int radius, int* returnSize){ + +}","public class Solution { + public int[] BestCoordinate(int[][] towers, int radius) { + + } +}","/** + * @param {number[][]} towers + * @param {number} radius + * @return {number[]} + */ +var bestCoordinate = function(towers, radius) { + +};","# @param {Integer[][]} towers +# @param {Integer} radius +# @return {Integer[]} +def best_coordinate(towers, radius) + +end","class Solution { + func bestCoordinate(_ towers: [[Int]], _ radius: Int) -> [Int] { + + } +}","func bestCoordinate(towers [][]int, radius int) []int { + +}","object Solution { + def bestCoordinate(towers: Array[Array[Int]], radius: Int): Array[Int] = { + + } +}","class Solution { + fun bestCoordinate(towers: Array, radius: Int): IntArray { + + } +}","impl Solution { + pub fn best_coordinate(towers: Vec>, radius: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $towers + * @param Integer $radius + * @return Integer[] + */ + function bestCoordinate($towers, $radius) { + + } +}","function bestCoordinate(towers: number[][], radius: number): number[] { + +};","(define/contract (best-coordinate towers radius) + (-> (listof (listof exact-integer?)) exact-integer? (listof exact-integer?)) + + )","-spec best_coordinate(Towers :: [[integer()]], Radius :: integer()) -> [integer()]. +best_coordinate(Towers, Radius) -> + .","defmodule Solution do + @spec best_coordinate(towers :: [[integer]], radius :: integer) :: [integer] + def best_coordinate(towers, radius) do + + end +end","class Solution { + List bestCoordinate(List> towers, int radius) { + + } +}", +861,maximum-number-of-achievable-transfer-requests,Maximum Number of Achievable Transfer Requests,1601.0,1723.0,"

We have n buildings numbered from 0 to n - 1. Each building has a number of employees. It's transfer season, and some employees want to change the building they reside in.

+ +

You are given an array requests where requests[i] = [fromi, toi] represents an employee's request to transfer from building fromi to building toi.

+ +

All buildings are full, so a list of requests is achievable only if for each building, the net change in employee transfers is zero. This means the number of employees leaving is equal to the number of employees moving in. For example if n = 3 and two employees are leaving building 0, one is leaving building 1, and one is leaving building 2, there should be two employees moving to building 0, one employee moving to building 1, and one employee moving to building 2.

+ +

Return the maximum number of achievable requests.

+ +

 

+

Example 1:

+ +
+Input: n = 5, requests = [[0,1],[1,0],[0,1],[1,2],[2,0],[3,4]]
+Output: 5
+Explantion: Let's see the requests:
+From building 0 we have employees x and y and both want to move to building 1.
+From building 1 we have employees a and b and they want to move to buildings 2 and 0 respectively.
+From building 2 we have employee z and they want to move to building 0.
+From building 3 we have employee c and they want to move to building 4.
+From building 4 we don't have any requests.
+We can achieve the requests of users x and b by swapping their places.
+We can achieve the requests of users y, a and z by swapping the places in the 3 buildings.
+
+ +

Example 2:

+ +
+Input: n = 3, requests = [[0,0],[1,2],[2,1]]
+Output: 3
+Explantion: Let's see the requests:
+From building 0 we have employee x and they want to stay in the same building 0.
+From building 1 we have employee y and they want to move to building 2.
+From building 2 we have employee z and they want to move to building 1.
+We can achieve all the requests.
+ +

Example 3:

+ +
+Input: n = 4, requests = [[0,3],[3,1],[1,2],[2,0]]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 20
    • +
  • 1 <= requests.length <= 16
    • +
  • requests[i].length == 2
    • +
  • 0 <= fromi, toi < n
    • +
+",3.0,False,"class Solution { +public: + int maximumRequests(int n, vector>& requests) { + + } +};","class Solution { + public int maximumRequests(int n, int[][] requests) { + + } +}","class Solution(object): + def maximumRequests(self, n, requests): + """""" + :type n: int + :type requests: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maximumRequests(self, n: int, requests: List[List[int]]) -> int: + ","int maximumRequests(int n, int** requests, int requestsSize, int* requestsColSize){ + +}","public class Solution { + public int MaximumRequests(int n, int[][] requests) { + + } +}","/** + * @param {number} n + * @param {number[][]} requests + * @return {number} + */ +var maximumRequests = function(n, requests) { + +};","# @param {Integer} n +# @param {Integer[][]} requests +# @return {Integer} +def maximum_requests(n, requests) + +end","class Solution { + func maximumRequests(_ n: Int, _ requests: [[Int]]) -> Int { + + } +}","func maximumRequests(n int, requests [][]int) int { + +}","object Solution { + def maximumRequests(n: Int, requests: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maximumRequests(n: Int, requests: Array): Int { + + } +}","impl Solution { + pub fn maximum_requests(n: i32, requests: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $requests + * @return Integer + */ + function maximumRequests($n, $requests) { + + } +}","function maximumRequests(n: number, requests: number[][]): number { + +};","(define/contract (maximum-requests n requests) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec maximum_requests(N :: integer(), Requests :: [[integer()]]) -> integer(). +maximum_requests(N, Requests) -> + .","defmodule Solution do + @spec maximum_requests(n :: integer, requests :: [[integer]]) :: integer + def maximum_requests(n, requests) do + + end +end","class Solution { + int maximumRequests(int n, List> requests) { + + } +}", +862,throne-inheritance,Throne Inheritance,1600.0,1722.0,"

A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born.

+ +

The kingdom has a well-defined order of inheritance that consists of the king as the first member. Let's define the recursive function Successor(x, curOrder), which given a person x and the inheritance order so far, returns who should be the next person after x in the order of inheritance.

+ +
+Successor(x, curOrder):
+    if x has no children or all of x's children are in curOrder:
+        if x is the king return null
+        else return Successor(x's parent, curOrder)
+    else return x's oldest child who's not in curOrder
+
+ +

For example, assume we have a kingdom that consists of the king, his children Alice and Bob (Alice is older than Bob), and finally Alice's son Jack.

+ +
    +
  1. In the beginning, curOrder will be ["king"].
    2. +
  2. Calling Successor(king, curOrder) will return Alice, so we append to curOrder to get ["king", "Alice"].
    3. +
  3. Calling Successor(Alice, curOrder) will return Jack, so we append to curOrder to get ["king", "Alice", "Jack"].
    4. +
  4. Calling Successor(Jack, curOrder) will return Bob, so we append to curOrder to get ["king", "Alice", "Jack", "Bob"].
    5. +
  5. Calling Successor(Bob, curOrder) will return null. Thus the order of inheritance will be ["king", "Alice", "Jack", "Bob"].
    6. +
+ +

Using the above function, we can always obtain a unique order of inheritance.

+ +

Implement the ThroneInheritance class:

+ +
    +
  • ThroneInheritance(string kingName) Initializes an object of the ThroneInheritance class. The name of the king is given as part of the constructor.
    • +
  • void birth(string parentName, string childName) Indicates that parentName gave birth to childName.
    • +
  • void death(string name) Indicates the death of name. The death of the person doesn't affect the Successor function nor the current inheritance order. You can treat it as just marking the person as dead.
    • +
  • string[] getInheritanceOrder() Returns a list representing the current order of inheritance excluding dead people.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["ThroneInheritance", "birth", "birth", "birth", "birth", "birth", "birth", "getInheritanceOrder", "death", "getInheritanceOrder"]
+[["king"], ["king", "andy"], ["king", "bob"], ["king", "catherine"], ["andy", "matthew"], ["bob", "alex"], ["bob", "asha"], [null], ["bob"], [null]]
+Output
+[null, null, null, null, null, null, null, ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"], null, ["king", "andy", "matthew", "alex", "asha", "catherine"]]
+
+Explanation
+ThroneInheritance t= new ThroneInheritance("king"); // order: king
+t.birth("king", "andy"); // order: king > andy
+t.birth("king", "bob"); // order: king > andy > bob
+t.birth("king", "catherine"); // order: king > andy > bob > catherine
+t.birth("andy", "matthew"); // order: king > andy > matthew > bob > catherine
+t.birth("bob", "alex"); // order: king > andy > matthew > bob > alex > catherine
+t.birth("bob", "asha"); // order: king > andy > matthew > bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"]
+t.death("bob"); // order: king > andy > matthew > bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "alex", "asha", "catherine"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= kingName.length, parentName.length, childName.length, name.length <= 15
    • +
  • kingName, parentName, childName, and name consist of lowercase English letters only.
    • +
  • All arguments childName and kingName are distinct.
    • +
  • All name arguments of death will be passed to either the constructor or as childName to birth first.
    • +
  • For each call to birth(parentName, childName), it is guaranteed that parentName is alive.
    • +
  • At most 105 calls will be made to birth and death.
    • +
  • At most 10 calls will be made to getInheritanceOrder.
    • +
+",2.0,False,"class ThroneInheritance { +public: + ThroneInheritance(string kingName) { + + } + + void birth(string parentName, string childName) { + + } + + void death(string name) { + + } + + vector getInheritanceOrder() { + + } +}; + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * ThroneInheritance* obj = new ThroneInheritance(kingName); + * obj->birth(parentName,childName); + * obj->death(name); + * vector param_3 = obj->getInheritanceOrder(); + */","class ThroneInheritance { + + public ThroneInheritance(String kingName) { + + } + + public void birth(String parentName, String childName) { + + } + + public void death(String name) { + + } + + public List getInheritanceOrder() { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * ThroneInheritance obj = new ThroneInheritance(kingName); + * obj.birth(parentName,childName); + * obj.death(name); + * List param_3 = obj.getInheritanceOrder(); + */","class ThroneInheritance(object): + + def __init__(self, kingName): + """""" + :type kingName: str + """""" + + + def birth(self, parentName, childName): + """""" + :type parentName: str + :type childName: str + :rtype: None + """""" + + + def death(self, name): + """""" + :type name: str + :rtype: None + """""" + + + def getInheritanceOrder(self): + """""" + :rtype: List[str] + """""" + + + +# Your ThroneInheritance object will be instantiated and called as such: +# obj = ThroneInheritance(kingName) +# obj.birth(parentName,childName) +# obj.death(name) +# param_3 = obj.getInheritanceOrder()","class ThroneInheritance: + + def __init__(self, kingName: str): + + + def birth(self, parentName: str, childName: str) -> None: + + + def death(self, name: str) -> None: + + + def getInheritanceOrder(self) -> List[str]: + + + +# Your ThroneInheritance object will be instantiated and called as such: +# obj = ThroneInheritance(kingName) +# obj.birth(parentName,childName) +# obj.death(name) +# param_3 = obj.getInheritanceOrder()"," + + +typedef struct { + +} ThroneInheritance; + + +ThroneInheritance* throneInheritanceCreate(char * kingName) { + +} + +void throneInheritanceBirth(ThroneInheritance* obj, char * parentName, char * childName) { + +} + +void throneInheritanceDeath(ThroneInheritance* obj, char * name) { + +} + +char ** throneInheritanceGetInheritanceOrder(ThroneInheritance* obj, int* retSize) { + +} + +void throneInheritanceFree(ThroneInheritance* obj) { + +} + +/** + * Your ThroneInheritance struct will be instantiated and called as such: + * ThroneInheritance* obj = throneInheritanceCreate(kingName); + * throneInheritanceBirth(obj, parentName, childName); + + * throneInheritanceDeath(obj, name); + + * char ** param_3 = throneInheritanceGetInheritanceOrder(obj, retSize); + + * throneInheritanceFree(obj); +*/","public class ThroneInheritance { + + public ThroneInheritance(string kingName) { + + } + + public void Birth(string parentName, string childName) { + + } + + public void Death(string name) { + + } + + public IList GetInheritanceOrder() { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * ThroneInheritance obj = new ThroneInheritance(kingName); + * obj.Birth(parentName,childName); + * obj.Death(name); + * IList param_3 = obj.GetInheritanceOrder(); + */","/** + * @param {string} kingName + */ +var ThroneInheritance = function(kingName) { + +}; + +/** + * @param {string} parentName + * @param {string} childName + * @return {void} + */ +ThroneInheritance.prototype.birth = function(parentName, childName) { + +}; + +/** + * @param {string} name + * @return {void} + */ +ThroneInheritance.prototype.death = function(name) { + +}; + +/** + * @return {string[]} + */ +ThroneInheritance.prototype.getInheritanceOrder = function() { + +}; + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * var obj = new ThroneInheritance(kingName) + * obj.birth(parentName,childName) + * obj.death(name) + * var param_3 = obj.getInheritanceOrder() + */","class ThroneInheritance + +=begin + :type king_name: String +=end + def initialize(king_name) + + end + + +=begin + :type parent_name: String + :type child_name: String + :rtype: Void +=end + def birth(parent_name, child_name) + + end + + +=begin + :type name: String + :rtype: Void +=end + def death(name) + + end + + +=begin + :rtype: String[] +=end + def get_inheritance_order() + + end + + +end + +# Your ThroneInheritance object will be instantiated and called as such: +# obj = ThroneInheritance.new(king_name) +# obj.birth(parent_name, child_name) +# obj.death(name) +# param_3 = obj.get_inheritance_order()"," +class ThroneInheritance { + + init(_ kingName: String) { + + } + + func birth(_ parentName: String, _ childName: String) { + + } + + func death(_ name: String) { + + } + + func getInheritanceOrder() -> [String] { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * let obj = ThroneInheritance(kingName) + * obj.birth(parentName, childName) + * obj.death(name) + * let ret_3: [String] = obj.getInheritanceOrder() + */","type ThroneInheritance struct { + +} + + +func Constructor(kingName string) ThroneInheritance { + +} + + +func (this *ThroneInheritance) Birth(parentName string, childName string) { + +} + + +func (this *ThroneInheritance) Death(name string) { + +} + + +func (this *ThroneInheritance) GetInheritanceOrder() []string { + +} + + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * obj := Constructor(kingName); + * obj.Birth(parentName,childName); + * obj.Death(name); + * param_3 := obj.GetInheritanceOrder(); + */","class ThroneInheritance(_kingName: String) { + + def birth(parentName: String, childName: String) { + + } + + def death(name: String) { + + } + + def getInheritanceOrder(): List[String] = { + + } + +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * var obj = new ThroneInheritance(kingName) + * obj.birth(parentName,childName) + * obj.death(name) + * var param_3 = obj.getInheritanceOrder() + */","class ThroneInheritance(kingName: String) { + + fun birth(parentName: String, childName: String) { + + } + + fun death(name: String) { + + } + + fun getInheritanceOrder(): List { + + } + +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * var obj = ThroneInheritance(kingName) + * obj.birth(parentName,childName) + * obj.death(name) + * var param_3 = obj.getInheritanceOrder() + */","struct ThroneInheritance { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl ThroneInheritance { + + fn new(kingName: String) -> Self { + + } + + fn birth(&self, parent_name: String, child_name: String) { + + } + + fn death(&self, name: String) { + + } + + fn get_inheritance_order(&self) -> Vec { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * let obj = ThroneInheritance::new(kingName); + * obj.birth(parentName, childName); + * obj.death(name); + * let ret_3: Vec = obj.get_inheritance_order(); + */","class ThroneInheritance { + /** + * @param String $kingName + */ + function __construct($kingName) { + + } + + /** + * @param String $parentName + * @param String $childName + * @return NULL + */ + function birth($parentName, $childName) { + + } + + /** + * @param String $name + * @return NULL + */ + function death($name) { + + } + + /** + * @return String[] + */ + function getInheritanceOrder() { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * $obj = ThroneInheritance($kingName); + * $obj->birth($parentName, $childName); + * $obj->death($name); + * $ret_3 = $obj->getInheritanceOrder(); + */","class ThroneInheritance { + constructor(kingName: string) { + + } + + birth(parentName: string, childName: string): void { + + } + + death(name: string): void { + + } + + getInheritanceOrder(): string[] { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * var obj = new ThroneInheritance(kingName) + * obj.birth(parentName,childName) + * obj.death(name) + * var param_3 = obj.getInheritanceOrder() + */","(define throne-inheritance% + (class object% + (super-new) + + ; king-name : string? + (init-field + king-name) + + ; birth : string? string? -> void? + (define/public (birth parent-name child-name) + + ) + ; death : string? -> void? + (define/public (death name) + + ) + ; get-inheritance-order : -> (listof string?) + (define/public (get-inheritance-order) + + ))) + +;; Your throne-inheritance% object will be instantiated and called as such: +;; (define obj (new throne-inheritance% [king-name king-name])) +;; (send obj birth parent-name child-name) +;; (send obj death name) +;; (define param_3 (send obj get-inheritance-order))","-spec throne_inheritance_init_(KingName :: unicode:unicode_binary()) -> any(). +throne_inheritance_init_(KingName) -> + . + +-spec throne_inheritance_birth(ParentName :: unicode:unicode_binary(), ChildName :: unicode:unicode_binary()) -> any(). +throne_inheritance_birth(ParentName, ChildName) -> + . + +-spec throne_inheritance_death(Name :: unicode:unicode_binary()) -> any(). +throne_inheritance_death(Name) -> + . + +-spec throne_inheritance_get_inheritance_order() -> [unicode:unicode_binary()]. +throne_inheritance_get_inheritance_order() -> + . + + +%% Your functions will be called as such: +%% throne_inheritance_init_(KingName), +%% throne_inheritance_birth(ParentName, ChildName), +%% throne_inheritance_death(Name), +%% Param_3 = throne_inheritance_get_inheritance_order(), + +%% throne_inheritance_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule ThroneInheritance do + @spec init_(king_name :: String.t) :: any + def init_(king_name) do + + end + + @spec birth(parent_name :: String.t, child_name :: String.t) :: any + def birth(parent_name, child_name) do + + end + + @spec death(name :: String.t) :: any + def death(name) do + + end + + @spec get_inheritance_order() :: [String.t] + def get_inheritance_order() do + + end +end + +# Your functions will be called as such: +# ThroneInheritance.init_(king_name) +# ThroneInheritance.birth(parent_name, child_name) +# ThroneInheritance.death(name) +# param_3 = ThroneInheritance.get_inheritance_order() + +# ThroneInheritance.init_ will be called before every test case, in which you can do some necessary initializations.","class ThroneInheritance { + + ThroneInheritance(String kingName) { + + } + + void birth(String parentName, String childName) { + + } + + void death(String name) { + + } + + List getInheritanceOrder() { + + } +} + +/** + * Your ThroneInheritance object will be instantiated and called as such: + * ThroneInheritance obj = ThroneInheritance(kingName); + * obj.birth(parentName,childName); + * obj.death(name); + * List param3 = obj.getInheritanceOrder(); + */", +863,maximum-profit-of-operating-a-centennial-wheel,Maximum Profit of Operating a Centennial Wheel,1599.0,1721.0,"

You are the operator of a Centennial Wheel that has four gondolas, and each gondola has room for up to four people. You have the ability to rotate the gondolas counterclockwise, which costs you runningCost dollars.

+ +

You are given an array customers of length n where customers[i] is the number of new customers arriving just before the ith rotation (0-indexed). This means you must rotate the wheel i times before the customers[i] customers arrive. You cannot make customers wait if there is room in the gondola. Each customer pays boardingCost dollars when they board on the gondola closest to the ground and will exit once that gondola reaches the ground again.

+ +

You can stop the wheel at any time, including before serving all customers. If you decide to stop serving customers, all subsequent rotations are free in order to get all the customers down safely. Note that if there are currently more than four customers waiting at the wheel, only four will board the gondola, and the rest will wait for the next rotation.

+ +

Return the minimum number of rotations you need to perform to maximize your profit. If there is no scenario where the profit is positive, return -1.

+ +

 

+

Example 1:

+ +
+Input: customers = [8,3], boardingCost = 5, runningCost = 6
+Output: 3
+Explanation: The numbers written on the gondolas are the number of people currently there.
+1. 8 customers arrive, 4 board and 4 wait for the next gondola, the wheel rotates. Current profit is 4 * $5 - 1 * $6 = $14.
+2. 3 customers arrive, the 4 waiting board the wheel and the other 3 wait, the wheel rotates. Current profit is 8 * $5 - 2 * $6 = $28.
+3. The final 3 customers board the gondola, the wheel rotates. Current profit is 11 * $5 - 3 * $6 = $37.
+The highest profit was $37 after rotating the wheel 3 times.
+
+ +

Example 2:

+ +
+Input: customers = [10,9,6], boardingCost = 6, runningCost = 4
+Output: 7
+Explanation:
+1. 10 customers arrive, 4 board and 6 wait for the next gondola, the wheel rotates. Current profit is 4 * $6 - 1 * $4 = $20.
+2. 9 customers arrive, 4 board and 11 wait (2 originally waiting, 9 newly waiting), the wheel rotates. Current profit is 8 * $6 - 2 * $4 = $40.
+3. The final 6 customers arrive, 4 board and 13 wait, the wheel rotates. Current profit is 12 * $6 - 3 * $4 = $60.
+4. 4 board and 9 wait, the wheel rotates. Current profit is 16 * $6 - 4 * $4 = $80.
+5. 4 board and 5 wait, the wheel rotates. Current profit is 20 * $6 - 5 * $4 = $100.
+6. 4 board and 1 waits, the wheel rotates. Current profit is 24 * $6 - 6 * $4 = $120.
+7. 1 boards, the wheel rotates. Current profit is 25 * $6 - 7 * $4 = $122.
+The highest profit was $122 after rotating the wheel 7 times.
+
+ +

Example 3:

+ +
+Input: customers = [3,4,0,5,1], boardingCost = 1, runningCost = 92
+Output: -1
+Explanation:
+1. 3 customers arrive, 3 board and 0 wait, the wheel rotates. Current profit is 3 * $1 - 1 * $92 = -$89.
+2. 4 customers arrive, 4 board and 0 wait, the wheel rotates. Current profit is 7 * $1 - 2 * $92 = -$177.
+3. 0 customers arrive, 0 board and 0 wait, the wheel rotates. Current profit is 7 * $1 - 3 * $92 = -$269.
+4. 5 customers arrive, 4 board and 1 waits, the wheel rotates. Current profit is 11 * $1 - 4 * $92 = -$357.
+5. 1 customer arrives, 2 board and 0 wait, the wheel rotates. Current profit is 13 * $1 - 5 * $92 = -$447.
+The profit was never positive, so return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • n == customers.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= customers[i] <= 50
    • +
  • 1 <= boardingCost, runningCost <= 100
    • +
+",2.0,False,"class Solution { +public: + int minOperationsMaxProfit(vector& customers, int boardingCost, int runningCost) { + + } +};","class Solution { + public int minOperationsMaxProfit(int[] customers, int boardingCost, int runningCost) { + + } +}","class Solution(object): + def minOperationsMaxProfit(self, customers, boardingCost, runningCost): + """""" + :type customers: List[int] + :type boardingCost: int + :type runningCost: int + :rtype: int + """""" + ","class Solution: + def minOperationsMaxProfit(self, customers: List[int], boardingCost: int, runningCost: int) -> int: + ","int minOperationsMaxProfit(int* customers, int customersSize, int boardingCost, int runningCost){ + +}","public class Solution { + public int MinOperationsMaxProfit(int[] customers, int boardingCost, int runningCost) { + + } +}","/** + * @param {number[]} customers + * @param {number} boardingCost + * @param {number} runningCost + * @return {number} + */ +var minOperationsMaxProfit = function(customers, boardingCost, runningCost) { + +};","# @param {Integer[]} customers +# @param {Integer} boarding_cost +# @param {Integer} running_cost +# @return {Integer} +def min_operations_max_profit(customers, boarding_cost, running_cost) + +end","class Solution { + func minOperationsMaxProfit(_ customers: [Int], _ boardingCost: Int, _ runningCost: Int) -> Int { + + } +}","func minOperationsMaxProfit(customers []int, boardingCost int, runningCost int) int { + +}","object Solution { + def minOperationsMaxProfit(customers: Array[Int], boardingCost: Int, runningCost: Int): Int = { + + } +}","class Solution { + fun minOperationsMaxProfit(customers: IntArray, boardingCost: Int, runningCost: Int): Int { + + } +}","impl Solution { + pub fn min_operations_max_profit(customers: Vec, boarding_cost: i32, running_cost: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $customers + * @param Integer $boardingCost + * @param Integer $runningCost + * @return Integer + */ + function minOperationsMaxProfit($customers, $boardingCost, $runningCost) { + + } +}","function minOperationsMaxProfit(customers: number[], boardingCost: number, runningCost: number): number { + +};","(define/contract (min-operations-max-profit customers boardingCost runningCost) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec min_operations_max_profit(Customers :: [integer()], BoardingCost :: integer(), RunningCost :: integer()) -> integer(). +min_operations_max_profit(Customers, BoardingCost, RunningCost) -> + .","defmodule Solution do + @spec min_operations_max_profit(customers :: [integer], boarding_cost :: integer, running_cost :: integer) :: integer + def min_operations_max_profit(customers, boarding_cost, running_cost) do + + end +end","class Solution { + int minOperationsMaxProfit(List customers, int boardingCost, int runningCost) { + + } +}", +865,minimum-cost-to-connect-two-groups-of-points,Minimum Cost to Connect Two Groups of Points,1595.0,1717.0,"

You are given two groups of points where the first group has size1 points, the second group has size2 points, and size1 >= size2.

+ +

The cost of the connection between any two points are given in an size1 x size2 matrix where cost[i][j] is the cost of connecting point i of the first group and point j of the second group. The groups are connected if each point in both groups is connected to one or more points in the opposite group. In other words, each point in the first group must be connected to at least one point in the second group, and each point in the second group must be connected to at least one point in the first group.

+ +

Return the minimum cost it takes to connect the two groups.

+ +

 

+

Example 1:

+ +
+Input: cost = [[15, 96], [36, 2]]
+Output: 17
+Explanation: The optimal way of connecting the groups is:
+1--A
+2--B
+This results in a total cost of 17.
+
+ +

Example 2:

+ +
+Input: cost = [[1, 3, 5], [4, 1, 1], [1, 5, 3]]
+Output: 4
+Explanation: The optimal way of connecting the groups is:
+1--A
+2--B
+2--C
+3--A
+This results in a total cost of 4.
+Note that there are multiple points connected to point 2 in the first group and point A in the second group. This does not matter as there is no limit to the number of points that can be connected. We only care about the minimum total cost.
+
+ +

Example 3:

+ +
+Input: cost = [[2, 5, 1], [3, 4, 7], [8, 1, 2], [6, 2, 4], [3, 8, 8]]
+Output: 10
+
+ +

 

+

Constraints:

+ +
    +
  • size1 == cost.length
    • +
  • size2 == cost[i].length
    • +
  • 1 <= size1, size2 <= 12
    • +
  • size1 >= size2
    • +
  • 0 <= cost[i][j] <= 100
    • +
+",3.0,False,"class Solution { +public: + int connectTwoGroups(vector>& cost) { + + } +};","class Solution { + public int connectTwoGroups(List> cost) { + + } +}","class Solution(object): + def connectTwoGroups(self, cost): + """""" + :type cost: List[List[int]] + :rtype: int + """""" + ","class Solution: + def connectTwoGroups(self, cost: List[List[int]]) -> int: + ","int connectTwoGroups(int** cost, int costSize, int* costColSize){ + +}","public class Solution { + public int ConnectTwoGroups(IList> cost) { + + } +}","/** + * @param {number[][]} cost + * @return {number} + */ +var connectTwoGroups = function(cost) { + +};","# @param {Integer[][]} cost +# @return {Integer} +def connect_two_groups(cost) + +end","class Solution { + func connectTwoGroups(_ cost: [[Int]]) -> Int { + + } +}","func connectTwoGroups(cost [][]int) int { + +}","object Solution { + def connectTwoGroups(cost: List[List[Int]]): Int = { + + } +}","class Solution { + fun connectTwoGroups(cost: List>): Int { + + } +}","impl Solution { + pub fn connect_two_groups(cost: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $cost + * @return Integer + */ + function connectTwoGroups($cost) { + + } +}","function connectTwoGroups(cost: number[][]): number { + +};","(define/contract (connect-two-groups cost) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec connect_two_groups(Cost :: [[integer()]]) -> integer(). +connect_two_groups(Cost) -> + .","defmodule Solution do + @spec connect_two_groups(cost :: [[integer]]) :: integer + def connect_two_groups(cost) do + + end +end","class Solution { + int connectTwoGroups(List> cost) { + + } +}", +866,maximum-non-negative-product-in-a-matrix,Maximum Non Negative Product in a Matrix,1594.0,1716.0,"

You are given a m x n matrix grid. Initially, you are located at the top-left corner (0, 0), and in each step, you can only move right or down in the matrix.

+ +

Among all possible paths starting from the top-left corner (0, 0) and ending in the bottom-right corner (m - 1, n - 1), find the path with the maximum non-negative product. The product of a path is the product of all integers in the grid cells visited along the path.

+ +

Return the maximum non-negative product modulo 109 + 7. If the maximum product is negative, return -1.

+ +

Notice that the modulo is performed after getting the maximum product.

+ +

 

+

Example 1:

+ +
+Input: grid = [[-1,-2,-3],[-2,-3,-3],[-3,-3,-2]]
+Output: -1
+Explanation: It is not possible to get non-negative product in the path from (0, 0) to (2, 2), so return -1.
+
+ +

Example 2:

+ +
+Input: grid = [[1,-2,1],[1,-2,1],[3,-4,1]]
+Output: 8
+Explanation: Maximum non-negative product is shown (1 * 1 * -2 * -4 * 1 = 8).
+
+ +

Example 3:

+ +
+Input: grid = [[1,3],[0,-4]]
+Output: 0
+Explanation: Maximum non-negative product is shown (1 * 0 * -4 = 0).
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 15
    • +
  • -4 <= grid[i][j] <= 4
    • +
+",2.0,False,"class Solution { +public: + int maxProductPath(vector>& grid) { + + } +};","class Solution { + public int maxProductPath(int[][] grid) { + + } +}","class Solution(object): + def maxProductPath(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxProductPath(self, grid: List[List[int]]) -> int: + ","int maxProductPath(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaxProductPath(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maxProductPath = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def max_product_path(grid) + +end","class Solution { + func maxProductPath(_ grid: [[Int]]) -> Int { + + } +}","func maxProductPath(grid [][]int) int { + +}","object Solution { + def maxProductPath(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxProductPath(grid: Array): Int { + + } +}","impl Solution { + pub fn max_product_path(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maxProductPath($grid) { + + } +}","function maxProductPath(grid: number[][]): number { + +};","(define/contract (max-product-path grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_product_path(Grid :: [[integer()]]) -> integer(). +max_product_path(Grid) -> + .","defmodule Solution do + @spec max_product_path(grid :: [[integer]]) :: integer + def max_product_path(grid) do + + end +end","class Solution { + int maxProductPath(List> grid) { + + } +}", +867,split-a-string-into-the-max-number-of-unique-substrings,Split a String Into the Max Number of Unique Substrings,1593.0,1715.0,"

Given a string s, return the maximum number of unique substrings that the given string can be split into.

+ +

You can split string s into any list of non-empty substrings, where the concatenation of the substrings forms the original string. However, you must split the substrings such that all of them are unique.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "ababccc"
+Output: 5
+Explanation: One way to split maximally is ['a', 'b', 'ab', 'c', 'cc']. Splitting like ['a', 'b', 'a', 'b', 'c', 'cc'] is not valid as you have 'a' and 'b' multiple times.
+
+ +

Example 2:

+ +
+Input: s = "aba"
+Output: 2
+Explanation: One way to split maximally is ['a', 'ba'].
+
+ +

Example 3:

+ +
+Input: s = "aa"
+Output: 1
+Explanation: It is impossible to split the string any further.
+
+ +

 

+

Constraints:

+ +
    +
  • +

    1 <= s.length <= 16

    +
    • +
  • +

    s contains only lower case English letters.

    +
    • +
+",2.0,False,"class Solution { +public: + int maxUniqueSplit(string s) { + + } +};","class Solution { + public int maxUniqueSplit(String s) { + + } +}","class Solution(object): + def maxUniqueSplit(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def maxUniqueSplit(self, s: str) -> int: + ","int maxUniqueSplit(char * s){ + +}","public class Solution { + public int MaxUniqueSplit(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var maxUniqueSplit = function(s) { + +};","# @param {String} s +# @return {Integer} +def max_unique_split(s) + +end","class Solution { + func maxUniqueSplit(_ s: String) -> Int { + + } +}","func maxUniqueSplit(s string) int { + +}","object Solution { + def maxUniqueSplit(s: String): Int = { + + } +}","class Solution { + fun maxUniqueSplit(s: String): Int { + + } +}","impl Solution { + pub fn max_unique_split(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function maxUniqueSplit($s) { + + } +}","function maxUniqueSplit(s: string): number { + +};","(define/contract (max-unique-split s) + (-> string? exact-integer?) + + )","-spec max_unique_split(S :: unicode:unicode_binary()) -> integer(). +max_unique_split(S) -> + .","defmodule Solution do + @spec max_unique_split(s :: String.t) :: integer + def max_unique_split(s) do + + end +end","class Solution { + int maxUniqueSplit(String s) { + + } +}", +870,find-servers-that-handled-most-number-of-requests,Find Servers That Handled Most Number of Requests,1606.0,1710.0,"

You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but cannot handle more than one request at a time. The requests are assigned to servers according to a specific algorithm:

+ +
    +
  • The ith (0-indexed) request arrives.
    • +
  • If all servers are busy, the request is dropped (not handled at all).
    • +
  • If the (i % k)th server is available, assign the request to that server.
    • +
  • Otherwise, assign the request to the next available server (wrapping around the list of servers and starting from 0 if necessary). For example, if the ith server is busy, try to assign the request to the (i+1)th server, then the (i+2)th server, and so on.
    • +
+ +

You are given a strictly increasing array arrival of positive integers, where arrival[i] represents the arrival time of the ith request, and another array load, where load[i] represents the load of the ith request (the time it takes to complete). Your goal is to find the busiest server(s). A server is considered busiest if it handled the most number of requests successfully among all the servers.

+ +

Return a list containing the IDs (0-indexed) of the busiest server(s). You may return the IDs in any order.

+ +

 

+

Example 1:

+ +
+Input: k = 3, arrival = [1,2,3,4,5], load = [5,2,3,3,3] 
+Output: [1] 
+Explanation: 
+All of the servers start out available.
+The first 3 requests are handled by the first 3 servers in order.
+Request 3 comes in. Server 0 is busy, so it's assigned to the next available server, which is 1.
+Request 4 comes in. It cannot be handled since all servers are busy, so it is dropped.
+Servers 0 and 2 handled one request each, while server 1 handled two requests. Hence server 1 is the busiest server.
+
+ +

Example 2:

+ +
+Input: k = 3, arrival = [1,2,3,4], load = [1,2,1,2]
+Output: [0]
+Explanation: 
+The first 3 requests are handled by first 3 servers.
+Request 3 comes in. It is handled by server 0 since the server is available.
+Server 0 handled two requests, while servers 1 and 2 handled one request each. Hence server 0 is the busiest server.
+
+ +

Example 3:

+ +
+Input: k = 3, arrival = [1,2,3], load = [10,12,11]
+Output: [0,1,2]
+Explanation: Each server handles a single request, so they are all considered the busiest.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 105
    • +
  • 1 <= arrival.length, load.length <= 105
    • +
  • arrival.length == load.length
    • +
  • 1 <= arrival[i], load[i] <= 109
    • +
  • arrival is strictly increasing.
    • +
+",3.0,False,"class Solution { +public: + vector busiestServers(int k, vector& arrival, vector& load) { + + } +};","class Solution { + public List busiestServers(int k, int[] arrival, int[] load) { + + } +}","class Solution(object): + def busiestServers(self, k, arrival, load): + """""" + :type k: int + :type arrival: List[int] + :type load: List[int] + :rtype: List[int] + """""" + ","class Solution: + def busiestServers(self, k: int, arrival: List[int], load: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* busiestServers(int k, int* arrival, int arrivalSize, int* load, int loadSize, int* returnSize){ + +}","public class Solution { + public IList BusiestServers(int k, int[] arrival, int[] load) { + + } +}","/** + * @param {number} k + * @param {number[]} arrival + * @param {number[]} load + * @return {number[]} + */ +var busiestServers = function(k, arrival, load) { + +};","# @param {Integer} k +# @param {Integer[]} arrival +# @param {Integer[]} load +# @return {Integer[]} +def busiest_servers(k, arrival, load) + +end","class Solution { + func busiestServers(_ k: Int, _ arrival: [Int], _ load: [Int]) -> [Int] { + + } +}","func busiestServers(k int, arrival []int, load []int) []int { + +}","object Solution { + def busiestServers(k: Int, arrival: Array[Int], load: Array[Int]): List[Int] = { + + } +}","class Solution { + fun busiestServers(k: Int, arrival: IntArray, load: IntArray): List { + + } +}","impl Solution { + pub fn busiest_servers(k: i32, arrival: Vec, load: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer[] $arrival + * @param Integer[] $load + * @return Integer[] + */ + function busiestServers($k, $arrival, $load) { + + } +}","function busiestServers(k: number, arrival: number[], load: number[]): number[] { + +};","(define/contract (busiest-servers k arrival load) + (-> exact-integer? (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec busiest_servers(K :: integer(), Arrival :: [integer()], Load :: [integer()]) -> [integer()]. +busiest_servers(K, Arrival, Load) -> + .","defmodule Solution do + @spec busiest_servers(k :: integer, arrival :: [integer], load :: [integer]) :: [integer] + def busiest_servers(k, arrival, load) do + + end +end","class Solution { + List busiestServers(int k, List arrival, List load) { + + } +}", +871,alert-using-same-key-card-three-or-more-times-in-a-one-hour-period,Alert Using Same Key-Card Three or More Times in a One Hour Period,1604.0,1709.0,"

LeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's name and the time when it was used. The system emits an alert if any worker uses the key-card three or more times in a one-hour period.

+ +

You are given a list of strings keyName and keyTime where [keyName[i], keyTime[i]] corresponds to a person's name and the time when their key-card was used in a single day.

+ +

Access times are given in the 24-hour time format "HH:MM", such as "23:51" and "09:49".

+ +

Return a list of unique worker names who received an alert for frequent keycard use. Sort the names in ascending order alphabetically.

+ +

Notice that "10:00" - "11:00" is considered to be within a one-hour period, while "22:51" - "23:52" is not considered to be within a one-hour period.

+ +

 

+

Example 1:

+ +
+Input: keyName = ["daniel","daniel","daniel","luis","luis","luis","luis"], keyTime = ["10:00","10:40","11:00","09:00","11:00","13:00","15:00"]
+Output: ["daniel"]
+Explanation: "daniel" used the keycard 3 times in a one-hour period ("10:00","10:40", "11:00").
+
+ +

Example 2:

+ +
+Input: keyName = ["alice","alice","alice","bob","bob","bob","bob"], keyTime = ["12:01","12:00","18:00","21:00","21:20","21:30","23:00"]
+Output: ["bob"]
+Explanation: "bob" used the keycard 3 times in a one-hour period ("21:00","21:20", "21:30").
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= keyName.length, keyTime.length <= 105
    • +
  • keyName.length == keyTime.length
    • +
  • keyTime[i] is in the format "HH:MM".
    • +
  • [keyName[i], keyTime[i]] is unique.
    • +
  • 1 <= keyName[i].length <= 10
    • +
  • keyName[i] contains only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector alertNames(vector& keyName, vector& keyTime) { + + } +};","class Solution { + public List alertNames(String[] keyName, String[] keyTime) { + + } +}","class Solution(object): + def alertNames(self, keyName, keyTime): + """""" + :type keyName: List[str] + :type keyTime: List[str] + :rtype: List[str] + """""" + ","class Solution: + def alertNames(self, keyName: List[str], keyTime: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** alertNames(char ** keyName, int keyNameSize, char ** keyTime, int keyTimeSize, int* returnSize){ + +}","public class Solution { + public IList AlertNames(string[] keyName, string[] keyTime) { + + } +}","/** + * @param {string[]} keyName + * @param {string[]} keyTime + * @return {string[]} + */ +var alertNames = function(keyName, keyTime) { + +};","# @param {String[]} key_name +# @param {String[]} key_time +# @return {String[]} +def alert_names(key_name, key_time) + +end","class Solution { + func alertNames(_ keyName: [String], _ keyTime: [String]) -> [String] { + + } +}","func alertNames(keyName []string, keyTime []string) []string { + +}","object Solution { + def alertNames(keyName: Array[String], keyTime: Array[String]): List[String] = { + + } +}","class Solution { + fun alertNames(keyName: Array, keyTime: Array): List { + + } +}","impl Solution { + pub fn alert_names(key_name: Vec, key_time: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $keyName + * @param String[] $keyTime + * @return String[] + */ + function alertNames($keyName, $keyTime) { + + } +}","function alertNames(keyName: string[], keyTime: string[]): string[] { + +};","(define/contract (alert-names keyName keyTime) + (-> (listof string?) (listof string?) (listof string?)) + + )","-spec alert_names(KeyName :: [unicode:unicode_binary()], KeyTime :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +alert_names(KeyName, KeyTime) -> + .","defmodule Solution do + @spec alert_names(key_name :: [String.t], key_time :: [String.t]) :: [String.t] + def alert_names(key_name, key_time) do + + end +end","class Solution { + List alertNames(List keyName, List keyTime) { + + } +}", +873,check-if-string-is-transformable-with-substring-sort-operations,Check If String Is Transformable With Substring Sort Operations,1585.0,1707.0,"

Given two strings s and t, transform string s into string t using the following operation any number of times:

+ +
    +
  • Choose a non-empty substring in s and sort it in place so the characters are in ascending order. + +
      +
    • For example, applying the operation on the underlined substring in "14234" results in "12344".
      • +
    +
    • +
+ +

Return true if it is possible to transform s into t. Otherwise, return false.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: s = "84532", t = "34852"
+Output: true
+Explanation: You can transform s into t using the following sort operations:
+"84532" (from index 2 to 3) -> "84352"
+"84352" (from index 0 to 2) -> "34852"
+
+ +

Example 2:

+ +
+Input: s = "34521", t = "23415"
+Output: true
+Explanation: You can transform s into t using the following sort operations:
+"34521" -> "23451"
+"23451" -> "23415"
+
+ +

Example 3:

+ +
+Input: s = "12345", t = "12435"
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • s.length == t.length
    • +
  • 1 <= s.length <= 105
    • +
  • s and t consist of only digits.
    • +
+",3.0,False,"class Solution { +public: + bool isTransformable(string s, string t) { + + } +};","class Solution { + public boolean isTransformable(String s, String t) { + + } +}","class Solution(object): + def isTransformable(self, s, t): + """""" + :type s: str + :type t: str + :rtype: bool + """""" + ","class Solution: + def isTransformable(self, s: str, t: str) -> bool: + ","bool isTransformable(char * s, char * t){ + +}","public class Solution { + public bool IsTransformable(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {boolean} + */ +var isTransformable = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Boolean} +def is_transformable(s, t) + +end","class Solution { + func isTransformable(_ s: String, _ t: String) -> Bool { + + } +}","func isTransformable(s string, t string) bool { + +}","object Solution { + def isTransformable(s: String, t: String): Boolean = { + + } +}","class Solution { + fun isTransformable(s: String, t: String): Boolean { + + } +}","impl Solution { + pub fn is_transformable(s: String, t: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Boolean + */ + function isTransformable($s, $t) { + + } +}","function isTransformable(s: string, t: string): boolean { + +};","(define/contract (is-transformable s t) + (-> string? string? boolean?) + + )","-spec is_transformable(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> boolean(). +is_transformable(S, T) -> + .","defmodule Solution do + @spec is_transformable(s :: String.t, t :: String.t) :: boolean + def is_transformable(s, t) do + + end +end","class Solution { + bool isTransformable(String s, String t) { + + } +}", +874,min-cost-to-connect-all-points,Min Cost to Connect All Points,1584.0,1706.0,"

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].

+ +

The cost of connecting two points [xi, yi] and [xj, yj] is the manhattan distance between them: |xi - xj| + |yi - yj|, where |val| denotes the absolute value of val.

+ +

Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.

+ +

 

+

Example 1:

+ +
+Input: points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
+Output: 20
+Explanation: 
+
+We can connect the points as shown above to get the minimum cost of 20.
+Notice that there is a unique path between every pair of points.
+
+ +

Example 2:

+ +
+Input: points = [[3,12],[-2,5],[-4,1]]
+Output: 18
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= points.length <= 1000
    • +
  • -106 <= xi, yi <= 106
    • +
  • All pairs (xi, yi) are distinct.
    • +
+",2.0,False,"class Solution { +public: + int minCostConnectPoints(vector>& points) { + + } +};","class Solution { + public int minCostConnectPoints(int[][] points) { + + } +}","class Solution(object): + def minCostConnectPoints(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minCostConnectPoints(self, points: List[List[int]]) -> int: + ","int minCostConnectPoints(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int MinCostConnectPoints(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var minCostConnectPoints = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def min_cost_connect_points(points) + +end","class Solution { + func minCostConnectPoints(_ points: [[Int]]) -> Int { + + } +}","func minCostConnectPoints(points [][]int) int { + +}","object Solution { + def minCostConnectPoints(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minCostConnectPoints(points: Array): Int { + + } +}","impl Solution { + pub fn min_cost_connect_points(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function minCostConnectPoints($points) { + + } +}","function minCostConnectPoints(points: number[][]): number { + +};","(define/contract (min-cost-connect-points points) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_cost_connect_points(Points :: [[integer()]]) -> integer(). +min_cost_connect_points(Points) -> + .","defmodule Solution do + @spec min_cost_connect_points(points :: [[integer]]) :: integer + def min_cost_connect_points(points) do + + end +end","class Solution { + int minCostConnectPoints(List> points) { + + } +}", +876,special-positions-in-a-binary-matrix,Special Positions in a Binary Matrix,1582.0,1704.0,"

Given an m x n binary matrix mat, return the number of special positions in mat.

+ +

A position (i, j) is called special if mat[i][j] == 1 and all other elements in row i and column j are 0 (rows and columns are 0-indexed).

+ +

 

+

Example 1:

+ +
+Input: mat = [[1,0,0],[0,0,1],[1,0,0]]
+Output: 1
+Explanation: (1, 2) is a special position because mat[1][2] == 1 and all other elements in row 1 and column 2 are 0.
+
+ +

Example 2:

+ +
+Input: mat = [[1,0,0],[0,1,0],[0,0,1]]
+Output: 3
+Explanation: (0, 0), (1, 1) and (2, 2) are special positions.
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length
    • +
  • n == mat[i].length
    • +
  • 1 <= m, n <= 100
    • +
  • mat[i][j] is either 0 or 1.
    • +
+",1.0,False,"class Solution { +public: + int numSpecial(vector>& mat) { + + } +};","class Solution { + public int numSpecial(int[][] mat) { + + } +}","class Solution(object): + def numSpecial(self, mat): + """""" + :type mat: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numSpecial(self, mat: List[List[int]]) -> int: + ","int numSpecial(int** mat, int matSize, int* matColSize){ + +}","public class Solution { + public int NumSpecial(int[][] mat) { + + } +}","/** + * @param {number[][]} mat + * @return {number} + */ +var numSpecial = function(mat) { + +};","# @param {Integer[][]} mat +# @return {Integer} +def num_special(mat) + +end","class Solution { + func numSpecial(_ mat: [[Int]]) -> Int { + + } +}","func numSpecial(mat [][]int) int { + +}","object Solution { + def numSpecial(mat: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numSpecial(mat: Array): Int { + + } +}","impl Solution { + pub fn num_special(mat: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @return Integer + */ + function numSpecial($mat) { + + } +}","function numSpecial(mat: number[][]): number { + +};","(define/contract (num-special mat) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec num_special(Mat :: [[integer()]]) -> integer(). +num_special(Mat) -> + .","defmodule Solution do + @spec num_special(mat :: [[integer]]) :: integer + def num_special(mat) do + + end +end","class Solution { + int numSpecial(List> mat) { + + } +}", +877,remove-max-number-of-edges-to-keep-graph-fully-traversable,Remove Max Number of Edges to Keep Graph Fully Traversable,1579.0,1701.0,"

Alice and Bob have an undirected graph of n nodes and three types of edges:

+ +
    +
  • Type 1: Can be traversed by Alice only.
    • +
  • Type 2: Can be traversed by Bob only.
    • +
  • Type 3: Can be traversed by both Alice and Bob.
    • +
+ +

Given an array edges where edges[i] = [typei, ui, vi] represents a bidirectional edge of type typei between nodes ui and vi, find the maximum number of edges you can remove so that after removing the edges, the graph can still be fully traversed by both Alice and Bob. The graph is fully traversed by Alice and Bob if starting from any node, they can reach all other nodes.

+ +

Return the maximum number of edges you can remove, or return -1 if Alice and Bob cannot fully traverse the graph.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,3],[1,2,4],[1,1,2],[2,3,4]]
+Output: 2
+Explanation: If we remove the 2 edges [1,1,2] and [1,1,3]. The graph will still be fully traversable by Alice and Bob. Removing any additional edge will not make it so. So the maximum number of edges we can remove is 2.
+
+ +

Example 2:

+ +

+ +
+Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,4],[2,1,4]]
+Output: 0
+Explanation: Notice that removing any edge will not make the graph fully traversable by Alice and Bob.
+
+ +

Example 3:

+ +

+ +
+Input: n = 4, edges = [[3,2,3],[1,1,2],[2,3,4]]
+Output: -1
+Explanation: In the current graph, Alice cannot reach node 4 from the other nodes. Likewise, Bob cannot reach 1. Therefore it's impossible to make the graph fully traversable.
+ +

 

+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 1 <= edges.length <= min(105, 3 * n * (n - 1) / 2)
    • +
  • edges[i].length == 3
    • +
  • 1 <= typei <= 3
    • +
  • 1 <= ui < vi <= n
    • +
  • All tuples (typei, ui, vi) are distinct.
    • +
+",3.0,False,"class Solution { +public: + int maxNumEdgesToRemove(int n, vector>& edges) { + + } +};","class Solution { + public int maxNumEdgesToRemove(int n, int[][] edges) { + + } +}","class Solution(object): + def maxNumEdgesToRemove(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxNumEdgesToRemove(self, n: int, edges: List[List[int]]) -> int: + ","int maxNumEdgesToRemove(int n, int** edges, int edgesSize, int* edgesColSize){ + +}","public class Solution { + public int MaxNumEdgesToRemove(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number} + */ +var maxNumEdgesToRemove = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer} +def max_num_edges_to_remove(n, edges) + +end","class Solution { + func maxNumEdgesToRemove(_ n: Int, _ edges: [[Int]]) -> Int { + + } +}","func maxNumEdgesToRemove(n int, edges [][]int) int { + +}","object Solution { + def maxNumEdgesToRemove(n: Int, edges: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxNumEdgesToRemove(n: Int, edges: Array): Int { + + } +}","impl Solution { + pub fn max_num_edges_to_remove(n: i32, edges: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer + */ + function maxNumEdgesToRemove($n, $edges) { + + } +}","function maxNumEdgesToRemove(n: number, edges: number[][]): number { + +};","(define/contract (max-num-edges-to-remove n edges) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_num_edges_to_remove(N :: integer(), Edges :: [[integer()]]) -> integer(). +max_num_edges_to_remove(N, Edges) -> + .","defmodule Solution do + @spec max_num_edges_to_remove(n :: integer, edges :: [[integer]]) :: integer + def max_num_edges_to_remove(n, edges) do + + end +end","class Solution { + int maxNumEdgesToRemove(int n, List> edges) { + + } +}", +878,minimum-time-to-make-rope-colorful,Minimum Time to Make Rope Colorful,1578.0,1700.0,"

Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the ith balloon.

+ +

Alice wants the rope to be colorful. She does not want two consecutive balloons to be of the same color, so she asks Bob for help. Bob can remove some balloons from the rope to make it colorful. You are given a 0-indexed integer array neededTime where neededTime[i] is the time (in seconds) that Bob needs to remove the ith balloon from the rope.

+ +

Return the minimum time Bob needs to make the rope colorful.

+ +

 

+

Example 1:

+ +
+Input: colors = "abaac", neededTime = [1,2,3,4,5]
+Output: 3
+Explanation: In the above image, 'a' is blue, 'b' is red, and 'c' is green.
+Bob can remove the blue balloon at index 2. This takes 3 seconds.
+There are no longer two consecutive balloons of the same color. Total time = 3.
+ +

Example 2:

+ +
+Input: colors = "abc", neededTime = [1,2,3]
+Output: 0
+Explanation: The rope is already colorful. Bob does not need to remove any balloons from the rope.
+
+ +

Example 3:

+ +
+Input: colors = "aabaa", neededTime = [1,2,3,4,1]
+Output: 2
+Explanation: Bob will remove the ballons at indices 0 and 4. Each ballon takes 1 second to remove.
+There are no longer two consecutive balloons of the same color. Total time = 1 + 1 = 2.
+
+ +

 

+

Constraints:

+ +
    +
  • n == colors.length == neededTime.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= neededTime[i] <= 104
    • +
  • colors contains only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minCost(string colors, vector& neededTime) { + + } +};","class Solution { + public int minCost(String colors, int[] neededTime) { + + } +}","class Solution(object): + def minCost(self, colors, neededTime): + """""" + :type colors: str + :type neededTime: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, colors: str, neededTime: List[int]) -> int: + ","int minCost(char * colors, int* neededTime, int neededTimeSize){ + +}","public class Solution { + public int MinCost(string colors, int[] neededTime) { + + } +}","/** + * @param {string} colors + * @param {number[]} neededTime + * @return {number} + */ +var minCost = function(colors, neededTime) { + +};","# @param {String} colors +# @param {Integer[]} needed_time +# @return {Integer} +def min_cost(colors, needed_time) + +end","class Solution { + func minCost(_ colors: String, _ neededTime: [Int]) -> Int { + + } +}","func minCost(colors string, neededTime []int) int { + +}","object Solution { + def minCost(colors: String, neededTime: Array[Int]): Int = { + + } +}","class Solution { + fun minCost(colors: String, neededTime: IntArray): Int { + + } +}","impl Solution { + pub fn min_cost(colors: String, needed_time: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $colors + * @param Integer[] $neededTime + * @return Integer + */ + function minCost($colors, $neededTime) { + + } +}","function minCost(colors: string, neededTime: number[]): number { + +};","(define/contract (min-cost colors neededTime) + (-> string? (listof exact-integer?) exact-integer?) + + )","-spec min_cost(Colors :: unicode:unicode_binary(), NeededTime :: [integer()]) -> integer(). +min_cost(Colors, NeededTime) -> + .","defmodule Solution do + @spec min_cost(colors :: String.t, needed_time :: [integer]) :: integer + def min_cost(colors, needed_time) do + + end +end","class Solution { + int minCost(String colors, List neededTime) { + + } +}", +881,strange-printer-ii,Strange Printer II,1591.0,1696.0,"

There is a strange printer with the following two special requirements:

+ +
    +
  • On each turn, the printer will print a solid rectangular pattern of a single color on the grid. This will cover up the existing colors in the rectangle.
    • +
  • Once the printer has used a color for the above operation, the same color cannot be used again.
    • +
+ +

You are given a m x n matrix targetGrid, where targetGrid[row][col] is the color in the position (row, col) of the grid.

+ +

Return true if it is possible to print the matrix targetGrid, otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: targetGrid = [[1,1,1,1],[1,2,2,1],[1,2,2,1],[1,1,1,1]]
+Output: true
+
+ +

Example 2:

+ +
+Input: targetGrid = [[1,1,1,1],[1,1,3,3],[1,1,3,4],[5,5,1,4]]
+Output: true
+
+ +

Example 3:

+ +
+Input: targetGrid = [[1,2,1],[2,1,2],[1,2,1]]
+Output: false
+Explanation: It is impossible to form targetGrid because it is not allowed to print the same color in different turns.
+
+ +

 

+

Constraints:

+ +
    +
  • m == targetGrid.length
    • +
  • n == targetGrid[i].length
    • +
  • 1 <= m, n <= 60
    • +
  • 1 <= targetGrid[row][col] <= 60
    • +
+",3.0,False,"class Solution { +public: + bool isPrintable(vector>& targetGrid) { + + } +};","class Solution { + public boolean isPrintable(int[][] targetGrid) { + + } +}","class Solution(object): + def isPrintable(self, targetGrid): + """""" + :type targetGrid: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def isPrintable(self, targetGrid: List[List[int]]) -> bool: + ","bool isPrintable(int** targetGrid, int targetGridSize, int* targetGridColSize){ + +}","public class Solution { + public bool IsPrintable(int[][] targetGrid) { + + } +}","/** + * @param {number[][]} targetGrid + * @return {boolean} + */ +var isPrintable = function(targetGrid) { + +};","# @param {Integer[][]} target_grid +# @return {Boolean} +def is_printable(target_grid) + +end","class Solution { + func isPrintable(_ targetGrid: [[Int]]) -> Bool { + + } +}","func isPrintable(targetGrid [][]int) bool { + +}","object Solution { + def isPrintable(targetGrid: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun isPrintable(targetGrid: Array): Boolean { + + } +}","impl Solution { + pub fn is_printable(target_grid: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $targetGrid + * @return Boolean + */ + function isPrintable($targetGrid) { + + } +}","function isPrintable(targetGrid: number[][]): boolean { + +};","(define/contract (is-printable targetGrid) + (-> (listof (listof exact-integer?)) boolean?) + + )","-spec is_printable(TargetGrid :: [[integer()]]) -> boolean(). +is_printable(TargetGrid) -> + .","defmodule Solution do + @spec is_printable(target_grid :: [[integer]]) :: boolean + def is_printable(target_grid) do + + end +end","class Solution { + bool isPrintable(List> targetGrid) { + + } +}", +882,maximum-sum-obtained-of-any-permutation,Maximum Sum Obtained of Any Permutation,1589.0,1695.0,"

We have an array of integers, nums, and an array of requests where requests[i] = [starti, endi]. The ith request asks for the sum of nums[starti] + nums[starti + 1] + ... + nums[endi - 1] + nums[endi]. Both starti and endi are 0-indexed.

+ +

Return the maximum total sum of all requests among all permutations of nums.

+ +

Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5], requests = [[1,3],[0,1]]
+Output: 19
+Explanation: One permutation of nums is [2,1,3,4,5] with the following result: 
+requests[0] -> nums[1] + nums[2] + nums[3] = 1 + 3 + 4 = 8
+requests[1] -> nums[0] + nums[1] = 2 + 1 = 3
+Total sum: 8 + 3 = 11.
+A permutation with a higher total sum is [3,5,4,2,1] with the following result:
+requests[0] -> nums[1] + nums[2] + nums[3] = 5 + 4 + 2 = 11
+requests[1] -> nums[0] + nums[1] = 3 + 5  = 8
+Total sum: 11 + 8 = 19, which is the best that you can do.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,5,6], requests = [[0,1]]
+Output: 11
+Explanation: A permutation with the max total sum is [6,5,4,3,2,1] with request sums [11].
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,5,10], requests = [[0,2],[1,3],[1,1]]
+Output: 47
+Explanation: A permutation with the max total sum is [4,10,5,3,2,1] with request sums [19,18,10].
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= nums[i] <= 105
    • +
  • 1 <= requests.length <= 105
    • +
  • requests[i].length == 2
    • +
  • 0 <= starti <= endi < n
    • +
+",2.0,False,"class Solution { +public: + int maxSumRangeQuery(vector& nums, vector>& requests) { + + } +};","class Solution { + public int maxSumRangeQuery(int[] nums, int[][] requests) { + + } +}","class Solution(object): + def maxSumRangeQuery(self, nums, requests): + """""" + :type nums: List[int] + :type requests: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxSumRangeQuery(self, nums: List[int], requests: List[List[int]]) -> int: + ","int maxSumRangeQuery(int* nums, int numsSize, int** requests, int requestsSize, int* requestsColSize){ + +}","public class Solution { + public int MaxSumRangeQuery(int[] nums, int[][] requests) { + + } +}","/** + * @param {number[]} nums + * @param {number[][]} requests + * @return {number} + */ +var maxSumRangeQuery = function(nums, requests) { + +};","# @param {Integer[]} nums +# @param {Integer[][]} requests +# @return {Integer} +def max_sum_range_query(nums, requests) + +end","class Solution { + func maxSumRangeQuery(_ nums: [Int], _ requests: [[Int]]) -> Int { + + } +}","func maxSumRangeQuery(nums []int, requests [][]int) int { + +}","object Solution { + def maxSumRangeQuery(nums: Array[Int], requests: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxSumRangeQuery(nums: IntArray, requests: Array): Int { + + } +}","impl Solution { + pub fn max_sum_range_query(nums: Vec, requests: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer[][] $requests + * @return Integer + */ + function maxSumRangeQuery($nums, $requests) { + + } +}","function maxSumRangeQuery(nums: number[], requests: number[][]): number { + +};","(define/contract (max-sum-range-query nums requests) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_sum_range_query(Nums :: [integer()], Requests :: [[integer()]]) -> integer(). +max_sum_range_query(Nums, Requests) -> + .","defmodule Solution do + @spec max_sum_range_query(nums :: [integer], requests :: [[integer]]) :: integer + def max_sum_range_query(nums, requests) do + + end +end","class Solution { + int maxSumRangeQuery(List nums, List> requests) { + + } +}", +885,number-of-ways-to-reorder-array-to-get-same-bst,Number of Ways to Reorder Array to Get Same BST,1569.0,1692.0,"

Given an array nums that represents a permutation of integers from 1 to n. We are going to construct a binary search tree (BST) by inserting the elements of nums in order into an initially empty BST. Find the number of different ways to reorder nums so that the constructed BST is identical to that formed from the original array nums.

+ +
    +
  • For example, given nums = [2,1,3], we will have 2 as the root, 1 as a left child, and 3 as a right child. The array [2,3,1] also yields the same BST but [3,2,1] yields a different BST.
    • +
+ +

Return the number of ways to reorder nums such that the BST formed is identical to the original BST formed from nums.

+ +

Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,3]
+Output: 1
+Explanation: We can reorder nums to be [2,3,1] which will yield the same BST. There are no other ways to reorder nums which will yield the same BST.
+
+ +

Example 2:

+ +
+Input: nums = [3,4,5,1,2]
+Output: 5
+Explanation: The following 5 arrays will yield the same BST: 
+[3,1,2,4,5]
+[3,1,4,2,5]
+[3,1,4,5,2]
+[3,4,1,2,5]
+[3,4,1,5,2]
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3]
+Output: 0
+Explanation: There are no other orderings of nums that will yield the same BST.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= nums.length
    • +
  • All integers in nums are distinct.
    • +
+",3.0,False,"class Solution { +public: + int numOfWays(vector& nums) { + + } +};","class Solution { + public int numOfWays(int[] nums) { + + } +}","class Solution(object): + def numOfWays(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numOfWays(self, nums: List[int]) -> int: + ","int numOfWays(int* nums, int numsSize){ + +}","public class Solution { + public int NumOfWays(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numOfWays = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def num_of_ways(nums) + +end","class Solution { + func numOfWays(_ nums: [Int]) -> Int { + + } +}","func numOfWays(nums []int) int { + +}","object Solution { + def numOfWays(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numOfWays(nums: IntArray): Int { + + } +}","impl Solution { + pub fn num_of_ways(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numOfWays($nums) { + + } +}","function numOfWays(nums: number[]): number { + +};","(define/contract (num-of-ways nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec num_of_ways(Nums :: [integer()]) -> integer(). +num_of_ways(Nums) -> + .","defmodule Solution do + @spec num_of_ways(nums :: [integer]) :: integer + def num_of_ways(nums) do + + end +end","class Solution { + int numOfWays(List nums) { + + } +}", +886,minimum-number-of-days-to-disconnect-island,Minimum Number of Days to Disconnect Island,1568.0,1691.0,"

You are given an m x n binary grid grid where 1 represents land and 0 represents water. An island is a maximal 4-directionally (horizontal or vertical) connected group of 1's.

+ +

The grid is said to be connected if we have exactly one island, otherwise is said disconnected.

+ +

In one day, we are allowed to change any single land cell (1) into a water cell (0).

+ +

Return the minimum number of days to disconnect the grid.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,1,0],[0,1,1,0],[0,0,0,0]]
+
+Output: 2
+Explanation: We need at least 2 days to get a disconnected grid.
+Change land grid[1][1] and grid[0][2] to water and get 2 disconnected island.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1]]
+Output: 2
+Explanation: Grid of full water is also disconnected ([[1,1]] -> [[0,0]]), 0 islands.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 30
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",3.0,False,"class Solution { +public: + int minDays(vector>& grid) { + + } +};","class Solution { + public int minDays(int[][] grid) { + + } +}","class Solution(object): + def minDays(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minDays(self, grid: List[List[int]]) -> int: + ","int minDays(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinDays(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minDays = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def min_days(grid) + +end","class Solution { + func minDays(_ grid: [[Int]]) -> Int { + + } +}","func minDays(grid [][]int) int { + +}","object Solution { + def minDays(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minDays(grid: Array): Int { + + } +}","impl Solution { + pub fn min_days(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minDays($grid) { + + } +}","function minDays(grid: number[][]): number { + +};","(define/contract (min-days grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_days(Grid :: [[integer()]]) -> integer(). +min_days(Grid) -> + .","defmodule Solution do + @spec min_days(grid :: [[integer]]) :: integer + def min_days(grid) do + + end +end","class Solution { + int minDays(List> grid) { + + } +}", +887,maximum-length-of-subarray-with-positive-product,Maximum Length of Subarray With Positive Product,1567.0,1690.0,"

Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.

+ +

A subarray of an array is a consecutive sequence of zero or more values taken out of that array.

+ +

Return the maximum length of a subarray with positive product.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,-2,-3,4]
+Output: 4
+Explanation: The array nums already has a positive product of 24.
+
+ +

Example 2:

+ +
+Input: nums = [0,1,-2,-3,-4]
+Output: 3
+Explanation: The longest subarray with positive product is [1,-2,-3] which has a product of 6.
+Notice that we cannot include 0 in the subarray since that'll make the product 0 which is not positive.
+ +

Example 3:

+ +
+Input: nums = [-1,-2,-3,0,1]
+Output: 2
+Explanation: The longest subarray with positive product is [-1,-2] or [-2,-3].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int getMaxLen(vector& nums) { + + } +};","class Solution { + public int getMaxLen(int[] nums) { + + } +}","class Solution(object): + def getMaxLen(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def getMaxLen(self, nums: List[int]) -> int: + ","int getMaxLen(int* nums, int numsSize){ + +}","public class Solution { + public int GetMaxLen(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var getMaxLen = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def get_max_len(nums) + +end","class Solution { + func getMaxLen(_ nums: [Int]) -> Int { + + } +}","func getMaxLen(nums []int) int { + +}","object Solution { + def getMaxLen(nums: Array[Int]): Int = { + + } +}","class Solution { + fun getMaxLen(nums: IntArray): Int { + + } +}","impl Solution { + pub fn get_max_len(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function getMaxLen($nums) { + + } +}","function getMaxLen(nums: number[]): number { + +};","(define/contract (get-max-len nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec get_max_len(Nums :: [integer()]) -> integer(). +get_max_len(Nums) -> + .","defmodule Solution do + @spec get_max_len(nums :: [integer]) :: integer + def get_max_len(nums) do + + end +end","class Solution { + int getMaxLen(List nums) { + + } +}", +888,detect-pattern-of-length-m-repeated-k-or-more-times,Detect Pattern of Length M Repeated K or More Times,1566.0,1689.0,"

Given an array of positive integers arr, find a pattern of length m that is repeated k or more times.

+ +

A pattern is a subarray (consecutive sub-sequence) that consists of one or more values, repeated multiple times consecutively without overlapping. A pattern is defined by its length and the number of repetitions.

+ +

Return true if there exists a pattern of length m that is repeated k or more times, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,4,4,4,4], m = 1, k = 3
+Output: true
+Explanation: The pattern (4) of length 1 is repeated 4 consecutive times. Notice that pattern can be repeated k or more times but not less.
+
+ +

Example 2:

+ +
+Input: arr = [1,2,1,2,1,1,1,3], m = 2, k = 2
+Output: true
+Explanation: The pattern (1,2) of length 2 is repeated 2 consecutive times. Another valid pattern (2,1) is also repeated 2 times.
+
+ +

Example 3:

+ +
+Input: arr = [1,2,1,2,1,3], m = 2, k = 3
+Output: false
+Explanation: The pattern (1,2) is of length 2 but is repeated only 2 times. There is no pattern of length 2 that is repeated 3 or more times.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= arr.length <= 100
    • +
  • 1 <= arr[i] <= 100
    • +
  • 1 <= m <= 100
    • +
  • 2 <= k <= 100
    • +
+",1.0,False,"class Solution { +public: + bool containsPattern(vector& arr, int m, int k) { + + } +};","class Solution { + public boolean containsPattern(int[] arr, int m, int k) { + + } +}","class Solution(object): + def containsPattern(self, arr, m, k): + """""" + :type arr: List[int] + :type m: int + :type k: int + :rtype: bool + """""" + ","class Solution: + def containsPattern(self, arr: List[int], m: int, k: int) -> bool: + ","bool containsPattern(int* arr, int arrSize, int m, int k){ + +}","public class Solution { + public bool ContainsPattern(int[] arr, int m, int k) { + + } +}","/** + * @param {number[]} arr + * @param {number} m + * @param {number} k + * @return {boolean} + */ +var containsPattern = function(arr, m, k) { + +};","# @param {Integer[]} arr +# @param {Integer} m +# @param {Integer} k +# @return {Boolean} +def contains_pattern(arr, m, k) + +end","class Solution { + func containsPattern(_ arr: [Int], _ m: Int, _ k: Int) -> Bool { + + } +}","func containsPattern(arr []int, m int, k int) bool { + +}","object Solution { + def containsPattern(arr: Array[Int], m: Int, k: Int): Boolean = { + + } +}","class Solution { + fun containsPattern(arr: IntArray, m: Int, k: Int): Boolean { + + } +}","impl Solution { + pub fn contains_pattern(arr: Vec, m: i32, k: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $m + * @param Integer $k + * @return Boolean + */ + function containsPattern($arr, $m, $k) { + + } +}","function containsPattern(arr: number[], m: number, k: number): boolean { + +};","(define/contract (contains-pattern arr m k) + (-> (listof exact-integer?) exact-integer? exact-integer? boolean?) + + )","-spec contains_pattern(Arr :: [integer()], M :: integer(), K :: integer()) -> boolean(). +contains_pattern(Arr, M, K) -> + .","defmodule Solution do + @spec contains_pattern(arr :: [integer], m :: integer, k :: integer) :: boolean + def contains_pattern(arr, m, k) do + + end +end","class Solution { + bool containsPattern(List arr, int m, int k) { + + } +}", +889,stone-game-v,Stone Game V,1563.0,1685.0,"

There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue.

+ +

In each round of the game, Alice divides the row into two non-empty rows (i.e. left row and right row), then Bob calculates the value of each row which is the sum of the values of all the stones in this row. Bob throws away the row which has the maximum value, and Alice's score increases by the value of the remaining row. If the value of the two rows are equal, Bob lets Alice decide which row will be thrown away. The next round starts with the remaining row.

+ +

The game ends when there is only one stone remaining. Alice's is initially zero.

+ +

Return the maximum score that Alice can obtain.

+ +

 

+

Example 1:

+ +
+Input: stoneValue = [6,2,3,4,5,5]
+Output: 18
+Explanation: In the first round, Alice divides the row to [6,2,3], [4,5,5]. The left row has the value 11 and the right row has value 14. Bob throws away the right row and Alice's score is now 11.
+In the second round Alice divides the row to [6], [2,3]. This time Bob throws away the left row and Alice's score becomes 16 (11 + 5).
+The last round Alice has only one choice to divide the row which is [2], [3]. Bob throws away the right row and Alice's score is now 18 (16 + 2). The game ends because only one stone is remaining in the row.
+
+ +

Example 2:

+ +
+Input: stoneValue = [7,7,7,7,7,7,7]
+Output: 28
+
+ +

Example 3:

+ +
+Input: stoneValue = [4]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= stoneValue.length <= 500
    • +
  • 1 <= stoneValue[i] <= 106
    • +
+",3.0,False,"class Solution { +public: + int stoneGameV(vector& stoneValue) { + + } +};","class Solution { + public int stoneGameV(int[] stoneValue) { + + } +}","class Solution(object): + def stoneGameV(self, stoneValue): + """""" + :type stoneValue: List[int] + :rtype: int + """""" + ","class Solution: + def stoneGameV(self, stoneValue: List[int]) -> int: + ","int stoneGameV(int* stoneValue, int stoneValueSize){ + +}","public class Solution { + public int StoneGameV(int[] stoneValue) { + + } +}","/** + * @param {number[]} stoneValue + * @return {number} + */ +var stoneGameV = function(stoneValue) { + +};","# @param {Integer[]} stone_value +# @return {Integer} +def stone_game_v(stone_value) + +end","class Solution { + func stoneGameV(_ stoneValue: [Int]) -> Int { + + } +}","func stoneGameV(stoneValue []int) int { + +}","object Solution { + def stoneGameV(stoneValue: Array[Int]): Int = { + + } +}","class Solution { + fun stoneGameV(stoneValue: IntArray): Int { + + } +}","impl Solution { + pub fn stone_game_v(stone_value: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $stoneValue + * @return Integer + */ + function stoneGameV($stoneValue) { + + } +}","function stoneGameV(stoneValue: number[]): number { + +};","(define/contract (stone-game-v stoneValue) + (-> (listof exact-integer?) exact-integer?) + + )","-spec stone_game_v(StoneValue :: [integer()]) -> integer(). +stone_game_v(StoneValue) -> + .","defmodule Solution do + @spec stone_game_v(stone_value :: [integer]) :: integer + def stone_game_v(stone_value) do + + end +end","class Solution { + int stoneGameV(List stoneValue) { + + } +}", +891,maximum-number-of-coins-you-can-get,Maximum Number of Coins You Can Get,1561.0,1683.0,"

There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows:

+ +
    +
  • In each step, you will choose any 3 piles of coins (not necessarily consecutive).
    • +
  • Of your choice, Alice will pick the pile with the maximum number of coins.
    • +
  • You will pick the next pile with the maximum number of coins.
    • +
  • Your friend Bob will pick the last pile.
    • +
  • Repeat until there are no more piles of coins.
    • +
+ +

Given an array of integers piles where piles[i] is the number of coins in the ith pile.

+ +

Return the maximum number of coins that you can have.

+ +

 

+

Example 1:

+ +
+Input: piles = [2,4,1,2,7,8]
+Output: 9
+Explanation: Choose the triplet (2, 7, 8), Alice Pick the pile with 8 coins, you the pile with 7 coins and Bob the last one.
+Choose the triplet (1, 2, 4), Alice Pick the pile with 4 coins, you the pile with 2 coins and Bob the last one.
+The maximum number of coins which you can have are: 7 + 2 = 9.
+On the other hand if we choose this arrangement (1, 2, 8), (2, 4, 7) you only get 2 + 4 = 6 coins which is not optimal.
+
+ +

Example 2:

+ +
+Input: piles = [2,4,5]
+Output: 4
+
+ +

Example 3:

+ +
+Input: piles = [9,8,7,6,5,1,2,3,4]
+Output: 18
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= piles.length <= 105
    • +
  • piles.length % 3 == 0
    • +
  • 1 <= piles[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int maxCoins(vector& piles) { + + } +};","class Solution { + public int maxCoins(int[] piles) { + + } +}","class Solution(object): + def maxCoins(self, piles): + """""" + :type piles: List[int] + :rtype: int + """""" + ","class Solution: + def maxCoins(self, piles: List[int]) -> int: + ","int maxCoins(int* piles, int pilesSize){ + +}","public class Solution { + public int MaxCoins(int[] piles) { + + } +}","/** + * @param {number[]} piles + * @return {number} + */ +var maxCoins = function(piles) { + +};","# @param {Integer[]} piles +# @return {Integer} +def max_coins(piles) + +end","class Solution { + func maxCoins(_ piles: [Int]) -> Int { + + } +}","func maxCoins(piles []int) int { + +}","object Solution { + def maxCoins(piles: Array[Int]): Int = { + + } +}","class Solution { + fun maxCoins(piles: IntArray): Int { + + } +}","impl Solution { + pub fn max_coins(piles: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $piles + * @return Integer + */ + function maxCoins($piles) { + + } +}","function maxCoins(piles: number[]): number { + +};","(define/contract (max-coins piles) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_coins(Piles :: [integer()]) -> integer(). +max_coins(Piles) -> + .","defmodule Solution do + @spec max_coins(piles :: [integer]) :: integer + def max_coins(piles) do + + end +end","class Solution { + int maxCoins(List piles) { + + } +}", +893,count-all-possible-routes,Count All Possible Routes,1575.0,1680.0,"

You are given an array of distinct positive integers locations where locations[i] represents the position of city i. You are also given integers start, finish and fuel representing the starting city, ending city, and the initial amount of fuel you have, respectively.

+ +

At each step, if you are at city i, you can pick any city j such that j != i and 0 <= j < locations.length and move to city j. Moving from city i to city j reduces the amount of fuel you have by |locations[i] - locations[j]|. Please notice that |x| denotes the absolute value of x.

+ +

Notice that fuel cannot become negative at any point in time, and that you are allowed to visit any city more than once (including start and finish).

+ +

Return the count of all possible routes from start to finish. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: locations = [2,3,6,8,4], start = 1, finish = 3, fuel = 5
+Output: 4
+Explanation: The following are all possible routes, each uses 5 units of fuel:
+1 -> 3
+1 -> 2 -> 3
+1 -> 4 -> 3
+1 -> 4 -> 2 -> 3
+
+ +

Example 2:

+ +
+Input: locations = [4,3,1], start = 1, finish = 0, fuel = 6
+Output: 5
+Explanation: The following are all possible routes:
+1 -> 0, used fuel = 1
+1 -> 2 -> 0, used fuel = 5
+1 -> 2 -> 1 -> 0, used fuel = 5
+1 -> 0 -> 1 -> 0, used fuel = 3
+1 -> 0 -> 1 -> 0 -> 1 -> 0, used fuel = 5
+
+ +

Example 3:

+ +
+Input: locations = [5,2,1], start = 0, finish = 2, fuel = 3
+Output: 0
+Explanation: It is impossible to get from 0 to 2 using only 3 units of fuel since the shortest route needs 4 units of fuel.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= locations.length <= 100
    • +
  • 1 <= locations[i] <= 109
    • +
  • All integers in locations are distinct.
    • +
  • 0 <= start, finish < locations.length
    • +
  • 1 <= fuel <= 200
    • +
+",3.0,False,"class Solution { +public: + int countRoutes(vector& locations, int start, int finish, int fuel) { + + } +};","class Solution { + public int countRoutes(int[] locations, int start, int finish, int fuel) { + + } +}","class Solution(object): + def countRoutes(self, locations, start, finish, fuel): + """""" + :type locations: List[int] + :type start: int + :type finish: int + :type fuel: int + :rtype: int + """""" + ","class Solution: + def countRoutes(self, locations: List[int], start: int, finish: int, fuel: int) -> int: + ","int countRoutes(int* locations, int locationsSize, int start, int finish, int fuel){ + +}","public class Solution { + public int CountRoutes(int[] locations, int start, int finish, int fuel) { + + } +}","/** + * @param {number[]} locations + * @param {number} start + * @param {number} finish + * @param {number} fuel + * @return {number} + */ +var countRoutes = function(locations, start, finish, fuel) { + +};","# @param {Integer[]} locations +# @param {Integer} start +# @param {Integer} finish +# @param {Integer} fuel +# @return {Integer} +def count_routes(locations, start, finish, fuel) + +end","class Solution { + func countRoutes(_ locations: [Int], _ start: Int, _ finish: Int, _ fuel: Int) -> Int { + + } +}","func countRoutes(locations []int, start int, finish int, fuel int) int { + +}","object Solution { + def countRoutes(locations: Array[Int], start: Int, finish: Int, fuel: Int): Int = { + + } +}","class Solution { + fun countRoutes(locations: IntArray, start: Int, finish: Int, fuel: Int): Int { + + } +}","impl Solution { + pub fn count_routes(locations: Vec, start: i32, finish: i32, fuel: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $locations + * @param Integer $start + * @param Integer $finish + * @param Integer $fuel + * @return Integer + */ + function countRoutes($locations, $start, $finish, $fuel) { + + } +}","function countRoutes(locations: number[], start: number, finish: number, fuel: number): number { + +};","(define/contract (count-routes locations start finish fuel) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec count_routes(Locations :: [integer()], Start :: integer(), Finish :: integer(), Fuel :: integer()) -> integer(). +count_routes(Locations, Start, Finish, Fuel) -> + .","defmodule Solution do + @spec count_routes(locations :: [integer], start :: integer, finish :: integer, fuel :: integer) :: integer + def count_routes(locations, start, finish, fuel) do + + end +end","class Solution { + int countRoutes(List locations, int start, int finish, int fuel) { + + } +}", +894,shortest-subarray-to-be-removed-to-make-array-sorted,Shortest Subarray to be Removed to Make Array Sorted,1574.0,1679.0,"

Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing.

+ +

Return the length of the shortest subarray to remove.

+ +

A subarray is a contiguous subsequence of the array.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,10,4,2,3,5]
+Output: 3
+Explanation: The shortest subarray we can remove is [10,4,2] of length 3. The remaining elements after that will be [1,2,3,3,5] which are sorted.
+Another correct solution is to remove the subarray [3,10,4].
+
+ +

Example 2:

+ +
+Input: arr = [5,4,3,2,1]
+Output: 4
+Explanation: Since the array is strictly decreasing, we can only keep a single element. Therefore we need to remove a subarray of length 4, either [5,4,3,2] or [4,3,2,1].
+
+ +

Example 3:

+ +
+Input: arr = [1,2,3]
+Output: 0
+Explanation: The array is already non-decreasing. We do not need to remove any elements.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 0 <= arr[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int findLengthOfShortestSubarray(vector& arr) { + + } +};","class Solution { + public int findLengthOfShortestSubarray(int[] arr) { + + } +}","class Solution(object): + def findLengthOfShortestSubarray(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def findLengthOfShortestSubarray(self, arr: List[int]) -> int: + ","int findLengthOfShortestSubarray(int* arr, int arrSize){ + +}","public class Solution { + public int FindLengthOfShortestSubarray(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var findLengthOfShortestSubarray = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def find_length_of_shortest_subarray(arr) + +end","class Solution { + func findLengthOfShortestSubarray(_ arr: [Int]) -> Int { + + } +}","func findLengthOfShortestSubarray(arr []int) int { + +}","object Solution { + def findLengthOfShortestSubarray(arr: Array[Int]): Int = { + + } +}","class Solution { + fun findLengthOfShortestSubarray(arr: IntArray): Int { + + } +}","impl Solution { + pub fn find_length_of_shortest_subarray(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function findLengthOfShortestSubarray($arr) { + + } +}","function findLengthOfShortestSubarray(arr: number[]): number { + +};","(define/contract (find-length-of-shortest-subarray arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_length_of_shortest_subarray(Arr :: [integer()]) -> integer(). +find_length_of_shortest_subarray(Arr) -> + .","defmodule Solution do + @spec find_length_of_shortest_subarray(arr :: [integer]) :: integer + def find_length_of_shortest_subarray(arr) do + + end +end","class Solution { + int findLengthOfShortestSubarray(List arr) { + + } +}", +895,number-of-ways-to-split-a-string,Number of Ways to Split a String,1573.0,1678.0,"

Given a binary string s, you can split s into 3 non-empty strings s1, s2, and s3 where s1 + s2 + s3 = s.

+ +

Return the number of ways s can be split such that the number of ones is the same in s1, s2, and s3. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "10101"
+Output: 4
+Explanation: There are four ways to split s in 3 parts where each part contain the same number of letters '1'.
+"1|010|1"
+"1|01|01"
+"10|10|1"
+"10|1|01"
+
+ +

Example 2:

+ +
+Input: s = "1001"
+Output: 0
+
+ +

Example 3:

+ +
+Input: s = "0000"
+Output: 3
+Explanation: There are three ways to split s in 3 parts.
+"0|0|00"
+"0|00|0"
+"00|0|0"
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= s.length <= 105
    • +
  • s[i] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + int numWays(string s) { + + } +};","class Solution { + public int numWays(String s) { + + } +}","class Solution(object): + def numWays(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def numWays(self, s: str) -> int: + ","int numWays(char * s){ + +}","public class Solution { + public int NumWays(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var numWays = function(s) { + +};","# @param {String} s +# @return {Integer} +def num_ways(s) + +end","class Solution { + func numWays(_ s: String) -> Int { + + } +}","func numWays(s string) int { + +}","object Solution { + def numWays(s: String): Int = { + + } +}","class Solution { + fun numWays(s: String): Int { + + } +}","impl Solution { + pub fn num_ways(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function numWays($s) { + + } +}","function numWays(s: string): number { + +};","(define/contract (num-ways s) + (-> string? exact-integer?) + + )","-spec num_ways(S :: unicode:unicode_binary()) -> integer(). +num_ways(S) -> + .","defmodule Solution do + @spec num_ways(s :: String.t) :: integer + def num_ways(s) do + + end +end","class Solution { + int numWays(String s) { + + } +}", +897,minimum-number-of-days-to-eat-n-oranges,Minimum Number of Days to Eat N Oranges,1553.0,1676.0,"

There are n oranges in the kitchen and you decided to eat some of these oranges every day as follows:

+ +
    +
  • Eat one orange.
    • +
  • If the number of remaining oranges n is divisible by 2 then you can eat n / 2 oranges.
    • +
  • If the number of remaining oranges n is divisible by 3 then you can eat 2 * (n / 3) oranges.
    • +
+ +

You can only choose one of the actions per day.

+ +

Given the integer n, return the minimum number of days to eat n oranges.

+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 4
+Explanation: You have 10 oranges.
+Day 1: Eat 1 orange,  10 - 1 = 9.  
+Day 2: Eat 6 oranges, 9 - 2*(9/3) = 9 - 6 = 3. (Since 9 is divisible by 3)
+Day 3: Eat 2 oranges, 3 - 2*(3/3) = 3 - 2 = 1. 
+Day 4: Eat the last orange  1 - 1  = 0.
+You need at least 4 days to eat the 10 oranges.
+
+ +

Example 2:

+ +
+Input: n = 6
+Output: 3
+Explanation: You have 6 oranges.
+Day 1: Eat 3 oranges, 6 - 6/2 = 6 - 3 = 3. (Since 6 is divisible by 2).
+Day 2: Eat 2 oranges, 3 - 2*(3/3) = 3 - 2 = 1. (Since 3 is divisible by 3)
+Day 3: Eat the last orange  1 - 1  = 0.
+You need at least 3 days to eat the 6 oranges.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 109
    • +
+",3.0,False,"class Solution { +public: + int minDays(int n) { + + } +};","class Solution { + public int minDays(int n) { + + } +}","class Solution(object): + def minDays(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def minDays(self, n: int) -> int: + ","int minDays(int n){ + +}","public class Solution { + public int MinDays(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var minDays = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def min_days(n) + +end","class Solution { + func minDays(_ n: Int) -> Int { + + } +}","func minDays(n int) int { + +}","object Solution { + def minDays(n: Int): Int = { + + } +}","class Solution { + fun minDays(n: Int): Int { + + } +}","impl Solution { + pub fn min_days(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function minDays($n) { + + } +}","function minDays(n: number): number { + +};",,,,"class Solution { + int minDays(int n) { + + } +}", +898,magnetic-force-between-two-balls,Magnetic Force Between Two Balls,1552.0,1675.0,"

In the universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n empty baskets, the ith basket is at position[i], Morty has m balls and needs to distribute the balls into the baskets such that the minimum magnetic force between any two balls is maximum.

+ +

Rick stated that magnetic force between two different balls at positions x and y is |x - y|.

+ +

Given the integer array position and the integer m. Return the required force.

+ +

 

+

Example 1:

+ +
+Input: position = [1,2,3,4,7], m = 3
+Output: 3
+Explanation: Distributing the 3 balls into baskets 1, 4 and 7 will make the magnetic force between ball pairs [3, 3, 6]. The minimum magnetic force is 3. We cannot achieve a larger minimum magnetic force than 3.
+
+ +

Example 2:

+ +
+Input: position = [5,4,3,2,1,1000000000], m = 2
+Output: 999999999
+Explanation: We can use baskets 1 and 1000000000.
+
+ +

 

+

Constraints:

+ +
    +
  • n == position.length
    • +
  • 2 <= n <= 105
    • +
  • 1 <= position[i] <= 109
    • +
  • All integers in position are distinct.
    • +
  • 2 <= m <= position.length
    • +
+",2.0,False,"class Solution { +public: + int maxDistance(vector& position, int m) { + + } +};","class Solution { + public int maxDistance(int[] position, int m) { + + } +}","class Solution(object): + def maxDistance(self, position, m): + """""" + :type position: List[int] + :type m: int + :rtype: int + """""" + ","class Solution: + def maxDistance(self, position: List[int], m: int) -> int: + ","int maxDistance(int* position, int positionSize, int m){ + +}","public class Solution { + public int MaxDistance(int[] position, int m) { + + } +}","/** + * @param {number[]} position + * @param {number} m + * @return {number} + */ +var maxDistance = function(position, m) { + +};","# @param {Integer[]} position +# @param {Integer} m +# @return {Integer} +def max_distance(position, m) + +end","class Solution { + func maxDistance(_ position: [Int], _ m: Int) -> Int { + + } +}","func maxDistance(position []int, m int) int { + +}","object Solution { + def maxDistance(position: Array[Int], m: Int): Int = { + + } +}","class Solution { + fun maxDistance(position: IntArray, m: Int): Int { + + } +}","impl Solution { + pub fn max_distance(position: Vec, m: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $position + * @param Integer $m + * @return Integer + */ + function maxDistance($position, $m) { + + } +}","function maxDistance(position: number[], m: number): number { + +};","(define/contract (max-distance position m) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec max_distance(Position :: [integer()], M :: integer()) -> integer(). +max_distance(Position, M) -> + .","defmodule Solution do + @spec max_distance(position :: [integer], m :: integer) :: integer + def max_distance(position, m) do + + end +end","class Solution { + int maxDistance(List position, int m) { + + } +}", +899,minimum-operations-to-make-array-equal,Minimum Operations to Make Array Equal,1551.0,1674.0,"

You have an array arr of length n where arr[i] = (2 * i) + 1 for all valid values of i (i.e., 0 <= i < n).

+ +

In one operation, you can select two indices x and y where 0 <= x, y < n and subtract 1 from arr[x] and add 1 to arr[y] (i.e., perform arr[x] -=1 and arr[y] += 1). The goal is to make all the elements of the array equal. It is guaranteed that all the elements of the array can be made equal using some operations.

+ +

Given an integer n, the length of the array, return the minimum number of operations needed to make all the elements of arr equal.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 2
+Explanation: arr = [1, 3, 5]
+First operation choose x = 2 and y = 0, this leads arr to be [2, 3, 4]
+In the second operation choose x = 2 and y = 0 again, thus arr = [3, 3, 3].
+
+ +

Example 2:

+ +
+Input: n = 6
+Output: 9
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",2.0,False,"class Solution { +public: + int minOperations(int n) { + + } +};","class Solution { + public int minOperations(int n) { + + } +}","class Solution(object): + def minOperations(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def minOperations(self, n: int) -> int: + ","int minOperations(int n){ + +}","public class Solution { + public int MinOperations(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var minOperations = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def min_operations(n) + +end","class Solution { + func minOperations(_ n: Int) -> Int { + + } +}","func minOperations(n int) int { + +}","object Solution { + def minOperations(n: Int): Int = { + + } +}","class Solution { + fun minOperations(n: Int): Int { + + } +}","impl Solution { + pub fn min_operations(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function minOperations($n) { + + } +}","function minOperations(n: number): number { + +};",,,,"class Solution { + int minOperations(int n) { + + } +}", +900,minimum-cost-to-cut-a-stick,Minimum Cost to Cut a Stick,1547.0,1669.0,"

Given a wooden stick of length n units. The stick is labelled from 0 to n. For example, a stick of length 6 is labelled as follows:

+ +

Given an integer array cuts where cuts[i] denotes a position you should perform a cut at.

+ +

You should perform the cuts in order, you can change the order of the cuts as you wish.

+ +

The cost of one cut is the length of the stick to be cut, the total cost is the sum of costs of all cuts. When you cut a stick, it will be split into two smaller sticks (i.e. the sum of their lengths is the length of the stick before the cut). Please refer to the first example for a better explanation.

+ +

Return the minimum total cost of the cuts.

+ +

 

+

Example 1:

+ +
+Input: n = 7, cuts = [1,3,4,5]
+Output: 16
+Explanation: Using cuts order = [1, 3, 4, 5] as in the input leads to the following scenario:
+
+The first cut is done to a rod of length 7 so the cost is 7. The second cut is done to a rod of length 6 (i.e. the second part of the first cut), the third is done to a rod of length 4 and the last cut is to a rod of length 3. The total cost is 7 + 6 + 4 + 3 = 20.
+Rearranging the cuts to be [3, 5, 1, 4] for example will lead to a scenario with total cost = 16 (as shown in the example photo 7 + 4 + 3 + 2 = 16).
+ +

Example 2:

+ +
+Input: n = 9, cuts = [5,6,1,4,2]
+Output: 22
+Explanation: If you try the given cuts ordering the cost will be 25.
+There are much ordering with total cost <= 25, for example, the order [4, 6, 5, 2, 1] has total cost = 22 which is the minimum possible.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 106
    • +
  • 1 <= cuts.length <= min(n - 1, 100)
    • +
  • 1 <= cuts[i] <= n - 1
    • +
  • All the integers in cuts array are distinct.
    • +
+",3.0,False,"class Solution { +public: + int minCost(int n, vector& cuts) { + + } +};","class Solution { + public int minCost(int n, int[] cuts) { + + } +}","class Solution(object): + def minCost(self, n, cuts): + """""" + :type n: int + :type cuts: List[int] + :rtype: int + """""" + ","class Solution: + def minCost(self, n: int, cuts: List[int]) -> int: + ","int minCost(int n, int* cuts, int cutsSize){ + +}","public class Solution { + public int MinCost(int n, int[] cuts) { + + } +}","/** + * @param {number} n + * @param {number[]} cuts + * @return {number} + */ +var minCost = function(n, cuts) { + +};","# @param {Integer} n +# @param {Integer[]} cuts +# @return {Integer} +def min_cost(n, cuts) + +end","class Solution { + func minCost(_ n: Int, _ cuts: [Int]) -> Int { + + } +}","func minCost(n int, cuts []int) int { + +}","object Solution { + def minCost(n: Int, cuts: Array[Int]): Int = { + + } +}","class Solution { + fun minCost(n: Int, cuts: IntArray): Int { + + } +}","impl Solution { + pub fn min_cost(n: i32, cuts: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $cuts + * @return Integer + */ + function minCost($n, $cuts) { + + } +}","function minCost(n: number, cuts: number[]): number { + +};",,,,"class Solution { + int minCost(int n, List cuts) { + + } +}", +901,find-longest-awesome-substring,Find Longest Awesome Substring,1542.0,1668.0,"

You are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome.

+ +

Return the length of the maximum length awesome substring of s.

+ +

 

+

Example 1:

+ +
+Input: s = "3242415"
+Output: 5
+Explanation: "24241" is the longest awesome substring, we can form the palindrome "24142" with some swaps.
+
+ +

Example 2:

+ +
+Input: s = "12345678"
+Output: 1
+
+ +

Example 3:

+ +
+Input: s = "213123"
+Output: 6
+Explanation: "213123" is the longest awesome substring, we can form the palindrome "231132" with some swaps.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists only of digits.
    • +
+",3.0,False,"class Solution { +public: + int longestAwesome(string s) { + + } +};","class Solution { + public int longestAwesome(String s) { + + } +}","class Solution(object): + def longestAwesome(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def longestAwesome(self, s: str) -> int: + ","int longestAwesome(char * s){ + +}","public class Solution { + public int LongestAwesome(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var longestAwesome = function(s) { + +};","# @param {String} s +# @return {Integer} +def longest_awesome(s) + +end","class Solution { + func longestAwesome(_ s: String) -> Int { + + } +}","func longestAwesome(s string) int { + +}","object Solution { + def longestAwesome(s: String): Int = { + + } +}","class Solution { + fun longestAwesome(s: String): Int { + + } +}","impl Solution { + pub fn longest_awesome(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function longestAwesome($s) { + + } +}","function longestAwesome(s: string): number { + +};","(define/contract (longest-awesome s) + (-> string? exact-integer?) + + )","-spec longest_awesome(S :: unicode:unicode_binary()) -> integer(). +longest_awesome(S) -> + .","defmodule Solution do + @spec longest_awesome(s :: String.t) :: integer + def longest_awesome(s) do + + end +end","class Solution { + int longestAwesome(String s) { + + } +}", +904,detect-cycles-in-2d-grid,Detect Cycles in 2D Grid,1559.0,1663.0,"

Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid.

+ +

A cycle is a path of length 4 or more in the grid that starts and ends at the same cell. From a given cell, you can move to one of the cells adjacent to it - in one of the four directions (up, down, left, or right), if it has the same value of the current cell.

+ +

Also, you cannot move to the cell that you visited in your last move. For example, the cycle (1, 1) -> (1, 2) -> (1, 1) is invalid because from (1, 2) we visited (1, 1) which was the last visited cell.

+ +

Return true if any cycle of the same value exists in grid, otherwise, return false.

+ +

 

+

Example 1:

+ +

+ +
+Input: grid = [["a","a","a","a"],["a","b","b","a"],["a","b","b","a"],["a","a","a","a"]]
+Output: true
+Explanation: There are two valid cycles shown in different colors in the image below:
+
+
+ +

Example 2:

+ +

+ +
+Input: grid = [["c","c","c","a"],["c","d","c","c"],["c","c","e","c"],["f","c","c","c"]]
+Output: true
+Explanation: There is only one valid cycle highlighted in the image below:
+
+
+ +

Example 3:

+ +

+ +
+Input: grid = [["a","b","b"],["b","z","b"],["b","b","a"]]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 500
    • +
  • grid consists only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + bool containsCycle(vector>& grid) { + + } +};","class Solution { + public boolean containsCycle(char[][] grid) { + + } +}","class Solution(object): + def containsCycle(self, grid): + """""" + :type grid: List[List[str]] + :rtype: bool + """""" + ","class Solution: + def containsCycle(self, grid: List[List[str]]) -> bool: + ","bool containsCycle(char** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public bool ContainsCycle(char[][] grid) { + + } +}","/** + * @param {character[][]} grid + * @return {boolean} + */ +var containsCycle = function(grid) { + +};","# @param {Character[][]} grid +# @return {Boolean} +def contains_cycle(grid) + +end","class Solution { + func containsCycle(_ grid: [[Character]]) -> Bool { + + } +}","func containsCycle(grid [][]byte) bool { + +}","object Solution { + def containsCycle(grid: Array[Array[Char]]): Boolean = { + + } +}","class Solution { + fun containsCycle(grid: Array): Boolean { + + } +}","impl Solution { + pub fn contains_cycle(grid: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param String[][] $grid + * @return Boolean + */ + function containsCycle($grid) { + + } +}","function containsCycle(grid: string[][]): boolean { + +};","(define/contract (contains-cycle grid) + (-> (listof (listof char?)) boolean?) + + )","-spec contains_cycle(Grid :: [[char()]]) -> boolean(). +contains_cycle(Grid) -> + .","defmodule Solution do + @spec contains_cycle(grid :: [[char]]) :: boolean + def contains_cycle(grid) do + + end +end","class Solution { + bool containsCycle(List> grid) { + + } +}", +905,minimum-numbers-of-function-calls-to-make-target-array,Minimum Numbers of Function Calls to Make Target Array,1558.0,1662.0,"

You are given an integer array nums. You have an integer array arr of the same length with all values set to 0 initially. You also have the following modify function:

+ +

You want to use the modify function to convert arr to nums using the minimum number of calls.

+ +

Return the minimum number of function calls to make nums from arr.

+ +

The test cases are generated so that the answer fits in a 32-bit signed integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5]
+Output: 5
+Explanation: Increment by 1 (second element): [0, 0] to get [0, 1] (1 operation).
+Double all the elements: [0, 1] -> [0, 2] -> [0, 4] (2 operations).
+Increment by 1 (both elements)  [0, 4] -> [1, 4] -> [1, 5] (2 operations).
+Total of operations: 1 + 2 + 2 = 5.
+
+ +

Example 2:

+ +
+Input: nums = [2,2]
+Output: 3
+Explanation: Increment by 1 (both elements) [0, 0] -> [0, 1] -> [1, 1] (2 operations).
+Double all the elements: [1, 1] -> [2, 2] (1 operation).
+Total of operations: 2 + 1 = 3.
+
+ +

Example 3:

+ +
+Input: nums = [4,2,5]
+Output: 6
+Explanation: (initial)[0,0,0] -> [1,0,0] -> [1,0,1] -> [2,0,2] -> [2,1,2] -> [4,2,4] -> [4,2,5](nums).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int minOperations(vector& nums) { + + } +};","class Solution { + public int minOperations(int[] nums) { + + } +}","class Solution(object): + def minOperations(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minOperations(self, nums: List[int]) -> int: + ","int minOperations(int* nums, int numsSize){ + +}","public class Solution { + public int MinOperations(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_operations(nums) + +end","class Solution { + func minOperations(_ nums: [Int]) -> Int { + + } +}","func minOperations(nums []int) int { + +}","object Solution { + def minOperations(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minOperations(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_operations(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minOperations($nums) { + + } +}","function minOperations(nums: number[]): number { + +};","(define/contract (min-operations nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_operations(Nums :: [integer()]) -> integer(). +min_operations(Nums) -> + .","defmodule Solution do + @spec min_operations(nums :: [integer]) :: integer + def min_operations(nums) do + + end +end","class Solution { + int minOperations(List nums) { + + } +}", +906,minimum-number-of-vertices-to-reach-all-nodes,Minimum Number of Vertices to Reach All Nodes,1557.0,1661.0,"

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi.

+ +

Find the smallest set of vertices from which all nodes in the graph are reachable. It's guaranteed that a unique solution exists.

+ +

Notice that you can return the vertices in any order.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 6, edges = [[0,1],[0,2],[2,5],[3,4],[4,2]]
+Output: [0,3]
+Explanation: It's not possible to reach all the nodes from a single vertex. From 0 we can reach [0,1,2,5]. From 3 we can reach [3,4,2,5]. So we output [0,3].
+ +

Example 2:

+ +

+ +
+Input: n = 5, edges = [[0,1],[2,1],[3,1],[1,4],[2,4]]
+Output: [0,2,3]
+Explanation: Notice that vertices 0, 3 and 2 are not reachable from any other node, so we must include them. Also any of these vertices can reach nodes 1 and 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 10^5
    • +
  • 1 <= edges.length <= min(10^5, n * (n - 1) / 2)
    • +
  • edges[i].length == 2
    • +
  • 0 <= fromi, toi < n
    • +
  • All pairs (fromi, toi) are distinct.
    • +
+",2.0,False,"class Solution { +public: + vector findSmallestSetOfVertices(int n, vector>& edges) { + + } +};","class Solution { + public List findSmallestSetOfVertices(int n, List> edges) { + + } +}","class Solution(object): + def findSmallestSetOfVertices(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]: + "," + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findSmallestSetOfVertices(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public IList FindSmallestSetOfVertices(int n, IList> edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var findSmallestSetOfVertices = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer[]} +def find_smallest_set_of_vertices(n, edges) + +end","class Solution { + func findSmallestSetOfVertices(_ n: Int, _ edges: [[Int]]) -> [Int] { + + } +}","func findSmallestSetOfVertices(n int, edges [][]int) []int { + +}","object Solution { + def findSmallestSetOfVertices(n: Int, edges: List[List[Int]]): List[Int] = { + + } +}","class Solution { + fun findSmallestSetOfVertices(n: Int, edges: List>): List { + + } +}","impl Solution { + pub fn find_smallest_set_of_vertices(n: i32, edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer[] + */ + function findSmallestSetOfVertices($n, $edges) { + + } +}","function findSmallestSetOfVertices(n: number, edges: number[][]): number[] { + +};",,,,, +907,thousand-separator,Thousand Separator,1556.0,1660.0,"

Given an integer n, add a dot (".") as the thousands separator and return it in string format.

+ +

 

+

Example 1:

+ +
+Input: n = 987
+Output: "987"
+
+ +

Example 2:

+ +
+Input: n = 1234
+Output: "1.234"
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 231 - 1
    • +
+",1.0,False,"class Solution { +public: + string thousandSeparator(int n) { + + } +};","class Solution { + public String thousandSeparator(int n) { + + } +}","class Solution(object): + def thousandSeparator(self, n): + """""" + :type n: int + :rtype: str + """""" + ","class Solution: + def thousandSeparator(self, n: int) -> str: + ","char * thousandSeparator(int n){ + +}","public class Solution { + public string ThousandSeparator(int n) { + + } +}","/** + * @param {number} n + * @return {string} + */ +var thousandSeparator = function(n) { + +};","# @param {Integer} n +# @return {String} +def thousand_separator(n) + +end","class Solution { + func thousandSeparator(_ n: Int) -> String { + + } +}","func thousandSeparator(n int) string { + +}","object Solution { + def thousandSeparator(n: Int): String = { + + } +}","class Solution { + fun thousandSeparator(n: Int): String { + + } +}","impl Solution { + pub fn thousand_separator(n: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $n + * @return String + */ + function thousandSeparator($n) { + + } +}","function thousandSeparator(n: number): string { + +};","(define/contract (thousand-separator n) + (-> exact-integer? string?) + + )","-spec thousand_separator(N :: integer()) -> unicode:unicode_binary(). +thousand_separator(N) -> + .","defmodule Solution do + @spec thousand_separator(n :: integer) :: String.t + def thousand_separator(n) do + + end +end","class Solution { + String thousandSeparator(int n) { + + } +}", +908,get-the-maximum-score,Get the Maximum Score,1537.0,1659.0,"

You are given two sorted arrays of distinct integers nums1 and nums2.

+ +

A valid path is defined as follows:

+ +
    +
  • Choose array nums1 or nums2 to traverse (from index-0).
    • +
  • Traverse the current array from left to right.
    • +
  • If you are reading any value that is present in nums1 and nums2 you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path).
    • +
+ +

The score is defined as the sum of uniques values in a valid path.

+ +

Return the maximum score you can obtain of all possible valid paths. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [2,4,5,8,10], nums2 = [4,6,8,9]
+Output: 30
+Explanation: Valid paths:
+[2,4,5,8,10], [2,4,5,8,9], [2,4,6,8,9], [2,4,6,8,10],  (starting from nums1)
+[4,6,8,9], [4,5,8,10], [4,5,8,9], [4,6,8,10]    (starting from nums2)
+The maximum is obtained with the path in green [2,4,6,8,10].
+
+ +

Example 2:

+ +
+Input: nums1 = [1,3,5,7,9], nums2 = [3,5,100]
+Output: 109
+Explanation: Maximum sum is obtained with the path [1,3,5,100].
+
+ +

Example 3:

+ +
+Input: nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10]
+Output: 40
+Explanation: There are no common elements between nums1 and nums2.
+Maximum sum is obtained with the path [6,7,8,9,10].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= 107
    • +
  • nums1 and nums2 are strictly increasing.
    • +
+",3.0,False,"class Solution { +public: + int maxSum(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int maxSum(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def maxSum(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def maxSum(self, nums1: List[int], nums2: List[int]) -> int: + ","int maxSum(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MaxSum(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maxSum = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def max_sum(nums1, nums2) + +end","class Solution { + func maxSum(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func maxSum(nums1 []int, nums2 []int) int { + +}","object Solution { + def maxSum(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun maxSum(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn max_sum(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function maxSum($nums1, $nums2) { + + } +}","function maxSum(nums1: number[], nums2: number[]): number { + +};","(define/contract (max-sum nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec max_sum(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +max_sum(Nums1, Nums2) -> + .","defmodule Solution do + @spec max_sum(nums1 :: [integer], nums2 :: [integer]) :: integer + def max_sum(nums1, nums2) do + + end +end","class Solution { + int maxSum(List nums1, List nums2) { + + } +}", +911,count-good-triplets,Count Good Triplets,1534.0,1656.0,"

Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets.

+ +

A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true:

+ +
    +
  • 0 <= i < j < k < arr.length
    • +
  • |arr[i] - arr[j]| <= a
    • +
  • |arr[j] - arr[k]| <= b
    • +
  • |arr[i] - arr[k]| <= c
    • +
+ +

Where |x| denotes the absolute value of x.

+ +

Return the number of good triplets.

+ +

 

+

Example 1:

+ +
+Input: arr = [3,0,1,1,9,7], a = 7, b = 2, c = 3
+Output: 4
+Explanation: There are 4 good triplets: [(3,0,1), (3,0,1), (3,1,1), (0,1,1)].
+
+ +

Example 2:

+ +
+Input: arr = [1,1,2,2,3], a = 0, b = 0, c = 1
+Output: 0
+Explanation: No triplet satisfies all conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= arr.length <= 100
    • +
  • 0 <= arr[i] <= 1000
    • +
  • 0 <= a, b, c <= 1000
    • +
",1.0,False,"class Solution { +public: + int countGoodTriplets(vector& arr, int a, int b, int c) { + + } +};","class Solution { + public int countGoodTriplets(int[] arr, int a, int b, int c) { + + } +}","class Solution(object): + def countGoodTriplets(self, arr, a, b, c): + """""" + :type arr: List[int] + :type a: int + :type b: int + :type c: int + :rtype: int + """""" + ","class Solution: + def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int: + "," + +int countGoodTriplets(int* arr, int arrSize, int a, int b, int c){ + +}","public class Solution { + public int CountGoodTriplets(int[] arr, int a, int b, int c) { + + } +}","/** + * @param {number[]} arr + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number} + */ +var countGoodTriplets = function(arr, a, b, c) { + +};","# @param {Integer[]} arr +# @param {Integer} a +# @param {Integer} b +# @param {Integer} c +# @return {Integer} +def count_good_triplets(arr, a, b, c) + +end","class Solution { + func countGoodTriplets(_ arr: [Int], _ a: Int, _ b: Int, _ c: Int) -> Int { + + } +}","func countGoodTriplets(arr []int, a int, b int, c int) int { + +}","object Solution { + def countGoodTriplets(arr: Array[Int], a: Int, b: Int, c: Int): Int = { + + } +}","class Solution { + fun countGoodTriplets(arr: IntArray, a: Int, b: Int, c: Int): Int { + + } +}","impl Solution { + pub fn count_good_triplets(arr: Vec, a: i32, b: i32, c: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $a + * @param Integer $b + * @param Integer $c + * @return Integer + */ + function countGoodTriplets($arr, $a, $b, $c) { + + } +}","function countGoodTriplets(arr: number[], a: number, b: number, c: number): number { + +};",,,,, +912,number-of-good-leaf-nodes-pairs,Number of Good Leaf Nodes Pairs,1530.0,1653.0,"

You are given the root of a binary tree and an integer distance. A pair of two different leaf nodes of a binary tree is said to be good if the length of the shortest path between them is less than or equal to distance.

+ +

Return the number of good leaf node pairs in the tree.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,null,4], distance = 3
+Output: 1
+Explanation: The leaf nodes of the tree are 3 and 4 and the length of the shortest path between them is 3. This is the only good pair.
+
+ +

Example 2:

+ +
+Input: root = [1,2,3,4,5,6,7], distance = 3
+Output: 2
+Explanation: The good pairs are [4,5] and [6,7] with shortest path = 2. The pair [4,6] is not good because the length of ther shortest path between them is 4.
+
+ +

Example 3:

+ +
+Input: root = [7,1,4,6,null,5,3,null,null,null,null,null,2], distance = 3
+Output: 1
+Explanation: The only good pair is [2,5].
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 210].
    • +
  • 1 <= Node.val <= 100
    • +
  • 1 <= distance <= 10
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int countPairs(TreeNode* root, int distance) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int countPairs(TreeNode root, int distance) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def countPairs(self, root, distance): + """""" + :type root: TreeNode + :type distance: int + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def countPairs(self, root: TreeNode, distance: int) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int countPairs(struct TreeNode* root, int distance){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int CountPairs(TreeNode root, int distance) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} distance + * @return {number} + */ +var countPairs = function(root, distance) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} distance +# @return {Integer} +def count_pairs(root, distance) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func countPairs(_ root: TreeNode?, _ distance: Int) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func countPairs(root *TreeNode, distance int) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def countPairs(root: TreeNode, distance: Int): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun countPairs(root: TreeNode?, distance: Int): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn count_pairs(root: Option>>, distance: i32) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $distance + * @return Integer + */ + function countPairs($root, $distance) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function countPairs(root: TreeNode | null, distance: number): number { + +};",,,,"/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int countPairs(TreeNode? root, int distance) { + + } +}", +913,minimum-suffix-flips,Minimum Suffix Flips,1529.0,1652.0,"

You are given a 0-indexed binary string target of length n. You have another binary string s of length n that is initially set to all zeros. You want to make s equal to target.

+ +

In one operation, you can pick an index i where 0 <= i < n and flip all bits in the inclusive range [i, n - 1]. Flip means changing '0' to '1' and '1' to '0'.

+ +

Return the minimum number of operations needed to make s equal to target.

+ +

 

+

Example 1:

+ +
+Input: target = "10111"
+Output: 3
+Explanation: Initially, s = "00000".
+Choose index i = 2: "00000" -> "00111"
+Choose index i = 0: "00111" -> "11000"
+Choose index i = 1: "11000" -> "10111"
+We need at least 3 flip operations to form target.
+
+ +

Example 2:

+ +
+Input: target = "101"
+Output: 3
+Explanation: Initially, s = "000".
+Choose index i = 0: "000" -> "111"
+Choose index i = 1: "111" -> "100"
+Choose index i = 2: "100" -> "101"
+We need at least 3 flip operations to form target.
+
+ +

Example 3:

+ +
+Input: target = "00000"
+Output: 0
+Explanation: We do not need any operations since the initial s already equals target.
+
+ +

 

+

Constraints:

+ +
    +
  • n == target.length
    • +
  • 1 <= n <= 105
    • +
  • target[i] is either '0' or '1'.
    • +
+",2.0,False,"class Solution { +public: + int minFlips(string target) { + + } +};","class Solution { + public int minFlips(String target) { + + } +}","class Solution(object): + def minFlips(self, target): + """""" + :type target: str + :rtype: int + """""" + ","class Solution: + def minFlips(self, target: str) -> int: + ","int minFlips(char * target){ + +}","public class Solution { + public int MinFlips(string target) { + + } +}","/** + * @param {string} target + * @return {number} + */ +var minFlips = function(target) { + +};","# @param {String} target +# @return {Integer} +def min_flips(target) + +end","class Solution { + func minFlips(_ target: String) -> Int { + + } +}","func minFlips(target string) int { + +}","object Solution { + def minFlips(target: String): Int = { + + } +}","class Solution { + fun minFlips(target: String): Int { + + } +}","impl Solution { + pub fn min_flips(target: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $target + * @return Integer + */ + function minFlips($target) { + + } +}","function minFlips(target: string): number { + +};","(define/contract (min-flips target) + (-> string? exact-integer?) + + )","-spec min_flips(Target :: unicode:unicode_binary()) -> integer(). +min_flips(Target) -> + .","defmodule Solution do + @spec min_flips(target :: String.t) :: integer + def min_flips(target) do + + end +end","class Solution { + int minFlips(String target) { + + } +}", +916,minimum-insertions-to-balance-a-parentheses-string,Minimum Insertions to Balance a Parentheses String,1541.0,1648.0,"

Given a parentheses string s containing only the characters '(' and ')'. A parentheses string is balanced if:

+ +
    +
  • Any left parenthesis '(' must have a corresponding two consecutive right parenthesis '))'.
    • +
  • Left parenthesis '(' must go before the corresponding two consecutive right parenthesis '))'.
    • +
+ +

In other words, we treat '(' as an opening parenthesis and '))' as a closing parenthesis.

+ +
    +
  • For example, "())", "())(())))" and "(())())))" are balanced, ")()", "()))" and "(()))" are not balanced.
    • +
+ +

You can insert the characters '(' and ')' at any position of the string to balance it if needed.

+ +

Return the minimum number of insertions needed to make s balanced.

+ +

 

+

Example 1:

+ +
+Input: s = "(()))"
+Output: 1
+Explanation: The second '(' has two matching '))', but the first '(' has only ')' matching. We need to add one more ')' at the end of the string to be "(())))" which is balanced.
+
+ +

Example 2:

+ +
+Input: s = "())"
+Output: 0
+Explanation: The string is already balanced.
+
+ +

Example 3:

+ +
+Input: s = "))())("
+Output: 3
+Explanation: Add '(' to match the first '))', Add '))' to match the last '('.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of '(' and ')' only.
    • +
+",2.0,False,"class Solution { +public: + int minInsertions(string s) { + + } +};","class Solution { + public int minInsertions(String s) { + + } +}","class Solution(object): + def minInsertions(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minInsertions(self, s: str) -> int: + ","int minInsertions(char * s){ + +}","public class Solution { + public int MinInsertions(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minInsertions = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_insertions(s) + +end","class Solution { + func minInsertions(_ s: String) -> Int { + + } +}","func minInsertions(s string) int { + +}","object Solution { + def minInsertions(s: String): Int = { + + } +}","class Solution { + fun minInsertions(s: String): Int { + + } +}","impl Solution { + pub fn min_insertions(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minInsertions($s) { + + } +}","function minInsertions(s: string): number { + +};","(define/contract (min-insertions s) + (-> string? exact-integer?) + + )","-spec min_insertions(S :: unicode:unicode_binary()) -> integer(). +min_insertions(S) -> + .","defmodule Solution do + @spec min_insertions(s :: String.t) :: integer + def min_insertions(s) do + + end +end","class Solution { + int minInsertions(String s) { + + } +}", +917,can-convert-string-in-k-moves,Can Convert String in K Moves,1540.0,1647.0,"

Given two strings s and t, your goal is to convert s into t in k moves or less.

+ +

During the ith (1 <= i <= k) move you can:

+ +
    +
  • Choose any index j (1-indexed) from s, such that 1 <= j <= s.length and j has not been chosen in any previous move, and shift the character at that index i times.
    • +
  • Do nothing.
    • +
+ +

Shifting a character means replacing it by the next letter in the alphabet (wrapping around so that 'z' becomes 'a'). Shifting a character by i means applying the shift operations i times.

+ +

Remember that any index j can be picked at most once.

+ +

Return true if it's possible to convert s into t in no more than k moves, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: s = "input", t = "ouput", k = 9
+Output: true
+Explanation: In the 6th move, we shift 'i' 6 times to get 'o'. And in the 7th move we shift 'n' to get 'u'.
+
+ +

Example 2:

+ +
+Input: s = "abc", t = "bcd", k = 10
+Output: false
+Explanation: We need to shift each character in s one time to convert it into t. We can shift 'a' to 'b' during the 1st move. However, there is no way to shift the other characters in the remaining moves to obtain t from s.
+
+ +

Example 3:

+ +
+Input: s = "aab", t = "bbb", k = 27
+Output: true
+Explanation: In the 1st move, we shift the first 'a' 1 time to get 'b'. In the 27th move, we shift the second 'a' 27 times to get 'b'.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 10^5
    • +
  • 0 <= k <= 10^9
    • +
  • s, t contain only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + bool canConvertString(string s, string t, int k) { + + } +};","class Solution { + public boolean canConvertString(String s, String t, int k) { + + } +}","class Solution(object): + def canConvertString(self, s, t, k): + """""" + :type s: str + :type t: str + :type k: int + :rtype: bool + """""" + ","class Solution: + def canConvertString(self, s: str, t: str, k: int) -> bool: + ","bool canConvertString(char * s, char * t, int k){ + +}","public class Solution { + public bool CanConvertString(string s, string t, int k) { + + } +}","/** + * @param {string} s + * @param {string} t + * @param {number} k + * @return {boolean} + */ +var canConvertString = function(s, t, k) { + +};","# @param {String} s +# @param {String} t +# @param {Integer} k +# @return {Boolean} +def can_convert_string(s, t, k) + +end","class Solution { + func canConvertString(_ s: String, _ t: String, _ k: Int) -> Bool { + + } +}","func canConvertString(s string, t string, k int) bool { + +}","object Solution { + def canConvertString(s: String, t: String, k: Int): Boolean = { + + } +}","class Solution { + fun canConvertString(s: String, t: String, k: Int): Boolean { + + } +}","impl Solution { + pub fn can_convert_string(s: String, t: String, k: i32) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @param Integer $k + * @return Boolean + */ + function canConvertString($s, $t, $k) { + + } +}","function canConvertString(s: string, t: string, k: number): boolean { + +};","(define/contract (can-convert-string s t k) + (-> string? string? exact-integer? boolean?) + + )","-spec can_convert_string(S :: unicode:unicode_binary(), T :: unicode:unicode_binary(), K :: integer()) -> boolean(). +can_convert_string(S, T, K) -> + .","defmodule Solution do + @spec can_convert_string(s :: String.t, t :: String.t, k :: integer) :: boolean + def can_convert_string(s, t, k) do + + end +end","class Solution { + bool canConvertString(String s, String t, int k) { + + } +}", +919,find-a-value-of-a-mysterious-function-closest-to-target,Find a Value of a Mysterious Function Closest to Target,1521.0,1645.0,"

+ +

Winston was given the above mysterious function func. He has an integer array arr and an integer target and he wants to find the values l and r that make the value |func(arr, l, r) - target| minimum possible.

+ +

Return the minimum possible value of |func(arr, l, r) - target|.

+ +

Notice that func should be called with the values l and r where 0 <= l, r < arr.length.

+ +

 

+

Example 1:

+ +
+Input: arr = [9,12,3,7,15], target = 5
+Output: 2
+Explanation: Calling func with all the pairs of [l,r] = [[0,0],[1,1],[2,2],[3,3],[4,4],[0,1],[1,2],[2,3],[3,4],[0,2],[1,3],[2,4],[0,3],[1,4],[0,4]], Winston got the following results [9,12,3,7,15,8,0,3,7,0,0,3,0,0,0]. The value closest to 5 is 7 and 3, thus the minimum difference is 2.
+
+ +

Example 2:

+ +
+Input: arr = [1000000,1000000,1000000], target = 1
+Output: 999999
+Explanation: Winston called the func with all possible values of [l,r] and he always got 1000000, thus the min difference is 999999.
+
+ +

Example 3:

+ +
+Input: arr = [1,2,4,8,16], target = 0
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 1 <= arr[i] <= 106
    • +
  • 0 <= target <= 107
    • +
+",3.0,False,"class Solution { +public: + int closestToTarget(vector& arr, int target) { + + } +};","class Solution { + public int closestToTarget(int[] arr, int target) { + + } +}","class Solution(object): + def closestToTarget(self, arr, target): + """""" + :type arr: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def closestToTarget(self, arr: List[int], target: int) -> int: + ","int closestToTarget(int* arr, int arrSize, int target){ + +}","public class Solution { + public int ClosestToTarget(int[] arr, int target) { + + } +}","/** + * @param {number[]} arr + * @param {number} target + * @return {number} + */ +var closestToTarget = function(arr, target) { + +};","# @param {Integer[]} arr +# @param {Integer} target +# @return {Integer} +def closest_to_target(arr, target) + +end","class Solution { + func closestToTarget(_ arr: [Int], _ target: Int) -> Int { + + } +}","func closestToTarget(arr []int, target int) int { + +}","object Solution { + def closestToTarget(arr: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun closestToTarget(arr: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn closest_to_target(arr: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $target + * @return Integer + */ + function closestToTarget($arr, $target) { + + } +}","function closestToTarget(arr: number[], target: number): number { + +};","(define/contract (closest-to-target arr target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec closest_to_target(Arr :: [integer()], Target :: integer()) -> integer(). +closest_to_target(Arr, Target) -> + .","defmodule Solution do + @spec closest_to_target(arr :: [integer], target :: integer) :: integer + def closest_to_target(arr, target) do + + end +end","class Solution { + int closestToTarget(List arr, int target) { + + } +}", +920,maximum-number-of-non-overlapping-substrings,Maximum Number of Non-Overlapping Substrings,1520.0,1644.0,"

Given a string s of lowercase letters, you need to find the maximum number of non-empty substrings of s that meet the following conditions:

+ +
    +
  1. The substrings do not overlap, that is for any two substrings s[i..j] and s[x..y], either j < x or i > y is true.
    2. +
  2. A substring that contains a certain character c must also contain all occurrences of c.
    3. +
+ +

Find the maximum number of substrings that meet the above conditions. If there are multiple solutions with the same number of substrings, return the one with minimum total length. It can be shown that there exists a unique solution of minimum total length.

+ +

Notice that you can return the substrings in any order.

+ +

 

+

Example 1:

+ +
+Input: s = "adefaddaccc"
+Output: ["e","f","ccc"]
+Explanation: The following are all the possible substrings that meet the conditions:
+[
+  "adefaddaccc"
+  "adefadda",
+  "ef",
+  "e",
+  "f",
+  "ccc",
+]
+If we choose the first string, we cannot choose anything else and we'd get only 1. If we choose "adefadda", we are left with "ccc" which is the only one that doesn't overlap, thus obtaining 2 substrings. Notice also, that it's not optimal to choose "ef" since it can be split into two. Therefore, the optimal way is to choose ["e","f","ccc"] which gives us 3 substrings. No other solution of the same number of substrings exist.
+
+ +

Example 2:

+ +
+Input: s = "abbaccd"
+Output: ["d","bb","cc"]
+Explanation: Notice that while the set of substrings ["d","abba","cc"] also has length 3, it's considered incorrect since it has larger total length.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s contains only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + vector maxNumOfSubstrings(string s) { + + } +};","class Solution { + public List maxNumOfSubstrings(String s) { + + } +}","class Solution(object): + def maxNumOfSubstrings(self, s): + """""" + :type s: str + :rtype: List[str] + """""" + ","class Solution: + def maxNumOfSubstrings(self, s: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** maxNumOfSubstrings(char * s, int* returnSize){ + +}","public class Solution { + public IList MaxNumOfSubstrings(string s) { + + } +}","/** + * @param {string} s + * @return {string[]} + */ +var maxNumOfSubstrings = function(s) { + +};","# @param {String} s +# @return {String[]} +def max_num_of_substrings(s) + +end","class Solution { + func maxNumOfSubstrings(_ s: String) -> [String] { + + } +}","func maxNumOfSubstrings(s string) []string { + +}","object Solution { + def maxNumOfSubstrings(s: String): List[String] = { + + } +}","class Solution { + fun maxNumOfSubstrings(s: String): List { + + } +}","impl Solution { + pub fn max_num_of_substrings(s: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @return String[] + */ + function maxNumOfSubstrings($s) { + + } +}","function maxNumOfSubstrings(s: string): string[] { + +};","(define/contract (max-num-of-substrings s) + (-> string? (listof string?)) + + )","-spec max_num_of_substrings(S :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +max_num_of_substrings(S) -> + .","defmodule Solution do + @spec max_num_of_substrings(s :: String.t) :: [String.t] + def max_num_of_substrings(s) do + + end +end","class Solution { + List maxNumOfSubstrings(String s) { + + } +}", +921,number-of-nodes-in-the-sub-tree-with-the-same-label,Number of Nodes in the Sub-Tree With the Same Label,1519.0,1643.0,"

You are given a tree (i.e. a connected, undirected graph that has no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges. The root of the tree is the node 0, and each node of the tree has a label which is a lower-case character given in the string labels (i.e. The node with the number i has the label labels[i]).

+ +

The edges array is given on the form edges[i] = [ai, bi], which means there is an edge between nodes ai and bi in the tree.

+ +

Return an array of size n where ans[i] is the number of nodes in the subtree of the ith node which have the same label as node i.

+ +

A subtree of a tree T is the tree consisting of a node in T and all of its descendant nodes.

+ +

 

+

Example 1:

+ +
+Input: n = 7, edges = [[0,1],[0,2],[1,4],[1,5],[2,3],[2,6]], labels = "abaedcd"
+Output: [2,1,1,1,1,1,1]
+Explanation: Node 0 has label 'a' and its sub-tree has node 2 with label 'a' as well, thus the answer is 2. Notice that any node is part of its sub-tree.
+Node 1 has a label 'b'. The sub-tree of node 1 contains nodes 1,4 and 5, as nodes 4 and 5 have different labels than node 1, the answer is just 1 (the node itself).
+
+ +

Example 2:

+ +
+Input: n = 4, edges = [[0,1],[1,2],[0,3]], labels = "bbbb"
+Output: [4,2,1,1]
+Explanation: The sub-tree of node 2 contains only node 2, so the answer is 1.
+The sub-tree of node 3 contains only node 3, so the answer is 1.
+The sub-tree of node 1 contains nodes 1 and 2, both have label 'b', thus the answer is 2.
+The sub-tree of node 0 contains nodes 0, 1, 2 and 3, all with label 'b', thus the answer is 4.
+
+ +

Example 3:

+ +
+Input: n = 5, edges = [[0,1],[0,2],[1,3],[0,4]], labels = "aabab"
+Output: [3,2,1,1,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • labels.length == n
    • +
  • labels is consisting of only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector countSubTrees(int n, vector>& edges, string labels) { + + } +};","class Solution { + public int[] countSubTrees(int n, int[][] edges, String labels) { + + } +}","class Solution(object): + def countSubTrees(self, n, edges, labels): + """""" + :type n: int + :type edges: List[List[int]] + :type labels: str + :rtype: List[int] + """""" + ","class Solution: + def countSubTrees(self, n: int, edges: List[List[int]], labels: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countSubTrees(int n, int** edges, int edgesSize, int* edgesColSize, char * labels, int* returnSize){ + +}","public class Solution { + public int[] CountSubTrees(int n, int[][] edges, string labels) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {string} labels + * @return {number[]} + */ +var countSubTrees = function(n, edges, labels) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {String} labels +# @return {Integer[]} +def count_sub_trees(n, edges, labels) + +end","class Solution { + func countSubTrees(_ n: Int, _ edges: [[Int]], _ labels: String) -> [Int] { + + } +}","func countSubTrees(n int, edges [][]int, labels string) []int { + +}","object Solution { + def countSubTrees(n: Int, edges: Array[Array[Int]], labels: String): Array[Int] = { + + } +}","class Solution { + fun countSubTrees(n: Int, edges: Array, labels: String): IntArray { + + } +}","impl Solution { + pub fn count_sub_trees(n: i32, edges: Vec>, labels: String) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param String $labels + * @return Integer[] + */ + function countSubTrees($n, $edges, $labels) { + + } +}","function countSubTrees(n: number, edges: number[][], labels: string): number[] { + +};",,,,"class Solution { + List countSubTrees(int n, List> edges, String labels) { + + } +}", +923,best-position-for-a-service-centre,Best Position for a Service Centre,1515.0,1638.0,"

A delivery company wants to build a new service center in a new city. The company knows the positions of all the customers in this city on a 2D-Map and wants to build the new center in a position such that the sum of the euclidean distances to all customers is minimum.

+ +

Given an array positions where positions[i] = [xi, yi] is the position of the ith customer on the map, return the minimum sum of the euclidean distances to all customers.

+ +

In other words, you need to choose the position of the service center [xcentre, ycentre] such that the following formula is minimized:

+ +

Answers within 10-5 of the actual value will be accepted.

+ +

 

+

Example 1:

+ +
+Input: positions = [[0,1],[1,0],[1,2],[2,1]]
+Output: 4.00000
+Explanation: As shown, you can see that choosing [xcentre, ycentre] = [1, 1] will make the distance to each customer = 1, the sum of all distances is 4 which is the minimum possible we can achieve.
+
+ +

Example 2:

+ +
+Input: positions = [[1,1],[3,3]]
+Output: 2.82843
+Explanation: The minimum possible sum of distances = sqrt(2) + sqrt(2) = 2.82843
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= positions.length <= 50
    • +
  • positions[i].length == 2
    • +
  • 0 <= xi, yi <= 100
    • +
+",3.0,False,"class Solution { +public: + double getMinDistSum(vector>& positions) { + + } +};","class Solution { + public double getMinDistSum(int[][] positions) { + + } +}","class Solution(object): + def getMinDistSum(self, positions): + """""" + :type positions: List[List[int]] + :rtype: float + """""" + ","class Solution: + def getMinDistSum(self, positions: List[List[int]]) -> float: + ","double getMinDistSum(int** positions, int positionsSize, int* positionsColSize){ + +}","public class Solution { + public double GetMinDistSum(int[][] positions) { + + } +}","/** + * @param {number[][]} positions + * @return {number} + */ +var getMinDistSum = function(positions) { + +};","# @param {Integer[][]} positions +# @return {Float} +def get_min_dist_sum(positions) + +end","class Solution { + func getMinDistSum(_ positions: [[Int]]) -> Double { + + } +}","func getMinDistSum(positions [][]int) float64 { + +}","object Solution { + def getMinDistSum(positions: Array[Array[Int]]): Double = { + + } +}","class Solution { + fun getMinDistSum(positions: Array): Double { + + } +}","impl Solution { + pub fn get_min_dist_sum(positions: Vec>) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[][] $positions + * @return Float + */ + function getMinDistSum($positions) { + + } +}","function getMinDistSum(positions: number[][]): number { + +};","(define/contract (get-min-dist-sum positions) + (-> (listof (listof exact-integer?)) flonum?) + + )","-spec get_min_dist_sum(Positions :: [[integer()]]) -> float(). +get_min_dist_sum(Positions) -> + .","defmodule Solution do + @spec get_min_dist_sum(positions :: [[integer]]) :: float + def get_min_dist_sum(positions) do + + end +end","class Solution { + double getMinDistSum(List> positions) { + + } +}", +924,string-compression-ii,String Compression II,1531.0,1637.0,"

Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with the concatenation of the character and the number marking the count of the characters (length of the run). For example, to compress the string "aabccc" we replace "aa" by "a2" and replace "ccc" by "c3". Thus the compressed string becomes "a2bc3".

+ +

Notice that in this problem, we are not adding '1' after single characters.

+ +

Given a string s and an integer k. You need to delete at most k characters from s such that the run-length encoded version of s has minimum length.

+ +

Find the minimum length of the run-length encoded version of s after deleting at most k characters.

+ +

 

+

Example 1:

+ +
+Input: s = "aaabcccd", k = 2
+Output: 4
+Explanation: Compressing s without deleting anything will give us "a3bc3d" of length 6. Deleting any of the characters 'a' or 'c' would at most decrease the length of the compressed string to 5, for instance delete 2 'a' then we will have s = "abcccd" which compressed is abc3d. Therefore, the optimal way is to delete 'b' and 'd', then the compressed version of s will be "a3c3" of length 4.
+ +

Example 2:

+ +
+Input: s = "aabbaa", k = 2
+Output: 2
+Explanation: If we delete both 'b' characters, the resulting compressed string would be "a4" of length 2.
+
+ +

Example 3:

+ +
+Input: s = "aaaaaaaaaaa", k = 0
+Output: 3
+Explanation: Since k is zero, we cannot delete anything. The compressed string is "a11" of length 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 100
    • +
  • 0 <= k <= s.length
    • +
  • s contains only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int getLengthOfOptimalCompression(string s, int k) { + + } +};","class Solution { + public int getLengthOfOptimalCompression(String s, int k) { + + } +}","class Solution(object): + def getLengthOfOptimalCompression(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def getLengthOfOptimalCompression(self, s: str, k: int) -> int: + ","int getLengthOfOptimalCompression(char * s, int k){ + +}","public class Solution { + public int GetLengthOfOptimalCompression(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var getLengthOfOptimalCompression = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def get_length_of_optimal_compression(s, k) + +end","class Solution { + func getLengthOfOptimalCompression(_ s: String, _ k: Int) -> Int { + + } +}","func getLengthOfOptimalCompression(s string, k int) int { + +}","object Solution { + def getLengthOfOptimalCompression(s: String, k: Int): Int = { + + } +}","class Solution { + fun getLengthOfOptimalCompression(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn get_length_of_optimal_compression(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function getLengthOfOptimalCompression($s, $k) { + + } +}","function getLengthOfOptimalCompression(s: string, k: number): number { + +};","(define/contract (get-length-of-optimal-compression s k) + (-> string? exact-integer? exact-integer?) + + )","-spec get_length_of_optimal_compression(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +get_length_of_optimal_compression(S, K) -> + .","defmodule Solution do + @spec get_length_of_optimal_compression(s :: String.t, k :: integer) :: integer + def get_length_of_optimal_compression(s, k) do + + end +end","class Solution { + int getLengthOfOptimalCompression(String s, int k) { + + } +}", +927,minimum-number-of-increments-on-subarrays-to-form-a-target-array,Minimum Number of Increments on Subarrays to Form a Target Array,1526.0,1633.0,"

You are given an integer array target. You have an integer array initial of the same size as target with all elements initially zeros.

+ +

In one operation you can choose any subarray from initial and increment each value by one.

+ +

Return the minimum number of operations to form a target array from initial.

+ +

The test cases are generated so that the answer fits in a 32-bit integer.

+ +

 

+

Example 1:

+ +
+Input: target = [1,2,3,2,1]
+Output: 3
+Explanation: We need at least 3 operations to form the target array from the initial array.
+[0,0,0,0,0] increment 1 from index 0 to 4 (inclusive).
+[1,1,1,1,1] increment 1 from index 1 to 3 (inclusive).
+[1,2,2,2,1] increment 1 at index 2.
+[1,2,3,2,1] target array is formed.
+
+ +

Example 2:

+ +
+Input: target = [3,1,1,2]
+Output: 4
+Explanation: [0,0,0,0] -> [1,1,1,1] -> [1,1,1,2] -> [2,1,1,2] -> [3,1,1,2]
+
+ +

Example 3:

+ +
+Input: target = [3,1,5,4,2]
+Output: 7
+Explanation: [0,0,0,0,0] -> [1,1,1,1,1] -> [2,1,1,1,1] -> [3,1,1,1,1] -> [3,1,2,2,2] -> [3,1,3,3,2] -> [3,1,4,4,2] -> [3,1,5,4,2].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target.length <= 105
    • +
  • 1 <= target[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int minNumberOperations(vector& target) { + + } +};","class Solution { + public int minNumberOperations(int[] target) { + + } +}","class Solution(object): + def minNumberOperations(self, target): + """""" + :type target: List[int] + :rtype: int + """""" + ","class Solution: + def minNumberOperations(self, target: List[int]) -> int: + ","int minNumberOperations(int* target, int targetSize){ + +}","public class Solution { + public int MinNumberOperations(int[] target) { + + } +}","/** + * @param {number[]} target + * @return {number} + */ +var minNumberOperations = function(target) { + +};","# @param {Integer[]} target +# @return {Integer} +def min_number_operations(target) + +end","class Solution { + func minNumberOperations(_ target: [Int]) -> Int { + + } +}","func minNumberOperations(target []int) int { + +}","object Solution { + def minNumberOperations(target: Array[Int]): Int = { + + } +}","class Solution { + fun minNumberOperations(target: IntArray): Int { + + } +}","impl Solution { + pub fn min_number_operations(target: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $target + * @return Integer + */ + function minNumberOperations($target) { + + } +}","function minNumberOperations(target: number[]): number { + +};","(define/contract (min-number-operations target) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_number_operations(Target :: [integer()]) -> integer(). +min_number_operations(Target) -> + .","defmodule Solution do + @spec min_number_operations(target :: [integer]) :: integer + def min_number_operations(target) do + + end +end","class Solution { + int minNumberOperations(List target) { + + } +}", +929,number-of-sub-arrays-with-odd-sum,Number of Sub-arrays With Odd Sum,1524.0,1631.0,"

Given an array of integers arr, return the number of subarrays with an odd sum.

+ +

Since the answer can be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,3,5]
+Output: 4
+Explanation: All subarrays are [[1],[1,3],[1,3,5],[3],[3,5],[5]]
+All sub-arrays sum are [1,4,9,3,8,5].
+Odd sums are [1,9,3,5] so the answer is 4.
+
+ +

Example 2:

+ +
+Input: arr = [2,4,6]
+Output: 0
+Explanation: All subarrays are [[2],[2,4],[2,4,6],[4],[4,6],[6]]
+All sub-arrays sum are [2,6,12,4,10,6].
+All sub-arrays have even sum and the answer is 0.
+
+ +

Example 3:

+ +
+Input: arr = [1,2,3,4,5,6,7]
+Output: 16
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 1 <= arr[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + int numOfSubarrays(vector& arr) { + + } +};","class Solution { + public int numOfSubarrays(int[] arr) { + + } +}","class Solution(object): + def numOfSubarrays(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def numOfSubarrays(self, arr: List[int]) -> int: + ","int numOfSubarrays(int* arr, int arrSize){ + +}","public class Solution { + public int NumOfSubarrays(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var numOfSubarrays = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def num_of_subarrays(arr) + +end","class Solution { + func numOfSubarrays(_ arr: [Int]) -> Int { + + } +}","func numOfSubarrays(arr []int) int { + +}","object Solution { + def numOfSubarrays(arr: Array[Int]): Int = { + + } +}","class Solution { + fun numOfSubarrays(arr: IntArray): Int { + + } +}","impl Solution { + pub fn num_of_subarrays(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function numOfSubarrays($arr) { + + } +}","function numOfSubarrays(arr: number[]): number { + +};",,"-spec num_of_subarrays(Arr :: [integer()]) -> integer(). +num_of_subarrays(Arr) -> + .","defmodule Solution do + @spec num_of_subarrays(arr :: [integer]) :: integer + def num_of_subarrays(arr) do + + end +end","class Solution { + int numOfSubarrays(List arr) { + + } +}", +931,minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits,Minimum Possible Integer After at Most K Adjacent Swaps On Digits,1505.0,1629.0,"

You are given a string num representing the digits of a very large integer and an integer k. You are allowed to swap any two adjacent digits of the integer at most k times.

+ +

Return the minimum integer you can obtain also as a string.

+ +

 

+

Example 1:

+ +
+Input: num = "4321", k = 4
+Output: "1342"
+Explanation: The steps to obtain the minimum integer from 4321 with 4 adjacent swaps are shown.
+
+ +

Example 2:

+ +
+Input: num = "100", k = 1
+Output: "010"
+Explanation: It's ok for the output to have leading zeros, but the input is guaranteed not to have any leading zeros.
+
+ +

Example 3:

+ +
+Input: num = "36789", k = 1000
+Output: "36789"
+Explanation: We can keep the number without any swaps.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num.length <= 3 * 104
    • +
  • num consists of only digits and does not contain leading zeros.
    • +
  • 1 <= k <= 109
    • +
+",3.0,False,"class Solution { +public: + string minInteger(string num, int k) { + + } +};","class Solution { + public String minInteger(String num, int k) { + + } +}","class Solution(object): + def minInteger(self, num, k): + """""" + :type num: str + :type k: int + :rtype: str + """""" + ","class Solution: + def minInteger(self, num: str, k: int) -> str: + ","char * minInteger(char * num, int k){ + +}","public class Solution { + public string MinInteger(string num, int k) { + + } +}","/** + * @param {string} num + * @param {number} k + * @return {string} + */ +var minInteger = function(num, k) { + +};","# @param {String} num +# @param {Integer} k +# @return {String} +def min_integer(num, k) + +end","class Solution { + func minInteger(_ num: String, _ k: Int) -> String { + + } +}","func minInteger(num string, k int) string { + +}","object Solution { + def minInteger(num: String, k: Int): String = { + + } +}","class Solution { + fun minInteger(num: String, k: Int): String { + + } +}","impl Solution { + pub fn min_integer(num: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $num + * @param Integer $k + * @return String + */ + function minInteger($num, $k) { + + } +}","function minInteger(num: string, k: number): string { + +};","(define/contract (min-integer num k) + (-> string? exact-integer? string?) + + )","-spec min_integer(Num :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +min_integer(Num, K) -> + .","defmodule Solution do + @spec min_integer(num :: String.t, k :: integer) :: String.t + def min_integer(num, k) do + + end +end","class Solution { + String minInteger(String num, int k) { + + } +}", +935,max-value-of-equation,Max Value of Equation,1499.0,1622.0,"

You are given an array points containing the coordinates of points on a 2D plane, sorted by the x-values, where points[i] = [xi, yi] such that xi < xj for all 1 <= i < j <= points.length. You are also given an integer k.

+ +

Return the maximum value of the equation yi + yj + |xi - xj| where |xi - xj| <= k and 1 <= i < j <= points.length.

+ +

It is guaranteed that there exists at least one pair of points that satisfy the constraint |xi - xj| <= k.

+ +

 

+

Example 1:

+ +
+Input: points = [[1,3],[2,0],[5,10],[6,-10]], k = 1
+Output: 4
+Explanation: The first two points satisfy the condition |xi - xj| <= 1 and if we calculate the equation we get 3 + 0 + |1 - 2| = 4. Third and fourth points also satisfy the condition and give a value of 10 + -10 + |5 - 6| = 1.
+No other pairs satisfy the condition, so we return the max of 4 and 1.
+
+ +

Example 2:

+ +
+Input: points = [[0,0],[3,0],[9,2]], k = 3
+Output: 3
+Explanation: Only the first two points have an absolute difference of 3 or less in the x-values, and give the value of 0 + 0 + |0 - 3| = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= points.length <= 105
    • +
  • points[i].length == 2
    • +
  • -108 <= xi, yi <= 108
    • +
  • 0 <= k <= 2 * 108
    • +
  • xi < xj for all 1 <= i < j <= points.length
    • +
  • xi form a strictly increasing sequence.
    • +
+",3.0,False,"class Solution { +public: + int findMaxValueOfEquation(vector>& points, int k) { + + } +};","class Solution { + public int findMaxValueOfEquation(int[][] points, int k) { + + } +}","class Solution(object): + def findMaxValueOfEquation(self, points, k): + """""" + :type points: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int: + ","int findMaxValueOfEquation(int** points, int pointsSize, int* pointsColSize, int k){ + +}","public class Solution { + public int FindMaxValueOfEquation(int[][] points, int k) { + + } +}","/** + * @param {number[][]} points + * @param {number} k + * @return {number} + */ +var findMaxValueOfEquation = function(points, k) { + +};","# @param {Integer[][]} points +# @param {Integer} k +# @return {Integer} +def find_max_value_of_equation(points, k) + +end","class Solution { + func findMaxValueOfEquation(_ points: [[Int]], _ k: Int) -> Int { + + } +}","func findMaxValueOfEquation(points [][]int, k int) int { + +}","object Solution { + def findMaxValueOfEquation(points: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun findMaxValueOfEquation(points: Array, k: Int): Int { + + } +}","impl Solution { + pub fn find_max_value_of_equation(points: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @param Integer $k + * @return Integer + */ + function findMaxValueOfEquation($points, $k) { + + } +}","function findMaxValueOfEquation(points: number[][], k: number): number { + +};","(define/contract (find-max-value-of-equation points k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec find_max_value_of_equation(Points :: [[integer()]], K :: integer()) -> integer(). +find_max_value_of_equation(Points, K) -> + .","defmodule Solution do + @spec find_max_value_of_equation(points :: [[integer]], k :: integer) :: integer + def find_max_value_of_equation(points, k) do + + end +end","class Solution { + int findMaxValueOfEquation(List> points, int k) { + + } +}", +937,check-if-array-pairs-are-divisible-by-k,Check If Array Pairs Are Divisible by k,1497.0,1620.0,"

Given an array of integers arr of even length n and an integer k.

+ +

We want to divide the array into exactly n / 2 pairs such that the sum of each pair is divisible by k.

+ +

Return true If you can find a way to do that or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,4,5,10,6,7,8,9], k = 5
+Output: true
+Explanation: Pairs are (1,9),(2,8),(3,7),(4,6) and (5,10).
+
+ +

Example 2:

+ +
+Input: arr = [1,2,3,4,5,6], k = 7
+Output: true
+Explanation: Pairs are (1,6),(2,5) and(3,4).
+
+ +

Example 3:

+ +
+Input: arr = [1,2,3,4,5,6], k = 10
+Output: false
+Explanation: You can try all possible pairs to see that there is no way to divide arr into 3 pairs each with sum divisible by 10.
+
+ +

 

+

Constraints:

+ +
    +
  • arr.length == n
    • +
  • 1 <= n <= 105
    • +
  • n is even.
    • +
  • -109 <= arr[i] <= 109
    • +
  • 1 <= k <= 105
    • +
+",2.0,False,"class Solution { +public: + bool canArrange(vector& arr, int k) { + + } +};","class Solution { + public boolean canArrange(int[] arr, int k) { + + } +}","class Solution(object): + def canArrange(self, arr, k): + """""" + :type arr: List[int] + :type k: int + :rtype: bool + """""" + ","class Solution: + def canArrange(self, arr: List[int], k: int) -> bool: + ","bool canArrange(int* arr, int arrSize, int k){ + +}","public class Solution { + public bool CanArrange(int[] arr, int k) { + + } +}","/** + * @param {number[]} arr + * @param {number} k + * @return {boolean} + */ +var canArrange = function(arr, k) { + +};","# @param {Integer[]} arr +# @param {Integer} k +# @return {Boolean} +def can_arrange(arr, k) + +end","class Solution { + func canArrange(_ arr: [Int], _ k: Int) -> Bool { + + } +}","func canArrange(arr []int, k int) bool { + +}","object Solution { + def canArrange(arr: Array[Int], k: Int): Boolean = { + + } +}","class Solution { + fun canArrange(arr: IntArray, k: Int): Boolean { + + } +}","impl Solution { + pub fn can_arrange(arr: Vec, k: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $k + * @return Boolean + */ + function canArrange($arr, $k) { + + } +}","function canArrange(arr: number[], k: number): boolean { + +};","(define/contract (can-arrange arr k) + (-> (listof exact-integer?) exact-integer? boolean?) + + )","-spec can_arrange(Arr :: [integer()], K :: integer()) -> boolean(). +can_arrange(Arr, K) -> + .","defmodule Solution do + @spec can_arrange(arr :: [integer], k :: integer) :: boolean + def can_arrange(arr, k) do + + end +end","class Solution { + bool canArrange(List arr, int k) { + + } +}", +938,path-crossing,Path Crossing,1496.0,1619.0,"

Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at the origin (0, 0) on a 2D plane and walk on the path specified by path.

+ +

Return true if the path crosses itself at any point, that is, if at any time you are on a location you have previously visited. Return false otherwise.

+ +

 

+

Example 1:

+ +
+Input: path = "NES"
+Output: false 
+Explanation: Notice that the path doesn't cross any point more than once.
+
+ +

Example 2:

+ +
+Input: path = "NESWW"
+Output: true
+Explanation: Notice that the path visits the origin twice.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= path.length <= 104
    • +
  • path[i] is either 'N', 'S', 'E', or 'W'.
    • +
+",1.0,False,"class Solution { +public: + bool isPathCrossing(string path) { + + } +};","class Solution { + public boolean isPathCrossing(String path) { + + } +}","class Solution(object): + def isPathCrossing(self, path): + """""" + :type path: str + :rtype: bool + """""" + ","class Solution: + def isPathCrossing(self, path: str) -> bool: + ","bool isPathCrossing(char * path){ + +}","public class Solution { + public bool IsPathCrossing(string path) { + + } +}","/** + * @param {string} path + * @return {boolean} + */ +var isPathCrossing = function(path) { + +};","# @param {String} path +# @return {Boolean} +def is_path_crossing(path) + +end","class Solution { + func isPathCrossing(_ path: String) -> Bool { + + } +}","func isPathCrossing(path string) bool { + +}","object Solution { + def isPathCrossing(path: String): Boolean = { + + } +}","class Solution { + fun isPathCrossing(path: String): Boolean { + + } +}","impl Solution { + pub fn is_path_crossing(path: String) -> bool { + + } +}","class Solution { + + /** + * @param String $path + * @return Boolean + */ + function isPathCrossing($path) { + + } +}","function isPathCrossing(path: string): boolean { + +};","(define/contract (is-path-crossing path) + (-> string? boolean?) + + )","-spec is_path_crossing(Path :: unicode:unicode_binary()) -> boolean(). +is_path_crossing(Path) -> + .","defmodule Solution do + @spec is_path_crossing(path :: String.t) :: boolean + def is_path_crossing(path) do + + end +end","class Solution { + bool isPathCrossing(String path) { + + } +}", +939,stone-game-iv,Stone Game IV,1510.0,1617.0,"

Alice and Bob take turns playing a game, with Alice starting first.

+ +

Initially, there are n stones in a pile. On each player's turn, that player makes a move consisting of removing any non-zero square number of stones in the pile.

+ +

Also, if a player cannot make a move, he/she loses the game.

+ +

Given a positive integer n, return true if and only if Alice wins the game otherwise return false, assuming both players play optimally.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: true
+Explanation: Alice can remove 1 stone winning the game because Bob doesn't have any moves.
+ +

Example 2:

+ +
+Input: n = 2
+Output: false
+Explanation: Alice can only remove 1 stone, after that Bob removes the last one winning the game (2 -> 1 -> 0).
+
+ +

Example 3:

+ +
+Input: n = 4
+Output: true
+Explanation: n is already a perfect square, Alice can win with one move, removing 4 stones (4 -> 0).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
+",3.0,False,"class Solution { +public: + bool winnerSquareGame(int n) { + + } +};","class Solution { + public boolean winnerSquareGame(int n) { + + } +}","class Solution(object): + def winnerSquareGame(self, n): + """""" + :type n: int + :rtype: bool + """""" + ","class Solution: + def winnerSquareGame(self, n: int) -> bool: + ","bool winnerSquareGame(int n){ + +}","public class Solution { + public bool WinnerSquareGame(int n) { + + } +}","/** + * @param {number} n + * @return {boolean} + */ +var winnerSquareGame = function(n) { + +};","# @param {Integer} n +# @return {Boolean} +def winner_square_game(n) + +end","class Solution { + func winnerSquareGame(_ n: Int) -> Bool { + + } +}","func winnerSquareGame(n int) bool { + +}","object Solution { + def winnerSquareGame(n: Int): Boolean = { + + } +}","class Solution { + fun winnerSquareGame(n: Int): Boolean { + + } +}","impl Solution { + pub fn winner_square_game(n: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Boolean + */ + function winnerSquareGame($n) { + + } +}","function winnerSquareGame(n: number): boolean { + +};",,,,"class Solution { + bool winnerSquareGame(int n) { + + } +}", +940,minimum-difference-between-largest-and-smallest-value-in-three-moves,Minimum Difference Between Largest and Smallest Value in Three Moves,1509.0,1616.0,"

You are given an integer array nums.

+ +

In one move, you can choose one element of nums and change it to any value.

+ +

Return the minimum difference between the largest and smallest value of nums after performing at most three moves.

+ +

 

+

Example 1:

+ +
+Input: nums = [5,3,2,4]
+Output: 0
+Explanation: We can make at most 3 moves.
+In the first move, change 2 to 3. nums becomes [5,3,3,4].
+In the second move, change 4 to 3. nums becomes [5,3,3,3].
+In the third move, change 5 to 3. nums becomes [3,3,3,3].
+After performing 3 moves, the difference between the minimum and maximum is 3 - 3 = 0.
+
+ +

Example 2:

+ +
+Input: nums = [1,5,0,10,14]
+Output: 1
+Explanation: We can make at most 3 moves.
+In the first move, change 5 to 0. nums becomes [1,0,0,10,14].
+In the second move, change 10 to 0. nums becomes [1,0,0,0,14].
+In the third move, change 14 to 1. nums becomes [1,0,0,0,1].
+After performing 3 moves, the difference between the minimum and maximum is 1 - 0 = 1.
+It can be shown that there is no way to make the difference 0 in 3 moves.
+ +

Example 3:

+ +
+Input: nums = [3,100,20]
+Output: 0
+Explanation: We can make at most 3 moves.
+In the first move, change 100 to 7. nums becomes [3,7,20].
+In the second move, change 20 to 7. nums becomes [3,7,7].
+In the third move, change 3 to 7. nums becomes [7,7,7].
+After performing 3 moves, the difference between the minimum and maximum is 7 - 7 = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int minDifference(vector& nums) { + + } +};","class Solution { + public int minDifference(int[] nums) { + + } +}","class Solution(object): + def minDifference(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minDifference(self, nums: List[int]) -> int: + ","int minDifference(int* nums, int numsSize){ + +}","public class Solution { + public int MinDifference(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minDifference = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_difference(nums) + +end","class Solution { + func minDifference(_ nums: [Int]) -> Int { + + } +}","func minDifference(nums []int) int { + +}","object Solution { + def minDifference(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minDifference(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_difference(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minDifference($nums) { + + } +}","function minDifference(nums: number[]): number { + +};",,,,"class Solution { + int minDifference(List nums) { + + } +}", +941,range-sum-of-sorted-subarray-sums,Range Sum of Sorted Subarray Sums,1508.0,1615.0,"

You are given the array nums consisting of n positive integers. You computed the sum of all non-empty continuous subarrays from the array and then sorted them in non-decreasing order, creating a new array of n * (n + 1) / 2 numbers.

+ +

Return the sum of the numbers from index left to index right (indexed from 1), inclusive, in the new array. Since the answer can be a huge number return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4], n = 4, left = 1, right = 5
+Output: 13 
+Explanation: All subarray sums are 1, 3, 6, 10, 2, 5, 9, 3, 7, 4. After sorting them in non-decreasing order we have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 1 to ri = 5 is 1 + 2 + 3 + 3 + 4 = 13. 
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4], n = 4, left = 3, right = 4
+Output: 6
+Explanation: The given array is the same as example 1. We have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 3 to ri = 4 is 3 + 3 = 6.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4], n = 4, left = 1, right = 10
+Output: 50
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 100
    • +
  • 1 <= left <= right <= n * (n + 1) / 2
    • +
+",2.0,False,"class Solution { +public: + int rangeSum(vector& nums, int n, int left, int right) { + + } +};","class Solution { + public int rangeSum(int[] nums, int n, int left, int right) { + + } +}","class Solution(object): + def rangeSum(self, nums, n, left, right): + """""" + :type nums: List[int] + :type n: int + :type left: int + :type right: int + :rtype: int + """""" + ","class Solution: + def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int: + ","int rangeSum(int* nums, int numsSize, int n, int left, int right){ + +}","public class Solution { + public int RangeSum(int[] nums, int n, int left, int right) { + + } +}","/** + * @param {number[]} nums + * @param {number} n + * @param {number} left + * @param {number} right + * @return {number} + */ +var rangeSum = function(nums, n, left, right) { + +};","# @param {Integer[]} nums +# @param {Integer} n +# @param {Integer} left +# @param {Integer} right +# @return {Integer} +def range_sum(nums, n, left, right) + +end","class Solution { + func rangeSum(_ nums: [Int], _ n: Int, _ left: Int, _ right: Int) -> Int { + + } +}","func rangeSum(nums []int, n int, left int, right int) int { + +}","object Solution { + def rangeSum(nums: Array[Int], n: Int, left: Int, right: Int): Int = { + + } +}","class Solution { + fun rangeSum(nums: IntArray, n: Int, left: Int, right: Int): Int { + + } +}","impl Solution { + pub fn range_sum(nums: Vec, n: i32, left: i32, right: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $n + * @param Integer $left + * @param Integer $right + * @return Integer + */ + function rangeSum($nums, $n, $left, $right) { + + } +}","function rangeSum(nums: number[], n: number, left: number, right: number): number { + +};","(define/contract (range-sum nums n left right) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec range_sum(Nums :: [integer()], N :: integer(), Left :: integer(), Right :: integer()) -> integer(). +range_sum(Nums, N, Left, Right) -> + .","defmodule Solution do + @spec range_sum(nums :: [integer], n :: integer, left :: integer, right :: integer) :: integer + def range_sum(nums, n, left, right) do + + end +end","class Solution { + int rangeSum(List nums, int n, int left, int right) { + + } +}", +942,find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree,Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree,1489.0,1613.0,"

Given a weighted undirected connected graph with n vertices numbered from 0 to n - 1, and an array edges where edges[i] = [ai, bi, weighti] represents a bidirectional and weighted edge between nodes ai and bi. A minimum spanning tree (MST) is a subset of the graph's edges that connects all vertices without cycles and with the minimum possible total edge weight.

+ +

Find all the critical and pseudo-critical edges in the given graph's minimum spanning tree (MST). An MST edge whose deletion from the graph would cause the MST weight to increase is called a critical edge. On the other hand, a pseudo-critical edge is that which can appear in some MSTs but not all.

+ +

Note that you can return the indices of the edges in any order.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 5, edges = [[0,1,1],[1,2,1],[2,3,2],[0,3,2],[0,4,3],[3,4,3],[1,4,6]]
+Output: [[0,1],[2,3,4,5]]
+Explanation: The figure above describes the graph.
+The following figure shows all the possible MSTs:
+
+Notice that the two edges 0 and 1 appear in all MSTs, therefore they are critical edges, so we return them in the first list of the output.
+The edges 2, 3, 4, and 5 are only part of some MSTs, therefore they are considered pseudo-critical edges. We add them to the second list of the output.
+
+ +

Example 2:

+ +

+ +
+Input: n = 4, edges = [[0,1,1],[1,2,1],[2,3,1],[0,3,1]]
+Output: [[],[0,1,2,3]]
+Explanation: We can observe that since all 4 edges have equal weight, choosing any 3 edges from the given 4 will yield an MST. Therefore all 4 edges are pseudo-critical.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 100
    • +
  • 1 <= edges.length <= min(200, n * (n - 1) / 2)
    • +
  • edges[i].length == 3
    • +
  • 0 <= ai < bi < n
    • +
  • 1 <= weighti <= 1000
    • +
  • All pairs (ai, bi) are distinct.
    • +
+",3.0,False,"class Solution { +public: + vector> findCriticalAndPseudoCriticalEdges(int n, vector>& edges) { + + } +};","class Solution { + public List> findCriticalAndPseudoCriticalEdges(int n, int[][] edges) { + + } +}","class Solution(object): + def findCriticalAndPseudoCriticalEdges(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def findCriticalAndPseudoCriticalEdges(self, n: int, edges: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** findCriticalAndPseudoCriticalEdges(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> FindCriticalAndPseudoCriticalEdges(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number[][]} + */ +var findCriticalAndPseudoCriticalEdges = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer[][]} +def find_critical_and_pseudo_critical_edges(n, edges) + +end","class Solution { + func findCriticalAndPseudoCriticalEdges(_ n: Int, _ edges: [[Int]]) -> [[Int]] { + + } +}","func findCriticalAndPseudoCriticalEdges(n int, edges [][]int) [][]int { + +}","object Solution { + def findCriticalAndPseudoCriticalEdges(n: Int, edges: Array[Array[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun findCriticalAndPseudoCriticalEdges(n: Int, edges: Array): List> { + + } +}","impl Solution { + pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer[][] + */ + function findCriticalAndPseudoCriticalEdges($n, $edges) { + + } +}","function findCriticalAndPseudoCriticalEdges(n: number, edges: number[][]): number[][] { + +};","(define/contract (find-critical-and-pseudo-critical-edges n edges) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec find_critical_and_pseudo_critical_edges(N :: integer(), Edges :: [[integer()]]) -> [[integer()]]. +find_critical_and_pseudo_critical_edges(N, Edges) -> + .","defmodule Solution do + @spec find_critical_and_pseudo_critical_edges(n :: integer, edges :: [[integer]]) :: [[integer]] + def find_critical_and_pseudo_critical_edges(n, edges) do + + end +end","class Solution { + List> findCriticalAndPseudoCriticalEdges(int n, List> edges) { + + } +}", +945,xor-operation-in-an-array,XOR Operation in an Array,1486.0,1610.0,"

You are given an integer n and an integer start.

+ +

Define an array nums where nums[i] = start + 2 * i (0-indexed) and n == nums.length.

+ +

Return the bitwise XOR of all elements of nums.

+ +

 

+

Example 1:

+ +
+Input: n = 5, start = 0
+Output: 8
+Explanation: Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
+Where "^" corresponds to bitwise XOR operator.
+
+ +

Example 2:

+ +
+Input: n = 4, start = 3
+Output: 8
+Explanation: Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
  • 0 <= start <= 1000
    • +
  • n == nums.length
    • +
+",1.0,False,"class Solution { +public: + int xorOperation(int n, int start) { + + } +};","class Solution { + public int xorOperation(int n, int start) { + + } +}","class Solution(object): + def xorOperation(self, n, start): + """""" + :type n: int + :type start: int + :rtype: int + """""" + ","class Solution: + def xorOperation(self, n: int, start: int) -> int: + ","int xorOperation(int n, int start){ + +}","public class Solution { + public int XorOperation(int n, int start) { + + } +}","/** + * @param {number} n + * @param {number} start + * @return {number} + */ +var xorOperation = function(n, start) { + +};","# @param {Integer} n +# @param {Integer} start +# @return {Integer} +def xor_operation(n, start) + +end","class Solution { + func xorOperation(_ n: Int, _ start: Int) -> Int { + + } +}","func xorOperation(n int, start int) int { + +}","object Solution { + def xorOperation(n: Int, start: Int): Int = { + + } +}","class Solution { + fun xorOperation(n: Int, start: Int): Int { + + } +}","impl Solution { + pub fn xor_operation(n: i32, start: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $start + * @return Integer + */ + function xorOperation($n, $start) { + + } +}","function xorOperation(n: number, start: number): number { + +};",,,,"class Solution { + int xorOperation(int n, int start) { + + } +}", +947,least-number-of-unique-integers-after-k-removals,Least Number of Unique Integers after K Removals,1481.0,1604.0,"

Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements.

+ +
    +
+ +

 

+

Example 1:

+ +
+Input: arr = [5,5,4], k = 1
+Output: 1
+Explanation: Remove the single 4, only 5 is left.
+
+Example 2: + +
+Input: arr = [4,3,1,1,3,3,2], k = 3
+Output: 2
+Explanation: Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 10^5
    • +
  • 1 <= arr[i] <= 10^9
    • +
  • 0 <= k <= arr.length
    • +
",2.0,False,"class Solution { +public: + int findLeastNumOfUniqueInts(vector& arr, int k) { + + } +};","class Solution { + public int findLeastNumOfUniqueInts(int[] arr, int k) { + + } +}","class Solution(object): + def findLeastNumOfUniqueInts(self, arr, k): + """""" + :type arr: List[int] + :type k: int + :rtype: int + """"""","class Solution: + def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int:","int findLeastNumOfUniqueInts(int* arr, int arrSize, int k){ + +}","public class Solution { + public int FindLeastNumOfUniqueInts(int[] arr, int k) { + + } +}","/** + * @param {number[]} arr + * @param {number} k + * @return {number} + */ +var findLeastNumOfUniqueInts = function(arr, k) { + +};","# @param {Integer[]} arr +# @param {Integer} k +# @return {Integer} +def find_least_num_of_unique_ints(arr, k) + +end","class Solution { + func findLeastNumOfUniqueInts(_ arr: [Int], _ k: Int) -> Int { + + } +}","func findLeastNumOfUniqueInts(arr []int, k int) int { + +}","object Solution { + def findLeastNumOfUniqueInts(arr: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun findLeastNumOfUniqueInts(arr: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn find_least_num_of_unique_ints(arr: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $k + * @return Integer + */ + function findLeastNumOfUniqueInts($arr, $k) { + + } +}","function findLeastNumOfUniqueInts(arr: number[], k: number): number { + +};",,,,, +949,parallel-courses-ii,Parallel Courses II,1494.0,1587.0,"

You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where relations[i] = [prevCoursei, nextCoursei], representing a prerequisite relationship between course prevCoursei and course nextCoursei: course prevCoursei has to be taken before course nextCoursei. Also, you are given the integer k.

+ +

In one semester, you can take at most k courses as long as you have taken all the prerequisites in the previous semesters for the courses you are taking.

+ +

Return the minimum number of semesters needed to take all courses. The testcases will be generated such that it is possible to take every course.

+ +

 

+

Example 1:

+ +
+Input: n = 4, relations = [[2,1],[3,1],[1,4]], k = 2
+Output: 3
+Explanation: The figure above represents the given graph.
+In the first semester, you can take courses 2 and 3.
+In the second semester, you can take course 1.
+In the third semester, you can take course 4.
+
+ +

Example 2:

+ +
+Input: n = 5, relations = [[2,1],[3,1],[4,1],[1,5]], k = 2
+Output: 4
+Explanation: The figure above represents the given graph.
+In the first semester, you can only take courses 2 and 3 since you cannot take more than two per semester.
+In the second semester, you can take course 4.
+In the third semester, you can take course 1.
+In the fourth semester, you can take course 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 15
    • +
  • 1 <= k <= n
    • +
  • 0 <= relations.length <= n * (n-1) / 2
    • +
  • relations[i].length == 2
    • +
  • 1 <= prevCoursei, nextCoursei <= n
    • +
  • prevCoursei != nextCoursei
    • +
  • All the pairs [prevCoursei, nextCoursei] are unique.
    • +
  • The given graph is a directed acyclic graph.
    • +
+",3.0,False,"class Solution { +public: + int minNumberOfSemesters(int n, vector>& relations, int k) { + + } +};","class Solution { + public int minNumberOfSemesters(int n, int[][] relations, int k) { + + } +}","class Solution(object): + def minNumberOfSemesters(self, n, relations, k): + """""" + :type n: int + :type relations: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def minNumberOfSemesters(self, n: int, relations: List[List[int]], k: int) -> int: + ","int minNumberOfSemesters(int n, int** relations, int relationsSize, int* relationsColSize, int k){ + +}","public class Solution { + public int MinNumberOfSemesters(int n, int[][] relations, int k) { + + } +}","/** + * @param {number} n + * @param {number[][]} relations + * @param {number} k + * @return {number} + */ +var minNumberOfSemesters = function(n, relations, k) { + +};","# @param {Integer} n +# @param {Integer[][]} relations +# @param {Integer} k +# @return {Integer} +def min_number_of_semesters(n, relations, k) + +end","class Solution { + func minNumberOfSemesters(_ n: Int, _ relations: [[Int]], _ k: Int) -> Int { + + } +}","func minNumberOfSemesters(n int, relations [][]int, k int) int { + +}","object Solution { + def minNumberOfSemesters(n: Int, relations: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun minNumberOfSemesters(n: Int, relations: Array, k: Int): Int { + + } +}","impl Solution { + pub fn min_number_of_semesters(n: i32, relations: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $relations + * @param Integer $k + * @return Integer + */ + function minNumberOfSemesters($n, $relations, $k) { + + } +}","function minNumberOfSemesters(n: number, relations: number[][], k: number): number { + +};","(define/contract (min-number-of-semesters n relations k) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec min_number_of_semesters(N :: integer(), Relations :: [[integer()]], K :: integer()) -> integer(). +min_number_of_semesters(N, Relations, K) -> + .","defmodule Solution do + @spec min_number_of_semesters(n :: integer, relations :: [[integer]], k :: integer) :: integer + def min_number_of_semesters(n, relations, k) do + + end +end","class Solution { + int minNumberOfSemesters(int n, List> relations, int k) { + + } +}", +950,longest-subarray-of-1s-after-deleting-one-element,Longest Subarray of 1's After Deleting One Element,1493.0,1586.0,"

Given a binary array nums, you should delete one element from it.

+ +

Return the size of the longest non-empty subarray containing only 1's in the resulting array. Return 0 if there is no such subarray.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,0,1]
+Output: 3
+Explanation: After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1's.
+
+ +

Example 2:

+ +
+Input: nums = [0,1,1,1,0,1,1,0,1]
+Output: 5
+Explanation: After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1's is [1,1,1,1,1].
+
+ +

Example 3:

+ +
+Input: nums = [1,1,1]
+Output: 2
+Explanation: You must delete one element.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • nums[i] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int longestSubarray(vector& nums) { + + } +};","class Solution { + public int longestSubarray(int[] nums) { + + } +}","class Solution(object): + def longestSubarray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def longestSubarray(self, nums: List[int]) -> int: + ","int longestSubarray(int* nums, int numsSize){ + +}","public class Solution { + public int LongestSubarray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var longestSubarray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def longest_subarray(nums) + +end","class Solution { + func longestSubarray(_ nums: [Int]) -> Int { + + } +}","func longestSubarray(nums []int) int { + +}","object Solution { + def longestSubarray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun longestSubarray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn longest_subarray(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function longestSubarray($nums) { + + } +}","function longestSubarray(nums: number[]): number { + +};","(define/contract (longest-subarray nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_subarray(Nums :: [integer()]) -> integer(). +longest_subarray(Nums) -> + .","defmodule Solution do + @spec longest_subarray(nums :: [integer]) :: integer + def longest_subarray(nums) do + + end +end","class Solution { + int longestSubarray(List nums) { + + } +}", +951,the-kth-factor-of-n,The kth Factor of n,1492.0,1585.0,"

You are given two positive integers n and k. A factor of an integer n is defined as an integer i where n % i == 0.

+ +

Consider a list of all factors of n sorted in ascending order, return the kth factor in this list or return -1 if n has less than k factors.

+ +

 

+

Example 1:

+ +
+Input: n = 12, k = 3
+Output: 3
+Explanation: Factors list is [1, 2, 3, 4, 6, 12], the 3rd factor is 3.
+
+ +

Example 2:

+ +
+Input: n = 7, k = 2
+Output: 7
+Explanation: Factors list is [1, 7], the 2nd factor is 7.
+
+ +

Example 3:

+ +
+Input: n = 4, k = 4
+Output: -1
+Explanation: Factors list is [1, 2, 4], there is only 3 factors. We should return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 1000
    • +
+ +

 

+

Follow up:

+ +

Could you solve this problem in less than O(n) complexity?

+",2.0,False,"class Solution { +public: + int kthFactor(int n, int k) { + + } +};","class Solution { + public int kthFactor(int n, int k) { + + } +}","class Solution(object): + def kthFactor(self, n, k): + """""" + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def kthFactor(self, n: int, k: int) -> int: + ","int kthFactor(int n, int k){ + +}","public class Solution { + public int KthFactor(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var kthFactor = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def kth_factor(n, k) + +end","class Solution { + func kthFactor(_ n: Int, _ k: Int) -> Int { + + } +}","func kthFactor(n int, k int) int { + +}","object Solution { + def kthFactor(n: Int, k: Int): Int = { + + } +}","class Solution { + fun kthFactor(n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn kth_factor(n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function kthFactor($n, $k) { + + } +}","function kthFactor(n: number, k: number): number { + +};",,"-spec kth_factor(N :: integer(), K :: integer()) -> integer(). +kth_factor(N, K) -> + .","defmodule Solution do + @spec kth_factor(n :: integer, k :: integer) :: integer + def kth_factor(n, k) do + + end +end","class Solution { + int kthFactor(int n, int k) { + + } +}", +953,paint-house-iii,Paint House III,1473.0,1583.0,"

There is a row of m houses in a small city, each house must be painted with one of the n colors (labeled from 1 to n), some houses that have been painted last summer should not be painted again.

+ +

A neighborhood is a maximal group of continuous houses that are painted with the same color.

+ +
    +
  • For example: houses = [1,2,2,3,3,2,1,1] contains 5 neighborhoods [{1}, {2,2}, {3,3}, {2}, {1,1}].
    • +
+ +

Given an array houses, an m x n matrix cost and an integer target where:

+ +
    +
  • houses[i]: is the color of the house i, and 0 if the house is not painted yet.
    • +
  • cost[i][j]: is the cost of paint the house i with the color j + 1.
    • +
+ +

Return the minimum cost of painting all the remaining houses in such a way that there are exactly target neighborhoods. If it is not possible, return -1.

+ +

 

+

Example 1:

+ +
+Input: houses = [0,0,0,0,0], cost = [[1,10],[10,1],[10,1],[1,10],[5,1]], m = 5, n = 2, target = 3
+Output: 9
+Explanation: Paint houses of this way [1,2,2,1,1]
+This array contains target = 3 neighborhoods, [{1}, {2,2}, {1,1}].
+Cost of paint all houses (1 + 1 + 1 + 1 + 5) = 9.
+
+ +

Example 2:

+ +
+Input: houses = [0,2,1,2,0], cost = [[1,10],[10,1],[10,1],[1,10],[5,1]], m = 5, n = 2, target = 3
+Output: 11
+Explanation: Some houses are already painted, Paint the houses of this way [2,2,1,2,2]
+This array contains target = 3 neighborhoods, [{2,2}, {1}, {2,2}]. 
+Cost of paint the first and last house (10 + 1) = 11.
+
+ +

Example 3:

+ +
+Input: houses = [3,1,2,3], cost = [[1,1,1],[1,1,1],[1,1,1],[1,1,1]], m = 4, n = 3, target = 3
+Output: -1
+Explanation: Houses are already painted with a total of 4 neighborhoods [{3},{1},{2},{3}] different of target = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • m == houses.length == cost.length
    • +
  • n == cost[i].length
    • +
  • 1 <= m <= 100
    • +
  • 1 <= n <= 20
    • +
  • 1 <= target <= m
    • +
  • 0 <= houses[i] <= n
    • +
  • 1 <= cost[i][j] <= 104
    • +
+",3.0,False,"class Solution { +public: + int minCost(vector& houses, vector>& cost, int m, int n, int target) { + + } +};","class Solution { + public int minCost(int[] houses, int[][] cost, int m, int n, int target) { + + } +}","class Solution(object): + def minCost(self, houses, cost, m, n, target): + """""" + :type houses: List[int] + :type cost: List[List[int]] + :type m: int + :type n: int + :type target: int + :rtype: int + """""" + ","class Solution: + def minCost(self, houses: List[int], cost: List[List[int]], m: int, n: int, target: int) -> int: + ","int minCost(int* houses, int housesSize, int** cost, int costSize, int* costColSize, int m, int n, int target){ + +}","public class Solution { + public int MinCost(int[] houses, int[][] cost, int m, int n, int target) { + + } +}","/** + * @param {number[]} houses + * @param {number[][]} cost + * @param {number} m + * @param {number} n + * @param {number} target + * @return {number} + */ +var minCost = function(houses, cost, m, n, target) { + +};","# @param {Integer[]} houses +# @param {Integer[][]} cost +# @param {Integer} m +# @param {Integer} n +# @param {Integer} target +# @return {Integer} +def min_cost(houses, cost, m, n, target) + +end","class Solution { + func minCost(_ houses: [Int], _ cost: [[Int]], _ m: Int, _ n: Int, _ target: Int) -> Int { + + } +}","func minCost(houses []int, cost [][]int, m int, n int, target int) int { + +}","object Solution { + def minCost(houses: Array[Int], cost: Array[Array[Int]], m: Int, n: Int, target: Int): Int = { + + } +}","class Solution { + fun minCost(houses: IntArray, cost: Array, m: Int, n: Int, target: Int): Int { + + } +}","impl Solution { + pub fn min_cost(houses: Vec, cost: Vec>, m: i32, n: i32, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $houses + * @param Integer[][] $cost + * @param Integer $m + * @param Integer $n + * @param Integer $target + * @return Integer + */ + function minCost($houses, $cost, $m, $n, $target) { + + } +}","function minCost(houses: number[], cost: number[][], m: number, n: number, target: number): number { + +};","(define/contract (min-cost houses cost m n target) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec min_cost(Houses :: [integer()], Cost :: [[integer()]], M :: integer(), N :: integer(), Target :: integer()) -> integer(). +min_cost(Houses, Cost, M, N, Target) -> + .","defmodule Solution do + @spec min_cost(houses :: [integer], cost :: [[integer]], m :: integer, n :: integer, target :: integer) :: integer + def min_cost(houses, cost, m, n, target) do + + end +end","class Solution { + int minCost(List houses, List> cost, int m, int n, int target) { + + } +}", +954,design-browser-history,Design Browser History,1472.0,1582.0,"

You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the history number of steps.

+ +

Implement the BrowserHistory class:

+ +
    +
  • BrowserHistory(string homepage) Initializes the object with the homepage of the browser.
    • +
  • void visit(string url) Visits url from the current page. It clears up all the forward history.
    • +
  • string back(int steps) Move steps back in history. If you can only return x steps in the history and steps > x, you will return only x steps. Return the current url after moving back in history at most steps.
    • +
  • string forward(int steps) Move steps forward in history. If you can only forward x steps in the history and steps > x, you will forward only x steps. Return the current url after forwarding in history at most steps.
    • +
+ +

 

+

Example:

+ +
+Input:
+["BrowserHistory","visit","visit","visit","back","back","forward","visit","forward","back","back"]
+[["leetcode.com"],["google.com"],["facebook.com"],["youtube.com"],[1],[1],[1],["linkedin.com"],[2],[2],[7]]
+Output:
+[null,null,null,null,"facebook.com","google.com","facebook.com",null,"linkedin.com","google.com","leetcode.com"]
+
+Explanation:
+BrowserHistory browserHistory = new BrowserHistory("leetcode.com");
+browserHistory.visit("google.com");       // You are in "leetcode.com". Visit "google.com"
+browserHistory.visit("facebook.com");     // You are in "google.com". Visit "facebook.com"
+browserHistory.visit("youtube.com");      // You are in "facebook.com". Visit "youtube.com"
+browserHistory.back(1);                   // You are in "youtube.com", move back to "facebook.com" return "facebook.com"
+browserHistory.back(1);                   // You are in "facebook.com", move back to "google.com" return "google.com"
+browserHistory.forward(1);                // You are in "google.com", move forward to "facebook.com" return "facebook.com"
+browserHistory.visit("linkedin.com");     // You are in "facebook.com". Visit "linkedin.com"
+browserHistory.forward(2);                // You are in "linkedin.com", you cannot move forward any steps.
+browserHistory.back(2);                   // You are in "linkedin.com", move back two steps to "facebook.com" then to "google.com". return "google.com"
+browserHistory.back(7);                   // You are in "google.com", you can move back only one step to "leetcode.com". return "leetcode.com"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= homepage.length <= 20
    • +
  • 1 <= url.length <= 20
    • +
  • 1 <= steps <= 100
    • +
  • homepage and url consist of  '.' or lower case English letters.
    • +
  • At most 5000 calls will be made to visit, back, and forward.
    • +
+",2.0,False,"class BrowserHistory { +public: + BrowserHistory(string homepage) { + + } + + void visit(string url) { + + } + + string back(int steps) { + + } + + string forward(int steps) { + + } +}; + +/** + * Your BrowserHistory object will be instantiated and called as such: + * BrowserHistory* obj = new BrowserHistory(homepage); + * obj->visit(url); + * string param_2 = obj->back(steps); + * string param_3 = obj->forward(steps); + */","class BrowserHistory { + + public BrowserHistory(String homepage) { + + } + + public void visit(String url) { + + } + + public String back(int steps) { + + } + + public String forward(int steps) { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * BrowserHistory obj = new BrowserHistory(homepage); + * obj.visit(url); + * String param_2 = obj.back(steps); + * String param_3 = obj.forward(steps); + */","class BrowserHistory(object): + + def __init__(self, homepage): + """""" + :type homepage: str + """""" + + + def visit(self, url): + """""" + :type url: str + :rtype: None + """""" + + + def back(self, steps): + """""" + :type steps: int + :rtype: str + """""" + + + def forward(self, steps): + """""" + :type steps: int + :rtype: str + """""" + + + +# Your BrowserHistory object will be instantiated and called as such: +# obj = BrowserHistory(homepage) +# obj.visit(url) +# param_2 = obj.back(steps) +# param_3 = obj.forward(steps)","class BrowserHistory: + + def __init__(self, homepage: str): + + + def visit(self, url: str) -> None: + + + def back(self, steps: int) -> str: + + + def forward(self, steps: int) -> str: + + + +# Your BrowserHistory object will be instantiated and called as such: +# obj = BrowserHistory(homepage) +# obj.visit(url) +# param_2 = obj.back(steps) +# param_3 = obj.forward(steps)"," + + +typedef struct { + +} BrowserHistory; + + +BrowserHistory* browserHistoryCreate(char * homepage) { + +} + +void browserHistoryVisit(BrowserHistory* obj, char * url) { + +} + +char * browserHistoryBack(BrowserHistory* obj, int steps) { + +} + +char * browserHistoryForward(BrowserHistory* obj, int steps) { + +} + +void browserHistoryFree(BrowserHistory* obj) { + +} + +/** + * Your BrowserHistory struct will be instantiated and called as such: + * BrowserHistory* obj = browserHistoryCreate(homepage); + * browserHistoryVisit(obj, url); + + * char * param_2 = browserHistoryBack(obj, steps); + + * char * param_3 = browserHistoryForward(obj, steps); + + * browserHistoryFree(obj); +*/","public class BrowserHistory { + + public BrowserHistory(string homepage) { + + } + + public void Visit(string url) { + + } + + public string Back(int steps) { + + } + + public string Forward(int steps) { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * BrowserHistory obj = new BrowserHistory(homepage); + * obj.Visit(url); + * string param_2 = obj.Back(steps); + * string param_3 = obj.Forward(steps); + */","/** + * @param {string} homepage + */ +var BrowserHistory = function(homepage) { + +}; + +/** + * @param {string} url + * @return {void} + */ +BrowserHistory.prototype.visit = function(url) { + +}; + +/** + * @param {number} steps + * @return {string} + */ +BrowserHistory.prototype.back = function(steps) { + +}; + +/** + * @param {number} steps + * @return {string} + */ +BrowserHistory.prototype.forward = function(steps) { + +}; + +/** + * Your BrowserHistory object will be instantiated and called as such: + * var obj = new BrowserHistory(homepage) + * obj.visit(url) + * var param_2 = obj.back(steps) + * var param_3 = obj.forward(steps) + */","class BrowserHistory + +=begin + :type homepage: String +=end + def initialize(homepage) + + end + + +=begin + :type url: String + :rtype: Void +=end + def visit(url) + + end + + +=begin + :type steps: Integer + :rtype: String +=end + def back(steps) + + end + + +=begin + :type steps: Integer + :rtype: String +=end + def forward(steps) + + end + + +end + +# Your BrowserHistory object will be instantiated and called as such: +# obj = BrowserHistory.new(homepage) +# obj.visit(url) +# param_2 = obj.back(steps) +# param_3 = obj.forward(steps)"," +class BrowserHistory { + + init(_ homepage: String) { + + } + + func visit(_ url: String) { + + } + + func back(_ steps: Int) -> String { + + } + + func forward(_ steps: Int) -> String { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * let obj = BrowserHistory(homepage) + * obj.visit(url) + * let ret_2: String = obj.back(steps) + * let ret_3: String = obj.forward(steps) + */","type BrowserHistory struct { + +} + + +func Constructor(homepage string) BrowserHistory { + +} + + +func (this *BrowserHistory) Visit(url string) { + +} + + +func (this *BrowserHistory) Back(steps int) string { + +} + + +func (this *BrowserHistory) Forward(steps int) string { + +} + + +/** + * Your BrowserHistory object will be instantiated and called as such: + * obj := Constructor(homepage); + * obj.Visit(url); + * param_2 := obj.Back(steps); + * param_3 := obj.Forward(steps); + */","class BrowserHistory(_homepage: String) { + + def visit(url: String) { + + } + + def back(steps: Int): String = { + + } + + def forward(steps: Int): String = { + + } + +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * var obj = new BrowserHistory(homepage) + * obj.visit(url) + * var param_2 = obj.back(steps) + * var param_3 = obj.forward(steps) + */","class BrowserHistory(homepage: String) { + + fun visit(url: String) { + + } + + fun back(steps: Int): String { + + } + + fun forward(steps: Int): String { + + } + +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * var obj = BrowserHistory(homepage) + * obj.visit(url) + * var param_2 = obj.back(steps) + * var param_3 = obj.forward(steps) + */","struct BrowserHistory { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl BrowserHistory { + + fn new(homepage: String) -> Self { + + } + + fn visit(&self, url: String) { + + } + + fn back(&self, steps: i32) -> String { + + } + + fn forward(&self, steps: i32) -> String { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * let obj = BrowserHistory::new(homepage); + * obj.visit(url); + * let ret_2: String = obj.back(steps); + * let ret_3: String = obj.forward(steps); + */","class BrowserHistory { + /** + * @param String $homepage + */ + function __construct($homepage) { + + } + + /** + * @param String $url + * @return NULL + */ + function visit($url) { + + } + + /** + * @param Integer $steps + * @return String + */ + function back($steps) { + + } + + /** + * @param Integer $steps + * @return String + */ + function forward($steps) { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * $obj = BrowserHistory($homepage); + * $obj->visit($url); + * $ret_2 = $obj->back($steps); + * $ret_3 = $obj->forward($steps); + */","class BrowserHistory { + constructor(homepage: string) { + + } + + visit(url: string): void { + + } + + back(steps: number): string { + + } + + forward(steps: number): string { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * var obj = new BrowserHistory(homepage) + * obj.visit(url) + * var param_2 = obj.back(steps) + * var param_3 = obj.forward(steps) + */",,,,"class BrowserHistory { + + BrowserHistory(String homepage) { + + } + + void visit(String url) { + + } + + String back(int steps) { + + } + + String forward(int steps) { + + } +} + +/** + * Your BrowserHistory object will be instantiated and called as such: + * BrowserHistory obj = BrowserHistory(homepage); + * obj.visit(url); + * String param2 = obj.back(steps); + * String param3 = obj.forward(steps); + */", +957,probability-of-a-two-boxes-having-the-same-number-of-distinct-balls,Probability of a Two Boxes Having The Same Number of Distinct Balls,1467.0,1577.0,"

Given 2n balls of k distinct colors. You will be given an integer array balls of size k where balls[i] is the number of balls of color i.

+ +

All the balls will be shuffled uniformly at random, then we will distribute the first n balls to the first box and the remaining n balls to the other box (Please read the explanation of the second example carefully).

+ +

Please note that the two boxes are considered different. For example, if we have two balls of colors a and b, and two boxes [] and (), then the distribution [a] (b) is considered different than the distribution [b] (a) (Please read the explanation of the first example carefully).

+ +

Return the probability that the two boxes have the same number of distinct balls. Answers within 10-5 of the actual value will be accepted as correct.

+ +

 

+

Example 1:

+ +
+Input: balls = [1,1]
+Output: 1.00000
+Explanation: Only 2 ways to divide the balls equally:
+- A ball of color 1 to box 1 and a ball of color 2 to box 2
+- A ball of color 2 to box 1 and a ball of color 1 to box 2
+In both ways, the number of distinct colors in each box is equal. The probability is 2/2 = 1
+
+ +

Example 2:

+ +
+Input: balls = [2,1,1]
+Output: 0.66667
+Explanation: We have the set of balls [1, 1, 2, 3]
+This set of balls will be shuffled randomly and we may have one of the 12 distinct shuffles with equal probability (i.e. 1/12):
+[1,1 / 2,3], [1,1 / 3,2], [1,2 / 1,3], [1,2 / 3,1], [1,3 / 1,2], [1,3 / 2,1], [2,1 / 1,3], [2,1 / 3,1], [2,3 / 1,1], [3,1 / 1,2], [3,1 / 2,1], [3,2 / 1,1]
+After that, we add the first two balls to the first box and the second two balls to the second box.
+We can see that 8 of these 12 possible random distributions have the same number of distinct colors of balls in each box.
+Probability is 8/12 = 0.66667
+
+ +

Example 3:

+ +
+Input: balls = [1,2,1,2]
+Output: 0.60000
+Explanation: The set of balls is [1, 2, 2, 3, 4, 4]. It is hard to display all the 180 possible random shuffles of this set but it is easy to check that 108 of them will have the same number of distinct colors in each box.
+Probability = 108 / 180 = 0.6
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= balls.length <= 8
    • +
  • 1 <= balls[i] <= 6
    • +
  • sum(balls) is even.
    • +
+",3.0,False,"class Solution { +public: + double getProbability(vector& balls) { + + } +};","class Solution { + public double getProbability(int[] balls) { + + } +}","class Solution(object): + def getProbability(self, balls): + """""" + :type balls: List[int] + :rtype: float + """""" + ","class Solution: + def getProbability(self, balls: List[int]) -> float: + ","double getProbability(int* balls, int ballsSize){ + +}","public class Solution { + public double GetProbability(int[] balls) { + + } +}","/** + * @param {number[]} balls + * @return {number} + */ +var getProbability = function(balls) { + +};","# @param {Integer[]} balls +# @return {Float} +def get_probability(balls) + +end","class Solution { + func getProbability(_ balls: [Int]) -> Double { + + } +}","func getProbability(balls []int) float64 { + +}","object Solution { + def getProbability(balls: Array[Int]): Double = { + + } +}","class Solution { + fun getProbability(balls: IntArray): Double { + + } +}","impl Solution { + pub fn get_probability(balls: Vec) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[] $balls + * @return Float + */ + function getProbability($balls) { + + } +}","function getProbability(balls: number[]): number { + +};","(define/contract (get-probability balls) + (-> (listof exact-integer?) flonum?) + + )","-spec get_probability(Balls :: [integer()]) -> float(). +get_probability(Balls) -> + .","defmodule Solution do + @spec get_probability(balls :: [integer]) :: float + def get_probability(balls) do + + end +end","class Solution { + double getProbability(List balls) { + + } +}", +960,maximum-product-of-two-elements-in-an-array,Maximum Product of Two Elements in an Array,1464.0,1574.0,"Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1). +

 

+

Example 1:

+ +
+Input: nums = [3,4,5,2]
+Output: 12 
+Explanation: If you choose the indices i=1 and j=2 (indexed from 0), you will get the maximum value, that is, (nums[1]-1)*(nums[2]-1) = (4-1)*(5-1) = 3*4 = 12. 
+
+ +

Example 2:

+ +
+Input: nums = [1,5,4,5]
+Output: 16
+Explanation: Choosing the indices i=1 and j=3 (indexed from 0), you will get the maximum value of (5-1)*(5-1) = 16.
+
+ +

Example 3:

+ +
+Input: nums = [3,7]
+Output: 12
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 500
    • +
  • 1 <= nums[i] <= 10^3
    • +
+",1.0,False,"class Solution { +public: + int maxProduct(vector& nums) { + + } +};","class Solution { + public int maxProduct(int[] nums) { + + } +}","class Solution(object): + def maxProduct(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxProduct(self, nums: List[int]) -> int: + ","int maxProduct(int* nums, int numsSize){ + +}","public class Solution { + public int MaxProduct(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxProduct = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_product(nums) + +end","class Solution { + func maxProduct(_ nums: [Int]) -> Int { + + } +}","func maxProduct(nums []int) int { + +}","object Solution { + def maxProduct(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxProduct(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_product(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxProduct($nums) { + + } +}","function maxProduct(nums: number[]): number { + +};","(define/contract (max-product nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_product(Nums :: [integer()]) -> integer(). +max_product(Nums) -> + .","defmodule Solution do + @spec max_product(nums :: [integer]) :: integer + def max_product(nums) do + + end +end","class Solution { + int maxProduct(List nums) { + + } +}", +961,find-two-non-overlapping-sub-arrays-each-with-target-sum,Find Two Non-overlapping Sub-arrays Each With Target Sum,1477.0,1573.0,"

You are given an array of integers arr and an integer target.

+ +

You have to find two non-overlapping sub-arrays of arr each with a sum equal target. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays is minimum.

+ +

Return the minimum sum of the lengths of the two required sub-arrays, or return -1 if you cannot find such two sub-arrays.

+ +

 

+

Example 1:

+ +
+Input: arr = [3,2,2,4,3], target = 3
+Output: 2
+Explanation: Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.
+
+ +

Example 2:

+ +
+Input: arr = [7,3,4,7], target = 7
+Output: 2
+Explanation: Although we have three non-overlapping sub-arrays of sum = 7 ([7], [3,4] and [7]), but we will choose the first and third sub-arrays as the sum of their lengths is 2.
+
+ +

Example 3:

+ +
+Input: arr = [4,3,2,6,2,3,4], target = 6
+Output: -1
+Explanation: We have only one sub-array of sum = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 1 <= arr[i] <= 1000
    • +
  • 1 <= target <= 108
    • +
+",2.0,False,"class Solution { +public: + int minSumOfLengths(vector& arr, int target) { + + } +};","class Solution { + public int minSumOfLengths(int[] arr, int target) { + + } +}","class Solution(object): + def minSumOfLengths(self, arr, target): + """""" + :type arr: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def minSumOfLengths(self, arr: List[int], target: int) -> int: + ","int minSumOfLengths(int* arr, int arrSize, int target){ + +}","public class Solution { + public int MinSumOfLengths(int[] arr, int target) { + + } +}","/** + * @param {number[]} arr + * @param {number} target + * @return {number} + */ +var minSumOfLengths = function(arr, target) { + +};","# @param {Integer[]} arr +# @param {Integer} target +# @return {Integer} +def min_sum_of_lengths(arr, target) + +end","class Solution { + func minSumOfLengths(_ arr: [Int], _ target: Int) -> Int { + + } +}","func minSumOfLengths(arr []int, target int) int { + +}","object Solution { + def minSumOfLengths(arr: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun minSumOfLengths(arr: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn min_sum_of_lengths(arr: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $target + * @return Integer + */ + function minSumOfLengths($arr, $target) { + + } +}","function minSumOfLengths(arr: number[], target: number): number { + +};","(define/contract (min-sum-of-lengths arr target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_sum_of_lengths(Arr :: [integer()], Target :: integer()) -> integer(). +min_sum_of_lengths(Arr, Target) -> + .","defmodule Solution do + @spec min_sum_of_lengths(arr :: [integer], target :: integer) :: integer + def min_sum_of_lengths(arr, target) do + + end +end","class Solution { + int minSumOfLengths(List arr, int target) { + + } +}", +963,allocate-mailboxes,Allocate Mailboxes,1478.0,1571.0,"

Given the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street.

+ +

Return the minimum total distance between each house and its nearest mailbox.

+ +

The test cases are generated so that the answer fits in a 32-bit integer.

+ +

 

+

Example 1:

+ +
+Input: houses = [1,4,8,10,20], k = 3
+Output: 5
+Explanation: Allocate mailboxes in position 3, 9 and 20.
+Minimum total distance from each houses to nearest mailboxes is |3-1| + |4-3| + |9-8| + |10-9| + |20-20| = 5 
+
+ +

Example 2:

+ +
+Input: houses = [2,3,5,12,18], k = 2
+Output: 9
+Explanation: Allocate mailboxes in position 3 and 14.
+Minimum total distance from each houses to nearest mailboxes is |2-3| + |3-3| + |5-3| + |12-14| + |18-14| = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= houses.length <= 100
    • +
  • 1 <= houses[i] <= 104
    • +
  • All the integers of houses are unique.
    • +
+",3.0,False,"class Solution { +public: + int minDistance(vector& houses, int k) { + + } +};","class Solution { + public int minDistance(int[] houses, int k) { + + } +}","class Solution(object): + def minDistance(self, houses, k): + """""" + :type houses: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minDistance(self, houses: List[int], k: int) -> int: + ","int minDistance(int* houses, int housesSize, int k){ + +}","public class Solution { + public int MinDistance(int[] houses, int k) { + + } +}","/** + * @param {number[]} houses + * @param {number} k + * @return {number} + */ +var minDistance = function(houses, k) { + +};","# @param {Integer[]} houses +# @param {Integer} k +# @return {Integer} +def min_distance(houses, k) + +end","class Solution { + func minDistance(_ houses: [Int], _ k: Int) -> Int { + + } +}","func minDistance(houses []int, k int) int { + +}","object Solution { + def minDistance(houses: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minDistance(houses: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_distance(houses: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $houses + * @param Integer $k + * @return Integer + */ + function minDistance($houses, $k) { + + } +}","function minDistance(houses: number[], k: number): number { + +};",,,,"class Solution { + int minDistance(List houses, int k) { + + } +}", +965,max-dot-product-of-two-subsequences,Max Dot Product of Two Subsequences,1458.0,1569.0,"

Given two arrays nums1 and nums2.

+ +

Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length.

+ +

A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, [2,3,5] is a subsequence of [1,2,3,4,5] while [1,5,3] is not).

+ +

 

+

Example 1:

+ +
+Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]
+Output: 18
+Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
+Their dot product is (2*3 + (-2)*(-6)) = 18.
+ +

Example 2:

+ +
+Input: nums1 = [3,-2], nums2 = [2,-6,7]
+Output: 21
+Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.
+Their dot product is (3*7) = 21.
+ +

Example 3:

+ +
+Input: nums1 = [-1,-1], nums2 = [1,1]
+Output: -1
+Explanation: Take subsequence [-1] from nums1 and subsequence [1] from nums2.
+Their dot product is -1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 500
    • +
  • -1000 <= nums1[i], nums2[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int maxDotProduct(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int maxDotProduct(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def maxDotProduct(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int: + "," + +int maxDotProduct(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MaxDotProduct(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maxDotProduct = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def max_dot_product(nums1, nums2) + +end","class Solution { + func maxDotProduct(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func maxDotProduct(nums1 []int, nums2 []int) int { + +}","object Solution { + def maxDotProduct(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun maxDotProduct(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn max_dot_product(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function maxDotProduct($nums1, $nums2) { + + } +}","function maxDotProduct(nums1: number[], nums2: number[]): number { + +};",,,,, +967,maximum-number-of-vowels-in-a-substring-of-given-length,Maximum Number of Vowels in a Substring of Given Length,1456.0,1567.0,"

Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k.

+ +

Vowel letters in English are 'a', 'e', 'i', 'o', and 'u'.

+ +

 

+

Example 1:

+ +
+Input: s = "abciiidef", k = 3
+Output: 3
+Explanation: The substring "iii" contains 3 vowel letters.
+
+ +

Example 2:

+ +
+Input: s = "aeiou", k = 2
+Output: 2
+Explanation: Any substring of length 2 contains 2 vowels.
+
+ +

Example 3:

+ +
+Input: s = "leetcode", k = 3
+Output: 2
+Explanation: "lee", "eet" and "ode" contain 2 vowels.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
  • 1 <= k <= s.length
    • +
+",2.0,False,"class Solution { +public: + int maxVowels(string s, int k) { + + } +};","class Solution { + public int maxVowels(String s, int k) { + + } +}","class Solution(object): + def maxVowels(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def maxVowels(self, s: str, k: int) -> int: + ","int maxVowels(char * s, int k){ + +}","public class Solution { + public int MaxVowels(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var maxVowels = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def max_vowels(s, k) + +end","class Solution { + func maxVowels(_ s: String, _ k: Int) -> Int { + + } +}","func maxVowels(s string, k int) int { + +}","object Solution { + def maxVowels(s: String, k: Int): Int = { + + } +}","class Solution { + fun maxVowels(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn max_vowels(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function maxVowels($s, $k) { + + } +}","function maxVowels(s: string, k: number): number { + +};",,,,"class Solution { + int maxVowels(String s, int k) { + + } +}", +969,maximum-number-of-darts-inside-of-a-circular-dartboard,Maximum Number of Darts Inside of a Circular Dartboard,1453.0,1563.0,"

Alice is throwing n darts on a very large wall. You are given an array darts where darts[i] = [xi, yi] is the position of the ith dart that Alice threw on the wall.

+ +

Bob knows the positions of the n darts on the wall. He wants to place a dartboard of radius r on the wall so that the maximum number of darts that Alice throws lie on the dartboard.

+ +

Given the integer r, return the maximum number of darts that can lie on the dartboard.

+ +

 

+

Example 1:

+ +
+Input: darts = [[-2,0],[2,0],[0,2],[0,-2]], r = 2
+Output: 4
+Explanation: Circle dartboard with center in (0,0) and radius = 2 contain all points.
+
+ +

Example 2:

+ +
+Input: darts = [[-3,0],[3,0],[2,6],[5,4],[0,9],[7,8]], r = 5
+Output: 5
+Explanation: Circle dartboard with center in (0,4) and radius = 5 contain all points except the point (7,8).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= darts.length <= 100
    • +
  • darts[i].length == 2
    • +
  • -104 <= xi, yi <= 104
    • +
  • All the darts are unique
    • +
  • 1 <= r <= 5000
    • +
+",3.0,False,"class Solution { +public: + int numPoints(vector>& darts, int r) { + + } +};","class Solution { + public int numPoints(int[][] darts, int r) { + + } +}","class Solution(object): + def numPoints(self, darts, r): + """""" + :type darts: List[List[int]] + :type r: int + :rtype: int + """""" + ","class Solution: + def numPoints(self, darts: List[List[int]], r: int) -> int: + ","int numPoints(int** darts, int dartsSize, int* dartsColSize, int r){ + +}","public class Solution { + public int NumPoints(int[][] darts, int r) { + + } +}","/** + * @param {number[][]} darts + * @param {number} r + * @return {number} + */ +var numPoints = function(darts, r) { + +};","# @param {Integer[][]} darts +# @param {Integer} r +# @return {Integer} +def num_points(darts, r) + +end","class Solution { + func numPoints(_ darts: [[Int]], _ r: Int) -> Int { + + } +}","func numPoints(darts [][]int, r int) int { + +}","object Solution { + def numPoints(darts: Array[Array[Int]], r: Int): Int = { + + } +}","class Solution { + fun numPoints(darts: Array, r: Int): Int { + + } +}","impl Solution { + pub fn num_points(darts: Vec>, r: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $darts + * @param Integer $r + * @return Integer + */ + function numPoints($darts, $r) { + + } +}","function numPoints(darts: number[][], r: number): number { + +};","(define/contract (num-points darts r) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec num_points(Darts :: [[integer()]], R :: integer()) -> integer(). +num_points(Darts, R) -> + .","defmodule Solution do + @spec num_points(darts :: [[integer]], r :: integer) :: integer + def num_points(darts, r) do + + end +end","class Solution { + int numPoints(List> darts, int r) { + + } +}", +973,cherry-pickup-ii,Cherry Pickup II,1463.0,1559.0,"

You are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from the (i, j) cell.

+ +

You have two robots that can collect cherries for you:

+ +
    +
  • Robot #1 is located at the top-left corner (0, 0), and
    • +
  • Robot #2 is located at the top-right corner (0, cols - 1).
    • +
+ +

Return the maximum number of cherries collection using both robots by following the rules below:

+ +
    +
  • From a cell (i, j), robots can move to cell (i + 1, j - 1), (i + 1, j), or (i + 1, j + 1).
    • +
  • When any robot passes through a cell, It picks up all cherries, and the cell becomes an empty cell.
    • +
  • When both robots stay in the same cell, only one takes the cherries.
    • +
  • Both robots cannot move outside of the grid at any moment.
    • +
  • Both robots should reach the bottom row in grid.
    • +
+ +

 

+

Example 1:

+ +
+Input: grid = [[3,1,1],[2,5,1],[1,5,5],[2,1,1]]
+Output: 24
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (3 + 2 + 5 + 2) = 12.
+Cherries taken by Robot #2, (1 + 5 + 5 + 1) = 12.
+Total of cherries: 12 + 12 = 24.
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]
+Output: 28
+Explanation: Path of robot #1 and #2 are described in color green and blue respectively.
+Cherries taken by Robot #1, (1 + 9 + 5 + 2) = 17.
+Cherries taken by Robot #2, (1 + 3 + 4 + 3) = 11.
+Total of cherries: 17 + 11 = 28.
+
+ +

 

+

Constraints:

+ +
    +
  • rows == grid.length
    • +
  • cols == grid[i].length
    • +
  • 2 <= rows, cols <= 70
    • +
  • 0 <= grid[i][j] <= 100
    • +
+",3.0,False,"class Solution { +public: + int cherryPickup(vector>& grid) { + + } +};","class Solution { + public int cherryPickup(int[][] grid) { + + } +}","class Solution(object): + def cherryPickup(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def cherryPickup(self, grid: List[List[int]]) -> int: + ","int cherryPickup(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int CherryPickup(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var cherryPickup = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def cherry_pickup(grid) + +end","class Solution { + func cherryPickup(_ grid: [[Int]]) -> Int { + + } +}","func cherryPickup(grid [][]int) int { + +}","object Solution { + def cherryPickup(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun cherryPickup(grid: Array): Int { + + } +}","impl Solution { + pub fn cherry_pickup(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function cherryPickup($grid) { + + } +}","function cherryPickup(grid: number[][]): number { + +};","(define/contract (cherry-pickup grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec cherry_pickup(Grid :: [[integer()]]) -> integer(). +cherry_pickup(Grid) -> + .","defmodule Solution do + @spec cherry_pickup(grid :: [[integer]]) :: integer + def cherry_pickup(grid) do + + end +end","class Solution { + int cherryPickup(List> grid) { + + } +}", +974,course-schedule-iv,Course Schedule IV,1462.0,1558.0,"

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course ai first if you want to take course bi.

+ +
    +
  • For example, the pair [0, 1] indicates that you have to take course 0 before you can take course 1.
    • +
+ +

Prerequisites can also be indirect. If course a is a prerequisite of course b, and course b is a prerequisite of course c, then course a is a prerequisite of course c.

+ +

You are also given an array queries where queries[j] = [uj, vj]. For the jth query, you should answer whether course uj is a prerequisite of course vj or not.

+ +

Return a boolean array answer, where answer[j] is the answer to the jth query.

+ +

 

+

Example 1:

+ +
+Input: numCourses = 2, prerequisites = [[1,0]], queries = [[0,1],[1,0]]
+Output: [false,true]
+Explanation: The pair [1, 0] indicates that you have to take course 1 before you can take course 0.
+Course 0 is not a prerequisite of course 1, but the opposite is true.
+
+ +

Example 2:

+ +
+Input: numCourses = 2, prerequisites = [], queries = [[1,0],[0,1]]
+Output: [false,false]
+Explanation: There are no prerequisites, and each course is independent.
+
+ +

Example 3:

+ +
+Input: numCourses = 3, prerequisites = [[1,2],[1,0],[2,0]], queries = [[1,0],[1,2]]
+Output: [true,true]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= numCourses <= 100
    • +
  • 0 <= prerequisites.length <= (numCourses * (numCourses - 1) / 2)
    • +
  • prerequisites[i].length == 2
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • ai != bi
    • +
  • All the pairs [ai, bi] are unique.
    • +
  • The prerequisites graph has no cycles.
    • +
  • 1 <= queries.length <= 104
    • +
  • 0 <= ui, vi <= n - 1
    • +
  • ui != vi
    • +
+",2.0,False,"class Solution { +public: + vector checkIfPrerequisite(int numCourses, vector>& prerequisites, vector>& queries) { + + } +};","class Solution { + public List checkIfPrerequisite(int numCourses, int[][] prerequisites, int[][] queries) { + + } +}","class Solution(object): + def checkIfPrerequisite(self, numCourses, prerequisites, queries): + """""" + :type numCourses: int + :type prerequisites: List[List[int]] + :type queries: List[List[int]] + :rtype: List[bool] + """""" + ","class Solution: + def checkIfPrerequisite(self, numCourses: int, prerequisites: List[List[int]], queries: List[List[int]]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* checkIfPrerequisite(int numCourses, int** prerequisites, int prerequisitesSize, int* prerequisitesColSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public IList CheckIfPrerequisite(int numCourses, int[][] prerequisites, int[][] queries) { + + } +}","/** + * @param {number} numCourses + * @param {number[][]} prerequisites + * @param {number[][]} queries + * @return {boolean[]} + */ +var checkIfPrerequisite = function(numCourses, prerequisites, queries) { + +};","# @param {Integer} num_courses +# @param {Integer[][]} prerequisites +# @param {Integer[][]} queries +# @return {Boolean[]} +def check_if_prerequisite(num_courses, prerequisites, queries) + +end","class Solution { + func checkIfPrerequisite(_ numCourses: Int, _ prerequisites: [[Int]], _ queries: [[Int]]) -> [Bool] { + + } +}","func checkIfPrerequisite(numCourses int, prerequisites [][]int, queries [][]int) []bool { + +}","object Solution { + def checkIfPrerequisite(numCourses: Int, prerequisites: Array[Array[Int]], queries: Array[Array[Int]]): List[Boolean] = { + + } +}","class Solution { + fun checkIfPrerequisite(numCourses: Int, prerequisites: Array, queries: Array): List { + + } +}","impl Solution { + pub fn check_if_prerequisite(num_courses: i32, prerequisites: Vec>, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $numCourses + * @param Integer[][] $prerequisites + * @param Integer[][] $queries + * @return Boolean[] + */ + function checkIfPrerequisite($numCourses, $prerequisites, $queries) { + + } +}","function checkIfPrerequisite(numCourses: number, prerequisites: number[][], queries: number[][]): boolean[] { + +};","(define/contract (check-if-prerequisite numCourses prerequisites queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof boolean?)) + + )","-spec check_if_prerequisite(NumCourses :: integer(), Prerequisites :: [[integer()]], Queries :: [[integer()]]) -> [boolean()]. +check_if_prerequisite(NumCourses, Prerequisites, Queries) -> + .","defmodule Solution do + @spec check_if_prerequisite(num_courses :: integer, prerequisites :: [[integer]], queries :: [[integer]]) :: [boolean] + def check_if_prerequisite(num_courses, prerequisites, queries) do + + end +end","class Solution { + List checkIfPrerequisite(int numCourses, List> prerequisites, List> queries) { + + } +}", +977,number-of-ways-of-cutting-a-pizza,Number of Ways of Cutting a Pizza,1444.0,1555.0,"

Given a rectangular pizza represented as a rows x cols matrix containing the following characters: 'A' (an apple) and '.' (empty cell) and given the integer k. You have to cut the pizza into k pieces using k-1 cuts. 

+ +

For each cut you choose the direction: vertical or horizontal, then you choose a cut position at the cell boundary and cut the pizza into two pieces. If you cut the pizza vertically, give the left part of the pizza to a person. If you cut the pizza horizontally, give the upper part of the pizza to a person. Give the last piece of pizza to the last person.

+ +

Return the number of ways of cutting the pizza such that each piece contains at least one apple. Since the answer can be a huge number, return this modulo 10^9 + 7.

+ +

 

+

Example 1:

+ +

+ +
+Input: pizza = ["A..","AAA","..."], k = 3
+Output: 3 
+Explanation: The figure above shows the three ways to cut the pizza. Note that pieces must contain at least one apple.
+
+ +

Example 2:

+ +
+Input: pizza = ["A..","AA.","..."], k = 3
+Output: 1
+
+ +

Example 3:

+ +
+Input: pizza = ["A..","A..","..."], k = 1
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rows, cols <= 50
    • +
  • rows == pizza.length
    • +
  • cols == pizza[i].length
    • +
  • 1 <= k <= 10
    • +
  • pizza consists of characters 'A' and '.' only.
    • +
+",3.0,False,"class Solution { +public: + int ways(vector& pizza, int k) { + + } +};","class Solution { + public int ways(String[] pizza, int k) { + + } +}","class Solution(object): + def ways(self, pizza, k): + """""" + :type pizza: List[str] + :type k: int + :rtype: int + """""" + ","class Solution: + def ways(self, pizza: List[str], k: int) -> int: + "," + +int ways(char ** pizza, int pizzaSize, int k){ + +}","public class Solution { + public int Ways(string[] pizza, int k) { + + } +}","/** + * @param {string[]} pizza + * @param {number} k + * @return {number} + */ +var ways = function(pizza, k) { + +};","# @param {String[]} pizza +# @param {Integer} k +# @return {Integer} +def ways(pizza, k) + +end","class Solution { + func ways(_ pizza: [String], _ k: Int) -> Int { + + } +}","func ways(pizza []string, k int) int { + +}","object Solution { + def ways(pizza: Array[String], k: Int): Int = { + + } +}","class Solution { + fun ways(pizza: Array, k: Int): Int { + + } +}","impl Solution { + pub fn ways(pizza: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $pizza + * @param Integer $k + * @return Integer + */ + function ways($pizza, $k) { + + } +}","function ways(pizza: string[], k: number): number { + +};",,,,, +980,build-an-array-with-stack-operations,Build an Array With Stack Operations,1441.0,1552.0,"

You are given an integer array target and an integer n.

+ +

You have an empty stack with the two following operations:

+ +
    +
  • "Push": pushes an integer to the top of the stack.
    • +
  • "Pop": removes the integer on the top of the stack.
    • +
+ +

You also have a stream of the integers in the range [1, n].

+ +

Use the two stack operations to make the numbers in the stack (from the bottom to the top) equal to target. You should follow the following rules:

+ +
    +
  • If the stream of the integers is not empty, pick the next integer from the stream and push it to the top of the stack.
    • +
  • If the stack is not empty, pop the integer at the top of the stack.
    • +
  • If, at any moment, the elements in the stack (from the bottom to the top) are equal to target, do not read new integers from the stream and do not do more operations on the stack.
    • +
+ +

Return the stack operations needed to build target following the mentioned rules. If there are multiple valid answers, return any of them.

+ +

 

+

Example 1:

+ +
+Input: target = [1,3], n = 3
+Output: ["Push","Push","Pop","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Pop the integer on the top of the stack. s = [1].
+Read 3 from the stream and push it to the stack. s = [1,3].
+
+ +

Example 2:

+ +
+Input: target = [1,2,3], n = 3
+Output: ["Push","Push","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Read 3 from the stream and push it to the stack. s = [1,2,3].
+
+ +

Example 3:

+ +
+Input: target = [1,2], n = 4
+Output: ["Push","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Since the stack (from the bottom to the top) is equal to target, we stop the stack operations.
+The answers that read integer 3 from the stream are not accepted.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target.length <= 100
    • +
  • 1 <= n <= 100
    • +
  • 1 <= target[i] <= n
    • +
  • target is strictly increasing.
    • +
+",2.0,False,"class Solution { +public: + vector buildArray(vector& target, int n) { + + } +};","class Solution { + public List buildArray(int[] target, int n) { + + } +}","class Solution(object): + def buildArray(self, target, n): + """""" + :type target: List[int] + :type n: int + :rtype: List[str] + """""" + ","class Solution: + def buildArray(self, target: List[int], n: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** buildArray(int* target, int targetSize, int n, int* returnSize){ + +}","public class Solution { + public IList BuildArray(int[] target, int n) { + + } +}","/** + * @param {number[]} target + * @param {number} n + * @return {string[]} + */ +var buildArray = function(target, n) { + +};","# @param {Integer[]} target +# @param {Integer} n +# @return {String[]} +def build_array(target, n) + +end","class Solution { + func buildArray(_ target: [Int], _ n: Int) -> [String] { + + } +}","func buildArray(target []int, n int) []string { + +}","object Solution { + def buildArray(target: Array[Int], n: Int): List[String] = { + + } +}","class Solution { + fun buildArray(target: IntArray, n: Int): List { + + } +}","impl Solution { + pub fn build_array(target: Vec, n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $target + * @param Integer $n + * @return String[] + */ + function buildArray($target, $n) { + + } +}","function buildArray(target: number[], n: number): string[] { + +};","(define/contract (build-array target n) + (-> (listof exact-integer?) exact-integer? (listof string?)) + + )","-spec build_array(Target :: [integer()], N :: integer()) -> [unicode:unicode_binary()]. +build_array(Target, N) -> + .","defmodule Solution do + @spec build_array(target :: [integer], n :: integer) :: [String.t] + def build_array(target, n) do + + end +end","class Solution { + List buildArray(List target, int n) { + + } +}", +981,find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows,Find the Kth Smallest Sum of a Matrix With Sorted Rows,1439.0,1550.0,"

You are given an m x n matrix mat that has its rows sorted in non-decreasing order and an integer k.

+ +

You are allowed to choose exactly one element from each row to form an array.

+ +

Return the kth smallest array sum among all possible arrays.

+ +

 

+

Example 1:

+ +
+Input: mat = [[1,3,11],[2,4,6]], k = 5
+Output: 7
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,2], [1,4], [3,2], [3,4], [1,6]. Where the 5th sum is 7.
+
+ +

Example 2:

+ +
+Input: mat = [[1,3,11],[2,4,6]], k = 9
+Output: 17
+
+ +

Example 3:

+ +
+Input: mat = [[1,10,10],[1,4,5],[2,3,6]], k = 7
+Output: 9
+Explanation: Choosing one element from each row, the first k smallest sum are:
+[1,1,2], [1,1,3], [1,4,2], [1,4,3], [1,1,6], [1,5,2], [1,5,3]. Where the 7th sum is 9.  
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length
    • +
  • n == mat.length[i]
    • +
  • 1 <= m, n <= 40
    • +
  • 1 <= mat[i][j] <= 5000
    • +
  • 1 <= k <= min(200, nm)
    • +
  • mat[i] is a non-decreasing array.
    • +
+",3.0,False,"class Solution { +public: + int kthSmallest(vector>& mat, int k) { + + } +};","class Solution { + public int kthSmallest(int[][] mat, int k) { + + } +}","class Solution(object): + def kthSmallest(self, mat, k): + """""" + :type mat: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def kthSmallest(self, mat: List[List[int]], k: int) -> int: + ","int kthSmallest(int** mat, int matSize, int* matColSize, int k){ + +}","public class Solution { + public int KthSmallest(int[][] mat, int k) { + + } +}","/** + * @param {number[][]} mat + * @param {number} k + * @return {number} + */ +var kthSmallest = function(mat, k) { + +};","# @param {Integer[][]} mat +# @param {Integer} k +# @return {Integer} +def kth_smallest(mat, k) + +end","class Solution { + func kthSmallest(_ mat: [[Int]], _ k: Int) -> Int { + + } +}","func kthSmallest(mat [][]int, k int) int { + +}","object Solution { + def kthSmallest(mat: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun kthSmallest(mat: Array, k: Int): Int { + + } +}","impl Solution { + pub fn kth_smallest(mat: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @param Integer $k + * @return Integer + */ + function kthSmallest($mat, $k) { + + } +}","function kthSmallest(mat: number[][], k: number): number { + +};","(define/contract (kth-smallest mat k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec kth_smallest(Mat :: [[integer()]], K :: integer()) -> integer(). +kth_smallest(Mat, K) -> + .","defmodule Solution do + @spec kth_smallest(mat :: [[integer]], k :: integer) :: integer + def kth_smallest(mat, k) do + + end +end","class Solution { + int kthSmallest(List> mat, int k) { + + } +}", +985,form-largest-integer-with-digits-that-add-up-to-target,Form Largest Integer With Digits That Add up to Target,1449.0,1545.0,"

Given an array of integers cost and an integer target, return the maximum integer you can paint under the following rules:

+ +
    +
  • The cost of painting a digit (i + 1) is given by cost[i] (0-indexed).
    • +
  • The total cost used must be equal to target.
    • +
  • The integer does not have 0 digits.
    • +
+ +

Since the answer may be very large, return it as a string. If there is no way to paint any integer given the condition, return "0".

+ +

 

+

Example 1:

+ +
+Input: cost = [4,3,2,5,6,7,2,5,5], target = 9
+Output: "7772"
+Explanation: The cost to paint the digit '7' is 2, and the digit '2' is 3. Then cost("7772") = 2*3+ 3*1 = 9. You could also paint "977", but "7772" is the largest number.
+Digit    cost
+  1  ->   4
+  2  ->   3
+  3  ->   2
+  4  ->   5
+  5  ->   6
+  6  ->   7
+  7  ->   2
+  8  ->   5
+  9  ->   5
+
+ +

Example 2:

+ +
+Input: cost = [7,6,5,5,5,6,8,7,8], target = 12
+Output: "85"
+Explanation: The cost to paint the digit '8' is 7, and the digit '5' is 5. Then cost("85") = 7 + 5 = 12.
+
+ +

Example 3:

+ +
+Input: cost = [2,4,6,2,4,6,4,4,4], target = 5
+Output: "0"
+Explanation: It is impossible to paint any integer with total cost equal to target.
+
+ +

 

+

Constraints:

+ +
    +
  • cost.length == 9
    • +
  • 1 <= cost[i], target <= 5000
    • +
+",3.0,False,"class Solution { +public: + string largestNumber(vector& cost, int target) { + + } +};","class Solution { + public String largestNumber(int[] cost, int target) { + + } +}","class Solution(object): + def largestNumber(self, cost, target): + """""" + :type cost: List[int] + :type target: int + :rtype: str + """""" + ","class Solution: + def largestNumber(self, cost: List[int], target: int) -> str: + ","char * largestNumber(int* cost, int costSize, int target){ + +}","public class Solution { + public string LargestNumber(int[] cost, int target) { + + } +}","/** + * @param {number[]} cost + * @param {number} target + * @return {string} + */ +var largestNumber = function(cost, target) { + +};","# @param {Integer[]} cost +# @param {Integer} target +# @return {String} +def largest_number(cost, target) + +end","class Solution { + func largestNumber(_ cost: [Int], _ target: Int) -> String { + + } +}","func largestNumber(cost []int, target int) string { + +}","object Solution { + def largestNumber(cost: Array[Int], target: Int): String = { + + } +}","class Solution { + fun largestNumber(cost: IntArray, target: Int): String { + + } +}","impl Solution { + pub fn largest_number(cost: Vec, target: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $cost + * @param Integer $target + * @return String + */ + function largestNumber($cost, $target) { + + } +}","function largestNumber(cost: number[], target: number): string { + +};","(define/contract (largest-number cost target) + (-> (listof exact-integer?) exact-integer? string?) + + )","-spec largest_number(Cost :: [integer()], Target :: integer()) -> unicode:unicode_binary(). +largest_number(Cost, Target) -> + .","defmodule Solution do + @spec largest_number(cost :: [integer], target :: integer) :: String.t + def largest_number(cost, target) do + + end +end","class Solution { + String largestNumber(List cost, int target) { + + } +}", +986,count-good-nodes-in-binary-tree,Count Good Nodes in Binary Tree,1448.0,1544.0,"

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.

+ +

Return the number of good nodes in the binary tree.

+ +

 

+

Example 1:

+ +

+ +
+Input: root = [3,1,4,3,null,1,5]
+Output: 4
+Explanation: Nodes in blue are good.
+Root Node (3) is always a good node.
+Node 4 -> (3,4) is the maximum value in the path starting from the root.
+Node 5 -> (3,4,5) is the maximum value in the path
+Node 3 -> (3,1,3) is the maximum value in the path.
+ +

Example 2:

+ +

+ +
+Input: root = [3,3,null,4,2]
+Output: 3
+Explanation: Node 2 -> (3, 3, 2) is not good, because "3" is higher than it.
+ +

Example 3:

+ +
+Input: root = [1]
+Output: 1
+Explanation: Root is considered as good.
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the binary tree is in the range [1, 10^5].
    • +
  • Each node's value is between [-10^4, 10^4].
    • +
",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int goodNodes(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int goodNodes(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def goodNodes(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def goodNodes(self, root: TreeNode) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ + + +int goodNodes(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int GoodNodes(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var goodNodes = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def good_nodes(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func goodNodes(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func goodNodes(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def goodNodes(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun goodNodes(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn good_nodes(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function goodNodes($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function goodNodes(root: TreeNode | null): number { + +};",,,,, +987,simplified-fractions,Simplified Fractions,1447.0,1543.0,"

Given an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. You can return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: ["1/2"]
+Explanation: "1/2" is the only unique fraction with a denominator less-than-or-equal-to 2.
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: ["1/2","1/3","2/3"]
+
+ +

Example 3:

+ +
+Input: n = 4
+Output: ["1/2","1/3","1/4","2/3","3/4"]
+Explanation: "2/4" is not a simplified fraction because it can be simplified to "1/2".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
+",2.0,False,"class Solution { +public: + vector simplifiedFractions(int n) { + + } +};","class Solution { + public List simplifiedFractions(int n) { + + } +}","class Solution(object): + def simplifiedFractions(self, n): + """""" + :type n: int + :rtype: List[str] + """""" + ","class Solution: + def simplifiedFractions(self, n: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** simplifiedFractions(int n, int* returnSize){ + +}","public class Solution { + public IList SimplifiedFractions(int n) { + + } +}","/** + * @param {number} n + * @return {string[]} + */ +var simplifiedFractions = function(n) { + +};","# @param {Integer} n +# @return {String[]} +def simplified_fractions(n) + +end","class Solution { + func simplifiedFractions(_ n: Int) -> [String] { + + } +}","func simplifiedFractions(n int) []string { + +}","object Solution { + def simplifiedFractions(n: Int): List[String] = { + + } +}","class Solution { + fun simplifiedFractions(n: Int): List { + + } +}","impl Solution { + pub fn simplified_fractions(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return String[] + */ + function simplifiedFractions($n) { + + } +}","function simplifiedFractions(n: number): string[] { + +};",,"-spec simplified_fractions(N :: integer()) -> [unicode:unicode_binary()]. +simplified_fractions(N) -> + .","defmodule Solution do + @spec simplified_fractions(n :: integer) :: [String.t] + def simplified_fractions(n) do + + end +end","class Solution { + List simplifiedFractions(int n) { + + } +}", +989,diagonal-traverse-ii,Diagonal Traverse II,1424.0,1539.0,"

Given a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images.

+ +

 

+

Example 1:

+ +
+Input: nums = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [1,4,2,7,5,3,8,6,9]
+
+ +

Example 2:

+ +
+Input: nums = [[1,2,3,4,5],[6,7],[8],[9,10,11],[12,13,14,15,16]]
+Output: [1,6,2,8,7,3,9,4,12,10,5,13,11,14,15,16]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i].length <= 105
    • +
  • 1 <= sum(nums[i].length) <= 105
    • +
  • 1 <= nums[i][j] <= 105
    • +
+",2.0,False,"class Solution { +public: + vector findDiagonalOrder(vector>& nums) { + + } +};","class Solution { + public int[] findDiagonalOrder(List> nums) { + + } +}","class Solution(object): + def findDiagonalOrder(self, nums): + """""" + :type nums: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findDiagonalOrder(self, nums: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findDiagonalOrder(int** nums, int numsSize, int* numsColSize, int* returnSize){ + +}","public class Solution { + public int[] FindDiagonalOrder(IList> nums) { + + } +}","/** + * @param {number[][]} nums + * @return {number[]} + */ +var findDiagonalOrder = function(nums) { + +};","# @param {Integer[][]} nums +# @return {Integer[]} +def find_diagonal_order(nums) + +end","class Solution { + func findDiagonalOrder(_ nums: [[Int]]) -> [Int] { + + } +}","func findDiagonalOrder(nums [][]int) []int { + +}","object Solution { + def findDiagonalOrder(nums: List[List[Int]]): Array[Int] = { + + } +}","class Solution { + fun findDiagonalOrder(nums: List>): IntArray { + + } +}","impl Solution { + pub fn find_diagonal_order(nums: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $nums + * @return Integer[] + */ + function findDiagonalOrder($nums) { + + } +}","function findDiagonalOrder(nums: number[][]): number[] { + +};","(define/contract (find-diagonal-order nums) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_diagonal_order(Nums :: [[integer()]]) -> [integer()]. +find_diagonal_order(Nums) -> + .","defmodule Solution do + @spec find_diagonal_order(nums :: [[integer]]) :: [integer] + def find_diagonal_order(nums) do + + end +end","class Solution { + List findDiagonalOrder(List> nums) { + + } +}", +990,maximum-points-you-can-obtain-from-cards,Maximum Points You Can Obtain from Cards,1423.0,1538.0,"

There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints.

+ +

In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards.

+ +

Your score is the sum of the points of the cards you have taken.

+ +

Given the integer array cardPoints and the integer k, return the maximum score you can obtain.

+ +

 

+

Example 1:

+ +
+Input: cardPoints = [1,2,3,4,5,6,1], k = 3
+Output: 12
+Explanation: After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.
+
+ +

Example 2:

+ +
+Input: cardPoints = [2,2,2], k = 2
+Output: 4
+Explanation: Regardless of which two cards you take, your score will always be 4.
+
+ +

Example 3:

+ +
+Input: cardPoints = [9,7,7,9,7,7,9], k = 7
+Output: 55
+Explanation: You have to take all the cards. Your score is the sum of points of all cards.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= cardPoints.length <= 105
    • +
  • 1 <= cardPoints[i] <= 104
    • +
  • 1 <= k <= cardPoints.length
    • +
+",2.0,False,"class Solution { +public: + int maxScore(vector& cardPoints, int k) { + + } +};","class Solution { + public int maxScore(int[] cardPoints, int k) { + + } +}","class Solution(object): + def maxScore(self, cardPoints, k): + """""" + :type cardPoints: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxScore(self, cardPoints: List[int], k: int) -> int: + ","int maxScore(int* cardPoints, int cardPointsSize, int k){ + +}","public class Solution { + public int MaxScore(int[] cardPoints, int k) { + + } +}","/** + * @param {number[]} cardPoints + * @param {number} k + * @return {number} + */ +var maxScore = function(cardPoints, k) { + +};","# @param {Integer[]} card_points +# @param {Integer} k +# @return {Integer} +def max_score(card_points, k) + +end","class Solution { + func maxScore(_ cardPoints: [Int], _ k: Int) -> Int { + + } +}","func maxScore(cardPoints []int, k int) int { + +}","object Solution { + def maxScore(cardPoints: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maxScore(cardPoints: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn max_score(card_points: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $cardPoints + * @param Integer $k + * @return Integer + */ + function maxScore($cardPoints, $k) { + + } +}","function maxScore(cardPoints: number[], k: number): number { + +};","(define/contract (max-score cardPoints k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )",,,"class Solution { + int maxScore(List cardPoints, int k) { + + } +}", +991,maximum-score-after-splitting-a-string,Maximum Score After Splitting a String,1422.0,1537.0,"

Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring).

+ +

The score after splitting a string is the number of zeros in the left substring plus the number of ones in the right substring.

+ +

 

+

Example 1:

+ +
+Input: s = "011101"
+Output: 5 
+Explanation: 
+All possible ways of splitting s into two non-empty substrings are:
+left = "0" and right = "11101", score = 1 + 4 = 5 
+left = "01" and right = "1101", score = 1 + 3 = 4 
+left = "011" and right = "101", score = 1 + 2 = 3 
+left = "0111" and right = "01", score = 1 + 1 = 2 
+left = "01110" and right = "1", score = 2 + 1 = 3
+
+ +

Example 2:

+ +
+Input: s = "00111"
+Output: 5
+Explanation: When left = "00" and right = "111", we get the maximum score = 2 + 3 = 5
+
+ +

Example 3:

+ +
+Input: s = "1111"
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 500
    • +
  • The string s consists of characters '0' and '1' only.
    • +
+",1.0,False,"class Solution { +public: + int maxScore(string s) { + + } +};","class Solution { + public int maxScore(String s) { + + } +}","class Solution(object): + def maxScore(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def maxScore(self, s: str) -> int: + ","int maxScore(char * s){ + +}","public class Solution { + public int MaxScore(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var maxScore = function(s) { + +};","# @param {String} s +# @return {Integer} +def max_score(s) + +end","class Solution { + func maxScore(_ s: String) -> Int { + + } +}","func maxScore(s string) int { + +}","object Solution { + def maxScore(s: String): Int = { + + } +}","class Solution { + fun maxScore(s: String): Int { + + } +}","impl Solution { + pub fn max_score(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function maxScore($s) { + + } +}","function maxScore(s: string): number { + +};","(define/contract (max-score s) + (-> string? exact-integer?) + + )","-spec max_score(S :: unicode:unicode_binary()) -> integer(). +max_score(S) -> + .","defmodule Solution do + @spec max_score(s :: String.t) :: integer + def max_score(s) do + + end +end","class Solution { + int maxScore(String s) { + + } +}", +992,build-array-where-you-can-find-the-maximum-exactly-k-comparisons,Build Array Where You Can Find The Maximum Exactly K Comparisons,1420.0,1535.0,"

You are given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers:

+ +

You should build the array arr which has the following properties:

+ +
    +
  • arr has exactly n integers.
    • +
  • 1 <= arr[i] <= m where (0 <= i < n).
    • +
  • After applying the mentioned algorithm to arr, the value search_cost is equal to k.
    • +
+ +

Return the number of ways to build the array arr under the mentioned conditions. As the answer may grow large, the answer must be computed modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2, m = 3, k = 1
+Output: 6
+Explanation: The possible arrays are [1, 1], [2, 1], [2, 2], [3, 1], [3, 2] [3, 3]
+
+ +

Example 2:

+ +
+Input: n = 5, m = 2, k = 3
+Output: 0
+Explanation: There are no possible arrays that satisify the mentioned conditions.
+
+ +

Example 3:

+ +
+Input: n = 9, m = 1, k = 1
+Output: 1
+Explanation: The only possible array is [1, 1, 1, 1, 1, 1, 1, 1, 1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 50
    • +
  • 1 <= m <= 100
    • +
  • 0 <= k <= n
    • +
+",3.0,False,"class Solution { +public: + int numOfArrays(int n, int m, int k) { + + } +};","class Solution { + public int numOfArrays(int n, int m, int k) { + + } +}","class Solution(object): + def numOfArrays(self, n, m, k): + """""" + :type n: int + :type m: int + :type k: int + :rtype: int + """""" + ","class Solution: + def numOfArrays(self, n: int, m: int, k: int) -> int: + ","int numOfArrays(int n, int m, int k){ + +}","public class Solution { + public int NumOfArrays(int n, int m, int k) { + + } +}","/** + * @param {number} n + * @param {number} m + * @param {number} k + * @return {number} + */ +var numOfArrays = function(n, m, k) { + +};","# @param {Integer} n +# @param {Integer} m +# @param {Integer} k +# @return {Integer} +def num_of_arrays(n, m, k) + +end","class Solution { + func numOfArrays(_ n: Int, _ m: Int, _ k: Int) -> Int { + + } +}","func numOfArrays(n int, m int, k int) int { + +}","object Solution { + def numOfArrays(n: Int, m: Int, k: Int): Int = { + + } +}","class Solution { + fun numOfArrays(n: Int, m: Int, k: Int): Int { + + } +}","impl Solution { + pub fn num_of_arrays(n: i32, m: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $m + * @param Integer $k + * @return Integer + */ + function numOfArrays($n, $m, $k) { + + } +}","function numOfArrays(n: number, m: number, k: number): number { + +};",,,,"class Solution { + int numOfArrays(int n, int m, int k) { + + } +}", +994,display-table-of-food-orders-in-a-restaurant,Display Table of Food Orders in a Restaurant,1418.0,1533.0,"

Given the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i]=[customerNamei,tableNumberi,foodItemi] where customerNamei is the name of the customer, tableNumberi is the table customer sit at, and foodItemi is the item customer orders.

+ +

Return the restaurant's “display table”. The “display table” is a table whose row entries denote how many of each food item each table ordered. The first column is the table number and the remaining columns correspond to each food item in alphabetical order. The first row should be a header whose first column is “Table”, followed by the names of the food items. Note that the customer names are not part of the table. Additionally, the rows should be sorted in numerically increasing order.

+ +

 

+

Example 1:

+ +
+Input: orders = [["David","3","Ceviche"],["Corina","10","Beef Burrito"],["David","3","Fried Chicken"],["Carla","5","Water"],["Carla","5","Ceviche"],["Rous","3","Ceviche"]]
+Output: [["Table","Beef Burrito","Ceviche","Fried Chicken","Water"],["3","0","2","1","0"],["5","0","1","0","1"],["10","1","0","0","0"]] 
+Explanation:
+The displaying table looks like:
+Table,Beef Burrito,Ceviche,Fried Chicken,Water
+3    ,0           ,2      ,1            ,0
+5    ,0           ,1      ,0            ,1
+10   ,1           ,0      ,0            ,0
+For the table 3: David orders "Ceviche" and "Fried Chicken", and Rous orders "Ceviche".
+For the table 5: Carla orders "Water" and "Ceviche".
+For the table 10: Corina orders "Beef Burrito". 
+
+ +

Example 2:

+ +
+Input: orders = [["James","12","Fried Chicken"],["Ratesh","12","Fried Chicken"],["Amadeus","12","Fried Chicken"],["Adam","1","Canadian Waffles"],["Brianna","1","Canadian Waffles"]]
+Output: [["Table","Canadian Waffles","Fried Chicken"],["1","2","0"],["12","0","3"]] 
+Explanation: 
+For the table 1: Adam and Brianna order "Canadian Waffles".
+For the table 12: James, Ratesh and Amadeus order "Fried Chicken".
+
+ +

Example 3:

+ +
+Input: orders = [["Laura","2","Bean Burrito"],["Jhon","2","Beef Burrito"],["Melissa","2","Soda"]]
+Output: [["Table","Bean Burrito","Beef Burrito","Soda"],["2","1","1","1"]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= orders.length <= 5 * 10^4
    • +
  • orders[i].length == 3
    • +
  • 1 <= customerNamei.length, foodItemi.length <= 20
    • +
  • customerNamei and foodItemi consist of lowercase and uppercase English letters and the space character.
    • +
  • tableNumberi is a valid integer between 1 and 500.
    • +
",2.0,False,"class Solution { +public: + vector> displayTable(vector>& orders) { + + } +};","class Solution { + public List> displayTable(List> orders) { + + } +}","class Solution(object): + def displayTable(self, orders): + """""" + :type orders: List[List[str]] + :rtype: List[List[str]] + """"""","class Solution: + def displayTable(self, orders: List[List[str]]) -> List[List[str]]:","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** displayTable(char *** orders, int ordersSize, int* ordersColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> DisplayTable(IList> orders) { + + } +}","/** + * @param {string[][]} orders + * @return {string[][]} + */ +var displayTable = function(orders) { + +};","# @param {String[][]} orders +# @return {String[][]} +def display_table(orders) + +end","class Solution { + func displayTable(_ orders: [[String]]) -> [[String]] { + + } +}","func displayTable(orders [][]string) [][]string { + +}","object Solution { + def displayTable(orders: List[List[String]]): List[List[String]] = { + + } +}","class Solution { + fun displayTable(orders: List>): List> { + + } +}","impl Solution { + pub fn display_table(orders: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param String[][] $orders + * @return String[][] + */ + function displayTable($orders) { + + } +}","function displayTable(orders: string[][]): string[][] { + +};",,,,, +996,number-of-ways-to-wear-different-hats-to-each-other,Number of Ways to Wear Different Hats to Each Other,1434.0,1531.0,"

There are n people and 40 types of hats labeled from 1 to 40.

+ +

Given a 2D integer array hats, where hats[i] is a list of all hats preferred by the ith person.

+ +

Return the number of ways that the n people wear different hats to each other.

+ +

Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: hats = [[3,4],[4,5],[5]]
+Output: 1
+Explanation: There is only one way to choose hats given the conditions. 
+First person choose hat 3, Second person choose hat 4 and last one hat 5.
+
+ +

Example 2:

+ +
+Input: hats = [[3,5,1],[3,5]]
+Output: 4
+Explanation: There are 4 ways to choose hats:
+(3,5), (5,3), (1,3) and (1,5)
+
+ +

Example 3:

+ +
+Input: hats = [[1,2,3,4],[1,2,3,4],[1,2,3,4],[1,2,3,4]]
+Output: 24
+Explanation: Each person can choose hats labeled from 1 to 4.
+Number of Permutations of (1,2,3,4) = 24.
+
+ +

 

+

Constraints:

+ +
    +
  • n == hats.length
    • +
  • 1 <= n <= 10
    • +
  • 1 <= hats[i].length <= 40
    • +
  • 1 <= hats[i][j] <= 40
    • +
  • hats[i] contains a list of unique integers.
    • +
+",3.0,False,"class Solution { +public: + int numberWays(vector>& hats) { + + } +};","class Solution { + public int numberWays(List> hats) { + + } +}","class Solution(object): + def numberWays(self, hats): + """""" + :type hats: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numberWays(self, hats: List[List[int]]) -> int: + ","int numberWays(int** hats, int hatsSize, int* hatsColSize){ + +}","public class Solution { + public int NumberWays(IList> hats) { + + } +}","/** + * @param {number[][]} hats + * @return {number} + */ +var numberWays = function(hats) { + +};","# @param {Integer[][]} hats +# @return {Integer} +def number_ways(hats) + +end","class Solution { + func numberWays(_ hats: [[Int]]) -> Int { + + } +}","func numberWays(hats [][]int) int { + +}","object Solution { + def numberWays(hats: List[List[Int]]): Int = { + + } +}","class Solution { + fun numberWays(hats: List>): Int { + + } +}","impl Solution { + pub fn number_ways(hats: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $hats + * @return Integer + */ + function numberWays($hats) { + + } +}","function numberWays(hats: number[][]): number { + +};",,,,"class Solution { + int numberWays(List> hats) { + + } +}", +999,kids-with-the-greatest-number-of-candies,Kids With the Greatest Number of Candies,1431.0,1528.0,"

There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.

+ +

Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies among all the kids, or false otherwise.

+ +

Note that multiple kids can have the greatest number of candies.

+ +

 

+

Example 1:

+ +
+Input: candies = [2,3,5,1,3], extraCandies = 3
+Output: [true,true,true,false,true] 
+Explanation: If you give all extraCandies to:
+- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the kids.
+- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
+- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the kids.
+- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among the kids.
+- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
+
+ +

Example 2:

+ +
+Input: candies = [4,2,1,1,2], extraCandies = 1
+Output: [true,false,false,false,false] 
+Explanation: There is only 1 extra candy.
+Kid 1 will always have the greatest number of candies, even if a different kid is given the extra candy.
+
+ +

Example 3:

+ +
+Input: candies = [12,1,12], extraCandies = 10
+Output: [true,false,true]
+
+ +

 

+

Constraints:

+ +
    +
  • n == candies.length
    • +
  • 2 <= n <= 100
    • +
  • 1 <= candies[i] <= 100
    • +
  • 1 <= extraCandies <= 50
    • +
+",1.0,False,"class Solution { +public: + vector kidsWithCandies(vector& candies, int extraCandies) { + + } +};","class Solution { + public List kidsWithCandies(int[] candies, int extraCandies) { + + } +}","class Solution(object): + def kidsWithCandies(self, candies, extraCandies): + """""" + :type candies: List[int] + :type extraCandies: int + :rtype: List[bool] + """""" + ","class Solution: + def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* kidsWithCandies(int* candies, int candiesSize, int extraCandies, int* returnSize){ + +}","public class Solution { + public IList KidsWithCandies(int[] candies, int extraCandies) { + + } +}","/** + * @param {number[]} candies + * @param {number} extraCandies + * @return {boolean[]} + */ +var kidsWithCandies = function(candies, extraCandies) { + +};","# @param {Integer[]} candies +# @param {Integer} extra_candies +# @return {Boolean[]} +def kids_with_candies(candies, extra_candies) + +end","class Solution { + func kidsWithCandies(_ candies: [Int], _ extraCandies: Int) -> [Bool] { + + } +}","func kidsWithCandies(candies []int, extraCandies int) []bool { + +}","object Solution { + def kidsWithCandies(candies: Array[Int], extraCandies: Int): List[Boolean] = { + + } +}","class Solution { + fun kidsWithCandies(candies: IntArray, extraCandies: Int): List { + + } +}","impl Solution { + pub fn kids_with_candies(candies: Vec, extra_candies: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $candies + * @param Integer $extraCandies + * @return Boolean[] + */ + function kidsWithCandies($candies, $extraCandies) { + + } +}","function kidsWithCandies(candies: number[], extraCandies: number): boolean[] { + +};","(define/contract (kids-with-candies candies extraCandies) + (-> (listof exact-integer?) exact-integer? (listof boolean?)) + + )","-spec kids_with_candies(Candies :: [integer()], ExtraCandies :: integer()) -> [boolean()]. +kids_with_candies(Candies, ExtraCandies) -> + .","defmodule Solution do + @spec kids_with_candies(candies :: [integer], extra_candies :: integer) :: [boolean] + def kids_with_candies(candies, extra_candies) do + + end +end","class Solution { + List kidsWithCandies(List candies, int extraCandies) { + + } +}", +1000,number-of-ways-to-paint-n-3-grid,Number of Ways to Paint N × 3 Grid,1411.0,1527.0,"

You have a grid of size n x 3 and you want to paint each cell of the grid with exactly one of the three colors: Red, Yellow, or Green while making sure that no two adjacent cells have the same color (i.e., no two cells that share vertical or horizontal sides have the same color).

+ +

Given n the number of rows of the grid, return the number of ways you can paint this grid. As the answer may grow large, the answer must be computed modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 12
+Explanation: There are 12 possible way to paint the grid as shown.
+
+ +

Example 2:

+ +
+Input: n = 5000
+Output: 30228214
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • 1 <= n <= 5000
    • +
+",3.0,False,"class Solution { +public: + int numOfWays(int n) { + + } +};","class Solution { + public int numOfWays(int n) { + + } +}","class Solution(object): + def numOfWays(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numOfWays(self, n: int) -> int: + ","int numOfWays(int n){ + +}","public class Solution { + public int NumOfWays(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numOfWays = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def num_of_ways(n) + +end","class Solution { + func numOfWays(_ n: Int) -> Int { + + } +}","func numOfWays(n int) int { + +}","object Solution { + def numOfWays(n: Int): Int = { + + } +}","class Solution { + fun numOfWays(n: Int): Int { + + } +}","impl Solution { + pub fn num_of_ways(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numOfWays($n) { + + } +}","function numOfWays(n: number): number { + +};","(define/contract (num-of-ways n) + (-> exact-integer? exact-integer?) + + )","-spec num_of_ways(N :: integer()) -> integer(). +num_of_ways(N) -> + .","defmodule Solution do + @spec num_of_ways(n :: integer) :: integer + def num_of_ways(n) do + + end +end","class Solution { + int numOfWays(int n) { + + } +}", +1002,queries-on-a-permutation-with-key,Queries on a Permutation With Key,1409.0,1525.0,"

Given the array queries of positive integers between 1 and m, you have to process all queries[i] (from i=0 to i=queries.length-1) according to the following rules:

+ +
    +
  • In the beginning, you have the permutation P=[1,2,3,...,m].
    • +
  • For the current i, find the position of queries[i] in the permutation P (indexing from 0) and then move this at the beginning of the permutation P. Notice that the position of queries[i] in P is the result for queries[i].
    • +
+ +

Return an array containing the result for the given queries.

+ +

 

+

Example 1:

+ +
+Input: queries = [3,1,2,1], m = 5
+Output: [2,1,2,1] 
+Explanation: The queries are processed as follow: 
+For i=0: queries[i]=3, P=[1,2,3,4,5], position of 3 in P is 2, then we move 3 to the beginning of P resulting in P=[3,1,2,4,5]. 
+For i=1: queries[i]=1, P=[3,1,2,4,5], position of 1 in P is 1, then we move 1 to the beginning of P resulting in P=[1,3,2,4,5]. 
+For i=2: queries[i]=2, P=[1,3,2,4,5], position of 2 in P is 2, then we move 2 to the beginning of P resulting in P=[2,1,3,4,5]. 
+For i=3: queries[i]=1, P=[2,1,3,4,5], position of 1 in P is 1, then we move 1 to the beginning of P resulting in P=[1,2,3,4,5]. 
+Therefore, the array containing the result is [2,1,2,1].  
+
+ +

Example 2:

+ +
+Input: queries = [4,1,2,2], m = 4
+Output: [3,1,2,0]
+
+ +

Example 3:

+ +
+Input: queries = [7,5,5,8,3], m = 8
+Output: [6,5,0,7,5]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m <= 10^3
    • +
  • 1 <= queries.length <= m
    • +
  • 1 <= queries[i] <= m
    • +
",2.0,False,"class Solution { +public: + vector processQueries(vector& queries, int m) { + + } +};","class Solution { + public int[] processQueries(int[] queries, int m) { + + } +}","class Solution(object): + def processQueries(self, queries, m): + """""" + :type queries: List[int] + :type m: int + :rtype: List[int] + """""" + ","class Solution: + def processQueries(self, queries: List[int], m: int) -> List[int]: + "," + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* processQueries(int* queries, int queriesSize, int m, int* returnSize){ + +}","public class Solution { + public int[] ProcessQueries(int[] queries, int m) { + + } +}","/** + * @param {number[]} queries + * @param {number} m + * @return {number[]} + */ +var processQueries = function(queries, m) { + +};","# @param {Integer[]} queries +# @param {Integer} m +# @return {Integer[]} +def process_queries(queries, m) + +end","class Solution { + func processQueries(_ queries: [Int], _ m: Int) -> [Int] { + + } +}","func processQueries(queries []int, m int) []int { + +}","object Solution { + def processQueries(queries: Array[Int], m: Int): Array[Int] = { + + } +}","class Solution { + fun processQueries(queries: IntArray, m: Int): IntArray { + + } +}","impl Solution { + pub fn process_queries(queries: Vec, m: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $queries + * @param Integer $m + * @return Integer[] + */ + function processQueries($queries, $m) { + + } +}","function processQueries(queries: number[], m: number): number[] { + +};",,,,, +1003,string-matching-in-an-array,String Matching in an Array,1408.0,1524.0,"

Given an array of string words, return all strings in words that is a substring of another word. You can return the answer in any order.

+ +

A substring is a contiguous sequence of characters within a string

+ +

 

+

Example 1:

+ +
+Input: words = ["mass","as","hero","superhero"]
+Output: ["as","hero"]
+Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
+["hero","as"] is also a valid answer.
+
+ +

Example 2:

+ +
+Input: words = ["leetcode","et","code"]
+Output: ["et","code"]
+Explanation: "et", "code" are substring of "leetcode".
+
+ +

Example 3:

+ +
+Input: words = ["blue","green","bu"]
+Output: []
+Explanation: No string of words is substring of another string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
    • +
  • 1 <= words[i].length <= 30
    • +
  • words[i] contains only lowercase English letters.
    • +
  • All the strings of words are unique.
    • +
+",1.0,False,"class Solution { +public: + vector stringMatching(vector& words) { + + } +};","class Solution { + public List stringMatching(String[] words) { + + } +}","class Solution(object): + def stringMatching(self, words): + """""" + :type words: List[str] + :rtype: List[str] + """""" + ","class Solution: + def stringMatching(self, words: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** stringMatching(char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public IList StringMatching(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {string[]} + */ +var stringMatching = function(words) { + +};","# @param {String[]} words +# @return {String[]} +def string_matching(words) + +end","class Solution { + func stringMatching(_ words: [String]) -> [String] { + + } +}","func stringMatching(words []string) []string { + +}","object Solution { + def stringMatching(words: Array[String]): List[String] = { + + } +}","class Solution { + fun stringMatching(words: Array): List { + + } +}","impl Solution { + pub fn string_matching(words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @return String[] + */ + function stringMatching($words) { + + } +}","function stringMatching(words: string[]): string[] { + +};",,"-spec string_matching(Words :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +string_matching(Words) -> + .","defmodule Solution do + @spec string_matching(words :: [String.t]) :: [String.t] + def string_matching(words) do + + end +end","class Solution { + List stringMatching(List words) { + + } +}", +1004,stone-game-iii,Stone Game III,1406.0,1522.0,"

Alice and Bob continue their games with piles of stones. There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue.

+ +

Alice and Bob take turns, with Alice starting first. On each player's turn, that player can take 1, 2, or 3 stones from the first remaining stones in the row.

+ +

The score of each player is the sum of the values of the stones taken. The score of each player is 0 initially.

+ +

The objective of the game is to end with the highest score, and the winner is the player with the highest score and there could be a tie. The game continues until all the stones have been taken.

+ +

Assume Alice and Bob play optimally.

+ +

Return "Alice" if Alice will win, "Bob" if Bob will win, or "Tie" if they will end the game with the same score.

+ +

 

+

Example 1:

+ +
+Input: stoneValue = [1,2,3,7]
+Output: "Bob"
+Explanation: Alice will always lose. Her best move will be to take three piles and the score become 6. Now the score of Bob is 7 and Bob wins.
+
+ +

Example 2:

+ +
+Input: stoneValue = [1,2,3,-9]
+Output: "Alice"
+Explanation: Alice must choose all the three piles at the first move to win and leave Bob with negative score.
+If Alice chooses one pile her score will be 1 and the next move Bob's score becomes 5. In the next move, Alice will take the pile with value = -9 and lose.
+If Alice chooses two piles her score will be 3 and the next move Bob's score becomes 3. In the next move, Alice will take the pile with value = -9 and also lose.
+Remember that both play optimally so here Alice will choose the scenario that makes her win.
+
+ +

Example 3:

+ +
+Input: stoneValue = [1,2,3,6]
+Output: "Tie"
+Explanation: Alice cannot win this game. She can end the game in a draw if she decided to choose all the first three piles, otherwise she will lose.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= stoneValue.length <= 5 * 104
    • +
  • -1000 <= stoneValue[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + string stoneGameIII(vector& stoneValue) { + + } +};","class Solution { + public String stoneGameIII(int[] stoneValue) { + + } +}","class Solution(object): + def stoneGameIII(self, stoneValue): + """""" + :type stoneValue: List[int] + :rtype: str + """""" + ","class Solution: + def stoneGameIII(self, stoneValue: List[int]) -> str: + ","char * stoneGameIII(int* stoneValue, int stoneValueSize){ + +}","public class Solution { + public string StoneGameIII(int[] stoneValue) { + + } +}","/** + * @param {number[]} stoneValue + * @return {string} + */ +var stoneGameIII = function(stoneValue) { + +};","# @param {Integer[]} stone_value +# @return {String} +def stone_game_iii(stone_value) + +end","class Solution { + func stoneGameIII(_ stoneValue: [Int]) -> String { + + } +}","func stoneGameIII(stoneValue []int) string { + +}","object Solution { + def stoneGameIII(stoneValue: Array[Int]): String = { + + } +}","class Solution { + fun stoneGameIII(stoneValue: IntArray): String { + + } +}","impl Solution { + pub fn stone_game_iii(stone_value: Vec) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $stoneValue + * @return String + */ + function stoneGameIII($stoneValue) { + + } +}","function stoneGameIII(stoneValue: number[]): string { + +};",,,,"class Solution { + String stoneGameIII(List stoneValue) { + + } +}", +1007,restore-the-array,Restore The Array,1416.0,1517.0,"

A program was supposed to print an array of integers. The program forgot to print whitespaces and the array is printed as a string of digits s and all we know is that all integers in the array were in the range [1, k] and there are no leading zeros in the array.

+ +

Given the string s and the integer k, return the number of the possible arrays that can be printed as s using the mentioned program. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "1000", k = 10000
+Output: 1
+Explanation: The only possible array is [1000]
+
+ +

Example 2:

+ +
+Input: s = "1000", k = 10
+Output: 0
+Explanation: There cannot be an array that was printed this way and has all integer >= 1 and <= 10.
+
+ +

Example 3:

+ +
+Input: s = "1317", k = 2000
+Output: 8
+Explanation: Possible arrays are [1317],[131,7],[13,17],[1,317],[13,1,7],[1,31,7],[1,3,17],[1,3,1,7]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of only digits and does not contain leading zeros.
    • +
  • 1 <= k <= 109
    • +
+",3.0,False,"class Solution { +public: + int numberOfArrays(string s, int k) { + + } +};","class Solution { + public int numberOfArrays(String s, int k) { + + } +}","class Solution(object): + def numberOfArrays(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def numberOfArrays(self, s: str, k: int) -> int: + ","int numberOfArrays(char * s, int k){ + +}","public class Solution { + public int NumberOfArrays(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var numberOfArrays = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def number_of_arrays(s, k) + +end","class Solution { + func numberOfArrays(_ s: String, _ k: Int) -> Int { + + } +}","func numberOfArrays(s string, k int) int { + +}","object Solution { + def numberOfArrays(s: String, k: Int): Int = { + + } +}","class Solution { + fun numberOfArrays(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn number_of_arrays(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function numberOfArrays($s, $k) { + + } +}","function numberOfArrays(s: string, k: number): number { + +};",,"-spec number_of_arrays(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +number_of_arrays(S, K) -> + .","defmodule Solution do + @spec number_of_arrays(s :: String.t, k :: integer) :: integer + def number_of_arrays(s, k) do + + end +end","class Solution { + int numberOfArrays(String s, int k) { + + } +}", +1008,the-k-th-lexicographical-string-of-all-happy-strings-of-length-n,The k-th Lexicographical String of All Happy Strings of Length n,1415.0,1516.0,"

A happy string is a string that:

+ +
    +
  • consists only of letters of the set ['a', 'b', 'c'].
    • +
  • s[i] != s[i + 1] for all values of i from 1 to s.length - 1 (string is 1-indexed).
    • +
+ +

For example, strings "abc", "ac", "b" and "abcbabcbcb" are all happy strings and strings "aa", "baa" and "ababbc" are not happy strings.

+ +

Given two integers n and k, consider a list of all happy strings of length n sorted in lexicographical order.

+ +

Return the kth string of this list or return an empty string if there are less than k happy strings of length n.

+ +

 

+

Example 1:

+ +
+Input: n = 1, k = 3
+Output: "c"
+Explanation: The list ["a", "b", "c"] contains all happy strings of length 1. The third string is "c".
+
+ +

Example 2:

+ +
+Input: n = 1, k = 4
+Output: ""
+Explanation: There are only 3 happy strings of length 1.
+
+ +

Example 3:

+ +
+Input: n = 3, k = 9
+Output: "cab"
+Explanation: There are 12 different happy string of length 3 ["aba", "abc", "aca", "acb", "bab", "bac", "bca", "bcb", "cab", "cac", "cba", "cbc"]. You will find the 9th string = "cab"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 10
    • +
  • 1 <= k <= 100
    • +
+",2.0,False,"class Solution { +public: + string getHappyString(int n, int k) { + + } +};","class Solution { + public String getHappyString(int n, int k) { + + } +}","class Solution(object): + def getHappyString(self, n, k): + """""" + :type n: int + :type k: int + :rtype: str + """""" + ","class Solution: + def getHappyString(self, n: int, k: int) -> str: + ","char * getHappyString(int n, int k){ + +}","public class Solution { + public string GetHappyString(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {string} + */ +var getHappyString = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {String} +def get_happy_string(n, k) + +end","class Solution { + func getHappyString(_ n: Int, _ k: Int) -> String { + + } +}","func getHappyString(n int, k int) string { + +}","object Solution { + def getHappyString(n: Int, k: Int): String = { + + } +}","class Solution { + fun getHappyString(n: Int, k: Int): String { + + } +}","impl Solution { + pub fn get_happy_string(n: i32, k: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return String + */ + function getHappyString($n, $k) { + + } +}","function getHappyString(n: number, k: number): string { + +};",,,,"class Solution { + String getHappyString(int n, int k) { + + } +}", +1009,find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k,Find the Minimum Number of Fibonacci Numbers Whose Sum Is K,1414.0,1515.0,"

Given an integer k, return the minimum number of Fibonacci numbers whose sum is equal to k. The same Fibonacci number can be used multiple times.

+ +

The Fibonacci numbers are defined as:

+ +
    +
  • F1 = 1
    • +
  • F2 = 1
    • +
  • Fn = Fn-1 + Fn-2 for n > 2.
    • +
+It is guaranteed that for the given constraints we can always find such Fibonacci numbers that sum up to k. +

 

+

Example 1:

+ +
+Input: k = 7
+Output: 2 
+Explanation: The Fibonacci numbers are: 1, 1, 2, 3, 5, 8, 13, ... 
+For k = 7 we can use 2 + 5 = 7.
+ +

Example 2:

+ +
+Input: k = 10
+Output: 2 
+Explanation: For k = 10 we can use 2 + 8 = 10.
+
+ +

Example 3:

+ +
+Input: k = 19
+Output: 3 
+Explanation: For k = 19 we can use 1 + 5 + 13 = 19.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 109
    • +
+",2.0,False,"class Solution { +public: + int findMinFibonacciNumbers(int k) { + + } +};","class Solution { + public int findMinFibonacciNumbers(int k) { + + } +}","class Solution(object): + def findMinFibonacciNumbers(self, k): + """""" + :type k: int + :rtype: int + """""" + ","class Solution: + def findMinFibonacciNumbers(self, k: int) -> int: + ","int findMinFibonacciNumbers(int k){ + +}","public class Solution { + public int FindMinFibonacciNumbers(int k) { + + } +}","/** + * @param {number} k + * @return {number} + */ +var findMinFibonacciNumbers = function(k) { + +};","# @param {Integer} k +# @return {Integer} +def find_min_fibonacci_numbers(k) + +end","class Solution { + func findMinFibonacciNumbers(_ k: Int) -> Int { + + } +}","func findMinFibonacciNumbers(k int) int { + +}","object Solution { + def findMinFibonacciNumbers(k: Int): Int = { + + } +}","class Solution { + fun findMinFibonacciNumbers(k: Int): Int { + + } +}","impl Solution { + pub fn find_min_fibonacci_numbers(k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @return Integer + */ + function findMinFibonacciNumbers($k) { + + } +}","function findMinFibonacciNumbers(k: number): number { + +};","(define/contract (find-min-fibonacci-numbers k) + (-> exact-integer? exact-integer?) + + )","-spec find_min_fibonacci_numbers(K :: integer()) -> integer(). +find_min_fibonacci_numbers(K) -> + .","defmodule Solution do + @spec find_min_fibonacci_numbers(k :: integer) :: integer + def find_min_fibonacci_numbers(k) do + + end +end","class Solution { + int findMinFibonacciNumbers(int k) { + + } +}", +1011,find-all-good-strings,Find All Good Strings,1397.0,1513.0,"

Given the strings s1 and s2 of size n and the string evil, return the number of good strings.

+ +

A good string has size n, it is alphabetically greater than or equal to s1, it is alphabetically smaller than or equal to s2, and it does not contain the string evil as a substring. Since the answer can be a huge number, return this modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2, s1 = "aa", s2 = "da", evil = "b"
+Output: 51 
+Explanation: There are 25 good strings starting with 'a': "aa","ac","ad",...,"az". Then there are 25 good strings starting with 'c': "ca","cc","cd",...,"cz" and finally there is one good string starting with 'd': "da". 
+
+ +

Example 2:

+ +
+Input: n = 8, s1 = "leetcode", s2 = "leetgoes", evil = "leet"
+Output: 0 
+Explanation: All strings greater than or equal to s1 and smaller than or equal to s2 start with the prefix "leet", therefore, there is not any good string.
+
+ +

Example 3:

+ +
+Input: n = 2, s1 = "gx", s2 = "gz", evil = "x"
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • s1.length == n
    • +
  • s2.length == n
    • +
  • s1 <= s2
    • +
  • 1 <= n <= 500
    • +
  • 1 <= evil.length <= 50
    • +
  • All strings consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int findGoodStrings(int n, string s1, string s2, string evil) { + + } +};","class Solution { + public int findGoodStrings(int n, String s1, String s2, String evil) { + + } +}","class Solution(object): + def findGoodStrings(self, n, s1, s2, evil): + """""" + :type n: int + :type s1: str + :type s2: str + :type evil: str + :rtype: int + """""" + ","class Solution: + def findGoodStrings(self, n: int, s1: str, s2: str, evil: str) -> int: + ","int findGoodStrings(int n, char * s1, char * s2, char * evil){ + +}","public class Solution { + public int FindGoodStrings(int n, string s1, string s2, string evil) { + + } +}","/** + * @param {number} n + * @param {string} s1 + * @param {string} s2 + * @param {string} evil + * @return {number} + */ +var findGoodStrings = function(n, s1, s2, evil) { + +};","# @param {Integer} n +# @param {String} s1 +# @param {String} s2 +# @param {String} evil +# @return {Integer} +def find_good_strings(n, s1, s2, evil) + +end","class Solution { + func findGoodStrings(_ n: Int, _ s1: String, _ s2: String, _ evil: String) -> Int { + + } +}","func findGoodStrings(n int, s1 string, s2 string, evil string) int { + +}","object Solution { + def findGoodStrings(n: Int, s1: String, s2: String, evil: String): Int = { + + } +}","class Solution { + fun findGoodStrings(n: Int, s1: String, s2: String, evil: String): Int { + + } +}","impl Solution { + pub fn find_good_strings(n: i32, s1: String, s2: String, evil: String) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param String $s1 + * @param String $s2 + * @param String $evil + * @return Integer + */ + function findGoodStrings($n, $s1, $s2, $evil) { + + } +}","function findGoodStrings(n: number, s1: string, s2: string, evil: string): number { + +};","(define/contract (find-good-strings n s1 s2 evil) + (-> exact-integer? string? string? string? exact-integer?) + + )","-spec find_good_strings(N :: integer(), S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary(), Evil :: unicode:unicode_binary()) -> integer(). +find_good_strings(N, S1, S2, Evil) -> + .","defmodule Solution do + @spec find_good_strings(n :: integer, s1 :: String.t, s2 :: String.t, evil :: String.t) :: integer + def find_good_strings(n, s1, s2, evil) do + + end +end","class Solution { + int findGoodStrings(int n, String s1, String s2, String evil) { + + } +}", +1012,design-underground-system,Design Underground System,1396.0,1512.0,"

An underground railway system is keeping track of customer travel times between different stations. They are using this data to calculate the average time it takes to travel from one station to another.

+ +

Implement the UndergroundSystem class:

+ +
    +
  • void checkIn(int id, string stationName, int t) + +
      +
    • A customer with a card ID equal to id, checks in at the station stationName at time t.
      • +
    • A customer can only be checked into one place at a time.
      • +
    +
    • +
  • void checkOut(int id, string stationName, int t) +
      +
    • A customer with a card ID equal to id, checks out from the station stationName at time t.
      • +
    +
    • +
  • double getAverageTime(string startStation, string endStation) +
      +
    • Returns the average time it takes to travel from startStation to endStation.
      • +
    • The average time is computed from all the previous traveling times from startStation to endStation that happened directly, meaning a check in at startStation followed by a check out from endStation.
      • +
    • The time it takes to travel from startStation to endStation may be different from the time it takes to travel from endStation to startStation.
      • +
    • There will be at least one customer that has traveled from startStation to endStation before getAverageTime is called.
      • +
    +
    • +
+ +

You may assume all calls to the checkIn and checkOut methods are consistent. If a customer checks in at time t1 then checks out at time t2, then t1 < t2. All events happen in chronological order.

+ +

 

+

Example 1:

+ +
+Input
+["UndergroundSystem","checkIn","checkIn","checkIn","checkOut","checkOut","checkOut","getAverageTime","getAverageTime","checkIn","getAverageTime","checkOut","getAverageTime"]
+[[],[45,"Leyton",3],[32,"Paradise",8],[27,"Leyton",10],[45,"Waterloo",15],[27,"Waterloo",20],[32,"Cambridge",22],["Paradise","Cambridge"],["Leyton","Waterloo"],[10,"Leyton",24],["Leyton","Waterloo"],[10,"Waterloo",38],["Leyton","Waterloo"]]
+
+Output
+[null,null,null,null,null,null,null,14.00000,11.00000,null,11.00000,null,12.00000]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(45, "Leyton", 3);
+undergroundSystem.checkIn(32, "Paradise", 8);
+undergroundSystem.checkIn(27, "Leyton", 10);
+undergroundSystem.checkOut(45, "Waterloo", 15);  // Customer 45 "Leyton" -> "Waterloo" in 15-3 = 12
+undergroundSystem.checkOut(27, "Waterloo", 20);  // Customer 27 "Leyton" -> "Waterloo" in 20-10 = 10
+undergroundSystem.checkOut(32, "Cambridge", 22); // Customer 32 "Paradise" -> "Cambridge" in 22-8 = 14
+undergroundSystem.getAverageTime("Paradise", "Cambridge"); // return 14.00000. One trip "Paradise" -> "Cambridge", (14) / 1 = 14
+undergroundSystem.getAverageTime("Leyton", "Waterloo");    // return 11.00000. Two trips "Leyton" -> "Waterloo", (10 + 12) / 2 = 11
+undergroundSystem.checkIn(10, "Leyton", 24);
+undergroundSystem.getAverageTime("Leyton", "Waterloo");    // return 11.00000
+undergroundSystem.checkOut(10, "Waterloo", 38);  // Customer 10 "Leyton" -> "Waterloo" in 38-24 = 14
+undergroundSystem.getAverageTime("Leyton", "Waterloo");    // return 12.00000. Three trips "Leyton" -> "Waterloo", (10 + 12 + 14) / 3 = 12
+
+ +

Example 2:

+ +
+Input
+["UndergroundSystem","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime"]
+[[],[10,"Leyton",3],[10,"Paradise",8],["Leyton","Paradise"],[5,"Leyton",10],[5,"Paradise",16],["Leyton","Paradise"],[2,"Leyton",21],[2,"Paradise",30],["Leyton","Paradise"]]
+
+Output
+[null,null,null,5.00000,null,null,5.50000,null,null,6.66667]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(10, "Leyton", 3);
+undergroundSystem.checkOut(10, "Paradise", 8); // Customer 10 "Leyton" -> "Paradise" in 8-3 = 5
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.00000, (5) / 1 = 5
+undergroundSystem.checkIn(5, "Leyton", 10);
+undergroundSystem.checkOut(5, "Paradise", 16); // Customer 5 "Leyton" -> "Paradise" in 16-10 = 6
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.50000, (5 + 6) / 2 = 5.5
+undergroundSystem.checkIn(2, "Leyton", 21);
+undergroundSystem.checkOut(2, "Paradise", 30); // Customer 2 "Leyton" -> "Paradise" in 30-21 = 9
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 6.66667, (5 + 6 + 9) / 3 = 6.66667
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= id, t <= 106
    • +
  • 1 <= stationName.length, startStation.length, endStation.length <= 10
    • +
  • All strings consist of uppercase and lowercase English letters and digits.
    • +
  • There will be at most 2 * 104 calls in total to checkIn, checkOut, and getAverageTime.
    • +
  • Answers within 10-5 of the actual value will be accepted.
    • +
+",2.0,False,"class UndergroundSystem { +public: + UndergroundSystem() { + + } + + void checkIn(int id, string stationName, int t) { + + } + + void checkOut(int id, string stationName, int t) { + + } + + double getAverageTime(string startStation, string endStation) { + + } +}; + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * UndergroundSystem* obj = new UndergroundSystem(); + * obj->checkIn(id,stationName,t); + * obj->checkOut(id,stationName,t); + * double param_3 = obj->getAverageTime(startStation,endStation); + */","class UndergroundSystem { + + public UndergroundSystem() { + + } + + public void checkIn(int id, String stationName, int t) { + + } + + public void checkOut(int id, String stationName, int t) { + + } + + public double getAverageTime(String startStation, String endStation) { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * UndergroundSystem obj = new UndergroundSystem(); + * obj.checkIn(id,stationName,t); + * obj.checkOut(id,stationName,t); + * double param_3 = obj.getAverageTime(startStation,endStation); + */","class UndergroundSystem(object): + + def __init__(self): + + + def checkIn(self, id, stationName, t): + """""" + :type id: int + :type stationName: str + :type t: int + :rtype: None + """""" + + + def checkOut(self, id, stationName, t): + """""" + :type id: int + :type stationName: str + :type t: int + :rtype: None + """""" + + + def getAverageTime(self, startStation, endStation): + """""" + :type startStation: str + :type endStation: str + :rtype: float + """""" + + + +# Your UndergroundSystem object will be instantiated and called as such: +# obj = UndergroundSystem() +# obj.checkIn(id,stationName,t) +# obj.checkOut(id,stationName,t) +# param_3 = obj.getAverageTime(startStation,endStation)","class UndergroundSystem: + + def __init__(self): + + + def checkIn(self, id: int, stationName: str, t: int) -> None: + + + def checkOut(self, id: int, stationName: str, t: int) -> None: + + + def getAverageTime(self, startStation: str, endStation: str) -> float: + + + +# Your UndergroundSystem object will be instantiated and called as such: +# obj = UndergroundSystem() +# obj.checkIn(id,stationName,t) +# obj.checkOut(id,stationName,t) +# param_3 = obj.getAverageTime(startStation,endStation)"," + + +typedef struct { + +} UndergroundSystem; + + +UndergroundSystem* undergroundSystemCreate() { + +} + +void undergroundSystemCheckIn(UndergroundSystem* obj, int id, char * stationName, int t) { + +} + +void undergroundSystemCheckOut(UndergroundSystem* obj, int id, char * stationName, int t) { + +} + +double undergroundSystemGetAverageTime(UndergroundSystem* obj, char * startStation, char * endStation) { + +} + +void undergroundSystemFree(UndergroundSystem* obj) { + +} + +/** + * Your UndergroundSystem struct will be instantiated and called as such: + * UndergroundSystem* obj = undergroundSystemCreate(); + * undergroundSystemCheckIn(obj, id, stationName, t); + + * undergroundSystemCheckOut(obj, id, stationName, t); + + * double param_3 = undergroundSystemGetAverageTime(obj, startStation, endStation); + + * undergroundSystemFree(obj); +*/","public class UndergroundSystem { + + public UndergroundSystem() { + + } + + public void CheckIn(int id, string stationName, int t) { + + } + + public void CheckOut(int id, string stationName, int t) { + + } + + public double GetAverageTime(string startStation, string endStation) { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * UndergroundSystem obj = new UndergroundSystem(); + * obj.CheckIn(id,stationName,t); + * obj.CheckOut(id,stationName,t); + * double param_3 = obj.GetAverageTime(startStation,endStation); + */"," +var UndergroundSystem = function() { + +}; + +/** + * @param {number} id + * @param {string} stationName + * @param {number} t + * @return {void} + */ +UndergroundSystem.prototype.checkIn = function(id, stationName, t) { + +}; + +/** + * @param {number} id + * @param {string} stationName + * @param {number} t + * @return {void} + */ +UndergroundSystem.prototype.checkOut = function(id, stationName, t) { + +}; + +/** + * @param {string} startStation + * @param {string} endStation + * @return {number} + */ +UndergroundSystem.prototype.getAverageTime = function(startStation, endStation) { + +}; + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * var obj = new UndergroundSystem() + * obj.checkIn(id,stationName,t) + * obj.checkOut(id,stationName,t) + * var param_3 = obj.getAverageTime(startStation,endStation) + */","class UndergroundSystem + def initialize() + + end + + +=begin + :type id: Integer + :type station_name: String + :type t: Integer + :rtype: Void +=end + def check_in(id, station_name, t) + + end + + +=begin + :type id: Integer + :type station_name: String + :type t: Integer + :rtype: Void +=end + def check_out(id, station_name, t) + + end + + +=begin + :type start_station: String + :type end_station: String + :rtype: Float +=end + def get_average_time(start_station, end_station) + + end + + +end + +# Your UndergroundSystem object will be instantiated and called as such: +# obj = UndergroundSystem.new() +# obj.check_in(id, station_name, t) +# obj.check_out(id, station_name, t) +# param_3 = obj.get_average_time(start_station, end_station)"," +class UndergroundSystem { + + init() { + + } + + func checkIn(_ id: Int, _ stationName: String, _ t: Int) { + + } + + func checkOut(_ id: Int, _ stationName: String, _ t: Int) { + + } + + func getAverageTime(_ startStation: String, _ endStation: String) -> Double { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * let obj = UndergroundSystem() + * obj.checkIn(id, stationName, t) + * obj.checkOut(id, stationName, t) + * let ret_3: Double = obj.getAverageTime(startStation, endStation) + */","type UndergroundSystem struct { + +} + + +func Constructor() UndergroundSystem { + +} + + +func (this *UndergroundSystem) CheckIn(id int, stationName string, t int) { + +} + + +func (this *UndergroundSystem) CheckOut(id int, stationName string, t int) { + +} + + +func (this *UndergroundSystem) GetAverageTime(startStation string, endStation string) float64 { + +} + + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * obj := Constructor(); + * obj.CheckIn(id,stationName,t); + * obj.CheckOut(id,stationName,t); + * param_3 := obj.GetAverageTime(startStation,endStation); + */","class UndergroundSystem() { + + def checkIn(id: Int, stationName: String, t: Int) { + + } + + def checkOut(id: Int, stationName: String, t: Int) { + + } + + def getAverageTime(startStation: String, endStation: String): Double = { + + } + +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * var obj = new UndergroundSystem() + * obj.checkIn(id,stationName,t) + * obj.checkOut(id,stationName,t) + * var param_3 = obj.getAverageTime(startStation,endStation) + */","class UndergroundSystem() { + + fun checkIn(id: Int, stationName: String, t: Int) { + + } + + fun checkOut(id: Int, stationName: String, t: Int) { + + } + + fun getAverageTime(startStation: String, endStation: String): Double { + + } + +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * var obj = UndergroundSystem() + * obj.checkIn(id,stationName,t) + * obj.checkOut(id,stationName,t) + * var param_3 = obj.getAverageTime(startStation,endStation) + */","struct UndergroundSystem { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl UndergroundSystem { + + fn new() -> Self { + + } + + fn check_in(&self, id: i32, station_name: String, t: i32) { + + } + + fn check_out(&self, id: i32, station_name: String, t: i32) { + + } + + fn get_average_time(&self, start_station: String, end_station: String) -> f64 { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * let obj = UndergroundSystem::new(); + * obj.check_in(id, stationName, t); + * obj.check_out(id, stationName, t); + * let ret_3: f64 = obj.get_average_time(startStation, endStation); + */","class UndergroundSystem { + /** + */ + function __construct() { + + } + + /** + * @param Integer $id + * @param String $stationName + * @param Integer $t + * @return NULL + */ + function checkIn($id, $stationName, $t) { + + } + + /** + * @param Integer $id + * @param String $stationName + * @param Integer $t + * @return NULL + */ + function checkOut($id, $stationName, $t) { + + } + + /** + * @param String $startStation + * @param String $endStation + * @return Float + */ + function getAverageTime($startStation, $endStation) { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * $obj = UndergroundSystem(); + * $obj->checkIn($id, $stationName, $t); + * $obj->checkOut($id, $stationName, $t); + * $ret_3 = $obj->getAverageTime($startStation, $endStation); + */","class UndergroundSystem { + constructor() { + + } + + checkIn(id: number, stationName: string, t: number): void { + + } + + checkOut(id: number, stationName: string, t: number): void { + + } + + getAverageTime(startStation: string, endStation: string): number { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * var obj = new UndergroundSystem() + * obj.checkIn(id,stationName,t) + * obj.checkOut(id,stationName,t) + * var param_3 = obj.getAverageTime(startStation,endStation) + */","(define underground-system% + (class object% + (super-new) + (init-field) + + ; check-in : exact-integer? string? exact-integer? -> void? + (define/public (check-in id station-name t) + + ) + ; check-out : exact-integer? string? exact-integer? -> void? + (define/public (check-out id station-name t) + + ) + ; get-average-time : string? string? -> flonum? + (define/public (get-average-time start-station end-station) + + ))) + +;; Your underground-system% object will be instantiated and called as such: +;; (define obj (new underground-system%)) +;; (send obj check-in id station-name t) +;; (send obj check-out id station-name t) +;; (define param_3 (send obj get-average-time start-station end-station))","-spec underground_system_init_() -> any(). +underground_system_init_() -> + . + +-spec underground_system_check_in(Id :: integer(), StationName :: unicode:unicode_binary(), T :: integer()) -> any(). +underground_system_check_in(Id, StationName, T) -> + . + +-spec underground_system_check_out(Id :: integer(), StationName :: unicode:unicode_binary(), T :: integer()) -> any(). +underground_system_check_out(Id, StationName, T) -> + . + +-spec underground_system_get_average_time(StartStation :: unicode:unicode_binary(), EndStation :: unicode:unicode_binary()) -> float(). +underground_system_get_average_time(StartStation, EndStation) -> + . + + +%% Your functions will be called as such: +%% underground_system_init_(), +%% underground_system_check_in(Id, StationName, T), +%% underground_system_check_out(Id, StationName, T), +%% Param_3 = underground_system_get_average_time(StartStation, EndStation), + +%% underground_system_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule UndergroundSystem do + @spec init_() :: any + def init_() do + + end + + @spec check_in(id :: integer, station_name :: String.t, t :: integer) :: any + def check_in(id, station_name, t) do + + end + + @spec check_out(id :: integer, station_name :: String.t, t :: integer) :: any + def check_out(id, station_name, t) do + + end + + @spec get_average_time(start_station :: String.t, end_station :: String.t) :: float + def get_average_time(start_station, end_station) do + + end +end + +# Your functions will be called as such: +# UndergroundSystem.init_() +# UndergroundSystem.check_in(id, station_name, t) +# UndergroundSystem.check_out(id, station_name, t) +# param_3 = UndergroundSystem.get_average_time(start_station, end_station) + +# UndergroundSystem.init_ will be called before every test case, in which you can do some necessary initializations.","class UndergroundSystem { + + UndergroundSystem() { + + } + + void checkIn(int id, String stationName, int t) { + + } + + void checkOut(int id, String stationName, int t) { + + } + + double getAverageTime(String startStation, String endStation) { + + } +} + +/** + * Your UndergroundSystem object will be instantiated and called as such: + * UndergroundSystem obj = UndergroundSystem(); + * obj.checkIn(id,stationName,t); + * obj.checkOut(id,stationName,t); + * double param3 = obj.getAverageTime(startStation,endStation); + */", +1015,longest-happy-prefix,Longest Happy Prefix,1392.0,1508.0,"

A string is called a happy prefix if is a non-empty prefix which is also a suffix (excluding itself).

+ +

Given a string s, return the longest happy prefix of s. Return an empty string "" if no such prefix exists.

+ +

 

+

Example 1:

+ +
+Input: s = "level"
+Output: "l"
+Explanation: s contains 4 prefix excluding itself ("l", "le", "lev", "leve"), and suffix ("l", "el", "vel", "evel"). The largest prefix which is also suffix is given by "l".
+
+ +

Example 2:

+ +
+Input: s = "ababab"
+Output: "abab"
+Explanation: "abab" is the largest prefix which is also suffix. They can overlap in the original string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s contains only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string longestPrefix(string s) { + + } +};","class Solution { + public String longestPrefix(String s) { + + } +}","class Solution(object): + def longestPrefix(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def longestPrefix(self, s: str) -> str: + ","char * longestPrefix(char * s){ + +}","public class Solution { + public string LongestPrefix(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var longestPrefix = function(s) { + +};","# @param {String} s +# @return {String} +def longest_prefix(s) + +end","class Solution { + func longestPrefix(_ s: String) -> String { + + } +}","func longestPrefix(s string) string { + +}","object Solution { + def longestPrefix(s: String): String = { + + } +}","class Solution { + fun longestPrefix(s: String): String { + + } +}","impl Solution { + pub fn longest_prefix(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function longestPrefix($s) { + + } +}","function longestPrefix(s: string): string { + +};","(define/contract (longest-prefix s) + (-> string? string?) + + )","-spec longest_prefix(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +longest_prefix(S) -> + .","defmodule Solution do + @spec longest_prefix(s :: String.t) :: String.t + def longest_prefix(s) do + + end +end","class Solution { + String longestPrefix(String s) { + + } +}", +1016,check-if-there-is-a-valid-path-in-a-grid,Check if There is a Valid Path in a Grid,1391.0,1507.0,"

You are given an m x n grid. Each cell of grid represents a street. The street of grid[i][j] can be:

+ +
    +
  • 1 which means a street connecting the left cell and the right cell.
    • +
  • 2 which means a street connecting the upper cell and the lower cell.
    • +
  • 3 which means a street connecting the left cell and the lower cell.
    • +
  • 4 which means a street connecting the right cell and the lower cell.
    • +
  • 5 which means a street connecting the left cell and the upper cell.
    • +
  • 6 which means a street connecting the right cell and the upper cell.
    • +
+ +

You will initially start at the street of the upper-left cell (0, 0). A valid path in the grid is a path that starts from the upper left cell (0, 0) and ends at the bottom-right cell (m - 1, n - 1). The path should only follow the streets.

+ +

Notice that you are not allowed to change any street.

+ +

Return true if there is a valid path in the grid or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,4,3],[6,5,2]]
+Output: true
+Explanation: As shown you can start at cell (0, 0) and visit all the cells of the grid to reach (m - 1, n - 1).
+
+ +

Example 2:

+ +
+Input: grid = [[1,2,1],[1,2,1]]
+Output: false
+Explanation: As shown you the street at cell (0, 0) is not connected with any street of any other cell and you will get stuck at cell (0, 0)
+
+ +

Example 3:

+ +
+Input: grid = [[1,1,2]]
+Output: false
+Explanation: You will get stuck at cell (0, 1) and you cannot reach cell (0, 2).
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 300
    • +
  • 1 <= grid[i][j] <= 6
    • +
+",2.0,False,"class Solution { +public: + bool hasValidPath(vector>& grid) { + + } +};","class Solution { + public boolean hasValidPath(int[][] grid) { + + } +}","class Solution(object): + def hasValidPath(self, grid): + """""" + :type grid: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def hasValidPath(self, grid: List[List[int]]) -> bool: + ","bool hasValidPath(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public bool HasValidPath(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {boolean} + */ +var hasValidPath = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Boolean} +def has_valid_path(grid) + +end","class Solution { + func hasValidPath(_ grid: [[Int]]) -> Bool { + + } +}","func hasValidPath(grid [][]int) bool { + +}","object Solution { + def hasValidPath(grid: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun hasValidPath(grid: Array): Boolean { + + } +}","impl Solution { + pub fn has_valid_path(grid: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Boolean + */ + function hasValidPath($grid) { + + } +}","function hasValidPath(grid: number[][]): boolean { + +};","(define/contract (has-valid-path grid) + (-> (listof (listof exact-integer?)) boolean?) + + )","-spec has_valid_path(Grid :: [[integer()]]) -> boolean(). +has_valid_path(Grid) -> + .","defmodule Solution do + @spec has_valid_path(grid :: [[integer]]) :: boolean + def has_valid_path(grid) do + + end +end","class Solution { + bool hasValidPath(List> grid) { + + } +}", +1018,reducing-dishes,Reducing Dishes,1402.0,1503.0,"

A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time.

+ +

Like-time coefficient of a dish is defined as the time taken to cook that dish including previous dishes multiplied by its satisfaction level i.e. time[i] * satisfaction[i].

+ +

Return the maximum sum of like-time coefficient that the chef can obtain after dishes preparation.

+ +

Dishes can be prepared in any order and the chef can discard some dishes to get this maximum value.

+ +

 

+

Example 1:

+ +
+Input: satisfaction = [-1,-8,0,5,-9]
+Output: 14
+Explanation: After Removing the second and last dish, the maximum total like-time coefficient will be equal to (-1*1 + 0*2 + 5*3 = 14).
+Each dish is prepared in one unit of time.
+ +

Example 2:

+ +
+Input: satisfaction = [4,3,2]
+Output: 20
+Explanation: Dishes can be prepared in any order, (2*1 + 3*2 + 4*3 = 20)
+
+ +

Example 3:

+ +
+Input: satisfaction = [-1,-4,-5]
+Output: 0
+Explanation: People do not like the dishes. No dish is prepared.
+
+ +

 

+

Constraints:

+ +
    +
  • n == satisfaction.length
    • +
  • 1 <= n <= 500
    • +
  • -1000 <= satisfaction[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int maxSatisfaction(vector& satisfaction) { + + } +};","class Solution { + public int maxSatisfaction(int[] satisfaction) { + + } +}","class Solution(object): + def maxSatisfaction(self, satisfaction): + """""" + :type satisfaction: List[int] + :rtype: int + """""" + ","class Solution: + def maxSatisfaction(self, satisfaction: List[int]) -> int: + ","int maxSatisfaction(int* satisfaction, int satisfactionSize){ + +}","public class Solution { + public int MaxSatisfaction(int[] satisfaction) { + + } +}","/** + * @param {number[]} satisfaction + * @return {number} + */ +var maxSatisfaction = function(satisfaction) { + +};","# @param {Integer[]} satisfaction +# @return {Integer} +def max_satisfaction(satisfaction) + +end","class Solution { + func maxSatisfaction(_ satisfaction: [Int]) -> Int { + + } +}","func maxSatisfaction(satisfaction []int) int { + +}","object Solution { + def maxSatisfaction(satisfaction: Array[Int]): Int = { + + } +}","class Solution { + fun maxSatisfaction(satisfaction: IntArray): Int { + + } +}","impl Solution { + pub fn max_satisfaction(satisfaction: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $satisfaction + * @return Integer + */ + function maxSatisfaction($satisfaction) { + + } +}","function maxSatisfaction(satisfaction: number[]): number { + +};",,"-spec max_satisfaction(Satisfaction :: [integer()]) -> integer(). +max_satisfaction(Satisfaction) -> + .","defmodule Solution do + @spec max_satisfaction(satisfaction :: [integer]) :: integer + def max_satisfaction(satisfaction) do + + end +end","class Solution { + int maxSatisfaction(List satisfaction) { + + } +}", +1019,construct-k-palindrome-strings,Construct K Palindrome Strings,1400.0,1502.0,"

Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strings or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "annabelle", k = 2
+Output: true
+Explanation: You can construct two palindromes using all characters in s.
+Some possible constructions "anna" + "elble", "anbna" + "elle", "anellena" + "b"
+
+ +

Example 2:

+ +
+Input: s = "leetcode", k = 3
+Output: false
+Explanation: It is impossible to construct 3 palindromes using all the characters of s.
+
+ +

Example 3:

+ +
+Input: s = "true", k = 4
+Output: true
+Explanation: The only possible solution is to put each character in a separate string.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
  • 1 <= k <= 105
    • +
+",2.0,False,"class Solution { +public: + bool canConstruct(string s, int k) { + + } +};","class Solution { + public boolean canConstruct(String s, int k) { + + } +}","class Solution(object): + def canConstruct(self, s, k): + """""" + :type s: str + :type k: int + :rtype: bool + """""" + ","class Solution: + def canConstruct(self, s: str, k: int) -> bool: + ","bool canConstruct(char * s, int k){ + +}","public class Solution { + public bool CanConstruct(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {boolean} + */ +var canConstruct = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Boolean} +def can_construct(s, k) + +end","class Solution { + func canConstruct(_ s: String, _ k: Int) -> Bool { + + } +}","func canConstruct(s string, k int) bool { + +}","object Solution { + def canConstruct(s: String, k: Int): Boolean = { + + } +}","class Solution { + fun canConstruct(s: String, k: Int): Boolean { + + } +}","impl Solution { + pub fn can_construct(s: String, k: i32) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Boolean + */ + function canConstruct($s, $k) { + + } +}","function canConstruct(s: string, k: number): boolean { + +};",,,,"class Solution { + bool canConstruct(String s, int k) { + + } +}", +1021,count-largest-group,Count Largest Group,1399.0,1500.0,"

You are given an integer n.

+ +

Each number from 1 to n is grouped according to the sum of its digits.

+ +

Return the number of groups that have the largest size.

+ +

 

+

Example 1:

+ +
+Input: n = 13
+Output: 4
+Explanation: There are 9 groups in total, they are grouped according sum of its digits of numbers from 1 to 13:
+[1,10], [2,11], [3,12], [4,13], [5], [6], [7], [8], [9].
+There are 4 groups with largest size.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 2
+Explanation: There are 2 groups [1], [2] of size 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",1.0,False,"class Solution { +public: + int countLargestGroup(int n) { + + } +};","class Solution { + public int countLargestGroup(int n) { + + } +}","class Solution(object): + def countLargestGroup(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countLargestGroup(self, n: int) -> int: + ","int countLargestGroup(int n){ + +}","public class Solution { + public int CountLargestGroup(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countLargestGroup = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_largest_group(n) + +end","class Solution { + func countLargestGroup(_ n: Int) -> Int { + + } +}","func countLargestGroup(n int) int { + +}","object Solution { + def countLargestGroup(n: Int): Int = { + + } +}","class Solution { + fun countLargestGroup(n: Int): Int { + + } +}","impl Solution { + pub fn count_largest_group(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countLargestGroup($n) { + + } +}","function countLargestGroup(n: number): number { + +};",,,,"class Solution { + int countLargestGroup(int n) { + + } +}", +1022,maximum-performance-of-a-team,Maximum Performance of a Team,1383.0,1499.0,"

You are given two integers n and k and two integer arrays speed and efficiency both of length n. There are n engineers numbered from 1 to n. speed[i] and efficiency[i] represent the speed and efficiency of the ith engineer respectively.

+ +

Choose at most k different engineers out of the n engineers to form a team with the maximum performance.

+ +

The performance of a team is the sum of their engineers' speeds multiplied by the minimum efficiency among their engineers.

+ +

Return the maximum performance of this team. Since the answer can be a huge number, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2
+Output: 60
+Explanation: 
+We have the maximum performance of the team by selecting engineer 2 (with speed=10 and efficiency=4) and engineer 5 (with speed=5 and efficiency=7). That is, performance = (10 + 5) * min(4, 7) = 60.
+
+ +

Example 2:

+ +
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 3
+Output: 68
+Explanation:
+This is the same example as the first but k = 3. We can select engineer 1, engineer 2 and engineer 5 to get the maximum performance of the team. That is, performance = (2 + 10 + 5) * min(5, 4, 7) = 68.
+
+ +

Example 3:

+ +
+Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 4
+Output: 72
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 105
    • +
  • speed.length == n
    • +
  • efficiency.length == n
    • +
  • 1 <= speed[i] <= 105
    • +
  • 1 <= efficiency[i] <= 108
    • +
+",3.0,False,"class Solution { +public: + int maxPerformance(int n, vector& speed, vector& efficiency, int k) { + + } +};","class Solution { + public int maxPerformance(int n, int[] speed, int[] efficiency, int k) { + + } +}","class Solution(object): + def maxPerformance(self, n, speed, efficiency, k): + """""" + :type n: int + :type speed: List[int] + :type efficiency: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxPerformance(self, n: int, speed: List[int], efficiency: List[int], k: int) -> int: + ","int maxPerformance(int n, int* speed, int speedSize, int* efficiency, int efficiencySize, int k){ + +}","public class Solution { + public int MaxPerformance(int n, int[] speed, int[] efficiency, int k) { + + } +}","/** + * @param {number} n + * @param {number[]} speed + * @param {number[]} efficiency + * @param {number} k + * @return {number} + */ +var maxPerformance = function(n, speed, efficiency, k) { + +};","# @param {Integer} n +# @param {Integer[]} speed +# @param {Integer[]} efficiency +# @param {Integer} k +# @return {Integer} +def max_performance(n, speed, efficiency, k) + +end","class Solution { + func maxPerformance(_ n: Int, _ speed: [Int], _ efficiency: [Int], _ k: Int) -> Int { + + } +}","func maxPerformance(n int, speed []int, efficiency []int, k int) int { + +}","object Solution { + def maxPerformance(n: Int, speed: Array[Int], efficiency: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun maxPerformance(n: Int, speed: IntArray, efficiency: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $speed + * @param Integer[] $efficiency + * @param Integer $k + * @return Integer + */ + function maxPerformance($n, $speed, $efficiency, $k) { + + } +}","function maxPerformance(n: number, speed: number[], efficiency: number[], k: number): number { + +};","(define/contract (max-performance n speed efficiency k) + (-> exact-integer? (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec max_performance(N :: integer(), Speed :: [integer()], Efficiency :: [integer()], K :: integer()) -> integer(). +max_performance(N, Speed, Efficiency, K) -> + .","defmodule Solution do + @spec max_performance(n :: integer, speed :: [integer], efficiency :: [integer], k :: integer) :: integer + def max_performance(n, speed, efficiency, k) do + + end +end","class Solution { + int maxPerformance(int n, List speed, List efficiency, int k) { + + } +}", +1026,frog-position-after-t-seconds,Frog Position After T Seconds,1377.0,1493.0,"

Given an undirected tree consisting of n vertices numbered from 1 to n. A frog starts jumping from vertex 1. In one second, the frog jumps from its current vertex to another unvisited vertex if they are directly connected. The frog can not jump back to a visited vertex. In case the frog can jump to several vertices, it jumps randomly to one of them with the same probability. Otherwise, when the frog can not jump to any unvisited vertex, it jumps forever on the same vertex.

+ +

The edges of the undirected tree are given in the array edges, where edges[i] = [ai, bi] means that exists an edge connecting the vertices ai and bi.

+ +

Return the probability that after t seconds the frog is on the vertex target. Answers within 10-5 of the actual answer will be accepted.

+ +

 

+

Example 1:

+ +
+Input: n = 7, edges = [[1,2],[1,3],[1,7],[2,4],[2,6],[3,5]], t = 2, target = 4
+Output: 0.16666666666666666 
+Explanation: The figure above shows the given graph. The frog starts at vertex 1, jumping with 1/3 probability to the vertex 2 after second 1 and then jumping with 1/2 probability to vertex 4 after second 2. Thus the probability for the frog is on the vertex 4 after 2 seconds is 1/3 * 1/2 = 1/6 = 0.16666666666666666. 
+
+ +

Example 2:

+ + +
+Input: n = 7, edges = [[1,2],[1,3],[1,7],[2,4],[2,6],[3,5]], t = 1, target = 7
+Output: 0.3333333333333333
+Explanation: The figure above shows the given graph. The frog starts at vertex 1, jumping with 1/3 = 0.3333333333333333 probability to the vertex 7 after second 1. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 1 <= ai, bi <= n
    • +
  • 1 <= t <= 50
    • +
  • 1 <= target <= n
    • +
+",3.0,False,"class Solution { +public: + double frogPosition(int n, vector>& edges, int t, int target) { + + } +};","class Solution { + public double frogPosition(int n, int[][] edges, int t, int target) { + + } +}","class Solution(object): + def frogPosition(self, n, edges, t, target): + """""" + :type n: int + :type edges: List[List[int]] + :type t: int + :type target: int + :rtype: float + """""" + ","class Solution: + def frogPosition(self, n: int, edges: List[List[int]], t: int, target: int) -> float: + ","double frogPosition(int n, int** edges, int edgesSize, int* edgesColSize, int t, int target){ + +}","public class Solution { + public double FrogPosition(int n, int[][] edges, int t, int target) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} t + * @param {number} target + * @return {number} + */ +var frogPosition = function(n, edges, t, target) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} t +# @param {Integer} target +# @return {Float} +def frog_position(n, edges, t, target) + +end","class Solution { + func frogPosition(_ n: Int, _ edges: [[Int]], _ t: Int, _ target: Int) -> Double { + + } +}","func frogPosition(n int, edges [][]int, t int, target int) float64 { + +}","object Solution { + def frogPosition(n: Int, edges: Array[Array[Int]], t: Int, target: Int): Double = { + + } +}","class Solution { + fun frogPosition(n: Int, edges: Array, t: Int, target: Int): Double { + + } +}","impl Solution { + pub fn frog_position(n: i32, edges: Vec>, t: i32, target: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $t + * @param Integer $target + * @return Float + */ + function frogPosition($n, $edges, $t, $target) { + + } +}","function frogPosition(n: number, edges: number[][], t: number, target: number): number { + +};","(define/contract (frog-position n edges t target) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer? flonum?) + + )","-spec frog_position(N :: integer(), Edges :: [[integer()]], T :: integer(), Target :: integer()) -> float(). +frog_position(N, Edges, T, Target) -> + .","defmodule Solution do + @spec frog_position(n :: integer, edges :: [[integer]], t :: integer, target :: integer) :: float + def frog_position(n, edges, t, target) do + + end +end","class Solution { + double frogPosition(int n, List> edges, int t, int target) { + + } +}", +1027,time-needed-to-inform-all-employees,Time Needed to Inform All Employees,1376.0,1492.0,"

A company has n employees with a unique ID for each employee from 0 to n - 1. The head of the company is the one with headID.

+ +

Each employee has one direct manager given in the manager array where manager[i] is the direct manager of the i-th employee, manager[headID] = -1. Also, it is guaranteed that the subordination relationships have a tree structure.

+ +

The head of the company wants to inform all the company employees of an urgent piece of news. He will inform his direct subordinates, and they will inform their subordinates, and so on until all employees know about the urgent news.

+ +

The i-th employee needs informTime[i] minutes to inform all of his direct subordinates (i.e., After informTime[i] minutes, all his direct subordinates can start spreading the news).

+ +

Return the number of minutes needed to inform all the employees about the urgent news.

+ +

 

+

Example 1:

+ +
+Input: n = 1, headID = 0, manager = [-1], informTime = [0]
+Output: 0
+Explanation: The head of the company is the only employee in the company.
+
+ +

Example 2:

+ +
+Input: n = 6, headID = 2, manager = [2,2,-1,2,2,2], informTime = [0,0,1,0,0,0]
+Output: 1
+Explanation: The head of the company with id = 2 is the direct manager of all the employees in the company and needs 1 minute to inform them all.
+The tree structure of the employees in the company is shown.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 0 <= headID < n
    • +
  • manager.length == n
    • +
  • 0 <= manager[i] < n
    • +
  • manager[headID] == -1
    • +
  • informTime.length == n
    • +
  • 0 <= informTime[i] <= 1000
    • +
  • informTime[i] == 0 if employee i has no subordinates.
    • +
  • It is guaranteed that all the employees can be informed.
    • +
+",2.0,False,"class Solution { +public: + int numOfMinutes(int n, int headID, vector& manager, vector& informTime) { + + } +};","class Solution { + public int numOfMinutes(int n, int headID, int[] manager, int[] informTime) { + + } +}","class Solution(object): + def numOfMinutes(self, n, headID, manager, informTime): + """""" + :type n: int + :type headID: int + :type manager: List[int] + :type informTime: List[int] + :rtype: int + """""" + ","class Solution: + def numOfMinutes(self, n: int, headID: int, manager: List[int], informTime: List[int]) -> int: + ","int numOfMinutes(int n, int headID, int* manager, int managerSize, int* informTime, int informTimeSize){ + +}","public class Solution { + public int NumOfMinutes(int n, int headID, int[] manager, int[] informTime) { + + } +}","/** + * @param {number} n + * @param {number} headID + * @param {number[]} manager + * @param {number[]} informTime + * @return {number} + */ +var numOfMinutes = function(n, headID, manager, informTime) { + +};","# @param {Integer} n +# @param {Integer} head_id +# @param {Integer[]} manager +# @param {Integer[]} inform_time +# @return {Integer} +def num_of_minutes(n, head_id, manager, inform_time) + +end","class Solution { + func numOfMinutes(_ n: Int, _ headID: Int, _ manager: [Int], _ informTime: [Int]) -> Int { + + } +}","func numOfMinutes(n int, headID int, manager []int, informTime []int) int { + +}","object Solution { + def numOfMinutes(n: Int, headID: Int, manager: Array[Int], informTime: Array[Int]): Int = { + + } +}","class Solution { + fun numOfMinutes(n: Int, headID: Int, manager: IntArray, informTime: IntArray): Int { + + } +}","impl Solution { + pub fn num_of_minutes(n: i32, head_id: i32, manager: Vec, inform_time: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $headID + * @param Integer[] $manager + * @param Integer[] $informTime + * @return Integer + */ + function numOfMinutes($n, $headID, $manager, $informTime) { + + } +}","function numOfMinutes(n: number, headID: number, manager: number[], informTime: number[]): number { + +};","(define/contract (num-of-minutes n headID manager informTime) + (-> exact-integer? exact-integer? (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec num_of_minutes(N :: integer(), HeadID :: integer(), Manager :: [integer()], InformTime :: [integer()]) -> integer(). +num_of_minutes(N, HeadID, Manager, InformTime) -> + .","defmodule Solution do + @spec num_of_minutes(n :: integer, head_id :: integer, manager :: [integer], inform_time :: [integer]) :: integer + def num_of_minutes(n, head_id, manager, inform_time) do + + end +end","class Solution { + int numOfMinutes(int n, int headID, List manager, List informTime) { + + } +}", +1030,pizza-with-3n-slices,Pizza With 3n Slices,1388.0,1489.0,"

There is a pizza with 3n slices of varying size, you and your friends will take slices of pizza as follows:

+ +
    +
  • You will pick any pizza slice.
    • +
  • Your friend Alice will pick the next slice in the anti-clockwise direction of your pick.
    • +
  • Your friend Bob will pick the next slice in the clockwise direction of your pick.
    • +
  • Repeat until there are no more slices of pizzas.
    • +
+ +

Given an integer array slices that represent the sizes of the pizza slices in a clockwise direction, return the maximum possible sum of slice sizes that you can pick.

+ +

 

+

Example 1:

+ +
+Input: slices = [1,2,3,4,5,6]
+Output: 10
+Explanation: Pick pizza slice of size 4, Alice and Bob will pick slices with size 3 and 5 respectively. Then Pick slices with size 6, finally Alice and Bob will pick slice of size 2 and 1 respectively. Total = 4 + 6.
+
+ +

Example 2:

+ +
+Input: slices = [8,9,8,6,1,1]
+Output: 16
+Explanation: Pick pizza slice of size 8 in each turn. If you pick slice with size 9 your partners will pick slices of size 8.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 * n == slices.length
    • +
  • 1 <= slices.length <= 500
    • +
  • 1 <= slices[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int maxSizeSlices(vector& slices) { + + } +};","class Solution { + public int maxSizeSlices(int[] slices) { + + } +}","class Solution(object): + def maxSizeSlices(self, slices): + """""" + :type slices: List[int] + :rtype: int + """""" + ","class Solution: + def maxSizeSlices(self, slices: List[int]) -> int: + ","int maxSizeSlices(int* slices, int slicesSize){ + +}","public class Solution { + public int MaxSizeSlices(int[] slices) { + + } +}","/** + * @param {number[]} slices + * @return {number} + */ +var maxSizeSlices = function(slices) { + +};","# @param {Integer[]} slices +# @return {Integer} +def max_size_slices(slices) + +end","class Solution { + func maxSizeSlices(_ slices: [Int]) -> Int { + + } +}","func maxSizeSlices(slices []int) int { + +}","object Solution { + def maxSizeSlices(slices: Array[Int]): Int = { + + } +}","class Solution { + fun maxSizeSlices(slices: IntArray): Int { + + } +}","impl Solution { + pub fn max_size_slices(slices: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $slices + * @return Integer + */ + function maxSizeSlices($slices) { + + } +}","function maxSizeSlices(slices: number[]): number { + +};","(define/contract (max-size-slices slices) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_size_slices(Slices :: [integer()]) -> integer(). +max_size_slices(Slices) -> + .","defmodule Solution do + @spec max_size_slices(slices :: [integer]) :: integer + def max_size_slices(slices) do + + end +end","class Solution { + int maxSizeSlices(List slices) { + + } +}", +1032,cinema-seat-allocation,Cinema Seat Allocation,1386.0,1487.0,"

+ +

A cinema has n rows of seats, numbered from 1 to n and there are ten seats in each row, labelled from 1 to 10 as shown in the figure above.

+ +

Given the array reservedSeats containing the numbers of seats already reserved, for example, reservedSeats[i] = [3,8] means the seat located in row 3 and labelled with 8 is already reserved.

+ +

Return the maximum number of four-person groups you can assign on the cinema seats. A four-person group occupies four adjacent seats in one single row. Seats across an aisle (such as [3,3] and [3,4]) are not considered to be adjacent, but there is an exceptional case on which an aisle split a four-person group, in that case, the aisle split a four-person group in the middle, which means to have two people on each side.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 3, reservedSeats = [[1,2],[1,3],[1,8],[2,6],[3,1],[3,10]]
+Output: 4
+Explanation: The figure above shows the optimal allocation for four groups, where seats mark with blue are already reserved and contiguous seats mark with orange are for one group.
+
+ +

Example 2:

+ +
+Input: n = 2, reservedSeats = [[2,1],[1,8],[2,6]]
+Output: 2
+
+ +

Example 3:

+ +
+Input: n = 4, reservedSeats = [[4,3],[1,4],[4,6],[1,7]]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 10^9
    • +
  • 1 <= reservedSeats.length <= min(10*n, 10^4)
    • +
  • reservedSeats[i].length == 2
    • +
  • 1 <= reservedSeats[i][0] <= n
    • +
  • 1 <= reservedSeats[i][1] <= 10
    • +
  • All reservedSeats[i] are distinct.
    • +
+",2.0,False,"class Solution { +public: + int maxNumberOfFamilies(int n, vector>& reservedSeats) { + + } +};","class Solution { + public int maxNumberOfFamilies(int n, int[][] reservedSeats) { + + } +}","class Solution(object): + def maxNumberOfFamilies(self, n, reservedSeats): + """""" + :type n: int + :type reservedSeats: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxNumberOfFamilies(self, n: int, reservedSeats: List[List[int]]) -> int: + ","int maxNumberOfFamilies(int n, int** reservedSeats, int reservedSeatsSize, int* reservedSeatsColSize){ + +}","public class Solution { + public int MaxNumberOfFamilies(int n, int[][] reservedSeats) { + + } +}","/** + * @param {number} n + * @param {number[][]} reservedSeats + * @return {number} + */ +var maxNumberOfFamilies = function(n, reservedSeats) { + +};","# @param {Integer} n +# @param {Integer[][]} reserved_seats +# @return {Integer} +def max_number_of_families(n, reserved_seats) + +end","class Solution { + func maxNumberOfFamilies(_ n: Int, _ reservedSeats: [[Int]]) -> Int { + + } +}","func maxNumberOfFamilies(n int, reservedSeats [][]int) int { + +}","object Solution { + def maxNumberOfFamilies(n: Int, reservedSeats: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxNumberOfFamilies(n: Int, reservedSeats: Array): Int { + + } +}","impl Solution { + pub fn max_number_of_families(n: i32, reserved_seats: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $reservedSeats + * @return Integer + */ + function maxNumberOfFamilies($n, $reservedSeats) { + + } +}","function maxNumberOfFamilies(n: number, reservedSeats: number[][]): number { + +};","(define/contract (max-number-of-families n reservedSeats) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_number_of_families(N :: integer(), ReservedSeats :: [[integer()]]) -> integer(). +max_number_of_families(N, ReservedSeats) -> + .","defmodule Solution do + @spec max_number_of_families(n :: integer, reserved_seats :: [[integer]]) :: integer + def max_number_of_families(n, reserved_seats) do + + end +end","class Solution { + int maxNumberOfFamilies(int n, List> reservedSeats) { + + } +}", +1034,minimum-cost-to-make-at-least-one-valid-path-in-a-grid,Minimum Cost to Make at Least One Valid Path in a Grid,1368.0,1485.0,"

Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently in this cell. The sign of grid[i][j] can be:

+ +
    +
  • 1 which means go to the cell to the right. (i.e go from grid[i][j] to grid[i][j + 1])
    • +
  • 2 which means go to the cell to the left. (i.e go from grid[i][j] to grid[i][j - 1])
    • +
  • 3 which means go to the lower cell. (i.e go from grid[i][j] to grid[i + 1][j])
    • +
  • 4 which means go to the upper cell. (i.e go from grid[i][j] to grid[i - 1][j])
    • +
+ +

Notice that there could be some signs on the cells of the grid that point outside the grid.

+ +

You will initially start at the upper left cell (0, 0). A valid path in the grid is a path that starts from the upper left cell (0, 0) and ends at the bottom-right cell (m - 1, n - 1) following the signs on the grid. The valid path does not have to be the shortest.

+ +

You can modify the sign on a cell with cost = 1. You can modify the sign on a cell one time only.

+ +

Return the minimum cost to make the grid have at least one valid path.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1,1,1],[2,2,2,2],[1,1,1,1],[2,2,2,2]]
+Output: 3
+Explanation: You will start at point (0, 0).
+The path to (3, 3) is as follows. (0, 0) --> (0, 1) --> (0, 2) --> (0, 3) change the arrow to down with cost = 1 --> (1, 3) --> (1, 2) --> (1, 1) --> (1, 0) change the arrow to down with cost = 1 --> (2, 0) --> (2, 1) --> (2, 2) --> (2, 3) change the arrow to down with cost = 1 --> (3, 3)
+The total cost = 3.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,3],[3,2,2],[1,1,4]]
+Output: 0
+Explanation: You can follow the path from (0, 0) to (2, 2).
+
+ +

Example 3:

+ +
+Input: grid = [[1,2],[4,3]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 100
    • +
  • 1 <= grid[i][j] <= 4
    • +
+",3.0,False,"class Solution { +public: + int minCost(vector>& grid) { + + } +};","class Solution { + public int minCost(int[][] grid) { + + } +}","class Solution(object): + def minCost(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minCost(self, grid: List[List[int]]) -> int: + ","int minCost(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinCost(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minCost = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def min_cost(grid) + +end","class Solution { + func minCost(_ grid: [[Int]]) -> Int { + + } +}","func minCost(grid [][]int) int { + +}","object Solution { + def minCost(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minCost(grid: Array): Int { + + } +}","impl Solution { + pub fn min_cost(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minCost($grid) { + + } +}","function minCost(grid: number[][]): number { + +};","(define/contract (min-cost grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_cost(Grid :: [[integer()]]) -> integer(). +min_cost(Grid) -> + .","defmodule Solution do + @spec min_cost(grid :: [[integer]]) :: integer + def min_cost(grid) do + + end +end","class Solution { + int minCost(List> grid) { + + } +}", +1038,construct-target-array-with-multiple-sums,Construct Target Array With Multiple Sums,1354.0,1479.0,"

You are given an array target of n integers. From a starting array arr consisting of n 1's, you may perform the following procedure :

+ +
    +
  • let x be the sum of all elements currently in your array.
    • +
  • choose index i, such that 0 <= i < n and set the value of arr at index i to x.
    • +
  • You may repeat this procedure as many times as needed.
    • +
+ +

Return true if it is possible to construct the target array from arr, otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: target = [9,3,5]
+Output: true
+Explanation: Start with arr = [1, 1, 1] 
+[1, 1, 1], sum = 3 choose index 1
+[1, 3, 1], sum = 5 choose index 2
+[1, 3, 5], sum = 9 choose index 0
+[9, 3, 5] Done
+
+ +

Example 2:

+ +
+Input: target = [1,1,1,2]
+Output: false
+Explanation: Impossible to create target array from [1,1,1,1].
+
+ +

Example 3:

+ +
+Input: target = [8,5]
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • n == target.length
    • +
  • 1 <= n <= 5 * 104
    • +
  • 1 <= target[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + bool isPossible(vector& target) { + + } +};","class Solution { + public boolean isPossible(int[] target) { + + } +}","class Solution(object): + def isPossible(self, target): + """""" + :type target: List[int] + :rtype: bool + """""" + ","class Solution: + def isPossible(self, target: List[int]) -> bool: + ","bool isPossible(int* target, int targetSize){ + +}","public class Solution { + public bool IsPossible(int[] target) { + + } +}","/** + * @param {number[]} target + * @return {boolean} + */ +var isPossible = function(target) { + +};","# @param {Integer[]} target +# @return {Boolean} +def is_possible(target) + +end","class Solution { + func isPossible(_ target: [Int]) -> Bool { + + } +}","func isPossible(target []int) bool { + +}","object Solution { + def isPossible(target: Array[Int]): Boolean = { + + } +}","class Solution { + fun isPossible(target: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_possible(target: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $target + * @return Boolean + */ + function isPossible($target) { + + } +}","function isPossible(target: number[]): boolean { + +};","(define/contract (is-possible target) + (-> (listof exact-integer?) boolean?) + + )","-spec is_possible(Target :: [integer()]) -> boolean(). +is_possible(Target) -> + .","defmodule Solution do + @spec is_possible(target :: [integer]) :: boolean + def is_possible(target) do + + end +end","class Solution { + bool isPossible(List target) { + + } +}", +1039,maximum-number-of-events-that-can-be-attended,Maximum Number of Events That Can Be Attended,1353.0,1478.0,"

You are given an array of events where events[i] = [startDayi, endDayi]. Every event i starts at startDayi and ends at endDayi.

+ +

You can attend an event i at any day d where startTimei <= d <= endTimei. You can only attend one event at any time d.

+ +

Return the maximum number of events you can attend.

+ +

 

+

Example 1:

+ +
+Input: events = [[1,2],[2,3],[3,4]]
+Output: 3
+Explanation: You can attend all the three events.
+One way to attend them all is as shown.
+Attend the first event on day 1.
+Attend the second event on day 2.
+Attend the third event on day 3.
+
+ +

Example 2:

+ +
+Input: events= [[1,2],[2,3],[3,4],[1,2]]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= events.length <= 105
    • +
  • events[i].length == 2
    • +
  • 1 <= startDayi <= endDayi <= 105
    • +
+",2.0,False,"class Solution { +public: + int maxEvents(vector>& events) { + + } +};","class Solution { + public int maxEvents(int[][] events) { + + } +}","class Solution(object): + def maxEvents(self, events): + """""" + :type events: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxEvents(self, events: List[List[int]]) -> int: + ","int maxEvents(int** events, int eventsSize, int* eventsColSize){ + +}","public class Solution { + public int MaxEvents(int[][] events) { + + } +}","/** + * @param {number[][]} events + * @return {number} + */ +var maxEvents = function(events) { + +};","# @param {Integer[][]} events +# @return {Integer} +def max_events(events) + +end","class Solution { + func maxEvents(_ events: [[Int]]) -> Int { + + } +}","func maxEvents(events [][]int) int { + +}","object Solution { + def maxEvents(events: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxEvents(events: Array): Int { + + } +}","impl Solution { + pub fn max_events(events: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $events + * @return Integer + */ + function maxEvents($events) { + + } +}","function maxEvents(events: number[][]): number { + +};","(define/contract (max-events events) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_events(Events :: [[integer()]]) -> integer(). +max_events(Events) -> + .","defmodule Solution do + @spec max_events(events :: [[integer]]) :: integer + def max_events(events) do + + end +end","class Solution { + int maxEvents(List> events) { + + } +}", +1042,maximum-sum-bst-in-binary-tree,Maximum Sum BST in Binary Tree,1373.0,1475.0,"

Given a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST).

+ +

Assume a BST is defined as follows:

+ +
    +
  • The left subtree of a node contains only nodes with keys less than the node's key.
    • +
  • The right subtree of a node contains only nodes with keys greater than the node's key.
    • +
  • Both the left and right subtrees must also be binary search trees.
    • +
+ +

 

+

Example 1:

+ +

+ +
+Input: root = [1,4,3,2,4,2,5,null,null,null,null,null,null,4,6]
+Output: 20
+Explanation: Maximum sum in a valid Binary search tree is obtained in root node with key equal to 3.
+
+ +

Example 2:

+ +

+ +
+Input: root = [4,3,null,1,2]
+Output: 2
+Explanation: Maximum sum in a valid Binary search tree is obtained in a single root node with key equal to 2.
+
+ +

Example 3:

+ +
+Input: root = [-4,-2,-5]
+Output: 0
+Explanation: All values are negatives. Return an empty BST.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 4 * 104].
    • +
  • -4 * 104 <= Node.val <= 4 * 104
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int maxSumBST(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int maxSumBST(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def maxSumBST(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def maxSumBST(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int maxSumBST(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int MaxSumBST(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var maxSumBST = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def max_sum_bst(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func maxSumBST(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func maxSumBST(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def maxSumBST(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun maxSumBST(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn max_sum_bst(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function maxSumBST($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function maxSumBST(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (max-sum-bst root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec max_sum_bst(Root :: #tree_node{} | null) -> integer(). +max_sum_bst(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec max_sum_bst(root :: TreeNode.t | nil) :: integer + def max_sum_bst(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int maxSumBST(TreeNode? root) { + + } +}", +1044,find-the-longest-substring-containing-vowels-in-even-counts,Find the Longest Substring Containing Vowels in Even Counts,1371.0,1473.0,"

Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must appear an even number of times.

+ +

 

+

Example 1:

+ +
+Input: s = "eleetminicoworoep"
+Output: 13
+Explanation: The longest substring is "leetminicowor" which contains two each of the vowels: e, i and o and zero of the vowels: a and u.
+
+ +

Example 2:

+ +
+Input: s = "leetcodeisgreat"
+Output: 5
+Explanation: The longest substring is "leetc" which contains two e's.
+
+ +

Example 3:

+ +
+Input: s = "bcbcbc"
+Output: 6
+Explanation: In this case, the given string "bcbcbc" is the longest because all vowels: a, e, i, o and u appear zero times.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 5 x 10^5
    • +
  • s contains only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int findTheLongestSubstring(string s) { + + } +};","class Solution { + public int findTheLongestSubstring(String s) { + + } +}","class Solution(object): + def findTheLongestSubstring(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def findTheLongestSubstring(self, s: str) -> int: + ","int findTheLongestSubstring(char * s){ + +}","public class Solution { + public int FindTheLongestSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var findTheLongestSubstring = function(s) { + +};","# @param {String} s +# @return {Integer} +def find_the_longest_substring(s) + +end","class Solution { + func findTheLongestSubstring(_ s: String) -> Int { + + } +}","func findTheLongestSubstring(s string) int { + +}","object Solution { + def findTheLongestSubstring(s: String): Int = { + + } +}","class Solution { + fun findTheLongestSubstring(s: String): Int { + + } +}","impl Solution { + pub fn find_the_longest_substring(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function findTheLongestSubstring($s) { + + } +}","function findTheLongestSubstring(s: string): number { + +};","(define/contract (find-the-longest-substring s) + (-> string? exact-integer?) + + )","-spec find_the_longest_substring(S :: unicode:unicode_binary()) -> integer(). +find_the_longest_substring(S) -> + .","defmodule Solution do + @spec find_the_longest_substring(s :: String.t) :: integer + def find_the_longest_substring(s) do + + end +end","class Solution { + int findTheLongestSubstring(String s) { + + } +}", +1046,maximum-students-taking-exam,Maximum Students Taking Exam,1349.0,1471.0,"

Given a m * n matrix seats  that represent seats distributions in a classroom. If a seat is broken, it is denoted by '#' character otherwise it is denoted by a '.' character.

+ +

Students can see the answers of those sitting next to the left, right, upper left and upper right, but he cannot see the answers of the student sitting directly in front or behind him. Return the maximum number of students that can take the exam together without any cheating being possible..

+ +

Students must be placed in seats in good condition.

+ +

 

+

Example 1:

+ +
+Input: seats = [["#",".","#","#",".","#"],
+                [".","#","#","#","#","."],
+                ["#",".","#","#",".","#"]]
+Output: 4
+Explanation: Teacher can place 4 students in available seats so they don't cheat on the exam. 
+
+ +

Example 2:

+ +
+Input: seats = [[".","#"],
+                ["#","#"],
+                ["#","."],
+                ["#","#"],
+                [".","#"]]
+Output: 3
+Explanation: Place all students in available seats. 
+
+
+ +

Example 3:

+ +
+Input: seats = [["#",".",".",".","#"],
+                [".","#",".","#","."],
+                [".",".","#",".","."],
+                [".","#",".","#","."],
+                ["#",".",".",".","#"]]
+Output: 10
+Explanation: Place students in available seats in column 1, 3 and 5.
+
+ +

 

+

Constraints:

+ +
    +
  • seats contains only characters '.' and'#'.
    • +
  • m == seats.length
    • +
  • n == seats[i].length
    • +
  • 1 <= m <= 8
    • +
  • 1 <= n <= 8
    • +
+",3.0,False,"class Solution { +public: + int maxStudents(vector>& seats) { + + } +};","class Solution { + public int maxStudents(char[][] seats) { + + } +}","class Solution(object): + def maxStudents(self, seats): + """""" + :type seats: List[List[str]] + :rtype: int + """""" + ","class Solution: + def maxStudents(self, seats: List[List[str]]) -> int: + ","int maxStudents(char** seats, int seatsSize, int* seatsColSize){ + +}","public class Solution { + public int MaxStudents(char[][] seats) { + + } +}","/** + * @param {character[][]} seats + * @return {number} + */ +var maxStudents = function(seats) { + +};","# @param {Character[][]} seats +# @return {Integer} +def max_students(seats) + +end","class Solution { + func maxStudents(_ seats: [[Character]]) -> Int { + + } +}","func maxStudents(seats [][]byte) int { + +}","object Solution { + def maxStudents(seats: Array[Array[Char]]): Int = { + + } +}","class Solution { + fun maxStudents(seats: Array): Int { + + } +}","impl Solution { + pub fn max_students(seats: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String[][] $seats + * @return Integer + */ + function maxStudents($seats) { + + } +}","function maxStudents(seats: string[][]): number { + +};","(define/contract (max-students seats) + (-> (listof (listof char?)) exact-integer?) + + )","-spec max_students(Seats :: [[char()]]) -> integer(). +max_students(Seats) -> + .","defmodule Solution do + @spec max_students(seats :: [[char]]) :: integer + def max_students(seats) do + + end +end","class Solution { + int maxStudents(List> seats) { + + } +}", +1047,tweet-counts-per-frequency,Tweet Counts Per Frequency,1348.0,1470.0,"

A social media company is trying to monitor activity on their site by analyzing the number of tweets that occur in select periods of time. These periods can be partitioned into smaller time chunks based on a certain frequency (every minute, hour, or day).

+ +

For example, the period [10, 10000] (in seconds) would be partitioned into the following time chunks with these frequencies:

+ +
    +
  • Every minute (60-second chunks): [10,69], [70,129], [130,189], ..., [9970,10000]
    • +
  • Every hour (3600-second chunks): [10,3609], [3610,7209], [7210,10000]
    • +
  • Every day (86400-second chunks): [10,10000]
    • +
+ +

Notice that the last chunk may be shorter than the specified frequency's chunk size and will always end with the end time of the period (10000 in the above example).

+ +

Design and implement an API to help the company with their analysis.

+ +

Implement the TweetCounts class:

+ +
    +
  • TweetCounts() Initializes the TweetCounts object.
    • +
  • void recordTweet(String tweetName, int time) Stores the tweetName at the recorded time (in seconds).
    • +
  • List<Integer> getTweetCountsPerFrequency(String freq, String tweetName, int startTime, int endTime) Returns a list of integers representing the number of tweets with tweetName in each time chunk for the given period of time [startTime, endTime] (in seconds) and frequency freq. +
      +
    • freq is one of "minute", "hour", or "day" representing a frequency of every minute, hour, or day respectively.
      • +
    +
    • +
+ +

 

+

Example:

+ +
+Input
+["TweetCounts","recordTweet","recordTweet","recordTweet","getTweetCountsPerFrequency","getTweetCountsPerFrequency","recordTweet","getTweetCountsPerFrequency"]
+[[],["tweet3",0],["tweet3",60],["tweet3",10],["minute","tweet3",0,59],["minute","tweet3",0,60],["tweet3",120],["hour","tweet3",0,210]]
+
+Output
+[null,null,null,null,[2],[2,1],null,[4]]
+
+Explanation
+TweetCounts tweetCounts = new TweetCounts();
+tweetCounts.recordTweet("tweet3", 0);                              // New tweet "tweet3" at time 0
+tweetCounts.recordTweet("tweet3", 60);                             // New tweet "tweet3" at time 60
+tweetCounts.recordTweet("tweet3", 10);                             // New tweet "tweet3" at time 10
+tweetCounts.getTweetCountsPerFrequency("minute", "tweet3", 0, 59); // return [2]; chunk [0,59] had 2 tweets
+tweetCounts.getTweetCountsPerFrequency("minute", "tweet3", 0, 60); // return [2,1]; chunk [0,59] had 2 tweets, chunk [60,60] had 1 tweet
+tweetCounts.recordTweet("tweet3", 120);                            // New tweet "tweet3" at time 120
+tweetCounts.getTweetCountsPerFrequency("hour", "tweet3", 0, 210);  // return [4]; chunk [0,210] had 4 tweets
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= time, startTime, endTime <= 109
    • +
  • 0 <= endTime - startTime <= 104
    • +
  • There will be at most 104 calls in total to recordTweet and getTweetCountsPerFrequency.
    • +
+",2.0,False,"class TweetCounts { +public: + TweetCounts() { + + } + + void recordTweet(string tweetName, int time) { + + } + + vector getTweetCountsPerFrequency(string freq, string tweetName, int startTime, int endTime) { + + } +}; + +/** + * Your TweetCounts object will be instantiated and called as such: + * TweetCounts* obj = new TweetCounts(); + * obj->recordTweet(tweetName,time); + * vector param_2 = obj->getTweetCountsPerFrequency(freq,tweetName,startTime,endTime); + */","class TweetCounts { + + public TweetCounts() { + + } + + public void recordTweet(String tweetName, int time) { + + } + + public List getTweetCountsPerFrequency(String freq, String tweetName, int startTime, int endTime) { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * TweetCounts obj = new TweetCounts(); + * obj.recordTweet(tweetName,time); + * List param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime); + */","class TweetCounts(object): + + def __init__(self): + + + def recordTweet(self, tweetName, time): + """""" + :type tweetName: str + :type time: int + :rtype: None + """""" + + + def getTweetCountsPerFrequency(self, freq, tweetName, startTime, endTime): + """""" + :type freq: str + :type tweetName: str + :type startTime: int + :type endTime: int + :rtype: List[int] + """""" + + + +# Your TweetCounts object will be instantiated and called as such: +# obj = TweetCounts() +# obj.recordTweet(tweetName,time) +# param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime)","class TweetCounts: + + def __init__(self): + + + def recordTweet(self, tweetName: str, time: int) -> None: + + + def getTweetCountsPerFrequency(self, freq: str, tweetName: str, startTime: int, endTime: int) -> List[int]: + + + +# Your TweetCounts object will be instantiated and called as such: +# obj = TweetCounts() +# obj.recordTweet(tweetName,time) +# param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime)"," + + +typedef struct { + +} TweetCounts; + + +TweetCounts* tweetCountsCreate() { + +} + +void tweetCountsRecordTweet(TweetCounts* obj, char * tweetName, int time) { + +} + +int* tweetCountsGetTweetCountsPerFrequency(TweetCounts* obj, char * freq, char * tweetName, int startTime, int endTime, int* retSize) { + +} + +void tweetCountsFree(TweetCounts* obj) { + +} + +/** + * Your TweetCounts struct will be instantiated and called as such: + * TweetCounts* obj = tweetCountsCreate(); + * tweetCountsRecordTweet(obj, tweetName, time); + + * int* param_2 = tweetCountsGetTweetCountsPerFrequency(obj, freq, tweetName, startTime, endTime, retSize); + + * tweetCountsFree(obj); +*/","public class TweetCounts { + + public TweetCounts() { + + } + + public void RecordTweet(string tweetName, int time) { + + } + + public IList GetTweetCountsPerFrequency(string freq, string tweetName, int startTime, int endTime) { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * TweetCounts obj = new TweetCounts(); + * obj.RecordTweet(tweetName,time); + * IList param_2 = obj.GetTweetCountsPerFrequency(freq,tweetName,startTime,endTime); + */"," +var TweetCounts = function() { + +}; + +/** + * @param {string} tweetName + * @param {number} time + * @return {void} + */ +TweetCounts.prototype.recordTweet = function(tweetName, time) { + +}; + +/** + * @param {string} freq + * @param {string} tweetName + * @param {number} startTime + * @param {number} endTime + * @return {number[]} + */ +TweetCounts.prototype.getTweetCountsPerFrequency = function(freq, tweetName, startTime, endTime) { + +}; + +/** + * Your TweetCounts object will be instantiated and called as such: + * var obj = new TweetCounts() + * obj.recordTweet(tweetName,time) + * var param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime) + */","class TweetCounts + def initialize() + + end + + +=begin + :type tweet_name: String + :type time: Integer + :rtype: Void +=end + def record_tweet(tweet_name, time) + + end + + +=begin + :type freq: String + :type tweet_name: String + :type start_time: Integer + :type end_time: Integer + :rtype: Integer[] +=end + def get_tweet_counts_per_frequency(freq, tweet_name, start_time, end_time) + + end + + +end + +# Your TweetCounts object will be instantiated and called as such: +# obj = TweetCounts.new() +# obj.record_tweet(tweet_name, time) +# param_2 = obj.get_tweet_counts_per_frequency(freq, tweet_name, start_time, end_time)"," +class TweetCounts { + + init() { + + } + + func recordTweet(_ tweetName: String, _ time: Int) { + + } + + func getTweetCountsPerFrequency(_ freq: String, _ tweetName: String, _ startTime: Int, _ endTime: Int) -> [Int] { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * let obj = TweetCounts() + * obj.recordTweet(tweetName, time) + * let ret_2: [Int] = obj.getTweetCountsPerFrequency(freq, tweetName, startTime, endTime) + */","type TweetCounts struct { + +} + + +func Constructor() TweetCounts { + +} + + +func (this *TweetCounts) RecordTweet(tweetName string, time int) { + +} + + +func (this *TweetCounts) GetTweetCountsPerFrequency(freq string, tweetName string, startTime int, endTime int) []int { + +} + + +/** + * Your TweetCounts object will be instantiated and called as such: + * obj := Constructor(); + * obj.RecordTweet(tweetName,time); + * param_2 := obj.GetTweetCountsPerFrequency(freq,tweetName,startTime,endTime); + */","class TweetCounts() { + + def recordTweet(tweetName: String, time: Int) { + + } + + def getTweetCountsPerFrequency(freq: String, tweetName: String, startTime: Int, endTime: Int): List[Int] = { + + } + +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * var obj = new TweetCounts() + * obj.recordTweet(tweetName,time) + * var param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime) + */","class TweetCounts() { + + fun recordTweet(tweetName: String, time: Int) { + + } + + fun getTweetCountsPerFrequency(freq: String, tweetName: String, startTime: Int, endTime: Int): List { + + } + +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * var obj = TweetCounts() + * obj.recordTweet(tweetName,time) + * var param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime) + */","struct TweetCounts { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl TweetCounts { + + fn new() -> Self { + + } + + fn record_tweet(&self, tweet_name: String, time: i32) { + + } + + fn get_tweet_counts_per_frequency(&self, freq: String, tweet_name: String, start_time: i32, end_time: i32) -> Vec { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * let obj = TweetCounts::new(); + * obj.record_tweet(tweetName, time); + * let ret_2: Vec = obj.get_tweet_counts_per_frequency(freq, tweetName, startTime, endTime); + */","class TweetCounts { + /** + */ + function __construct() { + + } + + /** + * @param String $tweetName + * @param Integer $time + * @return NULL + */ + function recordTweet($tweetName, $time) { + + } + + /** + * @param String $freq + * @param String $tweetName + * @param Integer $startTime + * @param Integer $endTime + * @return Integer[] + */ + function getTweetCountsPerFrequency($freq, $tweetName, $startTime, $endTime) { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * $obj = TweetCounts(); + * $obj->recordTweet($tweetName, $time); + * $ret_2 = $obj->getTweetCountsPerFrequency($freq, $tweetName, $startTime, $endTime); + */","class TweetCounts { + constructor() { + + } + + recordTweet(tweetName: string, time: number): void { + + } + + getTweetCountsPerFrequency(freq: string, tweetName: string, startTime: number, endTime: number): number[] { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * var obj = new TweetCounts() + * obj.recordTweet(tweetName,time) + * var param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime) + */","(define tweet-counts% + (class object% + (super-new) + (init-field) + + ; record-tweet : string? exact-integer? -> void? + (define/public (record-tweet tweet-name time) + + ) + ; get-tweet-counts-per-frequency : string? string? exact-integer? exact-integer? -> (listof exact-integer?) + (define/public (get-tweet-counts-per-frequency freq tweet-name start-time end-time) + + ))) + +;; Your tweet-counts% object will be instantiated and called as such: +;; (define obj (new tweet-counts%)) +;; (send obj record-tweet tweet-name time) +;; (define param_2 (send obj get-tweet-counts-per-frequency freq tweet-name start-time end-time))","-spec tweet_counts_init_() -> any(). +tweet_counts_init_() -> + . + +-spec tweet_counts_record_tweet(TweetName :: unicode:unicode_binary(), Time :: integer()) -> any(). +tweet_counts_record_tweet(TweetName, Time) -> + . + +-spec tweet_counts_get_tweet_counts_per_frequency(Freq :: unicode:unicode_binary(), TweetName :: unicode:unicode_binary(), StartTime :: integer(), EndTime :: integer()) -> [integer()]. +tweet_counts_get_tweet_counts_per_frequency(Freq, TweetName, StartTime, EndTime) -> + . + + +%% Your functions will be called as such: +%% tweet_counts_init_(), +%% tweet_counts_record_tweet(TweetName, Time), +%% Param_2 = tweet_counts_get_tweet_counts_per_frequency(Freq, TweetName, StartTime, EndTime), + +%% tweet_counts_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule TweetCounts do + @spec init_() :: any + def init_() do + + end + + @spec record_tweet(tweet_name :: String.t, time :: integer) :: any + def record_tweet(tweet_name, time) do + + end + + @spec get_tweet_counts_per_frequency(freq :: String.t, tweet_name :: String.t, start_time :: integer, end_time :: integer) :: [integer] + def get_tweet_counts_per_frequency(freq, tweet_name, start_time, end_time) do + + end +end + +# Your functions will be called as such: +# TweetCounts.init_() +# TweetCounts.record_tweet(tweet_name, time) +# param_2 = TweetCounts.get_tweet_counts_per_frequency(freq, tweet_name, start_time, end_time) + +# TweetCounts.init_ will be called before every test case, in which you can do some necessary initializations.","class TweetCounts { + + TweetCounts() { + + } + + void recordTweet(String tweetName, int time) { + + } + + List getTweetCountsPerFrequency(String freq, String tweetName, int startTime, int endTime) { + + } +} + +/** + * Your TweetCounts object will be instantiated and called as such: + * TweetCounts obj = TweetCounts(); + * obj.recordTweet(tweetName,time); + * List param2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime); + */", +1050,jump-game-v,Jump Game V,1340.0,1466.0,"

Given an array of integers arr and an integer d. In one step you can jump from index i to index:

+ +
    +
  • i + x where: i + x < arr.length and 0 < x <= d.
    • +
  • i - x where: i - x >= 0 and 0 < x <= d.
    • +
+ +

In addition, you can only jump from index i to index j if arr[i] > arr[j] and arr[i] > arr[k] for all indices k between i and j (More formally min(i, j) < k < max(i, j)).

+ +

You can choose any index of the array and start jumping. Return the maximum number of indices you can visit.

+ +

Notice that you can not jump outside of the array at any time.

+ +

 

+

Example 1:

+ +
+Input: arr = [6,4,14,6,8,13,9,7,10,6,12], d = 2
+Output: 4
+Explanation: You can start at index 10. You can jump 10 --> 8 --> 6 --> 7 as shown.
+Note that if you start at index 6 you can only jump to index 7. You cannot jump to index 5 because 13 > 9. You cannot jump to index 4 because index 5 is between index 4 and 6 and 13 > 9.
+Similarly You cannot jump from index 3 to index 2 or index 1.
+
+ +

Example 2:

+ +
+Input: arr = [3,3,3,3,3], d = 3
+Output: 1
+Explanation: You can start at any index. You always cannot jump to any index.
+
+ +

Example 3:

+ +
+Input: arr = [7,6,5,4,3,2,1], d = 1
+Output: 7
+Explanation: Start at index 0. You can visit all the indicies. 
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 1000
    • +
  • 1 <= arr[i] <= 105
    • +
  • 1 <= d <= arr.length
    • +
+",3.0,False,"class Solution { +public: + int maxJumps(vector& arr, int d) { + + } +};","class Solution { + public int maxJumps(int[] arr, int d) { + + } +}","class Solution(object): + def maxJumps(self, arr, d): + """""" + :type arr: List[int] + :type d: int + :rtype: int + """""" + ","class Solution: + def maxJumps(self, arr: List[int], d: int) -> int: + ","int maxJumps(int* arr, int arrSize, int d){ + +}","public class Solution { + public int MaxJumps(int[] arr, int d) { + + } +}","/** + * @param {number[]} arr + * @param {number} d + * @return {number} + */ +var maxJumps = function(arr, d) { + +};","# @param {Integer[]} arr +# @param {Integer} d +# @return {Integer} +def max_jumps(arr, d) + +end","class Solution { + func maxJumps(_ arr: [Int], _ d: Int) -> Int { + + } +}","func maxJumps(arr []int, d int) int { + +}","object Solution { + def maxJumps(arr: Array[Int], d: Int): Int = { + + } +}","class Solution { + fun maxJumps(arr: IntArray, d: Int): Int { + + } +}","impl Solution { + pub fn max_jumps(arr: Vec, d: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $d + * @return Integer + */ + function maxJumps($arr, $d) { + + } +}","function maxJumps(arr: number[], d: number): number { + +};",,,,"class Solution { + int maxJumps(List arr, int d) { + + } +}", +1054,count-all-valid-pickup-and-delivery-options,Count All Valid Pickup and Delivery Options,1359.0,1461.0,"

Given n orders, each order consist in pickup and delivery services. 

+ +

Count all valid pickup/delivery possible sequences such that delivery(i) is always after of pickup(i). 

+ +

Since the answer may be too large, return it modulo 10^9 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 1
+Explanation: Unique order (P1, D1), Delivery 1 always is after of Pickup 1.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 6
+Explanation: All possible orders: 
+(P1,P2,D1,D2), (P1,P2,D2,D1), (P1,D1,P2,D2), (P2,P1,D1,D2), (P2,P1,D2,D1) and (P2,D2,P1,D1).
+This is an invalid order (P1,D2,P2,D1) because Pickup 2 is after of Delivery 2.
+
+ +

Example 3:

+ +
+Input: n = 3
+Output: 90
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 500
    • +
+",3.0,False,"class Solution { +public: + int countOrders(int n) { + + } +};","class Solution { + public int countOrders(int n) { + + } +}","class Solution(object): + def countOrders(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countOrders(self, n: int) -> int: + ","int countOrders(int n){ + +}","public class Solution { + public int CountOrders(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countOrders = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_orders(n) + +end","class Solution { + func countOrders(_ n: Int) -> Int { + + } +}","func countOrders(n int) int { + +}","object Solution { + def countOrders(n: Int): Int = { + + } +}","class Solution { + fun countOrders(n: Int): Int { + + } +}","impl Solution { + pub fn count_orders(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countOrders($n) { + + } +}","function countOrders(n: number): number { + +};","(define/contract (count-orders n) + (-> exact-integer? exact-integer?) + + )","-spec count_orders(N :: integer()) -> integer(). +count_orders(N) -> + .","defmodule Solution do + @spec count_orders(n :: integer) :: integer + def count_orders(n) do + + end +end","class Solution { + int countOrders(int n) { + + } +}", +1056,apply-discount-every-n-orders,Apply Discount Every n Orders,1357.0,1459.0,"

There is a supermarket that is frequented by many customers. The products sold at the supermarket are represented as two parallel integer arrays products and prices, where the ith product has an ID of products[i] and a price of prices[i].

+ +

When a customer is paying, their bill is represented as two parallel integer arrays product and amount, where the jth product they purchased has an ID of product[j], and amount[j] is how much of the product they bought. Their subtotal is calculated as the sum of each amount[j] * (price of the jth product).

+ +

The supermarket decided to have a sale. Every nth customer paying for their groceries will be given a percentage discount. The discount amount is given by discount, where they will be given discount percent off their subtotal. More formally, if their subtotal is bill, then they would actually pay bill * ((100 - discount) / 100).

+ +

Implement the Cashier class:

+ +
    +
  • Cashier(int n, int discount, int[] products, int[] prices) Initializes the object with n, the discount, and the products and their prices.
    • +
  • double getBill(int[] product, int[] amount) Returns the final total of the bill with the discount applied (if any). Answers within 10-5 of the actual value will be accepted.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Cashier","getBill","getBill","getBill","getBill","getBill","getBill","getBill"]
+[[3,50,[1,2,3,4,5,6,7],[100,200,300,400,300,200,100]],[[1,2],[1,2]],[[3,7],[10,10]],[[1,2,3,4,5,6,7],[1,1,1,1,1,1,1]],[[4],[10]],[[7,3],[10,10]],[[7,5,3,1,6,4,2],[10,10,10,9,9,9,7]],[[2,3,5],[5,3,2]]]
+Output
+[null,500.0,4000.0,800.0,4000.0,4000.0,7350.0,2500.0]
+Explanation
+Cashier cashier = new Cashier(3,50,[1,2,3,4,5,6,7],[100,200,300,400,300,200,100]);
+cashier.getBill([1,2],[1,2]);                        // return 500.0. 1st customer, no discount.
+                                                     // bill = 1 * 100 + 2 * 200 = 500.
+cashier.getBill([3,7],[10,10]);                      // return 4000.0. 2nd customer, no discount.
+                                                     // bill = 10 * 300 + 10 * 100 = 4000.
+cashier.getBill([1,2,3,4,5,6,7],[1,1,1,1,1,1,1]);    // return 800.0. 3rd customer, 50% discount.
+                                                     // Original bill = 1600
+                                                     // Actual bill = 1600 * ((100 - 50) / 100) = 800.
+cashier.getBill([4],[10]);                           // return 4000.0. 4th customer, no discount.
+cashier.getBill([7,3],[10,10]);                      // return 4000.0. 5th customer, no discount.
+cashier.getBill([7,5,3,1,6,4,2],[10,10,10,9,9,9,7]); // return 7350.0. 6th customer, 50% discount.
+                                                     // Original bill = 14700, but with
+                                                     // Actual bill = 14700 * ((100 - 50) / 100) = 7350.
+cashier.getBill([2,3,5],[5,3,2]);                    // return 2500.0.  7th customer, no discount.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
  • 0 <= discount <= 100
    • +
  • 1 <= products.length <= 200
    • +
  • prices.length == products.length
    • +
  • 1 <= products[i] <= 200
    • +
  • 1 <= prices[i] <= 1000
    • +
  • The elements in products are unique.
    • +
  • 1 <= product.length <= products.length
    • +
  • amount.length == product.length
    • +
  • product[j] exists in products.
    • +
  • 1 <= amount[j] <= 1000
    • +
  • The elements of product are unique.
    • +
  • At most 1000 calls will be made to getBill.
    • +
  • Answers within 10-5 of the actual value will be accepted.
    • +
+",2.0,False,"class Cashier { +public: + Cashier(int n, int discount, vector& products, vector& prices) { + + } + + double getBill(vector product, vector amount) { + + } +}; + +/** + * Your Cashier object will be instantiated and called as such: + * Cashier* obj = new Cashier(n, discount, products, prices); + * double param_1 = obj->getBill(product,amount); + */","class Cashier { + + public Cashier(int n, int discount, int[] products, int[] prices) { + + } + + public double getBill(int[] product, int[] amount) { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * Cashier obj = new Cashier(n, discount, products, prices); + * double param_1 = obj.getBill(product,amount); + */","class Cashier(object): + + def __init__(self, n, discount, products, prices): + """""" + :type n: int + :type discount: int + :type products: List[int] + :type prices: List[int] + """""" + + + def getBill(self, product, amount): + """""" + :type product: List[int] + :type amount: List[int] + :rtype: float + """""" + + + +# Your Cashier object will be instantiated and called as such: +# obj = Cashier(n, discount, products, prices) +# param_1 = obj.getBill(product,amount)","class Cashier: + + def __init__(self, n: int, discount: int, products: List[int], prices: List[int]): + + + def getBill(self, product: List[int], amount: List[int]) -> float: + + + +# Your Cashier object will be instantiated and called as such: +# obj = Cashier(n, discount, products, prices) +# param_1 = obj.getBill(product,amount)"," + + +typedef struct { + +} Cashier; + + +Cashier* cashierCreate(int n, int discount, int* products, int productsSize, int* prices, int pricesSize) { + +} + +double cashierGetBill(Cashier* obj, int* product, int productSize, int* amount, int amountSize) { + +} + +void cashierFree(Cashier* obj) { + +} + +/** + * Your Cashier struct will be instantiated and called as such: + * Cashier* obj = cashierCreate(n, discount, products, productsSize, prices, pricesSize); + * double param_1 = cashierGetBill(obj, product, productSize, amount, amountSize); + + * cashierFree(obj); +*/","public class Cashier { + + public Cashier(int n, int discount, int[] products, int[] prices) { + + } + + public double GetBill(int[] product, int[] amount) { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * Cashier obj = new Cashier(n, discount, products, prices); + * double param_1 = obj.GetBill(product,amount); + */","/** + * @param {number} n + * @param {number} discount + * @param {number[]} products + * @param {number[]} prices + */ +var Cashier = function(n, discount, products, prices) { + +}; + +/** + * @param {number[]} product + * @param {number[]} amount + * @return {number} + */ +Cashier.prototype.getBill = function(product, amount) { + +}; + +/** + * Your Cashier object will be instantiated and called as such: + * var obj = new Cashier(n, discount, products, prices) + * var param_1 = obj.getBill(product,amount) + */","class Cashier + +=begin + :type n: Integer + :type discount: Integer + :type products: Integer[] + :type prices: Integer[] +=end + def initialize(n, discount, products, prices) + + end + + +=begin + :type product: Integer[] + :type amount: Integer[] + :rtype: Float +=end + def get_bill(product, amount) + + end + + +end + +# Your Cashier object will be instantiated and called as such: +# obj = Cashier.new(n, discount, products, prices) +# param_1 = obj.get_bill(product, amount)"," +class Cashier { + + init(_ n: Int, _ discount: Int, _ products: [Int], _ prices: [Int]) { + + } + + func getBill(_ product: [Int], _ amount: [Int]) -> Double { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * let obj = Cashier(n, discount, products, prices) + * let ret_1: Double = obj.getBill(product, amount) + */","type Cashier struct { + +} + + +func Constructor(n int, discount int, products []int, prices []int) Cashier { + +} + + +func (this *Cashier) GetBill(product []int, amount []int) float64 { + +} + + +/** + * Your Cashier object will be instantiated and called as such: + * obj := Constructor(n, discount, products, prices); + * param_1 := obj.GetBill(product,amount); + */","class Cashier(_n: Int, _discount: Int, _products: Array[Int], _prices: Array[Int]) { + + def getBill(product: Array[Int], amount: Array[Int]): Double = { + + } + +} + +/** + * Your Cashier object will be instantiated and called as such: + * var obj = new Cashier(n, discount, products, prices) + * var param_1 = obj.getBill(product,amount) + */","class Cashier(n: Int, discount: Int, products: IntArray, prices: IntArray) { + + fun getBill(product: IntArray, amount: IntArray): Double { + + } + +} + +/** + * Your Cashier object will be instantiated and called as such: + * var obj = Cashier(n, discount, products, prices) + * var param_1 = obj.getBill(product,amount) + */","struct Cashier { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Cashier { + + fn new(n: i32, discount: i32, products: Vec, prices: Vec) -> Self { + + } + + fn get_bill(&self, product: Vec, amount: Vec) -> f64 { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * let obj = Cashier::new(n, discount, products, prices); + * let ret_1: f64 = obj.get_bill(product, amount); + */","class Cashier { + /** + * @param Integer $n + * @param Integer $discount + * @param Integer[] $products + * @param Integer[] $prices + */ + function __construct($n, $discount, $products, $prices) { + + } + + /** + * @param Integer[] $product + * @param Integer[] $amount + * @return Float + */ + function getBill($product, $amount) { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * $obj = Cashier($n, $discount, $products, $prices); + * $ret_1 = $obj->getBill($product, $amount); + */","class Cashier { + constructor(n: number, discount: number, products: number[], prices: number[]) { + + } + + getBill(product: number[], amount: number[]): number { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * var obj = new Cashier(n, discount, products, prices) + * var param_1 = obj.getBill(product,amount) + */","(define cashier% + (class object% + (super-new) + + ; n : exact-integer? + + ; discount : exact-integer? + + ; products : (listof exact-integer?) + + ; prices : (listof exact-integer?) + (init-field + n + discount + products + prices) + + ; get-bill : (listof exact-integer?) (listof exact-integer?) -> flonum? + (define/public (get-bill product amount) + + ))) + +;; Your cashier% object will be instantiated and called as such: +;; (define obj (new cashier% [n n] [discount discount] [products products] [prices prices])) +;; (define param_1 (send obj get-bill product amount))","-spec cashier_init_(N :: integer(), Discount :: integer(), Products :: [integer()], Prices :: [integer()]) -> any(). +cashier_init_(N, Discount, Products, Prices) -> + . + +-spec cashier_get_bill(Product :: [integer()], Amount :: [integer()]) -> float(). +cashier_get_bill(Product, Amount) -> + . + + +%% Your functions will be called as such: +%% cashier_init_(N, Discount, Products, Prices), +%% Param_1 = cashier_get_bill(Product, Amount), + +%% cashier_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Cashier do + @spec init_(n :: integer, discount :: integer, products :: [integer], prices :: [integer]) :: any + def init_(n, discount, products, prices) do + + end + + @spec get_bill(product :: [integer], amount :: [integer]) :: float + def get_bill(product, amount) do + + end +end + +# Your functions will be called as such: +# Cashier.init_(n, discount, products, prices) +# param_1 = Cashier.get_bill(product, amount) + +# Cashier.init_ will be called before every test case, in which you can do some necessary initializations.","class Cashier { + + Cashier(int n, int discount, List products, List prices) { + + } + + double getBill(List product, List amount) { + + } +} + +/** + * Your Cashier object will be instantiated and called as such: + * Cashier obj = Cashier(n, discount, products, prices); + * double param1 = obj.getBill(product,amount); + */", +1058,minimum-difficulty-of-a-job-schedule,Minimum Difficulty of a Job Schedule,1335.0,1457.0,"

You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the ith job, you have to finish all the jobs j where 0 <= j < i).

+ +

You have to finish at least one task every day. The difficulty of a job schedule is the sum of difficulties of each day of the d days. The difficulty of a day is the maximum difficulty of a job done on that day.

+ +

You are given an integer array jobDifficulty and an integer d. The difficulty of the ith job is jobDifficulty[i].

+ +

Return the minimum difficulty of a job schedule. If you cannot find a schedule for the jobs return -1.

+ +

 

+

Example 1:

+ +
+Input: jobDifficulty = [6,5,4,3,2,1], d = 2
+Output: 7
+Explanation: First day you can finish the first 5 jobs, total difficulty = 6.
+Second day you can finish the last job, total difficulty = 1.
+The difficulty of the schedule = 6 + 1 = 7 
+
+ +

Example 2:

+ +
+Input: jobDifficulty = [9,9,9], d = 4
+Output: -1
+Explanation: If you finish a job per day you will still have a free day. you cannot find a schedule for the given jobs.
+
+ +

Example 3:

+ +
+Input: jobDifficulty = [1,1,1], d = 3
+Output: 3
+Explanation: The schedule is one job per day. total difficulty will be 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= jobDifficulty.length <= 300
    • +
  • 0 <= jobDifficulty[i] <= 1000
    • +
  • 1 <= d <= 10
    • +
+",3.0,False,"class Solution { +public: + int minDifficulty(vector& jobDifficulty, int d) { + + } +};","class Solution { + public int minDifficulty(int[] jobDifficulty, int d) { + + } +}","class Solution(object): + def minDifficulty(self, jobDifficulty, d): + """""" + :type jobDifficulty: List[int] + :type d: int + :rtype: int + """""" + ","class Solution: + def minDifficulty(self, jobDifficulty: List[int], d: int) -> int: + ","int minDifficulty(int* jobDifficulty, int jobDifficultySize, int d){ + +}","public class Solution { + public int MinDifficulty(int[] jobDifficulty, int d) { + + } +}","/** + * @param {number[]} jobDifficulty + * @param {number} d + * @return {number} + */ +var minDifficulty = function(jobDifficulty, d) { + +};","# @param {Integer[]} job_difficulty +# @param {Integer} d +# @return {Integer} +def min_difficulty(job_difficulty, d) + +end","class Solution { + func minDifficulty(_ jobDifficulty: [Int], _ d: Int) -> Int { + + } +}","func minDifficulty(jobDifficulty []int, d int) int { + +}","object Solution { + def minDifficulty(jobDifficulty: Array[Int], d: Int): Int = { + + } +}","class Solution { + fun minDifficulty(jobDifficulty: IntArray, d: Int): Int { + + } +}","impl Solution { + pub fn min_difficulty(job_difficulty: Vec, d: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $jobDifficulty + * @param Integer $d + * @return Integer + */ + function minDifficulty($jobDifficulty, $d) { + + } +}","function minDifficulty(jobDifficulty: number[], d: number): number { + +};",,"-spec min_difficulty(JobDifficulty :: [integer()], D :: integer()) -> integer(). +min_difficulty(JobDifficulty, D) -> + .","defmodule Solution do + @spec min_difficulty(job_difficulty :: [integer], d :: integer) :: integer + def min_difficulty(job_difficulty, d) do + + end +end","class Solution { + int minDifficulty(List jobDifficulty, int d) { + + } +}", +1059,find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance,Find the City With the Smallest Number of Neighbors at a Threshold Distance,1334.0,1456.0,"

There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge between cities fromi and toi, and given the integer distanceThreshold.

+ +

Return the city with the smallest number of cities that are reachable through some path and whose distance is at most distanceThreshold, If there are multiple such cities, return the city with the greatest number.

+ +

Notice that the distance of a path connecting cities i and j is equal to the sum of the edges' weights along that path.

+ +

 

+

Example 1:

+ +
+Input: n = 4, edges = [[0,1,3],[1,2,1],[1,3,4],[2,3,1]], distanceThreshold = 4
+Output: 3
+Explanation: The figure above describes the graph. 
+The neighboring cities at a distanceThreshold = 4 for each city are:
+City 0 -> [City 1, City 2] 
+City 1 -> [City 0, City 2, City 3] 
+City 2 -> [City 0, City 1, City 3] 
+City 3 -> [City 1, City 2] 
+Cities 0 and 3 have 2 neighboring cities at a distanceThreshold = 4, but we have to return city 3 since it has the greatest number.
+
+ +

Example 2:

+ +
+Input: n = 5, edges = [[0,1,2],[0,4,8],[1,2,3],[1,4,2],[2,3,1],[3,4,1]], distanceThreshold = 2
+Output: 0
+Explanation: The figure above describes the graph. 
+The neighboring cities at a distanceThreshold = 2 for each city are:
+City 0 -> [City 1] 
+City 1 -> [City 0, City 4] 
+City 2 -> [City 3, City 4] 
+City 3 -> [City 2, City 4]
+City 4 -> [City 1, City 2, City 3] 
+The city 0 has 1 neighboring city at a distanceThreshold = 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 100
    • +
  • 1 <= edges.length <= n * (n - 1) / 2
    • +
  • edges[i].length == 3
    • +
  • 0 <= fromi < toi < n
    • +
  • 1 <= weighti, distanceThreshold <= 10^4
    • +
  • All pairs (fromi, toi) are distinct.
    • +
+",2.0,False,"class Solution { +public: + int findTheCity(int n, vector>& edges, int distanceThreshold) { + + } +};","class Solution { + public int findTheCity(int n, int[][] edges, int distanceThreshold) { + + } +}","class Solution(object): + def findTheCity(self, n, edges, distanceThreshold): + """""" + :type n: int + :type edges: List[List[int]] + :type distanceThreshold: int + :rtype: int + """""" + ","class Solution: + def findTheCity(self, n: int, edges: List[List[int]], distanceThreshold: int) -> int: + ","int findTheCity(int n, int** edges, int edgesSize, int* edgesColSize, int distanceThreshold){ + +}","public class Solution { + public int FindTheCity(int n, int[][] edges, int distanceThreshold) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @param {number} distanceThreshold + * @return {number} + */ +var findTheCity = function(n, edges, distanceThreshold) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @param {Integer} distance_threshold +# @return {Integer} +def find_the_city(n, edges, distance_threshold) + +end","class Solution { + func findTheCity(_ n: Int, _ edges: [[Int]], _ distanceThreshold: Int) -> Int { + + } +}","func findTheCity(n int, edges [][]int, distanceThreshold int) int { + +}","object Solution { + def findTheCity(n: Int, edges: Array[Array[Int]], distanceThreshold: Int): Int = { + + } +}","class Solution { + fun findTheCity(n: Int, edges: Array, distanceThreshold: Int): Int { + + } +}","impl Solution { + pub fn find_the_city(n: i32, edges: Vec>, distance_threshold: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @param Integer $distanceThreshold + * @return Integer + */ + function findTheCity($n, $edges, $distanceThreshold) { + + } +}","function findTheCity(n: number, edges: number[][], distanceThreshold: number): number { + +};","(define/contract (find-the-city n edges distanceThreshold) + (-> exact-integer? (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec find_the_city(N :: integer(), Edges :: [[integer()]], DistanceThreshold :: integer()) -> integer(). +find_the_city(N, Edges, DistanceThreshold) -> + .","defmodule Solution do + @spec find_the_city(n :: integer, edges :: [[integer]], distance_threshold :: integer) :: integer + def find_the_city(n, edges, distance_threshold) do + + end +end","class Solution { + int findTheCity(int n, List> edges, int distanceThreshold) { + + } +}", +1060,filter-restaurants-by-vegan-friendly-price-and-distance,"Filter Restaurants by Vegan-Friendly, Price and Distance",1333.0,1455.0,"

Given the array restaurants where  restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei]. You have to filter the restaurants using three filters.

+ +

The veganFriendly filter will be either true (meaning you should only include restaurants with veganFriendlyi set to true) or false (meaning you can include any restaurant). In addition, you have the filters maxPrice and maxDistance which are the maximum value for price and distance of restaurants you should consider respectively.

+ +

Return the array of restaurant IDs after filtering, ordered by rating from highest to lowest. For restaurants with the same rating, order them by id from highest to lowest. For simplicity veganFriendlyi and veganFriendly take value 1 when it is true, and 0 when it is false.

+ +

 

+

Example 1:

+ +
+Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 1, maxPrice = 50, maxDistance = 10
+Output: [3,1,5] 
+Explanation: 
+The restaurants are:
+Restaurant 1 [id=1, rating=4, veganFriendly=1, price=40, distance=10]
+Restaurant 2 [id=2, rating=8, veganFriendly=0, price=50, distance=5]
+Restaurant 3 [id=3, rating=8, veganFriendly=1, price=30, distance=4]
+Restaurant 4 [id=4, rating=10, veganFriendly=0, price=10, distance=3]
+Restaurant 5 [id=5, rating=1, veganFriendly=1, price=15, distance=1] 
+After filter restaurants with veganFriendly = 1, maxPrice = 50 and maxDistance = 10 we have restaurant 3, restaurant 1 and restaurant 5 (ordered by rating from highest to lowest). 
+
+ +

Example 2:

+ +
+Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 0, maxPrice = 50, maxDistance = 10
+Output: [4,3,2,1,5]
+Explanation: The restaurants are the same as in example 1, but in this case the filter veganFriendly = 0, therefore all restaurants are considered.
+
+ +

Example 3:

+ +
+Input: restaurants = [[1,4,1,40,10],[2,8,0,50,5],[3,8,1,30,4],[4,10,0,10,3],[5,1,1,15,1]], veganFriendly = 0, maxPrice = 30, maxDistance = 3
+Output: [4,5]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= restaurants.length <= 10^4
    • +
  • restaurants[i].length == 5
    • +
  • 1 <= idi, ratingi, pricei, distancei <= 10^5
    • +
  • 1 <= maxPrice, maxDistance <= 10^5
    • +
  • veganFriendlyi and veganFriendly are 0 or 1.
    • +
  • All idi are distinct.
    • +
+",2.0,False,"class Solution { +public: + vector filterRestaurants(vector>& restaurants, int veganFriendly, int maxPrice, int maxDistance) { + + } +};","class Solution { + public List filterRestaurants(int[][] restaurants, int veganFriendly, int maxPrice, int maxDistance) { + + } +}","class Solution(object): + def filterRestaurants(self, restaurants, veganFriendly, maxPrice, maxDistance): + """""" + :type restaurants: List[List[int]] + :type veganFriendly: int + :type maxPrice: int + :type maxDistance: int + :rtype: List[int] + """""" + ","class Solution: + def filterRestaurants(self, restaurants: List[List[int]], veganFriendly: int, maxPrice: int, maxDistance: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* filterRestaurants(int** restaurants, int restaurantsSize, int* restaurantsColSize, int veganFriendly, int maxPrice, int maxDistance, int* returnSize){ + +}","public class Solution { + public IList FilterRestaurants(int[][] restaurants, int veganFriendly, int maxPrice, int maxDistance) { + + } +}","/** + * @param {number[][]} restaurants + * @param {number} veganFriendly + * @param {number} maxPrice + * @param {number} maxDistance + * @return {number[]} + */ +var filterRestaurants = function(restaurants, veganFriendly, maxPrice, maxDistance) { + +};","# @param {Integer[][]} restaurants +# @param {Integer} vegan_friendly +# @param {Integer} max_price +# @param {Integer} max_distance +# @return {Integer[]} +def filter_restaurants(restaurants, vegan_friendly, max_price, max_distance) + +end","class Solution { + func filterRestaurants(_ restaurants: [[Int]], _ veganFriendly: Int, _ maxPrice: Int, _ maxDistance: Int) -> [Int] { + + } +}","func filterRestaurants(restaurants [][]int, veganFriendly int, maxPrice int, maxDistance int) []int { + +}","object Solution { + def filterRestaurants(restaurants: Array[Array[Int]], veganFriendly: Int, maxPrice: Int, maxDistance: Int): List[Int] = { + + } +}","class Solution { + fun filterRestaurants(restaurants: Array, veganFriendly: Int, maxPrice: Int, maxDistance: Int): List { + + } +}","impl Solution { + pub fn filter_restaurants(restaurants: Vec>, vegan_friendly: i32, max_price: i32, max_distance: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $restaurants + * @param Integer $veganFriendly + * @param Integer $maxPrice + * @param Integer $maxDistance + * @return Integer[] + */ + function filterRestaurants($restaurants, $veganFriendly, $maxPrice, $maxDistance) { + + } +}","function filterRestaurants(restaurants: number[][], veganFriendly: number, maxPrice: number, maxDistance: number): number[] { + +};","(define/contract (filter-restaurants restaurants veganFriendly maxPrice maxDistance) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec filter_restaurants(Restaurants :: [[integer()]], VeganFriendly :: integer(), MaxPrice :: integer(), MaxDistance :: integer()) -> [integer()]. +filter_restaurants(Restaurants, VeganFriendly, MaxPrice, MaxDistance) -> + .","defmodule Solution do + @spec filter_restaurants(restaurants :: [[integer]], vegan_friendly :: integer, max_price :: integer, max_distance :: integer) :: [integer] + def filter_restaurants(restaurants, vegan_friendly, max_price, max_distance) do + + end +end","class Solution { + List filterRestaurants(List> restaurants, int veganFriendly, int maxPrice, int maxDistance) { + + } +}", +1062,minimum-number-of-taps-to-open-to-water-a-garden,Minimum Number of Taps to Open to Water a Garden,1326.0,1451.0,"

There is a one-dimensional garden on the x-axis. The garden starts at the point 0 and ends at the point n. (i.e The length of the garden is n).

+ +

There are n + 1 taps located at points [0, 1, ..., n] in the garden.

+ +

Given an integer n and an integer array ranges of length n + 1 where ranges[i] (0-indexed) means the i-th tap can water the area [i - ranges[i], i + ranges[i]] if it was open.

+ +

Return the minimum number of taps that should be open to water the whole garden, If the garden cannot be watered return -1.

+ +

 

+

Example 1:

+ +
+Input: n = 5, ranges = [3,4,1,1,0,0]
+Output: 1
+Explanation: The tap at point 0 can cover the interval [-3,3]
+The tap at point 1 can cover the interval [-3,5]
+The tap at point 2 can cover the interval [1,3]
+The tap at point 3 can cover the interval [2,4]
+The tap at point 4 can cover the interval [4,4]
+The tap at point 5 can cover the interval [5,5]
+Opening Only the second tap will water the whole garden [0,5]
+
+ +

Example 2:

+ +
+Input: n = 3, ranges = [0,0,0,0]
+Output: -1
+Explanation: Even if you activate all the four taps you cannot water the whole garden.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
  • ranges.length == n + 1
    • +
  • 0 <= ranges[i] <= 100
    • +
+",3.0,False,"class Solution { +public: + int minTaps(int n, vector& ranges) { + + } +};","class Solution { + public int minTaps(int n, int[] ranges) { + + } +}","class Solution(object): + def minTaps(self, n, ranges): + """""" + :type n: int + :type ranges: List[int] + :rtype: int + """""" + ","class Solution: + def minTaps(self, n: int, ranges: List[int]) -> int: + ","int minTaps(int n, int* ranges, int rangesSize){ + +}","public class Solution { + public int MinTaps(int n, int[] ranges) { + + } +}","/** + * @param {number} n + * @param {number[]} ranges + * @return {number} + */ +var minTaps = function(n, ranges) { + +};","# @param {Integer} n +# @param {Integer[]} ranges +# @return {Integer} +def min_taps(n, ranges) + +end","class Solution { + func minTaps(_ n: Int, _ ranges: [Int]) -> Int { + + } +}","func minTaps(n int, ranges []int) int { + +}","object Solution { + def minTaps(n: Int, ranges: Array[Int]): Int = { + + } +}","class Solution { + fun minTaps(n: Int, ranges: IntArray): Int { + + } +}","impl Solution { + pub fn min_taps(n: i32, ranges: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $ranges + * @return Integer + */ + function minTaps($n, $ranges) { + + } +}","function minTaps(n: number, ranges: number[]): number { + +};","(define/contract (min-taps n ranges) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec min_taps(N :: integer(), Ranges :: [integer()]) -> integer(). +min_taps(N, Ranges) -> + .","defmodule Solution do + @spec min_taps(n :: integer, ranges :: [integer]) :: integer + def min_taps(n, ranges) do + + end +end","class Solution { + int minTaps(int n, List ranges) { + + } +}", +1063,delete-leaves-with-a-given-value,Delete Leaves With a Given Value,1325.0,1450.0,"

Given a binary tree root and an integer target, delete all the leaf nodes with value target.

+ +

Note that once you delete a leaf node with value target, if its parent node becomes a leaf node and has the value target, it should also be deleted (you need to continue doing that until you cannot).

+ +

 

+

Example 1:

+ +

+ +
+Input: root = [1,2,3,2,null,2,4], target = 2
+Output: [1,null,3,null,4]
+Explanation: Leaf nodes in green with value (target = 2) are removed (Picture in left). 
+After removing, new nodes become leaf nodes with value (target = 2) (Picture in center).
+
+ +

Example 2:

+ +

+ +
+Input: root = [1,3,3,3,2], target = 3
+Output: [1,3,null,null,2]
+
+ +

Example 3:

+ +

+ +
+Input: root = [1,2,null,2,null,2], target = 2
+Output: [1]
+Explanation: Leaf nodes in green with value (target = 2) are removed at each step.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 3000].
    • +
  • 1 <= Node.val, target <= 1000
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* removeLeafNodes(TreeNode* root, int target) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode removeLeafNodes(TreeNode root, int target) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def removeLeafNodes(self, root, target): + """""" + :type root: TreeNode + :type target: int + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def removeLeafNodes(self, root: Optional[TreeNode], target: int) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* removeLeafNodes(struct TreeNode* root, int target){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode RemoveLeafNodes(TreeNode root, int target) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} target + * @return {TreeNode} + */ +var removeLeafNodes = function(root, target) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} target +# @return {TreeNode} +def remove_leaf_nodes(root, target) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func removeLeafNodes(_ root: TreeNode?, _ target: Int) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func removeLeafNodes(root *TreeNode, target int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def removeLeafNodes(root: TreeNode, target: Int): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun removeLeafNodes(root: TreeNode?, target: Int): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn remove_leaf_nodes(root: Option>>, target: i32) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $target + * @return TreeNode + */ + function removeLeafNodes($root, $target) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function removeLeafNodes(root: TreeNode | null, target: number): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (remove-leaf-nodes root target) + (-> (or/c tree-node? #f) exact-integer? (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec remove_leaf_nodes(Root :: #tree_node{} | null, Target :: integer()) -> #tree_node{} | null. +remove_leaf_nodes(Root, Target) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec remove_leaf_nodes(root :: TreeNode.t | nil, target :: integer) :: TreeNode.t | nil + def remove_leaf_nodes(root, target) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? removeLeafNodes(TreeNode? root, int target) { + + } +}", +1065,maximum-69-number,Maximum 69 Number,1323.0,1448.0,"

You are given a positive integer num consisting only of digits 6 and 9.

+ +

Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).

+ +

 

+

Example 1:

+ +
+Input: num = 9669
+Output: 9969
+Explanation: 
+Changing the first digit results in 6669.
+Changing the second digit results in 9969.
+Changing the third digit results in 9699.
+Changing the fourth digit results in 9666.
+The maximum number is 9969.
+
+ +

Example 2:

+ +
+Input: num = 9996
+Output: 9999
+Explanation: Changing the last digit 6 to 9 results in the maximum number.
+
+ +

Example 3:

+ +
+Input: num = 9999
+Output: 9999
+Explanation: It is better not to apply any change.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num <= 104
    • +
  • num consists of only 6 and 9 digits.
    • +
+",1.0,False,"class Solution { +public: + int maximum69Number (int num) { + + } +};","class Solution { + public int maximum69Number (int num) { + + } +}","class Solution(object): + def maximum69Number (self, num): + """""" + :type num: int + :rtype: int + """""" + ","class Solution: + def maximum69Number (self, num: int) -> int: + ","int maximum69Number (int num){ + +}","public class Solution { + public int Maximum69Number (int num) { + + } +}","/** + * @param {number} num + * @return {number} + */ +var maximum69Number = function(num) { + +};","# @param {Integer} num +# @return {Integer} +def maximum69_number (num) + +end","class Solution { + func maximum69Number (_ num: Int) -> Int { + + } +}","func maximum69Number (num int) int { + +}","object Solution { + def maximum69Number (num: Int): Int = { + + } +}","class Solution { + fun maximum69Number (num: Int): Int { + + } +}","impl Solution { + pub fn maximum69_number (num: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Integer + */ + function maximum69Number ($num) { + + } +}","function maximum69Number (num: number): number { + +};",,,,"class Solution { + int maximum69Number (int num) { + + } +}", +1066,jump-game-iv,Jump Game IV,1345.0,1447.0,"

Given an array of integers arr, you are initially positioned at the first index of the array.

+ +

In one step you can jump from index i to index:

+ +
    +
  • i + 1 where: i + 1 < arr.length.
    • +
  • i - 1 where: i - 1 >= 0.
    • +
  • j where: arr[i] == arr[j] and i != j.
    • +
+ +

Return the minimum number of steps to reach the last index of the array.

+ +

Notice that you can not jump outside of the array at any time.

+ +

 

+

Example 1:

+ +
+Input: arr = [100,-23,-23,404,100,23,23,23,3,404]
+Output: 3
+Explanation: You need three jumps from index 0 --> 4 --> 3 --> 9. Note that index 9 is the last index of the array.
+
+ +

Example 2:

+ +
+Input: arr = [7]
+Output: 0
+Explanation: Start index is the last index. You do not need to jump.
+
+ +

Example 3:

+ +
+Input: arr = [7,6,9,6,9,6,9,7]
+Output: 1
+Explanation: You can jump directly from index 0 to index 7 which is last index of the array.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 5 * 104
    • +
  • -108 <= arr[i] <= 108
    • +
+",3.0,False,"class Solution { +public: + int minJumps(vector& arr) { + + } +};","class Solution { + public int minJumps(int[] arr) { + + } +}","class Solution(object): + def minJumps(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def minJumps(self, arr: List[int]) -> int: + ","int minJumps(int* arr, int arrSize){ + +}","public class Solution { + public int MinJumps(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var minJumps = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def min_jumps(arr) + +end","class Solution { + func minJumps(_ arr: [Int]) -> Int { + + } +}","func minJumps(arr []int) int { + +}","object Solution { + def minJumps(arr: Array[Int]): Int = { + + } +}","class Solution { + fun minJumps(arr: IntArray): Int { + + } +}","impl Solution { + pub fn min_jumps(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function minJumps($arr) { + + } +}","function minJumps(arr: number[]): number { + +};","(define/contract (min-jumps arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_jumps(Arr :: [integer()]) -> integer(). +min_jumps(Arr) -> + .","defmodule Solution do + @spec min_jumps(arr :: [integer]) :: integer + def min_jumps(arr) do + + end +end","class Solution { + int minJumps(List arr) { + + } +}", +1068,number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold,Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold,1343.0,1445.0,"

Given an array of integers arr and two integers k and threshold, return the number of sub-arrays of size k and average greater than or equal to threshold.

+ +

 

+

Example 1:

+ +
+Input: arr = [2,2,2,2,5,5,5,8], k = 3, threshold = 4
+Output: 3
+Explanation: Sub-arrays [2,5,5],[5,5,5] and [5,5,8] have averages 4, 5 and 6 respectively. All other sub-arrays of size 3 have averages less than 4 (the threshold).
+
+ +

Example 2:

+ +
+Input: arr = [11,13,17,23,29,31,7,5,2,3], k = 3, threshold = 5
+Output: 6
+Explanation: The first 6 sub-arrays of size 3 have averages greater than 5. Note that averages are not integers.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • 1 <= arr[i] <= 104
    • +
  • 1 <= k <= arr.length
    • +
  • 0 <= threshold <= 104
    • +
+",2.0,False,"class Solution { +public: + int numOfSubarrays(vector& arr, int k, int threshold) { + + } +};","class Solution { + public int numOfSubarrays(int[] arr, int k, int threshold) { + + } +}","class Solution(object): + def numOfSubarrays(self, arr, k, threshold): + """""" + :type arr: List[int] + :type k: int + :type threshold: int + :rtype: int + """""" + ","class Solution: + def numOfSubarrays(self, arr: List[int], k: int, threshold: int) -> int: + ","int numOfSubarrays(int* arr, int arrSize, int k, int threshold){ + +}","public class Solution { + public int NumOfSubarrays(int[] arr, int k, int threshold) { + + } +}","/** + * @param {number[]} arr + * @param {number} k + * @param {number} threshold + * @return {number} + */ +var numOfSubarrays = function(arr, k, threshold) { + +};","# @param {Integer[]} arr +# @param {Integer} k +# @param {Integer} threshold +# @return {Integer} +def num_of_subarrays(arr, k, threshold) + +end","class Solution { + func numOfSubarrays(_ arr: [Int], _ k: Int, _ threshold: Int) -> Int { + + } +}","func numOfSubarrays(arr []int, k int, threshold int) int { + +}","object Solution { + def numOfSubarrays(arr: Array[Int], k: Int, threshold: Int): Int = { + + } +}","class Solution { + fun numOfSubarrays(arr: IntArray, k: Int, threshold: Int): Int { + + } +}","impl Solution { + pub fn num_of_subarrays(arr: Vec, k: i32, threshold: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $k + * @param Integer $threshold + * @return Integer + */ + function numOfSubarrays($arr, $k, $threshold) { + + } +}","function numOfSubarrays(arr: number[], k: number, threshold: number): number { + +};","(define/contract (num-of-subarrays arr k threshold) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec num_of_subarrays(Arr :: [integer()], K :: integer(), Threshold :: integer()) -> integer(). +num_of_subarrays(Arr, K, Threshold) -> + .","defmodule Solution do + @spec num_of_subarrays(arr :: [integer], k :: integer, threshold :: integer) :: integer + def num_of_subarrays(arr, k, threshold) do + + end +end","class Solution { + int numOfSubarrays(List arr, int k, int threshold) { + + } +}", +1070,minimum-distance-to-type-a-word-using-two-fingers,Minimum Distance to Type a Word Using Two Fingers,1320.0,1443.0," +

You have a keyboard layout as shown above in the X-Y plane, where each English uppercase letter is located at some coordinate.

+ +
    +
  • For example, the letter 'A' is located at coordinate (0, 0), the letter 'B' is located at coordinate (0, 1), the letter 'P' is located at coordinate (2, 3) and the letter 'Z' is located at coordinate (4, 1).
    • +
+ +

Given the string word, return the minimum total distance to type such string using only two fingers.

+ +

The distance between coordinates (x1, y1) and (x2, y2) is |x1 - x2| + |y1 - y2|.

+ +

Note that the initial positions of your two fingers are considered free so do not count towards your total distance, also your two fingers do not have to start at the first letter or the first two letters.

+ +

 

+

Example 1:

+ +
+Input: word = "CAKE"
+Output: 3
+Explanation: Using two fingers, one optimal way to type "CAKE" is: 
+Finger 1 on letter 'C' -> cost = 0 
+Finger 1 on letter 'A' -> cost = Distance from letter 'C' to letter 'A' = 2 
+Finger 2 on letter 'K' -> cost = 0 
+Finger 2 on letter 'E' -> cost = Distance from letter 'K' to letter 'E' = 1 
+Total distance = 3
+
+ +

Example 2:

+ +
+Input: word = "HAPPY"
+Output: 6
+Explanation: Using two fingers, one optimal way to type "HAPPY" is:
+Finger 1 on letter 'H' -> cost = 0
+Finger 1 on letter 'A' -> cost = Distance from letter 'H' to letter 'A' = 2
+Finger 2 on letter 'P' -> cost = 0
+Finger 2 on letter 'P' -> cost = Distance from letter 'P' to letter 'P' = 0
+Finger 1 on letter 'Y' -> cost = Distance from letter 'A' to letter 'Y' = 4
+Total distance = 6
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= word.length <= 300
    • +
  • word consists of uppercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int minimumDistance(string word) { + + } +};","class Solution { + public int minimumDistance(String word) { + + } +}","class Solution(object): + def minimumDistance(self, word): + """""" + :type word: str + :rtype: int + """""" + ","class Solution: + def minimumDistance(self, word: str) -> int: + ","int minimumDistance(char * word){ + +}","public class Solution { + public int MinimumDistance(string word) { + + } +}","/** + * @param {string} word + * @return {number} + */ +var minimumDistance = function(word) { + +};","# @param {String} word +# @return {Integer} +def minimum_distance(word) + +end","class Solution { + func minimumDistance(_ word: String) -> Int { + + } +}","func minimumDistance(word string) int { + +}","object Solution { + def minimumDistance(word: String): Int = { + + } +}","class Solution { + fun minimumDistance(word: String): Int { + + } +}","impl Solution { + pub fn minimum_distance(word: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word + * @return Integer + */ + function minimumDistance($word) { + + } +}","function minimumDistance(word: string): number { + +};",,"-spec minimum_distance(Word :: unicode:unicode_binary()) -> integer(). +minimum_distance(Word) -> + .","defmodule Solution do + @spec minimum_distance(word :: String.t) :: integer + def minimum_distance(word) do + + end +end","class Solution { + int minimumDistance(String word) { + + } +}", +1072,minimum-flips-to-make-a-or-b-equal-to-c,Minimum Flips to Make a OR b Equal to c,1318.0,1441.0,"

Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation).
+Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.

+ +

 

+

Example 1:

+ +

+ +
+Input: a = 2, b = 6, c = 5
+Output: 3
+Explanation: After flips a = 1 , b = 4 , c = 5 such that (a OR b == c)
+ +

Example 2:

+ +
+Input: a = 4, b = 2, c = 7
+Output: 1
+
+ +

Example 3:

+ +
+Input: a = 1, b = 2, c = 3
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a <= 10^9
    • +
  • 1 <= b <= 10^9
    • +
  • 1 <= c <= 10^9
    • +
",2.0,False,"class Solution { +public: + int minFlips(int a, int b, int c) { + + } +};","class Solution { + public int minFlips(int a, int b, int c) { + + } +}","class Solution(object): + def minFlips(self, a, b, c): + """""" + :type a: int + :type b: int + :type c: int + :rtype: int + """""" + ","class Solution: + def minFlips(self, a: int, b: int, c: int) -> int: + "," + +int minFlips(int a, int b, int c){ + +}","public class Solution { + public int MinFlips(int a, int b, int c) { + + } +}","/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number} + */ +var minFlips = function(a, b, c) { + +};","# @param {Integer} a +# @param {Integer} b +# @param {Integer} c +# @return {Integer} +def min_flips(a, b, c) + +end","class Solution { + func minFlips(_ a: Int, _ b: Int, _ c: Int) -> Int { + + } +}","func minFlips(a int, b int, c int) int { + +}","object Solution { + def minFlips(a: Int, b: Int, c: Int): Int = { + + } +}","class Solution { + fun minFlips(a: Int, b: Int, c: Int): Int { + + } +}","impl Solution { + pub fn min_flips(a: i32, b: i32, c: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer $b + * @param Integer $c + * @return Integer + */ + function minFlips($a, $b, $c) { + + } +}","function minFlips(a: number, b: number, c: number): number { + +};",,,,, +1074,minimum-insertion-steps-to-make-a-string-palindrome,Minimum Insertion Steps to Make a String Palindrome,1312.0,1437.0,"

Given a string s. In one step you can insert any character at any index of the string.

+ +

Return the minimum number of steps to make s palindrome.

+ +

A Palindrome String is one that reads the same backward as well as forward.

+ +

 

+

Example 1:

+ +
+Input: s = "zzazz"
+Output: 0
+Explanation: The string "zzazz" is already palindrome we do not need any insertions.
+
+ +

Example 2:

+ +
+Input: s = "mbadm"
+Output: 2
+Explanation: String can be "mbdadbm" or "mdbabdm".
+
+ +

Example 3:

+ +
+Input: s = "leetcode"
+Output: 5
+Explanation: Inserting 5 characters the string becomes "leetcodocteel".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 500
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int minInsertions(string s) { + + } +};","class Solution { + public int minInsertions(String s) { + + } +}","class Solution(object): + def minInsertions(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minInsertions(self, s: str) -> int: + ","int minInsertions(char * s){ + +}","public class Solution { + public int MinInsertions(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minInsertions = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_insertions(s) + +end","class Solution { + func minInsertions(_ s: String) -> Int { + + } +}","func minInsertions(s string) int { + +}","object Solution { + def minInsertions(s: String): Int = { + + } +}","class Solution { + fun minInsertions(s: String): Int { + + } +}","impl Solution { + pub fn min_insertions(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minInsertions($s) { + + } +}","function minInsertions(s: string): number { + +};","(define/contract (min-insertions s) + (-> string? exact-integer?) + + )","-spec min_insertions(S :: unicode:unicode_binary()) -> integer(). +min_insertions(S) -> + .","defmodule Solution do + @spec min_insertions(s :: String.t) :: integer + def min_insertions(s) do + + end +end","class Solution { + int minInsertions(String s) { + + } +}", +1075,get-watched-videos-by-your-friends,Get Watched Videos by Your Friends,1311.0,1436.0,"

There are n people, each person has a unique id between 0 and n-1. Given the arrays watchedVideos and friends, where watchedVideos[i] and friends[i] contain the list of watched videos and the list of friends respectively for the person with id = i.

+ +

Level 1 of videos are all watched videos by your friends, level 2 of videos are all watched videos by the friends of your friends and so on. In general, the level k of videos are all watched videos by people with the shortest path exactly equal to k with you. Given your id and the level of videos, return the list of videos ordered by their frequencies (increasing). For videos with the same frequency order them alphabetically from least to greatest. 

+ +

 

+

Example 1:

+ +

+ +
+Input: watchedVideos = [["A","B"],["C"],["B","C"],["D"]], friends = [[1,2],[0,3],[0,3],[1,2]], id = 0, level = 1
+Output: ["B","C"] 
+Explanation: 
+You have id = 0 (green color in the figure) and your friends are (yellow color in the figure):
+Person with id = 1 -> watchedVideos = ["C"] 
+Person with id = 2 -> watchedVideos = ["B","C"] 
+The frequencies of watchedVideos by your friends are: 
+B -> 1 
+C -> 2
+
+ +

Example 2:

+ +

+ +
+Input: watchedVideos = [["A","B"],["C"],["B","C"],["D"]], friends = [[1,2],[0,3],[0,3],[1,2]], id = 0, level = 2
+Output: ["D"]
+Explanation: 
+You have id = 0 (green color in the figure) and the only friend of your friends is the person with id = 3 (yellow color in the figure).
+
+ +

 

+

Constraints:

+ +
    +
  • n == watchedVideos.length == friends.length
    • +
  • 2 <= n <= 100
    • +
  • 1 <= watchedVideos[i].length <= 100
    • +
  • 1 <= watchedVideos[i][j].length <= 8
    • +
  • 0 <= friends[i].length < n
    • +
  • 0 <= friends[i][j] < n
    • +
  • 0 <= id < n
    • +
  • 1 <= level < n
    • +
  • if friends[i] contains j, then friends[j] contains i
    • +
+",2.0,False,"class Solution { +public: + vector watchedVideosByFriends(vector>& watchedVideos, vector>& friends, int id, int level) { + + } +};","class Solution { + public List watchedVideosByFriends(List> watchedVideos, int[][] friends, int id, int level) { + + } +}","class Solution(object): + def watchedVideosByFriends(self, watchedVideos, friends, id, level): + """""" + :type watchedVideos: List[List[str]] + :type friends: List[List[int]] + :type id: int + :type level: int + :rtype: List[str] + """""" + ","class Solution: + def watchedVideosByFriends(self, watchedVideos: List[List[str]], friends: List[List[int]], id: int, level: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** watchedVideosByFriends(char *** watchedVideos, int watchedVideosSize, int* watchedVideosColSize, int** friends, int friendsSize, int* friendsColSize, int id, int level, int* returnSize){ + +}","public class Solution { + public IList WatchedVideosByFriends(IList> watchedVideos, int[][] friends, int id, int level) { + + } +}","/** + * @param {string[][]} watchedVideos + * @param {number[][]} friends + * @param {number} id + * @param {number} level + * @return {string[]} + */ +var watchedVideosByFriends = function(watchedVideos, friends, id, level) { + +};","# @param {String[][]} watched_videos +# @param {Integer[][]} friends +# @param {Integer} id +# @param {Integer} level +# @return {String[]} +def watched_videos_by_friends(watched_videos, friends, id, level) + +end","class Solution { + func watchedVideosByFriends(_ watchedVideos: [[String]], _ friends: [[Int]], _ id: Int, _ level: Int) -> [String] { + + } +}","func watchedVideosByFriends(watchedVideos [][]string, friends [][]int, id int, level int) []string { + +}","object Solution { + def watchedVideosByFriends(watchedVideos: List[List[String]], friends: Array[Array[Int]], id: Int, level: Int): List[String] = { + + } +}","class Solution { + fun watchedVideosByFriends(watchedVideos: List>, friends: Array, id: Int, level: Int): List { + + } +}","impl Solution { + pub fn watched_videos_by_friends(watched_videos: Vec>, friends: Vec>, id: i32, level: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String[][] $watchedVideos + * @param Integer[][] $friends + * @param Integer $id + * @param Integer $level + * @return String[] + */ + function watchedVideosByFriends($watchedVideos, $friends, $id, $level) { + + } +}","function watchedVideosByFriends(watchedVideos: string[][], friends: number[][], id: number, level: number): string[] { + +};","(define/contract (watched-videos-by-friends watchedVideos friends id level) + (-> (listof (listof string?)) (listof (listof exact-integer?)) exact-integer? exact-integer? (listof string?)) + + )","-spec watched_videos_by_friends(WatchedVideos :: [[unicode:unicode_binary()]], Friends :: [[integer()]], Id :: integer(), Level :: integer()) -> [unicode:unicode_binary()]. +watched_videos_by_friends(WatchedVideos, Friends, Id, Level) -> + .","defmodule Solution do + @spec watched_videos_by_friends(watched_videos :: [[String.t]], friends :: [[integer]], id :: integer, level :: integer) :: [String.t] + def watched_videos_by_friends(watched_videos, friends, id, level) do + + end +end","class Solution { + List watchedVideosByFriends(List> watchedVideos, List> friends, int id, int level) { + + } +}", +1078,encrypt-and-decrypt-strings,Encrypt and Decrypt Strings,2227.0,1433.0,"

You are given a character array keys containing unique characters and a string array values containing strings of length 2. You are also given another string array dictionary that contains all permitted original strings after decryption. You should implement a data structure that can encrypt or decrypt a 0-indexed string.

+ +

A string is encrypted with the following process:

+ +
    +
  1. For each character c in the string, we find the index i satisfying keys[i] == c in keys.
    2. +
  2. Replace c with values[i] in the string.
    3. +
+ +

Note that in case a character of the string is not present in keys, the encryption process cannot be carried out, and an empty string "" is returned.

+ +

A string is decrypted with the following process:

+ +
    +
  1. For each substring s of length 2 occurring at an even index in the string, we find an i such that values[i] == s. If there are multiple valid i, we choose any one of them. This means a string could have multiple possible strings it can decrypt to.
    2. +
  2. Replace s with keys[i] in the string.
    3. +
+ +

Implement the Encrypter class:

+ +
    +
  • Encrypter(char[] keys, String[] values, String[] dictionary) Initializes the Encrypter class with keys, values, and dictionary.
    • +
  • String encrypt(String word1) Encrypts word1 with the encryption process described above and returns the encrypted string.
    • +
  • int decrypt(String word2) Returns the number of possible strings word2 could decrypt to that also appear in dictionary.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Encrypter", "encrypt", "decrypt"]
+[[['a', 'b', 'c', 'd'], ["ei", "zf", "ei", "am"], ["abcd", "acbd", "adbc", "badc", "dacb", "cadb", "cbda", "abad"]], ["abcd"], ["eizfeiam"]]
+Output
+[null, "eizfeiam", 2]
+
+Explanation
+Encrypter encrypter = new Encrypter([['a', 'b', 'c', 'd'], ["ei", "zf", "ei", "am"], ["abcd", "acbd", "adbc", "badc", "dacb", "cadb", "cbda", "abad"]);
+encrypter.encrypt("abcd"); // return "eizfeiam". 
+                           // 'a' maps to "ei", 'b' maps to "zf", 'c' maps to "ei", and 'd' maps to "am".
+encrypter.decrypt("eizfeiam"); // return 2. 
+                              // "ei" can map to 'a' or 'c', "zf" maps to 'b', and "am" maps to 'd'. 
+                              // Thus, the possible strings after decryption are "abad", "cbad", "abcd", and "cbcd". 
+                              // 2 of those strings, "abad" and "abcd", appear in dictionary, so the answer is 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= keys.length == values.length <= 26
    • +
  • values[i].length == 2
    • +
  • 1 <= dictionary.length <= 100
    • +
  • 1 <= dictionary[i].length <= 100
    • +
  • All keys[i] and dictionary[i] are unique.
    • +
  • 1 <= word1.length <= 2000
    • +
  • 1 <= word2.length <= 200
    • +
  • All word1[i] appear in keys.
    • +
  • word2.length is even.
    • +
  • keys, values[i], dictionary[i], word1, and word2 only contain lowercase English letters.
    • +
  • At most 200 calls will be made to encrypt and decrypt in total.
    • +
+",3.0,False,"class Encrypter { +public: + Encrypter(vector& keys, vector& values, vector& dictionary) { + + } + + string encrypt(string word1) { + + } + + int decrypt(string word2) { + + } +}; + +/** + * Your Encrypter object will be instantiated and called as such: + * Encrypter* obj = new Encrypter(keys, values, dictionary); + * string param_1 = obj->encrypt(word1); + * int param_2 = obj->decrypt(word2); + */","class Encrypter { + + public Encrypter(char[] keys, String[] values, String[] dictionary) { + + } + + public String encrypt(String word1) { + + } + + public int decrypt(String word2) { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * Encrypter obj = new Encrypter(keys, values, dictionary); + * String param_1 = obj.encrypt(word1); + * int param_2 = obj.decrypt(word2); + */","class Encrypter(object): + + def __init__(self, keys, values, dictionary): + """""" + :type keys: List[str] + :type values: List[str] + :type dictionary: List[str] + """""" + + + def encrypt(self, word1): + """""" + :type word1: str + :rtype: str + """""" + + + def decrypt(self, word2): + """""" + :type word2: str + :rtype: int + """""" + + + +# Your Encrypter object will be instantiated and called as such: +# obj = Encrypter(keys, values, dictionary) +# param_1 = obj.encrypt(word1) +# param_2 = obj.decrypt(word2)","class Encrypter: + + def __init__(self, keys: List[str], values: List[str], dictionary: List[str]): + + + def encrypt(self, word1: str) -> str: + + + def decrypt(self, word2: str) -> int: + + + +# Your Encrypter object will be instantiated and called as such: +# obj = Encrypter(keys, values, dictionary) +# param_1 = obj.encrypt(word1) +# param_2 = obj.decrypt(word2)"," + + +typedef struct { + +} Encrypter; + + +Encrypter* encrypterCreate(char* keys, int keysSize, char ** values, int valuesSize, char ** dictionary, int dictionarySize) { + +} + +char * encrypterEncrypt(Encrypter* obj, char * word1) { + +} + +int encrypterDecrypt(Encrypter* obj, char * word2) { + +} + +void encrypterFree(Encrypter* obj) { + +} + +/** + * Your Encrypter struct will be instantiated and called as such: + * Encrypter* obj = encrypterCreate(keys, keysSize, values, valuesSize, dictionary, dictionarySize); + * char * param_1 = encrypterEncrypt(obj, word1); + + * int param_2 = encrypterDecrypt(obj, word2); + + * encrypterFree(obj); +*/","public class Encrypter { + + public Encrypter(char[] keys, string[] values, string[] dictionary) { + + } + + public string Encrypt(string word1) { + + } + + public int Decrypt(string word2) { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * Encrypter obj = new Encrypter(keys, values, dictionary); + * string param_1 = obj.Encrypt(word1); + * int param_2 = obj.Decrypt(word2); + */","/** + * @param {character[]} keys + * @param {string[]} values + * @param {string[]} dictionary + */ +var Encrypter = function(keys, values, dictionary) { + +}; + +/** + * @param {string} word1 + * @return {string} + */ +Encrypter.prototype.encrypt = function(word1) { + +}; + +/** + * @param {string} word2 + * @return {number} + */ +Encrypter.prototype.decrypt = function(word2) { + +}; + +/** + * Your Encrypter object will be instantiated and called as such: + * var obj = new Encrypter(keys, values, dictionary) + * var param_1 = obj.encrypt(word1) + * var param_2 = obj.decrypt(word2) + */","class Encrypter + +=begin + :type keys: Character[] + :type values: String[] + :type dictionary: String[] +=end + def initialize(keys, values, dictionary) + + end + + +=begin + :type word1: String + :rtype: String +=end + def encrypt(word1) + + end + + +=begin + :type word2: String + :rtype: Integer +=end + def decrypt(word2) + + end + + +end + +# Your Encrypter object will be instantiated and called as such: +# obj = Encrypter.new(keys, values, dictionary) +# param_1 = obj.encrypt(word1) +# param_2 = obj.decrypt(word2)"," +class Encrypter { + + init(_ keys: [Character], _ values: [String], _ dictionary: [String]) { + + } + + func encrypt(_ word1: String) -> String { + + } + + func decrypt(_ word2: String) -> Int { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * let obj = Encrypter(keys, values, dictionary) + * let ret_1: String = obj.encrypt(word1) + * let ret_2: Int = obj.decrypt(word2) + */","type Encrypter struct { + +} + + +func Constructor(keys []byte, values []string, dictionary []string) Encrypter { + +} + + +func (this *Encrypter) Encrypt(word1 string) string { + +} + + +func (this *Encrypter) Decrypt(word2 string) int { + +} + + +/** + * Your Encrypter object will be instantiated and called as such: + * obj := Constructor(keys, values, dictionary); + * param_1 := obj.Encrypt(word1); + * param_2 := obj.Decrypt(word2); + */","class Encrypter(_keys: Array[Char], _values: Array[String], _dictionary: Array[String]) { + + def encrypt(word1: String): String = { + + } + + def decrypt(word2: String): Int = { + + } + +} + +/** + * Your Encrypter object will be instantiated and called as such: + * var obj = new Encrypter(keys, values, dictionary) + * var param_1 = obj.encrypt(word1) + * var param_2 = obj.decrypt(word2) + */","class Encrypter(keys: CharArray, values: Array, dictionary: Array) { + + fun encrypt(word1: String): String { + + } + + fun decrypt(word2: String): Int { + + } + +} + +/** + * Your Encrypter object will be instantiated and called as such: + * var obj = Encrypter(keys, values, dictionary) + * var param_1 = obj.encrypt(word1) + * var param_2 = obj.decrypt(word2) + */","struct Encrypter { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Encrypter { + + fn new(keys: Vec, values: Vec, dictionary: Vec) -> Self { + + } + + fn encrypt(&self, word1: String) -> String { + + } + + fn decrypt(&self, word2: String) -> i32 { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * let obj = Encrypter::new(keys, values, dictionary); + * let ret_1: String = obj.encrypt(word1); + * let ret_2: i32 = obj.decrypt(word2); + */","class Encrypter { + /** + * @param String[] $keys + * @param String[] $values + * @param String[] $dictionary + */ + function __construct($keys, $values, $dictionary) { + + } + + /** + * @param String $word1 + * @return String + */ + function encrypt($word1) { + + } + + /** + * @param String $word2 + * @return Integer + */ + function decrypt($word2) { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * $obj = Encrypter($keys, $values, $dictionary); + * $ret_1 = $obj->encrypt($word1); + * $ret_2 = $obj->decrypt($word2); + */","class Encrypter { + constructor(keys: string[], values: string[], dictionary: string[]) { + + } + + encrypt(word1: string): string { + + } + + decrypt(word2: string): number { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * var obj = new Encrypter(keys, values, dictionary) + * var param_1 = obj.encrypt(word1) + * var param_2 = obj.decrypt(word2) + */","(define encrypter% + (class object% + (super-new) + + ; keys : (listof char?) + ; values : (listof string?) + ; dictionary : (listof string?) + (init-field + keys + values + dictionary) + + ; encrypt : string? -> string? + (define/public (encrypt word1) + + ) + ; decrypt : string? -> exact-integer? + (define/public (decrypt word2) + + ))) + +;; Your encrypter% object will be instantiated and called as such: +;; (define obj (new encrypter% [keys keys] [values values] [dictionary dictionary])) +;; (define param_1 (send obj encrypt word1)) +;; (define param_2 (send obj decrypt word2))","-spec encrypter_init_(Keys :: [char()], Values :: [unicode:unicode_binary()], Dictionary :: [unicode:unicode_binary()]) -> any(). +encrypter_init_(Keys, Values, Dictionary) -> + . + +-spec encrypter_encrypt(Word1 :: unicode:unicode_binary()) -> unicode:unicode_binary(). +encrypter_encrypt(Word1) -> + . + +-spec encrypter_decrypt(Word2 :: unicode:unicode_binary()) -> integer(). +encrypter_decrypt(Word2) -> + . + + +%% Your functions will be called as such: +%% encrypter_init_(Keys, Values, Dictionary), +%% Param_1 = encrypter_encrypt(Word1), +%% Param_2 = encrypter_decrypt(Word2), + +%% encrypter_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Encrypter do + @spec init_(keys :: [char], values :: [String.t], dictionary :: [String.t]) :: any + def init_(keys, values, dictionary) do + + end + + @spec encrypt(word1 :: String.t) :: String.t + def encrypt(word1) do + + end + + @spec decrypt(word2 :: String.t) :: integer + def decrypt(word2) do + + end +end + +# Your functions will be called as such: +# Encrypter.init_(keys, values, dictionary) +# param_1 = Encrypter.encrypt(word1) +# param_2 = Encrypter.decrypt(word2) + +# Encrypter.init_ will be called before every test case, in which you can do some necessary initializations.","class Encrypter { + + Encrypter(List keys, List values, List dictionary) { + + } + + String encrypt(String word1) { + + } + + int decrypt(String word2) { + + } +} + +/** + * Your Encrypter object will be instantiated and called as such: + * Encrypter obj = Encrypter(keys, values, dictionary); + * String param1 = obj.encrypt(word1); + * int param2 = obj.decrypt(word2); + */", +1079,all-ancestors-of-a-node-in-a-directed-acyclic-graph,All Ancestors of a Node in a Directed Acyclic Graph,2192.0,1431.0,"

You are given a positive integer n representing the number of nodes of a Directed Acyclic Graph (DAG). The nodes are numbered from 0 to n - 1 (inclusive).

+ +

You are also given a 2D integer array edges, where edges[i] = [fromi, toi] denotes that there is a unidirectional edge from fromi to toi in the graph.

+ +

Return a list answer, where answer[i] is the list of ancestors of the ith node, sorted in ascending order.

+ +

A node u is an ancestor of another node v if u can reach v via a set of edges.

+ +

 

+

Example 1:

+ +
+Input: n = 8, edgeList = [[0,3],[0,4],[1,3],[2,4],[2,7],[3,5],[3,6],[3,7],[4,6]]
+Output: [[],[],[],[0,1],[0,2],[0,1,3],[0,1,2,3,4],[0,1,2,3]]
+Explanation:
+The above diagram represents the input graph.
+- Nodes 0, 1, and 2 do not have any ancestors.
+- Node 3 has two ancestors 0 and 1.
+- Node 4 has two ancestors 0 and 2.
+- Node 5 has three ancestors 0, 1, and 3.
+- Node 6 has five ancestors 0, 1, 2, 3, and 4.
+- Node 7 has four ancestors 0, 1, 2, and 3.
+
+ +

Example 2:

+ +
+Input: n = 5, edgeList = [[0,1],[0,2],[0,3],[0,4],[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]
+Output: [[],[0],[0,1],[0,1,2],[0,1,2,3]]
+Explanation:
+The above diagram represents the input graph.
+- Node 0 does not have any ancestor.
+- Node 1 has one ancestor 0.
+- Node 2 has two ancestors 0 and 1.
+- Node 3 has three ancestors 0, 1, and 2.
+- Node 4 has four ancestors 0, 1, 2, and 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
  • 0 <= edges.length <= min(2000, n * (n - 1) / 2)
    • +
  • edges[i].length == 2
    • +
  • 0 <= fromi, toi <= n - 1
    • +
  • fromi != toi
    • +
  • There are no duplicate edges.
    • +
  • The graph is directed and acyclic.
    • +
+",2.0,False,"class Solution { +public: + vector> getAncestors(int n, vector>& edges) { + + } +};","class Solution { + public List> getAncestors(int n, int[][] edges) { + + } +}","class Solution(object): + def getAncestors(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def getAncestors(self, n: int, edges: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** getAncestors(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> GetAncestors(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number[][]} + */ +var getAncestors = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer[][]} +def get_ancestors(n, edges) + +end","class Solution { + func getAncestors(_ n: Int, _ edges: [[Int]]) -> [[Int]] { + + } +}","func getAncestors(n int, edges [][]int) [][]int { + +}","object Solution { + def getAncestors(n: Int, edges: Array[Array[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun getAncestors(n: Int, edges: Array): List> { + + } +}","impl Solution { + pub fn get_ancestors(n: i32, edges: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer[][] + */ + function getAncestors($n, $edges) { + + } +}","function getAncestors(n: number, edges: number[][]): number[][] { + +};","(define/contract (get-ancestors n edges) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec get_ancestors(N :: integer(), Edges :: [[integer()]]) -> [[integer()]]. +get_ancestors(N, Edges) -> + .","defmodule Solution do + @spec get_ancestors(n :: integer, edges :: [[integer]]) :: [[integer]] + def get_ancestors(n, edges) do + + end +end","class Solution { + List> getAncestors(int n, List> edges) { + + } +}", +1080,find-the-k-beauty-of-a-number,Find the K-Beauty of a Number,2269.0,1430.0,"

The k-beauty of an integer num is defined as the number of substrings of num when it is read as a string that meet the following conditions:

+ +
    +
  • It has a length of k.
    • +
  • It is a divisor of num.
    • +
+ +

Given integers num and k, return the k-beauty of num.

+ +

Note:

+ +
    +
  • Leading zeros are allowed.
    • +
  • 0 is not a divisor of any value.
    • +
+ +

A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: num = 240, k = 2
+Output: 2
+Explanation: The following are the substrings of num of length k:
+- "24" from "240": 24 is a divisor of 240.
+- "40" from "240": 40 is a divisor of 240.
+Therefore, the k-beauty is 2.
+
+ +

Example 2:

+ +
+Input: num = 430043, k = 2
+Output: 2
+Explanation: The following are the substrings of num of length k:
+- "43" from "430043": 43 is a divisor of 430043.
+- "30" from "430043": 30 is not a divisor of 430043.
+- "00" from "430043": 0 is not a divisor of 430043.
+- "04" from "430043": 4 is not a divisor of 430043.
+- "43" from "430043": 43 is a divisor of 430043.
+Therefore, the k-beauty is 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num <= 109
    • +
  • 1 <= k <= num.length (taking num as a string)
    • +
+",1.0,False,"class Solution { +public: + int divisorSubstrings(int num, int k) { + + } +};","class Solution { + public int divisorSubstrings(int num, int k) { + + } +}","class Solution(object): + def divisorSubstrings(self, num, k): + """""" + :type num: int + :type k: int + :rtype: int + """""" + ","class Solution: + def divisorSubstrings(self, num: int, k: int) -> int: + ","int divisorSubstrings(int num, int k){ + +}","public class Solution { + public int DivisorSubstrings(int num, int k) { + + } +}","/** + * @param {number} num + * @param {number} k + * @return {number} + */ +var divisorSubstrings = function(num, k) { + +};","# @param {Integer} num +# @param {Integer} k +# @return {Integer} +def divisor_substrings(num, k) + +end","class Solution { + func divisorSubstrings(_ num: Int, _ k: Int) -> Int { + + } +}","func divisorSubstrings(num int, k int) int { + +}","object Solution { + def divisorSubstrings(num: Int, k: Int): Int = { + + } +}","class Solution { + fun divisorSubstrings(num: Int, k: Int): Int { + + } +}","impl Solution { + pub fn divisor_substrings(num: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num + * @param Integer $k + * @return Integer + */ + function divisorSubstrings($num, $k) { + + } +}","function divisorSubstrings(num: number, k: number): number { + +};","(define/contract (divisor-substrings num k) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec divisor_substrings(Num :: integer(), K :: integer()) -> integer(). +divisor_substrings(Num, K) -> + .","defmodule Solution do + @spec divisor_substrings(num :: integer, k :: integer) :: integer + def divisor_substrings(num, k) do + + end +end","class Solution { + int divisorSubstrings(int num, int k) { + + } +}", +1081,verbal-arithmetic-puzzle,Verbal Arithmetic Puzzle,1307.0,1429.0,"

Given an equation, represented by words on the left side and the result on the right side.

+ +

You need to check if the equation is solvable under the following rules:

+ +
    +
  • Each character is decoded as one digit (0 - 9).
    • +
  • No two characters can map to the same digit.
    • +
  • Each words[i] and result are decoded as one number without leading zeros.
    • +
  • Sum of numbers on the left side (words) will equal to the number on the right side (result).
    • +
+ +

Return true if the equation is solvable, otherwise return false.

+ +

 

+

Example 1:

+ +
+Input: words = ["SEND","MORE"], result = "MONEY"
+Output: true
+Explanation: Map 'S'-> 9, 'E'->5, 'N'->6, 'D'->7, 'M'->1, 'O'->0, 'R'->8, 'Y'->'2'
+Such that: "SEND" + "MORE" = "MONEY" ,  9567 + 1085 = 10652
+ +

Example 2:

+ +
+Input: words = ["SIX","SEVEN","SEVEN"], result = "TWENTY"
+Output: true
+Explanation: Map 'S'-> 6, 'I'->5, 'X'->0, 'E'->8, 'V'->7, 'N'->2, 'T'->1, 'W'->'3', 'Y'->4
+Such that: "SIX" + "SEVEN" + "SEVEN" = "TWENTY" ,  650 + 68782 + 68782 = 138214
+ +

Example 3:

+ +
+Input: words = ["LEET","CODE"], result = "POINT"
+Output: false
+Explanation: There is no possible mapping to satisfy the equation, so we return false.
+Note that two different characters cannot map to the same digit.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= words.length <= 5
    • +
  • 1 <= words[i].length, result.length <= 7
    • +
  • words[i], result contain only uppercase English letters.
    • +
  • The number of different characters used in the expression is at most 10.
    • +
+",3.0,False,"class Solution { +public: + bool isSolvable(vector& words, string result) { + + } +};","class Solution { + public boolean isSolvable(String[] words, String result) { + + } +}","class Solution(object): + def isSolvable(self, words, result): + """""" + :type words: List[str] + :type result: str + :rtype: bool + """""" + ","class Solution: + def isSolvable(self, words: List[str], result: str) -> bool: + ","bool isSolvable(char ** words, int wordsSize, char * result){ + +}","public class Solution { + public bool IsSolvable(string[] words, string result) { + + } +}","/** + * @param {string[]} words + * @param {string} result + * @return {boolean} + */ +var isSolvable = function(words, result) { + +};","# @param {String[]} words +# @param {String} result +# @return {Boolean} +def is_solvable(words, result) + +end","class Solution { + func isSolvable(_ words: [String], _ result: String) -> Bool { + + } +}","func isSolvable(words []string, result string) bool { + +}","object Solution { + def isSolvable(words: Array[String], result: String): Boolean = { + + } +}","class Solution { + fun isSolvable(words: Array, result: String): Boolean { + + } +}","impl Solution { + pub fn is_solvable(words: Vec, result: String) -> bool { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String $result + * @return Boolean + */ + function isSolvable($words, $result) { + + } +}","function isSolvable(words: string[], result: string): boolean { + +};","(define/contract (is-solvable words result) + (-> (listof string?) string? boolean?) + + )","-spec is_solvable(Words :: [unicode:unicode_binary()], Result :: unicode:unicode_binary()) -> boolean(). +is_solvable(Words, Result) -> + .","defmodule Solution do + @spec is_solvable(words :: [String.t], result :: String.t) :: boolean + def is_solvable(words, result) do + + end +end","class Solution { + bool isSolvable(List words, String result) { + + } +}", +1082,jump-game-iii,Jump Game III,1306.0,1428.0,"

Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach any index with value 0.

+ +

Notice that you can not jump outside of the array at any time.

+ +

 

+

Example 1:

+ +
+Input: arr = [4,2,3,0,3,1,2], start = 5
+Output: true
+Explanation: 
+All possible ways to reach at index 3 with value 0 are: 
+index 5 -> index 4 -> index 1 -> index 3 
+index 5 -> index 6 -> index 4 -> index 1 -> index 3 
+
+ +

Example 2:

+ +
+Input: arr = [4,2,3,0,3,1,2], start = 0
+Output: true 
+Explanation: 
+One possible way to reach at index 3 with value 0 is: 
+index 0 -> index 4 -> index 1 -> index 3
+
+ +

Example 3:

+ +
+Input: arr = [3,0,2,1,2], start = 2
+Output: false
+Explanation: There is no way to reach at index 1 with value 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 5 * 104
    • +
  • 0 <= arr[i] < arr.length
    • +
  • 0 <= start < arr.length
    • +
+",2.0,False,"class Solution { +public: + bool canReach(vector& arr, int start) { + + } +};","class Solution { + public boolean canReach(int[] arr, int start) { + + } +}","class Solution(object): + def canReach(self, arr, start): + """""" + :type arr: List[int] + :type start: int + :rtype: bool + """""" + ","class Solution: + def canReach(self, arr: List[int], start: int) -> bool: + ","bool canReach(int* arr, int arrSize, int start){ + +}","public class Solution { + public bool CanReach(int[] arr, int start) { + + } +}","/** + * @param {number[]} arr + * @param {number} start + * @return {boolean} + */ +var canReach = function(arr, start) { + +};","# @param {Integer[]} arr +# @param {Integer} start +# @return {Boolean} +def can_reach(arr, start) + +end","class Solution { + func canReach(_ arr: [Int], _ start: Int) -> Bool { + + } +}","func canReach(arr []int, start int) bool { + +}","object Solution { + def canReach(arr: Array[Int], start: Int): Boolean = { + + } +}","class Solution { + fun canReach(arr: IntArray, start: Int): Boolean { + + } +}","impl Solution { + pub fn can_reach(arr: Vec, start: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $start + * @return Boolean + */ + function canReach($arr, $start) { + + } +}","function canReach(arr: number[], start: number): boolean { + +};","(define/contract (can-reach arr start) + (-> (listof exact-integer?) exact-integer? boolean?) + + )","-spec can_reach(Arr :: [integer()], Start :: integer()) -> boolean(). +can_reach(Arr, Start) -> + .","defmodule Solution do + @spec can_reach(arr :: [integer], start :: integer) :: boolean + def can_reach(arr, start) do + + end +end","class Solution { + bool canReach(List arr, int start) { + + } +}", +1083,all-elements-in-two-binary-search-trees,All Elements in Two Binary Search Trees,1305.0,1427.0,"

Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.

+ +

 

+

Example 1:

+ +
+Input: root1 = [2,1,4], root2 = [1,0,3]
+Output: [0,1,1,2,3,4]
+
+ +

Example 2:

+ +
+Input: root1 = [1,null,8], root2 = [8,1]
+Output: [1,1,8,8]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in each tree is in the range [0, 5000].
    • +
  • -105 <= Node.val <= 105
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector getAllElements(TreeNode* root1, TreeNode* root2) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List getAllElements(TreeNode root1, TreeNode root2) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def getAllElements(self, root1, root2): + """""" + :type root1: TreeNode + :type root2: TreeNode + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def getAllElements(self, root1: TreeNode, root2: TreeNode) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* getAllElements(struct TreeNode* root1, struct TreeNode* root2, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList GetAllElements(TreeNode root1, TreeNode root2) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root1 + * @param {TreeNode} root2 + * @return {number[]} + */ +var getAllElements = function(root1, root2) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root1 +# @param {TreeNode} root2 +# @return {Integer[]} +def get_all_elements(root1, root2) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func getAllElements(_ root1: TreeNode?, _ root2: TreeNode?) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func getAllElements(root1 *TreeNode, root2 *TreeNode) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def getAllElements(root1: TreeNode, root2: TreeNode): List[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun getAllElements(root1: TreeNode?, root2: TreeNode?): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn get_all_elements(root1: Option>>, root2: Option>>) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root1 + * @param TreeNode $root2 + * @return Integer[] + */ + function getAllElements($root1, $root2) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function getAllElements(root1: TreeNode | null, root2: TreeNode | null): number[] { + +};",,,,"/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List getAllElements(TreeNode? root1, TreeNode? root2) { + + } +}", +1084,find-n-unique-integers-sum-up-to-zero,Find N Unique Integers Sum up to Zero,1304.0,1426.0,"

Given an integer n, return any array containing n unique integers such that they add up to 0.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: [-7,-1,1,3,4]
+Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: [-1,0,1]
+
+ +

Example 3:

+ +
+Input: n = 1
+Output: [0]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",1.0,False,"class Solution { +public: + vector sumZero(int n) { + + } +};","class Solution { + public int[] sumZero(int n) { + + } +}","class Solution(object): + def sumZero(self, n): + """""" + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def sumZero(self, n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sumZero(int n, int* returnSize){ + +}","public class Solution { + public int[] SumZero(int n) { + + } +}","/** + * @param {number} n + * @return {number[]} + */ +var sumZero = function(n) { + +};","# @param {Integer} n +# @return {Integer[]} +def sum_zero(n) + +end","class Solution { + func sumZero(_ n: Int) -> [Int] { + + } +}","func sumZero(n int) []int { + +}","object Solution { + def sumZero(n: Int): Array[Int] = { + + } +}","class Solution { + fun sumZero(n: Int): IntArray { + + } +}","impl Solution { + pub fn sum_zero(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer[] + */ + function sumZero($n) { + + } +}","function sumZero(n: number): number[] { + +};","(define/contract (sum-zero n) + (-> exact-integer? (listof exact-integer?)) + + )","-spec sum_zero(N :: integer()) -> [integer()]. +sum_zero(N) -> + .","defmodule Solution do + @spec sum_zero(n :: integer) :: [integer] + def sum_zero(n) do + + end +end","class Solution { + List sumZero(int n) { + + } +}", +1085,maximum-candies-you-can-get-from-boxes,Maximum Candies You Can Get from Boxes,1298.0,1424.0,"

You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where:

+ +
    +
  • status[i] is 1 if the ith box is open and 0 if the ith box is closed,
    • +
  • candies[i] is the number of candies in the ith box,
    • +
  • keys[i] is a list of the labels of the boxes you can open after opening the ith box.
    • +
  • containedBoxes[i] is a list of the boxes you found inside the ith box.
    • +
+ +

You are given an integer array initialBoxes that contains the labels of the boxes you initially have. You can take all the candies in any open box and you can use the keys in it to open new boxes and you also can use the boxes you find in it.

+ +

Return the maximum number of candies you can get following the rules above.

+ +

 

+

Example 1:

+ +
+Input: status = [1,0,1,0], candies = [7,5,4,100], keys = [[],[],[1],[]], containedBoxes = [[1,2],[3],[],[]], initialBoxes = [0]
+Output: 16
+Explanation: You will be initially given box 0. You will find 7 candies in it and boxes 1 and 2.
+Box 1 is closed and you do not have a key for it so you will open box 2. You will find 4 candies and a key to box 1 in box 2.
+In box 1, you will find 5 candies and box 3 but you will not find a key to box 3 so box 3 will remain closed.
+Total number of candies collected = 7 + 4 + 5 = 16 candy.
+
+ +

Example 2:

+ +
+Input: status = [1,0,0,0,0,0], candies = [1,1,1,1,1,1], keys = [[1,2,3,4,5],[],[],[],[],[]], containedBoxes = [[1,2,3,4,5],[],[],[],[],[]], initialBoxes = [0]
+Output: 6
+Explanation: You have initially box 0. Opening it you can find boxes 1,2,3,4 and 5 and their keys.
+The total number of candies will be 6.
+
+ +

 

+

Constraints:

+ +
    +
  • n == status.length == candies.length == keys.length == containedBoxes.length
    • +
  • 1 <= n <= 1000
    • +
  • status[i] is either 0 or 1.
    • +
  • 1 <= candies[i] <= 1000
    • +
  • 0 <= keys[i].length <= n
    • +
  • 0 <= keys[i][j] < n
    • +
  • All values of keys[i] are unique.
    • +
  • 0 <= containedBoxes[i].length <= n
    • +
  • 0 <= containedBoxes[i][j] < n
    • +
  • All values of containedBoxes[i] are unique.
    • +
  • Each box is contained in one box at most.
    • +
  • 0 <= initialBoxes.length <= n
    • +
  • 0 <= initialBoxes[i] < n
    • +
+",3.0,False,"class Solution { +public: + int maxCandies(vector& status, vector& candies, vector>& keys, vector>& containedBoxes, vector& initialBoxes) { + + } +};","class Solution { + public int maxCandies(int[] status, int[] candies, int[][] keys, int[][] containedBoxes, int[] initialBoxes) { + + } +}","class Solution(object): + def maxCandies(self, status, candies, keys, containedBoxes, initialBoxes): + """""" + :type status: List[int] + :type candies: List[int] + :type keys: List[List[int]] + :type containedBoxes: List[List[int]] + :type initialBoxes: List[int] + :rtype: int + """""" + ","class Solution: + def maxCandies(self, status: List[int], candies: List[int], keys: List[List[int]], containedBoxes: List[List[int]], initialBoxes: List[int]) -> int: + ","int maxCandies(int* status, int statusSize, int* candies, int candiesSize, int** keys, int keysSize, int* keysColSize, int** containedBoxes, int containedBoxesSize, int* containedBoxesColSize, int* initialBoxes, int initialBoxesSize){ + +}","public class Solution { + public int MaxCandies(int[] status, int[] candies, int[][] keys, int[][] containedBoxes, int[] initialBoxes) { + + } +}","/** + * @param {number[]} status + * @param {number[]} candies + * @param {number[][]} keys + * @param {number[][]} containedBoxes + * @param {number[]} initialBoxes + * @return {number} + */ +var maxCandies = function(status, candies, keys, containedBoxes, initialBoxes) { + +};","# @param {Integer[]} status +# @param {Integer[]} candies +# @param {Integer[][]} keys +# @param {Integer[][]} contained_boxes +# @param {Integer[]} initial_boxes +# @return {Integer} +def max_candies(status, candies, keys, contained_boxes, initial_boxes) + +end","class Solution { + func maxCandies(_ status: [Int], _ candies: [Int], _ keys: [[Int]], _ containedBoxes: [[Int]], _ initialBoxes: [Int]) -> Int { + + } +}","func maxCandies(status []int, candies []int, keys [][]int, containedBoxes [][]int, initialBoxes []int) int { + +}","object Solution { + def maxCandies(status: Array[Int], candies: Array[Int], keys: Array[Array[Int]], containedBoxes: Array[Array[Int]], initialBoxes: Array[Int]): Int = { + + } +}","class Solution { + fun maxCandies(status: IntArray, candies: IntArray, keys: Array, containedBoxes: Array, initialBoxes: IntArray): Int { + + } +}","impl Solution { + pub fn max_candies(status: Vec, candies: Vec, keys: Vec>, contained_boxes: Vec>, initial_boxes: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $status + * @param Integer[] $candies + * @param Integer[][] $keys + * @param Integer[][] $containedBoxes + * @param Integer[] $initialBoxes + * @return Integer + */ + function maxCandies($status, $candies, $keys, $containedBoxes, $initialBoxes) { + + } +}","function maxCandies(status: number[], candies: number[], keys: number[][], containedBoxes: number[][], initialBoxes: number[]): number { + +};",,,,"class Solution { + int maxCandies(List status, List candies, List> keys, List> containedBoxes, List initialBoxes) { + + } +}", +1086,maximum-number-of-occurrences-of-a-substring,Maximum Number of Occurrences of a Substring,1297.0,1423.0,"

Given a string s, return the maximum number of occurrences of any substring under the following rules:

+ +
    +
  • The number of unique characters in the substring must be less than or equal to maxLetters.
    • +
  • The substring size must be between minSize and maxSize inclusive.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "aababcaab", maxLetters = 2, minSize = 3, maxSize = 4
+Output: 2
+Explanation: Substring "aab" has 2 occurrences in the original string.
+It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize).
+
+ +

Example 2:

+ +
+Input: s = "aaaa", maxLetters = 1, minSize = 3, maxSize = 3
+Output: 2
+Explanation: Substring "aaa" occur 2 times in the string. It can overlap.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • 1 <= maxLetters <= 26
    • +
  • 1 <= minSize <= maxSize <= min(26, s.length)
    • +
  • s consists of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int maxFreq(string s, int maxLetters, int minSize, int maxSize) { + + } +};","class Solution { + public int maxFreq(String s, int maxLetters, int minSize, int maxSize) { + + } +}","class Solution(object): + def maxFreq(self, s, maxLetters, minSize, maxSize): + """""" + :type s: str + :type maxLetters: int + :type minSize: int + :type maxSize: int + :rtype: int + """""" + ","class Solution: + def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: + ","int maxFreq(char * s, int maxLetters, int minSize, int maxSize){ + +}","public class Solution { + public int MaxFreq(string s, int maxLetters, int minSize, int maxSize) { + + } +}","/** + * @param {string} s + * @param {number} maxLetters + * @param {number} minSize + * @param {number} maxSize + * @return {number} + */ +var maxFreq = function(s, maxLetters, minSize, maxSize) { + +};","# @param {String} s +# @param {Integer} max_letters +# @param {Integer} min_size +# @param {Integer} max_size +# @return {Integer} +def max_freq(s, max_letters, min_size, max_size) + +end","class Solution { + func maxFreq(_ s: String, _ maxLetters: Int, _ minSize: Int, _ maxSize: Int) -> Int { + + } +}","func maxFreq(s string, maxLetters int, minSize int, maxSize int) int { + +}","object Solution { + def maxFreq(s: String, maxLetters: Int, minSize: Int, maxSize: Int): Int = { + + } +}","class Solution { + fun maxFreq(s: String, maxLetters: Int, minSize: Int, maxSize: Int): Int { + + } +}","impl Solution { + pub fn max_freq(s: String, max_letters: i32, min_size: i32, max_size: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $maxLetters + * @param Integer $minSize + * @param Integer $maxSize + * @return Integer + */ + function maxFreq($s, $maxLetters, $minSize, $maxSize) { + + } +}","function maxFreq(s: string, maxLetters: number, minSize: number, maxSize: number): number { + +};",,,,"class Solution { + int maxFreq(String s, int maxLetters, int minSize, int maxSize) { + + } +}", +1090,shortest-path-in-a-grid-with-obstacles-elimination,Shortest Path in a Grid with Obstacles Elimination,1293.0,1414.0,"

You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step.

+ +

Return the minimum number of steps to walk from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1) given that you can eliminate at most k obstacles. If it is not possible to find such walk return -1.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1
+Output: 6
+Explanation: 
+The shortest path without eliminating any obstacle is 10.
+The shortest path with one obstacle elimination at position (3,2) is 6. Such path is (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2).
+
+ +

Example 2:

+ +
+Input: grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1
+Output: -1
+Explanation: We need to eliminate at least two obstacles to find such a walk.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 40
    • +
  • 1 <= k <= m * n
    • +
  • grid[i][j] is either 0 or 1.
    • +
  • grid[0][0] == grid[m - 1][n - 1] == 0
    • +
+",3.0,False,"class Solution { +public: + int shortestPath(vector>& grid, int k) { + + } +};","class Solution { + public int shortestPath(int[][] grid, int k) { + + } +}","class Solution(object): + def shortestPath(self, grid, k): + """""" + :type grid: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def shortestPath(self, grid: List[List[int]], k: int) -> int: + ","int shortestPath(int** grid, int gridSize, int* gridColSize, int k){ + +}","public class Solution { + public int ShortestPath(int[][] grid, int k) { + + } +}","/** + * @param {number[][]} grid + * @param {number} k + * @return {number} + */ +var shortestPath = function(grid, k) { + +};","# @param {Integer[][]} grid +# @param {Integer} k +# @return {Integer} +def shortest_path(grid, k) + +end","class Solution { + func shortestPath(_ grid: [[Int]], _ k: Int) -> Int { + + } +}","func shortestPath(grid [][]int, k int) int { + +}","object Solution { + def shortestPath(grid: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun shortestPath(grid: Array, k: Int): Int { + + } +}","impl Solution { + pub fn shortest_path(grid: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer $k + * @return Integer + */ + function shortestPath($grid, $k) { + + } +}","function shortestPath(grid: number[][], k: number): number { + +};","(define/contract (shortest-path grid k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec shortest_path(Grid :: [[integer()]], K :: integer()) -> integer(). +shortest_path(Grid, K) -> + .","defmodule Solution do + @spec shortest_path(grid :: [[integer]], k :: integer) :: integer + def shortest_path(grid, k) do + + end +end","class Solution { + int shortestPath(List> grid, int k) { + + } +}", +1091,maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold,Maximum Side Length of a Square with Sum Less than or Equal to Threshold,1292.0,1413.0,"

Given a m x n matrix mat and an integer threshold, return the maximum side-length of a square with a sum less than or equal to threshold or return 0 if there is no such square.

+ +

 

+

Example 1:

+ +
+Input: mat = [[1,1,3,2,4,3,2],[1,1,3,2,4,3,2],[1,1,3,2,4,3,2]], threshold = 4
+Output: 2
+Explanation: The maximum side length of square with sum less than 4 is 2 as shown.
+
+ +

Example 2:

+ +
+Input: mat = [[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2],[2,2,2,2,2]], threshold = 1
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length
    • +
  • n == mat[i].length
    • +
  • 1 <= m, n <= 300
    • +
  • 0 <= mat[i][j] <= 104
    • +
  • 0 <= threshold <= 105
    • +
+",2.0,False,"class Solution { +public: + int maxSideLength(vector>& mat, int threshold) { + + } +};","class Solution { + public int maxSideLength(int[][] mat, int threshold) { + + } +}","class Solution(object): + def maxSideLength(self, mat, threshold): + """""" + :type mat: List[List[int]] + :type threshold: int + :rtype: int + """""" + ","class Solution: + def maxSideLength(self, mat: List[List[int]], threshold: int) -> int: + ","int maxSideLength(int** mat, int matSize, int* matColSize, int threshold){ + +}","public class Solution { + public int MaxSideLength(int[][] mat, int threshold) { + + } +}","/** + * @param {number[][]} mat + * @param {number} threshold + * @return {number} + */ +var maxSideLength = function(mat, threshold) { + +};","# @param {Integer[][]} mat +# @param {Integer} threshold +# @return {Integer} +def max_side_length(mat, threshold) + +end","class Solution { + func maxSideLength(_ mat: [[Int]], _ threshold: Int) -> Int { + + } +}","func maxSideLength(mat [][]int, threshold int) int { + +}","object Solution { + def maxSideLength(mat: Array[Array[Int]], threshold: Int): Int = { + + } +}","class Solution { + fun maxSideLength(mat: Array, threshold: Int): Int { + + } +}","impl Solution { + pub fn max_side_length(mat: Vec>, threshold: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @param Integer $threshold + * @return Integer + */ + function maxSideLength($mat, $threshold) { + + } +}","function maxSideLength(mat: number[][], threshold: number): number { + +};",,,,"class Solution { + int maxSideLength(List> mat, int threshold) { + + } +}", +1093,minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix,Minimum Number of Flips to Convert Binary Matrix to Zero Matrix,1284.0,1409.0,"

Given a m x n binary matrix mat. In one step, you can choose one cell and flip it and all the four neighbors of it if they exist (Flip is changing 1 to 0 and 0 to 1). A pair of cells are called neighbors if they share one edge.

+ +

Return the minimum number of steps required to convert mat to a zero matrix or -1 if you cannot.

+ +

A binary matrix is a matrix with all cells equal to 0 or 1 only.

+ +

A zero matrix is a matrix with all cells equal to 0.

+ +

 

+

Example 1:

+ +
+Input: mat = [[0,0],[0,1]]
+Output: 3
+Explanation: One possible solution is to flip (1, 0) then (0, 1) and finally (1, 1) as shown.
+
+ +

Example 2:

+ +
+Input: mat = [[0]]
+Output: 0
+Explanation: Given matrix is a zero matrix. We do not need to change it.
+
+ +

Example 3:

+ +
+Input: mat = [[1,0,0],[1,0,0]]
+Output: -1
+Explanation: Given matrix cannot be a zero matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • m == mat.length
    • +
  • n == mat[i].length
    • +
  • 1 <= m, n <= 3
    • +
  • mat[i][j] is either 0 or 1.
    • +
+",3.0,False,"class Solution { +public: + int minFlips(vector>& mat) { + + } +};","class Solution { + public int minFlips(int[][] mat) { + + } +}","class Solution(object): + def minFlips(self, mat): + """""" + :type mat: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minFlips(self, mat: List[List[int]]) -> int: + ","int minFlips(int** mat, int matSize, int* matColSize){ + +}","public class Solution { + public int MinFlips(int[][] mat) { + + } +}","/** + * @param {number[][]} mat + * @return {number} + */ +var minFlips = function(mat) { + +};","# @param {Integer[][]} mat +# @return {Integer} +def min_flips(mat) + +end","class Solution { + func minFlips(_ mat: [[Int]]) -> Int { + + } +}","func minFlips(mat [][]int) int { + +}","object Solution { + def minFlips(mat: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minFlips(mat: Array): Int { + + } +}","impl Solution { + pub fn min_flips(mat: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $mat + * @return Integer + */ + function minFlips($mat) { + + } +}","function minFlips(mat: number[][]): number { + +};","(define/contract (min-flips mat) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_flips(Mat :: [[integer()]]) -> integer(). +min_flips(Mat) -> + .","defmodule Solution do + @spec min_flips(mat :: [[integer]]) :: integer + def min_flips(mat) do + + end +end","class Solution { + int minFlips(List> mat) { + + } +}", +1097,palindrome-partitioning-iii,Palindrome Partitioning III,1278.0,1403.0,"

You are given a string s containing lowercase letters and an integer k. You need to :

+ +
    +
  • First, change some characters of s to other lowercase English letters.
    • +
  • Then divide s into k non-empty disjoint substrings such that each substring is a palindrome.
    • +
+ +

Return the minimal number of characters that you need to change to divide the string.

+ +

 

+

Example 1:

+ +
+Input: s = "abc", k = 2
+Output: 1
+Explanation: You can split the string into "ab" and "c", and change 1 character in "ab" to make it palindrome.
+
+ +

Example 2:

+ +
+Input: s = "aabbc", k = 3
+Output: 0
+Explanation: You can split the string into "aa", "bb" and "c", all of them are palindrome.
+ +

Example 3:

+ +
+Input: s = "leetcode", k = 8
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= s.length <= 100.
    • +
  • s only contains lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int palindromePartition(string s, int k) { + + } +};","class Solution { + public int palindromePartition(String s, int k) { + + } +}","class Solution(object): + def palindromePartition(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def palindromePartition(self, s: str, k: int) -> int: + ","int palindromePartition(char * s, int k){ + +}","public class Solution { + public int PalindromePartition(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var palindromePartition = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def palindrome_partition(s, k) + +end","class Solution { + func palindromePartition(_ s: String, _ k: Int) -> Int { + + } +}","func palindromePartition(s string, k int) int { + +}","object Solution { + def palindromePartition(s: String, k: Int): Int = { + + } +}","class Solution { + fun palindromePartition(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn palindrome_partition(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function palindromePartition($s, $k) { + + } +}","function palindromePartition(s: string, k: number): number { + +};","(define/contract (palindrome-partition s k) + (-> string? exact-integer? exact-integer?) + + )","-spec palindrome_partition(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +palindrome_partition(S, K) -> + .","defmodule Solution do + @spec palindrome_partition(s :: String.t, k :: integer) :: integer + def palindrome_partition(s, k) do + + end +end","class Solution { + int palindromePartition(String s, int k) { + + } +}", +1099,number-of-burgers-with-no-waste-of-ingredients,Number of Burgers with No Waste of Ingredients,1276.0,1401.0,"

Given two integers tomatoSlices and cheeseSlices. The ingredients of different burgers are as follows:

+ +
    +
  • Jumbo Burger: 4 tomato slices and 1 cheese slice.
    • +
  • Small Burger: 2 Tomato slices and 1 cheese slice.
    • +
+ +

Return [total_jumbo, total_small] so that the number of remaining tomatoSlices equal to 0 and the number of remaining cheeseSlices equal to 0. If it is not possible to make the remaining tomatoSlices and cheeseSlices equal to 0 return [].

+ +

 

+

Example 1:

+ +
+Input: tomatoSlices = 16, cheeseSlices = 7
+Output: [1,6]
+Explantion: To make one jumbo burger and 6 small burgers we need 4*1 + 2*6 = 16 tomato and 1 + 6 = 7 cheese.
+There will be no remaining ingredients.
+
+ +

Example 2:

+ +
+Input: tomatoSlices = 17, cheeseSlices = 4
+Output: []
+Explantion: There will be no way to use all ingredients to make small and jumbo burgers.
+
+ +

Example 3:

+ +
+Input: tomatoSlices = 4, cheeseSlices = 17
+Output: []
+Explantion: Making 1 jumbo burger there will be 16 cheese remaining and making 2 small burgers there will be 15 cheese remaining.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= tomatoSlices, cheeseSlices <= 107
    • +
+",2.0,False,"class Solution { +public: + vector numOfBurgers(int tomatoSlices, int cheeseSlices) { + + } +};","class Solution { + public List numOfBurgers(int tomatoSlices, int cheeseSlices) { + + } +}","class Solution(object): + def numOfBurgers(self, tomatoSlices, cheeseSlices): + """""" + :type tomatoSlices: int + :type cheeseSlices: int + :rtype: List[int] + """""" + ","class Solution: + def numOfBurgers(self, tomatoSlices: int, cheeseSlices: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* numOfBurgers(int tomatoSlices, int cheeseSlices, int* returnSize){ + +}","public class Solution { + public IList NumOfBurgers(int tomatoSlices, int cheeseSlices) { + + } +}","/** + * @param {number} tomatoSlices + * @param {number} cheeseSlices + * @return {number[]} + */ +var numOfBurgers = function(tomatoSlices, cheeseSlices) { + +};","# @param {Integer} tomato_slices +# @param {Integer} cheese_slices +# @return {Integer[]} +def num_of_burgers(tomato_slices, cheese_slices) + +end","class Solution { + func numOfBurgers(_ tomatoSlices: Int, _ cheeseSlices: Int) -> [Int] { + + } +}","func numOfBurgers(tomatoSlices int, cheeseSlices int) []int { + +}","object Solution { + def numOfBurgers(tomatoSlices: Int, cheeseSlices: Int): List[Int] = { + + } +}","class Solution { + fun numOfBurgers(tomatoSlices: Int, cheeseSlices: Int): List { + + } +}","impl Solution { + pub fn num_of_burgers(tomato_slices: i32, cheese_slices: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $tomatoSlices + * @param Integer $cheeseSlices + * @return Integer[] + */ + function numOfBurgers($tomatoSlices, $cheeseSlices) { + + } +}","function numOfBurgers(tomatoSlices: number, cheeseSlices: number): number[] { + +};",,,,"class Solution { + List numOfBurgers(int tomatoSlices, int cheeseSlices) { + + } +}", +1101,number-of-ways-to-stay-in-the-same-place-after-some-steps,Number of Ways to Stay in the Same Place After Some Steps,1269.0,1398.0,"

You have a pointer at index 0 in an array of size arrLen. At each step, you can move 1 position to the left, 1 position to the right in the array, or stay in the same place (The pointer should not be placed outside the array at any time).

+ +

Given two integers steps and arrLen, return the number of ways such that your pointer is still at index 0 after exactly steps steps. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: steps = 3, arrLen = 2
+Output: 4
+Explanation: There are 4 differents ways to stay at index 0 after 3 steps.
+Right, Left, Stay
+Stay, Right, Left
+Right, Stay, Left
+Stay, Stay, Stay
+
+ +

Example 2:

+ +
+Input: steps = 2, arrLen = 4
+Output: 2
+Explanation: There are 2 differents ways to stay at index 0 after 2 steps
+Right, Left
+Stay, Stay
+
+ +

Example 3:

+ +
+Input: steps = 4, arrLen = 2
+Output: 8
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= steps <= 500
    • +
  • 1 <= arrLen <= 106
    • +
+",3.0,False,"class Solution { +public: + int numWays(int steps, int arrLen) { + + } +};","class Solution { + public int numWays(int steps, int arrLen) { + + } +}","class Solution(object): + def numWays(self, steps, arrLen): + """""" + :type steps: int + :type arrLen: int + :rtype: int + """""" + ","class Solution: + def numWays(self, steps: int, arrLen: int) -> int: + ","int numWays(int steps, int arrLen){ + +}","public class Solution { + public int NumWays(int steps, int arrLen) { + + } +}","/** + * @param {number} steps + * @param {number} arrLen + * @return {number} + */ +var numWays = function(steps, arrLen) { + +};","# @param {Integer} steps +# @param {Integer} arr_len +# @return {Integer} +def num_ways(steps, arr_len) + +end","class Solution { + func numWays(_ steps: Int, _ arrLen: Int) -> Int { + + } +}","func numWays(steps int, arrLen int) int { + +}","object Solution { + def numWays(steps: Int, arrLen: Int): Int = { + + } +}","class Solution { + fun numWays(steps: Int, arrLen: Int): Int { + + } +}","impl Solution { + pub fn num_ways(steps: i32, arr_len: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $steps + * @param Integer $arrLen + * @return Integer + */ + function numWays($steps, $arrLen) { + + } +}","function numWays(steps: number, arrLen: number): number { + +};","(define/contract (num-ways steps arrLen) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec num_ways(Steps :: integer(), ArrLen :: integer()) -> integer(). +num_ways(Steps, ArrLen) -> + .","defmodule Solution do + @spec num_ways(steps :: integer, arr_len :: integer) :: integer + def num_ways(steps, arr_len) do + + end +end","class Solution { + int numWays(int steps, int arrLen) { + + } +}", +1102,search-suggestions-system,Search Suggestions System,1268.0,1397.0,"

You are given an array of strings products and a string searchWord.

+ +

Design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.

+ +

Return a list of lists of the suggested products after each character of searchWord is typed.

+ +

 

+

Example 1:

+ +
+Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
+Output: [["mobile","moneypot","monitor"],["mobile","moneypot","monitor"],["mouse","mousepad"],["mouse","mousepad"],["mouse","mousepad"]]
+Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"].
+After typing m and mo all products match and we show user ["mobile","moneypot","monitor"].
+After typing mou, mous and mouse the system suggests ["mouse","mousepad"].
+
+ +

Example 2:

+ +
+Input: products = ["havana"], searchWord = "havana"
+Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
+Explanation: The only word "havana" will be always suggested while typing the search word.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= products.length <= 1000
    • +
  • 1 <= products[i].length <= 3000
    • +
  • 1 <= sum(products[i].length) <= 2 * 104
    • +
  • All the strings of products are unique.
    • +
  • products[i] consists of lowercase English letters.
    • +
  • 1 <= searchWord.length <= 1000
    • +
  • searchWord consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector> suggestedProducts(vector& products, string searchWord) { + + } +};","class Solution { + public List> suggestedProducts(String[] products, String searchWord) { + + } +}","class Solution(object): + def suggestedProducts(self, products, searchWord): + """""" + :type products: List[str] + :type searchWord: str + :rtype: List[List[str]] + """""" + ","class Solution: + def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** suggestedProducts(char ** products, int productsSize, char * searchWord, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> SuggestedProducts(string[] products, string searchWord) { + + } +}","/** + * @param {string[]} products + * @param {string} searchWord + * @return {string[][]} + */ +var suggestedProducts = function(products, searchWord) { + +};","# @param {String[]} products +# @param {String} search_word +# @return {String[][]} +def suggested_products(products, search_word) + +end","class Solution { + func suggestedProducts(_ products: [String], _ searchWord: String) -> [[String]] { + + } +}","func suggestedProducts(products []string, searchWord string) [][]string { + +}","object Solution { + def suggestedProducts(products: Array[String], searchWord: String): List[List[String]] = { + + } +}","class Solution { + fun suggestedProducts(products: Array, searchWord: String): List> { + + } +}","impl Solution { + pub fn suggested_products(products: Vec, search_word: String) -> Vec> { + + } +}","class Solution { + + /** + * @param String[] $products + * @param String $searchWord + * @return String[][] + */ + function suggestedProducts($products, $searchWord) { + + } +}","function suggestedProducts(products: string[], searchWord: string): string[][] { + +};",,,,"class Solution { + List> suggestedProducts(List products, String searchWord) { + + } +}", +1104,minimum-time-visiting-all-points,Minimum Time Visiting All Points,1266.0,1395.0,"

On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the order given by points.

+ +

You can move according to these rules:

+ +
    +
  • In 1 second, you can either: + +
      +
    • move vertically by one unit,
      • +
    • move horizontally by one unit, or
      • +
    • move diagonally sqrt(2) units (in other words, move one unit vertically then one unit horizontally in 1 second).
      • +
    +
    • +
  • You have to visit the points in the same order as they appear in the array.
    • +
  • You are allowed to pass through points that appear later in the order, but these do not count as visits.
    • +
+ +

 

+

Example 1:

+ +
+Input: points = [[1,1],[3,4],[-1,0]]
+Output: 7
+Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]   
+Time from [1,1] to [3,4] = 3 seconds 
+Time from [3,4] to [-1,0] = 4 seconds
+Total time = 7 seconds
+ +

Example 2:

+ +
+Input: points = [[3,2],[-2,2]]
+Output: 5
+
+ +

 

+

Constraints:

+ +
    +
  • points.length == n
    • +
  • 1 <= n <= 100
    • +
  • points[i].length == 2
    • +
  • -1000 <= points[i][0], points[i][1] <= 1000
    • +
+",1.0,False,"class Solution { +public: + int minTimeToVisitAllPoints(vector>& points) { + + } +};","class Solution { + public int minTimeToVisitAllPoints(int[][] points) { + + } +}","class Solution(object): + def minTimeToVisitAllPoints(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int: + ","int minTimeToVisitAllPoints(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int MinTimeToVisitAllPoints(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var minTimeToVisitAllPoints = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def min_time_to_visit_all_points(points) + +end","class Solution { + func minTimeToVisitAllPoints(_ points: [[Int]]) -> Int { + + } +}","func minTimeToVisitAllPoints(points [][]int) int { + +}","object Solution { + def minTimeToVisitAllPoints(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minTimeToVisitAllPoints(points: Array): Int { + + } +}","impl Solution { + pub fn min_time_to_visit_all_points(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function minTimeToVisitAllPoints($points) { + + } +}","function minTimeToVisitAllPoints(points: number[][]): number { + +};","(define/contract (min-time-to-visit-all-points points) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_time_to_visit_all_points(Points :: [[integer()]]) -> integer(). +min_time_to_visit_all_points(Points) -> + .","defmodule Solution do + @spec min_time_to_visit_all_points(points :: [[integer]]) :: integer + def min_time_to_visit_all_points(points) do + + end +end","class Solution { + int minTimeToVisitAllPoints(List> points) { + + } +}", +1105,minimum-path-cost-in-a-grid,Minimum Path Cost in a Grid,2304.0,1394.0,"

You are given a 0-indexed m x n integer matrix grid consisting of distinct integers from 0 to m * n - 1. You can move in this matrix from a cell to any other cell in the next row. That is, if you are in cell (x, y) such that x < m - 1, you can move to any of the cells (x + 1, 0), (x + 1, 1), ..., (x + 1, n - 1). Note that it is not possible to move from cells in the last row.

+ +

Each possible move has a cost given by a 0-indexed 2D array moveCost of size (m * n) x n, where moveCost[i][j] is the cost of moving from a cell with value i to a cell in column j of the next row. The cost of moving from cells in the last row of grid can be ignored.

+ +

The cost of a path in grid is the sum of all values of cells visited plus the sum of costs of all the moves made. Return the minimum cost of a path that starts from any cell in the first row and ends at any cell in the last row.

+ +

 

+

Example 1:

+ +
+Input: grid = [[5,3],[4,0],[2,1]], moveCost = [[9,8],[1,5],[10,12],[18,6],[2,4],[14,3]]
+Output: 17
+Explanation: The path with the minimum possible cost is the path 5 -> 0 -> 1.
+- The sum of the values of cells visited is 5 + 0 + 1 = 6.
+- The cost of moving from 5 to 0 is 3.
+- The cost of moving from 0 to 1 is 8.
+So the total cost of the path is 6 + 3 + 8 = 17.
+
+ +

Example 2:

+ +
+Input: grid = [[5,1,2],[4,0,3]], moveCost = [[12,10,15],[20,23,8],[21,7,1],[8,1,13],[9,10,25],[5,3,2]]
+Output: 6
+Explanation: The path with the minimum possible cost is the path 2 -> 3.
+- The sum of the values of cells visited is 2 + 3 = 5.
+- The cost of moving from 2 to 3 is 1.
+So the total cost of this path is 5 + 1 = 6.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 2 <= m, n <= 50
    • +
  • grid consists of distinct integers from 0 to m * n - 1.
    • +
  • moveCost.length == m * n
    • +
  • moveCost[i].length == n
    • +
  • 1 <= moveCost[i][j] <= 100
    • +
+",2.0,False,"class Solution { +public: + int minPathCost(vector>& grid, vector>& moveCost) { + + } +};","class Solution { + public int minPathCost(int[][] grid, int[][] moveCost) { + + } +}","class Solution(object): + def minPathCost(self, grid, moveCost): + """""" + :type grid: List[List[int]] + :type moveCost: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minPathCost(self, grid: List[List[int]], moveCost: List[List[int]]) -> int: + ","int minPathCost(int** grid, int gridSize, int* gridColSize, int** moveCost, int moveCostSize, int* moveCostColSize){ + +}","public class Solution { + public int MinPathCost(int[][] grid, int[][] moveCost) { + + } +}","/** + * @param {number[][]} grid + * @param {number[][]} moveCost + * @return {number} + */ +var minPathCost = function(grid, moveCost) { + +};","# @param {Integer[][]} grid +# @param {Integer[][]} move_cost +# @return {Integer} +def min_path_cost(grid, move_cost) + +end","class Solution { + func minPathCost(_ grid: [[Int]], _ moveCost: [[Int]]) -> Int { + + } +}","func minPathCost(grid [][]int, moveCost [][]int) int { + +}","object Solution { + def minPathCost(grid: Array[Array[Int]], moveCost: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minPathCost(grid: Array, moveCost: Array): Int { + + } +}","impl Solution { + pub fn min_path_cost(grid: Vec>, move_cost: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer[][] $moveCost + * @return Integer + */ + function minPathCost($grid, $moveCost) { + + } +}","function minPathCost(grid: number[][], moveCost: number[][]): number { + +};","(define/contract (min-path-cost grid moveCost) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_path_cost(Grid :: [[integer()]], MoveCost :: [[integer()]]) -> integer(). +min_path_cost(Grid, MoveCost) -> + .","defmodule Solution do + @spec min_path_cost(grid :: [[integer]], move_cost :: [[integer]]) :: integer + def min_path_cost(grid, move_cost) do + + end +end","class Solution { + int minPathCost(List> grid, List> moveCost) { + + } +}", +1106,maximum-value-of-k-coins-from-piles,Maximum Value of K Coins From Piles,2218.0,1393.0,"

There are n piles of coins on a table. Each pile consists of a positive number of coins of assorted denominations.

+ +

In one move, you can choose any coin on top of any pile, remove it, and add it to your wallet.

+ +

Given a list piles, where piles[i] is a list of integers denoting the composition of the ith pile from top to bottom, and a positive integer k, return the maximum total value of coins you can have in your wallet if you choose exactly k coins optimally.

+ +

 

+

Example 1:

+ +
+Input: piles = [[1,100,3],[7,8,9]], k = 2
+Output: 101
+Explanation:
+The above diagram shows the different ways we can choose k coins.
+The maximum total we can obtain is 101.
+
+ +

Example 2:

+ +
+Input: piles = [[100],[100],[100],[100],[100],[100],[1,1,1,1,1,1,700]], k = 7
+Output: 706
+Explanation:
+The maximum total can be obtained if we choose all coins from the last pile.
+
+ +

 

+

Constraints:

+ +
    +
  • n == piles.length
    • +
  • 1 <= n <= 1000
    • +
  • 1 <= piles[i][j] <= 105
    • +
  • 1 <= k <= sum(piles[i].length) <= 2000
    • +
+",3.0,False,"class Solution { +public: + int maxValueOfCoins(vector>& piles, int k) { + + } +};","class Solution { + public int maxValueOfCoins(List> piles, int k) { + + } +}","class Solution(object): + def maxValueOfCoins(self, piles, k): + """""" + :type piles: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxValueOfCoins(self, piles: List[List[int]], k: int) -> int: + ","int maxValueOfCoins(int** piles, int pilesSize, int* pilesColSize, int k){ + +}","public class Solution { + public int MaxValueOfCoins(IList> piles, int k) { + + } +}","/** + * @param {number[][]} piles + * @param {number} k + * @return {number} + */ +var maxValueOfCoins = function(piles, k) { + +};","# @param {Integer[][]} piles +# @param {Integer} k +# @return {Integer} +def max_value_of_coins(piles, k) + +end","class Solution { + func maxValueOfCoins(_ piles: [[Int]], _ k: Int) -> Int { + + } +}","func maxValueOfCoins(piles [][]int, k int) int { + +}","object Solution { + def maxValueOfCoins(piles: List[List[Int]], k: Int): Int = { + + } +}","class Solution { + fun maxValueOfCoins(piles: List>, k: Int): Int { + + } +}","impl Solution { + pub fn max_value_of_coins(piles: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $piles + * @param Integer $k + * @return Integer + */ + function maxValueOfCoins($piles, $k) { + + } +}","function maxValueOfCoins(piles: number[][], k: number): number { + +};","(define/contract (max-value-of-coins piles k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec max_value_of_coins(Piles :: [[integer()]], K :: integer()) -> integer(). +max_value_of_coins(Piles, K) -> + .","defmodule Solution do + @spec max_value_of_coins(piles :: [[integer]], k :: integer) :: integer + def max_value_of_coins(piles, k) do + + end +end","class Solution { + int maxValueOfCoins(List> piles, int k) { + + } +}", +1107,find-the-difference-of-two-arrays,Find the Difference of Two Arrays,2215.0,1392.0,"

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

+ +
    +
  • answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
    • +
  • answer[1] is a list of all distinct integers in nums2 which are not present in nums1.
    • +
+ +

Note that the integers in the lists may be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3], nums2 = [2,4,6]
+Output: [[1,3],[4,6]]
+Explanation:
+For nums1, nums1[1] = 2 is present at index 0 of nums2, whereas nums1[0] = 1 and nums1[2] = 3 are not present in nums2. Therefore, answer[0] = [1,3].
+For nums2, nums2[0] = 2 is present at index 1 of nums1, whereas nums2[1] = 4 and nums2[2] = 6 are not present in nums2. Therefore, answer[1] = [4,6].
+ +

Example 2:

+ +
+Input: nums1 = [1,2,3,3], nums2 = [1,1,2,2]
+Output: [[3],[]]
+Explanation:
+For nums1, nums1[2] and nums1[3] are not present in nums2. Since nums1[2] == nums1[3], their value is only included once and answer[0] = [3].
+Every integer in nums2 is present in nums1. Therefore, answer[1] = [].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 1000
    • +
  • -1000 <= nums1[i], nums2[i] <= 1000
    • +
+",1.0,False,"class Solution { +public: + vector> findDifference(vector& nums1, vector& nums2) { + + } +};","class Solution { + public List> findDifference(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def findDifference(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: List[List[int]] + """""" + ","class Solution: + def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** findDifference(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> FindDifference(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[][]} + */ +var findDifference = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer[][]} +def find_difference(nums1, nums2) + +end","class Solution { + func findDifference(_ nums1: [Int], _ nums2: [Int]) -> [[Int]] { + + } +}","func findDifference(nums1 []int, nums2 []int) [][]int { + +}","object Solution { + def findDifference(nums1: Array[Int], nums2: Array[Int]): List[List[Int]] = { + + } +}","class Solution { + fun findDifference(nums1: IntArray, nums2: IntArray): List> { + + } +}","impl Solution { + pub fn find_difference(nums1: Vec, nums2: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer[][] + */ + function findDifference($nums1, $nums2) { + + } +}","function findDifference(nums1: number[], nums2: number[]): number[][] { + +};","(define/contract (find-difference nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) (listof (listof exact-integer?))) + + )","-spec find_difference(Nums1 :: [integer()], Nums2 :: [integer()]) -> [[integer()]]. +find_difference(Nums1, Nums2) -> + .","defmodule Solution do + @spec find_difference(nums1 :: [integer], nums2 :: [integer]) :: [[integer]] + def find_difference(nums1, nums2) do + + end +end","class Solution { + List> findDifference(List nums1, List nums2) { + + } +}", +1108,minimum-moves-to-move-a-box-to-their-target-location,Minimum Moves to Move a Box to Their Target Location,1263.0,1389.0,"

A storekeeper is a game in which the player pushes boxes around in a warehouse trying to get them to target locations.

+ +

The game is represented by an m x n grid of characters grid where each element is a wall, floor, or box.

+ +

Your task is to move the box 'B' to the target position 'T' under the following rules:

+ +
    +
  • The character 'S' represents the player. The player can move up, down, left, right in grid if it is a floor (empty cell).
    • +
  • The character '.' represents the floor which means a free cell to walk.
    • +
  • The character '#' represents the wall which means an obstacle (impossible to walk there).
    • +
  • There is only one box 'B' and one target cell 'T' in the grid.
    • +
  • The box can be moved to an adjacent free cell by standing next to the box and then moving in the direction of the box. This is a push.
    • +
  • The player cannot walk through the box.
    • +
+ +

Return the minimum number of pushes to move the box to the target. If there is no way to reach the target, return -1.

+ +

 

+

Example 1:

+ +
+Input: grid = [["#","#","#","#","#","#"],
+               ["#","T","#","#","#","#"],
+               ["#",".",".","B",".","#"],
+               ["#",".","#","#",".","#"],
+               ["#",".",".",".","S","#"],
+               ["#","#","#","#","#","#"]]
+Output: 3
+Explanation: We return only the number of times the box is pushed.
+ +

Example 2:

+ +
+Input: grid = [["#","#","#","#","#","#"],
+               ["#","T","#","#","#","#"],
+               ["#",".",".","B",".","#"],
+               ["#","#","#","#",".","#"],
+               ["#",".",".",".","S","#"],
+               ["#","#","#","#","#","#"]]
+Output: -1
+
+ +

Example 3:

+ +
+Input: grid = [["#","#","#","#","#","#"],
+               ["#","T",".",".","#","#"],
+               ["#",".","#","B",".","#"],
+               ["#",".",".",".",".","#"],
+               ["#",".",".",".","S","#"],
+               ["#","#","#","#","#","#"]]
+Output: 5
+Explanation: push the box down, left, left, up and up.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 20
    • +
  • grid contains only characters '.', '#', 'S', 'T', or 'B'.
    • +
  • There is only one character 'S', 'B', and 'T' in the grid.
    • +
+",3.0,False,"class Solution { +public: + int minPushBox(vector>& grid) { + + } +};","class Solution { + public int minPushBox(char[][] grid) { + + } +}","class Solution(object): + def minPushBox(self, grid): + """""" + :type grid: List[List[str]] + :rtype: int + """""" + ","class Solution: + def minPushBox(self, grid: List[List[str]]) -> int: + ","int minPushBox(char** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinPushBox(char[][] grid) { + + } +}","/** + * @param {character[][]} grid + * @return {number} + */ +var minPushBox = function(grid) { + +};","# @param {Character[][]} grid +# @return {Integer} +def min_push_box(grid) + +end","class Solution { + func minPushBox(_ grid: [[Character]]) -> Int { + + } +}","func minPushBox(grid [][]byte) int { + +}","object Solution { + def minPushBox(grid: Array[Array[Char]]): Int = { + + } +}","class Solution { + fun minPushBox(grid: Array): Int { + + } +}","impl Solution { + pub fn min_push_box(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String[][] $grid + * @return Integer + */ + function minPushBox($grid) { + + } +}","function minPushBox(grid: string[][]): number { + +};","(define/contract (min-push-box grid) + (-> (listof (listof char?)) exact-integer?) + + )","-spec min_push_box(Grid :: [[char()]]) -> integer(). +min_push_box(Grid) -> + .","defmodule Solution do + @spec min_push_box(grid :: [[char]]) :: integer + def min_push_box(grid) do + + end +end","class Solution { + int minPushBox(List> grid) { + + } +}", +1109,greatest-sum-divisible-by-three,Greatest Sum Divisible by Three,1262.0,1388.0,"

Given an integer array nums, return the maximum possible sum of elements of the array such that it is divisible by three.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,6,5,1,8]
+Output: 18
+Explanation: Pick numbers 3, 6, 1 and 8 their sum is 18 (maximum sum divisible by 3).
+ +

Example 2:

+ +
+Input: nums = [4]
+Output: 0
+Explanation: Since 4 is not divisible by 3, do not pick any number.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,4]
+Output: 12
+Explanation: Pick numbers 1, 3, 4 and 4 their sum is 12 (maximum sum divisible by 3).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 4 * 104
    • +
  • 1 <= nums[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int maxSumDivThree(vector& nums) { + + } +};","class Solution { + public int maxSumDivThree(int[] nums) { + + } +}","class Solution(object): + def maxSumDivThree(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxSumDivThree(self, nums: List[int]) -> int: + ","int maxSumDivThree(int* nums, int numsSize){ + +}","public class Solution { + public int MaxSumDivThree(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxSumDivThree = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_sum_div_three(nums) + +end","class Solution { + func maxSumDivThree(_ nums: [Int]) -> Int { + + } +}","func maxSumDivThree(nums []int) int { + +}","object Solution { + def maxSumDivThree(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxSumDivThree(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_sum_div_three(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxSumDivThree($nums) { + + } +}","function maxSumDivThree(nums: number[]): number { + +};","(define/contract (max-sum-div-three nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_sum_div_three(Nums :: [integer()]) -> integer(). +max_sum_div_three(Nums) -> + .","defmodule Solution do + @spec max_sum_div_three(nums :: [integer]) :: integer + def max_sum_div_three(nums) do + + end +end","class Solution { + int maxSumDivThree(List nums) { + + } +}", +1113,maximum-score-words-formed-by-letters,Maximum Score Words Formed by Letters,1255.0,1381.0,"

Given a list of words, list of  single letters (might be repeating) and score of every character.

+ +

Return the maximum score of any valid set of words formed by using the given letters (words[i] cannot be used two or more times).

+ +

It is not necessary to use all characters in letters and each letter can only be used once. Score of letters 'a', 'b', 'c', ... ,'z' is given by score[0], score[1], ... , score[25] respectively.

+ +

 

+

Example 1:

+ +
+Input: words = ["dog","cat","dad","good"], letters = ["a","a","c","d","d","d","g","o","o"], score = [1,0,9,5,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0]
+Output: 23
+Explanation:
+Score  a=1, c=9, d=5, g=3, o=2
+Given letters, we can form the words "dad" (5+1+5) and "good" (3+2+2+5) with a score of 23.
+Words "dad" and "dog" only get a score of 21.
+ +

Example 2:

+ +
+Input: words = ["xxxz","ax","bx","cx"], letters = ["z","a","b","c","x","x","x"], score = [4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,10]
+Output: 27
+Explanation:
+Score  a=4, b=4, c=4, x=5, z=10
+Given letters, we can form the words "ax" (4+5), "bx" (4+5) and "cx" (4+5) with a score of 27.
+Word "xxxz" only get a score of 25.
+ +

Example 3:

+ +
+Input: words = ["leetcode"], letters = ["l","e","t","c","o","d"], score = [0,0,1,1,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0]
+Output: 0
+Explanation:
+Letter "e" can only be used once.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 14
    • +
  • 1 <= words[i].length <= 15
    • +
  • 1 <= letters.length <= 100
    • +
  • letters[i].length == 1
    • +
  • score.length == 26
    • +
  • 0 <= score[i] <= 10
    • +
  • words[i], letters[i] contains only lower case English letters.
    • +
+",3.0,False,"class Solution { +public: + int maxScoreWords(vector& words, vector& letters, vector& score) { + + } +};","class Solution { + public int maxScoreWords(String[] words, char[] letters, int[] score) { + + } +}","class Solution(object): + def maxScoreWords(self, words, letters, score): + """""" + :type words: List[str] + :type letters: List[str] + :type score: List[int] + :rtype: int + """""" + ","class Solution: + def maxScoreWords(self, words: List[str], letters: List[str], score: List[int]) -> int: + ","int maxScoreWords(char ** words, int wordsSize, char* letters, int lettersSize, int* score, int scoreSize){ + +}","public class Solution { + public int MaxScoreWords(string[] words, char[] letters, int[] score) { + + } +}","/** + * @param {string[]} words + * @param {character[]} letters + * @param {number[]} score + * @return {number} + */ +var maxScoreWords = function(words, letters, score) { + +};","# @param {String[]} words +# @param {Character[]} letters +# @param {Integer[]} score +# @return {Integer} +def max_score_words(words, letters, score) + +end","class Solution { + func maxScoreWords(_ words: [String], _ letters: [Character], _ score: [Int]) -> Int { + + } +}","func maxScoreWords(words []string, letters []byte, score []int) int { + +}","object Solution { + def maxScoreWords(words: Array[String], letters: Array[Char], score: Array[Int]): Int = { + + } +}","class Solution { + fun maxScoreWords(words: Array, letters: CharArray, score: IntArray): Int { + + } +}","impl Solution { + pub fn max_score_words(words: Vec, letters: Vec, score: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String[] $letters + * @param Integer[] $score + * @return Integer + */ + function maxScoreWords($words, $letters, $score) { + + } +}","function maxScoreWords(words: string[], letters: string[], score: number[]): number { + +};","(define/contract (max-score-words words letters score) + (-> (listof string?) (listof char?) (listof exact-integer?) exact-integer?) + + )","-spec max_score_words(Words :: [unicode:unicode_binary()], Letters :: [char()], Score :: [integer()]) -> integer(). +max_score_words(Words, Letters, Score) -> + .","defmodule Solution do + @spec max_score_words(words :: [String.t], letters :: [char], score :: [integer]) :: integer + def max_score_words(words, letters, score) do + + end +end","class Solution { + int maxScoreWords(List words, List letters, List score) { + + } +}", +1114,number-of-closed-islands,Number of Closed Islands,1254.0,1380.0,"

Given a 2D grid consists of 0s (land) and 1s (water).  An island is a maximal 4-directionally connected group of 0s and a closed island is an island totally (all left, top, right, bottom) surrounded by 1s.

+ +

Return the number of closed islands.

+ +

 

+

Example 1:

+ +

+ +
+Input: grid = [[1,1,1,1,1,1,1,0],[1,0,0,0,0,1,1,0],[1,0,1,0,1,1,1,0],[1,0,0,0,0,1,0,1],[1,1,1,1,1,1,1,0]]
+Output: 2
+Explanation: 
+Islands in gray are closed because they are completely surrounded by water (group of 1s).
+ +

Example 2:

+ +

+ +
+Input: grid = [[0,0,1,0,0],[0,1,0,1,0],[0,1,1,1,0]]
+Output: 1
+
+ +

Example 3:

+ +
+Input: grid = [[1,1,1,1,1,1,1],
+               [1,0,0,0,0,0,1],
+               [1,0,1,1,1,0,1],
+               [1,0,1,0,1,0,1],
+               [1,0,1,1,1,0,1],
+               [1,0,0,0,0,0,1],
+               [1,1,1,1,1,1,1]]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= grid.length, grid[0].length <= 100
    • +
  • 0 <= grid[i][j] <=1
    • +
+",2.0,False,"class Solution { +public: + int closedIsland(vector>& grid) { + + } +};","class Solution { + public int closedIsland(int[][] grid) { + + } +}","class Solution(object): + def closedIsland(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def closedIsland(self, grid: List[List[int]]) -> int: + ","int closedIsland(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int ClosedIsland(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var closedIsland = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def closed_island(grid) + +end","class Solution { + func closedIsland(_ grid: [[Int]]) -> Int { + + } +}","func closedIsland(grid [][]int) int { + +}","object Solution { + def closedIsland(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun closedIsland(grid: Array): Int { + + } +}","impl Solution { + pub fn closed_island(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function closedIsland($grid) { + + } +}","function closedIsland(grid: number[][]): number { + +};","(define/contract (closed-island grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec closed_island(Grid :: [[integer()]]) -> integer(). +closed_island(Grid) -> + .","defmodule Solution do + @spec closed_island(grid :: [[integer]]) :: integer + def closed_island(grid) do + + end +end","class Solution { + int closedIsland(List> grid) { + + } +}", +1116,cells-with-odd-values-in-a-matrix,Cells with Odd Values in a Matrix,1252.0,1378.0,"

There is an m x n matrix that is initialized to all 0's. There is also a 2D array indices where each indices[i] = [ri, ci] represents a 0-indexed location to perform some increment operations on the matrix.

+ +

For each location indices[i], do both of the following:

+ +
    +
  1. Increment all the cells on row ri.
    2. +
  2. Increment all the cells on column ci.
    3. +
+ +

Given m, n, and indices, return the number of odd-valued cells in the matrix after applying the increment to all locations in indices.

+ +

 

+

Example 1:

+ +
+Input: m = 2, n = 3, indices = [[0,1],[1,1]]
+Output: 6
+Explanation: Initial matrix = [[0,0,0],[0,0,0]].
+After applying first increment it becomes [[1,2,1],[0,1,0]].
+The final matrix is [[1,3,1],[1,3,1]], which contains 6 odd numbers.
+
+ +

Example 2:

+ +
+Input: m = 2, n = 2, indices = [[1,1],[0,0]]
+Output: 0
+Explanation: Final matrix = [[2,2],[2,2]]. There are no odd numbers in the final matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 50
    • +
  • 1 <= indices.length <= 100
    • +
  • 0 <= ri < m
    • +
  • 0 <= ci < n
    • +
+ +

 

+

Follow up: Could you solve this in O(n + m + indices.length) time with only O(n + m) extra space?

+",1.0,False,"class Solution { +public: + int oddCells(int m, int n, vector>& indices) { + + } +};","class Solution { + public int oddCells(int m, int n, int[][] indices) { + + } +}","class Solution(object): + def oddCells(self, m, n, indices): + """""" + :type m: int + :type n: int + :type indices: List[List[int]] + :rtype: int + """""" + ","class Solution: + def oddCells(self, m: int, n: int, indices: List[List[int]]) -> int: + ","int oddCells(int m, int n, int** indices, int indicesSize, int* indicesColSize){ + +}","public class Solution { + public int OddCells(int m, int n, int[][] indices) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number[][]} indices + * @return {number} + */ +var oddCells = function(m, n, indices) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer[][]} indices +# @return {Integer} +def odd_cells(m, n, indices) + +end","class Solution { + func oddCells(_ m: Int, _ n: Int, _ indices: [[Int]]) -> Int { + + } +}","func oddCells(m int, n int, indices [][]int) int { + +}","object Solution { + def oddCells(m: Int, n: Int, indices: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun oddCells(m: Int, n: Int, indices: Array): Int { + + } +}","impl Solution { + pub fn odd_cells(m: i32, n: i32, indices: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer[][] $indices + * @return Integer + */ + function oddCells($m, $n, $indices) { + + } +}","function oddCells(m: number, n: number, indices: number[][]): number { + +};","(define/contract (odd-cells m n indices) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec odd_cells(M :: integer(), N :: integer(), Indices :: [[integer()]]) -> integer(). +odd_cells(M, N, Indices) -> + .","defmodule Solution do + @spec odd_cells(m :: integer, n :: integer, indices :: [[integer]]) :: integer + def odd_cells(m, n, indices) do + + end +end","class Solution { + int oddCells(int m, int n, List> indices) { + + } +}", +1117,selling-pieces-of-wood,Selling Pieces of Wood,2312.0,1376.0,"

You are given two integers m and n that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array prices, where prices[i] = [hi, wi, pricei] indicates you can sell a rectangular piece of wood of height hi and width wi for pricei dollars.

+ +

To cut a piece of wood, you must make a vertical or horizontal cut across the entire height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to prices. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you cannot rotate a piece to swap its height and width.

+ +

Return the maximum money you can earn after cutting an m x n piece of wood.

+ +

Note that you can cut the piece of wood as many times as you want.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]
+Output: 19
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.
+- 1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 14 + 3 + 2 = 19 money earned.
+It can be shown that 19 is the maximum amount of money that can be earned.
+
+ +

Example 2:

+ +
+Input: m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]
+Output: 32
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 30 + 2 = 32 money earned.
+It can be shown that 32 is the maximum amount of money that can be earned.
+Notice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 200
    • +
  • 1 <= prices.length <= 2 * 104
    • +
  • prices[i].length == 3
    • +
  • 1 <= hi <= m
    • +
  • 1 <= wi <= n
    • +
  • 1 <= pricei <= 106
    • +
  • All the shapes of wood (hi, wi) are pairwise distinct.
    • +
+",3.0,False,"class Solution { +public: + long long sellingWood(int m, int n, vector>& prices) { + + } +};","class Solution { + public long sellingWood(int m, int n, int[][] prices) { + + } +}","class Solution(object): + def sellingWood(self, m, n, prices): + """""" + :type m: int + :type n: int + :type prices: List[List[int]] + :rtype: int + """""" + ","class Solution: + def sellingWood(self, m: int, n: int, prices: List[List[int]]) -> int: + ","long long sellingWood(int m, int n, int** prices, int pricesSize, int* pricesColSize){ + +}","public class Solution { + public long SellingWood(int m, int n, int[][] prices) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number[][]} prices + * @return {number} + */ +var sellingWood = function(m, n, prices) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer[][]} prices +# @return {Integer} +def selling_wood(m, n, prices) + +end","class Solution { + func sellingWood(_ m: Int, _ n: Int, _ prices: [[Int]]) -> Int { + + } +}","func sellingWood(m int, n int, prices [][]int) int64 { + +}","object Solution { + def sellingWood(m: Int, n: Int, prices: Array[Array[Int]]): Long = { + + } +}","class Solution { + fun sellingWood(m: Int, n: Int, prices: Array): Long { + + } +}","impl Solution { + pub fn selling_wood(m: i32, n: i32, prices: Vec>) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer[][] $prices + * @return Integer + */ + function sellingWood($m, $n, $prices) { + + } +}","function sellingWood(m: number, n: number, prices: number[][]): number { + +};","(define/contract (selling-wood m n prices) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec selling_wood(M :: integer(), N :: integer(), Prices :: [[integer()]]) -> integer(). +selling_wood(M, N, Prices) -> + .","defmodule Solution do + @spec selling_wood(m :: integer, n :: integer, prices :: [[integer]]) :: integer + def selling_wood(m, n, prices) do + + end +end","class Solution { + int sellingWood(int m, int n, List> prices) { + + } +}", +1118,find-palindrome-with-fixed-length,Find Palindrome With Fixed Length,2217.0,1375.0,"

Given an integer array queries and a positive integer intLength, return an array answer where answer[i] is either the queries[i]th smallest positive palindrome of length intLength or -1 if no such palindrome exists.

+ +

A palindrome is a number that reads the same backwards and forwards. Palindromes cannot have leading zeros.

+ +

 

+

Example 1:

+ +
+Input: queries = [1,2,3,4,5,90], intLength = 3
+Output: [101,111,121,131,141,999]
+Explanation:
+The first few palindromes of length 3 are:
+101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...
+The 90th palindrome of length 3 is 999.
+
+ +

Example 2:

+ +
+Input: queries = [2,4,6], intLength = 4
+Output: [1111,1331,1551]
+Explanation:
+The first six palindromes of length 4 are:
+1001, 1111, 1221, 1331, 1441, and 1551.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= queries.length <= 5 * 104
    • +
  • 1 <= queries[i] <= 109
    • +
  • 1 <= intLength <= 15
    • +
+",2.0,False,"class Solution { +public: + vector kthPalindrome(vector& queries, int intLength) { + + } +};","class Solution { + public long[] kthPalindrome(int[] queries, int intLength) { + + } +}","class Solution(object): + def kthPalindrome(self, queries, intLength): + """""" + :type queries: List[int] + :type intLength: int + :rtype: List[int] + """""" + ","class Solution: + def kthPalindrome(self, queries: List[int], intLength: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +long long* kthPalindrome(int* queries, int queriesSize, int intLength, int* returnSize){ + +}","public class Solution { + public long[] KthPalindrome(int[] queries, int intLength) { + + } +}","/** + * @param {number[]} queries + * @param {number} intLength + * @return {number[]} + */ +var kthPalindrome = function(queries, intLength) { + +};","# @param {Integer[]} queries +# @param {Integer} int_length +# @return {Integer[]} +def kth_palindrome(queries, int_length) + +end","class Solution { + func kthPalindrome(_ queries: [Int], _ intLength: Int) -> [Int] { + + } +}","func kthPalindrome(queries []int, intLength int) []int64 { + +}","object Solution { + def kthPalindrome(queries: Array[Int], intLength: Int): Array[Long] = { + + } +}","class Solution { + fun kthPalindrome(queries: IntArray, intLength: Int): LongArray { + + } +}","impl Solution { + pub fn kth_palindrome(queries: Vec, int_length: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $queries + * @param Integer $intLength + * @return Integer[] + */ + function kthPalindrome($queries, $intLength) { + + } +}","function kthPalindrome(queries: number[], intLength: number): number[] { + +};","(define/contract (kth-palindrome queries intLength) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec kth_palindrome(Queries :: [integer()], IntLength :: integer()) -> [integer()]. +kth_palindrome(Queries, IntLength) -> + .","defmodule Solution do + @spec kth_palindrome(queries :: [integer], int_length :: integer) :: [integer] + def kth_palindrome(queries, int_length) do + + end +end","class Solution { + List kthPalindrome(List queries, int intLength) { + + } +}", +1119,check-if-it-is-a-good-array,Check If It Is a Good Array,1250.0,1372.0,"

Given an array nums of positive integers. Your task is to select some subset of nums, multiply each element by an integer and add all these numbers. The array is said to be good if you can obtain a sum of 1 from the array by any possible subset and multiplicand.

+ +

Return True if the array is good otherwise return False.

+ +

 

+

Example 1:

+ +
+Input: nums = [12,5,7,23]
+Output: true
+Explanation: Pick numbers 5 and 7.
+5*3 + 7*(-2) = 1
+
+ +

Example 2:

+ +
+Input: nums = [29,6,10]
+Output: true
+Explanation: Pick numbers 29, 6 and 10.
+29*1 + 6*(-3) + 10*(-1) = 1
+
+ +

Example 3:

+ +
+Input: nums = [3,6]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 10^5
    • +
  • 1 <= nums[i] <= 10^9
    • +
+",3.0,False,"class Solution { +public: + bool isGoodArray(vector& nums) { + + } +};","class Solution { + public boolean isGoodArray(int[] nums) { + + } +}","class Solution(object): + def isGoodArray(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def isGoodArray(self, nums: List[int]) -> bool: + ","bool isGoodArray(int* nums, int numsSize){ + +}","public class Solution { + public bool IsGoodArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var isGoodArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def is_good_array(nums) + +end","class Solution { + func isGoodArray(_ nums: [Int]) -> Bool { + + } +}","func isGoodArray(nums []int) bool { + +}","object Solution { + def isGoodArray(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun isGoodArray(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_good_array(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function isGoodArray($nums) { + + } +}","function isGoodArray(nums: number[]): boolean { + +};","(define/contract (is-good-array nums) + (-> (listof exact-integer?) boolean?) + + )","-spec is_good_array(Nums :: [integer()]) -> boolean(). +is_good_array(Nums) -> + .","defmodule Solution do + @spec is_good_array(nums :: [integer]) :: boolean + def is_good_array(nums) do + + end +end","class Solution { + bool isGoodArray(List nums) { + + } +}", +1120,minimum-remove-to-make-valid-parentheses,Minimum Remove to Make Valid Parentheses,1249.0,1371.0,"

Given a string s of '(' , ')' and lowercase English characters.

+ +

Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.

+ +

Formally, a parentheses string is valid if and only if:

+ +
    +
  • It is the empty string, contains only lowercase characters, or
    • +
  • It can be written as AB (A concatenated with B), where A and B are valid strings, or
    • +
  • It can be written as (A), where A is a valid string.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "lee(t(c)o)de)"
+Output: "lee(t(c)o)de"
+Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
+
+ +

Example 2:

+ +
+Input: s = "a)b(c)d"
+Output: "ab(c)d"
+
+ +

Example 3:

+ +
+Input: s = "))(("
+Output: ""
+Explanation: An empty string is also valid.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s[i] is either'(' , ')', or lowercase English letter.
    • +
+",2.0,False,"class Solution { +public: + string minRemoveToMakeValid(string s) { + + } +};","class Solution { + public String minRemoveToMakeValid(String s) { + + } +}","class Solution(object): + def minRemoveToMakeValid(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def minRemoveToMakeValid(self, s: str) -> str: + ","char * minRemoveToMakeValid(char * s){ + +}","public class Solution { + public string MinRemoveToMakeValid(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var minRemoveToMakeValid = function(s) { + +};","# @param {String} s +# @return {String} +def min_remove_to_make_valid(s) + +end","class Solution { + func minRemoveToMakeValid(_ s: String) -> String { + + } +}","func minRemoveToMakeValid(s string) string { + +}","object Solution { + def minRemoveToMakeValid(s: String): String = { + + } +}","class Solution { + fun minRemoveToMakeValid(s: String): String { + + } +}","impl Solution { + pub fn min_remove_to_make_valid(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function minRemoveToMakeValid($s) { + + } +}","function minRemoveToMakeValid(s: string): string { + +};",,"-spec min_remove_to_make_valid(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +min_remove_to_make_valid(S) -> + .","defmodule Solution do + @spec min_remove_to_make_valid(s :: String.t) :: String.t + def min_remove_to_make_valid(s) do + + end +end","class Solution { + String minRemoveToMakeValid(String s) { + + } +}", +1122,minimum-swaps-to-make-strings-equal,Minimum Swaps to Make Strings Equal,1247.0,1369.0,"

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. You can swap any two characters that belong to different strings, which means: swap s1[i] and s2[j].

+ +

Return the minimum number of swaps required to make s1 and s2 equal, or return -1 if it is impossible to do so.

+ +

 

+

Example 1:

+ +
+Input: s1 = "xx", s2 = "yy"
+Output: 1
+Explanation: Swap s1[0] and s2[1], s1 = "yx", s2 = "yx".
+
+ +

Example 2:

+ +
+Input: s1 = "xy", s2 = "yx"
+Output: 2
+Explanation: Swap s1[0] and s2[0], s1 = "yy", s2 = "xx".
+Swap s1[0] and s2[1], s1 = "xy", s2 = "xy".
+Note that you cannot swap s1[0] and s1[1] to make s1 equal to "yx", cause we can only swap chars in different strings.
+
+ +

Example 3:

+ +
+Input: s1 = "xx", s2 = "xy"
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length <= 1000
    • +
  • s1.length == s2.length
    • +
  • s1, s2 only contain 'x' or 'y'.
    • +
+",2.0,False,"class Solution { +public: + int minimumSwap(string s1, string s2) { + + } +};","class Solution { + public int minimumSwap(String s1, String s2) { + + } +}","class Solution(object): + def minimumSwap(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: int + """""" + ","class Solution: + def minimumSwap(self, s1: str, s2: str) -> int: + ","int minimumSwap(char * s1, char * s2){ + +}","public class Solution { + public int MinimumSwap(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {number} + */ +var minimumSwap = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Integer} +def minimum_swap(s1, s2) + +end","class Solution { + func minimumSwap(_ s1: String, _ s2: String) -> Int { + + } +}","func minimumSwap(s1 string, s2 string) int { + +}","object Solution { + def minimumSwap(s1: String, s2: String): Int = { + + } +}","class Solution { + fun minimumSwap(s1: String, s2: String): Int { + + } +}","impl Solution { + pub fn minimum_swap(s1: String, s2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Integer + */ + function minimumSwap($s1, $s2) { + + } +}","function minimumSwap(s1: string, s2: string): number { + +};",,"-spec minimum_swap(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> integer(). +minimum_swap(S1, S2) -> + .","defmodule Solution do + @spec minimum_swap(s1 :: String.t, s2 :: String.t) :: integer + def minimum_swap(s1, s2) do + + end +end","class Solution { + int minimumSwap(String s1, String s2) { + + } +}", +1123,maximum-height-by-stacking-cuboids,Maximum Height by Stacking Cuboids ,1691.0,1367.0,"

Given n cuboids where the dimensions of the ith cuboid is cuboids[i] = [widthi, lengthi, heighti] (0-indexed). Choose a subset of cuboids and place them on each other.

+ +

You can place cuboid i on cuboid j if widthi <= widthj and lengthi <= lengthj and heighti <= heightj. You can rearrange any cuboid's dimensions by rotating it to put it on another cuboid.

+ +

Return the maximum height of the stacked cuboids.

+ +

 

+

Example 1:

+ +

+ +
+Input: cuboids = [[50,45,20],[95,37,53],[45,23,12]]
+Output: 190
+Explanation:
+Cuboid 1 is placed on the bottom with the 53x37 side facing down with height 95.
+Cuboid 0 is placed next with the 45x20 side facing down with height 50.
+Cuboid 2 is placed next with the 23x12 side facing down with height 45.
+The total height is 95 + 50 + 45 = 190.
+
+ +

Example 2:

+ +
+Input: cuboids = [[38,25,45],[76,35,3]]
+Output: 76
+Explanation:
+You can't place any of the cuboids on the other.
+We choose cuboid 1 and rotate it so that the 35x3 side is facing down and its height is 76.
+
+ +

Example 3:

+ +
+Input: cuboids = [[7,11,17],[7,17,11],[11,7,17],[11,17,7],[17,7,11],[17,11,7]]
+Output: 102
+Explanation:
+After rearranging the cuboids, you can see that all cuboids have the same dimension.
+You can place the 11x7 side down on all cuboids so their heights are 17.
+The maximum height of stacked cuboids is 6 * 17 = 102.
+
+ +

 

+

Constraints:

+ +
    +
  • n == cuboids.length
    • +
  • 1 <= n <= 100
    • +
  • 1 <= widthi, lengthi, heighti <= 100
    • +
+",3.0,False,"class Solution { +public: + int maxHeight(vector>& cuboids) { + + } +};","class Solution { + public int maxHeight(int[][] cuboids) { + + } +}","class Solution(object): + def maxHeight(self, cuboids): + """""" + :type cuboids: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxHeight(self, cuboids: List[List[int]]) -> int: + "," + +int maxHeight(int** cuboids, int cuboidsSize, int* cuboidsColSize){ + +}","public class Solution { + public int MaxHeight(int[][] cuboids) { + + } +}","/** + * @param {number[][]} cuboids + * @return {number} + */ +var maxHeight = function(cuboids) { + +};","# @param {Integer[][]} cuboids +# @return {Integer} +def max_height(cuboids) + +end","class Solution { + func maxHeight(_ cuboids: [[Int]]) -> Int { + + } +}","func maxHeight(cuboids [][]int) int { + +}","object Solution { + def maxHeight(cuboids: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxHeight(cuboids: Array): Int { + + } +}","impl Solution { + pub fn max_height(cuboids: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $cuboids + * @return Integer + */ + function maxHeight($cuboids) { + + } +}","function maxHeight(cuboids: number[][]): number { + +};",,,,, +1124,tuple-with-same-product,Tuple with Same Product,1726.0,1364.0,"

Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) such that a * b = c * d where a, b, c, and d are elements of nums, and a != b != c != d.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,4,6]
+Output: 8
+Explanation: There are 8 valid tuples:
+(2,6,3,4) , (2,6,4,3) , (6,2,3,4) , (6,2,4,3)
+(3,4,2,6) , (4,3,2,6) , (3,4,6,2) , (4,3,6,2)
+
+ +

Example 2:

+ +
+Input: nums = [1,2,4,5,10]
+Output: 16
+Explanation: There are 16 valid tuples:
+(1,10,2,5) , (1,10,5,2) , (10,1,2,5) , (10,1,5,2)
+(2,5,1,10) , (2,5,10,1) , (5,2,1,10) , (5,2,10,1)
+(2,10,4,5) , (2,10,5,4) , (10,2,4,5) , (10,2,5,4)
+(4,5,2,10) , (4,5,10,2) , (5,4,2,10) , (5,4,10,2)
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 104
    • +
  • All elements in nums are distinct.
    • +
+",2.0,False,"class Solution { +public: + int tupleSameProduct(vector& nums) { + + } +};","class Solution { + public int tupleSameProduct(int[] nums) { + + } +}","class Solution(object): + def tupleSameProduct(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def tupleSameProduct(self, nums: List[int]) -> int: + ","int tupleSameProduct(int* nums, int numsSize){ + +}","public class Solution { + public int TupleSameProduct(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var tupleSameProduct = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def tuple_same_product(nums) + +end","class Solution { + func tupleSameProduct(_ nums: [Int]) -> Int { + + } +}","func tupleSameProduct(nums []int) int { + +}","object Solution { + def tupleSameProduct(nums: Array[Int]): Int = { + + } +}","class Solution { + fun tupleSameProduct(nums: IntArray): Int { + + } +}","impl Solution { + pub fn tuple_same_product(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function tupleSameProduct($nums) { + + } +}","function tupleSameProduct(nums: number[]): number { + +};",,"-spec tuple_same_product(Nums :: [integer()]) -> integer(). +tuple_same_product(Nums) -> + .","defmodule Solution do + @spec tuple_same_product(nums :: [integer]) :: integer + def tuple_same_product(nums) do + + end +end","class Solution { + int tupleSameProduct(List nums) { + + } +}", +1126,airplane-seat-assignment-probability,Airplane Seat Assignment Probability,1227.0,1362.0,"

n passengers board an airplane with exactly n seats. The first passenger has lost the ticket and picks a seat randomly. But after that, the rest of the passengers will:

+ +
    +
  • Take their own seat if it is still available, and
    • +
  • Pick other seats randomly when they find their seat occupied
    • +
+ +

Return the probability that the nth person gets his own seat.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 1.00000
+Explanation: The first person can only get the first seat.
+ +

Example 2:

+ +
+Input: n = 2
+Output: 0.50000
+Explanation: The second person has a probability of 0.5 to get the second seat (when first person gets the first seat).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
+",2.0,False,"class Solution { +public: + double nthPersonGetsNthSeat(int n) { + + } +};","class Solution { + public double nthPersonGetsNthSeat(int n) { + + } +}","class Solution(object): + def nthPersonGetsNthSeat(self, n): + """""" + :type n: int + :rtype: float + """""" + ","class Solution: + def nthPersonGetsNthSeat(self, n: int) -> float: + ","double nthPersonGetsNthSeat(int n){ + +}","public class Solution { + public double NthPersonGetsNthSeat(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var nthPersonGetsNthSeat = function(n) { + +};","# @param {Integer} n +# @return {Float} +def nth_person_gets_nth_seat(n) + +end","class Solution { + func nthPersonGetsNthSeat(_ n: Int) -> Double { + + } +}","func nthPersonGetsNthSeat(n int) float64 { + +}","object Solution { + def nthPersonGetsNthSeat(n: Int): Double = { + + } +}","class Solution { + fun nthPersonGetsNthSeat(n: Int): Double { + + } +}","impl Solution { + pub fn nth_person_gets_nth_seat(n: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Float + */ + function nthPersonGetsNthSeat($n) { + + } +}","function nthPersonGetsNthSeat(n: number): number { + +};",,,,"class Solution { + double nthPersonGetsNthSeat(int n) { + + } +}", +1127,tiling-a-rectangle-with-the-fewest-squares,Tiling a Rectangle with the Fewest Squares,1240.0,1361.0,"

Given a rectangle of size n x m, return the minimum number of integer-sided squares that tile the rectangle.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 2, m = 3
+Output: 3
+Explanation: 3 squares are necessary to cover the rectangle.
+2 (squares of 1x1)
+1 (square of 2x2)
+ +

Example 2:

+ +

+ +
+Input: n = 5, m = 8
+Output: 5
+
+ +

Example 3:

+ +

+ +
+Input: n = 11, m = 13
+Output: 6
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n, m <= 13
    • +
+",3.0,False,"class Solution { +public: + int tilingRectangle(int n, int m) { + + } +};","class Solution { + public int tilingRectangle(int n, int m) { + + } +}","class Solution(object): + def tilingRectangle(self, n, m): + """""" + :type n: int + :type m: int + :rtype: int + """""" + ","class Solution: + def tilingRectangle(self, n: int, m: int) -> int: + ","int tilingRectangle(int n, int m){ + +}","public class Solution { + public int TilingRectangle(int n, int m) { + + } +}","/** + * @param {number} n + * @param {number} m + * @return {number} + */ +var tilingRectangle = function(n, m) { + +};","# @param {Integer} n +# @param {Integer} m +# @return {Integer} +def tiling_rectangle(n, m) + +end","class Solution { + func tilingRectangle(_ n: Int, _ m: Int) -> Int { + + } +}","func tilingRectangle(n int, m int) int { + +}","object Solution { + def tilingRectangle(n: Int, m: Int): Int = { + + } +}","class Solution { + fun tilingRectangle(n: Int, m: Int): Int { + + } +}","impl Solution { + pub fn tiling_rectangle(n: i32, m: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $m + * @return Integer + */ + function tilingRectangle($n, $m) { + + } +}","function tilingRectangle(n: number, m: number): number { + +};","(define/contract (tiling-rectangle n m) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec tiling_rectangle(N :: integer(), M :: integer()) -> integer(). +tiling_rectangle(N, M) -> + .","defmodule Solution do + @spec tiling_rectangle(n :: integer, m :: integer) :: integer + def tiling_rectangle(n, m) do + + end +end","class Solution { + int tilingRectangle(int n, int m) { + + } +}", +1128,maximum-length-of-a-concatenated-string-with-unique-characters,Maximum Length of a Concatenated String with Unique Characters,1239.0,1360.0,"

You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters.

+ +

Return the maximum possible length of s.

+ +

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: arr = ["un","iq","ue"]
+Output: 4
+Explanation: All the valid concatenations are:
+- ""
+- "un"
+- "iq"
+- "ue"
+- "uniq" ("un" + "iq")
+- "ique" ("iq" + "ue")
+Maximum length is 4.
+
+ +

Example 2:

+ +
+Input: arr = ["cha","r","act","ers"]
+Output: 6
+Explanation: Possible longest valid concatenations are "chaers" ("cha" + "ers") and "acters" ("act" + "ers").
+
+ +

Example 3:

+ +
+Input: arr = ["abcdefghijklmnopqrstuvwxyz"]
+Output: 26
+Explanation: The only string in arr has all 26 characters.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 16
    • +
  • 1 <= arr[i].length <= 26
    • +
  • arr[i] contains only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int maxLength(vector& arr) { + + } +};","class Solution { + public int maxLength(List arr) { + + } +}","class Solution(object): + def maxLength(self, arr): + """""" + :type arr: List[str] + :rtype: int + """""" + ","class Solution: + def maxLength(self, arr: List[str]) -> int: + ","int maxLength(char ** arr, int arrSize){ + +}","public class Solution { + public int MaxLength(IList arr) { + + } +}","/** + * @param {string[]} arr + * @return {number} + */ +var maxLength = function(arr) { + +};","# @param {String[]} arr +# @return {Integer} +def max_length(arr) + +end","class Solution { + func maxLength(_ arr: [String]) -> Int { + + } +}","func maxLength(arr []string) int { + +}","object Solution { + def maxLength(arr: List[String]): Int = { + + } +}","class Solution { + fun maxLength(arr: List): Int { + + } +}","impl Solution { + pub fn max_length(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $arr + * @return Integer + */ + function maxLength($arr) { + + } +}","function maxLength(arr: string[]): number { + +};","(define/contract (max-length arr) + (-> (listof string?) exact-integer?) + + )","-spec max_length(Arr :: [unicode:unicode_binary()]) -> integer(). +max_length(Arr) -> + .","defmodule Solution do + @spec max_length(arr :: [String.t]) :: integer + def max_length(arr) do + + end +end","class Solution { + int maxLength(List arr) { + + } +}", +1131,minimum-number-of-moves-to-make-palindrome,Minimum Number of Moves to Make Palindrome,2193.0,1356.0,"

You are given a string s consisting only of lowercase English letters.

+ +

In one move, you can select any two adjacent characters of s and swap them.

+ +

Return the minimum number of moves needed to make s a palindrome.

+ +

Note that the input will be generated such that s can always be converted to a palindrome.

+ +

 

+

Example 1:

+ +
+Input: s = "aabb"
+Output: 2
+Explanation:
+We can obtain two palindromes from s, "abba" and "baab". 
+- We can obtain "abba" from s in 2 moves: "aabb" -> "abab" -> "abba".
+- We can obtain "baab" from s in 2 moves: "aabb" -> "abab" -> "baab".
+Thus, the minimum number of moves needed to make s a palindrome is 2.
+
+ +

Example 2:

+ +
+Input: s = "letelt"
+Output: 2
+Explanation:
+One of the palindromes we can obtain from s in 2 moves is "lettel".
+One of the ways we can obtain it is "letelt" -> "letetl" -> "lettel".
+Other palindromes such as "tleelt" can also be obtained in 2 moves.
+It can be shown that it is not possible to obtain a palindrome in less than 2 moves.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2000
    • +
  • s consists only of lowercase English letters.
    • +
  • s can be converted to a palindrome using a finite number of moves.
    • +
+",3.0,False,"class Solution { +public: + int minMovesToMakePalindrome(string s) { + + } +};","class Solution { + public int minMovesToMakePalindrome(String s) { + + } +}","class Solution(object): + def minMovesToMakePalindrome(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minMovesToMakePalindrome(self, s: str) -> int: + ","int minMovesToMakePalindrome(char * s){ + +}","public class Solution { + public int MinMovesToMakePalindrome(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minMovesToMakePalindrome = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_moves_to_make_palindrome(s) + +end","class Solution { + func minMovesToMakePalindrome(_ s: String) -> Int { + + } +}","func minMovesToMakePalindrome(s string) int { + +}","object Solution { + def minMovesToMakePalindrome(s: String): Int = { + + } +}","class Solution { + fun minMovesToMakePalindrome(s: String): Int { + + } +}","impl Solution { + pub fn min_moves_to_make_palindrome(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minMovesToMakePalindrome($s) { + + } +}","function minMovesToMakePalindrome(s: string): number { + +};","(define/contract (min-moves-to-make-palindrome s) + (-> string? exact-integer?) + + )","-spec min_moves_to_make_palindrome(S :: unicode:unicode_binary()) -> integer(). +min_moves_to_make_palindrome(S) -> + .","defmodule Solution do + @spec min_moves_to_make_palindrome(s :: String.t) :: integer + def min_moves_to_make_palindrome(s) do + + end +end","class Solution { + int minMovesToMakePalindrome(String s) { + + } +}", +1133,find-players-with-zero-or-one-losses,Find Players With Zero or One Losses,2225.0,1354.0,"

You are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match.

+ +

Return a list answer of size 2 where:

+ +
    +
  • answer[0] is a list of all players that have not lost any matches.
    • +
  • answer[1] is a list of all players that have lost exactly one match.
    • +
+ +

The values in the two lists should be returned in increasing order.

+ +

Note:

+ +
    +
  • You should only consider the players that have played at least one match.
    • +
  • The testcases will be generated such that no two matches will have the same outcome.
    • +
+ +

 

+

Example 1:

+ +
+Input: matches = [[1,3],[2,3],[3,6],[5,6],[5,7],[4,5],[4,8],[4,9],[10,4],[10,9]]
+Output: [[1,2,10],[4,5,7,8]]
+Explanation:
+Players 1, 2, and 10 have not lost any matches.
+Players 4, 5, 7, and 8 each have lost one match.
+Players 3, 6, and 9 each have lost two matches.
+Thus, answer[0] = [1,2,10] and answer[1] = [4,5,7,8].
+
+ +

Example 2:

+ +
+Input: matches = [[2,3],[1,3],[5,4],[6,4]]
+Output: [[1,2,5,6],[]]
+Explanation:
+Players 1, 2, 5, and 6 have not lost any matches.
+Players 3 and 4 each have lost two matches.
+Thus, answer[0] = [1,2,5,6] and answer[1] = [].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= matches.length <= 105
    • +
  • matches[i].length == 2
    • +
  • 1 <= winneri, loseri <= 105
    • +
  • winneri != loseri
    • +
  • All matches[i] are unique.
    • +
+",2.0,False,"class Solution { +public: + vector> findWinners(vector>& matches) { + + } +};","class Solution { + public List> findWinners(int[][] matches) { + + } +}","class Solution(object): + def findWinners(self, matches): + """""" + :type matches: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def findWinners(self, matches: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** findWinners(int** matches, int matchesSize, int* matchesColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> FindWinners(int[][] matches) { + + } +}","/** + * @param {number[][]} matches + * @return {number[][]} + */ +var findWinners = function(matches) { + +};","# @param {Integer[][]} matches +# @return {Integer[][]} +def find_winners(matches) + +end","class Solution { + func findWinners(_ matches: [[Int]]) -> [[Int]] { + + } +}","func findWinners(matches [][]int) [][]int { + +}","object Solution { + def findWinners(matches: Array[Array[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun findWinners(matches: Array): List> { + + } +}","impl Solution { + pub fn find_winners(matches: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $matches + * @return Integer[][] + */ + function findWinners($matches) { + + } +}","function findWinners(matches: number[][]): number[][] { + +};","(define/contract (find-winners matches) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec find_winners(Matches :: [[integer()]]) -> [[integer()]]. +find_winners(Matches) -> + .","defmodule Solution do + @spec find_winners(matches :: [[integer]]) :: [[integer]] + def find_winners(matches) do + + end +end","class Solution { + List> findWinners(List> matches) { + + } +}", +1135,maximum-profit-in-job-scheduling,Maximum Profit in Job Scheduling,1235.0,1352.0,"

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].

+ +

You're given the startTime, endTime and profit arrays, return the maximum profit you can take such that there are no two jobs in the subset with overlapping time range.

+ +

If you choose a job that ends at time X you will be able to start another job that starts at time X.

+ +

 

+

Example 1:

+ +

+ +
+Input: startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70]
+Output: 120
+Explanation: The subset chosen is the first and fourth job. 
+Time range [1-3]+[3-6] , we get profit of 120 = 50 + 70.
+
+ +

Example 2:

+ +

+ +
+Input: startTime = [1,2,3,4,6], endTime = [3,5,10,6,9], profit = [20,20,100,70,60]
+Output: 150
+Explanation: The subset chosen is the first, fourth and fifth job. 
+Profit obtained 150 = 20 + 70 + 60.
+
+ +

Example 3:

+ +

+ +
+Input: startTime = [1,1,1], endTime = [2,3,4], profit = [5,6,4]
+Output: 6
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= startTime.length == endTime.length == profit.length <= 5 * 104
    • +
  • 1 <= startTime[i] < endTime[i] <= 109
    • +
  • 1 <= profit[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + int jobScheduling(vector& startTime, vector& endTime, vector& profit) { + + } +};","class Solution { + public int jobScheduling(int[] startTime, int[] endTime, int[] profit) { + + } +}","class Solution(object): + def jobScheduling(self, startTime, endTime, profit): + """""" + :type startTime: List[int] + :type endTime: List[int] + :type profit: List[int] + :rtype: int + """""" + ","class Solution: + def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int: + ","int jobScheduling(int* startTime, int startTimeSize, int* endTime, int endTimeSize, int* profit, int profitSize){ + +}","public class Solution { + public int JobScheduling(int[] startTime, int[] endTime, int[] profit) { + + } +}","/** + * @param {number[]} startTime + * @param {number[]} endTime + * @param {number[]} profit + * @return {number} + */ +var jobScheduling = function(startTime, endTime, profit) { + +};","# @param {Integer[]} start_time +# @param {Integer[]} end_time +# @param {Integer[]} profit +# @return {Integer} +def job_scheduling(start_time, end_time, profit) + +end","class Solution { + func jobScheduling(_ startTime: [Int], _ endTime: [Int], _ profit: [Int]) -> Int { + + } +}","func jobScheduling(startTime []int, endTime []int, profit []int) int { + +}","object Solution { + def jobScheduling(startTime: Array[Int], endTime: Array[Int], profit: Array[Int]): Int = { + + } +}","class Solution { + fun jobScheduling(startTime: IntArray, endTime: IntArray, profit: IntArray): Int { + + } +}","impl Solution { + pub fn job_scheduling(start_time: Vec, end_time: Vec, profit: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $startTime + * @param Integer[] $endTime + * @param Integer[] $profit + * @return Integer + */ + function jobScheduling($startTime, $endTime, $profit) { + + } +}","function jobScheduling(startTime: number[], endTime: number[], profit: number[]): number { + +};","(define/contract (job-scheduling startTime endTime profit) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec job_scheduling(StartTime :: [integer()], EndTime :: [integer()], Profit :: [integer()]) -> integer(). +job_scheduling(StartTime, EndTime, Profit) -> + .","defmodule Solution do + @spec job_scheduling(start_time :: [integer], end_time :: [integer], profit :: [integer]) :: integer + def job_scheduling(start_time, end_time, profit) do + + end +end","class Solution { + int jobScheduling(List startTime, List endTime, List profit) { + + } +}", +1139,maximum-score-of-spliced-array,Maximum Score Of Spliced Array,2321.0,1348.0,"

You are given two 0-indexed integer arrays nums1 and nums2, both of length n.

+ +

You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left...right] with the subarray nums2[left...right].

+ +
    +
  • For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15].
    • +
+ +

You may choose to apply the mentioned operation once or not do anything.

+ +

The score of the arrays is the maximum of sum(nums1) and sum(nums2), where sum(arr) is the sum of all the elements in the array arr.

+ +

Return the maximum possible score.

+ +

A subarray is a contiguous sequence of elements within an array. arr[left...right] denotes the subarray that contains the elements of nums between indices left and right (inclusive).

+ +

 

+

Example 1:

+ +
+Input: nums1 = [60,60,60], nums2 = [10,90,10]
+Output: 210
+Explanation: Choosing left = 1 and right = 1, we have nums1 = [60,90,60] and nums2 = [10,60,10].
+The score is max(sum(nums1), sum(nums2)) = max(210, 80) = 210.
+ +

Example 2:

+ +
+Input: nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]
+Output: 220
+Explanation: Choosing left = 3, right = 4, we have nums1 = [20,40,20,40,20] and nums2 = [50,20,50,70,30].
+The score is max(sum(nums1), sum(nums2)) = max(140, 220) = 220.
+
+ +

Example 3:

+ +
+Input: nums1 = [7,11,13], nums2 = [1,1,1]
+Output: 31
+Explanation: We choose not to swap any subarray.
+The score is max(sum(nums1), sum(nums2)) = max(31, 3) = 31.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= nums1[i], nums2[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + int maximumsSplicedArray(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int maximumsSplicedArray(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def maximumsSplicedArray(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def maximumsSplicedArray(self, nums1: List[int], nums2: List[int]) -> int: + ","int maximumsSplicedArray(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MaximumsSplicedArray(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var maximumsSplicedArray = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def maximums_spliced_array(nums1, nums2) + +end","class Solution { + func maximumsSplicedArray(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func maximumsSplicedArray(nums1 []int, nums2 []int) int { + +}","object Solution { + def maximumsSplicedArray(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun maximumsSplicedArray(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn maximums_spliced_array(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function maximumsSplicedArray($nums1, $nums2) { + + } +}","function maximumsSplicedArray(nums1: number[], nums2: number[]): number { + +};","(define/contract (maximums-spliced-array nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec maximums_spliced_array(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +maximums_spliced_array(Nums1, Nums2) -> + .","defmodule Solution do + @spec maximums_spliced_array(nums1 :: [integer], nums2 :: [integer]) :: integer + def maximums_spliced_array(nums1, nums2) do + + end +end","class Solution { + int maximumsSplicedArray(List nums1, List nums2) { + + } +}", +1141,maximum-equal-frequency,Maximum Equal Frequency,1224.0,1344.0,"

Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exactly one element from this prefix so that every number that has appeared in it will have the same number of occurrences.

+ +

If after removing one element there are no remaining elements, it's still considered that every appeared number has the same number of ocurrences (0).

+ +

 

+

Example 1:

+ +
+Input: nums = [2,2,1,1,5,3,3,5]
+Output: 7
+Explanation: For the subarray [2,2,1,1,5,3,3] of length 7, if we remove nums[4] = 5, we will get [2,2,1,1,3,3], so that each number will appear exactly twice.
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1,2,2,2,3,3,3,4,4,4,5]
+Output: 13
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int maxEqualFreq(vector& nums) { + + } +};","class Solution { + public int maxEqualFreq(int[] nums) { + + } +}","class Solution(object): + def maxEqualFreq(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxEqualFreq(self, nums: List[int]) -> int: + ","int maxEqualFreq(int* nums, int numsSize){ + +}","public class Solution { + public int MaxEqualFreq(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxEqualFreq = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_equal_freq(nums) + +end","class Solution { + func maxEqualFreq(_ nums: [Int]) -> Int { + + } +}","func maxEqualFreq(nums []int) int { + +}","object Solution { + def maxEqualFreq(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxEqualFreq(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_equal_freq(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxEqualFreq($nums) { + + } +}","function maxEqualFreq(nums: number[]): number { + +};","(define/contract (max-equal-freq nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_equal_freq(Nums :: [integer()]) -> integer(). +max_equal_freq(Nums) -> + .","defmodule Solution do + @spec max_equal_freq(nums :: [integer]) :: integer + def max_equal_freq(nums) do + + end +end","class Solution { + int maxEqualFreq(List nums) { + + } +}", +1142,dice-roll-simulation,Dice Roll Simulation,1223.0,1343.0,"

A die simulator generates a random number from 1 to 6 for each roll. You introduced a constraint to the generator such that it cannot roll the number i more than rollMax[i] (1-indexed) consecutive times.

+ +

Given an array of integers rollMax and an integer n, return the number of distinct sequences that can be obtained with exact n rolls. Since the answer may be too large, return it modulo 109 + 7.

+ +

Two sequences are considered different if at least one element differs from each other.

+ +

 

+

Example 1:

+ +
+Input: n = 2, rollMax = [1,1,2,2,2,3]
+Output: 34
+Explanation: There will be 2 rolls of die, if there are no constraints on the die, there are 6 * 6 = 36 possible combinations. In this case, looking at rollMax array, the numbers 1 and 2 appear at most once consecutively, therefore sequences (1,1) and (2,2) cannot occur, so the final answer is 36-2 = 34.
+
+ +

Example 2:

+ +
+Input: n = 2, rollMax = [1,1,1,1,1,1]
+Output: 30
+
+ +

Example 3:

+ +
+Input: n = 3, rollMax = [1,1,1,2,2,3]
+Output: 181
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 5000
    • +
  • rollMax.length == 6
    • +
  • 1 <= rollMax[i] <= 15
    • +
+",3.0,False,"class Solution { +public: + int dieSimulator(int n, vector& rollMax) { + + } +};","class Solution { + public int dieSimulator(int n, int[] rollMax) { + + } +}","class Solution(object): + def dieSimulator(self, n, rollMax): + """""" + :type n: int + :type rollMax: List[int] + :rtype: int + """""" + ","class Solution: + def dieSimulator(self, n: int, rollMax: List[int]) -> int: + ","int dieSimulator(int n, int* rollMax, int rollMaxSize){ + +}","public class Solution { + public int DieSimulator(int n, int[] rollMax) { + + } +}","/** + * @param {number} n + * @param {number[]} rollMax + * @return {number} + */ +var dieSimulator = function(n, rollMax) { + +};","# @param {Integer} n +# @param {Integer[]} roll_max +# @return {Integer} +def die_simulator(n, roll_max) + +end","class Solution { + func dieSimulator(_ n: Int, _ rollMax: [Int]) -> Int { + + } +}","func dieSimulator(n int, rollMax []int) int { + +}","object Solution { + def dieSimulator(n: Int, rollMax: Array[Int]): Int = { + + } +}","class Solution { + fun dieSimulator(n: Int, rollMax: IntArray): Int { + + } +}","impl Solution { + pub fn die_simulator(n: i32, roll_max: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $rollMax + * @return Integer + */ + function dieSimulator($n, $rollMax) { + + } +}","function dieSimulator(n: number, rollMax: number[]): number { + +};","(define/contract (die-simulator n rollMax) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec die_simulator(N :: integer(), RollMax :: [integer()]) -> integer(). +die_simulator(N, RollMax) -> + .","defmodule Solution do + @spec die_simulator(n :: integer, roll_max :: [integer]) :: integer + def die_simulator(n, roll_max) do + + end +end","class Solution { + int dieSimulator(int n, List rollMax) { + + } +}", +1143,queens-that-can-attack-the-king,Queens That Can Attack the King,1222.0,1342.0,"

On a 0-indexed 8 x 8 chessboard, there can be multiple black queens ad one white king.

+ +

You are given a 2D integer array queens where queens[i] = [xQueeni, yQueeni] represents the position of the ith black queen on the chessboard. You are also given an integer array king of length 2 where king = [xKing, yKing] represents the position of the white king.

+ +

Return the coordinates of the black queens that can directly attack the king. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]
+Output: [[0,1],[1,0],[3,3]]
+Explanation: The diagram above shows the three queens that can directly attack the king and the three queens that cannot attack the king (i.e., marked with red dashes).
+
+ +

Example 2:

+ +
+Input: queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]
+Output: [[2,2],[3,4],[4,4]]
+Explanation: The diagram above shows the three queens that can directly attack the king and the three queens that cannot attack the king (i.e., marked with red dashes).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= queens.length < 64
    • +
  • queens[i].length == king.length == 2
    • +
  • 0 <= xQueeni, yQueeni, xKing, yKing < 8
    • +
  • All the given positions are unique.
    • +
+",2.0,False,"class Solution { +public: + vector> queensAttacktheKing(vector>& queens, vector& king) { + + } +};","class Solution { + public List> queensAttacktheKing(int[][] queens, int[] king) { + + } +}","class Solution(object): + def queensAttacktheKing(self, queens, king): + """""" + :type queens: List[List[int]] + :type king: List[int] + :rtype: List[List[int]] + """""" + ","class Solution: + def queensAttacktheKing(self, queens: List[List[int]], king: List[int]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** queensAttacktheKing(int** queens, int queensSize, int* queensColSize, int* king, int kingSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> QueensAttacktheKing(int[][] queens, int[] king) { + + } +}","/** + * @param {number[][]} queens + * @param {number[]} king + * @return {number[][]} + */ +var queensAttacktheKing = function(queens, king) { + +};","# @param {Integer[][]} queens +# @param {Integer[]} king +# @return {Integer[][]} +def queens_attackthe_king(queens, king) + +end","class Solution { + func queensAttacktheKing(_ queens: [[Int]], _ king: [Int]) -> [[Int]] { + + } +}","func queensAttacktheKing(queens [][]int, king []int) [][]int { + +}","object Solution { + def queensAttacktheKing(queens: Array[Array[Int]], king: Array[Int]): List[List[Int]] = { + + } +}","class Solution { + fun queensAttacktheKing(queens: Array, king: IntArray): List> { + + } +}","impl Solution { + pub fn queens_attackthe_king(queens: Vec>, king: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $queens + * @param Integer[] $king + * @return Integer[][] + */ + function queensAttacktheKing($queens, $king) { + + } +}","function queensAttacktheKing(queens: number[][], king: number[]): number[][] { + +};","(define/contract (queens-attackthe-king queens king) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof (listof exact-integer?))) + + )","-spec queens_attackthe_king(Queens :: [[integer()]], King :: [integer()]) -> [[integer()]]. +queens_attackthe_king(Queens, King) -> + .","defmodule Solution do + @spec queens_attackthe_king(queens :: [[integer]], king :: [integer]) :: [[integer]] + def queens_attackthe_king(queens, king) do + + end +end","class Solution { + List> queensAttacktheKing(List> queens, List king) { + + } +}", +1145,design-skiplist,Design Skiplist,1206.0,1337.0,"

Design a Skiplist without using any built-in libraries.

+ +

A skiplist is a data structure that takes O(log(n)) time to add, erase and search. Comparing with treap and red-black tree which has the same function and performance, the code length of Skiplist can be comparatively short and the idea behind Skiplists is just simple linked lists.

+ +

For example, we have a Skiplist containing [30,40,50,60,70,90] and we want to add 80 and 45 into it. The Skiplist works this way:

+ +


+Artyom Kalinin [CC BY-SA 3.0], via Wikimedia Commons

+ +

You can see there are many layers in the Skiplist. Each layer is a sorted linked list. With the help of the top layers, add, erase and search can be faster than O(n). It can be proven that the average time complexity for each operation is O(log(n)) and space complexity is O(n).

+ +

See more about Skiplist: https://en.wikipedia.org/wiki/Skip_list

+ +

Implement the Skiplist class:

+ +
    +
  • Skiplist() Initializes the object of the skiplist.
    • +
  • bool search(int target) Returns true if the integer target exists in the Skiplist or false otherwise.
    • +
  • void add(int num) Inserts the value num into the SkipList.
    • +
  • bool erase(int num) Removes the value num from the Skiplist and returns true. If num does not exist in the Skiplist, do nothing and return false. If there exist multiple num values, removing any one of them is fine.
    • +
+ +

Note that duplicates may exist in the Skiplist, your code needs to handle this situation.

+ +

 

+

Example 1:

+ +
+Input
+["Skiplist", "add", "add", "add", "search", "add", "search", "erase", "erase", "search"]
+[[], [1], [2], [3], [0], [4], [1], [0], [1], [1]]
+Output
+[null, null, null, null, false, null, true, false, true, false]
+
+Explanation
+Skiplist skiplist = new Skiplist();
+skiplist.add(1);
+skiplist.add(2);
+skiplist.add(3);
+skiplist.search(0); // return False
+skiplist.add(4);
+skiplist.search(1); // return True
+skiplist.erase(0);  // return False, 0 is not in skiplist.
+skiplist.erase(1);  // return True
+skiplist.search(1); // return False, 1 has already been erased.
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num, target <= 2 * 104
    • +
  • At most 5 * 104 calls will be made to search, add, and erase.
    • +
+",3.0,False,"class Skiplist { +public: + Skiplist() { + + } + + bool search(int target) { + + } + + void add(int num) { + + } + + bool erase(int num) { + + } +}; + +/** + * Your Skiplist object will be instantiated and called as such: + * Skiplist* obj = new Skiplist(); + * bool param_1 = obj->search(target); + * obj->add(num); + * bool param_3 = obj->erase(num); + */","class Skiplist { + + public Skiplist() { + + } + + public boolean search(int target) { + + } + + public void add(int num) { + + } + + public boolean erase(int num) { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * Skiplist obj = new Skiplist(); + * boolean param_1 = obj.search(target); + * obj.add(num); + * boolean param_3 = obj.erase(num); + */","class Skiplist(object): + + def __init__(self): + + + def search(self, target): + """""" + :type target: int + :rtype: bool + """""" + + + def add(self, num): + """""" + :type num: int + :rtype: None + """""" + + + def erase(self, num): + """""" + :type num: int + :rtype: bool + """""" + + + +# Your Skiplist object will be instantiated and called as such: +# obj = Skiplist() +# param_1 = obj.search(target) +# obj.add(num) +# param_3 = obj.erase(num)","class Skiplist: + + def __init__(self): + + + def search(self, target: int) -> bool: + + + def add(self, num: int) -> None: + + + def erase(self, num: int) -> bool: + + + +# Your Skiplist object will be instantiated and called as such: +# obj = Skiplist() +# param_1 = obj.search(target) +# obj.add(num) +# param_3 = obj.erase(num)"," + + +typedef struct { + +} Skiplist; + + +Skiplist* skiplistCreate() { + +} + +bool skiplistSearch(Skiplist* obj, int target) { + +} + +void skiplistAdd(Skiplist* obj, int num) { + +} + +bool skiplistErase(Skiplist* obj, int num) { + +} + +void skiplistFree(Skiplist* obj) { + +} + +/** + * Your Skiplist struct will be instantiated and called as such: + * Skiplist* obj = skiplistCreate(); + * bool param_1 = skiplistSearch(obj, target); + + * skiplistAdd(obj, num); + + * bool param_3 = skiplistErase(obj, num); + + * skiplistFree(obj); +*/","public class Skiplist { + + public Skiplist() { + + } + + public bool Search(int target) { + + } + + public void Add(int num) { + + } + + public bool Erase(int num) { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * Skiplist obj = new Skiplist(); + * bool param_1 = obj.Search(target); + * obj.Add(num); + * bool param_3 = obj.Erase(num); + */"," +var Skiplist = function() { + +}; + +/** + * @param {number} target + * @return {boolean} + */ +Skiplist.prototype.search = function(target) { + +}; + +/** + * @param {number} num + * @return {void} + */ +Skiplist.prototype.add = function(num) { + +}; + +/** + * @param {number} num + * @return {boolean} + */ +Skiplist.prototype.erase = function(num) { + +}; + +/** + * Your Skiplist object will be instantiated and called as such: + * var obj = new Skiplist() + * var param_1 = obj.search(target) + * obj.add(num) + * var param_3 = obj.erase(num) + */","class Skiplist + def initialize() + + end + + +=begin + :type target: Integer + :rtype: Boolean +=end + def search(target) + + end + + +=begin + :type num: Integer + :rtype: Void +=end + def add(num) + + end + + +=begin + :type num: Integer + :rtype: Boolean +=end + def erase(num) + + end + + +end + +# Your Skiplist object will be instantiated and called as such: +# obj = Skiplist.new() +# param_1 = obj.search(target) +# obj.add(num) +# param_3 = obj.erase(num)"," +class Skiplist { + + init() { + + } + + func search(_ target: Int) -> Bool { + + } + + func add(_ num: Int) { + + } + + func erase(_ num: Int) -> Bool { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * let obj = Skiplist() + * let ret_1: Bool = obj.search(target) + * obj.add(num) + * let ret_3: Bool = obj.erase(num) + */","type Skiplist struct { + +} + + +func Constructor() Skiplist { + +} + + +func (this *Skiplist) Search(target int) bool { + +} + + +func (this *Skiplist) Add(num int) { + +} + + +func (this *Skiplist) Erase(num int) bool { + +} + + +/** + * Your Skiplist object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Search(target); + * obj.Add(num); + * param_3 := obj.Erase(num); + */","class Skiplist() { + + def search(target: Int): Boolean = { + + } + + def add(num: Int) { + + } + + def erase(num: Int): Boolean = { + + } + +} + +/** + * Your Skiplist object will be instantiated and called as such: + * var obj = new Skiplist() + * var param_1 = obj.search(target) + * obj.add(num) + * var param_3 = obj.erase(num) + */","class Skiplist() { + + fun search(target: Int): Boolean { + + } + + fun add(num: Int) { + + } + + fun erase(num: Int): Boolean { + + } + +} + +/** + * Your Skiplist object will be instantiated and called as such: + * var obj = Skiplist() + * var param_1 = obj.search(target) + * obj.add(num) + * var param_3 = obj.erase(num) + */","struct Skiplist { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Skiplist { + + fn new() -> Self { + + } + + fn search(&self, target: i32) -> bool { + + } + + fn add(&self, num: i32) { + + } + + fn erase(&self, num: i32) -> bool { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * let obj = Skiplist::new(); + * let ret_1: bool = obj.search(target); + * obj.add(num); + * let ret_3: bool = obj.erase(num); + */","class Skiplist { + /** + */ + function __construct() { + + } + + /** + * @param Integer $target + * @return Boolean + */ + function search($target) { + + } + + /** + * @param Integer $num + * @return NULL + */ + function add($num) { + + } + + /** + * @param Integer $num + * @return Boolean + */ + function erase($num) { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * $obj = Skiplist(); + * $ret_1 = $obj->search($target); + * $obj->add($num); + * $ret_3 = $obj->erase($num); + */","class Skiplist { + constructor() { + + } + + search(target: number): boolean { + + } + + add(num: number): void { + + } + + erase(num: number): boolean { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * var obj = new Skiplist() + * var param_1 = obj.search(target) + * obj.add(num) + * var param_3 = obj.erase(num) + */","(define skiplist% + (class object% + (super-new) + (init-field) + + ; search : exact-integer? -> boolean? + (define/public (search target) + + ) + ; add : exact-integer? -> void? + (define/public (add num) + + ) + ; erase : exact-integer? -> boolean? + (define/public (erase num) + + ))) + +;; Your skiplist% object will be instantiated and called as such: +;; (define obj (new skiplist%)) +;; (define param_1 (send obj search target)) +;; (send obj add num) +;; (define param_3 (send obj erase num))","-spec skiplist_init_() -> any(). +skiplist_init_() -> + . + +-spec skiplist_search(Target :: integer()) -> boolean(). +skiplist_search(Target) -> + . + +-spec skiplist_add(Num :: integer()) -> any(). +skiplist_add(Num) -> + . + +-spec skiplist_erase(Num :: integer()) -> boolean(). +skiplist_erase(Num) -> + . + + +%% Your functions will be called as such: +%% skiplist_init_(), +%% Param_1 = skiplist_search(Target), +%% skiplist_add(Num), +%% Param_3 = skiplist_erase(Num), + +%% skiplist_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Skiplist do + @spec init_() :: any + def init_() do + + end + + @spec search(target :: integer) :: boolean + def search(target) do + + end + + @spec add(num :: integer) :: any + def add(num) do + + end + + @spec erase(num :: integer) :: boolean + def erase(num) do + + end +end + +# Your functions will be called as such: +# Skiplist.init_() +# param_1 = Skiplist.search(target) +# Skiplist.add(num) +# param_3 = Skiplist.erase(num) + +# Skiplist.init_ will be called before every test case, in which you can do some necessary initializations.","class Skiplist { + + Skiplist() { + + } + + bool search(int target) { + + } + + void add(int num) { + + } + + bool erase(int num) { + + } +} + +/** + * Your Skiplist object will be instantiated and called as such: + * Skiplist obj = Skiplist(); + * bool param1 = obj.search(target); + * obj.add(num); + * bool param3 = obj.erase(num); + */", +1146,maximum-product-of-the-length-of-two-palindromic-substrings,Maximum Product of the Length of Two Palindromic Substrings,1960.0,1336.0,"

You are given a 0-indexed string s and are tasked with finding two non-intersecting palindromic substrings of odd length such that the product of their lengths is maximized.

+ +

More formally, you want to choose four integers i, j, k, l such that 0 <= i <= j < k <= l < s.length and both the substrings s[i...j] and s[k...l] are palindromes and have odd lengths. s[i...j] denotes a substring from index i to index j inclusive.

+ +

Return the maximum possible product of the lengths of the two non-intersecting palindromic substrings.

+ +

A palindrome is a string that is the same forward and backward. A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: s = "ababbb"
+Output: 9
+Explanation: Substrings "aba" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
+
+ +

Example 2:

+ +
+Input: s = "zaaaxbbby"
+Output: 9
+Explanation: Substrings "aaa" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + long long maxProduct(string s) { + + } +};","class Solution { + public long maxProduct(String s) { + + } +}","class Solution(object): + def maxProduct(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def maxProduct(self, s: str) -> int: + ","long long maxProduct(char * s){ + +}","public class Solution { + public long MaxProduct(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var maxProduct = function(s) { + +};","# @param {String} s +# @return {Integer} +def max_product(s) + +end","class Solution { + func maxProduct(_ s: String) -> Int { + + } +}","func maxProduct(s string) int64 { + +}","object Solution { + def maxProduct(s: String): Long = { + + } +}","class Solution { + fun maxProduct(s: String): Long { + + } +}","impl Solution { + pub fn max_product(s: String) -> i64 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function maxProduct($s) { + + } +}","function maxProduct(s: string): number { + +};","(define/contract (max-product s) + (-> string? exact-integer?) + + )","-spec max_product(S :: unicode:unicode_binary()) -> integer(). +max_product(S) -> + .","defmodule Solution do + @spec max_product(s :: String.t) :: integer + def max_product(s) do + + end +end","class Solution { + int maxProduct(String s) { + + } +}", +1149,sort-the-jumbled-numbers,Sort the Jumbled Numbers,2191.0,1333.0,"

You are given a 0-indexed integer array mapping which represents the mapping rule of a shuffled decimal system. mapping[i] = j means digit i should be mapped to digit j in this system.

+ +

The mapped value of an integer is the new integer obtained by replacing each occurrence of digit i in the integer with mapping[i] for all 0 <= i <= 9.

+ +

You are also given another integer array nums. Return the array nums sorted in non-decreasing order based on the mapped values of its elements.

+ +

Notes:

+ +
    +
  • Elements with the same mapped values should appear in the same relative order as in the input.
    • +
  • The elements of nums should only be sorted based on their mapped values and not be replaced by them.
    • +
+ +

 

+

Example 1:

+ +
+Input: mapping = [8,9,4,0,2,1,3,5,7,6], nums = [991,338,38]
+Output: [338,38,991]
+Explanation: 
+Map the number 991 as follows:
+1. mapping[9] = 6, so all occurrences of the digit 9 will become 6.
+2. mapping[1] = 9, so all occurrences of the digit 1 will become 9.
+Therefore, the mapped value of 991 is 669.
+338 maps to 007, or 7 after removing the leading zeros.
+38 maps to 07, which is also 7 after removing leading zeros.
+Since 338 and 38 share the same mapped value, they should remain in the same relative order, so 338 comes before 38.
+Thus, the sorted array is [338,38,991].
+
+ +

Example 2:

+ +
+Input: mapping = [0,1,2,3,4,5,6,7,8,9], nums = [789,456,123]
+Output: [123,456,789]
+Explanation: 789 maps to 789, 456 maps to 456, and 123 maps to 123. Thus, the sorted array is [123,456,789].
+
+ +

 

+

Constraints:

+ +
    +
  • mapping.length == 10
    • +
  • 0 <= mapping[i] <= 9
    • +
  • All the values of mapping[i] are unique.
    • +
  • 1 <= nums.length <= 3 * 104
    • +
  • 0 <= nums[i] < 109
    • +
+",2.0,False,"class Solution { +public: + vector sortJumbled(vector& mapping, vector& nums) { + + } +};","class Solution { + public int[] sortJumbled(int[] mapping, int[] nums) { + + } +}","class Solution(object): + def sortJumbled(self, mapping, nums): + """""" + :type mapping: List[int] + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def sortJumbled(self, mapping: List[int], nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sortJumbled(int* mapping, int mappingSize, int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] SortJumbled(int[] mapping, int[] nums) { + + } +}","/** + * @param {number[]} mapping + * @param {number[]} nums + * @return {number[]} + */ +var sortJumbled = function(mapping, nums) { + +};","# @param {Integer[]} mapping +# @param {Integer[]} nums +# @return {Integer[]} +def sort_jumbled(mapping, nums) + +end","class Solution { + func sortJumbled(_ mapping: [Int], _ nums: [Int]) -> [Int] { + + } +}","func sortJumbled(mapping []int, nums []int) []int { + +}","object Solution { + def sortJumbled(mapping: Array[Int], nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun sortJumbled(mapping: IntArray, nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn sort_jumbled(mapping: Vec, nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $mapping + * @param Integer[] $nums + * @return Integer[] + */ + function sortJumbled($mapping, $nums) { + + } +}","function sortJumbled(mapping: number[], nums: number[]): number[] { + +};","(define/contract (sort-jumbled mapping nums) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec sort_jumbled(Mapping :: [integer()], Nums :: [integer()]) -> [integer()]. +sort_jumbled(Mapping, Nums) -> + .","defmodule Solution do + @spec sort_jumbled(mapping :: [integer], nums :: [integer]) :: [integer] + def sort_jumbled(mapping, nums) do + + end +end","class Solution { + List sortJumbled(List mapping, List nums) { + + } +}", +1150,count-vowels-permutation,Count Vowels Permutation,1220.0,1332.0,"

Given an integer n, your task is to count how many strings of length n can be formed under the following rules:

+ +
    +
  • Each character is a lower case vowel ('a', 'e', 'i', 'o', 'u')
    • +
  • Each vowel 'a' may only be followed by an 'e'.
    • +
  • Each vowel 'e' may only be followed by an 'a' or an 'i'.
    • +
  • Each vowel 'i' may not be followed by another 'i'.
    • +
  • Each vowel 'o' may only be followed by an 'i' or a 'u'.
    • +
  • Each vowel 'u' may only be followed by an 'a'.
    • +
+ +

Since the answer may be too large, return it modulo 10^9 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 5
+Explanation: All possible strings are: "a", "e", "i" , "o" and "u".
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 10
+Explanation: All possible strings are: "ae", "ea", "ei", "ia", "ie", "io", "iu", "oi", "ou" and "ua".
+
+ +

Example 3: 

+ +
+Input: n = 5
+Output: 68
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 10^4
    • +
+",3.0,False,"class Solution { +public: + int countVowelPermutation(int n) { + + } +};","class Solution { + public int countVowelPermutation(int n) { + + } +}","class Solution(object): + def countVowelPermutation(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countVowelPermutation(self, n: int) -> int: + ","int countVowelPermutation(int n){ + +}","public class Solution { + public int CountVowelPermutation(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countVowelPermutation = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_vowel_permutation(n) + +end","class Solution { + func countVowelPermutation(_ n: Int) -> Int { + + } +}","func countVowelPermutation(n int) int { + +}","object Solution { + def countVowelPermutation(n: Int): Int = { + + } +}","class Solution { + fun countVowelPermutation(n: Int): Int { + + } +}","impl Solution { + pub fn count_vowel_permutation(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countVowelPermutation($n) { + + } +}","function countVowelPermutation(n: number): number { + +};","(define/contract (count-vowel-permutation n) + (-> exact-integer? exact-integer?) + + )","-spec count_vowel_permutation(N :: integer()) -> integer(). +count_vowel_permutation(N) -> + .","defmodule Solution do + @spec count_vowel_permutation(n :: integer) :: integer + def count_vowel_permutation(n) do + + end +end","class Solution { + int countVowelPermutation(int n) { + + } +}", +1151,path-with-maximum-gold,Path with Maximum Gold,1219.0,1331.0,"

In a gold mine grid of size m x n, each cell in this mine has an integer representing the amount of gold in that cell, 0 if it is empty.

+ +

Return the maximum amount of gold you can collect under the conditions:

+ +
    +
  • Every time you are located in a cell you will collect all the gold in that cell.
    • +
  • From your position, you can walk one step to the left, right, up, or down.
    • +
  • You can't visit the same cell more than once.
    • +
  • Never visit a cell with 0 gold.
    • +
  • You can start and stop collecting gold from any position in the grid that has some gold.
    • +
+ +

 

+

Example 1:

+ +
+Input: grid = [[0,6,0],[5,8,7],[0,9,0]]
+Output: 24
+Explanation:
+[[0,6,0],
+ [5,8,7],
+ [0,9,0]]
+Path to get the maximum gold, 9 -> 8 -> 7.
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,7],[2,0,6],[3,4,5],[0,3,0],[9,0,20]]
+Output: 28
+Explanation:
+[[1,0,7],
+ [2,0,6],
+ [3,4,5],
+ [0,3,0],
+ [9,0,20]]
+Path to get the maximum gold, 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 15
    • +
  • 0 <= grid[i][j] <= 100
    • +
  • There are at most 25 cells containing gold.
    • +
+",2.0,False,"class Solution { +public: + int getMaximumGold(vector>& grid) { + + } +};","class Solution { + public int getMaximumGold(int[][] grid) { + + } +}","class Solution(object): + def getMaximumGold(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def getMaximumGold(self, grid: List[List[int]]) -> int: + ","int getMaximumGold(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int GetMaximumGold(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var getMaximumGold = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def get_maximum_gold(grid) + +end","class Solution { + func getMaximumGold(_ grid: [[Int]]) -> Int { + + } +}","func getMaximumGold(grid [][]int) int { + +}","object Solution { + def getMaximumGold(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun getMaximumGold(grid: Array): Int { + + } +}","impl Solution { + pub fn get_maximum_gold(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function getMaximumGold($grid) { + + } +}","function getMaximumGold(grid: number[][]): number { + +};","(define/contract (get-maximum-gold grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec get_maximum_gold(Grid :: [[integer()]]) -> integer(). +get_maximum_gold(Grid) -> + .","defmodule Solution do + @spec get_maximum_gold(grid :: [[integer]]) :: integer + def get_maximum_gold(grid) do + + end +end","class Solution { + int getMaximumGold(List> grid) { + + } +}", +1152,longest-arithmetic-subsequence-of-given-difference,Longest Arithmetic Subsequence of Given Difference,1218.0,1330.0,"

Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent elements in the subsequence equals difference.

+ +

A subsequence is a sequence that can be derived from arr by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,4], difference = 1
+Output: 4
+Explanation: The longest arithmetic subsequence is [1,2,3,4].
+ +

Example 2:

+ +
+Input: arr = [1,3,5,7], difference = 1
+Output: 1
+Explanation: The longest arithmetic subsequence is any single element.
+
+ +

Example 3:

+ +
+Input: arr = [1,5,7,8,5,3,4,2,1], difference = -2
+Output: 4
+Explanation: The longest arithmetic subsequence is [7,5,3,1].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • -104 <= arr[i], difference <= 104
    • +
+",2.0,False,"class Solution { +public: + int longestSubsequence(vector& arr, int difference) { + + } +};","class Solution { + public int longestSubsequence(int[] arr, int difference) { + + } +}","class Solution(object): + def longestSubsequence(self, arr, difference): + """""" + :type arr: List[int] + :type difference: int + :rtype: int + """""" + ","class Solution: + def longestSubsequence(self, arr: List[int], difference: int) -> int: + ","int longestSubsequence(int* arr, int arrSize, int difference){ + +}","public class Solution { + public int LongestSubsequence(int[] arr, int difference) { + + } +}","/** + * @param {number[]} arr + * @param {number} difference + * @return {number} + */ +var longestSubsequence = function(arr, difference) { + +};","# @param {Integer[]} arr +# @param {Integer} difference +# @return {Integer} +def longest_subsequence(arr, difference) + +end","class Solution { + func longestSubsequence(_ arr: [Int], _ difference: Int) -> Int { + + } +}","func longestSubsequence(arr []int, difference int) int { + +}","object Solution { + def longestSubsequence(arr: Array[Int], difference: Int): Int = { + + } +}","class Solution { + fun longestSubsequence(arr: IntArray, difference: Int): Int { + + } +}","impl Solution { + pub fn longest_subsequence(arr: Vec, difference: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $difference + * @return Integer + */ + function longestSubsequence($arr, $difference) { + + } +}","function longestSubsequence(arr: number[], difference: number): number { + +};","(define/contract (longest-subsequence arr difference) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec longest_subsequence(Arr :: [integer()], Difference :: integer()) -> integer(). +longest_subsequence(Arr, Difference) -> + .","defmodule Solution do + @spec longest_subsequence(arr :: [integer], difference :: integer) :: integer + def longest_subsequence(arr, difference) do + + end +end","class Solution { + int longestSubsequence(List arr, int difference) { + + } +}", +1154,sum-of-floored-pairs,Sum of Floored Pairs,1862.0,1326.0,"

Given an integer array nums, return the sum of floor(nums[i] / nums[j]) for all pairs of indices 0 <= i, j < nums.length in the array. Since the answer may be too large, return it modulo 109 + 7.

+ +

The floor() function returns the integer part of the division.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,5,9]
+Output: 10
+Explanation:
+floor(2 / 5) = floor(2 / 9) = floor(5 / 9) = 0
+floor(2 / 2) = floor(5 / 5) = floor(9 / 9) = 1
+floor(5 / 2) = 2
+floor(9 / 2) = 4
+floor(9 / 5) = 1
+We calculate the floor of the division for every pair of indices in the array then sum them up.
+
+ +

Example 2:

+ +
+Input: nums = [7,7,7,7,7,7,7]
+Output: 49
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int sumOfFlooredPairs(vector& nums) { + + } +};","class Solution { + public int sumOfFlooredPairs(int[] nums) { + + } +}","class Solution(object): + def sumOfFlooredPairs(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumOfFlooredPairs(self, nums: List[int]) -> int: + ","int sumOfFlooredPairs(int* nums, int numsSize){ + +}","public class Solution { + public int SumOfFlooredPairs(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumOfFlooredPairs = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_of_floored_pairs(nums) + +end","class Solution { + func sumOfFlooredPairs(_ nums: [Int]) -> Int { + + } +}","func sumOfFlooredPairs(nums []int) int { + +}","object Solution { + def sumOfFlooredPairs(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumOfFlooredPairs(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_of_floored_pairs(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumOfFlooredPairs($nums) { + + } +}","function sumOfFlooredPairs(nums: number[]): number { + +};","(define/contract (sum-of-floored-pairs nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_of_floored_pairs(Nums :: [integer()]) -> integer(). +sum_of_floored_pairs(Nums) -> + .","defmodule Solution do + @spec sum_of_floored_pairs(nums :: [integer]) :: integer + def sum_of_floored_pairs(nums) do + + end +end","class Solution { + int sumOfFlooredPairs(List nums) { + + } +}", +1156,where-will-the-ball-fall,Where Will the Ball Fall,1706.0,1324.0,"

You have a 2-D grid of size m x n representing a box, and you have n balls. The box is open on the top and bottom sides.

+ +

Each cell in the box has a diagonal board spanning two corners of the cell that can redirect a ball to the right or to the left.

+ +
    +
  • A board that redirects the ball to the right spans the top-left corner to the bottom-right corner and is represented in the grid as 1.
    • +
  • A board that redirects the ball to the left spans the top-right corner to the bottom-left corner and is represented in the grid as -1.
    • +
+ +

We drop one ball at the top of each column of the box. Each ball can get stuck in the box or fall out of the bottom. A ball gets stuck if it hits a "V" shaped pattern between two boards or if a board redirects the ball into either wall of the box.

+ +

Return an array answer of size n where answer[i] is the column that the ball falls out of at the bottom after dropping the ball from the ith column at the top, or -1 if the ball gets stuck in the box.

+ +

 

+

Example 1:

+ +

+ +
+Input: grid = [[1,1,1,-1,-1],[1,1,1,-1,-1],[-1,-1,-1,1,1],[1,1,1,1,-1],[-1,-1,-1,-1,-1]]
+Output: [1,-1,-1,-1,-1]
+Explanation: This example is shown in the photo.
+Ball b0 is dropped at column 0 and falls out of the box at column 1.
+Ball b1 is dropped at column 1 and will get stuck in the box between column 2 and 3 and row 1.
+Ball b2 is dropped at column 2 and will get stuck on the box between column 2 and 3 and row 0.
+Ball b3 is dropped at column 3 and will get stuck on the box between column 2 and 3 and row 0.
+Ball b4 is dropped at column 4 and will get stuck on the box between column 2 and 3 and row 1.
+
+ +

Example 2:

+ +
+Input: grid = [[-1]]
+Output: [-1]
+Explanation: The ball gets stuck against the left wall.
+
+ +

Example 3:

+ +
+Input: grid = [[1,1,1,1,1,1],[-1,-1,-1,-1,-1,-1],[1,1,1,1,1,1],[-1,-1,-1,-1,-1,-1]]
+Output: [0,1,2,3,4,-1]
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 100
    • +
  • grid[i][j] is 1 or -1.
    • +
+",2.0,False,"class Solution { +public: + vector findBall(vector>& grid) { + + } +};","class Solution { + public int[] findBall(int[][] grid) { + + } +}","class Solution(object): + def findBall(self, grid): + """""" + :type grid: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findBall(self, grid: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findBall(int** grid, int gridSize, int* gridColSize, int* returnSize){ + +}","public class Solution { + public int[] FindBall(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number[]} + */ +var findBall = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer[]} +def find_ball(grid) + +end","class Solution { + func findBall(_ grid: [[Int]]) -> [Int] { + + } +}","func findBall(grid [][]int) []int { + +}","object Solution { + def findBall(grid: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun findBall(grid: Array): IntArray { + + } +}","impl Solution { + pub fn find_ball(grid: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer[] + */ + function findBall($grid) { + + } +}","function findBall(grid: number[][]): number[] { + +};","(define/contract (find-ball grid) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_ball(Grid :: [[integer()]]) -> [integer()]. +find_ball(Grid) -> + .","defmodule Solution do + @spec find_ball(grid :: [[integer]]) :: [integer] + def find_ball(grid) do + + end +end","class Solution { + List findBall(List> grid) { + + } +}", +1157,minimum-moves-to-reach-target-with-rotations,Minimum Moves to Reach Target with Rotations,1210.0,1322.0,"

In an n*n grid, there is a snake that spans 2 cells and starts moving from the top left corner at (0, 0) and (0, 1). The grid has empty cells represented by zeros and blocked cells represented by ones. The snake wants to reach the lower right corner at (n-1, n-2) and (n-1, n-1).

+ +

In one move the snake can:

+ +
    +
  • Move one cell to the right if there are no blocked cells there. This move keeps the horizontal/vertical position of the snake as it is.
    • +
  • Move down one cell if there are no blocked cells there. This move keeps the horizontal/vertical position of the snake as it is.
    • +
  • Rotate clockwise if it's in a horizontal position and the two cells under it are both empty. In that case the snake moves from (r, c) and (r, c+1) to (r, c) and (r+1, c).
    +
    • +
  • Rotate counterclockwise if it's in a vertical position and the two cells to its right are both empty. In that case the snake moves from (r, c) and (r+1, c) to (r, c) and (r, c+1).
    +
    • +
+ +

Return the minimum number of moves to reach the target.

+ +

If there is no way to reach the target, return -1.

+ +

 

+

Example 1:

+ +

+ +
+Input: grid = [[0,0,0,0,0,1],
+               [1,1,0,0,1,0],
+               [0,0,0,0,1,1],
+               [0,0,1,0,1,0],
+               [0,1,1,0,0,0],
+               [0,1,1,0,0,0]]
+Output: 11
+Explanation:
+One possible solution is [right, right, rotate clockwise, right, down, down, down, down, rotate counterclockwise, right, down].
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,1,1,1,1],
+               [0,0,0,0,1,1],
+               [1,1,0,0,0,1],
+               [1,1,1,0,0,1],
+               [1,1,1,0,0,1],
+               [1,1,1,0,0,0]]
+Output: 9
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 100
    • +
  • 0 <= grid[i][j] <= 1
    • +
  • It is guaranteed that the snake starts at empty cells.
    • +
+",3.0,False,"class Solution { +public: + int minimumMoves(vector>& grid) { + + } +};","class Solution { + public int minimumMoves(int[][] grid) { + + } +}","class Solution(object): + def minimumMoves(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minimumMoves(self, grid: List[List[int]]) -> int: + "," + +int minimumMoves(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinimumMoves(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minimumMoves = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def minimum_moves(grid) + +end","class Solution { + func minimumMoves(_ grid: [[Int]]) -> Int { + + } +}","func minimumMoves(grid [][]int) int { + +}","object Solution { + def minimumMoves(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minimumMoves(grid: Array): Int { + + } +}","impl Solution { + pub fn minimum_moves(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minimumMoves($grid) { + + } +}","function minimumMoves(grid: number[][]): number { + +};",,,,, +1159,remove-all-adjacent-duplicates-in-string-ii,Remove All Adjacent Duplicates in String II,1209.0,1320.0,"

You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together.

+ +

We repeatedly make k duplicate removals on s until we no longer can.

+ +

Return the final string after all such duplicate removals have been made. It is guaranteed that the answer is unique.

+ +

 

+

Example 1:

+ +
+Input: s = "abcd", k = 2
+Output: "abcd"
+Explanation: There's nothing to delete.
+ +

Example 2:

+ +
+Input: s = "deeedbbcccbdaa", k = 3
+Output: "aa"
+Explanation: 
+First delete "eee" and "ccc", get "ddbbbdaa"
+Then delete "bbb", get "dddaa"
+Finally delete "ddd", get "aa"
+ +

Example 3:

+ +
+Input: s = "pbbcggttciiippooaais", k = 2
+Output: "ps"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • 2 <= k <= 104
    • +
  • s only contains lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string removeDuplicates(string s, int k) { + + } +};","class Solution { + public String removeDuplicates(String s, int k) { + + } +}","class Solution(object): + def removeDuplicates(self, s, k): + """""" + :type s: str + :type k: int + :rtype: str + """""" + ","class Solution: + def removeDuplicates(self, s: str, k: int) -> str: + ","char * removeDuplicates(char * s, int k){ + +}","public class Solution { + public string RemoveDuplicates(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var removeDuplicates = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {String} +def remove_duplicates(s, k) + +end","class Solution { + func removeDuplicates(_ s: String, _ k: Int) -> String { + + } +}","func removeDuplicates(s string, k int) string { + +}","object Solution { + def removeDuplicates(s: String, k: Int): String = { + + } +}","class Solution { + fun removeDuplicates(s: String, k: Int): String { + + } +}","impl Solution { + pub fn remove_duplicates(s: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return String + */ + function removeDuplicates($s, $k) { + + } +}","function removeDuplicates(s: string, k: number): string { + +};","(define/contract (remove-duplicates s k) + (-> string? exact-integer? string?) + + )","-spec remove_duplicates(S :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +remove_duplicates(S, K) -> + .","defmodule Solution do + @spec remove_duplicates(s :: String.t, k :: integer) :: String.t + def remove_duplicates(s, k) do + + end +end","class Solution { + String removeDuplicates(String s, int k) { + + } +}", +1160,unique-number-of-occurrences,Unique Number of Occurrences,1207.0,1319.0,"

Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,2,1,1,3]
+Output: true
+Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.
+ +

Example 2:

+ +
+Input: arr = [1,2]
+Output: false
+
+ +

Example 3:

+ +
+Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 1000
    • +
  • -1000 <= arr[i] <= 1000
    • +
+",1.0,False,"class Solution { +public: + bool uniqueOccurrences(vector& arr) { + + } +};","class Solution { + public boolean uniqueOccurrences(int[] arr) { + + } +}","class Solution(object): + def uniqueOccurrences(self, arr): + """""" + :type arr: List[int] + :rtype: bool + """""" + ","class Solution: + def uniqueOccurrences(self, arr: List[int]) -> bool: + ","bool uniqueOccurrences(int* arr, int arrSize){ + +}","public class Solution { + public bool UniqueOccurrences(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {boolean} + */ +var uniqueOccurrences = function(arr) { + +};","# @param {Integer[]} arr +# @return {Boolean} +def unique_occurrences(arr) + +end","class Solution { + func uniqueOccurrences(_ arr: [Int]) -> Bool { + + } +}","func uniqueOccurrences(arr []int) bool { + +}","object Solution { + def uniqueOccurrences(arr: Array[Int]): Boolean = { + + } +}","class Solution { + fun uniqueOccurrences(arr: IntArray): Boolean { + + } +}","impl Solution { + pub fn unique_occurrences(arr: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Boolean + */ + function uniqueOccurrences($arr) { + + } +}","function uniqueOccurrences(arr: number[]): boolean { + +};","(define/contract (unique-occurrences arr) + (-> (listof exact-integer?) boolean?) + + )","-spec unique_occurrences(Arr :: [integer()]) -> boolean(). +unique_occurrences(Arr) -> + .","defmodule Solution do + @spec unique_occurrences(arr :: [integer]) :: boolean + def unique_occurrences(arr) do + + end +end","class Solution { + bool uniqueOccurrences(List arr) { + + } +}", +1161,count-ways-to-build-rooms-in-an-ant-colony,Count Ways to Build Rooms in an Ant Colony,1916.0,1313.0,"

You are an ant tasked with adding n new rooms numbered 0 to n-1 to your colony. You are given the expansion plan as a 0-indexed integer array of length n, prevRoom, where prevRoom[i] indicates that you must build room prevRoom[i] before building room i, and these two rooms must be connected directly. Room 0 is already built, so prevRoom[0] = -1. The expansion plan is given such that once all the rooms are built, every room will be reachable from room 0.

+ +

You can only build one room at a time, and you can travel freely between rooms you have already built only if they are connected. You can choose to build any room as long as its previous room is already built.

+ +

Return the number of different orders you can build all the rooms in. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: prevRoom = [-1,0,1]
+Output: 1
+Explanation: There is only one way to build the additional rooms: 0 → 1 → 2
+
+ +

Example 2:

+ + +
+Input: prevRoom = [-1,0,0,1,2]
+Output: 6
+Explanation:
+The 6 ways are:
+0 → 1 → 3 → 2 → 4
+0 → 2 → 4 → 1 → 3
+0 → 1 → 2 → 3 → 4
+0 → 1 → 2 → 4 → 3
+0 → 2 → 1 → 3 → 4
+0 → 2 → 1 → 4 → 3
+
+ +

 

+

Constraints:

+ +
    +
  • n == prevRoom.length
    • +
  • 2 <= n <= 105
    • +
  • prevRoom[0] == -1
    • +
  • 0 <= prevRoom[i] < n for all 1 <= i < n
    • +
  • Every room is reachable from room 0 once all the rooms are built.
    • +
",3.0,False,"class Solution { +public: + int waysToBuildRooms(vector& prevRoom) { + + } +};","class Solution { + public int waysToBuildRooms(int[] prevRoom) { + + } +}","class Solution(object): + def waysToBuildRooms(self, prevRoom): + """""" + :type prevRoom: List[int] + :rtype: int + """"""","class Solution: + def waysToBuildRooms(self, prevRoom: List[int]) -> int:","int waysToBuildRooms(int* prevRoom, int prevRoomSize){ + +}","public class Solution { + public int WaysToBuildRooms(int[] prevRoom) { + + } +}","/** + * @param {number[]} prevRoom + * @return {number} + */ +var waysToBuildRooms = function(prevRoom) { + +};","# @param {Integer[]} prev_room +# @return {Integer} +def ways_to_build_rooms(prev_room) + +end","class Solution { + func waysToBuildRooms(_ prevRoom: [Int]) -> Int { + + } +}","func waysToBuildRooms(prevRoom []int) int { + +}","object Solution { + def waysToBuildRooms(prevRoom: Array[Int]): Int = { + + } +}","class Solution { + fun waysToBuildRooms(prevRoom: IntArray): Int { + + } +}","impl Solution { + pub fn ways_to_build_rooms(prev_room: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $prevRoom + * @return Integer + */ + function waysToBuildRooms($prevRoom) { + + } +}","function waysToBuildRooms(prevRoom: number[]): number { + +};","(define/contract (ways-to-build-rooms prevRoom) + (-> (listof exact-integer?) exact-integer?) + + )",,,, +1163,largest-magic-square,Largest Magic Square,1895.0,1311.0,"

A k x k magic square is a k x k grid filled with integers such that every row sum, every column sum, and both diagonal sums are all equal. The integers in the magic square do not have to be distinct. Every 1 x 1 grid is trivially a magic square.

+ +

Given an m x n integer grid, return the size (i.e., the side length k) of the largest magic square that can be found within this grid.

+ +

 

+

Example 1:

+ +
+Input: grid = [[7,1,4,5,6],[2,5,1,6,4],[1,5,4,3,2],[1,2,7,3,4]]
+Output: 3
+Explanation: The largest magic square has a size of 3.
+Every row sum, column sum, and diagonal sum of this magic square is equal to 12.
+- Row sums: 5+1+6 = 5+4+3 = 2+7+3 = 12
+- Column sums: 5+5+2 = 1+4+7 = 6+3+3 = 12
+- Diagonal sums: 5+4+3 = 6+4+2 = 12
+
+ +

Example 2:

+ +
+Input: grid = [[5,1,3,1],[9,3,3,1],[1,3,3,8]]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • 1 <= grid[i][j] <= 106
    • +
+",2.0,False,"class Solution { +public: + int largestMagicSquare(vector>& grid) { + + } +};","class Solution { + public int largestMagicSquare(int[][] grid) { + + } +}","class Solution(object): + def largestMagicSquare(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def largestMagicSquare(self, grid: List[List[int]]) -> int: + ","int largestMagicSquare(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int LargestMagicSquare(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var largestMagicSquare = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def largest_magic_square(grid) + +end","class Solution { + func largestMagicSquare(_ grid: [[Int]]) -> Int { + + } +}","func largestMagicSquare(grid [][]int) int { + +}","object Solution { + def largestMagicSquare(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun largestMagicSquare(grid: Array): Int { + + } +}","impl Solution { + pub fn largest_magic_square(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function largestMagicSquare($grid) { + + } +}","function largestMagicSquare(grid: number[][]): number { + +};","(define/contract (largest-magic-square grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec largest_magic_square(Grid :: [[integer()]]) -> integer(). +largest_magic_square(Grid) -> + .","defmodule Solution do + @spec largest_magic_square(grid :: [[integer]]) :: integer + def largest_magic_square(grid) do + + end +end","class Solution { + int largestMagicSquare(List> grid) { + + } +}", +1164,watering-plants,Watering Plants,2079.0,1310.0,"

You want to water n plants in your garden with a watering can. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. There is a river at x = -1 that you can refill your watering can at.

+ +

Each plant needs a specific amount of water. You will water the plants in the following way:

+ +
    +
  • Water the plants in order from left to right.
    • +
  • After watering the current plant, if you do not have enough water to completely water the next plant, return to the river to fully refill the watering can.
    • +
  • You cannot refill the watering can early.
    • +
+ +

You are initially at the river (i.e., x = -1). It takes one step to move one unit on the x-axis.

+ +

Given a 0-indexed integer array plants of n integers, where plants[i] is the amount of water the ith plant needs, and an integer capacity representing the watering can capacity, return the number of steps needed to water all the plants.

+ +

 

+

Example 1:

+ +
+Input: plants = [2,2,3,3], capacity = 5
+Output: 14
+Explanation: Start at the river with a full watering can:
+- Walk to plant 0 (1 step) and water it. Watering can has 3 units of water.
+- Walk to plant 1 (1 step) and water it. Watering can has 1 unit of water.
+- Since you cannot completely water plant 2, walk back to the river to refill (2 steps).
+- Walk to plant 2 (3 steps) and water it. Watering can has 2 units of water.
+- Since you cannot completely water plant 3, walk back to the river to refill (3 steps).
+- Walk to plant 3 (4 steps) and water it.
+Steps needed = 1 + 1 + 2 + 3 + 3 + 4 = 14.
+
+ +

Example 2:

+ +
+Input: plants = [1,1,1,4,2,3], capacity = 4
+Output: 30
+Explanation: Start at the river with a full watering can:
+- Water plants 0, 1, and 2 (3 steps). Return to river (3 steps).
+- Water plant 3 (4 steps). Return to river (4 steps).
+- Water plant 4 (5 steps). Return to river (5 steps).
+- Water plant 5 (6 steps).
+Steps needed = 3 + 3 + 4 + 4 + 5 + 5 + 6 = 30.
+
+ +

Example 3:

+ +
+Input: plants = [7,7,7,7,7,7,7], capacity = 8
+Output: 49
+Explanation: You have to refill before watering each plant.
+Steps needed = 1 + 1 + 2 + 2 + 3 + 3 + 4 + 4 + 5 + 5 + 6 + 6 + 7 = 49.
+
+ +

 

+

Constraints:

+ +
    +
  • n == plants.length
    • +
  • 1 <= n <= 1000
    • +
  • 1 <= plants[i] <= 106
    • +
  • max(plants[i]) <= capacity <= 109
    • +
+",2.0,False,"class Solution { +public: + int wateringPlants(vector& plants, int capacity) { + + } +};","class Solution { + public int wateringPlants(int[] plants, int capacity) { + + } +}","class Solution(object): + def wateringPlants(self, plants, capacity): + """""" + :type plants: List[int] + :type capacity: int + :rtype: int + """""" + ","class Solution: + def wateringPlants(self, plants: List[int], capacity: int) -> int: + ","int wateringPlants(int* plants, int plantsSize, int capacity){ + +}","public class Solution { + public int WateringPlants(int[] plants, int capacity) { + + } +}","/** + * @param {number[]} plants + * @param {number} capacity + * @return {number} + */ +var wateringPlants = function(plants, capacity) { + +};","# @param {Integer[]} plants +# @param {Integer} capacity +# @return {Integer} +def watering_plants(plants, capacity) + +end","class Solution { + func wateringPlants(_ plants: [Int], _ capacity: Int) -> Int { + + } +}","func wateringPlants(plants []int, capacity int) int { + +}","object Solution { + def wateringPlants(plants: Array[Int], capacity: Int): Int = { + + } +}","class Solution { + fun wateringPlants(plants: IntArray, capacity: Int): Int { + + } +}","impl Solution { + pub fn watering_plants(plants: Vec, capacity: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $plants + * @param Integer $capacity + * @return Integer + */ + function wateringPlants($plants, $capacity) { + + } +}","function wateringPlants(plants: number[], capacity: number): number { + +};","(define/contract (watering-plants plants capacity) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec watering_plants(Plants :: [integer()], Capacity :: integer()) -> integer(). +watering_plants(Plants, Capacity) -> + .","defmodule Solution do + @spec watering_plants(plants :: [integer], capacity :: integer) :: integer + def watering_plants(plants, capacity) do + + end +end","class Solution { + int wateringPlants(List plants, int capacity) { + + } +}", +1165,sort-items-by-groups-respecting-dependencies,Sort Items by Groups Respecting Dependencies,1203.0,1309.0,"

There are n items each belonging to zero or one of m groups where group[i] is the group that the i-th item belongs to and it's equal to -1 if the i-th item belongs to no group. The items and the groups are zero indexed. A group can have no item belonging to it.

+ +

Return a sorted list of the items such that:

+ +
    +
  • The items that belong to the same group are next to each other in the sorted list.
    • +
  • There are some relations between these items where beforeItems[i] is a list containing all the items that should come before the i-th item in the sorted array (to the left of the i-th item).
    • +
+ +

Return any solution if there is more than one solution and return an empty list if there is no solution.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3,6],[],[],[]]
+Output: [6,3,4,1,5,2,0,7]
+
+ +

Example 2:

+ +
+Input: n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3],[],[4],[]]
+Output: []
+Explanation: This is the same as example 1 except that 4 needs to be before 6 in the sorted list.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m <= n <= 3 * 104
    • +
  • group.length == beforeItems.length == n
    • +
  • -1 <= group[i] <= m - 1
    • +
  • 0 <= beforeItems[i].length <= n - 1
    • +
  • 0 <= beforeItems[i][j] <= n - 1
    • +
  • i != beforeItems[i][j]
    • +
  • beforeItems[i] does not contain duplicates elements.
    • +
+",3.0,False,"class Solution { +public: + vector sortItems(int n, int m, vector& group, vector>& beforeItems) { + + } +};","class Solution { + public int[] sortItems(int n, int m, int[] group, List> beforeItems) { + + } +}","class Solution(object): + def sortItems(self, n, m, group, beforeItems): + """""" + :type n: int + :type m: int + :type group: List[int] + :type beforeItems: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def sortItems(self, n: int, m: int, group: List[int], beforeItems: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sortItems(int n, int m, int* group, int groupSize, int** beforeItems, int beforeItemsSize, int* beforeItemsColSize, int* returnSize){ + +}","public class Solution { + public int[] SortItems(int n, int m, int[] group, IList> beforeItems) { + + } +}","/** + * @param {number} n + * @param {number} m + * @param {number[]} group + * @param {number[][]} beforeItems + * @return {number[]} + */ +var sortItems = function(n, m, group, beforeItems) { + +};","# @param {Integer} n +# @param {Integer} m +# @param {Integer[]} group +# @param {Integer[][]} before_items +# @return {Integer[]} +def sort_items(n, m, group, before_items) + +end","class Solution { + func sortItems(_ n: Int, _ m: Int, _ group: [Int], _ beforeItems: [[Int]]) -> [Int] { + + } +}","func sortItems(n int, m int, group []int, beforeItems [][]int) []int { + +}","object Solution { + def sortItems(n: Int, m: Int, group: Array[Int], beforeItems: List[List[Int]]): Array[Int] = { + + } +}","class Solution { + fun sortItems(n: Int, m: Int, group: IntArray, beforeItems: List>): IntArray { + + } +}","impl Solution { + pub fn sort_items(n: i32, m: i32, group: Vec, before_items: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $m + * @param Integer[] $group + * @param Integer[][] $beforeItems + * @return Integer[] + */ + function sortItems($n, $m, $group, $beforeItems) { + + } +}","function sortItems(n: number, m: number, group: number[], beforeItems: number[][]): number[] { + +};","(define/contract (sort-items n m group beforeItems) + (-> exact-integer? exact-integer? (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec sort_items(N :: integer(), M :: integer(), Group :: [integer()], BeforeItems :: [[integer()]]) -> [integer()]. +sort_items(N, M, Group, BeforeItems) -> + .","defmodule Solution do + @spec sort_items(n :: integer, m :: integer, group :: [integer], before_items :: [[integer]]) :: [integer] + def sort_items(n, m, group, before_items) do + + end +end","class Solution { + List sortItems(int n, int m, List group, List> beforeItems) { + + } +}", +1166,smallest-string-with-swaps,Smallest String With Swaps,1202.0,1308.0,"

You are given a string s, and an array of pairs of indices in the string pairs where pairs[i] = [a, b] indicates 2 indices(0-indexed) of the string.

+ +

You can swap the characters at any pair of indices in the given pairs any number of times.

+ +

Return the lexicographically smallest string that s can be changed to after using the swaps.

+ +

 

+

Example 1:

+ +
+Input: s = "dcab", pairs = [[0,3],[1,2]]
+Output: "bacd"
+Explaination: 
+Swap s[0] and s[3], s = "bcad"
+Swap s[1] and s[2], s = "bacd"
+
+ +

Example 2:

+ +
+Input: s = "dcab", pairs = [[0,3],[1,2],[0,2]]
+Output: "abcd"
+Explaination: 
+Swap s[0] and s[3], s = "bcad"
+Swap s[0] and s[2], s = "acbd"
+Swap s[1] and s[2], s = "abcd"
+ +

Example 3:

+ +
+Input: s = "cba", pairs = [[0,1],[1,2]]
+Output: "abc"
+Explaination: 
+Swap s[0] and s[1], s = "bca"
+Swap s[1] and s[2], s = "bac"
+Swap s[0] and s[1], s = "abc"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 10^5
    • +
  • 0 <= pairs.length <= 10^5
    • +
  • 0 <= pairs[i][0], pairs[i][1] < s.length
    • +
  • s only contains lower case English letters.
    • +
+",2.0,False,"class Solution { +public: + string smallestStringWithSwaps(string s, vector>& pairs) { + + } +};","class Solution { + public String smallestStringWithSwaps(String s, List> pairs) { + + } +}","class Solution(object): + def smallestStringWithSwaps(self, s, pairs): + """""" + :type s: str + :type pairs: List[List[int]] + :rtype: str + """""" + ","class Solution: + def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: + ","char * smallestStringWithSwaps(char * s, int** pairs, int pairsSize, int* pairsColSize){ + +}","public class Solution { + public string SmallestStringWithSwaps(string s, IList> pairs) { + + } +}","/** + * @param {string} s + * @param {number[][]} pairs + * @return {string} + */ +var smallestStringWithSwaps = function(s, pairs) { + +};","# @param {String} s +# @param {Integer[][]} pairs +# @return {String} +def smallest_string_with_swaps(s, pairs) + +end","class Solution { + func smallestStringWithSwaps(_ s: String, _ pairs: [[Int]]) -> String { + + } +}","func smallestStringWithSwaps(s string, pairs [][]int) string { + +}","object Solution { + def smallestStringWithSwaps(s: String, pairs: List[List[Int]]): String = { + + } +}","class Solution { + fun smallestStringWithSwaps(s: String, pairs: List>): String { + + } +}","impl Solution { + pub fn smallest_string_with_swaps(s: String, pairs: Vec>) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[][] $pairs + * @return String + */ + function smallestStringWithSwaps($s, $pairs) { + + } +}","function smallestStringWithSwaps(s: string, pairs: number[][]): string { + +};","(define/contract (smallest-string-with-swaps s pairs) + (-> string? (listof (listof exact-integer?)) string?) + + )","-spec smallest_string_with_swaps(S :: unicode:unicode_binary(), Pairs :: [[integer()]]) -> unicode:unicode_binary(). +smallest_string_with_swaps(S, Pairs) -> + .","defmodule Solution do + @spec smallest_string_with_swaps(s :: String.t, pairs :: [[integer]]) :: String.t + def smallest_string_with_swaps(s, pairs) do + + end +end","class Solution { + String smallestStringWithSwaps(String s, List> pairs) { + + } +}", +1168,minimum-absolute-difference,Minimum Absolute Difference,1200.0,1306.0,"

Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.

+ +

Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows

+ +
    +
  • a, b are from arr
    • +
  • a < b
    • +
  • b - a equals to the minimum absolute difference of any two elements in arr
    • +
+ +

 

+

Example 1:

+ +
+Input: arr = [4,2,1,3]
+Output: [[1,2],[2,3],[3,4]]
+Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
+ +

Example 2:

+ +
+Input: arr = [1,3,6,10,15]
+Output: [[1,3]]
+
+ +

Example 3:

+ +
+Input: arr = [3,8,-10,23,19,-4,-14,27]
+Output: [[-14,-10],[19,23],[23,27]]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= arr.length <= 105
    • +
  • -106 <= arr[i] <= 106
    • +
+",1.0,False,"class Solution { +public: + vector> minimumAbsDifference(vector& arr) { + + } +};","class Solution { + public List> minimumAbsDifference(int[] arr) { + + } +}","class Solution(object): + def minimumAbsDifference(self, arr): + """""" + :type arr: List[int] + :rtype: List[List[int]] + """""" + ","class Solution: + def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** minimumAbsDifference(int* arr, int arrSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> MinimumAbsDifference(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number[][]} + */ +var minimumAbsDifference = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer[][]} +def minimum_abs_difference(arr) + +end","class Solution { + func minimumAbsDifference(_ arr: [Int]) -> [[Int]] { + + } +}","func minimumAbsDifference(arr []int) [][]int { + +}","object Solution { + def minimumAbsDifference(arr: Array[Int]): List[List[Int]] = { + + } +}","class Solution { + fun minimumAbsDifference(arr: IntArray): List> { + + } +}","impl Solution { + pub fn minimum_abs_difference(arr: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer[][] + */ + function minimumAbsDifference($arr) { + + } +}","function minimumAbsDifference(arr: number[]): number[][] { + +};","(define/contract (minimum-abs-difference arr) + (-> (listof exact-integer?) (listof (listof exact-integer?))) + + )","-spec minimum_abs_difference(Arr :: [integer()]) -> [[integer()]]. +minimum_abs_difference(Arr) -> + .","defmodule Solution do + @spec minimum_abs_difference(arr :: [integer]) :: [[integer]] + def minimum_abs_difference(arr) do + + end +end","class Solution { + List> minimumAbsDifference(List arr) { + + } +}", +1169,number-of-visible-people-in-a-queue,Number of Visible People in a Queue,1944.0,1305.0,"

There are n people standing in a queue, and they numbered from 0 to n - 1 in left to right order. You are given an array heights of distinct integers where heights[i] represents the height of the ith person.

+ +

A person can see another person to their right in the queue if everybody in between is shorter than both of them. More formally, the ith person can see the jth person if i < j and min(heights[i], heights[j]) > max(heights[i+1], heights[i+2], ..., heights[j-1]).

+ +

Return an array answer of length n where answer[i] is the number of people the ith person can see to their right in the queue.

+ +

 

+

Example 1:

+ +

+ +
+Input: heights = [10,6,8,5,11,9]
+Output: [3,1,2,1,1,0]
+Explanation:
+Person 0 can see person 1, 2, and 4.
+Person 1 can see person 2.
+Person 2 can see person 3 and 4.
+Person 3 can see person 4.
+Person 4 can see person 5.
+Person 5 can see no one since nobody is to the right of them.
+
+ +

Example 2:

+ +
+Input: heights = [5,1,2,3,10]
+Output: [4,1,1,1,0]
+
+ +

 

+

Constraints:

+ +
    +
  • n == heights.length
    • +
  • 1 <= n <= 105
    • +
  • 1 <= heights[i] <= 105
    • +
  • All the values of heights are unique.
    • +
+",3.0,False,"class Solution { +public: + vector canSeePersonsCount(vector& heights) { + + } +};","class Solution { + public int[] canSeePersonsCount(int[] heights) { + + } +}","class Solution(object): + def canSeePersonsCount(self, heights): + """""" + :type heights: List[int] + :rtype: List[int] + """""" + ","class Solution: + def canSeePersonsCount(self, heights: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* canSeePersonsCount(int* heights, int heightsSize, int* returnSize){ + +}","public class Solution { + public int[] CanSeePersonsCount(int[] heights) { + + } +}","/** + * @param {number[]} heights + * @return {number[]} + */ +var canSeePersonsCount = function(heights) { + +};","# @param {Integer[]} heights +# @return {Integer[]} +def can_see_persons_count(heights) + +end","class Solution { + func canSeePersonsCount(_ heights: [Int]) -> [Int] { + + } +}","func canSeePersonsCount(heights []int) []int { + +}","object Solution { + def canSeePersonsCount(heights: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun canSeePersonsCount(heights: IntArray): IntArray { + + } +}","impl Solution { + pub fn can_see_persons_count(heights: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $heights + * @return Integer[] + */ + function canSeePersonsCount($heights) { + + } +}","function canSeePersonsCount(heights: number[]): number[] { + +};","(define/contract (can-see-persons-count heights) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec can_see_persons_count(Heights :: [integer()]) -> [integer()]. +can_see_persons_count(Heights) -> + .","defmodule Solution do + @spec can_see_persons_count(heights :: [integer]) :: [integer] + def can_see_persons_count(heights) do + + end +end","class Solution { + List canSeePersonsCount(List heights) { + + } +}", +1170,longest-happy-string,Longest Happy String,1405.0,1304.0,"

A string s is called happy if it satisfies the following conditions:

+ +
    +
  • s only contains the letters 'a', 'b', and 'c'.
    • +
  • s does not contain any of "aaa", "bbb", or "ccc" as a substring.
    • +
  • s contains at most a occurrences of the letter 'a'.
    • +
  • s contains at most b occurrences of the letter 'b'.
    • +
  • s contains at most c occurrences of the letter 'c'.
    • +
+ +

Given three integers a, b, and c, return the longest possible happy string. If there are multiple longest happy strings, return any of them. If there is no such string, return the empty string "".

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+ +
+Input: a = 1, b = 1, c = 7
+Output: "ccaccbcc"
+Explanation: "ccbccacc" would also be a correct answer.
+
+ +

Example 2:

+ +
+Input: a = 7, b = 1, c = 0
+Output: "aabaa"
+Explanation: It is the only correct answer in this case.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= a, b, c <= 100
    • +
  • a + b + c > 0
    • +
+",2.0,False,"class Solution { +public: + string longestDiverseString(int a, int b, int c) { + + } +};","class Solution { + public String longestDiverseString(int a, int b, int c) { + + } +}","class Solution(object): + def longestDiverseString(self, a, b, c): + """""" + :type a: int + :type b: int + :type c: int + :rtype: str + """""" + ","class Solution: + def longestDiverseString(self, a: int, b: int, c: int) -> str: + ","char * longestDiverseString(int a, int b, int c){ + +}","public class Solution { + public string LongestDiverseString(int a, int b, int c) { + + } +}","/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {string} + */ +var longestDiverseString = function(a, b, c) { + +};","# @param {Integer} a +# @param {Integer} b +# @param {Integer} c +# @return {String} +def longest_diverse_string(a, b, c) + +end","class Solution { + func longestDiverseString(_ a: Int, _ b: Int, _ c: Int) -> String { + + } +}","func longestDiverseString(a int, b int, c int) string { + +}","object Solution { + def longestDiverseString(a: Int, b: Int, c: Int): String = { + + } +}","class Solution { + fun longestDiverseString(a: Int, b: Int, c: Int): String { + + } +}","impl Solution { + pub fn longest_diverse_string(a: i32, b: i32, c: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer $b + * @param Integer $c + * @return String + */ + function longestDiverseString($a, $b, $c) { + + } +}","function longestDiverseString(a: number, b: number, c: number): string { + +};","(define/contract (longest-diverse-string a b c) + (-> exact-integer? exact-integer? exact-integer? string?) + + )","-spec longest_diverse_string(A :: integer(), B :: integer(), C :: integer()) -> unicode:unicode_binary(). +longest_diverse_string(A, B, C) -> + .","defmodule Solution do + @spec longest_diverse_string(a :: integer, b :: integer, c :: integer) :: String.t + def longest_diverse_string(a, b, c) do + + end +end","class Solution { + String longestDiverseString(int a, int b, int c) { + + } +}", +1173,critical-connections-in-a-network,Critical Connections in a Network,1192.0,1300.0,"

There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between servers ai and bi. Any server can reach other servers directly or indirectly through the network.

+ +

A critical connection is a connection that, if removed, will make some servers unable to reach some other server.

+ +

Return all critical connections in the network in any order.

+ +

 

+

Example 1:

+ +
+Input: n = 4, connections = [[0,1],[1,2],[2,0],[1,3]]
+Output: [[1,3]]
+Explanation: [[3,1]] is also accepted.
+
+ +

Example 2:

+ +
+Input: n = 2, connections = [[0,1]]
+Output: [[0,1]]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 105
    • +
  • n - 1 <= connections.length <= 105
    • +
  • 0 <= ai, bi <= n - 1
    • +
  • ai != bi
    • +
  • There are no repeated connections.
    • +
+",3.0,False,"class Solution { +public: + vector> criticalConnections(int n, vector>& connections) { + + } +};","class Solution { + public List> criticalConnections(int n, List> connections) { + + } +}","class Solution(object): + def criticalConnections(self, n, connections): + """""" + :type n: int + :type connections: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def criticalConnections(self, n: int, connections: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** criticalConnections(int n, int** connections, int connectionsSize, int* connectionsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> CriticalConnections(int n, IList> connections) { + + } +}","/** + * @param {number} n + * @param {number[][]} connections + * @return {number[][]} + */ +var criticalConnections = function(n, connections) { + +};","# @param {Integer} n +# @param {Integer[][]} connections +# @return {Integer[][]} +def critical_connections(n, connections) + +end","class Solution { + func criticalConnections(_ n: Int, _ connections: [[Int]]) -> [[Int]] { + + } +}","func criticalConnections(n int, connections [][]int) [][]int { + +}","object Solution { + def criticalConnections(n: Int, connections: List[List[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun criticalConnections(n: Int, connections: List>): List> { + + } +}","impl Solution { + pub fn critical_connections(n: i32, connections: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $connections + * @return Integer[][] + */ + function criticalConnections($n, $connections) { + + } +}","function criticalConnections(n: number, connections: number[][]): number[][] { + +};","(define/contract (critical-connections n connections) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec critical_connections(N :: integer(), Connections :: [[integer()]]) -> [[integer()]]. +critical_connections(N, Connections) -> + .","defmodule Solution do + @spec critical_connections(n :: integer, connections :: [[integer]]) :: [[integer]] + def critical_connections(n, connections) do + + end +end","class Solution { + List> criticalConnections(int n, List> connections) { + + } +}", +1177,kth-ancestor-of-a-tree-node,Kth Ancestor of a Tree Node,1483.0,1296.0,"

You are given a tree with n nodes numbered from 0 to n - 1 in the form of a parent array parent where parent[i] is the parent of ith node. The root of the tree is node 0. Find the kth ancestor of a given node.

+ +

The kth ancestor of a tree node is the kth node in the path from that node to the root node.

+ +

Implement the TreeAncestor class:

+ +
    +
  • TreeAncestor(int n, int[] parent) Initializes the object with the number of nodes in the tree and the parent array.
    • +
  • int getKthAncestor(int node, int k) return the kth ancestor of the given node node. If there is no such ancestor, return -1.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["TreeAncestor", "getKthAncestor", "getKthAncestor", "getKthAncestor"]
+[[7, [-1, 0, 0, 1, 1, 2, 2]], [3, 1], [5, 2], [6, 3]]
+Output
+[null, 1, 0, -1]
+
+Explanation
+TreeAncestor treeAncestor = new TreeAncestor(7, [-1, 0, 0, 1, 1, 2, 2]);
+treeAncestor.getKthAncestor(3, 1); // returns 1 which is the parent of 3
+treeAncestor.getKthAncestor(5, 2); // returns 0 which is the grandparent of 5
+treeAncestor.getKthAncestor(6, 3); // returns -1 because there is no such ancestor
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 5 * 104
    • +
  • parent.length == n
    • +
  • parent[0] == -1
    • +
  • 0 <= parent[i] < n for all 0 < i < n
    • +
  • 0 <= node < n
    • +
  • There will be at most 5 * 104 queries.
    • +
+",3.0,False,"class TreeAncestor { +public: + TreeAncestor(int n, vector& parent) { + + } + + int getKthAncestor(int node, int k) { + + } +}; + +/** + * Your TreeAncestor object will be instantiated and called as such: + * TreeAncestor* obj = new TreeAncestor(n, parent); + * int param_1 = obj->getKthAncestor(node,k); + */","class TreeAncestor { + + public TreeAncestor(int n, int[] parent) { + + } + + public int getKthAncestor(int node, int k) { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * TreeAncestor obj = new TreeAncestor(n, parent); + * int param_1 = obj.getKthAncestor(node,k); + */","class TreeAncestor(object): + + def __init__(self, n, parent): + """""" + :type n: int + :type parent: List[int] + """""" + + + def getKthAncestor(self, node, k): + """""" + :type node: int + :type k: int + :rtype: int + """""" + + + +# Your TreeAncestor object will be instantiated and called as such: +# obj = TreeAncestor(n, parent) +# param_1 = obj.getKthAncestor(node,k)","class TreeAncestor: + + def __init__(self, n: int, parent: List[int]): + + + def getKthAncestor(self, node: int, k: int) -> int: + + + +# Your TreeAncestor object will be instantiated and called as such: +# obj = TreeAncestor(n, parent) +# param_1 = obj.getKthAncestor(node,k)"," + + +typedef struct { + +} TreeAncestor; + + +TreeAncestor* treeAncestorCreate(int n, int* parent, int parentSize) { + +} + +int treeAncestorGetKthAncestor(TreeAncestor* obj, int node, int k) { + +} + +void treeAncestorFree(TreeAncestor* obj) { + +} + +/** + * Your TreeAncestor struct will be instantiated and called as such: + * TreeAncestor* obj = treeAncestorCreate(n, parent, parentSize); + * int param_1 = treeAncestorGetKthAncestor(obj, node, k); + + * treeAncestorFree(obj); +*/","public class TreeAncestor { + + public TreeAncestor(int n, int[] parent) { + + } + + public int GetKthAncestor(int node, int k) { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * TreeAncestor obj = new TreeAncestor(n, parent); + * int param_1 = obj.GetKthAncestor(node,k); + */","/** + * @param {number} n + * @param {number[]} parent + */ +var TreeAncestor = function(n, parent) { + +}; + +/** + * @param {number} node + * @param {number} k + * @return {number} + */ +TreeAncestor.prototype.getKthAncestor = function(node, k) { + +}; + +/** + * Your TreeAncestor object will be instantiated and called as such: + * var obj = new TreeAncestor(n, parent) + * var param_1 = obj.getKthAncestor(node,k) + */","class TreeAncestor + +=begin + :type n: Integer + :type parent: Integer[] +=end + def initialize(n, parent) + + end + + +=begin + :type node: Integer + :type k: Integer + :rtype: Integer +=end + def get_kth_ancestor(node, k) + + end + + +end + +# Your TreeAncestor object will be instantiated and called as such: +# obj = TreeAncestor.new(n, parent) +# param_1 = obj.get_kth_ancestor(node, k)"," +class TreeAncestor { + + init(_ n: Int, _ parent: [Int]) { + + } + + func getKthAncestor(_ node: Int, _ k: Int) -> Int { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * let obj = TreeAncestor(n, parent) + * let ret_1: Int = obj.getKthAncestor(node, k) + */","type TreeAncestor struct { + +} + + +func Constructor(n int, parent []int) TreeAncestor { + +} + + +func (this *TreeAncestor) GetKthAncestor(node int, k int) int { + +} + + +/** + * Your TreeAncestor object will be instantiated and called as such: + * obj := Constructor(n, parent); + * param_1 := obj.GetKthAncestor(node,k); + */","class TreeAncestor(_n: Int, _parent: Array[Int]) { + + def getKthAncestor(node: Int, k: Int): Int = { + + } + +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * var obj = new TreeAncestor(n, parent) + * var param_1 = obj.getKthAncestor(node,k) + */","class TreeAncestor(n: Int, parent: IntArray) { + + fun getKthAncestor(node: Int, k: Int): Int { + + } + +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * var obj = TreeAncestor(n, parent) + * var param_1 = obj.getKthAncestor(node,k) + */","struct TreeAncestor { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl TreeAncestor { + + fn new(n: i32, parent: Vec) -> Self { + + } + + fn get_kth_ancestor(&self, node: i32, k: i32) -> i32 { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * let obj = TreeAncestor::new(n, parent); + * let ret_1: i32 = obj.get_kth_ancestor(node, k); + */","class TreeAncestor { + /** + * @param Integer $n + * @param Integer[] $parent + */ + function __construct($n, $parent) { + + } + + /** + * @param Integer $node + * @param Integer $k + * @return Integer + */ + function getKthAncestor($node, $k) { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * $obj = TreeAncestor($n, $parent); + * $ret_1 = $obj->getKthAncestor($node, $k); + */","class TreeAncestor { + constructor(n: number, parent: number[]) { + + } + + getKthAncestor(node: number, k: number): number { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * var obj = new TreeAncestor(n, parent) + * var param_1 = obj.getKthAncestor(node,k) + */","(define tree-ancestor% + (class object% + (super-new) + + ; n : exact-integer? + + ; parent : (listof exact-integer?) + (init-field + n + parent) + + ; get-kth-ancestor : exact-integer? exact-integer? -> exact-integer? + (define/public (get-kth-ancestor node k) + + ))) + +;; Your tree-ancestor% object will be instantiated and called as such: +;; (define obj (new tree-ancestor% [n n] [parent parent])) +;; (define param_1 (send obj get-kth-ancestor node k))","-spec tree_ancestor_init_(N :: integer(), Parent :: [integer()]) -> any(). +tree_ancestor_init_(N, Parent) -> + . + +-spec tree_ancestor_get_kth_ancestor(Node :: integer(), K :: integer()) -> integer(). +tree_ancestor_get_kth_ancestor(Node, K) -> + . + + +%% Your functions will be called as such: +%% tree_ancestor_init_(N, Parent), +%% Param_1 = tree_ancestor_get_kth_ancestor(Node, K), + +%% tree_ancestor_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule TreeAncestor do + @spec init_(n :: integer, parent :: [integer]) :: any + def init_(n, parent) do + + end + + @spec get_kth_ancestor(node :: integer, k :: integer) :: integer + def get_kth_ancestor(node, k) do + + end +end + +# Your functions will be called as such: +# TreeAncestor.init_(n, parent) +# param_1 = TreeAncestor.get_kth_ancestor(node, k) + +# TreeAncestor.init_ will be called before every test case, in which you can do some necessary initializations.","class TreeAncestor { + + TreeAncestor(int n, List parent) { + + } + + int getKthAncestor(int node, int k) { + + } +} + +/** + * Your TreeAncestor object will be instantiated and called as such: + * TreeAncestor obj = TreeAncestor(n, parent); + * int param1 = obj.getKthAncestor(node,k); + */", +1178,minimum-garden-perimeter-to-collect-enough-apples,Minimum Garden Perimeter to Collect Enough Apples,1954.0,1295.0,"

In a garden represented as an infinite 2D grid, there is an apple tree planted at every integer coordinate. The apple tree planted at an integer coordinate (i, j) has |i| + |j| apples growing on it.

+ +

You will buy an axis-aligned square plot of land that is centered at (0, 0).

+ +

Given an integer neededApples, return the minimum perimeter of a plot such that at least neededApples apples are inside or on the perimeter of that plot.

+ +

The value of |x| is defined as:

+ +
    +
  • x if x >= 0
    • +
  • -x if x < 0
    • +
+ +

 

+

Example 1:

+ +
+Input: neededApples = 1
+Output: 8
+Explanation: A square plot of side length 1 does not contain any apples.
+However, a square plot of side length 2 has 12 apples inside (as depicted in the image above).
+The perimeter is 2 * 4 = 8.
+
+ +

Example 2:

+ +
+Input: neededApples = 13
+Output: 16
+
+ +

Example 3:

+ +
+Input: neededApples = 1000000000
+Output: 5040
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= neededApples <= 1015
    • +
+",2.0,False,"class Solution { +public: + long long minimumPerimeter(long long neededApples) { + + } +};","class Solution { + public long minimumPerimeter(long neededApples) { + + } +}","class Solution(object): + def minimumPerimeter(self, neededApples): + """""" + :type neededApples: int + :rtype: int + """""" + ","class Solution: + def minimumPerimeter(self, neededApples: int) -> int: + ","long long minimumPerimeter(long long neededApples){ + +}","public class Solution { + public long MinimumPerimeter(long neededApples) { + + } +}","/** + * @param {number} neededApples + * @return {number} + */ +var minimumPerimeter = function(neededApples) { + +};","# @param {Integer} needed_apples +# @return {Integer} +def minimum_perimeter(needed_apples) + +end","class Solution { + func minimumPerimeter(_ neededApples: Int) -> Int { + + } +}","func minimumPerimeter(neededApples int64) int64 { + +}","object Solution { + def minimumPerimeter(neededApples: Long): Long = { + + } +}","class Solution { + fun minimumPerimeter(neededApples: Long): Long { + + } +}","impl Solution { + pub fn minimum_perimeter(needed_apples: i64) -> i64 { + + } +}","class Solution { + + /** + * @param Integer $neededApples + * @return Integer + */ + function minimumPerimeter($neededApples) { + + } +}","function minimumPerimeter(neededApples: number): number { + +};","(define/contract (minimum-perimeter neededApples) + (-> exact-integer? exact-integer?) + + )","-spec minimum_perimeter(NeededApples :: integer()) -> integer(). +minimum_perimeter(NeededApples) -> + .","defmodule Solution do + @spec minimum_perimeter(needed_apples :: integer) :: integer + def minimum_perimeter(needed_apples) do + + end +end","class Solution { + int minimumPerimeter(int neededApples) { + + } +}", +1181,make-array-strictly-increasing,Make Array Strictly Increasing,1187.0,1290.0,"

Given two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing.

+ +

In one operation, you can choose two indices 0 <= i < arr1.length and 0 <= j < arr2.length and do the assignment arr1[i] = arr2[j].

+ +

If there is no way to make arr1 strictly increasing, return -1.

+ +

 

+

Example 1:

+ +
+Input: arr1 = [1,5,3,6,7], arr2 = [1,3,2,4]
+Output: 1
+Explanation: Replace 5 with 2, then arr1 = [1, 2, 3, 6, 7].
+
+ +

Example 2:

+ +
+Input: arr1 = [1,5,3,6,7], arr2 = [4,3,1]
+Output: 2
+Explanation: Replace 5 with 3 and then replace 3 with 4. arr1 = [1, 3, 4, 6, 7].
+
+ +

Example 3:

+ +
+Input: arr1 = [1,5,3,6,7], arr2 = [1,6,3,3]
+Output: -1
+Explanation: You can't make arr1 strictly increasing.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr1.length, arr2.length <= 2000
    • +
  • 0 <= arr1[i], arr2[i] <= 10^9
    • +
+ +

 

+",3.0,False,"class Solution { +public: + int makeArrayIncreasing(vector& arr1, vector& arr2) { + + } +};","class Solution { + public int makeArrayIncreasing(int[] arr1, int[] arr2) { + + } +}","class Solution(object): + def makeArrayIncreasing(self, arr1, arr2): + """""" + :type arr1: List[int] + :type arr2: List[int] + :rtype: int + """""" + ","class Solution: + def makeArrayIncreasing(self, arr1: List[int], arr2: List[int]) -> int: + "," + +int makeArrayIncreasing(int* arr1, int arr1Size, int* arr2, int arr2Size){ + +}","public class Solution { + public int MakeArrayIncreasing(int[] arr1, int[] arr2) { + + } +}","/** + * @param {number[]} arr1 + * @param {number[]} arr2 + * @return {number} + */ +var makeArrayIncreasing = function(arr1, arr2) { + +};","# @param {Integer[]} arr1 +# @param {Integer[]} arr2 +# @return {Integer} +def make_array_increasing(arr1, arr2) + +end","class Solution { + func makeArrayIncreasing(_ arr1: [Int], _ arr2: [Int]) -> Int { + + } +}","func makeArrayIncreasing(arr1 []int, arr2 []int) int { + +}","object Solution { + def makeArrayIncreasing(arr1: Array[Int], arr2: Array[Int]): Int = { + + } +}","class Solution { + fun makeArrayIncreasing(arr1: IntArray, arr2: IntArray): Int { + + } +}","impl Solution { + pub fn make_array_increasing(arr1: Vec, arr2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr1 + * @param Integer[] $arr2 + * @return Integer + */ + function makeArrayIncreasing($arr1, $arr2) { + + } +}","function makeArrayIncreasing(arr1: number[], arr2: number[]): number { + +};",,,,, +1183,maximum-subarray-sum-with-one-deletion,Maximum Subarray Sum with One Deletion,1186.0,1288.0,"

Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other words, you want to choose a subarray and optionally delete one element from it so that there is still at least one element left and the sum of the remaining elements is maximum possible.

+ +

Note that the subarray needs to be non-empty after deleting one element.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,-2,0,3]
+Output: 4
+Explanation: Because we can choose [1, -2, 0, 3] and drop -2, thus the subarray [1, 0, 3] becomes the maximum value.
+ +

Example 2:

+ +
+Input: arr = [1,-2,-2,3]
+Output: 3
+Explanation: We just choose [3] and it's the maximum sum.
+
+ +

Example 3:

+ +
+Input: arr = [-1,-1,-1,-1]
+Output: -1
+Explanation: The final subarray needs to be non-empty. You can't choose [-1] and delete -1 from it, then get an empty subarray to make the sum equals to 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 105
    • +
  • -104 <= arr[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int maximumSum(vector& arr) { + + } +};","class Solution { + public int maximumSum(int[] arr) { + + } +}","class Solution(object): + def maximumSum(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def maximumSum(self, arr: List[int]) -> int: + ","int maximumSum(int* arr, int arrSize){ + +}","public class Solution { + public int MaximumSum(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var maximumSum = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def maximum_sum(arr) + +end","class Solution { + func maximumSum(_ arr: [Int]) -> Int { + + } +}","func maximumSum(arr []int) int { + +}","object Solution { + def maximumSum(arr: Array[Int]): Int = { + + } +}","class Solution { + fun maximumSum(arr: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_sum(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function maximumSum($arr) { + + } +}","function maximumSum(arr: number[]): number { + +};","(define/contract (maximum-sum arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_sum(Arr :: [integer()]) -> integer(). +maximum_sum(Arr) -> + .","defmodule Solution do + @spec maximum_sum(arr :: [integer]) :: integer + def maximum_sum(arr) do + + end +end","class Solution { + int maximumSum(List arr) { + + } +}", +1185,constrained-subsequence-sum,Constrained Subsequence Sum,1425.0,1286.0,"

Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i <= k is satisfied.

+ +

A subsequence of an array is obtained by deleting some number of elements (can be zero) from the array, leaving the remaining elements in their original order.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,2,-10,5,20], k = 2
+Output: 37
+Explanation: The subsequence is [10, 2, 5, 20].
+
+ +

Example 2:

+ +
+Input: nums = [-1,-2,-3], k = 1
+Output: -1
+Explanation: The subsequence must be non-empty, so we choose the largest number.
+
+ +

Example 3:

+ +
+Input: nums = [10,-2,-10,-5,20], k = 2
+Output: 23
+Explanation: The subsequence is [10, -2, -5, 20].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
    • +
  • -104 <= nums[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + int constrainedSubsetSum(vector& nums, int k) { + + } +};","class Solution { + public int constrainedSubsetSum(int[] nums, int k) { + + } +}","class Solution(object): + def constrainedSubsetSum(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def constrainedSubsetSum(self, nums: List[int], k: int) -> int: + ","int constrainedSubsetSum(int* nums, int numsSize, int k){ + +}","public class Solution { + public int ConstrainedSubsetSum(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var constrainedSubsetSum = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def constrained_subset_sum(nums, k) + +end","class Solution { + func constrainedSubsetSum(_ nums: [Int], _ k: Int) -> Int { + + } +}","func constrainedSubsetSum(nums []int, k int) int { + +}","object Solution { + def constrainedSubsetSum(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun constrainedSubsetSum(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn constrained_subset_sum(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function constrainedSubsetSum($nums, $k) { + + } +}","function constrainedSubsetSum(nums: number[], k: number): number { + +};",,"-spec constrained_subset_sum(Nums :: [integer()], K :: integer()) -> integer(). +constrained_subset_sum(Nums, K) -> + .","defmodule Solution do + @spec constrained_subset_sum(nums :: [integer], k :: integer) :: integer + def constrained_subset_sum(nums, k) do + + end +end","class Solution { + int constrainedSubsetSum(List nums, int k) { + + } +}", +1189,number-of-valid-words-for-each-puzzle,Number of Valid Words for Each Puzzle,1178.0,1282.0,"With respect to a given puzzle string, a word is valid if both the following conditions are satisfied: +
    +
  • word contains the first letter of puzzle.
    • +
  • For each letter in word, that letter is in puzzle. +
      +
    • For example, if the puzzle is "abcdefg", then valid words are "faced", "cabbage", and "baggage", while
      • +
    • invalid words are "beefed" (does not include 'a') and "based" (includes 's' which is not in the puzzle).
      • +
    +
    • +
+Return an array answer, where answer[i] is the number of words in the given word list words that is valid with respect to the puzzle puzzles[i]. +

 

+

Example 1:

+ +
+Input: words = ["aaaa","asas","able","ability","actt","actor","access"], puzzles = ["aboveyz","abrodyz","abslute","absoryz","actresz","gaswxyz"]
+Output: [1,1,3,2,4,0]
+Explanation: 
+1 valid word for "aboveyz" : "aaaa" 
+1 valid word for "abrodyz" : "aaaa"
+3 valid words for "abslute" : "aaaa", "asas", "able"
+2 valid words for "absoryz" : "aaaa", "asas"
+4 valid words for "actresz" : "aaaa", "asas", "actt", "access"
+There are no valid words for "gaswxyz" cause none of the words in the list contains letter 'g'.
+
+ +

Example 2:

+ +
+Input: words = ["apple","pleas","please"], puzzles = ["aelwxyz","aelpxyz","aelpsxy","saelpxy","xaelpsy"]
+Output: [0,1,3,2,0]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 105
    • +
  • 4 <= words[i].length <= 50
    • +
  • 1 <= puzzles.length <= 104
    • +
  • puzzles[i].length == 7
    • +
  • words[i] and puzzles[i] consist of lowercase English letters.
    • +
  • Each puzzles[i] does not contain repeated characters.
    • +
+",3.0,False,"class Solution { +public: + vector findNumOfValidWords(vector& words, vector& puzzles) { + + } +};","class Solution { + public List findNumOfValidWords(String[] words, String[] puzzles) { + + } +}","class Solution(object): + def findNumOfValidWords(self, words, puzzles): + """""" + :type words: List[str] + :type puzzles: List[str] + :rtype: List[int] + """""" + ","class Solution: + def findNumOfValidWords(self, words: List[str], puzzles: List[str]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findNumOfValidWords(char ** words, int wordsSize, char ** puzzles, int puzzlesSize, int* returnSize){ + +}","public class Solution { + public IList FindNumOfValidWords(string[] words, string[] puzzles) { + + } +}","/** + * @param {string[]} words + * @param {string[]} puzzles + * @return {number[]} + */ +var findNumOfValidWords = function(words, puzzles) { + +};","# @param {String[]} words +# @param {String[]} puzzles +# @return {Integer[]} +def find_num_of_valid_words(words, puzzles) + +end","class Solution { + func findNumOfValidWords(_ words: [String], _ puzzles: [String]) -> [Int] { + + } +}","func findNumOfValidWords(words []string, puzzles []string) []int { + +}","object Solution { + def findNumOfValidWords(words: Array[String], puzzles: Array[String]): List[Int] = { + + } +}","class Solution { + fun findNumOfValidWords(words: Array, puzzles: Array): List { + + } +}","impl Solution { + pub fn find_num_of_valid_words(words: Vec, puzzles: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String[] $puzzles + * @return Integer[] + */ + function findNumOfValidWords($words, $puzzles) { + + } +}","function findNumOfValidWords(words: string[], puzzles: string[]): number[] { + +};","(define/contract (find-num-of-valid-words words puzzles) + (-> (listof string?) (listof string?) (listof exact-integer?)) + + )","-spec find_num_of_valid_words(Words :: [unicode:unicode_binary()], Puzzles :: [unicode:unicode_binary()]) -> [integer()]. +find_num_of_valid_words(Words, Puzzles) -> + .","defmodule Solution do + @spec find_num_of_valid_words(words :: [String.t], puzzles :: [String.t]) :: [integer] + def find_num_of_valid_words(words, puzzles) do + + end +end","class Solution { + List findNumOfValidWords(List words, List puzzles) { + + } +}", +1191,prime-arrangements,Prime Arrangements,1175.0,1279.0,"

Return the number of permutations of 1 to n so that prime numbers are at prime indices (1-indexed.)

+ +

(Recall that an integer is prime if and only if it is greater than 1, and cannot be written as a product of two positive integers both smaller than it.)

+ +

Since the answer may be large, return the answer modulo 10^9 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 12
+Explanation: For example [1,2,5,4,3] is a valid permutation, but [5,2,3,4,1] is not because the prime number 5 is at index 1.
+
+ +

Example 2:

+ +
+Input: n = 100
+Output: 682289015
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
+",1.0,False,"class Solution { +public: + int numPrimeArrangements(int n) { + + } +};","class Solution { + public int numPrimeArrangements(int n) { + + } +}","class Solution(object): + def numPrimeArrangements(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numPrimeArrangements(self, n: int) -> int: + ","int numPrimeArrangements(int n){ + +}","public class Solution { + public int NumPrimeArrangements(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numPrimeArrangements = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def num_prime_arrangements(n) + +end","class Solution { + func numPrimeArrangements(_ n: Int) -> Int { + + } +}","func numPrimeArrangements(n int) int { + +}","object Solution { + def numPrimeArrangements(n: Int): Int = { + + } +}","class Solution { + fun numPrimeArrangements(n: Int): Int { + + } +}","impl Solution { + pub fn num_prime_arrangements(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numPrimeArrangements($n) { + + } +}","function numPrimeArrangements(n: number): number { + +};","(define/contract (num-prime-arrangements n) + (-> exact-integer? exact-integer?) + + )","-spec num_prime_arrangements(N :: integer()) -> integer(). +num_prime_arrangements(N) -> + .","defmodule Solution do + @spec num_prime_arrangements(n :: integer) :: integer + def num_prime_arrangements(n) do + + end +end","class Solution { + int numPrimeArrangements(int n) { + + } +}", +1192,largest-multiple-of-three,Largest Multiple of Three,1363.0,1277.0,"

Given an array of digits digits, return the largest multiple of three that can be formed by concatenating some of the given digits in any order. If there is no answer return an empty string.

+ +

Since the answer may not fit in an integer data type, return the answer as a string. Note that the returning answer must not contain unnecessary leading zeros.

+ +

 

+

Example 1:

+ +
+Input: digits = [8,1,9]
+Output: "981"
+
+ +

Example 2:

+ +
+Input: digits = [8,6,7,1,0]
+Output: "8760"
+
+ +

Example 3:

+ +
+Input: digits = [1]
+Output: ""
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= digits.length <= 104
    • +
  • 0 <= digits[i] <= 9
    • +
+",3.0,False,"class Solution { +public: + string largestMultipleOfThree(vector& digits) { + + } +};","class Solution { + public String largestMultipleOfThree(int[] digits) { + + } +}","class Solution(object): + def largestMultipleOfThree(self, digits): + """""" + :type digits: List[int] + :rtype: str + """""" + ","class Solution: + def largestMultipleOfThree(self, digits: List[int]) -> str: + ","char * largestMultipleOfThree(int* digits, int digitsSize){ + +}","public class Solution { + public string LargestMultipleOfThree(int[] digits) { + + } +}","/** + * @param {number[]} digits + * @return {string} + */ +var largestMultipleOfThree = function(digits) { + +};","# @param {Integer[]} digits +# @return {String} +def largest_multiple_of_three(digits) + +end","class Solution { + func largestMultipleOfThree(_ digits: [Int]) -> String { + + } +}","func largestMultipleOfThree(digits []int) string { + +}","object Solution { + def largestMultipleOfThree(digits: Array[Int]): String = { + + } +}","class Solution { + fun largestMultipleOfThree(digits: IntArray): String { + + } +}","impl Solution { + pub fn largest_multiple_of_three(digits: Vec) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $digits + * @return String + */ + function largestMultipleOfThree($digits) { + + } +}","function largestMultipleOfThree(digits: number[]): string { + +};","(define/contract (largest-multiple-of-three digits) + (-> (listof exact-integer?) string?) + + )","-spec largest_multiple_of_three(Digits :: [integer()]) -> unicode:unicode_binary(). +largest_multiple_of_three(Digits) -> + .","defmodule Solution do + @spec largest_multiple_of_three(digits :: [integer]) :: String.t + def largest_multiple_of_three(digits) do + + end +end","class Solution { + String largestMultipleOfThree(List digits) { + + } +}", +1194,validate-binary-tree-nodes,Validate Binary Tree Nodes,1361.0,1275.0,"

You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the given nodes form exactly one valid binary tree.

+ +

If node i has no left child then leftChild[i] will equal -1, similarly for the right child.

+ +

Note that the nodes have no values and that we only use the node numbers in this problem.

+ +

 

+

Example 1:

+ +
+Input: n = 4, leftChild = [1,-1,3,-1], rightChild = [2,-1,-1,-1]
+Output: true
+
+ +

Example 2:

+ +
+Input: n = 4, leftChild = [1,-1,3,-1], rightChild = [2,3,-1,-1]
+Output: false
+
+ +

Example 3:

+ +
+Input: n = 2, leftChild = [1,0], rightChild = [-1,-1]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • n == leftChild.length == rightChild.length
    • +
  • 1 <= n <= 104
    • +
  • -1 <= leftChild[i], rightChild[i] <= n - 1
    • +
+",2.0,False,"class Solution { +public: + bool validateBinaryTreeNodes(int n, vector& leftChild, vector& rightChild) { + + } +};","class Solution { + public boolean validateBinaryTreeNodes(int n, int[] leftChild, int[] rightChild) { + + } +}","class Solution(object): + def validateBinaryTreeNodes(self, n, leftChild, rightChild): + """""" + :type n: int + :type leftChild: List[int] + :type rightChild: List[int] + :rtype: bool + """""" + ","class Solution: + def validateBinaryTreeNodes(self, n: int, leftChild: List[int], rightChild: List[int]) -> bool: + ","bool validateBinaryTreeNodes(int n, int* leftChild, int leftChildSize, int* rightChild, int rightChildSize){ + +}","public class Solution { + public bool ValidateBinaryTreeNodes(int n, int[] leftChild, int[] rightChild) { + + } +}","/** + * @param {number} n + * @param {number[]} leftChild + * @param {number[]} rightChild + * @return {boolean} + */ +var validateBinaryTreeNodes = function(n, leftChild, rightChild) { + +};","# @param {Integer} n +# @param {Integer[]} left_child +# @param {Integer[]} right_child +# @return {Boolean} +def validate_binary_tree_nodes(n, left_child, right_child) + +end","class Solution { + func validateBinaryTreeNodes(_ n: Int, _ leftChild: [Int], _ rightChild: [Int]) -> Bool { + + } +}","func validateBinaryTreeNodes(n int, leftChild []int, rightChild []int) bool { + +}","object Solution { + def validateBinaryTreeNodes(n: Int, leftChild: Array[Int], rightChild: Array[Int]): Boolean = { + + } +}","class Solution { + fun validateBinaryTreeNodes(n: Int, leftChild: IntArray, rightChild: IntArray): Boolean { + + } +}","impl Solution { + pub fn validate_binary_tree_nodes(n: i32, left_child: Vec, right_child: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $leftChild + * @param Integer[] $rightChild + * @return Boolean + */ + function validateBinaryTreeNodes($n, $leftChild, $rightChild) { + + } +}","function validateBinaryTreeNodes(n: number, leftChild: number[], rightChild: number[]): boolean { + +};","(define/contract (validate-binary-tree-nodes n leftChild rightChild) + (-> exact-integer? (listof exact-integer?) (listof exact-integer?) boolean?) + + )","-spec validate_binary_tree_nodes(N :: integer(), LeftChild :: [integer()], RightChild :: [integer()]) -> boolean(). +validate_binary_tree_nodes(N, LeftChild, RightChild) -> + .","defmodule Solution do + @spec validate_binary_tree_nodes(n :: integer, left_child :: [integer], right_child :: [integer]) :: boolean + def validate_binary_tree_nodes(n, left_child, right_child) do + + end +end","class Solution { + bool validateBinaryTreeNodes(int n, List leftChild, List rightChild) { + + } +}", +1195,number-of-days-between-two-dates,Number of Days Between Two Dates,1360.0,1274.0,"

Write a program to count the number of days between two dates.

+ +

The two dates are given as strings, their format is YYYY-MM-DD as shown in the examples.

+ +

 

+

Example 1:

+
Input: date1 = ""2019-06-29"", date2 = ""2019-06-30""
+Output: 1
+

Example 2:

+
Input: date1 = ""2020-01-15"", date2 = ""2019-12-31""
+Output: 15
+
+

 

+

Constraints:

+ +
    +
  • The given dates are valid dates between the years 1971 and 2100.
    • +
+",1.0,False,"class Solution { +public: + int daysBetweenDates(string date1, string date2) { + + } +};","class Solution { + public int daysBetweenDates(String date1, String date2) { + + } +}","class Solution(object): + def daysBetweenDates(self, date1, date2): + """""" + :type date1: str + :type date2: str + :rtype: int + """""" + ","class Solution: + def daysBetweenDates(self, date1: str, date2: str) -> int: + ","int daysBetweenDates(char * date1, char * date2){ + +}","public class Solution { + public int DaysBetweenDates(string date1, string date2) { + + } +}","/** + * @param {string} date1 + * @param {string} date2 + * @return {number} + */ +var daysBetweenDates = function(date1, date2) { + +};","# @param {String} date1 +# @param {String} date2 +# @return {Integer} +def days_between_dates(date1, date2) + +end","class Solution { + func daysBetweenDates(_ date1: String, _ date2: String) -> Int { + + } +}","func daysBetweenDates(date1 string, date2 string) int { + +}","object Solution { + def daysBetweenDates(date1: String, date2: String): Int = { + + } +}","class Solution { + fun daysBetweenDates(date1: String, date2: String): Int { + + } +}","impl Solution { + pub fn days_between_dates(date1: String, date2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $date1 + * @param String $date2 + * @return Integer + */ + function daysBetweenDates($date1, $date2) { + + } +}","function daysBetweenDates(date1: string, date2: string): number { + +};","(define/contract (days-between-dates date1 date2) + (-> string? string? exact-integer?) + + )","-spec days_between_dates(Date1 :: unicode:unicode_binary(), Date2 :: unicode:unicode_binary()) -> integer(). +days_between_dates(Date1, Date2) -> + .","defmodule Solution do + @spec days_between_dates(date1 :: String.t, date2 :: String.t) :: integer + def days_between_dates(date1, date2) do + + end +end","class Solution { + int daysBetweenDates(String date1, String date2) { + + } +}", +1197,invalid-transactions,Invalid Transactions,1169.0,1272.0,"

A transaction is possibly invalid if:

+ +
    +
  • the amount exceeds $1000, or;
    • +
  • if it occurs within (and including) 60 minutes of another transaction with the same name in a different city.
    • +
+ +

You are given an array of strings transaction where transactions[i] consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.

+ +

Return a list of transactions that are possibly invalid. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: transactions = ["alice,20,800,mtv","alice,50,100,beijing"]
+Output: ["alice,20,800,mtv","alice,50,100,beijing"]
+Explanation: The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.
+ +

Example 2:

+ +
+Input: transactions = ["alice,20,800,mtv","alice,50,1200,mtv"]
+Output: ["alice,50,1200,mtv"]
+
+ +

Example 3:

+ +
+Input: transactions = ["alice,20,800,mtv","bob,50,1200,mtv"]
+Output: ["bob,50,1200,mtv"]
+
+ +

 

+

Constraints:

+ +
    +
  • transactions.length <= 1000
    • +
  • Each transactions[i] takes the form "{name},{time},{amount},{city}"
    • +
  • Each {name} and {city} consist of lowercase English letters, and have lengths between 1 and 10.
    • +
  • Each {time} consist of digits, and represent an integer between 0 and 1000.
    • +
  • Each {amount} consist of digits, and represent an integer between 0 and 2000.
    • +
+",2.0,False,"class Solution { +public: + vector invalidTransactions(vector& transactions) { + + } +};","class Solution { + public List invalidTransactions(String[] transactions) { + + } +}","class Solution(object): + def invalidTransactions(self, transactions): + """""" + :type transactions: List[str] + :rtype: List[str] + """""" + ","class Solution: + def invalidTransactions(self, transactions: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** invalidTransactions(char ** transactions, int transactionsSize, int* returnSize){ + +}","public class Solution { + public IList InvalidTransactions(string[] transactions) { + + } +}","/** + * @param {string[]} transactions + * @return {string[]} + */ +var invalidTransactions = function(transactions) { + +};","# @param {String[]} transactions +# @return {String[]} +def invalid_transactions(transactions) + +end","class Solution { + func invalidTransactions(_ transactions: [String]) -> [String] { + + } +}","func invalidTransactions(transactions []string) []string { + +}","object Solution { + def invalidTransactions(transactions: Array[String]): List[String] = { + + } +}","class Solution { + fun invalidTransactions(transactions: Array): List { + + } +}","impl Solution { + pub fn invalid_transactions(transactions: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $transactions + * @return String[] + */ + function invalidTransactions($transactions) { + + } +}","function invalidTransactions(transactions: string[]): string[] { + +};","(define/contract (invalid-transactions transactions) + (-> (listof string?) (listof string?)) + + )","-spec invalid_transactions(Transactions :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +invalid_transactions(Transactions) -> + .","defmodule Solution do + @spec invalid_transactions(transactions :: [String.t]) :: [String.t] + def invalid_transactions(transactions) do + + end +end","class Solution { + List invalidTransactions(List transactions) { + + } +}", +1198,dinner-plate-stacks,Dinner Plate Stacks,1172.0,1270.0,"

You have an infinite number of stacks arranged in a row and numbered (left to right) from 0, each of the stacks has the same maximum capacity.

+ +

Implement the DinnerPlates class:

+ +
    +
  • DinnerPlates(int capacity) Initializes the object with the maximum capacity of the stacks capacity.
    • +
  • void push(int val) Pushes the given integer val into the leftmost stack with a size less than capacity.
    • +
  • int pop() Returns the value at the top of the rightmost non-empty stack and removes it from that stack, and returns -1 if all the stacks are empty.
    • +
  • int popAtStack(int index) Returns the value at the top of the stack with the given index index and removes it from that stack or returns -1 if the stack with that given index is empty.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["DinnerPlates", "push", "push", "push", "push", "push", "popAtStack", "push", "push", "popAtStack", "popAtStack", "pop", "pop", "pop", "pop", "pop"]
+[[2], [1], [2], [3], [4], [5], [0], [20], [21], [0], [2], [], [], [], [], []]
+Output
+[null, null, null, null, null, null, 2, null, null, 20, 21, 5, 4, 3, 1, -1]
+
+Explanation: 
+DinnerPlates D = DinnerPlates(2);  // Initialize with capacity = 2
+D.push(1);
+D.push(2);
+D.push(3);
+D.push(4);
+D.push(5);         // The stacks are now:  2  4
+                                           1  3  5
+                                           ﹈ ﹈ ﹈
+D.popAtStack(0);   // Returns 2.  The stacks are now:     4
+                                                       1  3  5
+                                                       ﹈ ﹈ ﹈
+D.push(20);        // The stacks are now: 20  4
+                                           1  3  5
+                                           ﹈ ﹈ ﹈
+D.push(21);        // The stacks are now: 20  4 21
+                                           1  3  5
+                                           ﹈ ﹈ ﹈
+D.popAtStack(0);   // Returns 20.  The stacks are now:     4 21
+                                                        1  3  5
+                                                        ﹈ ﹈ ﹈
+D.popAtStack(2);   // Returns 21.  The stacks are now:     4
+                                                        1  3  5
+                                                        ﹈ ﹈ ﹈ 
+D.pop()            // Returns 5.  The stacks are now:      4
+                                                        1  3 
+                                                        ﹈ ﹈  
+D.pop()            // Returns 4.  The stacks are now:   1  3 
+                                                        ﹈ ﹈   
+D.pop()            // Returns 3.  The stacks are now:   1 
+                                                        ﹈   
+D.pop()            // Returns 1.  There are no stacks.
+D.pop()            // Returns -1.  There are still no stacks.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= capacity <= 2 * 104
    • +
  • 1 <= val <= 2 * 104
    • +
  • 0 <= index <= 105
    • +
  • At most 2 * 105 calls will be made to push, pop, and popAtStack.
    • +
+",3.0,False,"class DinnerPlates { +public: + DinnerPlates(int capacity) { + + } + + void push(int val) { + + } + + int pop() { + + } + + int popAtStack(int index) { + + } +}; + +/** + * Your DinnerPlates object will be instantiated and called as such: + * DinnerPlates* obj = new DinnerPlates(capacity); + * obj->push(val); + * int param_2 = obj->pop(); + * int param_3 = obj->popAtStack(index); + */","class DinnerPlates { + + public DinnerPlates(int capacity) { + + } + + public void push(int val) { + + } + + public int pop() { + + } + + public int popAtStack(int index) { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * DinnerPlates obj = new DinnerPlates(capacity); + * obj.push(val); + * int param_2 = obj.pop(); + * int param_3 = obj.popAtStack(index); + */","class DinnerPlates(object): + + def __init__(self, capacity): + """""" + :type capacity: int + """""" + + + def push(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def pop(self): + """""" + :rtype: int + """""" + + + def popAtStack(self, index): + """""" + :type index: int + :rtype: int + """""" + + + +# Your DinnerPlates object will be instantiated and called as such: +# obj = DinnerPlates(capacity) +# obj.push(val) +# param_2 = obj.pop() +# param_3 = obj.popAtStack(index)","class DinnerPlates: + + def __init__(self, capacity: int): + + + def push(self, val: int) -> None: + + + def pop(self) -> int: + + + def popAtStack(self, index: int) -> int: + + + +# Your DinnerPlates object will be instantiated and called as such: +# obj = DinnerPlates(capacity) +# obj.push(val) +# param_2 = obj.pop() +# param_3 = obj.popAtStack(index)"," + + +typedef struct { + +} DinnerPlates; + + +DinnerPlates* dinnerPlatesCreate(int capacity) { + +} + +void dinnerPlatesPush(DinnerPlates* obj, int val) { + +} + +int dinnerPlatesPop(DinnerPlates* obj) { + +} + +int dinnerPlatesPopAtStack(DinnerPlates* obj, int index) { + +} + +void dinnerPlatesFree(DinnerPlates* obj) { + +} + +/** + * Your DinnerPlates struct will be instantiated and called as such: + * DinnerPlates* obj = dinnerPlatesCreate(capacity); + * dinnerPlatesPush(obj, val); + + * int param_2 = dinnerPlatesPop(obj); + + * int param_3 = dinnerPlatesPopAtStack(obj, index); + + * dinnerPlatesFree(obj); +*/","public class DinnerPlates { + + public DinnerPlates(int capacity) { + + } + + public void Push(int val) { + + } + + public int Pop() { + + } + + public int PopAtStack(int index) { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * DinnerPlates obj = new DinnerPlates(capacity); + * obj.Push(val); + * int param_2 = obj.Pop(); + * int param_3 = obj.PopAtStack(index); + */","/** + * @param {number} capacity + */ +var DinnerPlates = function(capacity) { + +}; + +/** + * @param {number} val + * @return {void} + */ +DinnerPlates.prototype.push = function(val) { + +}; + +/** + * @return {number} + */ +DinnerPlates.prototype.pop = function() { + +}; + +/** + * @param {number} index + * @return {number} + */ +DinnerPlates.prototype.popAtStack = function(index) { + +}; + +/** + * Your DinnerPlates object will be instantiated and called as such: + * var obj = new DinnerPlates(capacity) + * obj.push(val) + * var param_2 = obj.pop() + * var param_3 = obj.popAtStack(index) + */","class DinnerPlates + +=begin + :type capacity: Integer +=end + def initialize(capacity) + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def push(val) + + end + + +=begin + :rtype: Integer +=end + def pop() + + end + + +=begin + :type index: Integer + :rtype: Integer +=end + def pop_at_stack(index) + + end + + +end + +# Your DinnerPlates object will be instantiated and called as such: +# obj = DinnerPlates.new(capacity) +# obj.push(val) +# param_2 = obj.pop() +# param_3 = obj.pop_at_stack(index)"," +class DinnerPlates { + + init(_ capacity: Int) { + + } + + func push(_ val: Int) { + + } + + func pop() -> Int { + + } + + func popAtStack(_ index: Int) -> Int { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * let obj = DinnerPlates(capacity) + * obj.push(val) + * let ret_2: Int = obj.pop() + * let ret_3: Int = obj.popAtStack(index) + */","type DinnerPlates struct { + +} + + +func Constructor(capacity int) DinnerPlates { + +} + + +func (this *DinnerPlates) Push(val int) { + +} + + +func (this *DinnerPlates) Pop() int { + +} + + +func (this *DinnerPlates) PopAtStack(index int) int { + +} + + +/** + * Your DinnerPlates object will be instantiated and called as such: + * obj := Constructor(capacity); + * obj.Push(val); + * param_2 := obj.Pop(); + * param_3 := obj.PopAtStack(index); + */","class DinnerPlates(_capacity: Int) { + + def push(`val`: Int) { + + } + + def pop(): Int = { + + } + + def popAtStack(index: Int): Int = { + + } + +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * var obj = new DinnerPlates(capacity) + * obj.push(`val`) + * var param_2 = obj.pop() + * var param_3 = obj.popAtStack(index) + */","class DinnerPlates(capacity: Int) { + + fun push(`val`: Int) { + + } + + fun pop(): Int { + + } + + fun popAtStack(index: Int): Int { + + } + +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * var obj = DinnerPlates(capacity) + * obj.push(`val`) + * var param_2 = obj.pop() + * var param_3 = obj.popAtStack(index) + */","struct DinnerPlates { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl DinnerPlates { + + fn new(capacity: i32) -> Self { + + } + + fn push(&self, val: i32) { + + } + + fn pop(&self) -> i32 { + + } + + fn pop_at_stack(&self, index: i32) -> i32 { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * let obj = DinnerPlates::new(capacity); + * obj.push(val); + * let ret_2: i32 = obj.pop(); + * let ret_3: i32 = obj.pop_at_stack(index); + */","class DinnerPlates { + /** + * @param Integer $capacity + */ + function __construct($capacity) { + + } + + /** + * @param Integer $val + * @return NULL + */ + function push($val) { + + } + + /** + * @return Integer + */ + function pop() { + + } + + /** + * @param Integer $index + * @return Integer + */ + function popAtStack($index) { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * $obj = DinnerPlates($capacity); + * $obj->push($val); + * $ret_2 = $obj->pop(); + * $ret_3 = $obj->popAtStack($index); + */","class DinnerPlates { + constructor(capacity: number) { + + } + + push(val: number): void { + + } + + pop(): number { + + } + + popAtStack(index: number): number { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * var obj = new DinnerPlates(capacity) + * obj.push(val) + * var param_2 = obj.pop() + * var param_3 = obj.popAtStack(index) + */","(define dinner-plates% + (class object% + (super-new) + + ; capacity : exact-integer? + (init-field + capacity) + + ; push : exact-integer? -> void? + (define/public (push val) + + ) + ; pop : -> exact-integer? + (define/public (pop) + + ) + ; pop-at-stack : exact-integer? -> exact-integer? + (define/public (pop-at-stack index) + + ))) + +;; Your dinner-plates% object will be instantiated and called as such: +;; (define obj (new dinner-plates% [capacity capacity])) +;; (send obj push val) +;; (define param_2 (send obj pop)) +;; (define param_3 (send obj pop-at-stack index))","-spec dinner_plates_init_(Capacity :: integer()) -> any(). +dinner_plates_init_(Capacity) -> + . + +-spec dinner_plates_push(Val :: integer()) -> any(). +dinner_plates_push(Val) -> + . + +-spec dinner_plates_pop() -> integer(). +dinner_plates_pop() -> + . + +-spec dinner_plates_pop_at_stack(Index :: integer()) -> integer(). +dinner_plates_pop_at_stack(Index) -> + . + + +%% Your functions will be called as such: +%% dinner_plates_init_(Capacity), +%% dinner_plates_push(Val), +%% Param_2 = dinner_plates_pop(), +%% Param_3 = dinner_plates_pop_at_stack(Index), + +%% dinner_plates_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule DinnerPlates do + @spec init_(capacity :: integer) :: any + def init_(capacity) do + + end + + @spec push(val :: integer) :: any + def push(val) do + + end + + @spec pop() :: integer + def pop() do + + end + + @spec pop_at_stack(index :: integer) :: integer + def pop_at_stack(index) do + + end +end + +# Your functions will be called as such: +# DinnerPlates.init_(capacity) +# DinnerPlates.push(val) +# param_2 = DinnerPlates.pop() +# param_3 = DinnerPlates.pop_at_stack(index) + +# DinnerPlates.init_ will be called before every test case, in which you can do some necessary initializations.","class DinnerPlates { + + DinnerPlates(int capacity) { + + } + + void push(int val) { + + } + + int pop() { + + } + + int popAtStack(int index) { + + } +} + +/** + * Your DinnerPlates object will be instantiated and called as such: + * DinnerPlates obj = DinnerPlates(capacity); + * obj.push(val); + * int param2 = obj.pop(); + * int param3 = obj.popAtStack(index); + */", +1201,number-of-dice-rolls-with-target-sum,Number of Dice Rolls With Target Sum,1155.0,1263.0,"

You have n dice, and each die has k faces numbered from 1 to k.

+ +

Given three integers n, k, and target, return the number of possible ways (out of the kn total ways) to roll the dice, so the sum of the face-up numbers equals target. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1, k = 6, target = 3
+Output: 1
+Explanation: You throw one die with 6 faces.
+There is only one way to get a sum of 3.
+
+ +

Example 2:

+ +
+Input: n = 2, k = 6, target = 7
+Output: 6
+Explanation: You throw two dice, each with 6 faces.
+There are 6 ways to get a sum of 7: 1+6, 2+5, 3+4, 4+3, 5+2, 6+1.
+
+ +

Example 3:

+ +
+Input: n = 30, k = 30, target = 500
+Output: 222616187
+Explanation: The answer must be returned modulo 109 + 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n, k <= 30
    • +
  • 1 <= target <= 1000
    • +
+",2.0,False,"class Solution { +public: + int numRollsToTarget(int n, int k, int target) { + + } +};","class Solution { + public int numRollsToTarget(int n, int k, int target) { + + } +}","class Solution(object): + def numRollsToTarget(self, n, k, target): + """""" + :type n: int + :type k: int + :type target: int + :rtype: int + """""" + ","class Solution: + def numRollsToTarget(self, n: int, k: int, target: int) -> int: + ","int numRollsToTarget(int n, int k, int target){ + +}","public class Solution { + public int NumRollsToTarget(int n, int k, int target) { + + } +}","/** + * @param {number} n + * @param {number} k + * @param {number} target + * @return {number} + */ +var numRollsToTarget = function(n, k, target) { + +};","# @param {Integer} n +# @param {Integer} k +# @param {Integer} target +# @return {Integer} +def num_rolls_to_target(n, k, target) + +end","class Solution { + func numRollsToTarget(_ n: Int, _ k: Int, _ target: Int) -> Int { + + } +}","func numRollsToTarget(n int, k int, target int) int { + +}","object Solution { + def numRollsToTarget(n: Int, k: Int, target: Int): Int = { + + } +}","class Solution { + fun numRollsToTarget(n: Int, k: Int, target: Int): Int { + + } +}","impl Solution { + pub fn num_rolls_to_target(n: i32, k: i32, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @param Integer $target + * @return Integer + */ + function numRollsToTarget($n, $k, $target) { + + } +}","function numRollsToTarget(n: number, k: number, target: number): number { + +};","(define/contract (num-rolls-to-target n k target) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec num_rolls_to_target(N :: integer(), K :: integer(), Target :: integer()) -> integer(). +num_rolls_to_target(N, K, Target) -> + .","defmodule Solution do + @spec num_rolls_to_target(n :: integer, k :: integer, target :: integer) :: integer + def num_rolls_to_target(n, k, target) do + + end +end","class Solution { + int numRollsToTarget(int n, int k, int target) { + + } +}", +1202,online-majority-element-in-subarray,Online Majority Element In Subarray,1157.0,1262.0,"

Design a data structure that efficiently finds the majority element of a given subarray.

+ +

The majority element of a subarray is an element that occurs threshold times or more in the subarray.

+ +

Implementing the MajorityChecker class:

+ +
    +
  • MajorityChecker(int[] arr) Initializes the instance of the class with the given array arr.
    • +
  • int query(int left, int right, int threshold) returns the element in the subarray arr[left...right] that occurs at least threshold times, or -1 if no such element exists.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MajorityChecker", "query", "query", "query"]
+[[[1, 1, 2, 2, 1, 1]], [0, 5, 4], [0, 3, 3], [2, 3, 2]]
+Output
+[null, 1, -1, 2]
+
+Explanation
+MajorityChecker majorityChecker = new MajorityChecker([1, 1, 2, 2, 1, 1]);
+majorityChecker.query(0, 5, 4); // return 1
+majorityChecker.query(0, 3, 3); // return -1
+majorityChecker.query(2, 3, 2); // return 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 2 * 104
    • +
  • 1 <= arr[i] <= 2 * 104
    • +
  • 0 <= left <= right < arr.length
    • +
  • threshold <= right - left + 1
    • +
  • 2 * threshold > right - left + 1
    • +
  • At most 104 calls will be made to query.
    • +
+",3.0,False,"class MajorityChecker { +public: + MajorityChecker(vector& arr) { + + } + + int query(int left, int right, int threshold) { + + } +}; + +/** + * Your MajorityChecker object will be instantiated and called as such: + * MajorityChecker* obj = new MajorityChecker(arr); + * int param_1 = obj->query(left,right,threshold); + */","class MajorityChecker { + + public MajorityChecker(int[] arr) { + + } + + public int query(int left, int right, int threshold) { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * MajorityChecker obj = new MajorityChecker(arr); + * int param_1 = obj.query(left,right,threshold); + */","class MajorityChecker(object): + + def __init__(self, arr): + """""" + :type arr: List[int] + """""" + + + def query(self, left, right, threshold): + """""" + :type left: int + :type right: int + :type threshold: int + :rtype: int + """""" + + + +# Your MajorityChecker object will be instantiated and called as such: +# obj = MajorityChecker(arr) +# param_1 = obj.query(left,right,threshold)","class MajorityChecker: + + def __init__(self, arr: List[int]): + + + def query(self, left: int, right: int, threshold: int) -> int: + + + +# Your MajorityChecker object will be instantiated and called as such: +# obj = MajorityChecker(arr) +# param_1 = obj.query(left,right,threshold)"," + + +typedef struct { + +} MajorityChecker; + + +MajorityChecker* majorityCheckerCreate(int* arr, int arrSize) { + +} + +int majorityCheckerQuery(MajorityChecker* obj, int left, int right, int threshold) { + +} + +void majorityCheckerFree(MajorityChecker* obj) { + +} + +/** + * Your MajorityChecker struct will be instantiated and called as such: + * MajorityChecker* obj = majorityCheckerCreate(arr, arrSize); + * int param_1 = majorityCheckerQuery(obj, left, right, threshold); + + * majorityCheckerFree(obj); +*/","public class MajorityChecker { + + public MajorityChecker(int[] arr) { + + } + + public int Query(int left, int right, int threshold) { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * MajorityChecker obj = new MajorityChecker(arr); + * int param_1 = obj.Query(left,right,threshold); + */","/** + * @param {number[]} arr + */ +var MajorityChecker = function(arr) { + +}; + +/** + * @param {number} left + * @param {number} right + * @param {number} threshold + * @return {number} + */ +MajorityChecker.prototype.query = function(left, right, threshold) { + +}; + +/** + * Your MajorityChecker object will be instantiated and called as such: + * var obj = new MajorityChecker(arr) + * var param_1 = obj.query(left,right,threshold) + */","class MajorityChecker + +=begin + :type arr: Integer[] +=end + def initialize(arr) + + end + + +=begin + :type left: Integer + :type right: Integer + :type threshold: Integer + :rtype: Integer +=end + def query(left, right, threshold) + + end + + +end + +# Your MajorityChecker object will be instantiated and called as such: +# obj = MajorityChecker.new(arr) +# param_1 = obj.query(left, right, threshold)"," +class MajorityChecker { + + init(_ arr: [Int]) { + + } + + func query(_ left: Int, _ right: Int, _ threshold: Int) -> Int { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * let obj = MajorityChecker(arr) + * let ret_1: Int = obj.query(left, right, threshold) + */","type MajorityChecker struct { + +} + + +func Constructor(arr []int) MajorityChecker { + +} + + +func (this *MajorityChecker) Query(left int, right int, threshold int) int { + +} + + +/** + * Your MajorityChecker object will be instantiated and called as such: + * obj := Constructor(arr); + * param_1 := obj.Query(left,right,threshold); + */","class MajorityChecker(_arr: Array[Int]) { + + def query(left: Int, right: Int, threshold: Int): Int = { + + } + +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * var obj = new MajorityChecker(arr) + * var param_1 = obj.query(left,right,threshold) + */","class MajorityChecker(arr: IntArray) { + + fun query(left: Int, right: Int, threshold: Int): Int { + + } + +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * var obj = MajorityChecker(arr) + * var param_1 = obj.query(left,right,threshold) + */","struct MajorityChecker { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MajorityChecker { + + fn new(arr: Vec) -> Self { + + } + + fn query(&self, left: i32, right: i32, threshold: i32) -> i32 { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * let obj = MajorityChecker::new(arr); + * let ret_1: i32 = obj.query(left, right, threshold); + */","class MajorityChecker { + /** + * @param Integer[] $arr + */ + function __construct($arr) { + + } + + /** + * @param Integer $left + * @param Integer $right + * @param Integer $threshold + * @return Integer + */ + function query($left, $right, $threshold) { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * $obj = MajorityChecker($arr); + * $ret_1 = $obj->query($left, $right, $threshold); + */","class MajorityChecker { + constructor(arr: number[]) { + + } + + query(left: number, right: number, threshold: number): number { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * var obj = new MajorityChecker(arr) + * var param_1 = obj.query(left,right,threshold) + */","(define majority-checker% + (class object% + (super-new) + + ; arr : (listof exact-integer?) + (init-field + arr) + + ; query : exact-integer? exact-integer? exact-integer? -> exact-integer? + (define/public (query left right threshold) + + ))) + +;; Your majority-checker% object will be instantiated and called as such: +;; (define obj (new majority-checker% [arr arr])) +;; (define param_1 (send obj query left right threshold))","-spec majority_checker_init_(Arr :: [integer()]) -> any(). +majority_checker_init_(Arr) -> + . + +-spec majority_checker_query(Left :: integer(), Right :: integer(), Threshold :: integer()) -> integer(). +majority_checker_query(Left, Right, Threshold) -> + . + + +%% Your functions will be called as such: +%% majority_checker_init_(Arr), +%% Param_1 = majority_checker_query(Left, Right, Threshold), + +%% majority_checker_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MajorityChecker do + @spec init_(arr :: [integer]) :: any + def init_(arr) do + + end + + @spec query(left :: integer, right :: integer, threshold :: integer) :: integer + def query(left, right, threshold) do + + end +end + +# Your functions will be called as such: +# MajorityChecker.init_(arr) +# param_1 = MajorityChecker.query(left, right, threshold) + +# MajorityChecker.init_ will be called before every test case, in which you can do some necessary initializations.","class MajorityChecker { + + MajorityChecker(List arr) { + + } + + int query(int left, int right, int threshold) { + + } +} + +/** + * Your MajorityChecker object will be instantiated and called as such: + * MajorityChecker obj = MajorityChecker(arr); + * int param1 = obj.query(left,right,threshold); + */", +1203,swap-for-longest-repeated-character-substring,Swap For Longest Repeated Character Substring,1156.0,1261.0,"

You are given a string text. You can swap two of the characters in the text.

+ +

Return the length of the longest substring with repeated characters.

+ +

 

+

Example 1:

+ +
+Input: text = "ababa"
+Output: 3
+Explanation: We can swap the first 'b' with the last 'a', or the last 'b' with the first 'a'. Then, the longest repeated character substring is "aaa" with length 3.
+
+ +

Example 2:

+ +
+Input: text = "aaabaaa"
+Output: 6
+Explanation: Swap 'b' with the last 'a' (or the first 'a'), and we get longest repeated character substring "aaaaaa" with length 6.
+
+ +

Example 3:

+ +
+Input: text = "aaaaa"
+Output: 5
+Explanation: No need to swap, longest repeated character substring is "aaaaa" with length is 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= text.length <= 2 * 104
    • +
  • text consist of lowercase English characters only.
    • +
+",2.0,False,"class Solution { +public: + int maxRepOpt1(string text) { + + } +};","class Solution { + public int maxRepOpt1(String text) { + + } +}","class Solution(object): + def maxRepOpt1(self, text): + """""" + :type text: str + :rtype: int + """""" + ","class Solution: + def maxRepOpt1(self, text: str) -> int: + ","int maxRepOpt1(char * text){ + +}","public class Solution { + public int MaxRepOpt1(string text) { + + } +}","/** + * @param {string} text + * @return {number} + */ +var maxRepOpt1 = function(text) { + +};","# @param {String} text +# @return {Integer} +def max_rep_opt1(text) + +end","class Solution { + func maxRepOpt1(_ text: String) -> Int { + + } +}","func maxRepOpt1(text string) int { + +}","object Solution { + def maxRepOpt1(text: String): Int = { + + } +}","class Solution { + fun maxRepOpt1(text: String): Int { + + } +}","impl Solution { + pub fn max_rep_opt1(text: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $text + * @return Integer + */ + function maxRepOpt1($text) { + + } +}","function maxRepOpt1(text: string): number { + +};","(define/contract (max-rep-opt1 text) + (-> string? exact-integer?) + + )","-spec max_rep_opt1(Text :: unicode:unicode_binary()) -> integer(). +max_rep_opt1(Text) -> + .","defmodule Solution do + @spec max_rep_opt1(text :: String.t) :: integer + def max_rep_opt1(text) do + + end +end","class Solution { + int maxRepOpt1(String text) { + + } +}", +1205,rank-transform-of-a-matrix,Rank Transform of a Matrix,1632.0,1257.0,"

Given an m x n matrix, return a new matrix answer where answer[row][col] is the rank of matrix[row][col].

+ +

The rank is an integer that represents how large an element is compared to other elements. It is calculated using the following rules:

+ +
    +
  • The rank is an integer starting from 1.
    • +
  • If two elements p and q are in the same row or column, then: +
      +
    • If p < q then rank(p) < rank(q)
      • +
    • If p == q then rank(p) == rank(q)
      • +
    • If p > q then rank(p) > rank(q)
      • +
    +
    • +
  • The rank should be as small as possible.
    • +
+ +

The test cases are generated so that answer is unique under the given rules.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[1,2],[3,4]]
+Output: [[1,2],[2,3]]
+Explanation:
+The rank of matrix[0][0] is 1 because it is the smallest integer in its row and column.
+The rank of matrix[0][1] is 2 because matrix[0][1] > matrix[0][0] and matrix[0][0] is rank 1.
+The rank of matrix[1][0] is 2 because matrix[1][0] > matrix[0][0] and matrix[0][0] is rank 1.
+The rank of matrix[1][1] is 3 because matrix[1][1] > matrix[0][1], matrix[1][1] > matrix[1][0], and both matrix[0][1] and matrix[1][0] are rank 2.
+
+ +

Example 2:

+ +
+Input: matrix = [[7,7],[7,7]]
+Output: [[1,1],[1,1]]
+
+ +

Example 3:

+ +
+Input: matrix = [[20,-21,14],[-19,4,19],[22,-47,24],[-19,4,19]]
+Output: [[4,2,3],[1,3,4],[5,1,6],[1,3,4]]
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 500
    • +
  • -109 <= matrix[row][col] <= 109
    • +
+",3.0,False,"class Solution { +public: + vector> matrixRankTransform(vector>& matrix) { + + } +};","class Solution { + public int[][] matrixRankTransform(int[][] matrix) { + + } +}","class Solution(object): + def matrixRankTransform(self, matrix): + """""" + :type matrix: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def matrixRankTransform(self, matrix: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** matrixRankTransform(int** matrix, int matrixSize, int* matrixColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] MatrixRankTransform(int[][] matrix) { + + } +}","/** + * @param {number[][]} matrix + * @return {number[][]} + */ +var matrixRankTransform = function(matrix) { + +};","# @param {Integer[][]} matrix +# @return {Integer[][]} +def matrix_rank_transform(matrix) + +end","class Solution { + func matrixRankTransform(_ matrix: [[Int]]) -> [[Int]] { + + } +}","func matrixRankTransform(matrix [][]int) [][]int { + +}","object Solution { + def matrixRankTransform(matrix: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun matrixRankTransform(matrix: Array): Array { + + } +}","impl Solution { + pub fn matrix_rank_transform(matrix: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @return Integer[][] + */ + function matrixRankTransform($matrix) { + + } +}","function matrixRankTransform(matrix: number[][]): number[][] { + +};","(define/contract (matrix-rank-transform matrix) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec matrix_rank_transform(Matrix :: [[integer()]]) -> [[integer()]]. +matrix_rank_transform(Matrix) -> + .","defmodule Solution do + @spec matrix_rank_transform(matrix :: [[integer]]) :: [[integer]] + def matrix_rank_transform(matrix) do + + end +end","class Solution { + List> matrixRankTransform(List> matrix) { + + } +}", +1207,reverse-subarray-to-maximize-array-value,Reverse Subarray To Maximize Array Value,1330.0,1255.0,"

You are given an integer array nums. The value of this array is defined as the sum of |nums[i] - nums[i + 1]| for all 0 <= i < nums.length - 1.

+ +

You are allowed to select any subarray of the given array and reverse it. You can perform this operation only once.

+ +

Find maximum possible value of the final array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,1,5,4]
+Output: 10
+Explanation: By reversing the subarray [3,1,5] the array becomes [2,5,1,3,4] whose value is 10.
+
+ +

Example 2:

+ +
+Input: nums = [2,4,9,24,2,1,10]
+Output: 68
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • -105 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int maxValueAfterReverse(vector& nums) { + + } +};","class Solution { + public int maxValueAfterReverse(int[] nums) { + + } +}","class Solution(object): + def maxValueAfterReverse(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxValueAfterReverse(self, nums: List[int]) -> int: + ","int maxValueAfterReverse(int* nums, int numsSize){ + +}","public class Solution { + public int MaxValueAfterReverse(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxValueAfterReverse = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_value_after_reverse(nums) + +end","class Solution { + func maxValueAfterReverse(_ nums: [Int]) -> Int { + + } +}","func maxValueAfterReverse(nums []int) int { + +}","object Solution { + def maxValueAfterReverse(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxValueAfterReverse(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_value_after_reverse(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxValueAfterReverse($nums) { + + } +}","function maxValueAfterReverse(nums: number[]): number { + +};",,"-spec max_value_after_reverse(Nums :: [integer()]) -> integer(). +max_value_after_reverse(Nums) -> + .","defmodule Solution do + @spec max_value_after_reverse(nums :: [integer]) :: integer + def max_value_after_reverse(nums) do + + end +end","class Solution { + int maxValueAfterReverse(List nums) { + + } +}", +1211,longest-chunked-palindrome-decomposition,Longest Chunked Palindrome Decomposition,1147.0,1251.0,"

You are given a string text. You should split it to k substrings (subtext1, subtext2, ..., subtextk) such that:

+ +
    +
  • subtexti is a non-empty string.
    • +
  • The concatenation of all the substrings is equal to text (i.e., subtext1 + subtext2 + ... + subtextk == text).
    • +
  • subtexti == subtextk - i + 1 for all valid values of i (i.e., 1 <= i <= k).
    • +
+ +

Return the largest possible value of k.

+ +

 

+

Example 1:

+ +
+Input: text = "ghiabcdefhelloadamhelloabcdefghi"
+Output: 7
+Explanation: We can split the string on "(ghi)(abcdef)(hello)(adam)(hello)(abcdef)(ghi)".
+
+ +

Example 2:

+ +
+Input: text = "merchant"
+Output: 1
+Explanation: We can split the string on "(merchant)".
+
+ +

Example 3:

+ +
+Input: text = "antaprezatepzapreanta"
+Output: 11
+Explanation: We can split the string on "(a)(nt)(a)(pre)(za)(tep)(za)(pre)(a)(nt)(a)".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= text.length <= 1000
    • +
  • text consists only of lowercase English characters.
    • +
+",3.0,False,"class Solution { +public: + int longestDecomposition(string text) { + + } +};","class Solution { + public int longestDecomposition(String text) { + + } +}","class Solution(object): + def longestDecomposition(self, text): + """""" + :type text: str + :rtype: int + """""" + ","class Solution: + def longestDecomposition(self, text: str) -> int: + ","int longestDecomposition(char * text){ + +}","public class Solution { + public int LongestDecomposition(string text) { + + } +}","/** + * @param {string} text + * @return {number} + */ +var longestDecomposition = function(text) { + +};","# @param {String} text +# @return {Integer} +def longest_decomposition(text) + +end","class Solution { + func longestDecomposition(_ text: String) -> Int { + + } +}","func longestDecomposition(text string) int { + +}","object Solution { + def longestDecomposition(text: String): Int = { + + } +}","class Solution { + fun longestDecomposition(text: String): Int { + + } +}","impl Solution { + pub fn longest_decomposition(text: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $text + * @return Integer + */ + function longestDecomposition($text) { + + } +}","function longestDecomposition(text: string): number { + +};","(define/contract (longest-decomposition text) + (-> string? exact-integer?) + + )","-spec longest_decomposition(Text :: unicode:unicode_binary()) -> integer(). +longest_decomposition(Text) -> + .","defmodule Solution do + @spec longest_decomposition(text :: String.t) :: integer + def longest_decomposition(text) do + + end +end","class Solution { + int longestDecomposition(String text) { + + } +}", +1213,snapshot-array,Snapshot Array,1146.0,1249.0,"

Implement a SnapshotArray that supports the following interface:

+ +
    +
  • SnapshotArray(int length) initializes an array-like data structure with the given length. Initially, each element equals 0.
    • +
  • void set(index, val) sets the element at the given index to be equal to val.
    • +
  • int snap() takes a snapshot of the array and returns the snap_id: the total number of times we called snap() minus 1.
    • +
  • int get(index, snap_id) returns the value at the given index, at the time we took the snapshot with the given snap_id
    • +
+ +

 

+

Example 1:

+ +
+Input: ["SnapshotArray","set","snap","set","get"]
+[[3],[0,5],[],[0,6],[0,0]]
+Output: [null,null,0,null,5]
+Explanation: 
+SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3
+snapshotArr.set(0,5);  // Set array[0] = 5
+snapshotArr.snap();  // Take a snapshot, return snap_id = 0
+snapshotArr.set(0,6);
+snapshotArr.get(0,0);  // Get the value of array[0] with snap_id = 0, return 5
+ +

 

+

Constraints:

+ +
    +
  • 1 <= length <= 5 * 104
    • +
  • 0 <= index < length
    • +
  • 0 <= val <= 109
    • +
  • 0 <= snap_id < (the total number of times we call snap())
    • +
  • At most 5 * 104 calls will be made to set, snap, and get.
    • +
+",2.0,False,"class SnapshotArray { +public: + SnapshotArray(int length) { + + } + + void set(int index, int val) { + + } + + int snap() { + + } + + int get(int index, int snap_id) { + + } +}; + +/** + * Your SnapshotArray object will be instantiated and called as such: + * SnapshotArray* obj = new SnapshotArray(length); + * obj->set(index,val); + * int param_2 = obj->snap(); + * int param_3 = obj->get(index,snap_id); + */","class SnapshotArray { + + public SnapshotArray(int length) { + + } + + public void set(int index, int val) { + + } + + public int snap() { + + } + + public int get(int index, int snap_id) { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * SnapshotArray obj = new SnapshotArray(length); + * obj.set(index,val); + * int param_2 = obj.snap(); + * int param_3 = obj.get(index,snap_id); + */","class SnapshotArray(object): + + def __init__(self, length): + """""" + :type length: int + """""" + + + def set(self, index, val): + """""" + :type index: int + :type val: int + :rtype: None + """""" + + + def snap(self): + """""" + :rtype: int + """""" + + + def get(self, index, snap_id): + """""" + :type index: int + :type snap_id: int + :rtype: int + """""" + + + +# Your SnapshotArray object will be instantiated and called as such: +# obj = SnapshotArray(length) +# obj.set(index,val) +# param_2 = obj.snap() +# param_3 = obj.get(index,snap_id)","class SnapshotArray: + + def __init__(self, length: int): + + + def set(self, index: int, val: int) -> None: + + + def snap(self) -> int: + + + def get(self, index: int, snap_id: int) -> int: + + + +# Your SnapshotArray object will be instantiated and called as such: +# obj = SnapshotArray(length) +# obj.set(index,val) +# param_2 = obj.snap() +# param_3 = obj.get(index,snap_id)"," + + +typedef struct { + +} SnapshotArray; + + +SnapshotArray* snapshotArrayCreate(int length) { + +} + +void snapshotArraySet(SnapshotArray* obj, int index, int val) { + +} + +int snapshotArraySnap(SnapshotArray* obj) { + +} + +int snapshotArrayGet(SnapshotArray* obj, int index, int snap_id) { + +} + +void snapshotArrayFree(SnapshotArray* obj) { + +} + +/** + * Your SnapshotArray struct will be instantiated and called as such: + * SnapshotArray* obj = snapshotArrayCreate(length); + * snapshotArraySet(obj, index, val); + + * int param_2 = snapshotArraySnap(obj); + + * int param_3 = snapshotArrayGet(obj, index, snap_id); + + * snapshotArrayFree(obj); +*/","public class SnapshotArray { + + public SnapshotArray(int length) { + + } + + public void Set(int index, int val) { + + } + + public int Snap() { + + } + + public int Get(int index, int snap_id) { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * SnapshotArray obj = new SnapshotArray(length); + * obj.Set(index,val); + * int param_2 = obj.Snap(); + * int param_3 = obj.Get(index,snap_id); + */","/** + * @param {number} length + */ +var SnapshotArray = function(length) { + +}; + +/** + * @param {number} index + * @param {number} val + * @return {void} + */ +SnapshotArray.prototype.set = function(index, val) { + +}; + +/** + * @return {number} + */ +SnapshotArray.prototype.snap = function() { + +}; + +/** + * @param {number} index + * @param {number} snap_id + * @return {number} + */ +SnapshotArray.prototype.get = function(index, snap_id) { + +}; + +/** + * Your SnapshotArray object will be instantiated and called as such: + * var obj = new SnapshotArray(length) + * obj.set(index,val) + * var param_2 = obj.snap() + * var param_3 = obj.get(index,snap_id) + */","class SnapshotArray + +=begin + :type length: Integer +=end + def initialize(length) + + end + + +=begin + :type index: Integer + :type val: Integer + :rtype: Void +=end + def set(index, val) + + end + + +=begin + :rtype: Integer +=end + def snap() + + end + + +=begin + :type index: Integer + :type snap_id: Integer + :rtype: Integer +=end + def get(index, snap_id) + + end + + +end + +# Your SnapshotArray object will be instantiated and called as such: +# obj = SnapshotArray.new(length) +# obj.set(index, val) +# param_2 = obj.snap() +# param_3 = obj.get(index, snap_id)"," +class SnapshotArray { + + init(_ length: Int) { + + } + + func set(_ index: Int, _ val: Int) { + + } + + func snap() -> Int { + + } + + func get(_ index: Int, _ snap_id: Int) -> Int { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * let obj = SnapshotArray(length) + * obj.set(index, val) + * let ret_2: Int = obj.snap() + * let ret_3: Int = obj.get(index, snap_id) + */","type SnapshotArray struct { + +} + + +func Constructor(length int) SnapshotArray { + +} + + +func (this *SnapshotArray) Set(index int, val int) { + +} + + +func (this *SnapshotArray) Snap() int { + +} + + +func (this *SnapshotArray) Get(index int, snap_id int) int { + +} + + +/** + * Your SnapshotArray object will be instantiated and called as such: + * obj := Constructor(length); + * obj.Set(index,val); + * param_2 := obj.Snap(); + * param_3 := obj.Get(index,snap_id); + */","class SnapshotArray(_length: Int) { + + def set(index: Int, `val`: Int) { + + } + + def snap(): Int = { + + } + + def get(index: Int, snap_id: Int): Int = { + + } + +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * var obj = new SnapshotArray(length) + * obj.set(index,`val`) + * var param_2 = obj.snap() + * var param_3 = obj.get(index,snap_id) + */","class SnapshotArray(length: Int) { + + fun set(index: Int, `val`: Int) { + + } + + fun snap(): Int { + + } + + fun get(index: Int, snap_id: Int): Int { + + } + +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * var obj = SnapshotArray(length) + * obj.set(index,`val`) + * var param_2 = obj.snap() + * var param_3 = obj.get(index,snap_id) + */","struct SnapshotArray { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl SnapshotArray { + + fn new(length: i32) -> Self { + + } + + fn set(&self, index: i32, val: i32) { + + } + + fn snap(&self) -> i32 { + + } + + fn get(&self, index: i32, snap_id: i32) -> i32 { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * let obj = SnapshotArray::new(length); + * obj.set(index, val); + * let ret_2: i32 = obj.snap(); + * let ret_3: i32 = obj.get(index, snap_id); + */","class SnapshotArray { + /** + * @param Integer $length + */ + function __construct($length) { + + } + + /** + * @param Integer $index + * @param Integer $val + * @return NULL + */ + function set($index, $val) { + + } + + /** + * @return Integer + */ + function snap() { + + } + + /** + * @param Integer $index + * @param Integer $snap_id + * @return Integer + */ + function get($index, $snap_id) { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * $obj = SnapshotArray($length); + * $obj->set($index, $val); + * $ret_2 = $obj->snap(); + * $ret_3 = $obj->get($index, $snap_id); + */","class SnapshotArray { + constructor(length: number) { + + } + + set(index: number, val: number): void { + + } + + snap(): number { + + } + + get(index: number, snap_id: number): number { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * var obj = new SnapshotArray(length) + * obj.set(index,val) + * var param_2 = obj.snap() + * var param_3 = obj.get(index,snap_id) + */","(define snapshot-array% + (class object% + (super-new) + + ; length : exact-integer? + (init-field + length) + + ; set : exact-integer? exact-integer? -> void? + (define/public (set index val) + + ) + ; snap : -> exact-integer? + (define/public (snap) + + ) + ; get : exact-integer? exact-integer? -> exact-integer? + (define/public (get index snap_id) + + ))) + +;; Your snapshot-array% object will be instantiated and called as such: +;; (define obj (new snapshot-array% [length length])) +;; (send obj set index val) +;; (define param_2 (send obj snap)) +;; (define param_3 (send obj get index snap_id))","-spec snapshot_array_init_(Length :: integer()) -> any(). +snapshot_array_init_(Length) -> + . + +-spec snapshot_array_set(Index :: integer(), Val :: integer()) -> any(). +snapshot_array_set(Index, Val) -> + . + +-spec snapshot_array_snap() -> integer(). +snapshot_array_snap() -> + . + +-spec snapshot_array_get(Index :: integer(), Snap_id :: integer()) -> integer(). +snapshot_array_get(Index, Snap_id) -> + . + + +%% Your functions will be called as such: +%% snapshot_array_init_(Length), +%% snapshot_array_set(Index, Val), +%% Param_2 = snapshot_array_snap(), +%% Param_3 = snapshot_array_get(Index, Snap_id), + +%% snapshot_array_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule SnapshotArray do + @spec init_(length :: integer) :: any + def init_(length) do + + end + + @spec set(index :: integer, val :: integer) :: any + def set(index, val) do + + end + + @spec snap() :: integer + def snap() do + + end + + @spec get(index :: integer, snap_id :: integer) :: integer + def get(index, snap_id) do + + end +end + +# Your functions will be called as such: +# SnapshotArray.init_(length) +# SnapshotArray.set(index, val) +# param_2 = SnapshotArray.snap() +# param_3 = SnapshotArray.get(index, snap_id) + +# SnapshotArray.init_ will be called before every test case, in which you can do some necessary initializations.","class SnapshotArray { + + SnapshotArray(int length) { + + } + + void set(int index, int val) { + + } + + int snap() { + + } + + int get(int index, int snap_id) { + + } +} + +/** + * Your SnapshotArray object will be instantiated and called as such: + * SnapshotArray obj = SnapshotArray(length); + * obj.set(index,val); + * int param2 = obj.snap(); + * int param3 = obj.get(index,snap_id); + */", +1214,binary-tree-coloring-game,Binary Tree Coloring Game,1145.0,1248.0,"

Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and each node has a distinct value from 1 to n.

+ +

Initially, the first player names a value x with 1 <= x <= n, and the second player names a value y with 1 <= y <= n and y != x. The first player colors the node with value x red, and the second player colors the node with value y blue.

+ +

Then, the players take turns starting with the first player. In each turn, that player chooses a node of their color (red if player 1, blue if player 2) and colors an uncolored neighbor of the chosen node (either the left child, right child, or parent of the chosen node.)

+ +

If (and only if) a player cannot choose such a node in this way, they must pass their turn. If both players pass their turn, the game ends, and the winner is the player that colored more nodes.

+ +

You are the second player. If it is possible to choose such a y to ensure you win the game, return true. If it is not possible, return false.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,4,5,6,7,8,9,10,11], n = 11, x = 3
+Output: true
+Explanation: The second player can choose the node with value 2.
+
+ +

Example 2:

+ +
+Input: root = [1,2,3], n = 3, x = 1
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
    • +
  • 1 <= x <= n <= 100
    • +
  • n is odd.
    • +
  • 1 <= Node.val <= n
    • +
  • All the values of the tree are unique.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool btreeGameWinningMove(TreeNode* root, int n, int x) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean btreeGameWinningMove(TreeNode root, int n, int x) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def btreeGameWinningMove(self, root, n, x): + """""" + :type root: TreeNode + :type n: int + :type x: int + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def btreeGameWinningMove(self, root: Optional[TreeNode], n: int, x: int) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool btreeGameWinningMove(struct TreeNode* root, int n, int x){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool BtreeGameWinningMove(TreeNode root, int n, int x) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} n + * @param {number} x + * @return {boolean} + */ +var btreeGameWinningMove = function(root, n, x) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} n +# @param {Integer} x +# @return {Boolean} +def btree_game_winning_move(root, n, x) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func btreeGameWinningMove(_ root: TreeNode?, _ n: Int, _ x: Int) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func btreeGameWinningMove(root *TreeNode, n int, x int) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def btreeGameWinningMove(root: TreeNode, n: Int, x: Int): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun btreeGameWinningMove(root: TreeNode?, n: Int, x: Int): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn btree_game_winning_move(root: Option>>, n: i32, x: i32) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $n + * @param Integer $x + * @return Boolean + */ + function btreeGameWinningMove($root, $n, $x) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function btreeGameWinningMove(root: TreeNode | null, n: number, x: number): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (btree-game-winning-move root n x) + (-> (or/c tree-node? #f) exact-integer? exact-integer? boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec btree_game_winning_move(Root :: #tree_node{} | null, N :: integer(), X :: integer()) -> boolean(). +btree_game_winning_move(Root, N, X) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec btree_game_winning_move(root :: TreeNode.t | nil, n :: integer, x :: integer) :: boolean + def btree_game_winning_move(root, n, x) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool btreeGameWinningMove(TreeNode? root, int n, int x) { + + } +}", +1216,distinct-echo-substrings,Distinct Echo Substrings,1316.0,1244.0,"

Return the number of distinct non-empty substrings of text that can be written as the concatenation of some string with itself (i.e. it can be written as a + a where a is some string).

+ +

 

+

Example 1:

+ +
+Input: text = "abcabcabc"
+Output: 3
+Explanation: The 3 substrings are "abcabc", "bcabca" and "cabcab".
+
+ +

Example 2:

+ +
+Input: text = "leetcodeleetcode"
+Output: 2
+Explanation: The 2 substrings are "ee" and "leetcodeleetcode".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= text.length <= 2000
    • +
  • text has only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int distinctEchoSubstrings(string text) { + + } +};","class Solution { + public int distinctEchoSubstrings(String text) { + + } +}","class Solution(object): + def distinctEchoSubstrings(self, text): + """""" + :type text: str + :rtype: int + """""" + ","class Solution: + def distinctEchoSubstrings(self, text: str) -> int: + ","int distinctEchoSubstrings(char * text){ + +}","public class Solution { + public int DistinctEchoSubstrings(string text) { + + } +}","/** + * @param {string} text + * @return {number} + */ +var distinctEchoSubstrings = function(text) { + +};","# @param {String} text +# @return {Integer} +def distinct_echo_substrings(text) + +end","class Solution { + func distinctEchoSubstrings(_ text: String) -> Int { + + } +}","func distinctEchoSubstrings(text string) int { + +}","object Solution { + def distinctEchoSubstrings(text: String): Int = { + + } +}","class Solution { + fun distinctEchoSubstrings(text: String): Int { + + } +}","impl Solution { + pub fn distinct_echo_substrings(text: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $text + * @return Integer + */ + function distinctEchoSubstrings($text) { + + } +}","function distinctEchoSubstrings(text: string): number { + +};","(define/contract (distinct-echo-substrings text) + (-> string? exact-integer?) + + )","-spec distinct_echo_substrings(Text :: unicode:unicode_binary()) -> integer(). +distinct_echo_substrings(Text) -> + .","defmodule Solution do + @spec distinct_echo_substrings(text :: String.t) :: integer + def distinct_echo_substrings(text) do + + end +end","class Solution { + int distinctEchoSubstrings(String text) { + + } +}", +1221,largest-1-bordered-square,Largest 1-Bordered Square,1139.0,1239.0,"

Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in the grid.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
+Output: 9
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,0,0]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= grid.length <= 100
    • +
  • 1 <= grid[0].length <= 100
    • +
  • grid[i][j] is 0 or 1
    • +
",2.0,False,"class Solution { +public: + int largest1BorderedSquare(vector>& grid) { + + } +};","class Solution { + public int largest1BorderedSquare(int[][] grid) { + + } +}","class Solution(object): + def largest1BorderedSquare(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def largest1BorderedSquare(self, grid: List[List[int]]) -> int: + "," + +int largest1BorderedSquare(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int Largest1BorderedSquare(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var largest1BorderedSquare = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def largest1_bordered_square(grid) + +end","class Solution { + func largest1BorderedSquare(_ grid: [[Int]]) -> Int { + + } +}","func largest1BorderedSquare(grid [][]int) int { + +}","object Solution { + def largest1BorderedSquare(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun largest1BorderedSquare(grid: Array): Int { + + } +}","impl Solution { + pub fn largest1_bordered_square(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function largest1BorderedSquare($grid) { + + } +}","function largest1BorderedSquare(grid: number[][]): number { + +};",,,,, +1222,alphabet-board-path,Alphabet Board Path,1138.0,1238.0,"

On an alphabet board, we start at position (0, 0), corresponding to character board[0][0].

+ +

Here, board = ["abcde", "fghij", "klmno", "pqrst", "uvwxy", "z"], as shown in the diagram below.

+ +

+ +

We may make the following moves:

+ +
    +
  • 'U' moves our position up one row, if the position exists on the board;
    • +
  • 'D' moves our position down one row, if the position exists on the board;
    • +
  • 'L' moves our position left one column, if the position exists on the board;
    • +
  • 'R' moves our position right one column, if the position exists on the board;
    • +
  • '!' adds the character board[r][c] at our current position (r, c) to the answer.
    • +
+ +

(Here, the only positions that exist on the board are positions with letters on them.)

+ +

Return a sequence of moves that makes our answer equal to target in the minimum number of moves.  You may return any path that does so.

+ +

 

+

Example 1:

+
Input: target = ""leet""
+Output: ""DDR!UURRR!!DDD!""
+

Example 2:

+
Input: target = ""code""
+Output: ""RR!DDRR!UUL!R!""
+
+

 

+

Constraints:

+ +
    +
  • 1 <= target.length <= 100
    • +
  • target consists only of English lowercase letters.
    • +
",2.0,False,"class Solution { +public: + string alphabetBoardPath(string target) { + + } +};","class Solution { + public String alphabetBoardPath(String target) { + + } +}","class Solution(object): + def alphabetBoardPath(self, target): + """""" + :type target: str + :rtype: str + """""" + ","class Solution: + def alphabetBoardPath(self, target: str) -> str: + "," + +char * alphabetBoardPath(char * target){ + +}","public class Solution { + public string AlphabetBoardPath(string target) { + + } +}","/** + * @param {string} target + * @return {string} + */ +var alphabetBoardPath = function(target) { + +};","# @param {String} target +# @return {String} +def alphabet_board_path(target) + +end","class Solution { + func alphabetBoardPath(_ target: String) -> String { + + } +}","func alphabetBoardPath(target string) string { + +}","object Solution { + def alphabetBoardPath(target: String): String = { + + } +}","class Solution { + fun alphabetBoardPath(target: String): String { + + } +}","impl Solution { + pub fn alphabet_board_path(target: String) -> String { + + } +}","class Solution { + + /** + * @param String $target + * @return String + */ + function alphabetBoardPath($target) { + + } +}","function alphabetBoardPath(target: string): string { + +};",,,,, +1224,number-of-paths-with-max-score,Number of Paths with Max Score,1301.0,1234.0,"

You are given a square board of characters. You can move on the board starting at the bottom right square marked with the character 'S'.

+ +

You need to reach the top left square marked with the character 'E'. The rest of the squares are labeled either with a numeric character 1, 2, ..., 9 or with an obstacle 'X'. In one move you can go up, left or up-left (diagonally) only if there is no obstacle there.

+ +

Return a list of two integers: the first integer is the maximum sum of numeric characters you can collect, and the second is the number of such paths that you can take to get that maximum sum, taken modulo 10^9 + 7.

+ +

In case there is no path, return [0, 0].

+ +

 

+

Example 1:

+
Input: board = [""E23"",""2X2"",""12S""]
+Output: [7,1]
+

Example 2:

+
Input: board = [""E12"",""1X1"",""21S""]
+Output: [4,2]
+

Example 3:

+
Input: board = [""E11"",""XXX"",""11S""]
+Output: [0,0]
+
+

 

+

Constraints:

+ +
    +
  • 2 <= board.length == board[i].length <= 100
    • +
",3.0,False,"class Solution { +public: + vector pathsWithMaxScore(vector& board) { + + } +};","class Solution { + public int[] pathsWithMaxScore(List board) { + + } +}","class Solution(object): + def pathsWithMaxScore(self, board): + """""" + :type board: List[str] + :rtype: List[int] + """""" + ","class Solution: + def pathsWithMaxScore(self, board: List[str]) -> List[int]: + "," + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* pathsWithMaxScore(char ** board, int boardSize, int* returnSize){ + +}","public class Solution { + public int[] PathsWithMaxScore(IList board) { + + } +}","/** + * @param {string[]} board + * @return {number[]} + */ +var pathsWithMaxScore = function(board) { + +};","# @param {String[]} board +# @return {Integer[]} +def paths_with_max_score(board) + +end","class Solution { + func pathsWithMaxScore(_ board: [String]) -> [Int] { + + } +}","func pathsWithMaxScore(board []string) []int { + +}","object Solution { + def pathsWithMaxScore(board: List[String]): Array[Int] = { + + } +}","class Solution { + fun pathsWithMaxScore(board: List): IntArray { + + } +}","impl Solution { + pub fn paths_with_max_score(board: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $board + * @return Integer[] + */ + function pathsWithMaxScore($board) { + + } +}","function pathsWithMaxScore(board: string[]): number[] { + +};",,,,, +1228,shortest-path-with-alternating-colors,Shortest Path with Alternating Colors,1129.0,1229.0,"

You are given an integer n, the number of nodes in a directed graph where the nodes are labeled from 0 to n - 1. Each edge is red or blue in this graph, and there could be self-edges and parallel edges.

+ +

You are given two arrays redEdges and blueEdges where:

+ +
    +
  • redEdges[i] = [ai, bi] indicates that there is a directed red edge from node ai to node bi in the graph, and
    • +
  • blueEdges[j] = [uj, vj] indicates that there is a directed blue edge from node uj to node vj in the graph.
    • +
+ +

Return an array answer of length n, where each answer[x] is the length of the shortest path from node 0 to node x such that the edge colors alternate along the path, or -1 if such a path does not exist.

+ +

 

+

Example 1:

+ +
+Input: n = 3, redEdges = [[0,1],[1,2]], blueEdges = []
+Output: [0,1,-1]
+
+ +

Example 2:

+ +
+Input: n = 3, redEdges = [[0,1]], blueEdges = [[2,1]]
+Output: [0,1,-1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 0 <= redEdges.length, blueEdges.length <= 400
    • +
  • redEdges[i].length == blueEdges[j].length == 2
    • +
  • 0 <= ai, bi, uj, vj < n
    • +
+",2.0,False,"class Solution { +public: + vector shortestAlternatingPaths(int n, vector>& redEdges, vector>& blueEdges) { + + } +};","class Solution { + public int[] shortestAlternatingPaths(int n, int[][] redEdges, int[][] blueEdges) { + + } +}","class Solution(object): + def shortestAlternatingPaths(self, n, redEdges, blueEdges): + """""" + :type n: int + :type redEdges: List[List[int]] + :type blueEdges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def shortestAlternatingPaths(self, n: int, redEdges: List[List[int]], blueEdges: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* shortestAlternatingPaths(int n, int** redEdges, int redEdgesSize, int* redEdgesColSize, int** blueEdges, int blueEdgesSize, int* blueEdgesColSize, int* returnSize){ + +}","public class Solution { + public int[] ShortestAlternatingPaths(int n, int[][] redEdges, int[][] blueEdges) { + + } +}","/** + * @param {number} n + * @param {number[][]} redEdges + * @param {number[][]} blueEdges + * @return {number[]} + */ +var shortestAlternatingPaths = function(n, redEdges, blueEdges) { + +};","# @param {Integer} n +# @param {Integer[][]} red_edges +# @param {Integer[][]} blue_edges +# @return {Integer[]} +def shortest_alternating_paths(n, red_edges, blue_edges) + +end","class Solution { + func shortestAlternatingPaths(_ n: Int, _ redEdges: [[Int]], _ blueEdges: [[Int]]) -> [Int] { + + } +}","func shortestAlternatingPaths(n int, redEdges [][]int, blueEdges [][]int) []int { + +}","object Solution { + def shortestAlternatingPaths(n: Int, redEdges: Array[Array[Int]], blueEdges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun shortestAlternatingPaths(n: Int, redEdges: Array, blueEdges: Array): IntArray { + + } +}","impl Solution { + pub fn shortest_alternating_paths(n: i32, red_edges: Vec>, blue_edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $redEdges + * @param Integer[][] $blueEdges + * @return Integer[] + */ + function shortestAlternatingPaths($n, $redEdges, $blueEdges) { + + } +}","function shortestAlternatingPaths(n: number, redEdges: number[][], blueEdges: number[][]): number[] { + +};","(define/contract (shortest-alternating-paths n redEdges blueEdges) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec shortest_alternating_paths(N :: integer(), RedEdges :: [[integer()]], BlueEdges :: [[integer()]]) -> [integer()]. +shortest_alternating_paths(N, RedEdges, BlueEdges) -> + .","defmodule Solution do + @spec shortest_alternating_paths(n :: integer, red_edges :: [[integer]], blue_edges :: [[integer]]) :: [integer] + def shortest_alternating_paths(n, red_edges, blue_edges) do + + end +end","class Solution { + List shortestAlternatingPaths(int n, List> redEdges, List> blueEdges) { + + } +}", +1230,number-of-equivalent-domino-pairs,Number of Equivalent Domino Pairs,1128.0,1227.0,"

Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a == c and b == d), or (a == d and b == c) - that is, one domino can be rotated to be equal to another domino.

+ +

Return the number of pairs (i, j) for which 0 <= i < j < dominoes.length, and dominoes[i] is equivalent to dominoes[j].

+ +

 

+

Example 1:

+ +
+Input: dominoes = [[1,2],[2,1],[3,4],[5,6]]
+Output: 1
+
+ +

Example 2:

+ +
+Input: dominoes = [[1,2],[1,2],[1,1],[1,2],[2,2]]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= dominoes.length <= 4 * 104
    • +
  • dominoes[i].length == 2
    • +
  • 1 <= dominoes[i][j] <= 9
    • +
+",1.0,False,"class Solution { +public: + int numEquivDominoPairs(vector>& dominoes) { + + } +};","class Solution { + public int numEquivDominoPairs(int[][] dominoes) { + + } +}","class Solution(object): + def numEquivDominoPairs(self, dominoes): + """""" + :type dominoes: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numEquivDominoPairs(self, dominoes: List[List[int]]) -> int: + ","int numEquivDominoPairs(int** dominoes, int dominoesSize, int* dominoesColSize){ + +}","public class Solution { + public int NumEquivDominoPairs(int[][] dominoes) { + + } +}","/** + * @param {number[][]} dominoes + * @return {number} + */ +var numEquivDominoPairs = function(dominoes) { + +};","# @param {Integer[][]} dominoes +# @return {Integer} +def num_equiv_domino_pairs(dominoes) + +end","class Solution { + func numEquivDominoPairs(_ dominoes: [[Int]]) -> Int { + + } +}","func numEquivDominoPairs(dominoes [][]int) int { + +}","object Solution { + def numEquivDominoPairs(dominoes: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numEquivDominoPairs(dominoes: Array): Int { + + } +}","impl Solution { + pub fn num_equiv_domino_pairs(dominoes: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $dominoes + * @return Integer + */ + function numEquivDominoPairs($dominoes) { + + } +}","function numEquivDominoPairs(dominoes: number[][]): number { + +};",,"-spec num_equiv_domino_pairs(Dominoes :: [[integer()]]) -> integer(). +num_equiv_domino_pairs(Dominoes) -> + .","defmodule Solution do + @spec num_equiv_domino_pairs(dominoes :: [[integer]]) :: integer + def num_equiv_domino_pairs(dominoes) do + + end +end","class Solution { + int numEquivDominoPairs(List> dominoes) { + + } +}", +1231,minimum-falling-path-sum-ii,Minimum Falling Path Sum II,1289.0,1224.0,"

Given an n x n integer matrix grid, return the minimum sum of a falling path with non-zero shifts.

+ +

A falling path with non-zero shifts is a choice of exactly one element from each row of grid such that no two elements chosen in adjacent rows are in the same column.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,2,3],[4,5,6],[7,8,9]]
+Output: 13
+Explanation: 
+The possible falling paths are:
+[1,5,9], [1,5,7], [1,6,7], [1,6,8],
+[2,4,8], [2,4,9], [2,6,7], [2,6,8],
+[3,4,8], [3,4,9], [3,5,7], [3,5,9]
+The falling path with the smallest sum is [1,5,7], so the answer is 13.
+
+ +

Example 2:

+ +
+Input: grid = [[7]]
+Output: 7
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
    • +
  • 1 <= n <= 200
    • +
  • -99 <= grid[i][j] <= 99
    • +
+",3.0,False,"class Solution { +public: + int minFallingPathSum(vector>& grid) { + + } +};","class Solution { + public int minFallingPathSum(int[][] grid) { + + } +}","class Solution(object): + def minFallingPathSum(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minFallingPathSum(self, grid: List[List[int]]) -> int: + ","int minFallingPathSum(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MinFallingPathSum(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var minFallingPathSum = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def min_falling_path_sum(grid) + +end","class Solution { + func minFallingPathSum(_ grid: [[Int]]) -> Int { + + } +}","func minFallingPathSum(grid [][]int) int { + +}","object Solution { + def minFallingPathSum(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minFallingPathSum(grid: Array): Int { + + } +}","impl Solution { + pub fn min_falling_path_sum(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function minFallingPathSum($grid) { + + } +}","function minFallingPathSum(grid: number[][]): number { + +};","(define/contract (min-falling-path-sum grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_falling_path_sum(Grid :: [[integer()]]) -> integer(). +min_falling_path_sum(Grid) -> + .","defmodule Solution do + @spec min_falling_path_sum(grid :: [[integer]]) :: integer + def min_falling_path_sum(grid) do + + end +end","class Solution { + int minFallingPathSum(List> grid) { + + } +}", +1232,graph-connectivity-with-threshold,Graph Connectivity With Threshold,1627.0,1223.0,"

We have n cities labeled from 1 to n. Two different cities with labels x and y are directly connected by a bidirectional road if and only if x and y share a common divisor strictly greater than some threshold. More formally, cities with labels x and y have a road between them if there exists an integer z such that all of the following are true:

+ +
    +
  • x % z == 0,
    • +
  • y % z == 0, and
    • +
  • z > threshold.
    • +
+ +

Given the two integers, n and threshold, and an array of queries, you must determine for each queries[i] = [ai, bi] if cities ai and bi are connected directly or indirectly. (i.e. there is some path between them).

+ +

Return an array answer, where answer.length == queries.length and answer[i] is true if for the ith query, there is a path between ai and bi, or answer[i] is false if there is no path.

+ +

 

+

Example 1:

+ +
+Input: n = 6, threshold = 2, queries = [[1,4],[2,5],[3,6]]
+Output: [false,false,true]
+Explanation: The divisors for each number:
+1:   1
+2:   1, 2
+3:   1, 3
+4:   1, 2, 4
+5:   1, 5
+6:   1, 2, 3, 6
+Using the underlined divisors above the threshold, only cities 3 and 6 share a common divisor, so they are the
+only ones directly connected. The result of each query:
+[1,4]   1 is not connected to 4
+[2,5]   2 is not connected to 5
+[3,6]   3 is connected to 6 through path 3--6
+
+ +

Example 2:

+ +
+Input: n = 6, threshold = 0, queries = [[4,5],[3,4],[3,2],[2,6],[1,3]]
+Output: [true,true,true,true,true]
+Explanation: The divisors for each number are the same as the previous example. However, since the threshold is 0,
+all divisors can be used. Since all numbers share 1 as a divisor, all cities are connected.
+
+ +

Example 3:

+ +
+Input: n = 5, threshold = 1, queries = [[4,5],[4,5],[3,2],[2,3],[3,4]]
+Output: [false,false,false,false,false]
+Explanation: Only cities 2 and 4 share a common divisor 2 which is strictly greater than the threshold 1, so they are the only ones directly connected.
+Please notice that there can be multiple queries for the same pair of nodes [x, y], and that the query [x, y] is equivalent to the query [y, x].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 104
    • +
  • 0 <= threshold <= n
    • +
  • 1 <= queries.length <= 105
    • +
  • queries[i].length == 2
    • +
  • 1 <= ai, bi <= cities
    • +
  • ai != bi
    • +
+",3.0,False,"class Solution { +public: + vector areConnected(int n, int threshold, vector>& queries) { + + } +};","class Solution { + public List areConnected(int n, int threshold, int[][] queries) { + + } +}","class Solution(object): + def areConnected(self, n, threshold, queries): + """""" + :type n: int + :type threshold: int + :type queries: List[List[int]] + :rtype: List[bool] + """""" + ","class Solution: + def areConnected(self, n: int, threshold: int, queries: List[List[int]]) -> List[bool]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +bool* areConnected(int n, int threshold, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public IList AreConnected(int n, int threshold, int[][] queries) { + + } +}","/** + * @param {number} n + * @param {number} threshold + * @param {number[][]} queries + * @return {boolean[]} + */ +var areConnected = function(n, threshold, queries) { + +};","# @param {Integer} n +# @param {Integer} threshold +# @param {Integer[][]} queries +# @return {Boolean[]} +def are_connected(n, threshold, queries) + +end","class Solution { + func areConnected(_ n: Int, _ threshold: Int, _ queries: [[Int]]) -> [Bool] { + + } +}","func areConnected(n int, threshold int, queries [][]int) []bool { + +}","object Solution { + def areConnected(n: Int, threshold: Int, queries: Array[Array[Int]]): List[Boolean] = { + + } +}","class Solution { + fun areConnected(n: Int, threshold: Int, queries: Array): List { + + } +}","impl Solution { + pub fn are_connected(n: i32, threshold: i32, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $threshold + * @param Integer[][] $queries + * @return Boolean[] + */ + function areConnected($n, $threshold, $queries) { + + } +}","function areConnected(n: number, threshold: number, queries: number[][]): boolean[] { + +};","(define/contract (are-connected n threshold queries) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) (listof boolean?)) + + )","-spec are_connected(N :: integer(), Threshold :: integer(), Queries :: [[integer()]]) -> [boolean()]. +are_connected(N, Threshold, Queries) -> + .","defmodule Solution do + @spec are_connected(n :: integer, threshold :: integer, queries :: [[integer]]) :: [boolean] + def are_connected(n, threshold, queries) do + + end +end","class Solution { + List areConnected(int n, int threshold, List> queries) { + + } +}", +1235,smallest-sufficient-team,Smallest Sufficient Team,1125.0,1220.0,"

In a project, you have a list of required skills req_skills, and a list of people. The ith person people[i] contains a list of skills that the person has.

+ +

Consider a sufficient team: a set of people such that for every required skill in req_skills, there is at least one person in the team who has that skill. We can represent these teams by the index of each person.

+ +
    +
  • For example, team = [0, 1, 3] represents the people with skills people[0], people[1], and people[3].
    • +
+ +

Return any sufficient team of the smallest possible size, represented by the index of each person. You may return the answer in any order.

+ +

It is guaranteed an answer exists.

+ +

 

+

Example 1:

+
Input: req_skills = [""java"",""nodejs"",""reactjs""], people = [[""java""],[""nodejs""],[""nodejs"",""reactjs""]]
+Output: [0,2]
+

Example 2:

+
Input: req_skills = [""algorithms"",""math"",""java"",""reactjs"",""csharp"",""aws""], people = [[""algorithms"",""math"",""java""],[""algorithms"",""math"",""reactjs""],[""java"",""csharp"",""aws""],[""reactjs"",""csharp""],[""csharp"",""math""],[""aws"",""java""]]
+Output: [1,2]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= req_skills.length <= 16
    • +
  • 1 <= req_skills[i].length <= 16
    • +
  • req_skills[i] consists of lowercase English letters.
    • +
  • All the strings of req_skills are unique.
    • +
  • 1 <= people.length <= 60
    • +
  • 0 <= people[i].length <= 16
    • +
  • 1 <= people[i][j].length <= 16
    • +
  • people[i][j] consists of lowercase English letters.
    • +
  • All the strings of people[i] are unique.
    • +
  • Every skill in people[i] is a skill in req_skills.
    • +
  • It is guaranteed a sufficient team exists.
    • +
+",3.0,False,"class Solution { +public: + vector smallestSufficientTeam(vector& req_skills, vector>& people) { + + } +};","class Solution { + public int[] smallestSufficientTeam(String[] req_skills, List> people) { + + } +}","class Solution(object): + def smallestSufficientTeam(self, req_skills, people): + """""" + :type req_skills: List[str] + :type people: List[List[str]] + :rtype: List[int] + """""" + ","class Solution: + def smallestSufficientTeam(self, req_skills: List[str], people: List[List[str]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* smallestSufficientTeam(char ** req_skills, int req_skillsSize, char *** people, int peopleSize, int* peopleColSize, int* returnSize){ + +}","public class Solution { + public int[] SmallestSufficientTeam(string[] req_skills, IList> people) { + + } +}","/** + * @param {string[]} req_skills + * @param {string[][]} people + * @return {number[]} + */ +var smallestSufficientTeam = function(req_skills, people) { + +};","# @param {String[]} req_skills +# @param {String[][]} people +# @return {Integer[]} +def smallest_sufficient_team(req_skills, people) + +end","class Solution { + func smallestSufficientTeam(_ req_skills: [String], _ people: [[String]]) -> [Int] { + + } +}","func smallestSufficientTeam(req_skills []string, people [][]string) []int { + +}","object Solution { + def smallestSufficientTeam(req_skills: Array[String], people: List[List[String]]): Array[Int] = { + + } +}","class Solution { + fun smallestSufficientTeam(req_skills: Array, people: List>): IntArray { + + } +}","impl Solution { + pub fn smallest_sufficient_team(req_skills: Vec, people: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $req_skills + * @param String[][] $people + * @return Integer[] + */ + function smallestSufficientTeam($req_skills, $people) { + + } +}","function smallestSufficientTeam(req_skills: string[], people: string[][]): number[] { + +};","(define/contract (smallest-sufficient-team req_skills people) + (-> (listof string?) (listof (listof string?)) (listof exact-integer?)) + + )","-spec smallest_sufficient_team(Req_skills :: [unicode:unicode_binary()], People :: [[unicode:unicode_binary()]]) -> [integer()]. +smallest_sufficient_team(Req_skills, People) -> + .","defmodule Solution do + @spec smallest_sufficient_team(req_skills :: [String.t], people :: [[String.t]]) :: [integer] + def smallest_sufficient_team(req_skills, people) do + + end +end","class Solution { + List smallestSufficientTeam(List req_skills, List> people) { + + } +}", +1236,longest-well-performing-interval,Longest Well-Performing Interval,1124.0,1219.0,"

We are given hours, a list of the number of hours worked per day for a given employee.

+ +

A day is considered to be a tiring day if and only if the number of hours worked is (strictly) greater than 8.

+ +

A well-performing interval is an interval of days for which the number of tiring days is strictly larger than the number of non-tiring days.

+ +

Return the length of the longest well-performing interval.

+ +

 

+

Example 1:

+ +
+Input: hours = [9,9,6,0,6,6,9]
+Output: 3
+Explanation: The longest well-performing interval is [9,9,6].
+
+ +

Example 2:

+ +
+Input: hours = [6,6,6]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= hours.length <= 104
    • +
  • 0 <= hours[i] <= 16
    • +
+",2.0,False,"class Solution { +public: + int longestWPI(vector& hours) { + + } +};","class Solution { + public int longestWPI(int[] hours) { + + } +}","class Solution(object): + def longestWPI(self, hours): + """""" + :type hours: List[int] + :rtype: int + """""" + ","class Solution: + def longestWPI(self, hours: List[int]) -> int: + ","int longestWPI(int* hours, int hoursSize){ + +}","public class Solution { + public int LongestWPI(int[] hours) { + + } +}","/** + * @param {number[]} hours + * @return {number} + */ +var longestWPI = function(hours) { + +};","# @param {Integer[]} hours +# @return {Integer} +def longest_wpi(hours) + +end","class Solution { + func longestWPI(_ hours: [Int]) -> Int { + + } +}","func longestWPI(hours []int) int { + +}","object Solution { + def longestWPI(hours: Array[Int]): Int = { + + } +}","class Solution { + fun longestWPI(hours: IntArray): Int { + + } +}","impl Solution { + pub fn longest_wpi(hours: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $hours + * @return Integer + */ + function longestWPI($hours) { + + } +}","function longestWPI(hours: number[]): number { + +};","(define/contract (longest-wpi hours) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_wpi(Hours :: [integer()]) -> integer(). +longest_wpi(Hours) -> + .","defmodule Solution do + @spec longest_wpi(hours :: [integer]) :: integer + def longest_wpi(hours) do + + end +end","class Solution { + int longestWPI(List hours) { + + } +}", +1237,lowest-common-ancestor-of-deepest-leaves,Lowest Common Ancestor of Deepest Leaves,1123.0,1218.0,"

Given the root of a binary tree, return the lowest common ancestor of its deepest leaves.

+ +

Recall that:

+ +
    +
  • The node of a binary tree is a leaf if and only if it has no children
    • +
  • The depth of the root of the tree is 0. if the depth of a node is d, the depth of each of its children is d + 1.
    • +
  • The lowest common ancestor of a set S of nodes, is the node A with the largest depth such that every node in S is in the subtree with root A.
    • +
+ +

 

+

Example 1:

+ +
+Input: root = [3,5,1,6,2,0,8,null,null,7,4]
+Output: [2,7,4]
+Explanation: We return the node with value 2, colored in yellow in the diagram.
+The nodes coloured in blue are the deepest leaf-nodes of the tree.
+Note that nodes 6, 0, and 8 are also leaf nodes, but the depth of them is 2, but the depth of nodes 7 and 4 is 3.
+ +

Example 2:

+ +
+Input: root = [1]
+Output: [1]
+Explanation: The root is the deepest node in the tree, and it's the lca of itself.
+
+ +

Example 3:

+ +
+Input: root = [0,1,3,null,2]
+Output: [2]
+Explanation: The deepest leaf node in the tree is 2, the lca of one node is itself.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree will be in the range [1, 1000].
    • +
  • 0 <= Node.val <= 1000
    • +
  • The values of the nodes in the tree are unique.
    • +
+ +

 

+

Note: This question is the same as 865: https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/

+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* lcaDeepestLeaves(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode lcaDeepestLeaves(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def lcaDeepestLeaves(self, root): + """""" + :type root: TreeNode + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def lcaDeepestLeaves(self, root: Optional[TreeNode]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* lcaDeepestLeaves(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode LcaDeepestLeaves(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {TreeNode} + */ +var lcaDeepestLeaves = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {TreeNode} +def lca_deepest_leaves(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func lcaDeepestLeaves(_ root: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func lcaDeepestLeaves(root *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def lcaDeepestLeaves(root: TreeNode): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun lcaDeepestLeaves(root: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn lca_deepest_leaves(root: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return TreeNode + */ + function lcaDeepestLeaves($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function lcaDeepestLeaves(root: TreeNode | null): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (lca-deepest-leaves root) + (-> (or/c tree-node? #f) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec lca_deepest_leaves(Root :: #tree_node{} | null) -> #tree_node{} | null. +lca_deepest_leaves(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec lca_deepest_leaves(root :: TreeNode.t | nil) :: TreeNode.t | nil + def lca_deepest_leaves(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? lcaDeepestLeaves(TreeNode? root) { + + } +}", +1241,mean-of-array-after-removing-some-elements,Mean of Array After Removing Some Elements,1619.0,1210.0,"

Given an integer array arr, return the mean of the remaining integers after removing the smallest 5% and the largest 5% of the elements.

+ +

Answers within 10-5 of the actual answer will be considered accepted.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3]
+Output: 2.00000
+Explanation: After erasing the minimum and the maximum values of this array, all elements are equal to 2, so the mean is 2.
+
+ +

Example 2:

+ +
+Input: arr = [6,2,7,5,1,2,0,3,10,2,5,0,5,5,0,8,7,6,8,0]
+Output: 4.00000
+
+ +

Example 3:

+ +
+Input: arr = [6,0,7,0,7,5,7,8,3,4,0,7,8,1,6,8,1,1,2,4,8,1,9,5,4,3,8,5,10,8,6,6,1,0,6,10,8,2,3,4]
+Output: 4.77778
+
+ +

 

+

Constraints:

+ +
    +
  • 20 <= arr.length <= 1000
    • +
  • arr.length is a multiple of 20.
    • +
  • 0 <= arr[i] <= 105
    • +
+",1.0,False,"class Solution { +public: + double trimMean(vector& arr) { + + } +};","class Solution { + public double trimMean(int[] arr) { + + } +}","class Solution(object): + def trimMean(self, arr): + """""" + :type arr: List[int] + :rtype: float + """""" + ","class Solution: + def trimMean(self, arr: List[int]) -> float: + ","double trimMean(int* arr, int arrSize){ + +}","public class Solution { + public double TrimMean(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var trimMean = function(arr) { + +};","# @param {Integer[]} arr +# @return {Float} +def trim_mean(arr) + +end","class Solution { + func trimMean(_ arr: [Int]) -> Double { + + } +}","func trimMean(arr []int) float64 { + +}","object Solution { + def trimMean(arr: Array[Int]): Double = { + + } +}","class Solution { + fun trimMean(arr: IntArray): Double { + + } +}","impl Solution { + pub fn trim_mean(arr: Vec) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Float + */ + function trimMean($arr) { + + } +}","function trimMean(arr: number[]): number { + +};","(define/contract (trim-mean arr) + (-> (listof exact-integer?) flonum?) + + )","-spec trim_mean(Arr :: [integer()]) -> float(). +trim_mean(Arr) -> + .","defmodule Solution do + @spec trim_mean(arr :: [integer]) :: float + def trim_mean(arr) do + + end +end","class Solution { + double trimMean(List arr) { + + } +}", +1242,maximum-nesting-depth-of-two-valid-parentheses-strings,Maximum Nesting Depth of Two Valid Parentheses Strings,1111.0,1208.0,"

A string is a valid parentheses string (denoted VPS) if and only if it consists of "(" and ")" characters only, and:

+ +
    +
  • It is the empty string, or
    • +
  • It can be written as AB (A concatenated with B), where A and B are VPS's, or
    • +
  • It can be written as (A), where A is a VPS.
    • +
+ +

We can similarly define the nesting depth depth(S) of any VPS S as follows:

+ +
    +
  • depth("") = 0
    • +
  • depth(A + B) = max(depth(A), depth(B)), where A and B are VPS's
    • +
  • depth("(" + A + ")") = 1 + depth(A), where A is a VPS.
    • +
+ +

For example,  "", "()()", and "()(()())" are VPS's (with nesting depths 0, 1, and 2), and ")(" and "(()" are not VPS's.

+ +

 

+ +

Given a VPS seq, split it into two disjoint subsequences A and B, such that A and B are VPS's (and A.length + B.length = seq.length).

+ +

Now choose any such A and B such that max(depth(A), depth(B)) is the minimum possible value.

+ +

Return an answer array (of length seq.length) that encodes such a choice of A and B:  answer[i] = 0 if seq[i] is part of A, else answer[i] = 1.  Note that even though multiple answers may exist, you may return any of them.

+ +

 

+

Example 1:

+ +
+Input: seq = "(()())"
+Output: [0,1,1,1,1,0]
+
+ +

Example 2:

+ +
+Input: seq = "()(())()"
+Output: [0,0,0,1,1,0,1,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= seq.size <= 10000
    • +
+",2.0,False,"class Solution { +public: + vector maxDepthAfterSplit(string seq) { + + } +};","class Solution { + public int[] maxDepthAfterSplit(String seq) { + + } +}","class Solution(object): + def maxDepthAfterSplit(self, seq): + """""" + :type seq: str + :rtype: List[int] + """""" + ","class Solution: + def maxDepthAfterSplit(self, seq: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxDepthAfterSplit(char * seq, int* returnSize){ + +}","public class Solution { + public int[] MaxDepthAfterSplit(string seq) { + + } +}","/** + * @param {string} seq + * @return {number[]} + */ +var maxDepthAfterSplit = function(seq) { + +};","# @param {String} seq +# @return {Integer[]} +def max_depth_after_split(seq) + +end","class Solution { + func maxDepthAfterSplit(_ seq: String) -> [Int] { + + } +}","func maxDepthAfterSplit(seq string) []int { + +}","object Solution { + def maxDepthAfterSplit(seq: String): Array[Int] = { + + } +}","class Solution { + fun maxDepthAfterSplit(seq: String): IntArray { + + } +}","impl Solution { + pub fn max_depth_after_split(seq: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $seq + * @return Integer[] + */ + function maxDepthAfterSplit($seq) { + + } +}","function maxDepthAfterSplit(seq: string): number[] { + +};","(define/contract (max-depth-after-split seq) + (-> string? (listof exact-integer?)) + + )","-spec max_depth_after_split(Seq :: unicode:unicode_binary()) -> [integer()]. +max_depth_after_split(Seq) -> + .","defmodule Solution do + @spec max_depth_after_split(seq :: String.t) :: [integer] + def max_depth_after_split(seq) do + + end +end","class Solution { + List maxDepthAfterSplit(String seq) { + + } +}", +1244,corporate-flight-bookings,Corporate Flight Bookings,1109.0,1206.0,"

There are n flights that are labeled from 1 to n.

+ +

You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved for each flight in the range.

+ +

Return an array answer of length n, where answer[i] is the total number of seats reserved for flight i.

+ +

 

+

Example 1:

+ +
+Input: bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
+Output: [10,55,45,25,25]
+Explanation:
+Flight labels:        1   2   3   4   5
+Booking 1 reserved:  10  10
+Booking 2 reserved:      20  20
+Booking 3 reserved:      25  25  25  25
+Total seats:         10  55  45  25  25
+Hence, answer = [10,55,45,25,25]
+
+ +

Example 2:

+ +
+Input: bookings = [[1,2,10],[2,2,15]], n = 2
+Output: [10,25]
+Explanation:
+Flight labels:        1   2
+Booking 1 reserved:  10  10
+Booking 2 reserved:      15
+Total seats:         10  25
+Hence, answer = [10,25]
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2 * 104
    • +
  • 1 <= bookings.length <= 2 * 104
    • +
  • bookings[i].length == 3
    • +
  • 1 <= firsti <= lasti <= n
    • +
  • 1 <= seatsi <= 104
    • +
+",2.0,False,"class Solution { +public: + vector corpFlightBookings(vector>& bookings, int n) { + + } +};","class Solution { + public int[] corpFlightBookings(int[][] bookings, int n) { + + } +}","class Solution(object): + def corpFlightBookings(self, bookings, n): + """""" + :type bookings: List[List[int]] + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def corpFlightBookings(self, bookings: List[List[int]], n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, int* returnSize){ + +}","public class Solution { + public int[] CorpFlightBookings(int[][] bookings, int n) { + + } +}","/** + * @param {number[][]} bookings + * @param {number} n + * @return {number[]} + */ +var corpFlightBookings = function(bookings, n) { + +};","# @param {Integer[][]} bookings +# @param {Integer} n +# @return {Integer[]} +def corp_flight_bookings(bookings, n) + +end","class Solution { + func corpFlightBookings(_ bookings: [[Int]], _ n: Int) -> [Int] { + + } +}","func corpFlightBookings(bookings [][]int, n int) []int { + +}","object Solution { + def corpFlightBookings(bookings: Array[Array[Int]], n: Int): Array[Int] = { + + } +}","class Solution { + fun corpFlightBookings(bookings: Array, n: Int): IntArray { + + } +}","impl Solution { + pub fn corp_flight_bookings(bookings: Vec>, n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $bookings + * @param Integer $n + * @return Integer[] + */ + function corpFlightBookings($bookings, $n) { + + } +}","function corpFlightBookings(bookings: number[][], n: number): number[] { + +};","(define/contract (corp-flight-bookings bookings n) + (-> (listof (listof exact-integer?)) exact-integer? (listof exact-integer?)) + + )","-spec corp_flight_bookings(Bookings :: [[integer()]], N :: integer()) -> [integer()]. +corp_flight_bookings(Bookings, N) -> + .","defmodule Solution do + @spec corp_flight_bookings(bookings :: [[integer]], n :: integer) :: [integer] + def corp_flight_bookings(bookings, n) do + + end +end","class Solution { + List corpFlightBookings(List> bookings, int n) { + + } +}", +1245,defanging-an-ip-address,Defanging an IP Address,1108.0,1205.0,"

Given a valid (IPv4) IP address, return a defanged version of that IP address.

+ +

A defanged IP address replaces every period "." with "[.]".

+ +

 

+

Example 1:

+
Input: address = ""1.1.1.1""
+Output: ""1[.]1[.]1[.]1""
+

Example 2:

+
Input: address = ""255.100.50.0""
+Output: ""255[.]100[.]50[.]0""
+
+

 

+

Constraints:

+ +
    +
  • The given address is a valid IPv4 address.
    • +
",1.0,False,"class Solution { +public: + string defangIPaddr(string address) { + + } +};","class Solution { + public String defangIPaddr(String address) { + + } +}","class Solution(object): + def defangIPaddr(self, address): + """""" + :type address: str + :rtype: str + """""" + ","class Solution: + def defangIPaddr(self, address: str) -> str: + "," + +char * defangIPaddr(char * address){ + +}","public class Solution { + public string DefangIPaddr(string address) { + + } +}","/** + * @param {string} address + * @return {string} + */ +var defangIPaddr = function(address) { + +};","# @param {String} address +# @return {String} +def defang_i_paddr(address) + +end","class Solution { + func defangIPaddr(_ address: String) -> String { + + } +}","func defangIPaddr(address string) string { + +}","object Solution { + def defangIPaddr(address: String): String = { + + } +}","class Solution { + fun defangIPaddr(address: String): String { + + } +}","impl Solution { + pub fn defang_i_paddr(address: String) -> String { + + } +}","class Solution { + + /** + * @param String $address + * @return String + */ + function defangIPaddr($address) { + + } +}","function defangIPaddr(address: string): string { + +};",,,,, +1246,parsing-a-boolean-expression,Parsing A Boolean Expression,1106.0,1197.0,"

A boolean expression is an expression that evaluates to either true or false. It can be in one of the following shapes:

+ +
    +
  • 't' that evaluates to true.
    • +
  • 'f' that evaluates to false.
    • +
  • '!(subExpr)' that evaluates to the logical NOT of the inner expression subExpr.
    • +
  • '&(subExpr1, subExpr2, ..., subExprn)' that evaluates to the logical AND of the inner expressions subExpr1, subExpr2, ..., subExprn where n >= 1.
    • +
  • '|(subExpr1, subExpr2, ..., subExprn)' that evaluates to the logical OR of the inner expressions subExpr1, subExpr2, ..., subExprn where n >= 1.
    • +
+ +

Given a string expression that represents a boolean expression, return the evaluation of that expression.

+ +

It is guaranteed that the given expression is valid and follows the given rules.

+ +

 

+

Example 1:

+ +
+Input: expression = "&(|(f))"
+Output: false
+Explanation: 
+First, evaluate |(f) --> f. The expression is now "&(f)".
+Then, evaluate &(f) --> f. The expression is now "f".
+Finally, return false.
+
+ +

Example 2:

+ +
+Input: expression = "|(f,f,f,t)"
+Output: true
+Explanation: The evaluation of (false OR false OR false OR true) is true.
+
+ +

Example 3:

+ +
+Input: expression = "!(&(f,t))"
+Output: true
+Explanation: 
+First, evaluate &(f,t) --> (false AND true) --> false --> f. The expression is now "!(f)".
+Then, evaluate !(f) --> NOT false --> true. We return true.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= expression.length <= 2 * 104
    • +
  • expression[i] is one following characters: '(', ')', '&', '|', '!', 't', 'f', and ','.
    • +
+",3.0,False,"class Solution { +public: + bool parseBoolExpr(string expression) { + + } +};","class Solution { + public boolean parseBoolExpr(String expression) { + + } +}","class Solution(object): + def parseBoolExpr(self, expression): + """""" + :type expression: str + :rtype: bool + """""" + ","class Solution: + def parseBoolExpr(self, expression: str) -> bool: + ","bool parseBoolExpr(char * expression){ + +}","public class Solution { + public bool ParseBoolExpr(string expression) { + + } +}","/** + * @param {string} expression + * @return {boolean} + */ +var parseBoolExpr = function(expression) { + +};","# @param {String} expression +# @return {Boolean} +def parse_bool_expr(expression) + +end","class Solution { + func parseBoolExpr(_ expression: String) -> Bool { + + } +}","func parseBoolExpr(expression string) bool { + +}","object Solution { + def parseBoolExpr(expression: String): Boolean = { + + } +}","class Solution { + fun parseBoolExpr(expression: String): Boolean { + + } +}","impl Solution { + pub fn parse_bool_expr(expression: String) -> bool { + + } +}","class Solution { + + /** + * @param String $expression + * @return Boolean + */ + function parseBoolExpr($expression) { + + } +}","function parseBoolExpr(expression: string): boolean { + +};","(define/contract (parse-bool-expr expression) + (-> string? boolean?) + + )","-spec parse_bool_expr(Expression :: unicode:unicode_binary()) -> boolean(). +parse_bool_expr(Expression) -> + .","defmodule Solution do + @spec parse_bool_expr(expression :: String.t) :: boolean + def parse_bool_expr(expression) do + + end +end","class Solution { + bool parseBoolExpr(String expression) { + + } +}", +1247,filling-bookcase-shelves,Filling Bookcase Shelves,1105.0,1196.0,"

You are given an array books where books[i] = [thicknessi, heighti] indicates the thickness and height of the ith book. You are also given an integer shelfWidth.

+ +

We want to place these books in order onto bookcase shelves that have a total width shelfWidth.

+ +

We choose some of the books to place on this shelf such that the sum of their thickness is less than or equal to shelfWidth, then build another level of the shelf of the bookcase so that the total height of the bookcase has increased by the maximum height of the books we just put down. We repeat this process until there are no more books to place.

+ +

Note that at each step of the above process, the order of the books we place is the same order as the given sequence of books.

+ +
    +
  • For example, if we have an ordered list of 5 books, we might place the first and second book onto the first shelf, the third book on the second shelf, and the fourth and fifth book on the last shelf.
    • +
+ +

Return the minimum possible height that the total bookshelf can be after placing shelves in this manner.

+ +

 

+

Example 1:

+ +
+Input: books = [[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]], shelfWidth = 4
+Output: 6
+Explanation:
+The sum of the heights of the 3 shelves is 1 + 3 + 2 = 6.
+Notice that book number 2 does not have to be on the first shelf.
+
+ +

Example 2:

+ +
+Input: books = [[1,3],[2,4],[3,2]], shelfWidth = 6
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= books.length <= 1000
    • +
  • 1 <= thicknessi <= shelfWidth <= 1000
    • +
  • 1 <= heighti <= 1000
    • +
+",2.0,False,"class Solution { +public: + int minHeightShelves(vector>& books, int shelfWidth) { + + } +};","class Solution { + public int minHeightShelves(int[][] books, int shelfWidth) { + + } +}","class Solution(object): + def minHeightShelves(self, books, shelfWidth): + """""" + :type books: List[List[int]] + :type shelfWidth: int + :rtype: int + """""" + ","class Solution: + def minHeightShelves(self, books: List[List[int]], shelfWidth: int) -> int: + ","int minHeightShelves(int** books, int booksSize, int* booksColSize, int shelfWidth){ + +}","public class Solution { + public int MinHeightShelves(int[][] books, int shelfWidth) { + + } +}","/** + * @param {number[][]} books + * @param {number} shelfWidth + * @return {number} + */ +var minHeightShelves = function(books, shelfWidth) { + +};","# @param {Integer[][]} books +# @param {Integer} shelf_width +# @return {Integer} +def min_height_shelves(books, shelf_width) + +end","class Solution { + func minHeightShelves(_ books: [[Int]], _ shelfWidth: Int) -> Int { + + } +}","func minHeightShelves(books [][]int, shelfWidth int) int { + +}","object Solution { + def minHeightShelves(books: Array[Array[Int]], shelfWidth: Int): Int = { + + } +}","class Solution { + fun minHeightShelves(books: Array, shelfWidth: Int): Int { + + } +}","impl Solution { + pub fn min_height_shelves(books: Vec>, shelf_width: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $books + * @param Integer $shelfWidth + * @return Integer + */ + function minHeightShelves($books, $shelfWidth) { + + } +}","function minHeightShelves(books: number[][], shelfWidth: number): number { + +};","(define/contract (min-height-shelves books shelfWidth) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec min_height_shelves(Books :: [[integer()]], ShelfWidth :: integer()) -> integer(). +min_height_shelves(Books, ShelfWidth) -> + .","defmodule Solution do + @spec min_height_shelves(books :: [[integer]], shelf_width :: integer) :: integer + def min_height_shelves(books, shelf_width) do + + end +end","class Solution { + int minHeightShelves(List> books, int shelfWidth) { + + } +}", +1248,distribute-candies-to-people,Distribute Candies to People,1103.0,1195.0,"

We distribute some number of candies, to a row of n = num_people people in the following way:

+ +

We then give 1 candy to the first person, 2 candies to the second person, and so on until we give n candies to the last person.

+ +

Then, we go back to the start of the row, giving n + 1 candies to the first person, n + 2 candies to the second person, and so on until we give 2 * n candies to the last person.

+ +

This process repeats (with us giving one more candy each time, and moving to the start of the row after we reach the end) until we run out of candies.  The last person will receive all of our remaining candies (not necessarily one more than the previous gift).

+ +

Return an array (of length num_people and sum candies) that represents the final distribution of candies.

+ +

 

+

Example 1:

+ +
+Input: candies = 7, num_people = 4
+Output: [1,2,3,1]
+Explanation:
+On the first turn, ans[0] += 1, and the array is [1,0,0,0].
+On the second turn, ans[1] += 2, and the array is [1,2,0,0].
+On the third turn, ans[2] += 3, and the array is [1,2,3,0].
+On the fourth turn, ans[3] += 1 (because there is only one candy left), and the final array is [1,2,3,1].
+
+ +

Example 2:

+ +
+Input: candies = 10, num_people = 3
+Output: [5,2,3]
+Explanation: 
+On the first turn, ans[0] += 1, and the array is [1,0,0].
+On the second turn, ans[1] += 2, and the array is [1,2,0].
+On the third turn, ans[2] += 3, and the array is [1,2,3].
+On the fourth turn, ans[0] += 4, and the final array is [5,2,3].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= candies <= 10^9
    • +
  • 1 <= num_people <= 1000
    • +
+",1.0,False,"class Solution { +public: + vector distributeCandies(int candies, int num_people) { + + } +};","class Solution { + public int[] distributeCandies(int candies, int num_people) { + + } +}","class Solution(object): + def distributeCandies(self, candies, num_people): + """""" + :type candies: int + :type num_people: int + :rtype: List[int] + """""" + ","class Solution: + def distributeCandies(self, candies: int, num_people: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* distributeCandies(int candies, int num_people, int* returnSize){ + +}","public class Solution { + public int[] DistributeCandies(int candies, int num_people) { + + } +}","/** + * @param {number} candies + * @param {number} num_people + * @return {number[]} + */ +var distributeCandies = function(candies, num_people) { + +};","# @param {Integer} candies +# @param {Integer} num_people +# @return {Integer[]} +def distribute_candies(candies, num_people) + +end","class Solution { + func distributeCandies(_ candies: Int, _ num_people: Int) -> [Int] { + + } +}","func distributeCandies(candies int, num_people int) []int { + +}","object Solution { + def distributeCandies(candies: Int, num_people: Int): Array[Int] = { + + } +}","class Solution { + fun distributeCandies(candies: Int, num_people: Int): IntArray { + + } +}","impl Solution { + pub fn distribute_candies(candies: i32, num_people: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $candies + * @param Integer $num_people + * @return Integer[] + */ + function distributeCandies($candies, $num_people) { + + } +}","function distributeCandies(candies: number, num_people: number): number[] { + +};","(define/contract (distribute-candies candies num_people) + (-> exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec distribute_candies(Candies :: integer(), Num_people :: integer()) -> [integer()]. +distribute_candies(Candies, Num_people) -> + .","defmodule Solution do + @spec distribute_candies(candies :: integer, num_people :: integer) :: [integer] + def distribute_candies(candies, num_people) do + + end +end","class Solution { + List distributeCandies(int candies, int num_people) { + + } +}", +1249,path-in-zigzag-labelled-binary-tree,Path In Zigzag Labelled Binary Tree,1104.0,1194.0,"

In an infinite binary tree where every node has two children, the nodes are labelled in row order.

+ +

In the odd numbered rows (ie., the first, third, fifth,...), the labelling is left to right, while in the even numbered rows (second, fourth, sixth,...), the labelling is right to left.

+ +

+ +

Given the label of a node in this tree, return the labels in the path from the root of the tree to the node with that label.

+ +

 

+

Example 1:

+ +
+Input: label = 14
+Output: [1,3,4,14]
+
+ +

Example 2:

+ +
+Input: label = 26
+Output: [1,2,6,10,26]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= label <= 10^6
    • +
+",2.0,False,"class Solution { +public: + vector pathInZigZagTree(int label) { + + } +};","class Solution { + public List pathInZigZagTree(int label) { + + } +}","class Solution(object): + def pathInZigZagTree(self, label): + """""" + :type label: int + :rtype: List[int] + """""" + ","class Solution: + def pathInZigZagTree(self, label: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* pathInZigZagTree(int label, int* returnSize){ + +}","public class Solution { + public IList PathInZigZagTree(int label) { + + } +}","/** + * @param {number} label + * @return {number[]} + */ +var pathInZigZagTree = function(label) { + +};","# @param {Integer} label +# @return {Integer[]} +def path_in_zig_zag_tree(label) + +end","class Solution { + func pathInZigZagTree(_ label: Int) -> [Int] { + + } +}","func pathInZigZagTree(label int) []int { + +}","object Solution { + def pathInZigZagTree(label: Int): List[Int] = { + + } +}","class Solution { + fun pathInZigZagTree(label: Int): List { + + } +}","impl Solution { + pub fn path_in_zig_zag_tree(label: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $label + * @return Integer[] + */ + function pathInZigZagTree($label) { + + } +}","function pathInZigZagTree(label: number): number[] { + +};","(define/contract (path-in-zig-zag-tree label) + (-> exact-integer? (listof exact-integer?)) + + )","-spec path_in_zig_zag_tree(Label :: integer()) -> [integer()]. +path_in_zig_zag_tree(Label) -> + .","defmodule Solution do + @spec path_in_zig_zag_tree(label :: integer) :: [integer] + def path_in_zig_zag_tree(label) do + + end +end","class Solution { + List pathInZigZagTree(int label) { + + } +}", +1250,brace-expansion-ii,Brace Expansion II,1096.0,1188.0,"

Under the grammar given below, strings can represent a set of lowercase words. Let R(expr) denote the set of words the expression represents.

+ +

The grammar can best be understood through simple examples:

+ +
    +
  • Single letters represent a singleton set containing that word. +
      +
    • R("a") = {"a"}
      • +
    • R("w") = {"w"}
      • +
    +
    • +
  • When we take a comma-delimited list of two or more expressions, we take the union of possibilities. +
      +
    • R("{a,b,c}") = {"a","b","c"}
      • +
    • R("{{a,b},{b,c}}") = {"a","b","c"} (notice the final set only contains each word at most once)
      • +
    +
    • +
  • When we concatenate two expressions, we take the set of possible concatenations between two words where the first word comes from the first expression and the second word comes from the second expression. +
      +
    • R("{a,b}{c,d}") = {"ac","ad","bc","bd"}
      • +
    • R("a{b,c}{d,e}f{g,h}") = {"abdfg", "abdfh", "abefg", "abefh", "acdfg", "acdfh", "acefg", "acefh"}
      • +
    +
    • +
+ +

Formally, the three rules for our grammar:

+ +
    +
  • For every lowercase letter x, we have R(x) = {x}.
    • +
  • For expressions e1, e2, ... , ek with k >= 2, we have R({e1, e2, ...}) = R(e1) ∪ R(e2) ∪ ...
    • +
  • For expressions e1 and e2, we have R(e1 + e2) = {a + b for (a, b) in R(e1) × R(e2)}, where + denotes concatenation, and × denotes the cartesian product.
    • +
+ +

Given an expression representing a set of words under the given grammar, return the sorted list of words that the expression represents.

+ +

 

+

Example 1:

+ +
+Input: expression = "{a,b}{c,{d,e}}"
+Output: ["ac","ad","ae","bc","bd","be"]
+
+ +

Example 2:

+ +
+Input: expression = "{{a,z},a{b,c},{ab,z}}"
+Output: ["a","ab","ac","z"]
+Explanation: Each distinct word is written only once in the final answer.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= expression.length <= 60
    • +
  • expression[i] consists of '{', '}', ','or lowercase English letters.
    • +
  • The given expression represents a set of words based on the grammar given in the description.
    • +
+",3.0,False,"class Solution { +public: + vector braceExpansionII(string expression) { + + } +};","class Solution { + public List braceExpansionII(String expression) { + + } +}","class Solution(object): + def braceExpansionII(self, expression): + """""" + :type expression: str + :rtype: List[str] + """""" + ","class Solution: + def braceExpansionII(self, expression: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** braceExpansionII(char * expression, int* returnSize){ + +}","public class Solution { + public IList BraceExpansionII(string expression) { + + } +}","/** + * @param {string} expression + * @return {string[]} + */ +var braceExpansionII = function(expression) { + +};","# @param {String} expression +# @return {String[]} +def brace_expansion_ii(expression) + +end","class Solution { + func braceExpansionII(_ expression: String) -> [String] { + + } +}","func braceExpansionII(expression string) []string { + +}","object Solution { + def braceExpansionII(expression: String): List[String] = { + + } +}","class Solution { + fun braceExpansionII(expression: String): List { + + } +}","impl Solution { + pub fn brace_expansion_ii(expression: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $expression + * @return String[] + */ + function braceExpansionII($expression) { + + } +}","function braceExpansionII(expression: string): string[] { + +};","(define/contract (brace-expansion-ii expression) + (-> string? (listof string?)) + + )","-spec brace_expansion_ii(Expression :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +brace_expansion_ii(Expression) -> + .","defmodule Solution do + @spec brace_expansion_ii(expression :: String.t) :: [String.t] + def brace_expansion_ii(expression) do + + end +end","class Solution { + List braceExpansionII(String expression) { + + } +}", +1251,find-in-mountain-array,Find in Mountain Array,1095.0,1185.0,"

(This problem is an interactive problem.)

+ +

You may recall that an array arr is a mountain array if and only if:

+ +
    +
  • arr.length >= 3
    • +
  • There exists some i with 0 < i < arr.length - 1 such that: +
      +
    • arr[0] < arr[1] < ... < arr[i - 1] < arr[i]
      • +
    • arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
      • +
    +
    • +
+ +

Given a mountain array mountainArr, return the minimum index such that mountainArr.get(index) == target. If such an index does not exist, return -1.

+ +

You cannot access the mountain array directly. You may only access the array using a MountainArray interface:

+ +
    +
  • MountainArray.get(k) returns the element of the array at index k (0-indexed).
    • +
  • MountainArray.length() returns the length of the array.
    • +
+ +

Submissions making more than 100 calls to MountainArray.get will be judged Wrong Answer. Also, any solutions that attempt to circumvent the judge will result in disqualification.

+ +

 

+

Example 1:

+ +
+Input: array = [1,2,3,4,5,3,1], target = 3
+Output: 2
+Explanation: 3 exists in the array, at index=2 and index=5. Return the minimum index, which is 2.
+ +

Example 2:

+ +
+Input: array = [0,1,2,4,2,1], target = 3
+Output: -1
+Explanation: 3 does not exist in the array, so we return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= mountain_arr.length() <= 104
    • +
  • 0 <= target <= 109
    • +
  • 0 <= mountain_arr.get(index) <= 109
    • +
+",3.0,False,"/** + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class MountainArray { + * public: + * int get(int index); + * int length(); + * }; + */ + +class Solution { +public: + int findInMountainArray(int target, MountainArray &mountainArr) { + + } +};","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * interface MountainArray { + * public int get(int index) {} + * public int length() {} + * } + */ + +class Solution { + public int findInMountainArray(int target, MountainArray mountainArr) { + + } +}","# """""" +# This is MountainArray's API interface. +# You should not implement it, or speculate about its implementation +# """""" +#class MountainArray(object): +# def get(self, index): +# """""" +# :type index: int +# :rtype int +# """""" +# +# def length(self): +# """""" +# :rtype int +# """""" + +class Solution(object): + def findInMountainArray(self, target, mountain_arr): + """""" + :type target: integer + :type mountain_arr: MountainArray + :rtype: integer + """""" + ","# """""" +# This is MountainArray's API interface. +# You should not implement it, or speculate about its implementation +# """""" +#class MountainArray: +# def get(self, index: int) -> int: +# def length(self) -> int: + +class Solution: + def findInMountainArray(self, target: int, mountain_arr: 'MountainArray') -> int: + ","/** + * ********************************************************************* + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * ********************************************************************* + * + * int get(MountainArray *, int index); + * int length(MountainArray *); + */ + +int findInMountainArray(int target, MountainArray* mountainArr) { + +}","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class MountainArray { + * public int Get(int index) {} + * public int Length() {} + * } + */ + +class Solution { + public int FindInMountainArray(int target, MountainArray mountainArr) { + + } +}","/** + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * function MountainArray() { + * @param {number} index + * @return {number} + * this.get = function(index) { + * ... + * }; + * + * @return {number} + * this.length = function() { + * ... + * }; + * }; + */ + +/** + * @param {number} target + * @param {MountainArray} mountainArr + * @return {number} + */ +var findInMountainArray = function(target, mountainArr) { + +};","# This is MountainArray's API interface. +# You should not implement it, or speculate about its implementation +# class MountainArray +# def get(index): +# +# end +# +# def length() +# +# end +# end + +# @param {int} int +# @param {MountainArray} mountain_arr +# @return {int} +def findInMountainArray(target, mountain_arr) + +end","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * interface MountainArray { + * public func get(_ index: Int) -> Int {} + * public func length() -> Int {} + * } + */ + +class Solution { + func findInMountainArray(_ target: Int, _ mountainArr: MountainArray) -> Int { + + } +}","/** + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * type MountainArray struct { + * } + * + * func (this *MountainArray) get(index int) int {} + * func (this *MountainArray) length() int {} + */ + +func findInMountainArray(target int, mountainArr *MountainArray) int { + +}","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class MountainArray { + * def get(index: Int): Int = {} + * def length(): Int = {} + * } + */ + +object Solution { + def findInMountainArray(value: Int, mountainArr: MountainArray): Int = { + + } +}","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class MountainArray { + * fun get(index: Int): Int {} + * fun length(): Int {} + * } + */ + +class Solution { + fun findInMountainArray(target: Int, mountainArr: MountainArray): Int { + + } +}","/** + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * struct MountainArray; + * impl MountainArray { + * fn get(index:i32)->i32; + * fn length()->i32; + * }; + */ + +impl Solution { + pub fn find_in_mountain_array(target: i32, mountainArr: &MountainArray) -> i32 { + + } +}","/** + * // This is MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class MountainArray { + * function get($index) {} + * function length() {} + * } + */ + +class Solution { + /** + * @param Integer $target + * @param MountainArray $mountainArr + * @return Integer + */ + function findInMountainArray($target, $mountainArr) { + + } +}","/** + * // This is the MountainArray's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * get(index: number): number {} + * + * length(): number {} + * } + */ + +function findInMountainArray(target: number, mountainArr: MountainArray) { + +};",,,,, +1252,car-pooling,Car Pooling,1094.0,1184.0,"

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

+ +

You are given the integer capacity and an array trips where trips[i] = [numPassengersi, fromi, toi] indicates that the ith trip has numPassengersi passengers and the locations to pick them up and drop them off are fromi and toi respectively. The locations are given as the number of kilometers due east from the car's initial location.

+ +

Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: trips = [[2,1,5],[3,3,7]], capacity = 4
+Output: false
+
+ +

Example 2:

+ +
+Input: trips = [[2,1,5],[3,3,7]], capacity = 5
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= trips.length <= 1000
    • +
  • trips[i].length == 3
    • +
  • 1 <= numPassengersi <= 100
    • +
  • 0 <= fromi < toi <= 1000
    • +
  • 1 <= capacity <= 105
    • +
+",2.0,False,"class Solution { +public: + bool carPooling(vector>& trips, int capacity) { + + } +};","class Solution { + public boolean carPooling(int[][] trips, int capacity) { + + } +}","class Solution(object): + def carPooling(self, trips, capacity): + """""" + :type trips: List[List[int]] + :type capacity: int + :rtype: bool + """""" + ","class Solution: + def carPooling(self, trips: List[List[int]], capacity: int) -> bool: + ","bool carPooling(int** trips, int tripsSize, int* tripsColSize, int capacity){ + +}","public class Solution { + public bool CarPooling(int[][] trips, int capacity) { + + } +}","/** + * @param {number[][]} trips + * @param {number} capacity + * @return {boolean} + */ +var carPooling = function(trips, capacity) { + +};","# @param {Integer[][]} trips +# @param {Integer} capacity +# @return {Boolean} +def car_pooling(trips, capacity) + +end","class Solution { + func carPooling(_ trips: [[Int]], _ capacity: Int) -> Bool { + + } +}","func carPooling(trips [][]int, capacity int) bool { + +}","object Solution { + def carPooling(trips: Array[Array[Int]], capacity: Int): Boolean = { + + } +}","class Solution { + fun carPooling(trips: Array, capacity: Int): Boolean { + + } +}","impl Solution { + pub fn car_pooling(trips: Vec>, capacity: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $trips + * @param Integer $capacity + * @return Boolean + */ + function carPooling($trips, $capacity) { + + } +}","function carPooling(trips: number[][], capacity: number): boolean { + +};","(define/contract (car-pooling trips capacity) + (-> (listof (listof exact-integer?)) exact-integer? boolean?) + + )","-spec car_pooling(Trips :: [[integer()]], Capacity :: integer()) -> boolean(). +car_pooling(Trips, Capacity) -> + .","defmodule Solution do + @spec car_pooling(trips :: [[integer]], capacity :: integer) :: boolean + def car_pooling(trips, capacity) do + + end +end","class Solution { + bool carPooling(List> trips, int capacity) { + + } +}", +1254,shortest-path-in-binary-matrix,Shortest Path in Binary Matrix,1091.0,1171.0,"

Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1.

+ +

A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that:

+ +
    +
  • All the visited cells of the path are 0.
    • +
  • All the adjacent cells of the path are 8-directionally connected (i.e., they are different and they share an edge or a corner).
    • +
+ +

The length of a clear path is the number of visited cells of this path.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1],[1,0]]
+Output: 2
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,0],[1,1,0],[1,1,0]]
+Output: 4
+
+ +

Example 3:

+ +
+Input: grid = [[1,0,0],[1,1,0],[1,1,0]]
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= n <= 100
    • +
  • grid[i][j] is 0 or 1
    • +
+",2.0,False,"class Solution { +public: + int shortestPathBinaryMatrix(vector>& grid) { + + } +};","class Solution { + public int shortestPathBinaryMatrix(int[][] grid) { + + } +}","class Solution(object): + def shortestPathBinaryMatrix(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def shortestPathBinaryMatrix(self, grid: List[List[int]]) -> int: + ","int shortestPathBinaryMatrix(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int ShortestPathBinaryMatrix(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var shortestPathBinaryMatrix = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def shortest_path_binary_matrix(grid) + +end","class Solution { + func shortestPathBinaryMatrix(_ grid: [[Int]]) -> Int { + + } +}","func shortestPathBinaryMatrix(grid [][]int) int { + +}","object Solution { + def shortestPathBinaryMatrix(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun shortestPathBinaryMatrix(grid: Array): Int { + + } +}","impl Solution { + pub fn shortest_path_binary_matrix(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function shortestPathBinaryMatrix($grid) { + + } +}","function shortestPathBinaryMatrix(grid: number[][]): number { + +};","(define/contract (shortest-path-binary-matrix grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec shortest_path_binary_matrix(Grid :: [[integer()]]) -> integer(). +shortest_path_binary_matrix(Grid) -> + .","defmodule Solution do + @spec shortest_path_binary_matrix(grid :: [[integer]]) :: integer + def shortest_path_binary_matrix(grid) do + + end +end","class Solution { + int shortestPathBinaryMatrix(List> grid) { + + } +}", +1255,shortest-common-supersequence,Shortest Common Supersequence ,1092.0,1170.0,"

Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them.

+ +

A string s is a subsequence of string t if deleting some number of characters from t (possibly 0) results in the string s.

+ +

 

+

Example 1:

+ +
+Input: str1 = "abac", str2 = "cab"
+Output: "cabac"
+Explanation: 
+str1 = "abac" is a subsequence of "cabac" because we can delete the first "c".
+str2 = "cab" is a subsequence of "cabac" because we can delete the last "ac".
+The answer provided is the shortest such string that satisfies these properties.
+
+ +

Example 2:

+ +
+Input: str1 = "aaaaaaaa", str2 = "aaaaaaaa"
+Output: "aaaaaaaa"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= str1.length, str2.length <= 1000
    • +
  • str1 and str2 consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string shortestCommonSupersequence(string str1, string str2) { + + } +};","class Solution { + public String shortestCommonSupersequence(String str1, String str2) { + + } +}","class Solution(object): + def shortestCommonSupersequence(self, str1, str2): + """""" + :type str1: str + :type str2: str + :rtype: str + """""" + ","class Solution: + def shortestCommonSupersequence(self, str1: str, str2: str) -> str: + ","char * shortestCommonSupersequence(char * str1, char * str2){ + +}","public class Solution { + public string ShortestCommonSupersequence(string str1, string str2) { + + } +}","/** + * @param {string} str1 + * @param {string} str2 + * @return {string} + */ +var shortestCommonSupersequence = function(str1, str2) { + +};","# @param {String} str1 +# @param {String} str2 +# @return {String} +def shortest_common_supersequence(str1, str2) + +end","class Solution { + func shortestCommonSupersequence(_ str1: String, _ str2: String) -> String { + + } +}","func shortestCommonSupersequence(str1 string, str2 string) string { + +}","object Solution { + def shortestCommonSupersequence(str1: String, str2: String): String = { + + } +}","class Solution { + fun shortestCommonSupersequence(str1: String, str2: String): String { + + } +}","impl Solution { + pub fn shortest_common_supersequence(str1: String, str2: String) -> String { + + } +}","class Solution { + + /** + * @param String $str1 + * @param String $str2 + * @return String + */ + function shortestCommonSupersequence($str1, $str2) { + + } +}","function shortestCommonSupersequence(str1: string, str2: string): string { + +};","(define/contract (shortest-common-supersequence str1 str2) + (-> string? string? string?) + + )","-spec shortest_common_supersequence(Str1 :: unicode:unicode_binary(), Str2 :: unicode:unicode_binary()) -> unicode:unicode_binary(). +shortest_common_supersequence(Str1, Str2) -> + .","defmodule Solution do + @spec shortest_common_supersequence(str1 :: String.t, str2 :: String.t) :: String.t + def shortest_common_supersequence(str1, str2) do + + end +end","class Solution { + String shortestCommonSupersequence(String str1, String str2) { + + } +}", +1256,largest-values-from-labels,Largest Values From Labels,1090.0,1169.0,"

There is a set of n items. You are given two integer arrays values and labels where the value and the label of the ith element are values[i] and labels[i] respectively. You are also given two integers numWanted and useLimit.

+ +

Choose a subset s of the n elements such that:

+ +
    +
  • The size of the subset s is less than or equal to numWanted.
    • +
  • There are at most useLimit items with the same label in s.
    • +
+ +

The score of a subset is the sum of the values in the subset.

+ +

Return the maximum score of a subset s.

+ +

 

+

Example 1:

+ +
+Input: values = [5,4,3,2,1], labels = [1,1,2,2,3], numWanted = 3, useLimit = 1
+Output: 9
+Explanation: The subset chosen is the first, third, and fifth items.
+
+ +

Example 2:

+ +
+Input: values = [5,4,3,2,1], labels = [1,3,3,3,2], numWanted = 3, useLimit = 2
+Output: 12
+Explanation: The subset chosen is the first, second, and third items.
+
+ +

Example 3:

+ +
+Input: values = [9,8,8,7,6], labels = [0,0,0,1,1], numWanted = 3, useLimit = 1
+Output: 16
+Explanation: The subset chosen is the first and fourth items.
+
+ +

 

+

Constraints:

+ +
    +
  • n == values.length == labels.length
    • +
  • 1 <= n <= 2 * 104
    • +
  • 0 <= values[i], labels[i] <= 2 * 104
    • +
  • 1 <= numWanted, useLimit <= n
    • +
+",2.0,False,"class Solution { +public: + int largestValsFromLabels(vector& values, vector& labels, int numWanted, int useLimit) { + + } +};","class Solution { + public int largestValsFromLabels(int[] values, int[] labels, int numWanted, int useLimit) { + + } +}","class Solution(object): + def largestValsFromLabels(self, values, labels, numWanted, useLimit): + """""" + :type values: List[int] + :type labels: List[int] + :type numWanted: int + :type useLimit: int + :rtype: int + """""" + ","class Solution: + def largestValsFromLabels(self, values: List[int], labels: List[int], numWanted: int, useLimit: int) -> int: + ","int largestValsFromLabels(int* values, int valuesSize, int* labels, int labelsSize, int numWanted, int useLimit){ + +}","public class Solution { + public int LargestValsFromLabels(int[] values, int[] labels, int numWanted, int useLimit) { + + } +}","/** + * @param {number[]} values + * @param {number[]} labels + * @param {number} numWanted + * @param {number} useLimit + * @return {number} + */ +var largestValsFromLabels = function(values, labels, numWanted, useLimit) { + +};","# @param {Integer[]} values +# @param {Integer[]} labels +# @param {Integer} num_wanted +# @param {Integer} use_limit +# @return {Integer} +def largest_vals_from_labels(values, labels, num_wanted, use_limit) + +end","class Solution { + func largestValsFromLabels(_ values: [Int], _ labels: [Int], _ numWanted: Int, _ useLimit: Int) -> Int { + + } +}","func largestValsFromLabels(values []int, labels []int, numWanted int, useLimit int) int { + +}","object Solution { + def largestValsFromLabels(values: Array[Int], labels: Array[Int], numWanted: Int, useLimit: Int): Int = { + + } +}","class Solution { + fun largestValsFromLabels(values: IntArray, labels: IntArray, numWanted: Int, useLimit: Int): Int { + + } +}","impl Solution { + pub fn largest_vals_from_labels(values: Vec, labels: Vec, num_wanted: i32, use_limit: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $values + * @param Integer[] $labels + * @param Integer $numWanted + * @param Integer $useLimit + * @return Integer + */ + function largestValsFromLabels($values, $labels, $numWanted, $useLimit) { + + } +}","function largestValsFromLabels(values: number[], labels: number[], numWanted: number, useLimit: number): number { + +};","(define/contract (largest-vals-from-labels values labels numWanted useLimit) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec largest_vals_from_labels(Values :: [integer()], Labels :: [integer()], NumWanted :: integer(), UseLimit :: integer()) -> integer(). +largest_vals_from_labels(Values, Labels, NumWanted, UseLimit) -> + .","defmodule Solution do + @spec largest_vals_from_labels(values :: [integer], labels :: [integer], num_wanted :: integer, use_limit :: integer) :: integer + def largest_vals_from_labels(values, labels, num_wanted, use_limit) do + + end +end","class Solution { + int largestValsFromLabels(List values, List labels, int numWanted, int useLimit) { + + } +}", +1259,smallest-subsequence-of-distinct-characters,Smallest Subsequence of Distinct Characters,1081.0,1159.0,"

Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.

+ +

 

+

Example 1:

+ +
+Input: s = "bcabc"
+Output: "abc"
+
+ +

Example 2:

+ +
+Input: s = "cbacdcbc"
+Output: "acdb"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s consists of lowercase English letters.
    • +
+ +

 

+Note: This question is the same as 316: https://leetcode.com/problems/remove-duplicate-letters/",2.0,False,"class Solution { +public: + string smallestSubsequence(string s) { + + } +};","class Solution { + public String smallestSubsequence(String s) { + + } +}","class Solution(object): + def smallestSubsequence(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def smallestSubsequence(self, s: str) -> str: + ","char * smallestSubsequence(char * s){ + +}","public class Solution { + public string SmallestSubsequence(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var smallestSubsequence = function(s) { + +};","# @param {String} s +# @return {String} +def smallest_subsequence(s) + +end","class Solution { + func smallestSubsequence(_ s: String) -> String { + + } +}","func smallestSubsequence(s string) string { + +}","object Solution { + def smallestSubsequence(s: String): String = { + + } +}","class Solution { + fun smallestSubsequence(s: String): String { + + } +}","impl Solution { + pub fn smallest_subsequence(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function smallestSubsequence($s) { + + } +}","function smallestSubsequence(s: string): string { + +};","(define/contract (smallest-subsequence s) + (-> string? string?) + + )","-spec smallest_subsequence(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +smallest_subsequence(S) -> + .","defmodule Solution do + @spec smallest_subsequence(s :: String.t) :: String.t + def smallest_subsequence(s) do + + end +end","class Solution { + String smallestSubsequence(String s) { + + } +}", +1264,greatest-common-divisor-of-strings,Greatest Common Divisor of Strings,1071.0,1146.0,"

For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times).

+ +

Given two strings str1 and str2, return the largest string x such that x divides both str1 and str2.

+ +

 

+

Example 1:

+ +
+Input: str1 = "ABCABC", str2 = "ABC"
+Output: "ABC"
+
+ +

Example 2:

+ +
+Input: str1 = "ABABAB", str2 = "ABAB"
+Output: "AB"
+
+ +

Example 3:

+ +
+Input: str1 = "LEET", str2 = "CODE"
+Output: ""
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= str1.length, str2.length <= 1000
    • +
  • str1 and str2 consist of English uppercase letters.
    • +
+",1.0,False,"class Solution { +public: + string gcdOfStrings(string str1, string str2) { + + } +};","class Solution { + public String gcdOfStrings(String str1, String str2) { + + } +}","class Solution(object): + def gcdOfStrings(self, str1, str2): + """""" + :type str1: str + :type str2: str + :rtype: str + """""" + ","class Solution: + def gcdOfStrings(self, str1: str, str2: str) -> str: + ","char * gcdOfStrings(char * str1, char * str2){ + +}","public class Solution { + public string GcdOfStrings(string str1, string str2) { + + } +}","/** + * @param {string} str1 + * @param {string} str2 + * @return {string} + */ +var gcdOfStrings = function(str1, str2) { + +};","# @param {String} str1 +# @param {String} str2 +# @return {String} +def gcd_of_strings(str1, str2) + +end","class Solution { + func gcdOfStrings(_ str1: String, _ str2: String) -> String { + + } +}","func gcdOfStrings(str1 string, str2 string) string { + +}","object Solution { + def gcdOfStrings(str1: String, str2: String): String = { + + } +}","class Solution { + fun gcdOfStrings(str1: String, str2: String): String { + + } +}","impl Solution { + pub fn gcd_of_strings(str1: String, str2: String) -> String { + + } +}","class Solution { + + /** + * @param String $str1 + * @param String $str2 + * @return String + */ + function gcdOfStrings($str1, $str2) { + + } +}","function gcdOfStrings(str1: string, str2: string): string { + +};","(define/contract (gcd-of-strings str1 str2) + (-> string? string? string?) + + )","-spec gcd_of_strings(Str1 :: unicode:unicode_binary(), Str2 :: unicode:unicode_binary()) -> unicode:unicode_binary(). +gcd_of_strings(Str1, Str2) -> + .","defmodule Solution do + @spec gcd_of_strings(str1 :: String.t, str2 :: String.t) :: String.t + def gcd_of_strings(str1, str2) do + + end +end","class Solution { + String gcdOfStrings(String str1, String str2) { + + } +}", +1265,number-of-submatrices-that-sum-to-target,Number of Submatrices That Sum to Target,1074.0,1145.0,"

Given a matrix and a target, return the number of non-empty submatrices that sum to target.

+ +

A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 <= x <= x2 and y1 <= y <= y2.

+ +

Two submatrices (x1, y1, x2, y2) and (x1', y1', x2', y2') are different if they have some coordinate that is different: for example, if x1 != x1'.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
+Output: 4
+Explanation: The four 1x1 submatrices that only contain 0.
+
+ +

Example 2:

+ +
+Input: matrix = [[1,-1],[-1,1]], target = 0
+Output: 5
+Explanation: The two 1x2 submatrices, plus the two 2x1 submatrices, plus the 2x2 submatrix.
+
+ +

Example 3:

+ +
+Input: matrix = [[904]], target = 0
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= matrix.length <= 100
    • +
  • 1 <= matrix[0].length <= 100
    • +
  • -1000 <= matrix[i] <= 1000
    • +
  • -10^8 <= target <= 10^8
    • +
+",3.0,False,"class Solution { +public: + int numSubmatrixSumTarget(vector>& matrix, int target) { + + } +};","class Solution { + public int numSubmatrixSumTarget(int[][] matrix, int target) { + + } +}","class Solution(object): + def numSubmatrixSumTarget(self, matrix, target): + """""" + :type matrix: List[List[int]] + :type target: int + :rtype: int + """""" + ","class Solution: + def numSubmatrixSumTarget(self, matrix: List[List[int]], target: int) -> int: + ","int numSubmatrixSumTarget(int** matrix, int matrixSize, int* matrixColSize, int target){ + +}","public class Solution { + public int NumSubmatrixSumTarget(int[][] matrix, int target) { + + } +}","/** + * @param {number[][]} matrix + * @param {number} target + * @return {number} + */ +var numSubmatrixSumTarget = function(matrix, target) { + +};","# @param {Integer[][]} matrix +# @param {Integer} target +# @return {Integer} +def num_submatrix_sum_target(matrix, target) + +end","class Solution { + func numSubmatrixSumTarget(_ matrix: [[Int]], _ target: Int) -> Int { + + } +}","func numSubmatrixSumTarget(matrix [][]int, target int) int { + +}","object Solution { + def numSubmatrixSumTarget(matrix: Array[Array[Int]], target: Int): Int = { + + } +}","class Solution { + fun numSubmatrixSumTarget(matrix: Array, target: Int): Int { + + } +}","impl Solution { + pub fn num_submatrix_sum_target(matrix: Vec>, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @param Integer $target + * @return Integer + */ + function numSubmatrixSumTarget($matrix, $target) { + + } +}","function numSubmatrixSumTarget(matrix: number[][], target: number): number { + +};","(define/contract (num-submatrix-sum-target matrix target) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec num_submatrix_sum_target(Matrix :: [[integer()]], Target :: integer()) -> integer(). +num_submatrix_sum_target(Matrix, Target) -> + .","defmodule Solution do + @spec num_submatrix_sum_target(matrix :: [[integer]], target :: integer) :: integer + def num_submatrix_sum_target(matrix, target) do + + end +end","class Solution { + int numSubmatrixSumTarget(List> matrix, int target) { + + } +}", +1266,distant-barcodes,Distant Barcodes,1054.0,1140.0,"

In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].

+ +

Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.

+ +

 

+

Example 1:

+
Input: barcodes = [1,1,1,2,2,2]
+Output: [2,1,2,1,2,1]
+

Example 2:

+
Input: barcodes = [1,1,1,1,2,2,3,3]
+Output: [1,3,1,3,1,2,1,2]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= barcodes.length <= 10000
    • +
  • 1 <= barcodes[i] <= 10000
    • +
+",2.0,False,"class Solution { +public: + vector rearrangeBarcodes(vector& barcodes) { + + } +};","class Solution { + public int[] rearrangeBarcodes(int[] barcodes) { + + } +}","class Solution(object): + def rearrangeBarcodes(self, barcodes): + """""" + :type barcodes: List[int] + :rtype: List[int] + """""" + ","class Solution: + def rearrangeBarcodes(self, barcodes: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* rearrangeBarcodes(int* barcodes, int barcodesSize, int* returnSize){ + +}","public class Solution { + public int[] RearrangeBarcodes(int[] barcodes) { + + } +}","/** + * @param {number[]} barcodes + * @return {number[]} + */ +var rearrangeBarcodes = function(barcodes) { + +};","# @param {Integer[]} barcodes +# @return {Integer[]} +def rearrange_barcodes(barcodes) + +end","class Solution { + func rearrangeBarcodes(_ barcodes: [Int]) -> [Int] { + + } +}","func rearrangeBarcodes(barcodes []int) []int { + +}","object Solution { + def rearrangeBarcodes(barcodes: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun rearrangeBarcodes(barcodes: IntArray): IntArray { + + } +}","impl Solution { + pub fn rearrange_barcodes(barcodes: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $barcodes + * @return Integer[] + */ + function rearrangeBarcodes($barcodes) { + + } +}","function rearrangeBarcodes(barcodes: number[]): number[] { + +};","(define/contract (rearrange-barcodes barcodes) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec rearrange_barcodes(Barcodes :: [integer()]) -> [integer()]. +rearrange_barcodes(Barcodes) -> + .","defmodule Solution do + @spec rearrange_barcodes(barcodes :: [integer]) :: [integer] + def rearrange_barcodes(barcodes) do + + end +end","class Solution { + List rearrangeBarcodes(List barcodes) { + + } +}", +1270,last-substring-in-lexicographical-order,Last Substring in Lexicographical Order,1163.0,1133.0,"

Given a string s, return the last substring of s in lexicographical order.

+ +

 

+

Example 1:

+ +
+Input: s = "abab"
+Output: "bab"
+Explanation: The substrings are ["a", "ab", "aba", "abab", "b", "ba", "bab"]. The lexicographically maximum substring is "bab".
+
+ +

Example 2:

+ +
+Input: s = "leetcode"
+Output: "tcode"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 4 * 105
    • +
  • s contains only lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string lastSubstring(string s) { + + } +};","class Solution { + public String lastSubstring(String s) { + + } +}","class Solution(object): + def lastSubstring(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def lastSubstring(self, s: str) -> str: + ","char * lastSubstring(char * s){ + +}","public class Solution { + public string LastSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var lastSubstring = function(s) { + +};","# @param {String} s +# @return {String} +def last_substring(s) + +end","class Solution { + func lastSubstring(_ s: String) -> String { + + } +}","func lastSubstring(s string) string { + +}","object Solution { + def lastSubstring(s: String): String = { + + } +}","class Solution { + fun lastSubstring(s: String): String { + + } +}","impl Solution { + pub fn last_substring(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function lastSubstring($s) { + + } +}","function lastSubstring(s: string): string { + +};","(define/contract (last-substring s) + (-> string? string?) + + )","-spec last_substring(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +last_substring(S) -> + .","defmodule Solution do + @spec last_substring(s :: String.t) :: String.t + def last_substring(s) do + + end +end","class Solution { + String lastSubstring(String s) { + + } +}", +1272,longest-string-chain,Longest String Chain,1048.0,1129.0,"

You are given an array of words where each word consists of lowercase English letters.

+ +

wordA is a predecessor of wordB if and only if we can insert exactly one letter anywhere in wordA without changing the order of the other characters to make it equal to wordB.

+ +
    +
  • For example, "abc" is a predecessor of "abac", while "cba" is not a predecessor of "bcad".
    • +
+ +

A word chain is a sequence of words [word1, word2, ..., wordk] with k >= 1, where word1 is a predecessor of word2, word2 is a predecessor of word3, and so on. A single word is trivially a word chain with k == 1.

+ +

Return the length of the longest possible word chain with words chosen from the given list of words.

+ +

 

+

Example 1:

+ +
+Input: words = ["a","b","ba","bca","bda","bdca"]
+Output: 4
+Explanation: One of the longest word chains is ["a","ba","bda","bdca"].
+
+ +

Example 2:

+ +
+Input: words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
+Output: 5
+Explanation: All the words can be put in a word chain ["xb", "xbc", "cxbc", "pcxbc", "pcxbcf"].
+
+ +

Example 3:

+ +
+Input: words = ["abcd","dbqca"]
+Output: 1
+Explanation: The trivial word chain ["abcd"] is one of the longest word chains.
+["abcd","dbqca"] is not a valid word chain because the ordering of the letters is changed.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 1000
    • +
  • 1 <= words[i].length <= 16
    • +
  • words[i] only consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int longestStrChain(vector& words) { + + } +};","class Solution { + public int longestStrChain(String[] words) { + + } +}","class Solution(object): + def longestStrChain(self, words): + """""" + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def longestStrChain(self, words: List[str]) -> int: + ","int longestStrChain(char ** words, int wordsSize){ + +}","public class Solution { + public int LongestStrChain(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number} + */ +var longestStrChain = function(words) { + +};","# @param {String[]} words +# @return {Integer} +def longest_str_chain(words) + +end","class Solution { + func longestStrChain(_ words: [String]) -> Int { + + } +}","func longestStrChain(words []string) int { + +}","object Solution { + def longestStrChain(words: Array[String]): Int = { + + } +}","class Solution { + fun longestStrChain(words: Array): Int { + + } +}","impl Solution { + pub fn longest_str_chain(words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer + */ + function longestStrChain($words) { + + } +}","function longestStrChain(words: string[]): number { + +};","(define/contract (longest-str-chain words) + (-> (listof string?) exact-integer?) + + )","-spec longest_str_chain(Words :: [unicode:unicode_binary()]) -> integer(). +longest_str_chain(Words) -> + .","defmodule Solution do + @spec longest_str_chain(words :: [String.t]) :: integer + def longest_str_chain(words) do + + end +end","class Solution { + int longestStrChain(List words) { + + } +}", +1275,longest-duplicate-substring,Longest Duplicate Substring,1044.0,1122.0,"

Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap.

+ +

Return any duplicated substring that has the longest possible length. If s does not have a duplicated substring, the answer is "".

+ +

 

+

Example 1:

+
Input: s = ""banana""
+Output: ""ana""
+

Example 2:

+
Input: s = ""abcd""
+Output: """"
+
+

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 3 * 104
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string longestDupSubstring(string s) { + + } +};","class Solution { + public String longestDupSubstring(String s) { + + } +}","class Solution(object): + def longestDupSubstring(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def longestDupSubstring(self, s: str) -> str: + ","char * longestDupSubstring(char * s){ + +}","public class Solution { + public string LongestDupSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var longestDupSubstring = function(s) { + +};","# @param {String} s +# @return {String} +def longest_dup_substring(s) + +end","class Solution { + func longestDupSubstring(_ s: String) -> String { + + } +}","func longestDupSubstring(s string) string { + +}","object Solution { + def longestDupSubstring(s: String): String = { + + } +}","class Solution { + fun longestDupSubstring(s: String): String { + + } +}","impl Solution { + pub fn longest_dup_substring(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function longestDupSubstring($s) { + + } +}","function longestDupSubstring(s: string): string { + +};",,"-spec longest_dup_substring(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +longest_dup_substring(S) -> + .","defmodule Solution do + @spec longest_dup_substring(s :: String.t) :: String.t + def longest_dup_substring(s) do + + end +end","class Solution { + String longestDupSubstring(String s) { + + } +}", +1277,flower-planting-with-no-adjacent,Flower Planting With No Adjacent,1042.0,1120.0,"

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. In each garden, you want to plant one of 4 types of flowers.

+ +

All gardens have at most 3 paths coming into or leaving it.

+ +

Your task is to choose a flower type for each garden such that, for any two gardens connected by a path, they have different types of flowers.

+ +

Return any such a choice as an array answer, where answer[i] is the type of flower planted in the (i+1)th garden. The flower types are denoted 1, 2, 3, or 4. It is guaranteed an answer exists.

+ +

 

+

Example 1:

+ +
+Input: n = 3, paths = [[1,2],[2,3],[3,1]]
+Output: [1,2,3]
+Explanation:
+Gardens 1 and 2 have different types.
+Gardens 2 and 3 have different types.
+Gardens 3 and 1 have different types.
+Hence, [1,2,3] is a valid answer. Other valid answers include [1,2,4], [1,4,2], and [3,2,1].
+
+ +

Example 2:

+ +
+Input: n = 4, paths = [[1,2],[3,4]]
+Output: [1,2,1,2]
+
+ +

Example 3:

+ +
+Input: n = 4, paths = [[1,2],[2,3],[3,4],[4,1],[1,3],[2,4]]
+Output: [1,2,3,4]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
  • 0 <= paths.length <= 2 * 104
    • +
  • paths[i].length == 2
    • +
  • 1 <= xi, yi <= n
    • +
  • xi != yi
    • +
  • Every garden has at most 3 paths coming into or leaving it.
    • +
+",2.0,False,"class Solution { +public: + vector gardenNoAdj(int n, vector>& paths) { + + } +};","class Solution { + public int[] gardenNoAdj(int n, int[][] paths) { + + } +}","class Solution(object): + def gardenNoAdj(self, n, paths): + """""" + :type n: int + :type paths: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def gardenNoAdj(self, n: int, paths: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* gardenNoAdj(int n, int** paths, int pathsSize, int* pathsColSize, int* returnSize){ + +}","public class Solution { + public int[] GardenNoAdj(int n, int[][] paths) { + + } +}","/** + * @param {number} n + * @param {number[][]} paths + * @return {number[]} + */ +var gardenNoAdj = function(n, paths) { + +};","# @param {Integer} n +# @param {Integer[][]} paths +# @return {Integer[]} +def garden_no_adj(n, paths) + +end","class Solution { + func gardenNoAdj(_ n: Int, _ paths: [[Int]]) -> [Int] { + + } +}","func gardenNoAdj(n int, paths [][]int) []int { + +}","object Solution { + def gardenNoAdj(n: Int, paths: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun gardenNoAdj(n: Int, paths: Array): IntArray { + + } +}","impl Solution { + pub fn garden_no_adj(n: i32, paths: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $paths + * @return Integer[] + */ + function gardenNoAdj($n, $paths) { + + } +}","function gardenNoAdj(n: number, paths: number[][]): number[] { + +};","(define/contract (garden-no-adj n paths) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec garden_no_adj(N :: integer(), Paths :: [[integer()]]) -> [integer()]. +garden_no_adj(N, Paths) -> + .","defmodule Solution do + @spec garden_no_adj(n :: integer, paths :: [[integer]]) :: [integer] + def garden_no_adj(n, paths) do + + end +end","class Solution { + List gardenNoAdj(int n, List> paths) { + + } +}", +1282,binary-search-tree-to-greater-sum-tree,Binary Search Tree to Greater Sum Tree,1038.0,1114.0,"

Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.

+ +

As a reminder, a binary search tree is a tree that satisfies these constraints:

+ +
    +
  • The left subtree of a node contains only nodes with keys less than the node's key.
    • +
  • The right subtree of a node contains only nodes with keys greater than the node's key.
    • +
  • Both the left and right subtrees must also be binary search trees.
    • +
+ +

 

+

Example 1:

+ +
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+
+ +

Example 2:

+ +
+Input: root = [0,null,1]
+Output: [1,null,1]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 100].
    • +
  • 0 <= Node.val <= 100
    • +
  • All the values in the tree are unique.
    • +
+ +

 

+

Note: This question is the same as 538: https://leetcode.com/problems/convert-bst-to-greater-tree/

+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* bstToGst(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode bstToGst(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def bstToGst(self, root): + """""" + :type root: TreeNode + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def bstToGst(self, root: TreeNode) -> TreeNode: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* bstToGst(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode BstToGst(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {TreeNode} + */ +var bstToGst = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {TreeNode} +def bst_to_gst(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func bstToGst(_ root: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func bstToGst(root *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def bstToGst(root: TreeNode): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun bstToGst(root: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn bst_to_gst(root: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return TreeNode + */ + function bstToGst($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function bstToGst(root: TreeNode | null): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (bst-to-gst root) + (-> (or/c tree-node? #f) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec bst_to_gst(Root :: #tree_node{} | null) -> #tree_node{} | null. +bst_to_gst(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec bst_to_gst(root :: TreeNode.t | nil) :: TreeNode.t | nil + def bst_to_gst(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? bstToGst(TreeNode? root) { + + } +}", +1285,minimum-score-triangulation-of-polygon,Minimum Score Triangulation of Polygon,1039.0,1111.0,"

You have a convex n-sided polygon where each vertex has an integer value. You are given an integer array values where values[i] is the value of the ith vertex (i.e., clockwise order).

+ +

You will triangulate the polygon into n - 2 triangles. For each triangle, the value of that triangle is the product of the values of its vertices, and the total score of the triangulation is the sum of these values over all n - 2 triangles in the triangulation.

+ +

Return the smallest possible total score that you can achieve with some triangulation of the polygon.

+ +

 

+

Example 1:

+ +
+Input: values = [1,2,3]
+Output: 6
+Explanation: The polygon is already triangulated, and the score of the only triangle is 6.
+
+ +

Example 2:

+ +
+Input: values = [3,7,4,5]
+Output: 144
+Explanation: There are two triangulations, with possible scores: 3*7*5 + 4*5*7 = 245, or 3*4*5 + 3*4*7 = 144.
+The minimum score is 144.
+
+ +

Example 3:

+ +
+Input: values = [1,3,1,4,1,5]
+Output: 13
+Explanation: The minimum score triangulation has score 1*1*3 + 1*1*4 + 1*1*5 + 1*1*1 = 13.
+
+ +

 

+

Constraints:

+ +
    +
  • n == values.length
    • +
  • 3 <= n <= 50
    • +
  • 1 <= values[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + int minScoreTriangulation(vector& values) { + + } +};","class Solution { + public int minScoreTriangulation(int[] values) { + + } +}","class Solution(object): + def minScoreTriangulation(self, values): + """""" + :type values: List[int] + :rtype: int + """""" + ","class Solution: + def minScoreTriangulation(self, values: List[int]) -> int: + ","int minScoreTriangulation(int* values, int valuesSize){ + +}","public class Solution { + public int MinScoreTriangulation(int[] values) { + + } +}","/** + * @param {number[]} values + * @return {number} + */ +var minScoreTriangulation = function(values) { + +};","# @param {Integer[]} values +# @return {Integer} +def min_score_triangulation(values) + +end","class Solution { + func minScoreTriangulation(_ values: [Int]) -> Int { + + } +}","func minScoreTriangulation(values []int) int { + +}","object Solution { + def minScoreTriangulation(values: Array[Int]): Int = { + + } +}","class Solution { + fun minScoreTriangulation(values: IntArray): Int { + + } +}","impl Solution { + pub fn min_score_triangulation(values: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $values + * @return Integer + */ + function minScoreTriangulation($values) { + + } +}","function minScoreTriangulation(values: number[]): number { + +};","(define/contract (min-score-triangulation values) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_score_triangulation(Values :: [integer()]) -> integer(). +min_score_triangulation(Values) -> + .","defmodule Solution do + @spec min_score_triangulation(values :: [integer]) :: integer + def min_score_triangulation(values) do + + end +end","class Solution { + int minScoreTriangulation(List values) { + + } +}", +1286,escape-a-large-maze,Escape a Large Maze,1036.0,1106.0,"

There is a 1 million by 1 million grid on an XY-plane, and the coordinates of each grid square are (x, y).

+ +

We start at the source = [sx, sy] square and want to reach the target = [tx, ty] square. There is also an array of blocked squares, where each blocked[i] = [xi, yi] represents a blocked square with coordinates (xi, yi).

+ +

Each move, we can walk one square north, east, south, or west if the square is not in the array of blocked squares. We are also not allowed to walk outside of the grid.

+ +

Return true if and only if it is possible to reach the target square from the source square through a sequence of valid moves.

+ +

 

+

Example 1:

+ +
+Input: blocked = [[0,1],[1,0]], source = [0,0], target = [0,2]
+Output: false
+Explanation: The target square is inaccessible starting from the source square because we cannot move.
+We cannot move north or east because those squares are blocked.
+We cannot move south or west because we cannot go outside of the grid.
+
+ +

Example 2:

+ +
+Input: blocked = [], source = [0,0], target = [999999,999999]
+Output: true
+Explanation: Because there are no blocked cells, it is possible to reach the target square.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= blocked.length <= 200
    • +
  • blocked[i].length == 2
    • +
  • 0 <= xi, yi < 106
    • +
  • source.length == target.length == 2
    • +
  • 0 <= sx, sy, tx, ty < 106
    • +
  • source != target
    • +
  • It is guaranteed that source and target are not blocked.
    • +
+",3.0,False,"class Solution { +public: + bool isEscapePossible(vector>& blocked, vector& source, vector& target) { + + } +};","class Solution { + public boolean isEscapePossible(int[][] blocked, int[] source, int[] target) { + + } +}","class Solution(object): + def isEscapePossible(self, blocked, source, target): + """""" + :type blocked: List[List[int]] + :type source: List[int] + :type target: List[int] + :rtype: bool + """""" + ","class Solution: + def isEscapePossible(self, blocked: List[List[int]], source: List[int], target: List[int]) -> bool: + ","bool isEscapePossible(int** blocked, int blockedSize, int* blockedColSize, int* source, int sourceSize, int* target, int targetSize){ + +}","public class Solution { + public bool IsEscapePossible(int[][] blocked, int[] source, int[] target) { + + } +}","/** + * @param {number[][]} blocked + * @param {number[]} source + * @param {number[]} target + * @return {boolean} + */ +var isEscapePossible = function(blocked, source, target) { + +};","# @param {Integer[][]} blocked +# @param {Integer[]} source +# @param {Integer[]} target +# @return {Boolean} +def is_escape_possible(blocked, source, target) + +end","class Solution { + func isEscapePossible(_ blocked: [[Int]], _ source: [Int], _ target: [Int]) -> Bool { + + } +}","func isEscapePossible(blocked [][]int, source []int, target []int) bool { + +}","object Solution { + def isEscapePossible(blocked: Array[Array[Int]], source: Array[Int], target: Array[Int]): Boolean = { + + } +}","class Solution { + fun isEscapePossible(blocked: Array, source: IntArray, target: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_escape_possible(blocked: Vec>, source: Vec, target: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $blocked + * @param Integer[] $source + * @param Integer[] $target + * @return Boolean + */ + function isEscapePossible($blocked, $source, $target) { + + } +}","function isEscapePossible(blocked: number[][], source: number[], target: number[]): boolean { + +};","(define/contract (is-escape-possible blocked source target) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?) boolean?) + + )","-spec is_escape_possible(Blocked :: [[integer()]], Source :: [integer()], Target :: [integer()]) -> boolean(). +is_escape_possible(Blocked, Source, Target) -> + .","defmodule Solution do + @spec is_escape_possible(blocked :: [[integer]], source :: [integer], target :: [integer]) :: boolean + def is_escape_possible(blocked, source, target) do + + end +end","class Solution { + bool isEscapePossible(List> blocked, List source, List target) { + + } +}", +1289,moving-stones-until-consecutive,Moving Stones Until Consecutive,1033.0,1103.0,"

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 pick up a stone at an endpoint (i.e., either the lowest or highest position stone), and move it to an unoccupied position between those endpoints. Formally, let's say the stones are currently at positions x, y, and z with x < y < z. You pick up the stone at either position x or position z, and move that stone to an integer position k, with x < k < z and k != y.

+ +

The game ends when you cannot make any more moves (i.e., the stones are in three consecutive positions).

+ +

Return an integer array answer of length 2 where:

+ +
    +
  • answer[0] is the minimum number of moves you can play, and
    • +
  • answer[1] is the maximum number of moves you can play.
    • +
+ +

 

+

Example 1:

+ +
+Input: a = 1, b = 2, c = 5
+Output: [1,2]
+Explanation: Move the stone from 5 to 3, or move the stone from 5 to 4 to 3.
+
+ +

Example 2:

+ +
+Input: a = 4, b = 3, c = 2
+Output: [0,0]
+Explanation: We cannot make any moves.
+
+ +

Example 3:

+ +
+Input: a = 3, b = 5, c = 1
+Output: [1,2]
+Explanation: Move the stone from 1 to 4; or move the stone from 1 to 2 to 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a, b, c <= 100
    • +
  • a, b, and c have different values.
    • +
+",2.0,False,"class Solution { +public: + vector numMovesStones(int a, int b, int c) { + + } +};","class Solution { + public int[] numMovesStones(int a, int b, int c) { + + } +}","class Solution(object): + def numMovesStones(self, a, b, c): + """""" + :type a: int + :type b: int + :type c: int + :rtype: List[int] + """""" + ","class Solution: + def numMovesStones(self, a: int, b: int, c: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* numMovesStones(int a, int b, int c, int* returnSize){ + +}","public class Solution { + public int[] NumMovesStones(int a, int b, int c) { + + } +}","/** + * @param {number} a + * @param {number} b + * @param {number} c + * @return {number[]} + */ +var numMovesStones = function(a, b, c) { + +};","# @param {Integer} a +# @param {Integer} b +# @param {Integer} c +# @return {Integer[]} +def num_moves_stones(a, b, c) + +end","class Solution { + func numMovesStones(_ a: Int, _ b: Int, _ c: Int) -> [Int] { + + } +}","func numMovesStones(a int, b int, c int) []int { + +}","object Solution { + def numMovesStones(a: Int, b: Int, c: Int): Array[Int] = { + + } +}","class Solution { + fun numMovesStones(a: Int, b: Int, c: Int): IntArray { + + } +}","impl Solution { + pub fn num_moves_stones(a: i32, b: i32, c: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer $b + * @param Integer $c + * @return Integer[] + */ + function numMovesStones($a, $b, $c) { + + } +}","function numMovesStones(a: number, b: number, c: number): number[] { + +};","(define/contract (num-moves-stones a b c) + (-> exact-integer? exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec num_moves_stones(A :: integer(), B :: integer(), C :: integer()) -> [integer()]. +num_moves_stones(A, B, C) -> + .","defmodule Solution do + @spec num_moves_stones(a :: integer, b :: integer, c :: integer) :: [integer] + def num_moves_stones(a, b, c) do + + end +end","class Solution { + List numMovesStones(int a, int b, int c) { + + } +}", +1290,stream-of-characters,Stream of Characters,1032.0,1097.0,"

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 example, if words = ["abc", "xyz"] and the stream added the four characters (one by one) 'a', 'x', 'y', and 'z', your algorithm should detect that the suffix "xyz" of the characters "axyz" matches "xyz" from words.

+ +

Implement the StreamChecker class:

+ +
    +
  • StreamChecker(String[] words) Initializes the object with the strings array words.
    • +
  • boolean query(char letter) Accepts a new character from the stream and returns true if any non-empty suffix from the stream forms a word that is in words.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["StreamChecker", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query"]
+[[["cd", "f", "kl"]], ["a"], ["b"], ["c"], ["d"], ["e"], ["f"], ["g"], ["h"], ["i"], ["j"], ["k"], ["l"]]
+Output
+[null, false, false, false, true, false, true, false, false, false, false, false, true]
+
+Explanation
+StreamChecker streamChecker = new StreamChecker(["cd", "f", "kl"]);
+streamChecker.query("a"); // return False
+streamChecker.query("b"); // return False
+streamChecker.query("c"); // return False
+streamChecker.query("d"); // return True, because 'cd' is in the wordlist
+streamChecker.query("e"); // return False
+streamChecker.query("f"); // return True, because 'f' is in the wordlist
+streamChecker.query("g"); // return False
+streamChecker.query("h"); // return False
+streamChecker.query("i"); // return False
+streamChecker.query("j"); // return False
+streamChecker.query("k"); // return False
+streamChecker.query("l"); // return True, because 'kl' is in the wordlist
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 2000
    • +
  • 1 <= words[i].length <= 200
    • +
  • words[i] consists of lowercase English letters.
    • +
  • letter is a lowercase English letter.
    • +
  • At most 4 * 104 calls will be made to query.
    • +
+",3.0,False,"class StreamChecker { +public: + StreamChecker(vector& words) { + + } + + bool query(char letter) { + + } +}; + +/** + * Your StreamChecker object will be instantiated and called as such: + * StreamChecker* obj = new StreamChecker(words); + * bool param_1 = obj->query(letter); + */","class StreamChecker { + + public StreamChecker(String[] words) { + + } + + public boolean query(char letter) { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * StreamChecker obj = new StreamChecker(words); + * boolean param_1 = obj.query(letter); + */","class StreamChecker(object): + + def __init__(self, words): + """""" + :type words: List[str] + """""" + + + def query(self, letter): + """""" + :type letter: str + :rtype: bool + """""" + + + +# Your StreamChecker object will be instantiated and called as such: +# obj = StreamChecker(words) +# param_1 = obj.query(letter)","class StreamChecker: + + def __init__(self, words: List[str]): + + + def query(self, letter: str) -> bool: + + + +# Your StreamChecker object will be instantiated and called as such: +# obj = StreamChecker(words) +# param_1 = obj.query(letter)"," + + +typedef struct { + +} StreamChecker; + + +StreamChecker* streamCheckerCreate(char ** words, int wordsSize) { + +} + +bool streamCheckerQuery(StreamChecker* obj, char letter) { + +} + +void streamCheckerFree(StreamChecker* obj) { + +} + +/** + * Your StreamChecker struct will be instantiated and called as such: + * StreamChecker* obj = streamCheckerCreate(words, wordsSize); + * bool param_1 = streamCheckerQuery(obj, letter); + + * streamCheckerFree(obj); +*/","public class StreamChecker { + + public StreamChecker(string[] words) { + + } + + public bool Query(char letter) { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * StreamChecker obj = new StreamChecker(words); + * bool param_1 = obj.Query(letter); + */","/** + * @param {string[]} words + */ +var StreamChecker = function(words) { + +}; + +/** + * @param {character} letter + * @return {boolean} + */ +StreamChecker.prototype.query = function(letter) { + +}; + +/** + * Your StreamChecker object will be instantiated and called as such: + * var obj = new StreamChecker(words) + * var param_1 = obj.query(letter) + */","class StreamChecker + +=begin + :type words: String[] +=end + def initialize(words) + + end + + +=begin + :type letter: Character + :rtype: Boolean +=end + def query(letter) + + end + + +end + +# Your StreamChecker object will be instantiated and called as such: +# obj = StreamChecker.new(words) +# param_1 = obj.query(letter)"," +class StreamChecker { + + init(_ words: [String]) { + + } + + func query(_ letter: Character) -> Bool { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * let obj = StreamChecker(words) + * let ret_1: Bool = obj.query(letter) + */","type StreamChecker struct { + +} + + +func Constructor(words []string) StreamChecker { + +} + + +func (this *StreamChecker) Query(letter byte) bool { + +} + + +/** + * Your StreamChecker object will be instantiated and called as such: + * obj := Constructor(words); + * param_1 := obj.Query(letter); + */","class StreamChecker(_words: Array[String]) { + + def query(letter: Char): Boolean = { + + } + +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * var obj = new StreamChecker(words) + * var param_1 = obj.query(letter) + */","class StreamChecker(words: Array) { + + fun query(letter: Char): Boolean { + + } + +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * var obj = StreamChecker(words) + * var param_1 = obj.query(letter) + */","struct StreamChecker { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl StreamChecker { + + fn new(words: Vec) -> Self { + + } + + fn query(&self, letter: char) -> bool { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * let obj = StreamChecker::new(words); + * let ret_1: bool = obj.query(letter); + */","class StreamChecker { + /** + * @param String[] $words + */ + function __construct($words) { + + } + + /** + * @param String $letter + * @return Boolean + */ + function query($letter) { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * $obj = StreamChecker($words); + * $ret_1 = $obj->query($letter); + */","class StreamChecker { + constructor(words: string[]) { + + } + + query(letter: string): boolean { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * var obj = new StreamChecker(words) + * var param_1 = obj.query(letter) + */","(define stream-checker% + (class object% + (super-new) + + ; words : (listof string?) + (init-field + words) + + ; query : char? -> boolean? + (define/public (query letter) + + ))) + +;; Your stream-checker% object will be instantiated and called as such: +;; (define obj (new stream-checker% [words words])) +;; (define param_1 (send obj query letter))","-spec stream_checker_init_(Words :: [unicode:unicode_binary()]) -> any(). +stream_checker_init_(Words) -> + . + +-spec stream_checker_query(Letter :: char()) -> boolean(). +stream_checker_query(Letter) -> + . + + +%% Your functions will be called as such: +%% stream_checker_init_(Words), +%% Param_1 = stream_checker_query(Letter), + +%% stream_checker_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule StreamChecker do + @spec init_(words :: [String.t]) :: any + def init_(words) do + + end + + @spec query(letter :: char) :: boolean + def query(letter) do + + end +end + +# Your functions will be called as such: +# StreamChecker.init_(words) +# param_1 = StreamChecker.query(letter) + +# StreamChecker.init_ will be called before every test case, in which you can do some necessary initializations.","class StreamChecker { + + StreamChecker(List words) { + + } + + bool query(String letter) { + + } +} + +/** + * Your StreamChecker object will be instantiated and called as such: + * StreamChecker obj = StreamChecker(words); + * bool param1 = obj.query(letter); + */", +1292,two-city-scheduling,Two City Scheduling,1029.0,1095.0,"

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti.

+ +

Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.

+ +

 

+

Example 1:

+ +
+Input: costs = [[10,20],[30,200],[400,50],[30,20]]
+Output: 110
+Explanation: 
+The first person goes to city A for a cost of 10.
+The second person goes to city A for a cost of 30.
+The third person goes to city B for a cost of 50.
+The fourth person goes to city B for a cost of 20.
+
+The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.
+
+ +

Example 2:

+ +
+Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
+Output: 1859
+
+ +

Example 3:

+ +
+Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
+Output: 3086
+
+ +

 

+

Constraints:

+ +
    +
  • 2 * n == costs.length
    • +
  • 2 <= costs.length <= 100
    • +
  • costs.length is even.
    • +
  • 1 <= aCosti, bCosti <= 1000
    • +
+",2.0,False,"class Solution { +public: + int twoCitySchedCost(vector>& costs) { + + } +};","class Solution { + public int twoCitySchedCost(int[][] costs) { + + } +}","class Solution(object): + def twoCitySchedCost(self, costs): + """""" + :type costs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def twoCitySchedCost(self, costs: List[List[int]]) -> int: + ","int twoCitySchedCost(int** costs, int costsSize, int* costsColSize){ + +}","public class Solution { + public int TwoCitySchedCost(int[][] costs) { + + } +}","/** + * @param {number[][]} costs + * @return {number} + */ +var twoCitySchedCost = function(costs) { + +};","# @param {Integer[][]} costs +# @return {Integer} +def two_city_sched_cost(costs) + +end","class Solution { + func twoCitySchedCost(_ costs: [[Int]]) -> Int { + + } +}","func twoCitySchedCost(costs [][]int) int { + +}","object Solution { + def twoCitySchedCost(costs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun twoCitySchedCost(costs: Array): Int { + + } +}","impl Solution { + pub fn two_city_sched_cost(costs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $costs + * @return Integer + */ + function twoCitySchedCost($costs) { + + } +}","function twoCitySchedCost(costs: number[][]): number { + +};","(define/contract (two-city-sched-cost costs) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec two_city_sched_cost(Costs :: [[integer()]]) -> integer(). +two_city_sched_cost(Costs) -> + .","defmodule Solution do + @spec two_city_sched_cost(costs :: [[integer]]) :: integer + def two_city_sched_cost(costs) do + + end +end","class Solution { + int twoCitySchedCost(List> costs) { + + } +}", +1294,recover-a-tree-from-preorder-traversal,Recover a Tree From Preorder Traversal,1028.0,1093.0,"

We run a preorder depth-first search (DFS) on the root of a binary tree.

+ +

At each node in this traversal, we output D dashes (where D is the depth of this node), then we output the value of this node.  If the depth of a node is D, the depth of its immediate child is D + 1.  The depth of the root node is 0.

+ +

If a node has only one child, that child is guaranteed to be the left child.

+ +

Given the output traversal of this traversal, recover the tree and return its root.

+ +

 

+

Example 1:

+ +
+Input: traversal = "1-2--3--4-5--6--7"
+Output: [1,2,5,3,4,6,7]
+
+ +

Example 2:

+ +
+Input: traversal = "1-2--3---4-5--6---7"
+Output: [1,2,5,3,null,6,null,4,null,7]
+
+ +

Example 3:

+ +
+Input: traversal = "1-401--349---90--88"
+Output: [1,401,null,349,88,90]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the original tree is in the range [1, 1000].
    • +
  • 1 <= Node.val <= 109
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* recoverFromPreorder(string traversal) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode recoverFromPreorder(String traversal) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def recoverFromPreorder(self, traversal): + """""" + :type traversal: str + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def recoverFromPreorder(self, traversal: str) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* recoverFromPreorder(char * traversal){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode RecoverFromPreorder(string traversal) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {string} traversal + * @return {TreeNode} + */ +var recoverFromPreorder = function(traversal) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {String} traversal +# @return {TreeNode} +def recover_from_preorder(traversal) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func recoverFromPreorder(_ traversal: String) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func recoverFromPreorder(traversal string) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def recoverFromPreorder(traversal: String): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun recoverFromPreorder(traversal: String): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn recover_from_preorder(traversal: String) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param String $traversal + * @return TreeNode + */ + function recoverFromPreorder($traversal) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function recoverFromPreorder(traversal: string): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (recover-from-preorder traversal) + (-> string? (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec recover_from_preorder(Traversal :: unicode:unicode_binary()) -> #tree_node{} | null. +recover_from_preorder(Traversal) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec recover_from_preorder(traversal :: String.t) :: TreeNode.t | nil + def recover_from_preorder(traversal) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? recoverFromPreorder(String traversal) { + + } +}", +1297,divisor-game,Divisor Game,1025.0,1086.0,"

Alice and Bob take turns playing a game, with Alice starting first.

+ +

Initially, there is a number n on the chalkboard. On each player's turn, that player makes a move consisting of:

+ +
    +
  • Choosing any x with 0 < x < n and n % x == 0.
    • +
  • Replacing the number n on the chalkboard with n - x.
    • +
+ +

Also, if a player cannot make a move, they lose the game.

+ +

Return true if and only if Alice wins the game, assuming both players play optimally.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: true
+Explanation: Alice chooses 1, and Bob has no more moves.
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: false
+Explanation: Alice chooses 1, Bob chooses 1, and Alice has no more moves.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",1.0,False,"class Solution { +public: + bool divisorGame(int n) { + + } +};","class Solution { + public boolean divisorGame(int n) { + + } +}","class Solution(object): + def divisorGame(self, n): + """""" + :type n: int + :rtype: bool + """""" + ","class Solution: + def divisorGame(self, n: int) -> bool: + ","bool divisorGame(int n){ + +}","public class Solution { + public bool DivisorGame(int n) { + + } +}","/** + * @param {number} n + * @return {boolean} + */ +var divisorGame = function(n) { + +};","# @param {Integer} n +# @return {Boolean} +def divisor_game(n) + +end","class Solution { + func divisorGame(_ n: Int) -> Bool { + + } +}","func divisorGame(n int) bool { + +}","object Solution { + def divisorGame(n: Int): Boolean = { + + } +}","class Solution { + fun divisorGame(n: Int): Boolean { + + } +}","impl Solution { + pub fn divisor_game(n: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Boolean + */ + function divisorGame($n) { + + } +}","function divisorGame(n: number): boolean { + +};","(define/contract (divisor-game n) + (-> exact-integer? boolean?) + + )","-spec divisor_game(N :: integer()) -> boolean(). +divisor_game(N) -> + .","defmodule Solution do + @spec divisor_game(n :: integer) :: boolean + def divisor_game(n) do + + end +end","class Solution { + bool divisorGame(int n) { + + } +}", +1303,next-greater-node-in-linked-list,Next Greater Node In Linked List,1019.0,1072.0,"

You are given the head of a linked list with n nodes.

+ +

For each node in the list, find the value of the next greater node. That is, for each node, find the value of the first node that is next to it and has a strictly larger value than it.

+ +

Return an integer array answer where answer[i] is the value of the next greater node of the ith node (1-indexed). If the ith node does not have a next greater node, set answer[i] = 0.

+ +

 

+

Example 1:

+ +
+Input: head = [2,1,5]
+Output: [5,5,0]
+
+ +

Example 2:

+ +
+Input: head = [2,7,4,3,5]
+Output: [7,0,5,5,0]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is n.
    • +
  • 1 <= n <= 104
    • +
  • 1 <= Node.val <= 109
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + vector nextLargerNodes(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public int[] nextLargerNodes(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def nextLargerNodes(self, head): + """""" + :type head: ListNode + :rtype: List[int] + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def nextLargerNodes(self, head: Optional[ListNode]) -> List[int]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* nextLargerNodes(struct ListNode* head, int* returnSize){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public int[] NextLargerNodes(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {number[]} + */ +var nextLargerNodes = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {Integer[]} +def next_larger_nodes(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func nextLargerNodes(_ head: ListNode?) -> [Int] { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func nextLargerNodes(head *ListNode) []int { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def nextLargerNodes(head: ListNode): Array[Int] = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun nextLargerNodes(head: ListNode?): IntArray { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn next_larger_nodes(head: Option>) -> Vec { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return Integer[] + */ + function nextLargerNodes($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function nextLargerNodes(head: ListNode | null): number[] { + +};",,"%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec next_larger_nodes(Head :: #list_node{} | null) -> [integer()]. +next_larger_nodes(Head) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec next_larger_nodes(head :: ListNode.t | nil) :: [integer] + def next_larger_nodes(head) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + List nextLargerNodes(ListNode? head) { + + } +}", +1306,binary-string-with-substrings-representing-1-to-n,Binary String With Substrings Representing 1 To N,1016.0,1065.0,"

Given a binary string s and a positive integer n, return true if the binary representation of all the integers in the range [1, n] are substrings of s, or false otherwise.

+ +

A substring is a contiguous sequence of characters within a string.

+ +

 

+

Example 1:

+
Input: s = ""0110"", n = 3
+Output: true
+

Example 2:

+
Input: s = ""0110"", n = 4
+Output: false
+
+

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s[i] is either '0' or '1'.
    • +
  • 1 <= n <= 109
    • +
+",2.0,False,"class Solution { +public: + bool queryString(string s, int n) { + + } +};","class Solution { + public boolean queryString(String s, int n) { + + } +}","class Solution(object): + def queryString(self, s, n): + """""" + :type s: str + :type n: int + :rtype: bool + """""" + ","class Solution: + def queryString(self, s: str, n: int) -> bool: + ","bool queryString(char * s, int n){ + +}","public class Solution { + public bool QueryString(string s, int n) { + + } +}","/** + * @param {string} s + * @param {number} n + * @return {boolean} + */ +var queryString = function(s, n) { + +};","# @param {String} s +# @param {Integer} n +# @return {Boolean} +def query_string(s, n) + +end","class Solution { + func queryString(_ s: String, _ n: Int) -> Bool { + + } +}","func queryString(s string, n int) bool { + +}","object Solution { + def queryString(s: String, n: Int): Boolean = { + + } +}","class Solution { + fun queryString(s: String, n: Int): Boolean { + + } +}","impl Solution { + pub fn query_string(s: String, n: i32) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $n + * @return Boolean + */ + function queryString($s, $n) { + + } +}","function queryString(s: string, n: number): boolean { + +};","(define/contract (query-string s n) + (-> string? exact-integer? boolean?) + + )","-spec query_string(S :: unicode:unicode_binary(), N :: integer()) -> boolean(). +query_string(S, N) -> + .","defmodule Solution do + @spec query_string(s :: String.t, n :: integer) :: boolean + def query_string(s, n) do + + end +end","class Solution { + bool queryString(String s, int n) { + + } +}", +1307,smallest-integer-divisible-by-k,Smallest Integer Divisible by K,1015.0,1064.0,"

Given a positive integer k, you need to find the length of the smallest positive integer n such that n is divisible by k, and n only contains the digit 1.

+ +

Return the length of n. If there is no such n, return -1.

+ +

Note: n may not fit in a 64-bit signed integer.

+ +

 

+

Example 1:

+ +
+Input: k = 1
+Output: 1
+Explanation: The smallest answer is n = 1, which has length 1.
+
+ +

Example 2:

+ +
+Input: k = 2
+Output: -1
+Explanation: There is no such positive integer n divisible by 2.
+
+ +

Example 3:

+ +
+Input: k = 3
+Output: 3
+Explanation: The smallest answer is n = 111, which has length 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 105
    • +
+",2.0,False,"class Solution { +public: + int smallestRepunitDivByK(int k) { + + } +};","class Solution { + public int smallestRepunitDivByK(int k) { + + } +}","class Solution(object): + def smallestRepunitDivByK(self, k): + """""" + :type k: int + :rtype: int + """""" + ","class Solution: + def smallestRepunitDivByK(self, k: int) -> int: + ","int smallestRepunitDivByK(int k){ + +}","public class Solution { + public int SmallestRepunitDivByK(int k) { + + } +}","/** + * @param {number} k + * @return {number} + */ +var smallestRepunitDivByK = function(k) { + +};","# @param {Integer} k +# @return {Integer} +def smallest_repunit_div_by_k(k) + +end","class Solution { + func smallestRepunitDivByK(_ k: Int) -> Int { + + } +}","func smallestRepunitDivByK(k int) int { + +}","object Solution { + def smallestRepunitDivByK(k: Int): Int = { + + } +}","class Solution { + fun smallestRepunitDivByK(k: Int): Int { + + } +}","impl Solution { + pub fn smallest_repunit_div_by_k(k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @return Integer + */ + function smallestRepunitDivByK($k) { + + } +}","function smallestRepunitDivByK(k: number): number { + +};","(define/contract (smallest-repunit-div-by-k k) + (-> exact-integer? exact-integer?) + + )","-spec smallest_repunit_div_by_k(K :: integer()) -> integer(). +smallest_repunit_div_by_k(K) -> + .","defmodule Solution do + @spec smallest_repunit_div_by_k(k :: integer) :: integer + def smallest_repunit_div_by_k(k) do + + end +end","class Solution { + int smallestRepunitDivByK(int k) { + + } +}", +1308,best-sightseeing-pair,Best Sightseeing Pair,1014.0,1063.0,"

You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

+ +

The score of a pair (i < j) of sightseeing spots is values[i] + values[j] + i - j: the sum of the values of the sightseeing spots, minus the distance between them.

+ +

Return the maximum score of a pair of sightseeing spots.

+ +

 

+

Example 1:

+ +
+Input: values = [8,1,5,2,6]
+Output: 11
+Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11
+
+ +

Example 2:

+ +
+Input: values = [1,2]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= values.length <= 5 * 104
    • +
  • 1 <= values[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int maxScoreSightseeingPair(vector& values) { + + } +};","class Solution { + public int maxScoreSightseeingPair(int[] values) { + + } +}","class Solution(object): + def maxScoreSightseeingPair(self, values): + """""" + :type values: List[int] + :rtype: int + """""" + ","class Solution: + def maxScoreSightseeingPair(self, values: List[int]) -> int: + ","int maxScoreSightseeingPair(int* values, int valuesSize){ + +}","public class Solution { + public int MaxScoreSightseeingPair(int[] values) { + + } +}","/** + * @param {number[]} values + * @return {number} + */ +var maxScoreSightseeingPair = function(values) { + +};","# @param {Integer[]} values +# @return {Integer} +def max_score_sightseeing_pair(values) + +end","class Solution { + func maxScoreSightseeingPair(_ values: [Int]) -> Int { + + } +}","func maxScoreSightseeingPair(values []int) int { + +}","object Solution { + def maxScoreSightseeingPair(values: Array[Int]): Int = { + + } +}","class Solution { + fun maxScoreSightseeingPair(values: IntArray): Int { + + } +}","impl Solution { + pub fn max_score_sightseeing_pair(values: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $values + * @return Integer + */ + function maxScoreSightseeingPair($values) { + + } +}","function maxScoreSightseeingPair(values: number[]): number { + +};","(define/contract (max-score-sightseeing-pair values) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_score_sightseeing_pair(Values :: [integer()]) -> integer(). +max_score_sightseeing_pair(Values) -> + .","defmodule Solution do + @spec max_score_sightseeing_pair(values :: [integer]) :: integer + def max_score_sightseeing_pair(values) do + + end +end","class Solution { + int maxScoreSightseeingPair(List values) { + + } +}", +1310,lexicographically-smallest-equivalent-string,Lexicographically Smallest Equivalent String,1061.0,1058.0,"

You are given two strings of the same length s1 and s2 and a string baseStr.

+ +

We say s1[i] and s2[i] are equivalent characters.

+ +
    +
  • For example, if s1 = "abc" and s2 = "cde", then we have 'a' == 'c', 'b' == 'd', and 'c' == 'e'.
    • +
+ +

Equivalent characters follow the usual rules of any equivalence relation:

+ +
    +
  • Reflexivity: 'a' == 'a'.
    • +
  • Symmetry: 'a' == 'b' implies 'b' == 'a'.
    • +
  • Transitivity: 'a' == 'b' and 'b' == 'c' implies 'a' == 'c'.
    • +
+ +

For example, given the equivalency information from s1 = "abc" and s2 = "cde", "acd" and "aab" are equivalent strings of baseStr = "eed", and "aab" is the lexicographically smallest equivalent string of baseStr.

+ +

Return the lexicographically smallest equivalent string of baseStr by using the equivalency information from s1 and s2.

+ +

 

+

Example 1:

+ +
+Input: s1 = "parker", s2 = "morris", baseStr = "parser"
+Output: "makkek"
+Explanation: Based on the equivalency information in s1 and s2, we can group their characters as [m,p], [a,o], [k,r,s], [e,i].
+The characters in each group are equivalent and sorted in lexicographical order.
+So the answer is "makkek".
+
+ +

Example 2:

+ +
+Input: s1 = "hello", s2 = "world", baseStr = "hold"
+Output: "hdld"
+Explanation: Based on the equivalency information in s1 and s2, we can group their characters as [h,w], [d,e,o], [l,r].
+So only the second letter 'o' in baseStr is changed to 'd', the answer is "hdld".
+
+ +

Example 3:

+ +
+Input: s1 = "leetcode", s2 = "programs", baseStr = "sourcecode"
+Output: "aauaaaaada"
+Explanation: We group the equivalent characters in s1 and s2 as [a,o,e,r,s,c], [l,p], [g,t] and [d,m], thus all letters in baseStr except 'u' and 'd' are transformed to 'a', the answer is "aauaaaaada".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length, baseStr <= 1000
    • +
  • s1.length == s2.length
    • +
  • s1, s2, and baseStr consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string smallestEquivalentString(string s1, string s2, string baseStr) { + + } +};","class Solution { + public String smallestEquivalentString(String s1, String s2, String baseStr) { + + } +}","class Solution(object): + def smallestEquivalentString(self, s1, s2, baseStr): + """""" + :type s1: str + :type s2: str + :type baseStr: str + :rtype: str + """""" + ","class Solution: + def smallestEquivalentString(self, s1: str, s2: str, baseStr: str) -> str: + ","char * smallestEquivalentString(char * s1, char * s2, char * baseStr){ + +}","public class Solution { + public string SmallestEquivalentString(string s1, string s2, string baseStr) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @param {string} baseStr + * @return {string} + */ +var smallestEquivalentString = function(s1, s2, baseStr) { + +};","# @param {String} s1 +# @param {String} s2 +# @param {String} base_str +# @return {String} +def smallest_equivalent_string(s1, s2, base_str) + +end","class Solution { + func smallestEquivalentString(_ s1: String, _ s2: String, _ baseStr: String) -> String { + + } +}","func smallestEquivalentString(s1 string, s2 string, baseStr string) string { + +}","object Solution { + def smallestEquivalentString(s1: String, s2: String, baseStr: String): String = { + + } +}","class Solution { + fun smallestEquivalentString(s1: String, s2: String, baseStr: String): String { + + } +}","impl Solution { + pub fn smallest_equivalent_string(s1: String, s2: String, base_str: String) -> String { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @param String $baseStr + * @return String + */ + function smallestEquivalentString($s1, $s2, $baseStr) { + + } +}","function smallestEquivalentString(s1: string, s2: string, baseStr: string): string { + +};","(define/contract (smallest-equivalent-string s1 s2 baseStr) + (-> string? string? string? string?) + + )","-spec smallest_equivalent_string(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary(), BaseStr :: unicode:unicode_binary()) -> unicode:unicode_binary(). +smallest_equivalent_string(S1, S2, BaseStr) -> + .","defmodule Solution do + @spec smallest_equivalent_string(s1 :: String.t, s2 :: String.t, base_str :: String.t) :: String.t + def smallest_equivalent_string(s1, s2, base_str) do + + end +end","class Solution { + String smallestEquivalentString(String s1, String s2, String baseStr) { + + } +}", +1311,numbers-with-repeated-digits,Numbers With Repeated Digits,1012.0,1057.0,"

Given an integer n, return the number of positive integers in the range [1, n] that have at least one repeated digit.

+ +

 

+

Example 1:

+ +
+Input: n = 20
+Output: 1
+Explanation: The only positive number (<= 20) with at least 1 repeated digit is 11.
+
+ +

Example 2:

+ +
+Input: n = 100
+Output: 10
+Explanation: The positive numbers (<= 100) with atleast 1 repeated digit are 11, 22, 33, 44, 55, 66, 77, 88, 99, and 100.
+
+ +

Example 3:

+ +
+Input: n = 1000
+Output: 262
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int numDupDigitsAtMostN(int n) { + + } +};","class Solution { + public int numDupDigitsAtMostN(int n) { + + } +}","class Solution(object): + def numDupDigitsAtMostN(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numDupDigitsAtMostN(self, n: int) -> int: + ","int numDupDigitsAtMostN(int n){ + +}","public class Solution { + public int NumDupDigitsAtMostN(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numDupDigitsAtMostN = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def num_dup_digits_at_most_n(n) + +end","class Solution { + func numDupDigitsAtMostN(_ n: Int) -> Int { + + } +}","func numDupDigitsAtMostN(n int) int { + +}","object Solution { + def numDupDigitsAtMostN(n: Int): Int = { + + } +}","class Solution { + fun numDupDigitsAtMostN(n: Int): Int { + + } +}","impl Solution { + pub fn num_dup_digits_at_most_n(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numDupDigitsAtMostN($n) { + + } +}","function numDupDigitsAtMostN(n: number): number { + +};","(define/contract (num-dup-digits-at-most-n n) + (-> exact-integer? exact-integer?) + + )","-spec num_dup_digits_at_most_n(N :: integer()) -> integer(). +num_dup_digits_at_most_n(N) -> + .","defmodule Solution do + @spec num_dup_digits_at_most_n(n :: integer) :: integer + def num_dup_digits_at_most_n(n) do + + end +end","class Solution { + int numDupDigitsAtMostN(int n) { + + } +}", +1314,complement-of-base-10-integer,Complement of Base 10 Integer,1009.0,1054.0,"

The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.

+ +
    +
  • For example, The integer 5 is "101" in binary and its complement is "010" which is the integer 2.
    • +
+ +

Given an integer n, return its complement.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 2
+Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.
+
+ +

Example 2:

+ +
+Input: n = 7
+Output: 0
+Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.
+
+ +

Example 3:

+ +
+Input: n = 10
+Output: 5
+Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n < 109
    • +
+ +

 

+

Note: This question is the same as 476: https://leetcode.com/problems/number-complement/

+",1.0,False,"class Solution { +public: + int bitwiseComplement(int n) { + + } +};","class Solution { + public int bitwiseComplement(int n) { + + } +}","class Solution(object): + def bitwiseComplement(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def bitwiseComplement(self, n: int) -> int: + ","int bitwiseComplement(int n){ + +}","public class Solution { + public int BitwiseComplement(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var bitwiseComplement = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def bitwise_complement(n) + +end","class Solution { + func bitwiseComplement(_ n: Int) -> Int { + + } +}","func bitwiseComplement(n int) int { + +}","object Solution { + def bitwiseComplement(n: Int): Int = { + + } +}","class Solution { + fun bitwiseComplement(n: Int): Int { + + } +}","impl Solution { + pub fn bitwise_complement(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function bitwiseComplement($n) { + + } +}","function bitwiseComplement(n: number): number { + +};","(define/contract (bitwise-complement n) + (-> exact-integer? exact-integer?) + + )","-spec bitwise_complement(N :: integer()) -> integer(). +bitwise_complement(N) -> + .","defmodule Solution do + @spec bitwise_complement(n :: integer) :: integer + def bitwise_complement(n) do + + end +end","class Solution { + int bitwiseComplement(int n) { + + } +}", +1315,construct-binary-search-tree-from-preorder-traversal,Construct Binary Search Tree from Preorder Traversal,1008.0,1050.0,"

Given an array of integers preorder, which represents the preorder traversal of a BST (i.e., binary search tree), construct the tree and return its root.

+ +

It is guaranteed that there is always possible to find a binary search tree with the given requirements for the given test cases.

+ +

A binary search tree is a binary tree where for every node, any descendant of Node.left has a value strictly less than Node.val, and any descendant of Node.right has a value strictly greater than Node.val.

+ +

A preorder traversal of a binary tree displays the value of the node first, then traverses Node.left, then traverses Node.right.

+ +

 

+

Example 1:

+ +
+Input: preorder = [8,5,1,7,10,12]
+Output: [8,5,10,1,7,null,12]
+
+ +

Example 2:

+ +
+Input: preorder = [1,3]
+Output: [1,null,3]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= preorder.length <= 100
    • +
  • 1 <= preorder[i] <= 1000
    • +
  • All the values of preorder are unique.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* bstFromPreorder(vector& preorder) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode bstFromPreorder(int[] preorder) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def bstFromPreorder(self, preorder): + """""" + :type preorder: List[int] + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def bstFromPreorder(self, preorder: List[int]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* bstFromPreorder(int* preorder, int preorderSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode BstFromPreorder(int[] preorder) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {number[]} preorder + * @return {TreeNode} + */ +var bstFromPreorder = function(preorder) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {Integer[]} preorder +# @return {TreeNode} +def bst_from_preorder(preorder) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func bstFromPreorder(_ preorder: [Int]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func bstFromPreorder(preorder []int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def bstFromPreorder(preorder: Array[Int]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun bstFromPreorder(preorder: IntArray): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn bst_from_preorder(preorder: Vec) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param Integer[] $preorder + * @return TreeNode + */ + function bstFromPreorder($preorder) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function bstFromPreorder(preorder: number[]): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (bst-from-preorder preorder) + (-> (listof exact-integer?) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec bst_from_preorder(Preorder :: [integer()]) -> #tree_node{} | null. +bst_from_preorder(Preorder) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec bst_from_preorder(preorder :: [integer]) :: TreeNode.t | nil + def bst_from_preorder(preorder) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? bstFromPreorder(List preorder) { + + } +}", +1317,clumsy-factorial,Clumsy Factorial,1006.0,1048.0,"

The factorial of a positive integer n is the product of all positive integers less than or equal to n.

+ +
    +
  • For example, factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1.
    • +
+ +

We make a clumsy factorial using the integers in decreasing order by swapping out the multiply operations for a fixed rotation of operations with multiply '*', divide '/', add '+', and subtract '-' in this order.

+ +
    +
  • For example, clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1.
    • +
+ +

However, these operations are still applied using the usual order of operations of arithmetic. We do all multiplication and division steps before any addition or subtraction steps, and multiplication and division steps are processed left to right.

+ +

Additionally, the division that we use is floor division such that 10 * 9 / 8 = 90 / 8 = 11.

+ +

Given an integer n, return the clumsy factorial of n.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 7
+Explanation: 7 = 4 * 3 / 2 + 1
+
+ +

Example 2:

+ +
+Input: n = 10
+Output: 12
+Explanation: 12 = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",2.0,False,"class Solution { +public: + int clumsy(int n) { + + } +};","class Solution { + public int clumsy(int n) { + + } +}","class Solution(object): + def clumsy(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def clumsy(self, n: int) -> int: + ","int clumsy(int n){ + +}","public class Solution { + public int Clumsy(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var clumsy = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def clumsy(n) + +end","class Solution { + func clumsy(_ n: Int) -> Int { + + } +}","func clumsy(n int) int { + +}","object Solution { + def clumsy(n: Int): Int = { + + } +}","class Solution { + fun clumsy(n: Int): Int { + + } +}","impl Solution { + pub fn clumsy(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function clumsy($n) { + + } +}","function clumsy(n: number): number { + +};","(define/contract (clumsy n) + (-> exact-integer? exact-integer?) + + )","-spec clumsy(N :: integer()) -> integer(). +clumsy(N) -> + .","defmodule Solution do + @spec clumsy(n :: integer) :: integer + def clumsy(n) do + + end +end","class Solution { + int clumsy(int n) { + + } +}", +1320,check-if-word-is-valid-after-substitutions,Check If Word Is Valid After Substitutions,1003.0,1045.0,"

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 the following operation any number of times:

+ +
    +
  • Insert string "abc" into any position in t. More formally, t becomes tleft + "abc" + tright, where t == tleft + tright. Note that tleft and tright may be empty.
    • +
+ +

Return true if s is a valid string, otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: s = "aabcbc"
+Output: true
+Explanation:
+"" -> "abc" -> "aabcbc"
+Thus, "aabcbc" is valid.
+ +

Example 2:

+ +
+Input: s = "abcabcababcc"
+Output: true
+Explanation:
+"" -> "abc" -> "abcabc" -> "abcabcabc" -> "abcabcababcc"
+Thus, "abcabcababcc" is valid.
+
+ +

Example 3:

+ +
+Input: s = "abccba"
+Output: false
+Explanation: It is impossible to get "abccba" using the operation.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2 * 104
    • +
  • s consists of letters 'a', 'b', and 'c'
    • +
+",2.0,False,"class Solution { +public: + bool isValid(string s) { + + } +};","class Solution { + public boolean isValid(String s) { + + } +}","class Solution(object): + def isValid(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def isValid(self, s: str) -> bool: + ","bool isValid(char * s){ + +}","public class Solution { + public bool IsValid(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var isValid = function(s) { + +};","# @param {String} s +# @return {Boolean} +def is_valid(s) + +end","class Solution { + func isValid(_ s: String) -> Bool { + + } +}","func isValid(s string) bool { + +}","object Solution { + def isValid(s: String): Boolean = { + + } +}","class Solution { + fun isValid(s: String): Boolean { + + } +}","impl Solution { + pub fn is_valid(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function isValid($s) { + + } +}","function isValid(s: string): boolean { + +};","(define/contract (is-valid s) + (-> string? boolean?) + + )","-spec is_valid(S :: unicode:unicode_binary()) -> boolean(). +is_valid(S) -> + .","defmodule Solution do + @spec is_valid(s :: String.t) :: boolean + def is_valid(s) do + + end +end","class Solution { + bool isValid(String s) { + + } +}", +1322,grid-illumination,Grid Illumination,1001.0,1043.0,"

There is a 2D grid of size n x n where each cell of this grid has a lamp that is initially turned off.

+ +

You are given a 2D array of lamp positions lamps, where lamps[i] = [rowi, coli] indicates that the lamp at grid[rowi][coli] is turned on. Even if the same lamp is listed more than once, it is turned on.

+ +

When a lamp is turned on, it illuminates its cell and all other cells in the same row, column, or diagonal.

+ +

You are also given another 2D array queries, where queries[j] = [rowj, colj]. For the jth query, determine whether grid[rowj][colj] is illuminated or not. After answering the jth query, turn off the lamp at grid[rowj][colj] and its 8 adjacent lamps if they exist. A lamp is adjacent if its cell shares either a side or corner with grid[rowj][colj].

+ +

Return an array of integers ans, where ans[j] should be 1 if the cell in the jth query was illuminated, or 0 if the lamp was not.

+ +

 

+

Example 1:

+ +
+Input: n = 5, lamps = [[0,0],[4,4]], queries = [[1,1],[1,0]]
+Output: [1,0]
+Explanation: We have the initial grid with all lamps turned off. In the above picture we see the grid after turning on the lamp at grid[0][0] then turning on the lamp at grid[4][4].
+The 0th query asks if the lamp at grid[1][1] is illuminated or not (the blue square). It is illuminated, so set ans[0] = 1. Then, we turn off all lamps in the red square.
+
+The 1st query asks if the lamp at grid[1][0] is illuminated or not (the blue square). It is not illuminated, so set ans[1] = 0. Then, we turn off all lamps in the red rectangle.
+
+
+ +

Example 2:

+ +
+Input: n = 5, lamps = [[0,0],[4,4]], queries = [[1,1],[1,1]]
+Output: [1,1]
+
+ +

Example 3:

+ +
+Input: n = 5, lamps = [[0,0],[0,4]], queries = [[0,4],[0,1],[1,4]]
+Output: [1,1,0]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
  • 0 <= lamps.length <= 20000
    • +
  • 0 <= queries.length <= 20000
    • +
  • lamps[i].length == 2
    • +
  • 0 <= rowi, coli < n
    • +
  • queries[j].length == 2
    • +
  • 0 <= rowj, colj < n
    • +
+",3.0,False,"class Solution { +public: + vector gridIllumination(int n, vector>& lamps, vector>& queries) { + + } +};","class Solution { + public int[] gridIllumination(int n, int[][] lamps, int[][] queries) { + + } +}","class Solution(object): + def gridIllumination(self, n, lamps, queries): + """""" + :type n: int + :type lamps: List[List[int]] + :type queries: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def gridIllumination(self, n: int, lamps: List[List[int]], queries: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* gridIllumination(int n, int** lamps, int lampsSize, int* lampsColSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public int[] GridIllumination(int n, int[][] lamps, int[][] queries) { + + } +}","/** + * @param {number} n + * @param {number[][]} lamps + * @param {number[][]} queries + * @return {number[]} + */ +var gridIllumination = function(n, lamps, queries) { + +};","# @param {Integer} n +# @param {Integer[][]} lamps +# @param {Integer[][]} queries +# @return {Integer[]} +def grid_illumination(n, lamps, queries) + +end","class Solution { + func gridIllumination(_ n: Int, _ lamps: [[Int]], _ queries: [[Int]]) -> [Int] { + + } +}","func gridIllumination(n int, lamps [][]int, queries [][]int) []int { + +}","object Solution { + def gridIllumination(n: Int, lamps: Array[Array[Int]], queries: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun gridIllumination(n: Int, lamps: Array, queries: Array): IntArray { + + } +}","impl Solution { + pub fn grid_illumination(n: i32, lamps: Vec>, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $lamps + * @param Integer[][] $queries + * @return Integer[] + */ + function gridIllumination($n, $lamps, $queries) { + + } +}","function gridIllumination(n: number, lamps: number[][], queries: number[][]): number[] { + +};","(define/contract (grid-illumination n lamps queries) + (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec grid_illumination(N :: integer(), Lamps :: [[integer()]], Queries :: [[integer()]]) -> [integer()]. +grid_illumination(N, Lamps, Queries) -> + .","defmodule Solution do + @spec grid_illumination(n :: integer, lamps :: [[integer]], queries :: [[integer]]) :: [integer] + def grid_illumination(n, lamps, queries) do + + end +end","class Solution { + List gridIllumination(int n, List> lamps, List> queries) { + + } +}", +1323,minimum-cost-to-merge-stones,Minimum Cost to Merge Stones,1000.0,1042.0,"

There are n piles of stones arranged in a row. The ith pile has stones[i] stones.

+ +

A move consists of merging exactly k consecutive piles into one pile, and the cost of this move is equal to the total number of stones in these k piles.

+ +

Return the minimum cost to merge all piles of stones into one pile. If it is impossible, return -1.

+ +

 

+

Example 1:

+ +
+Input: stones = [3,2,4,1], k = 2
+Output: 20
+Explanation: We start with [3, 2, 4, 1].
+We merge [3, 2] for a cost of 5, and we are left with [5, 4, 1].
+We merge [4, 1] for a cost of 5, and we are left with [5, 5].
+We merge [5, 5] for a cost of 10, and we are left with [10].
+The total cost was 20, and this is the minimum possible.
+
+ +

Example 2:

+ +
+Input: stones = [3,2,4,1], k = 3
+Output: -1
+Explanation: After any merge operation, there are 2 piles left, and we can't merge anymore.  So the task is impossible.
+
+ +

Example 3:

+ +
+Input: stones = [3,5,1,2,6], k = 3
+Output: 25
+Explanation: We start with [3, 5, 1, 2, 6].
+We merge [5, 1, 2] for a cost of 8, and we are left with [3, 8, 6].
+We merge [3, 8, 6] for a cost of 17, and we are left with [17].
+The total cost was 25, and this is the minimum possible.
+
+ +

 

+

Constraints:

+ +
    +
  • n == stones.length
    • +
  • 1 <= n <= 30
    • +
  • 1 <= stones[i] <= 100
    • +
  • 2 <= k <= 30
    • +
+",3.0,False,"class Solution { +public: + int mergeStones(vector& stones, int k) { + + } +};","class Solution { + public int mergeStones(int[] stones, int k) { + + } +}","class Solution(object): + def mergeStones(self, stones, k): + """""" + :type stones: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def mergeStones(self, stones: List[int], k: int) -> int: + ","int mergeStones(int* stones, int stonesSize, int k){ + +}","public class Solution { + public int MergeStones(int[] stones, int k) { + + } +}","/** + * @param {number[]} stones + * @param {number} k + * @return {number} + */ +var mergeStones = function(stones, k) { + +};","# @param {Integer[]} stones +# @param {Integer} k +# @return {Integer} +def merge_stones(stones, k) + +end","class Solution { + func mergeStones(_ stones: [Int], _ k: Int) -> Int { + + } +}","func mergeStones(stones []int, k int) int { + +}","object Solution { + def mergeStones(stones: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun mergeStones(stones: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn merge_stones(stones: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $stones + * @param Integer $k + * @return Integer + */ + function mergeStones($stones, $k) { + + } +}","function mergeStones(stones: number[], k: number): number { + +};","(define/contract (merge-stones stones k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec merge_stones(Stones :: [integer()], K :: integer()) -> integer(). +merge_stones(Stones, K) -> + .","defmodule Solution do + @spec merge_stones(stones :: [integer], k :: integer) :: integer + def merge_stones(stones, k) do + + end +end","class Solution { + int mergeStones(List stones, int k) { + + } +}", +1327,number-of-squareful-arrays,Number of Squareful Arrays,996.0,1038.0,"

An array is squareful if the sum of every pair of adjacent elements is a perfect square.

+ +

Given an integer array nums, return the number of permutations of nums that are squareful.

+ +

Two permutations perm1 and perm2 are different if there is some index i such that perm1[i] != perm2[i].

+ +

 

+

Example 1:

+ +
+Input: nums = [1,17,8]
+Output: 2
+Explanation: [1,8,17] and [17,8,1] are the valid permutations.
+
+ +

Example 2:

+ +
+Input: nums = [2,2,2]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 12
    • +
  • 0 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int numSquarefulPerms(vector& nums) { + + } +};","class Solution { + public int numSquarefulPerms(int[] nums) { + + } +}","class Solution(object): + def numSquarefulPerms(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numSquarefulPerms(self, nums: List[int]) -> int: + ","int numSquarefulPerms(int* nums, int numsSize){ + +}","public class Solution { + public int NumSquarefulPerms(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numSquarefulPerms = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def num_squareful_perms(nums) + +end","class Solution { + func numSquarefulPerms(_ nums: [Int]) -> Int { + + } +}","func numSquarefulPerms(nums []int) int { + +}","object Solution { + def numSquarefulPerms(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numSquarefulPerms(nums: IntArray): Int { + + } +}","impl Solution { + pub fn num_squareful_perms(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numSquarefulPerms($nums) { + + } +}","function numSquarefulPerms(nums: number[]): number { + +};","(define/contract (num-squareful-perms nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec num_squareful_perms(Nums :: [integer()]) -> integer(). +num_squareful_perms(Nums) -> + .","defmodule Solution do + @spec num_squareful_perms(nums :: [integer]) :: integer + def num_squareful_perms(nums) do + + end +end","class Solution { + int numSquarefulPerms(List nums) { + + } +}", +1328,minimum-number-of-k-consecutive-bit-flips,Minimum Number of K Consecutive Bit Flips,995.0,1037.0,"

You are given a binary array nums and an integer k.

+ +

A k-bit flip is choosing a subarray of length k from nums and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.

+ +

Return the minimum number of k-bit flips required so that there is no 0 in the array. If it is not possible, return -1.

+ +

A subarray is a contiguous part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1,0], k = 1
+Output: 2
+Explanation: Flip nums[0], then flip nums[2].
+
+ +

Example 2:

+ +
+Input: nums = [1,1,0], k = 2
+Output: -1
+Explanation: No matter how we flip subarrays of size 2, we cannot make the array become [1,1,1].
+
+ +

Example 3:

+ +
+Input: nums = [0,0,0,1,0,1,1,0], k = 3
+Output: 3
+Explanation: 
+Flip nums[0],nums[1],nums[2]: nums becomes [1,1,1,1,0,1,1,0]
+Flip nums[4],nums[5],nums[6]: nums becomes [1,1,1,1,1,0,0,0]
+Flip nums[5],nums[6],nums[7]: nums becomes [1,1,1,1,1,1,1,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= k <= nums.length
    • +
+",3.0,False,"class Solution { +public: + int minKBitFlips(vector& nums, int k) { + + } +};","class Solution { + public int minKBitFlips(int[] nums, int k) { + + } +}","class Solution(object): + def minKBitFlips(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def minKBitFlips(self, nums: List[int], k: int) -> int: + ","int minKBitFlips(int* nums, int numsSize, int k){ + +}","public class Solution { + public int MinKBitFlips(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var minKBitFlips = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def min_k_bit_flips(nums, k) + +end","class Solution { + func minKBitFlips(_ nums: [Int], _ k: Int) -> Int { + + } +}","func minKBitFlips(nums []int, k int) int { + +}","object Solution { + def minKBitFlips(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun minKBitFlips(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn min_k_bit_flips(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function minKBitFlips($nums, $k) { + + } +}","function minKBitFlips(nums: number[], k: number): number { + +};","(define/contract (min-k-bit-flips nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_k_bit_flips(Nums :: [integer()], K :: integer()) -> integer(). +min_k_bit_flips(Nums, K) -> + .","defmodule Solution do + @spec min_k_bit_flips(nums :: [integer], k :: integer) :: integer + def min_k_bit_flips(nums, k) do + + end +end","class Solution { + int minKBitFlips(List nums, int k) { + + } +}", +1330,cousins-in-binary-tree,Cousins in Binary Tree,993.0,1035.0,"

Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the values x and y in the tree are cousins, or false otherwise.

+ +

Two nodes of a binary tree are cousins if they have the same depth with different parents.

+ +

Note that in a binary tree, the root node is at the depth 0, and children of each depth k node are at the depth k + 1.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,4], x = 4, y = 3
+Output: false
+
+ +

Example 2:

+ +
+Input: root = [1,2,3,null,4,null,5], x = 5, y = 4
+Output: true
+
+ +

Example 3:

+ +
+Input: root = [1,2,3,null,4], x = 2, y = 3
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [2, 100].
    • +
  • 1 <= Node.val <= 100
    • +
  • Each node has a unique value.
    • +
  • x != y
    • +
  • x and y are exist in the tree.
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isCousins(TreeNode* root, int x, int y) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isCousins(TreeNode root, int x, int y) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isCousins(self, root, x, y): + """""" + :type root: TreeNode + :type x: int + :type y: int + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isCousins(self, root: Optional[TreeNode], x: int, y: int) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isCousins(struct TreeNode* root, int x, int y){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsCousins(TreeNode root, int x, int y) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} x + * @param {number} y + * @return {boolean} + */ +var isCousins = function(root, x, y) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} x +# @param {Integer} y +# @return {Boolean} +def is_cousins(root, x, y) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isCousins(_ root: TreeNode?, _ x: Int, _ y: Int) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isCousins(root *TreeNode, x int, y int) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isCousins(root: TreeNode, x: Int, y: Int): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isCousins(root: TreeNode?, x: Int, y: Int): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_cousins(root: Option>>, x: i32, y: i32) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $x + * @param Integer $y + * @return Boolean + */ + function isCousins($root, $x, $y) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isCousins(root: TreeNode | null, x: number, y: number): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-cousins root x y) + (-> (or/c tree-node? #f) exact-integer? exact-integer? boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_cousins(Root :: #tree_node{} | null, X :: integer(), Y :: integer()) -> boolean(). +is_cousins(Root, X, Y) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_cousins(root :: TreeNode.t | nil, x :: integer, y :: integer) :: boolean + def is_cousins(root, x, y) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isCousins(TreeNode? root, int x, int y) { + + } +}", +1331,subarrays-with-k-different-integers,Subarrays with K Different Integers,992.0,1034.0,"

Given an integer array nums and an integer k, return the number of good subarrays of nums.

+ +

A good array is an array where the number of different integers in that array is exactly k.

+ +
    +
  • For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3.
    • +
+ +

A subarray is a contiguous part of an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2,3], k = 2
+Output: 7
+Explanation: Subarrays formed with exactly 2 different integers: [1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2]
+
+ +

Example 2:

+ +
+Input: nums = [1,2,1,3,4], k = 3
+Output: 3
+Explanation: Subarrays formed with exactly 3 different integers: [1,2,1,3], [2,1,3], [1,3,4].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 104
    • +
  • 1 <= nums[i], k <= nums.length
    • +
+",3.0,False,"class Solution { +public: + int subarraysWithKDistinct(vector& nums, int k) { + + } +};","class Solution { + public int subarraysWithKDistinct(int[] nums, int k) { + + } +}","class Solution(object): + def subarraysWithKDistinct(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def subarraysWithKDistinct(self, nums: List[int], k: int) -> int: + ","int subarraysWithKDistinct(int* nums, int numsSize, int k){ + +}","public class Solution { + public int SubarraysWithKDistinct(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var subarraysWithKDistinct = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def subarrays_with_k_distinct(nums, k) + +end","class Solution { + func subarraysWithKDistinct(_ nums: [Int], _ k: Int) -> Int { + + } +}","func subarraysWithKDistinct(nums []int, k int) int { + +}","object Solution { + def subarraysWithKDistinct(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun subarraysWithKDistinct(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn subarrays_with_k_distinct(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function subarraysWithKDistinct($nums, $k) { + + } +}","function subarraysWithKDistinct(nums: number[], k: number): number { + +};","(define/contract (subarrays-with-k-distinct nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec subarrays_with_k_distinct(Nums :: [integer()], K :: integer()) -> integer(). +subarrays_with_k_distinct(Nums, K) -> + .","defmodule Solution do + @spec subarrays_with_k_distinct(nums :: [integer], k :: integer) :: integer + def subarrays_with_k_distinct(nums, k) do + + end +end","class Solution { + int subarraysWithKDistinct(List nums, int k) { + + } +}", +1336,vertical-order-traversal-of-a-binary-tree,Vertical Order Traversal of a Binary Tree,987.0,1029.0,"

Given the root of a binary tree, calculate the vertical order traversal of the binary tree.

+ +

For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectively. The root of the tree is at (0, 0).

+ +

The vertical order traversal of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.

+ +

Return the vertical order traversal of the binary tree.

+ +

 

+

Example 1:

+ +
+Input: root = [3,9,20,null,null,15,7]
+Output: [[9],[3,15],[20],[7]]
+Explanation:
+Column -1: Only node 9 is in this column.
+Column 0: Nodes 3 and 15 are in this column in that order from top to bottom.
+Column 1: Only node 20 is in this column.
+Column 2: Only node 7 is in this column.
+ +

Example 2:

+ +
+Input: root = [1,2,3,4,5,6,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+Column -2: Only node 4 is in this column.
+Column -1: Only node 2 is in this column.
+Column 0: Nodes 1, 5, and 6 are in this column.
+          1 is at the top, so it comes first.
+          5 and 6 are at the same position (2, 0), so we order them by their value, 5 before 6.
+Column 1: Only node 3 is in this column.
+Column 2: Only node 7 is in this column.
+
+ +

Example 3:

+ +
+Input: root = [1,2,3,4,6,5,7]
+Output: [[4],[2],[1,5,6],[3],[7]]
+Explanation:
+This case is the exact same as example 2, but with nodes 5 and 6 swapped.
+Note that the solution remains the same since 5 and 6 are in the same location and should be ordered by their values.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 1000].
    • +
  • 0 <= Node.val <= 1000
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector> verticalTraversal(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List> verticalTraversal(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def verticalTraversal(self, root): + """""" + :type root: TreeNode + :rtype: List[List[int]] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def verticalTraversal(self, root: Optional[TreeNode]) -> List[List[int]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** verticalTraversal(struct TreeNode* root, int* returnSize, int** returnColumnSizes){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList> VerticalTraversal(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number[][]} + */ +var verticalTraversal = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer[][]} +def vertical_traversal(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func verticalTraversal(_ root: TreeNode?) -> [[Int]] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func verticalTraversal(root *TreeNode) [][]int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def verticalTraversal(root: TreeNode): List[List[Int]] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun verticalTraversal(root: TreeNode?): List> { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn vertical_traversal(root: Option>>) -> Vec> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer[][] + */ + function verticalTraversal($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function verticalTraversal(root: TreeNode | null): number[][] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (vertical-traversal root) + (-> (or/c tree-node? #f) (listof (listof exact-integer?))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec vertical_traversal(Root :: #tree_node{} | null) -> [[integer()]]. +vertical_traversal(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec vertical_traversal(root :: TreeNode.t | nil) :: [[integer]] + def vertical_traversal(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List> verticalTraversal(TreeNode? root) { + + } +}", +1337,interval-list-intersections,Interval List Intersections,986.0,1028.0,"

You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of intervals is pairwise disjoint and in sorted order.

+ +

Return the intersection of these two interval lists.

+ +

A closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b.

+ +

The intersection of two closed intervals is a set of real numbers that are either empty or represented as a closed interval. For example, the intersection of [1, 3] and [2, 4] is [2, 3].

+ +

 

+

Example 1:

+ +
+Input: firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]]
+Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
+
+ +

Example 2:

+ +
+Input: firstList = [[1,3],[5,9]], secondList = []
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= firstList.length, secondList.length <= 1000
    • +
  • firstList.length + secondList.length >= 1
    • +
  • 0 <= starti < endi <= 109
    • +
  • endi < starti+1
    • +
  • 0 <= startj < endj <= 109
    • +
  • endj < startj+1
    • +
+",2.0,False,"class Solution { +public: + vector> intervalIntersection(vector>& firstList, vector>& secondList) { + + } +};","class Solution { + public int[][] intervalIntersection(int[][] firstList, int[][] secondList) { + + } +}","class Solution(object): + def intervalIntersection(self, firstList, secondList): + """""" + :type firstList: List[List[int]] + :type secondList: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def intervalIntersection(self, firstList: List[List[int]], secondList: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** intervalIntersection(int** firstList, int firstListSize, int* firstListColSize, int** secondList, int secondListSize, int* secondListColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] IntervalIntersection(int[][] firstList, int[][] secondList) { + + } +}","/** + * @param {number[][]} firstList + * @param {number[][]} secondList + * @return {number[][]} + */ +var intervalIntersection = function(firstList, secondList) { + +};","# @param {Integer[][]} first_list +# @param {Integer[][]} second_list +# @return {Integer[][]} +def interval_intersection(first_list, second_list) + +end","class Solution { + func intervalIntersection(_ firstList: [[Int]], _ secondList: [[Int]]) -> [[Int]] { + + } +}","func intervalIntersection(firstList [][]int, secondList [][]int) [][]int { + +}","object Solution { + def intervalIntersection(firstList: Array[Array[Int]], secondList: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun intervalIntersection(firstList: Array, secondList: Array): Array { + + } +}","impl Solution { + pub fn interval_intersection(first_list: Vec>, second_list: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $firstList + * @param Integer[][] $secondList + * @return Integer[][] + */ + function intervalIntersection($firstList, $secondList) { + + } +}","function intervalIntersection(firstList: number[][], secondList: number[][]): number[][] { + +};","(define/contract (interval-intersection firstList secondList) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec interval_intersection(FirstList :: [[integer()]], SecondList :: [[integer()]]) -> [[integer()]]. +interval_intersection(FirstList, SecondList) -> + .","defmodule Solution do + @spec interval_intersection(first_list :: [[integer]], second_list :: [[integer]]) :: [[integer]] + def interval_intersection(first_list, second_list) do + + end +end","class Solution { + List> intervalIntersection(List> firstList, List> secondList) { + + } +}", +1339,string-without-aaa-or-bbb,String Without AAA or BBB,984.0,1026.0,"

Given two integers a and b, return any string s such that:

+ +
    +
  • s has length a + b and contains exactly a 'a' letters, and exactly b 'b' letters,
    • +
  • The substring 'aaa' does not occur in s, and
    • +
  • The substring 'bbb' does not occur in s.
    • +
+ +

 

+

Example 1:

+ +
+Input: a = 1, b = 2
+Output: "abb"
+Explanation: "abb", "bab" and "bba" are all correct answers.
+
+ +

Example 2:

+ +
+Input: a = 4, b = 1
+Output: "aabaa"
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= a, b <= 100
    • +
  • It is guaranteed such an s exists for the given a and b.
    • +
+",2.0,False,"class Solution { +public: + string strWithout3a3b(int a, int b) { + + } +};","class Solution { + public String strWithout3a3b(int a, int b) { + + } +}","class Solution(object): + def strWithout3a3b(self, a, b): + """""" + :type a: int + :type b: int + :rtype: str + """""" + ","class Solution: + def strWithout3a3b(self, a: int, b: int) -> str: + "," + +char * strWithout3a3b(int a, int b){ + +}","public class Solution { + public string StrWithout3a3b(int a, int b) { + + } +}","/** + * @param {number} a + * @param {number} b + * @return {string} + */ +var strWithout3a3b = function(a, b) { + +};","# @param {Integer} a +# @param {Integer} b +# @return {String} +def str_without3a3b(a, b) + +end","class Solution { + func strWithout3a3b(_ a: Int, _ b: Int) -> String { + + } +}","func strWithout3a3b(a int, b int) string { + +}","object Solution { + def strWithout3a3b(a: Int, b: Int): String = { + + } +}","class Solution { + fun strWithout3a3b(a: Int, b: Int): String { + + } +}","impl Solution { + pub fn str_without3a3b(a: i32, b: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer $b + * @return String + */ + function strWithout3a3b($a, $b) { + + } +}","function strWithout3a3b(a: number, b: number): string { + +};",,,,, +1341,triples-with-bitwise-and-equal-to-zero,Triples with Bitwise AND Equal To Zero,982.0,1024.0,"

Given an integer array nums, return the number of AND triples.

+ +

An AND triple is a triple of indices (i, j, k) such that:

+ +
    +
  • 0 <= i < nums.length
    • +
  • 0 <= j < nums.length
    • +
  • 0 <= k < nums.length
    • +
  • nums[i] & nums[j] & nums[k] == 0, where & represents the bitwise-AND operator.
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,3]
+Output: 12
+Explanation: We could choose the following i, j, k triples:
+(i=0, j=0, k=1) : 2 & 2 & 1
+(i=0, j=1, k=0) : 2 & 1 & 2
+(i=0, j=1, k=1) : 2 & 1 & 1
+(i=0, j=1, k=2) : 2 & 1 & 3
+(i=0, j=2, k=1) : 2 & 3 & 1
+(i=1, j=0, k=0) : 1 & 2 & 2
+(i=1, j=0, k=1) : 1 & 2 & 1
+(i=1, j=0, k=2) : 1 & 2 & 3
+(i=1, j=1, k=0) : 1 & 1 & 2
+(i=1, j=2, k=0) : 1 & 3 & 2
+(i=2, j=0, k=1) : 3 & 2 & 1
+(i=2, j=1, k=0) : 3 & 1 & 2
+
+ +

Example 2:

+ +
+Input: nums = [0,0,0]
+Output: 27
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] < 216
    • +
+",3.0,False,"class Solution { +public: + int countTriplets(vector& nums) { + + } +};","class Solution { + public int countTriplets(int[] nums) { + + } +}","class Solution(object): + def countTriplets(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def countTriplets(self, nums: List[int]) -> int: + ","int countTriplets(int* nums, int numsSize){ + +}","public class Solution { + public int CountTriplets(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var countTriplets = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def count_triplets(nums) + +end","class Solution { + func countTriplets(_ nums: [Int]) -> Int { + + } +}","func countTriplets(nums []int) int { + +}","object Solution { + def countTriplets(nums: Array[Int]): Int = { + + } +}","class Solution { + fun countTriplets(nums: IntArray): Int { + + } +}","impl Solution { + pub fn count_triplets(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function countTriplets($nums) { + + } +}","function countTriplets(nums: number[]): number { + +};","(define/contract (count-triplets nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec count_triplets(Nums :: [integer()]) -> integer(). +count_triplets(Nums) -> + .","defmodule Solution do + @spec count_triplets(nums :: [integer]) :: integer + def count_triplets(nums) do + + end +end","class Solution { + int countTriplets(List nums) { + + } +}", +1342,time-based-key-value-store,Time Based Key-Value Store,981.0,1023.0,"

Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain timestamp.

+ +

Implement the TimeMap class:

+ +
    +
  • TimeMap() Initializes the object of the data structure.
    • +
  • void set(String key, String value, int timestamp) Stores the key key with the value value at the given time timestamp.
    • +
  • String get(String key, int timestamp) Returns a value such that set was called previously, with timestamp_prev <= timestamp. If there are multiple such values, it returns the value associated with the largest timestamp_prev. If there are no values, it returns "".
    • +
+ +

 

+

Example 1:

+ +
+Input
+["TimeMap", "set", "get", "get", "set", "get", "get"]
+[[], ["foo", "bar", 1], ["foo", 1], ["foo", 3], ["foo", "bar2", 4], ["foo", 4], ["foo", 5]]
+Output
+[null, null, "bar", "bar", null, "bar2", "bar2"]
+
+Explanation
+TimeMap timeMap = new TimeMap();
+timeMap.set("foo", "bar", 1);  // store the key "foo" and value "bar" along with timestamp = 1.
+timeMap.get("foo", 1);         // return "bar"
+timeMap.get("foo", 3);         // return "bar", since there is no value corresponding to foo at timestamp 3 and timestamp 2, then the only value is at timestamp 1 is "bar".
+timeMap.set("foo", "bar2", 4); // store the key "foo" and value "bar2" along with timestamp = 4.
+timeMap.get("foo", 4);         // return "bar2"
+timeMap.get("foo", 5);         // return "bar2"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= key.length, value.length <= 100
    • +
  • key and value consist of lowercase English letters and digits.
    • +
  • 1 <= timestamp <= 107
    • +
  • All the timestamps timestamp of set are strictly increasing.
    • +
  • At most 2 * 105 calls will be made to set and get.
    • +
+",2.0,False,"class TimeMap { +public: + TimeMap() { + + } + + void set(string key, string value, int timestamp) { + + } + + string get(string key, int timestamp) { + + } +}; + +/** + * Your TimeMap object will be instantiated and called as such: + * TimeMap* obj = new TimeMap(); + * obj->set(key,value,timestamp); + * string param_2 = obj->get(key,timestamp); + */","class TimeMap { + + public TimeMap() { + + } + + public void set(String key, String value, int timestamp) { + + } + + public String get(String key, int timestamp) { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * TimeMap obj = new TimeMap(); + * obj.set(key,value,timestamp); + * String param_2 = obj.get(key,timestamp); + */","class TimeMap(object): + + def __init__(self): + + + def set(self, key, value, timestamp): + """""" + :type key: str + :type value: str + :type timestamp: int + :rtype: None + """""" + + + def get(self, key, timestamp): + """""" + :type key: str + :type timestamp: int + :rtype: str + """""" + + + +# Your TimeMap object will be instantiated and called as such: +# obj = TimeMap() +# obj.set(key,value,timestamp) +# param_2 = obj.get(key,timestamp)","class TimeMap: + + def __init__(self): + + + def set(self, key: str, value: str, timestamp: int) -> None: + + + def get(self, key: str, timestamp: int) -> str: + + + +# Your TimeMap object will be instantiated and called as such: +# obj = TimeMap() +# obj.set(key,value,timestamp) +# param_2 = obj.get(key,timestamp)"," + + +typedef struct { + +} TimeMap; + + +TimeMap* timeMapCreate() { + +} + +void timeMapSet(TimeMap* obj, char * key, char * value, int timestamp) { + +} + +char * timeMapGet(TimeMap* obj, char * key, int timestamp) { + +} + +void timeMapFree(TimeMap* obj) { + +} + +/** + * Your TimeMap struct will be instantiated and called as such: + * TimeMap* obj = timeMapCreate(); + * timeMapSet(obj, key, value, timestamp); + + * char * param_2 = timeMapGet(obj, key, timestamp); + + * timeMapFree(obj); +*/","public class TimeMap { + + public TimeMap() { + + } + + public void Set(string key, string value, int timestamp) { + + } + + public string Get(string key, int timestamp) { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * TimeMap obj = new TimeMap(); + * obj.Set(key,value,timestamp); + * string param_2 = obj.Get(key,timestamp); + */"," +var TimeMap = function() { + +}; + +/** + * @param {string} key + * @param {string} value + * @param {number} timestamp + * @return {void} + */ +TimeMap.prototype.set = function(key, value, timestamp) { + +}; + +/** + * @param {string} key + * @param {number} timestamp + * @return {string} + */ +TimeMap.prototype.get = function(key, timestamp) { + +}; + +/** + * Your TimeMap object will be instantiated and called as such: + * var obj = new TimeMap() + * obj.set(key,value,timestamp) + * var param_2 = obj.get(key,timestamp) + */","class TimeMap + def initialize() + + end + + +=begin + :type key: String + :type value: String + :type timestamp: Integer + :rtype: Void +=end + def set(key, value, timestamp) + + end + + +=begin + :type key: String + :type timestamp: Integer + :rtype: String +=end + def get(key, timestamp) + + end + + +end + +# Your TimeMap object will be instantiated and called as such: +# obj = TimeMap.new() +# obj.set(key, value, timestamp) +# param_2 = obj.get(key, timestamp)"," +class TimeMap { + + init() { + + } + + func set(_ key: String, _ value: String, _ timestamp: Int) { + + } + + func get(_ key: String, _ timestamp: Int) -> String { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * let obj = TimeMap() + * obj.set(key, value, timestamp) + * let ret_2: String = obj.get(key, timestamp) + */","type TimeMap struct { + +} + + +func Constructor() TimeMap { + +} + + +func (this *TimeMap) Set(key string, value string, timestamp int) { + +} + + +func (this *TimeMap) Get(key string, timestamp int) string { + +} + + +/** + * Your TimeMap object will be instantiated and called as such: + * obj := Constructor(); + * obj.Set(key,value,timestamp); + * param_2 := obj.Get(key,timestamp); + */","class TimeMap() { + + def set(key: String, value: String, timestamp: Int) { + + } + + def get(key: String, timestamp: Int): String = { + + } + +} + +/** + * Your TimeMap object will be instantiated and called as such: + * var obj = new TimeMap() + * obj.set(key,value,timestamp) + * var param_2 = obj.get(key,timestamp) + */","class TimeMap() { + + fun set(key: String, value: String, timestamp: Int) { + + } + + fun get(key: String, timestamp: Int): String { + + } + +} + +/** + * Your TimeMap object will be instantiated and called as such: + * var obj = TimeMap() + * obj.set(key,value,timestamp) + * var param_2 = obj.get(key,timestamp) + */","struct TimeMap { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl TimeMap { + + fn new() -> Self { + + } + + fn set(&self, key: String, value: String, timestamp: i32) { + + } + + fn get(&self, key: String, timestamp: i32) -> String { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * let obj = TimeMap::new(); + * obj.set(key, value, timestamp); + * let ret_2: String = obj.get(key, timestamp); + */","class TimeMap { + /** + */ + function __construct() { + + } + + /** + * @param String $key + * @param String $value + * @param Integer $timestamp + * @return NULL + */ + function set($key, $value, $timestamp) { + + } + + /** + * @param String $key + * @param Integer $timestamp + * @return String + */ + function get($key, $timestamp) { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * $obj = TimeMap(); + * $obj->set($key, $value, $timestamp); + * $ret_2 = $obj->get($key, $timestamp); + */","class TimeMap { + constructor() { + + } + + set(key: string, value: string, timestamp: number): void { + + } + + get(key: string, timestamp: number): string { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * var obj = new TimeMap() + * obj.set(key,value,timestamp) + * var param_2 = obj.get(key,timestamp) + */","(define time-map% + (class object% + (super-new) + (init-field) + + ; set : string? string? exact-integer? -> void? + (define/public (set key value timestamp) + + ) + ; get : string? exact-integer? -> string? + (define/public (get key timestamp) + + ))) + +;; Your time-map% object will be instantiated and called as such: +;; (define obj (new time-map%)) +;; (send obj set key value timestamp) +;; (define param_2 (send obj get key timestamp))","-spec time_map_init_() -> any(). +time_map_init_() -> + . + +-spec time_map_set(Key :: unicode:unicode_binary(), Value :: unicode:unicode_binary(), Timestamp :: integer()) -> any(). +time_map_set(Key, Value, Timestamp) -> + . + +-spec time_map_get(Key :: unicode:unicode_binary(), Timestamp :: integer()) -> unicode:unicode_binary(). +time_map_get(Key, Timestamp) -> + . + + +%% Your functions will be called as such: +%% time_map_init_(), +%% time_map_set(Key, Value, Timestamp), +%% Param_2 = time_map_get(Key, Timestamp), + +%% time_map_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule TimeMap do + @spec init_() :: any + def init_() do + + end + + @spec set(key :: String.t, value :: String.t, timestamp :: integer) :: any + def set(key, value, timestamp) do + + end + + @spec get(key :: String.t, timestamp :: integer) :: String.t + def get(key, timestamp) do + + end +end + +# Your functions will be called as such: +# TimeMap.init_() +# TimeMap.set(key, value, timestamp) +# param_2 = TimeMap.get(key, timestamp) + +# TimeMap.init_ will be called before every test case, in which you can do some necessary initializations.","class TimeMap { + + TimeMap() { + + } + + void set(String key, String value, int timestamp) { + + } + + String get(String key, int timestamp) { + + } +} + +/** + * Your TimeMap object will be instantiated and called as such: + * TimeMap obj = TimeMap(); + * obj.set(key,value,timestamp); + * String param2 = obj.get(key,timestamp); + */", +1343,unique-paths-iii,Unique Paths III,980.0,1022.0,"

You are given an m x n integer array grid where grid[i][j] could be:

+ +
    +
  • 1 representing the starting square. There is exactly one starting square.
    • +
  • 2 representing the ending square. There is exactly one ending square.
    • +
  • 0 representing empty squares we can walk over.
    • +
  • -1 representing obstacles that we cannot walk over.
    • +
+ +

Return the number of 4-directional walks from the starting square to the ending square, that walk over every non-obstacle square exactly once.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,0,0,0],[0,0,0,0],[0,0,2,-1]]
+Output: 2
+Explanation: We have the following two paths: 
+1. (0,0),(0,1),(0,2),(0,3),(1,3),(1,2),(1,1),(1,0),(2,0),(2,1),(2,2)
+2. (0,0),(1,0),(2,0),(2,1),(1,1),(0,1),(0,2),(0,3),(1,3),(1,2),(2,2)
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,0,0],[0,0,0,0],[0,0,0,2]]
+Output: 4
+Explanation: We have the following four paths: 
+1. (0,0),(0,1),(0,2),(0,3),(1,3),(1,2),(1,1),(1,0),(2,0),(2,1),(2,2),(2,3)
+2. (0,0),(0,1),(1,1),(1,0),(2,0),(2,1),(2,2),(1,2),(0,2),(0,3),(1,3),(2,3)
+3. (0,0),(1,0),(2,0),(2,1),(2,2),(1,2),(1,1),(0,1),(0,2),(0,3),(1,3),(2,3)
+4. (0,0),(1,0),(2,0),(2,1),(1,1),(0,1),(0,2),(0,3),(1,3),(1,2),(2,2),(2,3)
+
+ +

Example 3:

+ +
+Input: grid = [[0,1],[2,0]]
+Output: 0
+Explanation: There is no path that walks over every empty square exactly once.
+Note that the starting and ending square can be anywhere in the grid.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 20
    • +
  • 1 <= m * n <= 20
    • +
  • -1 <= grid[i][j] <= 2
    • +
  • There is exactly one starting cell and one ending cell.
    • +
+",3.0,False,"class Solution { +public: + int uniquePathsIII(vector>& grid) { + + } +};","class Solution { + public int uniquePathsIII(int[][] grid) { + + } +}","class Solution(object): + def uniquePathsIII(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def uniquePathsIII(self, grid: List[List[int]]) -> int: + ","int uniquePathsIII(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int UniquePathsIII(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var uniquePathsIII = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def unique_paths_iii(grid) + +end","class Solution { + func uniquePathsIII(_ grid: [[Int]]) -> Int { + + } +}","func uniquePathsIII(grid [][]int) int { + +}","object Solution { + def uniquePathsIII(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun uniquePathsIII(grid: Array): Int { + + } +}","impl Solution { + pub fn unique_paths_iii(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function uniquePathsIII($grid) { + + } +}","function uniquePathsIII(grid: number[][]): number { + +};",,"-spec unique_paths_iii(Grid :: [[integer()]]) -> integer(). +unique_paths_iii(Grid) -> + .","defmodule Solution do + @spec unique_paths_iii(grid :: [[integer]]) :: integer + def unique_paths_iii(grid) do + + end +end","class Solution { + int uniquePathsIII(List> grid) { + + } +}", +1348,odd-even-jump,Odd Even Jump,975.0,1017.0,"

You are given an integer array arr. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, ...) jumps in the series are called odd-numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even-numbered jumps. Note that the jumps are numbered, not the indices.

+ +

You may jump forward from index i to index j (with i < j) in the following way:

+ +
    +
  • During odd-numbered jumps (i.e., jumps 1, 3, 5, ...), you jump to the index j such that arr[i] <= arr[j] and arr[j] is the smallest possible value. If there are multiple such indices j, you can only jump to the smallest such index j.
    • +
  • During even-numbered jumps (i.e., jumps 2, 4, 6, ...), you jump to the index j such that arr[i] >= arr[j] and arr[j] is the largest possible value. If there are multiple such indices j, you can only jump to the smallest such index j.
    • +
  • It may be the case that for some index i, there are no legal jumps.
    • +
+ +

A starting index is good if, starting from that index, you can reach the end of the array (index arr.length - 1) by jumping some number of times (possibly 0 or more than once).

+ +

Return the number of good starting indices.

+ +

 

+

Example 1:

+ +
+Input: arr = [10,13,12,14,15]
+Output: 2
+Explanation: 
+From starting index i = 0, we can make our 1st jump to i = 2 (since arr[2] is the smallest among arr[1], arr[2], arr[3], arr[4] that is greater or equal to arr[0]), then we cannot jump any more.
+From starting index i = 1 and i = 2, we can make our 1st jump to i = 3, then we cannot jump any more.
+From starting index i = 3, we can make our 1st jump to i = 4, so we have reached the end.
+From starting index i = 4, we have reached the end already.
+In total, there are 2 different starting indices i = 3 and i = 4, where we can reach the end with some number of
+jumps.
+
+ +

Example 2:

+ +
+Input: arr = [2,3,1,1,4]
+Output: 3
+Explanation: 
+From starting index i = 0, we make jumps to i = 1, i = 2, i = 3:
+During our 1st jump (odd-numbered), we first jump to i = 1 because arr[1] is the smallest value in [arr[1], arr[2], arr[3], arr[4]] that is greater than or equal to arr[0].
+During our 2nd jump (even-numbered), we jump from i = 1 to i = 2 because arr[2] is the largest value in [arr[2], arr[3], arr[4]] that is less than or equal to arr[1]. arr[3] is also the largest value, but 2 is a smaller index, so we can only jump to i = 2 and not i = 3
+During our 3rd jump (odd-numbered), we jump from i = 2 to i = 3 because arr[3] is the smallest value in [arr[3], arr[4]] that is greater than or equal to arr[2].
+We can't jump from i = 3 to i = 4, so the starting index i = 0 is not good.
+In a similar manner, we can deduce that:
+From starting index i = 1, we jump to i = 4, so we reach the end.
+From starting index i = 2, we jump to i = 3, and then we can't jump anymore.
+From starting index i = 3, we jump to i = 4, so we reach the end.
+From starting index i = 4, we are already at the end.
+In total, there are 3 different starting indices i = 1, i = 3, and i = 4, where we can reach the end with some
+number of jumps.
+
+ +

Example 3:

+ +
+Input: arr = [5,1,3,4,2]
+Output: 3
+Explanation: We can reach the end from starting indices 1, 2, and 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 2 * 104
    • +
  • 0 <= arr[i] < 105
    • +
+",3.0,False,"class Solution { +public: + int oddEvenJumps(vector& arr) { + + } +};","class Solution { + public int oddEvenJumps(int[] arr) { + + } +}","class Solution(object): + def oddEvenJumps(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def oddEvenJumps(self, arr: List[int]) -> int: + ","int oddEvenJumps(int* arr, int arrSize){ + +}","public class Solution { + public int OddEvenJumps(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var oddEvenJumps = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def odd_even_jumps(arr) + +end","class Solution { + func oddEvenJumps(_ arr: [Int]) -> Int { + + } +}","func oddEvenJumps(arr []int) int { + +}","object Solution { + def oddEvenJumps(arr: Array[Int]): Int = { + + } +}","class Solution { + fun oddEvenJumps(arr: IntArray): Int { + + } +}","impl Solution { + pub fn odd_even_jumps(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function oddEvenJumps($arr) { + + } +}","function oddEvenJumps(arr: number[]): number { + +};","(define/contract (odd-even-jumps arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec odd_even_jumps(Arr :: [integer()]) -> integer(). +odd_even_jumps(Arr) -> + .","defmodule Solution do + @spec odd_even_jumps(arr :: [integer]) :: integer + def odd_even_jumps(arr) do + + end +end","class Solution { + int oddEvenJumps(List arr) { + + } +}", +1350,k-closest-points-to-origin,K Closest Points to Origin,973.0,1014.0,"

Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0).

+ +

The distance between two points on the X-Y plane is the Euclidean distance (i.e., √(x1 - x2)2 + (y1 - y2)2).

+ +

You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in).

+ +

 

+

Example 1:

+ +
+Input: points = [[1,3],[-2,2]], k = 1
+Output: [[-2,2]]
+Explanation:
+The distance between (1, 3) and the origin is sqrt(10).
+The distance between (-2, 2) and the origin is sqrt(8).
+Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
+We only want the closest k = 1 points from the origin, so the answer is just [[-2,2]].
+
+ +

Example 2:

+ +
+Input: points = [[3,3],[5,-1],[-2,4]], k = 2
+Output: [[3,3],[-2,4]]
+Explanation: The answer [[-2,4],[3,3]] would also be accepted.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= points.length <= 104
    • +
  • -104 <= xi, yi <= 104
    • +
+",2.0,False,"class Solution { +public: + vector> kClosest(vector>& points, int k) { + + } +};","class Solution { + public int[][] kClosest(int[][] points, int k) { + + } +}","class Solution(object): + def kClosest(self, points, k): + """""" + :type points: List[List[int]] + :type k: int + :rtype: List[List[int]] + """""" + ","class Solution: + def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** kClosest(int** points, int pointsSize, int* pointsColSize, int k, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] KClosest(int[][] points, int k) { + + } +}","/** + * @param {number[][]} points + * @param {number} k + * @return {number[][]} + */ +var kClosest = function(points, k) { + +};","# @param {Integer[][]} points +# @param {Integer} k +# @return {Integer[][]} +def k_closest(points, k) + +end","class Solution { + func kClosest(_ points: [[Int]], _ k: Int) -> [[Int]] { + + } +}","func kClosest(points [][]int, k int) [][]int { + +}","object Solution { + def kClosest(points: Array[Array[Int]], k: Int): Array[Array[Int]] = { + + } +}","class Solution { + fun kClosest(points: Array, k: Int): Array { + + } +}","impl Solution { + pub fn k_closest(points: Vec>, k: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @param Integer $k + * @return Integer[][] + */ + function kClosest($points, $k) { + + } +}","function kClosest(points: number[][], k: number): number[][] { + +};","(define/contract (k-closest points k) + (-> (listof (listof exact-integer?)) exact-integer? (listof (listof exact-integer?))) + + )","-spec k_closest(Points :: [[integer()]], K :: integer()) -> [[integer()]]. +k_closest(Points, K) -> + .","defmodule Solution do + @spec k_closest(points :: [[integer]], k :: integer) :: [[integer]] + def k_closest(points, k) do + + end +end","class Solution { + List> kClosest(List> points, int k) { + + } +}", +1351,fibonacci-number,Fibonacci Number,509.0,1013.0,"

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

+ +
+F(0) = 0, F(1) = 1
+F(n) = F(n - 1) + F(n - 2), for n > 1.
+
+ +

Given n, calculate F(n).

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: 1
+Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
+
+ +

Example 2:

+ +
+Input: n = 3
+Output: 2
+Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
+
+ +

Example 3:

+ +
+Input: n = 4
+Output: 3
+Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 30
    • +
+",1.0,False,"class Solution { +public: + int fib(int n) { + + } +};","class Solution { + public int fib(int n) { + + } +}","class Solution(object): + def fib(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def fib(self, n: int) -> int: + "," + +int fib(int n){ + +}","public class Solution { + public int Fib(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var fib = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def fib(n) + +end","class Solution { + func fib(_ n: Int) -> Int { + + } +}","func fib(n int) int { + +}","object Solution { + def fib(n: Int): Int = { + + } +}","class Solution { + fun fib(n: Int): Int { + + } +}","impl Solution { + pub fn fib(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function fib($n) { + + } +}","function fib(n: number): number { + +};",,,,, +1352,equal-rational-numbers,Equal Rational Numbers,972.0,1012.0,"

Given two strings s and t, each of which represents a non-negative rational number, return true if and only if they represent the same number. The strings may use parentheses to denote the repeating part of the rational number.

+ +

A rational number can be represented using up to three parts: <IntegerPart>, <NonRepeatingPart>, and a <RepeatingPart>. The number will be represented in one of the following three ways:

+ +
    +
  • <IntegerPart> + +
      +
    • For example, 12, 0, and 123.
      • +
    +
    • +
  • <IntegerPart><.><NonRepeatingPart> +
      +
    • For example, 0.5, 1., 2.12, and 123.0001.
      • +
    +
    • +
  • <IntegerPart><.><NonRepeatingPart><(><RepeatingPart><)> +
      +
    • For example, 0.1(6), 1.(9), 123.00(1212).
      • +
    +
    • +
+ +

The repeating portion of a decimal expansion is conventionally denoted within a pair of round brackets. For example:

+ +
    +
  • 1/6 = 0.16666666... = 0.1(6) = 0.1666(6) = 0.166(66).
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "0.(52)", t = "0.5(25)"
+Output: true
+Explanation: Because "0.(52)" represents 0.52525252..., and "0.5(25)" represents 0.52525252525..... , the strings represent the same number.
+
+ +

Example 2:

+ +
+Input: s = "0.1666(6)", t = "0.166(66)"
+Output: true
+
+ +

Example 3:

+ +
+Input: s = "0.9(9)", t = "1."
+Output: true
+Explanation: "0.9(9)" represents 0.999999999... repeated forever, which equals 1.  [See this link for an explanation.]
+"1." represents the number 1, which is formed correctly: (IntegerPart) = "1" and (NonRepeatingPart) = "".
+
+ +

 

+

Constraints:

+ +
    +
  • Each part consists only of digits.
    • +
  • The <IntegerPart> does not have leading zeros (except for the zero itself).
    • +
  • 1 <= <IntegerPart>.length <= 4
    • +
  • 0 <= <NonRepeatingPart>.length <= 4
    • +
  • 1 <= <RepeatingPart>.length <= 4
    • +
+",3.0,False,"class Solution { +public: + bool isRationalEqual(string s, string t) { + + } +};","class Solution { + public boolean isRationalEqual(String s, String t) { + + } +}","class Solution(object): + def isRationalEqual(self, s, t): + """""" + :type s: str + :type t: str + :rtype: bool + """""" + ","class Solution: + def isRationalEqual(self, s: str, t: str) -> bool: + ","bool isRationalEqual(char * s, char * t){ + +}","public class Solution { + public bool IsRationalEqual(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {boolean} + */ +var isRationalEqual = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Boolean} +def is_rational_equal(s, t) + +end","class Solution { + func isRationalEqual(_ s: String, _ t: String) -> Bool { + + } +}","func isRationalEqual(s string, t string) bool { + +}","object Solution { + def isRationalEqual(s: String, t: String): Boolean = { + + } +}","class Solution { + fun isRationalEqual(s: String, t: String): Boolean { + + } +}","impl Solution { + pub fn is_rational_equal(s: String, t: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Boolean + */ + function isRationalEqual($s, $t) { + + } +}","function isRationalEqual(s: string, t: string): boolean { + +};","(define/contract (is-rational-equal s t) + (-> string? string? boolean?) + + )","-spec is_rational_equal(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> boolean(). +is_rational_equal(S, T) -> + .","defmodule Solution do + @spec is_rational_equal(s :: String.t, t :: String.t) :: boolean + def is_rational_equal(s, t) do + + end +end","class Solution { + bool isRationalEqual(String s, String t) { + + } +}", +1353,flip-binary-tree-to-match-preorder-traversal,Flip Binary Tree To Match Preorder Traversal,971.0,1011.0,"

You are given the root of a binary tree with n nodes, where each node is uniquely assigned a value from 1 to n. You are also given a sequence of n values voyage, which is the desired pre-order traversal of the binary tree.

+ +

Any node in the binary tree can be flipped by swapping its left and right subtrees. For example, flipping node 1 will have the following effect:

+ +

Flip the smallest number of nodes so that the pre-order traversal of the tree matches voyage.

+ +

Return a list of the values of all flipped nodes. You may return the answer in any order. If it is impossible to flip the nodes in the tree to make the pre-order traversal match voyage, return the list [-1].

+ +

 

+

Example 1:

+ +
+Input: root = [1,2], voyage = [2,1]
+Output: [-1]
+Explanation: It is impossible to flip the nodes such that the pre-order traversal matches voyage.
+
+ +

Example 2:

+ +
+Input: root = [1,2,3], voyage = [1,3,2]
+Output: [1]
+Explanation: Flipping node 1 swaps nodes 2 and 3, so the pre-order traversal matches voyage.
+ +

Example 3:

+ +
+Input: root = [1,2,3], voyage = [1,2,3]
+Output: []
+Explanation: The tree's pre-order traversal already matches voyage, so no nodes need to be flipped.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is n.
    • +
  • n == voyage.length
    • +
  • 1 <= n <= 100
    • +
  • 1 <= Node.val, voyage[i] <= n
    • +
  • All the values in the tree are unique.
    • +
  • All the values in voyage are unique.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector flipMatchVoyage(TreeNode* root, vector& voyage) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List flipMatchVoyage(TreeNode root, int[] voyage) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def flipMatchVoyage(self, root, voyage): + """""" + :type root: TreeNode + :type voyage: List[int] + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def flipMatchVoyage(self, root: Optional[TreeNode], voyage: List[int]) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* flipMatchVoyage(struct TreeNode* root, int* voyage, int voyageSize, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList FlipMatchVoyage(TreeNode root, int[] voyage) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number[]} voyage + * @return {number[]} + */ +var flipMatchVoyage = function(root, voyage) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer[]} voyage +# @return {Integer[]} +def flip_match_voyage(root, voyage) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func flipMatchVoyage(_ root: TreeNode?, _ voyage: [Int]) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func flipMatchVoyage(root *TreeNode, voyage []int) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def flipMatchVoyage(root: TreeNode, voyage: Array[Int]): List[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun flipMatchVoyage(root: TreeNode?, voyage: IntArray): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn flip_match_voyage(root: Option>>, voyage: Vec) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer[] $voyage + * @return Integer[] + */ + function flipMatchVoyage($root, $voyage) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function flipMatchVoyage(root: TreeNode | null, voyage: number[]): number[] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (flip-match-voyage root voyage) + (-> (or/c tree-node? #f) (listof exact-integer?) (listof exact-integer?)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec flip_match_voyage(Root :: #tree_node{} | null, Voyage :: [integer()]) -> [integer()]. +flip_match_voyage(Root, Voyage) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec flip_match_voyage(root :: TreeNode.t | nil, voyage :: [integer]) :: [integer] + def flip_match_voyage(root, voyage) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List flipMatchVoyage(TreeNode? root, List voyage) { + + } +}", +1354,powerful-integers,Powerful Integers,970.0,1010.0,"

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 if it can be represented as xi + yj for some integers i >= 0 and j >= 0.

+ +

You may return the answer in any order. In your answer, each value should occur at most once.

+ +

 

+

Example 1:

+ +
+Input: x = 2, y = 3, bound = 10
+Output: [2,3,4,5,7,9,10]
+Explanation:
+2 = 20 + 30
+3 = 21 + 30
+4 = 20 + 31
+5 = 21 + 31
+7 = 22 + 31
+9 = 23 + 30
+10 = 20 + 32
+
+ +

Example 2:

+ +
+Input: x = 3, y = 5, bound = 15
+Output: [2,4,6,8,10,14]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= x, y <= 100
    • +
  • 0 <= bound <= 106
    • +
+",2.0,False,"class Solution { +public: + vector powerfulIntegers(int x, int y, int bound) { + + } +};","class Solution { + public List powerfulIntegers(int x, int y, int bound) { + + } +}","class Solution(object): + def powerfulIntegers(self, x, y, bound): + """""" + :type x: int + :type y: int + :type bound: int + :rtype: List[int] + """""" + ","class Solution: + def powerfulIntegers(self, x: int, y: int, bound: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* powerfulIntegers(int x, int y, int bound, int* returnSize){ + +}","public class Solution { + public IList PowerfulIntegers(int x, int y, int bound) { + + } +}","/** + * @param {number} x + * @param {number} y + * @param {number} bound + * @return {number[]} + */ +var powerfulIntegers = function(x, y, bound) { + +};","# @param {Integer} x +# @param {Integer} y +# @param {Integer} bound +# @return {Integer[]} +def powerful_integers(x, y, bound) + +end","class Solution { + func powerfulIntegers(_ x: Int, _ y: Int, _ bound: Int) -> [Int] { + + } +}","func powerfulIntegers(x int, y int, bound int) []int { + +}","object Solution { + def powerfulIntegers(x: Int, y: Int, bound: Int): List[Int] = { + + } +}","class Solution { + fun powerfulIntegers(x: Int, y: Int, bound: Int): List { + + } +}","impl Solution { + pub fn powerful_integers(x: i32, y: i32, bound: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $x + * @param Integer $y + * @param Integer $bound + * @return Integer[] + */ + function powerfulIntegers($x, $y, $bound) { + + } +}","function powerfulIntegers(x: number, y: number, bound: number): number[] { + +};","(define/contract (powerful-integers x y bound) + (-> exact-integer? exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec powerful_integers(X :: integer(), Y :: integer(), Bound :: integer()) -> [integer()]. +powerful_integers(X, Y, Bound) -> + .","defmodule Solution do + @spec powerful_integers(x :: integer, y :: integer, bound :: integer) :: [integer] + def powerful_integers(x, y, bound) do + + end +end","class Solution { + List powerfulIntegers(int x, int y, int bound) { + + } +}", +1356,binary-tree-cameras,Binary Tree Cameras,968.0,1008.0,"

You are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate children.

+ +

Return the minimum number of cameras needed to monitor all nodes of the tree.

+ +

 

+

Example 1:

+ +
+Input: root = [0,0,null,0,0]
+Output: 1
+Explanation: One camera is enough to monitor all nodes if placed as shown.
+
+ +

Example 2:

+ +
+Input: root = [0,0,null,0,null,0,null,null,0]
+Output: 2
+Explanation: At least two cameras are needed to monitor all nodes of the tree. The above image shows one of the valid configurations of camera placement.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 1000].
    • +
  • Node.val == 0
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int minCameraCover(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int minCameraCover(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def minCameraCover(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def minCameraCover(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int minCameraCover(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int MinCameraCover(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var minCameraCover = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def min_camera_cover(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func minCameraCover(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func minCameraCover(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def minCameraCover(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun minCameraCover(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn min_camera_cover(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function minCameraCover($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function minCameraCover(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (min-camera-cover root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec min_camera_cover(Root :: #tree_node{} | null) -> integer(). +min_camera_cover(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec min_camera_cover(root :: TreeNode.t | nil) :: integer + def min_camera_cover(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int minCameraCover(TreeNode? root) { + + } +}", +1357,numbers-with-same-consecutive-differences,Numbers With Same Consecutive Differences,967.0,1007.0,"

Given two integers n and k, return an array of all the integers of length n where the difference between every two consecutive digits is k. You may return the answer in any order.

+ +

Note that the integers should not have leading zeros. Integers as 02 and 043 are not allowed.

+ +

 

+

Example 1:

+ +
+Input: n = 3, k = 7
+Output: [181,292,707,818,929]
+Explanation: Note that 070 is not a valid number, because it has leading zeroes.
+
+ +

Example 2:

+ +
+Input: n = 2, k = 1
+Output: [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 9
    • +
  • 0 <= k <= 9
    • +
+",2.0,False,"class Solution { +public: + vector numsSameConsecDiff(int n, int k) { + + } +};","class Solution { + public int[] numsSameConsecDiff(int n, int k) { + + } +}","class Solution(object): + def numsSameConsecDiff(self, n, k): + """""" + :type n: int + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def numsSameConsecDiff(self, n: int, k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* numsSameConsecDiff(int n, int k, int* returnSize){ + +}","public class Solution { + public int[] NumsSameConsecDiff(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number[]} + */ +var numsSameConsecDiff = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer[]} +def nums_same_consec_diff(n, k) + +end","class Solution { + func numsSameConsecDiff(_ n: Int, _ k: Int) -> [Int] { + + } +}","func numsSameConsecDiff(n int, k int) []int { + +}","object Solution { + def numsSameConsecDiff(n: Int, k: Int): Array[Int] = { + + } +}","class Solution { + fun numsSameConsecDiff(n: Int, k: Int): IntArray { + + } +}","impl Solution { + pub fn nums_same_consec_diff(n: i32, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer[] + */ + function numsSameConsecDiff($n, $k) { + + } +}","function numsSameConsecDiff(n: number, k: number): number[] { + +};","(define/contract (nums-same-consec-diff n k) + (-> exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec nums_same_consec_diff(N :: integer(), K :: integer()) -> [integer()]. +nums_same_consec_diff(N, K) -> + .","defmodule Solution do + @spec nums_same_consec_diff(n :: integer, k :: integer) :: [integer] + def nums_same_consec_diff(n, k) do + + end +end","class Solution { + List numsSameConsecDiff(int n, int k) { + + } +}", +1358,vowel-spellchecker,Vowel Spellchecker,966.0,1006.0,"

Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word.

+ +

For a given query word, the spell checker handles two categories of spelling mistakes:

+ +
    +
  • Capitalization: If the query matches a word in the wordlist (case-insensitive), then the query word is returned with the same case as the case in the wordlist. + +
      +
    • Example: wordlist = ["yellow"], query = "YellOw": correct = "yellow"
      • +
    • Example: wordlist = ["Yellow"], query = "yellow": correct = "Yellow"
      • +
    • Example: wordlist = ["yellow"], query = "yellow": correct = "yellow"
      • +
    +
    • +
  • Vowel Errors: If after replacing the vowels ('a', 'e', 'i', 'o', 'u') of the query word with any vowel individually, it matches a word in the wordlist (case-insensitive), then the query word is returned with the same case as the match in the wordlist. +
      +
    • Example: wordlist = ["YellOw"], query = "yollow": correct = "YellOw"
      • +
    • Example: wordlist = ["YellOw"], query = "yeellow": correct = "" (no match)
      • +
    • Example: wordlist = ["YellOw"], query = "yllw": correct = "" (no match)
      • +
    +
    • +
+ +

In addition, the spell checker operates under the following precedence rules:

+ +
    +
  • When the query exactly matches a word in the wordlist (case-sensitive), you should return the same word back.
    • +
  • When the query matches a word up to capitlization, you should return the first such match in the wordlist.
    • +
  • When the query matches a word up to vowel errors, you should return the first such match in the wordlist.
    • +
  • If the query has no matches in the wordlist, you should return the empty string.
    • +
+ +

Given some queries, return a list of words answer, where answer[i] is the correct word for query = queries[i].

+ +

 

+

Example 1:

+
Input: wordlist = [""KiTe"",""kite"",""hare"",""Hare""], queries = [""kite"",""Kite"",""KiTe"",""Hare"",""HARE"",""Hear"",""hear"",""keti"",""keet"",""keto""]
+Output: [""kite"",""KiTe"",""KiTe"",""Hare"",""hare"","""","""",""KiTe"","""",""KiTe""]
+

Example 2:

+
Input: wordlist = [""yellow""], queries = [""YellOw""]
+Output: [""yellow""]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= wordlist.length, queries.length <= 5000
    • +
  • 1 <= wordlist[i].length, queries[i].length <= 7
    • +
  • wordlist[i] and queries[i] consist only of only English letters.
    • +
+",2.0,False,"class Solution { +public: + vector spellchecker(vector& wordlist, vector& queries) { + + } +};","class Solution { + public String[] spellchecker(String[] wordlist, String[] queries) { + + } +}","class Solution(object): + def spellchecker(self, wordlist, queries): + """""" + :type wordlist: List[str] + :type queries: List[str] + :rtype: List[str] + """""" + ","class Solution: + def spellchecker(self, wordlist: List[str], queries: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** spellchecker(char ** wordlist, int wordlistSize, char ** queries, int queriesSize, int* returnSize){ + +}","public class Solution { + public string[] Spellchecker(string[] wordlist, string[] queries) { + + } +}","/** + * @param {string[]} wordlist + * @param {string[]} queries + * @return {string[]} + */ +var spellchecker = function(wordlist, queries) { + +};","# @param {String[]} wordlist +# @param {String[]} queries +# @return {String[]} +def spellchecker(wordlist, queries) + +end","class Solution { + func spellchecker(_ wordlist: [String], _ queries: [String]) -> [String] { + + } +}","func spellchecker(wordlist []string, queries []string) []string { + +}","object Solution { + def spellchecker(wordlist: Array[String], queries: Array[String]): Array[String] = { + + } +}","class Solution { + fun spellchecker(wordlist: Array, queries: Array): Array { + + } +}","impl Solution { + pub fn spellchecker(wordlist: Vec, queries: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $wordlist + * @param String[] $queries + * @return String[] + */ + function spellchecker($wordlist, $queries) { + + } +}","function spellchecker(wordlist: string[], queries: string[]): string[] { + +};","(define/contract (spellchecker wordlist queries) + (-> (listof string?) (listof string?) (listof string?)) + + )","-spec spellchecker(Wordlist :: [unicode:unicode_binary()], Queries :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +spellchecker(Wordlist, Queries) -> + .","defmodule Solution do + @spec spellchecker(wordlist :: [String.t], queries :: [String.t]) :: [String.t] + def spellchecker(wordlist, queries) do + + end +end","class Solution { + List spellchecker(List wordlist, List queries) { + + } +}", +1359,univalued-binary-tree,Univalued Binary Tree,965.0,1005.0,"

A binary tree is uni-valued if every node in the tree has the same value.

+ +

Given the root of a binary tree, return true if the given tree is uni-valued, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: root = [1,1,1,1,1,null,1]
+Output: true
+
+ +

Example 2:

+ +
+Input: root = [2,2,2,5,2]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 100].
    • +
  • 0 <= Node.val < 100
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isUnivalTree(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isUnivalTree(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isUnivalTree(self, root): + """""" + :type root: TreeNode + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isUnivalTree(self, root: Optional[TreeNode]) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isUnivalTree(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsUnivalTree(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {boolean} + */ +var isUnivalTree = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Boolean} +def is_unival_tree(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isUnivalTree(_ root: TreeNode?) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isUnivalTree(root *TreeNode) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isUnivalTree(root: TreeNode): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isUnivalTree(root: TreeNode?): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_unival_tree(root: Option>>) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Boolean + */ + function isUnivalTree($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isUnivalTree(root: TreeNode | null): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-unival-tree root) + (-> (or/c tree-node? #f) boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_unival_tree(Root :: #tree_node{} | null) -> boolean(). +is_unival_tree(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_unival_tree(root :: TreeNode.t | nil) :: boolean + def is_unival_tree(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isUnivalTree(TreeNode? root) { + + } +}", +1360,least-operators-to-express-number,Least Operators to Express Number,964.0,1004.0,"

Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ... where each operator op1, op2, etc. is either addition, subtraction, multiplication, or division (+, -, *, or /). For example, with x = 3, we might write 3 * 3 / 3 + 3 - 3 which is a value of 3.

+ +

When writing such an expression, we adhere to the following conventions:

+ +
    +
  • The division operator (/) returns rational numbers.
    • +
  • There are no parentheses placed anywhere.
    • +
  • We use the usual order of operations: multiplication and division happen before addition and subtraction.
    • +
  • It is not allowed to use the unary negation operator (-). For example, "x - x" is a valid expression as it only uses subtraction, but "-x + x" is not because it uses negation.
    • +
+ +

We would like to write an expression with the least number of operators such that the expression equals the given target. Return the least number of operators used.

+ +

 

+

Example 1:

+ +
+Input: x = 3, target = 19
+Output: 5
+Explanation: 3 * 3 + 3 * 3 + 3 / 3.
+The expression contains 5 operations.
+
+ +

Example 2:

+ +
+Input: x = 5, target = 501
+Output: 8
+Explanation: 5 * 5 * 5 * 5 - 5 * 5 * 5 + 5 / 5.
+The expression contains 8 operations.
+
+ +

Example 3:

+ +
+Input: x = 100, target = 100000000
+Output: 3
+Explanation: 100 * 100 * 100 * 100.
+The expression contains 3 operations.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= x <= 100
    • +
  • 1 <= target <= 2 * 108
    • +
+",3.0,False,"class Solution { +public: + int leastOpsExpressTarget(int x, int target) { + + } +};","class Solution { + public int leastOpsExpressTarget(int x, int target) { + + } +}","class Solution(object): + def leastOpsExpressTarget(self, x, target): + """""" + :type x: int + :type target: int + :rtype: int + """""" + ","class Solution: + def leastOpsExpressTarget(self, x: int, target: int) -> int: + ","int leastOpsExpressTarget(int x, int target){ + +}","public class Solution { + public int LeastOpsExpressTarget(int x, int target) { + + } +}","/** + * @param {number} x + * @param {number} target + * @return {number} + */ +var leastOpsExpressTarget = function(x, target) { + +};","# @param {Integer} x +# @param {Integer} target +# @return {Integer} +def least_ops_express_target(x, target) + +end","class Solution { + func leastOpsExpressTarget(_ x: Int, _ target: Int) -> Int { + + } +}","func leastOpsExpressTarget(x int, target int) int { + +}","object Solution { + def leastOpsExpressTarget(x: Int, target: Int): Int = { + + } +}","class Solution { + fun leastOpsExpressTarget(x: Int, target: Int): Int { + + } +}","impl Solution { + pub fn least_ops_express_target(x: i32, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $x + * @param Integer $target + * @return Integer + */ + function leastOpsExpressTarget($x, $target) { + + } +}","function leastOpsExpressTarget(x: number, target: number): number { + +};","(define/contract (least-ops-express-target x target) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec least_ops_express_target(X :: integer(), Target :: integer()) -> integer(). +least_ops_express_target(X, Target) -> + .","defmodule Solution do + @spec least_ops_express_target(x :: integer, target :: integer) :: integer + def least_ops_express_target(x, target) do + + end +end","class Solution { + int leastOpsExpressTarget(int x, int target) { + + } +}", +1364,delete-columns-to-make-sorted-iii,Delete Columns to Make Sorted III,960.0,1000.0,"

You are given an array of n strings strs, all of the same length.

+ +

We may choose any deletion indices, and we delete all the characters in those indices for each string.

+ +

For example, if we have strs = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3}, then the final array after deletions is ["bef", "vyz"].

+ +

Suppose we chose a set of deletion indices answer such that after deletions, the final array has every string (row) in lexicographic order. (i.e., (strs[0][0] <= strs[0][1] <= ... <= strs[0][strs[0].length - 1]), and (strs[1][0] <= strs[1][1] <= ... <= strs[1][strs[1].length - 1]), and so on). Return the minimum possible value of answer.length.

+ +

 

+

Example 1:

+ +
+Input: strs = ["babca","bbazb"]
+Output: 3
+Explanation: After deleting columns 0, 1, and 4, the final array is strs = ["bc", "az"].
+Both these rows are individually in lexicographic order (ie. strs[0][0] <= strs[0][1] and strs[1][0] <= strs[1][1]).
+Note that strs[0] > strs[1] - the array strs is not necessarily in lexicographic order.
+ +

Example 2:

+ +
+Input: strs = ["edcba"]
+Output: 4
+Explanation: If we delete less than 4 columns, the only row will not be lexicographically sorted.
+
+ +

Example 3:

+ +
+Input: strs = ["ghi","def","abc"]
+Output: 0
+Explanation: All rows are already lexicographically sorted.
+
+ +

 

+

Constraints:

+ +
    +
  • n == strs.length
    • +
  • 1 <= n <= 100
    • +
  • 1 <= strs[i].length <= 100
    • +
  • strs[i] consists of lowercase English letters.
    • +
+ +
    +
  •  
    • +
+",3.0,False,"class Solution { +public: + int minDeletionSize(vector& strs) { + + } +};","class Solution { + public int minDeletionSize(String[] strs) { + + } +}","class Solution(object): + def minDeletionSize(self, strs): + """""" + :type strs: List[str] + :rtype: int + """""" + ","class Solution: + def minDeletionSize(self, strs: List[str]) -> int: + ","int minDeletionSize(char ** strs, int strsSize){ + +}","public class Solution { + public int MinDeletionSize(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {number} + */ +var minDeletionSize = function(strs) { + +};","# @param {String[]} strs +# @return {Integer} +def min_deletion_size(strs) + +end","class Solution { + func minDeletionSize(_ strs: [String]) -> Int { + + } +}","func minDeletionSize(strs []string) int { + +}","object Solution { + def minDeletionSize(strs: Array[String]): Int = { + + } +}","class Solution { + fun minDeletionSize(strs: Array): Int { + + } +}","impl Solution { + pub fn min_deletion_size(strs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return Integer + */ + function minDeletionSize($strs) { + + } +}","function minDeletionSize(strs: string[]): number { + +};","(define/contract (min-deletion-size strs) + (-> (listof string?) exact-integer?) + + )","-spec min_deletion_size(Strs :: [unicode:unicode_binary()]) -> integer(). +min_deletion_size(Strs) -> + .","defmodule Solution do + @spec min_deletion_size(strs :: [String.t]) :: integer + def min_deletion_size(strs) do + + end +end","class Solution { + int minDeletionSize(List strs) { + + } +}", +1365,regions-cut-by-slashes,Regions Cut By Slashes,959.0,999.0,"

An n x n grid is composed of 1 x 1 squares where each 1 x 1 square consists of a '/', '\', or blank space ' '. These characters divide the square into contiguous regions.

+ +

Given the grid grid represented as a string array, return the number of regions.

+ +

Note that backslash characters are escaped, so a '\' is represented as '\\'.

+ +

 

+

Example 1:

+ +
+Input: grid = [" /","/ "]
+Output: 2
+
+ +

Example 2:

+ +
+Input: grid = [" /","  "]
+Output: 1
+
+ +

Example 3:

+ +
+Input: grid = ["/\\","\\/"]
+Output: 5
+Explanation: Recall that because \ characters are escaped, "\\/" refers to \/, and "/\\" refers to /\.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
    • +
  • 1 <= n <= 30
    • +
  • grid[i][j] is either '/', '\', or ' '.
    • +
+",2.0,False,"class Solution { +public: + int regionsBySlashes(vector& grid) { + + } +};","class Solution { + public int regionsBySlashes(String[] grid) { + + } +}","class Solution(object): + def regionsBySlashes(self, grid): + """""" + :type grid: List[str] + :rtype: int + """""" + ","class Solution: + def regionsBySlashes(self, grid: List[str]) -> int: + ","int regionsBySlashes(char ** grid, int gridSize){ + +}","public class Solution { + public int RegionsBySlashes(string[] grid) { + + } +}","/** + * @param {string[]} grid + * @return {number} + */ +var regionsBySlashes = function(grid) { + +};","# @param {String[]} grid +# @return {Integer} +def regions_by_slashes(grid) + +end","class Solution { + func regionsBySlashes(_ grid: [String]) -> Int { + + } +}","func regionsBySlashes(grid []string) int { + +}","object Solution { + def regionsBySlashes(grid: Array[String]): Int = { + + } +}","class Solution { + fun regionsBySlashes(grid: Array): Int { + + } +}","impl Solution { + pub fn regions_by_slashes(grid: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $grid + * @return Integer + */ + function regionsBySlashes($grid) { + + } +}","function regionsBySlashes(grid: string[]): number { + +};","(define/contract (regions-by-slashes grid) + (-> (listof string?) exact-integer?) + + )","-spec regions_by_slashes(Grid :: [unicode:unicode_binary()]) -> integer(). +regions_by_slashes(Grid) -> + .","defmodule Solution do + @spec regions_by_slashes(grid :: [String.t]) :: integer + def regions_by_slashes(grid) do + + end +end","class Solution { + int regionsBySlashes(List grid) { + + } +}", +1367,prison-cells-after-n-days,Prison Cells After N Days,957.0,994.0,"

There are 8 prison cells in a row and each cell is either occupied or vacant.

+ +

Each day, whether the cell is occupied or vacant changes according to the following rules:

+ +
    +
  • If a cell has two adjacent neighbors that are both occupied or both vacant, then the cell becomes occupied.
    • +
  • Otherwise, it becomes vacant.
    • +
+ +

Note that because the prison is a row, the first and the last cells in the row can't have two adjacent neighbors.

+ +

You are given an integer array cells where cells[i] == 1 if the ith cell is occupied and cells[i] == 0 if the ith cell is vacant, and you are given an integer n.

+ +

Return the state of the prison after n days (i.e., n such changes described above).

+ +

 

+

Example 1:

+ +
+Input: cells = [0,1,0,1,1,0,0,1], n = 7
+Output: [0,0,1,1,0,0,0,0]
+Explanation: The following table summarizes the state of the prison on each day:
+Day 0: [0, 1, 0, 1, 1, 0, 0, 1]
+Day 1: [0, 1, 1, 0, 0, 0, 0, 0]
+Day 2: [0, 0, 0, 0, 1, 1, 1, 0]
+Day 3: [0, 1, 1, 0, 0, 1, 0, 0]
+Day 4: [0, 0, 0, 0, 0, 1, 0, 0]
+Day 5: [0, 1, 1, 1, 0, 1, 0, 0]
+Day 6: [0, 0, 1, 0, 1, 1, 0, 0]
+Day 7: [0, 0, 1, 1, 0, 0, 0, 0]
+
+ +

Example 2:

+ +
+Input: cells = [1,0,0,1,0,0,1,0], n = 1000000000
+Output: [0,0,1,1,1,1,1,0]
+
+ +

 

+

Constraints:

+ +
    +
  • cells.length == 8
    • +
  • cells[i] is either 0 or 1.
    • +
  • 1 <= n <= 109
    • +
+",2.0,False,"class Solution { +public: + vector prisonAfterNDays(vector& cells, int n) { + + } +};","class Solution { + public int[] prisonAfterNDays(int[] cells, int n) { + + } +}","class Solution(object): + def prisonAfterNDays(self, cells, n): + """""" + :type cells: List[int] + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def prisonAfterNDays(self, cells: List[int], n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* prisonAfterNDays(int* cells, int cellsSize, int n, int* returnSize){ + +}","public class Solution { + public int[] PrisonAfterNDays(int[] cells, int n) { + + } +}","/** + * @param {number[]} cells + * @param {number} n + * @return {number[]} + */ +var prisonAfterNDays = function(cells, n) { + +};","# @param {Integer[]} cells +# @param {Integer} n +# @return {Integer[]} +def prison_after_n_days(cells, n) + +end","class Solution { + func prisonAfterNDays(_ cells: [Int], _ n: Int) -> [Int] { + + } +}","func prisonAfterNDays(cells []int, n int) []int { + +}","object Solution { + def prisonAfterNDays(cells: Array[Int], n: Int): Array[Int] = { + + } +}","class Solution { + fun prisonAfterNDays(cells: IntArray, n: Int): IntArray { + + } +}","impl Solution { + pub fn prison_after_n_days(cells: Vec, n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $cells + * @param Integer $n + * @return Integer[] + */ + function prisonAfterNDays($cells, $n) { + + } +}","function prisonAfterNDays(cells: number[], n: number): number[] { + +};","(define/contract (prison-after-n-days cells n) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec prison_after_n_days(Cells :: [integer()], N :: integer()) -> [integer()]. +prison_after_n_days(Cells, N) -> + .","defmodule Solution do + @spec prison_after_n_days(cells :: [integer], n :: integer) :: [integer] + def prison_after_n_days(cells, n) do + + end +end","class Solution { + List prisonAfterNDays(List cells, int n) { + + } +}", +1368,tallest-billboard,Tallest Billboard,956.0,993.0,"

You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be an equal height.

+ +

You are given a collection of rods that can be welded together. For example, if you have rods of lengths 1, 2, and 3, you can weld them together to make a support of length 6.

+ +

Return the largest possible height of your billboard installation. If you cannot support the billboard, return 0.

+ +

 

+

Example 1:

+ +
+Input: rods = [1,2,3,6]
+Output: 6
+Explanation: We have two disjoint subsets {1,2,3} and {6}, which have the same sum = 6.
+
+ +

Example 2:

+ +
+Input: rods = [1,2,3,4,5,6]
+Output: 10
+Explanation: We have two disjoint subsets {2,3,5} and {4,6}, which have the same sum = 10.
+
+ +

Example 3:

+ +
+Input: rods = [1,2]
+Output: 0
+Explanation: The billboard cannot be supported, so we return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rods.length <= 20
    • +
  • 1 <= rods[i] <= 1000
    • +
  • sum(rods[i]) <= 5000
    • +
+",3.0,False,"class Solution { +public: + int tallestBillboard(vector& rods) { + + } +};","class Solution { + public int tallestBillboard(int[] rods) { + + } +}","class Solution(object): + def tallestBillboard(self, rods): + """""" + :type rods: List[int] + :rtype: int + """""" + ","class Solution: + def tallestBillboard(self, rods: List[int]) -> int: + ","int tallestBillboard(int* rods, int rodsSize){ + +}","public class Solution { + public int TallestBillboard(int[] rods) { + + } +}","/** + * @param {number[]} rods + * @return {number} + */ +var tallestBillboard = function(rods) { + +};","# @param {Integer[]} rods +# @return {Integer} +def tallest_billboard(rods) + +end","class Solution { + func tallestBillboard(_ rods: [Int]) -> Int { + + } +}","func tallestBillboard(rods []int) int { + +}","object Solution { + def tallestBillboard(rods: Array[Int]): Int = { + + } +}","class Solution { + fun tallestBillboard(rods: IntArray): Int { + + } +}","impl Solution { + pub fn tallest_billboard(rods: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $rods + * @return Integer + */ + function tallestBillboard($rods) { + + } +}","function tallestBillboard(rods: number[]): number { + +};","(define/contract (tallest-billboard rods) + (-> (listof exact-integer?) exact-integer?) + + )","-spec tallest_billboard(Rods :: [integer()]) -> integer(). +tallest_billboard(Rods) -> + .","defmodule Solution do + @spec tallest_billboard(rods :: [integer]) :: integer + def tallest_billboard(rods) do + + end +end","class Solution { + int tallestBillboard(List rods) { + + } +}", +1369,delete-columns-to-make-sorted-ii,Delete Columns to Make Sorted II,955.0,992.0,"

You are given an array of n strings strs, all of the same length.

+ +

We may choose any deletion indices, and we delete all the characters in those indices for each string.

+ +

For example, if we have strs = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3}, then the final array after deletions is ["bef", "vyz"].

+ +

Suppose we chose a set of deletion indices answer such that after deletions, the final array has its elements in lexicographic order (i.e., strs[0] <= strs[1] <= strs[2] <= ... <= strs[n - 1]). Return the minimum possible value of answer.length.

+ +

 

+

Example 1:

+ +
+Input: strs = ["ca","bb","ac"]
+Output: 1
+Explanation: 
+After deleting the first column, strs = ["a", "b", "c"].
+Now strs is in lexicographic order (ie. strs[0] <= strs[1] <= strs[2]).
+We require at least 1 deletion since initially strs was not in lexicographic order, so the answer is 1.
+
+ +

Example 2:

+ +
+Input: strs = ["xc","yb","za"]
+Output: 0
+Explanation: 
+strs is already in lexicographic order, so we do not need to delete anything.
+Note that the rows of strs are not necessarily in lexicographic order:
+i.e., it is NOT necessarily true that (strs[0][0] <= strs[0][1] <= ...)
+
+ +

Example 3:

+ +
+Input: strs = ["zyx","wvu","tsr"]
+Output: 3
+Explanation: We have to delete every column.
+
+ +

 

+

Constraints:

+ +
    +
  • n == strs.length
    • +
  • 1 <= n <= 100
    • +
  • 1 <= strs[i].length <= 100
    • +
  • strs[i] consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minDeletionSize(vector& strs) { + + } +};","class Solution { + public int minDeletionSize(String[] strs) { + + } +}","class Solution(object): + def minDeletionSize(self, strs): + """""" + :type strs: List[str] + :rtype: int + """""" + ","class Solution: + def minDeletionSize(self, strs: List[str]) -> int: + ","int minDeletionSize(char ** strs, int strsSize){ + +}","public class Solution { + public int MinDeletionSize(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {number} + */ +var minDeletionSize = function(strs) { + +};","# @param {String[]} strs +# @return {Integer} +def min_deletion_size(strs) + +end","class Solution { + func minDeletionSize(_ strs: [String]) -> Int { + + } +}","func minDeletionSize(strs []string) int { + +}","object Solution { + def minDeletionSize(strs: Array[String]): Int = { + + } +}","class Solution { + fun minDeletionSize(strs: Array): Int { + + } +}","impl Solution { + pub fn min_deletion_size(strs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return Integer + */ + function minDeletionSize($strs) { + + } +}","function minDeletionSize(strs: string[]): number { + +};","(define/contract (min-deletion-size strs) + (-> (listof string?) exact-integer?) + + )","-spec min_deletion_size(Strs :: [unicode:unicode_binary()]) -> integer(). +min_deletion_size(Strs) -> + .","defmodule Solution do + @spec min_deletion_size(strs :: [String.t]) :: integer + def min_deletion_size(strs) do + + end +end","class Solution { + int minDeletionSize(List strs) { + + } +}", +1370,array-of-doubled-pairs,Array of Doubled Pairs,954.0,991.0,"

Given an integer array of even length arr, return true if it is possible to reorder arr such that arr[2 * i + 1] = 2 * arr[2 * i] for every 0 <= i < len(arr) / 2, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: arr = [3,1,3,6]
+Output: false
+
+ +

Example 2:

+ +
+Input: arr = [2,1,2,6]
+Output: false
+
+ +

Example 3:

+ +
+Input: arr = [4,-2,2,-4]
+Output: true
+Explanation: We can take two groups, [-2,-4] and [2,4] to form [-2,-4,2,4] or [2,4,-2,-4].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= arr.length <= 3 * 104
    • +
  • arr.length is even.
    • +
  • -105 <= arr[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + bool canReorderDoubled(vector& arr) { + + } +};","class Solution { + public boolean canReorderDoubled(int[] arr) { + + } +}","class Solution(object): + def canReorderDoubled(self, arr): + """""" + :type arr: List[int] + :rtype: bool + """""" + ","class Solution: + def canReorderDoubled(self, arr: List[int]) -> bool: + ","bool canReorderDoubled(int* arr, int arrSize){ + +}","public class Solution { + public bool CanReorderDoubled(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {boolean} + */ +var canReorderDoubled = function(arr) { + +};","# @param {Integer[]} arr +# @return {Boolean} +def can_reorder_doubled(arr) + +end","class Solution { + func canReorderDoubled(_ arr: [Int]) -> Bool { + + } +}","func canReorderDoubled(arr []int) bool { + +}","object Solution { + def canReorderDoubled(arr: Array[Int]): Boolean = { + + } +}","class Solution { + fun canReorderDoubled(arr: IntArray): Boolean { + + } +}","impl Solution { + pub fn can_reorder_doubled(arr: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Boolean + */ + function canReorderDoubled($arr) { + + } +}","function canReorderDoubled(arr: number[]): boolean { + +};","(define/contract (can-reorder-doubled arr) + (-> (listof exact-integer?) boolean?) + + )","-spec can_reorder_doubled(Arr :: [integer()]) -> boolean(). +can_reorder_doubled(Arr) -> + .","defmodule Solution do + @spec can_reorder_doubled(arr :: [integer]) :: boolean + def can_reorder_doubled(arr) do + + end +end","class Solution { + bool canReorderDoubled(List arr) { + + } +}", +1371,verifying-an-alien-dictionary,Verifying an Alien Dictionary,953.0,990.0,"

In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

+ +

Given a sequence of words written in the alien language, and the order of the alphabet, return true if and only if the given words are sorted lexicographically in this alien language.

+ +

 

+

Example 1:

+ +
+Input: words = ["hello","leetcode"], order = "hlabcdefgijkmnopqrstuvwxyz"
+Output: true
+Explanation: As 'h' comes before 'l' in this language, then the sequence is sorted.
+
+ +

Example 2:

+ +
+Input: words = ["word","world","row"], order = "worldabcefghijkmnpqstuvxyz"
+Output: false
+Explanation: As 'd' comes after 'l' in this language, then words[0] > words[1], hence the sequence is unsorted.
+
+ +

Example 3:

+ +
+Input: words = ["apple","app"], order = "abcdefghijklmnopqrstuvwxyz"
+Output: false
+Explanation: The first three characters "app" match, and the second string is shorter (in size.) According to lexicographical rules "apple" > "app", because 'l' > '∅', where '∅' is defined as the blank character which is less than any other character (More info).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
    • +
  • 1 <= words[i].length <= 20
    • +
  • order.length == 26
    • +
  • All characters in words[i] and order are English lowercase letters.
    • +
+",1.0,False,"class Solution { +public: + bool isAlienSorted(vector& words, string order) { + + } +};","class Solution { + public boolean isAlienSorted(String[] words, String order) { + + } +}","class Solution(object): + def isAlienSorted(self, words, order): + """""" + :type words: List[str] + :type order: str + :rtype: bool + """""" + ","class Solution: + def isAlienSorted(self, words: List[str], order: str) -> bool: + ","bool isAlienSorted(char ** words, int wordsSize, char * order){ + +}","public class Solution { + public bool IsAlienSorted(string[] words, string order) { + + } +}","/** + * @param {string[]} words + * @param {string} order + * @return {boolean} + */ +var isAlienSorted = function(words, order) { + +};","# @param {String[]} words +# @param {String} order +# @return {Boolean} +def is_alien_sorted(words, order) + +end","class Solution { + func isAlienSorted(_ words: [String], _ order: String) -> Bool { + + } +}","func isAlienSorted(words []string, order string) bool { + +}","object Solution { + def isAlienSorted(words: Array[String], order: String): Boolean = { + + } +}","class Solution { + fun isAlienSorted(words: Array, order: String): Boolean { + + } +}","impl Solution { + pub fn is_alien_sorted(words: Vec, order: String) -> bool { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String $order + * @return Boolean + */ + function isAlienSorted($words, $order) { + + } +}","function isAlienSorted(words: string[], order: string): boolean { + +};","(define/contract (is-alien-sorted words order) + (-> (listof string?) string? boolean?) + + )","-spec is_alien_sorted(Words :: [unicode:unicode_binary()], Order :: unicode:unicode_binary()) -> boolean(). +is_alien_sorted(Words, Order) -> + .","defmodule Solution do + @spec is_alien_sorted(words :: [String.t], order :: String.t) :: boolean + def is_alien_sorted(words, order) do + + end +end","class Solution { + bool isAlienSorted(List words, String order) { + + } +}", +1372,largest-component-size-by-common-factor,Largest Component Size by Common Factor,952.0,989.0,"

You are given an integer array of unique positive integers nums. Consider the following graph:

+ +
    +
  • There are nums.length nodes, labeled nums[0] to nums[nums.length - 1],
    • +
  • There is an undirected edge between nums[i] and nums[j] if nums[i] and nums[j] share a common factor greater than 1.
    • +
+ +

Return the size of the largest connected component in the graph.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,6,15,35]
+Output: 4
+
+ +

Example 2:

+ +
+Input: nums = [20,50,9,63]
+Output: 2
+
+ +

Example 3:

+ +
+Input: nums = [2,3,6,7,4,12,21,39]
+Output: 8
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 104
    • +
  • 1 <= nums[i] <= 105
    • +
  • All the values of nums are unique.
    • +
+",3.0,False,"class Solution { +public: + int largestComponentSize(vector& nums) { + + } +};","class Solution { + public int largestComponentSize(int[] nums) { + + } +}","class Solution(object): + def largestComponentSize(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def largestComponentSize(self, nums: List[int]) -> int: + ","int largestComponentSize(int* nums, int numsSize){ + +}","public class Solution { + public int LargestComponentSize(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var largestComponentSize = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def largest_component_size(nums) + +end","class Solution { + func largestComponentSize(_ nums: [Int]) -> Int { + + } +}","func largestComponentSize(nums []int) int { + +}","object Solution { + def largestComponentSize(nums: Array[Int]): Int = { + + } +}","class Solution { + fun largestComponentSize(nums: IntArray): Int { + + } +}","impl Solution { + pub fn largest_component_size(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function largestComponentSize($nums) { + + } +}","function largestComponentSize(nums: number[]): number { + +};","(define/contract (largest-component-size nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec largest_component_size(Nums :: [integer()]) -> integer(). +largest_component_size(Nums) -> + .","defmodule Solution do + @spec largest_component_size(nums :: [integer]) :: integer + def largest_component_size(nums) do + + end +end","class Solution { + int largestComponentSize(List nums) { + + } +}", +1375,largest-time-for-given-digits,Largest Time for Given Digits,949.0,986.0,"

Given an array arr of 4 digits, find the latest 24-hour time that can be made using each digit exactly once.

+ +

24-hour times are formatted as "HH:MM", where HH is between 00 and 23, and MM is between 00 and 59. The earliest 24-hour time is 00:00, and the latest is 23:59.

+ +

Return the latest 24-hour time in "HH:MM" format. If no valid time can be made, return an empty string.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,4]
+Output: "23:41"
+Explanation: The valid 24-hour times are "12:34", "12:43", "13:24", "13:42", "14:23", "14:32", "21:34", "21:43", "23:14", and "23:41". Of these times, "23:41" is the latest.
+
+ +

Example 2:

+ +
+Input: arr = [5,5,5,5]
+Output: ""
+Explanation: There are no valid 24-hour times as "55:55" is not valid.
+
+ +

 

+

Constraints:

+ +
    +
  • arr.length == 4
    • +
  • 0 <= arr[i] <= 9
    • +
+",2.0,False,"class Solution { +public: + string largestTimeFromDigits(vector& arr) { + + } +};","class Solution { + public String largestTimeFromDigits(int[] arr) { + + } +}","class Solution(object): + def largestTimeFromDigits(self, arr): + """""" + :type arr: List[int] + :rtype: str + """""" + ","class Solution: + def largestTimeFromDigits(self, arr: List[int]) -> str: + ","char * largestTimeFromDigits(int* arr, int arrSize){ + +}","public class Solution { + public string LargestTimeFromDigits(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {string} + */ +var largestTimeFromDigits = function(arr) { + +};","# @param {Integer[]} arr +# @return {String} +def largest_time_from_digits(arr) + +end","class Solution { + func largestTimeFromDigits(_ arr: [Int]) -> String { + + } +}","func largestTimeFromDigits(arr []int) string { + +}","object Solution { + def largestTimeFromDigits(arr: Array[Int]): String = { + + } +}","class Solution { + fun largestTimeFromDigits(arr: IntArray): String { + + } +}","impl Solution { + pub fn largest_time_from_digits(arr: Vec) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return String + */ + function largestTimeFromDigits($arr) { + + } +}","function largestTimeFromDigits(arr: number[]): string { + +};","(define/contract (largest-time-from-digits arr) + (-> (listof exact-integer?) string?) + + )","-spec largest_time_from_digits(Arr :: [integer()]) -> unicode:unicode_binary(). +largest_time_from_digits(Arr) -> + .","defmodule Solution do + @spec largest_time_from_digits(arr :: [integer]) :: String.t + def largest_time_from_digits(arr) do + + end +end","class Solution { + String largestTimeFromDigits(List arr) { + + } +}", +1377,most-stones-removed-with-same-row-or-column,Most Stones Removed with Same Row or Column,947.0,984.0,"

On a 2D plane, we place n stones at some integer coordinate points. Each coordinate point may have at most one stone.

+ +

A stone can be removed if it shares either the same row or the same column as another stone that has not been removed.

+ +

Given an array stones of length n where stones[i] = [xi, yi] represents the location of the ith stone, return the largest possible number of stones that can be removed.

+ +

 

+

Example 1:

+ +
+Input: stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]]
+Output: 5
+Explanation: One way to remove 5 stones is as follows:
+1. Remove stone [2,2] because it shares the same row as [2,1].
+2. Remove stone [2,1] because it shares the same column as [0,1].
+3. Remove stone [1,2] because it shares the same row as [1,0].
+4. Remove stone [1,0] because it shares the same column as [0,0].
+5. Remove stone [0,1] because it shares the same row as [0,0].
+Stone [0,0] cannot be removed since it does not share a row/column with another stone still on the plane.
+
+ +

Example 2:

+ +
+Input: stones = [[0,0],[0,2],[1,1],[2,0],[2,2]]
+Output: 3
+Explanation: One way to make 3 moves is as follows:
+1. Remove stone [2,2] because it shares the same row as [2,0].
+2. Remove stone [2,0] because it shares the same column as [0,0].
+3. Remove stone [0,2] because it shares the same row as [0,0].
+Stones [0,0] and [1,1] cannot be removed since they do not share a row/column with another stone still on the plane.
+
+ +

Example 3:

+ +
+Input: stones = [[0,0]]
+Output: 0
+Explanation: [0,0] is the only stone on the plane, so you cannot remove it.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= stones.length <= 1000
    • +
  • 0 <= xi, yi <= 104
    • +
  • No two stones are at the same coordinate point.
    • +
+",2.0,False,"class Solution { +public: + int removeStones(vector>& stones) { + + } +};","class Solution { + public int removeStones(int[][] stones) { + + } +}","class Solution(object): + def removeStones(self, stones): + """""" + :type stones: List[List[int]] + :rtype: int + """""" + ","class Solution: + def removeStones(self, stones: List[List[int]]) -> int: + ","int removeStones(int** stones, int stonesSize, int* stonesColSize){ + +}","public class Solution { + public int RemoveStones(int[][] stones) { + + } +}","/** + * @param {number[][]} stones + * @return {number} + */ +var removeStones = function(stones) { + +};","# @param {Integer[][]} stones +# @return {Integer} +def remove_stones(stones) + +end","class Solution { + func removeStones(_ stones: [[Int]]) -> Int { + + } +}","func removeStones(stones [][]int) int { + +}","object Solution { + def removeStones(stones: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun removeStones(stones: Array): Int { + + } +}","impl Solution { + pub fn remove_stones(stones: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $stones + * @return Integer + */ + function removeStones($stones) { + + } +}","function removeStones(stones: number[][]): number { + +};","(define/contract (remove-stones stones) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec remove_stones(Stones :: [[integer()]]) -> integer(). +remove_stones(Stones) -> + .","defmodule Solution do + @spec remove_stones(stones :: [[integer]]) :: integer + def remove_stones(stones) do + + end +end","class Solution { + int removeStones(List> stones) { + + } +}", +1378,validate-stack-sequences,Validate Stack Sequences,946.0,983.0,"

Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
+Output: true
+Explanation: We might do the following sequence:
+push(1), push(2), push(3), push(4),
+pop() -> 4,
+push(5),
+pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
+
+ +

Example 2:

+ +
+Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
+Output: false
+Explanation: 1 cannot be popped before 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pushed.length <= 1000
    • +
  • 0 <= pushed[i] <= 1000
    • +
  • All the elements of pushed are unique.
    • +
  • popped.length == pushed.length
    • +
  • popped is a permutation of pushed.
    • +
+",2.0,False,"class Solution { +public: + bool validateStackSequences(vector& pushed, vector& popped) { + + } +};","class Solution { + public boolean validateStackSequences(int[] pushed, int[] popped) { + + } +}","class Solution(object): + def validateStackSequences(self, pushed, popped): + """""" + :type pushed: List[int] + :type popped: List[int] + :rtype: bool + """""" + ","class Solution: + def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool: + ","bool validateStackSequences(int* pushed, int pushedSize, int* popped, int poppedSize){ + +}","public class Solution { + public bool ValidateStackSequences(int[] pushed, int[] popped) { + + } +}","/** + * @param {number[]} pushed + * @param {number[]} popped + * @return {boolean} + */ +var validateStackSequences = function(pushed, popped) { + +};","# @param {Integer[]} pushed +# @param {Integer[]} popped +# @return {Boolean} +def validate_stack_sequences(pushed, popped) + +end","class Solution { + func validateStackSequences(_ pushed: [Int], _ popped: [Int]) -> Bool { + + } +}","func validateStackSequences(pushed []int, popped []int) bool { + +}","object Solution { + def validateStackSequences(pushed: Array[Int], popped: Array[Int]): Boolean = { + + } +}","class Solution { + fun validateStackSequences(pushed: IntArray, popped: IntArray): Boolean { + + } +}","impl Solution { + pub fn validate_stack_sequences(pushed: Vec, popped: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $pushed + * @param Integer[] $popped + * @return Boolean + */ + function validateStackSequences($pushed, $popped) { + + } +}","function validateStackSequences(pushed: number[], popped: number[]): boolean { + +};","(define/contract (validate-stack-sequences pushed popped) + (-> (listof exact-integer?) (listof exact-integer?) boolean?) + + )","-spec validate_stack_sequences(Pushed :: [integer()], Popped :: [integer()]) -> boolean(). +validate_stack_sequences(Pushed, Popped) -> + .","defmodule Solution do + @spec validate_stack_sequences(pushed :: [integer], popped :: [integer]) :: boolean + def validate_stack_sequences(pushed, popped) do + + end +end","class Solution { + bool validateStackSequences(List pushed, List popped) { + + } +}", +1380,delete-columns-to-make-sorted,Delete Columns to Make Sorted,944.0,981.0,"

You are given an array of n strings strs, all of the same length.

+ +

The strings can be arranged such that there is one on each line, making a grid.

+ +
    +
  • For example, strs = ["abc", "bce", "cae"] can be arranged as follows:
    • +
+ +
+abc
+bce
+cae
+
+ +

You want to delete the columns that are not sorted lexicographically. In the above example (0-indexed), columns 0 ('a', 'b', 'c') and 2 ('c', 'e', 'e') are sorted, while column 1 ('b', 'c', 'a') is not, so you would delete column 1.

+ +

Return the number of columns that you will delete.

+ +

 

+

Example 1:

+ +
+Input: strs = ["cba","daf","ghi"]
+Output: 1
+Explanation: The grid looks as follows:
+  cba
+  daf
+  ghi
+Columns 0 and 2 are sorted, but column 1 is not, so you only need to delete 1 column.
+
+ +

Example 2:

+ +
+Input: strs = ["a","b"]
+Output: 0
+Explanation: The grid looks as follows:
+  a
+  b
+Column 0 is the only column and is sorted, so you will not delete any columns.
+
+ +

Example 3:

+ +
+Input: strs = ["zyx","wvu","tsr"]
+Output: 3
+Explanation: The grid looks as follows:
+  zyx
+  wvu
+  tsr
+All 3 columns are not sorted, so you will delete all 3.
+
+ +

 

+

Constraints:

+ +
    +
  • n == strs.length
    • +
  • 1 <= n <= 100
    • +
  • 1 <= strs[i].length <= 1000
    • +
  • strs[i] consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + int minDeletionSize(vector& strs) { + + } +};","class Solution { + public int minDeletionSize(String[] strs) { + + } +}","class Solution(object): + def minDeletionSize(self, strs): + """""" + :type strs: List[str] + :rtype: int + """""" + ","class Solution: + def minDeletionSize(self, strs: List[str]) -> int: + ","int minDeletionSize(char ** strs, int strsSize){ + +}","public class Solution { + public int MinDeletionSize(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {number} + */ +var minDeletionSize = function(strs) { + +};","# @param {String[]} strs +# @return {Integer} +def min_deletion_size(strs) + +end","class Solution { + func minDeletionSize(_ strs: [String]) -> Int { + + } +}","func minDeletionSize(strs []string) int { + +}","object Solution { + def minDeletionSize(strs: Array[String]): Int = { + + } +}","class Solution { + fun minDeletionSize(strs: Array): Int { + + } +}","impl Solution { + pub fn min_deletion_size(strs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return Integer + */ + function minDeletionSize($strs) { + + } +}","function minDeletionSize(strs: string[]): number { + +};","(define/contract (min-deletion-size strs) + (-> (listof string?) exact-integer?) + + )","-spec min_deletion_size(Strs :: [unicode:unicode_binary()]) -> integer(). +min_deletion_size(Strs) -> + .","defmodule Solution do + @spec min_deletion_size(strs :: [String.t]) :: integer + def min_deletion_size(strs) do + + end +end","class Solution { + int minDeletionSize(List strs) { + + } +}", +1381,find-the-shortest-superstring,Find the Shortest Superstring,943.0,980.0,"

Given an array of strings words, return the smallest string that contains each string in words as a substring. If there are multiple valid strings of the smallest length, return any of them.

+ +

You may assume that no string in words is a substring of another string in words.

+ +

 

+

Example 1:

+ +
+Input: words = ["alex","loves","leetcode"]
+Output: "alexlovesleetcode"
+Explanation: All permutations of "alex","loves","leetcode" would also be accepted.
+
+ +

Example 2:

+ +
+Input: words = ["catg","ctaagt","gcta","ttca","atgcatc"]
+Output: "gctaagttcatgcatc"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 12
    • +
  • 1 <= words[i].length <= 20
    • +
  • words[i] consists of lowercase English letters.
    • +
  • All the strings of words are unique.
    • +
+",3.0,False,"class Solution { +public: + string shortestSuperstring(vector& words) { + + } +};","class Solution { + public String shortestSuperstring(String[] words) { + + } +}","class Solution(object): + def shortestSuperstring(self, words): + """""" + :type words: List[str] + :rtype: str + """""" + ","class Solution: + def shortestSuperstring(self, words: List[str]) -> str: + ","char * shortestSuperstring(char ** words, int wordsSize){ + +}","public class Solution { + public string ShortestSuperstring(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {string} + */ +var shortestSuperstring = function(words) { + +};","# @param {String[]} words +# @return {String} +def shortest_superstring(words) + +end","class Solution { + func shortestSuperstring(_ words: [String]) -> String { + + } +}","func shortestSuperstring(words []string) string { + +}","object Solution { + def shortestSuperstring(words: Array[String]): String = { + + } +}","class Solution { + fun shortestSuperstring(words: Array): String { + + } +}","impl Solution { + pub fn shortest_superstring(words: Vec) -> String { + + } +}","class Solution { + + /** + * @param String[] $words + * @return String + */ + function shortestSuperstring($words) { + + } +}","function shortestSuperstring(words: string[]): string { + +};","(define/contract (shortest-superstring words) + (-> (listof string?) string?) + + )","-spec shortest_superstring(Words :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +shortest_superstring(Words) -> + .","defmodule Solution do + @spec shortest_superstring(words :: [String.t]) :: String.t + def shortest_superstring(words) do + + end +end","class Solution { + String shortestSuperstring(List words) { + + } +}", +1384,distinct-subsequences-ii,Distinct Subsequences II,940.0,977.0,"

Given a string s, return the number of distinct non-empty subsequences of s. Since the answer may be very large, return it modulo 109 + 7.

+A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not. +

 

+

Example 1:

+ +
+Input: s = "abc"
+Output: 7
+Explanation: The 7 distinct subsequences are "a", "b", "c", "ab", "ac", "bc", and "abc".
+
+ +

Example 2:

+ +
+Input: s = "aba"
+Output: 6
+Explanation: The 6 distinct subsequences are "a", "b", "ab", "aa", "ba", and "aba".
+
+ +

Example 3:

+ +
+Input: s = "aaa"
+Output: 3
+Explanation: The 3 distinct subsequences are "a", "aa" and "aaa".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2000
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int distinctSubseqII(string s) { + + } +};","class Solution { + public int distinctSubseqII(String s) { + + } +}","class Solution(object): + def distinctSubseqII(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def distinctSubseqII(self, s: str) -> int: + ","int distinctSubseqII(char * s){ + +}","public class Solution { + public int DistinctSubseqII(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var distinctSubseqII = function(s) { + +};","# @param {String} s +# @return {Integer} +def distinct_subseq_ii(s) + +end","class Solution { + func distinctSubseqII(_ s: String) -> Int { + + } +}","func distinctSubseqII(s string) int { + +}","object Solution { + def distinctSubseqII(s: String): Int = { + + } +}","class Solution { + fun distinctSubseqII(s: String): Int { + + } +}","impl Solution { + pub fn distinct_subseq_ii(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function distinctSubseqII($s) { + + } +}","function distinctSubseqII(s: string): number { + +};","(define/contract (distinct-subseq-ii s) + (-> string? exact-integer?) + + )","-spec distinct_subseq_ii(S :: unicode:unicode_binary()) -> integer(). +distinct_subseq_ii(S) -> + .","defmodule Solution do + @spec distinct_subseq_ii(s :: String.t) :: integer + def distinct_subseq_ii(s) do + + end +end","class Solution { + int distinctSubseqII(String s) { + + } +}", +1385,minimum-area-rectangle,Minimum Area Rectangle,939.0,976.0,"

You are given an array of points in the X-Y plane points where points[i] = [xi, yi].

+ +

Return the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes. If there is not any such rectangle, return 0.

+ +

 

+

Example 1:

+ +
+Input: points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
+Output: 4
+
+ +

Example 2:

+ +
+Input: points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= points.length <= 500
    • +
  • points[i].length == 2
    • +
  • 0 <= xi, yi <= 4 * 104
    • +
  • All the given points are unique.
    • +
+",2.0,False,"class Solution { +public: + int minAreaRect(vector>& points) { + + } +};","class Solution { + public int minAreaRect(int[][] points) { + + } +}","class Solution(object): + def minAreaRect(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minAreaRect(self, points: List[List[int]]) -> int: + ","int minAreaRect(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int MinAreaRect(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var minAreaRect = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def min_area_rect(points) + +end","class Solution { + func minAreaRect(_ points: [[Int]]) -> Int { + + } +}","func minAreaRect(points [][]int) int { + +}","object Solution { + def minAreaRect(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minAreaRect(points: Array): Int { + + } +}","impl Solution { + pub fn min_area_rect(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function minAreaRect($points) { + + } +}","function minAreaRect(points: number[][]): number { + +};",,"-spec min_area_rect(Points :: [[integer()]]) -> integer(). +min_area_rect(Points) -> + .","defmodule Solution do + @spec min_area_rect(points :: [[integer]]) :: integer + def min_area_rect(points) do + + end +end","class Solution { + int minAreaRect(List> points) { + + } +}", +1388,stamping-the-sequence,Stamping The Sequence,936.0,973.0,"

You are given two strings stamp and target. Initially, there is a string s of length target.length with all s[i] == '?'.

+ +

In one turn, you can place stamp over s and replace every letter in the s with the corresponding letter from stamp.

+ +
    +
  • For example, if stamp = "abc" and target = "abcba", then s is "?????" initially. In one turn you can: + +
      +
    • place stamp at index 0 of s to obtain "abc??",
      • +
    • place stamp at index 1 of s to obtain "?abc?", or
      • +
    • place stamp at index 2 of s to obtain "??abc".
      • +
    + Note that stamp must be fully contained in the boundaries of s in order to stamp (i.e., you cannot place stamp at index 3 of s).
    • +
+ +

We want to convert s to target using at most 10 * target.length turns.

+ +

Return an array of the index of the left-most letter being stamped at each turn. If we cannot obtain target from s within 10 * target.length turns, return an empty array.

+ +

 

+

Example 1:

+ +
+Input: stamp = "abc", target = "ababc"
+Output: [0,2]
+Explanation: Initially s = "?????".
+- Place stamp at index 0 to get "abc??".
+- Place stamp at index 2 to get "ababc".
+[1,0,2] would also be accepted as an answer, as well as some other answers.
+
+ +

Example 2:

+ +
+Input: stamp = "abca", target = "aabcaca"
+Output: [3,0,1]
+Explanation: Initially s = "???????".
+- Place stamp at index 3 to get "???abca".
+- Place stamp at index 0 to get "abcabca".
+- Place stamp at index 1 to get "aabcaca".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= stamp.length <= target.length <= 1000
    • +
  • stamp and target consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + vector movesToStamp(string stamp, string target) { + + } +};","class Solution { + public int[] movesToStamp(String stamp, String target) { + + } +}","class Solution(object): + def movesToStamp(self, stamp, target): + """""" + :type stamp: str + :type target: str + :rtype: List[int] + """""" + ","class Solution: + def movesToStamp(self, stamp: str, target: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* movesToStamp(char * stamp, char * target, int* returnSize){ + +}","public class Solution { + public int[] MovesToStamp(string stamp, string target) { + + } +}","/** + * @param {string} stamp + * @param {string} target + * @return {number[]} + */ +var movesToStamp = function(stamp, target) { + +};","# @param {String} stamp +# @param {String} target +# @return {Integer[]} +def moves_to_stamp(stamp, target) + +end","class Solution { + func movesToStamp(_ stamp: String, _ target: String) -> [Int] { + + } +}","func movesToStamp(stamp string, target string) []int { + +}","object Solution { + def movesToStamp(stamp: String, target: String): Array[Int] = { + + } +}","class Solution { + fun movesToStamp(stamp: String, target: String): IntArray { + + } +}","impl Solution { + pub fn moves_to_stamp(stamp: String, target: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $stamp + * @param String $target + * @return Integer[] + */ + function movesToStamp($stamp, $target) { + + } +}","function movesToStamp(stamp: string, target: string): number[] { + +};",,"-spec moves_to_stamp(Stamp :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> [integer()]. +moves_to_stamp(Stamp, Target) -> + .","defmodule Solution do + @spec moves_to_stamp(stamp :: String.t, target :: String.t) :: [integer] + def moves_to_stamp(stamp, target) do + + end +end","class Solution { + List movesToStamp(String stamp, String target) { + + } +}", +1389,knight-dialer,Knight Dialer,935.0,972.0,"

The chess knight has a unique movement, it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an L). The possible movements of chess knight are shown in this diagaram:

+ +

A chess knight can move as indicated in the chess diagram below:

+ +

We have a chess knight and a phone pad as shown below, the knight can only stand on a numeric cell (i.e. blue cell).

+ +

Given an integer n, return how many distinct phone numbers of length n we can dial.

+ +

You are allowed to place the knight on any numeric cell initially and then you should perform n - 1 jumps to dial a number of length n. All jumps should be valid knight jumps.

+ +

As the answer may be very large, return the answer modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 10
+Explanation: We need to dial a number of length 1, so placing the knight over any numeric cell of the 10 cells is sufficient.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 20
+Explanation: All the valid number we can dial are [04, 06, 16, 18, 27, 29, 34, 38, 40, 43, 49, 60, 61, 67, 72, 76, 81, 83, 92, 94]
+
+ +

Example 3:

+ +
+Input: n = 3131
+Output: 136006598
+Explanation: Please take care of the mod.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 5000
    • +
+",2.0,False,"class Solution { +public: + int knightDialer(int n) { + + } +};","class Solution { + public int knightDialer(int n) { + + } +}","class Solution(object): + def knightDialer(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def knightDialer(self, n: int) -> int: + ","int knightDialer(int n){ + +}","public class Solution { + public int KnightDialer(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var knightDialer = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def knight_dialer(n) + +end","class Solution { + func knightDialer(_ n: Int) -> Int { + + } +}","func knightDialer(n int) int { + +}","object Solution { + def knightDialer(n: Int): Int = { + + } +}","class Solution { + fun knightDialer(n: Int): Int { + + } +}","impl Solution { + pub fn knight_dialer(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function knightDialer($n) { + + } +}","function knightDialer(n: number): number { + +};","(define/contract (knight-dialer n) + (-> exact-integer? exact-integer?) + + )","-spec knight_dialer(N :: integer()) -> integer(). +knight_dialer(N) -> + .","defmodule Solution do + @spec knight_dialer(n :: integer) :: integer + def knight_dialer(n) do + + end +end","class Solution { + int knightDialer(int n) { + + } +}", +1391,number-of-recent-calls,Number of Recent Calls,933.0,969.0,"

You have a RecentCounter class which counts the number of recent requests within a certain time frame.

+ +

Implement the RecentCounter class:

+ +
    +
  • RecentCounter() Initializes the counter with zero recent requests.
    • +
  • int ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive range [t - 3000, t].
    • +
+ +

It is guaranteed that every call to ping uses a strictly larger value of t than the previous call.

+ +

 

+

Example 1:

+ +
+Input
+["RecentCounter", "ping", "ping", "ping", "ping"]
+[[], [1], [100], [3001], [3002]]
+Output
+[null, 1, 2, 3, 3]
+
+Explanation
+RecentCounter recentCounter = new RecentCounter();
+recentCounter.ping(1);     // requests = [1], range is [-2999,1], return 1
+recentCounter.ping(100);   // requests = [1, 100], range is [-2900,100], return 2
+recentCounter.ping(3001);  // requests = [1, 100, 3001], range is [1,3001], return 3
+recentCounter.ping(3002);  // requests = [1, 100, 3001, 3002], range is [2,3002], return 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= t <= 109
    • +
  • Each test case will call ping with strictly increasing values of t.
    • +
  • At most 104 calls will be made to ping.
    • +
+",1.0,False,"class RecentCounter { +public: + RecentCounter() { + + } + + int ping(int t) { + + } +}; + +/** + * Your RecentCounter object will be instantiated and called as such: + * RecentCounter* obj = new RecentCounter(); + * int param_1 = obj->ping(t); + */","class RecentCounter { + + public RecentCounter() { + + } + + public int ping(int t) { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * RecentCounter obj = new RecentCounter(); + * int param_1 = obj.ping(t); + */","class RecentCounter(object): + + def __init__(self): + + + def ping(self, t): + """""" + :type t: int + :rtype: int + """""" + + + +# Your RecentCounter object will be instantiated and called as such: +# obj = RecentCounter() +# param_1 = obj.ping(t)","class RecentCounter: + + def __init__(self): + + + def ping(self, t: int) -> int: + + + +# Your RecentCounter object will be instantiated and called as such: +# obj = RecentCounter() +# param_1 = obj.ping(t)"," + + +typedef struct { + +} RecentCounter; + + +RecentCounter* recentCounterCreate() { + +} + +int recentCounterPing(RecentCounter* obj, int t) { + +} + +void recentCounterFree(RecentCounter* obj) { + +} + +/** + * Your RecentCounter struct will be instantiated and called as such: + * RecentCounter* obj = recentCounterCreate(); + * int param_1 = recentCounterPing(obj, t); + + * recentCounterFree(obj); +*/","public class RecentCounter { + + public RecentCounter() { + + } + + public int Ping(int t) { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * RecentCounter obj = new RecentCounter(); + * int param_1 = obj.Ping(t); + */"," +var RecentCounter = function() { + +}; + +/** + * @param {number} t + * @return {number} + */ +RecentCounter.prototype.ping = function(t) { + +}; + +/** + * Your RecentCounter object will be instantiated and called as such: + * var obj = new RecentCounter() + * var param_1 = obj.ping(t) + */","class RecentCounter + def initialize() + + end + + +=begin + :type t: Integer + :rtype: Integer +=end + def ping(t) + + end + + +end + +# Your RecentCounter object will be instantiated and called as such: +# obj = RecentCounter.new() +# param_1 = obj.ping(t)"," +class RecentCounter { + + init() { + + } + + func ping(_ t: Int) -> Int { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * let obj = RecentCounter() + * let ret_1: Int = obj.ping(t) + */","type RecentCounter struct { + +} + + +func Constructor() RecentCounter { + +} + + +func (this *RecentCounter) Ping(t int) int { + +} + + +/** + * Your RecentCounter object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Ping(t); + */","class RecentCounter() { + + def ping(t: Int): Int = { + + } + +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * var obj = new RecentCounter() + * var param_1 = obj.ping(t) + */","class RecentCounter() { + + fun ping(t: Int): Int { + + } + +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * var obj = RecentCounter() + * var param_1 = obj.ping(t) + */","struct RecentCounter { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl RecentCounter { + + fn new() -> Self { + + } + + fn ping(&self, t: i32) -> i32 { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * let obj = RecentCounter::new(); + * let ret_1: i32 = obj.ping(t); + */","class RecentCounter { + /** + */ + function __construct() { + + } + + /** + * @param Integer $t + * @return Integer + */ + function ping($t) { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * $obj = RecentCounter(); + * $ret_1 = $obj->ping($t); + */","class RecentCounter { + constructor() { + + } + + ping(t: number): number { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * var obj = new RecentCounter() + * var param_1 = obj.ping(t) + */","(define recent-counter% + (class object% + (super-new) + (init-field) + + ; ping : exact-integer? -> exact-integer? + (define/public (ping t) + + ))) + +;; Your recent-counter% object will be instantiated and called as such: +;; (define obj (new recent-counter%)) +;; (define param_1 (send obj ping t))","-spec recent_counter_init_() -> any(). +recent_counter_init_() -> + . + +-spec recent_counter_ping(T :: integer()) -> integer(). +recent_counter_ping(T) -> + . + + +%% Your functions will be called as such: +%% recent_counter_init_(), +%% Param_1 = recent_counter_ping(T), + +%% recent_counter_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule RecentCounter do + @spec init_() :: any + def init_() do + + end + + @spec ping(t :: integer) :: integer + def ping(t) do + + end +end + +# Your functions will be called as such: +# RecentCounter.init_() +# param_1 = RecentCounter.ping(t) + +# RecentCounter.init_ will be called before every test case, in which you can do some necessary initializations.","class RecentCounter { + + RecentCounter() { + + } + + int ping(int t) { + + } +} + +/** + * Your RecentCounter object will be instantiated and called as such: + * RecentCounter obj = RecentCounter(); + * int param1 = obj.ping(t); + */", +1392,beautiful-array,Beautiful Array,932.0,968.0,"

An array nums of length n is beautiful if:

+ +
    +
  • nums is a permutation of the integers in the range [1, n].
    • +
  • For every 0 <= i < j < n, there is no index k with i < k < j where 2 * nums[k] == nums[i] + nums[j].
    • +
+ +

Given the integer n, return any beautiful array nums of length n. There will be at least one valid answer for the given n.

+ +

 

+

Example 1:

+
Input: n = 4
+Output: [2,1,4,3]
+

Example 2:

+
Input: n = 5
+Output: [3,1,2,5,4]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",2.0,False,"class Solution { +public: + vector beautifulArray(int n) { + + } +};","class Solution { + public int[] beautifulArray(int n) { + + } +}","class Solution(object): + def beautifulArray(self, n): + """""" + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def beautifulArray(self, n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* beautifulArray(int n, int* returnSize){ + +}","public class Solution { + public int[] BeautifulArray(int n) { + + } +}","/** + * @param {number} n + * @return {number[]} + */ +var beautifulArray = function(n) { + +};","# @param {Integer} n +# @return {Integer[]} +def beautiful_array(n) + +end","class Solution { + func beautifulArray(_ n: Int) -> [Int] { + + } +}","func beautifulArray(n int) []int { + +}","object Solution { + def beautifulArray(n: Int): Array[Int] = { + + } +}","class Solution { + fun beautifulArray(n: Int): IntArray { + + } +}","impl Solution { + pub fn beautiful_array(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer[] + */ + function beautifulArray($n) { + + } +}","function beautifulArray(n: number): number[] { + +};","(define/contract (beautiful-array n) + (-> exact-integer? (listof exact-integer?)) + + )","-spec beautiful_array(N :: integer()) -> [integer()]. +beautiful_array(N) -> + .","defmodule Solution do + @spec beautiful_array(n :: integer) :: [integer] + def beautiful_array(n) do + + end +end","class Solution { + List beautifulArray(int n) { + + } +}", +1393,minimum-falling-path-sum,Minimum Falling Path Sum,931.0,967.0,"

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

+ +

A falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right. Specifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, col + 1).

+ +

 

+

Example 1:

+ +
+Input: matrix = [[2,1,3],[6,5,4],[7,8,9]]
+Output: 13
+Explanation: There are two falling paths with a minimum sum as shown.
+
+ +

Example 2:

+ +
+Input: matrix = [[-19,57],[-40,-5]]
+Output: -59
+Explanation: The falling path with a minimum sum is shown.
+
+ +

 

+

Constraints:

+ +
    +
  • n == matrix.length == matrix[i].length
    • +
  • 1 <= n <= 100
    • +
  • -100 <= matrix[i][j] <= 100
    • +
+",2.0,False,"class Solution { +public: + int minFallingPathSum(vector>& matrix) { + + } +};","class Solution { + public int minFallingPathSum(int[][] matrix) { + + } +}","class Solution(object): + def minFallingPathSum(self, matrix): + """""" + :type matrix: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minFallingPathSum(self, matrix: List[List[int]]) -> int: + ","int minFallingPathSum(int** matrix, int matrixSize, int* matrixColSize){ + +}","public class Solution { + public int MinFallingPathSum(int[][] matrix) { + + } +}","/** + * @param {number[][]} matrix + * @return {number} + */ +var minFallingPathSum = function(matrix) { + +};","# @param {Integer[][]} matrix +# @return {Integer} +def min_falling_path_sum(matrix) + +end","class Solution { + func minFallingPathSum(_ matrix: [[Int]]) -> Int { + + } +}","func minFallingPathSum(matrix [][]int) int { + +}","object Solution { + def minFallingPathSum(matrix: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minFallingPathSum(matrix: Array): Int { + + } +}","impl Solution { + pub fn min_falling_path_sum(matrix: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @return Integer + */ + function minFallingPathSum($matrix) { + + } +}","function minFallingPathSum(matrix: number[][]): number { + +};","(define/contract (min-falling-path-sum matrix) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_falling_path_sum(Matrix :: [[integer()]]) -> integer(). +min_falling_path_sum(Matrix) -> + .","defmodule Solution do + @spec min_falling_path_sum(matrix :: [[integer]]) :: integer + def min_falling_path_sum(matrix) do + + end +end","class Solution { + int minFallingPathSum(List> matrix) { + + } +}", +1394,binary-subarrays-with-sum,Binary Subarrays With Sum,930.0,966.0,"

Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal.

+ +

A subarray is a contiguous part of the array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,0,1,0,1], goal = 2
+Output: 4
+Explanation: The 4 subarrays are bolded and underlined below:
+[1,0,1,0,1]
+[1,0,1,0,1]
+[1,0,1,0,1]
+[1,0,1,0,1]
+
+ +

Example 2:

+ +
+Input: nums = [0,0,0,0,0], goal = 0
+Output: 15
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • nums[i] is either 0 or 1.
    • +
  • 0 <= goal <= nums.length
    • +
",2.0,False,"class Solution { +public: + int numSubarraysWithSum(vector& nums, int goal) { + + } +};","class Solution { + public int numSubarraysWithSum(int[] nums, int goal) { + + } +}","class Solution(object): + def numSubarraysWithSum(self, nums, goal): + """""" + :type nums: List[int] + :type goal: int + :rtype: int + """"""","class Solution: + def numSubarraysWithSum(self, nums: List[int], goal: int) -> int:","int numSubarraysWithSum(int* nums, int numsSize, int goal){ + +}","public class Solution { + public int NumSubarraysWithSum(int[] nums, int goal) { + + } +}","/** + * @param {number[]} nums + * @param {number} goal + * @return {number} + */ +var numSubarraysWithSum = function(nums, goal) { + +};","# @param {Integer[]} nums +# @param {Integer} goal +# @return {Integer} +def num_subarrays_with_sum(nums, goal) + +end","class Solution { + func numSubarraysWithSum(_ nums: [Int], _ goal: Int) -> Int { + + } +}","func numSubarraysWithSum(nums []int, goal int) int { + +}","object Solution { + def numSubarraysWithSum(nums: Array[Int], goal: Int): Int = { + + } +}","class Solution { + fun numSubarraysWithSum(nums: IntArray, goal: Int): Int { + + } +}","impl Solution { + pub fn num_subarrays_with_sum(nums: Vec, goal: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $goal + * @return Integer + */ + function numSubarraysWithSum($nums, $goal) { + + } +}","function numSubarraysWithSum(nums: number[], goal: number): number { + +};","(define/contract (num-subarrays-with-sum nums goal) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )",,,, +1396,minimize-malware-spread-ii,Minimize Malware Spread II,928.0,964.0,"

You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node if graph[i][j] == 1.

+ +

Some nodes initial are initially infected by malware. Whenever two nodes are directly connected, and at least one of those two nodes is infected by malware, both nodes will be infected by malware. This spread of malware will continue until no more nodes can be infected in this manner.

+ +

Suppose M(initial) is the final number of nodes infected with malware in the entire network after the spread of malware stops.

+ +

We will remove exactly one node from initial, completely removing it and any connections from this node to any other node.

+ +

Return the node that, if removed, would minimize M(initial). If multiple nodes could be removed to minimize M(initial), return such a node with the smallest index.

+ +

 

+

Example 1:

+
Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
+Output: 0
+

Example 2:

+
Input: graph = [[1,1,0],[1,1,1],[0,1,1]], initial = [0,1]
+Output: 1
+

Example 3:

+
Input: graph = [[1,1,0,0],[1,1,1,0],[0,1,1,1],[0,0,1,1]], initial = [0,1]
+Output: 1
+
+

 

+

Constraints:

+ +
    +
  • n == graph.length
    • +
  • n == graph[i].length
    • +
  • 2 <= n <= 300
    • +
  • graph[i][j] is 0 or 1.
    • +
  • graph[i][j] == graph[j][i]
    • +
  • graph[i][i] == 1
    • +
  • 1 <= initial.length < n
    • +
  • 0 <= initial[i] <= n - 1
    • +
  • All the integers in initial are unique.
    • +
+",3.0,False,"class Solution { +public: + int minMalwareSpread(vector>& graph, vector& initial) { + + } +};","class Solution { + public int minMalwareSpread(int[][] graph, int[] initial) { + + } +}","class Solution(object): + def minMalwareSpread(self, graph, initial): + """""" + :type graph: List[List[int]] + :type initial: List[int] + :rtype: int + """""" + ","class Solution: + def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int: + ","int minMalwareSpread(int** graph, int graphSize, int* graphColSize, int* initial, int initialSize){ + +}","public class Solution { + public int MinMalwareSpread(int[][] graph, int[] initial) { + + } +}","/** + * @param {number[][]} graph + * @param {number[]} initial + * @return {number} + */ +var minMalwareSpread = function(graph, initial) { + +};","# @param {Integer[][]} graph +# @param {Integer[]} initial +# @return {Integer} +def min_malware_spread(graph, initial) + +end","class Solution { + func minMalwareSpread(_ graph: [[Int]], _ initial: [Int]) -> Int { + + } +}","func minMalwareSpread(graph [][]int, initial []int) int { + +}","object Solution { + def minMalwareSpread(graph: Array[Array[Int]], initial: Array[Int]): Int = { + + } +}","class Solution { + fun minMalwareSpread(graph: Array, initial: IntArray): Int { + + } +}","impl Solution { + pub fn min_malware_spread(graph: Vec>, initial: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $graph + * @param Integer[] $initial + * @return Integer + */ + function minMalwareSpread($graph, $initial) { + + } +}","function minMalwareSpread(graph: number[][], initial: number[]): number { + +};","(define/contract (min-malware-spread graph initial) + (-> (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec min_malware_spread(Graph :: [[integer()]], Initial :: [integer()]) -> integer(). +min_malware_spread(Graph, Initial) -> + .","defmodule Solution do + @spec min_malware_spread(graph :: [[integer]], initial :: [integer]) :: integer + def min_malware_spread(graph, initial) do + + end +end","class Solution { + int minMalwareSpread(List> graph, List initial) { + + } +}", +1397,three-equal-parts,Three Equal Parts,927.0,963.0,"

You are given an array arr which consists of only zeros and ones, divide the array into three non-empty parts such that all of these parts represent the same binary value.

+ +

If it is possible, return any [i, j] with i + 1 < j, such that:

+ +
    +
  • arr[0], arr[1], ..., arr[i] is the first part,
    • +
  • arr[i + 1], arr[i + 2], ..., arr[j - 1] is the second part, and
    • +
  • arr[j], arr[j + 1], ..., arr[arr.length - 1] is the third part.
    • +
  • All three parts have equal binary values.
    • +
+ +

If it is not possible, return [-1, -1].

+ +

Note that the entire part is used when considering what binary value it represents. For example, [1,1,0] represents 6 in decimal, not 3. Also, leading zeros are allowed, so [0,1,1] and [1,1] represent the same value.

+ +

 

+

Example 1:

+
Input: arr = [1,0,1,0,1]
+Output: [0,3]
+

Example 2:

+
Input: arr = [1,1,0,1,1]
+Output: [-1,-1]
+

Example 3:

+
Input: arr = [1,1,0,0,1]
+Output: [0,2]
+
+

 

+

Constraints:

+ +
    +
  • 3 <= arr.length <= 3 * 104
    • +
  • arr[i] is 0 or 1
    • +
+",3.0,False,"class Solution { +public: + vector threeEqualParts(vector& arr) { + + } +};","class Solution { + public int[] threeEqualParts(int[] arr) { + + } +}","class Solution(object): + def threeEqualParts(self, arr): + """""" + :type arr: List[int] + :rtype: List[int] + """""" + ","class Solution: + def threeEqualParts(self, arr: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* threeEqualParts(int* arr, int arrSize, int* returnSize){ + +}","public class Solution { + public int[] ThreeEqualParts(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number[]} + */ +var threeEqualParts = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer[]} +def three_equal_parts(arr) + +end","class Solution { + func threeEqualParts(_ arr: [Int]) -> [Int] { + + } +}","func threeEqualParts(arr []int) []int { + +}","object Solution { + def threeEqualParts(arr: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun threeEqualParts(arr: IntArray): IntArray { + + } +}","impl Solution { + pub fn three_equal_parts(arr: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer[] + */ + function threeEqualParts($arr) { + + } +}","function threeEqualParts(arr: number[]): number[] { + +};","(define/contract (three-equal-parts arr) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec three_equal_parts(Arr :: [integer()]) -> [integer()]. +three_equal_parts(Arr) -> + .","defmodule Solution do + @spec three_equal_parts(arr :: [integer]) :: [integer] + def three_equal_parts(arr) do + + end +end","class Solution { + List threeEqualParts(List arr) { + + } +}", +1400,minimize-malware-spread,Minimize Malware Spread,924.0,960.0,"

You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node if graph[i][j] == 1.

+ +

Some nodes initial are initially infected by malware. Whenever two nodes are directly connected, and at least one of those two nodes is infected by malware, both nodes will be infected by malware. This spread of malware will continue until no more nodes can be infected in this manner.

+ +

Suppose M(initial) is the final number of nodes infected with malware in the entire network after the spread of malware stops. We will remove exactly one node from initial.

+ +

Return the node that, if removed, would minimize M(initial). If multiple nodes could be removed to minimize M(initial), return such a node with the smallest index.

+ +

Note that if a node was removed from the initial list of infected nodes, it might still be infected later due to the malware spread.

+ +

 

+

Example 1:

+
Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
+Output: 0
+

Example 2:

+
Input: graph = [[1,0,0],[0,1,0],[0,0,1]], initial = [0,2]
+Output: 0
+

Example 3:

+
Input: graph = [[1,1,1],[1,1,1],[1,1,1]], initial = [1,2]
+Output: 1
+
+

 

+

Constraints:

+ +
    +
  • n == graph.length
    • +
  • n == graph[i].length
    • +
  • 2 <= n <= 300
    • +
  • graph[i][j] is 0 or 1.
    • +
  • graph[i][j] == graph[j][i]
    • +
  • graph[i][i] == 1
    • +
  • 1 <= initial.length <= n
    • +
  • 0 <= initial[i] <= n - 1
    • +
  • All the integers in initial are unique.
    • +
+",3.0,False,"class Solution { +public: + int minMalwareSpread(vector>& graph, vector& initial) { + + } +};","class Solution { + public int minMalwareSpread(int[][] graph, int[] initial) { + + } +}","class Solution(object): + def minMalwareSpread(self, graph, initial): + """""" + :type graph: List[List[int]] + :type initial: List[int] + :rtype: int + """""" + ","class Solution: + def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int: + ","int minMalwareSpread(int** graph, int graphSize, int* graphColSize, int* initial, int initialSize){ + +}","public class Solution { + public int MinMalwareSpread(int[][] graph, int[] initial) { + + } +}","/** + * @param {number[][]} graph + * @param {number[]} initial + * @return {number} + */ +var minMalwareSpread = function(graph, initial) { + +};","# @param {Integer[][]} graph +# @param {Integer[]} initial +# @return {Integer} +def min_malware_spread(graph, initial) + +end","class Solution { + func minMalwareSpread(_ graph: [[Int]], _ initial: [Int]) -> Int { + + } +}","func minMalwareSpread(graph [][]int, initial []int) int { + +}","object Solution { + def minMalwareSpread(graph: Array[Array[Int]], initial: Array[Int]): Int = { + + } +}","class Solution { + fun minMalwareSpread(graph: Array, initial: IntArray): Int { + + } +}","impl Solution { + pub fn min_malware_spread(graph: Vec>, initial: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $graph + * @param Integer[] $initial + * @return Integer + */ + function minMalwareSpread($graph, $initial) { + + } +}","function minMalwareSpread(graph: number[][], initial: number[]): number { + +};","(define/contract (min-malware-spread graph initial) + (-> (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?) + + )","-spec min_malware_spread(Graph :: [[integer()]], Initial :: [integer()]) -> integer(). +min_malware_spread(Graph, Initial) -> + .","defmodule Solution do + @spec min_malware_spread(graph :: [[integer]], initial :: [integer]) :: integer + def min_malware_spread(graph, initial) do + + end +end","class Solution { + int minMalwareSpread(List> graph, List initial) { + + } +}", +1401,3sum-with-multiplicity,3Sum With Multiplicity,923.0,959.0,"

Given an integer array arr, and an integer target, return the number of tuples i, j, k such that i < j < k and arr[i] + arr[j] + arr[k] == target.

+ +

As the answer can be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,1,2,2,3,3,4,4,5,5], target = 8
+Output: 20
+Explanation: 
+Enumerating by the values (arr[i], arr[j], arr[k]):
+(1, 2, 5) occurs 8 times;
+(1, 3, 4) occurs 8 times;
+(2, 2, 4) occurs 2 times;
+(2, 3, 3) occurs 2 times.
+
+ +

Example 2:

+ +
+Input: arr = [1,1,2,2,2,2], target = 5
+Output: 12
+Explanation: 
+arr[i] = 1, arr[j] = arr[k] = 2 occurs 12 times:
+We choose one 1 from [1,1] in 2 ways,
+and two 2s from [2,2,2,2] in 6 ways.
+
+ +

Example 3:

+ +
+Input: arr = [2,1,3], target = 6
+Output: 1
+Explanation: (1, 2, 3) occured one time in the array so we return 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= arr.length <= 3000
    • +
  • 0 <= arr[i] <= 100
    • +
  • 0 <= target <= 300
    • +
+",2.0,False,"class Solution { +public: + int threeSumMulti(vector& arr, int target) { + + } +};","class Solution { + public int threeSumMulti(int[] arr, int target) { + + } +}","class Solution(object): + def threeSumMulti(self, arr, target): + """""" + :type arr: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def threeSumMulti(self, arr: List[int], target: int) -> int: + ","int threeSumMulti(int* arr, int arrSize, int target){ + +}","public class Solution { + public int ThreeSumMulti(int[] arr, int target) { + + } +}","/** + * @param {number[]} arr + * @param {number} target + * @return {number} + */ +var threeSumMulti = function(arr, target) { + +};","# @param {Integer[]} arr +# @param {Integer} target +# @return {Integer} +def three_sum_multi(arr, target) + +end","class Solution { + func threeSumMulti(_ arr: [Int], _ target: Int) -> Int { + + } +}","func threeSumMulti(arr []int, target int) int { + +}","object Solution { + def threeSumMulti(arr: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun threeSumMulti(arr: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn three_sum_multi(arr: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $target + * @return Integer + */ + function threeSumMulti($arr, $target) { + + } +}","function threeSumMulti(arr: number[], target: number): number { + +};","(define/contract (three-sum-multi arr target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec three_sum_multi(Arr :: [integer()], Target :: integer()) -> integer(). +three_sum_multi(Arr, Target) -> + .","defmodule Solution do + @spec three_sum_multi(arr :: [integer], target :: integer) :: integer + def three_sum_multi(arr, target) do + + end +end","class Solution { + int threeSumMulti(List arr, int target) { + + } +}", +1404,number-of-music-playlists,Number of Music Playlists,920.0,956.0,"

Your music player contains n different songs. You want to listen to goal songs (not necessarily different) during your trip. To avoid boredom, you will create a playlist so that:

+ +
    +
  • Every song is played at least once.
    • +
  • A song can only be played again only if k other songs have been played.
    • +
+ +

Given n, goal, and k, return the number of possible playlists that you can create. Since the answer can be very large, return it modulo 109 + 7.

+

 

+

Example 1:

+ +
+Input: n = 3, goal = 3, k = 1
+Output: 6
+Explanation: There are 6 possible playlists: [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], and [3, 2, 1].
+
+ +

Example 2:

+ +
+Input: n = 2, goal = 3, k = 0
+Output: 6
+Explanation: There are 6 possible playlists: [1, 1, 2], [1, 2, 1], [2, 1, 1], [2, 2, 1], [2, 1, 2], and [1, 2, 2].
+
+ +

Example 3:

+ +
+Input: n = 2, goal = 3, k = 1
+Output: 2
+Explanation: There are 2 possible playlists: [1, 2, 1] and [2, 1, 2].
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= k < n <= goal <= 100
    • +
+",3.0,False,"class Solution { +public: + int numMusicPlaylists(int n, int goal, int k) { + + } +};","class Solution { + public int numMusicPlaylists(int n, int goal, int k) { + + } +}","class Solution(object): + def numMusicPlaylists(self, n, goal, k): + """""" + :type n: int + :type goal: int + :type k: int + :rtype: int + """""" + ","class Solution: + def numMusicPlaylists(self, n: int, goal: int, k: int) -> int: + ","int numMusicPlaylists(int n, int goal, int k){ + +}","public class Solution { + public int NumMusicPlaylists(int n, int goal, int k) { + + } +}","/** + * @param {number} n + * @param {number} goal + * @param {number} k + * @return {number} + */ +var numMusicPlaylists = function(n, goal, k) { + +};","# @param {Integer} n +# @param {Integer} goal +# @param {Integer} k +# @return {Integer} +def num_music_playlists(n, goal, k) + +end","class Solution { + func numMusicPlaylists(_ n: Int, _ goal: Int, _ k: Int) -> Int { + + } +}","func numMusicPlaylists(n int, goal int, k int) int { + +}","object Solution { + def numMusicPlaylists(n: Int, goal: Int, k: Int): Int = { + + } +}","class Solution { + fun numMusicPlaylists(n: Int, goal: Int, k: Int): Int { + + } +}","impl Solution { + pub fn num_music_playlists(n: i32, goal: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $goal + * @param Integer $k + * @return Integer + */ + function numMusicPlaylists($n, $goal, $k) { + + } +}","function numMusicPlaylists(n: number, goal: number, k: number): number { + +};","(define/contract (num-music-playlists n goal k) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec num_music_playlists(N :: integer(), Goal :: integer(), K :: integer()) -> integer(). +num_music_playlists(N, Goal, K) -> + .","defmodule Solution do + @spec num_music_playlists(n :: integer, goal :: integer, k :: integer) :: integer + def num_music_playlists(n, goal, k) do + + end +end","class Solution { + int numMusicPlaylists(int n, int goal, int k) { + + } +}", +1408,word-subsets,Word Subsets,916.0,952.0,"

You are given two string arrays words1 and words2.

+ +

A string b is a subset of string a if every letter in b occurs in a including multiplicity.

+ +
    +
  • For example, "wrr" is a subset of "warrior" but is not a subset of "world".
    • +
+ +

A string a from words1 is universal if for every string b in words2, b is a subset of a.

+ +

Return an array of all the universal strings in words1. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: words1 = ["amazon","apple","facebook","google","leetcode"], words2 = ["e","o"]
+Output: ["facebook","google","leetcode"]
+
+ +

Example 2:

+ +
+Input: words1 = ["amazon","apple","facebook","google","leetcode"], words2 = ["l","e"]
+Output: ["apple","google","leetcode"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words1.length, words2.length <= 104
    • +
  • 1 <= words1[i].length, words2[i].length <= 10
    • +
  • words1[i] and words2[i] consist only of lowercase English letters.
    • +
  • All the strings of words1 are unique.
    • +
+",2.0,False,"class Solution { +public: + vector wordSubsets(vector& words1, vector& words2) { + + } +};","class Solution { + public List wordSubsets(String[] words1, String[] words2) { + + } +}","class Solution(object): + def wordSubsets(self, words1, words2): + """""" + :type words1: List[str] + :type words2: List[str] + :rtype: List[str] + """""" + ","class Solution: + def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** wordSubsets(char ** words1, int words1Size, char ** words2, int words2Size, int* returnSize){ + +}","public class Solution { + public IList WordSubsets(string[] words1, string[] words2) { + + } +}","/** + * @param {string[]} words1 + * @param {string[]} words2 + * @return {string[]} + */ +var wordSubsets = function(words1, words2) { + +};","# @param {String[]} words1 +# @param {String[]} words2 +# @return {String[]} +def word_subsets(words1, words2) + +end","class Solution { + func wordSubsets(_ words1: [String], _ words2: [String]) -> [String] { + + } +}","func wordSubsets(words1 []string, words2 []string) []string { + +}","object Solution { + def wordSubsets(words1: Array[String], words2: Array[String]): List[String] = { + + } +}","class Solution { + fun wordSubsets(words1: Array, words2: Array): List { + + } +}","impl Solution { + pub fn word_subsets(words1: Vec, words2: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words1 + * @param String[] $words2 + * @return String[] + */ + function wordSubsets($words1, $words2) { + + } +}","function wordSubsets(words1: string[], words2: string[]): string[] { + +};","(define/contract (word-subsets words1 words2) + (-> (listof string?) (listof string?) (listof string?)) + + )","-spec word_subsets(Words1 :: [unicode:unicode_binary()], Words2 :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +word_subsets(Words1, Words2) -> + .","defmodule Solution do + @spec word_subsets(words1 :: [String.t], words2 :: [String.t]) :: [String.t] + def word_subsets(words1, words2) do + + end +end","class Solution { + List wordSubsets(List words1, List words2) { + + } +}", +1410,x-of-a-kind-in-a-deck-of-cards,X of a Kind in a Deck of Cards,914.0,950.0,"

You are given an integer array deck where deck[i] represents the number written on the ith card.

+ +

Partition the cards into one or more groups such that:

+ +
    +
  • Each group has exactly x cards where x > 1, and
    • +
  • All the cards in one group have the same integer written on them.
    • +
+ +

Return true if such partition is possible, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: deck = [1,2,3,4,4,3,2,1]
+Output: true
+Explanation: Possible partition [1,1],[2,2],[3,3],[4,4].
+
+ +

Example 2:

+ +
+Input: deck = [1,1,1,2,2,2,3,3]
+Output: false
+Explanation: No possible partition.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= deck.length <= 104
    • +
  • 0 <= deck[i] < 104
    • +
+",1.0,False,"class Solution { +public: + bool hasGroupsSizeX(vector& deck) { + + } +};","class Solution { + public boolean hasGroupsSizeX(int[] deck) { + + } +}","class Solution(object): + def hasGroupsSizeX(self, deck): + """""" + :type deck: List[int] + :rtype: bool + """""" + ","class Solution: + def hasGroupsSizeX(self, deck: List[int]) -> bool: + ","bool hasGroupsSizeX(int* deck, int deckSize){ + +}","public class Solution { + public bool HasGroupsSizeX(int[] deck) { + + } +}","/** + * @param {number[]} deck + * @return {boolean} + */ +var hasGroupsSizeX = function(deck) { + +};","# @param {Integer[]} deck +# @return {Boolean} +def has_groups_size_x(deck) + +end","class Solution { + func hasGroupsSizeX(_ deck: [Int]) -> Bool { + + } +}","func hasGroupsSizeX(deck []int) bool { + +}","object Solution { + def hasGroupsSizeX(deck: Array[Int]): Boolean = { + + } +}","class Solution { + fun hasGroupsSizeX(deck: IntArray): Boolean { + + } +}","impl Solution { + pub fn has_groups_size_x(deck: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $deck + * @return Boolean + */ + function hasGroupsSizeX($deck) { + + } +}","function hasGroupsSizeX(deck: number[]): boolean { + +};","(define/contract (has-groups-size-x deck) + (-> (listof exact-integer?) boolean?) + + )","-spec has_groups_size_x(Deck :: [integer()]) -> boolean(). +has_groups_size_x(Deck) -> + .","defmodule Solution do + @spec has_groups_size_x(deck :: [integer]) :: boolean + def has_groups_size_x(deck) do + + end +end","class Solution { + bool hasGroupsSizeX(List deck) { + + } +}", +1411,cat-and-mouse,Cat and Mouse,913.0,949.0,"

A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.

+ +

The graph is given as follows: graph[a] is a list of all nodes b such that ab is an edge of the graph.

+ +

The mouse starts at node 1 and goes first, the cat starts at node 2 and goes second, and there is a hole at node 0.

+ +

During each player's turn, they must travel along one edge of the graph that meets where they are.  For example, if the Mouse is at node 1, it must travel to any node in graph[1].

+ +

Additionally, it is not allowed for the Cat to travel to the Hole (node 0.)

+ +

Then, the game can end in three ways:

+ +
    +
  • If ever the Cat occupies the same node as the Mouse, the Cat wins.
    • +
  • If ever the Mouse reaches the Hole, the Mouse wins.
    • +
  • If ever a position is repeated (i.e., the players are in the same position as a previous turn, and it is the same player's turn to move), the game is a draw.
    • +
+ +

Given a graph, and assuming both players play optimally, return

+ +
    +
  • 1 if the mouse wins the game,
    • +
  • 2 if the cat wins the game, or
    • +
  • 0 if the game is a draw.
    • +
+ +

 

+

Example 1:

+ +
+Input: graph = [[2,5],[3],[0,4,5],[1,4,5],[2,3],[0,2,3]]
+Output: 0
+
+ +

Example 2:

+ +
+Input: graph = [[1,3],[0],[3],[0,2]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= graph.length <= 50
    • +
  • 1 <= graph[i].length < graph.length
    • +
  • 0 <= graph[i][j] < graph.length
    • +
  • graph[i][j] != i
    • +
  • graph[i] is unique.
    • +
  • The mouse and the cat can always move. 
    • +
+",3.0,False,"class Solution { +public: + int catMouseGame(vector>& graph) { + + } +};","class Solution { + public int catMouseGame(int[][] graph) { + + } +}","class Solution(object): + def catMouseGame(self, graph): + """""" + :type graph: List[List[int]] + :rtype: int + """""" + ","class Solution: + def catMouseGame(self, graph: List[List[int]]) -> int: + ","int catMouseGame(int** graph, int graphSize, int* graphColSize){ + +}","public class Solution { + public int CatMouseGame(int[][] graph) { + + } +}","/** + * @param {number[][]} graph + * @return {number} + */ +var catMouseGame = function(graph) { + +};","# @param {Integer[][]} graph +# @return {Integer} +def cat_mouse_game(graph) + +end","class Solution { + func catMouseGame(_ graph: [[Int]]) -> Int { + + } +}","func catMouseGame(graph [][]int) int { + +}","object Solution { + def catMouseGame(graph: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun catMouseGame(graph: Array): Int { + + } +}","impl Solution { + pub fn cat_mouse_game(graph: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $graph + * @return Integer + */ + function catMouseGame($graph) { + + } +}","function catMouseGame(graph: number[][]): number { + +};","(define/contract (cat-mouse-game graph) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec cat_mouse_game(Graph :: [[integer()]]) -> integer(). +cat_mouse_game(Graph) -> + .","defmodule Solution do + @spec cat_mouse_game(graph :: [[integer]]) :: integer + def cat_mouse_game(graph) do + + end +end","class Solution { + int catMouseGame(List> graph) { + + } +}", +1412,sort-an-array,Sort an Array,912.0,948.0,"

Given an array of integers nums, sort the array in ascending order and return it.

+ +

You must solve the problem without using any built-in functions in O(nlog(n)) time complexity and with the smallest space complexity possible.

+ +

 

+

Example 1:

+ +
+Input: nums = [5,2,3,1]
+Output: [1,2,3,5]
+Explanation: After sorting the array, the positions of some numbers are not changed (for example, 2 and 3), while the positions of other numbers are changed (for example, 1 and 5).
+
+ +

Example 2:

+ +
+Input: nums = [5,1,1,2,0,0]
+Output: [0,0,1,1,2,5]
+Explanation: Note that the values of nums are not necessairly unique.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5 * 104
    • +
  • -5 * 104 <= nums[i] <= 5 * 104
    • +
+",2.0,False,"class Solution { +public: + vector sortArray(vector& nums) { + + } +};","class Solution { + public int[] sortArray(int[] nums) { + + } +}","class Solution(object): + def sortArray(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def sortArray(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sortArray(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] SortArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var sortArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def sort_array(nums) + +end","class Solution { + func sortArray(_ nums: [Int]) -> [Int] { + + } +}","func sortArray(nums []int) []int { + +}","object Solution { + def sortArray(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun sortArray(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn sort_array(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function sortArray($nums) { + + } +}","function sortArray(nums: number[]): number[] { + +};","(define/contract (sort-array nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec sort_array(Nums :: [integer()]) -> [integer()]. +sort_array(Nums) -> + .","defmodule Solution do + @spec sort_array(nums :: [integer]) :: [integer] + def sort_array(nums) do + + end +end","class Solution { + List sortArray(List nums) { + + } +}", +1413,online-election,Online Election,911.0,947.0,"

You are given two integer arrays persons and times. In an election, the ith vote was cast for persons[i] at time times[i].

+ +

For each query at a time t, find the person that was leading the election at time t. Votes cast at time t will count towards our query. In the case of a tie, the most recent vote (among tied candidates) wins.

+ +

Implement the TopVotedCandidate class:

+ +
    +
  • TopVotedCandidate(int[] persons, int[] times) Initializes the object with the persons and times arrays.
    • +
  • int q(int t) Returns the number of the person that was leading the election at time t according to the mentioned rules.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["TopVotedCandidate", "q", "q", "q", "q", "q", "q"]
+[[[0, 1, 1, 0, 0, 1, 0], [0, 5, 10, 15, 20, 25, 30]], [3], [12], [25], [15], [24], [8]]
+Output
+[null, 0, 1, 1, 0, 0, 1]
+
+Explanation
+TopVotedCandidate topVotedCandidate = new TopVotedCandidate([0, 1, 1, 0, 0, 1, 0], [0, 5, 10, 15, 20, 25, 30]);
+topVotedCandidate.q(3); // return 0, At time 3, the votes are [0], and 0 is leading.
+topVotedCandidate.q(12); // return 1, At time 12, the votes are [0,1,1], and 1 is leading.
+topVotedCandidate.q(25); // return 1, At time 25, the votes are [0,1,1,0,0,1], and 1 is leading (as ties go to the most recent vote.)
+topVotedCandidate.q(15); // return 0
+topVotedCandidate.q(24); // return 0
+topVotedCandidate.q(8); // return 1
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= persons.length <= 5000
    • +
  • times.length == persons.length
    • +
  • 0 <= persons[i] < persons.length
    • +
  • 0 <= times[i] <= 109
    • +
  • times is sorted in a strictly increasing order.
    • +
  • times[0] <= t <= 109
    • +
  • At most 104 calls will be made to q.
    • +
+",2.0,False,"class TopVotedCandidate { +public: + TopVotedCandidate(vector& persons, vector& times) { + + } + + int q(int t) { + + } +}; + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * TopVotedCandidate* obj = new TopVotedCandidate(persons, times); + * int param_1 = obj->q(t); + */","class TopVotedCandidate { + + public TopVotedCandidate(int[] persons, int[] times) { + + } + + public int q(int t) { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * TopVotedCandidate obj = new TopVotedCandidate(persons, times); + * int param_1 = obj.q(t); + */","class TopVotedCandidate(object): + + def __init__(self, persons, times): + """""" + :type persons: List[int] + :type times: List[int] + """""" + + + def q(self, t): + """""" + :type t: int + :rtype: int + """""" + + + +# Your TopVotedCandidate object will be instantiated and called as such: +# obj = TopVotedCandidate(persons, times) +# param_1 = obj.q(t)","class TopVotedCandidate: + + def __init__(self, persons: List[int], times: List[int]): + + + def q(self, t: int) -> int: + + + +# Your TopVotedCandidate object will be instantiated and called as such: +# obj = TopVotedCandidate(persons, times) +# param_1 = obj.q(t)"," + + +typedef struct { + +} TopVotedCandidate; + + +TopVotedCandidate* topVotedCandidateCreate(int* persons, int personsSize, int* times, int timesSize) { + +} + +int topVotedCandidateQ(TopVotedCandidate* obj, int t) { + +} + +void topVotedCandidateFree(TopVotedCandidate* obj) { + +} + +/** + * Your TopVotedCandidate struct will be instantiated and called as such: + * TopVotedCandidate* obj = topVotedCandidateCreate(persons, personsSize, times, timesSize); + * int param_1 = topVotedCandidateQ(obj, t); + + * topVotedCandidateFree(obj); +*/","public class TopVotedCandidate { + + public TopVotedCandidate(int[] persons, int[] times) { + + } + + public int Q(int t) { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * TopVotedCandidate obj = new TopVotedCandidate(persons, times); + * int param_1 = obj.Q(t); + */","/** + * @param {number[]} persons + * @param {number[]} times + */ +var TopVotedCandidate = function(persons, times) { + +}; + +/** + * @param {number} t + * @return {number} + */ +TopVotedCandidate.prototype.q = function(t) { + +}; + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * var obj = new TopVotedCandidate(persons, times) + * var param_1 = obj.q(t) + */","class TopVotedCandidate + +=begin + :type persons: Integer[] + :type times: Integer[] +=end + def initialize(persons, times) + + end + + +=begin + :type t: Integer + :rtype: Integer +=end + def q(t) + + end + + +end + +# Your TopVotedCandidate object will be instantiated and called as such: +# obj = TopVotedCandidate.new(persons, times) +# param_1 = obj.q(t)"," +class TopVotedCandidate { + + init(_ persons: [Int], _ times: [Int]) { + + } + + func q(_ t: Int) -> Int { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * let obj = TopVotedCandidate(persons, times) + * let ret_1: Int = obj.q(t) + */","type TopVotedCandidate struct { + +} + + +func Constructor(persons []int, times []int) TopVotedCandidate { + +} + + +func (this *TopVotedCandidate) Q(t int) int { + +} + + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * obj := Constructor(persons, times); + * param_1 := obj.Q(t); + */","class TopVotedCandidate(_persons: Array[Int], _times: Array[Int]) { + + def q(t: Int): Int = { + + } + +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * var obj = new TopVotedCandidate(persons, times) + * var param_1 = obj.q(t) + */","class TopVotedCandidate(persons: IntArray, times: IntArray) { + + fun q(t: Int): Int { + + } + +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * var obj = TopVotedCandidate(persons, times) + * var param_1 = obj.q(t) + */","struct TopVotedCandidate { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl TopVotedCandidate { + + fn new(persons: Vec, times: Vec) -> Self { + + } + + fn q(&self, t: i32) -> i32 { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * let obj = TopVotedCandidate::new(persons, times); + * let ret_1: i32 = obj.q(t); + */","class TopVotedCandidate { + /** + * @param Integer[] $persons + * @param Integer[] $times + */ + function __construct($persons, $times) { + + } + + /** + * @param Integer $t + * @return Integer + */ + function q($t) { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * $obj = TopVotedCandidate($persons, $times); + * $ret_1 = $obj->q($t); + */","class TopVotedCandidate { + constructor(persons: number[], times: number[]) { + + } + + q(t: number): number { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * var obj = new TopVotedCandidate(persons, times) + * var param_1 = obj.q(t) + */","(define top-voted-candidate% + (class object% + (super-new) + + ; persons : (listof exact-integer?) + + ; times : (listof exact-integer?) + (init-field + persons + times) + + ; q : exact-integer? -> exact-integer? + (define/public (q t) + + ))) + +;; Your top-voted-candidate% object will be instantiated and called as such: +;; (define obj (new top-voted-candidate% [persons persons] [times times])) +;; (define param_1 (send obj q t))","-spec top_voted_candidate_init_(Persons :: [integer()], Times :: [integer()]) -> any(). +top_voted_candidate_init_(Persons, Times) -> + . + +-spec top_voted_candidate_q(T :: integer()) -> integer(). +top_voted_candidate_q(T) -> + . + + +%% Your functions will be called as such: +%% top_voted_candidate_init_(Persons, Times), +%% Param_1 = top_voted_candidate_q(T), + +%% top_voted_candidate_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule TopVotedCandidate do + @spec init_(persons :: [integer], times :: [integer]) :: any + def init_(persons, times) do + + end + + @spec q(t :: integer) :: integer + def q(t) do + + end +end + +# Your functions will be called as such: +# TopVotedCandidate.init_(persons, times) +# param_1 = TopVotedCandidate.q(t) + +# TopVotedCandidate.init_ will be called before every test case, in which you can do some necessary initializations.","class TopVotedCandidate { + + TopVotedCandidate(List persons, List times) { + + } + + int q(int t) { + + } +} + +/** + * Your TopVotedCandidate object will be instantiated and called as such: + * TopVotedCandidate obj = TopVotedCandidate(persons, times); + * int param1 = obj.q(t); + */", +1414,smallest-range-ii,Smallest Range II,910.0,946.0,"

You are given an integer array nums and an integer k.

+ +

For each index i where 0 <= i < nums.length, change nums[i] to be either nums[i] + k or nums[i] - k.

+ +

The score of nums is the difference between the maximum and minimum elements in nums.

+ +

Return the minimum score of nums after changing the values at each index.

+ +

 

+

Example 1:

+ +
+Input: nums = [1], k = 0
+Output: 0
+Explanation: The score is max(nums) - min(nums) = 1 - 1 = 0.
+
+ +

Example 2:

+ +
+Input: nums = [0,10], k = 2
+Output: 6
+Explanation: Change nums to be [2, 8]. The score is max(nums) - min(nums) = 8 - 2 = 6.
+
+ +

Example 3:

+ +
+Input: nums = [1,3,6], k = 3
+Output: 3
+Explanation: Change nums to be [4, 6, 3]. The score is max(nums) - min(nums) = 6 - 3 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • 0 <= nums[i] <= 104
    • +
  • 0 <= k <= 104
    • +
+",2.0,False,"class Solution { +public: + int smallestRangeII(vector& nums, int k) { + + } +};","class Solution { + public int smallestRangeII(int[] nums, int k) { + + } +}","class Solution(object): + def smallestRangeII(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def smallestRangeII(self, nums: List[int], k: int) -> int: + ","int smallestRangeII(int* nums, int numsSize, int k){ + +}","public class Solution { + public int SmallestRangeII(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var smallestRangeII = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def smallest_range_ii(nums, k) + +end","class Solution { + func smallestRangeII(_ nums: [Int], _ k: Int) -> Int { + + } +}","func smallestRangeII(nums []int, k int) int { + +}","object Solution { + def smallestRangeII(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun smallestRangeII(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn smallest_range_ii(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function smallestRangeII($nums, $k) { + + } +}","function smallestRangeII(nums: number[], k: number): number { + +};","(define/contract (smallest-range-ii nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec smallest_range_ii(Nums :: [integer()], K :: integer()) -> integer(). +smallest_range_ii(Nums, K) -> + .","defmodule Solution do + @spec smallest_range_ii(nums :: [integer], k :: integer) :: integer + def smallest_range_ii(nums, k) do + + end +end","class Solution { + int smallestRangeII(List nums, int k) { + + } +}", +1418,super-palindromes,Super Palindromes,906.0,942.0,"

Let's say a positive integer is a super-palindrome if it is a palindrome, and it is also the square of a palindrome.

+ +

Given two positive integers left and right represented as strings, return the number of super-palindromes integers in the inclusive range [left, right].

+ +

 

+

Example 1:

+ +
+Input: left = "4", right = "1000"
+Output: 4
+Explanation: 4, 9, 121, and 484 are superpalindromes.
+Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
+
+ +

Example 2:

+ +
+Input: left = "1", right = "2"
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left.length, right.length <= 18
    • +
  • left and right consist of only digits.
    • +
  • left and right cannot have leading zeros.
    • +
  • left and right represent integers in the range [1, 1018 - 1].
    • +
  • left is less than or equal to right.
    • +
+",3.0,False,"class Solution { +public: + int superpalindromesInRange(string left, string right) { + + } +};","class Solution { + public int superpalindromesInRange(String left, String right) { + + } +}","class Solution(object): + def superpalindromesInRange(self, left, right): + """""" + :type left: str + :type right: str + :rtype: int + """""" + ","class Solution: + def superpalindromesInRange(self, left: str, right: str) -> int: + ","int superpalindromesInRange(char * left, char * right){ + +}","public class Solution { + public int SuperpalindromesInRange(string left, string right) { + + } +}","/** + * @param {string} left + * @param {string} right + * @return {number} + */ +var superpalindromesInRange = function(left, right) { + +};","# @param {String} left +# @param {String} right +# @return {Integer} +def superpalindromes_in_range(left, right) + +end","class Solution { + func superpalindromesInRange(_ left: String, _ right: String) -> Int { + + } +}","func superpalindromesInRange(left string, right string) int { + +}","object Solution { + def superpalindromesInRange(left: String, right: String): Int = { + + } +}","class Solution { + fun superpalindromesInRange(left: String, right: String): Int { + + } +}","impl Solution { + pub fn superpalindromes_in_range(left: String, right: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $left + * @param String $right + * @return Integer + */ + function superpalindromesInRange($left, $right) { + + } +}","function superpalindromesInRange(left: string, right: string): number { + +};","(define/contract (superpalindromes-in-range left right) + (-> string? string? exact-integer?) + + )","-spec superpalindromes_in_range(Left :: unicode:unicode_binary(), Right :: unicode:unicode_binary()) -> integer(). +superpalindromes_in_range(Left, Right) -> + .","defmodule Solution do + @spec superpalindromes_in_range(left :: String.t, right :: String.t) :: integer + def superpalindromes_in_range(left, right) do + + end +end","class Solution { + int superpalindromesInRange(String left, String right) { + + } +}", +1421,valid-permutations-for-di-sequence,Valid Permutations for DI Sequence,903.0,939.0,"

You are given a string s of length n where s[i] is either:

+ +
    +
  • 'D' means decreasing, or
    • +
  • 'I' means increasing.
    • +
+ +

A permutation perm of n + 1 integers of all the integers in the range [0, n] is called a valid permutation if for all valid i:

+ +
    +
  • If s[i] == 'D', then perm[i] > perm[i + 1], and
    • +
  • If s[i] == 'I', then perm[i] < perm[i + 1].
    • +
+ +

Return the number of valid permutations perm. Since the answer may be large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "DID"
+Output: 5
+Explanation: The 5 valid permutations of (0, 1, 2, 3) are:
+(1, 0, 3, 2)
+(2, 0, 3, 1)
+(2, 1, 3, 0)
+(3, 0, 2, 1)
+(3, 1, 2, 0)
+
+ +

Example 2:

+ +
+Input: s = "D"
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length
    • +
  • 1 <= n <= 200
    • +
  • s[i] is either 'I' or 'D'.
    • +
+",3.0,False,"class Solution { +public: + int numPermsDISequence(string s) { + + } +};","class Solution { + public int numPermsDISequence(String s) { + + } +}","class Solution(object): + def numPermsDISequence(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def numPermsDISequence(self, s: str) -> int: + ","int numPermsDISequence(char * s){ + +}","public class Solution { + public int NumPermsDISequence(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var numPermsDISequence = function(s) { + +};","# @param {String} s +# @return {Integer} +def num_perms_di_sequence(s) + +end","class Solution { + func numPermsDISequence(_ s: String) -> Int { + + } +}","func numPermsDISequence(s string) int { + +}","object Solution { + def numPermsDISequence(s: String): Int = { + + } +}","class Solution { + fun numPermsDISequence(s: String): Int { + + } +}","impl Solution { + pub fn num_perms_di_sequence(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function numPermsDISequence($s) { + + } +}","function numPermsDISequence(s: string): number { + +};","(define/contract (num-perms-di-sequence s) + (-> string? exact-integer?) + + )","-spec num_perms_di_sequence(S :: unicode:unicode_binary()) -> integer(). +num_perms_di_sequence(S) -> + .","defmodule Solution do + @spec num_perms_di_sequence(s :: String.t) :: integer + def num_perms_di_sequence(s) do + + end +end","class Solution { + int numPermsDISequence(String s) { + + } +}", +1422,numbers-at-most-n-given-digit-set,Numbers At Most N Given Digit Set,902.0,938.0,"

Given an array of digits which is sorted in non-decreasing order. You can write numbers using each digits[i] as many times as we want. For example, if digits = ['1','3','5'], we may write numbers such as '13', '551', and '1351315'.

+ +

Return the number of positive integers that can be generated that are less than or equal to a given integer n.

+ +

 

+

Example 1:

+ +
+Input: digits = ["1","3","5","7"], n = 100
+Output: 20
+Explanation: 
+The 20 numbers that can be written are:
+1, 3, 5, 7, 11, 13, 15, 17, 31, 33, 35, 37, 51, 53, 55, 57, 71, 73, 75, 77.
+
+ +

Example 2:

+ +
+Input: digits = ["1","4","9"], n = 1000000000
+Output: 29523
+Explanation: 
+We can write 3 one digit numbers, 9 two digit numbers, 27 three digit numbers,
+81 four digit numbers, 243 five digit numbers, 729 six digit numbers,
+2187 seven digit numbers, 6561 eight digit numbers, and 19683 nine digit numbers.
+In total, this is 29523 integers that can be written using the digits array.
+
+ +

Example 3:

+ +
+Input: digits = ["7"], n = 8
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= digits.length <= 9
    • +
  • digits[i].length == 1
    • +
  • digits[i] is a digit from '1' to '9'.
    • +
  • All the values in digits are unique.
    • +
  • digits is sorted in non-decreasing order.
    • +
  • 1 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int atMostNGivenDigitSet(vector& digits, int n) { + + } +};","class Solution { + public int atMostNGivenDigitSet(String[] digits, int n) { + + } +}","class Solution(object): + def atMostNGivenDigitSet(self, digits, n): + """""" + :type digits: List[str] + :type n: int + :rtype: int + """""" + ","class Solution: + def atMostNGivenDigitSet(self, digits: List[str], n: int) -> int: + ","int atMostNGivenDigitSet(char ** digits, int digitsSize, int n){ + +}","public class Solution { + public int AtMostNGivenDigitSet(string[] digits, int n) { + + } +}","/** + * @param {string[]} digits + * @param {number} n + * @return {number} + */ +var atMostNGivenDigitSet = function(digits, n) { + +};","# @param {String[]} digits +# @param {Integer} n +# @return {Integer} +def at_most_n_given_digit_set(digits, n) + +end","class Solution { + func atMostNGivenDigitSet(_ digits: [String], _ n: Int) -> Int { + + } +}","func atMostNGivenDigitSet(digits []string, n int) int { + +}","object Solution { + def atMostNGivenDigitSet(digits: Array[String], n: Int): Int = { + + } +}","class Solution { + fun atMostNGivenDigitSet(digits: Array, n: Int): Int { + + } +}","impl Solution { + pub fn at_most_n_given_digit_set(digits: Vec, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $digits + * @param Integer $n + * @return Integer + */ + function atMostNGivenDigitSet($digits, $n) { + + } +}","function atMostNGivenDigitSet(digits: string[], n: number): number { + +};","(define/contract (at-most-n-given-digit-set digits n) + (-> (listof string?) exact-integer? exact-integer?) + + )","-spec at_most_n_given_digit_set(Digits :: [unicode:unicode_binary()], N :: integer()) -> integer(). +at_most_n_given_digit_set(Digits, N) -> + .","defmodule Solution do + @spec at_most_n_given_digit_set(digits :: [String.t], n :: integer) :: integer + def at_most_n_given_digit_set(digits, n) do + + end +end","class Solution { + int atMostNGivenDigitSet(List digits, int n) { + + } +}", +1424,rle-iterator,RLE Iterator,900.0,936.0,"

We can use run-length encoding (i.e., RLE) to encode a sequence of integers. In a run-length encoded array of even length encoding (0-indexed), for all even i, encoding[i] tells us the number of times that the non-negative integer value encoding[i + 1] is repeated in the sequence.

+ +
    +
  • For example, the sequence arr = [8,8,8,5,5] can be encoded to be encoding = [3,8,2,5]. encoding = [3,8,0,9,2,5] and encoding = [2,8,1,8,2,5] are also valid RLE of arr.
    • +
+ +

Given a run-length encoded array, design an iterator that iterates through it.

+ +

Implement the RLEIterator class:

+ +
    +
  • RLEIterator(int[] encoded) Initializes the object with the encoded array encoded.
    • +
  • int next(int n) Exhausts the next n elements and returns the last element exhausted in this way. If there is no element left to exhaust, return -1 instead.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["RLEIterator", "next", "next", "next", "next"]
+[[[3, 8, 0, 9, 2, 5]], [2], [1], [1], [2]]
+Output
+[null, 8, 8, 5, -1]
+
+Explanation
+RLEIterator rLEIterator = new RLEIterator([3, 8, 0, 9, 2, 5]); // This maps to the sequence [8,8,8,5,5].
+rLEIterator.next(2); // exhausts 2 terms of the sequence, returning 8. The remaining sequence is now [8, 5, 5].
+rLEIterator.next(1); // exhausts 1 term of the sequence, returning 8. The remaining sequence is now [5, 5].
+rLEIterator.next(1); // exhausts 1 term of the sequence, returning 5. The remaining sequence is now [5].
+rLEIterator.next(2); // exhausts 2 terms, returning -1. This is because the first term exhausted was 5,
+but the second term did not exist. Since the last term exhausted does not exist, we return -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= encoding.length <= 1000
    • +
  • encoding.length is even.
    • +
  • 0 <= encoding[i] <= 109
    • +
  • 1 <= n <= 109
    • +
  • At most 1000 calls will be made to next.
    • +
+",2.0,False,"class RLEIterator { +public: + RLEIterator(vector& encoding) { + + } + + int next(int n) { + + } +}; + +/** + * Your RLEIterator object will be instantiated and called as such: + * RLEIterator* obj = new RLEIterator(encoding); + * int param_1 = obj->next(n); + */","class RLEIterator { + + public RLEIterator(int[] encoding) { + + } + + public int next(int n) { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * RLEIterator obj = new RLEIterator(encoding); + * int param_1 = obj.next(n); + */","class RLEIterator(object): + + def __init__(self, encoding): + """""" + :type encoding: List[int] + """""" + + + def next(self, n): + """""" + :type n: int + :rtype: int + """""" + + + +# Your RLEIterator object will be instantiated and called as such: +# obj = RLEIterator(encoding) +# param_1 = obj.next(n)","class RLEIterator: + + def __init__(self, encoding: List[int]): + + + def next(self, n: int) -> int: + + + +# Your RLEIterator object will be instantiated and called as such: +# obj = RLEIterator(encoding) +# param_1 = obj.next(n)"," + + +typedef struct { + +} RLEIterator; + + +RLEIterator* rLEIteratorCreate(int* encoding, int encodingSize) { + +} + +int rLEIteratorNext(RLEIterator* obj, int n) { + +} + +void rLEIteratorFree(RLEIterator* obj) { + +} + +/** + * Your RLEIterator struct will be instantiated and called as such: + * RLEIterator* obj = rLEIteratorCreate(encoding, encodingSize); + * int param_1 = rLEIteratorNext(obj, n); + + * rLEIteratorFree(obj); +*/","public class RLEIterator { + + public RLEIterator(int[] encoding) { + + } + + public int Next(int n) { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * RLEIterator obj = new RLEIterator(encoding); + * int param_1 = obj.Next(n); + */","/** + * @param {number[]} encoding + */ +var RLEIterator = function(encoding) { + +}; + +/** + * @param {number} n + * @return {number} + */ +RLEIterator.prototype.next = function(n) { + +}; + +/** + * Your RLEIterator object will be instantiated and called as such: + * var obj = new RLEIterator(encoding) + * var param_1 = obj.next(n) + */","class RLEIterator + +=begin + :type encoding: Integer[] +=end + def initialize(encoding) + + end + + +=begin + :type n: Integer + :rtype: Integer +=end + def next(n) + + end + + +end + +# Your RLEIterator object will be instantiated and called as such: +# obj = RLEIterator.new(encoding) +# param_1 = obj.next(n)"," +class RLEIterator { + + init(_ encoding: [Int]) { + + } + + func next(_ n: Int) -> Int { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * let obj = RLEIterator(encoding) + * let ret_1: Int = obj.next(n) + */","type RLEIterator struct { + +} + + +func Constructor(encoding []int) RLEIterator { + +} + + +func (this *RLEIterator) Next(n int) int { + +} + + +/** + * Your RLEIterator object will be instantiated and called as such: + * obj := Constructor(encoding); + * param_1 := obj.Next(n); + */","class RLEIterator(_encoding: Array[Int]) { + + def next(n: Int): Int = { + + } + +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * var obj = new RLEIterator(encoding) + * var param_1 = obj.next(n) + */","class RLEIterator(encoding: IntArray) { + + fun next(n: Int): Int { + + } + +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * var obj = RLEIterator(encoding) + * var param_1 = obj.next(n) + */","struct RLEIterator { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl RLEIterator { + + fn new(encoding: Vec) -> Self { + + } + + fn next(&self, n: i32) -> i32 { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * let obj = RLEIterator::new(encoding); + * let ret_1: i32 = obj.next(n); + */","class RLEIterator { + /** + * @param Integer[] $encoding + */ + function __construct($encoding) { + + } + + /** + * @param Integer $n + * @return Integer + */ + function next($n) { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * $obj = RLEIterator($encoding); + * $ret_1 = $obj->next($n); + */","class RLEIterator { + constructor(encoding: number[]) { + + } + + next(n: number): number { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * var obj = new RLEIterator(encoding) + * var param_1 = obj.next(n) + */","(define rle-iterator% + (class object% + (super-new) + + ; encoding : (listof exact-integer?) + (init-field + encoding) + + ; next : exact-integer? -> exact-integer? + (define/public (next n) + + ))) + +;; Your rle-iterator% object will be instantiated and called as such: +;; (define obj (new rle-iterator% [encoding encoding])) +;; (define param_1 (send obj next n))","-spec rle_iterator_init_(Encoding :: [integer()]) -> any(). +rle_iterator_init_(Encoding) -> + . + +-spec rle_iterator_next(N :: integer()) -> integer(). +rle_iterator_next(N) -> + . + + +%% Your functions will be called as such: +%% rle_iterator_init_(Encoding), +%% Param_1 = rle_iterator_next(N), + +%% rle_iterator_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule RLEIterator do + @spec init_(encoding :: [integer]) :: any + def init_(encoding) do + + end + + @spec next(n :: integer) :: integer + def next(n) do + + end +end + +# Your functions will be called as such: +# RLEIterator.init_(encoding) +# param_1 = RLEIterator.next(n) + +# RLEIterator.init_ will be called before every test case, in which you can do some necessary initializations.","class RLEIterator { + + RLEIterator(List encoding) { + + } + + int next(int n) { + + } +} + +/** + * Your RLEIterator object will be instantiated and called as such: + * RLEIterator obj = RLEIterator(encoding); + * int param1 = obj.next(n); + */", +1425,orderly-queue,Orderly Queue,899.0,935.0,"

You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..

+ +

Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.

+ +

 

+

Example 1:

+ +
+Input: s = "cba", k = 1
+Output: "acb"
+Explanation: 
+In the first move, we move the 1st character 'c' to the end, obtaining the string "bac".
+In the second move, we move the 1st character 'b' to the end, obtaining the final result "acb".
+
+ +

Example 2:

+ +
+Input: s = "baaca", k = 3
+Output: "aaabc"
+Explanation: 
+In the first move, we move the 1st character 'b' to the end, obtaining the string "aacab".
+In the second move, we move the 3rd character 'c' to the end, obtaining the final result "aaabc".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= s.length <= 1000
    • +
  • s consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + string orderlyQueue(string s, int k) { + + } +};","class Solution { + public String orderlyQueue(String s, int k) { + + } +}","class Solution(object): + def orderlyQueue(self, s, k): + """""" + :type s: str + :type k: int + :rtype: str + """""" + ","class Solution: + def orderlyQueue(self, s: str, k: int) -> str: + ","char * orderlyQueue(char * s, int k){ + +}","public class Solution { + public string OrderlyQueue(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var orderlyQueue = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {String} +def orderly_queue(s, k) + +end","class Solution { + func orderlyQueue(_ s: String, _ k: Int) -> String { + + } +}","func orderlyQueue(s string, k int) string { + +}","object Solution { + def orderlyQueue(s: String, k: Int): String = { + + } +}","class Solution { + fun orderlyQueue(s: String, k: Int): String { + + } +}","impl Solution { + pub fn orderly_queue(s: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return String + */ + function orderlyQueue($s, $k) { + + } +}","function orderlyQueue(s: string, k: number): string { + +};","(define/contract (orderly-queue s k) + (-> string? exact-integer? string?) + + )","-spec orderly_queue(S :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +orderly_queue(S, K) -> + .","defmodule Solution do + @spec orderly_queue(s :: String.t, k :: integer) :: String.t + def orderly_queue(s, k) do + + end +end","class Solution { + String orderlyQueue(String s, int k) { + + } +}", +1429,maximum-frequency-stack,Maximum Frequency Stack,895.0,931.0,"

Design a stack-like data structure to push elements to the stack and pop the most frequent element from the stack.

+ +

Implement the FreqStack class:

+ +
    +
  • FreqStack() constructs an empty frequency stack.
    • +
  • void push(int val) pushes an integer val onto the top of the stack.
    • +
  • int pop() removes and returns the most frequent element in the stack. +
      +
    • If there is a tie for the most frequent element, the element closest to the stack's top is removed and returned.
      • +
    +
    • +
+ +

 

+

Example 1:

+ +
+Input
+["FreqStack", "push", "push", "push", "push", "push", "push", "pop", "pop", "pop", "pop"]
+[[], [5], [7], [5], [7], [4], [5], [], [], [], []]
+Output
+[null, null, null, null, null, null, null, 5, 7, 5, 4]
+
+Explanation
+FreqStack freqStack = new FreqStack();
+freqStack.push(5); // The stack is [5]
+freqStack.push(7); // The stack is [5,7]
+freqStack.push(5); // The stack is [5,7,5]
+freqStack.push(7); // The stack is [5,7,5,7]
+freqStack.push(4); // The stack is [5,7,5,7,4]
+freqStack.push(5); // The stack is [5,7,5,7,4,5]
+freqStack.pop();   // return 5, as 5 is the most frequent. The stack becomes [5,7,5,7,4].
+freqStack.pop();   // return 7, as 5 and 7 is the most frequent, but 7 is closest to the top. The stack becomes [5,7,5,4].
+freqStack.pop();   // return 5, as 5 is the most frequent. The stack becomes [5,7,4].
+freqStack.pop();   // return 4, as 4, 5 and 7 is the most frequent, but 4 is closest to the top. The stack becomes [5,7].
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= val <= 109
    • +
  • At most 2 * 104 calls will be made to push and pop.
    • +
  • It is guaranteed that there will be at least one element in the stack before calling pop.
    • +
+",3.0,False,"class FreqStack { +public: + FreqStack() { + + } + + void push(int val) { + + } + + int pop() { + + } +}; + +/** + * Your FreqStack object will be instantiated and called as such: + * FreqStack* obj = new FreqStack(); + * obj->push(val); + * int param_2 = obj->pop(); + */","class FreqStack { + + public FreqStack() { + + } + + public void push(int val) { + + } + + public int pop() { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * FreqStack obj = new FreqStack(); + * obj.push(val); + * int param_2 = obj.pop(); + */","class FreqStack(object): + + def __init__(self): + + + def push(self, val): + """""" + :type val: int + :rtype: None + """""" + + + def pop(self): + """""" + :rtype: int + """""" + + + +# Your FreqStack object will be instantiated and called as such: +# obj = FreqStack() +# obj.push(val) +# param_2 = obj.pop()","class FreqStack: + + def __init__(self): + + + def push(self, val: int) -> None: + + + def pop(self) -> int: + + + +# Your FreqStack object will be instantiated and called as such: +# obj = FreqStack() +# obj.push(val) +# param_2 = obj.pop()"," + + +typedef struct { + +} FreqStack; + + +FreqStack* freqStackCreate() { + +} + +void freqStackPush(FreqStack* obj, int val) { + +} + +int freqStackPop(FreqStack* obj) { + +} + +void freqStackFree(FreqStack* obj) { + +} + +/** + * Your FreqStack struct will be instantiated and called as such: + * FreqStack* obj = freqStackCreate(); + * freqStackPush(obj, val); + + * int param_2 = freqStackPop(obj); + + * freqStackFree(obj); +*/","public class FreqStack { + + public FreqStack() { + + } + + public void Push(int val) { + + } + + public int Pop() { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * FreqStack obj = new FreqStack(); + * obj.Push(val); + * int param_2 = obj.Pop(); + */"," +var FreqStack = function() { + +}; + +/** + * @param {number} val + * @return {void} + */ +FreqStack.prototype.push = function(val) { + +}; + +/** + * @return {number} + */ +FreqStack.prototype.pop = function() { + +}; + +/** + * Your FreqStack object will be instantiated and called as such: + * var obj = new FreqStack() + * obj.push(val) + * var param_2 = obj.pop() + */","class FreqStack + def initialize() + + end + + +=begin + :type val: Integer + :rtype: Void +=end + def push(val) + + end + + +=begin + :rtype: Integer +=end + def pop() + + end + + +end + +# Your FreqStack object will be instantiated and called as such: +# obj = FreqStack.new() +# obj.push(val) +# param_2 = obj.pop()"," +class FreqStack { + + init() { + + } + + func push(_ val: Int) { + + } + + func pop() -> Int { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * let obj = FreqStack() + * obj.push(val) + * let ret_2: Int = obj.pop() + */","type FreqStack struct { + +} + + +func Constructor() FreqStack { + +} + + +func (this *FreqStack) Push(val int) { + +} + + +func (this *FreqStack) Pop() int { + +} + + +/** + * Your FreqStack object will be instantiated and called as such: + * obj := Constructor(); + * obj.Push(val); + * param_2 := obj.Pop(); + */","class FreqStack() { + + def push(`val`: Int) { + + } + + def pop(): Int = { + + } + +} + +/** + * Your FreqStack object will be instantiated and called as such: + * var obj = new FreqStack() + * obj.push(`val`) + * var param_2 = obj.pop() + */","class FreqStack() { + + fun push(`val`: Int) { + + } + + fun pop(): Int { + + } + +} + +/** + * Your FreqStack object will be instantiated and called as such: + * var obj = FreqStack() + * obj.push(`val`) + * var param_2 = obj.pop() + */","struct FreqStack { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl FreqStack { + + fn new() -> Self { + + } + + fn push(&self, val: i32) { + + } + + fn pop(&self) -> i32 { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * let obj = FreqStack::new(); + * obj.push(val); + * let ret_2: i32 = obj.pop(); + */","class FreqStack { + /** + */ + function __construct() { + + } + + /** + * @param Integer $val + * @return NULL + */ + function push($val) { + + } + + /** + * @return Integer + */ + function pop() { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * $obj = FreqStack(); + * $obj->push($val); + * $ret_2 = $obj->pop(); + */","class FreqStack { + constructor() { + + } + + push(val: number): void { + + } + + pop(): number { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * var obj = new FreqStack() + * obj.push(val) + * var param_2 = obj.pop() + */","(define freq-stack% + (class object% + (super-new) + (init-field) + + ; push : exact-integer? -> void? + (define/public (push val) + + ) + ; pop : -> exact-integer? + (define/public (pop) + + ))) + +;; Your freq-stack% object will be instantiated and called as such: +;; (define obj (new freq-stack%)) +;; (send obj push val) +;; (define param_2 (send obj pop))","-spec freq_stack_init_() -> any(). +freq_stack_init_() -> + . + +-spec freq_stack_push(Val :: integer()) -> any(). +freq_stack_push(Val) -> + . + +-spec freq_stack_pop() -> integer(). +freq_stack_pop() -> + . + + +%% Your functions will be called as such: +%% freq_stack_init_(), +%% freq_stack_push(Val), +%% Param_2 = freq_stack_pop(), + +%% freq_stack_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule FreqStack do + @spec init_() :: any + def init_() do + + end + + @spec push(val :: integer) :: any + def push(val) do + + end + + @spec pop() :: integer + def pop() do + + end +end + +# Your functions will be called as such: +# FreqStack.init_() +# FreqStack.push(val) +# param_2 = FreqStack.pop() + +# FreqStack.init_ will be called before every test case, in which you can do some necessary initializations.","class FreqStack { + + FreqStack() { + + } + + void push(int val) { + + } + + int pop() { + + } +} + +/** + * Your FreqStack object will be instantiated and called as such: + * FreqStack obj = FreqStack(); + * obj.push(val); + * int param2 = obj.pop(); + */", +1432,surface-area-of-3d-shapes,Surface Area of 3D Shapes,892.0,928.0,"

You are given an n x n grid where you have placed some 1 x 1 x 1 cubes. Each value v = grid[i][j] represents a tower of v cubes placed on top of cell (i, j).

+ +

After placing these cubes, you have decided to glue any directly adjacent cubes to each other, forming several irregular 3D shapes.

+ +

Return the total surface area of the resulting shapes.

+ +

Note: The bottom face of each shape counts toward its surface area.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,2],[3,4]]
+Output: 34
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
+Output: 32
+
+ +

Example 3:

+ +
+Input: grid = [[2,2,2],[2,1,2],[2,2,2]]
+Output: 46
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
    • +
  • 1 <= n <= 50
    • +
  • 0 <= grid[i][j] <= 50
    • +
+",1.0,False,"class Solution { +public: + int surfaceArea(vector>& grid) { + + } +};","class Solution { + public int surfaceArea(int[][] grid) { + + } +}","class Solution(object): + def surfaceArea(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def surfaceArea(self, grid: List[List[int]]) -> int: + ","int surfaceArea(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int SurfaceArea(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var surfaceArea = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def surface_area(grid) + +end","class Solution { + func surfaceArea(_ grid: [[Int]]) -> Int { + + } +}","func surfaceArea(grid [][]int) int { + +}","object Solution { + def surfaceArea(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun surfaceArea(grid: Array): Int { + + } +}","impl Solution { + pub fn surface_area(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function surfaceArea($grid) { + + } +}","function surfaceArea(grid: number[][]): number { + +};","(define/contract (surface-area grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec surface_area(Grid :: [[integer()]]) -> integer(). +surface_area(Grid) -> + .","defmodule Solution do + @spec surface_area(grid :: [[integer]]) :: integer + def surface_area(grid) do + + end +end","class Solution { + int surfaceArea(List> grid) { + + } +}", +1433,sum-of-subsequence-widths,Sum of Subsequence Widths,891.0,927.0,"

The width of a sequence is the difference between the maximum and minimum elements in the sequence.

+ +

Given an array of integers nums, return the sum of the widths of all the non-empty subsequences of nums. Since the answer may be very large, return it modulo 109 + 7.

+ +

A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,3]
+Output: 6
+Explanation: The subsequences are [1], [2], [3], [2,1], [2,3], [1,3], [2,1,3].
+The corresponding widths are 0, 0, 0, 1, 1, 2, 2.
+The sum of these widths is 6.
+
+ +

Example 2:

+ +
+Input: nums = [2]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int sumSubseqWidths(vector& nums) { + + } +};","class Solution { + public int sumSubseqWidths(int[] nums) { + + } +}","class Solution(object): + def sumSubseqWidths(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def sumSubseqWidths(self, nums: List[int]) -> int: + ","int sumSubseqWidths(int* nums, int numsSize){ + +}","public class Solution { + public int SumSubseqWidths(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var sumSubseqWidths = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def sum_subseq_widths(nums) + +end","class Solution { + func sumSubseqWidths(_ nums: [Int]) -> Int { + + } +}","func sumSubseqWidths(nums []int) int { + +}","object Solution { + def sumSubseqWidths(nums: Array[Int]): Int = { + + } +}","class Solution { + fun sumSubseqWidths(nums: IntArray): Int { + + } +}","impl Solution { + pub fn sum_subseq_widths(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function sumSubseqWidths($nums) { + + } +}","function sumSubseqWidths(nums: number[]): number { + +};","(define/contract (sum-subseq-widths nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec sum_subseq_widths(Nums :: [integer()]) -> integer(). +sum_subseq_widths(Nums) -> + .","defmodule Solution do + @spec sum_subseq_widths(nums :: [integer]) :: integer + def sum_subseq_widths(nums) do + + end +end","class Solution { + int sumSubseqWidths(List nums) { + + } +}", +1434,find-and-replace-pattern,Find and Replace Pattern,890.0,926.0,"

Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order.

+ +

A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word.

+ +

Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter.

+ +

 

+

Example 1:

+ +
+Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
+Output: ["mee","aqq"]
+Explanation: "mee" matches the pattern because there is a permutation {a -> m, b -> e, ...}. 
+"ccc" does not match the pattern because {a -> c, b -> c, ...} is not a permutation, since a and b map to the same letter.
+
+ +

Example 2:

+ +
+Input: words = ["a","b","c"], pattern = "a"
+Output: ["a","b","c"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pattern.length <= 20
    • +
  • 1 <= words.length <= 50
    • +
  • words[i].length == pattern.length
    • +
  • pattern and words[i] are lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector findAndReplacePattern(vector& words, string pattern) { + + } +};","class Solution { + public List findAndReplacePattern(String[] words, String pattern) { + + } +}","class Solution(object): + def findAndReplacePattern(self, words, pattern): + """""" + :type words: List[str] + :type pattern: str + :rtype: List[str] + """""" + ","class Solution: + def findAndReplacePattern(self, words: List[str], pattern: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** findAndReplacePattern(char ** words, int wordsSize, char * pattern, int* returnSize){ + +}","public class Solution { + public IList FindAndReplacePattern(string[] words, string pattern) { + + } +}","/** + * @param {string[]} words + * @param {string} pattern + * @return {string[]} + */ +var findAndReplacePattern = function(words, pattern) { + +};","# @param {String[]} words +# @param {String} pattern +# @return {String[]} +def find_and_replace_pattern(words, pattern) + +end","class Solution { + func findAndReplacePattern(_ words: [String], _ pattern: String) -> [String] { + + } +}","func findAndReplacePattern(words []string, pattern string) []string { + +}","object Solution { + def findAndReplacePattern(words: Array[String], pattern: String): List[String] = { + + } +}","class Solution { + fun findAndReplacePattern(words: Array, pattern: String): List { + + } +}","impl Solution { + pub fn find_and_replace_pattern(words: Vec, pattern: String) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @param String $pattern + * @return String[] + */ + function findAndReplacePattern($words, $pattern) { + + } +}","function findAndReplacePattern(words: string[], pattern: string): string[] { + +};","(define/contract (find-and-replace-pattern words pattern) + (-> (listof string?) string? (listof string?)) + + )","-spec find_and_replace_pattern(Words :: [unicode:unicode_binary()], Pattern :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +find_and_replace_pattern(Words, Pattern) -> + .","defmodule Solution do + @spec find_and_replace_pattern(words :: [String.t], pattern :: String.t) :: [String.t] + def find_and_replace_pattern(words, pattern) do + + end +end","class Solution { + List findAndReplacePattern(List words, String pattern) { + + } +}", +1435,construct-binary-tree-from-preorder-and-postorder-traversal,Construct Binary Tree from Preorder and Postorder Traversal,889.0,925.0,"

Given two integer arrays, preorder and postorder where preorder is the preorder traversal of a binary tree of distinct values and postorder is the postorder traversal of the same tree, reconstruct and return the binary tree.

+ +

If there exist multiple answers, you can return any of them.

+ +

 

+

Example 1:

+ +
+Input: preorder = [1,2,4,5,3,6,7], postorder = [4,5,2,6,7,3,1]
+Output: [1,2,3,4,5,6,7]
+
+ +

Example 2:

+ +
+Input: preorder = [1], postorder = [1]
+Output: [1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= preorder.length <= 30
    • +
  • 1 <= preorder[i] <= preorder.length
    • +
  • All the values of preorder are unique.
    • +
  • postorder.length == preorder.length
    • +
  • 1 <= postorder[i] <= postorder.length
    • +
  • All the values of postorder are unique.
    • +
  • It is guaranteed that preorder and postorder are the preorder traversal and postorder traversal of the same binary tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* constructFromPrePost(vector& preorder, vector& postorder) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode constructFromPrePost(int[] preorder, int[] postorder) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def constructFromPrePost(self, preorder, postorder): + """""" + :type preorder: List[int] + :type postorder: List[int] + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def constructFromPrePost(self, preorder: List[int], postorder: List[int]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* constructFromPrePost(int* preorder, int preorderSize, int* postorder, int postorderSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode ConstructFromPrePost(int[] preorder, int[] postorder) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {number[]} preorder + * @param {number[]} postorder + * @return {TreeNode} + */ +var constructFromPrePost = function(preorder, postorder) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {Integer[]} preorder +# @param {Integer[]} postorder +# @return {TreeNode} +def construct_from_pre_post(preorder, postorder) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func constructFromPrePost(_ preorder: [Int], _ postorder: [Int]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func constructFromPrePost(preorder []int, postorder []int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def constructFromPrePost(preorder: Array[Int], postorder: Array[Int]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun constructFromPrePost(preorder: IntArray, postorder: IntArray): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn construct_from_pre_post(preorder: Vec, postorder: Vec) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param Integer[] $preorder + * @param Integer[] $postorder + * @return TreeNode + */ + function constructFromPrePost($preorder, $postorder) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function constructFromPrePost(preorder: number[], postorder: number[]): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (construct-from-pre-post preorder postorder) + (-> (listof exact-integer?) (listof exact-integer?) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec construct_from_pre_post(Preorder :: [integer()], Postorder :: [integer()]) -> #tree_node{} | null. +construct_from_pre_post(Preorder, Postorder) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec construct_from_pre_post(preorder :: [integer], postorder :: [integer]) :: TreeNode.t | nil + def construct_from_pre_post(preorder, postorder) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? constructFromPrePost(List preorder, List postorder) { + + } +}", +1436,fair-candy-swap,Fair Candy Swap,888.0,924.0,"

Alice and Bob have a different total number of candies. You are given two integer arrays aliceSizes and bobSizes where aliceSizes[i] is the number of candies of the ith box of candy that Alice has and bobSizes[j] is the number of candies of the jth box of candy that Bob has.

+ +

Since they are friends, they would like to exchange one candy box each so that after the exchange, they both have the same total amount of candy. The total amount of candy a person has is the sum of the number of candies in each box they have.

+ +

Return an integer array answer where answer[0] is the number of candies in the box that Alice must exchange, and answer[1] is the number of candies in the box that Bob must exchange. If there are multiple answers, you may return any one of them. It is guaranteed that at least one answer exists.

+ +

 

+

Example 1:

+ +
+Input: aliceSizes = [1,1], bobSizes = [2,2]
+Output: [1,2]
+
+ +

Example 2:

+ +
+Input: aliceSizes = [1,2], bobSizes = [2,3]
+Output: [1,2]
+
+ +

Example 3:

+ +
+Input: aliceSizes = [2], bobSizes = [1,3]
+Output: [2,3]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= aliceSizes.length, bobSizes.length <= 104
    • +
  • 1 <= aliceSizes[i], bobSizes[j] <= 105
    • +
  • Alice and Bob have a different total number of candies.
    • +
  • There will be at least one valid answer for the given input.
    • +
+",1.0,False,"class Solution { +public: + vector fairCandySwap(vector& aliceSizes, vector& bobSizes) { + + } +};","class Solution { + public int[] fairCandySwap(int[] aliceSizes, int[] bobSizes) { + + } +}","class Solution(object): + def fairCandySwap(self, aliceSizes, bobSizes): + """""" + :type aliceSizes: List[int] + :type bobSizes: List[int] + :rtype: List[int] + """""" + ","class Solution: + def fairCandySwap(self, aliceSizes: List[int], bobSizes: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* fairCandySwap(int* aliceSizes, int aliceSizesSize, int* bobSizes, int bobSizesSize, int* returnSize){ + +}","public class Solution { + public int[] FairCandySwap(int[] aliceSizes, int[] bobSizes) { + + } +}","/** + * @param {number[]} aliceSizes + * @param {number[]} bobSizes + * @return {number[]} + */ +var fairCandySwap = function(aliceSizes, bobSizes) { + +};","# @param {Integer[]} alice_sizes +# @param {Integer[]} bob_sizes +# @return {Integer[]} +def fair_candy_swap(alice_sizes, bob_sizes) + +end","class Solution { + func fairCandySwap(_ aliceSizes: [Int], _ bobSizes: [Int]) -> [Int] { + + } +}","func fairCandySwap(aliceSizes []int, bobSizes []int) []int { + +}","object Solution { + def fairCandySwap(aliceSizes: Array[Int], bobSizes: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun fairCandySwap(aliceSizes: IntArray, bobSizes: IntArray): IntArray { + + } +}","impl Solution { + pub fn fair_candy_swap(alice_sizes: Vec, bob_sizes: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $aliceSizes + * @param Integer[] $bobSizes + * @return Integer[] + */ + function fairCandySwap($aliceSizes, $bobSizes) { + + } +}","function fairCandySwap(aliceSizes: number[], bobSizes: number[]): number[] { + +};","(define/contract (fair-candy-swap aliceSizes bobSizes) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec fair_candy_swap(AliceSizes :: [integer()], BobSizes :: [integer()]) -> [integer()]. +fair_candy_swap(AliceSizes, BobSizes) -> + .","defmodule Solution do + @spec fair_candy_swap(alice_sizes :: [integer], bob_sizes :: [integer]) :: [integer] + def fair_candy_swap(alice_sizes, bob_sizes) do + + end +end","class Solution { + List fairCandySwap(List aliceSizes, List bobSizes) { + + } +}", +1437,super-egg-drop,Super Egg Drop,887.0,923.0,"

You are given k identical eggs and you have access to a building with n floors labeled from 1 to n.

+ +

You know that there exists a floor f where 0 <= f <= n such that any egg dropped at a floor higher than f will break, and any egg dropped at or below floor f will not break.

+ +

Each move, you may take an unbroken egg and drop it from any floor x (where 1 <= x <= n). If the egg breaks, you can no longer use it. However, if the egg does not break, you may reuse it in future moves.

+ +

Return the minimum number of moves that you need to determine with certainty what the value of f is.

+ +

 

+

Example 1:

+ +
+Input: k = 1, n = 2
+Output: 2
+Explanation: 
+Drop the egg from floor 1. If it breaks, we know that f = 0.
+Otherwise, drop the egg from floor 2. If it breaks, we know that f = 1.
+If it does not break, then we know f = 2.
+Hence, we need at minimum 2 moves to determine with certainty what the value of f is.
+
+ +

Example 2:

+ +
+Input: k = 2, n = 6
+Output: 3
+
+ +

Example 3:

+ +
+Input: k = 3, n = 14
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 100
    • +
  • 1 <= n <= 104
    • +
+",3.0,False,"class Solution { +public: + int superEggDrop(int k, int n) { + + } +};","class Solution { + public int superEggDrop(int k, int n) { + + } +}","class Solution(object): + def superEggDrop(self, k, n): + """""" + :type k: int + :type n: int + :rtype: int + """""" + ","class Solution: + def superEggDrop(self, k: int, n: int) -> int: + ","int superEggDrop(int k, int n){ + +}","public class Solution { + public int SuperEggDrop(int k, int n) { + + } +}","/** + * @param {number} k + * @param {number} n + * @return {number} + */ +var superEggDrop = function(k, n) { + +};","# @param {Integer} k +# @param {Integer} n +# @return {Integer} +def super_egg_drop(k, n) + +end","class Solution { + func superEggDrop(_ k: Int, _ n: Int) -> Int { + + } +}","func superEggDrop(k int, n int) int { + +}","object Solution { + def superEggDrop(k: Int, n: Int): Int = { + + } +}","class Solution { + fun superEggDrop(k: Int, n: Int): Int { + + } +}","impl Solution { + pub fn super_egg_drop(k: i32, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer $n + * @return Integer + */ + function superEggDrop($k, $n) { + + } +}","function superEggDrop(k: number, n: number): number { + +};","(define/contract (super-egg-drop k n) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec super_egg_drop(K :: integer(), N :: integer()) -> integer(). +super_egg_drop(K, N) -> + .","defmodule Solution do + @spec super_egg_drop(k :: integer, n :: integer) :: integer + def super_egg_drop(k, n) do + + end +end","class Solution { + int superEggDrop(int k, int n) { + + } +}", +1438,possible-bipartition,Possible Bipartition,886.0,922.0,"

We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some other people, and they should not go into the same group.

+ +

Given the integer n and the array dislikes where dislikes[i] = [ai, bi] indicates that the person labeled ai does not like the person labeled bi, return true if it is possible to split everyone into two groups in this way.

+ +

 

+

Example 1:

+ +
+Input: n = 4, dislikes = [[1,2],[1,3],[2,4]]
+Output: true
+Explanation: The first group has [1,4], and the second group has [2,3].
+
+ +

Example 2:

+ +
+Input: n = 3, dislikes = [[1,2],[1,3],[2,3]]
+Output: false
+Explanation: We need at least 3 groups to divide them. We cannot put them in two groups.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 2000
    • +
  • 0 <= dislikes.length <= 104
    • +
  • dislikes[i].length == 2
    • +
  • 1 <= ai < bi <= n
    • +
  • All the pairs of dislikes are unique.
    • +
+",2.0,False,"class Solution { +public: + bool possibleBipartition(int n, vector>& dislikes) { + + } +};","class Solution { + public boolean possibleBipartition(int n, int[][] dislikes) { + + } +}","class Solution(object): + def possibleBipartition(self, n, dislikes): + """""" + :type n: int + :type dislikes: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def possibleBipartition(self, n: int, dislikes: List[List[int]]) -> bool: + ","bool possibleBipartition(int n, int** dislikes, int dislikesSize, int* dislikesColSize){ + +}","public class Solution { + public bool PossibleBipartition(int n, int[][] dislikes) { + + } +}","/** + * @param {number} n + * @param {number[][]} dislikes + * @return {boolean} + */ +var possibleBipartition = function(n, dislikes) { + +};","# @param {Integer} n +# @param {Integer[][]} dislikes +# @return {Boolean} +def possible_bipartition(n, dislikes) + +end","class Solution { + func possibleBipartition(_ n: Int, _ dislikes: [[Int]]) -> Bool { + + } +}","func possibleBipartition(n int, dislikes [][]int) bool { + +}","object Solution { + def possibleBipartition(n: Int, dislikes: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun possibleBipartition(n: Int, dislikes: Array): Boolean { + + } +}","impl Solution { + pub fn possible_bipartition(n: i32, dislikes: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $dislikes + * @return Boolean + */ + function possibleBipartition($n, $dislikes) { + + } +}","function possibleBipartition(n: number, dislikes: number[][]): boolean { + +};","(define/contract (possible-bipartition n dislikes) + (-> exact-integer? (listof (listof exact-integer?)) boolean?) + + )","-spec possible_bipartition(N :: integer(), Dislikes :: [[integer()]]) -> boolean(). +possible_bipartition(N, Dislikes) -> + .","defmodule Solution do + @spec possible_bipartition(n :: integer, dislikes :: [[integer]]) :: boolean + def possible_bipartition(n, dislikes) do + + end +end","class Solution { + bool possibleBipartition(int n, List> dislikes) { + + } +}", +1439,spiral-matrix-iii,Spiral Matrix III,885.0,921.0,"

You start at the cell (rStart, cStart) of an rows x cols grid facing east. The northwest corner is at the first row and column in the grid, and the southeast corner is at the last row and column.

+ +

You will walk in a clockwise spiral shape to visit every position in this grid. Whenever you move outside the grid's boundary, we continue our walk outside the grid (but may return to the grid boundary later.). Eventually, we reach all rows * cols spaces of the grid.

+ +

Return an array of coordinates representing the positions of the grid in the order you visited them.

+ +

 

+

Example 1:

+ +
+Input: rows = 1, cols = 4, rStart = 0, cStart = 0
+Output: [[0,0],[0,1],[0,2],[0,3]]
+
+ +

Example 2:

+ +
+Input: rows = 5, cols = 6, rStart = 1, cStart = 4
+Output: [[1,4],[1,5],[2,5],[2,4],[2,3],[1,3],[0,3],[0,4],[0,5],[3,5],[3,4],[3,3],[3,2],[2,2],[1,2],[0,2],[4,5],[4,4],[4,3],[4,2],[4,1],[3,1],[2,1],[1,1],[0,1],[4,0],[3,0],[2,0],[1,0],[0,0]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rows, cols <= 100
    • +
  • 0 <= rStart < rows
    • +
  • 0 <= cStart < cols
    • +
+",2.0,False,"class Solution { +public: + vector> spiralMatrixIII(int rows, int cols, int rStart, int cStart) { + + } +};","class Solution { + public int[][] spiralMatrixIII(int rows, int cols, int rStart, int cStart) { + + } +}","class Solution(object): + def spiralMatrixIII(self, rows, cols, rStart, cStart): + """""" + :type rows: int + :type cols: int + :type rStart: int + :type cStart: int + :rtype: List[List[int]] + """""" + ","class Solution: + def spiralMatrixIII(self, rows: int, cols: int, rStart: int, cStart: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** spiralMatrixIII(int rows, int cols, int rStart, int cStart, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] SpiralMatrixIII(int rows, int cols, int rStart, int cStart) { + + } +}","/** + * @param {number} rows + * @param {number} cols + * @param {number} rStart + * @param {number} cStart + * @return {number[][]} + */ +var spiralMatrixIII = function(rows, cols, rStart, cStart) { + +};","# @param {Integer} rows +# @param {Integer} cols +# @param {Integer} r_start +# @param {Integer} c_start +# @return {Integer[][]} +def spiral_matrix_iii(rows, cols, r_start, c_start) + +end","class Solution { + func spiralMatrixIII(_ rows: Int, _ cols: Int, _ rStart: Int, _ cStart: Int) -> [[Int]] { + + } +}","func spiralMatrixIII(rows int, cols int, rStart int, cStart int) [][]int { + +}","object Solution { + def spiralMatrixIII(rows: Int, cols: Int, rStart: Int, cStart: Int): Array[Array[Int]] = { + + } +}","class Solution { + fun spiralMatrixIII(rows: Int, cols: Int, rStart: Int, cStart: Int): Array { + + } +}","impl Solution { + pub fn spiral_matrix_iii(rows: i32, cols: i32, r_start: i32, c_start: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $rows + * @param Integer $cols + * @param Integer $rStart + * @param Integer $cStart + * @return Integer[][] + */ + function spiralMatrixIII($rows, $cols, $rStart, $cStart) { + + } +}","function spiralMatrixIII(rows: number, cols: number, rStart: number, cStart: number): number[][] { + +};","(define/contract (spiral-matrix-iii rows cols rStart cStart) + (-> exact-integer? exact-integer? exact-integer? exact-integer? (listof (listof exact-integer?))) + + )","-spec spiral_matrix_iii(Rows :: integer(), Cols :: integer(), RStart :: integer(), CStart :: integer()) -> [[integer()]]. +spiral_matrix_iii(Rows, Cols, RStart, CStart) -> + .","defmodule Solution do + @spec spiral_matrix_iii(rows :: integer, cols :: integer, r_start :: integer, c_start :: integer) :: [[integer]] + def spiral_matrix_iii(rows, cols, r_start, c_start) do + + end +end","class Solution { + List> spiralMatrixIII(int rows, int cols, int rStart, int cStart) { + + } +}", +1442,reachable-nodes-in-subdivided-graph,Reachable Nodes In Subdivided Graph,882.0,918.0,"

You are given an undirected graph (the "original graph") with n nodes labeled from 0 to n - 1. You decide to subdivide each edge in the graph into a chain of nodes, with the number of new nodes varying between each edge.

+ +

The graph is given as a 2D array of edges where edges[i] = [ui, vi, cnti] indicates that there is an edge between nodes ui and vi in the original graph, and cnti is the total number of new nodes that you will subdivide the edge into. Note that cnti == 0 means you will not subdivide the edge.

+ +

To subdivide the edge [ui, vi], replace it with (cnti + 1) new edges and cnti new nodes. The new nodes are x1, x2, ..., xcnti, and the new edges are [ui, x1], [x1, x2], [x2, x3], ..., [xcnti-1, xcnti], [xcnti, vi].

+ +

In this new graph, you want to know how many nodes are reachable from the node 0, where a node is reachable if the distance is maxMoves or less.

+ +

Given the original graph and maxMoves, return the number of nodes that are reachable from node 0 in the new graph.

+ +

 

+

Example 1:

+ +
+Input: edges = [[0,1,10],[0,2,1],[1,2,2]], maxMoves = 6, n = 3
+Output: 13
+Explanation: The edge subdivisions are shown in the image above.
+The nodes that are reachable are highlighted in yellow.
+
+ +

Example 2:

+ +
+Input: edges = [[0,1,4],[1,2,6],[0,2,8],[1,3,1]], maxMoves = 10, n = 4
+Output: 23
+
+ +

Example 3:

+ +
+Input: edges = [[1,2,4],[1,4,5],[1,3,1],[2,3,4],[3,4,5]], maxMoves = 17, n = 5
+Output: 1
+Explanation: Node 0 is disconnected from the rest of the graph, so only node 0 is reachable.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= edges.length <= min(n * (n - 1) / 2, 104)
    • +
  • edges[i].length == 3
    • +
  • 0 <= ui < vi < n
    • +
  • There are no multiple edges in the graph.
    • +
  • 0 <= cnti <= 104
    • +
  • 0 <= maxMoves <= 109
    • +
  • 1 <= n <= 3000
    • +
+",3.0,False,"class Solution { +public: + int reachableNodes(vector>& edges, int maxMoves, int n) { + + } +};","class Solution { + public int reachableNodes(int[][] edges, int maxMoves, int n) { + + } +}","class Solution(object): + def reachableNodes(self, edges, maxMoves, n): + """""" + :type edges: List[List[int]] + :type maxMoves: int + :type n: int + :rtype: int + """""" + ","class Solution: + def reachableNodes(self, edges: List[List[int]], maxMoves: int, n: int) -> int: + ","int reachableNodes(int** edges, int edgesSize, int* edgesColSize, int maxMoves, int n){ + +}","public class Solution { + public int ReachableNodes(int[][] edges, int maxMoves, int n) { + + } +}","/** + * @param {number[][]} edges + * @param {number} maxMoves + * @param {number} n + * @return {number} + */ +var reachableNodes = function(edges, maxMoves, n) { + +};","# @param {Integer[][]} edges +# @param {Integer} max_moves +# @param {Integer} n +# @return {Integer} +def reachable_nodes(edges, max_moves, n) + +end","class Solution { + func reachableNodes(_ edges: [[Int]], _ maxMoves: Int, _ n: Int) -> Int { + + } +}","func reachableNodes(edges [][]int, maxMoves int, n int) int { + +}","object Solution { + def reachableNodes(edges: Array[Array[Int]], maxMoves: Int, n: Int): Int = { + + } +}","class Solution { + fun reachableNodes(edges: Array, maxMoves: Int, n: Int): Int { + + } +}","impl Solution { + pub fn reachable_nodes(edges: Vec>, max_moves: i32, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $edges + * @param Integer $maxMoves + * @param Integer $n + * @return Integer + */ + function reachableNodes($edges, $maxMoves, $n) { + + } +}","function reachableNodes(edges: number[][], maxMoves: number, n: number): number { + +};","(define/contract (reachable-nodes edges maxMoves n) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec reachable_nodes(Edges :: [[integer()]], MaxMoves :: integer(), N :: integer()) -> integer(). +reachable_nodes(Edges, MaxMoves, N) -> + .","defmodule Solution do + @spec reachable_nodes(edges :: [[integer]], max_moves :: integer, n :: integer) :: integer + def reachable_nodes(edges, max_moves, n) do + + end +end","class Solution { + int reachableNodes(List> edges, int maxMoves, int n) { + + } +}", +1443,boats-to-save-people,Boats to Save People,881.0,917.0,"

You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most two people at the same time, provided the sum of the weight of those people is at most limit.

+ +

Return the minimum number of boats to carry every given person.

+ +

 

+

Example 1:

+ +
+Input: people = [1,2], limit = 3
+Output: 1
+Explanation: 1 boat (1, 2)
+
+ +

Example 2:

+ +
+Input: people = [3,2,2,1], limit = 3
+Output: 3
+Explanation: 3 boats (1, 2), (2) and (3)
+
+ +

Example 3:

+ +
+Input: people = [3,5,3,4], limit = 5
+Output: 4
+Explanation: 4 boats (3), (3), (4), (5)
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= people.length <= 5 * 104
    • +
  • 1 <= people[i] <= limit <= 3 * 104
    • +
+",2.0,False,"class Solution { +public: + int numRescueBoats(vector& people, int limit) { + + } +};","class Solution { + public int numRescueBoats(int[] people, int limit) { + + } +}","class Solution(object): + def numRescueBoats(self, people, limit): + """""" + :type people: List[int] + :type limit: int + :rtype: int + """""" + ","class Solution: + def numRescueBoats(self, people: List[int], limit: int) -> int: + ","int numRescueBoats(int* people, int peopleSize, int limit){ + +}","public class Solution { + public int NumRescueBoats(int[] people, int limit) { + + } +}","/** + * @param {number[]} people + * @param {number} limit + * @return {number} + */ +var numRescueBoats = function(people, limit) { + +};","# @param {Integer[]} people +# @param {Integer} limit +# @return {Integer} +def num_rescue_boats(people, limit) + +end","class Solution { + func numRescueBoats(_ people: [Int], _ limit: Int) -> Int { + + } +}","func numRescueBoats(people []int, limit int) int { + +}","object Solution { + def numRescueBoats(people: Array[Int], limit: Int): Int = { + + } +}","class Solution { + fun numRescueBoats(people: IntArray, limit: Int): Int { + + } +}","impl Solution { + pub fn num_rescue_boats(people: Vec, limit: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $people + * @param Integer $limit + * @return Integer + */ + function numRescueBoats($people, $limit) { + + } +}","function numRescueBoats(people: number[], limit: number): number { + +};","(define/contract (num-rescue-boats people limit) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec num_rescue_boats(People :: [integer()], Limit :: integer()) -> integer(). +num_rescue_boats(People, Limit) -> + .","defmodule Solution do + @spec num_rescue_boats(people :: [integer], limit :: integer) :: integer + def num_rescue_boats(people, limit) do + + end +end","class Solution { + int numRescueBoats(List people, int limit) { + + } +}", +1444,decoded-string-at-index,Decoded String at Index,880.0,916.0,"

You are given an encoded string s. To decode the string to a tape, the encoded string is read one character at a time and the following steps are taken:

+ +
    +
  • If the character read is a letter, that letter is written onto the tape.
    • +
  • If the character read is a digit d, the entire current tape is repeatedly written d - 1 more times in total.
    • +
+ +

Given an integer k, return the kth letter (1-indexed) in the decoded string.

+ +

 

+

Example 1:

+ +
+Input: s = "leet2code3", k = 10
+Output: "o"
+Explanation: The decoded string is "leetleetcodeleetleetcodeleetleetcode".
+The 10th letter in the string is "o".
+
+ +

Example 2:

+ +
+Input: s = "ha22", k = 5
+Output: "h"
+Explanation: The decoded string is "hahahaha".
+The 5th letter is "h".
+
+ +

Example 3:

+ +
+Input: s = "a2345678999999999999999", k = 1
+Output: "a"
+Explanation: The decoded string is "a" repeated 8301530446056247680 times.
+The 1st letter is "a".
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 100
    • +
  • s consists of lowercase English letters and digits 2 through 9.
    • +
  • s starts with a letter.
    • +
  • 1 <= k <= 109
    • +
  • It is guaranteed that k is less than or equal to the length of the decoded string.
    • +
  • The decoded string is guaranteed to have less than 263 letters.
    • +
+",2.0,False,"class Solution { +public: + string decodeAtIndex(string s, int k) { + + } +};","class Solution { + public String decodeAtIndex(String s, int k) { + + } +}","class Solution(object): + def decodeAtIndex(self, s, k): + """""" + :type s: str + :type k: int + :rtype: str + """""" + ","class Solution: + def decodeAtIndex(self, s: str, k: int) -> str: + ","char * decodeAtIndex(char * s, int k){ + +}","public class Solution { + public string DecodeAtIndex(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {string} + */ +var decodeAtIndex = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {String} +def decode_at_index(s, k) + +end","class Solution { + func decodeAtIndex(_ s: String, _ k: Int) -> String { + + } +}","func decodeAtIndex(s string, k int) string { + +}","object Solution { + def decodeAtIndex(s: String, k: Int): String = { + + } +}","class Solution { + fun decodeAtIndex(s: String, k: Int): String { + + } +}","impl Solution { + pub fn decode_at_index(s: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return String + */ + function decodeAtIndex($s, $k) { + + } +}","function decodeAtIndex(s: string, k: number): string { + +};","(define/contract (decode-at-index s k) + (-> string? exact-integer? string?) + + )","-spec decode_at_index(S :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +decode_at_index(S, K) -> + .","defmodule Solution do + @spec decode_at_index(s :: String.t, k :: integer) :: String.t + def decode_at_index(s, k) do + + end +end","class Solution { + String decodeAtIndex(String s, int k) { + + } +}", +1445,generate-random-point-in-a-circle,Generate Random Point in a Circle,478.0,915.0,"

Given the radius and the position of the center of a circle, implement the function randPoint which generates a uniform random point inside the circle.

+ +

Implement the Solution class:

+ +
    +
  • Solution(double radius, double x_center, double y_center) initializes the object with the radius of the circle radius and the position of the center (x_center, y_center).
    • +
  • randPoint() returns a random point inside the circle. A point on the circumference of the circle is considered to be in the circle. The answer is returned as an array [x, y].
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution", "randPoint", "randPoint", "randPoint"]
+[[1.0, 0.0, 0.0], [], [], []]
+Output
+[null, [-0.02493, -0.38077], [0.82314, 0.38945], [0.36572, 0.17248]]
+
+Explanation
+Solution solution = new Solution(1.0, 0.0, 0.0);
+solution.randPoint(); // return [-0.02493, -0.38077]
+solution.randPoint(); // return [0.82314, 0.38945]
+solution.randPoint(); // return [0.36572, 0.17248]
+
+ +

 

+

Constraints:

+ +
    +
  • 0 < radius <= 108
    • +
  • -107 <= x_center, y_center <= 107
    • +
  • At most 3 * 104 calls will be made to randPoint.
    • +
+",2.0,False,"class Solution { +public: + Solution(double radius, double x_center, double y_center) { + + } + + vector randPoint() { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(radius, x_center, y_center); + * vector param_1 = obj->randPoint(); + */","class Solution { + + public Solution(double radius, double x_center, double y_center) { + + } + + public double[] randPoint() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(radius, x_center, y_center); + * double[] param_1 = obj.randPoint(); + */","class Solution(object): + + def __init__(self, radius, x_center, y_center): + """""" + :type radius: float + :type x_center: float + :type y_center: float + """""" + + + def randPoint(self): + """""" + :rtype: List[float] + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(radius, x_center, y_center) +# param_1 = obj.randPoint()","class Solution: + + def __init__(self, radius: float, x_center: float, y_center: float): + + + def randPoint(self) -> List[float]: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(radius, x_center, y_center) +# param_1 = obj.randPoint()"," + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(double radius, double x_center, double y_center) { + +} + +double* solutionRandPoint(Solution* obj, int* retSize) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(radius, x_center, y_center); + * double* param_1 = solutionRandPoint(obj, retSize); + + * solutionFree(obj); +*/","public class Solution { + + public Solution(double radius, double x_center, double y_center) { + + } + + public double[] RandPoint() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(radius, x_center, y_center); + * double[] param_1 = obj.RandPoint(); + */","/** + * @param {number} radius + * @param {number} x_center + * @param {number} y_center + */ +var Solution = function(radius, x_center, y_center) { + +}; + +/** + * @return {number[]} + */ +Solution.prototype.randPoint = function() { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(radius, x_center, y_center) + * var param_1 = obj.randPoint() + */","class Solution + +=begin + :type radius: Float + :type x_center: Float + :type y_center: Float +=end + def initialize(radius, x_center, y_center) + + end + + +=begin + :rtype: Float[] +=end + def rand_point() + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(radius, x_center, y_center) +# param_1 = obj.rand_point()"," +class Solution { + + init(_ radius: Double, _ x_center: Double, _ y_center: Double) { + + } + + func randPoint() -> [Double] { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(radius, x_center, y_center) + * let ret_1: [Double] = obj.randPoint() + */","type Solution struct { + +} + + +func Constructor(radius float64, x_center float64, y_center float64) Solution { + +} + + +func (this *Solution) RandPoint() []float64 { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(radius, x_center, y_center); + * param_1 := obj.RandPoint(); + */","class Solution(_radius: Double, _x_center: Double, _y_center: Double) { + + def randPoint(): Array[Double] = { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(radius, x_center, y_center) + * var param_1 = obj.randPoint() + */","class Solution(radius: Double, x_center: Double, y_center: Double) { + + fun randPoint(): DoubleArray { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(radius, x_center, y_center) + * var param_1 = obj.randPoint() + */","struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(radius: f64, x_center: f64, y_center: f64) -> Self { + + } + + fn rand_point(&self) -> Vec { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(radius, x_center, y_center); + * let ret_1: Vec = obj.rand_point(); + */","class Solution { + /** + * @param Float $radius + * @param Float $x_center + * @param Float $y_center + */ + function __construct($radius, $x_center, $y_center) { + + } + + /** + * @return Float[] + */ + function randPoint() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($radius, $x_center, $y_center); + * $ret_1 = $obj->randPoint(); + */","class Solution { + constructor(radius: number, x_center: number, y_center: number) { + + } + + randPoint(): number[] { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(radius, x_center, y_center) + * var param_1 = obj.randPoint() + */","(define solution% + (class object% + (super-new) + + ; radius : flonum? + + ; x_center : flonum? + + ; y_center : flonum? + (init-field + radius + x_center + y_center) + + ; rand-point : -> (listof flonum?) + (define/public (rand-point) + + ))) + +;; Your solution% object will be instantiated and called as such: +;; (define obj (new solution% [radius radius] [x_center x_center] [y_center y_center])) +;; (define param_1 (send obj rand-point))","-spec solution_init_(Radius :: float(), X_center :: float(), Y_center :: float()) -> any(). +solution_init_(Radius, X_center, Y_center) -> + . + +-spec solution_rand_point() -> [float()]. +solution_rand_point() -> + . + + +%% Your functions will be called as such: +%% solution_init_(Radius, X_center, Y_center), +%% Param_1 = solution_rand_point(), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Solution do + @spec init_(radius :: float, x_center :: float, y_center :: float) :: any + def init_(radius, x_center, y_center) do + + end + + @spec rand_point() :: [float] + def rand_point() do + + end +end + +# Your functions will be called as such: +# Solution.init_(radius, x_center, y_center) +# param_1 = Solution.rand_point() + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","class Solution { + + Solution(double radius, double x_center, double y_center) { + + } + + List randPoint() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(radius, x_center, y_center); + * List param1 = obj.randPoint(); + */", +1447,random-flip-matrix,Random Flip Matrix,519.0,913.0,"

There is an m x n binary grid matrix with all the values set 0 initially. Design an algorithm to randomly pick an index (i, j) where matrix[i][j] == 0 and flips it to 1. All the indices (i, j) where matrix[i][j] == 0 should be equally likely to be returned.

+ +

Optimize your algorithm to minimize the number of calls made to the built-in random function of your language and optimize the time and space complexity.

+ +

Implement the Solution class:

+ +
    +
  • Solution(int m, int n) Initializes the object with the size of the binary matrix m and n.
    • +
  • int[] flip() Returns a random index [i, j] of the matrix where matrix[i][j] == 0 and flips it to 1.
    • +
  • void reset() Resets all the values of the matrix to be 0.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution", "flip", "flip", "flip", "reset", "flip"]
+[[3, 1], [], [], [], [], []]
+Output
+[null, [1, 0], [2, 0], [0, 0], null, [2, 0]]
+
+Explanation
+Solution solution = new Solution(3, 1);
+solution.flip();  // return [1, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+solution.flip();  // return [2, 0], Since [1,0] was returned, [2,0] and [0,0]
+solution.flip();  // return [0, 0], Based on the previously returned indices, only [0,0] can be returned.
+solution.reset(); // All the values are reset to 0 and can be returned.
+solution.flip();  // return [2, 0], [0,0], [1,0], and [2,0] should be equally likely to be returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 104
    • +
  • There will be at least one free cell for each call to flip.
    • +
  • At most 1000 calls will be made to flip and reset.
    • +
+",2.0,False,"class Solution { +public: + Solution(int m, int n) { + + } + + vector flip() { + + } + + void reset() { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(m, n); + * vector param_1 = obj->flip(); + * obj->reset(); + */","class Solution { + + public Solution(int m, int n) { + + } + + public int[] flip() { + + } + + public void reset() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(m, n); + * int[] param_1 = obj.flip(); + * obj.reset(); + */","class Solution(object): + + def __init__(self, m, n): + """""" + :type m: int + :type n: int + """""" + + + def flip(self): + """""" + :rtype: List[int] + """""" + + + def reset(self): + """""" + :rtype: None + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(m, n) +# param_1 = obj.flip() +# obj.reset()","class Solution: + + def __init__(self, m: int, n: int): + + + def flip(self) -> List[int]: + + + def reset(self) -> None: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(m, n) +# param_1 = obj.flip() +# obj.reset()"," + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(int m, int n) { + +} + +int* solutionFlip(Solution* obj, int* retSize) { + +} + +void solutionReset(Solution* obj) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(m, n); + * int* param_1 = solutionFlip(obj, retSize); + + * solutionReset(obj); + + * solutionFree(obj); +*/","public class Solution { + + public Solution(int m, int n) { + + } + + public int[] Flip() { + + } + + public void Reset() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(m, n); + * int[] param_1 = obj.Flip(); + * obj.Reset(); + */","/** + * @param {number} m + * @param {number} n + */ +var Solution = function(m, n) { + +}; + +/** + * @return {number[]} + */ +Solution.prototype.flip = function() { + +}; + +/** + * @return {void} + */ +Solution.prototype.reset = function() { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(m, n) + * var param_1 = obj.flip() + * obj.reset() + */","class Solution + +=begin + :type m: Integer + :type n: Integer +=end + def initialize(m, n) + + end + + +=begin + :rtype: Integer[] +=end + def flip() + + end + + +=begin + :rtype: Void +=end + def reset() + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(m, n) +# param_1 = obj.flip() +# obj.reset()"," +class Solution { + + init(_ m: Int, _ n: Int) { + + } + + func flip() -> [Int] { + + } + + func reset() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(m, n) + * let ret_1: [Int] = obj.flip() + * obj.reset() + */","type Solution struct { + +} + + +func Constructor(m int, n int) Solution { + +} + + +func (this *Solution) Flip() []int { + +} + + +func (this *Solution) Reset() { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(m, n); + * param_1 := obj.Flip(); + * obj.Reset(); + */","class Solution(_m: Int, _n: Int) { + + def flip(): Array[Int] = { + + } + + def reset() { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(m, n) + * var param_1 = obj.flip() + * obj.reset() + */","class Solution(m: Int, n: Int) { + + fun flip(): IntArray { + + } + + fun reset() { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(m, n) + * var param_1 = obj.flip() + * obj.reset() + */","struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(m: i32, n: i32) -> Self { + + } + + fn flip(&self) -> Vec { + + } + + fn reset(&self) { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(m, n); + * let ret_1: Vec = obj.flip(); + * obj.reset(); + */","class Solution { + /** + * @param Integer $m + * @param Integer $n + */ + function __construct($m, $n) { + + } + + /** + * @return Integer[] + */ + function flip() { + + } + + /** + * @return NULL + */ + function reset() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($m, $n); + * $ret_1 = $obj->flip(); + * $obj->reset(); + */","class Solution { + constructor(m: number, n: number) { + + } + + flip(): number[] { + + } + + reset(): void { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(m, n) + * var param_1 = obj.flip() + * obj.reset() + */","(define solution% + (class object% + (super-new) + + ; m : exact-integer? + + ; n : exact-integer? + (init-field + m + n) + + ; flip : -> (listof exact-integer?) + (define/public (flip) + + ) + ; reset : -> void? + (define/public (reset) + + ))) + +;; Your solution% object will be instantiated and called as such: +;; (define obj (new solution% [m m] [n n])) +;; (define param_1 (send obj flip)) +;; (send obj reset)","-spec solution_init_(M :: integer(), N :: integer()) -> any(). +solution_init_(M, N) -> + . + +-spec solution_flip() -> [integer()]. +solution_flip() -> + . + +-spec solution_reset() -> any(). +solution_reset() -> + . + + +%% Your functions will be called as such: +%% solution_init_(M, N), +%% Param_1 = solution_flip(), +%% solution_reset(), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Solution do + @spec init_(m :: integer, n :: integer) :: any + def init_(m, n) do + + end + + @spec flip() :: [integer] + def flip() do + + end + + @spec reset() :: any + def reset() do + + end +end + +# Your functions will be called as such: +# Solution.init_(m, n) +# param_1 = Solution.flip() +# Solution.reset() + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","class Solution { + + Solution(int m, int n) { + + } + + List flip() { + + } + + void reset() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(m, n); + * List param1 = obj.flip(); + * obj.reset(); + */", +1448,random-pick-with-weight,Random Pick with Weight,528.0,912.0,"

You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index.

+ +

You need to implement the function pickIndex(), which randomly picks an index in the range [0, w.length - 1] (inclusive) and returns it. The probability of picking an index i is w[i] / sum(w).

+ +
    +
  • For example, if w = [1, 3], the probability of picking index 0 is 1 / (1 + 3) = 0.25 (i.e., 25%), and the probability of picking index 1 is 3 / (1 + 3) = 0.75 (i.e., 75%).
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution","pickIndex"]
+[[[1]],[]]
+Output
+[null,0]
+
+Explanation
+Solution solution = new Solution([1]);
+solution.pickIndex(); // return 0. The only option is to return 0 since there is only one element in w.
+
+ +

Example 2:

+ +
+Input
+["Solution","pickIndex","pickIndex","pickIndex","pickIndex","pickIndex"]
+[[[1,3]],[],[],[],[],[]]
+Output
+[null,1,1,1,1,0]
+
+Explanation
+Solution solution = new Solution([1, 3]);
+solution.pickIndex(); // return 1. It is returning the second element (index = 1) that has a probability of 3/4.
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 0. It is returning the first element (index = 0) that has a probability of 1/4.
+
+Since this is a randomization problem, multiple answers are allowed.
+All of the following outputs can be considered correct:
+[null,1,1,1,1,0]
+[null,1,1,1,1,1]
+[null,1,1,1,0,0]
+[null,1,1,1,0,1]
+[null,1,0,1,0,0]
+......
+and so on.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= w.length <= 104
    • +
  • 1 <= w[i] <= 105
    • +
  • pickIndex will be called at most 104 times.
    • +
+",2.0,False,"class Solution { +public: + Solution(vector& w) { + + } + + int pickIndex() { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(w); + * int param_1 = obj->pickIndex(); + */","class Solution { + + public Solution(int[] w) { + + } + + public int pickIndex() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(w); + * int param_1 = obj.pickIndex(); + */","class Solution(object): + + def __init__(self, w): + """""" + :type w: List[int] + """""" + + + def pickIndex(self): + """""" + :rtype: int + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(w) +# param_1 = obj.pickIndex()","class Solution: + + def __init__(self, w: List[int]): + + + def pickIndex(self) -> int: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(w) +# param_1 = obj.pickIndex()"," + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(int* w, int wSize) { + +} + +int solutionPickIndex(Solution* obj) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(w, wSize); + * int param_1 = solutionPickIndex(obj); + + * solutionFree(obj); +*/","public class Solution { + + public Solution(int[] w) { + + } + + public int PickIndex() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(w); + * int param_1 = obj.PickIndex(); + */","/** + * @param {number[]} w + */ +var Solution = function(w) { + +}; + +/** + * @return {number} + */ +Solution.prototype.pickIndex = function() { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(w) + * var param_1 = obj.pickIndex() + */","class Solution + +=begin + :type w: Integer[] +=end + def initialize(w) + + end + + +=begin + :rtype: Integer +=end + def pick_index() + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(w) +# param_1 = obj.pick_index()"," +class Solution { + + init(_ w: [Int]) { + + } + + func pickIndex() -> Int { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(w) + * let ret_1: Int = obj.pickIndex() + */","type Solution struct { + +} + + +func Constructor(w []int) Solution { + +} + + +func (this *Solution) PickIndex() int { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(w); + * param_1 := obj.PickIndex(); + */","class Solution(_w: Array[Int]) { + + def pickIndex(): Int = { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(w) + * var param_1 = obj.pickIndex() + */","class Solution(w: IntArray) { + + fun pickIndex(): Int { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(w) + * var param_1 = obj.pickIndex() + */","struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(w: Vec) -> Self { + + } + + fn pick_index(&self) -> i32 { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(w); + * let ret_1: i32 = obj.pick_index(); + */","class Solution { + /** + * @param Integer[] $w + */ + function __construct($w) { + + } + + /** + * @return Integer + */ + function pickIndex() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($w); + * $ret_1 = $obj->pickIndex(); + */","class Solution { + constructor(w: number[]) { + + } + + pickIndex(): number { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(w) + * var param_1 = obj.pickIndex() + */",,"-spec solution_init_(W :: [integer()]) -> any(). +solution_init_(W) -> + . + +-spec solution_pick_index() -> integer(). +solution_pick_index() -> + . + + +%% Your functions will be called as such: +%% solution_init_(W), +%% Param_1 = solution_pick_index(), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Solution do + @spec init_(w :: [integer]) :: any + def init_(w) do + + end + + @spec pick_index() :: integer + def pick_index() do + + end +end + +# Your functions will be called as such: +# Solution.init_(w) +# param_1 = Solution.pick_index() + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","class Solution { + + Solution(List w) { + + } + + int pickIndex() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(w); + * int param1 = obj.pickIndex(); + */", +1449,profitable-schemes,Profitable Schemes,879.0,911.0,"

There is a group of n members, and a list of various crimes they could commit. The ith crime generates a profit[i] and requires group[i] members to participate in it. If a member participates in one crime, that member can't participate in another crime.

+ +

Let's call a profitable scheme any subset of these crimes that generates at least minProfit profit, and the total number of members participating in that subset of crimes is at most n.

+ +

Return the number of schemes that can be chosen. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 5, minProfit = 3, group = [2,2], profit = [2,3]
+Output: 2
+Explanation: To make a profit of at least 3, the group could either commit crimes 0 and 1, or just crime 1.
+In total, there are 2 schemes.
+ +

Example 2:

+ +
+Input: n = 10, minProfit = 5, group = [2,3,5], profit = [6,7,8]
+Output: 7
+Explanation: To make a profit of at least 5, the group could commit any crimes, as long as they commit one.
+There are 7 possible schemes: (0), (1), (2), (0,1), (0,2), (1,2), and (0,1,2).
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 0 <= minProfit <= 100
    • +
  • 1 <= group.length <= 100
    • +
  • 1 <= group[i] <= 100
    • +
  • profit.length == group.length
    • +
  • 0 <= profit[i] <= 100
    • +
+",3.0,False,"class Solution { +public: + int profitableSchemes(int n, int minProfit, vector& group, vector& profit) { + + } +};","class Solution { + public int profitableSchemes(int n, int minProfit, int[] group, int[] profit) { + + } +}","class Solution(object): + def profitableSchemes(self, n, minProfit, group, profit): + """""" + :type n: int + :type minProfit: int + :type group: List[int] + :type profit: List[int] + :rtype: int + """""" + ","class Solution: + def profitableSchemes(self, n: int, minProfit: int, group: List[int], profit: List[int]) -> int: + ","int profitableSchemes(int n, int minProfit, int* group, int groupSize, int* profit, int profitSize){ + +}","public class Solution { + public int ProfitableSchemes(int n, int minProfit, int[] group, int[] profit) { + + } +}","/** + * @param {number} n + * @param {number} minProfit + * @param {number[]} group + * @param {number[]} profit + * @return {number} + */ +var profitableSchemes = function(n, minProfit, group, profit) { + +};","# @param {Integer} n +# @param {Integer} min_profit +# @param {Integer[]} group +# @param {Integer[]} profit +# @return {Integer} +def profitable_schemes(n, min_profit, group, profit) + +end","class Solution { + func profitableSchemes(_ n: Int, _ minProfit: Int, _ group: [Int], _ profit: [Int]) -> Int { + + } +}","func profitableSchemes(n int, minProfit int, group []int, profit []int) int { + +}","object Solution { + def profitableSchemes(n: Int, minProfit: Int, group: Array[Int], profit: Array[Int]): Int = { + + } +}","class Solution { + fun profitableSchemes(n: Int, minProfit: Int, group: IntArray, profit: IntArray): Int { + + } +}","impl Solution { + pub fn profitable_schemes(n: i32, min_profit: i32, group: Vec, profit: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $minProfit + * @param Integer[] $group + * @param Integer[] $profit + * @return Integer + */ + function profitableSchemes($n, $minProfit, $group, $profit) { + + } +}","function profitableSchemes(n: number, minProfit: number, group: number[], profit: number[]): number { + +};","(define/contract (profitable-schemes n minProfit group profit) + (-> exact-integer? exact-integer? (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec profitable_schemes(N :: integer(), MinProfit :: integer(), Group :: [integer()], Profit :: [integer()]) -> integer(). +profitable_schemes(N, MinProfit, Group, Profit) -> + .","defmodule Solution do + @spec profitable_schemes(n :: integer, min_profit :: integer, group :: [integer], profit :: [integer]) :: integer + def profitable_schemes(n, min_profit, group, profit) do + + end +end","class Solution { + int profitableSchemes(int n, int minProfit, List group, List profit) { + + } +}", +1450,nth-magical-number,Nth Magical Number,878.0,910.0,"

A positive integer is magical if it is divisible by either a or b.

+ +

Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 1, a = 2, b = 3
+Output: 2
+
+ +

Example 2:

+ +
+Input: n = 4, a = 2, b = 3
+Output: 6
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
  • 2 <= a, b <= 4 * 104
    • +
+",3.0,False,"class Solution { +public: + int nthMagicalNumber(int n, int a, int b) { + + } +};","class Solution { + public int nthMagicalNumber(int n, int a, int b) { + + } +}","class Solution(object): + def nthMagicalNumber(self, n, a, b): + """""" + :type n: int + :type a: int + :type b: int + :rtype: int + """""" + ","class Solution: + def nthMagicalNumber(self, n: int, a: int, b: int) -> int: + ","int nthMagicalNumber(int n, int a, int b){ + +}","public class Solution { + public int NthMagicalNumber(int n, int a, int b) { + + } +}","/** + * @param {number} n + * @param {number} a + * @param {number} b + * @return {number} + */ +var nthMagicalNumber = function(n, a, b) { + +};","# @param {Integer} n +# @param {Integer} a +# @param {Integer} b +# @return {Integer} +def nth_magical_number(n, a, b) + +end","class Solution { + func nthMagicalNumber(_ n: Int, _ a: Int, _ b: Int) -> Int { + + } +}","func nthMagicalNumber(n int, a int, b int) int { + +}","object Solution { + def nthMagicalNumber(n: Int, a: Int, b: Int): Int = { + + } +}","class Solution { + fun nthMagicalNumber(n: Int, a: Int, b: Int): Int { + + } +}","impl Solution { + pub fn nth_magical_number(n: i32, a: i32, b: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $a + * @param Integer $b + * @return Integer + */ + function nthMagicalNumber($n, $a, $b) { + + } +}","function nthMagicalNumber(n: number, a: number, b: number): number { + +};","(define/contract (nth-magical-number n a b) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec nth_magical_number(N :: integer(), A :: integer(), B :: integer()) -> integer(). +nth_magical_number(N, A, B) -> + .","defmodule Solution do + @spec nth_magical_number(n :: integer, a :: integer, b :: integer) :: integer + def nth_magical_number(n, a, b) do + + end +end","class Solution { + int nthMagicalNumber(int n, int a, int b) { + + } +}", +1454,walking-robot-simulation,Walking Robot Simulation,874.0,906.0,"

A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot can receive a sequence of these three possible types of commands:

+ +
    +
  • -2: Turn left 90 degrees.
    • +
  • -1: Turn right 90 degrees.
    • +
  • 1 <= k <= 9: Move forward k units, one unit at a time.
    • +
+ +

Some of the grid squares are obstacles. The ith obstacle is at grid point obstacles[i] = (xi, yi). If the robot runs into an obstacle, then it will instead stay in its current location and move on to the next command.

+ +

Return the maximum Euclidean distance that the robot ever gets from the origin squared (i.e. if the distance is 5, return 25).

+ +

Note:

+ +
    +
  • North means +Y direction.
    • +
  • East means +X direction.
    • +
  • South means -Y direction.
    • +
  • West means -X direction.
    • +
  • There can be obstacle in [0,0].
    • +
+ +

 

+

Example 1:

+ +
+Input: commands = [4,-1,3], obstacles = []
+Output: 25
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 3 units to (3, 4).
+The furthest point the robot ever gets from the origin is (3, 4), which squared is 32 + 42 = 25 units away.
+
+ +

Example 2:

+ +
+Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]
+Output: 65
+Explanation: The robot starts at (0, 0):
+1. Move north 4 units to (0, 4).
+2. Turn right.
+3. Move east 1 unit and get blocked by the obstacle at (2, 4), robot is at (1, 4).
+4. Turn left.
+5. Move north 4 units to (1, 8).
+The furthest point the robot ever gets from the origin is (1, 8), which squared is 12 + 82 = 65 units away.
+
+ +

Example 3:

+ +
+Input: commands = [6,-1,-1,6], obstacles = []
+Output: 36
+Explanation: The robot starts at (0, 0):
+1. Move north 6 units to (0, 6).
+2. Turn right.
+3. Turn right.
+4. Move south 6 units to (0, 0).
+The furthest point the robot ever gets from the origin is (0, 6), which squared is 62 = 36 units away.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= commands.length <= 104
    • +
  • commands[i] is either -2, -1, or an integer in the range [1, 9].
    • +
  • 0 <= obstacles.length <= 104
    • +
  • -3 * 104 <= xi, yi <= 3 * 104
    • +
  • The answer is guaranteed to be less than 231.
    • +
+",2.0,False,"class Solution { +public: + int robotSim(vector& commands, vector>& obstacles) { + + } +};","class Solution { + public int robotSim(int[] commands, int[][] obstacles) { + + } +}","class Solution(object): + def robotSim(self, commands, obstacles): + """""" + :type commands: List[int] + :type obstacles: List[List[int]] + :rtype: int + """""" + ","class Solution: + def robotSim(self, commands: List[int], obstacles: List[List[int]]) -> int: + ","int robotSim(int* commands, int commandsSize, int** obstacles, int obstaclesSize, int* obstaclesColSize){ + +}","public class Solution { + public int RobotSim(int[] commands, int[][] obstacles) { + + } +}","/** + * @param {number[]} commands + * @param {number[][]} obstacles + * @return {number} + */ +var robotSim = function(commands, obstacles) { + +};","# @param {Integer[]} commands +# @param {Integer[][]} obstacles +# @return {Integer} +def robot_sim(commands, obstacles) + +end","class Solution { + func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { + + } +}","func robotSim(commands []int, obstacles [][]int) int { + +}","object Solution { + def robotSim(commands: Array[Int], obstacles: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun robotSim(commands: IntArray, obstacles: Array): Int { + + } +}","impl Solution { + pub fn robot_sim(commands: Vec, obstacles: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $commands + * @param Integer[][] $obstacles + * @return Integer + */ + function robotSim($commands, $obstacles) { + + } +}","function robotSim(commands: number[], obstacles: number[][]): number { + +};","(define/contract (robot-sim commands obstacles) + (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?) + + )","-spec robot_sim(Commands :: [integer()], Obstacles :: [[integer()]]) -> integer(). +robot_sim(Commands, Obstacles) -> + .","defmodule Solution do + @spec robot_sim(commands :: [integer], obstacles :: [[integer]]) :: integer + def robot_sim(commands, obstacles) do + + end +end","class Solution { + int robotSim(List commands, List> obstacles) { + + } +}", +1458,minimum-number-of-refueling-stops,Minimum Number of Refueling Stops,871.0,902.0,"

A car travels from a starting position to a destination which is target miles east of the starting position.

+ +

There are gas stations along the way. The gas stations are represented as an array stations where stations[i] = [positioni, fueli] indicates that the ith gas station is positioni miles east of the starting position and has fueli liters of gas.

+ +

The car starts with an infinite tank of gas, which initially has startFuel liters of fuel in it. It uses one liter of gas per one mile that it drives. When the car reaches a gas station, it may stop and refuel, transferring all the gas from the station into the car.

+ +

Return the minimum number of refueling stops the car must make in order to reach its destination. If it cannot reach the destination, return -1.

+ +

Note that if the car reaches a gas station with 0 fuel left, the car can still refuel there. If the car reaches the destination with 0 fuel left, it is still considered to have arrived.

+ +

 

+

Example 1:

+ +
+Input: target = 1, startFuel = 1, stations = []
+Output: 0
+Explanation: We can reach the target without refueling.
+
+ +

Example 2:

+ +
+Input: target = 100, startFuel = 1, stations = [[10,100]]
+Output: -1
+Explanation: We can not reach the target (or even the first gas station).
+
+ +

Example 3:

+ +
+Input: target = 100, startFuel = 10, stations = [[10,60],[20,30],[30,30],[60,40]]
+Output: 2
+Explanation: We start with 10 liters of fuel.
+We drive to position 10, expending 10 liters of fuel.  We refuel from 0 liters to 60 liters of gas.
+Then, we drive from position 10 to position 60 (expending 50 liters of fuel),
+and refuel from 10 liters to 50 liters of gas.  We then drive to and reach the target.
+We made 2 refueling stops along the way, so we return 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target, startFuel <= 109
    • +
  • 0 <= stations.length <= 500
    • +
  • 1 <= positioni < positioni+1 < target
    • +
  • 1 <= fueli < 109
    • +
+",3.0,False,"class Solution { +public: + int minRefuelStops(int target, int startFuel, vector>& stations) { + + } +};","class Solution { + public int minRefuelStops(int target, int startFuel, int[][] stations) { + + } +}","class Solution(object): + def minRefuelStops(self, target, startFuel, stations): + """""" + :type target: int + :type startFuel: int + :type stations: List[List[int]] + :rtype: int + """""" + ","class Solution: + def minRefuelStops(self, target: int, startFuel: int, stations: List[List[int]]) -> int: + ","int minRefuelStops(int target, int startFuel, int** stations, int stationsSize, int* stationsColSize){ + +}","public class Solution { + public int MinRefuelStops(int target, int startFuel, int[][] stations) { + + } +}","/** + * @param {number} target + * @param {number} startFuel + * @param {number[][]} stations + * @return {number} + */ +var minRefuelStops = function(target, startFuel, stations) { + +};","# @param {Integer} target +# @param {Integer} start_fuel +# @param {Integer[][]} stations +# @return {Integer} +def min_refuel_stops(target, start_fuel, stations) + +end","class Solution { + func minRefuelStops(_ target: Int, _ startFuel: Int, _ stations: [[Int]]) -> Int { + + } +}","func minRefuelStops(target int, startFuel int, stations [][]int) int { + +}","object Solution { + def minRefuelStops(target: Int, startFuel: Int, stations: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun minRefuelStops(target: Int, startFuel: Int, stations: Array): Int { + + } +}","impl Solution { + pub fn min_refuel_stops(target: i32, start_fuel: i32, stations: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $target + * @param Integer $startFuel + * @param Integer[][] $stations + * @return Integer + */ + function minRefuelStops($target, $startFuel, $stations) { + + } +}","function minRefuelStops(target: number, startFuel: number, stations: number[][]): number { + +};","(define/contract (min-refuel-stops target startFuel stations) + (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?) + + )","-spec min_refuel_stops(Target :: integer(), StartFuel :: integer(), Stations :: [[integer()]]) -> integer(). +min_refuel_stops(Target, StartFuel, Stations) -> + .","defmodule Solution do + @spec min_refuel_stops(target :: integer, start_fuel :: integer, stations :: [[integer]]) :: integer + def min_refuel_stops(target, start_fuel, stations) do + + end +end","class Solution { + int minRefuelStops(int target, int startFuel, List> stations) { + + } +}", +1459,advantage-shuffle,Advantage Shuffle,870.0,901.0,"

You are given two integer arrays nums1 and nums2 both of the same length. The advantage of nums1 with respect to nums2 is the number of indices i for which nums1[i] > nums2[i].

+ +

Return any permutation of nums1 that maximizes its advantage with respect to nums2.

+ +

 

+

Example 1:

+
Input: nums1 = [2,7,11,15], nums2 = [1,10,4,11]
+Output: [2,11,7,15]
+

Example 2:

+
Input: nums1 = [12,24,8,32], nums2 = [13,25,32,11]
+Output: [24,32,8,12]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length <= 105
    • +
  • nums2.length == nums1.length
    • +
  • 0 <= nums1[i], nums2[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + vector advantageCount(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int[] advantageCount(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def advantageCount(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: List[int] + """""" + ","class Solution: + def advantageCount(self, nums1: List[int], nums2: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* advantageCount(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){ + +}","public class Solution { + public int[] AdvantageCount(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[]} + */ +var advantageCount = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer[]} +def advantage_count(nums1, nums2) + +end","class Solution { + func advantageCount(_ nums1: [Int], _ nums2: [Int]) -> [Int] { + + } +}","func advantageCount(nums1 []int, nums2 []int) []int { + +}","object Solution { + def advantageCount(nums1: Array[Int], nums2: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun advantageCount(nums1: IntArray, nums2: IntArray): IntArray { + + } +}","impl Solution { + pub fn advantage_count(nums1: Vec, nums2: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer[] + */ + function advantageCount($nums1, $nums2) { + + } +}","function advantageCount(nums1: number[], nums2: number[]): number[] { + +};","(define/contract (advantage-count nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec advantage_count(Nums1 :: [integer()], Nums2 :: [integer()]) -> [integer()]. +advantage_count(Nums1, Nums2) -> + .","defmodule Solution do + @spec advantage_count(nums1 :: [integer], nums2 :: [integer]) :: [integer] + def advantage_count(nums1, nums2) do + + end +end","class Solution { + List advantageCount(List nums1, List nums2) { + + } +}", +1462,transpose-matrix,Transpose Matrix,867.0,898.0,"

Given a 2D integer array matrix, return the transpose of matrix.

+ +

The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices.

+ +

+ +

 

+

Example 1:

+ +
+Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [[1,4,7],[2,5,8],[3,6,9]]
+
+ +

Example 2:

+ +
+Input: matrix = [[1,2,3],[4,5,6]]
+Output: [[1,4],[2,5],[3,6]]
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 1000
    • +
  • 1 <= m * n <= 105
    • +
  • -109 <= matrix[i][j] <= 109
    • +
+",1.0,False,"class Solution { +public: + vector> transpose(vector>& matrix) { + + } +};","class Solution { + public int[][] transpose(int[][] matrix) { + + } +}","class Solution(object): + def transpose(self, matrix): + """""" + :type matrix: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def transpose(self, matrix: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** transpose(int** matrix, int matrixSize, int* matrixColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] Transpose(int[][] matrix) { + + } +}","/** + * @param {number[][]} matrix + * @return {number[][]} + */ +var transpose = function(matrix) { + +};","# @param {Integer[][]} matrix +# @return {Integer[][]} +def transpose(matrix) + +end","class Solution { + func transpose(_ matrix: [[Int]]) -> [[Int]] { + + } +}","func transpose(matrix [][]int) [][]int { + +}","object Solution { + def transpose(matrix: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun transpose(matrix: Array): Array { + + } +}","impl Solution { + pub fn transpose(matrix: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @return Integer[][] + */ + function transpose($matrix) { + + } +}","function transpose(matrix: number[][]): number[][] { + +};","(define/contract (transpose matrix) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec transpose(Matrix :: [[integer()]]) -> [[integer()]]. +transpose(Matrix) -> + .","defmodule Solution do + @spec transpose(matrix :: [[integer]]) :: [[integer]] + def transpose(matrix) do + + end +end","class Solution { + List> transpose(List> matrix) { + + } +}", +1463,prime-palindrome,Prime Palindrome,866.0,897.0,"

Given an integer n, return the smallest prime palindrome greater than or equal to n.

+ +

An integer is prime if it has exactly two divisors: 1 and itself. Note that 1 is not a prime number.

+ +
    +
  • For example, 2, 3, 5, 7, 11, and 13 are all primes.
    • +
+ +

An integer is a palindrome if it reads the same from left to right as it does from right to left.

+ +
    +
  • For example, 101 and 12321 are palindromes.
    • +
+ +

The test cases are generated so that the answer always exists and is in the range [2, 2 * 108].

+ +

 

+

Example 1:

+
Input: n = 6
+Output: 7
+

Example 2:

+
Input: n = 8
+Output: 11
+

Example 3:

+
Input: n = 13
+Output: 101
+
+

 

+

Constraints:

+ +
    +
  • 1 <= n <= 108
    • +
+",2.0,False,"class Solution { +public: + int primePalindrome(int n) { + + } +};","class Solution { + public int primePalindrome(int n) { + + } +}","class Solution(object): + def primePalindrome(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def primePalindrome(self, n: int) -> int: + ","int primePalindrome(int n){ + +}","public class Solution { + public int PrimePalindrome(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var primePalindrome = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def prime_palindrome(n) + +end","class Solution { + func primePalindrome(_ n: Int) -> Int { + + } +}","func primePalindrome(n int) int { + +}","object Solution { + def primePalindrome(n: Int): Int = { + + } +}","class Solution { + fun primePalindrome(n: Int): Int { + + } +}","impl Solution { + pub fn prime_palindrome(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function primePalindrome($n) { + + } +}","function primePalindrome(n: number): number { + +};","(define/contract (prime-palindrome n) + (-> exact-integer? exact-integer?) + + )","-spec prime_palindrome(N :: integer()) -> integer(). +prime_palindrome(N) -> + .","defmodule Solution do + @spec prime_palindrome(n :: integer) :: integer + def prime_palindrome(n) do + + end +end","class Solution { + int primePalindrome(int n) { + + } +}", +1464,smallest-subtree-with-all-the-deepest-nodes,Smallest Subtree with all the Deepest Nodes,865.0,896.0,"

Given the root of a binary tree, the depth of each node is the shortest distance to the root.

+ +

Return the smallest subtree such that it contains all the deepest nodes in the original tree.

+ +

A node is called the deepest if it has the largest depth possible among any node in the entire tree.

+ +

The subtree of a node is a tree consisting of that node, plus the set of all descendants of that node.

+ +

 

+

Example 1:

+ +
+Input: root = [3,5,1,6,2,0,8,null,null,7,4]
+Output: [2,7,4]
+Explanation: We return the node with value 2, colored in yellow in the diagram.
+The nodes coloured in blue are the deepest nodes of the tree.
+Notice that nodes 5, 3 and 2 contain the deepest nodes in the tree but node 2 is the smallest subtree among them, so we return it.
+
+ +

Example 2:

+ +
+Input: root = [1]
+Output: [1]
+Explanation: The root is the deepest node in the tree.
+
+ +

Example 3:

+ +
+Input: root = [0,1,3,null,2]
+Output: [2]
+Explanation: The deepest node in the tree is 2, the valid subtrees are the subtrees of nodes 2, 1 and 0 but the subtree of node 2 is the smallest.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree will be in the range [1, 500].
    • +
  • 0 <= Node.val <= 500
    • +
  • The values of the nodes in the tree are unique.
    • +
+ +

 

+

Note: This question is the same as 1123: https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/

+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* subtreeWithAllDeepest(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode subtreeWithAllDeepest(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def subtreeWithAllDeepest(self, root): + """""" + :type root: TreeNode + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def subtreeWithAllDeepest(self, root: TreeNode) -> TreeNode: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* subtreeWithAllDeepest(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode SubtreeWithAllDeepest(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {TreeNode} + */ +var subtreeWithAllDeepest = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {TreeNode} +def subtree_with_all_deepest(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func subtreeWithAllDeepest(_ root: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func subtreeWithAllDeepest(root *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def subtreeWithAllDeepest(root: TreeNode): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun subtreeWithAllDeepest(root: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn subtree_with_all_deepest(root: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return TreeNode + */ + function subtreeWithAllDeepest($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function subtreeWithAllDeepest(root: TreeNode | null): TreeNode | null { + +};",,"%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec subtree_with_all_deepest(Root :: #tree_node{} | null) -> #tree_node{} | null. +subtree_with_all_deepest(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec subtree_with_all_deepest(root :: TreeNode.t | nil) :: TreeNode.t | nil + def subtree_with_all_deepest(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? subtreeWithAllDeepest(TreeNode? root) { + + } +}", +1465,shortest-path-to-get-all-keys,Shortest Path to Get All Keys,864.0,895.0,"

You are given an m x n grid grid where:

+ +
    +
  • '.' is an empty cell.
    • +
  • '#' is a wall.
    • +
  • '@' is the starting point.
    • +
  • Lowercase letters represent keys.
    • +
  • Uppercase letters represent locks.
    • +
+ +

You start at the starting point and one move consists of walking one space in one of the four cardinal directions. You cannot walk outside the grid, or walk into a wall.

+ +

If you walk over a key, you can pick it up and you cannot walk over a lock unless you have its corresponding key.

+ +

For some 1 <= k <= 6, there is exactly one lowercase and one uppercase letter of the first k letters of the English alphabet in the grid. This means that there is exactly one key for each lock, and one lock for each key; and also that the letters used to represent the keys and locks were chosen in the same order as the English alphabet.

+ +

Return the lowest number of moves to acquire all keys. If it is impossible, return -1.

+ +

 

+

Example 1:

+ +
+Input: grid = ["@.a..","###.#","b.A.B"]
+Output: 8
+Explanation: Note that the goal is to obtain all the keys not to open all the locks.
+
+ +

Example 2:

+ +
+Input: grid = ["@..aA","..B#.","....b"]
+Output: 6
+
+ +

Example 3:

+ +
+Input: grid = ["@Aa"]
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 30
    • +
  • grid[i][j] is either an English letter, '.', '#', or '@'. 
    • +
  • There is exactly one '@' in the grid.
    • +
  • The number of keys in the grid is in the range [1, 6].
    • +
  • Each key in the grid is unique.
    • +
  • Each key in the grid has a matching lock.
    • +
+",3.0,False,"class Solution { +public: + int shortestPathAllKeys(vector& grid) { + + } +};","class Solution { + public int shortestPathAllKeys(String[] grid) { + + } +}","class Solution(object): + def shortestPathAllKeys(self, grid): + """""" + :type grid: List[str] + :rtype: int + """""" + ","class Solution: + def shortestPathAllKeys(self, grid: List[str]) -> int: + ","int shortestPathAllKeys(char ** grid, int gridSize){ + +}","public class Solution { + public int ShortestPathAllKeys(string[] grid) { + + } +}","/** + * @param {string[]} grid + * @return {number} + */ +var shortestPathAllKeys = function(grid) { + +};","# @param {String[]} grid +# @return {Integer} +def shortest_path_all_keys(grid) + +end","class Solution { + func shortestPathAllKeys(_ grid: [String]) -> Int { + + } +}","func shortestPathAllKeys(grid []string) int { + +}","object Solution { + def shortestPathAllKeys(grid: Array[String]): Int = { + + } +}","class Solution { + fun shortestPathAllKeys(grid: Array): Int { + + } +}","impl Solution { + pub fn shortest_path_all_keys(grid: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $grid + * @return Integer + */ + function shortestPathAllKeys($grid) { + + } +}","function shortestPathAllKeys(grid: string[]): number { + +};","(define/contract (shortest-path-all-keys grid) + (-> (listof string?) exact-integer?) + + )","-spec shortest_path_all_keys(Grid :: [unicode:unicode_binary()]) -> integer(). +shortest_path_all_keys(Grid) -> + .","defmodule Solution do + @spec shortest_path_all_keys(grid :: [String.t]) :: integer + def shortest_path_all_keys(grid) do + + end +end","class Solution { + int shortestPathAllKeys(List grid) { + + } +}", +1466,random-pick-with-blacklist,Random Pick with Blacklist,710.0,894.0,"

You are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n - 1] that is not in blacklist. Any integer that is in the mentioned range and not in blacklist should be equally likely to be returned.

+ +

Optimize your algorithm such that it minimizes the number of calls to the built-in random function of your language.

+ +

Implement the Solution class:

+ +
    +
  • Solution(int n, int[] blacklist) Initializes the object with the integer n and the blacklisted integers blacklist.
    • +
  • int pick() Returns a random integer in the range [0, n - 1] and not in blacklist.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution", "pick", "pick", "pick", "pick", "pick", "pick", "pick"]
+[[7, [2, 3, 5]], [], [], [], [], [], [], []]
+Output
+[null, 0, 4, 1, 6, 1, 0, 4]
+
+Explanation
+Solution solution = new Solution(7, [2, 3, 5]);
+solution.pick(); // return 0, any integer from [0,1,4,6] should be ok. Note that for every call of pick,
+                 // 0, 1, 4, and 6 must be equally likely to be returned (i.e., with probability 1/4).
+solution.pick(); // return 4
+solution.pick(); // return 1
+solution.pick(); // return 6
+solution.pick(); // return 1
+solution.pick(); // return 0
+solution.pick(); // return 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
  • 0 <= blacklist.length <= min(105, n - 1)
    • +
  • 0 <= blacklist[i] < n
    • +
  • All the values of blacklist are unique.
    • +
  • At most 2 * 104 calls will be made to pick.
    • +
+",3.0,False,"class Solution { +public: + Solution(int n, vector& blacklist) { + + } + + int pick() { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(n, blacklist); + * int param_1 = obj->pick(); + */","class Solution { + + public Solution(int n, int[] blacklist) { + + } + + public int pick() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(n, blacklist); + * int param_1 = obj.pick(); + */","class Solution(object): + + def __init__(self, n, blacklist): + """""" + :type n: int + :type blacklist: List[int] + """""" + + + def pick(self): + """""" + :rtype: int + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(n, blacklist) +# param_1 = obj.pick()","class Solution: + + def __init__(self, n: int, blacklist: List[int]): + + + def pick(self) -> int: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(n, blacklist) +# param_1 = obj.pick()"," + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(int n, int* blacklist, int blacklistSize) { + +} + +int solutionPick(Solution* obj) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(n, blacklist, blacklistSize); + * int param_1 = solutionPick(obj); + + * solutionFree(obj); +*/","public class Solution { + + public Solution(int n, int[] blacklist) { + + } + + public int Pick() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(n, blacklist); + * int param_1 = obj.Pick(); + */","/** + * @param {number} n + * @param {number[]} blacklist + */ +var Solution = function(n, blacklist) { + +}; + +/** + * @return {number} + */ +Solution.prototype.pick = function() { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(n, blacklist) + * var param_1 = obj.pick() + */","class Solution + +=begin + :type n: Integer + :type blacklist: Integer[] +=end + def initialize(n, blacklist) + + end + + +=begin + :rtype: Integer +=end + def pick() + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(n, blacklist) +# param_1 = obj.pick()"," +class Solution { + + init(_ n: Int, _ blacklist: [Int]) { + + } + + func pick() -> Int { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(n, blacklist) + * let ret_1: Int = obj.pick() + */","type Solution struct { + +} + + +func Constructor(n int, blacklist []int) Solution { + +} + + +func (this *Solution) Pick() int { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(n, blacklist); + * param_1 := obj.Pick(); + */","class Solution(_n: Int, _blacklist: Array[Int]) { + + def pick(): Int = { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(n, blacklist) + * var param_1 = obj.pick() + */","class Solution(n: Int, blacklist: IntArray) { + + fun pick(): Int { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(n, blacklist) + * var param_1 = obj.pick() + */","struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(n: i32, blacklist: Vec) -> Self { + + } + + fn pick(&self) -> i32 { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(n, blacklist); + * let ret_1: i32 = obj.pick(); + */","class Solution { + /** + * @param Integer $n + * @param Integer[] $blacklist + */ + function __construct($n, $blacklist) { + + } + + /** + * @return Integer + */ + function pick() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($n, $blacklist); + * $ret_1 = $obj->pick(); + */","class Solution { + constructor(n: number, blacklist: number[]) { + + } + + pick(): number { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(n, blacklist) + * var param_1 = obj.pick() + */","(define solution% + (class object% + (super-new) + + ; n : exact-integer? + + ; blacklist : (listof exact-integer?) + (init-field + n + blacklist) + + ; pick : -> exact-integer? + (define/public (pick) + + ))) + +;; Your solution% object will be instantiated and called as such: +;; (define obj (new solution% [n n] [blacklist blacklist])) +;; (define param_1 (send obj pick))","-spec solution_init_(N :: integer(), Blacklist :: [integer()]) -> any(). +solution_init_(N, Blacklist) -> + . + +-spec solution_pick() -> integer(). +solution_pick() -> + . + + +%% Your functions will be called as such: +%% solution_init_(N, Blacklist), +%% Param_1 = solution_pick(), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Solution do + @spec init_(n :: integer, blacklist :: [integer]) :: any + def init_(n, blacklist) do + + end + + @spec pick() :: integer + def pick() do + + end +end + +# Your functions will be called as such: +# Solution.init_(n, blacklist) +# param_1 = Solution.pick() + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","class Solution { + + Solution(int n, List blacklist) { + + } + + int pick() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(n, blacklist); + * int param1 = obj.pick(); + */", +1467,all-nodes-distance-k-in-binary-tree,All Nodes Distance K in Binary Tree,863.0,893.0,"

Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the target node.

+ +

You can return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: root = [3,5,1,6,2,0,8,null,null,7,4], target = 5, k = 2
+Output: [7,4,1]
+Explanation: The nodes that are a distance 2 from the target node (with value 5) have values 7, 4, and 1.
+
+ +

Example 2:

+ +
+Input: root = [1], target = 1, k = 3
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 500].
    • +
  • 0 <= Node.val <= 500
    • +
  • All the values Node.val are unique.
    • +
  • target is the value of one of the nodes in the tree.
    • +
  • 0 <= k <= 1000
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode(int x) : val(x), left(NULL), right(NULL) {} + * }; + */ +class Solution { +public: + vector distanceK(TreeNode* root, TreeNode* target, int k) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ +class Solution { + public List distanceK(TreeNode root, TreeNode target, int k) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution(object): + def distanceK(self, root, target, k): + """""" + :type root: TreeNode + :type target: TreeNode + :type k: int + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution: + def distanceK(self, root: TreeNode, target: TreeNode, k: int) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ + + +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* distanceK(struct TreeNode* root, struct TreeNode* target, int k, int* returnSize) { + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int x) { val = x; } + * } + */ +public class Solution { + public IList DistanceK(TreeNode root, TreeNode target, int k) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ +/** + * @param {TreeNode} root + * @param {TreeNode} target + * @param {number} k + * @return {number[]} + */ +var distanceK = function(root, target, k) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val) +# @val = val +# @left, @right = nil, nil +# end +# end +# @param {TreeNode} root +# @param {TreeNode} target +# @param {Integer} k +# @return {Integer[]} +def distance_k(root, target, k) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init(_ val: Int) { + * self.val = val + * self.left = nil + * self.right = nil + * } + * } + */ +class Solution { + func distanceK(_ root: TreeNode?, _ target: TreeNode?, _ k: Int) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func distanceK(root *TreeNode, target *TreeNode, k int) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(var _value: Int) { + * var value: Int = _value + * var left: TreeNode = null + * var right: TreeNode = null + * } + */ +object Solution { + def distanceK(root: TreeNode, target: TreeNode, k: Int): List[Int] = { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode(var `val`: Int = 0) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun distanceK(root: TreeNode?, target: TreeNode?, k: Int): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn distance_k(root: Option>>, target: Option>>, k: i32) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($value) { $this->val = $value; } + * } + */ +class Solution { + /** + * @param TreeNode $root + * @param TreeNode $target + * @param Integer $k + * @return Integer[] + */ + function distanceK($root, $target, $k) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function distanceK(root: TreeNode | null, target: TreeNode | null, k: number): number[] { + +};",,,,, +1468,shortest-subarray-with-sum-at-least-k,Shortest Subarray with Sum at Least K,862.0,892.0,"

Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1.

+ +

A subarray is a contiguous part of an array.

+ +

 

+

Example 1:

+
Input: nums = [1], k = 1
+Output: 1
+

Example 2:

+
Input: nums = [1,2], k = 4
+Output: -1
+

Example 3:

+
Input: nums = [2,-1,2], k = 3
+Output: 3
+
+

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -105 <= nums[i] <= 105
    • +
  • 1 <= k <= 109
    • +
+",3.0,False,"class Solution { +public: + int shortestSubarray(vector& nums, int k) { + + } +};","class Solution { + public int shortestSubarray(int[] nums, int k) { + + } +}","class Solution(object): + def shortestSubarray(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def shortestSubarray(self, nums: List[int], k: int) -> int: + ","int shortestSubarray(int* nums, int numsSize, int k){ + +}","public class Solution { + public int ShortestSubarray(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var shortestSubarray = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def shortest_subarray(nums, k) + +end","class Solution { + func shortestSubarray(_ nums: [Int], _ k: Int) -> Int { + + } +}","func shortestSubarray(nums []int, k int) int { + +}","object Solution { + def shortestSubarray(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun shortestSubarray(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn shortest_subarray(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function shortestSubarray($nums, $k) { + + } +}","function shortestSubarray(nums: number[], k: number): number { + +};","(define/contract (shortest-subarray nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec shortest_subarray(Nums :: [integer()], K :: integer()) -> integer(). +shortest_subarray(Nums, K) -> + .","defmodule Solution do + @spec shortest_subarray(nums :: [integer], k :: integer) :: integer + def shortest_subarray(nums, k) do + + end +end","class Solution { + int shortestSubarray(List nums, int k) { + + } +}", +1469,score-after-flipping-matrix,Score After Flipping Matrix,861.0,891.0,"

You are given an m x n binary matrix grid.

+ +

A move consists of choosing any row or column and toggling each value in that row or column (i.e., changing all 0's to 1's, and all 1's to 0's).

+ +

Every row of the matrix is interpreted as a binary number, and the score of the matrix is the sum of these numbers.

+ +

Return the highest possible score after making any number of moves (including zero moves).

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,0,1,1],[1,0,1,0],[1,1,0,0]]
+Output: 39
+Explanation: 0b1111 + 0b1001 + 0b1111 = 15 + 9 + 15 = 39
+
+ +

Example 2:

+ +
+Input: grid = [[0]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 20
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int matrixScore(vector>& grid) { + + } +};","class Solution { + public int matrixScore(int[][] grid) { + + } +}","class Solution(object): + def matrixScore(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def matrixScore(self, grid: List[List[int]]) -> int: + ","int matrixScore(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MatrixScore(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var matrixScore = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def matrix_score(grid) + +end","class Solution { + func matrixScore(_ grid: [[Int]]) -> Int { + + } +}","func matrixScore(grid [][]int) int { + +}","object Solution { + def matrixScore(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun matrixScore(grid: Array): Int { + + } +}","impl Solution { + pub fn matrix_score(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function matrixScore($grid) { + + } +}","function matrixScore(grid: number[][]): number { + +};","(define/contract (matrix-score grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec matrix_score(Grid :: [[integer()]]) -> integer(). +matrix_score(Grid) -> + .","defmodule Solution do + @spec matrix_score(grid :: [[integer]]) :: integer + def matrix_score(grid) do + + end +end","class Solution { + int matrixScore(List> grid) { + + } +}", +1473,minimum-cost-to-hire-k-workers,Minimum Cost to Hire K Workers,857.0,887.0,"

There are n workers. You are given two integer arrays quality and wage where quality[i] is the quality of the ith worker and wage[i] is the minimum wage expectation for the ith worker.

+ +

We want to hire exactly k workers to form a paid group. To hire a group of k workers, we must pay them according to the following rules:

+ +
    +
  1. Every worker in the paid group should be paid in the ratio of their quality compared to other workers in the paid group.
    2. +
  2. Every worker in the paid group must be paid at least their minimum wage expectation.
    3. +
+ +

Given the integer k, return the least amount of money needed to form a paid group satisfying the above conditions. Answers within 10-5 of the actual answer will be accepted.

+ +

 

+

Example 1:

+ +
+Input: quality = [10,20,5], wage = [70,50,30], k = 2
+Output: 105.00000
+Explanation: We pay 70 to 0th worker and 35 to 2nd worker.
+
+ +

Example 2:

+ +
+Input: quality = [3,1,10,10,1], wage = [4,8,2,2,7], k = 3
+Output: 30.66667
+Explanation: We pay 4 to 0th worker, 13.33333 to 2nd and 3rd workers separately.
+
+ +

 

+

Constraints:

+ +
    +
  • n == quality.length == wage.length
    • +
  • 1 <= k <= n <= 104
    • +
  • 1 <= quality[i], wage[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + double mincostToHireWorkers(vector& quality, vector& wage, int k) { + + } +};","class Solution { + public double mincostToHireWorkers(int[] quality, int[] wage, int k) { + + } +}","class Solution(object): + def mincostToHireWorkers(self, quality, wage, k): + """""" + :type quality: List[int] + :type wage: List[int] + :type k: int + :rtype: float + """""" + ","class Solution: + def mincostToHireWorkers(self, quality: List[int], wage: List[int], k: int) -> float: + ","double mincostToHireWorkers(int* quality, int qualitySize, int* wage, int wageSize, int k){ + +}","public class Solution { + public double MincostToHireWorkers(int[] quality, int[] wage, int k) { + + } +}","/** + * @param {number[]} quality + * @param {number[]} wage + * @param {number} k + * @return {number} + */ +var mincostToHireWorkers = function(quality, wage, k) { + +};","# @param {Integer[]} quality +# @param {Integer[]} wage +# @param {Integer} k +# @return {Float} +def mincost_to_hire_workers(quality, wage, k) + +end","class Solution { + func mincostToHireWorkers(_ quality: [Int], _ wage: [Int], _ k: Int) -> Double { + + } +}","func mincostToHireWorkers(quality []int, wage []int, k int) float64 { + +}","object Solution { + def mincostToHireWorkers(quality: Array[Int], wage: Array[Int], k: Int): Double = { + + } +}","class Solution { + fun mincostToHireWorkers(quality: IntArray, wage: IntArray, k: Int): Double { + + } +}","impl Solution { + pub fn mincost_to_hire_workers(quality: Vec, wage: Vec, k: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[] $quality + * @param Integer[] $wage + * @param Integer $k + * @return Float + */ + function mincostToHireWorkers($quality, $wage, $k) { + + } +}","function mincostToHireWorkers(quality: number[], wage: number[], k: number): number { + +};","(define/contract (mincost-to-hire-workers quality wage k) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? flonum?) + + )","-spec mincost_to_hire_workers(Quality :: [integer()], Wage :: [integer()], K :: integer()) -> float(). +mincost_to_hire_workers(Quality, Wage, K) -> + .","defmodule Solution do + @spec mincost_to_hire_workers(quality :: [integer], wage :: [integer], k :: integer) :: float + def mincost_to_hire_workers(quality, wage, k) do + + end +end","class Solution { + double mincostToHireWorkers(List quality, List wage, int k) { + + } +}", +1475,exam-room,Exam Room,855.0,885.0,"

There is an exam room with n seats in a single row labeled from 0 to n - 1.

+ +

When a student enters the room, they must sit in the seat that maximizes the distance to the closest person. If there are multiple such seats, they sit in the seat with the lowest number. If no one is in the room, then the student sits at seat number 0.

+ +

Design a class that simulates the mentioned exam room.

+ +

Implement the ExamRoom class:

+ +
    +
  • ExamRoom(int n) Initializes the object of the exam room with the number of the seats n.
    • +
  • int seat() Returns the label of the seat at which the next student will set.
    • +
  • void leave(int p) Indicates that the student sitting at seat p will leave the room. It is guaranteed that there will be a student sitting at seat p.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["ExamRoom", "seat", "seat", "seat", "seat", "leave", "seat"]
+[[10], [], [], [], [], [4], []]
+Output
+[null, 0, 9, 4, 2, null, 5]
+
+Explanation
+ExamRoom examRoom = new ExamRoom(10);
+examRoom.seat(); // return 0, no one is in the room, then the student sits at seat number 0.
+examRoom.seat(); // return 9, the student sits at the last seat number 9.
+examRoom.seat(); // return 4, the student sits at the last seat number 4.
+examRoom.seat(); // return 2, the student sits at the last seat number 2.
+examRoom.leave(4);
+examRoom.seat(); // return 5, the student sits at the last seat number 5.
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
  • It is guaranteed that there is a student sitting at seat p.
    • +
  • At most 104 calls will be made to seat and leave.
    • +
+",2.0,False,"class ExamRoom { +public: + ExamRoom(int n) { + + } + + int seat() { + + } + + void leave(int p) { + + } +}; + +/** + * Your ExamRoom object will be instantiated and called as such: + * ExamRoom* obj = new ExamRoom(n); + * int param_1 = obj->seat(); + * obj->leave(p); + */","class ExamRoom { + + public ExamRoom(int n) { + + } + + public int seat() { + + } + + public void leave(int p) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * ExamRoom obj = new ExamRoom(n); + * int param_1 = obj.seat(); + * obj.leave(p); + */","class ExamRoom(object): + + def __init__(self, n): + """""" + :type n: int + """""" + + + def seat(self): + """""" + :rtype: int + """""" + + + def leave(self, p): + """""" + :type p: int + :rtype: None + """""" + + + +# Your ExamRoom object will be instantiated and called as such: +# obj = ExamRoom(n) +# param_1 = obj.seat() +# obj.leave(p)","class ExamRoom: + + def __init__(self, n: int): + + + def seat(self) -> int: + + + def leave(self, p: int) -> None: + + + +# Your ExamRoom object will be instantiated and called as such: +# obj = ExamRoom(n) +# param_1 = obj.seat() +# obj.leave(p)"," + + +typedef struct { + +} ExamRoom; + + +ExamRoom* examRoomCreate(int n) { + +} + +int examRoomSeat(ExamRoom* obj) { + +} + +void examRoomLeave(ExamRoom* obj, int p) { + +} + +void examRoomFree(ExamRoom* obj) { + +} + +/** + * Your ExamRoom struct will be instantiated and called as such: + * ExamRoom* obj = examRoomCreate(n); + * int param_1 = examRoomSeat(obj); + + * examRoomLeave(obj, p); + + * examRoomFree(obj); +*/","public class ExamRoom { + + public ExamRoom(int n) { + + } + + public int Seat() { + + } + + public void Leave(int p) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * ExamRoom obj = new ExamRoom(n); + * int param_1 = obj.Seat(); + * obj.Leave(p); + */","/** + * @param {number} n + */ +var ExamRoom = function(n) { + +}; + +/** + * @return {number} + */ +ExamRoom.prototype.seat = function() { + +}; + +/** + * @param {number} p + * @return {void} + */ +ExamRoom.prototype.leave = function(p) { + +}; + +/** + * Your ExamRoom object will be instantiated and called as such: + * var obj = new ExamRoom(n) + * var param_1 = obj.seat() + * obj.leave(p) + */","class ExamRoom + +=begin + :type n: Integer +=end + def initialize(n) + + end + + +=begin + :rtype: Integer +=end + def seat() + + end + + +=begin + :type p: Integer + :rtype: Void +=end + def leave(p) + + end + + +end + +# Your ExamRoom object will be instantiated and called as such: +# obj = ExamRoom.new(n) +# param_1 = obj.seat() +# obj.leave(p)"," +class ExamRoom { + + init(_ n: Int) { + + } + + func seat() -> Int { + + } + + func leave(_ p: Int) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * let obj = ExamRoom(n) + * let ret_1: Int = obj.seat() + * obj.leave(p) + */","type ExamRoom struct { + +} + + +func Constructor(n int) ExamRoom { + +} + + +func (this *ExamRoom) Seat() int { + +} + + +func (this *ExamRoom) Leave(p int) { + +} + + +/** + * Your ExamRoom object will be instantiated and called as such: + * obj := Constructor(n); + * param_1 := obj.Seat(); + * obj.Leave(p); + */","class ExamRoom(_n: Int) { + + def seat(): Int = { + + } + + def leave(p: Int) { + + } + +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * var obj = new ExamRoom(n) + * var param_1 = obj.seat() + * obj.leave(p) + */","class ExamRoom(n: Int) { + + fun seat(): Int { + + } + + fun leave(p: Int) { + + } + +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * var obj = ExamRoom(n) + * var param_1 = obj.seat() + * obj.leave(p) + */","struct ExamRoom { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl ExamRoom { + + fn new(n: i32) -> Self { + + } + + fn seat(&self) -> i32 { + + } + + fn leave(&self, p: i32) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * let obj = ExamRoom::new(n); + * let ret_1: i32 = obj.seat(); + * obj.leave(p); + */","class ExamRoom { + /** + * @param Integer $n + */ + function __construct($n) { + + } + + /** + * @return Integer + */ + function seat() { + + } + + /** + * @param Integer $p + * @return NULL + */ + function leave($p) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * $obj = ExamRoom($n); + * $ret_1 = $obj->seat(); + * $obj->leave($p); + */","class ExamRoom { + constructor(n: number) { + + } + + seat(): number { + + } + + leave(p: number): void { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * var obj = new ExamRoom(n) + * var param_1 = obj.seat() + * obj.leave(p) + */","(define exam-room% + (class object% + (super-new) + + ; n : exact-integer? + (init-field + n) + + ; seat : -> exact-integer? + (define/public (seat) + + ) + ; leave : exact-integer? -> void? + (define/public (leave p) + + ))) + +;; Your exam-room% object will be instantiated and called as such: +;; (define obj (new exam-room% [n n])) +;; (define param_1 (send obj seat)) +;; (send obj leave p)","-spec exam_room_init_(N :: integer()) -> any(). +exam_room_init_(N) -> + . + +-spec exam_room_seat() -> integer(). +exam_room_seat() -> + . + +-spec exam_room_leave(P :: integer()) -> any(). +exam_room_leave(P) -> + . + + +%% Your functions will be called as such: +%% exam_room_init_(N), +%% Param_1 = exam_room_seat(), +%% exam_room_leave(P), + +%% exam_room_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule ExamRoom do + @spec init_(n :: integer) :: any + def init_(n) do + + end + + @spec seat() :: integer + def seat() do + + end + + @spec leave(p :: integer) :: any + def leave(p) do + + end +end + +# Your functions will be called as such: +# ExamRoom.init_(n) +# param_1 = ExamRoom.seat() +# ExamRoom.leave(p) + +# ExamRoom.init_ will be called before every test case, in which you can do some necessary initializations.","class ExamRoom { + + ExamRoom(int n) { + + } + + int seat() { + + } + + void leave(int p) { + + } +} + +/** + * Your ExamRoom object will be instantiated and called as such: + * ExamRoom obj = ExamRoom(n); + * int param1 = obj.seat(); + * obj.leave(p); + */", +1476,k-similar-strings,K-Similar Strings,854.0,884.0,"

Strings s1 and s2 are k-similar (for some non-negative integer k) if we can swap the positions of two letters in s1 exactly k times so that the resulting string equals s2.

+ +

Given two anagrams s1 and s2, return the smallest k for which s1 and s2 are k-similar.

+ +

 

+

Example 1:

+ +
+Input: s1 = "ab", s2 = "ba"
+Output: 1
+Explanation: The two string are 1-similar because we can use one swap to change s1 to s2: "ab" --> "ba".
+
+ +

Example 2:

+ +
+Input: s1 = "abc", s2 = "bca"
+Output: 2
+Explanation: The two strings are 2-similar because we can use two swaps to change s1 to s2: "abc" --> "bac" --> "bca".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length <= 20
    • +
  • s2.length == s1.length
    • +
  • s1 and s2 contain only lowercase letters from the set {'a', 'b', 'c', 'd', 'e', 'f'}.
    • +
  • s2 is an anagram of s1.
    • +
+",3.0,False,"class Solution { +public: + int kSimilarity(string s1, string s2) { + + } +};","class Solution { + public int kSimilarity(String s1, String s2) { + + } +}","class Solution(object): + def kSimilarity(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: int + """""" + ","class Solution: + def kSimilarity(self, s1: str, s2: str) -> int: + ","int kSimilarity(char * s1, char * s2){ + +}","public class Solution { + public int KSimilarity(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {number} + */ +var kSimilarity = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Integer} +def k_similarity(s1, s2) + +end","class Solution { + func kSimilarity(_ s1: String, _ s2: String) -> Int { + + } +}","func kSimilarity(s1 string, s2 string) int { + +}","object Solution { + def kSimilarity(s1: String, s2: String): Int = { + + } +}","class Solution { + fun kSimilarity(s1: String, s2: String): Int { + + } +}","impl Solution { + pub fn k_similarity(s1: String, s2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Integer + */ + function kSimilarity($s1, $s2) { + + } +}","function kSimilarity(s1: string, s2: string): number { + +};","(define/contract (k-similarity s1 s2) + (-> string? string? exact-integer?) + + )","-spec k_similarity(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> integer(). +k_similarity(S1, S2) -> + .","defmodule Solution do + @spec k_similarity(s1 :: String.t, s2 :: String.t) :: integer + def k_similarity(s1, s2) do + + end +end","class Solution { + int kSimilarity(String s1, String s2) { + + } +}", +1480,rectangle-area-ii,Rectangle Area II,850.0,880.0,"

You are given a 2D array of axis-aligned rectangles. Each rectangle[i] = [xi1, yi1, xi2, yi2] denotes the ith rectangle where (xi1, yi1) are the coordinates of the bottom-left corner, and (xi2, yi2) are the coordinates of the top-right corner.

+ +

Calculate the total area covered by all rectangles in the plane. Any area covered by two or more rectangles should only be counted once.

+ +

Return the total area. Since the answer may be too large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: rectangles = [[0,0,2,2],[1,0,2,3],[1,0,3,1]]
+Output: 6
+Explanation: A total area of 6 is covered by all three rectangles, as illustrated in the picture.
+From (1,1) to (2,2), the green and red rectangles overlap.
+From (1,0) to (2,3), all three rectangles overlap.
+
+ +

Example 2:

+ +
+Input: rectangles = [[0,0,1000000000,1000000000]]
+Output: 49
+Explanation: The answer is 1018 modulo (109 + 7), which is 49.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rectangles.length <= 200
    • +
  • rectanges[i].length == 4
    • +
  • 0 <= xi1, yi1, xi2, yi2 <= 109
    • +
  • xi1 <= xi2
    • +
  • yi1 <= yi2
    • +
+",3.0,False,"class Solution { +public: + int rectangleArea(vector>& rectangles) { + + } +};","class Solution { + public int rectangleArea(int[][] rectangles) { + + } +}","class Solution(object): + def rectangleArea(self, rectangles): + """""" + :type rectangles: List[List[int]] + :rtype: int + """""" + ","class Solution: + def rectangleArea(self, rectangles: List[List[int]]) -> int: + ","int rectangleArea(int** rectangles, int rectanglesSize, int* rectanglesColSize){ + +}","public class Solution { + public int RectangleArea(int[][] rectangles) { + + } +}","/** + * @param {number[][]} rectangles + * @return {number} + */ +var rectangleArea = function(rectangles) { + +};","# @param {Integer[][]} rectangles +# @return {Integer} +def rectangle_area(rectangles) + +end","class Solution { + func rectangleArea(_ rectangles: [[Int]]) -> Int { + + } +}","func rectangleArea(rectangles [][]int) int { + +}","object Solution { + def rectangleArea(rectangles: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun rectangleArea(rectangles: Array): Int { + + } +}","impl Solution { + pub fn rectangle_area(rectangles: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $rectangles + * @return Integer + */ + function rectangleArea($rectangles) { + + } +}","function rectangleArea(rectangles: number[][]): number { + +};",,"-spec rectangle_area(Rectangles :: [[integer()]]) -> integer(). +rectangle_area(Rectangles) -> + .","defmodule Solution do + @spec rectangle_area(rectangles :: [[integer]]) :: integer + def rectangle_area(rectangles) do + + end +end","class Solution { + int rectangleArea(List> rectangles) { + + } +}", +1481,maximize-distance-to-closest-person,Maximize Distance to Closest Person,849.0,879.0,"

You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed).

+ +

There is at least one empty seat, and at least one person sitting.

+ +

Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. 

+ +

Return that maximum distance to the closest person.

+ +

 

+

Example 1:

+ +
+Input: seats = [1,0,0,0,1,0,1]
+Output: 2
+Explanation: 
+If Alex sits in the second open seat (i.e. seats[2]), then the closest person has distance 2.
+If Alex sits in any other open seat, the closest person has distance 1.
+Thus, the maximum distance to the closest person is 2.
+
+ +

Example 2:

+ +
+Input: seats = [1,0,0,0]
+Output: 3
+Explanation: 
+If Alex sits in the last seat (i.e. seats[3]), the closest person is 3 seats away.
+This is the maximum distance possible, so the answer is 3.
+
+ +

Example 3:

+ +
+Input: seats = [0,1]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= seats.length <= 2 * 104
    • +
  • seats[i] is 0 or 1.
    • +
  • At least one seat is empty.
    • +
  • At least one seat is occupied.
    • +
+",2.0,False,"class Solution { +public: + int maxDistToClosest(vector& seats) { + + } +};","class Solution { + public int maxDistToClosest(int[] seats) { + + } +}","class Solution(object): + def maxDistToClosest(self, seats): + """""" + :type seats: List[int] + :rtype: int + """""" + ","class Solution: + def maxDistToClosest(self, seats: List[int]) -> int: + ","int maxDistToClosest(int* seats, int seatsSize){ + +}","public class Solution { + public int MaxDistToClosest(int[] seats) { + + } +}","/** + * @param {number[]} seats + * @return {number} + */ +var maxDistToClosest = function(seats) { + +};","# @param {Integer[]} seats +# @return {Integer} +def max_dist_to_closest(seats) + +end","class Solution { + func maxDistToClosest(_ seats: [Int]) -> Int { + + } +}","func maxDistToClosest(seats []int) int { + +}","object Solution { + def maxDistToClosest(seats: Array[Int]): Int = { + + } +}","class Solution { + fun maxDistToClosest(seats: IntArray): Int { + + } +}","impl Solution { + pub fn max_dist_to_closest(seats: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $seats + * @return Integer + */ + function maxDistToClosest($seats) { + + } +}","function maxDistToClosest(seats: number[]): number { + +};","(define/contract (max-dist-to-closest seats) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_dist_to_closest(Seats :: [integer()]) -> integer(). +max_dist_to_closest(Seats) -> + .","defmodule Solution do + @spec max_dist_to_closest(seats :: [integer]) :: integer + def max_dist_to_closest(seats) do + + end +end","class Solution { + int maxDistToClosest(List seats) { + + } +}", +1483,shortest-path-visiting-all-nodes,Shortest Path Visiting All Nodes,847.0,877.0,"

You have an undirected, connected graph of n nodes labeled from 0 to n - 1. You are given an array graph where graph[i] is a list of all the nodes connected with node i by an edge.

+ +

Return the length of the shortest path that visits every node. You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.

+ +

 

+

Example 1:

+ +
+Input: graph = [[1,2,3],[0],[0],[0]]
+Output: 4
+Explanation: One possible path is [1,0,2,0,3]
+
+ +

Example 2:

+ +
+Input: graph = [[1],[0,2,4],[1,3,4],[2],[1,2]]
+Output: 4
+Explanation: One possible path is [0,1,4,2,3]
+
+ +

 

+

Constraints:

+ +
    +
  • n == graph.length
    • +
  • 1 <= n <= 12
    • +
  • 0 <= graph[i].length < n
    • +
  • graph[i] does not contain i.
    • +
  • If graph[a] contains b, then graph[b] contains a.
    • +
  • The input graph is always connected.
    • +
+",3.0,False,"class Solution { +public: + int shortestPathLength(vector>& graph) { + + } +};","class Solution { + public int shortestPathLength(int[][] graph) { + + } +}","class Solution(object): + def shortestPathLength(self, graph): + """""" + :type graph: List[List[int]] + :rtype: int + """""" + ","class Solution: + def shortestPathLength(self, graph: List[List[int]]) -> int: + ","int shortestPathLength(int** graph, int graphSize, int* graphColSize){ + +}","public class Solution { + public int ShortestPathLength(int[][] graph) { + + } +}","/** + * @param {number[][]} graph + * @return {number} + */ +var shortestPathLength = function(graph) { + +};","# @param {Integer[][]} graph +# @return {Integer} +def shortest_path_length(graph) + +end","class Solution { + func shortestPathLength(_ graph: [[Int]]) -> Int { + + } +}","func shortestPathLength(graph [][]int) int { + +}","object Solution { + def shortestPathLength(graph: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun shortestPathLength(graph: Array): Int { + + } +}","impl Solution { + pub fn shortest_path_length(graph: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $graph + * @return Integer + */ + function shortestPathLength($graph) { + + } +}","function shortestPathLength(graph: number[][]): number { + +};","(define/contract (shortest-path-length graph) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec shortest_path_length(Graph :: [[integer()]]) -> integer(). +shortest_path_length(Graph) -> + .","defmodule Solution do + @spec shortest_path_length(graph :: [[integer]]) :: integer + def shortest_path_length(graph) do + + end +end","class Solution { + int shortestPathLength(List> graph) { + + } +}", +1485,longest-mountain-in-array,Longest Mountain in Array,845.0,875.0,"

You may recall that an array arr is a mountain array if and only if:

+ +
    +
  • arr.length >= 3
    • +
  • There exists some index i (0-indexed) with 0 < i < arr.length - 1 such that: +
      +
    • arr[0] < arr[1] < ... < arr[i - 1] < arr[i]
      • +
    • arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
      • +
    +
    • +
+ +

Given an integer array arr, return the length of the longest subarray, which is a mountain. Return 0 if there is no mountain subarray.

+ +

 

+

Example 1:

+ +
+Input: arr = [2,1,4,7,3,2,5]
+Output: 5
+Explanation: The largest mountain is [1,4,7,3,2] which has length 5.
+
+ +

Example 2:

+ +
+Input: arr = [2,2,2]
+Output: 0
+Explanation: There is no mountain.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 104
    • +
  • 0 <= arr[i] <= 104
    • +
+ +

 

+

Follow up:

+ +
    +
  • Can you solve it using only one pass?
    • +
  • Can you solve it in O(1) space?
    • +
+",2.0,False,"class Solution { +public: + int longestMountain(vector& arr) { + + } +};","class Solution { + public int longestMountain(int[] arr) { + + } +}","class Solution(object): + def longestMountain(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def longestMountain(self, arr: List[int]) -> int: + ","int longestMountain(int* arr, int arrSize){ + +}","public class Solution { + public int LongestMountain(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var longestMountain = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def longest_mountain(arr) + +end","class Solution { + func longestMountain(_ arr: [Int]) -> Int { + + } +}","func longestMountain(arr []int) int { + +}","object Solution { + def longestMountain(arr: Array[Int]): Int = { + + } +}","class Solution { + fun longestMountain(arr: IntArray): Int { + + } +}","impl Solution { + pub fn longest_mountain(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function longestMountain($arr) { + + } +}","function longestMountain(arr: number[]): number { + +};","(define/contract (longest-mountain arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_mountain(Arr :: [integer()]) -> integer(). +longest_mountain(Arr) -> + .","defmodule Solution do + @spec longest_mountain(arr :: [integer]) :: integer + def longest_mountain(arr) do + + end +end","class Solution { + int longestMountain(List arr) { + + } +}", +1486,backspace-string-compare,Backspace String Compare,844.0,874.0,"

Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character.

+ +

Note that after backspacing an empty text, the text will continue empty.

+ +

 

+

Example 1:

+ +
+Input: s = "ab#c", t = "ad#c"
+Output: true
+Explanation: Both s and t become "ac".
+
+ +

Example 2:

+ +
+Input: s = "ab##", t = "c#d#"
+Output: true
+Explanation: Both s and t become "".
+
+ +

Example 3:

+ +
+Input: s = "a#c", t = "b"
+Output: false
+Explanation: s becomes "c" while t becomes "b".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 200
    • +
  • s and t only contain lowercase letters and '#' characters.
    • +
+ +

 

+

Follow up: Can you solve it in O(n) time and O(1) space?

+",1.0,False,"class Solution { +public: + bool backspaceCompare(string s, string t) { + + } +};","class Solution { + public boolean backspaceCompare(String s, String t) { + + } +}","class Solution(object): + def backspaceCompare(self, s, t): + """""" + :type s: str + :type t: str + :rtype: bool + """""" + ","class Solution: + def backspaceCompare(self, s: str, t: str) -> bool: + ","bool backspaceCompare(char * s, char * t){ + +}","public class Solution { + public bool BackspaceCompare(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {boolean} + */ +var backspaceCompare = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Boolean} +def backspace_compare(s, t) + +end","class Solution { + func backspaceCompare(_ s: String, _ t: String) -> Bool { + + } +}","func backspaceCompare(s string, t string) bool { + +}","object Solution { + def backspaceCompare(s: String, t: String): Boolean = { + + } +}","class Solution { + fun backspaceCompare(s: String, t: String): Boolean { + + } +}","impl Solution { + pub fn backspace_compare(s: String, t: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Boolean + */ + function backspaceCompare($s, $t) { + + } +}","function backspaceCompare(s: string, t: string): boolean { + +};","(define/contract (backspace-compare s t) + (-> string? string? boolean?) + + )","-spec backspace_compare(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> boolean(). +backspace_compare(S, T) -> + .","defmodule Solution do + @spec backspace_compare(s :: String.t, t :: String.t) :: boolean + def backspace_compare(s, t) do + + end +end","class Solution { + bool backspaceCompare(String s, String t) { + + } +}", +1487,guess-the-word,Guess the Word,843.0,873.0,"

You are given an array of unique strings words where words[i] is six letters long. One word of words was chosen as a secret word.

+ +

You are also given the helper object Master. You may call Master.guess(word) where word is a six-letter-long string, and it must be from words. Master.guess(word) returns:

+ +
    +
  • -1 if word is not from words, or
    • +
  • an integer representing the number of exact matches (value and position) of your guess to the secret word.
    • +
+ +

There is a parameter allowedGuesses for each test case where allowedGuesses is the maximum number of times you can call Master.guess(word).

+ +

For each test case, you should call Master.guess with the secret word without exceeding the maximum number of allowed guesses. You will get:

+ +
    +
  • "Either you took too many guesses, or you did not find the secret word." if you called Master.guess more than allowedGuesses times or if you did not call Master.guess with the secret word, or
    • +
  • "You guessed the secret word correctly." if you called Master.guess with the secret word with the number of calls to Master.guess less than or equal to allowedGuesses.
    • +
+ +

The test cases are generated such that you can guess the secret word with a reasonable strategy (other than using the bruteforce method).

+ +

 

+

Example 1:

+ +
+Input: secret = "acckzz", words = ["acckzz","ccbazz","eiowzz","abcczz"], allowedGuesses = 10
+Output: You guessed the secret word correctly.
+Explanation:
+master.guess("aaaaaa") returns -1, because "aaaaaa" is not in wordlist.
+master.guess("acckzz") returns 6, because "acckzz" is secret and has all 6 matches.
+master.guess("ccbazz") returns 3, because "ccbazz" has 3 matches.
+master.guess("eiowzz") returns 2, because "eiowzz" has 2 matches.
+master.guess("abcczz") returns 4, because "abcczz" has 4 matches.
+We made 5 calls to master.guess, and one of them was the secret, so we pass the test case.
+
+ +

Example 2:

+ +
+Input: secret = "hamada", words = ["hamada","khaled"], allowedGuesses = 10
+Output: You guessed the secret word correctly.
+Explanation: Since there are two words, you can guess both.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
    • +
  • words[i].length == 6
    • +
  • words[i] consist of lowercase English letters.
    • +
  • All the strings of wordlist are unique.
    • +
  • secret exists in words.
    • +
  • 10 <= allowedGuesses <= 30
    • +
+",3.0,False,"/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * public: + * int guess(string word); + * }; + */ +class Solution { +public: + void findSecretWord(vector& words, Master& master) { + + } +};","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * interface Master { + * public int guess(String word) {} + * } + */ +class Solution { + public void findSecretWord(String[] words, Master master) { + + } +}","# """""" +# This is Master's API interface. +# You should not implement it, or speculate about its implementation +# """""" +#class Master(object): +# def guess(self, word): +# """""" +# :type word: str +# :rtype int +# """""" + +class Solution(object): + def findSecretWord(self, words, master): + """""" + :type words: List[Str] + :type master: Master + :rtype: None + """""" + ","# """""" +# This is Master's API interface. +# You should not implement it, or speculate about its implementation +# """""" +# class Master: +# def guess(self, word: str) -> int: + +class Solution: + def findSecretWord(self, words: List[str], master: 'Master') -> None: + ","/** + * ********************************************************************* + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * ********************************************************************* + * + * int guess(Master *, char *word); + */ +void findSecretWord(char** words, int wordsSize, Master* master) { + +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * public int Guess(string word); + * } + */ +class Solution { + public void FindSecretWord(string[] words, Master master) { + + } +}","/** + * // This is the master's API interface. + * // You should not implement it, or speculate about its implementation + * function Master() { + * + * @param {string} word + * @return {integer} + * this.guess = function(word) { + * ... + * }; + * }; + */ +/** + * @param {string[]} words + * @param {Master} master + * @return {void} + */ +var findSecretWord = function(words, master) { + +};","# This is Master's API interface. +# You should not implement it, or speculate about its implementation +# +# class Master +# =begin +# :type word: String +# :rtype: Integer +# =end +# def guess(word) +# ... +# end +# end +# + +# @param {String[]} words +# @param {Master} master +# @return {Void} +def find_secret_word(words, master) + +end","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * public func guess(word: String) -> Int {} + * } + */ +class Solution { + func findSecretWord(_ words: [String], _ master: Master) { + + } +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * type Master struct { + * } + * + * func (this *Master) Guess(word string) int {} + */ +func findSecretWord(words []string, master *Master) { + +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * + * def guess(word: String): Int = {} + * + * } + */ +object Solution { + def findSecretWord(words: Array[String], master: Master): Unit = { + + } +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * interface Master { + * fun guess(word: String): Int {} + * } + */ +class Solution { + fun findSecretWord(words: Array, master: Master) { + + } +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * struct Master; + * impl Master { + * fn guess(word:String)->int; + * }; + */ + +impl Solution { + pub fn find_secret_word(words: Vec, master: &Master) { + + } +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * interface Master { + * function guess($word) {} + * } + */ + +class Solution { + /** + * @param String[] $words + * @param Master $master + * @return + */ + function findSecretWord($words, $master) { + + } +}","/** + * // This is the Master's API interface. + * // You should not implement it, or speculate about its implementation + * class Master { + * guess(word: string): number {} + * } + */ + +function findSecretWord(words: string[], master: Master) { + +};",,,,, +1488,split-array-into-fibonacci-sequence,Split Array into Fibonacci Sequence,842.0,872.0,"

You are given a string of digits num, such as "123456579". We can split it into a Fibonacci-like sequence [123, 456, 579].

+ +

Formally, a Fibonacci-like sequence is a list f of non-negative integers such that:

+ +
    +
  • 0 <= f[i] < 231, (that is, each integer fits in a 32-bit signed integer type),
    • +
  • f.length >= 3, and
    • +
  • f[i] + f[i + 1] == f[i + 2] for all 0 <= i < f.length - 2.
    • +
+ +

Note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number 0 itself.

+ +

Return any Fibonacci-like sequence split from num, or return [] if it cannot be done.

+ +

 

+

Example 1:

+ +
+Input: num = "1101111"
+Output: [11,0,11,11]
+Explanation: The output [110, 1, 111] would also be accepted.
+
+ +

Example 2:

+ +
+Input: num = "112358130"
+Output: []
+Explanation: The task is impossible.
+
+ +

Example 3:

+ +
+Input: num = "0123"
+Output: []
+Explanation: Leading zeroes are not allowed, so "01", "2", "3" is not valid.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num.length <= 200
    • +
  • num contains only digits.
    • +
+",2.0,False,"class Solution { +public: + vector splitIntoFibonacci(string num) { + + } +};","class Solution { + public List splitIntoFibonacci(String num) { + + } +}","class Solution(object): + def splitIntoFibonacci(self, num): + """""" + :type num: str + :rtype: List[int] + """""" + ","class Solution: + def splitIntoFibonacci(self, num: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* splitIntoFibonacci(char * num, int* returnSize){ + +}","public class Solution { + public IList SplitIntoFibonacci(string num) { + + } +}","/** + * @param {string} num + * @return {number[]} + */ +var splitIntoFibonacci = function(num) { + +};","# @param {String} num +# @return {Integer[]} +def split_into_fibonacci(num) + +end","class Solution { + func splitIntoFibonacci(_ num: String) -> [Int] { + + } +}","func splitIntoFibonacci(num string) []int { + +}","object Solution { + def splitIntoFibonacci(num: String): List[Int] = { + + } +}","class Solution { + fun splitIntoFibonacci(num: String): List { + + } +}","impl Solution { + pub fn split_into_fibonacci(num: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $num + * @return Integer[] + */ + function splitIntoFibonacci($num) { + + } +}","function splitIntoFibonacci(num: string): number[] { + +};","(define/contract (split-into-fibonacci num) + (-> string? (listof exact-integer?)) + + )","-spec split_into_fibonacci(Num :: unicode:unicode_binary()) -> [integer()]. +split_into_fibonacci(Num) -> + .","defmodule Solution do + @spec split_into_fibonacci(num :: String.t) :: [integer] + def split_into_fibonacci(num) do + + end +end","class Solution { + List splitIntoFibonacci(String num) { + + } +}", +1490,magic-squares-in-grid,Magic Squares In Grid,840.0,870.0,"

A 3 x 3 magic square is a 3 x 3 grid filled with distinct numbers from 1 to 9 such that each row, column, and both diagonals all have the same sum.

+ +

Given a row x col grid of integers, how many 3 x 3 "magic square" subgrids are there?  (Each subgrid is contiguous).

+ +

 

+

Example 1:

+ +
+Input: grid = [[4,3,8,4],[9,5,1,9],[2,7,6,2]]
+Output: 1
+Explanation: 
+The following subgrid is a 3 x 3 magic square:
+
+while this one is not:
+
+In total, there is only one magic square inside the given grid.
+
+ +

Example 2:

+ +
+Input: grid = [[8]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • row == grid.length
    • +
  • col == grid[i].length
    • +
  • 1 <= row, col <= 10
    • +
  • 0 <= grid[i][j] <= 15
    • +
+",2.0,False,"class Solution { +public: + int numMagicSquaresInside(vector>& grid) { + + } +};","class Solution { + public int numMagicSquaresInside(int[][] grid) { + + } +}","class Solution(object): + def numMagicSquaresInside(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numMagicSquaresInside(self, grid: List[List[int]]) -> int: + ","int numMagicSquaresInside(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int NumMagicSquaresInside(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var numMagicSquaresInside = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def num_magic_squares_inside(grid) + +end","class Solution { + func numMagicSquaresInside(_ grid: [[Int]]) -> Int { + + } +}","func numMagicSquaresInside(grid [][]int) int { + +}","object Solution { + def numMagicSquaresInside(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numMagicSquaresInside(grid: Array): Int { + + } +}","impl Solution { + pub fn num_magic_squares_inside(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function numMagicSquaresInside($grid) { + + } +}","function numMagicSquaresInside(grid: number[][]): number { + +};","(define/contract (num-magic-squares-inside grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec num_magic_squares_inside(Grid :: [[integer()]]) -> integer(). +num_magic_squares_inside(Grid) -> + .","defmodule Solution do + @spec num_magic_squares_inside(grid :: [[integer]]) :: integer + def num_magic_squares_inside(grid) do + + end +end","class Solution { + int numMagicSquaresInside(List> grid) { + + } +}", +1491,similar-string-groups,Similar String Groups,839.0,869.0,"

Two strings, X and Y, are considered similar if either they are identical or we can make them equivalent by swapping at most two letters (in distinct positions) within the string X.

+ +

For example, "tars" and "rats" are similar (swapping at positions 0 and 2), and "rats" and "arts" are similar, but "star" is not similar to "tars", "rats", or "arts".

+ +

Together, these form two connected groups by similarity: {"tars", "rats", "arts"} and {"star"}.  Notice that "tars" and "arts" are in the same group even though they are not similar.  Formally, each group is such that a word is in the group if and only if it is similar to at least one other word in the group.

+ +

We are given a list strs of strings where every string in strs is an anagram of every other string in strs. How many groups are there?

+ +

 

+

Example 1:

+ +
+Input: strs = ["tars","rats","arts","star"]
+Output: 2
+
+ +

Example 2:

+ +
+Input: strs = ["omv","ovm"]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= strs.length <= 300
    • +
  • 1 <= strs[i].length <= 300
    • +
  • strs[i] consists of lowercase letters only.
    • +
  • All words in strs have the same length and are anagrams of each other.
    • +
+",3.0,False,"class Solution { +public: + int numSimilarGroups(vector& strs) { + + } +};","class Solution { + public int numSimilarGroups(String[] strs) { + + } +}","class Solution(object): + def numSimilarGroups(self, strs): + """""" + :type strs: List[str] + :rtype: int + """""" + ","class Solution: + def numSimilarGroups(self, strs: List[str]) -> int: + ","int numSimilarGroups(char ** strs, int strsSize){ + +}","public class Solution { + public int NumSimilarGroups(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {number} + */ +var numSimilarGroups = function(strs) { + +};","# @param {String[]} strs +# @return {Integer} +def num_similar_groups(strs) + +end","class Solution { + func numSimilarGroups(_ strs: [String]) -> Int { + + } +}","func numSimilarGroups(strs []string) int { + +}","object Solution { + def numSimilarGroups(strs: Array[String]): Int = { + + } +}","class Solution { + fun numSimilarGroups(strs: Array): Int { + + } +}","impl Solution { + pub fn num_similar_groups(strs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return Integer + */ + function numSimilarGroups($strs) { + + } +}","function numSimilarGroups(strs: string[]): number { + +};","(define/contract (num-similar-groups strs) + (-> (listof string?) exact-integer?) + + )","-spec num_similar_groups(Strs :: [unicode:unicode_binary()]) -> integer(). +num_similar_groups(Strs) -> + .","defmodule Solution do + @spec num_similar_groups(strs :: [String.t]) :: integer + def num_similar_groups(strs) do + + end +end","class Solution { + int numSimilarGroups(List strs) { + + } +}", +1493,new-21-game,New 21 Game,837.0,867.0,"

Alice plays the following game, loosely based on the card game "21".

+ +

Alice starts with 0 points and draws numbers while she has less than k points. During each draw, she gains an integer number of points randomly from the range [1, maxPts], where maxPts is an integer. Each draw is independent and the outcomes have equal probabilities.

+ +

Alice stops drawing numbers when she gets k or more points.

+ +

Return the probability that Alice has n or fewer points.

+ +

Answers within 10-5 of the actual answer are considered accepted.

+ +

 

+

Example 1:

+ +
+Input: n = 10, k = 1, maxPts = 10
+Output: 1.00000
+Explanation: Alice gets a single card, then stops.
+
+ +

Example 2:

+ +
+Input: n = 6, k = 1, maxPts = 10
+Output: 0.60000
+Explanation: Alice gets a single card, then stops.
+In 6 out of 10 possibilities, she is at or below 6 points.
+
+ +

Example 3:

+ +
+Input: n = 21, k = 17, maxPts = 10
+Output: 0.73278
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= k <= n <= 104
    • +
  • 1 <= maxPts <= 104
    • +
+",2.0,False,"class Solution { +public: + double new21Game(int n, int k, int maxPts) { + + } +};","class Solution { + public double new21Game(int n, int k, int maxPts) { + + } +}","class Solution(object): + def new21Game(self, n, k, maxPts): + """""" + :type n: int + :type k: int + :type maxPts: int + :rtype: float + """""" + ","class Solution: + def new21Game(self, n: int, k: int, maxPts: int) -> float: + ","double new21Game(int n, int k, int maxPts){ + +}","public class Solution { + public double New21Game(int n, int k, int maxPts) { + + } +}","/** + * @param {number} n + * @param {number} k + * @param {number} maxPts + * @return {number} + */ +var new21Game = function(n, k, maxPts) { + +};","# @param {Integer} n +# @param {Integer} k +# @param {Integer} max_pts +# @return {Float} +def new21_game(n, k, max_pts) + +end","class Solution { + func new21Game(_ n: Int, _ k: Int, _ maxPts: Int) -> Double { + + } +}","func new21Game(n int, k int, maxPts int) float64 { + +}","object Solution { + def new21Game(n: Int, k: Int, maxPts: Int): Double = { + + } +}","class Solution { + fun new21Game(n: Int, k: Int, maxPts: Int): Double { + + } +}","impl Solution { + pub fn new21_game(n: i32, k: i32, max_pts: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @param Integer $maxPts + * @return Float + */ + function new21Game($n, $k, $maxPts) { + + } +}","function new21Game(n: number, k: number, maxPts: number): number { + +};","(define/contract (new21-game n k maxPts) + (-> exact-integer? exact-integer? exact-integer? flonum?) + + )","-spec new21_game(N :: integer(), K :: integer(), MaxPts :: integer()) -> float(). +new21_game(N, K, MaxPts) -> + .","defmodule Solution do + @spec new21_game(n :: integer, k :: integer, max_pts :: integer) :: float + def new21_game(n, k, max_pts) do + + end +end","class Solution { + double new21Game(int n, int k, int maxPts) { + + } +}", +1495,image-overlap,Image Overlap,835.0,864.0,"

You are given two images, img1 and img2, represented as binary, square matrices of size n x n. A binary matrix has only 0s and 1s as values.

+ +

We translate one image however we choose by sliding all the 1 bits left, right, up, and/or down any number of units. We then place it on top of the other image. We can then calculate the overlap by counting the number of positions that have a 1 in both images.

+ +

Note also that a translation does not include any kind of rotation. Any 1 bits that are translated outside of the matrix borders are erased.

+ +

Return the largest possible overlap.

+ +

 

+

Example 1:

+ +
+Input: img1 = [[1,1,0],[0,1,0],[0,1,0]], img2 = [[0,0,0],[0,1,1],[0,0,1]]
+Output: 3
+Explanation: We translate img1 to right by 1 unit and down by 1 unit.
+
+The number of positions that have a 1 in both images is 3 (shown in red).
+
+
+ +

Example 2:

+ +
+Input: img1 = [[1]], img2 = [[1]]
+Output: 1
+
+ +

Example 3:

+ +
+Input: img1 = [[0]], img2 = [[0]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • n == img1.length == img1[i].length
    • +
  • n == img2.length == img2[i].length
    • +
  • 1 <= n <= 30
    • +
  • img1[i][j] is either 0 or 1.
    • +
  • img2[i][j] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int largestOverlap(vector>& img1, vector>& img2) { + + } +};","class Solution { + public int largestOverlap(int[][] img1, int[][] img2) { + + } +}","class Solution(object): + def largestOverlap(self, img1, img2): + """""" + :type img1: List[List[int]] + :type img2: List[List[int]] + :rtype: int + """""" + ","class Solution: + def largestOverlap(self, img1: List[List[int]], img2: List[List[int]]) -> int: + ","int largestOverlap(int** img1, int img1Size, int* img1ColSize, int** img2, int img2Size, int* img2ColSize){ + +}","public class Solution { + public int LargestOverlap(int[][] img1, int[][] img2) { + + } +}","/** + * @param {number[][]} img1 + * @param {number[][]} img2 + * @return {number} + */ +var largestOverlap = function(img1, img2) { + +};","# @param {Integer[][]} img1 +# @param {Integer[][]} img2 +# @return {Integer} +def largest_overlap(img1, img2) + +end","class Solution { + func largestOverlap(_ img1: [[Int]], _ img2: [[Int]]) -> Int { + + } +}","func largestOverlap(img1 [][]int, img2 [][]int) int { + +}","object Solution { + def largestOverlap(img1: Array[Array[Int]], img2: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun largestOverlap(img1: Array, img2: Array): Int { + + } +}","impl Solution { + pub fn largest_overlap(img1: Vec>, img2: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $img1 + * @param Integer[][] $img2 + * @return Integer + */ + function largestOverlap($img1, $img2) { + + } +}","function largestOverlap(img1: number[][], img2: number[][]): number { + +};","(define/contract (largest-overlap img1 img2) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) exact-integer?) + + )","-spec largest_overlap(Img1 :: [[integer()]], Img2 :: [[integer()]]) -> integer(). +largest_overlap(Img1, Img2) -> + .","defmodule Solution do + @spec largest_overlap(img1 :: [[integer]], img2 :: [[integer]]) :: integer + def largest_overlap(img1, img2) do + + end +end","class Solution { + int largestOverlap(List> img1, List> img2) { + + } +}", +1496,sum-of-distances-in-tree,Sum of Distances in Tree,834.0,863.0,"

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

+ +

You are given the integer n and the array edges where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Return an array answer of length n where answer[i] is the sum of the distances between the ith node in the tree and all other nodes.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[0,1],[0,2],[2,3],[2,4],[2,5]]
+Output: [8,12,6,10,10,10]
+Explanation: The tree is shown above.
+We can see that dist(0,1) + dist(0,2) + dist(0,3) + dist(0,4) + dist(0,5)
+equals 1 + 1 + 2 + 2 + 2 = 8.
+Hence, answer[0] = 8, and so on.
+
+ +

Example 2:

+ +
+Input: n = 1, edges = []
+Output: [0]
+
+ +

Example 3:

+ +
+Input: n = 2, edges = [[1,0]]
+Output: [1,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 3 * 104
    • +
  • edges.length == n - 1
    • +
  • edges[i].length == 2
    • +
  • 0 <= ai, bi < n
    • +
  • ai != bi
    • +
  • The given input represents a valid tree.
    • +
+",3.0,False,"class Solution { +public: + vector sumOfDistancesInTree(int n, vector>& edges) { + + } +};","class Solution { + public int[] sumOfDistancesInTree(int n, int[][] edges) { + + } +}","class Solution(object): + def sumOfDistancesInTree(self, n, edges): + """""" + :type n: int + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def sumOfDistancesInTree(self, n: int, edges: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* sumOfDistancesInTree(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public int[] SumOfDistancesInTree(int n, int[][] edges) { + + } +}","/** + * @param {number} n + * @param {number[][]} edges + * @return {number[]} + */ +var sumOfDistancesInTree = function(n, edges) { + +};","# @param {Integer} n +# @param {Integer[][]} edges +# @return {Integer[]} +def sum_of_distances_in_tree(n, edges) + +end","class Solution { + func sumOfDistancesInTree(_ n: Int, _ edges: [[Int]]) -> [Int] { + + } +}","func sumOfDistancesInTree(n int, edges [][]int) []int { + +}","object Solution { + def sumOfDistancesInTree(n: Int, edges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun sumOfDistancesInTree(n: Int, edges: Array): IntArray { + + } +}","impl Solution { + pub fn sum_of_distances_in_tree(n: i32, edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[][] $edges + * @return Integer[] + */ + function sumOfDistancesInTree($n, $edges) { + + } +}","function sumOfDistancesInTree(n: number, edges: number[][]): number[] { + +};","(define/contract (sum-of-distances-in-tree n edges) + (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec sum_of_distances_in_tree(N :: integer(), Edges :: [[integer()]]) -> [integer()]. +sum_of_distances_in_tree(N, Edges) -> + .","defmodule Solution do + @spec sum_of_distances_in_tree(n :: integer, edges :: [[integer]]) :: [integer] + def sum_of_distances_in_tree(n, edges) do + + end +end","class Solution { + List sumOfDistancesInTree(int n, List> edges) { + + } +}", +1497,find-and-replace-in-string,Find And Replace in String,833.0,862.0,"

You are given a 0-indexed string s that you must perform k replacement operations on. The replacement operations are given as three 0-indexed parallel arrays, indices, sources, and targets, all of length k.

+ +

To complete the ith replacement operation:

+ +
    +
  1. Check if the substring sources[i] occurs at index indices[i] in the original string s.
    2. +
  2. If it does not occur, do nothing.
    3. +
  3. Otherwise if it does occur, replace that substring with targets[i].
    4. +
+ +

For example, if s = "abcd", indices[i] = 0, sources[i] = "ab", and targets[i] = "eee", then the result of this replacement will be "eeecd".

+ +

All replacement operations must occur simultaneously, meaning the replacement operations should not affect the indexing of each other. The testcases will be generated such that the replacements will not overlap.

+ +
    +
  • For example, a testcase with s = "abc", indices = [0, 1], and sources = ["ab","bc"] will not be generated because the "ab" and "bc" replacements overlap.
    • +
+ +

Return the resulting string after performing all replacement operations on s.

+ +

A substring is a contiguous sequence of characters in a string.

+ +

 

+

Example 1:

+ +
+Input: s = "abcd", indices = [0, 2], sources = ["a", "cd"], targets = ["eee", "ffff"]
+Output: "eeebffff"
+Explanation:
+"a" occurs at index 0 in s, so we replace it with "eee".
+"cd" occurs at index 2 in s, so we replace it with "ffff".
+
+ +

Example 2:

+ +
+Input: s = "abcd", indices = [0, 2], sources = ["ab","ec"], targets = ["eee","ffff"]
+Output: "eeecd"
+Explanation:
+"ab" occurs at index 0 in s, so we replace it with "eee".
+"ec" does not occur at index 2 in s, so we do nothing.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • k == indices.length == sources.length == targets.length
    • +
  • 1 <= k <= 100
    • +
  • 0 <= indexes[i] < s.length
    • +
  • 1 <= sources[i].length, targets[i].length <= 50
    • +
  • s consists of only lowercase English letters.
    • +
  • sources[i] and targets[i] consist of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string findReplaceString(string s, vector& indices, vector& sources, vector& targets) { + + } +};","class Solution { + public String findReplaceString(String s, int[] indices, String[] sources, String[] targets) { + + } +}","class Solution(object): + def findReplaceString(self, s, indices, sources, targets): + """""" + :type s: str + :type indices: List[int] + :type sources: List[str] + :type targets: List[str] + :rtype: str + """""" + ","class Solution: + def findReplaceString(self, s: str, indices: List[int], sources: List[str], targets: List[str]) -> str: + ","char * findReplaceString(char * s, int* indices, int indicesSize, char ** sources, int sourcesSize, char ** targets, int targetsSize){ + +}","public class Solution { + public string FindReplaceString(string s, int[] indices, string[] sources, string[] targets) { + + } +}","/** + * @param {string} s + * @param {number[]} indices + * @param {string[]} sources + * @param {string[]} targets + * @return {string} + */ +var findReplaceString = function(s, indices, sources, targets) { + +};","# @param {String} s +# @param {Integer[]} indices +# @param {String[]} sources +# @param {String[]} targets +# @return {String} +def find_replace_string(s, indices, sources, targets) + +end","class Solution { + func findReplaceString(_ s: String, _ indices: [Int], _ sources: [String], _ targets: [String]) -> String { + + } +}","func findReplaceString(s string, indices []int, sources []string, targets []string) string { + +}","object Solution { + def findReplaceString(s: String, indices: Array[Int], sources: Array[String], targets: Array[String]): String = { + + } +}","class Solution { + fun findReplaceString(s: String, indices: IntArray, sources: Array, targets: Array): String { + + } +}","impl Solution { + pub fn find_replace_string(s: String, indices: Vec, sources: Vec, targets: Vec) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer[] $indices + * @param String[] $sources + * @param String[] $targets + * @return String + */ + function findReplaceString($s, $indices, $sources, $targets) { + + } +}","function findReplaceString(s: string, indices: number[], sources: string[], targets: string[]): string { + +};","(define/contract (find-replace-string s indices sources targets) + (-> string? (listof exact-integer?) (listof string?) (listof string?) string?) + + )","-spec find_replace_string(S :: unicode:unicode_binary(), Indices :: [integer()], Sources :: [unicode:unicode_binary()], Targets :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +find_replace_string(S, Indices, Sources, Targets) -> + .","defmodule Solution do + @spec find_replace_string(s :: String.t, indices :: [integer], sources :: [String.t], targets :: [String.t]) :: String.t + def find_replace_string(s, indices, sources, targets) do + + end +end","class Solution { + String findReplaceString(String s, List indices, List sources, List targets) { + + } +}", +1500,design-circular-deque,Design Circular Deque,641.0,859.0,"

Design your implementation of the circular double-ended queue (deque).

+ +

Implement the MyCircularDeque class:

+ +
    +
  • MyCircularDeque(int k) Initializes the deque with a maximum size of k.
    • +
  • boolean insertFront() Adds an item at the front of Deque. Returns true if the operation is successful, or false otherwise.
    • +
  • boolean insertLast() Adds an item at the rear of Deque. Returns true if the operation is successful, or false otherwise.
    • +
  • boolean deleteFront() Deletes an item from the front of Deque. Returns true if the operation is successful, or false otherwise.
    • +
  • boolean deleteLast() Deletes an item from the rear of Deque. Returns true if the operation is successful, or false otherwise.
    • +
  • int getFront() Returns the front item from the Deque. Returns -1 if the deque is empty.
    • +
  • int getRear() Returns the last item from Deque. Returns -1 if the deque is empty.
    • +
  • boolean isEmpty() Returns true if the deque is empty, or false otherwise.
    • +
  • boolean isFull() Returns true if the deque is full, or false otherwise.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MyCircularDeque", "insertLast", "insertLast", "insertFront", "insertFront", "getRear", "isFull", "deleteLast", "insertFront", "getFront"]
+[[3], [1], [2], [3], [4], [], [], [], [4], []]
+Output
+[null, true, true, true, false, 2, true, true, true, 4]
+
+Explanation
+MyCircularDeque myCircularDeque = new MyCircularDeque(3);
+myCircularDeque.insertLast(1);  // return True
+myCircularDeque.insertLast(2);  // return True
+myCircularDeque.insertFront(3); // return True
+myCircularDeque.insertFront(4); // return False, the queue is full.
+myCircularDeque.getRear();      // return 2
+myCircularDeque.isFull();       // return True
+myCircularDeque.deleteLast();   // return True
+myCircularDeque.insertFront(4); // return True
+myCircularDeque.getFront();     // return 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 1000
    • +
  • 0 <= value <= 1000
    • +
  • At most 2000 calls will be made to insertFront, insertLast, deleteFront, deleteLast, getFront, getRear, isEmpty, isFull.
    • +
+",2.0,False,"class MyCircularDeque { +public: + MyCircularDeque(int k) { + + } + + bool insertFront(int value) { + + } + + bool insertLast(int value) { + + } + + bool deleteFront() { + + } + + bool deleteLast() { + + } + + int getFront() { + + } + + int getRear() { + + } + + bool isEmpty() { + + } + + bool isFull() { + + } +}; + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * MyCircularDeque* obj = new MyCircularDeque(k); + * bool param_1 = obj->insertFront(value); + * bool param_2 = obj->insertLast(value); + * bool param_3 = obj->deleteFront(); + * bool param_4 = obj->deleteLast(); + * int param_5 = obj->getFront(); + * int param_6 = obj->getRear(); + * bool param_7 = obj->isEmpty(); + * bool param_8 = obj->isFull(); + */","class MyCircularDeque { + + public MyCircularDeque(int k) { + + } + + public boolean insertFront(int value) { + + } + + public boolean insertLast(int value) { + + } + + public boolean deleteFront() { + + } + + public boolean deleteLast() { + + } + + public int getFront() { + + } + + public int getRear() { + + } + + public boolean isEmpty() { + + } + + public boolean isFull() { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * MyCircularDeque obj = new MyCircularDeque(k); + * boolean param_1 = obj.insertFront(value); + * boolean param_2 = obj.insertLast(value); + * boolean param_3 = obj.deleteFront(); + * boolean param_4 = obj.deleteLast(); + * int param_5 = obj.getFront(); + * int param_6 = obj.getRear(); + * boolean param_7 = obj.isEmpty(); + * boolean param_8 = obj.isFull(); + */","class MyCircularDeque(object): + + def __init__(self, k): + """""" + :type k: int + """""" + + + def insertFront(self, value): + """""" + :type value: int + :rtype: bool + """""" + + + def insertLast(self, value): + """""" + :type value: int + :rtype: bool + """""" + + + def deleteFront(self): + """""" + :rtype: bool + """""" + + + def deleteLast(self): + """""" + :rtype: bool + """""" + + + def getFront(self): + """""" + :rtype: int + """""" + + + def getRear(self): + """""" + :rtype: int + """""" + + + def isEmpty(self): + """""" + :rtype: bool + """""" + + + def isFull(self): + """""" + :rtype: bool + """""" + + + +# Your MyCircularDeque object will be instantiated and called as such: +# obj = MyCircularDeque(k) +# param_1 = obj.insertFront(value) +# param_2 = obj.insertLast(value) +# param_3 = obj.deleteFront() +# param_4 = obj.deleteLast() +# param_5 = obj.getFront() +# param_6 = obj.getRear() +# param_7 = obj.isEmpty() +# param_8 = obj.isFull()","class MyCircularDeque: + + def __init__(self, k: int): + + + def insertFront(self, value: int) -> bool: + + + def insertLast(self, value: int) -> bool: + + + def deleteFront(self) -> bool: + + + def deleteLast(self) -> bool: + + + def getFront(self) -> int: + + + def getRear(self) -> int: + + + def isEmpty(self) -> bool: + + + def isFull(self) -> bool: + + + +# Your MyCircularDeque object will be instantiated and called as such: +# obj = MyCircularDeque(k) +# param_1 = obj.insertFront(value) +# param_2 = obj.insertLast(value) +# param_3 = obj.deleteFront() +# param_4 = obj.deleteLast() +# param_5 = obj.getFront() +# param_6 = obj.getRear() +# param_7 = obj.isEmpty() +# param_8 = obj.isFull()"," + + +typedef struct { + +} MyCircularDeque; + + +MyCircularDeque* myCircularDequeCreate(int k) { + +} + +bool myCircularDequeInsertFront(MyCircularDeque* obj, int value) { + +} + +bool myCircularDequeInsertLast(MyCircularDeque* obj, int value) { + +} + +bool myCircularDequeDeleteFront(MyCircularDeque* obj) { + +} + +bool myCircularDequeDeleteLast(MyCircularDeque* obj) { + +} + +int myCircularDequeGetFront(MyCircularDeque* obj) { + +} + +int myCircularDequeGetRear(MyCircularDeque* obj) { + +} + +bool myCircularDequeIsEmpty(MyCircularDeque* obj) { + +} + +bool myCircularDequeIsFull(MyCircularDeque* obj) { + +} + +void myCircularDequeFree(MyCircularDeque* obj) { + +} + +/** + * Your MyCircularDeque struct will be instantiated and called as such: + * MyCircularDeque* obj = myCircularDequeCreate(k); + * bool param_1 = myCircularDequeInsertFront(obj, value); + + * bool param_2 = myCircularDequeInsertLast(obj, value); + + * bool param_3 = myCircularDequeDeleteFront(obj); + + * bool param_4 = myCircularDequeDeleteLast(obj); + + * int param_5 = myCircularDequeGetFront(obj); + + * int param_6 = myCircularDequeGetRear(obj); + + * bool param_7 = myCircularDequeIsEmpty(obj); + + * bool param_8 = myCircularDequeIsFull(obj); + + * myCircularDequeFree(obj); +*/","public class MyCircularDeque { + + public MyCircularDeque(int k) { + + } + + public bool InsertFront(int value) { + + } + + public bool InsertLast(int value) { + + } + + public bool DeleteFront() { + + } + + public bool DeleteLast() { + + } + + public int GetFront() { + + } + + public int GetRear() { + + } + + public bool IsEmpty() { + + } + + public bool IsFull() { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * MyCircularDeque obj = new MyCircularDeque(k); + * bool param_1 = obj.InsertFront(value); + * bool param_2 = obj.InsertLast(value); + * bool param_3 = obj.DeleteFront(); + * bool param_4 = obj.DeleteLast(); + * int param_5 = obj.GetFront(); + * int param_6 = obj.GetRear(); + * bool param_7 = obj.IsEmpty(); + * bool param_8 = obj.IsFull(); + */","/** + * @param {number} k + */ +var MyCircularDeque = function(k) { + +}; + +/** + * @param {number} value + * @return {boolean} + */ +MyCircularDeque.prototype.insertFront = function(value) { + +}; + +/** + * @param {number} value + * @return {boolean} + */ +MyCircularDeque.prototype.insertLast = function(value) { + +}; + +/** + * @return {boolean} + */ +MyCircularDeque.prototype.deleteFront = function() { + +}; + +/** + * @return {boolean} + */ +MyCircularDeque.prototype.deleteLast = function() { + +}; + +/** + * @return {number} + */ +MyCircularDeque.prototype.getFront = function() { + +}; + +/** + * @return {number} + */ +MyCircularDeque.prototype.getRear = function() { + +}; + +/** + * @return {boolean} + */ +MyCircularDeque.prototype.isEmpty = function() { + +}; + +/** + * @return {boolean} + */ +MyCircularDeque.prototype.isFull = function() { + +}; + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * var obj = new MyCircularDeque(k) + * var param_1 = obj.insertFront(value) + * var param_2 = obj.insertLast(value) + * var param_3 = obj.deleteFront() + * var param_4 = obj.deleteLast() + * var param_5 = obj.getFront() + * var param_6 = obj.getRear() + * var param_7 = obj.isEmpty() + * var param_8 = obj.isFull() + */","class MyCircularDeque + +=begin + :type k: Integer +=end + def initialize(k) + + end + + +=begin + :type value: Integer + :rtype: Boolean +=end + def insert_front(value) + + end + + +=begin + :type value: Integer + :rtype: Boolean +=end + def insert_last(value) + + end + + +=begin + :rtype: Boolean +=end + def delete_front() + + end + + +=begin + :rtype: Boolean +=end + def delete_last() + + end + + +=begin + :rtype: Integer +=end + def get_front() + + end + + +=begin + :rtype: Integer +=end + def get_rear() + + end + + +=begin + :rtype: Boolean +=end + def is_empty() + + end + + +=begin + :rtype: Boolean +=end + def is_full() + + end + + +end + +# Your MyCircularDeque object will be instantiated and called as such: +# obj = MyCircularDeque.new(k) +# param_1 = obj.insert_front(value) +# param_2 = obj.insert_last(value) +# param_3 = obj.delete_front() +# param_4 = obj.delete_last() +# param_5 = obj.get_front() +# param_6 = obj.get_rear() +# param_7 = obj.is_empty() +# param_8 = obj.is_full()"," +class MyCircularDeque { + + init(_ k: Int) { + + } + + func insertFront(_ value: Int) -> Bool { + + } + + func insertLast(_ value: Int) -> Bool { + + } + + func deleteFront() -> Bool { + + } + + func deleteLast() -> Bool { + + } + + func getFront() -> Int { + + } + + func getRear() -> Int { + + } + + func isEmpty() -> Bool { + + } + + func isFull() -> Bool { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * let obj = MyCircularDeque(k) + * let ret_1: Bool = obj.insertFront(value) + * let ret_2: Bool = obj.insertLast(value) + * let ret_3: Bool = obj.deleteFront() + * let ret_4: Bool = obj.deleteLast() + * let ret_5: Int = obj.getFront() + * let ret_6: Int = obj.getRear() + * let ret_7: Bool = obj.isEmpty() + * let ret_8: Bool = obj.isFull() + */","type MyCircularDeque struct { + +} + + +func Constructor(k int) MyCircularDeque { + +} + + +func (this *MyCircularDeque) InsertFront(value int) bool { + +} + + +func (this *MyCircularDeque) InsertLast(value int) bool { + +} + + +func (this *MyCircularDeque) DeleteFront() bool { + +} + + +func (this *MyCircularDeque) DeleteLast() bool { + +} + + +func (this *MyCircularDeque) GetFront() int { + +} + + +func (this *MyCircularDeque) GetRear() int { + +} + + +func (this *MyCircularDeque) IsEmpty() bool { + +} + + +func (this *MyCircularDeque) IsFull() bool { + +} + + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * obj := Constructor(k); + * param_1 := obj.InsertFront(value); + * param_2 := obj.InsertLast(value); + * param_3 := obj.DeleteFront(); + * param_4 := obj.DeleteLast(); + * param_5 := obj.GetFront(); + * param_6 := obj.GetRear(); + * param_7 := obj.IsEmpty(); + * param_8 := obj.IsFull(); + */","class MyCircularDeque(_k: Int) { + + def insertFront(value: Int): Boolean = { + + } + + def insertLast(value: Int): Boolean = { + + } + + def deleteFront(): Boolean = { + + } + + def deleteLast(): Boolean = { + + } + + def getFront(): Int = { + + } + + def getRear(): Int = { + + } + + def isEmpty(): Boolean = { + + } + + def isFull(): Boolean = { + + } + +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * var obj = new MyCircularDeque(k) + * var param_1 = obj.insertFront(value) + * var param_2 = obj.insertLast(value) + * var param_3 = obj.deleteFront() + * var param_4 = obj.deleteLast() + * var param_5 = obj.getFront() + * var param_6 = obj.getRear() + * var param_7 = obj.isEmpty() + * var param_8 = obj.isFull() + */","class MyCircularDeque(k: Int) { + + fun insertFront(value: Int): Boolean { + + } + + fun insertLast(value: Int): Boolean { + + } + + fun deleteFront(): Boolean { + + } + + fun deleteLast(): Boolean { + + } + + fun getFront(): Int { + + } + + fun getRear(): Int { + + } + + fun isEmpty(): Boolean { + + } + + fun isFull(): Boolean { + + } + +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * var obj = MyCircularDeque(k) + * var param_1 = obj.insertFront(value) + * var param_2 = obj.insertLast(value) + * var param_3 = obj.deleteFront() + * var param_4 = obj.deleteLast() + * var param_5 = obj.getFront() + * var param_6 = obj.getRear() + * var param_7 = obj.isEmpty() + * var param_8 = obj.isFull() + */","struct MyCircularDeque { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MyCircularDeque { + + fn new(k: i32) -> Self { + + } + + fn insert_front(&self, value: i32) -> bool { + + } + + fn insert_last(&self, value: i32) -> bool { + + } + + fn delete_front(&self) -> bool { + + } + + fn delete_last(&self) -> bool { + + } + + fn get_front(&self) -> i32 { + + } + + fn get_rear(&self) -> i32 { + + } + + fn is_empty(&self) -> bool { + + } + + fn is_full(&self) -> bool { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * let obj = MyCircularDeque::new(k); + * let ret_1: bool = obj.insert_front(value); + * let ret_2: bool = obj.insert_last(value); + * let ret_3: bool = obj.delete_front(); + * let ret_4: bool = obj.delete_last(); + * let ret_5: i32 = obj.get_front(); + * let ret_6: i32 = obj.get_rear(); + * let ret_7: bool = obj.is_empty(); + * let ret_8: bool = obj.is_full(); + */","class MyCircularDeque { + /** + * @param Integer $k + */ + function __construct($k) { + + } + + /** + * @param Integer $value + * @return Boolean + */ + function insertFront($value) { + + } + + /** + * @param Integer $value + * @return Boolean + */ + function insertLast($value) { + + } + + /** + * @return Boolean + */ + function deleteFront() { + + } + + /** + * @return Boolean + */ + function deleteLast() { + + } + + /** + * @return Integer + */ + function getFront() { + + } + + /** + * @return Integer + */ + function getRear() { + + } + + /** + * @return Boolean + */ + function isEmpty() { + + } + + /** + * @return Boolean + */ + function isFull() { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * $obj = MyCircularDeque($k); + * $ret_1 = $obj->insertFront($value); + * $ret_2 = $obj->insertLast($value); + * $ret_3 = $obj->deleteFront(); + * $ret_4 = $obj->deleteLast(); + * $ret_5 = $obj->getFront(); + * $ret_6 = $obj->getRear(); + * $ret_7 = $obj->isEmpty(); + * $ret_8 = $obj->isFull(); + */","class MyCircularDeque { + constructor(k: number) { + + } + + insertFront(value: number): boolean { + + } + + insertLast(value: number): boolean { + + } + + deleteFront(): boolean { + + } + + deleteLast(): boolean { + + } + + getFront(): number { + + } + + getRear(): number { + + } + + isEmpty(): boolean { + + } + + isFull(): boolean { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * var obj = new MyCircularDeque(k) + * var param_1 = obj.insertFront(value) + * var param_2 = obj.insertLast(value) + * var param_3 = obj.deleteFront() + * var param_4 = obj.deleteLast() + * var param_5 = obj.getFront() + * var param_6 = obj.getRear() + * var param_7 = obj.isEmpty() + * var param_8 = obj.isFull() + */","(define my-circular-deque% + (class object% + (super-new) + + ; k : exact-integer? + (init-field + k) + + ; insert-front : exact-integer? -> boolean? + (define/public (insert-front value) + + ) + ; insert-last : exact-integer? -> boolean? + (define/public (insert-last value) + + ) + ; delete-front : -> boolean? + (define/public (delete-front) + + ) + ; delete-last : -> boolean? + (define/public (delete-last) + + ) + ; get-front : -> exact-integer? + (define/public (get-front) + + ) + ; get-rear : -> exact-integer? + (define/public (get-rear) + + ) + ; is-empty : -> boolean? + (define/public (is-empty) + + ) + ; is-full : -> boolean? + (define/public (is-full) + + ))) + +;; Your my-circular-deque% object will be instantiated and called as such: +;; (define obj (new my-circular-deque% [k k])) +;; (define param_1 (send obj insert-front value)) +;; (define param_2 (send obj insert-last value)) +;; (define param_3 (send obj delete-front)) +;; (define param_4 (send obj delete-last)) +;; (define param_5 (send obj get-front)) +;; (define param_6 (send obj get-rear)) +;; (define param_7 (send obj is-empty)) +;; (define param_8 (send obj is-full))","-spec my_circular_deque_init_(K :: integer()) -> any(). +my_circular_deque_init_(K) -> + . + +-spec my_circular_deque_insert_front(Value :: integer()) -> boolean(). +my_circular_deque_insert_front(Value) -> + . + +-spec my_circular_deque_insert_last(Value :: integer()) -> boolean(). +my_circular_deque_insert_last(Value) -> + . + +-spec my_circular_deque_delete_front() -> boolean(). +my_circular_deque_delete_front() -> + . + +-spec my_circular_deque_delete_last() -> boolean(). +my_circular_deque_delete_last() -> + . + +-spec my_circular_deque_get_front() -> integer(). +my_circular_deque_get_front() -> + . + +-spec my_circular_deque_get_rear() -> integer(). +my_circular_deque_get_rear() -> + . + +-spec my_circular_deque_is_empty() -> boolean(). +my_circular_deque_is_empty() -> + . + +-spec my_circular_deque_is_full() -> boolean(). +my_circular_deque_is_full() -> + . + + +%% Your functions will be called as such: +%% my_circular_deque_init_(K), +%% Param_1 = my_circular_deque_insert_front(Value), +%% Param_2 = my_circular_deque_insert_last(Value), +%% Param_3 = my_circular_deque_delete_front(), +%% Param_4 = my_circular_deque_delete_last(), +%% Param_5 = my_circular_deque_get_front(), +%% Param_6 = my_circular_deque_get_rear(), +%% Param_7 = my_circular_deque_is_empty(), +%% Param_8 = my_circular_deque_is_full(), + +%% my_circular_deque_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MyCircularDeque do + @spec init_(k :: integer) :: any + def init_(k) do + + end + + @spec insert_front(value :: integer) :: boolean + def insert_front(value) do + + end + + @spec insert_last(value :: integer) :: boolean + def insert_last(value) do + + end + + @spec delete_front() :: boolean + def delete_front() do + + end + + @spec delete_last() :: boolean + def delete_last() do + + end + + @spec get_front() :: integer + def get_front() do + + end + + @spec get_rear() :: integer + def get_rear() do + + end + + @spec is_empty() :: boolean + def is_empty() do + + end + + @spec is_full() :: boolean + def is_full() do + + end +end + +# Your functions will be called as such: +# MyCircularDeque.init_(k) +# param_1 = MyCircularDeque.insert_front(value) +# param_2 = MyCircularDeque.insert_last(value) +# param_3 = MyCircularDeque.delete_front() +# param_4 = MyCircularDeque.delete_last() +# param_5 = MyCircularDeque.get_front() +# param_6 = MyCircularDeque.get_rear() +# param_7 = MyCircularDeque.is_empty() +# param_8 = MyCircularDeque.is_full() + +# MyCircularDeque.init_ will be called before every test case, in which you can do some necessary initializations.","class MyCircularDeque { + + MyCircularDeque(int k) { + + } + + bool insertFront(int value) { + + } + + bool insertLast(int value) { + + } + + bool deleteFront() { + + } + + bool deleteLast() { + + } + + int getFront() { + + } + + int getRear() { + + } + + bool isEmpty() { + + } + + bool isFull() { + + } +} + +/** + * Your MyCircularDeque object will be instantiated and called as such: + * MyCircularDeque obj = MyCircularDeque(k); + * bool param1 = obj.insertFront(value); + * bool param2 = obj.insertLast(value); + * bool param3 = obj.deleteFront(); + * bool param4 = obj.deleteLast(); + * int param5 = obj.getFront(); + * int param6 = obj.getRear(); + * bool param7 = obj.isEmpty(); + * bool param8 = obj.isFull(); + */", +1502,positions-of-large-groups,Positions of Large Groups,830.0,857.0,"

In a string s of lowercase letters, these letters form consecutive groups of the same character.

+ +

For example, a string like s = "abbxxxxzyy" has the groups "a", "bb", "xxxx", "z", and "yy".

+ +

A group is identified by an interval [start, end], where start and end denote the start and end indices (inclusive) of the group. In the above example, "xxxx" has the interval [3,6].

+ +

A group is considered large if it has 3 or more characters.

+ +

Return the intervals of every large group sorted in increasing order by start index.

+ +

 

+

Example 1:

+ +
+Input: s = "abbxxxxzzy"
+Output: [[3,6]]
+Explanation: "xxxx" is the only large group with start index 3 and end index 6.
+
+ +

Example 2:

+ +
+Input: s = "abc"
+Output: []
+Explanation: We have groups "a", "b", and "c", none of which are large groups.
+
+ +

Example 3:

+ +
+Input: s = "abcdddeeeeaabbbcd"
+Output: [[3,5],[6,9],[12,14]]
+Explanation: The large groups are "ddd", "eeee", and "bbb".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s contains lowercase English letters only.
    • +
+",1.0,False,"class Solution { +public: + vector> largeGroupPositions(string s) { + + } +};","class Solution { + public List> largeGroupPositions(String s) { + + } +}","class Solution(object): + def largeGroupPositions(self, s): + """""" + :type s: str + :rtype: List[List[int]] + """""" + ","class Solution: + def largeGroupPositions(self, s: str) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** largeGroupPositions(char * s, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> LargeGroupPositions(string s) { + + } +}","/** + * @param {string} s + * @return {number[][]} + */ +var largeGroupPositions = function(s) { + +};","# @param {String} s +# @return {Integer[][]} +def large_group_positions(s) + +end","class Solution { + func largeGroupPositions(_ s: String) -> [[Int]] { + + } +}","func largeGroupPositions(s string) [][]int { + +}","object Solution { + def largeGroupPositions(s: String): List[List[Int]] = { + + } +}","class Solution { + fun largeGroupPositions(s: String): List> { + + } +}","impl Solution { + pub fn large_group_positions(s: String) -> Vec> { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer[][] + */ + function largeGroupPositions($s) { + + } +}","function largeGroupPositions(s: string): number[][] { + +};","(define/contract (large-group-positions s) + (-> string? (listof (listof exact-integer?))) + + )","-spec large_group_positions(S :: unicode:unicode_binary()) -> [[integer()]]. +large_group_positions(S) -> + .","defmodule Solution do + @spec large_group_positions(s :: String.t) :: [[integer]] + def large_group_positions(s) do + + end +end","class Solution { + List> largeGroupPositions(String s) { + + } +}", +1503,consecutive-numbers-sum,Consecutive Numbers Sum,829.0,856.0,"

Given an integer n, return the number of ways you can write n as the sum of consecutive positive integers.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 2
+Explanation: 5 = 2 + 3
+
+ +

Example 2:

+ +
+Input: n = 9
+Output: 3
+Explanation: 9 = 4 + 5 = 2 + 3 + 4
+
+ +

Example 3:

+ +
+Input: n = 15
+Output: 4
+Explanation: 15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int consecutiveNumbersSum(int n) { + + } +};","class Solution { + public int consecutiveNumbersSum(int n) { + + } +}","class Solution(object): + def consecutiveNumbersSum(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def consecutiveNumbersSum(self, n: int) -> int: + ","int consecutiveNumbersSum(int n){ + +}","public class Solution { + public int ConsecutiveNumbersSum(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var consecutiveNumbersSum = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def consecutive_numbers_sum(n) + +end","class Solution { + func consecutiveNumbersSum(_ n: Int) -> Int { + + } +}","func consecutiveNumbersSum(n int) int { + +}","object Solution { + def consecutiveNumbersSum(n: Int): Int = { + + } +}","class Solution { + fun consecutiveNumbersSum(n: Int): Int { + + } +}","impl Solution { + pub fn consecutive_numbers_sum(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function consecutiveNumbersSum($n) { + + } +}","function consecutiveNumbersSum(n: number): number { + +};","(define/contract (consecutive-numbers-sum n) + (-> exact-integer? exact-integer?) + + )","-spec consecutive_numbers_sum(N :: integer()) -> integer(). +consecutive_numbers_sum(N) -> + .","defmodule Solution do + @spec consecutive_numbers_sum(n :: integer) :: integer + def consecutive_numbers_sum(n) do + + end +end","class Solution { + int consecutiveNumbersSum(int n) { + + } +}", +1504,count-unique-characters-of-all-substrings-of-a-given-string,Count Unique Characters of All Substrings of a Given String,828.0,855.0,"

Let's define a function countUniqueChars(s) that returns the number of unique characters on s.

+ +
    +
  • For example, calling countUniqueChars(s) if s = "LEETCODE" then "L", "T", "C", "O", "D" are the unique characters since they appear only once in s, therefore countUniqueChars(s) = 5.
    • +
+ +

Given a string s, return the sum of countUniqueChars(t) where t is a substring of s. The test cases are generated such that the answer fits in a 32-bit integer.

+ +

Notice that some substrings can be repeated so in this case you have to count the repeated ones too.

+ +

 

+

Example 1:

+ +
+Input: s = "ABC"
+Output: 10
+Explanation: All possible substrings are: "A","B","C","AB","BC" and "ABC".
+Every substring is composed with only unique letters.
+Sum of lengths of all substring is 1 + 1 + 1 + 2 + 2 + 3 = 10
+
+ +

Example 2:

+ +
+Input: s = "ABA"
+Output: 8
+Explanation: The same as example 1, except countUniqueChars("ABA") = 1.
+
+ +

Example 3:

+ +
+Input: s = "LEETCODE"
+Output: 92
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of uppercase English letters only.
    • +
+",3.0,False,"class Solution { +public: + int uniqueLetterString(string s) { + + } +};","class Solution { + public int uniqueLetterString(String s) { + + } +}","class Solution(object): + def uniqueLetterString(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def uniqueLetterString(self, s: str) -> int: + ","int uniqueLetterString(char * s){ + +}","public class Solution { + public int UniqueLetterString(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var uniqueLetterString = function(s) { + +};","# @param {String} s +# @return {Integer} +def unique_letter_string(s) + +end","class Solution { + func uniqueLetterString(_ s: String) -> Int { + + } +}","func uniqueLetterString(s string) int { + +}","object Solution { + def uniqueLetterString(s: String): Int = { + + } +}","class Solution { + fun uniqueLetterString(s: String): Int { + + } +}","impl Solution { + pub fn unique_letter_string(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function uniqueLetterString($s) { + + } +}","function uniqueLetterString(s: string): number { + +};","(define/contract (unique-letter-string s) + (-> string? exact-integer?) + + )","-spec unique_letter_string(S :: unicode:unicode_binary()) -> integer(). +unique_letter_string(S) -> + .","defmodule Solution do + @spec unique_letter_string(s :: String.t) :: integer + def unique_letter_string(s) do + + end +end","class Solution { + int uniqueLetterString(String s) { + + } +}", +1505,making-a-large-island,Making A Large Island,827.0,854.0,"

You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1.

+ +

Return the size of the largest island in grid after applying this operation.

+ +

An island is a 4-directionally connected group of 1s.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,0],[0,1]]
+Output: 3
+Explanation: Change one 0 to 1 and connect two 1s, then we get an island with area = 3.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1],[1,0]]
+Output: 4
+Explanation: Change the 0 to 1 and make the island bigger, only one island with area = 4.
+ +

Example 3:

+ +
+Input: grid = [[1,1],[1,1]]
+Output: 4
+Explanation: Can't change any 0 to 1, only one island with area = 4.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= n <= 500
    • +
  • grid[i][j] is either 0 or 1.
    • +
",3.0,False,"class Solution { +public: + int largestIsland(vector>& grid) { + + } +};","class Solution { + public int largestIsland(int[][] grid) { + + } +}","class Solution(object): + def largestIsland(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def largestIsland(self, grid: List[List[int]]) -> int: + "," + +int largestIsland(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int LargestIsland(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var largestIsland = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def largest_island(grid) + +end","class Solution { + func largestIsland(_ grid: [[Int]]) -> Int { + + } +}","func largestIsland(grid [][]int) int { + +}","object Solution { + def largestIsland(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun largestIsland(grid: Array): Int { + + } +}","impl Solution { + pub fn largest_island(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function largestIsland($grid) { + + } +}","function largestIsland(grid: number[][]): number { + +};","(define/contract (largest-island grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )",,,, +1506,most-profit-assigning-work,Most Profit Assigning Work,826.0,853.0,"

You have n jobs and m workers. You are given three arrays: difficulty, profit, and worker where:

+ +
    +
  • difficulty[i] and profit[i] are the difficulty and the profit of the ith job, and
    • +
  • worker[j] is the ability of jth worker (i.e., the jth worker can only complete a job with difficulty at most worker[j]).
    • +
+ +

Every worker can be assigned at most one job, but one job can be completed multiple times.

+ +
    +
  • For example, if three workers attempt the same job that pays $1, then the total profit will be $3. If a worker cannot complete any job, their profit is $0.
    • +
+ +

Return the maximum profit we can achieve after assigning the workers to the jobs.

+ +

 

+

Example 1:

+ +
+Input: difficulty = [2,4,6,8,10], profit = [10,20,30,40,50], worker = [4,5,6,7]
+Output: 100
+Explanation: Workers are assigned jobs of difficulty [4,4,6,6] and they get a profit of [20,20,30,30] separately.
+
+ +

Example 2:

+ +
+Input: difficulty = [85,47,57], profit = [24,66,99], worker = [40,25,25]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • n == difficulty.length
    • +
  • n == profit.length
    • +
  • m == worker.length
    • +
  • 1 <= n, m <= 104
    • +
  • 1 <= difficulty[i], profit[i], worker[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + int maxProfitAssignment(vector& difficulty, vector& profit, vector& worker) { + + } +};","class Solution { + public int maxProfitAssignment(int[] difficulty, int[] profit, int[] worker) { + + } +}","class Solution(object): + def maxProfitAssignment(self, difficulty, profit, worker): + """""" + :type difficulty: List[int] + :type profit: List[int] + :type worker: List[int] + :rtype: int + """""" + ","class Solution: + def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int: + ","int maxProfitAssignment(int* difficulty, int difficultySize, int* profit, int profitSize, int* worker, int workerSize){ + +}","public class Solution { + public int MaxProfitAssignment(int[] difficulty, int[] profit, int[] worker) { + + } +}","/** + * @param {number[]} difficulty + * @param {number[]} profit + * @param {number[]} worker + * @return {number} + */ +var maxProfitAssignment = function(difficulty, profit, worker) { + +};","# @param {Integer[]} difficulty +# @param {Integer[]} profit +# @param {Integer[]} worker +# @return {Integer} +def max_profit_assignment(difficulty, profit, worker) + +end","class Solution { + func maxProfitAssignment(_ difficulty: [Int], _ profit: [Int], _ worker: [Int]) -> Int { + + } +}","func maxProfitAssignment(difficulty []int, profit []int, worker []int) int { + +}","object Solution { + def maxProfitAssignment(difficulty: Array[Int], profit: Array[Int], worker: Array[Int]): Int = { + + } +}","class Solution { + fun maxProfitAssignment(difficulty: IntArray, profit: IntArray, worker: IntArray): Int { + + } +}","impl Solution { + pub fn max_profit_assignment(difficulty: Vec, profit: Vec, worker: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $difficulty + * @param Integer[] $profit + * @param Integer[] $worker + * @return Integer + */ + function maxProfitAssignment($difficulty, $profit, $worker) { + + } +}","function maxProfitAssignment(difficulty: number[], profit: number[], worker: number[]): number { + +};",,"-spec max_profit_assignment(Difficulty :: [integer()], Profit :: [integer()], Worker :: [integer()]) -> integer(). +max_profit_assignment(Difficulty, Profit, Worker) -> + .","defmodule Solution do + @spec max_profit_assignment(difficulty :: [integer], profit :: [integer], worker :: [integer]) :: integer + def max_profit_assignment(difficulty, profit, worker) do + + end +end","class Solution { + int maxProfitAssignment(List difficulty, List profit, List worker) { + + } +}", +1509,binary-trees-with-factors,Binary Trees With Factors,823.0,843.0,"

Given an array of unique integers, arr, where each integer arr[i] is strictly greater than 1.

+ +

We make a binary tree using these integers, and each number may be used for any number of times. Each non-leaf node's value should be equal to the product of the values of its children.

+ +

Return the number of binary trees we can make. The answer may be too large so return the answer modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: arr = [2,4]
+Output: 3
+Explanation: We can make these trees: [2], [4], [4, 2, 2]
+ +

Example 2:

+ +
+Input: arr = [2,4,5,10]
+Output: 7
+Explanation: We can make these trees: [2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2].
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 1000
    • +
  • 2 <= arr[i] <= 109
    • +
  • All the values of arr are unique.
    • +
+",2.0,False,"class Solution { +public: + int numFactoredBinaryTrees(vector& arr) { + + } +};","class Solution { + public int numFactoredBinaryTrees(int[] arr) { + + } +}","class Solution(object): + def numFactoredBinaryTrees(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def numFactoredBinaryTrees(self, arr: List[int]) -> int: + ","int numFactoredBinaryTrees(int* arr, int arrSize){ + +}","public class Solution { + public int NumFactoredBinaryTrees(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var numFactoredBinaryTrees = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def num_factored_binary_trees(arr) + +end","class Solution { + func numFactoredBinaryTrees(_ arr: [Int]) -> Int { + + } +}","func numFactoredBinaryTrees(arr []int) int { + +}","object Solution { + def numFactoredBinaryTrees(arr: Array[Int]): Int = { + + } +}","class Solution { + fun numFactoredBinaryTrees(arr: IntArray): Int { + + } +}","impl Solution { + pub fn num_factored_binary_trees(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function numFactoredBinaryTrees($arr) { + + } +}","function numFactoredBinaryTrees(arr: number[]): number { + +};","(define/contract (num-factored-binary-trees arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec num_factored_binary_trees(Arr :: [integer()]) -> integer(). +num_factored_binary_trees(Arr) -> + .","defmodule Solution do + @spec num_factored_binary_trees(arr :: [integer]) :: integer + def num_factored_binary_trees(arr) do + + end +end","class Solution { + int numFactoredBinaryTrees(List arr) { + + } +}", +1512,short-encoding-of-words,Short Encoding of Words,820.0,839.0,"

A valid encoding of an array of words is any reference string s and array of indices indices such that:

+ +
    +
  • words.length == indices.length
    • +
  • The reference string s ends with the '#' character.
    • +
  • For each index indices[i], the substring of s starting from indices[i] and up to (but not including) the next '#' character is equal to words[i].
    • +
+ +

Given an array of words, return the length of the shortest reference string s possible of any valid encoding of words.

+ +

 

+

Example 1:

+ +
+Input: words = ["time", "me", "bell"]
+Output: 10
+Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
+words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
+words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
+words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"
+
+ +

Example 2:

+ +
+Input: words = ["t"]
+Output: 2
+Explanation: A valid encoding would be s = "t#" and indices = [0].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 2000
    • +
  • 1 <= words[i].length <= 7
    • +
  • words[i] consists of only lowercase letters.
    • +
+",2.0,False,"class Solution { +public: + int minimumLengthEncoding(vector& words) { + + } +};","class Solution { + public int minimumLengthEncoding(String[] words) { + + } +}","class Solution(object): + def minimumLengthEncoding(self, words): + """""" + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def minimumLengthEncoding(self, words: List[str]) -> int: + ","int minimumLengthEncoding(char ** words, int wordsSize){ + +}","public class Solution { + public int MinimumLengthEncoding(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number} + */ +var minimumLengthEncoding = function(words) { + +};","# @param {String[]} words +# @return {Integer} +def minimum_length_encoding(words) + +end","class Solution { + func minimumLengthEncoding(_ words: [String]) -> Int { + + } +}","func minimumLengthEncoding(words []string) int { + +}","object Solution { + def minimumLengthEncoding(words: Array[String]): Int = { + + } +}","class Solution { + fun minimumLengthEncoding(words: Array): Int { + + } +}","impl Solution { + pub fn minimum_length_encoding(words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer + */ + function minimumLengthEncoding($words) { + + } +}","function minimumLengthEncoding(words: string[]): number { + +};","(define/contract (minimum-length-encoding words) + (-> (listof string?) exact-integer?) + + )","-spec minimum_length_encoding(Words :: [unicode:unicode_binary()]) -> integer(). +minimum_length_encoding(Words) -> + .","defmodule Solution do + @spec minimum_length_encoding(words :: [String.t]) :: integer + def minimum_length_encoding(words) do + + end +end","class Solution { + int minimumLengthEncoding(List words) { + + } +}", +1515,race-car,Race Car,818.0,836.0,"

Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into negative positions. Your car drives automatically according to a sequence of instructions 'A' (accelerate) and 'R' (reverse):

+ +
    +
  • When you get an instruction 'A', your car does the following: + +
      +
    • position += speed
      • +
    • speed *= 2
      • +
    +
    • +
  • When you get an instruction 'R', your car does the following: +
      +
    • If your speed is positive then speed = -1
      • +
    • otherwise speed = 1
      • +
    + Your position stays the same.
    • +
+ +

For example, after commands "AAR", your car goes to positions 0 --> 1 --> 3 --> 3, and your speed goes to 1 --> 2 --> 4 --> -1.

+ +

Given a target position target, return the length of the shortest sequence of instructions to get there.

+ +

 

+

Example 1:

+ +
+Input: target = 3
+Output: 2
+Explanation: 
+The shortest instruction sequence is "AA".
+Your position goes from 0 --> 1 --> 3.
+
+ +

Example 2:

+ +
+Input: target = 6
+Output: 5
+Explanation: 
+The shortest instruction sequence is "AAARA".
+Your position goes from 0 --> 1 --> 3 --> 7 --> 7 --> 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target <= 104
    • +
+",3.0,False,"class Solution { +public: + int racecar(int target) { + + } +};","class Solution { + public int racecar(int target) { + + } +}","class Solution(object): + def racecar(self, target): + """""" + :type target: int + :rtype: int + """""" + ","class Solution: + def racecar(self, target: int) -> int: + ","int racecar(int target){ + +}","public class Solution { + public int Racecar(int target) { + + } +}","/** + * @param {number} target + * @return {number} + */ +var racecar = function(target) { + +};","# @param {Integer} target +# @return {Integer} +def racecar(target) + +end","class Solution { + func racecar(_ target: Int) -> Int { + + } +}","func racecar(target int) int { + +}","object Solution { + def racecar(target: Int): Int = { + + } +}","class Solution { + fun racecar(target: Int): Int { + + } +}","impl Solution { + pub fn racecar(target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $target + * @return Integer + */ + function racecar($target) { + + } +}","function racecar(target: number): number { + +};","(define/contract (racecar target) + (-> exact-integer? exact-integer?) + + )","-spec racecar(Target :: integer()) -> integer(). +racecar(Target) -> + .","defmodule Solution do + @spec racecar(target :: integer) :: integer + def racecar(target) do + + end +end","class Solution { + int racecar(int target) { + + } +}", +1518,bus-routes,Bus Routes,815.0,833.0,"

You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.

+ +
    +
  • For example, if routes[0] = [1, 5, 7], this means that the 0th bus travels in the sequence 1 -> 5 -> 7 -> 1 -> 5 -> 7 -> 1 -> ... forever.
    • +
+ +

You will start at the bus stop source (You are not on any bus initially), and you want to go to the bus stop target. You can travel between bus stops by buses only.

+ +

Return the least number of buses you must take to travel from source to target. Return -1 if it is not possible.

+ +

 

+

Example 1:

+ +
+Input: routes = [[1,2,7],[3,6,7]], source = 1, target = 6
+Output: 2
+Explanation: The best strategy is take the first bus to the bus stop 7, then take the second bus to the bus stop 6.
+
+ +

Example 2:

+ +
+Input: routes = [[7,12],[4,5,15],[6],[15,19],[9,12,13]], source = 15, target = 12
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= routes.length <= 500.
    • +
  • 1 <= routes[i].length <= 105
    • +
  • All the values of routes[i] are unique.
    • +
  • sum(routes[i].length) <= 105
    • +
  • 0 <= routes[i][j] < 106
    • +
  • 0 <= source, target < 106
    • +
+",3.0,False,"class Solution { +public: + int numBusesToDestination(vector>& routes, int source, int target) { + + } +};","class Solution { + public int numBusesToDestination(int[][] routes, int source, int target) { + + } +}","class Solution(object): + def numBusesToDestination(self, routes, source, target): + """""" + :type routes: List[List[int]] + :type source: int + :type target: int + :rtype: int + """""" + ","class Solution: + def numBusesToDestination(self, routes: List[List[int]], source: int, target: int) -> int: + ","int numBusesToDestination(int** routes, int routesSize, int* routesColSize, int source, int target){ + +}","public class Solution { + public int NumBusesToDestination(int[][] routes, int source, int target) { + + } +}","/** + * @param {number[][]} routes + * @param {number} source + * @param {number} target + * @return {number} + */ +var numBusesToDestination = function(routes, source, target) { + +};","# @param {Integer[][]} routes +# @param {Integer} source +# @param {Integer} target +# @return {Integer} +def num_buses_to_destination(routes, source, target) + +end","class Solution { + func numBusesToDestination(_ routes: [[Int]], _ source: Int, _ target: Int) -> Int { + + } +}","func numBusesToDestination(routes [][]int, source int, target int) int { + +}","object Solution { + def numBusesToDestination(routes: Array[Array[Int]], source: Int, target: Int): Int = { + + } +}","class Solution { + fun numBusesToDestination(routes: Array, source: Int, target: Int): Int { + + } +}","impl Solution { + pub fn num_buses_to_destination(routes: Vec>, source: i32, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $routes + * @param Integer $source + * @param Integer $target + * @return Integer + */ + function numBusesToDestination($routes, $source, $target) { + + } +}","function numBusesToDestination(routes: number[][], source: number, target: number): number { + +};","(define/contract (num-buses-to-destination routes source target) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec num_buses_to_destination(Routes :: [[integer()]], Source :: integer(), Target :: integer()) -> integer(). +num_buses_to_destination(Routes, Source, Target) -> + .","defmodule Solution do + @spec num_buses_to_destination(routes :: [[integer]], source :: integer, target :: integer) :: integer + def num_buses_to_destination(routes, source, target) do + + end +end","class Solution { + int numBusesToDestination(List> routes, int source, int target) { + + } +}", +1520,largest-sum-of-averages,Largest Sum of Averages,813.0,831.0,"

You are given an integer array nums and an integer k. You can partition the array into at most k non-empty adjacent subarrays. The score of a partition is the sum of the averages of each subarray.

+ +

Note that the partition must use every integer in nums, and that the score is not necessarily an integer.

+ +

Return the maximum score you can achieve of all the possible partitions. Answers within 10-6 of the actual answer will be accepted.

+ +

 

+

Example 1:

+ +
+Input: nums = [9,1,2,3,9], k = 3
+Output: 20.00000
+Explanation: 
+The best choice is to partition nums into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.
+We could have also partitioned nums into [9, 1], [2], [3, 9], for example.
+That partition would lead to a score of 5 + 2 + 6 = 13, which is worse.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,5,6,7], k = 4
+Output: 20.50000
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 1 <= nums[i] <= 104
    • +
  • 1 <= k <= nums.length
    • +
+",2.0,False,"class Solution { +public: + double largestSumOfAverages(vector& nums, int k) { + + } +};","class Solution { + public double largestSumOfAverages(int[] nums, int k) { + + } +}","class Solution(object): + def largestSumOfAverages(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: float + """""" + ","class Solution: + def largestSumOfAverages(self, nums: List[int], k: int) -> float: + ","double largestSumOfAverages(int* nums, int numsSize, int k){ + +}","public class Solution { + public double LargestSumOfAverages(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var largestSumOfAverages = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Float} +def largest_sum_of_averages(nums, k) + +end","class Solution { + func largestSumOfAverages(_ nums: [Int], _ k: Int) -> Double { + + } +}","func largestSumOfAverages(nums []int, k int) float64 { + +}","object Solution { + def largestSumOfAverages(nums: Array[Int], k: Int): Double = { + + } +}","class Solution { + fun largestSumOfAverages(nums: IntArray, k: Int): Double { + + } +}","impl Solution { + pub fn largest_sum_of_averages(nums: Vec, k: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Float + */ + function largestSumOfAverages($nums, $k) { + + } +}","function largestSumOfAverages(nums: number[], k: number): number { + +};","(define/contract (largest-sum-of-averages nums k) + (-> (listof exact-integer?) exact-integer? flonum?) + + )","-spec largest_sum_of_averages(Nums :: [integer()], K :: integer()) -> float(). +largest_sum_of_averages(Nums, K) -> + .","defmodule Solution do + @spec largest_sum_of_averages(nums :: [integer], k :: integer) :: float + def largest_sum_of_averages(nums, k) do + + end +end","class Solution { + double largestSumOfAverages(List nums, int k) { + + } +}", +1522,subdomain-visit-count,Subdomain Visit Count,811.0,829.0,"

A website domain "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com" and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly.

+ +

A count-paired domain is a domain that has one of the two formats "rep d1.d2.d3" or "rep d1.d2" where rep is the number of visits to the domain and d1.d2.d3 is the domain itself.

+ +
    +
  • For example, "9001 discuss.leetcode.com" is a count-paired domain that indicates that discuss.leetcode.com was visited 9001 times.
    • +
+ +

Given an array of count-paired domains cpdomains, return an array of the count-paired domains of each subdomain in the input. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: cpdomains = ["9001 discuss.leetcode.com"]
+Output: ["9001 leetcode.com","9001 discuss.leetcode.com","9001 com"]
+Explanation: We only have one website domain: "discuss.leetcode.com".
+As discussed above, the subdomain "leetcode.com" and "com" will also be visited. So they will all be visited 9001 times.
+
+ +

Example 2:

+ +
+Input: cpdomains = ["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]
+Output: ["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]
+Explanation: We will visit "google.mail.com" 900 times, "yahoo.com" 50 times, "intel.mail.com" once and "wiki.org" 5 times.
+For the subdomains, we will visit "mail.com" 900 + 1 = 901 times, "com" 900 + 50 + 1 = 951 times, and "org" 5 times.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= cpdomain.length <= 100
    • +
  • 1 <= cpdomain[i].length <= 100
    • +
  • cpdomain[i] follows either the "repi d1i.d2i.d3i" format or the "repi d1i.d2i" format.
    • +
  • repi is an integer in the range [1, 104].
    • +
  • d1i, d2i, and d3i consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector subdomainVisits(vector& cpdomains) { + + } +};","class Solution { + public List subdomainVisits(String[] cpdomains) { + + } +}","class Solution(object): + def subdomainVisits(self, cpdomains): + """""" + :type cpdomains: List[str] + :rtype: List[str] + """""" + ","class Solution: + def subdomainVisits(self, cpdomains: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** subdomainVisits(char ** cpdomains, int cpdomainsSize, int* returnSize){ + +}","public class Solution { + public IList SubdomainVisits(string[] cpdomains) { + + } +}","/** + * @param {string[]} cpdomains + * @return {string[]} + */ +var subdomainVisits = function(cpdomains) { + +};","# @param {String[]} cpdomains +# @return {String[]} +def subdomain_visits(cpdomains) + +end","class Solution { + func subdomainVisits(_ cpdomains: [String]) -> [String] { + + } +}","func subdomainVisits(cpdomains []string) []string { + +}","object Solution { + def subdomainVisits(cpdomains: Array[String]): List[String] = { + + } +}","class Solution { + fun subdomainVisits(cpdomains: Array): List { + + } +}","impl Solution { + pub fn subdomain_visits(cpdomains: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $cpdomains + * @return String[] + */ + function subdomainVisits($cpdomains) { + + } +}","function subdomainVisits(cpdomains: string[]): string[] { + +};","(define/contract (subdomain-visits cpdomains) + (-> (listof string?) (listof string?)) + + )","-spec subdomain_visits(Cpdomains :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +subdomain_visits(Cpdomains) -> + .","defmodule Solution do + @spec subdomain_visits(cpdomains :: [String.t]) :: [String.t] + def subdomain_visits(cpdomains) do + + end +end","class Solution { + List subdomainVisits(List cpdomains) { + + } +}", +1523,chalkboard-xor-game,Chalkboard XOR Game,810.0,828.0,"

You are given an array of integers nums represents the numbers written on a chalkboard.

+ +

Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses. The bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.

+ +

Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.

+ +

Return true if and only if Alice wins the game, assuming both players play optimally.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,2]
+Output: false
+Explanation: 
+Alice has two choices: erase 1 or erase 2. 
+If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose. 
+If Alice erases 2 first, now nums become [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.
+
+ +

Example 2:

+ +
+Input: nums = [0,1]
+Output: true
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3]
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] < 216
    • +
+",3.0,False,"class Solution { +public: + bool xorGame(vector& nums) { + + } +};","class Solution { + public boolean xorGame(int[] nums) { + + } +}","class Solution(object): + def xorGame(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def xorGame(self, nums: List[int]) -> bool: + ","bool xorGame(int* nums, int numsSize){ + +}","public class Solution { + public bool XorGame(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var xorGame = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def xor_game(nums) + +end","class Solution { + func xorGame(_ nums: [Int]) -> Bool { + + } +}","func xorGame(nums []int) bool { + +}","object Solution { + def xorGame(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun xorGame(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn xor_game(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function xorGame($nums) { + + } +}","function xorGame(nums: number[]): boolean { + +};","(define/contract (xor-game nums) + (-> (listof exact-integer?) boolean?) + + )","-spec xor_game(Nums :: [integer()]) -> boolean(). +xor_game(Nums) -> + .","defmodule Solution do + @spec xor_game(nums :: [integer]) :: boolean + def xor_game(nums) do + + end +end","class Solution { + bool xorGame(List nums) { + + } +}", +1524,expressive-words,Expressive Words,809.0,827.0,"

Sometimes people repeat letters to represent extra feeling. For example:

+ +
    +
  • "hello" -> "heeellooo"
    • +
  • "hi" -> "hiiii"
    • +
+ +

In these strings like "heeellooo", we have groups of adjacent letters that are all the same: "h", "eee", "ll", "ooo".

+ +

You are given a string s and an array of query strings words. A query word is stretchy if it can be made to be equal to s by any number of applications of the following extension operation: choose a group consisting of characters c, and add some number of characters c to the group so that the size of the group is three or more.

+ +
    +
  • For example, starting with "hello", we could do an extension on the group "o" to get "hellooo", but we cannot get "helloo" since the group "oo" has a size less than three. Also, we could do another extension like "ll" -> "lllll" to get "helllllooo". If s = "helllllooo", then the query word "hello" would be stretchy because of these two extension operations: query = "hello" -> "hellooo" -> "helllllooo" = s.
    • +
+ +

Return the number of query strings that are stretchy.

+ +

 

+

Example 1:

+ +
+Input: s = "heeellooo", words = ["hello", "hi", "helo"]
+Output: 1
+Explanation: 
+We can extend "e" and "o" in the word "hello" to get "heeellooo".
+We can't extend "helo" to get "heeellooo" because the group "ll" is not size 3 or more.
+
+ +

Example 2:

+ +
+Input: s = "zzzzzyyyyy", words = ["zzyy","zy","zyy"]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, words.length <= 100
    • +
  • 1 <= words[i].length <= 100
    • +
  • s and words[i] consist of lowercase letters.
    • +
+",2.0,False,"class Solution { +public: + int expressiveWords(string s, vector& words) { + + } +};","class Solution { + public int expressiveWords(String s, String[] words) { + + } +}","class Solution(object): + def expressiveWords(self, s, words): + """""" + :type s: str + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def expressiveWords(self, s: str, words: List[str]) -> int: + ","int expressiveWords(char * s, char ** words, int wordsSize){ + +}","public class Solution { + public int ExpressiveWords(string s, string[] words) { + + } +}","/** + * @param {string} s + * @param {string[]} words + * @return {number} + */ +var expressiveWords = function(s, words) { + +};","# @param {String} s +# @param {String[]} words +# @return {Integer} +def expressive_words(s, words) + +end","class Solution { + func expressiveWords(_ s: String, _ words: [String]) -> Int { + + } +}","func expressiveWords(s string, words []string) int { + +}","object Solution { + def expressiveWords(s: String, words: Array[String]): Int = { + + } +}","class Solution { + fun expressiveWords(s: String, words: Array): Int { + + } +}","impl Solution { + pub fn expressive_words(s: String, words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $words + * @return Integer + */ + function expressiveWords($s, $words) { + + } +}","function expressiveWords(s: string, words: string[]): number { + +};","(define/contract (expressive-words s words) + (-> string? (listof string?) exact-integer?) + + )","-spec expressive_words(S :: unicode:unicode_binary(), Words :: [unicode:unicode_binary()]) -> integer(). +expressive_words(S, Words) -> + .","defmodule Solution do + @spec expressive_words(s :: String.t, words :: [String.t]) :: integer + def expressive_words(s, words) do + + end +end","class Solution { + int expressiveWords(String s, List words) { + + } +}", +1526,max-increase-to-keep-city-skyline,Max Increase to Keep City Skyline,807.0,825.0,"

There is a city composed of n x n blocks, where each block contains a single building shaped like a vertical square prism. You are given a 0-indexed n x n integer matrix grid where grid[r][c] represents the height of the building located in the block at row r and column c.

+ +

A city's skyline is the outer contour formed by all the building when viewing the side of the city from a distance. The skyline from each cardinal direction north, east, south, and west may be different.

+ +

We are allowed to increase the height of any number of buildings by any amount (the amount can be different per building). The height of a 0-height building can also be increased. However, increasing the height of a building should not affect the city's skyline from any cardinal direction.

+ +

Return the maximum total sum that the height of the buildings can be increased by without changing the city's skyline from any cardinal direction.

+ +

 

+

Example 1:

+ +
+Input: grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]]
+Output: 35
+Explanation: The building heights are shown in the center of the above image.
+The skylines when viewed from each cardinal direction are drawn in red.
+The grid after increasing the height of buildings without affecting skylines is:
+gridNew = [ [8, 4, 8, 7],
+            [7, 4, 7, 7],
+            [9, 4, 8, 7],
+            [3, 3, 3, 3] ]
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,0],[0,0,0],[0,0,0]]
+Output: 0
+Explanation: Increasing the height of any building will result in the skyline changing.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • n == grid[r].length
    • +
  • 2 <= n <= 50
    • +
  • 0 <= grid[r][c] <= 100
    • +
+",2.0,False,"class Solution { +public: + int maxIncreaseKeepingSkyline(vector>& grid) { + + } +};","class Solution { + public int maxIncreaseKeepingSkyline(int[][] grid) { + + } +}","class Solution(object): + def maxIncreaseKeepingSkyline(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int: + ","int maxIncreaseKeepingSkyline(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaxIncreaseKeepingSkyline(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maxIncreaseKeepingSkyline = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def max_increase_keeping_skyline(grid) + +end","class Solution { + func maxIncreaseKeepingSkyline(_ grid: [[Int]]) -> Int { + + } +}","func maxIncreaseKeepingSkyline(grid [][]int) int { + +}","object Solution { + def maxIncreaseKeepingSkyline(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxIncreaseKeepingSkyline(grid: Array): Int { + + } +}","impl Solution { + pub fn max_increase_keeping_skyline(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maxIncreaseKeepingSkyline($grid) { + + } +}","function maxIncreaseKeepingSkyline(grid: number[][]): number { + +};","(define/contract (max-increase-keeping-skyline grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_increase_keeping_skyline(Grid :: [[integer()]]) -> integer(). +max_increase_keeping_skyline(Grid) -> + .","defmodule Solution do + @spec max_increase_keeping_skyline(grid :: [[integer]]) :: integer + def max_increase_keeping_skyline(grid) do + + end +end","class Solution { + int maxIncreaseKeepingSkyline(List> grid) { + + } +}", +1528,split-array-with-same-average,Split Array With Same Average,805.0,823.0,"

You are given an integer array nums.

+ +

You should move each element of nums into one of the two arrays A and B such that A and B are non-empty, and average(A) == average(B).

+ +

Return true if it is possible to achieve that and false otherwise.

+ +

Note that for an array arr, average(arr) is the sum of all the elements of arr over the length of arr.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5,6,7,8]
+Output: true
+Explanation: We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have an average of 4.5.
+
+ +

Example 2:

+ +
+Input: nums = [3,1]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 30
    • +
  • 0 <= nums[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + bool splitArraySameAverage(vector& nums) { + + } +};","class Solution { + public boolean splitArraySameAverage(int[] nums) { + + } +}","class Solution(object): + def splitArraySameAverage(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def splitArraySameAverage(self, nums: List[int]) -> bool: + ","bool splitArraySameAverage(int* nums, int numsSize){ + +}","public class Solution { + public bool SplitArraySameAverage(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var splitArraySameAverage = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def split_array_same_average(nums) + +end","class Solution { + func splitArraySameAverage(_ nums: [Int]) -> Bool { + + } +}","func splitArraySameAverage(nums []int) bool { + +}","object Solution { + def splitArraySameAverage(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun splitArraySameAverage(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn split_array_same_average(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function splitArraySameAverage($nums) { + + } +}","function splitArraySameAverage(nums: number[]): boolean { + +};","(define/contract (split-array-same-average nums) + (-> (listof exact-integer?) boolean?) + + )","-spec split_array_same_average(Nums :: [integer()]) -> boolean(). +split_array_same_average(Nums) -> + .","defmodule Solution do + @spec split_array_same_average(nums :: [integer]) :: boolean + def split_array_same_average(nums) do + + end +end","class Solution { + bool splitArraySameAverage(List nums) { + + } +}", +1529,unique-morse-code-words,Unique Morse Code Words,804.0,822.0,"

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:

+ +
    +
  • 'a' maps to ".-",
    • +
  • 'b' maps to "-...",
    • +
  • 'c' maps to "-.-.", and so on.
    • +
+ +

For convenience, the full table for the 26 letters of the English alphabet is given below:

+ +
+[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
+ +

Given an array of strings words where each word can be written as a concatenation of the Morse code of each letter.

+ +
    +
  • For example, "cab" can be written as "-.-..--...", which is the concatenation of "-.-.", ".-", and "-...". We will call such a concatenation the transformation of a word.
    • +
+ +

Return the number of different transformations among all words we have.

+ +

 

+

Example 1:

+ +
+Input: words = ["gin","zen","gig","msg"]
+Output: 2
+Explanation: The transformation of each word is:
+"gin" -> "--...-."
+"zen" -> "--...-."
+"gig" -> "--...--."
+"msg" -> "--...--."
+There are 2 different transformations: "--...-." and "--...--.".
+
+ +

Example 2:

+ +
+Input: words = ["a"]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
    • +
  • 1 <= words[i].length <= 12
    • +
  • words[i] consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + int uniqueMorseRepresentations(vector& words) { + + } +};","class Solution { + public int uniqueMorseRepresentations(String[] words) { + + } +}","class Solution(object): + def uniqueMorseRepresentations(self, words): + """""" + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def uniqueMorseRepresentations(self, words: List[str]) -> int: + ","int uniqueMorseRepresentations(char ** words, int wordsSize){ + +}","public class Solution { + public int UniqueMorseRepresentations(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number} + */ +var uniqueMorseRepresentations = function(words) { + +};","# @param {String[]} words +# @return {Integer} +def unique_morse_representations(words) + +end","class Solution { + func uniqueMorseRepresentations(_ words: [String]) -> Int { + + } +}","func uniqueMorseRepresentations(words []string) int { + +}","object Solution { + def uniqueMorseRepresentations(words: Array[String]): Int = { + + } +}","class Solution { + fun uniqueMorseRepresentations(words: Array): Int { + + } +}","impl Solution { + pub fn unique_morse_representations(words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer + */ + function uniqueMorseRepresentations($words) { + + } +}","function uniqueMorseRepresentations(words: string[]): number { + +};","(define/contract (unique-morse-representations words) + (-> (listof string?) exact-integer?) + + )","-spec unique_morse_representations(Words :: [unicode:unicode_binary()]) -> integer(). +unique_morse_representations(Words) -> + .","defmodule Solution do + @spec unique_morse_representations(words :: [String.t]) :: integer + def unique_morse_representations(words) do + + end +end","class Solution { + int uniqueMorseRepresentations(List words) { + + } +}", +1530,bricks-falling-when-hit,Bricks Falling When Hit,803.0,821.0,"

You are given an m x n binary grid, where each 1 represents a brick and 0 represents an empty space. A brick is stable if:

+ +
    +
  • It is directly connected to the top of the grid, or
    • +
  • At least one other brick in its four adjacent cells is stable.
    • +
+ +

You are also given an array hits, which is a sequence of erasures we want to apply. Each time we want to erase the brick at the location hits[i] = (rowi, coli). The brick on that location (if it exists) will disappear. Some other bricks may no longer be stable because of that erasure and will fall. Once a brick falls, it is immediately erased from the grid (i.e., it does not land on other stable bricks).

+ +

Return an array result, where each result[i] is the number of bricks that will fall after the ith erasure is applied.

+ +

Note that an erasure may refer to a location with no brick, and if it does, no bricks drop.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,0,0,0],[1,1,1,0]], hits = [[1,0]]
+Output: [2]
+Explanation: Starting with the grid:
+[[1,0,0,0],
+ [1,1,1,0]]
+We erase the underlined brick at (1,0), resulting in the grid:
+[[1,0,0,0],
+ [0,1,1,0]]
+The two underlined bricks are no longer stable as they are no longer connected to the top nor adjacent to another stable brick, so they will fall. The resulting grid is:
+[[1,0,0,0],
+ [0,0,0,0]]
+Hence the result is [2].
+
+ +

Example 2:

+ +
+Input: grid = [[1,0,0,0],[1,1,0,0]], hits = [[1,1],[1,0]]
+Output: [0,0]
+Explanation: Starting with the grid:
+[[1,0,0,0],
+ [1,1,0,0]]
+We erase the underlined brick at (1,1), resulting in the grid:
+[[1,0,0,0],
+ [1,0,0,0]]
+All remaining bricks are still stable, so no bricks fall. The grid remains the same:
+[[1,0,0,0],
+ [1,0,0,0]]
+Next, we erase the underlined brick at (1,0), resulting in the grid:
+[[1,0,0,0],
+ [0,0,0,0]]
+Once again, all remaining bricks are still stable, so no bricks fall.
+Hence the result is [0,0].
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • grid[i][j] is 0 or 1.
    • +
  • 1 <= hits.length <= 4 * 104
    • +
  • hits[i].length == 2
    • +
  • 0 <= xi <= m - 1
    • +
  • 0 <= yi <= n - 1
    • +
  • All (xi, yi) are unique.
    • +
+",3.0,False,"class Solution { +public: + vector hitBricks(vector>& grid, vector>& hits) { + + } +};","class Solution { + public int[] hitBricks(int[][] grid, int[][] hits) { + + } +}","class Solution(object): + def hitBricks(self, grid, hits): + """""" + :type grid: List[List[int]] + :type hits: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def hitBricks(self, grid: List[List[int]], hits: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* hitBricks(int** grid, int gridSize, int* gridColSize, int** hits, int hitsSize, int* hitsColSize, int* returnSize){ + +}","public class Solution { + public int[] HitBricks(int[][] grid, int[][] hits) { + + } +}","/** + * @param {number[][]} grid + * @param {number[][]} hits + * @return {number[]} + */ +var hitBricks = function(grid, hits) { + +};","# @param {Integer[][]} grid +# @param {Integer[][]} hits +# @return {Integer[]} +def hit_bricks(grid, hits) + +end","class Solution { + func hitBricks(_ grid: [[Int]], _ hits: [[Int]]) -> [Int] { + + } +}","func hitBricks(grid [][]int, hits [][]int) []int { + +}","object Solution { + def hitBricks(grid: Array[Array[Int]], hits: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun hitBricks(grid: Array, hits: Array): IntArray { + + } +}","impl Solution { + pub fn hit_bricks(grid: Vec>, hits: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @param Integer[][] $hits + * @return Integer[] + */ + function hitBricks($grid, $hits) { + + } +}","function hitBricks(grid: number[][], hits: number[][]): number[] { + +};","(define/contract (hit-bricks grid hits) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec hit_bricks(Grid :: [[integer()]], Hits :: [[integer()]]) -> [integer()]. +hit_bricks(Grid, Hits) -> + .","defmodule Solution do + @spec hit_bricks(grid :: [[integer]], hits :: [[integer]]) :: [integer] + def hit_bricks(grid, hits) do + + end +end","class Solution { + List hitBricks(List> grid, List> hits) { + + } +}", +1532,minimum-swaps-to-make-sequences-increasing,Minimum Swaps To Make Sequences Increasing,801.0,819.0,"

You are given two integer arrays of the same length nums1 and nums2. In one operation, you are allowed to swap nums1[i] with nums2[i].

+ +
    +
  • For example, if nums1 = [1,2,3,8], and nums2 = [5,6,7,4], you can swap the element at i = 3 to obtain nums1 = [1,2,3,4] and nums2 = [5,6,7,8].
    • +
+ +

Return the minimum number of needed operations to make nums1 and nums2 strictly increasing. The test cases are generated so that the given input always makes it possible.

+ +

An array arr is strictly increasing if and only if arr[0] < arr[1] < arr[2] < ... < arr[arr.length - 1].

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,3,5,4], nums2 = [1,2,3,7]
+Output: 1
+Explanation: 
+Swap nums1[3] and nums2[3]. Then the sequences are:
+nums1 = [1, 3, 5, 7] and nums2 = [1, 2, 3, 4]
+which are both strictly increasing.
+
+ +

Example 2:

+ +
+Input: nums1 = [0,3,5,8,9], nums2 = [2,1,4,6,9]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums1.length <= 105
    • +
  • nums2.length == nums1.length
    • +
  • 0 <= nums1[i], nums2[i] <= 2 * 105
    • +
+",3.0,False,"class Solution { +public: + int minSwap(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int minSwap(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def minSwap(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def minSwap(self, nums1: List[int], nums2: List[int]) -> int: + ","int minSwap(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int MinSwap(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var minSwap = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def min_swap(nums1, nums2) + +end","class Solution { + func minSwap(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func minSwap(nums1 []int, nums2 []int) int { + +}","object Solution { + def minSwap(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun minSwap(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn min_swap(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function minSwap($nums1, $nums2) { + + } +}","function minSwap(nums1: number[], nums2: number[]): number { + +};","(define/contract (min-swap nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec min_swap(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +min_swap(Nums1, Nums2) -> + .","defmodule Solution do + @spec min_swap(nums1 :: [integer], nums2 :: [integer]) :: integer + def min_swap(nums1, nums2) do + + end +end","class Solution { + int minSwap(List nums1, List nums2) { + + } +}", +1533,design-hashmap,Design HashMap,706.0,817.0,"

Design a HashMap without using any built-in hash table libraries.

+ +

Implement the MyHashMap class:

+ +
    +
  • MyHashMap() initializes the object with an empty map.
    • +
  • void put(int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the map, update the corresponding value.
    • +
  • int get(int key) returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key.
    • +
  • void remove(key) removes the key and its corresponding value if the map contains the mapping for the key.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MyHashMap", "put", "put", "get", "get", "put", "get", "remove", "get"]
+[[], [1, 1], [2, 2], [1], [3], [2, 1], [2], [2], [2]]
+Output
+[null, null, null, 1, -1, null, 1, null, -1]
+
+Explanation
+MyHashMap myHashMap = new MyHashMap();
+myHashMap.put(1, 1); // The map is now [[1,1]]
+myHashMap.put(2, 2); // The map is now [[1,1], [2,2]]
+myHashMap.get(1);    // return 1, The map is now [[1,1], [2,2]]
+myHashMap.get(3);    // return -1 (i.e., not found), The map is now [[1,1], [2,2]]
+myHashMap.put(2, 1); // The map is now [[1,1], [2,1]] (i.e., update the existing value)
+myHashMap.get(2);    // return 1, The map is now [[1,1], [2,1]]
+myHashMap.remove(2); // remove the mapping for 2, The map is now [[1,1]]
+myHashMap.get(2);    // return -1 (i.e., not found), The map is now [[1,1]]
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= key, value <= 106
    • +
  • At most 104 calls will be made to put, get, and remove.
    • +
+",1.0,False,"class MyHashMap { +public: + MyHashMap() { + + } + + void put(int key, int value) { + + } + + int get(int key) { + + } + + void remove(int key) { + + } +}; + +/** + * Your MyHashMap object will be instantiated and called as such: + * MyHashMap* obj = new MyHashMap(); + * obj->put(key,value); + * int param_2 = obj->get(key); + * obj->remove(key); + */","class MyHashMap { + + public MyHashMap() { + + } + + public void put(int key, int value) { + + } + + public int get(int key) { + + } + + public void remove(int key) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * MyHashMap obj = new MyHashMap(); + * obj.put(key,value); + * int param_2 = obj.get(key); + * obj.remove(key); + */","class MyHashMap(object): + + def __init__(self): + + + def put(self, key, value): + """""" + :type key: int + :type value: int + :rtype: None + """""" + + + def get(self, key): + """""" + :type key: int + :rtype: int + """""" + + + def remove(self, key): + """""" + :type key: int + :rtype: None + """""" + + + +# Your MyHashMap object will be instantiated and called as such: +# obj = MyHashMap() +# obj.put(key,value) +# param_2 = obj.get(key) +# obj.remove(key)","class MyHashMap: + + def __init__(self): + + + def put(self, key: int, value: int) -> None: + + + def get(self, key: int) -> int: + + + def remove(self, key: int) -> None: + + + +# Your MyHashMap object will be instantiated and called as such: +# obj = MyHashMap() +# obj.put(key,value) +# param_2 = obj.get(key) +# obj.remove(key)"," + + +typedef struct { + +} MyHashMap; + + +MyHashMap* myHashMapCreate() { + +} + +void myHashMapPut(MyHashMap* obj, int key, int value) { + +} + +int myHashMapGet(MyHashMap* obj, int key) { + +} + +void myHashMapRemove(MyHashMap* obj, int key) { + +} + +void myHashMapFree(MyHashMap* obj) { + +} + +/** + * Your MyHashMap struct will be instantiated and called as such: + * MyHashMap* obj = myHashMapCreate(); + * myHashMapPut(obj, key, value); + + * int param_2 = myHashMapGet(obj, key); + + * myHashMapRemove(obj, key); + + * myHashMapFree(obj); +*/","public class MyHashMap { + + public MyHashMap() { + + } + + public void Put(int key, int value) { + + } + + public int Get(int key) { + + } + + public void Remove(int key) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * MyHashMap obj = new MyHashMap(); + * obj.Put(key,value); + * int param_2 = obj.Get(key); + * obj.Remove(key); + */"," +var MyHashMap = function() { + +}; + +/** + * @param {number} key + * @param {number} value + * @return {void} + */ +MyHashMap.prototype.put = function(key, value) { + +}; + +/** + * @param {number} key + * @return {number} + */ +MyHashMap.prototype.get = function(key) { + +}; + +/** + * @param {number} key + * @return {void} + */ +MyHashMap.prototype.remove = function(key) { + +}; + +/** + * Your MyHashMap object will be instantiated and called as such: + * var obj = new MyHashMap() + * obj.put(key,value) + * var param_2 = obj.get(key) + * obj.remove(key) + */","class MyHashMap + def initialize() + + end + + +=begin + :type key: Integer + :type value: Integer + :rtype: Void +=end + def put(key, value) + + end + + +=begin + :type key: Integer + :rtype: Integer +=end + def get(key) + + end + + +=begin + :type key: Integer + :rtype: Void +=end + def remove(key) + + end + + +end + +# Your MyHashMap object will be instantiated and called as such: +# obj = MyHashMap.new() +# obj.put(key, value) +# param_2 = obj.get(key) +# obj.remove(key)"," +class MyHashMap { + + init() { + + } + + func put(_ key: Int, _ value: Int) { + + } + + func get(_ key: Int) -> Int { + + } + + func remove(_ key: Int) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * let obj = MyHashMap() + * obj.put(key, value) + * let ret_2: Int = obj.get(key) + * obj.remove(key) + */","type MyHashMap struct { + +} + + +func Constructor() MyHashMap { + +} + + +func (this *MyHashMap) Put(key int, value int) { + +} + + +func (this *MyHashMap) Get(key int) int { + +} + + +func (this *MyHashMap) Remove(key int) { + +} + + +/** + * Your MyHashMap object will be instantiated and called as such: + * obj := Constructor(); + * obj.Put(key,value); + * param_2 := obj.Get(key); + * obj.Remove(key); + */","class MyHashMap() { + + def put(key: Int, value: Int) { + + } + + def get(key: Int): Int = { + + } + + def remove(key: Int) { + + } + +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * var obj = new MyHashMap() + * obj.put(key,value) + * var param_2 = obj.get(key) + * obj.remove(key) + */","class MyHashMap() { + + fun put(key: Int, value: Int) { + + } + + fun get(key: Int): Int { + + } + + fun remove(key: Int) { + + } + +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * var obj = MyHashMap() + * obj.put(key,value) + * var param_2 = obj.get(key) + * obj.remove(key) + */","struct MyHashMap { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MyHashMap { + + fn new() -> Self { + + } + + fn put(&self, key: i32, value: i32) { + + } + + fn get(&self, key: i32) -> i32 { + + } + + fn remove(&self, key: i32) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * let obj = MyHashMap::new(); + * obj.put(key, value); + * let ret_2: i32 = obj.get(key); + * obj.remove(key); + */","class MyHashMap { + /** + */ + function __construct() { + + } + + /** + * @param Integer $key + * @param Integer $value + * @return NULL + */ + function put($key, $value) { + + } + + /** + * @param Integer $key + * @return Integer + */ + function get($key) { + + } + + /** + * @param Integer $key + * @return NULL + */ + function remove($key) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * $obj = MyHashMap(); + * $obj->put($key, $value); + * $ret_2 = $obj->get($key); + * $obj->remove($key); + */","class MyHashMap { + constructor() { + + } + + put(key: number, value: number): void { + + } + + get(key: number): number { + + } + + remove(key: number): void { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * var obj = new MyHashMap() + * obj.put(key,value) + * var param_2 = obj.get(key) + * obj.remove(key) + */","(define my-hash-map% + (class object% + (super-new) + (init-field) + + ; put : exact-integer? exact-integer? -> void? + (define/public (put key value) + + ) + ; get : exact-integer? -> exact-integer? + (define/public (get key) + + ) + ; remove : exact-integer? -> void? + (define/public (remove key) + + ))) + +;; Your my-hash-map% object will be instantiated and called as such: +;; (define obj (new my-hash-map%)) +;; (send obj put key value) +;; (define param_2 (send obj get key)) +;; (send obj remove key)","-spec my_hash_map_init_() -> any(). +my_hash_map_init_() -> + . + +-spec my_hash_map_put(Key :: integer(), Value :: integer()) -> any(). +my_hash_map_put(Key, Value) -> + . + +-spec my_hash_map_get(Key :: integer()) -> integer(). +my_hash_map_get(Key) -> + . + +-spec my_hash_map_remove(Key :: integer()) -> any(). +my_hash_map_remove(Key) -> + . + + +%% Your functions will be called as such: +%% my_hash_map_init_(), +%% my_hash_map_put(Key, Value), +%% Param_2 = my_hash_map_get(Key), +%% my_hash_map_remove(Key), + +%% my_hash_map_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MyHashMap do + @spec init_() :: any + def init_() do + + end + + @spec put(key :: integer, value :: integer) :: any + def put(key, value) do + + end + + @spec get(key :: integer) :: integer + def get(key) do + + end + + @spec remove(key :: integer) :: any + def remove(key) do + + end +end + +# Your functions will be called as such: +# MyHashMap.init_() +# MyHashMap.put(key, value) +# param_2 = MyHashMap.get(key) +# MyHashMap.remove(key) + +# MyHashMap.init_ will be called before every test case, in which you can do some necessary initializations.","class MyHashMap { + + MyHashMap() { + + } + + void put(int key, int value) { + + } + + int get(int key) { + + } + + void remove(int key) { + + } +} + +/** + * Your MyHashMap object will be instantiated and called as such: + * MyHashMap obj = MyHashMap(); + * obj.put(key,value); + * int param2 = obj.get(key); + * obj.remove(key); + */", +1535,champagne-tower,Champagne Tower,799.0,815.0,"

We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row.  Each glass holds one cup of champagne.

+ +

Then, some champagne is poured into the first glass at the top.  When the topmost glass is full, any excess liquid poured will fall equally to the glass immediately to the left and right of it.  When those glasses become full, any excess champagne will fall equally to the left and right of those glasses, and so on.  (A glass at the bottom row has its excess champagne fall on the floor.)

+ +

For example, after one cup of champagne is poured, the top most glass is full.  After two cups of champagne are poured, the two glasses on the second row are half full.  After three cups of champagne are poured, those two cups become full - there are 3 full glasses total now.  After four cups of champagne are poured, the third row has the middle glass half full, and the two outside glasses are a quarter full, as pictured below.

+ +

+ +

Now after pouring some non-negative integer cups of champagne, return how full the jth glass in the ith row is (both i and j are 0-indexed.)

+ +

 

+

Example 1:

+ +
+Input: poured = 1, query_row = 1, query_glass = 1
+Output: 0.00000
+Explanation: We poured 1 cup of champange to the top glass of the tower (which is indexed as (0, 0)). There will be no excess liquid so all the glasses under the top glass will remain empty.
+
+ +

Example 2:

+ +
+Input: poured = 2, query_row = 1, query_glass = 1
+Output: 0.50000
+Explanation: We poured 2 cups of champange to the top glass of the tower (which is indexed as (0, 0)). There is one cup of excess liquid. The glass indexed as (1, 0) and the glass indexed as (1, 1) will share the excess liquid equally, and each will get half cup of champange.
+
+ +

Example 3:

+ +
+Input: poured = 100000009, query_row = 33, query_glass = 17
+Output: 1.00000
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= poured <= 109
    • +
  • 0 <= query_glass <= query_row < 100
    • +
",2.0,False,"class Solution { +public: + double champagneTower(int poured, int query_row, int query_glass) { + + } +};","class Solution { + public double champagneTower(int poured, int query_row, int query_glass) { + + } +}","class Solution(object): + def champagneTower(self, poured, query_row, query_glass): + """""" + :type poured: int + :type query_row: int + :type query_glass: int + :rtype: float + """""" + ","class Solution: + def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float: + "," + +double champagneTower(int poured, int query_row, int query_glass){ + +}","public class Solution { + public double ChampagneTower(int poured, int query_row, int query_glass) { + + } +}","/** + * @param {number} poured + * @param {number} query_row + * @param {number} query_glass + * @return {number} + */ +var champagneTower = function(poured, query_row, query_glass) { + +};","# @param {Integer} poured +# @param {Integer} query_row +# @param {Integer} query_glass +# @return {Float} +def champagne_tower(poured, query_row, query_glass) + +end","class Solution { + func champagneTower(_ poured: Int, _ query_row: Int, _ query_glass: Int) -> Double { + + } +}","func champagneTower(poured int, query_row int, query_glass int) float64 { + +}","object Solution { + def champagneTower(poured: Int, query_row: Int, query_glass: Int): Double = { + + } +}","class Solution { + fun champagneTower(poured: Int, query_row: Int, query_glass: Int): Double { + + } +}","impl Solution { + pub fn champagne_tower(poured: i32, query_row: i32, query_glass: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer $poured + * @param Integer $query_row + * @param Integer $query_glass + * @return Float + */ + function champagneTower($poured, $query_row, $query_glass) { + + } +}","function champagneTower(poured: number, query_row: number, query_glass: number): number { + +};",,,,, +1536,smallest-rotation-with-highest-score,Smallest Rotation with Highest Score,798.0,814.0,"

You are given an array nums. You can rotate it by a non-negative integer k so that the array becomes [nums[k], nums[k + 1], ... nums[nums.length - 1], nums[0], nums[1], ..., nums[k-1]]. Afterward, any entries that are less than or equal to their index are worth one point.

+ +
    +
  • For example, if we have nums = [2,4,1,3,0], and we rotate by k = 2, it becomes [1,3,0,2,4]. This is worth 3 points because 1 > 0 [no points], 3 > 1 [no points], 0 <= 2 [one point], 2 <= 3 [one point], 4 <= 4 [one point].
    • +
+ +

Return the rotation index k that corresponds to the highest score we can achieve if we rotated nums by it. If there are multiple answers, return the smallest such index k.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,1,4,0]
+Output: 3
+Explanation: Scores for each k are listed below: 
+k = 0,  nums = [2,3,1,4,0],    score 2
+k = 1,  nums = [3,1,4,0,2],    score 3
+k = 2,  nums = [1,4,0,2,3],    score 3
+k = 3,  nums = [4,0,2,3,1],    score 4
+k = 4,  nums = [0,2,3,1,4],    score 3
+So we should choose k = 3, which has the highest score.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,0,2,4]
+Output: 0
+Explanation: nums will always have 3 points no matter how it shifts.
+So we will choose the smallest k, which is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] < nums.length
    • +
+",3.0,False,"class Solution { +public: + int bestRotation(vector& nums) { + + } +};","class Solution { + public int bestRotation(int[] nums) { + + } +}","class Solution(object): + def bestRotation(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def bestRotation(self, nums: List[int]) -> int: + ","int bestRotation(int* nums, int numsSize){ + +}","public class Solution { + public int BestRotation(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var bestRotation = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def best_rotation(nums) + +end","class Solution { + func bestRotation(_ nums: [Int]) -> Int { + + } +}","func bestRotation(nums []int) int { + +}","object Solution { + def bestRotation(nums: Array[Int]): Int = { + + } +}","class Solution { + fun bestRotation(nums: IntArray): Int { + + } +}","impl Solution { + pub fn best_rotation(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function bestRotation($nums) { + + } +}","function bestRotation(nums: number[]): number { + +};","(define/contract (best-rotation nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec best_rotation(Nums :: [integer()]) -> integer(). +best_rotation(Nums) -> + .","defmodule Solution do + @spec best_rotation(nums :: [integer]) :: integer + def best_rotation(nums) do + + end +end","class Solution { + int bestRotation(List nums) { + + } +}", +1537,all-paths-from-source-to-target,All Paths From Source to Target,797.0,813.0,"

Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order.

+ +

The graph is given as follows: graph[i] is a list of all nodes you can visit from node i (i.e., there is a directed edge from node i to node graph[i][j]).

+ +

 

+

Example 1:

+ +
+Input: graph = [[1,2],[3],[3],[]]
+Output: [[0,1,3],[0,2,3]]
+Explanation: There are two paths: 0 -> 1 -> 3 and 0 -> 2 -> 3.
+
+ +

Example 2:

+ +
+Input: graph = [[4,3,1],[3,2,4],[3],[4],[]]
+Output: [[0,4],[0,3,4],[0,1,3,4],[0,1,2,3,4],[0,1,4]]
+
+ +

 

+

Constraints:

+ +
    +
  • n == graph.length
    • +
  • 2 <= n <= 15
    • +
  • 0 <= graph[i][j] < n
    • +
  • graph[i][j] != i (i.e., there will be no self-loops).
    • +
  • All the elements of graph[i] are unique.
    • +
  • The input graph is guaranteed to be a DAG.
    • +
+",2.0,False,"class Solution { +public: + vector> allPathsSourceTarget(vector>& graph) { + + } +};","class Solution { + public List> allPathsSourceTarget(int[][] graph) { + + } +}","class Solution(object): + def allPathsSourceTarget(self, graph): + """""" + :type graph: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** allPathsSourceTarget(int** graph, int graphSize, int* graphColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> AllPathsSourceTarget(int[][] graph) { + + } +}","/** + * @param {number[][]} graph + * @return {number[][]} + */ +var allPathsSourceTarget = function(graph) { + +};","# @param {Integer[][]} graph +# @return {Integer[][]} +def all_paths_source_target(graph) + +end","class Solution { + func allPathsSourceTarget(_ graph: [[Int]]) -> [[Int]] { + + } +}","func allPathsSourceTarget(graph [][]int) [][]int { + +}","object Solution { + def allPathsSourceTarget(graph: Array[Array[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun allPathsSourceTarget(graph: Array): List> { + + } +}","impl Solution { + pub fn all_paths_source_target(graph: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $graph + * @return Integer[][] + */ + function allPathsSourceTarget($graph) { + + } +}","function allPathsSourceTarget(graph: number[][]): number[][] { + +};","(define/contract (all-paths-source-target graph) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec all_paths_source_target(Graph :: [[integer()]]) -> [[integer()]]. +all_paths_source_target(Graph) -> + .","defmodule Solution do + @spec all_paths_source_target(graph :: [[integer]]) :: [[integer]] + def all_paths_source_target(graph) do + + end +end","class Solution { + List> allPathsSourceTarget(List> graph) { + + } +}", +1541,preimage-size-of-factorial-zeroes-function,Preimage Size of Factorial Zeroes Function,793.0,809.0,"

Let f(x) be the number of zeroes at the end of x!. Recall that x! = 1 * 2 * 3 * ... * x and by convention, 0! = 1.

+ +
    +
  • For example, f(3) = 0 because 3! = 6 has no zeroes at the end, while f(11) = 2 because 11! = 39916800 has two zeroes at the end.
    • +
+ +

Given an integer k, return the number of non-negative integers x have the property that f(x) = k.

+ +

 

+

Example 1:

+ +
+Input: k = 0
+Output: 5
+Explanation: 0!, 1!, 2!, 3!, and 4! end with k = 0 zeroes.
+
+ +

Example 2:

+ +
+Input: k = 5
+Output: 0
+Explanation: There is no x such that x! ends in k = 5 zeroes.
+
+ +

Example 3:

+ +
+Input: k = 3
+Output: 5
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= k <= 109
    • +
+",3.0,False,"class Solution { +public: + int preimageSizeFZF(int k) { + + } +};","class Solution { + public int preimageSizeFZF(int k) { + + } +}","class Solution(object): + def preimageSizeFZF(self, k): + """""" + :type k: int + :rtype: int + """""" + ","class Solution: + def preimageSizeFZF(self, k: int) -> int: + ","int preimageSizeFZF(int k){ + +}","public class Solution { + public int PreimageSizeFZF(int k) { + + } +}","/** + * @param {number} k + * @return {number} + */ +var preimageSizeFZF = function(k) { + +};","# @param {Integer} k +# @return {Integer} +def preimage_size_fzf(k) + +end","class Solution { + func preimageSizeFZF(_ k: Int) -> Int { + + } +}","func preimageSizeFZF(k int) int { + +}","object Solution { + def preimageSizeFZF(k: Int): Int = { + + } +}","class Solution { + fun preimageSizeFZF(k: Int): Int { + + } +}","impl Solution { + pub fn preimage_size_fzf(k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @return Integer + */ + function preimageSizeFZF($k) { + + } +}","function preimageSizeFZF(k: number): number { + +};","(define/contract (preimage-size-fzf k) + (-> exact-integer? exact-integer?) + + )","-spec preimage_size_fzf(K :: integer()) -> integer(). +preimage_size_fzf(K) -> + .","defmodule Solution do + @spec preimage_size_fzf(k :: integer) :: integer + def preimage_size_fzf(k) do + + end +end","class Solution { + int preimageSizeFZF(int k) { + + } +}", +1542,number-of-matching-subsequences,Number of Matching Subsequences,792.0,808.0,"

Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.

+ +

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

+ +
    +
  • For example, "ace" is a subsequence of "abcde".
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "abcde", words = ["a","bb","acd","ace"]
+Output: 3
+Explanation: There are three strings in words that are a subsequence of s: "a", "acd", "ace".
+
+ +

Example 2:

+ +
+Input: s = "dsahjpjauf", words = ["ahjpjau","ja","ahbwzgqnuk","tnmlanowax"]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 5 * 104
    • +
  • 1 <= words.length <= 5000
    • +
  • 1 <= words[i].length <= 50
    • +
  • s and words[i] consist of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int numMatchingSubseq(string s, vector& words) { + + } +};","class Solution { + public int numMatchingSubseq(String s, String[] words) { + + } +}","class Solution(object): + def numMatchingSubseq(self, s, words): + """""" + :type s: str + :type words: List[str] + :rtype: int + """""" + ","class Solution: + def numMatchingSubseq(self, s: str, words: List[str]) -> int: + ","int numMatchingSubseq(char * s, char ** words, int wordsSize){ + +}","public class Solution { + public int NumMatchingSubseq(string s, string[] words) { + + } +}","/** + * @param {string} s + * @param {string[]} words + * @return {number} + */ +var numMatchingSubseq = function(s, words) { + +};","# @param {String} s +# @param {String[]} words +# @return {Integer} +def num_matching_subseq(s, words) + +end","class Solution { + func numMatchingSubseq(_ s: String, _ words: [String]) -> Int { + + } +}","func numMatchingSubseq(s string, words []string) int { + +}","object Solution { + def numMatchingSubseq(s: String, words: Array[String]): Int = { + + } +}","class Solution { + fun numMatchingSubseq(s: String, words: Array): Int { + + } +}","impl Solution { + pub fn num_matching_subseq(s: String, words: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $words + * @return Integer + */ + function numMatchingSubseq($s, $words) { + + } +}","function numMatchingSubseq(s: string, words: string[]): number { + +};","(define/contract (num-matching-subseq s words) + (-> string? (listof string?) exact-integer?) + + )","-spec num_matching_subseq(S :: unicode:unicode_binary(), Words :: [unicode:unicode_binary()]) -> integer(). +num_matching_subseq(S, Words) -> + .","defmodule Solution do + @spec num_matching_subseq(s :: String.t, words :: [String.t]) :: integer + def num_matching_subseq(s, words) do + + end +end","class Solution { + int numMatchingSubseq(String s, List words) { + + } +}", +1544,domino-and-tromino-tiling,Domino and Tromino Tiling,790.0,806.0,"

You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes.

+ +

Given an integer n, return the number of ways to tile an 2 x n board. Since the answer may be very large, return it modulo 109 + 7.

+ +

In a tiling, every square must be covered by a tile. Two tilings are different if and only if there are two 4-directionally adjacent cells on the board such that exactly one of the tilings has both squares occupied by a tile.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 5
+Explanation: The five different ways are show above.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",2.0,False,"class Solution { +public: + int numTilings(int n) { + + } +};","class Solution { + public int numTilings(int n) { + + } +}","class Solution(object): + def numTilings(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numTilings(self, n: int) -> int: + ","int numTilings(int n){ + +}","public class Solution { + public int NumTilings(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numTilings = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def num_tilings(n) + +end","class Solution { + func numTilings(_ n: Int) -> Int { + + } +}","func numTilings(n int) int { + +}","object Solution { + def numTilings(n: Int): Int = { + + } +}","class Solution { + fun numTilings(n: Int): Int { + + } +}","impl Solution { + pub fn num_tilings(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numTilings($n) { + + } +}","function numTilings(n: number): number { + +};","(define/contract (num-tilings n) + (-> exact-integer? exact-integer?) + + )","-spec num_tilings(N :: integer()) -> integer(). +num_tilings(N) -> + .","defmodule Solution do + @spec num_tilings(n :: integer) :: integer + def num_tilings(n) do + + end +end","class Solution { + int numTilings(int n) { + + } +}", +1546,rotated-digits,Rotated Digits,788.0,804.0,"

An integer x is a good if after rotating each digit individually by 180 degrees, we get a valid number that is different from x. Each digit must be rotated - we cannot choose to leave it alone.

+ +

A number is valid if each digit remains a digit after rotation. For example:

+ +
    +
  • 0, 1, and 8 rotate to themselves,
    • +
  • 2 and 5 rotate to each other (in this case they are rotated in a different direction, in other words, 2 or 5 gets mirrored),
    • +
  • 6 and 9 rotate to each other, and
    • +
  • the rest of the numbers do not rotate to any other number and become invalid.
    • +
+ +

Given an integer n, return the number of good integers in the range [1, n].

+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 4
+Explanation: There are four good numbers in the range [1, 10] : 2, 5, 6, 9.
+Note that 1 and 10 are not good numbers, since they remain unchanged after rotating.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 0
+
+ +

Example 3:

+ +
+Input: n = 2
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",2.0,False,"class Solution { +public: + int rotatedDigits(int n) { + + } +};","class Solution { + public int rotatedDigits(int n) { + + } +}","class Solution(object): + def rotatedDigits(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def rotatedDigits(self, n: int) -> int: + ","int rotatedDigits(int n){ + +}","public class Solution { + public int RotatedDigits(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var rotatedDigits = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def rotated_digits(n) + +end","class Solution { + func rotatedDigits(_ n: Int) -> Int { + + } +}","func rotatedDigits(n int) int { + +}","object Solution { + def rotatedDigits(n: Int): Int = { + + } +}","class Solution { + fun rotatedDigits(n: Int): Int { + + } +}","impl Solution { + pub fn rotated_digits(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function rotatedDigits($n) { + + } +}","function rotatedDigits(n: number): number { + +};","(define/contract (rotated-digits n) + (-> exact-integer? exact-integer?) + + )","-spec rotated_digits(N :: integer()) -> integer(). +rotated_digits(N) -> + .","defmodule Solution do + @spec rotated_digits(n :: integer) :: integer + def rotated_digits(n) do + + end +end","class Solution { + int rotatedDigits(int n) { + + } +}", +1548,k-th-smallest-prime-fraction,K-th Smallest Prime Fraction,786.0,802.0,"

You are given a sorted integer array arr containing 1 and prime numbers, where all the integers of arr are unique. You are also given an integer k.

+ +

For every i and j where 0 <= i < j < arr.length, we consider the fraction arr[i] / arr[j].

+ +

Return the kth smallest fraction considered. Return your answer as an array of integers of size 2, where answer[0] == arr[i] and answer[1] == arr[j].

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,5], k = 3
+Output: [2,5]
+Explanation: The fractions to be considered in sorted order are:
+1/5, 1/3, 2/5, 1/2, 3/5, and 2/3.
+The third fraction is 2/5.
+
+ +

Example 2:

+ +
+Input: arr = [1,7], k = 1
+Output: [1,7]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= arr.length <= 1000
    • +
  • 1 <= arr[i] <= 3 * 104
    • +
  • arr[0] == 1
    • +
  • arr[i] is a prime number for i > 0.
    • +
  • All the numbers of arr are unique and sorted in strictly increasing order.
    • +
  • 1 <= k <= arr.length * (arr.length - 1) / 2
    • +
+ +

 

+Follow up: Can you solve the problem with better than O(n2) complexity?",2.0,False,"class Solution { +public: + vector kthSmallestPrimeFraction(vector& arr, int k) { + + } +};","class Solution { + public int[] kthSmallestPrimeFraction(int[] arr, int k) { + + } +}","class Solution(object): + def kthSmallestPrimeFraction(self, arr, k): + """""" + :type arr: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def kthSmallestPrimeFraction(self, arr: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* kthSmallestPrimeFraction(int* arr, int arrSize, int k, int* returnSize){ + +}","public class Solution { + public int[] KthSmallestPrimeFraction(int[] arr, int k) { + + } +}","/** + * @param {number[]} arr + * @param {number} k + * @return {number[]} + */ +var kthSmallestPrimeFraction = function(arr, k) { + +};","# @param {Integer[]} arr +# @param {Integer} k +# @return {Integer[]} +def kth_smallest_prime_fraction(arr, k) + +end","class Solution { + func kthSmallestPrimeFraction(_ arr: [Int], _ k: Int) -> [Int] { + + } +}","func kthSmallestPrimeFraction(arr []int, k int) []int { + +}","object Solution { + def kthSmallestPrimeFraction(arr: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun kthSmallestPrimeFraction(arr: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn kth_smallest_prime_fraction(arr: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @param Integer $k + * @return Integer[] + */ + function kthSmallestPrimeFraction($arr, $k) { + + } +}","function kthSmallestPrimeFraction(arr: number[], k: number): number[] { + +};","(define/contract (kth-smallest-prime-fraction arr k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec kth_smallest_prime_fraction(Arr :: [integer()], K :: integer()) -> [integer()]. +kth_smallest_prime_fraction(Arr, K) -> + .","defmodule Solution do + @spec kth_smallest_prime_fraction(arr :: [integer], k :: integer) :: [integer] + def kth_smallest_prime_fraction(arr, k) do + + end +end","class Solution { + List kthSmallestPrimeFraction(List arr, int k) { + + } +}", +1552,transform-to-chessboard,Transform to Chessboard,782.0,798.0,"

You are given an n x n binary grid board. In each move, you can swap any two rows with each other, or any two columns with each other.

+ +

Return the minimum number of moves to transform the board into a chessboard board. If the task is impossible, return -1.

+ +

A chessboard board is a board where no 0's and no 1's are 4-directionally adjacent.

+ +

 

+

Example 1:

+ +
+Input: board = [[0,1,1,0],[0,1,1,0],[1,0,0,1],[1,0,0,1]]
+Output: 2
+Explanation: One potential sequence of moves is shown.
+The first move swaps the first and second column.
+The second move swaps the second and third row.
+
+ +

Example 2:

+ +
+Input: board = [[0,1],[1,0]]
+Output: 0
+Explanation: Also note that the board with 0 in the top left corner, is also a valid chessboard.
+
+ +

Example 3:

+ +
+Input: board = [[1,0],[1,0]]
+Output: -1
+Explanation: No matter what sequence of moves you make, you cannot end with a valid chessboard.
+
+ +

 

+

Constraints:

+ +
    +
  • n == board.length
    • +
  • n == board[i].length
    • +
  • 2 <= n <= 30
    • +
  • board[i][j] is either 0 or 1.
    • +
+",3.0,False,"class Solution { +public: + int movesToChessboard(vector>& board) { + + } +};","class Solution { + public int movesToChessboard(int[][] board) { + + } +}","class Solution(object): + def movesToChessboard(self, board): + """""" + :type board: List[List[int]] + :rtype: int + """""" + ","class Solution: + def movesToChessboard(self, board: List[List[int]]) -> int: + ","int movesToChessboard(int** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public int MovesToChessboard(int[][] board) { + + } +}","/** + * @param {number[][]} board + * @return {number} + */ +var movesToChessboard = function(board) { + +};","# @param {Integer[][]} board +# @return {Integer} +def moves_to_chessboard(board) + +end","class Solution { + func movesToChessboard(_ board: [[Int]]) -> Int { + + } +}","func movesToChessboard(board [][]int) int { + +}","object Solution { + def movesToChessboard(board: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun movesToChessboard(board: Array): Int { + + } +}","impl Solution { + pub fn moves_to_chessboard(board: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $board + * @return Integer + */ + function movesToChessboard($board) { + + } +}","function movesToChessboard(board: number[][]): number { + +};","(define/contract (moves-to-chessboard board) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec moves_to_chessboard(Board :: [[integer()]]) -> integer(). +moves_to_chessboard(Board) -> + .","defmodule Solution do + @spec moves_to_chessboard(board :: [[integer]]) :: integer + def moves_to_chessboard(board) do + + end +end","class Solution { + int movesToChessboard(List> board) { + + } +}", +1553,rabbits-in-forest,Rabbits in Forest,781.0,797.0,"

There is a forest with an unknown number of rabbits. We asked n rabbits "How many rabbits have the same color as you?" and collected the answers in an integer array answers where answers[i] is the answer of the ith rabbit.

+ +

Given the array answers, return the minimum number of rabbits that could be in the forest.

+ +

 

+

Example 1:

+ +
+Input: answers = [1,1,2]
+Output: 5
+Explanation:
+The two rabbits that answered "1" could both be the same color, say red.
+The rabbit that answered "2" can't be red or the answers would be inconsistent.
+Say the rabbit that answered "2" was blue.
+Then there should be 2 other blue rabbits in the forest that didn't answer into the array.
+The smallest possible number of rabbits in the forest is therefore 5: 3 that answered plus 2 that didn't.
+
+ +

Example 2:

+ +
+Input: answers = [10,10,10]
+Output: 11
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= answers.length <= 1000
    • +
  • 0 <= answers[i] < 1000
    • +
+",2.0,False,"class Solution { +public: + int numRabbits(vector& answers) { + + } +};","class Solution { + public int numRabbits(int[] answers) { + + } +}","class Solution(object): + def numRabbits(self, answers): + """""" + :type answers: List[int] + :rtype: int + """""" + ","class Solution: + def numRabbits(self, answers: List[int]) -> int: + ","int numRabbits(int* answers, int answersSize){ + +}","public class Solution { + public int NumRabbits(int[] answers) { + + } +}","/** + * @param {number[]} answers + * @return {number} + */ +var numRabbits = function(answers) { + +};","# @param {Integer[]} answers +# @return {Integer} +def num_rabbits(answers) + +end","class Solution { + func numRabbits(_ answers: [Int]) -> Int { + + } +}","func numRabbits(answers []int) int { + +}","object Solution { + def numRabbits(answers: Array[Int]): Int = { + + } +}","class Solution { + fun numRabbits(answers: IntArray): Int { + + } +}","impl Solution { + pub fn num_rabbits(answers: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $answers + * @return Integer + */ + function numRabbits($answers) { + + } +}","function numRabbits(answers: number[]): number { + +};","(define/contract (num-rabbits answers) + (-> (listof exact-integer?) exact-integer?) + + )","-spec num_rabbits(Answers :: [integer()]) -> integer(). +num_rabbits(Answers) -> + .","defmodule Solution do + @spec num_rabbits(answers :: [integer]) :: integer + def num_rabbits(answers) do + + end +end","class Solution { + int numRabbits(List answers) { + + } +}", +1554,reaching-points,Reaching Points,780.0,796.0,"

Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false otherwise.

+ +

The allowed operation on some point (x, y) is to convert it to either (x, x + y) or (x + y, y).

+ +

 

+

Example 1:

+ +
+Input: sx = 1, sy = 1, tx = 3, ty = 5
+Output: true
+Explanation:
+One series of moves that transforms the starting point to the target is:
+(1, 1) -> (1, 2)
+(1, 2) -> (3, 2)
+(3, 2) -> (3, 5)
+
+ +

Example 2:

+ +
+Input: sx = 1, sy = 1, tx = 2, ty = 2
+Output: false
+
+ +

Example 3:

+ +
+Input: sx = 1, sy = 1, tx = 1, ty = 1
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= sx, sy, tx, ty <= 109
    • +
+",3.0,False,"class Solution { +public: + bool reachingPoints(int sx, int sy, int tx, int ty) { + + } +};","class Solution { + public boolean reachingPoints(int sx, int sy, int tx, int ty) { + + } +}","class Solution(object): + def reachingPoints(self, sx, sy, tx, ty): + """""" + :type sx: int + :type sy: int + :type tx: int + :type ty: int + :rtype: bool + """""" + ","class Solution: + def reachingPoints(self, sx: int, sy: int, tx: int, ty: int) -> bool: + ","bool reachingPoints(int sx, int sy, int tx, int ty){ + +}","public class Solution { + public bool ReachingPoints(int sx, int sy, int tx, int ty) { + + } +}","/** + * @param {number} sx + * @param {number} sy + * @param {number} tx + * @param {number} ty + * @return {boolean} + */ +var reachingPoints = function(sx, sy, tx, ty) { + +};","# @param {Integer} sx +# @param {Integer} sy +# @param {Integer} tx +# @param {Integer} ty +# @return {Boolean} +def reaching_points(sx, sy, tx, ty) + +end","class Solution { + func reachingPoints(_ sx: Int, _ sy: Int, _ tx: Int, _ ty: Int) -> Bool { + + } +}","func reachingPoints(sx int, sy int, tx int, ty int) bool { + +}","object Solution { + def reachingPoints(sx: Int, sy: Int, tx: Int, ty: Int): Boolean = { + + } +}","class Solution { + fun reachingPoints(sx: Int, sy: Int, tx: Int, ty: Int): Boolean { + + } +}","impl Solution { + pub fn reaching_points(sx: i32, sy: i32, tx: i32, ty: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $sx + * @param Integer $sy + * @param Integer $tx + * @param Integer $ty + * @return Boolean + */ + function reachingPoints($sx, $sy, $tx, $ty) { + + } +}","function reachingPoints(sx: number, sy: number, tx: number, ty: number): boolean { + +};","(define/contract (reaching-points sx sy tx ty) + (-> exact-integer? exact-integer? exact-integer? exact-integer? boolean?) + + )","-spec reaching_points(Sx :: integer(), Sy :: integer(), Tx :: integer(), Ty :: integer()) -> boolean(). +reaching_points(Sx, Sy, Tx, Ty) -> + .","defmodule Solution do + @spec reaching_points(sx :: integer, sy :: integer, tx :: integer, ty :: integer) :: boolean + def reaching_points(sx, sy, tx, ty) do + + end +end","class Solution { + bool reachingPoints(int sx, int sy, int tx, int ty) { + + } +}", +1556,swim-in-rising-water,Swim in Rising Water,778.0,794.0,"

You are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that point (i, j).

+ +

The rain starts to fall. At time t, the depth of the water everywhere is t. You can swim from a square to another 4-directionally adjacent square if and only if the elevation of both squares individually are at most t. You can swim infinite distances in zero time. Of course, you must stay within the boundaries of the grid during your swim.

+ +

Return the least time until you can reach the bottom right square (n - 1, n - 1) if you start at the top left square (0, 0).

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,2],[1,3]]
+Output: 3
+Explanation:
+At time 0, you are in grid location (0, 0).
+You cannot go anywhere else because 4-directionally adjacent neighbors have a higher elevation than t = 0.
+You cannot reach point (1, 1) until time 3.
+When the depth of water is 3, we can swim anywhere inside the grid.
+
+ +

Example 2:

+ +
+Input: grid = [[0,1,2,3,4],[24,23,22,21,5],[12,13,14,15,16],[11,17,18,19,20],[10,9,8,7,6]]
+Output: 16
+Explanation: The final route is shown.
+We need to wait until time 16 so that (0, 0) and (4, 4) are connected.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= n <= 50
    • +
  • 0 <= grid[i][j] < n2
    • +
  • Each value grid[i][j] is unique.
    • +
+",3.0,False,"class Solution { +public: + int swimInWater(vector>& grid) { + + } +};","class Solution { + public int swimInWater(int[][] grid) { + + } +}","class Solution(object): + def swimInWater(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def swimInWater(self, grid: List[List[int]]) -> int: + ","int swimInWater(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int SwimInWater(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var swimInWater = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def swim_in_water(grid) + +end","class Solution { + func swimInWater(_ grid: [[Int]]) -> Int { + + } +}","func swimInWater(grid [][]int) int { + +}","object Solution { + def swimInWater(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun swimInWater(grid: Array): Int { + + } +}","impl Solution { + pub fn swim_in_water(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function swimInWater($grid) { + + } +}","function swimInWater(grid: number[][]): number { + +};","(define/contract (swim-in-water grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec swim_in_water(Grid :: [[integer()]]) -> integer(). +swim_in_water(Grid) -> + .","defmodule Solution do + @spec swim_in_water(grid :: [[integer]]) :: integer + def swim_in_water(grid) do + + end +end","class Solution { + int swimInWater(List> grid) { + + } +}", +1557,swap-adjacent-in-lr-string,Swap Adjacent in LR String,777.0,793.0,"

In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR". Given the starting string start and the ending string end, return True if and only if there exists a sequence of moves to transform one string to the other.

+ +

 

+

Example 1:

+ +
+Input: start = "RXXLRXRXL", end = "XRLXXRRLX"
+Output: true
+Explanation: We can transform start to end following these steps:
+RXXLRXRXL ->
+XRXLRXRXL ->
+XRLXRXRXL ->
+XRLXXRRXL ->
+XRLXXRRLX
+
+ +

Example 2:

+ +
+Input: start = "X", end = "L"
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= start.length <= 104
    • +
  • start.length == end.length
    • +
  • Both start and end will only consist of characters in 'L', 'R', and 'X'.
    • +
+",2.0,False,"class Solution { +public: + bool canTransform(string start, string end) { + + } +};","class Solution { + public boolean canTransform(String start, String end) { + + } +}","class Solution(object): + def canTransform(self, start, end): + """""" + :type start: str + :type end: str + :rtype: bool + """""" + ","class Solution: + def canTransform(self, start: str, end: str) -> bool: + ","bool canTransform(char * start, char * end){ + +}","public class Solution { + public bool CanTransform(string start, string end) { + + } +}","/** + * @param {string} start + * @param {string} end + * @return {boolean} + */ +var canTransform = function(start, end) { + +};","# @param {String} start +# @param {String} end +# @return {Boolean} +def can_transform(start, end) + +end","class Solution { + func canTransform(_ start: String, _ end: String) -> Bool { + + } +}","func canTransform(start string, end string) bool { + +}","object Solution { + def canTransform(start: String, end: String): Boolean = { + + } +}","class Solution { + fun canTransform(start: String, end: String): Boolean { + + } +}","impl Solution { + pub fn can_transform(start: String, end: String) -> bool { + + } +}","class Solution { + + /** + * @param String $start + * @param String $end + * @return Boolean + */ + function canTransform($start, $end) { + + } +}","function canTransform(start: string, end: string): boolean { + +};","(define/contract (can-transform start end) + (-> string? string? boolean?) + + )","-spec can_transform(Start :: unicode:unicode_binary(), End :: unicode:unicode_binary()) -> boolean(). +can_transform(Start, End) -> + .","defmodule Solution do + @spec can_transform(start :: String.t, end :: String.t) :: boolean + def can_transform(start, end) do + + end +end","class Solution { + bool canTransform(String start, String end) { + + } +}", +1558,binary-search,Binary Search,704.0,792.0,"

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

+ +

You must write an algorithm with O(log n) runtime complexity.

+ +

 

+

Example 1:

+ +
+Input: nums = [-1,0,3,5,9,12], target = 9
+Output: 4
+Explanation: 9 exists in nums and its index is 4
+
+ +

Example 2:

+ +
+Input: nums = [-1,0,3,5,9,12], target = 2
+Output: -1
+Explanation: 2 does not exist in nums so return -1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -104 < nums[i], target < 104
    • +
  • All the integers in nums are unique.
    • +
  • nums is sorted in ascending order.
    • +
+",1.0,False,"class Solution { +public: + int search(vector& nums, int target) { + + } +};","class Solution { + public int search(int[] nums, int target) { + + } +}","class Solution(object): + def search(self, nums, target): + """""" + :type nums: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def search(self, nums: List[int], target: int) -> int: + ","int search(int* nums, int numsSize, int target){ + +}","public class Solution { + public int Search(int[] nums, int target) { + + } +}","/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var search = function(nums, target) { + +};","# @param {Integer[]} nums +# @param {Integer} target +# @return {Integer} +def search(nums, target) + +end","class Solution { + func search(_ nums: [Int], _ target: Int) -> Int { + + } +}","func search(nums []int, target int) int { + +}","object Solution { + def search(nums: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun search(nums: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn search(nums: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $target + * @return Integer + */ + function search($nums, $target) { + + } +}","function search(nums: number[], target: number): number { + +};","(define/contract (search nums target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec search(Nums :: [integer()], Target :: integer()) -> integer(). +search(Nums, Target) -> + .","defmodule Solution do + @spec search(nums :: [integer], target :: integer) :: integer + def search(nums, target) do + + end +end","class Solution { + int search(List nums, int target) { + + } +}", +1559,global-and-local-inversions,Global and Local Inversions,775.0,790.0,"

You are given an integer array nums of length n which represents a permutation of all the integers in the range [0, n - 1].

+ +

The number of global inversions is the number of the different pairs (i, j) where:

+ +
    +
  • 0 <= i < j < n
    • +
  • nums[i] > nums[j]
    • +
+ +

The number of local inversions is the number of indices i where:

+ +
    +
  • 0 <= i < n - 1
    • +
  • nums[i] > nums[i + 1]
    • +
+ +

Return true if the number of global inversions is equal to the number of local inversions.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,0,2]
+Output: true
+Explanation: There is 1 global inversion and 1 local inversion.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,0]
+Output: false
+Explanation: There are 2 global inversions and 1 local inversion.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= nums[i] < n
    • +
  • All the integers of nums are unique.
    • +
  • nums is a permutation of all the numbers in the range [0, n - 1].
    • +
+",2.0,False,"class Solution { +public: + bool isIdealPermutation(vector& nums) { + + } +};","class Solution { + public boolean isIdealPermutation(int[] nums) { + + } +}","class Solution(object): + def isIdealPermutation(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def isIdealPermutation(self, nums: List[int]) -> bool: + ","bool isIdealPermutation(int* nums, int numsSize){ + +}","public class Solution { + public bool IsIdealPermutation(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var isIdealPermutation = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def is_ideal_permutation(nums) + +end","class Solution { + func isIdealPermutation(_ nums: [Int]) -> Bool { + + } +}","func isIdealPermutation(nums []int) bool { + +}","object Solution { + def isIdealPermutation(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun isIdealPermutation(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_ideal_permutation(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function isIdealPermutation($nums) { + + } +}","function isIdealPermutation(nums: number[]): boolean { + +};","(define/contract (is-ideal-permutation nums) + (-> (listof exact-integer?) boolean?) + + )","-spec is_ideal_permutation(Nums :: [integer()]) -> boolean(). +is_ideal_permutation(Nums) -> + .","defmodule Solution do + @spec is_ideal_permutation(nums :: [integer]) :: boolean + def is_ideal_permutation(nums) do + + end +end","class Solution { + bool isIdealPermutation(List nums) { + + } +}", +1561,sliding-puzzle,Sliding Puzzle,773.0,787.0,"

On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and a 4-directionally adjacent number and swapping it.

+ +

The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]].

+ +

Given the puzzle board board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1.

+ +

 

+

Example 1:

+ +
+Input: board = [[1,2,3],[4,0,5]]
+Output: 1
+Explanation: Swap the 0 and the 5 in one move.
+
+ +

Example 2:

+ +
+Input: board = [[1,2,3],[5,4,0]]
+Output: -1
+Explanation: No number of moves will make the board solved.
+
+ +

Example 3:

+ +
+Input: board = [[4,1,2],[5,0,3]]
+Output: 5
+Explanation: 5 is the smallest number of moves that solves the board.
+An example path:
+After move 0: [[4,1,2],[5,0,3]]
+After move 1: [[4,1,2],[0,5,3]]
+After move 2: [[0,1,2],[4,5,3]]
+After move 3: [[1,0,2],[4,5,3]]
+After move 4: [[1,2,0],[4,5,3]]
+After move 5: [[1,2,3],[4,5,0]]
+
+ +

 

+

Constraints:

+ +
    +
  • board.length == 2
    • +
  • board[i].length == 3
    • +
  • 0 <= board[i][j] <= 5
    • +
  • Each value board[i][j] is unique.
    • +
+",3.0,False,"class Solution { +public: + int slidingPuzzle(vector>& board) { + + } +};","class Solution { + public int slidingPuzzle(int[][] board) { + + } +}","class Solution(object): + def slidingPuzzle(self, board): + """""" + :type board: List[List[int]] + :rtype: int + """""" + ","class Solution: + def slidingPuzzle(self, board: List[List[int]]) -> int: + ","int slidingPuzzle(int** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public int SlidingPuzzle(int[][] board) { + + } +}","/** + * @param {number[][]} board + * @return {number} + */ +var slidingPuzzle = function(board) { + +};","# @param {Integer[][]} board +# @return {Integer} +def sliding_puzzle(board) + +end","class Solution { + func slidingPuzzle(_ board: [[Int]]) -> Int { + + } +}","func slidingPuzzle(board [][]int) int { + +}","object Solution { + def slidingPuzzle(board: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun slidingPuzzle(board: Array): Int { + + } +}","impl Solution { + pub fn sliding_puzzle(board: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $board + * @return Integer + */ + function slidingPuzzle($board) { + + } +}","function slidingPuzzle(board: number[][]): number { + +};","(define/contract (sliding-puzzle board) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec sliding_puzzle(Board :: [[integer()]]) -> integer(). +sliding_puzzle(Board) -> + .","defmodule Solution do + @spec sliding_puzzle(board :: [[integer]]) :: integer + def sliding_puzzle(board) do + + end +end","class Solution { + int slidingPuzzle(List> board) { + + } +}", +1562,insert-into-a-binary-search-tree,Insert into a Binary Search Tree,701.0,784.0,"

You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

+ +

Notice that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.

+ +

 

+

Example 1:

+ +
+Input: root = [4,2,7,1,3], val = 5
+Output: [4,2,7,1,3,5]
+Explanation: Another accepted tree is:
+
+
+ +

Example 2:

+ +
+Input: root = [40,20,60,10,30,50,70], val = 25
+Output: [40,20,60,10,30,50,70,null,null,25]
+
+ +

Example 3:

+ +
+Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5
+Output: [4,2,7,1,3,5]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree will be in the range [0, 104].
    • +
  • -108 <= Node.val <= 108
    • +
  • All the values Node.val are unique.
    • +
  • -108 <= val <= 108
    • +
  • It's guaranteed that val does not exist in the original BST.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* insertIntoBST(TreeNode* root, int val) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode insertIntoBST(TreeNode root, int val) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def insertIntoBST(self, root, val): + """""" + :type root: TreeNode + :type val: int + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* insertIntoBST(struct TreeNode* root, int val){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode InsertIntoBST(TreeNode root, int val) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} val + * @return {TreeNode} + */ +var insertIntoBST = function(root, val) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} val +# @return {TreeNode} +def insert_into_bst(root, val) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func insertIntoBST(_ root: TreeNode?, _ val: Int) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func insertIntoBST(root *TreeNode, val int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def insertIntoBST(root: TreeNode, `val`: Int): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun insertIntoBST(root: TreeNode?, `val`: Int): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn insert_into_bst(root: Option>>, val: i32) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $val + * @return TreeNode + */ + function insertIntoBST($root, $val) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function insertIntoBST(root: TreeNode | null, val: number): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (insert-into-bst root val) + (-> (or/c tree-node? #f) exact-integer? (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec insert_into_bst(Root :: #tree_node{} | null, Val :: integer()) -> #tree_node{} | null. +insert_into_bst(Root, Val) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec insert_into_bst(root :: TreeNode.t | nil, val :: integer) :: TreeNode.t | nil + def insert_into_bst(root, val) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? insertIntoBST(TreeNode? root, int val) { + + } +}", +1565,basic-calculator-iv,Basic Calculator IV,770.0,781.0,"

Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of evalvars = ["e"] and evalints = [1]), return a list of tokens representing the simplified expression, such as ["-1*a","14"]

+ +
    +
  • An expression alternates chunks and symbols, with a space separating each chunk and symbol.
    • +
  • A chunk is either an expression in parentheses, a variable, or a non-negative integer.
    • +
  • A variable is a string of lowercase letters (not including digits.) Note that variables can be multiple letters, and note that variables never have a leading coefficient or unary operator like "2x" or "-x".
    • +
+ +

Expressions are evaluated in the usual order: brackets first, then multiplication, then addition and subtraction.

+ +
    +
  • For example, expression = "1 + 2 * 3" has an answer of ["7"].
    • +
+ +

The format of the output is as follows:

+ +
    +
  • For each term of free variables with a non-zero coefficient, we write the free variables within a term in sorted order lexicographically. +
      +
    • For example, we would never write a term like "b*a*c", only "a*b*c".
      • +
    +
    • +
  • Terms have degrees equal to the number of free variables being multiplied, counting multiplicity. We write the largest degree terms of our answer first, breaking ties by lexicographic order ignoring the leading coefficient of the term. +
      +
    • For example, "a*a*b*c" has degree 4.
      • +
    +
    • +
  • The leading coefficient of the term is placed directly to the left with an asterisk separating it from the variables (if they exist.) A leading coefficient of 1 is still printed.
    • +
  • An example of a well-formatted answer is ["-2*a*a*a", "3*a*a*b", "3*b*b", "4*a", "5*c", "-6"].
    • +
  • Terms (including constant terms) with coefficient 0 are not included. +
      +
    • For example, an expression of "0" has an output of [].
      • +
    +
    • +
+ +

Note: You may assume that the given expression is always valid. All intermediate results will be in the range of [-231, 231 - 1].

+ +

 

+

Example 1:

+ +
+Input: expression = "e + 8 - a + 5", evalvars = ["e"], evalints = [1]
+Output: ["-1*a","14"]
+
+ +

Example 2:

+ +
+Input: expression = "e - 8 + temperature - pressure", evalvars = ["e", "temperature"], evalints = [1, 12]
+Output: ["-1*pressure","5"]
+
+ +

Example 3:

+ +
+Input: expression = "(e + 8) * (e - 8)", evalvars = [], evalints = []
+Output: ["1*e*e","-64"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= expression.length <= 250
    • +
  • expression consists of lowercase English letters, digits, '+', '-', '*', '(', ')', ' '.
    • +
  • expression does not contain any leading or trailing spaces.
    • +
  • All the tokens in expression are separated by a single space.
    • +
  • 0 <= evalvars.length <= 100
    • +
  • 1 <= evalvars[i].length <= 20
    • +
  • evalvars[i] consists of lowercase English letters.
    • +
  • evalints.length == evalvars.length
    • +
  • -100 <= evalints[i] <= 100
    • +
+",3.0,False,"class Solution { +public: + vector basicCalculatorIV(string expression, vector& evalvars, vector& evalints) { + + } +};","class Solution { + public List basicCalculatorIV(String expression, String[] evalvars, int[] evalints) { + + } +}","class Solution(object): + def basicCalculatorIV(self, expression, evalvars, evalints): + """""" + :type expression: str + :type evalvars: List[str] + :type evalints: List[int] + :rtype: List[str] + """""" + ","class Solution: + def basicCalculatorIV(self, expression: str, evalvars: List[str], evalints: List[int]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** basicCalculatorIV(char * expression, char ** evalvars, int evalvarsSize, int* evalints, int evalintsSize, int* returnSize){ + +}","public class Solution { + public IList BasicCalculatorIV(string expression, string[] evalvars, int[] evalints) { + + } +}","/** + * @param {string} expression + * @param {string[]} evalvars + * @param {number[]} evalints + * @return {string[]} + */ +var basicCalculatorIV = function(expression, evalvars, evalints) { + +};","# @param {String} expression +# @param {String[]} evalvars +# @param {Integer[]} evalints +# @return {String[]} +def basic_calculator_iv(expression, evalvars, evalints) + +end","class Solution { + func basicCalculatorIV(_ expression: String, _ evalvars: [String], _ evalints: [Int]) -> [String] { + + } +}","func basicCalculatorIV(expression string, evalvars []string, evalints []int) []string { + +}","object Solution { + def basicCalculatorIV(expression: String, evalvars: Array[String], evalints: Array[Int]): List[String] = { + + } +}","class Solution { + fun basicCalculatorIV(expression: String, evalvars: Array, evalints: IntArray): List { + + } +}","impl Solution { + pub fn basic_calculator_iv(expression: String, evalvars: Vec, evalints: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String $expression + * @param String[] $evalvars + * @param Integer[] $evalints + * @return String[] + */ + function basicCalculatorIV($expression, $evalvars, $evalints) { + + } +}","function basicCalculatorIV(expression: string, evalvars: string[], evalints: number[]): string[] { + +};","(define/contract (basic-calculator-iv expression evalvars evalints) + (-> string? (listof string?) (listof exact-integer?) (listof string?)) + + )","-spec basic_calculator_iv(Expression :: unicode:unicode_binary(), Evalvars :: [unicode:unicode_binary()], Evalints :: [integer()]) -> [unicode:unicode_binary()]. +basic_calculator_iv(Expression, Evalvars, Evalints) -> + .","defmodule Solution do + @spec basic_calculator_iv(expression :: String.t, evalvars :: [String.t], evalints :: [integer]) :: [String.t] + def basic_calculator_iv(expression, evalvars, evalints) do + + end +end","class Solution { + List basicCalculatorIV(String expression, List evalvars, List evalints) { + + } +}", +1566,max-chunks-to-make-sorted,Max Chunks To Make Sorted,769.0,780.0,"

You are given an integer array arr of length n that represents a permutation of the integers in the range [0, n - 1].

+ +

We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.

+ +

Return the largest number of chunks we can make to sort the array.

+ +

 

+

Example 1:

+ +
+Input: arr = [4,3,2,1,0]
+Output: 1
+Explanation:
+Splitting into two or more chunks will not return the required result.
+For example, splitting into [4, 3], [2, 1, 0] will result in [3, 4, 0, 1, 2], which isn't sorted.
+
+ +

Example 2:

+ +
+Input: arr = [1,0,2,3,4]
+Output: 4
+Explanation:
+We can split into two chunks, such as [1, 0], [2, 3, 4].
+However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks possible.
+
+ +

 

+

Constraints:

+ +
    +
  • n == arr.length
    • +
  • 1 <= n <= 10
    • +
  • 0 <= arr[i] < n
    • +
  • All the elements of arr are unique.
    • +
+",2.0,False,"class Solution { +public: + int maxChunksToSorted(vector& arr) { + + } +};","class Solution { + public int maxChunksToSorted(int[] arr) { + + } +}","class Solution(object): + def maxChunksToSorted(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def maxChunksToSorted(self, arr: List[int]) -> int: + ","int maxChunksToSorted(int* arr, int arrSize){ + +}","public class Solution { + public int MaxChunksToSorted(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var maxChunksToSorted = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def max_chunks_to_sorted(arr) + +end","class Solution { + func maxChunksToSorted(_ arr: [Int]) -> Int { + + } +}","func maxChunksToSorted(arr []int) int { + +}","object Solution { + def maxChunksToSorted(arr: Array[Int]): Int = { + + } +}","class Solution { + fun maxChunksToSorted(arr: IntArray): Int { + + } +}","impl Solution { + pub fn max_chunks_to_sorted(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function maxChunksToSorted($arr) { + + } +}","function maxChunksToSorted(arr: number[]): number { + +};","(define/contract (max-chunks-to-sorted arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_chunks_to_sorted(Arr :: [integer()]) -> integer(). +max_chunks_to_sorted(Arr) -> + .","defmodule Solution do + @spec max_chunks_to_sorted(arr :: [integer]) :: integer + def max_chunks_to_sorted(arr) do + + end +end","class Solution { + int maxChunksToSorted(List arr) { + + } +}", +1567,max-chunks-to-make-sorted-ii,Max Chunks To Make Sorted II,768.0,779.0,"

You are given an integer array arr.

+ +

We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.

+ +

Return the largest number of chunks we can make to sort the array.

+ +

 

+

Example 1:

+ +
+Input: arr = [5,4,3,2,1]
+Output: 1
+Explanation:
+Splitting into two or more chunks will not return the required result.
+For example, splitting into [5, 4], [3, 2, 1] will result in [4, 5, 1, 2, 3], which isn't sorted.
+
+ +

Example 2:

+ +
+Input: arr = [2,1,3,4,4]
+Output: 4
+Explanation:
+We can split into two chunks, such as [2, 1], [3, 4, 4].
+However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks possible.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 2000
    • +
  • 0 <= arr[i] <= 108
    • +
+",3.0,False,"class Solution { +public: + int maxChunksToSorted(vector& arr) { + + } +};","class Solution { + public int maxChunksToSorted(int[] arr) { + + } +}","class Solution(object): + def maxChunksToSorted(self, arr): + """""" + :type arr: List[int] + :rtype: int + """""" + ","class Solution: + def maxChunksToSorted(self, arr: List[int]) -> int: + ","int maxChunksToSorted(int* arr, int arrSize){ + +}","public class Solution { + public int MaxChunksToSorted(int[] arr) { + + } +}","/** + * @param {number[]} arr + * @return {number} + */ +var maxChunksToSorted = function(arr) { + +};","# @param {Integer[]} arr +# @return {Integer} +def max_chunks_to_sorted(arr) + +end","class Solution { + func maxChunksToSorted(_ arr: [Int]) -> Int { + + } +}","func maxChunksToSorted(arr []int) int { + +}","object Solution { + def maxChunksToSorted(arr: Array[Int]): Int = { + + } +}","class Solution { + fun maxChunksToSorted(arr: IntArray): Int { + + } +}","impl Solution { + pub fn max_chunks_to_sorted(arr: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $arr + * @return Integer + */ + function maxChunksToSorted($arr) { + + } +}","function maxChunksToSorted(arr: number[]): number { + +};","(define/contract (max-chunks-to-sorted arr) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_chunks_to_sorted(Arr :: [integer()]) -> integer(). +max_chunks_to_sorted(Arr) -> + .","defmodule Solution do + @spec max_chunks_to_sorted(arr :: [integer]) :: integer + def max_chunks_to_sorted(arr) do + + end +end","class Solution { + int maxChunksToSorted(List arr) { + + } +}", +1573,logical-or-of-two-binary-grids-represented-as-quad-trees,Logical OR of Two Binary Grids Represented as Quad-Trees,558.0,773.0,"

A Binary Matrix is a matrix in which all the elements are either 0 or 1.

+ +

Given quadTree1 and quadTree2. quadTree1 represents a n * n binary matrix and quadTree2 represents another n * n binary matrix.

+ +

Return a Quad-Tree representing the n * n binary matrix which is the result of logical bitwise OR of the two binary matrixes represented by quadTree1 and quadTree2.

+ +

Notice that you can assign the value of a node to True or False when isLeaf is False, and both are accepted in the answer.

+ +

A Quad-Tree is a tree data structure in which each internal node has exactly four children. Besides, each node has two attributes:

+ +
    +
  • val: True if the node represents a grid of 1's or False if the node represents a grid of 0's.
    • +
  • isLeaf: True if the node is leaf node on the tree or False if the node has the four children.
    • +
+ +
+class Node {
+    public boolean val;
+    public boolean isLeaf;
+    public Node topLeft;
+    public Node topRight;
+    public Node bottomLeft;
+    public Node bottomRight;
+}
+ +

We can construct a Quad-Tree from a two-dimensional area using the following steps:

+ +
    +
  1. If the current grid has the same value (i.e all 1's or all 0's) set isLeaf True and set val to the value of the grid and set the four children to Null and stop.
    2. +
  2. If the current grid has different values, set isLeaf to False and set val to any value and divide the current grid into four sub-grids as shown in the photo.
    3. +
  3. Recurse for each of the children with the proper sub-grid.
    4. +
+ +

If you want to know more about the Quad-Tree, you can refer to the wiki.

+ +

Quad-Tree format:

+ +

The input/output represents the serialized format of a Quad-Tree using level order traversal, where null signifies a path terminator where no node exists below.

+ +

It is very similar to the serialization of the binary tree. The only difference is that the node is represented as a list [isLeaf, val].

+ +

If the value of isLeaf or val is True we represent it as 1 in the list [isLeaf, val] and if the value of isLeaf or val is False we represent it as 0.

+ +

 

+

Example 1:

+ +
+Input: quadTree1 = [[0,1],[1,1],[1,1],[1,0],[1,0]]
+, quadTree2 = [[0,1],[1,1],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]]
+Output: [[0,0],[1,1],[1,1],[1,1],[1,0]]
+Explanation: quadTree1 and quadTree2 are shown above. You can see the binary matrix which is represented by each Quad-Tree.
+If we apply logical bitwise OR on the two binary matrices we get the binary matrix below which is represented by the result Quad-Tree.
+Notice that the binary matrices shown are only for illustration, you don't have to construct the binary matrix to get the result tree.
+
+
+ +

Example 2:

+ +
+Input: quadTree1 = [[1,0]], quadTree2 = [[1,0]]
+Output: [[1,0]]
+Explanation: Each tree represents a binary matrix of size 1*1. Each matrix contains only zero.
+The resulting matrix is of size 1*1 with also zero.
+
+ +

 

+

Constraints:

+ +
    +
  • quadTree1 and quadTree2 are both valid Quad-Trees each representing a n * n grid.
    • +
  • n == 2x where 0 <= x <= 9.
    • +
+",2.0,False,"/* +// Definition for a QuadTree node. +class Node { +public: + bool val; + bool isLeaf; + Node* topLeft; + Node* topRight; + Node* bottomLeft; + Node* bottomRight; + + Node() { + val = false; + isLeaf = false; + topLeft = NULL; + topRight = NULL; + bottomLeft = NULL; + bottomRight = NULL; + } + + Node(bool _val, bool _isLeaf) { + val = _val; + isLeaf = _isLeaf; + topLeft = NULL; + topRight = NULL; + bottomLeft = NULL; + bottomRight = NULL; + } + + Node(bool _val, bool _isLeaf, Node* _topLeft, Node* _topRight, Node* _bottomLeft, Node* _bottomRight) { + val = _val; + isLeaf = _isLeaf; + topLeft = _topLeft; + topRight = _topRight; + bottomLeft = _bottomLeft; + bottomRight = _bottomRight; + } +}; +*/ + +class Solution { +public: + Node* intersect(Node* quadTree1, Node* quadTree2) { + + } +};","/* +// Definition for a QuadTree node. +class Node { + public boolean val; + public boolean isLeaf; + public Node topLeft; + public Node topRight; + public Node bottomLeft; + public Node bottomRight; + + public Node() {} + + public Node(boolean _val,boolean _isLeaf,Node _topLeft,Node _topRight,Node _bottomLeft,Node _bottomRight) { + val = _val; + isLeaf = _isLeaf; + topLeft = _topLeft; + topRight = _topRight; + bottomLeft = _bottomLeft; + bottomRight = _bottomRight; + } +}; +*/ + +class Solution { + public Node intersect(Node quadTree1, Node quadTree2) { + + } +}",""""""" +# Definition for a QuadTree node. +class Node(object): + def __init__(self, val, isLeaf, topLeft, topRight, bottomLeft, bottomRight): + self.val = val + self.isLeaf = isLeaf + self.topLeft = topLeft + self.topRight = topRight + self.bottomLeft = bottomLeft + self.bottomRight = bottomRight +"""""" + +class Solution(object): + def intersect(self, quadTree1, quadTree2): + """""" + :type quadTree1: Node + :type quadTree2: Node + :rtype: Node + """""" + ",""""""" +# Definition for a QuadTree node. +class Node: + def __init__(self, val, isLeaf, topLeft, topRight, bottomLeft, bottomRight): + self.val = val + self.isLeaf = isLeaf + self.topLeft = topLeft + self.topRight = topRight + self.bottomLeft = bottomLeft + self.bottomRight = bottomRight +"""""" + +class Solution: + def intersect(self, quadTree1: 'Node', quadTree2: 'Node') -> 'Node': + ",,"/* +// Definition for a QuadTree node. +public class Node { + public bool val; + public bool isLeaf; + public Node topLeft; + public Node topRight; + public Node bottomLeft; + public Node bottomRight; + + public Node(){} + public Node(bool _val,bool _isLeaf,Node _topLeft,Node _topRight,Node _bottomLeft,Node _bottomRight) { + val = _val; + isLeaf = _isLeaf; + topLeft = _topLeft; + topRight = _topRight; + bottomLeft = _bottomLeft; + bottomRight = _bottomRight; + } +} +*/ + +public class Solution { + public Node Intersect(Node quadTree1, Node quadTree2) { + + } +}","/** + * // Definition for a QuadTree node. + * function Node(val,isLeaf,topLeft,topRight,bottomLeft,bottomRight) { + * this.val = val; + * this.isLeaf = isLeaf; + * this.topLeft = topLeft; + * this.topRight = topRight; + * this.bottomLeft = bottomLeft; + * this.bottomRight = bottomRight; + * }; + */ + +/** + * @param {Node} quadTree1 + * @param {Node} quadTree2 + * @return {Node} + */ +var intersect = function(quadTree1, quadTree2) { + +};","# Definition for a QuadTree node. +# class Node +# attr_accessor :val, :isLeaf, :topLeft, :topRight, :bottomLeft, :bottomRight +# def initialize(val=false, isLeaf=false, topLeft=nil, topRight=nil, bottomLeft=nil, bottomRight=nil) +# @val = val +# @isLeaf = isLeaf +# @topLeft = topLeft +# @topRight = topRight +# @bottomLeft = bottomLeft +# @bottomRight = bottomRight +# end +# end + +# @param {Node} quadTree1 +# @param {Node} quadTree2 +# @return {Node} +def intersect(quadTree1, quadTree2) + +end +","/** + * Definition for a Node. + * public class Node { + * public var val: Bool + * public var isLeaf: Bool + * public var topLeft: Node? + * public var topRight: Node? + * public var bottomLeft: Node? + * public var bottomRight: Node? + * public init(_ val: Bool, _ isLeaf: Bool) { + * self.val = val + * self.isLeaf = isLeaf + * self.topLeft = nil + * self.topRight = nil + * self.bottomLeft = nil + * self.bottomRight = nil + * } + * } + */ + +class Solution { + func intersect(_ quadTree1: Node?, _ quadTree2: Node?) -> Node? { + + } +}","/** + * Definition for a QuadTree node. + * type Node struct { + * Val bool + * IsLeaf bool + * TopLeft *Node + * TopRight *Node + * BottomLeft *Node + * BottomRight *Node + * } + */ + +func intersect(quadTree1 *Node, quadTree2 *Node) *Node { + +}","/** + * Definition for a QuadTree node. + * class Node(var _value: Boolean, var _isLeaf: Boolean) { + * var value: Int = _value + * var isLeaf: Boolean = _isLeaf + * var topLeft: Node = null + * var topRight: Node = null + * var bottomLeft: Node = null + * var bottomRight: Node = null + * } + */ + +object Solution { + def intersect(quadTree1: Node, quadTree2: Node): Node = { + + } +}","/** + * Definition for a QuadTree node. + * class Node(var `val`: Boolean, var isLeaf: Boolean) { + * var topLeft: Node? = null + * var topRight: Node? = null + * var bottomLeft: Node? = null + * var bottomRight: Node? = null + * } + */ + +class Solution { + fun intersect(quadTree1: Node?, quadTree2: Node?): Node? { + + } +}",,"/** + * Definition for a QuadTree node. + * class Node { + * public $val = null; + * public $isLeaf = null; + * public $topLeft = null; + * public $topRight = null; + * public $bottomLeft = null; + * public $bottomRight = null; + * function __construct($val, $isLeaf) { + * $this->val = $val; + * $this->isLeaf = $isLeaf; + * $this->topLeft = null; + * $this->topRight = null; + * $this->bottomLeft = null; + * $this->bottomRight = null; + * } + * } + */ + +class Solution { + /** + * @param Node $quadTree1 + * @param Node $quadTree2 + * @return Node + */ + function intersect($quadTree1, $quadTree2) { + + } +}","/** + * Definition for node. + * class Node { + * val: boolean + * isLeaf: boolean + * topLeft: Node | null + * topRight: Node | null + * bottomLeft: Node | null + * bottomRight: Node | null + * constructor(val?: boolean, isLeaf?: boolean, topLeft?: Node, topRight?: Node, bottomLeft?: Node, bottomRight?: Node) { + * this.val = (val===undefined ? false : val) + * this.isLeaf = (isLeaf===undefined ? false : isLeaf) + * this.topLeft = (topLeft===undefined ? null : topLeft) + * this.topRight = (topRight===undefined ? null : topRight) + * this.bottomLeft = (bottomLeft===undefined ? null : bottomLeft) + * this.bottomRight = (bottomRight===undefined ? null : bottomRight) + * } + * } + */ + +function intersect(quadTree1: Node | null, quadTree2: Node | null): Node | null { + +};",,,,, +1574,construct-quad-tree,Construct Quad Tree,427.0,772.0,"

Given a n * n matrix grid of 0's and 1's only. We want to represent grid with a Quad-Tree.

+ +

Return the root of the Quad-Tree representing grid.

+ +

A Quad-Tree is a tree data structure in which each internal node has exactly four children. Besides, each node has two attributes:

+ +
    +
  • val: True if the node represents a grid of 1's or False if the node represents a grid of 0's. Notice that you can assign the val to True or False when isLeaf is False, and both are accepted in the answer.
    • +
  • isLeaf: True if the node is a leaf node on the tree or False if the node has four children.
    • +
+ +
+class Node {
+    public boolean val;
+    public boolean isLeaf;
+    public Node topLeft;
+    public Node topRight;
+    public Node bottomLeft;
+    public Node bottomRight;
+}
+ +

We can construct a Quad-Tree from a two-dimensional area using the following steps:

+ +
    +
  1. If the current grid has the same value (i.e all 1's or all 0's) set isLeaf True and set val to the value of the grid and set the four children to Null and stop.
    2. +
  2. If the current grid has different values, set isLeaf to False and set val to any value and divide the current grid into four sub-grids as shown in the photo.
    3. +
  3. Recurse for each of the children with the proper sub-grid.
    4. +
+ +

If you want to know more about the Quad-Tree, you can refer to the wiki.

+ +

Quad-Tree format:

+ +

You don't need to read this section for solving the problem. This is only if you want to understand the output format here. The output represents the serialized format of a Quad-Tree using level order traversal, where null signifies a path terminator where no node exists below.

+ +

It is very similar to the serialization of the binary tree. The only difference is that the node is represented as a list [isLeaf, val].

+ +

If the value of isLeaf or val is True we represent it as 1 in the list [isLeaf, val] and if the value of isLeaf or val is False we represent it as 0.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1],[1,0]]
+Output: [[0,1],[1,0],[1,1],[1,1],[1,0]]
+Explanation: The explanation of this example is shown below:
+Notice that 0 represents False and 1 represents True in the photo representing the Quad-Tree.
+
+
+ +

Example 2:

+ +

+ +
+Input: grid = [[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0]]
+Output: [[0,1],[1,1],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]]
+Explanation: All values in the grid are not the same. We divide the grid into four sub-grids.
+The topLeft, bottomLeft and bottomRight each has the same value.
+The topRight have different values so we divide it into 4 sub-grids where each has the same value.
+Explanation is shown in the photo below:
+
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
    • +
  • n == 2x where 0 <= x <= 6
    • +
+",2.0,False,"/* +// Definition for a QuadTree node. +class Node { +public: + bool val; + bool isLeaf; + Node* topLeft; + Node* topRight; + Node* bottomLeft; + Node* bottomRight; + + Node() { + val = false; + isLeaf = false; + topLeft = NULL; + topRight = NULL; + bottomLeft = NULL; + bottomRight = NULL; + } + + Node(bool _val, bool _isLeaf) { + val = _val; + isLeaf = _isLeaf; + topLeft = NULL; + topRight = NULL; + bottomLeft = NULL; + bottomRight = NULL; + } + + Node(bool _val, bool _isLeaf, Node* _topLeft, Node* _topRight, Node* _bottomLeft, Node* _bottomRight) { + val = _val; + isLeaf = _isLeaf; + topLeft = _topLeft; + topRight = _topRight; + bottomLeft = _bottomLeft; + bottomRight = _bottomRight; + } +}; +*/ + +class Solution { +public: + Node* construct(vector>& grid) { + + } +};","/* +// Definition for a QuadTree node. +class Node { + public boolean val; + public boolean isLeaf; + public Node topLeft; + public Node topRight; + public Node bottomLeft; + public Node bottomRight; + + + public Node() { + this.val = false; + this.isLeaf = false; + this.topLeft = null; + this.topRight = null; + this.bottomLeft = null; + this.bottomRight = null; + } + + public Node(boolean val, boolean isLeaf) { + this.val = val; + this.isLeaf = isLeaf; + this.topLeft = null; + this.topRight = null; + this.bottomLeft = null; + this.bottomRight = null; + } + + public Node(boolean val, boolean isLeaf, Node topLeft, Node topRight, Node bottomLeft, Node bottomRight) { + this.val = val; + this.isLeaf = isLeaf; + this.topLeft = topLeft; + this.topRight = topRight; + this.bottomLeft = bottomLeft; + this.bottomRight = bottomRight; + } +}; +*/ + +class Solution { + public Node construct(int[][] grid) { + + } +}",""""""" +# Definition for a QuadTree node. +class Node(object): + def __init__(self, val, isLeaf, topLeft, topRight, bottomLeft, bottomRight): + self.val = val + self.isLeaf = isLeaf + self.topLeft = topLeft + self.topRight = topRight + self.bottomLeft = bottomLeft + self.bottomRight = bottomRight +"""""" + +class Solution(object): + def construct(self, grid): + """""" + :type grid: List[List[int]] + :rtype: Node + """""" + ",""""""" +# Definition for a QuadTree node. +class Node: + def __init__(self, val, isLeaf, topLeft, topRight, bottomLeft, bottomRight): + self.val = val + self.isLeaf = isLeaf + self.topLeft = topLeft + self.topRight = topRight + self.bottomLeft = bottomLeft + self.bottomRight = bottomRight +"""""" + +class Solution: + def construct(self, grid: List[List[int]]) -> 'Node': + ",,"/* +// Definition for a QuadTree node. +public class Node { + public bool val; + public bool isLeaf; + public Node topLeft; + public Node topRight; + public Node bottomLeft; + public Node bottomRight; + + public Node() { + val = false; + isLeaf = false; + topLeft = null; + topRight = null; + bottomLeft = null; + bottomRight = null; + } + + public Node(bool _val, bool _isLeaf) { + val = _val; + isLeaf = _isLeaf; + topLeft = null; + topRight = null; + bottomLeft = null; + bottomRight = null; + } + + public Node(bool _val,bool _isLeaf,Node _topLeft,Node _topRight,Node _bottomLeft,Node _bottomRight) { + val = _val; + isLeaf = _isLeaf; + topLeft = _topLeft; + topRight = _topRight; + bottomLeft = _bottomLeft; + bottomRight = _bottomRight; + } +} +*/ + +public class Solution { + public Node Construct(int[][] grid) { + + } +}","/** + * // Definition for a QuadTree node. + * function Node(val,isLeaf,topLeft,topRight,bottomLeft,bottomRight) { + * this.val = val; + * this.isLeaf = isLeaf; + * this.topLeft = topLeft; + * this.topRight = topRight; + * this.bottomLeft = bottomLeft; + * this.bottomRight = bottomRight; + * }; + */ + +/** + * @param {number[][]} grid + * @return {Node} + */ +var construct = function(grid) { + +};","# Definition for a QuadTree node. +# class Node +# attr_accessor :val, :isLeaf, :topLeft, :topRight, :bottomLeft, :bottomRight +# def initialize(val=false, isLeaf=false, topLeft=nil, topRight=nil, bottomLeft=nil, bottomRight=nil) +# @val = val +# @isLeaf = isLeaf +# @topLeft = topLeft +# @topRight = topRight +# @bottomLeft = bottomLeft +# @bottomRight = bottomRight +# end +# end + +# @param {Integer[][]} grid +# @return {Node} +def construct(grid) + +end","/** + * Definition for a QuadTree node. + * public class Node { + * public var val: Bool + * public var isLeaf: Bool + * public var topLeft: Node? + * public var topRight: Node? + * public var bottomLeft: Node? + * public var bottomRight: Node? + * public init(_ val: Bool, _ isLeaf: Bool) { + * self.val = val + * self.isLeaf = isLeaf + * self.topLeft = nil + * self.topRight = nil + * self.bottomLeft = nil + * self.bottomRight = nil + * } + * } + */ + +class Solution { + func construct(_ grid: [[Int]]) -> Node? { + + } +}","/** + * Definition for a QuadTree node. + * type Node struct { + * Val bool + * IsLeaf bool + * TopLeft *Node + * TopRight *Node + * BottomLeft *Node + * BottomRight *Node + * } + */ + +func construct(grid [][]int) *Node { + +}","/** + * Definition for a QuadTree node. + * class Node(var _value: Boolean, var _isLeaf: Boolean) { + * var value: Int = _value + * var isLeaf: Boolean = _isLeaf + * var topLeft: Node = null + * var topRight: Node = null + * var bottomLeft: Node = null + * var bottomRight: Node = null + * } + */ + +object Solution { + def construct(grid: Array[Array[Int]]): Node = { + + } +}","/** + * Definition for a QuadTree node. + * class Node(var `val`: Boolean, var isLeaf: Boolean) { + * var topLeft: Node? = null + * var topRight: Node? = null + * var bottomLeft: Node? = null + * var bottomRight: Node? = null + * } + */ + +class Solution { + fun construct(grid: Array): Node? { + + } +}",,"/** + * Definition for a QuadTree node. + * class Node { + * public $val = null; + * public $isLeaf = null; + * public $topLeft = null; + * public $topRight = null; + * public $bottomLeft = null; + * public $bottomRight = null; + * function __construct($val, $isLeaf) { + * $this->val = $val; + * $this->isLeaf = $isLeaf; + * $this->topLeft = null; + * $this->topRight = null; + * $this->bottomLeft = null; + * $this->bottomRight = null; + * } + * } + */ + +class Solution { + /** + * @param Integer[][] $grid + * @return Node + */ + function construct($grid) { + + } +}","/** + * Definition for node. + * class Node { + * val: boolean + * isLeaf: boolean + * topLeft: Node | null + * topRight: Node | null + * bottomLeft: Node | null + * bottomRight: Node | null + * constructor(val?: boolean, isLeaf?: boolean, topLeft?: Node, topRight?: Node, bottomLeft?: Node, bottomRight?: Node) { + * this.val = (val===undefined ? false : val) + * this.isLeaf = (isLeaf===undefined ? false : isLeaf) + * this.topLeft = (topLeft===undefined ? null : topLeft) + * this.topRight = (topRight===undefined ? null : topRight) + * this.bottomLeft = (bottomLeft===undefined ? null : bottomLeft) + * this.bottomRight = (bottomRight===undefined ? null : bottomRight) + * } + * } + */ + +function construct(grid: number[][]): Node | null { + +};",,,,, +1575,couples-holding-hands,Couples Holding Hands,765.0,770.0,"

There are n couples sitting in 2n seats arranged in a row and want to hold hands.

+ +

The people and seats are represented by an integer array row where row[i] is the ID of the person sitting in the ith seat. The couples are numbered in order, the first couple being (0, 1), the second couple being (2, 3), and so on with the last couple being (2n - 2, 2n - 1).

+ +

Return the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people, then they stand up and switch seats.

+ +

 

+

Example 1:

+ +
+Input: row = [0,2,1,3]
+Output: 1
+Explanation: We only need to swap the second (row[1]) and third (row[2]) person.
+
+ +

Example 2:

+ +
+Input: row = [3,2,0,1]
+Output: 0
+Explanation: All couples are already seated side by side.
+
+ +

 

+

Constraints:

+ +
    +
  • 2n == row.length
    • +
  • 2 <= n <= 30
    • +
  • n is even.
    • +
  • 0 <= row[i] < 2n
    • +
  • All the elements of row are unique.
    • +
+",3.0,False,"class Solution { +public: + int minSwapsCouples(vector& row) { + + } +};","class Solution { + public int minSwapsCouples(int[] row) { + + } +}","class Solution(object): + def minSwapsCouples(self, row): + """""" + :type row: List[int] + :rtype: int + """""" + ","class Solution: + def minSwapsCouples(self, row: List[int]) -> int: + ","int minSwapsCouples(int* row, int rowSize){ + +}","public class Solution { + public int MinSwapsCouples(int[] row) { + + } +}","/** + * @param {number[]} row + * @return {number} + */ +var minSwapsCouples = function(row) { + +};","# @param {Integer[]} row +# @return {Integer} +def min_swaps_couples(row) + +end","class Solution { + func minSwapsCouples(_ row: [Int]) -> Int { + + } +}","func minSwapsCouples(row []int) int { + +}","object Solution { + def minSwapsCouples(row: Array[Int]): Int = { + + } +}","class Solution { + fun minSwapsCouples(row: IntArray): Int { + + } +}","impl Solution { + pub fn min_swaps_couples(row: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $row + * @return Integer + */ + function minSwapsCouples($row) { + + } +}","function minSwapsCouples(row: number[]): number { + +};","(define/contract (min-swaps-couples row) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_swaps_couples(Row :: [integer()]) -> integer(). +min_swaps_couples(Row) -> + .","defmodule Solution do + @spec min_swaps_couples(row :: [integer]) :: integer + def min_swaps_couples(row) do + + end +end","class Solution { + int minSwapsCouples(List row) { + + } +}", +1577,partition-labels,Partition Labels,763.0,768.0,"

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part.

+ +

Note that the partition is done so that after concatenating all the parts in order, the resultant string should be s.

+ +

Return a list of integers representing the size of these parts.

+ +

 

+

Example 1:

+ +
+Input: s = "ababcbacadefegdehijhklij"
+Output: [9,7,8]
+Explanation:
+The partition is "ababcbaca", "defegde", "hijhklij".
+This is a partition so that each letter appears in at most one part.
+A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts.
+
+ +

Example 2:

+ +
+Input: s = "eccbbbbdec"
+Output: [10]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 500
    • +
  • s consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector partitionLabels(string s) { + + } +};","class Solution { + public List partitionLabels(String s) { + + } +}","class Solution(object): + def partitionLabels(self, s): + """""" + :type s: str + :rtype: List[int] + """""" + ","class Solution: + def partitionLabels(self, s: str) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* partitionLabels(char * s, int* returnSize){ + +}","public class Solution { + public IList PartitionLabels(string s) { + + } +}","/** + * @param {string} s + * @return {number[]} + */ +var partitionLabels = function(s) { + +};","# @param {String} s +# @return {Integer[]} +def partition_labels(s) + +end","class Solution { + func partitionLabels(_ s: String) -> [Int] { + + } +}","func partitionLabels(s string) []int { + +}","object Solution { + def partitionLabels(s: String): List[Int] = { + + } +}","class Solution { + fun partitionLabels(s: String): List { + + } +}","impl Solution { + pub fn partition_labels(s: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer[] + */ + function partitionLabels($s) { + + } +}","function partitionLabels(s: string): number[] { + +};","(define/contract (partition-labels s) + (-> string? (listof exact-integer?)) + + )","-spec partition_labels(S :: unicode:unicode_binary()) -> [integer()]. +partition_labels(S) -> + .","defmodule Solution do + @spec partition_labels(s :: String.t) :: [integer] + def partition_labels(s) do + + end +end","class Solution { + List partitionLabels(String s) { + + } +}", +1578,prime-number-of-set-bits-in-binary-representation,Prime Number of Set Bits in Binary Representation,762.0,767.0,"

Given two integers left and right, return the count of numbers in the inclusive range [left, right] having a prime number of set bits in their binary representation.

+ +

Recall that the number of set bits an integer has is the number of 1's present when written in binary.

+ +
    +
  • For example, 21 written in binary is 10101, which has 3 set bits.
    • +
+ +

 

+

Example 1:

+ +
+Input: left = 6, right = 10
+Output: 4
+Explanation:
+6  -> 110 (2 set bits, 2 is prime)
+7  -> 111 (3 set bits, 3 is prime)
+8  -> 1000 (1 set bit, 1 is not prime)
+9  -> 1001 (2 set bits, 2 is prime)
+10 -> 1010 (2 set bits, 2 is prime)
+4 numbers have a prime number of set bits.
+
+ +

Example 2:

+ +
+Input: left = 10, right = 15
+Output: 5
+Explanation:
+10 -> 1010 (2 set bits, 2 is prime)
+11 -> 1011 (3 set bits, 3 is prime)
+12 -> 1100 (2 set bits, 2 is prime)
+13 -> 1101 (3 set bits, 3 is prime)
+14 -> 1110 (3 set bits, 3 is prime)
+15 -> 1111 (4 set bits, 4 is not prime)
+5 numbers have a prime number of set bits.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left <= right <= 106
    • +
  • 0 <= right - left <= 104
    • +
+",1.0,False,"class Solution { +public: + int countPrimeSetBits(int left, int right) { + + } +};","class Solution { + public int countPrimeSetBits(int left, int right) { + + } +}","class Solution(object): + def countPrimeSetBits(self, left, right): + """""" + :type left: int + :type right: int + :rtype: int + """""" + ","class Solution: + def countPrimeSetBits(self, left: int, right: int) -> int: + ","int countPrimeSetBits(int left, int right){ + +}","public class Solution { + public int CountPrimeSetBits(int left, int right) { + + } +}","/** + * @param {number} left + * @param {number} right + * @return {number} + */ +var countPrimeSetBits = function(left, right) { + +};","# @param {Integer} left +# @param {Integer} right +# @return {Integer} +def count_prime_set_bits(left, right) + +end","class Solution { + func countPrimeSetBits(_ left: Int, _ right: Int) -> Int { + + } +}","func countPrimeSetBits(left int, right int) int { + +}","object Solution { + def countPrimeSetBits(left: Int, right: Int): Int = { + + } +}","class Solution { + fun countPrimeSetBits(left: Int, right: Int): Int { + + } +}","impl Solution { + pub fn count_prime_set_bits(left: i32, right: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $left + * @param Integer $right + * @return Integer + */ + function countPrimeSetBits($left, $right) { + + } +}","function countPrimeSetBits(left: number, right: number): number { + +};","(define/contract (count-prime-set-bits left right) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec count_prime_set_bits(Left :: integer(), Right :: integer()) -> integer(). +count_prime_set_bits(Left, Right) -> + .","defmodule Solution do + @spec count_prime_set_bits(left :: integer, right :: integer) :: integer + def count_prime_set_bits(left, right) do + + end +end","class Solution { + int countPrimeSetBits(int left, int right) { + + } +}", +1579,flatten-a-multilevel-doubly-linked-list,Flatten a Multilevel Doubly Linked List,430.0,766.0,"

You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additional child pointer. This child pointer may or may not point to a separate doubly linked list, also containing these special nodes. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure as shown in the example below.

+ +

Given the head of the first level of the list, flatten the list so that all the nodes appear in a single-level, doubly linked list. Let curr be a node with a child list. The nodes in the child list should appear after curr and before curr.next in the flattened list.

+ +

Return the head of the flattened list. The nodes in the list must have all of their child pointers set to null.

+ +

 

+

Example 1:

+ +
+Input: head = [1,2,3,4,5,6,null,null,null,7,8,9,10,null,null,11,12]
+Output: [1,2,3,7,8,11,12,9,10,4,5,6]
+Explanation: The multilevel linked list in the input is shown.
+After flattening the multilevel linked list it becomes:
+
+
+ +

Example 2:

+ +
+Input: head = [1,2,null,3]
+Output: [1,3,2]
+Explanation: The multilevel linked list in the input is shown.
+After flattening the multilevel linked list it becomes:
+
+
+ +

Example 3:

+ +
+Input: head = []
+Output: []
+Explanation: There could be empty list in the input.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of Nodes will not exceed 1000.
    • +
  • 1 <= Node.val <= 105
    • +
+ +

 

+

How the multilevel linked list is represented in test cases:

+ +

We use the multilevel linked list from Example 1 above:

+ +
+ 1---2---3---4---5---6--NULL
+         |
+         7---8---9---10--NULL
+             |
+             11--12--NULL
+ +

The serialization of each level is as follows:

+ +
+[1,2,3,4,5,6,null]
+[7,8,9,10,null]
+[11,12,null]
+
+ +

To serialize all levels together, we will add nulls in each level to signify no node connects to the upper node of the previous level. The serialization becomes:

+ +
+[1,    2,    3, 4, 5, 6, null]
+             |
+[null, null, 7,    8, 9, 10, null]
+                   |
+[            null, 11, 12, null]
+
+ +

Merging the serialization of each level and removing trailing nulls we obtain:

+ +
+[1,2,3,4,5,6,null,null,null,7,8,9,10,null,null,11,12]
+
+",2.0,False,"/* +// Definition for a Node. +class Node { +public: + int val; + Node* prev; + Node* next; + Node* child; +}; +*/ + +class Solution { +public: + Node* flatten(Node* head) { + + } +};","/* +// Definition for a Node. +class Node { + public int val; + public Node prev; + public Node next; + public Node child; +}; +*/ + +class Solution { + public Node flatten(Node head) { + + } +}",""""""" +# Definition for a Node. +class Node(object): + def __init__(self, val, prev, next, child): + self.val = val + self.prev = prev + self.next = next + self.child = child +"""""" + +class Solution(object): + def flatten(self, head): + """""" + :type head: Node + :rtype: Node + """""" + ",""""""" +# Definition for a Node. +class Node: + def __init__(self, val, prev, next, child): + self.val = val + self.prev = prev + self.next = next + self.child = child +"""""" + +class Solution: + def flatten(self, head: 'Optional[Node]') -> 'Optional[Node]': + ",,"/* +// Definition for a Node. +public class Node { + public int val; + public Node prev; + public Node next; + public Node child; +} +*/ + +public class Solution { + public Node Flatten(Node head) { + + } +}","/** + * // Definition for a Node. + * function Node(val,prev,next,child) { + * this.val = val; + * this.prev = prev; + * this.next = next; + * this.child = child; + * }; + */ + +/** + * @param {Node} head + * @return {Node} + */ +var flatten = function(head) { + +};","# Definition for a Node. +# class Node +# attr_accessor :val, :prev, :next, :child +# def initialize(val=nil, prev=nil, next_=nil, child=nil) +# @val = val +# @prev = prev +# @next = next_ +# @child = child +# end +# end + +# @param {Node} root +# @return {Node} +def flatten(root) + +end","/** + * Definition for a Node. + * public class Node { + * public var val: Int + * public var prev: Node? + * public var next: Node? + * public var child: Node? + * public init(_ val: Int) { + * self.val = val + * self.prev = nil + * self.next = nil + * self.child = nil + * } + * } + */ + +class Solution { + func flatten(_ head: Node?) -> Node? { + + } +}","/** + * Definition for a Node. + * type Node struct { + * Val int + * Prev *Node + * Next *Node + * Child *Node + * } + */ + +func flatten(root *Node) *Node { + +}","/** + * Definition for a Node. + * class Node(var _value: Int) { + * var value: Int = _value + * var prev: Node = null + * var next: Node = null + * var child: Node = null + * } + */ + +object Solution { + def flatten(head: Node): Node = { + + } +}","/** + * Definition for a Node. + * class Node(var `val`: Int) { + * var prev: Node? = null + * var next: Node? = null + * var child: Node? = null + * } + */ + +class Solution { + fun flatten(root: Node?): Node? { + + } +}",,"/** + * Definition for a Node. + * class Node { + * public $val = null; + * public $prev = null; + * public $next = null; + * public $child = null; + * function __construct($val = 0) { + * $this->val = $val; + * $this->prev = null; + * $this->next = null; + * $this->child = null; + * } + * } + */ + +class Solution { + /** + * @param Node $head + * @return Node + */ + function flatten($head) { + + } +}","/** + * Definition for node. + * class Node { + * val: number + * prev: Node | null + * next: Node | null + * child: Node | null + * constructor(val?: number, prev? : Node, next? : Node, child? : Node) { + * this.val = (val===undefined ? 0 : val); + * this.prev = (prev===undefined ? null : prev); + * this.next = (next===undefined ? null : next); + * this.child = (child===undefined ? null : child); + * } + * } + */ + +function flatten(head: Node | null): Node | null { + +};",,,,, +1581,special-binary-string,Special Binary String,761.0,763.0,"

Special binary strings are binary strings with the following two properties:

+ +
    +
  • The number of 0's is equal to the number of 1's.
    • +
  • Every prefix of the binary string has at least as many 1's as 0's.
    • +
+ +

You are given a special binary string s.

+ +

A move consists of choosing two consecutive, non-empty, special substrings of s, and swapping them. Two strings are consecutive if the last character of the first string is exactly one index before the first character of the second string.

+ +

Return the lexicographically largest resulting string possible after applying the mentioned operations on the string.

+ +

 

+

Example 1:

+ +
+Input: s = "11011000"
+Output: "11100100"
+Explanation: The strings "10" [occuring at s[1]] and "1100" [at s[3]] are swapped.
+This is the lexicographically largest string possible after some number of swaps.
+
+ +

Example 2:

+ +
+Input: s = "10"
+Output: "10"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 50
    • +
  • s[i] is either '0' or '1'.
    • +
  • s is a special binary string.
    • +
+",3.0,False,"class Solution { +public: + string makeLargestSpecial(string s) { + + } +};","class Solution { + public String makeLargestSpecial(String s) { + + } +}","class Solution(object): + def makeLargestSpecial(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def makeLargestSpecial(self, s: str) -> str: + ","char * makeLargestSpecial(char * s){ + +}","public class Solution { + public string MakeLargestSpecial(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var makeLargestSpecial = function(s) { + +};","# @param {String} s +# @return {String} +def make_largest_special(s) + +end","class Solution { + func makeLargestSpecial(_ s: String) -> String { + + } +}","func makeLargestSpecial(s string) string { + +}","object Solution { + def makeLargestSpecial(s: String): String = { + + } +}","class Solution { + fun makeLargestSpecial(s: String): String { + + } +}","impl Solution { + pub fn make_largest_special(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function makeLargestSpecial($s) { + + } +}","function makeLargestSpecial(s: string): string { + +};","(define/contract (make-largest-special s) + (-> string? string?) + + )","-spec make_largest_special(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +make_largest_special(S) -> + .","defmodule Solution do + @spec make_largest_special(s :: String.t) :: String.t + def make_largest_special(s) do + + end +end","class Solution { + String makeLargestSpecial(String s) { + + } +}", +1582,set-intersection-size-at-least-two,Set Intersection Size At Least Two,757.0,759.0,"

You are given a 2D integer array intervals where intervals[i] = [starti, endi] represents all the integers from starti to endi inclusively.

+ +

A containing set is an array nums where each interval from intervals has at least two integers in nums.

+ +
    +
  • For example, if intervals = [[1,3], [3,7], [8,9]], then [1,2,4,7,8,9] and [2,3,4,8,9] are containing sets.
    • +
+ +

Return the minimum possible size of a containing set.

+ +

 

+

Example 1:

+ +
+Input: intervals = [[1,3],[3,7],[8,9]]
+Output: 5
+Explanation: let nums = [2, 3, 4, 8, 9].
+It can be shown that there cannot be any containing array of size 4.
+
+ +

Example 2:

+ +
+Input: intervals = [[1,3],[1,4],[2,5],[3,5]]
+Output: 3
+Explanation: let nums = [2, 3, 4].
+It can be shown that there cannot be any containing array of size 2.
+
+ +

Example 3:

+ +
+Input: intervals = [[1,2],[2,3],[2,4],[4,5]]
+Output: 5
+Explanation: let nums = [1, 2, 3, 4, 5].
+It can be shown that there cannot be any containing array of size 4.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= intervals.length <= 3000
    • +
  • intervals[i].length == 2
    • +
  • 0 <= starti < endi <= 108
    • +
+",3.0,False,"class Solution { +public: + int intersectionSizeTwo(vector>& intervals) { + + } +};","class Solution { + public int intersectionSizeTwo(int[][] intervals) { + + } +}","class Solution(object): + def intersectionSizeTwo(self, intervals): + """""" + :type intervals: List[List[int]] + :rtype: int + """""" + ","class Solution: + def intersectionSizeTwo(self, intervals: List[List[int]]) -> int: + ","int intersectionSizeTwo(int** intervals, int intervalsSize, int* intervalsColSize){ + +}","public class Solution { + public int IntersectionSizeTwo(int[][] intervals) { + + } +}","/** + * @param {number[][]} intervals + * @return {number} + */ +var intersectionSizeTwo = function(intervals) { + +};","# @param {Integer[][]} intervals +# @return {Integer} +def intersection_size_two(intervals) + +end","class Solution { + func intersectionSizeTwo(_ intervals: [[Int]]) -> Int { + + } +}","func intersectionSizeTwo(intervals [][]int) int { + +}","object Solution { + def intersectionSizeTwo(intervals: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun intersectionSizeTwo(intervals: Array): Int { + + } +}","impl Solution { + pub fn intersection_size_two(intervals: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $intervals + * @return Integer + */ + function intersectionSizeTwo($intervals) { + + } +}","function intersectionSizeTwo(intervals: number[][]): number { + +};","(define/contract (intersection-size-two intervals) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec intersection_size_two(Intervals :: [[integer()]]) -> integer(). +intersection_size_two(Intervals) -> + .","defmodule Solution do + @spec intersection_size_two(intervals :: [[integer]]) :: integer + def intersection_size_two(intervals) do + + end +end","class Solution { + int intersectionSizeTwo(List> intervals) { + + } +}", +1583,pyramid-transition-matrix,Pyramid Transition Matrix,756.0,757.0,"

You are stacking blocks to form a pyramid. Each block has a color, which is represented by a single letter. Each row of blocks contains one less block than the row beneath it and is centered on top.

+ +

To make the pyramid aesthetically pleasing, there are only specific triangular patterns that are allowed. A triangular pattern consists of a single block stacked on top of two blocks. The patterns are given as a list of three-letter strings allowed, where the first two characters of a pattern represent the left and right bottom blocks respectively, and the third character is the top block.

+ +
    +
  • For example, "ABC" represents a triangular pattern with a 'C' block stacked on top of an 'A' (left) and 'B' (right) block. Note that this is different from "BAC" where 'B' is on the left bottom and 'A' is on the right bottom.
    • +
+ +

You start with a bottom row of blocks bottom, given as a single string, that you must use as the base of the pyramid.

+ +

Given bottom and allowed, return true if you can build the pyramid all the way to the top such that every triangular pattern in the pyramid is in allowed, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: bottom = "BCD", allowed = ["BCC","CDE","CEA","FFF"]
+Output: true
+Explanation: The allowed triangular patterns are shown on the right.
+Starting from the bottom (level 3), we can build "CE" on level 2 and then build "A" on level 1.
+There are three triangular patterns in the pyramid, which are "BCC", "CDE", and "CEA". All are allowed.
+
+ +

Example 2:

+ +
+Input: bottom = "AAAA", allowed = ["AAB","AAC","BCD","BBE","DEF"]
+Output: false
+Explanation: The allowed triangular patterns are shown on the right.
+Starting from the bottom (level 4), there are multiple ways to build level 3, but trying all the possibilites, you will get always stuck before building level 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= bottom.length <= 6
    • +
  • 0 <= allowed.length <= 216
    • +
  • allowed[i].length == 3
    • +
  • The letters in all input strings are from the set {'A', 'B', 'C', 'D', 'E', 'F'}.
    • +
  • All the values of allowed are unique.
    • +
+",2.0,False,"class Solution { +public: + bool pyramidTransition(string bottom, vector& allowed) { + + } +};","class Solution { + public boolean pyramidTransition(String bottom, List allowed) { + + } +}","class Solution(object): + def pyramidTransition(self, bottom, allowed): + """""" + :type bottom: str + :type allowed: List[str] + :rtype: bool + """""" + ","class Solution: + def pyramidTransition(self, bottom: str, allowed: List[str]) -> bool: + ","bool pyramidTransition(char * bottom, char ** allowed, int allowedSize){ + +}","public class Solution { + public bool PyramidTransition(string bottom, IList allowed) { + + } +}","/** + * @param {string} bottom + * @param {string[]} allowed + * @return {boolean} + */ +var pyramidTransition = function(bottom, allowed) { + +};","# @param {String} bottom +# @param {String[]} allowed +# @return {Boolean} +def pyramid_transition(bottom, allowed) + +end","class Solution { + func pyramidTransition(_ bottom: String, _ allowed: [String]) -> Bool { + + } +}","func pyramidTransition(bottom string, allowed []string) bool { + +}","object Solution { + def pyramidTransition(bottom: String, allowed: List[String]): Boolean = { + + } +}","class Solution { + fun pyramidTransition(bottom: String, allowed: List): Boolean { + + } +}","impl Solution { + pub fn pyramid_transition(bottom: String, allowed: Vec) -> bool { + + } +}","class Solution { + + /** + * @param String $bottom + * @param String[] $allowed + * @return Boolean + */ + function pyramidTransition($bottom, $allowed) { + + } +}","function pyramidTransition(bottom: string, allowed: string[]): boolean { + +};","(define/contract (pyramid-transition bottom allowed) + (-> string? (listof string?) boolean?) + + )","-spec pyramid_transition(Bottom :: unicode:unicode_binary(), Allowed :: [unicode:unicode_binary()]) -> boolean(). +pyramid_transition(Bottom, Allowed) -> + .","defmodule Solution do + @spec pyramid_transition(bottom :: String.t, allowed :: [String.t]) :: boolean + def pyramid_transition(bottom, allowed) do + + end +end","class Solution { + bool pyramidTransition(String bottom, List allowed) { + + } +}", +1584,reach-a-number,Reach a Number,754.0,755.0,"

You are standing at position 0 on an infinite number line. There is a destination at position target.

+ +

You can make some number of moves numMoves so that:

+ +
    +
  • On each move, you can either go left or right.
    • +
  • During the ith move (starting from i == 1 to i == numMoves), you take i steps in the chosen direction.
    • +
+ +

Given the integer target, return the minimum number of moves required (i.e., the minimum numMoves) to reach the destination.

+ +

 

+

Example 1:

+ +
+Input: target = 2
+Output: 3
+Explanation:
+On the 1st move, we step from 0 to 1 (1 step).
+On the 2nd move, we step from 1 to -1 (2 steps).
+On the 3rd move, we step from -1 to 2 (3 steps).
+
+ +

Example 2:

+ +
+Input: target = 3
+Output: 2
+Explanation:
+On the 1st move, we step from 0 to 1 (1 step).
+On the 2nd move, we step from 1 to 3 (2 steps).
+
+ +

 

+

Constraints:

+ +
    +
  • -109 <= target <= 109
    • +
  • target != 0
    • +
+",2.0,False,"class Solution { +public: + int reachNumber(int target) { + + } +};","class Solution { + public int reachNumber(int target) { + + } +}","class Solution(object): + def reachNumber(self, target): + """""" + :type target: int + :rtype: int + """""" + ","class Solution: + def reachNumber(self, target: int) -> int: + ","int reachNumber(int target){ + +}","public class Solution { + public int ReachNumber(int target) { + + } +}","/** + * @param {number} target + * @return {number} + */ +var reachNumber = function(target) { + +};","# @param {Integer} target +# @return {Integer} +def reach_number(target) + +end","class Solution { + func reachNumber(_ target: Int) -> Int { + + } +}","func reachNumber(target int) int { + +}","object Solution { + def reachNumber(target: Int): Int = { + + } +}","class Solution { + fun reachNumber(target: Int): Int { + + } +}","impl Solution { + pub fn reach_number(target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $target + * @return Integer + */ + function reachNumber($target) { + + } +}","function reachNumber(target: number): number { + +};","(define/contract (reach-number target) + (-> exact-integer? exact-integer?) + + )","-spec reach_number(Target :: integer()) -> integer(). +reach_number(Target) -> + .","defmodule Solution do + @spec reach_number(target :: integer) :: integer + def reach_number(target) do + + end +end","class Solution { + int reachNumber(int target) { + + } +}", +1585,cracking-the-safe,Cracking the Safe,753.0,754.0,"

There is a safe protected by a password. The password is a sequence of n digits where each digit can be in the range [0, k - 1].

+ +

The safe has a peculiar way of checking the password. When you enter in a sequence, it checks the most recent n digits that were entered each time you type a digit.

+ +
    +
  • For example, the correct password is "345" and you enter in "012345": + +
      +
    • After typing 0, the most recent 3 digits is "0", which is incorrect.
      • +
    • After typing 1, the most recent 3 digits is "01", which is incorrect.
      • +
    • After typing 2, the most recent 3 digits is "012", which is incorrect.
      • +
    • After typing 3, the most recent 3 digits is "123", which is incorrect.
      • +
    • After typing 4, the most recent 3 digits is "234", which is incorrect.
      • +
    • After typing 5, the most recent 3 digits is "345", which is correct and the safe unlocks.
      • +
    +
    • +
+ +

Return any string of minimum length that will unlock the safe at some point of entering it.

+ +

 

+

Example 1:

+ +
+Input: n = 1, k = 2
+Output: "10"
+Explanation: The password is a single digit, so enter each digit. "01" would also unlock the safe.
+
+ +

Example 2:

+ +
+Input: n = 2, k = 2
+Output: "01100"
+Explanation: For each possible password:
+- "00" is typed in starting from the 4th digit.
+- "01" is typed in starting from the 1st digit.
+- "10" is typed in starting from the 3rd digit.
+- "11" is typed in starting from the 2nd digit.
+Thus "01100" will unlock the safe. "10011", and "11001" would also unlock the safe.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 4
    • +
  • 1 <= k <= 10
    • +
  • 1 <= kn <= 4096
    • +
+",3.0,False,"class Solution { +public: + string crackSafe(int n, int k) { + + } +};","class Solution { + public String crackSafe(int n, int k) { + + } +}","class Solution(object): + def crackSafe(self, n, k): + """""" + :type n: int + :type k: int + :rtype: str + """""" + ","class Solution: + def crackSafe(self, n: int, k: int) -> str: + ","char * crackSafe(int n, int k){ + +}","public class Solution { + public string CrackSafe(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {string} + */ +var crackSafe = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {String} +def crack_safe(n, k) + +end","class Solution { + func crackSafe(_ n: Int, _ k: Int) -> String { + + } +}","func crackSafe(n int, k int) string { + +}","object Solution { + def crackSafe(n: Int, k: Int): String = { + + } +}","class Solution { + fun crackSafe(n: Int, k: Int): String { + + } +}","impl Solution { + pub fn crack_safe(n: i32, k: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return String + */ + function crackSafe($n, $k) { + + } +}","function crackSafe(n: number, k: number): string { + +};","(define/contract (crack-safe n k) + (-> exact-integer? exact-integer? string?) + + )","-spec crack_safe(N :: integer(), K :: integer()) -> unicode:unicode_binary(). +crack_safe(N, K) -> + .","defmodule Solution do + @spec crack_safe(n :: integer, k :: integer) :: String.t + def crack_safe(n, k) do + + end +end","class Solution { + String crackSafe(int n, int k) { + + } +}", +1587,contain-virus,Contain Virus,749.0,750.0,"

A virus is spreading rapidly, and your task is to quarantine the infected area by installing walls.

+ +

The world is modeled as an m x n binary grid isInfected, where isInfected[i][j] == 0 represents uninfected cells, and isInfected[i][j] == 1 represents cells contaminated with the virus. A wall (and only one wall) can be installed between any two 4-directionally adjacent cells, on the shared boundary.

+ +

Every night, the virus spreads to all neighboring cells in all four directions unless blocked by a wall. Resources are limited. Each day, you can install walls around only one region (i.e., the affected area (continuous block of infected cells) that threatens the most uninfected cells the following night). There will never be a tie.

+ +

Return the number of walls used to quarantine all the infected regions. If the world will become fully infected, return the number of walls used.

+ +

 

+

Example 1:

+ +
+Input: isInfected = [[0,1,0,0,0,0,0,1],[0,1,0,0,0,0,0,1],[0,0,0,0,0,0,0,1],[0,0,0,0,0,0,0,0]]
+Output: 10
+Explanation: There are 2 contaminated regions.
+On the first day, add 5 walls to quarantine the viral region on the left. The board after the virus spreads is:
+
+On the second day, add 5 walls to quarantine the viral region on the right. The virus is fully contained.
+
+
+ +

Example 2:

+ +
+Input: isInfected = [[1,1,1],[1,0,1],[1,1,1]]
+Output: 4
+Explanation: Even though there is only one cell saved, there are 4 walls built.
+Notice that walls are only built on the shared boundary of two different cells.
+
+ +

Example 3:

+ +
+Input: isInfected = [[1,1,1,0,0,0,0,0,0],[1,0,1,0,1,1,1,1,1],[1,1,1,0,0,0,0,0,0]]
+Output: 13
+Explanation: The region on the left only builds two new walls.
+
+ +

 

+

Constraints:

+ +
    +
  • m == isInfected.length
    • +
  • n == isInfected[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • isInfected[i][j] is either 0 or 1.
    • +
  • There is always a contiguous viral region throughout the described process that will infect strictly more uncontaminated squares in the next round.
    • +
+",3.0,False,"class Solution { +public: + int containVirus(vector>& isInfected) { + + } +};","class Solution { + public int containVirus(int[][] isInfected) { + + } +}","class Solution(object): + def containVirus(self, isInfected): + """""" + :type isInfected: List[List[int]] + :rtype: int + """""" + ","class Solution: + def containVirus(self, isInfected: List[List[int]]) -> int: + ","int containVirus(int** isInfected, int isInfectedSize, int* isInfectedColSize){ + +}","public class Solution { + public int ContainVirus(int[][] isInfected) { + + } +}","/** + * @param {number[][]} isInfected + * @return {number} + */ +var containVirus = function(isInfected) { + +};","# @param {Integer[][]} is_infected +# @return {Integer} +def contain_virus(is_infected) + +end","class Solution { + func containVirus(_ isInfected: [[Int]]) -> Int { + + } +}","func containVirus(isInfected [][]int) int { + +}","object Solution { + def containVirus(isInfected: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun containVirus(isInfected: Array): Int { + + } +}","impl Solution { + pub fn contain_virus(is_infected: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $isInfected + * @return Integer + */ + function containVirus($isInfected) { + + } +}","function containVirus(isInfected: number[][]): number { + +};","(define/contract (contain-virus isInfected) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec contain_virus(IsInfected :: [[integer()]]) -> integer(). +contain_virus(IsInfected) -> + .","defmodule Solution do + @spec contain_virus(is_infected :: [[integer]]) :: integer + def contain_virus(is_infected) do + + end +end","class Solution { + int containVirus(List> isInfected) { + + } +}", +1591,prefix-and-suffix-search,Prefix and Suffix Search,745.0,746.0,"

Design a special dictionary that searches the words in it by a prefix and a suffix.

+ +

Implement the WordFilter class:

+ +
    +
  • WordFilter(string[] words) Initializes the object with the words in the dictionary.
    • +
  • f(string pref, string suff) Returns the index of the word in the dictionary, which has the prefix pref and the suffix suff. If there is more than one valid index, return the largest of them. If there is no such word in the dictionary, return -1.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["WordFilter", "f"]
+[[["apple"]], ["a", "e"]]
+Output
+[null, 0]
+Explanation
+WordFilter wordFilter = new WordFilter(["apple"]);
+wordFilter.f("a", "e"); // return 0, because the word at index 0 has prefix = "a" and suffix = "e".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 104
    • +
  • 1 <= words[i].length <= 7
    • +
  • 1 <= pref.length, suff.length <= 7
    • +
  • words[i], pref and suff consist of lowercase English letters only.
    • +
  • At most 104 calls will be made to the function f.
    • +
+",3.0,False,"class WordFilter { +public: + WordFilter(vector& words) { + + } + + int f(string pref, string suff) { + + } +}; + +/** + * Your WordFilter object will be instantiated and called as such: + * WordFilter* obj = new WordFilter(words); + * int param_1 = obj->f(pref,suff); + */","class WordFilter { + + public WordFilter(String[] words) { + + } + + public int f(String pref, String suff) { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * WordFilter obj = new WordFilter(words); + * int param_1 = obj.f(pref,suff); + */","class WordFilter(object): + + def __init__(self, words): + """""" + :type words: List[str] + """""" + + + def f(self, pref, suff): + """""" + :type pref: str + :type suff: str + :rtype: int + """""" + + + +# Your WordFilter object will be instantiated and called as such: +# obj = WordFilter(words) +# param_1 = obj.f(pref,suff)","class WordFilter: + + def __init__(self, words: List[str]): + + + def f(self, pref: str, suff: str) -> int: + + + +# Your WordFilter object will be instantiated and called as such: +# obj = WordFilter(words) +# param_1 = obj.f(pref,suff)"," + + +typedef struct { + +} WordFilter; + + +WordFilter* wordFilterCreate(char ** words, int wordsSize) { + +} + +int wordFilterF(WordFilter* obj, char * pref, char * suff) { + +} + +void wordFilterFree(WordFilter* obj) { + +} + +/** + * Your WordFilter struct will be instantiated and called as such: + * WordFilter* obj = wordFilterCreate(words, wordsSize); + * int param_1 = wordFilterF(obj, pref, suff); + + * wordFilterFree(obj); +*/","public class WordFilter { + + public WordFilter(string[] words) { + + } + + public int F(string pref, string suff) { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * WordFilter obj = new WordFilter(words); + * int param_1 = obj.F(pref,suff); + */","/** + * @param {string[]} words + */ +var WordFilter = function(words) { + +}; + +/** + * @param {string} pref + * @param {string} suff + * @return {number} + */ +WordFilter.prototype.f = function(pref, suff) { + +}; + +/** + * Your WordFilter object will be instantiated and called as such: + * var obj = new WordFilter(words) + * var param_1 = obj.f(pref,suff) + */","class WordFilter + +=begin + :type words: String[] +=end + def initialize(words) + + end + + +=begin + :type pref: String + :type suff: String + :rtype: Integer +=end + def f(pref, suff) + + end + + +end + +# Your WordFilter object will be instantiated and called as such: +# obj = WordFilter.new(words) +# param_1 = obj.f(pref, suff)"," +class WordFilter { + + init(_ words: [String]) { + + } + + func f(_ pref: String, _ suff: String) -> Int { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * let obj = WordFilter(words) + * let ret_1: Int = obj.f(pref, suff) + */","type WordFilter struct { + +} + + +func Constructor(words []string) WordFilter { + +} + + +func (this *WordFilter) F(pref string, suff string) int { + +} + + +/** + * Your WordFilter object will be instantiated and called as such: + * obj := Constructor(words); + * param_1 := obj.F(pref,suff); + */","class WordFilter(_words: Array[String]) { + + def f(pref: String, suff: String): Int = { + + } + +} + +/** + * Your WordFilter object will be instantiated and called as such: + * var obj = new WordFilter(words) + * var param_1 = obj.f(pref,suff) + */","class WordFilter(words: Array) { + + fun f(pref: String, suff: String): Int { + + } + +} + +/** + * Your WordFilter object will be instantiated and called as such: + * var obj = WordFilter(words) + * var param_1 = obj.f(pref,suff) + */","struct WordFilter { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl WordFilter { + + fn new(words: Vec) -> Self { + + } + + fn f(&self, pref: String, suff: String) -> i32 { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * let obj = WordFilter::new(words); + * let ret_1: i32 = obj.f(pref, suff); + */","class WordFilter { + /** + * @param String[] $words + */ + function __construct($words) { + + } + + /** + * @param String $pref + * @param String $suff + * @return Integer + */ + function f($pref, $suff) { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * $obj = WordFilter($words); + * $ret_1 = $obj->f($pref, $suff); + */","class WordFilter { + constructor(words: string[]) { + + } + + f(pref: string, suff: string): number { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * var obj = new WordFilter(words) + * var param_1 = obj.f(pref,suff) + */","(define word-filter% + (class object% + (super-new) + + ; words : (listof string?) + (init-field + words) + + ; f : string? string? -> exact-integer? + (define/public (f pref suff) + + ))) + +;; Your word-filter% object will be instantiated and called as such: +;; (define obj (new word-filter% [words words])) +;; (define param_1 (send obj f pref suff))","-spec word_filter_init_(Words :: [unicode:unicode_binary()]) -> any(). +word_filter_init_(Words) -> + . + +-spec word_filter_f(Pref :: unicode:unicode_binary(), Suff :: unicode:unicode_binary()) -> integer(). +word_filter_f(Pref, Suff) -> + . + + +%% Your functions will be called as such: +%% word_filter_init_(Words), +%% Param_1 = word_filter_f(Pref, Suff), + +%% word_filter_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule WordFilter do + @spec init_(words :: [String.t]) :: any + def init_(words) do + + end + + @spec f(pref :: String.t, suff :: String.t) :: integer + def f(pref, suff) do + + end +end + +# Your functions will be called as such: +# WordFilter.init_(words) +# param_1 = WordFilter.f(pref, suff) + +# WordFilter.init_ will be called before every test case, in which you can do some necessary initializations.","class WordFilter { + + WordFilter(List words) { + + } + + int f(String pref, String suff) { + + } +} + +/** + * Your WordFilter object will be instantiated and called as such: + * WordFilter obj = WordFilter(words); + * int param1 = obj.f(pref,suff); + */", +1593,network-delay-time,Network Delay Time,743.0,744.0,"

You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target.

+ +

We will send a signal from a given node k. Return the minimum time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

+ +

 

+

Example 1:

+ +
+Input: times = [[2,1,1],[2,3,1],[3,4,1]], n = 4, k = 2
+Output: 2
+
+ +

Example 2:

+ +
+Input: times = [[1,2,1]], n = 2, k = 1
+Output: 1
+
+ +

Example 3:

+ +
+Input: times = [[1,2,1]], n = 2, k = 2
+Output: -1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 100
    • +
  • 1 <= times.length <= 6000
    • +
  • times[i].length == 3
    • +
  • 1 <= ui, vi <= n
    • +
  • ui != vi
    • +
  • 0 <= wi <= 100
    • +
  • All the pairs (ui, vi) are unique. (i.e., no multiple edges.)
    • +
+",2.0,False,"class Solution { +public: + int networkDelayTime(vector>& times, int n, int k) { + + } +};","class Solution { + public int networkDelayTime(int[][] times, int n, int k) { + + } +}","class Solution(object): + def networkDelayTime(self, times, n, k): + """""" + :type times: List[List[int]] + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def networkDelayTime(self, times: List[List[int]], n: int, k: int) -> int: + ","int networkDelayTime(int** times, int timesSize, int* timesColSize, int n, int k){ + +}","public class Solution { + public int NetworkDelayTime(int[][] times, int n, int k) { + + } +}","/** + * @param {number[][]} times + * @param {number} n + * @param {number} k + * @return {number} + */ +var networkDelayTime = function(times, n, k) { + +};","# @param {Integer[][]} times +# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def network_delay_time(times, n, k) + +end","class Solution { + func networkDelayTime(_ times: [[Int]], _ n: Int, _ k: Int) -> Int { + + } +}","func networkDelayTime(times [][]int, n int, k int) int { + +}","object Solution { + def networkDelayTime(times: Array[Array[Int]], n: Int, k: Int): Int = { + + } +}","class Solution { + fun networkDelayTime(times: Array, n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn network_delay_time(times: Vec>, n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $times + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function networkDelayTime($times, $n, $k) { + + } +}","function networkDelayTime(times: number[][], n: number, k: number): number { + +};","(define/contract (network-delay-time times n k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer? exact-integer?) + + )","-spec network_delay_time(Times :: [[integer()]], N :: integer(), K :: integer()) -> integer(). +network_delay_time(Times, N, K) -> + .","defmodule Solution do + @spec network_delay_time(times :: [[integer]], n :: integer, k :: integer) :: integer + def network_delay_time(times, n, k) do + + end +end","class Solution { + int networkDelayTime(List> times, int n, int k) { + + } +}", +1595,cherry-pickup,Cherry Pickup,741.0,741.0,"

You are given an n x n grid representing a field of cherries, each cell is one of three possible integers.

+ +
    +
  • 0 means the cell is empty, so you can pass through,
    • +
  • 1 means the cell contains a cherry that you can pick up and pass through, or
    • +
  • -1 means the cell contains a thorn that blocks your way.
    • +
+ +

Return the maximum number of cherries you can collect by following the rules below:

+ +
    +
  • Starting at the position (0, 0) and reaching (n - 1, n - 1) by moving right or down through valid path cells (cells with value 0 or 1).
    • +
  • After reaching (n - 1, n - 1), returning to (0, 0) by moving left or up through valid path cells.
    • +
  • When passing through a path cell containing a cherry, you pick it up, and the cell becomes an empty cell 0.
    • +
  • If there is no valid path between (0, 0) and (n - 1, n - 1), then no cherries can be collected.
    • +
+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1,-1],[1,0,-1],[1,1,1]]
+Output: 5
+Explanation: The player started at (0, 0) and went down, down, right right to reach (2, 2).
+4 cherries were picked up during this single trip, and the matrix becomes [[0,1,-1],[0,0,-1],[0,0,0]].
+Then, the player went left, up, up, left to return home, picking up one more cherry.
+The total number of cherries picked up is 5, and this is the maximum possible.
+
+ +

Example 2:

+ +
+Input: grid = [[1,1,-1],[1,-1,1],[-1,1,1]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= n <= 50
    • +
  • grid[i][j] is -1, 0, or 1.
    • +
  • grid[0][0] != -1
    • +
  • grid[n - 1][n - 1] != -1
    • +
+",3.0,False,"class Solution { +public: + int cherryPickup(vector>& grid) { + + } +};","class Solution { + public int cherryPickup(int[][] grid) { + + } +}","class Solution(object): + def cherryPickup(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def cherryPickup(self, grid: List[List[int]]) -> int: + ","int cherryPickup(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int CherryPickup(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var cherryPickup = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def cherry_pickup(grid) + +end","class Solution { + func cherryPickup(_ grid: [[Int]]) -> Int { + + } +}","func cherryPickup(grid [][]int) int { + +}","object Solution { + def cherryPickup(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun cherryPickup(grid: Array): Int { + + } +}","impl Solution { + pub fn cherry_pickup(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function cherryPickup($grid) { + + } +}","function cherryPickup(grid: number[][]): number { + +};","(define/contract (cherry-pickup grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec cherry_pickup(Grid :: [[integer()]]) -> integer(). +cherry_pickup(Grid) -> + .","defmodule Solution do + @spec cherry_pickup(grid :: [[integer]]) :: integer + def cherry_pickup(grid) do + + end +end","class Solution { + int cherryPickup(List> grid) { + + } +}", +1597,daily-temperatures,Daily Temperatures,739.0,739.0,"

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.

+ +

 

+

Example 1:

+
Input: temperatures = [73,74,75,71,69,72,76,73]
+Output: [1,1,4,2,1,1,0,0]
+

Example 2:

+
Input: temperatures = [30,40,50,60]
+Output: [1,1,1,0]
+

Example 3:

+
Input: temperatures = [30,60,90]
+Output: [1,1,0]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= temperatures.length <= 105
    • +
  • 30 <= temperatures[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + vector dailyTemperatures(vector& temperatures) { + + } +};","class Solution { + public int[] dailyTemperatures(int[] temperatures) { + + } +}","class Solution(object): + def dailyTemperatures(self, temperatures): + """""" + :type temperatures: List[int] + :rtype: List[int] + """""" + ","class Solution: + def dailyTemperatures(self, temperatures: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* dailyTemperatures(int* temperatures, int temperaturesSize, int* returnSize){ + +}","public class Solution { + public int[] DailyTemperatures(int[] temperatures) { + + } +}","/** + * @param {number[]} temperatures + * @return {number[]} + */ +var dailyTemperatures = function(temperatures) { + +};","# @param {Integer[]} temperatures +# @return {Integer[]} +def daily_temperatures(temperatures) + +end","class Solution { + func dailyTemperatures(_ temperatures: [Int]) -> [Int] { + + } +}","func dailyTemperatures(temperatures []int) []int { + +}","object Solution { + def dailyTemperatures(temperatures: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun dailyTemperatures(temperatures: IntArray): IntArray { + + } +}","impl Solution { + pub fn daily_temperatures(temperatures: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $temperatures + * @return Integer[] + */ + function dailyTemperatures($temperatures) { + + } +}","function dailyTemperatures(temperatures: number[]): number[] { + +};","(define/contract (daily-temperatures temperatures) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec daily_temperatures(Temperatures :: [integer()]) -> [integer()]. +daily_temperatures(Temperatures) -> + .","defmodule Solution do + @spec daily_temperatures(temperatures :: [integer]) :: [integer] + def daily_temperatures(temperatures) do + + end +end","class Solution { + List dailyTemperatures(List temperatures) { + + } +}", +1598,monotone-increasing-digits,Monotone Increasing Digits,738.0,738.0,"

An integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.

+ +

Given an integer n, return the largest number that is less than or equal to n with monotone increasing digits.

+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 9
+
+ +

Example 2:

+ +
+Input: n = 1234
+Output: 1234
+
+ +

Example 3:

+ +
+Input: n = 332
+Output: 299
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 109
    • +
+",2.0,False,"class Solution { +public: + int monotoneIncreasingDigits(int n) { + + } +};","class Solution { + public int monotoneIncreasingDigits(int n) { + + } +}","class Solution(object): + def monotoneIncreasingDigits(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def monotoneIncreasingDigits(self, n: int) -> int: + ","int monotoneIncreasingDigits(int n){ + +}","public class Solution { + public int MonotoneIncreasingDigits(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var monotoneIncreasingDigits = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def monotone_increasing_digits(n) + +end","class Solution { + func monotoneIncreasingDigits(_ n: Int) -> Int { + + } +}","func monotoneIncreasingDigits(n int) int { + +}","object Solution { + def monotoneIncreasingDigits(n: Int): Int = { + + } +}","class Solution { + fun monotoneIncreasingDigits(n: Int): Int { + + } +}","impl Solution { + pub fn monotone_increasing_digits(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function monotoneIncreasingDigits($n) { + + } +}","function monotoneIncreasingDigits(n: number): number { + +};","(define/contract (monotone-increasing-digits n) + (-> exact-integer? exact-integer?) + + )","-spec monotone_increasing_digits(N :: integer()) -> integer(). +monotone_increasing_digits(N) -> + .","defmodule Solution do + @spec monotone_increasing_digits(n :: integer) :: integer + def monotone_increasing_digits(n) do + + end +end","class Solution { + int monotoneIncreasingDigits(int n) { + + } +}", +1599,parse-lisp-expression,Parse Lisp Expression,736.0,736.0,"

You are given a string expression representing a Lisp-like expression to return the integer value of.

+ +

The syntax for these expressions is given as follows.

+ +
    +
  • An expression is either an integer, let expression, add expression, mult expression, or an assigned variable. Expressions always evaluate to a single integer.
    • +
  • (An integer could be positive or negative.)
    • +
  • A let expression takes the form "(let v1 e1 v2 e2 ... vn en expr)", where let is always the string "let", then there are one or more pairs of alternating variables and expressions, meaning that the first variable v1 is assigned the value of the expression e1, the second variable v2 is assigned the value of the expression e2, and so on sequentially; and then the value of this let expression is the value of the expression expr.
    • +
  • An add expression takes the form "(add e1 e2)" where add is always the string "add", there are always two expressions e1, e2 and the result is the addition of the evaluation of e1 and the evaluation of e2.
    • +
  • A mult expression takes the form "(mult e1 e2)" where mult is always the string "mult", there are always two expressions e1, e2 and the result is the multiplication of the evaluation of e1 and the evaluation of e2.
    • +
  • For this question, we will use a smaller subset of variable names. A variable starts with a lowercase letter, then zero or more lowercase letters or digits. Additionally, for your convenience, the names "add", "let", and "mult" are protected and will never be used as variable names.
    • +
  • Finally, there is the concept of scope. When an expression of a variable name is evaluated, within the context of that evaluation, the innermost scope (in terms of parentheses) is checked first for the value of that variable, and then outer scopes are checked sequentially. It is guaranteed that every expression is legal. Please see the examples for more details on the scope.
    • +
+ +

 

+

Example 1:

+ +
+Input: expression = "(let x 2 (mult x (let x 3 y 4 (add x y))))"
+Output: 14
+Explanation: In the expression (add x y), when checking for the value of the variable x,
+we check from the innermost scope to the outermost in the context of the variable we are trying to evaluate.
+Since x = 3 is found first, the value of x is 3.
+
+ +

Example 2:

+ +
+Input: expression = "(let x 3 x 2 x)"
+Output: 2
+Explanation: Assignment in let statements is processed sequentially.
+
+ +

Example 3:

+ +
+Input: expression = "(let x 1 y 2 x (add x y) (add x y))"
+Output: 5
+Explanation: The first (add x y) evaluates as 3, and is assigned to x.
+The second (add x y) evaluates as 3+2 = 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= expression.length <= 2000
    • +
  • There are no leading or trailing spaces in expression.
    • +
  • All tokens are separated by a single space in expression.
    • +
  • The answer and all intermediate calculations of that answer are guaranteed to fit in a 32-bit integer.
    • +
  • The expression is guaranteed to be legal and evaluate to an integer.
    • +
+",3.0,False,"class Solution { +public: + int evaluate(string expression) { + + } +};","class Solution { + public int evaluate(String expression) { + + } +}","class Solution(object): + def evaluate(self, expression): + """""" + :type expression: str + :rtype: int + """""" + ","class Solution: + def evaluate(self, expression: str) -> int: + ","int evaluate(char * expression){ + +}","public class Solution { + public int Evaluate(string expression) { + + } +}","/** + * @param {string} expression + * @return {number} + */ +var evaluate = function(expression) { + +};","# @param {String} expression +# @return {Integer} +def evaluate(expression) + +end","class Solution { + func evaluate(_ expression: String) -> Int { + + } +}","func evaluate(expression string) int { + +}","object Solution { + def evaluate(expression: String): Int = { + + } +}","class Solution { + fun evaluate(expression: String): Int { + + } +}","impl Solution { + pub fn evaluate(expression: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $expression + * @return Integer + */ + function evaluate($expression) { + + } +}","function evaluate(expression: string): number { + +};","(define/contract (evaluate expression) + (-> string? exact-integer?) + + )","-spec evaluate(Expression :: unicode:unicode_binary()) -> integer(). +evaluate(Expression) -> + .","defmodule Solution do + @spec evaluate(expression :: String.t) :: integer + def evaluate(expression) do + + end +end","class Solution { + int evaluate(String expression) { + + } +}", +1602,my-calendar-iii,My Calendar III,732.0,732.0,"

A k-booking happens when k events have some non-empty intersection (i.e., there is some time that is common to all k events.)

+ +

You are given some events [startTime, endTime), after each given event, return an integer k representing the maximum k-booking between all the previous events.

+ +

Implement the MyCalendarThree class:

+ +
    +
  • MyCalendarThree() Initializes the object.
    • +
  • int book(int startTime, int endTime) Returns an integer k representing the largest integer such that there exists a k-booking in the calendar.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MyCalendarThree", "book", "book", "book", "book", "book", "book"]
+[[], [10, 20], [50, 60], [10, 40], [5, 15], [5, 10], [25, 55]]
+Output
+[null, 1, 1, 2, 3, 3, 3]
+
+Explanation
+MyCalendarThree myCalendarThree = new MyCalendarThree();
+myCalendarThree.book(10, 20); // return 1
+myCalendarThree.book(50, 60); // return 1
+myCalendarThree.book(10, 40); // return 2
+myCalendarThree.book(5, 15); // return 3
+myCalendarThree.book(5, 10); // return 3
+myCalendarThree.book(25, 55); // return 3
+
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= startTime < endTime <= 109
    • +
  • At most 400 calls will be made to book.
    • +
+",3.0,False,"class MyCalendarThree { +public: + MyCalendarThree() { + + } + + int book(int startTime, int endTime) { + + } +}; + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * MyCalendarThree* obj = new MyCalendarThree(); + * int param_1 = obj->book(startTime,endTime); + */","class MyCalendarThree { + + public MyCalendarThree() { + + } + + public int book(int startTime, int endTime) { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * MyCalendarThree obj = new MyCalendarThree(); + * int param_1 = obj.book(startTime,endTime); + */","class MyCalendarThree(object): + + def __init__(self): + + + def book(self, startTime, endTime): + """""" + :type startTime: int + :type endTime: int + :rtype: int + """""" + + + +# Your MyCalendarThree object will be instantiated and called as such: +# obj = MyCalendarThree() +# param_1 = obj.book(startTime,endTime)","class MyCalendarThree: + + def __init__(self): + + + def book(self, startTime: int, endTime: int) -> int: + + + +# Your MyCalendarThree object will be instantiated and called as such: +# obj = MyCalendarThree() +# param_1 = obj.book(startTime,endTime)"," + + +typedef struct { + +} MyCalendarThree; + + +MyCalendarThree* myCalendarThreeCreate() { + +} + +int myCalendarThreeBook(MyCalendarThree* obj, int startTime, int endTime) { + +} + +void myCalendarThreeFree(MyCalendarThree* obj) { + +} + +/** + * Your MyCalendarThree struct will be instantiated and called as such: + * MyCalendarThree* obj = myCalendarThreeCreate(); + * int param_1 = myCalendarThreeBook(obj, startTime, endTime); + + * myCalendarThreeFree(obj); +*/","public class MyCalendarThree { + + public MyCalendarThree() { + + } + + public int Book(int startTime, int endTime) { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * MyCalendarThree obj = new MyCalendarThree(); + * int param_1 = obj.Book(startTime,endTime); + */"," +var MyCalendarThree = function() { + +}; + +/** + * @param {number} startTime + * @param {number} endTime + * @return {number} + */ +MyCalendarThree.prototype.book = function(startTime, endTime) { + +}; + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * var obj = new MyCalendarThree() + * var param_1 = obj.book(startTime,endTime) + */","class MyCalendarThree + def initialize() + + end + + +=begin + :type start_time: Integer + :type end_time: Integer + :rtype: Integer +=end + def book(start_time, end_time) + + end + + +end + +# Your MyCalendarThree object will be instantiated and called as such: +# obj = MyCalendarThree.new() +# param_1 = obj.book(start_time, end_time)"," +class MyCalendarThree { + + init() { + + } + + func book(_ startTime: Int, _ endTime: Int) -> Int { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * let obj = MyCalendarThree() + * let ret_1: Int = obj.book(startTime, endTime) + */","type MyCalendarThree struct { + +} + + +func Constructor() MyCalendarThree { + +} + + +func (this *MyCalendarThree) Book(startTime int, endTime int) int { + +} + + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Book(startTime,endTime); + */","class MyCalendarThree() { + + def book(startTime: Int, endTime: Int): Int = { + + } + +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * var obj = new MyCalendarThree() + * var param_1 = obj.book(startTime,endTime) + */","class MyCalendarThree() { + + fun book(startTime: Int, endTime: Int): Int { + + } + +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * var obj = MyCalendarThree() + * var param_1 = obj.book(startTime,endTime) + */","struct MyCalendarThree { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MyCalendarThree { + + fn new() -> Self { + + } + + fn book(&self, start_time: i32, end_time: i32) -> i32 { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * let obj = MyCalendarThree::new(); + * let ret_1: i32 = obj.book(startTime, endTime); + */","class MyCalendarThree { + /** + */ + function __construct() { + + } + + /** + * @param Integer $startTime + * @param Integer $endTime + * @return Integer + */ + function book($startTime, $endTime) { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * $obj = MyCalendarThree(); + * $ret_1 = $obj->book($startTime, $endTime); + */","class MyCalendarThree { + constructor() { + + } + + book(startTime: number, endTime: number): number { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * var obj = new MyCalendarThree() + * var param_1 = obj.book(startTime,endTime) + */","(define my-calendar-three% + (class object% + (super-new) + + (init-field) + + ; book : exact-integer? exact-integer? -> exact-integer? + (define/public (book start-time end-time) + + ))) + +;; Your my-calendar-three% object will be instantiated and called as such: +;; (define obj (new my-calendar-three%)) +;; (define param_1 (send obj book start-time end-time))","-spec my_calendar_three_init_() -> any(). +my_calendar_three_init_() -> + . + +-spec my_calendar_three_book(StartTime :: integer(), EndTime :: integer()) -> integer(). +my_calendar_three_book(StartTime, EndTime) -> + . + + +%% Your functions will be called as such: +%% my_calendar_three_init_(), +%% Param_1 = my_calendar_three_book(StartTime, EndTime), + +%% my_calendar_three_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MyCalendarThree do + @spec init_() :: any + def init_() do + + end + + @spec book(start_time :: integer, end_time :: integer) :: integer + def book(start_time, end_time) do + + end +end + +# Your functions will be called as such: +# MyCalendarThree.init_() +# param_1 = MyCalendarThree.book(start_time, end_time) + +# MyCalendarThree.init_ will be called before every test case, in which you can do some necessary initializations.","class MyCalendarThree { + + MyCalendarThree() { + + } + + int book(int startTime, int endTime) { + + } +} + +/** + * Your MyCalendarThree object will be instantiated and called as such: + * MyCalendarThree obj = MyCalendarThree(); + * int param1 = obj.book(startTime,endTime); + */", +1603,my-calendar-ii,My Calendar II,731.0,731.0,"

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a triple booking.

+ +

A triple booking happens when three events have some non-empty intersection (i.e., some moment is common to all the three events.).

+ +

The event can be represented as a pair of integers start and end that represents a booking on the half-open interval [start, end), the range of real numbers x such that start <= x < end.

+ +

Implement the MyCalendarTwo class:

+ +
    +
  • MyCalendarTwo() Initializes the calendar object.
    • +
  • boolean book(int start, int end) Returns true if the event can be added to the calendar successfully without causing a triple booking. Otherwise, return false and do not add the event to the calendar.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MyCalendarTwo", "book", "book", "book", "book", "book", "book"]
+[[], [10, 20], [50, 60], [10, 40], [5, 15], [5, 10], [25, 55]]
+Output
+[null, true, true, true, false, true, true]
+
+Explanation
+MyCalendarTwo myCalendarTwo = new MyCalendarTwo();
+myCalendarTwo.book(10, 20); // return True, The event can be booked. 
+myCalendarTwo.book(50, 60); // return True, The event can be booked. 
+myCalendarTwo.book(10, 40); // return True, The event can be double booked. 
+myCalendarTwo.book(5, 15);  // return False, The event cannot be booked, because it would result in a triple booking.
+myCalendarTwo.book(5, 10); // return True, The event can be booked, as it does not use time 10 which is already double booked.
+myCalendarTwo.book(25, 55); // return True, The event can be booked, as the time in [25, 40) will be double booked with the third event, the time [40, 50) will be single booked, and the time [50, 55) will be double booked with the second event.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= start < end <= 109
    • +
  • At most 1000 calls will be made to book.
    • +
+",2.0,False,"class MyCalendarTwo { +public: + MyCalendarTwo() { + + } + + bool book(int start, int end) { + + } +}; + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * MyCalendarTwo* obj = new MyCalendarTwo(); + * bool param_1 = obj->book(start,end); + */","class MyCalendarTwo { + + public MyCalendarTwo() { + + } + + public boolean book(int start, int end) { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * MyCalendarTwo obj = new MyCalendarTwo(); + * boolean param_1 = obj.book(start,end); + */","class MyCalendarTwo(object): + + def __init__(self): + + + def book(self, start, end): + """""" + :type start: int + :type end: int + :rtype: bool + """""" + + + +# Your MyCalendarTwo object will be instantiated and called as such: +# obj = MyCalendarTwo() +# param_1 = obj.book(start,end)","class MyCalendarTwo: + + def __init__(self): + + + def book(self, start: int, end: int) -> bool: + + + +# Your MyCalendarTwo object will be instantiated and called as such: +# obj = MyCalendarTwo() +# param_1 = obj.book(start,end)"," + + +typedef struct { + +} MyCalendarTwo; + + +MyCalendarTwo* myCalendarTwoCreate() { + +} + +bool myCalendarTwoBook(MyCalendarTwo* obj, int start, int end) { + +} + +void myCalendarTwoFree(MyCalendarTwo* obj) { + +} + +/** + * Your MyCalendarTwo struct will be instantiated and called as such: + * MyCalendarTwo* obj = myCalendarTwoCreate(); + * bool param_1 = myCalendarTwoBook(obj, start, end); + + * myCalendarTwoFree(obj); +*/","public class MyCalendarTwo { + + public MyCalendarTwo() { + + } + + public bool Book(int start, int end) { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * MyCalendarTwo obj = new MyCalendarTwo(); + * bool param_1 = obj.Book(start,end); + */"," +var MyCalendarTwo = function() { + +}; + +/** + * @param {number} start + * @param {number} end + * @return {boolean} + */ +MyCalendarTwo.prototype.book = function(start, end) { + +}; + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * var obj = new MyCalendarTwo() + * var param_1 = obj.book(start,end) + */","class MyCalendarTwo + def initialize() + + end + + +=begin + :type start: Integer + :type end: Integer + :rtype: Boolean +=end + def book(start, end) + + end + + +end + +# Your MyCalendarTwo object will be instantiated and called as such: +# obj = MyCalendarTwo.new() +# param_1 = obj.book(start, end)"," +class MyCalendarTwo { + + init() { + + } + + func book(_ start: Int, _ end: Int) -> Bool { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * let obj = MyCalendarTwo() + * let ret_1: Bool = obj.book(start, end) + */","type MyCalendarTwo struct { + +} + + +func Constructor() MyCalendarTwo { + +} + + +func (this *MyCalendarTwo) Book(start int, end int) bool { + +} + + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Book(start,end); + */","class MyCalendarTwo() { + + def book(start: Int, end: Int): Boolean = { + + } + +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * var obj = new MyCalendarTwo() + * var param_1 = obj.book(start,end) + */","class MyCalendarTwo() { + + fun book(start: Int, end: Int): Boolean { + + } + +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * var obj = MyCalendarTwo() + * var param_1 = obj.book(start,end) + */","struct MyCalendarTwo { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MyCalendarTwo { + + fn new() -> Self { + + } + + fn book(&self, start: i32, end: i32) -> bool { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * let obj = MyCalendarTwo::new(); + * let ret_1: bool = obj.book(start, end); + */","class MyCalendarTwo { + /** + */ + function __construct() { + + } + + /** + * @param Integer $start + * @param Integer $end + * @return Boolean + */ + function book($start, $end) { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * $obj = MyCalendarTwo(); + * $ret_1 = $obj->book($start, $end); + */","class MyCalendarTwo { + constructor() { + + } + + book(start: number, end: number): boolean { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * var obj = new MyCalendarTwo() + * var param_1 = obj.book(start,end) + */","(define my-calendar-two% + (class object% + (super-new) + (init-field) + + ; book : exact-integer? exact-integer? -> boolean? + (define/public (book start end) + + ))) + +;; Your my-calendar-two% object will be instantiated and called as such: +;; (define obj (new my-calendar-two%)) +;; (define param_1 (send obj book start end))","-spec my_calendar_two_init_() -> any(). +my_calendar_two_init_() -> + . + +-spec my_calendar_two_book(Start :: integer(), End :: integer()) -> boolean(). +my_calendar_two_book(Start, End) -> + . + + +%% Your functions will be called as such: +%% my_calendar_two_init_(), +%% Param_1 = my_calendar_two_book(Start, End), + +%% my_calendar_two_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MyCalendarTwo do + @spec init_() :: any + def init_() do + + end + + @spec book(start :: integer, end :: integer) :: boolean + def book(start, end) do + + end +end + +# Your functions will be called as such: +# MyCalendarTwo.init_() +# param_1 = MyCalendarTwo.book(start, end) + +# MyCalendarTwo.init_ will be called before every test case, in which you can do some necessary initializations.","class MyCalendarTwo { + + MyCalendarTwo() { + + } + + bool book(int start, int end) { + + } +} + +/** + * Your MyCalendarTwo object will be instantiated and called as such: + * MyCalendarTwo obj = MyCalendarTwo(); + * bool param1 = obj.book(start,end); + */", +1604,count-different-palindromic-subsequences,Count Different Palindromic Subsequences,730.0,730.0,"

Given a string s, return the number of different non-empty palindromic subsequences in s. Since the answer may be very large, return it modulo 109 + 7.

+ +

A subsequence of a string is obtained by deleting zero or more characters from the string.

+ +

A sequence is palindromic if it is equal to the sequence reversed.

+ +

Two sequences a1, a2, ... and b1, b2, ... are different if there is some i for which ai != bi.

+ +

 

+

Example 1:

+ +
+Input: s = "bccb"
+Output: 6
+Explanation: The 6 different non-empty palindromic subsequences are 'b', 'c', 'bb', 'cc', 'bcb', 'bccb'.
+Note that 'bcb' is counted only once, even though it occurs twice.
+
+ +

Example 2:

+ +
+Input: s = "abcdabcdabcdabcdabcdabcdabcdabcddcbadcbadcbadcbadcbadcbadcbadcba"
+Output: 104860361
+Explanation: There are 3104860382 different non-empty palindromic subsequences, which is 104860361 modulo 109 + 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s[i] is either 'a', 'b', 'c', or 'd'.
    • +
+",3.0,False,"class Solution { +public: + int countPalindromicSubsequences(string s) { + + } +};","class Solution { + public int countPalindromicSubsequences(String s) { + + } +}","class Solution(object): + def countPalindromicSubsequences(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def countPalindromicSubsequences(self, s: str) -> int: + ","int countPalindromicSubsequences(char * s){ + +}","public class Solution { + public int CountPalindromicSubsequences(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var countPalindromicSubsequences = function(s) { + +};","# @param {String} s +# @return {Integer} +def count_palindromic_subsequences(s) + +end","class Solution { + func countPalindromicSubsequences(_ s: String) -> Int { + + } +}","func countPalindromicSubsequences(s string) int { + +}","object Solution { + def countPalindromicSubsequences(s: String): Int = { + + } +}","class Solution { + fun countPalindromicSubsequences(s: String): Int { + + } +}","impl Solution { + pub fn count_palindromic_subsequences(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function countPalindromicSubsequences($s) { + + } +}","function countPalindromicSubsequences(s: string): number { + +};","(define/contract (count-palindromic-subsequences s) + (-> string? exact-integer?) + + )","-spec count_palindromic_subsequences(S :: unicode:unicode_binary()) -> integer(). +count_palindromic_subsequences(S) -> + .","defmodule Solution do + @spec count_palindromic_subsequences(s :: String.t) :: integer + def count_palindromic_subsequences(s) do + + end +end","class Solution { + int countPalindromicSubsequences(String s) { + + } +}", +1605,my-calendar-i,My Calendar I,729.0,729.0,"

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.

+ +

A double booking happens when two events have some non-empty intersection (i.e., some moment is common to both events.).

+ +

The event can be represented as a pair of integers start and end that represents a booking on the half-open interval [start, end), the range of real numbers x such that start <= x < end.

+ +

Implement the MyCalendar class:

+ +
    +
  • MyCalendar() Initializes the calendar object.
    • +
  • boolean book(int start, int end) Returns true if the event can be added to the calendar successfully without causing a double booking. Otherwise, return false and do not add the event to the calendar.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MyCalendar", "book", "book", "book"]
+[[], [10, 20], [15, 25], [20, 30]]
+Output
+[null, true, false, true]
+
+Explanation
+MyCalendar myCalendar = new MyCalendar();
+myCalendar.book(10, 20); // return True
+myCalendar.book(15, 25); // return False, It can not be booked because time 15 is already booked by another event.
+myCalendar.book(20, 30); // return True, The event can be booked, as the first event takes every time less than 20, but not including 20.
+ +

 

+

Constraints:

+ +
    +
  • 0 <= start < end <= 109
    • +
  • At most 1000 calls will be made to book.
    • +
+",2.0,False,"class MyCalendar { +public: + MyCalendar() { + + } + + bool book(int start, int end) { + + } +}; + +/** + * Your MyCalendar object will be instantiated and called as such: + * MyCalendar* obj = new MyCalendar(); + * bool param_1 = obj->book(start,end); + */","class MyCalendar { + + public MyCalendar() { + + } + + public boolean book(int start, int end) { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * MyCalendar obj = new MyCalendar(); + * boolean param_1 = obj.book(start,end); + */","class MyCalendar(object): + + def __init__(self): + + + def book(self, start, end): + """""" + :type start: int + :type end: int + :rtype: bool + """""" + + + +# Your MyCalendar object will be instantiated and called as such: +# obj = MyCalendar() +# param_1 = obj.book(start,end)","class MyCalendar: + + def __init__(self): + + + def book(self, start: int, end: int) -> bool: + + + +# Your MyCalendar object will be instantiated and called as such: +# obj = MyCalendar() +# param_1 = obj.book(start,end)"," + + +typedef struct { + +} MyCalendar; + + +MyCalendar* myCalendarCreate() { + +} + +bool myCalendarBook(MyCalendar* obj, int start, int end) { + +} + +void myCalendarFree(MyCalendar* obj) { + +} + +/** + * Your MyCalendar struct will be instantiated and called as such: + * MyCalendar* obj = myCalendarCreate(); + * bool param_1 = myCalendarBook(obj, start, end); + + * myCalendarFree(obj); +*/","public class MyCalendar { + + public MyCalendar() { + + } + + public bool Book(int start, int end) { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * MyCalendar obj = new MyCalendar(); + * bool param_1 = obj.Book(start,end); + */"," +var MyCalendar = function() { + +}; + +/** + * @param {number} start + * @param {number} end + * @return {boolean} + */ +MyCalendar.prototype.book = function(start, end) { + +}; + +/** + * Your MyCalendar object will be instantiated and called as such: + * var obj = new MyCalendar() + * var param_1 = obj.book(start,end) + */","class MyCalendar + def initialize() + + end + + +=begin + :type start: Integer + :type end: Integer + :rtype: Boolean +=end + def book(start, end) + + end + + +end + +# Your MyCalendar object will be instantiated and called as such: +# obj = MyCalendar.new() +# param_1 = obj.book(start, end)"," +class MyCalendar { + + init() { + + } + + func book(_ start: Int, _ end: Int) -> Bool { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * let obj = MyCalendar() + * let ret_1: Bool = obj.book(start, end) + */","type MyCalendar struct { + +} + + +func Constructor() MyCalendar { + +} + + +func (this *MyCalendar) Book(start int, end int) bool { + +} + + +/** + * Your MyCalendar object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Book(start,end); + */","class MyCalendar() { + + def book(start: Int, end: Int): Boolean = { + + } + +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * var obj = new MyCalendar() + * var param_1 = obj.book(start,end) + */","class MyCalendar() { + + fun book(start: Int, end: Int): Boolean { + + } + +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * var obj = MyCalendar() + * var param_1 = obj.book(start,end) + */","struct MyCalendar { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MyCalendar { + + fn new() -> Self { + + } + + fn book(&self, start: i32, end: i32) -> bool { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * let obj = MyCalendar::new(); + * let ret_1: bool = obj.book(start, end); + */","class MyCalendar { + /** + */ + function __construct() { + + } + + /** + * @param Integer $start + * @param Integer $end + * @return Boolean + */ + function book($start, $end) { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * $obj = MyCalendar(); + * $ret_1 = $obj->book($start, $end); + */","class MyCalendar { + constructor() { + + } + + book(start: number, end: number): boolean { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * var obj = new MyCalendar() + * var param_1 = obj.book(start,end) + */","(define my-calendar% + (class object% + (super-new) + (init-field) + + ; book : exact-integer? exact-integer? -> boolean? + (define/public (book start end) + + ))) + +;; Your my-calendar% object will be instantiated and called as such: +;; (define obj (new my-calendar%)) +;; (define param_1 (send obj book start end))","-spec my_calendar_init_() -> any(). +my_calendar_init_() -> + . + +-spec my_calendar_book(Start :: integer(), End :: integer()) -> boolean(). +my_calendar_book(Start, End) -> + . + + +%% Your functions will be called as such: +%% my_calendar_init_(), +%% Param_1 = my_calendar_book(Start, End), + +%% my_calendar_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MyCalendar do + @spec init_() :: any + def init_() do + + end + + @spec book(start :: integer, end :: integer) :: boolean + def book(start, end) do + + end +end + +# Your functions will be called as such: +# MyCalendar.init_() +# param_1 = MyCalendar.book(start, end) + +# MyCalendar.init_ will be called before every test case, in which you can do some necessary initializations.","class MyCalendar { + + MyCalendar() { + + } + + bool book(int start, int end) { + + } +} + +/** + * Your MyCalendar object will be instantiated and called as such: + * MyCalendar obj = MyCalendar(); + * bool param1 = obj.book(start,end); + */", +1606,self-dividing-numbers,Self Dividing Numbers,728.0,728.0,"

A self-dividing number is a number that is divisible by every digit it contains.

+ +
    +
  • For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
    • +
+ +

A self-dividing number is not allowed to contain the digit zero.

+ +

Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].

+ +

 

+

Example 1:

+
Input: left = 1, right = 22
+Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
+

Example 2:

+
Input: left = 47, right = 85
+Output: [48,55,66,77]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= left <= right <= 104
    • +
+",1.0,False,"class Solution { +public: + vector selfDividingNumbers(int left, int right) { + + } +};","class Solution { + public List selfDividingNumbers(int left, int right) { + + } +}","class Solution(object): + def selfDividingNumbers(self, left, right): + """""" + :type left: int + :type right: int + :rtype: List[int] + """""" + ","class Solution: + def selfDividingNumbers(self, left: int, right: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* selfDividingNumbers(int left, int right, int* returnSize){ + +}","public class Solution { + public IList SelfDividingNumbers(int left, int right) { + + } +}","/** + * @param {number} left + * @param {number} right + * @return {number[]} + */ +var selfDividingNumbers = function(left, right) { + +};","# @param {Integer} left +# @param {Integer} right +# @return {Integer[]} +def self_dividing_numbers(left, right) + +end","class Solution { + func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] { + + } +}","func selfDividingNumbers(left int, right int) []int { + +}","object Solution { + def selfDividingNumbers(left: Int, right: Int): List[Int] = { + + } +}","class Solution { + fun selfDividingNumbers(left: Int, right: Int): List { + + } +}","impl Solution { + pub fn self_dividing_numbers(left: i32, right: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $left + * @param Integer $right + * @return Integer[] + */ + function selfDividingNumbers($left, $right) { + + } +}","function selfDividingNumbers(left: number, right: number): number[] { + +};","(define/contract (self-dividing-numbers left right) + (-> exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec self_dividing_numbers(Left :: integer(), Right :: integer()) -> [integer()]. +self_dividing_numbers(Left, Right) -> + .","defmodule Solution do + @spec self_dividing_numbers(left :: integer, right :: integer) :: [integer] + def self_dividing_numbers(left, right) do + + end +end","class Solution { + List selfDividingNumbers(int left, int right) { + + } +}", +1607,number-of-atoms,Number of Atoms,726.0,726.0,"

Given a string formula representing a chemical formula, return the count of each atom.

+ +

The atomic element always starts with an uppercase character, then zero or more lowercase letters, representing the name.

+ +

One or more digits representing that element's count may follow if the count is greater than 1. If the count is 1, no digits will follow.

+ +
    +
  • For example, "H2O" and "H2O2" are possible, but "H1O2" is impossible.
    • +
+ +

Two formulas are concatenated together to produce another formula.

+ +
    +
  • For example, "H2O2He3Mg4" is also a formula.
    • +
+ +

A formula placed in parentheses, and a count (optionally added) is also a formula.

+ +
    +
  • For example, "(H2O2)" and "(H2O2)3" are formulas.
    • +
+ +

Return the count of all elements as a string in the following form: the first name (in sorted order), followed by its count (if that count is more than 1), followed by the second name (in sorted order), followed by its count (if that count is more than 1), and so on.

+ +

The test cases are generated so that all the values in the output fit in a 32-bit integer.

+ +

 

+

Example 1:

+ +
+Input: formula = "H2O"
+Output: "H2O"
+Explanation: The count of elements are {'H': 2, 'O': 1}.
+
+ +

Example 2:

+ +
+Input: formula = "Mg(OH)2"
+Output: "H2MgO2"
+Explanation: The count of elements are {'H': 2, 'Mg': 1, 'O': 2}.
+
+ +

Example 3:

+ +
+Input: formula = "K4(ON(SO3)2)2"
+Output: "K4N2O14S4"
+Explanation: The count of elements are {'K': 4, 'N': 2, 'O': 14, 'S': 4}.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= formula.length <= 1000
    • +
  • formula consists of English letters, digits, '(', and ')'.
    • +
  • formula is always valid.
    • +
+",3.0,False,"class Solution { +public: + string countOfAtoms(string formula) { + + } +};","class Solution { + public String countOfAtoms(String formula) { + + } +}","class Solution(object): + def countOfAtoms(self, formula): + """""" + :type formula: str + :rtype: str + """""" + ","class Solution: + def countOfAtoms(self, formula: str) -> str: + ","char * countOfAtoms(char * formula){ + +}","public class Solution { + public string CountOfAtoms(string formula) { + + } +}","/** + * @param {string} formula + * @return {string} + */ +var countOfAtoms = function(formula) { + +};","# @param {String} formula +# @return {String} +def count_of_atoms(formula) + +end","class Solution { + func countOfAtoms(_ formula: String) -> String { + + } +}","func countOfAtoms(formula string) string { + +}","object Solution { + def countOfAtoms(formula: String): String = { + + } +}","class Solution { + fun countOfAtoms(formula: String): String { + + } +}","impl Solution { + pub fn count_of_atoms(formula: String) -> String { + + } +}","class Solution { + + /** + * @param String $formula + * @return String + */ + function countOfAtoms($formula) { + + } +}","function countOfAtoms(formula: string): string { + +};","(define/contract (count-of-atoms formula) + (-> string? string?) + + )","-spec count_of_atoms(Formula :: unicode:unicode_binary()) -> unicode:unicode_binary(). +count_of_atoms(Formula) -> + .","defmodule Solution do + @spec count_of_atoms(formula :: String.t) :: String.t + def count_of_atoms(formula) do + + end +end","class Solution { + String countOfAtoms(String formula) { + + } +}", +1610,remove-comments,Remove Comments,722.0,722.0,"

Given a C++ program, remove comments from it. The program source is an array of strings source where source[i] is the ith line of the source code. This represents the result of splitting the original source code string by the newline character '\n'.

+ +

In C++, there are two types of comments, line comments, and block comments.

+ +
    +
  • The string "//" denotes a line comment, which represents that it and the rest of the characters to the right of it in the same line should be ignored.
    • +
  • The string "/*" denotes a block comment, which represents that all characters until the next (non-overlapping) occurrence of "*/" should be ignored. (Here, occurrences happen in reading order: line by line from left to right.) To be clear, the string "/*/" does not yet end the block comment, as the ending would be overlapping the beginning.
    • +
+ +

The first effective comment takes precedence over others.

+ +
    +
  • For example, if the string "//" occurs in a block comment, it is ignored.
    • +
  • Similarly, if the string "/*" occurs in a line or block comment, it is also ignored.
    • +
+ +

If a certain line of code is empty after removing comments, you must not output that line: each string in the answer list will be non-empty.

+ +

There will be no control characters, single quote, or double quote characters.

+ +
    +
  • For example, source = "string s = "/* Not a comment. */";" will not be a test case.
    • +
+ +

Also, nothing else such as defines or macros will interfere with the comments.

+ +

It is guaranteed that every open block comment will eventually be closed, so "/*" outside of a line or block comment always starts a new comment.

+ +

Finally, implicit newline characters can be deleted by block comments. Please see the examples below for details.

+ +

After removing the comments from the source code, return the source code in the same format.

+ +

 

+

Example 1:

+ +
+Input: source = ["/*Test program */", "int main()", "{ ", "  // variable declaration ", "int a, b, c;", "/* This is a test", "   multiline  ", "   comment for ", "   testing */", "a = b + c;", "}"]
+Output: ["int main()","{ ","  ","int a, b, c;","a = b + c;","}"]
+Explanation: The line by line code is visualized as below:
+/*Test program */
+int main()
+{ 
+  // variable declaration 
+int a, b, c;
+/* This is a test
+   multiline  
+   comment for 
+   testing */
+a = b + c;
+}
+The string /* denotes a block comment, including line 1 and lines 6-9. The string // denotes line 4 as comments.
+The line by line output code is visualized as below:
+int main()
+{ 
+  
+int a, b, c;
+a = b + c;
+}
+
+ +

Example 2:

+ +
+Input: source = ["a/*comment", "line", "more_comment*/b"]
+Output: ["ab"]
+Explanation: The original source string is "a/*comment\nline\nmore_comment*/b", where we have bolded the newline characters.  After deletion, the implicit newline characters are deleted, leaving the string "ab", which when delimited by newline characters becomes ["ab"].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= source.length <= 100
    • +
  • 0 <= source[i].length <= 80
    • +
  • source[i] consists of printable ASCII characters.
    • +
  • Every open block comment is eventually closed.
    • +
  • There are no single-quote or double-quote in the input.
    • +
+",2.0,False,"class Solution { +public: + vector removeComments(vector& source) { + + } +};","class Solution { + public List removeComments(String[] source) { + + } +}","class Solution(object): + def removeComments(self, source): + """""" + :type source: List[str] + :rtype: List[str] + """""" + ","class Solution: + def removeComments(self, source: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** removeComments(char ** source, int sourceSize, int* returnSize){ + +}","public class Solution { + public IList RemoveComments(string[] source) { + + } +}","/** + * @param {string[]} source + * @return {string[]} + */ +var removeComments = function(source) { + +};","# @param {String[]} source +# @return {String[]} +def remove_comments(source) + +end","class Solution { + func removeComments(_ source: [String]) -> [String] { + + } +}","func removeComments(source []string) []string { + +}","object Solution { + def removeComments(source: Array[String]): List[String] = { + + } +}","class Solution { + fun removeComments(source: Array): List { + + } +}","impl Solution { + pub fn remove_comments(source: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $source + * @return String[] + */ + function removeComments($source) { + + } +}","function removeComments(source: string[]): string[] { + +};","(define/contract (remove-comments source) + (-> (listof string?) (listof string?)) + + )","-spec remove_comments(Source :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +remove_comments(Source) -> + .","defmodule Solution do + @spec remove_comments(source :: [String.t]) :: [String.t] + def remove_comments(source) do + + end +end","class Solution { + List removeComments(List source) { + + } +}", +1611,accounts-merge,Accounts Merge,721.0,721.0,"

Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the account.

+ +

Now, we would like to merge these accounts. Two accounts definitely belong to the same person if there is some common email to both accounts. Note that even if two accounts have the same name, they may belong to different people as people could have the same name. A person can have any number of accounts initially, but all of their accounts definitely have the same name.

+ +

After merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails in sorted order. The accounts themselves can be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: accounts = [["John","johnsmith@mail.com","john_newyork@mail.com"],["John","johnsmith@mail.com","john00@mail.com"],["Mary","mary@mail.com"],["John","johnnybravo@mail.com"]]
+Output: [["John","john00@mail.com","john_newyork@mail.com","johnsmith@mail.com"],["Mary","mary@mail.com"],["John","johnnybravo@mail.com"]]
+Explanation:
+The first and second John's are the same person as they have the common email "johnsmith@mail.com".
+The third John and Mary are different people as none of their email addresses are used by other accounts.
+We could return these lists in any order, for example the answer [['Mary', 'mary@mail.com'], ['John', 'johnnybravo@mail.com'], 
+['John', 'john00@mail.com', 'john_newyork@mail.com', 'johnsmith@mail.com']] would still be accepted.
+
+ +

Example 2:

+ +
+Input: accounts = [["Gabe","Gabe0@m.co","Gabe3@m.co","Gabe1@m.co"],["Kevin","Kevin3@m.co","Kevin5@m.co","Kevin0@m.co"],["Ethan","Ethan5@m.co","Ethan4@m.co","Ethan0@m.co"],["Hanzo","Hanzo3@m.co","Hanzo1@m.co","Hanzo0@m.co"],["Fern","Fern5@m.co","Fern1@m.co","Fern0@m.co"]]
+Output: [["Ethan","Ethan0@m.co","Ethan4@m.co","Ethan5@m.co"],["Gabe","Gabe0@m.co","Gabe1@m.co","Gabe3@m.co"],["Hanzo","Hanzo0@m.co","Hanzo1@m.co","Hanzo3@m.co"],["Kevin","Kevin0@m.co","Kevin3@m.co","Kevin5@m.co"],["Fern","Fern0@m.co","Fern1@m.co","Fern5@m.co"]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= accounts.length <= 1000
    • +
  • 2 <= accounts[i].length <= 10
    • +
  • 1 <= accounts[i][j].length <= 30
    • +
  • accounts[i][0] consists of English letters.
    • +
  • accounts[i][j] (for j > 0) is a valid email.
    • +
+",2.0,False,"class Solution { +public: + vector> accountsMerge(vector>& accounts) { + + } +};","class Solution { + public List> accountsMerge(List> accounts) { + + } +}","class Solution(object): + def accountsMerge(self, accounts): + """""" + :type accounts: List[List[str]] + :rtype: List[List[str]] + """""" + ","class Solution: + def accountsMerge(self, accounts: List[List[str]]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** accountsMerge(char *** accounts, int accountsSize, int* accountsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> AccountsMerge(IList> accounts) { + + } +}","/** + * @param {string[][]} accounts + * @return {string[][]} + */ +var accountsMerge = function(accounts) { + +};","# @param {String[][]} accounts +# @return {String[][]} +def accounts_merge(accounts) + +end","class Solution { + func accountsMerge(_ accounts: [[String]]) -> [[String]] { + + } +}","func accountsMerge(accounts [][]string) [][]string { + +}","object Solution { + def accountsMerge(accounts: List[List[String]]): List[List[String]] = { + + } +}","class Solution { + fun accountsMerge(accounts: List>): List> { + + } +}","impl Solution { + pub fn accounts_merge(accounts: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param String[][] $accounts + * @return String[][] + */ + function accountsMerge($accounts) { + + } +}","function accountsMerge(accounts: string[][]): string[][] { + +};","(define/contract (accounts-merge accounts) + (-> (listof (listof string?)) (listof (listof string?))) + + )","-spec accounts_merge(Accounts :: [[unicode:unicode_binary()]]) -> [[unicode:unicode_binary()]]. +accounts_merge(Accounts) -> + .","defmodule Solution do + @spec accounts_merge(accounts :: [[String.t]]) :: [[String.t]] + def accounts_merge(accounts) do + + end +end","class Solution { + List> accountsMerge(List> accounts) { + + } +}", +1612,longest-word-in-dictionary,Longest Word in Dictionary,720.0,720.0,"

Given an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by other words in words.

+ +

If there is more than one possible answer, return the longest word with the smallest lexicographical order. If there is no answer, return the empty string.

+ +

Note that the word should be built from left to right with each additional character being added to the end of a previous word. 

+ +

 

+

Example 1:

+ +
+Input: words = ["w","wo","wor","worl","world"]
+Output: "world"
+Explanation: The word "world" can be built one character at a time by "w", "wo", "wor", and "worl".
+
+ +

Example 2:

+ +
+Input: words = ["a","banana","app","appl","ap","apply","apple"]
+Output: "apple"
+Explanation: Both "apply" and "apple" can be built from other words in the dictionary. However, "apple" is lexicographically smaller than "apply".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 1000
    • +
  • 1 <= words[i].length <= 30
    • +
  • words[i] consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string longestWord(vector& words) { + + } +};","class Solution { + public String longestWord(String[] words) { + + } +}","class Solution(object): + def longestWord(self, words): + """""" + :type words: List[str] + :rtype: str + """""" + ","class Solution: + def longestWord(self, words: List[str]) -> str: + ","char * longestWord(char ** words, int wordsSize){ + +}","public class Solution { + public string LongestWord(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {string} + */ +var longestWord = function(words) { + +};","# @param {String[]} words +# @return {String} +def longest_word(words) + +end","class Solution { + func longestWord(_ words: [String]) -> String { + + } +}","func longestWord(words []string) string { + +}","object Solution { + def longestWord(words: Array[String]): String = { + + } +}","class Solution { + fun longestWord(words: Array): String { + + } +}","impl Solution { + pub fn longest_word(words: Vec) -> String { + + } +}","class Solution { + + /** + * @param String[] $words + * @return String + */ + function longestWord($words) { + + } +}","function longestWord(words: string[]): string { + +};","(define/contract (longest-word words) + (-> (listof string?) string?) + + )","-spec longest_word(Words :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +longest_word(Words) -> + .","defmodule Solution do + @spec longest_word(words :: [String.t]) :: String.t + def longest_word(words) do + + end +end","class Solution { + String longestWord(List words) { + + } +}", +1613,find-k-th-smallest-pair-distance,Find K-th Smallest Pair Distance,719.0,719.0,"

The distance of a pair of integers a and b is defined as the absolute difference between a and b.

+ +

Given an integer array nums and an integer k, return the kth smallest distance among all the pairs nums[i] and nums[j] where 0 <= i < j < nums.length.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,1], k = 1
+Output: 0
+Explanation: Here are all the pairs:
+(1,3) -> 2
+(1,1) -> 0
+(3,1) -> 2
+Then the 1st smallest distance pair is (1,1), and its distance is 0.
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1], k = 2
+Output: 0
+
+ +

Example 3:

+ +
+Input: nums = [1,6,1], k = 3
+Output: 5
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 2 <= n <= 104
    • +
  • 0 <= nums[i] <= 106
    • +
  • 1 <= k <= n * (n - 1) / 2
    • +
+",3.0,False,"class Solution { +public: + int smallestDistancePair(vector& nums, int k) { + + } +};","class Solution { + public int smallestDistancePair(int[] nums, int k) { + + } +}","class Solution(object): + def smallestDistancePair(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def smallestDistancePair(self, nums: List[int], k: int) -> int: + ","int smallestDistancePair(int* nums, int numsSize, int k){ + +}","public class Solution { + public int SmallestDistancePair(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var smallestDistancePair = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def smallest_distance_pair(nums, k) + +end","class Solution { + func smallestDistancePair(_ nums: [Int], _ k: Int) -> Int { + + } +}","func smallestDistancePair(nums []int, k int) int { + +}","object Solution { + def smallestDistancePair(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun smallestDistancePair(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn smallest_distance_pair(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function smallestDistancePair($nums, $k) { + + } +}","function smallestDistancePair(nums: number[], k: number): number { + +};","(define/contract (smallest-distance-pair nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec smallest_distance_pair(Nums :: [integer()], K :: integer()) -> integer(). +smallest_distance_pair(Nums, K) -> + .","defmodule Solution do + @spec smallest_distance_pair(nums :: [integer], k :: integer) :: integer + def smallest_distance_pair(nums, k) do + + end +end","class Solution { + int smallestDistancePair(List nums, int k) { + + } +}", +1614,maximum-length-of-repeated-subarray,Maximum Length of Repeated Subarray,718.0,718.0,"

Given two integer arrays nums1 and nums2, return the maximum length of a subarray that appears in both arrays.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
+Output: 3
+Explanation: The repeated subarray with maximum length is [3,2,1].
+
+ +

Example 2:

+ +
+Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
+Output: 5
+Explanation: The repeated subarray with maximum length is [0,0,0,0,0].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 1000
    • +
  • 0 <= nums1[i], nums2[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + int findLength(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int findLength(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def findLength(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: int + """""" + ","class Solution: + def findLength(self, nums1: List[int], nums2: List[int]) -> int: + ","int findLength(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public int FindLength(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var findLength = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer} +def find_length(nums1, nums2) + +end","class Solution { + func findLength(_ nums1: [Int], _ nums2: [Int]) -> Int { + + } +}","func findLength(nums1 []int, nums2 []int) int { + +}","object Solution { + def findLength(nums1: Array[Int], nums2: Array[Int]): Int = { + + } +}","class Solution { + fun findLength(nums1: IntArray, nums2: IntArray): Int { + + } +}","impl Solution { + pub fn find_length(nums1: Vec, nums2: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer + */ + function findLength($nums1, $nums2) { + + } +}","function findLength(nums1: number[], nums2: number[]): number { + +};","(define/contract (find-length nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec find_length(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer(). +find_length(Nums1, Nums2) -> + .","defmodule Solution do + @spec find_length(nums1 :: [integer], nums2 :: [integer]) :: integer + def find_length(nums1, nums2) do + + end +end","class Solution { + int findLength(List nums1, List nums2) { + + } +}", +1616,range-module,Range Module,715.0,715.0,"

A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query about them.

+ +

A half-open interval [left, right) denotes all the real numbers x where left <= x < right.

+ +

Implement the RangeModule class:

+ +
    +
  • RangeModule() Initializes the object of the data structure.
    • +
  • void addRange(int left, int right) Adds the half-open interval [left, right), tracking every real number in that interval. Adding an interval that partially overlaps with currently tracked numbers should add any numbers in the interval [left, right) that are not already tracked.
    • +
  • boolean queryRange(int left, int right) Returns true if every real number in the interval [left, right) is currently being tracked, and false otherwise.
    • +
  • void removeRange(int left, int right) Stops tracking every real number currently being tracked in the half-open interval [left, right).
    • +
+ +

 

+

Example 1:

+ +
+Input
+["RangeModule", "addRange", "removeRange", "queryRange", "queryRange", "queryRange"]
+[[], [10, 20], [14, 16], [10, 14], [13, 15], [16, 17]]
+Output
+[null, null, null, true, false, true]
+
+Explanation
+RangeModule rangeModule = new RangeModule();
+rangeModule.addRange(10, 20);
+rangeModule.removeRange(14, 16);
+rangeModule.queryRange(10, 14); // return True,(Every number in [10, 14) is being tracked)
+rangeModule.queryRange(13, 15); // return False,(Numbers like 14, 14.03, 14.17 in [13, 15) are not being tracked)
+rangeModule.queryRange(16, 17); // return True, (The number 16 in [16, 17) is still being tracked, despite the remove operation)
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= left < right <= 109
    • +
  • At most 104 calls will be made to addRange, queryRange, and removeRange.
    • +
+",3.0,False,"class RangeModule { +public: + RangeModule() { + + } + + void addRange(int left, int right) { + + } + + bool queryRange(int left, int right) { + + } + + void removeRange(int left, int right) { + + } +}; + +/** + * Your RangeModule object will be instantiated and called as such: + * RangeModule* obj = new RangeModule(); + * obj->addRange(left,right); + * bool param_2 = obj->queryRange(left,right); + * obj->removeRange(left,right); + */","class RangeModule { + + public RangeModule() { + + } + + public void addRange(int left, int right) { + + } + + public boolean queryRange(int left, int right) { + + } + + public void removeRange(int left, int right) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * RangeModule obj = new RangeModule(); + * obj.addRange(left,right); + * boolean param_2 = obj.queryRange(left,right); + * obj.removeRange(left,right); + */","class RangeModule(object): + + def __init__(self): + + + def addRange(self, left, right): + """""" + :type left: int + :type right: int + :rtype: None + """""" + + + def queryRange(self, left, right): + """""" + :type left: int + :type right: int + :rtype: bool + """""" + + + def removeRange(self, left, right): + """""" + :type left: int + :type right: int + :rtype: None + """""" + + + +# Your RangeModule object will be instantiated and called as such: +# obj = RangeModule() +# obj.addRange(left,right) +# param_2 = obj.queryRange(left,right) +# obj.removeRange(left,right)","class RangeModule: + + def __init__(self): + + + def addRange(self, left: int, right: int) -> None: + + + def queryRange(self, left: int, right: int) -> bool: + + + def removeRange(self, left: int, right: int) -> None: + + + +# Your RangeModule object will be instantiated and called as such: +# obj = RangeModule() +# obj.addRange(left,right) +# param_2 = obj.queryRange(left,right) +# obj.removeRange(left,right)"," + + +typedef struct { + +} RangeModule; + + +RangeModule* rangeModuleCreate() { + +} + +void rangeModuleAddRange(RangeModule* obj, int left, int right) { + +} + +bool rangeModuleQueryRange(RangeModule* obj, int left, int right) { + +} + +void rangeModuleRemoveRange(RangeModule* obj, int left, int right) { + +} + +void rangeModuleFree(RangeModule* obj) { + +} + +/** + * Your RangeModule struct will be instantiated and called as such: + * RangeModule* obj = rangeModuleCreate(); + * rangeModuleAddRange(obj, left, right); + + * bool param_2 = rangeModuleQueryRange(obj, left, right); + + * rangeModuleRemoveRange(obj, left, right); + + * rangeModuleFree(obj); +*/","public class RangeModule { + + public RangeModule() { + + } + + public void AddRange(int left, int right) { + + } + + public bool QueryRange(int left, int right) { + + } + + public void RemoveRange(int left, int right) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * RangeModule obj = new RangeModule(); + * obj.AddRange(left,right); + * bool param_2 = obj.QueryRange(left,right); + * obj.RemoveRange(left,right); + */"," +var RangeModule = function() { + +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.addRange = function(left, right) { + +}; + +/** + * @param {number} left + * @param {number} right + * @return {boolean} + */ +RangeModule.prototype.queryRange = function(left, right) { + +}; + +/** + * @param {number} left + * @param {number} right + * @return {void} + */ +RangeModule.prototype.removeRange = function(left, right) { + +}; + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */","class RangeModule + def initialize() + + end + + +=begin + :type left: Integer + :type right: Integer + :rtype: Void +=end + def add_range(left, right) + + end + + +=begin + :type left: Integer + :type right: Integer + :rtype: Boolean +=end + def query_range(left, right) + + end + + +=begin + :type left: Integer + :type right: Integer + :rtype: Void +=end + def remove_range(left, right) + + end + + +end + +# Your RangeModule object will be instantiated and called as such: +# obj = RangeModule.new() +# obj.add_range(left, right) +# param_2 = obj.query_range(left, right) +# obj.remove_range(left, right)"," +class RangeModule { + + init() { + + } + + func addRange(_ left: Int, _ right: Int) { + + } + + func queryRange(_ left: Int, _ right: Int) -> Bool { + + } + + func removeRange(_ left: Int, _ right: Int) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * let obj = RangeModule() + * obj.addRange(left, right) + * let ret_2: Bool = obj.queryRange(left, right) + * obj.removeRange(left, right) + */","type RangeModule struct { + +} + + +func Constructor() RangeModule { + +} + + +func (this *RangeModule) AddRange(left int, right int) { + +} + + +func (this *RangeModule) QueryRange(left int, right int) bool { + +} + + +func (this *RangeModule) RemoveRange(left int, right int) { + +} + + +/** + * Your RangeModule object will be instantiated and called as such: + * obj := Constructor(); + * obj.AddRange(left,right); + * param_2 := obj.QueryRange(left,right); + * obj.RemoveRange(left,right); + */","class RangeModule() { + + def addRange(left: Int, right: Int) { + + } + + def queryRange(left: Int, right: Int): Boolean = { + + } + + def removeRange(left: Int, right: Int) { + + } + +} + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */","class RangeModule() { + + fun addRange(left: Int, right: Int) { + + } + + fun queryRange(left: Int, right: Int): Boolean { + + } + + fun removeRange(left: Int, right: Int) { + + } + +} + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */","struct RangeModule { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl RangeModule { + + fn new() -> Self { + + } + + fn add_range(&self, left: i32, right: i32) { + + } + + fn query_range(&self, left: i32, right: i32) -> bool { + + } + + fn remove_range(&self, left: i32, right: i32) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * let obj = RangeModule::new(); + * obj.add_range(left, right); + * let ret_2: bool = obj.query_range(left, right); + * obj.remove_range(left, right); + */","class RangeModule { + /** + */ + function __construct() { + + } + + /** + * @param Integer $left + * @param Integer $right + * @return NULL + */ + function addRange($left, $right) { + + } + + /** + * @param Integer $left + * @param Integer $right + * @return Boolean + */ + function queryRange($left, $right) { + + } + + /** + * @param Integer $left + * @param Integer $right + * @return NULL + */ + function removeRange($left, $right) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * $obj = RangeModule(); + * $obj->addRange($left, $right); + * $ret_2 = $obj->queryRange($left, $right); + * $obj->removeRange($left, $right); + */","class RangeModule { + constructor() { + + } + + addRange(left: number, right: number): void { + + } + + queryRange(left: number, right: number): boolean { + + } + + removeRange(left: number, right: number): void { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * var obj = new RangeModule() + * obj.addRange(left,right) + * var param_2 = obj.queryRange(left,right) + * obj.removeRange(left,right) + */","(define range-module% + (class object% + (super-new) + (init-field) + + ; add-range : exact-integer? exact-integer? -> void? + (define/public (add-range left right) + + ) + ; query-range : exact-integer? exact-integer? -> boolean? + (define/public (query-range left right) + + ) + ; remove-range : exact-integer? exact-integer? -> void? + (define/public (remove-range left right) + + ))) + +;; Your range-module% object will be instantiated and called as such: +;; (define obj (new range-module%)) +;; (send obj add-range left right) +;; (define param_2 (send obj query-range left right)) +;; (send obj remove-range left right)","-spec range_module_init_() -> any(). +range_module_init_() -> + . + +-spec range_module_add_range(Left :: integer(), Right :: integer()) -> any(). +range_module_add_range(Left, Right) -> + . + +-spec range_module_query_range(Left :: integer(), Right :: integer()) -> boolean(). +range_module_query_range(Left, Right) -> + . + +-spec range_module_remove_range(Left :: integer(), Right :: integer()) -> any(). +range_module_remove_range(Left, Right) -> + . + + +%% Your functions will be called as such: +%% range_module_init_(), +%% range_module_add_range(Left, Right), +%% Param_2 = range_module_query_range(Left, Right), +%% range_module_remove_range(Left, Right), + +%% range_module_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule RangeModule do + @spec init_() :: any + def init_() do + + end + + @spec add_range(left :: integer, right :: integer) :: any + def add_range(left, right) do + + end + + @spec query_range(left :: integer, right :: integer) :: boolean + def query_range(left, right) do + + end + + @spec remove_range(left :: integer, right :: integer) :: any + def remove_range(left, right) do + + end +end + +# Your functions will be called as such: +# RangeModule.init_() +# RangeModule.add_range(left, right) +# param_2 = RangeModule.query_range(left, right) +# RangeModule.remove_range(left, right) + +# RangeModule.init_ will be called before every test case, in which you can do some necessary initializations.","class RangeModule { + + RangeModule() { + + } + + void addRange(int left, int right) { + + } + + bool queryRange(int left, int right) { + + } + + void removeRange(int left, int right) { + + } +} + +/** + * Your RangeModule object will be instantiated and called as such: + * RangeModule obj = RangeModule(); + * obj.addRange(left,right); + * bool param2 = obj.queryRange(left,right); + * obj.removeRange(left,right); + */", +1618,subarray-product-less-than-k,Subarray Product Less Than K,713.0,713.0,"

Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,5,2,6], k = 100
+Output: 8
+Explanation: The 8 subarrays that have product less than 100 are:
+[10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6]
+Note that [10, 5, 2] is not included as the product of 100 is not strictly less than k.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3], k = 0
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • 1 <= nums[i] <= 1000
    • +
  • 0 <= k <= 106
    • +
+",2.0,False,"class Solution { +public: + int numSubarrayProductLessThanK(vector& nums, int k) { + + } +};","class Solution { + public int numSubarrayProductLessThanK(int[] nums, int k) { + + } +}","class Solution(object): + def numSubarrayProductLessThanK(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: + ","int numSubarrayProductLessThanK(int* nums, int numsSize, int k){ + +}","public class Solution { + public int NumSubarrayProductLessThanK(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var numSubarrayProductLessThanK = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def num_subarray_product_less_than_k(nums, k) + +end","class Solution { + func numSubarrayProductLessThanK(_ nums: [Int], _ k: Int) -> Int { + + } +}","func numSubarrayProductLessThanK(nums []int, k int) int { + +}","object Solution { + def numSubarrayProductLessThanK(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun numSubarrayProductLessThanK(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn num_subarray_product_less_than_k(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function numSubarrayProductLessThanK($nums, $k) { + + } +}","function numSubarrayProductLessThanK(nums: number[], k: number): number { + +};","(define/contract (num-subarray-product-less-than-k nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec num_subarray_product_less_than_k(Nums :: [integer()], K :: integer()) -> integer(). +num_subarray_product_less_than_k(Nums, K) -> + .","defmodule Solution do + @spec num_subarray_product_less_than_k(nums :: [integer], k :: integer) :: integer + def num_subarray_product_less_than_k(nums, k) do + + end +end","class Solution { + int numSubarrayProductLessThanK(List nums, int k) { + + } +}", +1619,minimum-ascii-delete-sum-for-two-strings,Minimum ASCII Delete Sum for Two Strings,712.0,712.0,"

Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.

+ +

 

+

Example 1:

+ +
+Input: s1 = "sea", s2 = "eat"
+Output: 231
+Explanation: Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
+Deleting "t" from "eat" adds 116 to the sum.
+At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.
+
+ +

Example 2:

+ +
+Input: s1 = "delete", s2 = "leet"
+Output: 403
+Explanation: Deleting "dee" from "delete" to turn the string into "let",
+adds 100[d] + 101[e] + 101[e] to the sum.
+Deleting "e" from "leet" adds 101[e] to the sum.
+At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
+If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length <= 1000
    • +
  • s1 and s2 consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minimumDeleteSum(string s1, string s2) { + + } +};","class Solution { + public int minimumDeleteSum(String s1, String s2) { + + } +}","class Solution(object): + def minimumDeleteSum(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: int + """""" + ","class Solution: + def minimumDeleteSum(self, s1: str, s2: str) -> int: + ","int minimumDeleteSum(char * s1, char * s2){ + +}","public class Solution { + public int MinimumDeleteSum(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {number} + */ +var minimumDeleteSum = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Integer} +def minimum_delete_sum(s1, s2) + +end","class Solution { + func minimumDeleteSum(_ s1: String, _ s2: String) -> Int { + + } +}","func minimumDeleteSum(s1 string, s2 string) int { + +}","object Solution { + def minimumDeleteSum(s1: String, s2: String): Int = { + + } +}","class Solution { + fun minimumDeleteSum(s1: String, s2: String): Int { + + } +}","impl Solution { + pub fn minimum_delete_sum(s1: String, s2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Integer + */ + function minimumDeleteSum($s1, $s2) { + + } +}","function minimumDeleteSum(s1: string, s2: string): number { + +};","(define/contract (minimum-delete-sum s1 s2) + (-> string? string? exact-integer?) + + )","-spec minimum_delete_sum(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> integer(). +minimum_delete_sum(S1, S2) -> + .","defmodule Solution do + @spec minimum_delete_sum(s1 :: String.t, s2 :: String.t) :: integer + def minimum_delete_sum(s1, s2) do + + end +end","class Solution { + int minimumDeleteSum(String s1, String s2) { + + } +}", +1620,falling-squares,Falling Squares,699.0,699.0,"

There are several squares being dropped onto the X-axis of a 2D plane.

+ +

You are given a 2D integer array positions where positions[i] = [lefti, sideLengthi] represents the ith square with a side length of sideLengthi that is dropped with its left edge aligned with X-coordinate lefti.

+ +

Each square is dropped one at a time from a height above any landed squares. It then falls downward (negative Y direction) until it either lands on the top side of another square or on the X-axis. A square brushing the left/right side of another square does not count as landing on it. Once it lands, it freezes in place and cannot be moved.

+ +

After each square is dropped, you must record the height of the current tallest stack of squares.

+ +

Return an integer array ans where ans[i] represents the height described above after dropping the ith square.

+ +

 

+

Example 1:

+ +
+Input: positions = [[1,2],[2,3],[6,1]]
+Output: [2,5,5]
+Explanation:
+After the first drop, the tallest stack is square 1 with a height of 2.
+After the second drop, the tallest stack is squares 1 and 2 with a height of 5.
+After the third drop, the tallest stack is still squares 1 and 2 with a height of 5.
+Thus, we return an answer of [2, 5, 5].
+
+ +

Example 2:

+ +
+Input: positions = [[100,100],[200,100]]
+Output: [100,100]
+Explanation:
+After the first drop, the tallest stack is square 1 with a height of 100.
+After the second drop, the tallest stack is either square 1 or square 2, both with heights of 100.
+Thus, we return an answer of [100, 100].
+Note that square 2 only brushes the right side of square 1, which does not count as landing on it.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= positions.length <= 1000
    • +
  • 1 <= lefti <= 108
    • +
  • 1 <= sideLengthi <= 106
    • +
+",3.0,False,"class Solution { +public: + vector fallingSquares(vector>& positions) { + + } +};","class Solution { + public List fallingSquares(int[][] positions) { + + } +}","class Solution(object): + def fallingSquares(self, positions): + """""" + :type positions: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def fallingSquares(self, positions: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* fallingSquares(int** positions, int positionsSize, int* positionsColSize, int* returnSize){ + +}","public class Solution { + public IList FallingSquares(int[][] positions) { + + } +}","/** + * @param {number[][]} positions + * @return {number[]} + */ +var fallingSquares = function(positions) { + +};","# @param {Integer[][]} positions +# @return {Integer[]} +def falling_squares(positions) + +end","class Solution { + func fallingSquares(_ positions: [[Int]]) -> [Int] { + + } +}","func fallingSquares(positions [][]int) []int { + +}","object Solution { + def fallingSquares(positions: Array[Array[Int]]): List[Int] = { + + } +}","class Solution { + fun fallingSquares(positions: Array): List { + + } +}","impl Solution { + pub fn falling_squares(positions: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $positions + * @return Integer[] + */ + function fallingSquares($positions) { + + } +}","function fallingSquares(positions: number[][]): number[] { + +};","(define/contract (falling-squares positions) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec falling_squares(Positions :: [[integer()]]) -> [integer()]. +falling_squares(Positions) -> + .","defmodule Solution do + @spec falling_squares(positions :: [[integer]]) :: [integer] + def falling_squares(positions) do + + end +end","class Solution { + List fallingSquares(List> positions) { + + } +}", +1624,max-area-of-island,Max Area of Island,695.0,695.0,"

You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

+ +

The area of an island is the number of cells with a value 1 in the island.

+ +

Return the maximum area of an island in grid. If there is no island, return 0.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,0,1,0,0,0,0,1,0,0,0,0,0],[0,0,0,0,0,0,0,1,1,1,0,0,0],[0,1,1,0,1,0,0,0,0,0,0,0,0],[0,1,0,0,1,1,0,0,1,0,1,0,0],[0,1,0,0,1,1,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,0,1,0,0],[0,0,0,0,0,0,0,1,1,1,0,0,0],[0,0,0,0,0,0,0,1,1,0,0,0,0]]
+Output: 6
+Explanation: The answer is not 11, because the island must be connected 4-directionally.
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,0,0,0,0,0,0]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
    • +
  • n == grid[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • grid[i][j] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int maxAreaOfIsland(vector>& grid) { + + } +};","class Solution { + public int maxAreaOfIsland(int[][] grid) { + + } +}","class Solution(object): + def maxAreaOfIsland(self, grid): + """""" + :type grid: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxAreaOfIsland(self, grid: List[List[int]]) -> int: + ","int maxAreaOfIsland(int** grid, int gridSize, int* gridColSize){ + +}","public class Solution { + public int MaxAreaOfIsland(int[][] grid) { + + } +}","/** + * @param {number[][]} grid + * @return {number} + */ +var maxAreaOfIsland = function(grid) { + +};","# @param {Integer[][]} grid +# @return {Integer} +def max_area_of_island(grid) + +end","class Solution { + func maxAreaOfIsland(_ grid: [[Int]]) -> Int { + + } +}","func maxAreaOfIsland(grid [][]int) int { + +}","object Solution { + def maxAreaOfIsland(grid: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxAreaOfIsland(grid: Array): Int { + + } +}","impl Solution { + pub fn max_area_of_island(grid: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $grid + * @return Integer + */ + function maxAreaOfIsland($grid) { + + } +}","function maxAreaOfIsland(grid: number[][]): number { + +};","(define/contract (max-area-of-island grid) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_area_of_island(Grid :: [[integer()]]) -> integer(). +max_area_of_island(Grid) -> + .","defmodule Solution do + @spec max_area_of_island(grid :: [[integer]]) :: integer + def max_area_of_island(grid) do + + end +end","class Solution { + int maxAreaOfIsland(List> grid) { + + } +}", +1626,top-k-frequent-words,Top K Frequent Words,692.0,692.0,"

Given an array of strings words and an integer k, return the k most frequent strings.

+ +

Return the answer sorted by the frequency from highest to lowest. Sort the words with the same frequency by their lexicographical order.

+ +

 

+

Example 1:

+ +
+Input: words = ["i","love","leetcode","i","love","coding"], k = 2
+Output: ["i","love"]
+Explanation: "i" and "love" are the two most frequent words.
+Note that "i" comes before "love" due to a lower alphabetical order.
+
+ +

Example 2:

+ +
+Input: words = ["the","day","is","sunny","the","the","the","sunny","is","is"], k = 4
+Output: ["the","is","sunny","day"]
+Explanation: "the", "is", "sunny" and "day" are the four most frequent words, with the number of occurrence being 4, 3, 2 and 1 respectively.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 500
    • +
  • 1 <= words[i].length <= 10
    • +
  • words[i] consists of lowercase English letters.
    • +
  • k is in the range [1, The number of unique words[i]]
    • +
+ +

 

+

Follow-up: Could you solve it in O(n log(k)) time and O(n) extra space?

+",2.0,False,"class Solution { +public: + vector topKFrequent(vector& words, int k) { + + } +};","class Solution { + public List topKFrequent(String[] words, int k) { + + } +}","class Solution(object): + def topKFrequent(self, words, k): + """""" + :type words: List[str] + :type k: int + :rtype: List[str] + """""" + ","class Solution: + def topKFrequent(self, words: List[str], k: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** topKFrequent(char ** words, int wordsSize, int k, int* returnSize){ + +}","public class Solution { + public IList TopKFrequent(string[] words, int k) { + + } +}","/** + * @param {string[]} words + * @param {number} k + * @return {string[]} + */ +var topKFrequent = function(words, k) { + +};","# @param {String[]} words +# @param {Integer} k +# @return {String[]} +def top_k_frequent(words, k) + +end","class Solution { + func topKFrequent(_ words: [String], _ k: Int) -> [String] { + + } +}","func topKFrequent(words []string, k int) []string { + +}","object Solution { + def topKFrequent(words: Array[String], k: Int): List[String] = { + + } +}","class Solution { + fun topKFrequent(words: Array, k: Int): List { + + } +}","impl Solution { + pub fn top_k_frequent(words: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @param Integer $k + * @return String[] + */ + function topKFrequent($words, $k) { + + } +}","function topKFrequent(words: string[], k: number): string[] { + +};","(define/contract (top-k-frequent words k) + (-> (listof string?) exact-integer? (listof string?)) + + )","-spec top_k_frequent(Words :: [unicode:unicode_binary()], K :: integer()) -> [unicode:unicode_binary()]. +top_k_frequent(Words, K) -> + .","defmodule Solution do + @spec top_k_frequent(words :: [String.t], k :: integer) :: [String.t] + def top_k_frequent(words, k) do + + end +end","class Solution { + List topKFrequent(List words, int k) { + + } +}", +1627,stickers-to-spell-word,Stickers to Spell Word,691.0,691.0,"

We are given n different types of stickers. Each sticker has a lowercase English word on it.

+ +

You would like to spell out the given string target by cutting individual letters from your collection of stickers and rearranging them. You can use each sticker more than once if you want, and you have infinite quantities of each sticker.

+ +

Return the minimum number of stickers that you need to spell out target. If the task is impossible, return -1.

+ +

Note: In all test cases, all words were chosen randomly from the 1000 most common US English words, and target was chosen as a concatenation of two random words.

+ +

 

+

Example 1:

+ +
+Input: stickers = ["with","example","science"], target = "thehat"
+Output: 3
+Explanation:
+We can use 2 "with" stickers, and 1 "example" sticker.
+After cutting and rearrange the letters of those stickers, we can form the target "thehat".
+Also, this is the minimum number of stickers necessary to form the target string.
+
+ +

Example 2:

+ +
+Input: stickers = ["notice","possible"], target = "basicbasic"
+Output: -1
+Explanation:
+We cannot form the target "basicbasic" from cutting letters from the given stickers.
+
+ +

 

+

Constraints:

+ +
    +
  • n == stickers.length
    • +
  • 1 <= n <= 50
    • +
  • 1 <= stickers[i].length <= 10
    • +
  • 1 <= target.length <= 15
    • +
  • stickers[i] and target consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int minStickers(vector& stickers, string target) { + + } +};","class Solution { + public int minStickers(String[] stickers, String target) { + + } +}","class Solution(object): + def minStickers(self, stickers, target): + """""" + :type stickers: List[str] + :type target: str + :rtype: int + """""" + ","class Solution: + def minStickers(self, stickers: List[str], target: str) -> int: + ","int minStickers(char ** stickers, int stickersSize, char * target){ + +}","public class Solution { + public int MinStickers(string[] stickers, string target) { + + } +}","/** + * @param {string[]} stickers + * @param {string} target + * @return {number} + */ +var minStickers = function(stickers, target) { + +};","# @param {String[]} stickers +# @param {String} target +# @return {Integer} +def min_stickers(stickers, target) + +end","class Solution { + func minStickers(_ stickers: [String], _ target: String) -> Int { + + } +}","func minStickers(stickers []string, target string) int { + +}","object Solution { + def minStickers(stickers: Array[String], target: String): Int = { + + } +}","class Solution { + fun minStickers(stickers: Array, target: String): Int { + + } +}","impl Solution { + pub fn min_stickers(stickers: Vec, target: String) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $stickers + * @param String $target + * @return Integer + */ + function minStickers($stickers, $target) { + + } +}","function minStickers(stickers: string[], target: string): number { + +};","(define/contract (min-stickers stickers target) + (-> (listof string?) string? exact-integer?) + + )","-spec min_stickers(Stickers :: [unicode:unicode_binary()], Target :: unicode:unicode_binary()) -> integer(). +min_stickers(Stickers, Target) -> + .","defmodule Solution do + @spec min_stickers(stickers :: [String.t], target :: String.t) :: integer + def min_stickers(stickers, target) do + + end +end","class Solution { + int minStickers(List stickers, String target) { + + } +}", +1628,employee-importance,Employee Importance,690.0,690.0,"

You have a data structure of employee information, including the employee's unique ID, importance value, and direct subordinates' IDs.

+ +

You are given an array of employees employees where:

+ +
    +
  • employees[i].id is the ID of the ith employee.
    • +
  • employees[i].importance is the importance value of the ith employee.
    • +
  • employees[i].subordinates is a list of the IDs of the direct subordinates of the ith employee.
    • +
+ +

Given an integer id that represents an employee's ID, return the total importance value of this employee and all their direct and indirect subordinates.

+ +

 

+

Example 1:

+ +
+Input: employees = [[1,5,[2,3]],[2,3,[]],[3,3,[]]], id = 1
+Output: 11
+Explanation: Employee 1 has an importance value of 5 and has two direct subordinates: employee 2 and employee 3.
+They both have an importance value of 3.
+Thus, the total importance value of employee 1 is 5 + 3 + 3 = 11.
+
+ +

Example 2:

+ +
+Input: employees = [[1,2,[5]],[5,-3,[]]], id = 5
+Output: -3
+Explanation: Employee 5 has an importance value of -3 and has no direct subordinates.
+Thus, the total importance value of employee 5 is -3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= employees.length <= 2000
    • +
  • 1 <= employees[i].id <= 2000
    • +
  • All employees[i].id are unique.
    • +
  • -100 <= employees[i].importance <= 100
    • +
  • One employee has at most one direct leader and may have several subordinates.
    • +
  • The IDs in employees[i].subordinates are valid IDs.
    • +
+",2.0,False,"/* +// Definition for Employee. +class Employee { +public: + int id; + int importance; + vector subordinates; +}; +*/ + +class Solution { +public: + int getImportance(vector employees, int id) { + + } +};","/* +// Definition for Employee. +class Employee { + public int id; + public int importance; + public List subordinates; +}; +*/ + +class Solution { + public int getImportance(List employees, int id) { + + } +}",""""""" +# Definition for Employee. +class Employee(object): + def __init__(self, id, importance, subordinates): + ################# + :type id: int + :type importance: int + :type subordinates: List[int] + ################# + self.id = id + self.importance = importance + self.subordinates = subordinates +"""""" + +class Solution(object): + def getImportance(self, employees, id): + """""" + :type employees: List[Employee] + :type id: int + :rtype: int + """""" + ",""""""" +# Definition for Employee. +class Employee: + def __init__(self, id: int, importance: int, subordinates: List[int]): + self.id = id + self.importance = importance + self.subordinates = subordinates +"""""" + +class Solution: + def getImportance(self, employees: List['Employee'], id: int) -> int: + ",,"/* +// Definition for Employee. +class Employee { + public int id; + public int importance; + public IList subordinates; +} +*/ + +class Solution { + public int GetImportance(IList employees, int id) { + + } +}","/** + * Definition for Employee. + * function Employee(id, importance, subordinates) { + * this.id = id; + * this.importance = importance; + * this.subordinates = subordinates; + * } + */ + +/** + * @param {Employee[]} employees + * @param {number} id + * @return {number} + */ +var GetImportance = function(employees, id) { + +};","=begin +# Definition for Employee. +class Employee + attr_accessor :id, :importance, :subordinates + def initialize( id, importance, subordinates) + @id = id + @importance = importance + @subordinates = subordinates + end +end +=end + +# @param {Employee} employees +# @param {Integer} id +# @return {Integer} +def get_importance(employees, id) + +end","/** + * Definition for Employee. + * public class Employee { + * public var id: Int + * public var importance: Int + * public var subordinates: [Int] + * public init(_ id: Int, _ importance: Int, _ subordinates: [Int]) { + * self.id = id + * self.importance = importance + * self.subordinates = subordinates + * } + * } + */ + +class Solution { + func getImportance(_ employees: [Employee], _ id: Int) -> Int { + + } +}","/** + * Definition for Employee. + * type Employee struct { + * Id int + * Importance int + * Subordinates []int + * } + */ + +func getImportance(employees []*Employee, id int) int { + +}","/* +// Definition for Employee. +class Employee() { + var id: Int = 0 + var importance: Int = 0 + var subordinates: List[Int] = List() +}; +*/ + +object Solution { + def getImportance(employees: List[Employee], id: Int): Int = { + + } +}","/* + * // Definition for Employee. + * class Employee { + * var id:Int = 0 + * var importance:Int = 0 + * var subordinates:List = listOf() + * } + */ + +class Solution { + fun getImportance(employees: List, id: Int): Int { + + } +}",,"/** + * Definition for Employee. + * class Employee { + * public $id = null; + * public $importance = null; + * public $subordinates = array(); + * function __construct($id, $importance, $subordinates) { + * $this->id = $id; + * $this->importance = $importance; + * $this->subordinates = $subordinates; + * } + * } + */ + +class Solution { + /** + * @param Employee[] $employees + * @param Integer $id + * @return Integer + */ + function getImportance($employees, $id) { + + } +}","/** + * Definition for Employee. + * class Employee { + * id: number + * importance: number + * subordinates: number[] + * constructor(id: number, importance: number, subordinates: number[]) { + * this.id = (id === undefined) ? 0 : id; + * this.importance = (importance === undefined) ? 0 : importance; + * this.subordinates = (subordinates === undefined) ? [] : subordinates; + * } + * } + */ + +function getImportance(employees: Employee[], id: number): number { + +};",,,,, +1629,maximum-sum-of-3-non-overlapping-subarrays,Maximum Sum of 3 Non-Overlapping Subarrays,689.0,689.0,"

Given an integer array nums and an integer k, find three non-overlapping subarrays of length k with maximum sum and return them.

+ +

Return the result as a list of indices representing the starting position of each interval (0-indexed). If there are multiple answers, return the lexicographically smallest one.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2,6,7,5,1], k = 2
+Output: [0,3,5]
+Explanation: Subarrays [1, 2], [2, 6], [7, 5] correspond to the starting indices [0, 3, 5].
+We could have also taken [2, 1], but an answer of [1, 3, 5] would be lexicographically larger.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,1,2,1,2,1,2,1], k = 2
+Output: [0,2,4]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 104
    • +
  • 1 <= nums[i] < 216
    • +
  • 1 <= k <= floor(nums.length / 3)
    • +
+",3.0,False,"class Solution { +public: + vector maxSumOfThreeSubarrays(vector& nums, int k) { + + } +};","class Solution { + public int[] maxSumOfThreeSubarrays(int[] nums, int k) { + + } +}","class Solution(object): + def maxSumOfThreeSubarrays(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def maxSumOfThreeSubarrays(self, nums: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxSumOfThreeSubarrays(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public int[] MaxSumOfThreeSubarrays(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var maxSumOfThreeSubarrays = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer[]} +def max_sum_of_three_subarrays(nums, k) + +end","class Solution { + func maxSumOfThreeSubarrays(_ nums: [Int], _ k: Int) -> [Int] { + + } +}","func maxSumOfThreeSubarrays(nums []int, k int) []int { + +}","object Solution { + def maxSumOfThreeSubarrays(nums: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun maxSumOfThreeSubarrays(nums: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn max_sum_of_three_subarrays(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer[] + */ + function maxSumOfThreeSubarrays($nums, $k) { + + } +}","function maxSumOfThreeSubarrays(nums: number[], k: number): number[] { + +};","(define/contract (max-sum-of-three-subarrays nums k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec max_sum_of_three_subarrays(Nums :: [integer()], K :: integer()) -> [integer()]. +max_sum_of_three_subarrays(Nums, K) -> + .","defmodule Solution do + @spec max_sum_of_three_subarrays(nums :: [integer], k :: integer) :: [integer] + def max_sum_of_three_subarrays(nums, k) do + + end +end","class Solution { + List maxSumOfThreeSubarrays(List nums, int k) { + + } +}", +1630,knight-probability-in-chessboard,Knight Probability in Chessboard,688.0,688.0,"

On an n x n chessboard, a knight starts at the cell (row, column) and attempts to make exactly k moves. The rows and columns are 0-indexed, so the top-left cell is (0, 0), and the bottom-right cell is (n - 1, n - 1).

+ +

A chess knight has eight possible moves it can make, as illustrated below. Each move is two cells in a cardinal direction, then one cell in an orthogonal direction.

+ +

Each time the knight is to move, it chooses one of eight possible moves uniformly at random (even if the piece would go off the chessboard) and moves there.

+ +

The knight continues moving until it has made exactly k moves or has moved off the chessboard.

+ +

Return the probability that the knight remains on the board after it has stopped moving.

+ +

 

+

Example 1:

+ +
+Input: n = 3, k = 2, row = 0, column = 0
+Output: 0.06250
+Explanation: There are two moves (to (1,2), (2,1)) that will keep the knight on the board.
+From each of those positions, there are also two moves that will keep the knight on the board.
+The total probability the knight stays on the board is 0.0625.
+
+ +

Example 2:

+ +
+Input: n = 1, k = 0, row = 0, column = 0
+Output: 1.00000
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 25
    • +
  • 0 <= k <= 100
    • +
  • 0 <= row, column <= n - 1
    • +
+",2.0,False,"class Solution { +public: + double knightProbability(int n, int k, int row, int column) { + + } +};","class Solution { + public double knightProbability(int n, int k, int row, int column) { + + } +}","class Solution(object): + def knightProbability(self, n, k, row, column): + """""" + :type n: int + :type k: int + :type row: int + :type column: int + :rtype: float + """""" + ","class Solution: + def knightProbability(self, n: int, k: int, row: int, column: int) -> float: + ","double knightProbability(int n, int k, int row, int column){ + +}","public class Solution { + public double KnightProbability(int n, int k, int row, int column) { + + } +}","/** + * @param {number} n + * @param {number} k + * @param {number} row + * @param {number} column + * @return {number} + */ +var knightProbability = function(n, k, row, column) { + +};","# @param {Integer} n +# @param {Integer} k +# @param {Integer} row +# @param {Integer} column +# @return {Float} +def knight_probability(n, k, row, column) + +end","class Solution { + func knightProbability(_ n: Int, _ k: Int, _ row: Int, _ column: Int) -> Double { + + } +}","func knightProbability(n int, k int, row int, column int) float64 { + +}","object Solution { + def knightProbability(n: Int, k: Int, row: Int, column: Int): Double = { + + } +}","class Solution { + fun knightProbability(n: Int, k: Int, row: Int, column: Int): Double { + + } +}","impl Solution { + pub fn knight_probability(n: i32, k: i32, row: i32, column: i32) -> f64 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @param Integer $row + * @param Integer $column + * @return Float + */ + function knightProbability($n, $k, $row, $column) { + + } +}","function knightProbability(n: number, k: number, row: number, column: number): number { + +};","(define/contract (knight-probability n k row column) + (-> exact-integer? exact-integer? exact-integer? exact-integer? flonum?) + + )","-spec knight_probability(N :: integer(), K :: integer(), Row :: integer(), Column :: integer()) -> float(). +knight_probability(N, K, Row, Column) -> + .","defmodule Solution do + @spec knight_probability(n :: integer, k :: integer, row :: integer, column :: integer) :: float + def knight_probability(n, k, row, column) do + + end +end","class Solution { + double knightProbability(int n, int k, int row, int column) { + + } +}", +1633,redundant-connection-ii,Redundant Connection II,685.0,685.0,"

In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.

+ +

The given input is a directed graph that started as a rooted tree with n nodes (with distinct values from 1 to n), with one additional directed edge added. The added edge has two different vertices chosen from 1 to n, and was not an edge that already existed.

+ +

The resulting graph is given as a 2D-array of edges. Each element of edges is a pair [ui, vi] that represents a directed edge connecting nodes ui and vi, where ui is a parent of child vi.

+ +

Return an edge that can be removed so that the resulting graph is a rooted tree of n nodes. If there are multiple answers, return the answer that occurs last in the given 2D-array.

+ +

 

+

Example 1:

+ +
+Input: edges = [[1,2],[1,3],[2,3]]
+Output: [2,3]
+
+ +

Example 2:

+ +
+Input: edges = [[1,2],[2,3],[3,4],[4,1],[1,5]]
+Output: [4,1]
+
+ +

 

+

Constraints:

+ +
    +
  • n == edges.length
    • +
  • 3 <= n <= 1000
    • +
  • edges[i].length == 2
    • +
  • 1 <= ui, vi <= n
    • +
  • ui != vi
    • +
+",3.0,False,"class Solution { +public: + vector findRedundantDirectedConnection(vector>& edges) { + + } +};","class Solution { + public int[] findRedundantDirectedConnection(int[][] edges) { + + } +}","class Solution(object): + def findRedundantDirectedConnection(self, edges): + """""" + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findRedundantDirectedConnection(self, edges: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findRedundantDirectedConnection(int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public int[] FindRedundantDirectedConnection(int[][] edges) { + + } +}","/** + * @param {number[][]} edges + * @return {number[]} + */ +var findRedundantDirectedConnection = function(edges) { + +};","# @param {Integer[][]} edges +# @return {Integer[]} +def find_redundant_directed_connection(edges) + +end","class Solution { + func findRedundantDirectedConnection(_ edges: [[Int]]) -> [Int] { + + } +}","func findRedundantDirectedConnection(edges [][]int) []int { + +}","object Solution { + def findRedundantDirectedConnection(edges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun findRedundantDirectedConnection(edges: Array): IntArray { + + } +}","impl Solution { + pub fn find_redundant_directed_connection(edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $edges + * @return Integer[] + */ + function findRedundantDirectedConnection($edges) { + + } +}","function findRedundantDirectedConnection(edges: number[][]): number[] { + +};","(define/contract (find-redundant-directed-connection edges) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_redundant_directed_connection(Edges :: [[integer()]]) -> [integer()]. +find_redundant_directed_connection(Edges) -> + .","defmodule Solution do + @spec find_redundant_directed_connection(edges :: [[integer]]) :: [integer] + def find_redundant_directed_connection(edges) do + + end +end","class Solution { + List findRedundantDirectedConnection(List> edges) { + + } +}", +1634,redundant-connection,Redundant Connection,684.0,684.0,"

In this problem, a tree is an undirected graph that is connected and has no cycles.

+ +

You are given a graph that started as a tree with n nodes labeled from 1 to n, with one additional edge added. The added edge has two different vertices chosen from 1 to n, and was not an edge that already existed. The graph is represented as an array edges of length n where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the graph.

+ +

Return an edge that can be removed so that the resulting graph is a tree of n nodes. If there are multiple answers, return the answer that occurs last in the input.

+ +

 

+

Example 1:

+ +
+Input: edges = [[1,2],[1,3],[2,3]]
+Output: [2,3]
+
+ +

Example 2:

+ +
+Input: edges = [[1,2],[2,3],[3,4],[1,4],[1,5]]
+Output: [1,4]
+
+ +

 

+

Constraints:

+ +
    +
  • n == edges.length
    • +
  • 3 <= n <= 1000
    • +
  • edges[i].length == 2
    • +
  • 1 <= ai < bi <= edges.length
    • +
  • ai != bi
    • +
  • There are no repeated edges.
    • +
  • The given graph is connected.
    • +
+",2.0,False,"class Solution { +public: + vector findRedundantConnection(vector>& edges) { + + } +};","class Solution { + public int[] findRedundantConnection(int[][] edges) { + + } +}","class Solution(object): + def findRedundantConnection(self, edges): + """""" + :type edges: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findRedundantConnection(self, edges: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findRedundantConnection(int** edges, int edgesSize, int* edgesColSize, int* returnSize){ + +}","public class Solution { + public int[] FindRedundantConnection(int[][] edges) { + + } +}","/** + * @param {number[][]} edges + * @return {number[]} + */ +var findRedundantConnection = function(edges) { + +};","# @param {Integer[][]} edges +# @return {Integer[]} +def find_redundant_connection(edges) + +end","class Solution { + func findRedundantConnection(_ edges: [[Int]]) -> [Int] { + + } +}","func findRedundantConnection(edges [][]int) []int { + +}","object Solution { + def findRedundantConnection(edges: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun findRedundantConnection(edges: Array): IntArray { + + } +}","impl Solution { + pub fn find_redundant_connection(edges: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $edges + * @return Integer[] + */ + function findRedundantConnection($edges) { + + } +}","function findRedundantConnection(edges: number[][]): number[] { + +};","(define/contract (find-redundant-connection edges) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_redundant_connection(Edges :: [[integer()]]) -> [integer()]. +find_redundant_connection(Edges) -> + .","defmodule Solution do + @spec find_redundant_connection(edges :: [[integer]]) :: [integer] + def find_redundant_connection(edges) do + + end +end","class Solution { + List findRedundantConnection(List> edges) { + + } +}", +1635,baseball-game,Baseball Game,682.0,682.0,"

You are keeping the scores for a baseball game with strange rules. At the beginning of the game, you start with an empty record.

+ +

You are given a list of strings operations, where operations[i] is the ith operation you must apply to the record and is one of the following:

+ +
    +
  • An integer x. + +
      +
    • Record a new score of x.
      • +
    +
    • +
  • '+'. +
      +
    • Record a new score that is the sum of the previous two scores.
      • +
    +
    • +
  • 'D'. +
      +
    • Record a new score that is the double of the previous score.
      • +
    +
    • +
  • 'C'. +
      +
    • Invalidate the previous score, removing it from the record.
      • +
    +
    • +
+ +

Return the sum of all the scores on the record after applying all the operations.

+ +

The test cases are generated such that the answer and all intermediate calculations fit in a 32-bit integer and that all operations are valid.

+ +

 

+

Example 1:

+ +
+Input: ops = ["5","2","C","D","+"]
+Output: 30
+Explanation:
+"5" - Add 5 to the record, record is now [5].
+"2" - Add 2 to the record, record is now [5, 2].
+"C" - Invalidate and remove the previous score, record is now [5].
+"D" - Add 2 * 5 = 10 to the record, record is now [5, 10].
+"+" - Add 5 + 10 = 15 to the record, record is now [5, 10, 15].
+The total sum is 5 + 10 + 15 = 30.
+
+ +

Example 2:

+ +
+Input: ops = ["5","-2","4","C","D","9","+","+"]
+Output: 27
+Explanation:
+"5" - Add 5 to the record, record is now [5].
+"-2" - Add -2 to the record, record is now [5, -2].
+"4" - Add 4 to the record, record is now [5, -2, 4].
+"C" - Invalidate and remove the previous score, record is now [5, -2].
+"D" - Add 2 * -2 = -4 to the record, record is now [5, -2, -4].
+"9" - Add 9 to the record, record is now [5, -2, -4, 9].
+"+" - Add -4 + 9 = 5 to the record, record is now [5, -2, -4, 9, 5].
+"+" - Add 9 + 5 = 14 to the record, record is now [5, -2, -4, 9, 5, 14].
+The total sum is 5 + -2 + -4 + 9 + 5 + 14 = 27.
+
+ +

Example 3:

+ +
+Input: ops = ["1","C"]
+Output: 0
+Explanation:
+"1" - Add 1 to the record, record is now [1].
+"C" - Invalidate and remove the previous score, record is now [].
+Since the record is empty, the total sum is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= operations.length <= 1000
    • +
  • operations[i] is "C", "D", "+", or a string representing an integer in the range [-3 * 104, 3 * 104].
    • +
  • For operation "+", there will always be at least two previous scores on the record.
    • +
  • For operations "C" and "D", there will always be at least one previous score on the record.
    • +
+",1.0,False,"class Solution { +public: + int calPoints(vector& operations) { + + } +};","class Solution { + public int calPoints(String[] operations) { + + } +}","class Solution(object): + def calPoints(self, operations): + """""" + :type operations: List[str] + :rtype: int + """""" + ","class Solution: + def calPoints(self, operations: List[str]) -> int: + ","int calPoints(char ** operations, int operationsSize){ + +}","public class Solution { + public int CalPoints(string[] operations) { + + } +}","/** + * @param {string[]} operations + * @return {number} + */ +var calPoints = function(operations) { + +};","# @param {String[]} operations +# @return {Integer} +def cal_points(operations) + +end","class Solution { + func calPoints(_ operations: [String]) -> Int { + + } +}","func calPoints(operations []string) int { + +}","object Solution { + def calPoints(operations: Array[String]): Int = { + + } +}","class Solution { + fun calPoints(operations: Array): Int { + + } +}","impl Solution { + pub fn cal_points(operations: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $operations + * @return Integer + */ + function calPoints($operations) { + + } +}","function calPoints(operations: string[]): number { + +};","(define/contract (cal-points operations) + (-> (listof string?) exact-integer?) + + )","-spec cal_points(Operations :: [unicode:unicode_binary()]) -> integer(). +cal_points(Operations) -> + .","defmodule Solution do + @spec cal_points(operations :: [String.t]) :: integer + def cal_points(operations) do + + end +end","class Solution { + int calPoints(List operations) { + + } +}", +1636,valid-palindrome-ii,Valid Palindrome II,680.0,680.0,"

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

+ +

 

+

Example 1:

+ +
+Input: s = "aba"
+Output: true
+
+ +

Example 2:

+ +
+Input: s = "abca"
+Output: true
+Explanation: You could delete the character 'c'.
+
+ +

Example 3:

+ +
+Input: s = "abc"
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + bool validPalindrome(string s) { + + } +};","class Solution { + public boolean validPalindrome(String s) { + + } +}","class Solution(object): + def validPalindrome(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def validPalindrome(self, s: str) -> bool: + ","bool validPalindrome(char * s){ + +}","public class Solution { + public bool ValidPalindrome(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var validPalindrome = function(s) { + +};","# @param {String} s +# @return {Boolean} +def valid_palindrome(s) + +end","class Solution { + func validPalindrome(_ s: String) -> Bool { + + } +}","func validPalindrome(s string) bool { + +}","object Solution { + def validPalindrome(s: String): Boolean = { + + } +}","class Solution { + fun validPalindrome(s: String): Boolean { + + } +}","impl Solution { + pub fn valid_palindrome(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function validPalindrome($s) { + + } +}","function validPalindrome(s: string): boolean { + +};","(define/contract (valid-palindrome s) + (-> string? boolean?) + + )","-spec valid_palindrome(S :: unicode:unicode_binary()) -> boolean(). +valid_palindrome(S) -> + .","defmodule Solution do + @spec valid_palindrome(s :: String.t) :: boolean + def valid_palindrome(s) do + + end +end","class Solution { + bool validPalindrome(String s) { + + } +}", +1637,24-game,24 Game,679.0,679.0,"

You are given an integer array cards of length 4. You have four cards, each containing a number in the range [1, 9]. You should arrange the numbers on these cards in a mathematical expression using the operators ['+', '-', '*', '/'] and the parentheses '(' and ')' to get the value 24.

+ +

You are restricted with the following rules:

+ +
    +
  • The division operator '/' represents real division, not integer division. + +
      +
    • For example, 4 / (1 - 2 / 3) = 4 / (1 / 3) = 12.
      • +
    +
    • +
  • Every operation done is between two numbers. In particular, we cannot use '-' as a unary operator. +
      +
    • For example, if cards = [1, 1, 1, 1], the expression "-1 - 1 - 1 - 1" is not allowed.
      • +
    +
    • +
  • You cannot concatenate numbers together +
      +
    • For example, if cards = [1, 2, 1, 2], the expression "12 + 12" is not valid.
      • +
    +
    • +
+ +

Return true if you can get such expression that evaluates to 24, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: cards = [4,1,8,7]
+Output: true
+Explanation: (8-4) * (7-1) = 24
+
+ +

Example 2:

+ +
+Input: cards = [1,2,1,2]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • cards.length == 4
    • +
  • 1 <= cards[i] <= 9
    • +
+",3.0,False,"class Solution { +public: + bool judgePoint24(vector& cards) { + + } +};","class Solution { + public boolean judgePoint24(int[] cards) { + + } +}","class Solution(object): + def judgePoint24(self, cards): + """""" + :type cards: List[int] + :rtype: bool + """""" + ","class Solution: + def judgePoint24(self, cards: List[int]) -> bool: + ","bool judgePoint24(int* cards, int cardsSize){ + +}","public class Solution { + public bool JudgePoint24(int[] cards) { + + } +}","/** + * @param {number[]} cards + * @return {boolean} + */ +var judgePoint24 = function(cards) { + +};","# @param {Integer[]} cards +# @return {Boolean} +def judge_point24(cards) + +end","class Solution { + func judgePoint24(_ cards: [Int]) -> Bool { + + } +}","func judgePoint24(cards []int) bool { + +}","object Solution { + def judgePoint24(cards: Array[Int]): Boolean = { + + } +}","class Solution { + fun judgePoint24(cards: IntArray): Boolean { + + } +}","impl Solution { + pub fn judge_point24(cards: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $cards + * @return Boolean + */ + function judgePoint24($cards) { + + } +}","function judgePoint24(cards: number[]): boolean { + +};","(define/contract (judge-point24 cards) + (-> (listof exact-integer?) boolean?) + + )","-spec judge_point24(Cards :: [integer()]) -> boolean(). +judge_point24(Cards) -> + .","defmodule Solution do + @spec judge_point24(cards :: [integer]) :: boolean + def judge_point24(cards) do + + end +end","class Solution { + bool judgePoint24(List cards) { + + } +}", +1639,map-sum-pairs,Map Sum Pairs,677.0,677.0,"

Design a map that allows you to do the following:

+ +
    +
  • Maps a string key to a given value.
    • +
  • Returns the sum of the values that have a key with a prefix equal to a given string.
    • +
+ +

Implement the MapSum class:

+ +
    +
  • MapSum() Initializes the MapSum object.
    • +
  • void insert(String key, int val) Inserts the key-val pair into the map. If the key already existed, the original key-value pair will be overridden to the new one.
    • +
  • int sum(string prefix) Returns the sum of all the pairs' value whose key starts with the prefix.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MapSum", "insert", "sum", "insert", "sum"]
+[[], ["apple", 3], ["ap"], ["app", 2], ["ap"]]
+Output
+[null, null, 3, null, 5]
+
+Explanation
+MapSum mapSum = new MapSum();
+mapSum.insert("apple", 3);  
+mapSum.sum("ap");           // return 3 (apple = 3)
+mapSum.insert("app", 2);    
+mapSum.sum("ap");           // return 5 (apple + app = 3 + 2 = 5)
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= key.length, prefix.length <= 50
    • +
  • key and prefix consist of only lowercase English letters.
    • +
  • 1 <= val <= 1000
    • +
  • At most 50 calls will be made to insert and sum.
    • +
+",2.0,False,"class MapSum { +public: + MapSum() { + + } + + void insert(string key, int val) { + + } + + int sum(string prefix) { + + } +}; + +/** + * Your MapSum object will be instantiated and called as such: + * MapSum* obj = new MapSum(); + * obj->insert(key,val); + * int param_2 = obj->sum(prefix); + */","class MapSum { + + public MapSum() { + + } + + public void insert(String key, int val) { + + } + + public int sum(String prefix) { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * MapSum obj = new MapSum(); + * obj.insert(key,val); + * int param_2 = obj.sum(prefix); + */","class MapSum(object): + + def __init__(self): + + + def insert(self, key, val): + """""" + :type key: str + :type val: int + :rtype: None + """""" + + + def sum(self, prefix): + """""" + :type prefix: str + :rtype: int + """""" + + + +# Your MapSum object will be instantiated and called as such: +# obj = MapSum() +# obj.insert(key,val) +# param_2 = obj.sum(prefix)","class MapSum: + + def __init__(self): + + + def insert(self, key: str, val: int) -> None: + + + def sum(self, prefix: str) -> int: + + + +# Your MapSum object will be instantiated and called as such: +# obj = MapSum() +# obj.insert(key,val) +# param_2 = obj.sum(prefix)"," + + +typedef struct { + +} MapSum; + + +MapSum* mapSumCreate() { + +} + +void mapSumInsert(MapSum* obj, char * key, int val) { + +} + +int mapSumSum(MapSum* obj, char * prefix) { + +} + +void mapSumFree(MapSum* obj) { + +} + +/** + * Your MapSum struct will be instantiated and called as such: + * MapSum* obj = mapSumCreate(); + * mapSumInsert(obj, key, val); + + * int param_2 = mapSumSum(obj, prefix); + + * mapSumFree(obj); +*/","public class MapSum { + + public MapSum() { + + } + + public void Insert(string key, int val) { + + } + + public int Sum(string prefix) { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * MapSum obj = new MapSum(); + * obj.Insert(key,val); + * int param_2 = obj.Sum(prefix); + */"," +var MapSum = function() { + +}; + +/** + * @param {string} key + * @param {number} val + * @return {void} + */ +MapSum.prototype.insert = function(key, val) { + +}; + +/** + * @param {string} prefix + * @return {number} + */ +MapSum.prototype.sum = function(prefix) { + +}; + +/** + * Your MapSum object will be instantiated and called as such: + * var obj = new MapSum() + * obj.insert(key,val) + * var param_2 = obj.sum(prefix) + */","class MapSum + def initialize() + + end + + +=begin + :type key: String + :type val: Integer + :rtype: Void +=end + def insert(key, val) + + end + + +=begin + :type prefix: String + :rtype: Integer +=end + def sum(prefix) + + end + + +end + +# Your MapSum object will be instantiated and called as such: +# obj = MapSum.new() +# obj.insert(key, val) +# param_2 = obj.sum(prefix)"," +class MapSum { + + init() { + + } + + func insert(_ key: String, _ val: Int) { + + } + + func sum(_ prefix: String) -> Int { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * let obj = MapSum() + * obj.insert(key, val) + * let ret_2: Int = obj.sum(prefix) + */","type MapSum struct { + +} + + +func Constructor() MapSum { + +} + + +func (this *MapSum) Insert(key string, val int) { + +} + + +func (this *MapSum) Sum(prefix string) int { + +} + + +/** + * Your MapSum object will be instantiated and called as such: + * obj := Constructor(); + * obj.Insert(key,val); + * param_2 := obj.Sum(prefix); + */","class MapSum() { + + def insert(key: String, `val`: Int) { + + } + + def sum(prefix: String): Int = { + + } + +} + +/** + * Your MapSum object will be instantiated and called as such: + * var obj = new MapSum() + * obj.insert(key,`val`) + * var param_2 = obj.sum(prefix) + */","class MapSum() { + + fun insert(key: String, `val`: Int) { + + } + + fun sum(prefix: String): Int { + + } + +} + +/** + * Your MapSum object will be instantiated and called as such: + * var obj = MapSum() + * obj.insert(key,`val`) + * var param_2 = obj.sum(prefix) + */","struct MapSum { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MapSum { + + fn new() -> Self { + + } + + fn insert(&self, key: String, val: i32) { + + } + + fn sum(&self, prefix: String) -> i32 { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * let obj = MapSum::new(); + * obj.insert(key, val); + * let ret_2: i32 = obj.sum(prefix); + */","class MapSum { + /** + */ + function __construct() { + + } + + /** + * @param String $key + * @param Integer $val + * @return NULL + */ + function insert($key, $val) { + + } + + /** + * @param String $prefix + * @return Integer + */ + function sum($prefix) { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * $obj = MapSum(); + * $obj->insert($key, $val); + * $ret_2 = $obj->sum($prefix); + */","class MapSum { + constructor() { + + } + + insert(key: string, val: number): void { + + } + + sum(prefix: string): number { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * var obj = new MapSum() + * obj.insert(key,val) + * var param_2 = obj.sum(prefix) + */","(define map-sum% + (class object% + (super-new) + (init-field) + + ; insert : string? exact-integer? -> void? + (define/public (insert key val) + + ) + ; sum : string? -> exact-integer? + (define/public (sum prefix) + + ))) + +;; Your map-sum% object will be instantiated and called as such: +;; (define obj (new map-sum%)) +;; (send obj insert key val) +;; (define param_2 (send obj sum prefix))","-spec map_sum_init_() -> any(). +map_sum_init_() -> + . + +-spec map_sum_insert(Key :: unicode:unicode_binary(), Val :: integer()) -> any(). +map_sum_insert(Key, Val) -> + . + +-spec map_sum_sum(Prefix :: unicode:unicode_binary()) -> integer(). +map_sum_sum(Prefix) -> + . + + +%% Your functions will be called as such: +%% map_sum_init_(), +%% map_sum_insert(Key, Val), +%% Param_2 = map_sum_sum(Prefix), + +%% map_sum_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MapSum do + @spec init_() :: any + def init_() do + + end + + @spec insert(key :: String.t, val :: integer) :: any + def insert(key, val) do + + end + + @spec sum(prefix :: String.t) :: integer + def sum(prefix) do + + end +end + +# Your functions will be called as such: +# MapSum.init_() +# MapSum.insert(key, val) +# param_2 = MapSum.sum(prefix) + +# MapSum.init_ will be called before every test case, in which you can do some necessary initializations.","class MapSum { + + MapSum() { + + } + + void insert(String key, int val) { + + } + + int sum(String prefix) { + + } +} + +/** + * Your MapSum object will be instantiated and called as such: + * MapSum obj = MapSum(); + * obj.insert(key,val); + * int param2 = obj.sum(prefix); + */", +1640,implement-magic-dictionary,Implement Magic Dictionary,676.0,676.0,"

Design a data structure that is initialized with a list of different words. Provided a string, you should determine if you can change exactly one character in this string to match any word in the data structure.

+ +

Implement the MagicDictionary class:

+ +
    +
  • MagicDictionary() Initializes the object.
    • +
  • void buildDict(String[] dictionary) Sets the data structure with an array of distinct strings dictionary.
    • +
  • bool search(String searchWord) Returns true if you can change exactly one character in searchWord to match any string in the data structure, otherwise returns false.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MagicDictionary", "buildDict", "search", "search", "search", "search"]
+[[], [["hello", "leetcode"]], ["hello"], ["hhllo"], ["hell"], ["leetcoded"]]
+Output
+[null, null, false, true, false, false]
+
+Explanation
+MagicDictionary magicDictionary = new MagicDictionary();
+magicDictionary.buildDict(["hello", "leetcode"]);
+magicDictionary.search("hello"); // return False
+magicDictionary.search("hhllo"); // We can change the second 'h' to 'e' to match "hello" so we return True
+magicDictionary.search("hell"); // return False
+magicDictionary.search("leetcoded"); // return False
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= dictionary.length <= 100
    • +
  • 1 <= dictionary[i].length <= 100
    • +
  • dictionary[i] consists of only lower-case English letters.
    • +
  • All the strings in dictionary are distinct.
    • +
  • 1 <= searchWord.length <= 100
    • +
  • searchWord consists of only lower-case English letters.
    • +
  • buildDict will be called only once before search.
    • +
  • At most 100 calls will be made to search.
    • +
+",2.0,False,"class MagicDictionary { +public: + MagicDictionary() { + + } + + void buildDict(vector dictionary) { + + } + + bool search(string searchWord) { + + } +}; + +/** + * Your MagicDictionary object will be instantiated and called as such: + * MagicDictionary* obj = new MagicDictionary(); + * obj->buildDict(dictionary); + * bool param_2 = obj->search(searchWord); + */","class MagicDictionary { + + public MagicDictionary() { + + } + + public void buildDict(String[] dictionary) { + + } + + public boolean search(String searchWord) { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * MagicDictionary obj = new MagicDictionary(); + * obj.buildDict(dictionary); + * boolean param_2 = obj.search(searchWord); + */","class MagicDictionary(object): + + def __init__(self): + + + def buildDict(self, dictionary): + """""" + :type dictionary: List[str] + :rtype: None + """""" + + + def search(self, searchWord): + """""" + :type searchWord: str + :rtype: bool + """""" + + + +# Your MagicDictionary object will be instantiated and called as such: +# obj = MagicDictionary() +# obj.buildDict(dictionary) +# param_2 = obj.search(searchWord)","class MagicDictionary: + + def __init__(self): + + + def buildDict(self, dictionary: List[str]) -> None: + + + def search(self, searchWord: str) -> bool: + + + +# Your MagicDictionary object will be instantiated and called as such: +# obj = MagicDictionary() +# obj.buildDict(dictionary) +# param_2 = obj.search(searchWord)"," + + +typedef struct { + +} MagicDictionary; + + +MagicDictionary* magicDictionaryCreate() { + +} + +void magicDictionaryBuildDict(MagicDictionary* obj, char ** dictionary, int dictionarySize) { + +} + +bool magicDictionarySearch(MagicDictionary* obj, char * searchWord) { + +} + +void magicDictionaryFree(MagicDictionary* obj) { + +} + +/** + * Your MagicDictionary struct will be instantiated and called as such: + * MagicDictionary* obj = magicDictionaryCreate(); + * magicDictionaryBuildDict(obj, dictionary, dictionarySize); + + * bool param_2 = magicDictionarySearch(obj, searchWord); + + * magicDictionaryFree(obj); +*/","public class MagicDictionary { + + public MagicDictionary() { + + } + + public void BuildDict(string[] dictionary) { + + } + + public bool Search(string searchWord) { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * MagicDictionary obj = new MagicDictionary(); + * obj.BuildDict(dictionary); + * bool param_2 = obj.Search(searchWord); + */"," +var MagicDictionary = function() { + +}; + +/** + * @param {string[]} dictionary + * @return {void} + */ +MagicDictionary.prototype.buildDict = function(dictionary) { + +}; + +/** + * @param {string} searchWord + * @return {boolean} + */ +MagicDictionary.prototype.search = function(searchWord) { + +}; + +/** + * Your MagicDictionary object will be instantiated and called as such: + * var obj = new MagicDictionary() + * obj.buildDict(dictionary) + * var param_2 = obj.search(searchWord) + */","class MagicDictionary + def initialize() + + end + + +=begin + :type dictionary: String[] + :rtype: Void +=end + def build_dict(dictionary) + + end + + +=begin + :type search_word: String + :rtype: Boolean +=end + def search(search_word) + + end + + +end + +# Your MagicDictionary object will be instantiated and called as such: +# obj = MagicDictionary.new() +# obj.build_dict(dictionary) +# param_2 = obj.search(search_word)"," +class MagicDictionary { + + init() { + + } + + func buildDict(_ dictionary: [String]) { + + } + + func search(_ searchWord: String) -> Bool { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * let obj = MagicDictionary() + * obj.buildDict(dictionary) + * let ret_2: Bool = obj.search(searchWord) + */","type MagicDictionary struct { + +} + + +func Constructor() MagicDictionary { + +} + + +func (this *MagicDictionary) BuildDict(dictionary []string) { + +} + + +func (this *MagicDictionary) Search(searchWord string) bool { + +} + + +/** + * Your MagicDictionary object will be instantiated and called as such: + * obj := Constructor(); + * obj.BuildDict(dictionary); + * param_2 := obj.Search(searchWord); + */","class MagicDictionary() { + + def buildDict(dictionary: Array[String]) { + + } + + def search(searchWord: String): Boolean = { + + } + +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * var obj = new MagicDictionary() + * obj.buildDict(dictionary) + * var param_2 = obj.search(searchWord) + */","class MagicDictionary() { + + fun buildDict(dictionary: Array) { + + } + + fun search(searchWord: String): Boolean { + + } + +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * var obj = MagicDictionary() + * obj.buildDict(dictionary) + * var param_2 = obj.search(searchWord) + */","struct MagicDictionary { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MagicDictionary { + + fn new() -> Self { + + } + + fn build_dict(&self, dictionary: Vec) { + + } + + fn search(&self, search_word: String) -> bool { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * let obj = MagicDictionary::new(); + * obj.build_dict(dictionary); + * let ret_2: bool = obj.search(searchWord); + */","class MagicDictionary { + /** + */ + function __construct() { + + } + + /** + * @param String[] $dictionary + * @return NULL + */ + function buildDict($dictionary) { + + } + + /** + * @param String $searchWord + * @return Boolean + */ + function search($searchWord) { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * $obj = MagicDictionary(); + * $obj->buildDict($dictionary); + * $ret_2 = $obj->search($searchWord); + */","class MagicDictionary { + constructor() { + + } + + buildDict(dictionary: string[]): void { + + } + + search(searchWord: string): boolean { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * var obj = new MagicDictionary() + * obj.buildDict(dictionary) + * var param_2 = obj.search(searchWord) + */","(define magic-dictionary% + (class object% + (super-new) + (init-field) + + ; build-dict : (listof string?) -> void? + (define/public (build-dict dictionary) + + ) + ; search : string? -> boolean? + (define/public (search search-word) + + ))) + +;; Your magic-dictionary% object will be instantiated and called as such: +;; (define obj (new magic-dictionary%)) +;; (send obj build-dict dictionary) +;; (define param_2 (send obj search search-word))","-spec magic_dictionary_init_() -> any(). +magic_dictionary_init_() -> + . + +-spec magic_dictionary_build_dict(Dictionary :: [unicode:unicode_binary()]) -> any(). +magic_dictionary_build_dict(Dictionary) -> + . + +-spec magic_dictionary_search(SearchWord :: unicode:unicode_binary()) -> boolean(). +magic_dictionary_search(SearchWord) -> + . + + +%% Your functions will be called as such: +%% magic_dictionary_init_(), +%% magic_dictionary_build_dict(Dictionary), +%% Param_2 = magic_dictionary_search(SearchWord), + +%% magic_dictionary_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MagicDictionary do + @spec init_() :: any + def init_() do + + end + + @spec build_dict(dictionary :: [String.t]) :: any + def build_dict(dictionary) do + + end + + @spec search(search_word :: String.t) :: boolean + def search(search_word) do + + end +end + +# Your functions will be called as such: +# MagicDictionary.init_() +# MagicDictionary.build_dict(dictionary) +# param_2 = MagicDictionary.search(search_word) + +# MagicDictionary.init_ will be called before every test case, in which you can do some necessary initializations.","class MagicDictionary { + + MagicDictionary() { + + } + + void buildDict(List dictionary) { + + } + + bool search(String searchWord) { + + } +} + +/** + * Your MagicDictionary object will be instantiated and called as such: + * MagicDictionary obj = MagicDictionary(); + * obj.buildDict(dictionary); + * bool param2 = obj.search(searchWord); + */", +1641,cut-off-trees-for-golf-event,Cut Off Trees for Golf Event,675.0,675.0,"

You are asked to cut off all the trees in a forest for a golf event. The forest is represented as an m x n matrix. In this matrix:

+ +
    +
  • 0 means the cell cannot be walked through.
    • +
  • 1 represents an empty cell that can be walked through.
    • +
  • A number greater than 1 represents a tree in a cell that can be walked through, and this number is the tree's height.
    • +
+ +

In one step, you can walk in any of the four directions: north, east, south, and west. If you are standing in a cell with a tree, you can choose whether to cut it off.

+ +

You must cut off the trees in order from shortest to tallest. When you cut off a tree, the value at its cell becomes 1 (an empty cell).

+ +

Starting from the point (0, 0), return the minimum steps you need to walk to cut off all the trees. If you cannot cut off all the trees, return -1.

+ +

Note: The input is generated such that no two trees have the same height, and there is at least one tree needs to be cut off.

+ +

 

+

Example 1:

+ +
+Input: forest = [[1,2,3],[0,0,4],[7,6,5]]
+Output: 6
+Explanation: Following the path above allows you to cut off the trees from shortest to tallest in 6 steps.
+
+ +

Example 2:

+ +
+Input: forest = [[1,2,3],[0,0,0],[7,6,5]]
+Output: -1
+Explanation: The trees in the bottom row cannot be accessed as the middle row is blocked.
+
+ +

Example 3:

+ +
+Input: forest = [[2,3,4],[0,0,5],[8,7,6]]
+Output: 6
+Explanation: You can follow the same path as Example 1 to cut off all the trees.
+Note that you can cut off the first tree at (0, 0) before making any steps.
+
+ +

 

+

Constraints:

+ +
    +
  • m == forest.length
    • +
  • n == forest[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • 0 <= forest[i][j] <= 109
    • +
  • Heights of all trees are distinct.
    • +
+",3.0,False,"class Solution { +public: + int cutOffTree(vector>& forest) { + + } +};","class Solution { + public int cutOffTree(List> forest) { + + } +}","class Solution(object): + def cutOffTree(self, forest): + """""" + :type forest: List[List[int]] + :rtype: int + """""" + ","class Solution: + def cutOffTree(self, forest: List[List[int]]) -> int: + ","int cutOffTree(int** forest, int forestSize, int* forestColSize){ + +}","public class Solution { + public int CutOffTree(IList> forest) { + + } +}","/** + * @param {number[][]} forest + * @return {number} + */ +var cutOffTree = function(forest) { + +};","# @param {Integer[][]} forest +# @return {Integer} +def cut_off_tree(forest) + +end","class Solution { + func cutOffTree(_ forest: [[Int]]) -> Int { + + } +}","func cutOffTree(forest [][]int) int { + +}","object Solution { + def cutOffTree(forest: List[List[Int]]): Int = { + + } +}","class Solution { + fun cutOffTree(forest: List>): Int { + + } +}","impl Solution { + pub fn cut_off_tree(forest: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $forest + * @return Integer + */ + function cutOffTree($forest) { + + } +}","function cutOffTree(forest: number[][]): number { + +};","(define/contract (cut-off-tree forest) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec cut_off_tree(Forest :: [[integer()]]) -> integer(). +cut_off_tree(Forest) -> + .","defmodule Solution do + @spec cut_off_tree(forest :: [[integer]]) :: integer + def cut_off_tree(forest) do + + end +end","class Solution { + int cutOffTree(List> forest) { + + } +}", +1642,longest-continuous-increasing-subsequence,Longest Continuous Increasing Subsequence,674.0,674.0,"

Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.

+ +

A continuous increasing subsequence is defined by two indices l and r (l < r) such that it is [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] and for each l <= i < r, nums[i] < nums[i + 1].

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,5,4,7]
+Output: 3
+Explanation: The longest continuous increasing subsequence is [1,3,5] with length 3.
+Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element
+4.
+
+ +

Example 2:

+ +
+Input: nums = [2,2,2,2,2]
+Output: 1
+Explanation: The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly
+increasing.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -109 <= nums[i] <= 109
    • +
+",1.0,False,"class Solution { +public: + int findLengthOfLCIS(vector& nums) { + + } +};","class Solution { + public int findLengthOfLCIS(int[] nums) { + + } +}","class Solution(object): + def findLengthOfLCIS(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findLengthOfLCIS(self, nums: List[int]) -> int: + ","int findLengthOfLCIS(int* nums, int numsSize){ + +}","public class Solution { + public int FindLengthOfLCIS(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findLengthOfLCIS = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_length_of_lcis(nums) + +end","class Solution { + func findLengthOfLCIS(_ nums: [Int]) -> Int { + + } +}","func findLengthOfLCIS(nums []int) int { + +}","object Solution { + def findLengthOfLCIS(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findLengthOfLCIS(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_length_of_lcis(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findLengthOfLCIS($nums) { + + } +}","function findLengthOfLCIS(nums: number[]): number { + +};","(define/contract (find-length-of-lcis nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_length_of_lcis(Nums :: [integer()]) -> integer(). +find_length_of_lcis(Nums) -> + .","defmodule Solution do + @spec find_length_of_lcis(nums :: [integer]) :: integer + def find_length_of_lcis(nums) do + + end +end","class Solution { + int findLengthOfLCIS(List nums) { + + } +}", +1645,second-minimum-node-in-a-binary-tree,Second Minimum Node In a Binary Tree,671.0,671.0,"

Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node's value is the smaller value among its two sub-nodes. More formally, the property root.val = min(root.left.val, root.right.val) always holds.

+ +

Given such a binary tree, you need to output the second minimum value in the set made of all the nodes' value in the whole tree.

+ +

If no such second minimum value exists, output -1 instead.

+ +

 

+ +

 

+

Example 1:

+ +
+Input: root = [2,2,5,null,null,5,7]
+Output: 5
+Explanation: The smallest value is 2, the second smallest value is 5.
+
+ +

Example 2:

+ +
+Input: root = [2,2,2]
+Output: -1
+Explanation: The smallest value is 2, but there isn't any second smallest value.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 25].
    • +
  • 1 <= Node.val <= 231 - 1
    • +
  • root.val == min(root.left.val, root.right.val) for each internal node of the tree.
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int findSecondMinimumValue(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int findSecondMinimumValue(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def findSecondMinimumValue(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def findSecondMinimumValue(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int findSecondMinimumValue(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int FindSecondMinimumValue(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var findSecondMinimumValue = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def find_second_minimum_value(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func findSecondMinimumValue(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func findSecondMinimumValue(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def findSecondMinimumValue(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun findSecondMinimumValue(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn find_second_minimum_value(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function findSecondMinimumValue($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function findSecondMinimumValue(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (find-second-minimum-value root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec find_second_minimum_value(Root :: #tree_node{} | null) -> integer(). +find_second_minimum_value(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec find_second_minimum_value(root :: TreeNode.t | nil) :: integer + def find_second_minimum_value(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int findSecondMinimumValue(TreeNode? root) { + + } +}", +1646,maximum-swap,Maximum Swap,670.0,670.0,"

You are given an integer num. You can swap two digits at most once to get the maximum valued number.

+ +

Return the maximum valued number you can get.

+ +

 

+

Example 1:

+ +
+Input: num = 2736
+Output: 7236
+Explanation: Swap the number 2 and the number 7.
+
+ +

Example 2:

+ +
+Input: num = 9973
+Output: 9973
+Explanation: No swap.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 108
    • +
+",2.0,False,"class Solution { +public: + int maximumSwap(int num) { + + } +};","class Solution { + public int maximumSwap(int num) { + + } +}","class Solution(object): + def maximumSwap(self, num): + """""" + :type num: int + :rtype: int + """""" + ","class Solution: + def maximumSwap(self, num: int) -> int: + ","int maximumSwap(int num){ + +}","public class Solution { + public int MaximumSwap(int num) { + + } +}","/** + * @param {number} num + * @return {number} + */ +var maximumSwap = function(num) { + +};","# @param {Integer} num +# @return {Integer} +def maximum_swap(num) + +end","class Solution { + func maximumSwap(_ num: Int) -> Int { + + } +}","func maximumSwap(num int) int { + +}","object Solution { + def maximumSwap(num: Int): Int = { + + } +}","class Solution { + fun maximumSwap(num: Int): Int { + + } +}","impl Solution { + pub fn maximum_swap(num: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Integer + */ + function maximumSwap($num) { + + } +}","function maximumSwap(num: number): number { + +};","(define/contract (maximum-swap num) + (-> exact-integer? exact-integer?) + + )","-spec maximum_swap(Num :: integer()) -> integer(). +maximum_swap(Num) -> + .","defmodule Solution do + @spec maximum_swap(num :: integer) :: integer + def maximum_swap(num) do + + end +end","class Solution { + int maximumSwap(int num) { + + } +}", +1647,trim-a-binary-search-tree,Trim a Binary Search Tree,669.0,669.0,"

Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimming the tree should not change the relative structure of the elements that will remain in the tree (i.e., any node's descendant should remain a descendant). It can be proven that there is a unique answer.

+ +

Return the root of the trimmed binary search tree. Note that the root may change depending on the given bounds.

+ +

 

+

Example 1:

+ +
+Input: root = [1,0,2], low = 1, high = 2
+Output: [1,null,2]
+
+ +

Example 2:

+ +
+Input: root = [3,0,4,null,2,null,null,1], low = 1, high = 3
+Output: [3,2,null,1]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 104].
    • +
  • 0 <= Node.val <= 104
    • +
  • The value of each node in the tree is unique.
    • +
  • root is guaranteed to be a valid binary search tree.
    • +
  • 0 <= low <= high <= 104
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* trimBST(TreeNode* root, int low, int high) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode trimBST(TreeNode root, int low, int high) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def trimBST(self, root, low, high): + """""" + :type root: TreeNode + :type low: int + :type high: int + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def trimBST(self, root: Optional[TreeNode], low: int, high: int) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* trimBST(struct TreeNode* root, int low, int high){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode TrimBST(TreeNode root, int low, int high) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} low + * @param {number} high + * @return {TreeNode} + */ +var trimBST = function(root, low, high) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} low +# @param {Integer} high +# @return {TreeNode} +def trim_bst(root, low, high) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func trimBST(_ root: TreeNode?, _ low: Int, _ high: Int) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func trimBST(root *TreeNode, low int, high int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def trimBST(root: TreeNode, low: Int, high: Int): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun trimBST(root: TreeNode?, low: Int, high: Int): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn trim_bst(root: Option>>, low: i32, high: i32) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $low + * @param Integer $high + * @return TreeNode + */ + function trimBST($root, $low, $high) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (trim-bst root low high) + (-> (or/c tree-node? #f) exact-integer? exact-integer? (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec trim_bst(Root :: #tree_node{} | null, Low :: integer(), High :: integer()) -> #tree_node{} | null. +trim_bst(Root, Low, High) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec trim_bst(root :: TreeNode.t | nil, low :: integer, high :: integer) :: TreeNode.t | nil + def trim_bst(root, low, high) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? trimBST(TreeNode? root, int low, int high) { + + } +}", +1648,kth-smallest-number-in-multiplication-table,Kth Smallest Number in Multiplication Table,668.0,668.0,"

Nearly everyone has used the Multiplication Table. The multiplication table of size m x n is an integer matrix mat where mat[i][j] == i * j (1-indexed).

+ +

Given three integers m, n, and k, return the kth smallest element in the m x n multiplication table.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 3, k = 5
+Output: 3
+Explanation: The 5th smallest number is 3.
+
+ +

Example 2:

+ +
+Input: m = 2, n = 3, k = 6
+Output: 6
+Explanation: The 6th smallest number is 6.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 3 * 104
    • +
  • 1 <= k <= m * n
    • +
+",3.0,False,"class Solution { +public: + int findKthNumber(int m, int n, int k) { + + } +};","class Solution { + public int findKthNumber(int m, int n, int k) { + + } +}","class Solution(object): + def findKthNumber(self, m, n, k): + """""" + :type m: int + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def findKthNumber(self, m: int, n: int, k: int) -> int: + ","int findKthNumber(int m, int n, int k){ + +}","public class Solution { + public int FindKthNumber(int m, int n, int k) { + + } +}","/** + * @param {number} m + * @param {number} n + * @param {number} k + * @return {number} + */ +var findKthNumber = function(m, n, k) { + +};","# @param {Integer} m +# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def find_kth_number(m, n, k) + +end","class Solution { + func findKthNumber(_ m: Int, _ n: Int, _ k: Int) -> Int { + + } +}","func findKthNumber(m int, n int, k int) int { + +}","object Solution { + def findKthNumber(m: Int, n: Int, k: Int): Int = { + + } +}","class Solution { + fun findKthNumber(m: Int, n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn find_kth_number(m: i32, n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $m + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function findKthNumber($m, $n, $k) { + + } +}","function findKthNumber(m: number, n: number, k: number): number { + +};","(define/contract (find-kth-number m n k) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec find_kth_number(M :: integer(), N :: integer(), K :: integer()) -> integer(). +find_kth_number(M, N, K) -> + .","defmodule Solution do + @spec find_kth_number(m :: integer, n :: integer, k :: integer) :: integer + def find_kth_number(m, n, k) do + + end +end","class Solution { + int findKthNumber(int m, int n, int k) { + + } +}", +1649,beautiful-arrangement-ii,Beautiful Arrangement II,667.0,667.0,"

Given two integers n and k, construct a list answer that contains n different positive integers ranging from 1 to n and obeys the following requirement:

+ +
    +
  • Suppose this list is answer = [a1, a2, a3, ... , an], then the list [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] has exactly k distinct integers.
    • +
+ +

Return the list answer. If there multiple valid answers, return any of them.

+ +

 

+

Example 1:

+ +
+Input: n = 3, k = 1
+Output: [1,2,3]
+Explanation: The [1,2,3] has three different positive integers ranging from 1 to 3, and the [1,1] has exactly 1 distinct integer: 1
+
+ +

Example 2:

+ +
+Input: n = 3, k = 2
+Output: [1,3,2]
+Explanation: The [1,3,2] has three different positive integers ranging from 1 to 3, and the [2,1] has exactly 2 distinct integers: 1 and 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k < n <= 104
    • +
+",2.0,False,"class Solution { +public: + vector constructArray(int n, int k) { + + } +};","class Solution { + public int[] constructArray(int n, int k) { + + } +}","class Solution(object): + def constructArray(self, n, k): + """""" + :type n: int + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def constructArray(self, n: int, k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* constructArray(int n, int k, int* returnSize){ + +}","public class Solution { + public int[] ConstructArray(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number[]} + */ +var constructArray = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer[]} +def construct_array(n, k) + +end","class Solution { + func constructArray(_ n: Int, _ k: Int) -> [Int] { + + } +}","func constructArray(n int, k int) []int { + +}","object Solution { + def constructArray(n: Int, k: Int): Array[Int] = { + + } +}","class Solution { + fun constructArray(n: Int, k: Int): IntArray { + + } +}","impl Solution { + pub fn construct_array(n: i32, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer[] + */ + function constructArray($n, $k) { + + } +}","function constructArray(n: number, k: number): number[] { + +};","(define/contract (construct-array n k) + (-> exact-integer? exact-integer? (listof exact-integer?)) + + )","-spec construct_array(N :: integer(), K :: integer()) -> [integer()]. +construct_array(N, K) -> + .","defmodule Solution do + @spec construct_array(n :: integer, k :: integer) :: [integer] + def construct_array(n, k) do + + end +end","class Solution { + List constructArray(int n, int k) { + + } +}", +1650,non-decreasing-array,Non-decreasing Array,665.0,665.0,"

Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element.

+ +

We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2).

+ +

 

+

Example 1:

+ +
+Input: nums = [4,2,3]
+Output: true
+Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
+
+ +

Example 2:

+ +
+Input: nums = [4,2,1]
+Output: false
+Explanation: You cannot get a non-decreasing array by modifying at most one element.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 104
    • +
  • -105 <= nums[i] <= 105
    • +
+",2.0,False,"class Solution { +public: + bool checkPossibility(vector& nums) { + + } +};","class Solution { + public boolean checkPossibility(int[] nums) { + + } +}","class Solution(object): + def checkPossibility(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def checkPossibility(self, nums: List[int]) -> bool: + ","bool checkPossibility(int* nums, int numsSize){ + +}","public class Solution { + public bool CheckPossibility(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var checkPossibility = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def check_possibility(nums) + +end","class Solution { + func checkPossibility(_ nums: [Int]) -> Bool { + + } +}","func checkPossibility(nums []int) bool { + +}","object Solution { + def checkPossibility(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun checkPossibility(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn check_possibility(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function checkPossibility($nums) { + + } +}","function checkPossibility(nums: number[]): boolean { + +};","(define/contract (check-possibility nums) + (-> (listof exact-integer?) boolean?) + + )","-spec check_possibility(Nums :: [integer()]) -> boolean(). +check_possibility(Nums) -> + .","defmodule Solution do + @spec check_possibility(nums :: [integer]) :: boolean + def check_possibility(nums) do + + end +end","class Solution { + bool checkPossibility(List nums) { + + } +}", +1651,strange-printer,Strange Printer,664.0,664.0,"

There is a strange printer with the following two special properties:

+ +
    +
  • The printer can only print a sequence of the same character each time.
    • +
  • At each turn, the printer can print new characters starting from and ending at any place and will cover the original existing characters.
    • +
+ +

Given a string s, return the minimum number of turns the printer needed to print it.

+ +

 

+

Example 1:

+ +
+Input: s = "aaabbb"
+Output: 2
+Explanation: Print "aaa" first and then print "bbb".
+
+ +

Example 2:

+ +
+Input: s = "aba"
+Output: 2
+Explanation: Print "aaa" first and then print "b" from the second place of the string, which will cover the existing character 'a'.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 100
    • +
  • s consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + int strangePrinter(string s) { + + } +};","class Solution { + public int strangePrinter(String s) { + + } +}","class Solution(object): + def strangePrinter(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def strangePrinter(self, s: str) -> int: + ","int strangePrinter(char * s){ + +}","public class Solution { + public int StrangePrinter(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var strangePrinter = function(s) { + +};","# @param {String} s +# @return {Integer} +def strange_printer(s) + +end","class Solution { + func strangePrinter(_ s: String) -> Int { + + } +}","func strangePrinter(s string) int { + +}","object Solution { + def strangePrinter(s: String): Int = { + + } +}","class Solution { + fun strangePrinter(s: String): Int { + + } +}","impl Solution { + pub fn strange_printer(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function strangePrinter($s) { + + } +}","function strangePrinter(s: string): number { + +};","(define/contract (strange-printer s) + (-> string? exact-integer?) + + )","-spec strange_printer(S :: unicode:unicode_binary()) -> integer(). +strange_printer(S) -> + .","defmodule Solution do + @spec strange_printer(s :: String.t) :: integer + def strange_printer(s) do + + end +end","class Solution { + int strangePrinter(String s) { + + } +}", +1654,split-array-into-consecutive-subsequences,Split Array into Consecutive Subsequences,659.0,659.0,"

You are given an integer array nums that is sorted in non-decreasing order.

+ +

Determine if it is possible to split nums into one or more subsequences such that both of the following conditions are true:

+ +
    +
  • Each subsequence is a consecutive increasing sequence (i.e. each integer is exactly one more than the previous integer).
    • +
  • All subsequences have a length of 3 or more.
    • +
+ +

Return true if you can split nums according to the above conditions, or false otherwise.

+ +

A subsequence of an array is a new array that is formed from the original array by deleting some (can be none) of the elements without disturbing the relative positions of the remaining elements. (i.e., [1,3,5] is a subsequence of [1,2,3,4,5] while [1,3,2] is not).

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,3,4,5]
+Output: true
+Explanation: nums can be split into the following subsequences:
+[1,2,3,3,4,5] --> 1, 2, 3
+[1,2,3,3,4,5] --> 3, 4, 5
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,3,4,4,5,5]
+Output: true
+Explanation: nums can be split into the following subsequences:
+[1,2,3,3,4,4,5,5] --> 1, 2, 3, 4, 5
+[1,2,3,3,4,4,5,5] --> 3, 4, 5
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,4,5]
+Output: false
+Explanation: It is impossible to split nums into consecutive increasing subsequences of length 3 or more.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -1000 <= nums[i] <= 1000
    • +
  • nums is sorted in non-decreasing order.
    • +
+",2.0,False,"class Solution { +public: + bool isPossible(vector& nums) { + + } +};","class Solution { + public boolean isPossible(int[] nums) { + + } +}","class Solution(object): + def isPossible(self, nums): + """""" + :type nums: List[int] + :rtype: bool + """""" + ","class Solution: + def isPossible(self, nums: List[int]) -> bool: + ","bool isPossible(int* nums, int numsSize){ + +}","public class Solution { + public bool IsPossible(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {boolean} + */ +var isPossible = function(nums) { + +};","# @param {Integer[]} nums +# @return {Boolean} +def is_possible(nums) + +end","class Solution { + func isPossible(_ nums: [Int]) -> Bool { + + } +}","func isPossible(nums []int) bool { + +}","object Solution { + def isPossible(nums: Array[Int]): Boolean = { + + } +}","class Solution { + fun isPossible(nums: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_possible(nums: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Boolean + */ + function isPossible($nums) { + + } +}","function isPossible(nums: number[]): boolean { + +};","(define/contract (is-possible nums) + (-> (listof exact-integer?) boolean?) + + )","-spec is_possible(Nums :: [integer()]) -> boolean(). +is_possible(Nums) -> + .","defmodule Solution do + @spec is_possible(nums :: [integer]) :: boolean + def is_possible(nums) do + + end +end","class Solution { + bool isPossible(List nums) { + + } +}", +1657,print-binary-tree,Print Binary Tree,655.0,655.0,"

Given the root of a binary tree, construct a 0-indexed m x n string matrix res that represents a formatted layout of the tree. The formatted layout matrix should be constructed using the following rules:

+ +
    +
  • The height of the tree is height and the number of rows m should be equal to height + 1.
    • +
  • The number of columns n should be equal to 2height+1 - 1.
    • +
  • Place the root node in the middle of the top row (more formally, at location res[0][(n-1)/2]).
    • +
  • For each node that has been placed in the matrix at position res[r][c], place its left child at res[r+1][c-2height-r-1] and its right child at res[r+1][c+2height-r-1].
    • +
  • Continue this process until all the nodes in the tree have been placed.
    • +
  • Any empty cells should contain the empty string "".
    • +
+ +

Return the constructed matrix res.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2]
+Output: 
+[["","1",""],
+ ["2","",""]]
+
+ +

Example 2:

+ +
+Input: root = [1,2,3,null,4]
+Output: 
+[["","","","1","","",""],
+ ["","2","","","","3",""],
+ ["","","4","","","",""]]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 210].
    • +
  • -99 <= Node.val <= 99
    • +
  • The depth of the tree will be in the range [1, 10].
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector> printTree(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List> printTree(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def printTree(self, root): + """""" + :type root: TreeNode + :rtype: List[List[str]] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def printTree(self, root: Optional[TreeNode]) -> List[List[str]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** printTree(struct TreeNode* root, int* returnSize, int** returnColumnSizes){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList> PrintTree(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {string[][]} + */ +var printTree = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {String[][]} +def print_tree(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func printTree(_ root: TreeNode?) -> [[String]] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func printTree(root *TreeNode) [][]string { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def printTree(root: TreeNode): List[List[String]] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun printTree(root: TreeNode?): List> { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn print_tree(root: Option>>) -> Vec> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return String[][] + */ + function printTree($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function printTree(root: TreeNode | null): string[][] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (print-tree root) + (-> (or/c tree-node? #f) (listof (listof string?))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec print_tree(Root :: #tree_node{} | null) -> [[unicode:unicode_binary()]]. +print_tree(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec print_tree(root :: TreeNode.t | nil) :: [[String.t]] + def print_tree(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List> printTree(TreeNode? root) { + + } +}", +1660,find-duplicate-subtrees,Find Duplicate Subtrees,652.0,652.0,"

Given the root of a binary tree, return all duplicate subtrees.

+ +

For each kind of duplicate subtrees, you only need to return the root node of any one of them.

+ +

Two trees are duplicate if they have the same structure with the same node values.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,4,null,2,4,null,null,4]
+Output: [[2,4],[4]]
+
+ +

Example 2:

+ +
+Input: root = [2,1,1]
+Output: [[1]]
+
+ +

Example 3:

+ +
+Input: root = [2,2,2,3,null,3,null]
+Output: [[2,3],[3]]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of the nodes in the tree will be in the range [1, 5000]
    • +
  • -200 <= Node.val <= 200
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector findDuplicateSubtrees(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List findDuplicateSubtrees(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def findDuplicateSubtrees(self, root): + """""" + :type root: TreeNode + :rtype: List[TreeNode] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def findDuplicateSubtrees(self, root: Optional[TreeNode]) -> List[Optional[TreeNode]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +struct TreeNode** findDuplicateSubtrees(struct TreeNode* root, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList FindDuplicateSubtrees(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {TreeNode[]} + */ +var findDuplicateSubtrees = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {TreeNode[]} +def find_duplicate_subtrees(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func findDuplicateSubtrees(_ root: TreeNode?) -> [TreeNode?] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func findDuplicateSubtrees(root *TreeNode) []*TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def findDuplicateSubtrees(root: TreeNode): List[TreeNode] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun findDuplicateSubtrees(root: TreeNode?): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn find_duplicate_subtrees(root: Option>>) -> Vec>>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return TreeNode[] + */ + function findDuplicateSubtrees($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function findDuplicateSubtrees(root: TreeNode | null): Array { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (find-duplicate-subtrees root) + (-> (or/c tree-node? #f) (listof (or/c tree-node? #f))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec find_duplicate_subtrees(Root :: #tree_node{} | null) -> [#tree_node{} | null]. +find_duplicate_subtrees(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec find_duplicate_subtrees(root :: TreeNode.t | nil) :: [TreeNode.t | nil] + def find_duplicate_subtrees(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List findDuplicateSubtrees(TreeNode? root) { + + } +}", +1661,2-keys-keyboard,2 Keys Keyboard,650.0,650.0,"

There is only one character 'A' on the screen of a notepad. You can perform one of two operations on this notepad for each step:

+ +
    +
  • Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).
    • +
  • Paste: You can paste the characters which are copied last time.
    • +
+ +

Given an integer n, return the minimum number of operations to get the character 'A' exactly n times on the screen.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 3
+Explanation: Initially, we have one character 'A'.
+In step 1, we use Copy All operation.
+In step 2, we use Paste operation to get 'AA'.
+In step 3, we use Paste operation to get 'AAA'.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
+",2.0,False,"class Solution { +public: + int minSteps(int n) { + + } +};","class Solution { + public int minSteps(int n) { + + } +}","class Solution(object): + def minSteps(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def minSteps(self, n: int) -> int: + ","int minSteps(int n){ + +}","public class Solution { + public int MinSteps(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var minSteps = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def min_steps(n) + +end","class Solution { + func minSteps(_ n: Int) -> Int { + + } +}","func minSteps(n int) int { + +}","object Solution { + def minSteps(n: Int): Int = { + + } +}","class Solution { + fun minSteps(n: Int): Int { + + } +}","impl Solution { + pub fn min_steps(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function minSteps($n) { + + } +}","function minSteps(n: number): number { + +};","(define/contract (min-steps n) + (-> exact-integer? exact-integer?) + + )","-spec min_steps(N :: integer()) -> integer(). +min_steps(N) -> + .","defmodule Solution do + @spec min_steps(n :: integer) :: integer + def min_steps(n) do + + end +end","class Solution { + int minSteps(int n) { + + } +}", +1665,maximum-length-of-pair-chain,Maximum Length of Pair Chain,646.0,646.0,"

You are given an array of n pairs pairs where pairs[i] = [lefti, righti] and lefti < righti.

+ +

A pair p2 = [c, d] follows a pair p1 = [a, b] if b < c. A chain of pairs can be formed in this fashion.

+ +

Return the length longest chain which can be formed.

+ +

You do not need to use up all the given intervals. You can select pairs in any order.

+ +

 

+

Example 1:

+ +
+Input: pairs = [[1,2],[2,3],[3,4]]
+Output: 2
+Explanation: The longest chain is [1,2] -> [3,4].
+
+ +

Example 2:

+ +
+Input: pairs = [[1,2],[7,8],[4,5]]
+Output: 3
+Explanation: The longest chain is [1,2] -> [4,5] -> [7,8].
+
+ +

 

+

Constraints:

+ +
    +
  • n == pairs.length
    • +
  • 1 <= n <= 1000
    • +
  • -1000 <= lefti < righti <= 1000
    • +
+",2.0,False,"class Solution { +public: + int findLongestChain(vector>& pairs) { + + } +};","class Solution { + public int findLongestChain(int[][] pairs) { + + } +}","class Solution(object): + def findLongestChain(self, pairs): + """""" + :type pairs: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findLongestChain(self, pairs: List[List[int]]) -> int: + ","int findLongestChain(int** pairs, int pairsSize, int* pairsColSize){ + +}","public class Solution { + public int FindLongestChain(int[][] pairs) { + + } +}","/** + * @param {number[][]} pairs + * @return {number} + */ +var findLongestChain = function(pairs) { + +};","# @param {Integer[][]} pairs +# @return {Integer} +def find_longest_chain(pairs) + +end","class Solution { + func findLongestChain(_ pairs: [[Int]]) -> Int { + + } +}","func findLongestChain(pairs [][]int) int { + +}","object Solution { + def findLongestChain(pairs: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findLongestChain(pairs: Array): Int { + + } +}","impl Solution { + pub fn find_longest_chain(pairs: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $pairs + * @return Integer + */ + function findLongestChain($pairs) { + + } +}","function findLongestChain(pairs: number[][]): number { + +};","(define/contract (find-longest-chain pairs) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_longest_chain(Pairs :: [[integer()]]) -> integer(). +find_longest_chain(Pairs) -> + .","defmodule Solution do + @spec find_longest_chain(pairs :: [[integer]]) :: integer + def find_longest_chain(pairs) do + + end +end","class Solution { + int findLongestChain(List> pairs) { + + } +}", +1666,set-mismatch,Set Mismatch,645.0,645.0,"

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

+ +

You are given an integer array nums representing the data status of this set after the error.

+ +

Find the number that occurs twice and the number that is missing and return them in the form of an array.

+ +

 

+

Example 1:

+
Input: nums = [1,2,2,4]
+Output: [2,3]
+

Example 2:

+
Input: nums = [1,1]
+Output: [1,2]
+
+

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 104
    • +
  • 1 <= nums[i] <= 104
    • +
+",1.0,False,"class Solution { +public: + vector findErrorNums(vector& nums) { + + } +};","class Solution { + public int[] findErrorNums(int[] nums) { + + } +}","class Solution(object): + def findErrorNums(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def findErrorNums(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findErrorNums(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] FindErrorNums(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var findErrorNums = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def find_error_nums(nums) + +end","class Solution { + func findErrorNums(_ nums: [Int]) -> [Int] { + + } +}","func findErrorNums(nums []int) []int { + +}","object Solution { + def findErrorNums(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun findErrorNums(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn find_error_nums(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function findErrorNums($nums) { + + } +}","function findErrorNums(nums: number[]): number[] { + +};","(define/contract (find-error-nums nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec find_error_nums(Nums :: [integer()]) -> [integer()]. +find_error_nums(Nums) -> + .","defmodule Solution do + @spec find_error_nums(nums :: [integer]) :: [integer] + def find_error_nums(nums) do + + end +end","class Solution { + List findErrorNums(List nums) { + + } +}", +1669,decode-ways-ii,Decode Ways II,639.0,639.0,"

A message containing letters from A-Z can be encoded into numbers using the following mapping:

+ +
+'A' -> "1"
+'B' -> "2"
+...
+'Z' -> "26"
+
+ +

To decode an encoded message, all the digits must be grouped then mapped back into letters using the reverse of the mapping above (there may be multiple ways). For example, "11106" can be mapped into:

+ +
    +
  • "AAJF" with the grouping (1 1 10 6)
    • +
  • "KJF" with the grouping (11 10 6)
    • +
+ +

Note that the grouping (1 11 06) is invalid because "06" cannot be mapped into 'F' since "6" is different from "06".

+ +

In addition to the mapping above, an encoded message may contain the '*' character, which can represent any digit from '1' to '9' ('0' is excluded). For example, the encoded message "1*" may represent any of the encoded messages "11", "12", "13", "14", "15", "16", "17", "18", or "19". Decoding "1*" is equivalent to decoding any of the encoded messages it can represent.

+ +

Given a string s consisting of digits and '*' characters, return the number of ways to decode it.

+ +

Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: s = "*"
+Output: 9
+Explanation: The encoded message can represent any of the encoded messages "1", "2", "3", "4", "5", "6", "7", "8", or "9".
+Each of these can be decoded to the strings "A", "B", "C", "D", "E", "F", "G", "H", and "I" respectively.
+Hence, there are a total of 9 ways to decode "*".
+
+ +

Example 2:

+ +
+Input: s = "1*"
+Output: 18
+Explanation: The encoded message can represent any of the encoded messages "11", "12", "13", "14", "15", "16", "17", "18", or "19".
+Each of these encoded messages have 2 ways to be decoded (e.g. "11" can be decoded to "AA" or "K").
+Hence, there are a total of 9 * 2 = 18 ways to decode "1*".
+
+ +

Example 3:

+ +
+Input: s = "2*"
+Output: 15
+Explanation: The encoded message can represent any of the encoded messages "21", "22", "23", "24", "25", "26", "27", "28", or "29".
+"21", "22", "23", "24", "25", and "26" have 2 ways of being decoded, but "27", "28", and "29" only have 1 way.
+Hence, there are a total of (6 * 2) + (3 * 1) = 12 + 3 = 15 ways to decode "2*".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s[i] is a digit or '*'.
    • +
+",3.0,False,"class Solution { +public: + int numDecodings(string s) { + + } +};","class Solution { + public int numDecodings(String s) { + + } +}","class Solution(object): + def numDecodings(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def numDecodings(self, s: str) -> int: + ","int numDecodings(char * s){ + +}","public class Solution { + public int NumDecodings(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var numDecodings = function(s) { + +};","# @param {String} s +# @return {Integer} +def num_decodings(s) + +end","class Solution { + func numDecodings(_ s: String) -> Int { + + } +}","func numDecodings(s string) int { + +}","object Solution { + def numDecodings(s: String): Int = { + + } +}","class Solution { + fun numDecodings(s: String): Int { + + } +}","impl Solution { + pub fn num_decodings(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function numDecodings($s) { + + } +}","function numDecodings(s: string): number { + +};","(define/contract (num-decodings s) + (-> string? exact-integer?) + + )","-spec num_decodings(S :: unicode:unicode_binary()) -> integer(). +num_decodings(S) -> + .","defmodule Solution do + @spec num_decodings(s :: String.t) :: integer + def num_decodings(s) do + + end +end","class Solution { + int numDecodings(String s) { + + } +}", +1672,exclusive-time-of-functions,Exclusive Time of Functions,636.0,636.0,"

On a single-threaded CPU, we execute a program containing n functions. Each function has a unique ID between 0 and n-1.

+ +

Function calls are stored in a call stack: when a function call starts, its ID is pushed onto the stack, and when a function call ends, its ID is popped off the stack. The function whose ID is at the top of the stack is the current function being executed. Each time a function starts or ends, we write a log with the ID, whether it started or ended, and the timestamp.

+ +

You are given a list logs, where logs[i] represents the ith log message formatted as a string "{function_id}:{"start" | "end"}:{timestamp}". For example, "0:start:3" means a function call with function ID 0 started at the beginning of timestamp 3, and "1:end:2" means a function call with function ID 1 ended at the end of timestamp 2. Note that a function can be called multiple times, possibly recursively.

+ +

A function's exclusive time is the sum of execution times for all function calls in the program. For example, if a function is called twice, one call executing for 2 time units and another call executing for 1 time unit, the exclusive time is 2 + 1 = 3.

+ +

Return the exclusive time of each function in an array, where the value at the ith index represents the exclusive time for the function with ID i.

+ +

 

+

Example 1:

+ +
+Input: n = 2, logs = ["0:start:0","1:start:2","1:end:5","0:end:6"]
+Output: [3,4]
+Explanation:
+Function 0 starts at the beginning of time 0, then it executes 2 for units of time and reaches the end of time 1.
+Function 1 starts at the beginning of time 2, executes for 4 units of time, and ends at the end of time 5.
+Function 0 resumes execution at the beginning of time 6 and executes for 1 unit of time.
+So function 0 spends 2 + 1 = 3 units of total time executing, and function 1 spends 4 units of total time executing.
+
+ +

Example 2:

+ +
+Input: n = 1, logs = ["0:start:0","0:start:2","0:end:5","0:start:6","0:end:6","0:end:7"]
+Output: [8]
+Explanation:
+Function 0 starts at the beginning of time 0, executes for 2 units of time, and recursively calls itself.
+Function 0 (recursive call) starts at the beginning of time 2 and executes for 4 units of time.
+Function 0 (initial call) resumes execution then immediately calls itself again.
+Function 0 (2nd recursive call) starts at the beginning of time 6 and executes for 1 unit of time.
+Function 0 (initial call) resumes execution at the beginning of time 7 and executes for 1 unit of time.
+So function 0 spends 2 + 4 + 1 + 1 = 8 units of total time executing.
+
+ +

Example 3:

+ +
+Input: n = 2, logs = ["0:start:0","0:start:2","0:end:5","1:start:6","1:end:6","0:end:7"]
+Output: [7,1]
+Explanation:
+Function 0 starts at the beginning of time 0, executes for 2 units of time, and recursively calls itself.
+Function 0 (recursive call) starts at the beginning of time 2 and executes for 4 units of time.
+Function 0 (initial call) resumes execution then immediately calls function 1.
+Function 1 starts at the beginning of time 6, executes 1 unit of time, and ends at the end of time 6.
+Function 0 resumes execution at the beginning of time 6 and executes for 2 units of time.
+So function 0 spends 2 + 4 + 1 = 7 units of total time executing, and function 1 spends 1 unit of total time executing.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 100
    • +
  • 1 <= logs.length <= 500
    • +
  • 0 <= function_id < n
    • +
  • 0 <= timestamp <= 109
    • +
  • No two start events will happen at the same timestamp.
    • +
  • No two end events will happen at the same timestamp.
    • +
  • Each function has an "end" log for each "start" log.
    • +
+",2.0,False,"class Solution { +public: + vector exclusiveTime(int n, vector& logs) { + + } +};","class Solution { + public int[] exclusiveTime(int n, List logs) { + + } +}","class Solution(object): + def exclusiveTime(self, n, logs): + """""" + :type n: int + :type logs: List[str] + :rtype: List[int] + """""" + ","class Solution: + def exclusiveTime(self, n: int, logs: List[str]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* exclusiveTime(int n, char ** logs, int logsSize, int* returnSize){ + +}","public class Solution { + public int[] ExclusiveTime(int n, IList logs) { + + } +}","/** + * @param {number} n + * @param {string[]} logs + * @return {number[]} + */ +var exclusiveTime = function(n, logs) { + +};","# @param {Integer} n +# @param {String[]} logs +# @return {Integer[]} +def exclusive_time(n, logs) + +end","class Solution { + func exclusiveTime(_ n: Int, _ logs: [String]) -> [Int] { + + } +}","func exclusiveTime(n int, logs []string) []int { + +}","object Solution { + def exclusiveTime(n: Int, logs: List[String]): Array[Int] = { + + } +}","class Solution { + fun exclusiveTime(n: Int, logs: List): IntArray { + + } +}","impl Solution { + pub fn exclusive_time(n: i32, logs: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @param String[] $logs + * @return Integer[] + */ + function exclusiveTime($n, $logs) { + + } +}","function exclusiveTime(n: number, logs: string[]): number[] { + +};","(define/contract (exclusive-time n logs) + (-> exact-integer? (listof string?) (listof exact-integer?)) + + )","-spec exclusive_time(N :: integer(), Logs :: [unicode:unicode_binary()]) -> [integer()]. +exclusive_time(N, Logs) -> + .","defmodule Solution do + @spec exclusive_time(n :: integer, logs :: [String.t]) :: [integer] + def exclusive_time(n, logs) do + + end +end","class Solution { + List exclusiveTime(int n, List logs) { + + } +}", +1673,sum-of-square-numbers,Sum of Square Numbers,633.0,633.0,"

Given a non-negative integer c, decide whether there're two integers a and b such that a2 + b2 = c.

+ +

 

+

Example 1:

+ +
+Input: c = 5
+Output: true
+Explanation: 1 * 1 + 2 * 2 = 5
+
+ +

Example 2:

+ +
+Input: c = 3
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= c <= 231 - 1
    • +
+",2.0,False,"class Solution { +public: + bool judgeSquareSum(int c) { + + } +};","class Solution { + public boolean judgeSquareSum(int c) { + + } +}","class Solution(object): + def judgeSquareSum(self, c): + """""" + :type c: int + :rtype: bool + """""" + ","class Solution: + def judgeSquareSum(self, c: int) -> bool: + ","bool judgeSquareSum(int c){ + +}","public class Solution { + public bool JudgeSquareSum(int c) { + + } +}","/** + * @param {number} c + * @return {boolean} + */ +var judgeSquareSum = function(c) { + +};","# @param {Integer} c +# @return {Boolean} +def judge_square_sum(c) + +end","class Solution { + func judgeSquareSum(_ c: Int) -> Bool { + + } +}","func judgeSquareSum(c int) bool { + +}","object Solution { + def judgeSquareSum(c: Int): Boolean = { + + } +}","class Solution { + fun judgeSquareSum(c: Int): Boolean { + + } +}","impl Solution { + pub fn judge_square_sum(c: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $c + * @return Boolean + */ + function judgeSquareSum($c) { + + } +}","function judgeSquareSum(c: number): boolean { + +};","(define/contract (judge-square-sum c) + (-> exact-integer? boolean?) + + )","-spec judge_square_sum(C :: integer()) -> boolean(). +judge_square_sum(C) -> + .","defmodule Solution do + @spec judge_square_sum(c :: integer) :: boolean + def judge_square_sum(c) do + + end +end","class Solution { + bool judgeSquareSum(int c) { + + } +}", +1674,smallest-range-covering-elements-from-k-lists,Smallest Range Covering Elements from K Lists,632.0,632.0,"

You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.

+ +

We define the range [a, b] is smaller than range [c, d] if b - a < d - c or a < c if b - a == d - c.

+ +

 

+

Example 1:

+ +
+Input: nums = [[4,10,15,24,26],[0,9,12,20],[5,18,22,30]]
+Output: [20,24]
+Explanation: 
+List 1: [4, 10, 15, 24,26], 24 is in range [20,24].
+List 2: [0, 9, 12, 20], 20 is in range [20,24].
+List 3: [5, 18, 22, 30], 22 is in range [20,24].
+
+ +

Example 2:

+ +
+Input: nums = [[1,2,3],[1,2,3],[1,2,3]]
+Output: [1,1]
+
+ +

 

+

Constraints:

+ +
    +
  • nums.length == k
    • +
  • 1 <= k <= 3500
    • +
  • 1 <= nums[i].length <= 50
    • +
  • -105 <= nums[i][j] <= 105
    • +
  • nums[i] is sorted in non-decreasing order.
    • +
+",3.0,False,"class Solution { +public: + vector smallestRange(vector>& nums) { + + } +};","class Solution { + public int[] smallestRange(List> nums) { + + } +}","class Solution(object): + def smallestRange(self, nums): + """""" + :type nums: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def smallestRange(self, nums: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* smallestRange(int** nums, int numsSize, int* numsColSize, int* returnSize){ + +}","public class Solution { + public int[] SmallestRange(IList> nums) { + + } +}","/** + * @param {number[][]} nums + * @return {number[]} + */ +var smallestRange = function(nums) { + +};","# @param {Integer[][]} nums +# @return {Integer[]} +def smallest_range(nums) + +end","class Solution { + func smallestRange(_ nums: [[Int]]) -> [Int] { + + } +}","func smallestRange(nums [][]int) []int { + +}","object Solution { + def smallestRange(nums: List[List[Int]]): Array[Int] = { + + } +}","class Solution { + fun smallestRange(nums: List>): IntArray { + + } +}","impl Solution { + pub fn smallest_range(nums: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $nums + * @return Integer[] + */ + function smallestRange($nums) { + + } +}","function smallestRange(nums: number[][]): number[] { + +};","(define/contract (smallest-range nums) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec smallest_range(Nums :: [[integer()]]) -> [integer()]. +smallest_range(Nums) -> + .","defmodule Solution do + @spec smallest_range(nums :: [[integer]]) :: [integer] + def smallest_range(nums) do + + end +end","class Solution { + List smallestRange(List> nums) { + + } +}", +1675,course-schedule-iii,Course Schedule III,630.0,630.0,"

There are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastDayi] indicate that the ith course should be taken continuously for durationi days and must be finished before or on lastDayi.

+ +

You will start on the 1st day and you cannot take two or more courses simultaneously.

+ +

Return the maximum number of courses that you can take.

+ +

 

+

Example 1:

+ +
+Input: courses = [[100,200],[200,1300],[1000,1250],[2000,3200]]
+Output: 3
+Explanation: 
+There are totally 4 courses, but you can take 3 courses at most:
+First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
+Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day. 
+Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day. 
+The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.
+
+ +

Example 2:

+ +
+Input: courses = [[1,2]]
+Output: 1
+
+ +

Example 3:

+ +
+Input: courses = [[3,2],[4,3]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= courses.length <= 104
    • +
  • 1 <= durationi, lastDayi <= 104
    • +
+",3.0,False,"class Solution { +public: + int scheduleCourse(vector>& courses) { + + } +};","class Solution { + public int scheduleCourse(int[][] courses) { + + } +}","class Solution(object): + def scheduleCourse(self, courses): + """""" + :type courses: List[List[int]] + :rtype: int + """""" + ","class Solution: + def scheduleCourse(self, courses: List[List[int]]) -> int: + ","int scheduleCourse(int** courses, int coursesSize, int* coursesColSize){ + +}","public class Solution { + public int ScheduleCourse(int[][] courses) { + + } +}","/** + * @param {number[][]} courses + * @return {number} + */ +var scheduleCourse = function(courses) { + +};","# @param {Integer[][]} courses +# @return {Integer} +def schedule_course(courses) + +end","class Solution { + func scheduleCourse(_ courses: [[Int]]) -> Int { + + } +}","func scheduleCourse(courses [][]int) int { + +}","object Solution { + def scheduleCourse(courses: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun scheduleCourse(courses: Array): Int { + + } +}","impl Solution { + pub fn schedule_course(courses: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $courses + * @return Integer + */ + function scheduleCourse($courses) { + + } +}","function scheduleCourse(courses: number[][]): number { + +};","(define/contract (schedule-course courses) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec schedule_course(Courses :: [[integer()]]) -> integer(). +schedule_course(Courses) -> + .","defmodule Solution do + @spec schedule_course(courses :: [[integer]]) :: integer + def schedule_course(courses) do + + end +end","class Solution { + int scheduleCourse(List> courses) { + + } +}", +1676,k-inverse-pairs-array,K Inverse Pairs Array,629.0,629.0,"

For an integer array nums, an inverse pair is a pair of integers [i, j] where 0 <= i < j < nums.length and nums[i] > nums[j].

+ +

Given two integers n and k, return the number of different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. Since the answer can be huge, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 3, k = 0
+Output: 1
+Explanation: Only the array [1,2,3] which consists of numbers from 1 to 3 has exactly 0 inverse pairs.
+
+ +

Example 2:

+ +
+Input: n = 3, k = 1
+Output: 2
+Explanation: The array [1,3,2] and [2,1,3] have exactly 1 inverse pair.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1000
    • +
  • 0 <= k <= 1000
    • +
+",3.0,False,"class Solution { +public: + int kInversePairs(int n, int k) { + + } +};","class Solution { + public int kInversePairs(int n, int k) { + + } +}","class Solution(object): + def kInversePairs(self, n, k): + """""" + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def kInversePairs(self, n: int, k: int) -> int: + ","int kInversePairs(int n, int k){ + +}","public class Solution { + public int KInversePairs(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var kInversePairs = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def k_inverse_pairs(n, k) + +end","class Solution { + func kInversePairs(_ n: Int, _ k: Int) -> Int { + + } +}","func kInversePairs(n int, k int) int { + +}","object Solution { + def kInversePairs(n: Int, k: Int): Int = { + + } +}","class Solution { + fun kInversePairs(n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn k_inverse_pairs(n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function kInversePairs($n, $k) { + + } +}","function kInversePairs(n: number, k: number): number { + +};","(define/contract (k-inverse-pairs n k) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec k_inverse_pairs(N :: integer(), K :: integer()) -> integer(). +k_inverse_pairs(N, K) -> + .","defmodule Solution do + @spec k_inverse_pairs(n :: integer, k :: integer) :: integer + def k_inverse_pairs(n, k) do + + end +end","class Solution { + int kInversePairs(int n, int k) { + + } +}", +1678,add-one-row-to-tree,Add One Row to Tree,623.0,623.0,"

Given the root of a binary tree and two integers val and depth, add a row of nodes with value val at the given depth depth.

+ +

Note that the root node is at depth 1.

+ +

The adding rule is:

+ +
    +
  • Given the integer depth, for each not null tree node cur at the depth depth - 1, create two tree nodes with value val as cur's left subtree root and right subtree root.
    • +
  • cur's original left subtree should be the left subtree of the new left subtree root.
    • +
  • cur's original right subtree should be the right subtree of the new right subtree root.
    • +
  • If depth == 1 that means there is no depth depth - 1 at all, then create a tree node with value val as the new root of the whole original tree, and the original tree is the new root's left subtree.
    • +
+ +

 

+

Example 1:

+ +
+Input: root = [4,2,6,3,1,5], val = 1, depth = 2
+Output: [4,1,1,2,null,null,6,3,1,5]
+
+ +

Example 2:

+ +
+Input: root = [4,2,null,3,1], val = 1, depth = 3
+Output: [4,2,null,1,1,3,null,null,1]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 104].
    • +
  • The depth of the tree is in the range [1, 104].
    • +
  • -100 <= Node.val <= 100
    • +
  • -105 <= val <= 105
    • +
  • 1 <= depth <= the depth of tree + 1
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* addOneRow(TreeNode* root, int val, int depth) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode addOneRow(TreeNode root, int val, int depth) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def addOneRow(self, root, val, depth): + """""" + :type root: TreeNode + :type val: int + :type depth: int + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def addOneRow(self, root: Optional[TreeNode], val: int, depth: int) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* addOneRow(struct TreeNode* root, int val, int depth){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode AddOneRow(TreeNode root, int val, int depth) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} val + * @param {number} depth + * @return {TreeNode} + */ +var addOneRow = function(root, val, depth) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} val +# @param {Integer} depth +# @return {TreeNode} +def add_one_row(root, val, depth) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func addOneRow(_ root: TreeNode?, _ val: Int, _ depth: Int) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func addOneRow(root *TreeNode, val int, depth int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def addOneRow(root: TreeNode, `val`: Int, depth: Int): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun addOneRow(root: TreeNode?, `val`: Int, depth: Int): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn add_one_row(root: Option>>, val: i32, depth: i32) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $val + * @param Integer $depth + * @return TreeNode + */ + function addOneRow($root, $val, $depth) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function addOneRow(root: TreeNode | null, val: number, depth: number): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (add-one-row root val depth) + (-> (or/c tree-node? #f) exact-integer? exact-integer? (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec add_one_row(Root :: #tree_node{} | null, Val :: integer(), Depth :: integer()) -> #tree_node{} | null. +add_one_row(Root, Val, Depth) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec add_one_row(root :: TreeNode.t | nil, val :: integer, depth :: integer) :: TreeNode.t | nil + def add_one_row(root, val, depth) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? addOneRow(TreeNode? root, int val, int depth) { + + } +}", +1679,task-scheduler,Task Scheduler,621.0,621.0,"

Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either one task or just be idle.

+ +

However, there is a non-negative integer n that represents the cooldown period between two same tasks (the same letter in the array), that is that there must be at least n units of time between any two same tasks.

+ +

Return the least number of units of times that the CPU will take to finish all the given tasks.

+ +

 

+

Example 1:

+ +
+Input: tasks = ["A","A","A","B","B","B"], n = 2
+Output: 8
+Explanation: 
+A -> B -> idle -> A -> B -> idle -> A -> B
+There is at least 2 units of time between any two same tasks.
+
+ +

Example 2:

+ +
+Input: tasks = ["A","A","A","B","B","B"], n = 0
+Output: 6
+Explanation: On this case any permutation of size 6 would work since n = 0.
+["A","A","A","B","B","B"]
+["A","B","A","B","A","B"]
+["B","B","B","A","A","A"]
+...
+And so on.
+
+ +

Example 3:

+ +
+Input: tasks = ["A","A","A","A","A","A","B","C","D","E","F","G"], n = 2
+Output: 16
+Explanation: 
+One possible solution is
+A -> B -> C -> A -> D -> E -> A -> F -> G -> A -> idle -> idle -> A -> idle -> idle -> A
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= task.length <= 104
    • +
  • tasks[i] is upper-case English letter.
    • +
  • The integer n is in the range [0, 100].
    • +
+",2.0,False,"class Solution { +public: + int leastInterval(vector& tasks, int n) { + + } +};","class Solution { + public int leastInterval(char[] tasks, int n) { + + } +}","class Solution(object): + def leastInterval(self, tasks, n): + """""" + :type tasks: List[str] + :type n: int + :rtype: int + """""" + ","class Solution: + def leastInterval(self, tasks: List[str], n: int) -> int: + ","int leastInterval(char* tasks, int tasksSize, int n){ + +}","public class Solution { + public int LeastInterval(char[] tasks, int n) { + + } +}","/** + * @param {character[]} tasks + * @param {number} n + * @return {number} + */ +var leastInterval = function(tasks, n) { + +};","# @param {Character[]} tasks +# @param {Integer} n +# @return {Integer} +def least_interval(tasks, n) + +end","class Solution { + func leastInterval(_ tasks: [Character], _ n: Int) -> Int { + + } +}","func leastInterval(tasks []byte, n int) int { + +}","object Solution { + def leastInterval(tasks: Array[Char], n: Int): Int = { + + } +}","class Solution { + fun leastInterval(tasks: CharArray, n: Int): Int { + + } +}","impl Solution { + pub fn least_interval(tasks: Vec, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $tasks + * @param Integer $n + * @return Integer + */ + function leastInterval($tasks, $n) { + + } +}","function leastInterval(tasks: string[], n: number): number { + +};","(define/contract (least-interval tasks n) + (-> (listof char?) exact-integer? exact-integer?) + + )","-spec least_interval(Tasks :: [char()], N :: integer()) -> integer(). +least_interval(Tasks, N) -> + .","defmodule Solution do + @spec least_interval(tasks :: [char], n :: integer) :: integer + def least_interval(tasks, n) do + + end +end","class Solution { + int leastInterval(List tasks, int n) { + + } +}", +1680,merge-two-binary-trees,Merge Two Binary Trees,617.0,617.0,"

You are given two binary trees root1 and root2.

+ +

Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of the new tree.

+ +

Return the merged tree.

+ +

Note: The merging process must start from the root nodes of both trees.

+ +

 

+

Example 1:

+ +
+Input: root1 = [1,3,2,5], root2 = [2,1,3,null,4,null,7]
+Output: [3,4,5,5,4,null,7]
+
+ +

Example 2:

+ +
+Input: root1 = [1], root2 = [1,2]
+Output: [2,2]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in both trees is in the range [0, 2000].
    • +
  • -104 <= Node.val <= 104
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode mergeTrees(TreeNode root1, TreeNode root2) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def mergeTrees(self, root1, root2): + """""" + :type root1: TreeNode + :type root2: TreeNode + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* mergeTrees(struct TreeNode* root1, struct TreeNode* root2){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode MergeTrees(TreeNode root1, TreeNode root2) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root1 + * @param {TreeNode} root2 + * @return {TreeNode} + */ +var mergeTrees = function(root1, root2) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root1 +# @param {TreeNode} root2 +# @return {TreeNode} +def merge_trees(root1, root2) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func mergeTrees(_ root1: TreeNode?, _ root2: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def mergeTrees(root1: TreeNode, root2: TreeNode): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun mergeTrees(root1: TreeNode?, root2: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn merge_trees(root1: Option>>, root2: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root1 + * @param TreeNode $root2 + * @return TreeNode + */ + function mergeTrees($root1, $root2) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (merge-trees root1 root2) + (-> (or/c tree-node? #f) (or/c tree-node? #f) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec merge_trees(Root1 :: #tree_node{} | null, Root2 :: #tree_node{} | null) -> #tree_node{} | null. +merge_trees(Root1, Root2) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec merge_trees(root1 :: TreeNode.t | nil, root2 :: TreeNode.t | nil) :: TreeNode.t | nil + def merge_trees(root1, root2) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? mergeTrees(TreeNode? root1, TreeNode? root2) { + + } +}", +1682,find-duplicate-file-in-system,Find Duplicate File in System,609.0,609.0,"

Given a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the file system in terms of their paths. You may return the answer in any order.

+ +

A group of duplicate files consists of at least two files that have the same content.

+ +

A single directory info string in the input list has the following format:

+ +
    +
  • "root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"
    • +
+ +

It means there are n files (f1.txt, f2.txt ... fn.txt) with content (f1_content, f2_content ... fn_content) respectively in the directory "root/d1/d2/.../dm". Note that n >= 1 and m >= 0. If m = 0, it means the directory is just the root directory.

+ +

The output is a list of groups of duplicate file paths. For each group, it contains all the file paths of the files that have the same content. A file path is a string that has the following format:

+ +
    +
  • "directory_path/file_name.txt"
    • +
+ +

 

+

Example 1:

+
Input: paths = [""root/a 1.txt(abcd) 2.txt(efgh)"",""root/c 3.txt(abcd)"",""root/c/d 4.txt(efgh)"",""root 4.txt(efgh)""]
+Output: [[""root/a/2.txt"",""root/c/d/4.txt"",""root/4.txt""],[""root/a/1.txt"",""root/c/3.txt""]]
+

Example 2:

+
Input: paths = [""root/a 1.txt(abcd) 2.txt(efgh)"",""root/c 3.txt(abcd)"",""root/c/d 4.txt(efgh)""]
+Output: [[""root/a/2.txt"",""root/c/d/4.txt""],[""root/a/1.txt"",""root/c/3.txt""]]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= paths.length <= 2 * 104
    • +
  • 1 <= paths[i].length <= 3000
    • +
  • 1 <= sum(paths[i].length) <= 5 * 105
    • +
  • paths[i] consist of English letters, digits, '/', '.', '(', ')', and ' '.
    • +
  • You may assume no files or directories share the same name in the same directory.
    • +
  • You may assume each given directory info represents a unique directory. A single blank space separates the directory path and file info.
    • +
+ +

 

+

Follow up:

+ +
    +
  • Imagine you are given a real file system, how will you search files? DFS or BFS?
    • +
  • If the file content is very large (GB level), how will you modify your solution?
    • +
  • If you can only read the file by 1kb each time, how will you modify your solution?
    • +
  • What is the time complexity of your modified solution? What is the most time-consuming part and memory-consuming part of it? How to optimize?
    • +
  • How to make sure the duplicated files you find are not false positive?
    • +
+",2.0,False,"class Solution { +public: + vector> findDuplicate(vector& paths) { + + } +};","class Solution { + public List> findDuplicate(String[] paths) { + + } +}","class Solution(object): + def findDuplicate(self, paths): + """""" + :type paths: List[str] + :rtype: List[List[str]] + """""" + ","class Solution: + def findDuplicate(self, paths: List[str]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** findDuplicate(char ** paths, int pathsSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> FindDuplicate(string[] paths) { + + } +}","/** + * @param {string[]} paths + * @return {string[][]} + */ +var findDuplicate = function(paths) { + +};","# @param {String[]} paths +# @return {String[][]} +def find_duplicate(paths) + +end","class Solution { + func findDuplicate(_ paths: [String]) -> [[String]] { + + } +}","func findDuplicate(paths []string) [][]string { + +}","object Solution { + def findDuplicate(paths: Array[String]): List[List[String]] = { + + } +}","class Solution { + fun findDuplicate(paths: Array): List> { + + } +}","impl Solution { + pub fn find_duplicate(paths: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param String[] $paths + * @return String[][] + */ + function findDuplicate($paths) { + + } +}","function findDuplicate(paths: string[]): string[][] { + +};","(define/contract (find-duplicate paths) + (-> (listof string?) (listof (listof string?))) + + )","-spec find_duplicate(Paths :: [unicode:unicode_binary()]) -> [[unicode:unicode_binary()]]. +find_duplicate(Paths) -> + .","defmodule Solution do + @spec find_duplicate(paths :: [String.t]) :: [[String.t]] + def find_duplicate(paths) do + + end +end","class Solution { + List> findDuplicate(List paths) { + + } +}", +1685,non-negative-integers-without-consecutive-ones,Non-negative Integers without Consecutive Ones,600.0,600.0,"

Given a positive integer n, return the number of the integers in the range [0, n] whose binary representations do not contain consecutive ones.

+ +

 

+

Example 1:

+ +
+Input: n = 5
+Output: 5
+Explanation:
+Here are the non-negative integers <= 5 with their corresponding binary representations:
+0 : 0
+1 : 1
+2 : 10
+3 : 11
+4 : 100
+5 : 101
+Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule. 
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 2
+
+ +

Example 3:

+ +
+Input: n = 2
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int findIntegers(int n) { + + } +};","class Solution { + public int findIntegers(int n) { + + } +}","class Solution(object): + def findIntegers(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def findIntegers(self, n: int) -> int: + ","int findIntegers(int n){ + +}","public class Solution { + public int FindIntegers(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var findIntegers = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def find_integers(n) + +end","class Solution { + func findIntegers(_ n: Int) -> Int { + + } +}","func findIntegers(n int) int { + +}","object Solution { + def findIntegers(n: Int): Int = { + + } +}","class Solution { + fun findIntegers(n: Int): Int { + + } +}","impl Solution { + pub fn find_integers(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function findIntegers($n) { + + } +}","function findIntegers(n: number): number { + +};","(define/contract (find-integers n) + (-> exact-integer? exact-integer?) + + )","-spec find_integers(N :: integer()) -> integer(). +find_integers(N) -> + .","defmodule Solution do + @spec find_integers(n :: integer) :: integer + def find_integers(n) do + + end +end","class Solution { + int findIntegers(int n) { + + } +}", +1686,minimum-index-sum-of-two-lists,Minimum Index Sum of Two Lists,599.0,599.0,"

Given two arrays of strings list1 and list2, find the common strings with the least index sum.

+ +

A common string is a string that appeared in both list1 and list2.

+ +

A common string with the least index sum is a common string such that if it appeared at list1[i] and list2[j] then i + j should be the minimum value among all the other common strings.

+ +

Return all the common strings with the least index sum. Return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: list1 = ["Shogun","Tapioca Express","Burger King","KFC"], list2 = ["Piatti","The Grill at Torrey Pines","Hungry Hunter Steakhouse","Shogun"]
+Output: ["Shogun"]
+Explanation: The only common string is "Shogun".
+
+ +

Example 2:

+ +
+Input: list1 = ["Shogun","Tapioca Express","Burger King","KFC"], list2 = ["KFC","Shogun","Burger King"]
+Output: ["Shogun"]
+Explanation: The common string with the least index sum is "Shogun" with index sum = (0 + 1) = 1.
+
+ +

Example 3:

+ +
+Input: list1 = ["happy","sad","good"], list2 = ["sad","happy","good"]
+Output: ["sad","happy"]
+Explanation: There are three common strings:
+"happy" with index sum = (0 + 1) = 1.
+"sad" with index sum = (1 + 0) = 1.
+"good" with index sum = (2 + 2) = 4.
+The strings with the least index sum are "sad" and "happy".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= list1.length, list2.length <= 1000
    • +
  • 1 <= list1[i].length, list2[i].length <= 30
    • +
  • list1[i] and list2[i] consist of spaces ' ' and English letters.
    • +
  • All the strings of list1 are unique.
    • +
  • All the strings of list2 are unique.
    • +
  • There is at least a common string between list1 and list2.
    • +
+",1.0,False,"class Solution { +public: + vector findRestaurant(vector& list1, vector& list2) { + + } +};","class Solution { + public String[] findRestaurant(String[] list1, String[] list2) { + + } +}","class Solution(object): + def findRestaurant(self, list1, list2): + """""" + :type list1: List[str] + :type list2: List[str] + :rtype: List[str] + """""" + ","class Solution: + def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** findRestaurant(char ** list1, int list1Size, char ** list2, int list2Size, int* returnSize){ + +}","public class Solution { + public string[] FindRestaurant(string[] list1, string[] list2) { + + } +}","/** + * @param {string[]} list1 + * @param {string[]} list2 + * @return {string[]} + */ +var findRestaurant = function(list1, list2) { + +};","# @param {String[]} list1 +# @param {String[]} list2 +# @return {String[]} +def find_restaurant(list1, list2) + +end","class Solution { + func findRestaurant(_ list1: [String], _ list2: [String]) -> [String] { + + } +}","func findRestaurant(list1 []string, list2 []string) []string { + +}","object Solution { + def findRestaurant(list1: Array[String], list2: Array[String]): Array[String] = { + + } +}","class Solution { + fun findRestaurant(list1: Array, list2: Array): Array { + + } +}","impl Solution { + pub fn find_restaurant(list1: Vec, list2: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $list1 + * @param String[] $list2 + * @return String[] + */ + function findRestaurant($list1, $list2) { + + } +}","function findRestaurant(list1: string[], list2: string[]): string[] { + +};","(define/contract (find-restaurant list1 list2) + (-> (listof string?) (listof string?) (listof string?)) + + )","-spec find_restaurant(List1 :: [unicode:unicode_binary()], List2 :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +find_restaurant(List1, List2) -> + .","defmodule Solution do + @spec find_restaurant(list1 :: [String.t], list2 :: [String.t]) :: [String.t] + def find_restaurant(list1, list2) do + + end +end","class Solution { + List findRestaurant(List list1, List list2) { + + } +}", +1691,tag-validator,Tag Validator,591.0,591.0,"

Given a string representing a code snippet, implement a tag validator to parse the code and return whether it is valid.

+ +

A code snippet is valid if all the following rules hold:

+ +
    +
  1. The code must be wrapped in a valid closed tag. Otherwise, the code is invalid.
    2. +
  2. A closed tag (not necessarily valid) has exactly the following format : <TAG_NAME>TAG_CONTENT</TAG_NAME>. Among them, <TAG_NAME> is the start tag, and </TAG_NAME> is the end tag. The TAG_NAME in start and end tags should be the same. A closed tag is valid if and only if the TAG_NAME and TAG_CONTENT are valid.
    3. +
  3. A valid TAG_NAME only contain upper-case letters, and has length in range [1,9]. Otherwise, the TAG_NAME is invalid.
    4. +
  4. A valid TAG_CONTENT may contain other valid closed tags, cdata and any characters (see note1) EXCEPT unmatched <, unmatched start and end tag, and unmatched or closed tags with invalid TAG_NAME. Otherwise, the TAG_CONTENT is invalid.
    5. +
  5. A start tag is unmatched if no end tag exists with the same TAG_NAME, and vice versa. However, you also need to consider the issue of unbalanced when tags are nested.
    6. +
  6. A < is unmatched if you cannot find a subsequent >. And when you find a < or </, all the subsequent characters until the next > should be parsed as TAG_NAME (not necessarily valid).
    7. +
  7. The cdata has the following format : <![CDATA[CDATA_CONTENT]]>. The range of CDATA_CONTENT is defined as the characters between <![CDATA[ and the first subsequent ]]>.
    8. +
  8. CDATA_CONTENT may contain any characters. The function of cdata is to forbid the validator to parse CDATA_CONTENT, so even it has some characters that can be parsed as tag (no matter valid or invalid), you should treat it as regular characters.
    9. +
+ +

 

+

Example 1:

+ +
+Input: code = "<DIV>This is the first line <![CDATA[<div>]]></DIV>"
+Output: true
+Explanation: 
+The code is wrapped in a closed tag : <DIV> and </DIV>. 
+The TAG_NAME is valid, the TAG_CONTENT consists of some characters and cdata. 
+Although CDATA_CONTENT has an unmatched start tag with invalid TAG_NAME, it should be considered as plain text, not parsed as a tag.
+So TAG_CONTENT is valid, and then the code is valid. Thus return true.
+
+ +

Example 2:

+ +
+Input: code = "<DIV>>>  ![cdata[]] <![CDATA[<div>]>]]>]]>>]</DIV>"
+Output: true
+Explanation:
+We first separate the code into : start_tag|tag_content|end_tag.
+start_tag -> "<DIV>"
+end_tag -> "</DIV>"
+tag_content could also be separated into : text1|cdata|text2.
+text1 -> ">>  ![cdata[]] "
+cdata -> "<![CDATA[<div>]>]]>", where the CDATA_CONTENT is "<div>]>"
+text2 -> "]]>>]"
+The reason why start_tag is NOT "<DIV>>>" is because of the rule 6.
+The reason why cdata is NOT "<![CDATA[<div>]>]]>]]>" is because of the rule 7.
+
+ +

Example 3:

+ +
+Input: code = "<A>  <B> </A>   </B>"
+Output: false
+Explanation: Unbalanced. If "<A>" is closed, then "<B>" must be unmatched, and vice versa.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= code.length <= 500
    • +
  • code consists of English letters, digits, '<', '>', '/', '!', '[', ']', '.', and ' '.
    • +
+",3.0,False,"class Solution { +public: + bool isValid(string code) { + + } +};","class Solution { + public boolean isValid(String code) { + + } +}","class Solution(object): + def isValid(self, code): + """""" + :type code: str + :rtype: bool + """""" + ","class Solution: + def isValid(self, code: str) -> bool: + ","bool isValid(char * code){ + +}","public class Solution { + public bool IsValid(string code) { + + } +}","/** + * @param {string} code + * @return {boolean} + */ +var isValid = function(code) { + +};","# @param {String} code +# @return {Boolean} +def is_valid(code) + +end","class Solution { + func isValid(_ code: String) -> Bool { + + } +}","func isValid(code string) bool { + +}","object Solution { + def isValid(code: String): Boolean = { + + } +}","class Solution { + fun isValid(code: String): Boolean { + + } +}","impl Solution { + pub fn is_valid(code: String) -> bool { + + } +}","class Solution { + + /** + * @param String $code + * @return Boolean + */ + function isValid($code) { + + } +}","function isValid(code: string): boolean { + +};","(define/contract (is-valid code) + (-> string? boolean?) + + )","-spec is_valid(Code :: unicode:unicode_binary()) -> boolean(). +is_valid(Code) -> + .","defmodule Solution do + @spec is_valid(code :: String.t) :: boolean + def is_valid(code) do + + end +end","class Solution { + bool isValid(String code) { + + } +}", +1692,erect-the-fence,Erect the Fence,587.0,587.0,"

You are given an array trees where trees[i] = [xi, yi] represents the location of a tree in the garden.

+ +

Fence the entire garden using the minimum length of rope, as it is expensive. The garden is well-fenced only if all the trees are enclosed.

+ +

Return the coordinates of trees that are exactly located on the fence perimeter. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: trees = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]
+Output: [[1,1],[2,0],[4,2],[3,3],[2,4]]
+Explanation: All the trees will be on the perimeter of the fence except the tree at [2, 2], which will be inside the fence.
+
+ +

Example 2:

+ +
+Input: trees = [[1,2],[2,2],[4,2]]
+Output: [[4,2],[2,2],[1,2]]
+Explanation: The fence forms a line that passes through all the trees.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= trees.length <= 3000
    • +
  • trees[i].length == 2
    • +
  • 0 <= xi, yi <= 100
    • +
  • All the given positions are unique.
    • +
+",3.0,False,"class Solution { +public: + vector> outerTrees(vector>& trees) { + + } +};","class Solution { + public int[][] outerTrees(int[][] trees) { + + } +}","class Solution(object): + def outerTrees(self, trees): + """""" + :type trees: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def outerTrees(self, trees: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** outerTrees(int** trees, int treesSize, int* treesColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] OuterTrees(int[][] trees) { + + } +}","/** + * @param {number[][]} trees + * @return {number[][]} + */ +var outerTrees = function(trees) { + +};","# @param {Integer[][]} trees +# @return {Integer[][]} +def outer_trees(trees) + +end","class Solution { + func outerTrees(_ trees: [[Int]]) -> [[Int]] { + + } +}","func outerTrees(trees [][]int) [][]int { + +}","object Solution { + def outerTrees(trees: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun outerTrees(trees: Array): Array { + + } +}","impl Solution { + pub fn outer_trees(trees: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $trees + * @return Integer[][] + */ + function outerTrees($trees) { + + } +}","function outerTrees(trees: number[][]): number[][] { + +};","(define/contract (outer-trees trees) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec outer_trees(Trees :: [[integer()]]) -> [[integer()]]. +outer_trees(Trees) -> + .","defmodule Solution do + @spec outer_trees(trees :: [[integer]]) :: [[integer]] + def outer_trees(trees) do + + end +end","class Solution { + List> outerTrees(List> trees) { + + } +}", +1693,delete-operation-for-two-strings,Delete Operation for Two Strings,583.0,583.0,"

Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same.

+ +

In one step, you can delete exactly one character in either string.

+ +

 

+

Example 1:

+ +
+Input: word1 = "sea", word2 = "eat"
+Output: 2
+Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
+
+ +

Example 2:

+ +
+Input: word1 = "leetcode", word2 = "etco"
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word1.length, word2.length <= 500
    • +
  • word1 and word2 consist of only lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minDistance(string word1, string word2) { + + } +};","class Solution { + public int minDistance(String word1, String word2) { + + } +}","class Solution(object): + def minDistance(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: int + """""" + ","class Solution: + def minDistance(self, word1: str, word2: str) -> int: + ","int minDistance(char * word1, char * word2){ + +}","public class Solution { + public int MinDistance(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var minDistance = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {Integer} +def min_distance(word1, word2) + +end","class Solution { + func minDistance(_ word1: String, _ word2: String) -> Int { + + } +}","func minDistance(word1 string, word2 string) int { + +}","object Solution { + def minDistance(word1: String, word2: String): Int = { + + } +}","class Solution { + fun minDistance(word1: String, word2: String): Int { + + } +}","impl Solution { + pub fn min_distance(word1: String, word2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return Integer + */ + function minDistance($word1, $word2) { + + } +}","function minDistance(word1: string, word2: string): number { + +};","(define/contract (min-distance word1 word2) + (-> string? string? exact-integer?) + + )","-spec min_distance(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> integer(). +min_distance(Word1, Word2) -> + .","defmodule Solution do + @spec min_distance(word1 :: String.t, word2 :: String.t) :: integer + def min_distance(word1, word2) do + + end +end","class Solution { + int minDistance(String word1, String word2) { + + } +}", +1697,subtree-of-another-tree,Subtree of Another Tree,572.0,572.0,"

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise.

+ +

A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree could also be considered as a subtree of itself.

+ +

 

+

Example 1:

+ +
+Input: root = [3,4,5,1,2], subRoot = [4,1,2]
+Output: true
+
+ +

Example 2:

+ +
+Input: root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the root tree is in the range [1, 2000].
    • +
  • The number of nodes in the subRoot tree is in the range [1, 1000].
    • +
  • -104 <= root.val <= 104
    • +
  • -104 <= subRoot.val <= 104
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isSubtree(TreeNode* root, TreeNode* subRoot) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isSubtree(TreeNode root, TreeNode subRoot) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isSubtree(self, root, subRoot): + """""" + :type root: TreeNode + :type subRoot: TreeNode + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isSubtree(struct TreeNode* root, struct TreeNode* subRoot){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsSubtree(TreeNode root, TreeNode subRoot) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {TreeNode} subRoot + * @return {boolean} + */ +var isSubtree = function(root, subRoot) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {TreeNode} sub_root +# @return {Boolean} +def is_subtree(root, sub_root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isSubtree(_ root: TreeNode?, _ subRoot: TreeNode?) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isSubtree(root *TreeNode, subRoot *TreeNode) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isSubtree(root: TreeNode, subRoot: TreeNode): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isSubtree(root: TreeNode?, subRoot: TreeNode?): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_subtree(root: Option>>, sub_root: Option>>) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param TreeNode $subRoot + * @return Boolean + */ + function isSubtree($root, $subRoot) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isSubtree(root: TreeNode | null, subRoot: TreeNode | null): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-subtree root subRoot) + (-> (or/c tree-node? #f) (or/c tree-node? #f) boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_subtree(Root :: #tree_node{} | null, SubRoot :: #tree_node{} | null) -> boolean(). +is_subtree(Root, SubRoot) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_subtree(root :: TreeNode.t | nil, sub_root :: TreeNode.t | nil) :: boolean + def is_subtree(root, sub_root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isSubtree(TreeNode? root, TreeNode? subRoot) { + + } +}", +1698,permutation-in-string,Permutation in String,567.0,567.0,"

Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.

+ +

In other words, return true if one of s1's permutations is the substring of s2.

+ +

 

+

Example 1:

+ +
+Input: s1 = "ab", s2 = "eidbaooo"
+Output: true
+Explanation: s2 contains one permutation of s1 ("ba").
+
+ +

Example 2:

+ +
+Input: s1 = "ab", s2 = "eidboaoo"
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length <= 104
    • +
  • s1 and s2 consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + bool checkInclusion(string s1, string s2) { + + } +};","class Solution { + public boolean checkInclusion(String s1, String s2) { + + } +}","class Solution(object): + def checkInclusion(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: bool + """""" + ","class Solution: + def checkInclusion(self, s1: str, s2: str) -> bool: + ","bool checkInclusion(char * s1, char * s2){ + +}","public class Solution { + public bool CheckInclusion(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {boolean} + */ +var checkInclusion = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Boolean} +def check_inclusion(s1, s2) + +end","class Solution { + func checkInclusion(_ s1: String, _ s2: String) -> Bool { + + } +}","func checkInclusion(s1 string, s2 string) bool { + +}","object Solution { + def checkInclusion(s1: String, s2: String): Boolean = { + + } +}","class Solution { + fun checkInclusion(s1: String, s2: String): Boolean { + + } +}","impl Solution { + pub fn check_inclusion(s1: String, s2: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Boolean + */ + function checkInclusion($s1, $s2) { + + } +}","function checkInclusion(s1: string, s2: string): boolean { + +};","(define/contract (check-inclusion s1 s2) + (-> string? string? boolean?) + + )","-spec check_inclusion(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> boolean(). +check_inclusion(S1, S2) -> + .","defmodule Solution do + @spec check_inclusion(s1 :: String.t, s2 :: String.t) :: boolean + def check_inclusion(s1, s2) do + + end +end","class Solution { + bool checkInclusion(String s1, String s2) { + + } +}", +1700,array-nesting,Array Nesting,565.0,565.0,"

You are given an integer array nums of length n where nums is a permutation of the numbers in the range [0, n - 1].

+ +

You should build a set s[k] = {nums[k], nums[nums[k]], nums[nums[nums[k]]], ... } subjected to the following rule:

+ +
    +
  • The first element in s[k] starts with the selection of the element nums[k] of index = k.
    • +
  • The next element in s[k] should be nums[nums[k]], and then nums[nums[nums[k]]], and so on.
    • +
  • We stop adding right before a duplicate element occurs in s[k].
    • +
+ +

Return the longest length of a set s[k].

+ +

 

+

Example 1:

+ +
+Input: nums = [5,4,0,3,1,6,2]
+Output: 4
+Explanation: 
+nums[0] = 5, nums[1] = 4, nums[2] = 0, nums[3] = 3, nums[4] = 1, nums[5] = 6, nums[6] = 2.
+One of the longest sets s[k]:
+s[0] = {nums[0], nums[5], nums[6], nums[2]} = {5, 6, 2, 0}
+
+ +

Example 2:

+ +
+Input: nums = [0,1,2]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] < nums.length
    • +
  • All the values of nums are unique.
    • +
+",2.0,False,"class Solution { +public: + int arrayNesting(vector& nums) { + + } +};","class Solution { + public int arrayNesting(int[] nums) { + + } +}","class Solution(object): + def arrayNesting(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def arrayNesting(self, nums: List[int]) -> int: + ","int arrayNesting(int* nums, int numsSize){ + +}","public class Solution { + public int ArrayNesting(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var arrayNesting = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def array_nesting(nums) + +end","class Solution { + func arrayNesting(_ nums: [Int]) -> Int { + + } +}","func arrayNesting(nums []int) int { + +}","object Solution { + def arrayNesting(nums: Array[Int]): Int = { + + } +}","class Solution { + fun arrayNesting(nums: IntArray): Int { + + } +}","impl Solution { + pub fn array_nesting(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function arrayNesting($nums) { + + } +}","function arrayNesting(nums: number[]): number { + +};","(define/contract (array-nesting nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec array_nesting(Nums :: [integer()]) -> integer(). +array_nesting(Nums) -> + .","defmodule Solution do + @spec array_nesting(nums :: [integer]) :: integer + def array_nesting(nums) do + + end +end","class Solution { + int arrayNesting(List nums) { + + } +}", +1701,find-the-closest-palindrome,Find the Closest Palindrome,564.0,564.0,"

Given a string n representing an integer, return the closest integer (not including itself), which is a palindrome. If there is a tie, return the smaller one.

+ +

The closest is defined as the absolute difference minimized between two integers.

+ +

 

+

Example 1:

+ +
+Input: n = "123"
+Output: "121"
+
+ +

Example 2:

+ +
+Input: n = "1"
+Output: "0"
+Explanation: 0 and 2 are the closest palindromes but we return the smallest which is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n.length <= 18
    • +
  • n consists of only digits.
    • +
  • n does not have leading zeros.
    • +
  • n is representing an integer in the range [1, 1018 - 1].
    • +
+",3.0,False,"class Solution { +public: + string nearestPalindromic(string n) { + + } +};","class Solution { + public String nearestPalindromic(String n) { + + } +}","class Solution(object): + def nearestPalindromic(self, n): + """""" + :type n: str + :rtype: str + """""" + ","class Solution: + def nearestPalindromic(self, n: str) -> str: + ","char * nearestPalindromic(char * n){ + +}","public class Solution { + public string NearestPalindromic(string n) { + + } +}","/** + * @param {string} n + * @return {string} + */ +var nearestPalindromic = function(n) { + +};","# @param {String} n +# @return {String} +def nearest_palindromic(n) + +end","class Solution { + func nearestPalindromic(_ n: String) -> String { + + } +}","func nearestPalindromic(n string) string { + +}","object Solution { + def nearestPalindromic(n: String): String = { + + } +}","class Solution { + fun nearestPalindromic(n: String): String { + + } +}","impl Solution { + pub fn nearest_palindromic(n: String) -> String { + + } +}","class Solution { + + /** + * @param String $n + * @return String + */ + function nearestPalindromic($n) { + + } +}","function nearestPalindromic(n: string): string { + +};","(define/contract (nearest-palindromic n) + (-> string? string?) + + )","-spec nearest_palindromic(N :: unicode:unicode_binary()) -> unicode:unicode_binary(). +nearest_palindromic(N) -> + .","defmodule Solution do + @spec nearest_palindromic(n :: String.t) :: String.t + def nearest_palindromic(n) do + + end +end","class Solution { + String nearestPalindromic(String n) { + + } +}", +1706,next-greater-element-iii,Next Greater Element III,556.0,556.0,"

Given a positive integer n, find the smallest integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive integer exists, return -1.

+ +

Note that the returned integer should fit in 32-bit integer, if there is a valid answer but it does not fit in 32-bit integer, return -1.

+ +

 

+

Example 1:

+
Input: n = 12
+Output: 21
+

Example 2:

+
Input: n = 21
+Output: -1
+
+

 

+

Constraints:

+ +
    +
  • 1 <= n <= 231 - 1
    • +
+",2.0,False,"class Solution { +public: + int nextGreaterElement(int n) { + + } +};","class Solution { + public int nextGreaterElement(int n) { + + } +}","class Solution(object): + def nextGreaterElement(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def nextGreaterElement(self, n: int) -> int: + ","int nextGreaterElement(int n){ + +}","public class Solution { + public int NextGreaterElement(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var nextGreaterElement = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def next_greater_element(n) + +end","class Solution { + func nextGreaterElement(_ n: Int) -> Int { + + } +}","func nextGreaterElement(n int) int { + +}","object Solution { + def nextGreaterElement(n: Int): Int = { + + } +}","class Solution { + fun nextGreaterElement(n: Int): Int { + + } +}","impl Solution { + pub fn next_greater_element(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function nextGreaterElement($n) { + + } +}","function nextGreaterElement(n: number): number { + +};","(define/contract (next-greater-element n) + (-> exact-integer? exact-integer?) + + )","-spec next_greater_element(N :: integer()) -> integer(). +next_greater_element(N) -> + .","defmodule Solution do + @spec next_greater_element(n :: integer) :: integer + def next_greater_element(n) do + + end +end","class Solution { + int nextGreaterElement(int n) { + + } +}", +1709,student-attendance-record-ii,Student Attendance Record II,552.0,552.0,"

An attendance record for a student can be represented as a string where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:

+ +
    +
  • 'A': Absent.
    • +
  • 'L': Late.
    • +
  • 'P': Present.
    • +
+ +

Any student is eligible for an attendance award if they meet both of the following criteria:

+ +
    +
  • The student was absent ('A') for strictly fewer than 2 days total.
    • +
  • The student was never late ('L') for 3 or more consecutive days.
    • +
+ +

Given an integer n, return the number of possible attendance records of length n that make a student eligible for an attendance award. The answer may be very large, so return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: 8
+Explanation: There are 8 records with length 2 that are eligible for an award:
+"PP", "AP", "PA", "LP", "PL", "AL", "LA", "LL"
+Only "AA" is not eligible because there are 2 absences (there need to be fewer than 2).
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 3
+
+ +

Example 3:

+ +
+Input: n = 10101
+Output: 183236316
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
+",3.0,False,"class Solution { +public: + int checkRecord(int n) { + + } +};","class Solution { + public int checkRecord(int n) { + + } +}","class Solution(object): + def checkRecord(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def checkRecord(self, n: int) -> int: + ","int checkRecord(int n){ + +}","public class Solution { + public int CheckRecord(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var checkRecord = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def check_record(n) + +end","class Solution { + func checkRecord(_ n: Int) -> Int { + + } +}","func checkRecord(n int) int { + +}","object Solution { + def checkRecord(n: Int): Int = { + + } +}","class Solution { + fun checkRecord(n: Int): Int { + + } +}","impl Solution { + pub fn check_record(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function checkRecord($n) { + + } +}","function checkRecord(n: number): number { + +};","(define/contract (check-record n) + (-> exact-integer? exact-integer?) + + )","-spec check_record(N :: integer()) -> integer(). +check_record(N) -> + .","defmodule Solution do + @spec check_record(n :: integer) :: integer + def check_record(n) do + + end +end","class Solution { + int checkRecord(int n) { + + } +}", +1710,student-attendance-record-i,Student Attendance Record I,551.0,551.0,"

You are given a string s representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:

+ +
    +
  • 'A': Absent.
    • +
  • 'L': Late.
    • +
  • 'P': Present.
    • +
+ +

The student is eligible for an attendance award if they meet both of the following criteria:

+ +
    +
  • The student was absent ('A') for strictly fewer than 2 days total.
    • +
  • The student was never late ('L') for 3 or more consecutive days.
    • +
+ +

Return true if the student is eligible for an attendance award, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "PPALLP"
+Output: true
+Explanation: The student has fewer than 2 absences and was never late 3 or more consecutive days.
+
+ +

Example 2:

+ +
+Input: s = "PPALLL"
+Output: false
+Explanation: The student was late 3 consecutive days in the last 3 days, so is not eligible for the award.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s[i] is either 'A', 'L', or 'P'.
    • +
+",1.0,False,"class Solution { +public: + bool checkRecord(string s) { + + } +};","class Solution { + public boolean checkRecord(String s) { + + } +}","class Solution(object): + def checkRecord(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def checkRecord(self, s: str) -> bool: + ","bool checkRecord(char * s){ + +}","public class Solution { + public bool CheckRecord(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var checkRecord = function(s) { + +};","# @param {String} s +# @return {Boolean} +def check_record(s) + +end","class Solution { + func checkRecord(_ s: String) -> Bool { + + } +}","func checkRecord(s string) bool { + +}","object Solution { + def checkRecord(s: String): Boolean = { + + } +}","class Solution { + fun checkRecord(s: String): Boolean { + + } +}","impl Solution { + pub fn check_record(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function checkRecord($s) { + + } +}","function checkRecord(s: string): boolean { + +};","(define/contract (check-record s) + (-> string? boolean?) + + )","-spec check_record(S :: unicode:unicode_binary()) -> boolean(). +check_record(S) -> + .","defmodule Solution do + @spec check_record(s :: String.t) :: boolean + def check_record(s) do + + end +end","class Solution { + bool checkRecord(String s) { + + } +}", +1711,number-of-provinces,Number of Provinces,547.0,547.0,"

There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly with city c, then city a is connected indirectly with city c.

+ +

A province is a group of directly or indirectly connected cities and no other cities outside of the group.

+ +

You are given an n x n matrix isConnected where isConnected[i][j] = 1 if the ith city and the jth city are directly connected, and isConnected[i][j] = 0 otherwise.

+ +

Return the total number of provinces.

+ +

 

+

Example 1:

+ +
+Input: isConnected = [[1,1,0],[1,1,0],[0,0,1]]
+Output: 2
+
+ +

Example 2:

+ +
+Input: isConnected = [[1,0,0],[0,1,0],[0,0,1]]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 200
    • +
  • n == isConnected.length
    • +
  • n == isConnected[i].length
    • +
  • isConnected[i][j] is 1 or 0.
    • +
  • isConnected[i][i] == 1
    • +
  • isConnected[i][j] == isConnected[j][i]
    • +
+",2.0,False,"class Solution { +public: + int findCircleNum(vector>& isConnected) { + + } +};","class Solution { + public int findCircleNum(int[][] isConnected) { + + } +}","class Solution(object): + def findCircleNum(self, isConnected): + """""" + :type isConnected: List[List[int]] + :rtype: int + """""" + ","class Solution: + def findCircleNum(self, isConnected: List[List[int]]) -> int: + ","int findCircleNum(int** isConnected, int isConnectedSize, int* isConnectedColSize){ + +}","public class Solution { + public int FindCircleNum(int[][] isConnected) { + + } +}","/** + * @param {number[][]} isConnected + * @return {number} + */ +var findCircleNum = function(isConnected) { + +};","# @param {Integer[][]} is_connected +# @return {Integer} +def find_circle_num(is_connected) + +end","class Solution { + func findCircleNum(_ isConnected: [[Int]]) -> Int { + + } +}","func findCircleNum(isConnected [][]int) int { + +}","object Solution { + def findCircleNum(isConnected: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun findCircleNum(isConnected: Array): Int { + + } +}","impl Solution { + pub fn find_circle_num(is_connected: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $isConnected + * @return Integer + */ + function findCircleNum($isConnected) { + + } +}","function findCircleNum(isConnected: number[][]): number { + +};","(define/contract (find-circle-num isConnected) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec find_circle_num(IsConnected :: [[integer()]]) -> integer(). +find_circle_num(IsConnected) -> + .","defmodule Solution do + @spec find_circle_num(is_connected :: [[integer]]) :: integer + def find_circle_num(is_connected) do + + end +end","class Solution { + int findCircleNum(List> isConnected) { + + } +}", +1712,remove-boxes,Remove Boxes,546.0,546.0,"

You are given several boxes with different colors represented by different positive numbers.

+ +

You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (i.e., composed of k boxes, k >= 1), remove them and get k * k points.

+ +

Return the maximum points you can get.

+ +

 

+

Example 1:

+ +
+Input: boxes = [1,3,2,2,2,3,4,3,1]
+Output: 23
+Explanation:
+[1, 3, 2, 2, 2, 3, 4, 3, 1] 
+----> [1, 3, 3, 4, 3, 1] (3*3=9 points) 
+----> [1, 3, 3, 3, 1] (1*1=1 points) 
+----> [1, 1] (3*3=9 points) 
+----> [] (2*2=4 points)
+
+ +

Example 2:

+ +
+Input: boxes = [1,1,1]
+Output: 9
+
+ +

Example 3:

+ +
+Input: boxes = [1]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= boxes.length <= 100
    • +
  • 1 <= boxes[i] <= 100
    • +
+",3.0,False,"class Solution { +public: + int removeBoxes(vector& boxes) { + + } +};","class Solution { + public int removeBoxes(int[] boxes) { + + } +}","class Solution(object): + def removeBoxes(self, boxes): + """""" + :type boxes: List[int] + :rtype: int + """""" + ","class Solution: + def removeBoxes(self, boxes: List[int]) -> int: + ","int removeBoxes(int* boxes, int boxesSize){ + +}","public class Solution { + public int RemoveBoxes(int[] boxes) { + + } +}","/** + * @param {number[]} boxes + * @return {number} + */ +var removeBoxes = function(boxes) { + +};","# @param {Integer[]} boxes +# @return {Integer} +def remove_boxes(boxes) + +end","class Solution { + func removeBoxes(_ boxes: [Int]) -> Int { + + } +}","func removeBoxes(boxes []int) int { + +}","object Solution { + def removeBoxes(boxes: Array[Int]): Int = { + + } +}","class Solution { + fun removeBoxes(boxes: IntArray): Int { + + } +}","impl Solution { + pub fn remove_boxes(boxes: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $boxes + * @return Integer + */ + function removeBoxes($boxes) { + + } +}","function removeBoxes(boxes: number[]): number { + +};","(define/contract (remove-boxes boxes) + (-> (listof exact-integer?) exact-integer?) + + )","-spec remove_boxes(Boxes :: [integer()]) -> integer(). +remove_boxes(Boxes) -> + .","defmodule Solution do + @spec remove_boxes(boxes :: [integer]) :: integer + def remove_boxes(boxes) do + + end +end","class Solution { + int removeBoxes(List boxes) { + + } +}", +1717,minimum-time-difference,Minimum Time Difference,539.0,539.0,"Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two time-points in the list. +

 

+

Example 1:

+
Input: timePoints = [""23:59"",""00:00""]
+Output: 1
+

Example 2:

+
Input: timePoints = [""00:00"",""23:59"",""00:00""]
+Output: 0
+
+

 

+

Constraints:

+ +
    +
  • 2 <= timePoints.length <= 2 * 104
    • +
  • timePoints[i] is in the format "HH:MM".
    • +
+",2.0,False,"class Solution { +public: + int findMinDifference(vector& timePoints) { + + } +};","class Solution { + public int findMinDifference(List timePoints) { + + } +}","class Solution(object): + def findMinDifference(self, timePoints): + """""" + :type timePoints: List[str] + :rtype: int + """""" + ","class Solution: + def findMinDifference(self, timePoints: List[str]) -> int: + ","int findMinDifference(char ** timePoints, int timePointsSize){ + +}","public class Solution { + public int FindMinDifference(IList timePoints) { + + } +}","/** + * @param {string[]} timePoints + * @return {number} + */ +var findMinDifference = function(timePoints) { + +};","# @param {String[]} time_points +# @return {Integer} +def find_min_difference(time_points) + +end","class Solution { + func findMinDifference(_ timePoints: [String]) -> Int { + + } +}","func findMinDifference(timePoints []string) int { + +}","object Solution { + def findMinDifference(timePoints: List[String]): Int = { + + } +}","class Solution { + fun findMinDifference(timePoints: List): Int { + + } +}","impl Solution { + pub fn find_min_difference(time_points: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $timePoints + * @return Integer + */ + function findMinDifference($timePoints) { + + } +}","function findMinDifference(timePoints: string[]): number { + +};","(define/contract (find-min-difference timePoints) + (-> (listof string?) exact-integer?) + + )","-spec find_min_difference(TimePoints :: [unicode:unicode_binary()]) -> integer(). +find_min_difference(TimePoints) -> + .","defmodule Solution do + @spec find_min_difference(time_points :: [String.t]) :: integer + def find_min_difference(time_points) do + + end +end","class Solution { + int findMinDifference(List timePoints) { + + } +}", +1721,k-diff-pairs-in-an-array,K-diff Pairs in an Array,532.0,532.0,"

Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array.

+ +

A k-diff pair is an integer pair (nums[i], nums[j]), where the following are true:

+ +
    +
  • 0 <= i, j < nums.length
    • +
  • i != j
    • +
  • |nums[i] - nums[j]| == k
    • +
+ +

Notice that |val| denotes the absolute value of val.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,1,4,1,5], k = 2
+Output: 2
+Explanation: There are two 2-diff pairs in the array, (1, 3) and (3, 5).
+Although we have two 1s in the input, we should only return the number of unique pairs.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,5], k = 1
+Output: 4
+Explanation: There are four 1-diff pairs in the array, (1, 2), (2, 3), (3, 4) and (4, 5).
+
+ +

Example 3:

+ +
+Input: nums = [1,3,1,5,4], k = 0
+Output: 1
+Explanation: There is one 0-diff pair in the array, (1, 1).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -107 <= nums[i] <= 107
    • +
  • 0 <= k <= 107
    • +
+",2.0,False,"class Solution { +public: + int findPairs(vector& nums, int k) { + + } +};","class Solution { + public int findPairs(int[] nums, int k) { + + } +}","class Solution(object): + def findPairs(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def findPairs(self, nums: List[int], k: int) -> int: + ","int findPairs(int* nums, int numsSize, int k){ + +}","public class Solution { + public int FindPairs(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var findPairs = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def find_pairs(nums, k) + +end","class Solution { + func findPairs(_ nums: [Int], _ k: Int) -> Int { + + } +}","func findPairs(nums []int, k int) int { + +}","object Solution { + def findPairs(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun findPairs(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn find_pairs(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function findPairs($nums, $k) { + + } +}","function findPairs(nums: number[], k: number): number { + +};","(define/contract (find-pairs nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec find_pairs(Nums :: [integer()], K :: integer()) -> integer(). +find_pairs(Nums, K) -> + .","defmodule Solution do + @spec find_pairs(nums :: [integer], k :: integer) :: integer + def find_pairs(nums, k) do + + end +end","class Solution { + int findPairs(List nums, int k) { + + } +}", +1723,minesweeper,Minesweeper,529.0,529.0,"

Let's play the minesweeper game (Wikipedia, online game)!

+ +

You are given an m x n char matrix board representing the game board where:

+ +
    +
  • 'M' represents an unrevealed mine,
    • +
  • 'E' represents an unrevealed empty square,
    • +
  • 'B' represents a revealed blank square that has no adjacent mines (i.e., above, below, left, right, and all 4 diagonals),
    • +
  • digit ('1' to '8') represents how many mines are adjacent to this revealed square, and
    • +
  • 'X' represents a revealed mine.
    • +
+ +

You are also given an integer array click where click = [clickr, clickc] represents the next click position among all the unrevealed squares ('M' or 'E').

+ +

Return the board after revealing this position according to the following rules:

+ +
    +
  1. If a mine 'M' is revealed, then the game is over. You should change it to 'X'.
    2. +
  2. If an empty square 'E' with no adjacent mines is revealed, then change it to a revealed blank 'B' and all of its adjacent unrevealed squares should be revealed recursively.
    3. +
  3. If an empty square 'E' with at least one adjacent mine is revealed, then change it to a digit ('1' to '8') representing the number of adjacent mines.
    4. +
  4. Return the board when no more squares will be revealed.
    5. +
+ +

 

+

Example 1:

+ +
+Input: board = [["E","E","E","E","E"],["E","E","M","E","E"],["E","E","E","E","E"],["E","E","E","E","E"]], click = [3,0]
+Output: [["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]
+
+ +

Example 2:

+ +
+Input: board = [["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]], click = [1,2]
+Output: [["B","1","E","1","B"],["B","1","X","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]
+
+ +

 

+

Constraints:

+ +
    +
  • m == board.length
    • +
  • n == board[i].length
    • +
  • 1 <= m, n <= 50
    • +
  • board[i][j] is either 'M', 'E', 'B', or a digit from '1' to '8'.
    • +
  • click.length == 2
    • +
  • 0 <= clickr < m
    • +
  • 0 <= clickc < n
    • +
  • board[clickr][clickc] is either 'M' or 'E'.
    • +
+",2.0,False,"class Solution { +public: + vector> updateBoard(vector>& board, vector& click) { + + } +};","class Solution { + public char[][] updateBoard(char[][] board, int[] click) { + + } +}","class Solution(object): + def updateBoard(self, board, click): + """""" + :type board: List[List[str]] + :type click: List[int] + :rtype: List[List[str]] + """""" + ","class Solution: + def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char** updateBoard(char** board, int boardSize, int* boardColSize, int* click, int clickSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public char[][] UpdateBoard(char[][] board, int[] click) { + + } +}","/** + * @param {character[][]} board + * @param {number[]} click + * @return {character[][]} + */ +var updateBoard = function(board, click) { + +};","# @param {Character[][]} board +# @param {Integer[]} click +# @return {Character[][]} +def update_board(board, click) + +end","class Solution { + func updateBoard(_ board: [[Character]], _ click: [Int]) -> [[Character]] { + + } +}","func updateBoard(board [][]byte, click []int) [][]byte { + +}","object Solution { + def updateBoard(board: Array[Array[Char]], click: Array[Int]): Array[Array[Char]] = { + + } +}","class Solution { + fun updateBoard(board: Array, click: IntArray): Array { + + } +}","impl Solution { + pub fn update_board(board: Vec>, click: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param String[][] $board + * @param Integer[] $click + * @return String[][] + */ + function updateBoard($board, $click) { + + } +}","function updateBoard(board: string[][], click: number[]): string[][] { + +};","(define/contract (update-board board click) + (-> (listof (listof char?)) (listof exact-integer?) (listof (listof char?))) + + )","-spec update_board(Board :: [[char()]], Click :: [integer()]) -> [[char()]]. +update_board(Board, Click) -> + .","defmodule Solution do + @spec update_board(board :: [[char]], click :: [integer]) :: [[char]] + def update_board(board, click) do + + end +end","class Solution { + List> updateBoard(List> board, List click) { + + } +}", +1726,contiguous-array,Contiguous Array,525.0,525.0,"

Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1.

+ +

 

+

Example 1:

+ +
+Input: nums = [0,1]
+Output: 2
+Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.
+
+ +

Example 2:

+ +
+Input: nums = [0,1,0]
+Output: 2
+Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • nums[i] is either 0 or 1.
    • +
+",2.0,False,"class Solution { +public: + int findMaxLength(vector& nums) { + + } +};","class Solution { + public int findMaxLength(int[] nums) { + + } +}","class Solution(object): + def findMaxLength(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findMaxLength(self, nums: List[int]) -> int: + ","int findMaxLength(int* nums, int numsSize){ + +}","public class Solution { + public int FindMaxLength(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findMaxLength = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_max_length(nums) + +end","class Solution { + func findMaxLength(_ nums: [Int]) -> Int { + + } +}","func findMaxLength(nums []int) int { + +}","object Solution { + def findMaxLength(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findMaxLength(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_max_length(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findMaxLength($nums) { + + } +}","function findMaxLength(nums: number[]): number { + +};","(define/contract (find-max-length nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_max_length(Nums :: [integer()]) -> integer(). +find_max_length(Nums) -> + .","defmodule Solution do + @spec find_max_length(nums :: [integer]) :: integer + def find_max_length(nums) do + + end +end","class Solution { + int findMaxLength(List nums) { + + } +}", +1727,longest-word-in-dictionary-through-deleting,Longest Word in Dictionary through Deleting,524.0,524.0,"

Given a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting some of the given string characters. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.

+ +

 

+

Example 1:

+ +
+Input: s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]
+Output: "apple"
+
+ +

Example 2:

+ +
+Input: s = "abpcplea", dictionary = ["a","b","c"]
+Output: "a"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • 1 <= dictionary.length <= 1000
    • +
  • 1 <= dictionary[i].length <= 1000
    • +
  • s and dictionary[i] consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + string findLongestWord(string s, vector& dictionary) { + + } +};","class Solution { + public String findLongestWord(String s, List dictionary) { + + } +}","class Solution(object): + def findLongestWord(self, s, dictionary): + """""" + :type s: str + :type dictionary: List[str] + :rtype: str + """""" + ","class Solution: + def findLongestWord(self, s: str, dictionary: List[str]) -> str: + ","char * findLongestWord(char * s, char ** dictionary, int dictionarySize){ + +}","public class Solution { + public string FindLongestWord(string s, IList dictionary) { + + } +}","/** + * @param {string} s + * @param {string[]} dictionary + * @return {string} + */ +var findLongestWord = function(s, dictionary) { + +};","# @param {String} s +# @param {String[]} dictionary +# @return {String} +def find_longest_word(s, dictionary) + +end","class Solution { + func findLongestWord(_ s: String, _ dictionary: [String]) -> String { + + } +}","func findLongestWord(s string, dictionary []string) string { + +}","object Solution { + def findLongestWord(s: String, dictionary: List[String]): String = { + + } +}","class Solution { + fun findLongestWord(s: String, dictionary: List): String { + + } +}","impl Solution { + pub fn find_longest_word(s: String, dictionary: Vec) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $dictionary + * @return String + */ + function findLongestWord($s, $dictionary) { + + } +}","function findLongestWord(s: string, dictionary: string[]): string { + +};","(define/contract (find-longest-word s dictionary) + (-> string? (listof string?) string?) + + )","-spec find_longest_word(S :: unicode:unicode_binary(), Dictionary :: [unicode:unicode_binary()]) -> unicode:unicode_binary(). +find_longest_word(S, Dictionary) -> + .","defmodule Solution do + @spec find_longest_word(s :: String.t, dictionary :: [String.t]) :: String.t + def find_longest_word(s, dictionary) do + + end +end","class Solution { + String findLongestWord(String s, List dictionary) { + + } +}", +1729,longest-uncommon-subsequence-ii,Longest Uncommon Subsequence II,522.0,522.0,"

Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.

+ +

An uncommon subsequence between an array of strings is a string that is a subsequence of one string but not the others.

+ +

A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.

+ +
    +
  • For example, "abc" is a subsequence of "aebdc" because you can delete the underlined characters in "aebdc" to get "abc". Other subsequences of "aebdc" include "aebdc", "aeb", and "" (empty string).
    • +
+ +

 

+

Example 1:

+
Input: strs = [""aba"",""cdc"",""eae""]
+Output: 3
+

Example 2:

+
Input: strs = [""aaa"",""aaa"",""aa""]
+Output: -1
+
+

 

+

Constraints:

+ +
    +
  • 2 <= strs.length <= 50
    • +
  • 1 <= strs[i].length <= 10
    • +
  • strs[i] consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int findLUSlength(vector& strs) { + + } +};","class Solution { + public int findLUSlength(String[] strs) { + + } +}","class Solution(object): + def findLUSlength(self, strs): + """""" + :type strs: List[str] + :rtype: int + """""" + ","class Solution: + def findLUSlength(self, strs: List[str]) -> int: + ","int findLUSlength(char ** strs, int strsSize){ + +}","public class Solution { + public int FindLUSlength(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {number} + */ +var findLUSlength = function(strs) { + +};","# @param {String[]} strs +# @return {Integer} +def find_lu_slength(strs) + +end","class Solution { + func findLUSlength(_ strs: [String]) -> Int { + + } +}","func findLUSlength(strs []string) int { + +}","object Solution { + def findLUSlength(strs: Array[String]): Int = { + + } +}","class Solution { + fun findLUSlength(strs: Array): Int { + + } +}","impl Solution { + pub fn find_lu_slength(strs: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return Integer + */ + function findLUSlength($strs) { + + } +}","function findLUSlength(strs: string[]): number { + +};","(define/contract (find-lu-slength strs) + (-> (listof string?) exact-integer?) + + )","-spec find_lu_slength(Strs :: [unicode:unicode_binary()]) -> integer(). +find_lu_slength(Strs) -> + .","defmodule Solution do + @spec find_lu_slength(strs :: [String.t]) :: integer + def find_lu_slength(strs) do + + end +end","class Solution { + int findLUSlength(List strs) { + + } +}", +1733,super-washing-machines,Super Washing Machines,517.0,517.0,"

You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.

+ +

For each move, you could choose any m (1 <= m <= n) washing machines, and pass one dress of each washing machine to one of its adjacent washing machines at the same time.

+ +

Given an integer array machines representing the number of dresses in each washing machine from left to right on the line, return the minimum number of moves to make all the washing machines have the same number of dresses. If it is not possible to do it, return -1.

+ +

 

+

Example 1:

+ +
+Input: machines = [1,0,5]
+Output: 3
+Explanation:
+1st move:    1     0 <-- 5    =>    1     1     4
+2nd move:    1 <-- 1 <-- 4    =>    2     1     3
+3rd move:    2     1 <-- 3    =>    2     2     2
+
+ +

Example 2:

+ +
+Input: machines = [0,3,0]
+Output: 2
+Explanation:
+1st move:    0 <-- 3     0    =>    1     2     0
+2nd move:    1     2 --> 0    =>    1     1     1
+
+ +

Example 3:

+ +
+Input: machines = [0,2,0]
+Output: -1
+Explanation:
+It's impossible to make all three washing machines have the same number of dresses.
+
+ +

 

+

Constraints:

+ +
    +
  • n == machines.length
    • +
  • 1 <= n <= 104
    • +
  • 0 <= machines[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int findMinMoves(vector& machines) { + + } +};","class Solution { + public int findMinMoves(int[] machines) { + + } +}","class Solution(object): + def findMinMoves(self, machines): + """""" + :type machines: List[int] + :rtype: int + """""" + ","class Solution: + def findMinMoves(self, machines: List[int]) -> int: + ","int findMinMoves(int* machines, int machinesSize){ + +}","public class Solution { + public int FindMinMoves(int[] machines) { + + } +}","/** + * @param {number[]} machines + * @return {number} + */ +var findMinMoves = function(machines) { + +};","# @param {Integer[]} machines +# @return {Integer} +def find_min_moves(machines) + +end","class Solution { + func findMinMoves(_ machines: [Int]) -> Int { + + } +}","func findMinMoves(machines []int) int { + +}","object Solution { + def findMinMoves(machines: Array[Int]): Int = { + + } +}","class Solution { + fun findMinMoves(machines: IntArray): Int { + + } +}","impl Solution { + pub fn find_min_moves(machines: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $machines + * @return Integer + */ + function findMinMoves($machines) { + + } +}","function findMinMoves(machines: number[]): number { + +};","(define/contract (find-min-moves machines) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_min_moves(Machines :: [integer()]) -> integer(). +find_min_moves(Machines) -> + .","defmodule Solution do + @spec find_min_moves(machines :: [integer]) :: integer + def find_min_moves(machines) do + + end +end","class Solution { + int findMinMoves(List machines) { + + } +}", +1734,longest-palindromic-subsequence,Longest Palindromic Subsequence,516.0,516.0,"

Given a string s, find the longest palindromic subsequence's length in s.

+ +

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: s = "bbbab"
+Output: 4
+Explanation: One possible longest palindromic subsequence is "bbbb".
+
+ +

Example 2:

+ +
+Input: s = "cbbd"
+Output: 2
+Explanation: One possible longest palindromic subsequence is "bb".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s consists only of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int longestPalindromeSubseq(string s) { + + } +};","class Solution { + public int longestPalindromeSubseq(String s) { + + } +}","class Solution(object): + def longestPalindromeSubseq(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def longestPalindromeSubseq(self, s: str) -> int: + ","int longestPalindromeSubseq(char * s){ + +}","public class Solution { + public int LongestPalindromeSubseq(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var longestPalindromeSubseq = function(s) { + +};","# @param {String} s +# @return {Integer} +def longest_palindrome_subseq(s) + +end","class Solution { + func longestPalindromeSubseq(_ s: String) -> Int { + + } +}","func longestPalindromeSubseq(s string) int { + +}","object Solution { + def longestPalindromeSubseq(s: String): Int = { + + } +}","class Solution { + fun longestPalindromeSubseq(s: String): Int { + + } +}","impl Solution { + pub fn longest_palindrome_subseq(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function longestPalindromeSubseq($s) { + + } +}","function longestPalindromeSubseq(s: string): number { + +};","(define/contract (longest-palindrome-subseq s) + (-> string? exact-integer?) + + )","-spec longest_palindrome_subseq(S :: unicode:unicode_binary()) -> integer(). +longest_palindrome_subseq(S) -> + .","defmodule Solution do + @spec longest_palindrome_subseq(s :: String.t) :: integer + def longest_palindrome_subseq(s) do + + end +end","class Solution { + int longestPalindromeSubseq(String s) { + + } +}", +1735,find-largest-value-in-each-tree-row,Find Largest Value in Each Tree Row,515.0,515.0,"

Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed).

+ +

 

+

Example 1:

+ +
+Input: root = [1,3,2,5,3,null,9]
+Output: [1,3,9]
+
+ +

Example 2:

+ +
+Input: root = [1,2,3]
+Output: [1,3]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree will be in the range [0, 104].
    • +
  • -231 <= Node.val <= 231 - 1
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector largestValues(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List largestValues(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def largestValues(self, root): + """""" + :type root: TreeNode + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def largestValues(self, root: Optional[TreeNode]) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* largestValues(struct TreeNode* root, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList LargestValues(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number[]} + */ +var largestValues = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer[]} +def largest_values(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func largestValues(_ root: TreeNode?) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func largestValues(root *TreeNode) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def largestValues(root: TreeNode): List[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun largestValues(root: TreeNode?): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn largest_values(root: Option>>) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer[] + */ + function largestValues($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function largestValues(root: TreeNode | null): number[] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (largest-values root) + (-> (or/c tree-node? #f) (listof exact-integer?)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec largest_values(Root :: #tree_node{} | null) -> [integer()]. +largest_values(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec largest_values(root :: TreeNode.t | nil) :: [integer] + def largest_values(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List largestValues(TreeNode? root) { + + } +}", +1736,freedom-trail,Freedom Trail,514.0,514.0,"

In the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring" and use the dial to spell a specific keyword to open the door.

+ +

Given a string ring that represents the code engraved on the outer ring and another string key that represents the keyword that needs to be spelled, return the minimum number of steps to spell all the characters in the keyword.

+ +

Initially, the first character of the ring is aligned at the "12:00" direction. You should spell all the characters in key one by one by rotating ring clockwise or anticlockwise to make each character of the string key aligned at the "12:00" direction and then by pressing the center button.

+ +

At the stage of rotating the ring to spell the key character key[i]:

+ +
    +
  1. You can rotate the ring clockwise or anticlockwise by one place, which counts as one step. The final purpose of the rotation is to align one of ring's characters at the "12:00" direction, where this character must equal key[i].
    2. +
  2. If the character key[i] has been aligned at the "12:00" direction, press the center button to spell, which also counts as one step. After the pressing, you could begin to spell the next character in the key (next stage). Otherwise, you have finished all the spelling.
    3. +
+ +

 

+

Example 1:

+ +
+Input: ring = "godding", key = "gd"
+Output: 4
+Explanation:
+For the first key character 'g', since it is already in place, we just need 1 step to spell this character. 
+For the second key character 'd', we need to rotate the ring "godding" anticlockwise by two steps to make it become "ddinggo".
+Also, we need 1 more step for spelling.
+So the final output is 4.
+
+ +

Example 2:

+ +
+Input: ring = "godding", key = "godding"
+Output: 13
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= ring.length, key.length <= 100
    • +
  • ring and key consist of only lower case English letters.
    • +
  • It is guaranteed that key could always be spelled by rotating ring.
    • +
+",3.0,False,"class Solution { +public: + int findRotateSteps(string ring, string key) { + + } +};","class Solution { + public int findRotateSteps(String ring, String key) { + + } +}","class Solution(object): + def findRotateSteps(self, ring, key): + """""" + :type ring: str + :type key: str + :rtype: int + """""" + ","class Solution: + def findRotateSteps(self, ring: str, key: str) -> int: + ","int findRotateSteps(char * ring, char * key){ + +}","public class Solution { + public int FindRotateSteps(string ring, string key) { + + } +}","/** + * @param {string} ring + * @param {string} key + * @return {number} + */ +var findRotateSteps = function(ring, key) { + +};","# @param {String} ring +# @param {String} key +# @return {Integer} +def find_rotate_steps(ring, key) + +end","class Solution { + func findRotateSteps(_ ring: String, _ key: String) -> Int { + + } +}","func findRotateSteps(ring string, key string) int { + +}","object Solution { + def findRotateSteps(ring: String, key: String): Int = { + + } +}","class Solution { + fun findRotateSteps(ring: String, key: String): Int { + + } +}","impl Solution { + pub fn find_rotate_steps(ring: String, key: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $ring + * @param String $key + * @return Integer + */ + function findRotateSteps($ring, $key) { + + } +}","function findRotateSteps(ring: string, key: string): number { + +};","(define/contract (find-rotate-steps ring key) + (-> string? string? exact-integer?) + + )","-spec find_rotate_steps(Ring :: unicode:unicode_binary(), Key :: unicode:unicode_binary()) -> integer(). +find_rotate_steps(Ring, Key) -> + .","defmodule Solution do + @spec find_rotate_steps(ring :: String.t, key :: String.t) :: integer + def find_rotate_steps(ring, key) do + + end +end","class Solution { + int findRotateSteps(String ring, String key) { + + } +}", +1737,find-bottom-left-tree-value,Find Bottom Left Tree Value,513.0,513.0,"

Given the root of a binary tree, return the leftmost value in the last row of the tree.

+ +

 

+

Example 1:

+ +
+Input: root = [2,1,3]
+Output: 1
+
+ +

Example 2:

+ +
+Input: root = [1,2,3,4,null,5,6,null,null,7]
+Output: 7
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 104].
    • +
  • -231 <= Node.val <= 231 - 1
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int findBottomLeftValue(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int findBottomLeftValue(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def findBottomLeftValue(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def findBottomLeftValue(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int findBottomLeftValue(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int FindBottomLeftValue(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var findBottomLeftValue = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def find_bottom_left_value(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func findBottomLeftValue(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func findBottomLeftValue(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def findBottomLeftValue(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun findBottomLeftValue(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn find_bottom_left_value(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function findBottomLeftValue($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function findBottomLeftValue(root: TreeNode | null): number { + +};",,"%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec find_bottom_left_value(Root :: #tree_node{} | null) -> integer(). +find_bottom_left_value(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec find_bottom_left_value(root :: TreeNode.t | nil) :: integer + def find_bottom_left_value(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int findBottomLeftValue(TreeNode? root) { + + } +}", +1742,next-greater-element-ii,Next Greater Element II,503.0,503.0,"

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

+ +

The next greater number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, return -1 for this number.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1]
+Output: [2,-1,2]
+Explanation: The first 1's next greater number is 2; 
+The number 2 can't find next greater number. 
+The second 1's next greater number needs to search circularly, which is also 2.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,3]
+Output: [2,3,4,-1,4]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -109 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + vector nextGreaterElements(vector& nums) { + + } +};","class Solution { + public int[] nextGreaterElements(int[] nums) { + + } +}","class Solution(object): + def nextGreaterElements(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def nextGreaterElements(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* nextGreaterElements(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] NextGreaterElements(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var nextGreaterElements = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def next_greater_elements(nums) + +end","class Solution { + func nextGreaterElements(_ nums: [Int]) -> [Int] { + + } +}","func nextGreaterElements(nums []int) []int { + +}","object Solution { + def nextGreaterElements(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun nextGreaterElements(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn next_greater_elements(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function nextGreaterElements($nums) { + + } +}","function nextGreaterElements(nums: number[]): number[] { + +};","(define/contract (next-greater-elements nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec next_greater_elements(Nums :: [integer()]) -> [integer()]. +next_greater_elements(Nums) -> + .","defmodule Solution do + @spec next_greater_elements(nums :: [integer]) :: [integer] + def next_greater_elements(nums) do + + end +end","class Solution { + List nextGreaterElements(List nums) { + + } +}", +1743,ipo,IPO,502.0,502.0,"

Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects.

+ +

You are given n projects where the ith project has a pure profit profits[i] and a minimum capital of capital[i] is needed to start it.

+ +

Initially, you have w capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital.

+ +

Pick a list of at most k distinct projects from given projects to maximize your final capital, and return the final maximized capital.

+ +

The answer is guaranteed to fit in a 32-bit signed integer.

+ +

 

+

Example 1:

+ +
+Input: k = 2, w = 0, profits = [1,2,3], capital = [0,1,1]
+Output: 4
+Explanation: Since your initial capital is 0, you can only start the project indexed 0.
+After finishing it you will obtain profit 1 and your capital becomes 1.
+With capital 1, you can either start the project indexed 1 or the project indexed 2.
+Since you can choose at most 2 projects, you need to finish the project indexed 2 to get the maximum capital.
+Therefore, output the final maximized capital, which is 0 + 1 + 3 = 4.
+
+ +

Example 2:

+ +
+Input: k = 3, w = 0, profits = [1,2,3], capital = [0,1,2]
+Output: 6
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 105
    • +
  • 0 <= w <= 109
    • +
  • n == profits.length
    • +
  • n == capital.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= profits[i] <= 104
    • +
  • 0 <= capital[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int findMaximizedCapital(int k, int w, vector& profits, vector& capital) { + + } +};","class Solution { + public int findMaximizedCapital(int k, int w, int[] profits, int[] capital) { + + } +}","class Solution(object): + def findMaximizedCapital(self, k, w, profits, capital): + """""" + :type k: int + :type w: int + :type profits: List[int] + :type capital: List[int] + :rtype: int + """""" + ","class Solution: + def findMaximizedCapital(self, k: int, w: int, profits: List[int], capital: List[int]) -> int: + ","int findMaximizedCapital(int k, int w, int* profits, int profitsSize, int* capital, int capitalSize){ + +}","public class Solution { + public int FindMaximizedCapital(int k, int w, int[] profits, int[] capital) { + + } +}","/** + * @param {number} k + * @param {number} w + * @param {number[]} profits + * @param {number[]} capital + * @return {number} + */ +var findMaximizedCapital = function(k, w, profits, capital) { + +};","# @param {Integer} k +# @param {Integer} w +# @param {Integer[]} profits +# @param {Integer[]} capital +# @return {Integer} +def find_maximized_capital(k, w, profits, capital) + +end","class Solution { + func findMaximizedCapital(_ k: Int, _ w: Int, _ profits: [Int], _ capital: [Int]) -> Int { + + } +}","func findMaximizedCapital(k int, w int, profits []int, capital []int) int { + +}","object Solution { + def findMaximizedCapital(k: Int, w: Int, profits: Array[Int], capital: Array[Int]): Int = { + + } +}","class Solution { + fun findMaximizedCapital(k: Int, w: Int, profits: IntArray, capital: IntArray): Int { + + } +}","impl Solution { + pub fn find_maximized_capital(k: i32, w: i32, profits: Vec, capital: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer $w + * @param Integer[] $profits + * @param Integer[] $capital + * @return Integer + */ + function findMaximizedCapital($k, $w, $profits, $capital) { + + } +}","function findMaximizedCapital(k: number, w: number, profits: number[], capital: number[]): number { + +};","(define/contract (find-maximized-capital k w profits capital) + (-> exact-integer? exact-integer? (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec find_maximized_capital(K :: integer(), W :: integer(), Profits :: [integer()], Capital :: [integer()]) -> integer(). +find_maximized_capital(K, W, Profits, Capital) -> + .","defmodule Solution do + @spec find_maximized_capital(k :: integer, w :: integer, profits :: [integer], capital :: [integer]) :: integer + def find_maximized_capital(k, w, profits, capital) do + + end +end","class Solution { + int findMaximizedCapital(int k, int w, List profits, List capital) { + + } +}", +1747,next-greater-element-i,Next Greater Element I,496.0,496.0,"

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.

+ +

You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.

+ +

For each 0 <= i < nums1.length, find the index j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums2. If there is no next greater element, then the answer for this query is -1.

+ +

Return an array ans of length nums1.length such that ans[i] is the next greater element as described above.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [4,1,2], nums2 = [1,3,4,2]
+Output: [-1,3,-1]
+Explanation: The next greater element for each value of nums1 is as follows:
+- 4 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.
+- 1 is underlined in nums2 = [1,3,4,2]. The next greater element is 3.
+- 2 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.
+
+ +

Example 2:

+ +
+Input: nums1 = [2,4], nums2 = [1,2,3,4]
+Output: [3,-1]
+Explanation: The next greater element for each value of nums1 is as follows:
+- 2 is underlined in nums2 = [1,2,3,4]. The next greater element is 3.
+- 4 is underlined in nums2 = [1,2,3,4]. There is no next greater element, so the answer is -1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length <= nums2.length <= 1000
    • +
  • 0 <= nums1[i], nums2[i] <= 104
    • +
  • All integers in nums1 and nums2 are unique.
    • +
  • All the integers of nums1 also appear in nums2.
    • +
+ +

 

+Follow up: Could you find an O(nums1.length + nums2.length) solution?",1.0,False,"class Solution { +public: + vector nextGreaterElement(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int[] nextGreaterElement(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def nextGreaterElement(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: List[int] + """""" + ","class Solution: + def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* nextGreaterElement(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){ + +}","public class Solution { + public int[] NextGreaterElement(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[]} + */ +var nextGreaterElement = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer[]} +def next_greater_element(nums1, nums2) + +end","class Solution { + func nextGreaterElement(_ nums1: [Int], _ nums2: [Int]) -> [Int] { + + } +}","func nextGreaterElement(nums1 []int, nums2 []int) []int { + +}","object Solution { + def nextGreaterElement(nums1: Array[Int], nums2: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun nextGreaterElement(nums1: IntArray, nums2: IntArray): IntArray { + + } +}","impl Solution { + pub fn next_greater_element(nums1: Vec, nums2: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer[] + */ + function nextGreaterElement($nums1, $nums2) { + + } +}","function nextGreaterElement(nums1: number[], nums2: number[]): number[] { + +};","(define/contract (next-greater-element nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec next_greater_element(Nums1 :: [integer()], Nums2 :: [integer()]) -> [integer()]. +next_greater_element(Nums1, Nums2) -> + .","defmodule Solution do + @spec next_greater_element(nums1 :: [integer], nums2 :: [integer]) :: [integer] + def next_greater_element(nums1, nums2) do + + end +end","class Solution { + List nextGreaterElement(List nums1, List nums2) { + + } +}", +1750,reverse-pairs,Reverse Pairs,493.0,493.0,"

Given an integer array nums, return the number of reverse pairs in the array.

+ +

A reverse pair is a pair (i, j) where:

+ +
    +
  • 0 <= i < j < nums.length and
    • +
  • nums[i] > 2 * nums[j].
    • +
+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,2,3,1]
+Output: 2
+Explanation: The reverse pairs are:
+(1, 4) --> nums[1] = 3, nums[4] = 1, 3 > 2 * 1
+(3, 4) --> nums[3] = 3, nums[4] = 1, 3 > 2 * 1
+
+ +

Example 2:

+ +
+Input: nums = [2,4,3,5,1]
+Output: 3
+Explanation: The reverse pairs are:
+(1, 4) --> nums[1] = 4, nums[4] = 1, 4 > 2 * 1
+(2, 4) --> nums[2] = 3, nums[4] = 1, 3 > 2 * 1
+(3, 4) --> nums[3] = 5, nums[4] = 1, 5 > 2 * 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5 * 104
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + int reversePairs(vector& nums) { + + } +};","class Solution { + public int reversePairs(int[] nums) { + + } +}","class Solution(object): + def reversePairs(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def reversePairs(self, nums: List[int]) -> int: + ","int reversePairs(int* nums, int numsSize){ + +}","public class Solution { + public int ReversePairs(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var reversePairs = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def reverse_pairs(nums) + +end","class Solution { + func reversePairs(_ nums: [Int]) -> Int { + + } +}","func reversePairs(nums []int) int { + +}","object Solution { + def reversePairs(nums: Array[Int]): Int = { + + } +}","class Solution { + fun reversePairs(nums: IntArray): Int { + + } +}","impl Solution { + pub fn reverse_pairs(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function reversePairs($nums) { + + } +}","function reversePairs(nums: number[]): number { + +};","(define/contract (reverse-pairs nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec reverse_pairs(Nums :: [integer()]) -> integer(). +reverse_pairs(Nums) -> + .","defmodule Solution do + @spec reverse_pairs(nums :: [integer]) :: integer + def reverse_pairs(nums) do + + end +end","class Solution { + int reversePairs(List nums) { + + } +}", +1753,kth-smallest-instructions,Kth Smallest Instructions,1643.0,489.0,"

Bob is standing at cell (0, 0), and he wants to reach destination: (row, column). He can only travel right and down. You are going to help Bob by providing instructions for him to reach destination.

+ +

The instructions are represented as a string, where each character is either:

+ +
    +
  • 'H', meaning move horizontally (go right), or
    • +
  • 'V', meaning move vertically (go down).
    • +
+ +

Multiple instructions will lead Bob to destination. For example, if destination is (2, 3), both "HHHVV" and "HVHVH" are valid instructions.

+ +

However, Bob is very picky. Bob has a lucky number k, and he wants the kth lexicographically smallest instructions that will lead him to destination. k is 1-indexed.

+ +

Given an integer array destination and an integer k, return the kth lexicographically smallest instructions that will take Bob to destination.

+ +

 

+

Example 1:

+ +

+ +
+Input: destination = [2,3], k = 1
+Output: "HHHVV"
+Explanation: All the instructions that reach (2, 3) in lexicographic order are as follows:
+["HHHVV", "HHVHV", "HHVVH", "HVHHV", "HVHVH", "HVVHH", "VHHHV", "VHHVH", "VHVHH", "VVHHH"].
+
+ +

Example 2:

+ +

+ +
+Input: destination = [2,3], k = 2
+Output: "HHVHV"
+
+ +

Example 3:

+ +

+ +
+Input: destination = [2,3], k = 3
+Output: "HHVVH"
+
+ +

 

+

Constraints:

+ +
    +
  • destination.length == 2
    • +
  • 1 <= row, column <= 15
    • +
  • 1 <= k <= nCr(row + column, row), where nCr(a, b) denotes a choose b​​​​​.
    • +
+",3.0,False,"class Solution { +public: + string kthSmallestPath(vector& destination, int k) { + + } +};","class Solution { + public String kthSmallestPath(int[] destination, int k) { + + } +}","class Solution(object): + def kthSmallestPath(self, destination, k): + """""" + :type destination: List[int] + :type k: int + :rtype: str + """""" + ","class Solution: + def kthSmallestPath(self, destination: List[int], k: int) -> str: + ","char * kthSmallestPath(int* destination, int destinationSize, int k){ + +}","public class Solution { + public string KthSmallestPath(int[] destination, int k) { + + } +}","/** + * @param {number[]} destination + * @param {number} k + * @return {string} + */ +var kthSmallestPath = function(destination, k) { + +};","# @param {Integer[]} destination +# @param {Integer} k +# @return {String} +def kth_smallest_path(destination, k) + +end","class Solution { + func kthSmallestPath(_ destination: [Int], _ k: Int) -> String { + + } +}","func kthSmallestPath(destination []int, k int) string { + +}","object Solution { + def kthSmallestPath(destination: Array[Int], k: Int): String = { + + } +}","class Solution { + fun kthSmallestPath(destination: IntArray, k: Int): String { + + } +}","impl Solution { + pub fn kth_smallest_path(destination: Vec, k: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $destination + * @param Integer $k + * @return String + */ + function kthSmallestPath($destination, $k) { + + } +}","function kthSmallestPath(destination: number[], k: number): string { + +};","(define/contract (kth-smallest-path destination k) + (-> (listof exact-integer?) exact-integer? string?) + + )","-spec kth_smallest_path(Destination :: [integer()], K :: integer()) -> unicode:unicode_binary(). +kth_smallest_path(Destination, K) -> + .","defmodule Solution do + @spec kth_smallest_path(destination :: [integer], k :: integer) :: String.t + def kth_smallest_path(destination, k) do + + end +end","class Solution { + String kthSmallestPath(List destination, int k) { + + } +}", +1754,zuma-game,Zuma Game,488.0,488.0,"

You are playing a variation of the game Zuma.

+ +

In this variation of Zuma, there is a single row of colored balls on a board, where each ball can be colored red 'R', yellow 'Y', blue 'B', green 'G', or white 'W'. You also have several colored balls in your hand.

+ +

Your goal is to clear all of the balls from the board. On each turn:

+ +
    +
  • Pick any ball from your hand and insert it in between two balls in the row or on either end of the row.
    • +
  • If there is a group of three or more consecutive balls of the same color, remove the group of balls from the board. +
      +
    • If this removal causes more groups of three or more of the same color to form, then continue removing each group until there are none left.
      • +
    +
    • +
  • If there are no more balls on the board, then you win the game.
    • +
  • Repeat this process until you either win or do not have any more balls in your hand.
    • +
+ +

Given a string board, representing the row of balls on the board, and a string hand, representing the balls in your hand, return the minimum number of balls you have to insert to clear all the balls from the board. If you cannot clear all the balls from the board using the balls in your hand, return -1.

+ +

 

+

Example 1:

+ +
+Input: board = "WRRBBW", hand = "RB"
+Output: -1
+Explanation: It is impossible to clear all the balls. The best you can do is:
+- Insert 'R' so the board becomes WRRRBBW. WRRRBBW -> WBBW.
+- Insert 'B' so the board becomes WBBBW. WBBBW -> WW.
+There are still balls remaining on the board, and you are out of balls to insert.
+ +

Example 2:

+ +
+Input: board = "WWRRBBWW", hand = "WRBRW"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'R' so the board becomes WWRRRBBWW. WWRRRBBWW -> WWBBWW.
+- Insert 'B' so the board becomes WWBBBWW. WWBBBWW -> WWWW -> empty.
+2 balls from your hand were needed to clear the board.
+
+ +

Example 3:

+ +
+Input: board = "G", hand = "GGGGG"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'G' so the board becomes GG.
+- Insert 'G' so the board becomes GGG. GGG -> empty.
+2 balls from your hand were needed to clear the board.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= board.length <= 16
    • +
  • 1 <= hand.length <= 5
    • +
  • board and hand consist of the characters 'R', 'Y', 'B', 'G', and 'W'.
    • +
  • The initial row of balls on the board will not have any groups of three or more consecutive balls of the same color.
    • +
+",3.0,False,"class Solution { +public: + int findMinStep(string board, string hand) { + + } +};","class Solution { + public int findMinStep(String board, String hand) { + + } +}","class Solution(object): + def findMinStep(self, board, hand): + """""" + :type board: str + :type hand: str + :rtype: int + """""" + ","class Solution: + def findMinStep(self, board: str, hand: str) -> int: + ","int findMinStep(char * board, char * hand){ + +}","public class Solution { + public int FindMinStep(string board, string hand) { + + } +}","/** + * @param {string} board + * @param {string} hand + * @return {number} + */ +var findMinStep = function(board, hand) { + +};","# @param {String} board +# @param {String} hand +# @return {Integer} +def find_min_step(board, hand) + +end","class Solution { + func findMinStep(_ board: String, _ hand: String) -> Int { + + } +}","func findMinStep(board string, hand string) int { + +}","object Solution { + def findMinStep(board: String, hand: String): Int = { + + } +}","class Solution { + fun findMinStep(board: String, hand: String): Int { + + } +}","impl Solution { + pub fn find_min_step(board: String, hand: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $board + * @param String $hand + * @return Integer + */ + function findMinStep($board, $hand) { + + } +}","function findMinStep(board: string, hand: string): number { + +};","(define/contract (find-min-step board hand) + (-> string? string? exact-integer?) + + )","-spec find_min_step(Board :: unicode:unicode_binary(), Hand :: unicode:unicode_binary()) -> integer(). +find_min_step(Board, Hand) -> + .","defmodule Solution do + @spec find_min_step(board :: String.t, hand :: String.t) :: integer + def find_min_step(board, hand) do + + end +end","class Solution { + int findMinStep(String board, String hand) { + + } +}", +1757,smallest-good-base,Smallest Good Base,483.0,483.0,"

Given an integer n represented as a string, return the smallest good base of n.

+ +

We call k >= 2 a good base of n, if all digits of n base k are 1's.

+ +

 

+

Example 1:

+ +
+Input: n = "13"
+Output: "3"
+Explanation: 13 base 3 is 111.
+
+ +

Example 2:

+ +
+Input: n = "4681"
+Output: "8"
+Explanation: 4681 base 8 is 11111.
+
+ +

Example 3:

+ +
+Input: n = "1000000000000000000"
+Output: "999999999999999999"
+Explanation: 1000000000000000000 base 999999999999999999 is 11.
+
+ +

 

+

Constraints:

+ +
    +
  • n is an integer in the range [3, 1018].
    • +
  • n does not contain any leading zeros.
    • +
+",3.0,False,"class Solution { +public: + string smallestGoodBase(string n) { + + } +};","class Solution { + public String smallestGoodBase(String n) { + + } +}","class Solution(object): + def smallestGoodBase(self, n): + """""" + :type n: str + :rtype: str + """""" + ","class Solution: + def smallestGoodBase(self, n: str) -> str: + ","char * smallestGoodBase(char * n){ + +}","public class Solution { + public string SmallestGoodBase(string n) { + + } +}","/** + * @param {string} n + * @return {string} + */ +var smallestGoodBase = function(n) { + +};","# @param {String} n +# @return {String} +def smallest_good_base(n) + +end","class Solution { + func smallestGoodBase(_ n: String) -> String { + + } +}","func smallestGoodBase(n string) string { + +}","object Solution { + def smallestGoodBase(n: String): String = { + + } +}","class Solution { + fun smallestGoodBase(n: String): String { + + } +}","impl Solution { + pub fn smallest_good_base(n: String) -> String { + + } +}","class Solution { + + /** + * @param String $n + * @return String + */ + function smallestGoodBase($n) { + + } +}","function smallestGoodBase(n: string): string { + +};","(define/contract (smallest-good-base n) + (-> string? string?) + + )","-spec smallest_good_base(N :: unicode:unicode_binary()) -> unicode:unicode_binary(). +smallest_good_base(N) -> + .","defmodule Solution do + @spec smallest_good_base(n :: String.t) :: String.t + def smallest_good_base(n) do + + end +end","class Solution { + String smallestGoodBase(String n) { + + } +}", +1760,sliding-window-median,Sliding Window Median,480.0,480.0,"

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle values.

+ +
    +
  • For examples, if arr = [2,3,4], the median is 3.
    • +
  • For examples, if arr = [1,2,3,4], the median is (2 + 3) / 2 = 2.5.
    • +
+ +

You are given an integer array nums and an integer k. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

+ +

Return the median array for each window in the original array. Answers within 10-5 of the actual value will be accepted.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
+Output: [1.00000,-1.00000,-1.00000,3.00000,5.00000,6.00000]
+Explanation: 
+Window position                Median
+---------------                -----
+[1  3  -1] -3  5  3  6  7        1
+ 1 [3  -1  -3] 5  3  6  7       -1
+ 1  3 [-1  -3  5] 3  6  7       -1
+ 1  3  -1 [-3  5  3] 6  7        3
+ 1  3  -1  -3 [5  3  6] 7        5
+ 1  3  -1  -3  5 [3  6  7]       6
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,2,3,1,4,2], k = 3
+Output: [2.00000,3.00000,3.00000,3.00000,2.00000,3.00000,2.00000]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= nums.length <= 105
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + vector medianSlidingWindow(vector& nums, int k) { + + } +};","class Solution { + public double[] medianSlidingWindow(int[] nums, int k) { + + } +}","class Solution(object): + def medianSlidingWindow(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[float] + """""" + ","class Solution: + def medianSlidingWindow(self, nums: List[int], k: int) -> List[float]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +double* medianSlidingWindow(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public double[] MedianSlidingWindow(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var medianSlidingWindow = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Float[]} +def median_sliding_window(nums, k) + +end","class Solution { + func medianSlidingWindow(_ nums: [Int], _ k: Int) -> [Double] { + + } +}","func medianSlidingWindow(nums []int, k int) []float64 { + +}","object Solution { + def medianSlidingWindow(nums: Array[Int], k: Int): Array[Double] = { + + } +}","class Solution { + fun medianSlidingWindow(nums: IntArray, k: Int): DoubleArray { + + } +}","impl Solution { + pub fn median_sliding_window(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Float[] + */ + function medianSlidingWindow($nums, $k) { + + } +}","function medianSlidingWindow(nums: number[], k: number): number[] { + +};","(define/contract (median-sliding-window nums k) + (-> (listof exact-integer?) exact-integer? (listof flonum?)) + + )","-spec median_sliding_window(Nums :: [integer()], K :: integer()) -> [float()]. +median_sliding_window(Nums, K) -> + .","defmodule Solution do + @spec median_sliding_window(nums :: [integer], k :: integer) :: [float] + def median_sliding_window(nums, k) do + + end +end","class Solution { + List medianSlidingWindow(List nums, int k) { + + } +}", +1761,largest-palindrome-product,Largest Palindrome Product,479.0,479.0,"

Given an integer n, return the largest palindromic integer that can be represented as the product of two n-digits integers. Since the answer can be very large, return it modulo 1337.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: 987
+Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 9
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 8
    • +
+",3.0,False,"class Solution { +public: + int largestPalindrome(int n) { + + } +};","class Solution { + public int largestPalindrome(int n) { + + } +}","class Solution(object): + def largestPalindrome(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def largestPalindrome(self, n: int) -> int: + ","int largestPalindrome(int n){ + +}","public class Solution { + public int LargestPalindrome(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var largestPalindrome = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def largest_palindrome(n) + +end","class Solution { + func largestPalindrome(_ n: Int) -> Int { + + } +}","func largestPalindrome(n int) int { + +}","object Solution { + def largestPalindrome(n: Int): Int = { + + } +}","class Solution { + fun largestPalindrome(n: Int): Int { + + } +}","impl Solution { + pub fn largest_palindrome(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function largestPalindrome($n) { + + } +}","function largestPalindrome(n: number): number { + +};","(define/contract (largest-palindrome n) + (-> exact-integer? exact-integer?) + + )","-spec largest_palindrome(N :: integer()) -> integer(). +largest_palindrome(N) -> + .","defmodule Solution do + @spec largest_palindrome(n :: integer) :: integer + def largest_palindrome(n) do + + end +end","class Solution { + int largestPalindrome(int n) { + + } +}", +1762,total-hamming-distance,Total Hamming Distance,477.0,477.0,"

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

+ +

Given an integer array nums, return the sum of Hamming distances between all the pairs of the integers in nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,14,2]
+Output: 6
+Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
+showing the four bits relevant in this case).
+The answer will be:
+HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.
+
+ +

Example 2:

+ +
+Input: nums = [4,14,4]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • 0 <= nums[i] <= 109
    • +
  • The answer for the given input will fit in a 32-bit integer.
    • +
+",2.0,False,"class Solution { +public: + int totalHammingDistance(vector& nums) { + + } +};","class Solution { + public int totalHammingDistance(int[] nums) { + + } +}","class Solution(object): + def totalHammingDistance(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def totalHammingDistance(self, nums: List[int]) -> int: + ","int totalHammingDistance(int* nums, int numsSize){ + +}","public class Solution { + public int TotalHammingDistance(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var totalHammingDistance = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def total_hamming_distance(nums) + +end","class Solution { + func totalHammingDistance(_ nums: [Int]) -> Int { + + } +}","func totalHammingDistance(nums []int) int { + +}","object Solution { + def totalHammingDistance(nums: Array[Int]): Int = { + + } +}","class Solution { + fun totalHammingDistance(nums: IntArray): Int { + + } +}","impl Solution { + pub fn total_hamming_distance(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function totalHammingDistance($nums) { + + } +}","function totalHammingDistance(nums: number[]): number { + +};","(define/contract (total-hamming-distance nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec total_hamming_distance(Nums :: [integer()]) -> integer(). +total_hamming_distance(Nums) -> + .","defmodule Solution do + @spec total_hamming_distance(nums :: [integer]) :: integer + def total_hamming_distance(nums) do + + end +end","class Solution { + int totalHammingDistance(List nums) { + + } +}", +1764,heaters,Heaters,475.0,475.0,"

Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses.

+ +

Every house can be warmed, as long as the house is within the heater's warm radius range. 

+ +

Given the positions of houses and heaters on a horizontal line, return the minimum radius standard of heaters so that those heaters could cover all houses.

+ +

Notice that all the heaters follow your radius standard, and the warm radius will the same.

+ +

 

+

Example 1:

+ +
+Input: houses = [1,2,3], heaters = [2]
+Output: 1
+Explanation: The only heater was placed in the position 2, and if we use the radius 1 standard, then all the houses can be warmed.
+
+ +

Example 2:

+ +
+Input: houses = [1,2,3,4], heaters = [1,4]
+Output: 1
+Explanation: The two heater was placed in the position 1 and 4. We need to use radius 1 standard, then all the houses can be warmed.
+
+ +

Example 3:

+ +
+Input: houses = [1,5], heaters = [2]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= houses.length, heaters.length <= 3 * 104
    • +
  • 1 <= houses[i], heaters[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int findRadius(vector& houses, vector& heaters) { + + } +};","class Solution { + public int findRadius(int[] houses, int[] heaters) { + + } +}","class Solution(object): + def findRadius(self, houses, heaters): + """""" + :type houses: List[int] + :type heaters: List[int] + :rtype: int + """""" + ","class Solution: + def findRadius(self, houses: List[int], heaters: List[int]) -> int: + ","int findRadius(int* houses, int housesSize, int* heaters, int heatersSize){ + +}","public class Solution { + public int FindRadius(int[] houses, int[] heaters) { + + } +}","/** + * @param {number[]} houses + * @param {number[]} heaters + * @return {number} + */ +var findRadius = function(houses, heaters) { + +};","# @param {Integer[]} houses +# @param {Integer[]} heaters +# @return {Integer} +def find_radius(houses, heaters) + +end","class Solution { + func findRadius(_ houses: [Int], _ heaters: [Int]) -> Int { + + } +}","func findRadius(houses []int, heaters []int) int { + +}","object Solution { + def findRadius(houses: Array[Int], heaters: Array[Int]): Int = { + + } +}","class Solution { + fun findRadius(houses: IntArray, heaters: IntArray): Int { + + } +}","impl Solution { + pub fn find_radius(houses: Vec, heaters: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $houses + * @param Integer[] $heaters + * @return Integer + */ + function findRadius($houses, $heaters) { + + } +}","function findRadius(houses: number[], heaters: number[]): number { + +};","(define/contract (find-radius houses heaters) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec find_radius(Houses :: [integer()], Heaters :: [integer()]) -> integer(). +find_radius(Houses, Heaters) -> + .","defmodule Solution do + @spec find_radius(houses :: [integer], heaters :: [integer]) :: integer + def find_radius(houses, heaters) do + + end +end","class Solution { + int findRadius(List houses, List heaters) { + + } +}", +1765,ones-and-zeroes,Ones and Zeroes,474.0,474.0,"

You are given an array of binary strings strs and two integers m and n.

+ +

Return the size of the largest subset of strs such that there are at most m 0's and n 1's in the subset.

+ +

A set x is a subset of a set y if all elements of x are also elements of y.

+ +

 

+

Example 1:

+ +
+Input: strs = ["10","0001","111001","1","0"], m = 5, n = 3
+Output: 4
+Explanation: The largest subset with at most 5 0's and 3 1's is {"10", "0001", "1", "0"}, so the answer is 4.
+Other valid but smaller subsets include {"0001", "1"} and {"10", "1", "0"}.
+{"111001"} is an invalid subset because it contains 4 1's, greater than the maximum of 3.
+
+ +

Example 2:

+ +
+Input: strs = ["10","0","1"], m = 1, n = 1
+Output: 2
+Explanation: The largest subset is {"0", "1"}, so the answer is 2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= strs.length <= 600
    • +
  • 1 <= strs[i].length <= 100
    • +
  • strs[i] consists only of digits '0' and '1'.
    • +
  • 1 <= m, n <= 100
    • +
+",2.0,False,"class Solution { +public: + int findMaxForm(vector& strs, int m, int n) { + + } +};","class Solution { + public int findMaxForm(String[] strs, int m, int n) { + + } +}","class Solution(object): + def findMaxForm(self, strs, m, n): + """""" + :type strs: List[str] + :type m: int + :type n: int + :rtype: int + """""" + ","class Solution: + def findMaxForm(self, strs: List[str], m: int, n: int) -> int: + ","int findMaxForm(char ** strs, int strsSize, int m, int n){ + +}","public class Solution { + public int FindMaxForm(string[] strs, int m, int n) { + + } +}","/** + * @param {string[]} strs + * @param {number} m + * @param {number} n + * @return {number} + */ +var findMaxForm = function(strs, m, n) { + +};","# @param {String[]} strs +# @param {Integer} m +# @param {Integer} n +# @return {Integer} +def find_max_form(strs, m, n) + +end","class Solution { + func findMaxForm(_ strs: [String], _ m: Int, _ n: Int) -> Int { + + } +}","func findMaxForm(strs []string, m int, n int) int { + +}","object Solution { + def findMaxForm(strs: Array[String], m: Int, n: Int): Int = { + + } +}","class Solution { + fun findMaxForm(strs: Array, m: Int, n: Int): Int { + + } +}","impl Solution { + pub fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $strs + * @param Integer $m + * @param Integer $n + * @return Integer + */ + function findMaxForm($strs, $m, $n) { + + } +}","function findMaxForm(strs: string[], m: number, n: number): number { + +};","(define/contract (find-max-form strs m n) + (-> (listof string?) exact-integer? exact-integer? exact-integer?) + + )","-spec find_max_form(Strs :: [unicode:unicode_binary()], M :: integer(), N :: integer()) -> integer(). +find_max_form(Strs, M, N) -> + .","defmodule Solution do + @spec find_max_form(strs :: [String.t], m :: integer, n :: integer) :: integer + def find_max_form(strs, m, n) do + + end +end","class Solution { + int findMaxForm(List strs, int m, int n) { + + } +}", +1766,matchsticks-to-square,Matchsticks to Square,473.0,473.0,"

You are given an integer array matchsticks where matchsticks[i] is the length of the ith matchstick. You want to use all the matchsticks to make one square. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

+ +

Return true if you can make this square and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: matchsticks = [1,1,2,2,2]
+Output: true
+Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.
+
+ +

Example 2:

+ +
+Input: matchsticks = [3,3,3,3,4]
+Output: false
+Explanation: You cannot find a way to form a square with all the matchsticks.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= matchsticks.length <= 15
    • +
  • 1 <= matchsticks[i] <= 108
    • +
+",2.0,False,"class Solution { +public: + bool makesquare(vector& matchsticks) { + + } +};","class Solution { + public boolean makesquare(int[] matchsticks) { + + } +}","class Solution(object): + def makesquare(self, matchsticks): + """""" + :type matchsticks: List[int] + :rtype: bool + """""" + ","class Solution: + def makesquare(self, matchsticks: List[int]) -> bool: + ","bool makesquare(int* matchsticks, int matchsticksSize){ + +}","public class Solution { + public bool Makesquare(int[] matchsticks) { + + } +}","/** + * @param {number[]} matchsticks + * @return {boolean} + */ +var makesquare = function(matchsticks) { + +};","# @param {Integer[]} matchsticks +# @return {Boolean} +def makesquare(matchsticks) + +end","class Solution { + func makesquare(_ matchsticks: [Int]) -> Bool { + + } +}","func makesquare(matchsticks []int) bool { + +}","object Solution { + def makesquare(matchsticks: Array[Int]): Boolean = { + + } +}","class Solution { + fun makesquare(matchsticks: IntArray): Boolean { + + } +}","impl Solution { + pub fn makesquare(matchsticks: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $matchsticks + * @return Boolean + */ + function makesquare($matchsticks) { + + } +}","function makesquare(matchsticks: number[]): boolean { + +};","(define/contract (makesquare matchsticks) + (-> (listof exact-integer?) boolean?) + + )","-spec makesquare(Matchsticks :: [integer()]) -> boolean(). +makesquare(Matchsticks) -> + .","defmodule Solution do + @spec makesquare(matchsticks :: [integer]) :: boolean + def makesquare(matchsticks) do + + end +end","class Solution { + bool makesquare(List matchsticks) { + + } +}", +1767,concatenated-words,Concatenated Words,472.0,472.0,"

Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.

+ +

A concatenated word is defined as a string that is comprised entirely of at least two shorter words (not necesssarily distinct) in the given array.

+ +

 

+

Example 1:

+ +
+Input: words = ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]
+Output: ["catsdogcats","dogcatsdog","ratcatdogcat"]
+Explanation: "catsdogcats" can be concatenated by "cats", "dog" and "cats"; 
+"dogcatsdog" can be concatenated by "dog", "cats" and "dog"; 
+"ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".
+ +

Example 2:

+ +
+Input: words = ["cat","dog","catdog"]
+Output: ["catdog"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 104
    • +
  • 1 <= words[i].length <= 30
    • +
  • words[i] consists of only lowercase English letters.
    • +
  • All the strings of words are unique.
    • +
  • 1 <= sum(words[i].length) <= 105
    • +
+",3.0,False,"class Solution { +public: + vector findAllConcatenatedWordsInADict(vector& words) { + + } +};","class Solution { + public List findAllConcatenatedWordsInADict(String[] words) { + + } +}","class Solution(object): + def findAllConcatenatedWordsInADict(self, words): + """""" + :type words: List[str] + :rtype: List[str] + """""" + ","class Solution: + def findAllConcatenatedWordsInADict(self, words: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** findAllConcatenatedWordsInADict(char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public IList FindAllConcatenatedWordsInADict(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {string[]} + */ +var findAllConcatenatedWordsInADict = function(words) { + +};","# @param {String[]} words +# @return {String[]} +def find_all_concatenated_words_in_a_dict(words) + +end","class Solution { + func findAllConcatenatedWordsInADict(_ words: [String]) -> [String] { + + } +}","func findAllConcatenatedWordsInADict(words []string) []string { + +}","object Solution { + def findAllConcatenatedWordsInADict(words: Array[String]): List[String] = { + + } +}","class Solution { + fun findAllConcatenatedWordsInADict(words: Array): List { + + } +}","impl Solution { + pub fn find_all_concatenated_words_in_a_dict(words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @return String[] + */ + function findAllConcatenatedWordsInADict($words) { + + } +}","function findAllConcatenatedWordsInADict(words: string[]): string[] { + +};","(define/contract (find-all-concatenated-words-in-a-dict words) + (-> (listof string?) (listof string?)) + + )","-spec find_all_concatenated_words_in_a_dict(Words :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +find_all_concatenated_words_in_a_dict(Words) -> + .","defmodule Solution do + @spec find_all_concatenated_words_in_a_dict(words :: [String.t]) :: [String.t] + def find_all_concatenated_words_in_a_dict(words) do + + end +end","class Solution { + List findAllConcatenatedWordsInADict(List words) { + + } +}", +1768,validate-ip-address,Validate IP Address,468.0,468.0,"

Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.

+ +

A valid IPv4 address is an IP in the form "x1.x2.x3.x4" where 0 <= xi <= 255 and xi cannot contain leading zeros. For example, "192.168.1.1" and "192.168.1.0" are valid IPv4 addresses while "192.168.01.1", "192.168.1.00", and "192.168@1.1" are invalid IPv4 addresses.

+ +

A valid IPv6 address is an IP in the form "x1:x2:x3:x4:x5:x6:x7:x8" where:

+ +
    +
  • 1 <= xi.length <= 4
    • +
  • xi is a hexadecimal string which may contain digits, lowercase English letter ('a' to 'f') and upper-case English letters ('A' to 'F').
    • +
  • Leading zeros are allowed in xi.
    • +
+ +

For example, "2001:0db8:85a3:0000:0000:8a2e:0370:7334" and "2001:db8:85a3:0:0:8A2E:0370:7334" are valid IPv6 addresses, while "2001:0db8:85a3::8A2E:037j:7334" and "02001:0db8:85a3:0000:0000:8a2e:0370:7334" are invalid IPv6 addresses.

+ +

 

+

Example 1:

+ +
+Input: queryIP = "172.16.254.1"
+Output: "IPv4"
+Explanation: This is a valid IPv4 address, return "IPv4".
+
+ +

Example 2:

+ +
+Input: queryIP = "2001:0db8:85a3:0:0:8A2E:0370:7334"
+Output: "IPv6"
+Explanation: This is a valid IPv6 address, return "IPv6".
+
+ +

Example 3:

+ +
+Input: queryIP = "256.256.256.256"
+Output: "Neither"
+Explanation: This is neither a IPv4 address nor a IPv6 address.
+
+ +

 

+

Constraints:

+ +
    +
  • queryIP consists only of English letters, digits and the characters '.' and ':'.
    • +
+",2.0,False,"class Solution { +public: + string validIPAddress(string queryIP) { + + } +};","class Solution { + public String validIPAddress(String queryIP) { + + } +}","class Solution(object): + def validIPAddress(self, queryIP): + """""" + :type queryIP: str + :rtype: str + """""" + ","class Solution: + def validIPAddress(self, queryIP: str) -> str: + ","char * validIPAddress(char * queryIP){ + +}","public class Solution { + public string ValidIPAddress(string queryIP) { + + } +}","/** + * @param {string} queryIP + * @return {string} + */ +var validIPAddress = function(queryIP) { + +};","# @param {String} query_ip +# @return {String} +def valid_ip_address(query_ip) + +end","class Solution { + func validIPAddress(_ queryIP: String) -> String { + + } +}","func validIPAddress(queryIP string) string { + +}","object Solution { + def validIPAddress(queryIP: String): String = { + + } +}","class Solution { + fun validIPAddress(queryIP: String): String { + + } +}","impl Solution { + pub fn valid_ip_address(query_ip: String) -> String { + + } +}","class Solution { + + /** + * @param String $queryIP + * @return String + */ + function validIPAddress($queryIP) { + + } +}","function validIPAddress(queryIP: string): string { + +};","(define/contract (valid-ip-address queryIP) + (-> string? string?) + + )","-spec valid_ip_address(QueryIP :: unicode:unicode_binary()) -> unicode:unicode_binary(). +valid_ip_address(QueryIP) -> + .","defmodule Solution do + @spec valid_ip_address(query_ip :: String.t) :: String.t + def valid_ip_address(query_ip) do + + end +end","class Solution { + String validIPAddress(String queryIP) { + + } +}", +1769,unique-substrings-in-wraparound-string,Unique Substrings in Wraparound String,467.0,467.0,"

We define the string base to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so base will look like this:

+ +
    +
  • "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".
    • +
+ +

Given a string s, return the number of unique non-empty substrings of s are present in base.

+ +

 

+

Example 1:

+ +
+Input: s = "a"
+Output: 1
+Explanation: Only the substring "a" of s is in base.
+
+ +

Example 2:

+ +
+Input: s = "cac"
+Output: 2
+Explanation: There are two substrings ("a", "c") of s in base.
+
+ +

Example 3:

+ +
+Input: s = "zab"
+Output: 6
+Explanation: There are six substrings ("z", "a", "b", "za", "ab", and "zab") of s in base.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int findSubstringInWraproundString(string s) { + + } +};","class Solution { + public int findSubstringInWraproundString(String s) { + + } +}","class Solution(object): + def findSubstringInWraproundString(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def findSubstringInWraproundString(self, s: str) -> int: + ","int findSubstringInWraproundString(char * s){ + +}","public class Solution { + public int FindSubstringInWraproundString(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var findSubstringInWraproundString = function(s) { + +};","# @param {String} s +# @return {Integer} +def find_substring_in_wrapround_string(s) + +end","class Solution { + func findSubstringInWraproundString(_ s: String) -> Int { + + } +}","func findSubstringInWraproundString(s string) int { + +}","object Solution { + def findSubstringInWraproundString(s: String): Int = { + + } +}","class Solution { + fun findSubstringInWraproundString(s: String): Int { + + } +}","impl Solution { + pub fn find_substring_in_wrapround_string(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function findSubstringInWraproundString($s) { + + } +}","function findSubstringInWraproundString(s: string): number { + +};","(define/contract (find-substring-in-wrapround-string s) + (-> string? exact-integer?) + + )","-spec find_substring_in_wrapround_string(S :: unicode:unicode_binary()) -> integer(). +find_substring_in_wrapround_string(S) -> + .","defmodule Solution do + @spec find_substring_in_wrapround_string(s :: String.t) :: integer + def find_substring_in_wrapround_string(s) do + + end +end","class Solution { + int findSubstringInWraproundString(String s) { + + } +}", +1770,count-the-repetitions,Count The Repetitions,466.0,466.0,"

We define str = [s, n] as the string str which consists of the string s concatenated n times.

+ +
    +
  • For example, str == ["abc", 3] =="abcabcabc".
    • +
+ +

We define that string s1 can be obtained from string s2 if we can remove some characters from s2 such that it becomes s1.

+ +
    +
  • For example, s1 = "abc" can be obtained from s2 = "abdbec" based on our definition by removing the bolded underlined characters.
    • +
+ +

You are given two strings s1 and s2 and two integers n1 and n2. You have the two strings str1 = [s1, n1] and str2 = [s2, n2].

+ +

Return the maximum integer m such that str = [str2, m] can be obtained from str1.

+ +

 

+

Example 1:

+
Input: s1 = ""acb"", n1 = 4, s2 = ""ab"", n2 = 2
+Output: 2
+

Example 2:

+
Input: s1 = ""acb"", n1 = 1, s2 = ""acb"", n2 = 1
+Output: 1
+
+

 

+

Constraints:

+ +
    +
  • 1 <= s1.length, s2.length <= 100
    • +
  • s1 and s2 consist of lowercase English letters.
    • +
  • 1 <= n1, n2 <= 106
    • +
+",3.0,False,"class Solution { +public: + int getMaxRepetitions(string s1, int n1, string s2, int n2) { + + } +};","class Solution { + public int getMaxRepetitions(String s1, int n1, String s2, int n2) { + + } +}","class Solution(object): + def getMaxRepetitions(self, s1, n1, s2, n2): + """""" + :type s1: str + :type n1: int + :type s2: str + :type n2: int + :rtype: int + """""" + ","class Solution: + def getMaxRepetitions(self, s1: str, n1: int, s2: str, n2: int) -> int: + ","int getMaxRepetitions(char * s1, int n1, char * s2, int n2){ + +}","public class Solution { + public int GetMaxRepetitions(string s1, int n1, string s2, int n2) { + + } +}","/** + * @param {string} s1 + * @param {number} n1 + * @param {string} s2 + * @param {number} n2 + * @return {number} + */ +var getMaxRepetitions = function(s1, n1, s2, n2) { + +};","# @param {String} s1 +# @param {Integer} n1 +# @param {String} s2 +# @param {Integer} n2 +# @return {Integer} +def get_max_repetitions(s1, n1, s2, n2) + +end","class Solution { + func getMaxRepetitions(_ s1: String, _ n1: Int, _ s2: String, _ n2: Int) -> Int { + + } +}","func getMaxRepetitions(s1 string, n1 int, s2 string, n2 int) int { + +}","object Solution { + def getMaxRepetitions(s1: String, n1: Int, s2: String, n2: Int): Int = { + + } +}","class Solution { + fun getMaxRepetitions(s1: String, n1: Int, s2: String, n2: Int): Int { + + } +}","impl Solution { + pub fn get_max_repetitions(s1: String, n1: i32, s2: String, n2: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s1 + * @param Integer $n1 + * @param String $s2 + * @param Integer $n2 + * @return Integer + */ + function getMaxRepetitions($s1, $n1, $s2, $n2) { + + } +}","function getMaxRepetitions(s1: string, n1: number, s2: string, n2: number): number { + +};","(define/contract (get-max-repetitions s1 n1 s2 n2) + (-> string? exact-integer? string? exact-integer? exact-integer?) + + )","-spec get_max_repetitions(S1 :: unicode:unicode_binary(), N1 :: integer(), S2 :: unicode:unicode_binary(), N2 :: integer()) -> integer(). +get_max_repetitions(S1, N1, S2, N2) -> + .","defmodule Solution do + @spec get_max_repetitions(s1 :: String.t, n1 :: integer, s2 :: String.t, n2 :: integer) :: integer + def get_max_repetitions(s1, n1, s2, n2) do + + end +end","class Solution { + int getMaxRepetitions(String s1, int n1, String s2, int n2) { + + } +}", +1775,lfu-cache,LFU Cache,460.0,460.0,"

Design and implement a data structure for a Least Frequently Used (LFU) cache.

+ +

Implement the LFUCache class:

+ +
    +
  • LFUCache(int capacity) Initializes the object with the capacity of the data structure.
    • +
  • int get(int key) Gets the value of the key if the key exists in the cache. Otherwise, returns -1.
    • +
  • void put(int key, int value) Update the value of the key if present, or inserts the key if not already present. When the cache reaches its capacity, it should invalidate and remove the least frequently used key before inserting a new item. For this problem, when there is a tie (i.e., two or more keys with the same frequency), the least recently used key would be invalidated.
    • +
+ +

To determine the least frequently used key, a use counter is maintained for each key in the cache. The key with the smallest use counter is the least frequently used key.

+ +

When a key is first inserted into the cache, its use counter is set to 1 (due to the put operation). The use counter for a key in the cache is incremented either a get or put operation is called on it.

+ +

The functions get and put must each run in O(1) average time complexity.

+ +

 

+

Example 1:

+ +
+Input
+["LFUCache", "put", "put", "get", "put", "get", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [3], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, 3, null, -1, 3, 4]
+
+Explanation
+// cnt(x) = the use counter for key x
+// cache=[] will show the last used order for tiebreakers (leftmost element is  most recent)
+LFUCache lfu = new LFUCache(2);
+lfu.put(1, 1);   // cache=[1,_], cnt(1)=1
+lfu.put(2, 2);   // cache=[2,1], cnt(2)=1, cnt(1)=1
+lfu.get(1);      // return 1
+                 // cache=[1,2], cnt(2)=1, cnt(1)=2
+lfu.put(3, 3);   // 2 is the LFU key because cnt(2)=1 is the smallest, invalidate 2.
+                 // cache=[3,1], cnt(3)=1, cnt(1)=2
+lfu.get(2);      // return -1 (not found)
+lfu.get(3);      // return 3
+                 // cache=[3,1], cnt(3)=2, cnt(1)=2
+lfu.put(4, 4);   // Both 1 and 3 have the same cnt, but 1 is LRU, invalidate 1.
+                 // cache=[4,3], cnt(4)=1, cnt(3)=2
+lfu.get(1);      // return -1 (not found)
+lfu.get(3);      // return 3
+                 // cache=[3,4], cnt(4)=1, cnt(3)=3
+lfu.get(4);      // return 4
+                 // cache=[4,3], cnt(4)=2, cnt(3)=3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= capacity <= 104
    • +
  • 0 <= key <= 105
    • +
  • 0 <= value <= 109
    • +
  • At most 2 * 105 calls will be made to get and put.
    • +
+ +

 

+ ",3.0,False,"class LFUCache { +public: + LFUCache(int capacity) { + + } + + int get(int key) { + + } + + void put(int key, int value) { + + } +}; + +/** + * Your LFUCache object will be instantiated and called as such: + * LFUCache* obj = new LFUCache(capacity); + * int param_1 = obj->get(key); + * obj->put(key,value); + */","class LFUCache { + + public LFUCache(int capacity) { + + } + + public int get(int key) { + + } + + public void put(int key, int value) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * LFUCache obj = new LFUCache(capacity); + * int param_1 = obj.get(key); + * obj.put(key,value); + */","class LFUCache(object): + + def __init__(self, capacity): + """""" + :type capacity: int + """""" + + + def get(self, key): + """""" + :type key: int + :rtype: int + """""" + + + def put(self, key, value): + """""" + :type key: int + :type value: int + :rtype: None + """""" + + + +# Your LFUCache object will be instantiated and called as such: +# obj = LFUCache(capacity) +# param_1 = obj.get(key) +# obj.put(key,value)","class LFUCache: + + def __init__(self, capacity: int): + + + def get(self, key: int) -> int: + + + def put(self, key: int, value: int) -> None: + + + +# Your LFUCache object will be instantiated and called as such: +# obj = LFUCache(capacity) +# param_1 = obj.get(key) +# obj.put(key,value)"," + + +typedef struct { + +} LFUCache; + + +LFUCache* lFUCacheCreate(int capacity) { + +} + +int lFUCacheGet(LFUCache* obj, int key) { + +} + +void lFUCachePut(LFUCache* obj, int key, int value) { + +} + +void lFUCacheFree(LFUCache* obj) { + +} + +/** + * Your LFUCache struct will be instantiated and called as such: + * LFUCache* obj = lFUCacheCreate(capacity); + * int param_1 = lFUCacheGet(obj, key); + + * lFUCachePut(obj, key, value); + + * lFUCacheFree(obj); +*/","public class LFUCache { + + public LFUCache(int capacity) { + + } + + public int Get(int key) { + + } + + public void Put(int key, int value) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * LFUCache obj = new LFUCache(capacity); + * int param_1 = obj.Get(key); + * obj.Put(key,value); + */","/** + * @param {number} capacity + */ +var LFUCache = function(capacity) { + +}; + +/** + * @param {number} key + * @return {number} + */ +LFUCache.prototype.get = function(key) { + +}; + +/** + * @param {number} key + * @param {number} value + * @return {void} + */ +LFUCache.prototype.put = function(key, value) { + +}; + +/** + * Your LFUCache object will be instantiated and called as such: + * var obj = new LFUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","class LFUCache + +=begin + :type capacity: Integer +=end + def initialize(capacity) + + end + + +=begin + :type key: Integer + :rtype: Integer +=end + def get(key) + + end + + +=begin + :type key: Integer + :type value: Integer + :rtype: Void +=end + def put(key, value) + + end + + +end + +# Your LFUCache object will be instantiated and called as such: +# obj = LFUCache.new(capacity) +# param_1 = obj.get(key) +# obj.put(key, value)"," +class LFUCache { + + init(_ capacity: Int) { + + } + + func get(_ key: Int) -> Int { + + } + + func put(_ key: Int, _ value: Int) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * let obj = LFUCache(capacity) + * let ret_1: Int = obj.get(key) + * obj.put(key, value) + */","type LFUCache struct { + +} + + +func Constructor(capacity int) LFUCache { + +} + + +func (this *LFUCache) Get(key int) int { + +} + + +func (this *LFUCache) Put(key int, value int) { + +} + + +/** + * Your LFUCache object will be instantiated and called as such: + * obj := Constructor(capacity); + * param_1 := obj.Get(key); + * obj.Put(key,value); + */","class LFUCache(_capacity: Int) { + + def get(key: Int): Int = { + + } + + def put(key: Int, value: Int) { + + } + +} + +/** + * Your LFUCache object will be instantiated and called as such: + * var obj = new LFUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","class LFUCache(capacity: Int) { + + fun get(key: Int): Int { + + } + + fun put(key: Int, value: Int) { + + } + +} + +/** + * Your LFUCache object will be instantiated and called as such: + * var obj = LFUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","struct LFUCache { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl LFUCache { + + fn new(capacity: i32) -> Self { + + } + + fn get(&self, key: i32) -> i32 { + + } + + fn put(&self, key: i32, value: i32) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * let obj = LFUCache::new(capacity); + * let ret_1: i32 = obj.get(key); + * obj.put(key, value); + */","class LFUCache { + /** + * @param Integer $capacity + */ + function __construct($capacity) { + + } + + /** + * @param Integer $key + * @return Integer + */ + function get($key) { + + } + + /** + * @param Integer $key + * @param Integer $value + * @return NULL + */ + function put($key, $value) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * $obj = LFUCache($capacity); + * $ret_1 = $obj->get($key); + * $obj->put($key, $value); + */","class LFUCache { + constructor(capacity: number) { + + } + + get(key: number): number { + + } + + put(key: number, value: number): void { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * var obj = new LFUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","(define lfu-cache% + (class object% + (super-new) + + ; capacity : exact-integer? + (init-field + capacity) + + ; get : exact-integer? -> exact-integer? + (define/public (get key) + + ) + ; put : exact-integer? exact-integer? -> void? + (define/public (put key value) + + ))) + +;; Your lfu-cache% object will be instantiated and called as such: +;; (define obj (new lfu-cache% [capacity capacity])) +;; (define param_1 (send obj get key)) +;; (send obj put key value)","-spec lfu_cache_init_(Capacity :: integer()) -> any(). +lfu_cache_init_(Capacity) -> + . + +-spec lfu_cache_get(Key :: integer()) -> integer(). +lfu_cache_get(Key) -> + . + +-spec lfu_cache_put(Key :: integer(), Value :: integer()) -> any(). +lfu_cache_put(Key, Value) -> + . + + +%% Your functions will be called as such: +%% lfu_cache_init_(Capacity), +%% Param_1 = lfu_cache_get(Key), +%% lfu_cache_put(Key, Value), + +%% lfu_cache_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule LFUCache do + @spec init_(capacity :: integer) :: any + def init_(capacity) do + + end + + @spec get(key :: integer) :: integer + def get(key) do + + end + + @spec put(key :: integer, value :: integer) :: any + def put(key, value) do + + end +end + +# Your functions will be called as such: +# LFUCache.init_(capacity) +# param_1 = LFUCache.get(key) +# LFUCache.put(key, value) + +# LFUCache.init_ will be called before every test case, in which you can do some necessary initializations.","class LFUCache { + + LFUCache(int capacity) { + + } + + int get(int key) { + + } + + void put(int key, int value) { + + } +} + +/** + * Your LFUCache object will be instantiated and called as such: + * LFUCache obj = LFUCache(capacity); + * int param1 = obj.get(key); + * obj.put(key,value); + */", +1776,repeated-substring-pattern,Repeated Substring Pattern,459.0,459.0,"

Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.

+ +

 

+

Example 1:

+ +
+Input: s = "abab"
+Output: true
+Explanation: It is the substring "ab" twice.
+
+ +

Example 2:

+ +
+Input: s = "aba"
+Output: false
+
+ +

Example 3:

+ +
+Input: s = "abcabcabcabc"
+Output: true
+Explanation: It is the substring "abc" four times or the substring "abcabc" twice.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s consists of lowercase English letters.
    • +
+",1.0,False,"class Solution { +public: + bool repeatedSubstringPattern(string s) { + + } +};","class Solution { + public boolean repeatedSubstringPattern(String s) { + + } +}","class Solution(object): + def repeatedSubstringPattern(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def repeatedSubstringPattern(self, s: str) -> bool: + ","bool repeatedSubstringPattern(char * s){ + +}","public class Solution { + public bool RepeatedSubstringPattern(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var repeatedSubstringPattern = function(s) { + +};","# @param {String} s +# @return {Boolean} +def repeated_substring_pattern(s) + +end","class Solution { + func repeatedSubstringPattern(_ s: String) -> Bool { + + } +}","func repeatedSubstringPattern(s string) bool { + +}","object Solution { + def repeatedSubstringPattern(s: String): Boolean = { + + } +}","class Solution { + fun repeatedSubstringPattern(s: String): Boolean { + + } +}","impl Solution { + pub fn repeated_substring_pattern(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function repeatedSubstringPattern($s) { + + } +}","function repeatedSubstringPattern(s: string): boolean { + +};","(define/contract (repeated-substring-pattern s) + (-> string? boolean?) + + )","-spec repeated_substring_pattern(S :: unicode:unicode_binary()) -> boolean(). +repeated_substring_pattern(S) -> + .","defmodule Solution do + @spec repeated_substring_pattern(s :: String.t) :: boolean + def repeated_substring_pattern(s) do + + end +end","class Solution { + bool repeatedSubstringPattern(String s) { + + } +}", +1777,poor-pigs,Poor Pigs,458.0,458.0,"

There are buckets buckets of liquid, where exactly one of the buckets is poisonous. To figure out which one is poisonous, you feed some number of (poor) pigs the liquid to see whether they will die or not. Unfortunately, you only have minutesToTest minutes to determine which bucket is poisonous.

+ +

You can feed the pigs according to these steps:

+ +
    +
  1. Choose some live pigs to feed.
    2. +
  2. For each pig, choose which buckets to feed it. The pig will consume all the chosen buckets simultaneously and will take no time. Each pig can feed from any number of buckets, and each bucket can be fed from by any number of pigs.
    3. +
  3. Wait for minutesToDie minutes. You may not feed any other pigs during this time.
    4. +
  4. After minutesToDie minutes have passed, any pigs that have been fed the poisonous bucket will die, and all others will survive.
    5. +
  5. Repeat this process until you run out of time.
    6. +
+ +

Given buckets, minutesToDie, and minutesToTest, return the minimum number of pigs needed to figure out which bucket is poisonous within the allotted time.

+ +

 

+

Example 1:

+ +
+Input: buckets = 4, minutesToDie = 15, minutesToTest = 15
+Output: 2
+Explanation: We can determine the poisonous bucket as follows:
+At time 0, feed the first pig buckets 1 and 2, and feed the second pig buckets 2 and 3.
+At time 15, there are 4 possible outcomes:
+- If only the first pig dies, then bucket 1 must be poisonous.
+- If only the second pig dies, then bucket 3 must be poisonous.
+- If both pigs die, then bucket 2 must be poisonous.
+- If neither pig dies, then bucket 4 must be poisonous.
+
+ +

Example 2:

+ +
+Input: buckets = 4, minutesToDie = 15, minutesToTest = 30
+Output: 2
+Explanation: We can determine the poisonous bucket as follows:
+At time 0, feed the first pig bucket 1, and feed the second pig bucket 2.
+At time 15, there are 2 possible outcomes:
+- If either pig dies, then the poisonous bucket is the one it was fed.
+- If neither pig dies, then feed the first pig bucket 3, and feed the second pig bucket 4.
+At time 30, one of the two pigs must die, and the poisonous bucket is the one it was fed.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= buckets <= 1000
    • +
  • 1 <= minutesToDie <= minutesToTest <= 100
    • +
+",3.0,False,"class Solution { +public: + int poorPigs(int buckets, int minutesToDie, int minutesToTest) { + + } +};","class Solution { + public int poorPigs(int buckets, int minutesToDie, int minutesToTest) { + + } +}","class Solution(object): + def poorPigs(self, buckets, minutesToDie, minutesToTest): + """""" + :type buckets: int + :type minutesToDie: int + :type minutesToTest: int + :rtype: int + """""" + ","class Solution: + def poorPigs(self, buckets: int, minutesToDie: int, minutesToTest: int) -> int: + ","int poorPigs(int buckets, int minutesToDie, int minutesToTest){ + +}","public class Solution { + public int PoorPigs(int buckets, int minutesToDie, int minutesToTest) { + + } +}","/** + * @param {number} buckets + * @param {number} minutesToDie + * @param {number} minutesToTest + * @return {number} + */ +var poorPigs = function(buckets, minutesToDie, minutesToTest) { + +};","# @param {Integer} buckets +# @param {Integer} minutes_to_die +# @param {Integer} minutes_to_test +# @return {Integer} +def poor_pigs(buckets, minutes_to_die, minutes_to_test) + +end","class Solution { + func poorPigs(_ buckets: Int, _ minutesToDie: Int, _ minutesToTest: Int) -> Int { + + } +}","func poorPigs(buckets int, minutesToDie int, minutesToTest int) int { + +}","object Solution { + def poorPigs(buckets: Int, minutesToDie: Int, minutesToTest: Int): Int = { + + } +}","class Solution { + fun poorPigs(buckets: Int, minutesToDie: Int, minutesToTest: Int): Int { + + } +}","impl Solution { + pub fn poor_pigs(buckets: i32, minutes_to_die: i32, minutes_to_test: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $buckets + * @param Integer $minutesToDie + * @param Integer $minutesToTest + * @return Integer + */ + function poorPigs($buckets, $minutesToDie, $minutesToTest) { + + } +}","function poorPigs(buckets: number, minutesToDie: number, minutesToTest: number): number { + +};","(define/contract (poor-pigs buckets minutesToDie minutesToTest) + (-> exact-integer? exact-integer? exact-integer? exact-integer?) + + )","-spec poor_pigs(Buckets :: integer(), MinutesToDie :: integer(), MinutesToTest :: integer()) -> integer(). +poor_pigs(Buckets, MinutesToDie, MinutesToTest) -> + .","defmodule Solution do + @spec poor_pigs(buckets :: integer, minutes_to_die :: integer, minutes_to_test :: integer) :: integer + def poor_pigs(buckets, minutes_to_die, minutes_to_test) do + + end +end","class Solution { + int poorPigs(int buckets, int minutesToDie, int minutesToTest) { + + } +}", +1781,4sum-ii,4Sum II,454.0,454.0,"

Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that:

+ +
    +
  • 0 <= i, j, k, l < n
    • +
  • nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0
    • +
+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2]
+Output: 2
+Explanation:
+The two tuples are:
+1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
+2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
+
+ +

Example 2:

+ +
+Input: nums1 = [0], nums2 = [0], nums3 = [0], nums4 = [0]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length
    • +
  • n == nums2.length
    • +
  • n == nums3.length
    • +
  • n == nums4.length
    • +
  • 1 <= n <= 200
    • +
  • -228 <= nums1[i], nums2[i], nums3[i], nums4[i] <= 228
    • +
+",2.0,False,"class Solution { +public: + int fourSumCount(vector& nums1, vector& nums2, vector& nums3, vector& nums4) { + + } +};","class Solution { + public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) { + + } +}","class Solution(object): + def fourSumCount(self, nums1, nums2, nums3, nums4): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type nums3: List[int] + :type nums4: List[int] + :rtype: int + """""" + ","class Solution: + def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int: + ","int fourSumCount(int* nums1, int nums1Size, int* nums2, int nums2Size, int* nums3, int nums3Size, int* nums4, int nums4Size){ + +}","public class Solution { + public int FourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number[]} nums3 + * @param {number[]} nums4 + * @return {number} + */ +var fourSumCount = function(nums1, nums2, nums3, nums4) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer[]} nums3 +# @param {Integer[]} nums4 +# @return {Integer} +def four_sum_count(nums1, nums2, nums3, nums4) + +end","class Solution { + func fourSumCount(_ nums1: [Int], _ nums2: [Int], _ nums3: [Int], _ nums4: [Int]) -> Int { + + } +}","func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int { + +}","object Solution { + def fourSumCount(nums1: Array[Int], nums2: Array[Int], nums3: Array[Int], nums4: Array[Int]): Int = { + + } +}","class Solution { + fun fourSumCount(nums1: IntArray, nums2: IntArray, nums3: IntArray, nums4: IntArray): Int { + + } +}","impl Solution { + pub fn four_sum_count(nums1: Vec, nums2: Vec, nums3: Vec, nums4: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer[] $nums3 + * @param Integer[] $nums4 + * @return Integer + */ + function fourSumCount($nums1, $nums2, $nums3, $nums4) { + + } +}","function fourSumCount(nums1: number[], nums2: number[], nums3: number[], nums4: number[]): number { + +};","(define/contract (four-sum-count nums1 nums2 nums3 nums4) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec four_sum_count(Nums1 :: [integer()], Nums2 :: [integer()], Nums3 :: [integer()], Nums4 :: [integer()]) -> integer(). +four_sum_count(Nums1, Nums2, Nums3, Nums4) -> + .","defmodule Solution do + @spec four_sum_count(nums1 :: [integer], nums2 :: [integer], nums3 :: [integer], nums4 :: [integer]) :: integer + def four_sum_count(nums1, nums2, nums3, nums4) do + + end +end","class Solution { + int fourSumCount(List nums1, List nums2, List nums3, List nums4) { + + } +}", +1782,minimum-moves-to-equal-array-elements,Minimum Moves to Equal Array Elements,453.0,453.0,"

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

+ +

In one move, you can increment n - 1 elements of the array by 1.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3]
+Output: 3
+Explanation: Only three moves are needed (remember each move increments two elements):
+[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
  • The answer is guaranteed to fit in a 32-bit integer.
    • +
+",2.0,False,"class Solution { +public: + int minMoves(vector& nums) { + + } +};","class Solution { + public int minMoves(int[] nums) { + + } +}","class Solution(object): + def minMoves(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minMoves(self, nums: List[int]) -> int: + ","int minMoves(int* nums, int numsSize){ + +}","public class Solution { + public int MinMoves(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var minMoves = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def min_moves(nums) + +end","class Solution { + func minMoves(_ nums: [Int]) -> Int { + + } +}","func minMoves(nums []int) int { + +}","object Solution { + def minMoves(nums: Array[Int]): Int = { + + } +}","class Solution { + fun minMoves(nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_moves(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function minMoves($nums) { + + } +}","function minMoves(nums: number[]): number { + +};","(define/contract (min-moves nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec min_moves(Nums :: [integer()]) -> integer(). +min_moves(Nums) -> + .","defmodule Solution do + @spec min_moves(nums :: [integer]) :: integer + def min_moves(nums) do + + end +end","class Solution { + int minMoves(List nums) { + + } +}", +1784,sort-characters-by-frequency,Sort Characters By Frequency,451.0,451.0,"

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

+ +

Return the sorted string. If there are multiple answers, return any of them.

+ +

 

+

Example 1:

+ +
+Input: s = "tree"
+Output: "eert"
+Explanation: 'e' appears twice while 'r' and 't' both appear once.
+So 'e' must appear before both 'r' and 't'. Therefore "eetr" is also a valid answer.
+
+ +

Example 2:

+ +
+Input: s = "cccaaa"
+Output: "aaaccc"
+Explanation: Both 'c' and 'a' appear three times, so both "cccaaa" and "aaaccc" are valid answers.
+Note that "cacaca" is incorrect, as the same characters must be together.
+
+ +

Example 3:

+ +
+Input: s = "Aabb"
+Output: "bbAa"
+Explanation: "bbaA" is also a valid answer, but "Aabb" is incorrect.
+Note that 'A' and 'a' are treated as two different characters.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 5 * 105
    • +
  • s consists of uppercase and lowercase English letters and digits.
    • +
+",2.0,False,"class Solution { +public: + string frequencySort(string s) { + + } +};","class Solution { + public String frequencySort(String s) { + + } +}","class Solution(object): + def frequencySort(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def frequencySort(self, s: str) -> str: + ","char * frequencySort(char * s){ + +}","public class Solution { + public string FrequencySort(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var frequencySort = function(s) { + +};","# @param {String} s +# @return {String} +def frequency_sort(s) + +end","class Solution { + func frequencySort(_ s: String) -> String { + + } +}","func frequencySort(s string) string { + +}","object Solution { + def frequencySort(s: String): String = { + + } +}","class Solution { + fun frequencySort(s: String): String { + + } +}","impl Solution { + pub fn frequency_sort(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function frequencySort($s) { + + } +}","function frequencySort(s: string): string { + +};","(define/contract (frequency-sort s) + (-> string? string?) + + )","-spec frequency_sort(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +frequency_sort(S) -> + .","defmodule Solution do + @spec frequency_sort(s :: String.t) :: String.t + def frequency_sort(s) do + + end +end","class Solution { + String frequencySort(String s) { + + } +}", +1786,serialize-and-deserialize-bst,Serialize and Deserialize BST,449.0,449.0,"

Serialization is converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

+ +

Design an algorithm to serialize and deserialize a binary search tree. There is no restriction on how your serialization/deserialization algorithm should work. You need to ensure that a binary search tree can be serialized to a string, and this string can be deserialized to the original tree structure.

+ +

The encoded string should be as compact as possible.

+ +

 

+

Example 1:

+
Input: root = [2,1,3]
+Output: [2,1,3]
+

Example 2:

+
Input: root = []
+Output: []
+
+

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 104].
    • +
  • 0 <= Node.val <= 104
    • +
  • The input tree is guaranteed to be a binary search tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode(int x) : val(x), left(NULL), right(NULL) {} + * }; + */ +class Codec { +public: + + // Encodes a tree to a single string. + string serialize(TreeNode* root) { + + } + + // Decodes your encoded data to tree. + TreeNode* deserialize(string data) { + + } +}; + +// Your Codec object will be instantiated and called as such: +// Codec* ser = new Codec(); +// Codec* deser = new Codec(); +// string tree = ser->serialize(root); +// TreeNode* ans = deser->deserialize(tree); +// return ans;","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ +public class Codec { + + // Encodes a tree to a single string. + public String serialize(TreeNode root) { + + } + + // Decodes your encoded data to tree. + public TreeNode deserialize(String data) { + + } +} + +// Your Codec object will be instantiated and called as such: +// Codec ser = new Codec(); +// Codec deser = new Codec(); +// String tree = ser.serialize(root); +// TreeNode ans = deser.deserialize(tree); +// return ans;","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Codec: + + def serialize(self, root): + """"""Encodes a tree to a single string. + + :type root: TreeNode + :rtype: str + """""" + + + def deserialize(self, data): + """"""Decodes your encoded data to tree. + + :type data: str + :rtype: TreeNode + """""" + + +# Your Codec object will be instantiated and called as such: +# ser = Codec() +# deser = Codec() +# tree = ser.serialize(root) +# ans = deser.deserialize(tree) +# return ans","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Codec: + + def serialize(self, root: Optional[TreeNode]) -> str: + """"""Encodes a tree to a single string. + """""" + + + def deserialize(self, data: str) -> Optional[TreeNode]: + """"""Decodes your encoded data to tree. + """""" + + +# Your Codec object will be instantiated and called as such: +# Your Codec object will be instantiated and called as such: +# ser = Codec() +# deser = Codec() +# tree = ser.serialize(root) +# ans = deser.deserialize(tree) +# return ans","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** Encodes a tree to a single string. */ +char* serialize(struct TreeNode* root) { + +} + +/** Decodes your encoded data to tree. */ +struct TreeNode* deserialize(char* data) { + +} + +// Your functions will be called as such: +// char* data = serialize(root); +// deserialize(data);","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int x) { val = x; } + * } + */ +public class Codec { + + // Encodes a tree to a single string. + public string serialize(TreeNode root) { + + } + + // Decodes your encoded data to tree. + public TreeNode deserialize(string data) { + + } +} + +// Your Codec object will be instantiated and called as such: +// Codec ser = new Codec(); +// Codec deser = new Codec(); +// String tree = ser.serialize(root); +// TreeNode ans = deser.deserialize(tree); +// return ans;","/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ + +/** + * Encodes a tree to a single string. + * + * @param {TreeNode} root + * @return {string} + */ +var serialize = function(root) { + +}; + +/** + * Decodes your encoded data to tree. + * + * @param {string} data + * @return {TreeNode} + */ +var deserialize = function(data) { + +}; + +/** + * Your functions will be called as such: + * deserialize(serialize(root)); + */","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val) +# @val = val +# @left, @right = nil, nil +# end +# end + +# Encodes a tree to a single string. +# +# @param {TreeNode} root +# @return {string} +def serialize(root) + +end + +# Decodes your encoded data to tree. +# +# @param {string} data +# @return {TreeNode} +def deserialize(data) + +end + + +# Your functions will be called as such: +# deserialize(serialize(data))","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init(_ val: Int) { + * self.val = val + * self.left = nil + * self.right = nil + * } + * } + */ + +class Codec { + // Encodes a tree to a single string. + func serialize(_ root: TreeNode?) -> String { + + } + + // Decodes your encoded data to tree. + func deserialize(_ data: String) -> TreeNode? { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * let ser = Codec() + * let deser = Codec() + * let tree: String = ser.serialize(root) + * let ans = deser.deserialize(tree) + * return ans +*/","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ + +type Codec struct { + +} + +func Constructor() Codec { + +} + +// Serializes a tree to a single string. +func (this *Codec) serialize(root *TreeNode) string { + +} + +// Deserializes your encoded data to tree. +func (this *Codec) deserialize(data string) *TreeNode { + +} + + +/** + * Your Codec object will be instantiated and called as such: + * ser := Constructor() + * deser := Constructor() + * tree := ser.serialize(root) + * ans := deser.deserialize(tree) + * return ans + */","/** + * Definition for a binary tree node. + * class TreeNode(var _value: Int) { + * var value: Int = _value + * var left: TreeNode = null + * var right: TreeNode = null + * } + */ + +class Codec { + // Encodes a tree to a single string. + def serialize(root: TreeNode): String = { + + } + + // Decodes your encoded data to tree. + def deserialize(data: String): TreeNode = { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * val ser = new Codec() + * val deser = new Codec() + * val tree: String = ser.serialize(root) + * val ans = deser.deserialize(tree) + * return ans + */","/** + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ + +class Codec() { + // Encodes a tree to a single string. + fun serialize(root: TreeNode?): String { + + } + + // Decodes your encoded data to tree. + fun deserialize(data: String): TreeNode? { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * val ser = Codec() + * val deser = Codec() + * val tree: String = ser.serialize(root) + * val ans = deser.deserialize(tree) + * return ans + */","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +struct Codec { + +} + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Codec { + fn new() -> Self { + + } + + fn serialize(&self, root: Option>>) -> String { + + } + + fn deserialize(&self, data: String) -> Option>> { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * let obj = Codec::new(); + * let data: String = obj.serialize(strs); + * let ans: Option>> = obj.deserialize(data); + */","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($value) { $this->val = $value; } + * } + */ + +class Codec { + function __construct() { + + } + + /** + * @param TreeNode $root + * @return String + */ + function serialize($root) { + + } + + /** + * @param String $data + * @return TreeNode + */ + function deserialize($data) { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * $ser = new Codec(); + * $tree = $ser->serialize($param_1); + * $deser = new Codec(); + * $ret = $deser->deserialize($tree); + * return $ret; + */","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +/* + * Encodes a tree to a single string. + */ +function serialize(root: TreeNode | null): string { + +}; + +/* + * Decodes your encoded data to tree. + */ +function deserialize(data: string): TreeNode | null { + +}; + + +/** + * Your functions will be called as such: + * deserialize(serialize(root)); + */",,,,, +1788,number-of-boomerangs,Number of Boomerangs,447.0,447.0,"

You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).

+ +

Return the number of boomerangs.

+ +

 

+

Example 1:

+ +
+Input: points = [[0,0],[1,0],[2,0]]
+Output: 2
+Explanation: The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]].
+
+ +

Example 2:

+ +
+Input: points = [[1,1],[2,2],[3,3]]
+Output: 2
+
+ +

Example 3:

+ +
+Input: points = [[1,1]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • n == points.length
    • +
  • 1 <= n <= 500
    • +
  • points[i].length == 2
    • +
  • -104 <= xi, yi <= 104
    • +
  • All the points are unique.
    • +
+",2.0,False,"class Solution { +public: + int numberOfBoomerangs(vector>& points) { + + } +};","class Solution { + public int numberOfBoomerangs(int[][] points) { + + } +}","class Solution(object): + def numberOfBoomerangs(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def numberOfBoomerangs(self, points: List[List[int]]) -> int: + ","int numberOfBoomerangs(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int NumberOfBoomerangs(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var numberOfBoomerangs = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def number_of_boomerangs(points) + +end","class Solution { + func numberOfBoomerangs(_ points: [[Int]]) -> Int { + + } +}","func numberOfBoomerangs(points [][]int) int { + +}","object Solution { + def numberOfBoomerangs(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun numberOfBoomerangs(points: Array): Int { + + } +}","impl Solution { + pub fn number_of_boomerangs(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function numberOfBoomerangs($points) { + + } +}","function numberOfBoomerangs(points: number[][]): number { + +};","(define/contract (number-of-boomerangs points) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec number_of_boomerangs(Points :: [[integer()]]) -> integer(). +number_of_boomerangs(Points) -> + .","defmodule Solution do + @spec number_of_boomerangs(points :: [[integer]]) :: integer + def number_of_boomerangs(points) do + + end +end","class Solution { + int numberOfBoomerangs(List> points) { + + } +}", +1789,arithmetic-slices-ii-subsequence,Arithmetic Slices II - Subsequence,446.0,446.0,"

Given an integer array nums, return the number of all the arithmetic subsequences of nums.

+ +

A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

+ +
    +
  • For example, [1, 3, 5, 7, 9], [7, 7, 7, 7], and [3, -1, -5, -9] are arithmetic sequences.
    • +
  • For example, [1, 1, 2, 5, 7] is not an arithmetic sequence.
    • +
+ +

A subsequence of an array is a sequence that can be formed by removing some elements (possibly none) of the array.

+ +
    +
  • For example, [2,5,10] is a subsequence of [1,2,1,2,4,1,5,10].
    • +
+ +

The test cases are generated so that the answer fits in 32-bit integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,4,6,8,10]
+Output: 7
+Explanation: All arithmetic subsequence slices are:
+[2,4,6]
+[4,6,8]
+[6,8,10]
+[2,4,6,8]
+[4,6,8,10]
+[2,4,6,8,10]
+[2,6,10]
+
+ +

Example 2:

+ +
+Input: nums = [7,7,7,7,7]
+Output: 16
+Explanation: Any subsequence of this array is arithmetic.
+
+ +

 

+

Constraints:

+ +
    +
  • 1  <= nums.length <= 1000
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + int numberOfArithmeticSlices(vector& nums) { + + } +};","class Solution { + public int numberOfArithmeticSlices(int[] nums) { + + } +}","class Solution(object): + def numberOfArithmeticSlices(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numberOfArithmeticSlices(self, nums: List[int]) -> int: + ","int numberOfArithmeticSlices(int* nums, int numsSize){ + +}","public class Solution { + public int NumberOfArithmeticSlices(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numberOfArithmeticSlices = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def number_of_arithmetic_slices(nums) + +end","class Solution { + func numberOfArithmeticSlices(_ nums: [Int]) -> Int { + + } +}","func numberOfArithmeticSlices(nums []int) int { + +}","object Solution { + def numberOfArithmeticSlices(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numberOfArithmeticSlices(nums: IntArray): Int { + + } +}","impl Solution { + pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numberOfArithmeticSlices($nums) { + + } +}","function numberOfArithmeticSlices(nums: number[]): number { + +};","(define/contract (number-of-arithmetic-slices nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec number_of_arithmetic_slices(Nums :: [integer()]) -> integer(). +number_of_arithmetic_slices(Nums) -> + .","defmodule Solution do + @spec number_of_arithmetic_slices(nums :: [integer]) :: integer + def number_of_arithmetic_slices(nums) do + + end +end","class Solution { + int numberOfArithmeticSlices(List nums) { + + } +}", +1790,add-two-numbers-ii,Add Two Numbers II,445.0,445.0,"

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

+ +

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

+ +

 

+

Example 1:

+ +
+Input: l1 = [7,2,4,3], l2 = [5,6,4]
+Output: [7,8,0,7]
+
+ +

Example 2:

+ +
+Input: l1 = [2,4,3], l2 = [5,6,4]
+Output: [8,0,7]
+
+ +

Example 3:

+ +
+Input: l1 = [0], l2 = [0]
+Output: [0]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in each linked list is in the range [1, 100].
    • +
  • 0 <= Node.val <= 9
    • +
  • It is guaranteed that the list represents a number that does not have leading zeros.
    • +
+ +

 

+

Follow up: Could you solve it without reversing the input lists?

+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode addTwoNumbers(ListNode l1, ListNode l2) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def addTwoNumbers(self, l1, l2): + """""" + :type l1: ListNode + :type l2: ListNode + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode AddTwoNumbers(ListNode l1, ListNode l2) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} l1 + * @param {ListNode} l2 + * @return {ListNode} + */ +var addTwoNumbers = function(l1, l2) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} l1 +# @param {ListNode} l2 +# @return {ListNode} +def add_two_numbers(l1, l2) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func addTwoNumbers(_ l1: ListNode?, _ l2: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def addTwoNumbers(l1: ListNode, l2: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun addTwoNumbers(l1: ListNode?, l2: ListNode?): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn add_two_numbers(l1: Option>, l2: Option>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $l1 + * @param ListNode $l2 + * @return ListNode + */ + function addTwoNumbers($l1, $l2) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (add-two-numbers l1 l2) + (-> (or/c list-node? #f) (or/c list-node? #f) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec add_two_numbers(L1 :: #list_node{} | null, L2 :: #list_node{} | null) -> #list_node{} | null. +add_two_numbers(L1, L2) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec add_two_numbers(l1 :: ListNode.t | nil, l2 :: ListNode.t | nil) :: ListNode.t | nil + def add_two_numbers(l1, l2) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? addTwoNumbers(ListNode? l1, ListNode? l2) { + + } +}", +1794,k-th-smallest-in-lexicographical-order,K-th Smallest in Lexicographical Order,440.0,440.0,"

Given two integers n and k, return the kth lexicographically smallest integer in the range [1, n].

+ +

 

+

Example 1:

+ +
+Input: n = 13, k = 2
+Output: 10
+Explanation: The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10.
+
+ +

Example 2:

+ +
+Input: n = 1, k = 1
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int findKthNumber(int n, int k) { + + } +};","class Solution { + public int findKthNumber(int n, int k) { + + } +}","class Solution(object): + def findKthNumber(self, n, k): + """""" + :type n: int + :type k: int + :rtype: int + """""" + ","class Solution: + def findKthNumber(self, n: int, k: int) -> int: + ","int findKthNumber(int n, int k){ + +}","public class Solution { + public int FindKthNumber(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {number} + */ +var findKthNumber = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {Integer} +def find_kth_number(n, k) + +end","class Solution { + func findKthNumber(_ n: Int, _ k: Int) -> Int { + + } +}","func findKthNumber(n int, k int) int { + +}","object Solution { + def findKthNumber(n: Int, k: Int): Int = { + + } +}","class Solution { + fun findKthNumber(n: Int, k: Int): Int { + + } +}","impl Solution { + pub fn find_kth_number(n: i32, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return Integer + */ + function findKthNumber($n, $k) { + + } +}","function findKthNumber(n: number, k: number): number { + +};","(define/contract (find-kth-number n k) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec find_kth_number(N :: integer(), K :: integer()) -> integer(). +find_kth_number(N, K) -> + .","defmodule Solution do + @spec find_kth_number(n :: integer, k :: integer) :: integer + def find_kth_number(n, k) do + + end +end","class Solution { + int findKthNumber(int n, int k) { + + } +}", +1797,find-right-interval,Find Right Interval,436.0,436.0,"

You are given an array of intervals, where intervals[i] = [starti, endi] and each starti is unique.

+ +

The right interval for an interval i is an interval j such that startj >= endi and startj is minimized. Note that i may equal j.

+ +

Return an array of right interval indices for each interval i. If no right interval exists for interval i, then put -1 at index i.

+ +

 

+

Example 1:

+ +
+Input: intervals = [[1,2]]
+Output: [-1]
+Explanation: There is only one interval in the collection, so it outputs -1.
+
+ +

Example 2:

+ +
+Input: intervals = [[3,4],[2,3],[1,2]]
+Output: [-1,0,1]
+Explanation: There is no right interval for [3,4].
+The right interval for [2,3] is [3,4] since start0 = 3 is the smallest start that is >= end1 = 3.
+The right interval for [1,2] is [2,3] since start1 = 2 is the smallest start that is >= end2 = 2.
+
+ +

Example 3:

+ +
+Input: intervals = [[1,4],[2,3],[3,4]]
+Output: [-1,2,-1]
+Explanation: There is no right interval for [1,4] and [3,4].
+The right interval for [2,3] is [3,4] since start2 = 3 is the smallest start that is >= end1 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= intervals.length <= 2 * 104
    • +
  • intervals[i].length == 2
    • +
  • -106 <= starti <= endi <= 106
    • +
  • The start point of each interval is unique.
    • +
+",2.0,False,"class Solution { +public: + vector findRightInterval(vector>& intervals) { + + } +};","class Solution { + public int[] findRightInterval(int[][] intervals) { + + } +}","class Solution(object): + def findRightInterval(self, intervals): + """""" + :type intervals: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def findRightInterval(self, intervals: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findRightInterval(int** intervals, int intervalsSize, int* intervalsColSize, int* returnSize){ + +}","public class Solution { + public int[] FindRightInterval(int[][] intervals) { + + } +}","/** + * @param {number[][]} intervals + * @return {number[]} + */ +var findRightInterval = function(intervals) { + +};","# @param {Integer[][]} intervals +# @return {Integer[]} +def find_right_interval(intervals) + +end","class Solution { + func findRightInterval(_ intervals: [[Int]]) -> [Int] { + + } +}","func findRightInterval(intervals [][]int) []int { + +}","object Solution { + def findRightInterval(intervals: Array[Array[Int]]): Array[Int] = { + + } +}","class Solution { + fun findRightInterval(intervals: Array): IntArray { + + } +}","impl Solution { + pub fn find_right_interval(intervals: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $intervals + * @return Integer[] + */ + function findRightInterval($intervals) { + + } +}","function findRightInterval(intervals: number[][]): number[] { + +};","(define/contract (find-right-interval intervals) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec find_right_interval(Intervals :: [[integer()]]) -> [integer()]. +find_right_interval(Intervals) -> + .","defmodule Solution do + @spec find_right_interval(intervals :: [[integer]]) :: [integer] + def find_right_interval(intervals) do + + end +end","class Solution { + List findRightInterval(List> intervals) { + + } +}", +1800,minimum-genetic-mutation,Minimum Genetic Mutation,433.0,433.0,"

A gene string can be represented by an 8-character long string, with choices from 'A', 'C', 'G', and 'T'.

+ +

Suppose we need to investigate a mutation from a gene string startGene to a gene string endGene where one mutation is defined as one single character changed in the gene string.

+ +
    +
  • For example, "AACCGGTT" --> "AACCGGTA" is one mutation.
    • +
+ +

There is also a gene bank bank that records all the valid gene mutations. A gene must be in bank to make it a valid gene string.

+ +

Given the two gene strings startGene and endGene and the gene bank bank, return the minimum number of mutations needed to mutate from startGene to endGene. If there is no such a mutation, return -1.

+ +

Note that the starting point is assumed to be valid, so it might not be included in the bank.

+ +

 

+

Example 1:

+ +
+Input: startGene = "AACCGGTT", endGene = "AACCGGTA", bank = ["AACCGGTA"]
+Output: 1
+
+ +

Example 2:

+ +
+Input: startGene = "AACCGGTT", endGene = "AAACGGTA", bank = ["AACCGGTA","AACCGCTA","AAACGGTA"]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= bank.length <= 10
    • +
  • startGene.length == endGene.length == bank[i].length == 8
    • +
  • startGene, endGene, and bank[i] consist of only the characters ['A', 'C', 'G', 'T'].
    • +
+",2.0,False,"class Solution { +public: + int minMutation(string startGene, string endGene, vector& bank) { + + } +};","class Solution { + public int minMutation(String startGene, String endGene, String[] bank) { + + } +}","class Solution(object): + def minMutation(self, startGene, endGene, bank): + """""" + :type startGene: str + :type endGene: str + :type bank: List[str] + :rtype: int + """""" + ","class Solution: + def minMutation(self, startGene: str, endGene: str, bank: List[str]) -> int: + ","int minMutation(char * startGene, char * endGene, char ** bank, int bankSize){ + +}","public class Solution { + public int MinMutation(string startGene, string endGene, string[] bank) { + + } +}","/** + * @param {string} startGene + * @param {string} endGene + * @param {string[]} bank + * @return {number} + */ +var minMutation = function(startGene, endGene, bank) { + +};","# @param {String} start_gene +# @param {String} end_gene +# @param {String[]} bank +# @return {Integer} +def min_mutation(start_gene, end_gene, bank) + +end","class Solution { + func minMutation(_ startGene: String, _ endGene: String, _ bank: [String]) -> Int { + + } +}","func minMutation(startGene string, endGene string, bank []string) int { + +}","object Solution { + def minMutation(startGene: String, endGene: String, bank: Array[String]): Int = { + + } +}","class Solution { + fun minMutation(startGene: String, endGene: String, bank: Array): Int { + + } +}","impl Solution { + pub fn min_mutation(start_gene: String, end_gene: String, bank: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $startGene + * @param String $endGene + * @param String[] $bank + * @return Integer + */ + function minMutation($startGene, $endGene, $bank) { + + } +}","function minMutation(startGene: string, endGene: string, bank: string[]): number { + +};","(define/contract (min-mutation startGene endGene bank) + (-> string? string? (listof string?) exact-integer?) + + )","-spec min_mutation(StartGene :: unicode:unicode_binary(), EndGene :: unicode:unicode_binary(), Bank :: [unicode:unicode_binary()]) -> integer(). +min_mutation(StartGene, EndGene, Bank) -> + .","defmodule Solution do + @spec min_mutation(start_gene :: String.t, end_gene :: String.t, bank :: [String.t]) :: integer + def min_mutation(start_gene, end_gene, bank) do + + end +end","class Solution { + int minMutation(String startGene, String endGene, List bank) { + + } +}", +1801,all-oone-data-structure,All O`one Data Structure,432.0,432.0,"

Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts.

+ +

Implement the AllOne class:

+ +
    +
  • AllOne() Initializes the object of the data structure.
    • +
  • inc(String key) Increments the count of the string key by 1. If key does not exist in the data structure, insert it with count 1.
    • +
  • dec(String key) Decrements the count of the string key by 1. If the count of key is 0 after the decrement, remove it from the data structure. It is guaranteed that key exists in the data structure before the decrement.
    • +
  • getMaxKey() Returns one of the keys with the maximal count. If no element exists, return an empty string "".
    • +
  • getMinKey() Returns one of the keys with the minimum count. If no element exists, return an empty string "".
    • +
+ +

Note that each function must run in O(1) average time complexity.

+ +

 

+

Example 1:

+ +
+Input
+["AllOne", "inc", "inc", "getMaxKey", "getMinKey", "inc", "getMaxKey", "getMinKey"]
+[[], ["hello"], ["hello"], [], [], ["leet"], [], []]
+Output
+[null, null, null, "hello", "hello", null, "hello", "leet"]
+
+Explanation
+AllOne allOne = new AllOne();
+allOne.inc("hello");
+allOne.inc("hello");
+allOne.getMaxKey(); // return "hello"
+allOne.getMinKey(); // return "hello"
+allOne.inc("leet");
+allOne.getMaxKey(); // return "hello"
+allOne.getMinKey(); // return "leet"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= key.length <= 10
    • +
  • key consists of lowercase English letters.
    • +
  • It is guaranteed that for each call to dec, key is existing in the data structure.
    • +
  • At most 5 * 104 calls will be made to inc, dec, getMaxKey, and getMinKey.
    • +
+",3.0,False,"class AllOne { +public: + AllOne() { + + } + + void inc(string key) { + + } + + void dec(string key) { + + } + + string getMaxKey() { + + } + + string getMinKey() { + + } +}; + +/** + * Your AllOne object will be instantiated and called as such: + * AllOne* obj = new AllOne(); + * obj->inc(key); + * obj->dec(key); + * string param_3 = obj->getMaxKey(); + * string param_4 = obj->getMinKey(); + */","class AllOne { + + public AllOne() { + + } + + public void inc(String key) { + + } + + public void dec(String key) { + + } + + public String getMaxKey() { + + } + + public String getMinKey() { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * AllOne obj = new AllOne(); + * obj.inc(key); + * obj.dec(key); + * String param_3 = obj.getMaxKey(); + * String param_4 = obj.getMinKey(); + */","class AllOne(object): + + def __init__(self): + + + def inc(self, key): + """""" + :type key: str + :rtype: None + """""" + + + def dec(self, key): + """""" + :type key: str + :rtype: None + """""" + + + def getMaxKey(self): + """""" + :rtype: str + """""" + + + def getMinKey(self): + """""" + :rtype: str + """""" + + + +# Your AllOne object will be instantiated and called as such: +# obj = AllOne() +# obj.inc(key) +# obj.dec(key) +# param_3 = obj.getMaxKey() +# param_4 = obj.getMinKey()","class AllOne: + + def __init__(self): + + + def inc(self, key: str) -> None: + + + def dec(self, key: str) -> None: + + + def getMaxKey(self) -> str: + + + def getMinKey(self) -> str: + + + +# Your AllOne object will be instantiated and called as such: +# obj = AllOne() +# obj.inc(key) +# obj.dec(key) +# param_3 = obj.getMaxKey() +# param_4 = obj.getMinKey()"," + + +typedef struct { + +} AllOne; + + +AllOne* allOneCreate() { + +} + +void allOneInc(AllOne* obj, char * key) { + +} + +void allOneDec(AllOne* obj, char * key) { + +} + +char * allOneGetMaxKey(AllOne* obj) { + +} + +char * allOneGetMinKey(AllOne* obj) { + +} + +void allOneFree(AllOne* obj) { + +} + +/** + * Your AllOne struct will be instantiated and called as such: + * AllOne* obj = allOneCreate(); + * allOneInc(obj, key); + + * allOneDec(obj, key); + + * char * param_3 = allOneGetMaxKey(obj); + + * char * param_4 = allOneGetMinKey(obj); + + * allOneFree(obj); +*/","public class AllOne { + + public AllOne() { + + } + + public void Inc(string key) { + + } + + public void Dec(string key) { + + } + + public string GetMaxKey() { + + } + + public string GetMinKey() { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * AllOne obj = new AllOne(); + * obj.Inc(key); + * obj.Dec(key); + * string param_3 = obj.GetMaxKey(); + * string param_4 = obj.GetMinKey(); + */"," +var AllOne = function() { + +}; + +/** + * @param {string} key + * @return {void} + */ +AllOne.prototype.inc = function(key) { + +}; + +/** + * @param {string} key + * @return {void} + */ +AllOne.prototype.dec = function(key) { + +}; + +/** + * @return {string} + */ +AllOne.prototype.getMaxKey = function() { + +}; + +/** + * @return {string} + */ +AllOne.prototype.getMinKey = function() { + +}; + +/** + * Your AllOne object will be instantiated and called as such: + * var obj = new AllOne() + * obj.inc(key) + * obj.dec(key) + * var param_3 = obj.getMaxKey() + * var param_4 = obj.getMinKey() + */","class AllOne + def initialize() + + end + + +=begin + :type key: String + :rtype: Void +=end + def inc(key) + + end + + +=begin + :type key: String + :rtype: Void +=end + def dec(key) + + end + + +=begin + :rtype: String +=end + def get_max_key() + + end + + +=begin + :rtype: String +=end + def get_min_key() + + end + + +end + +# Your AllOne object will be instantiated and called as such: +# obj = AllOne.new() +# obj.inc(key) +# obj.dec(key) +# param_3 = obj.get_max_key() +# param_4 = obj.get_min_key()"," +class AllOne { + + init() { + + } + + func inc(_ key: String) { + + } + + func dec(_ key: String) { + + } + + func getMaxKey() -> String { + + } + + func getMinKey() -> String { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * let obj = AllOne() + * obj.inc(key) + * obj.dec(key) + * let ret_3: String = obj.getMaxKey() + * let ret_4: String = obj.getMinKey() + */","type AllOne struct { + +} + + +func Constructor() AllOne { + +} + + +func (this *AllOne) Inc(key string) { + +} + + +func (this *AllOne) Dec(key string) { + +} + + +func (this *AllOne) GetMaxKey() string { + +} + + +func (this *AllOne) GetMinKey() string { + +} + + +/** + * Your AllOne object will be instantiated and called as such: + * obj := Constructor(); + * obj.Inc(key); + * obj.Dec(key); + * param_3 := obj.GetMaxKey(); + * param_4 := obj.GetMinKey(); + */","class AllOne() { + + def inc(key: String) { + + } + + def dec(key: String) { + + } + + def getMaxKey(): String = { + + } + + def getMinKey(): String = { + + } + +} + +/** + * Your AllOne object will be instantiated and called as such: + * var obj = new AllOne() + * obj.inc(key) + * obj.dec(key) + * var param_3 = obj.getMaxKey() + * var param_4 = obj.getMinKey() + */","class AllOne() { + + fun inc(key: String) { + + } + + fun dec(key: String) { + + } + + fun getMaxKey(): String { + + } + + fun getMinKey(): String { + + } + +} + +/** + * Your AllOne object will be instantiated and called as such: + * var obj = AllOne() + * obj.inc(key) + * obj.dec(key) + * var param_3 = obj.getMaxKey() + * var param_4 = obj.getMinKey() + */","struct AllOne { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl AllOne { + + fn new() -> Self { + + } + + fn inc(&self, key: String) { + + } + + fn dec(&self, key: String) { + + } + + fn get_max_key(&self) -> String { + + } + + fn get_min_key(&self) -> String { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * let obj = AllOne::new(); + * obj.inc(key); + * obj.dec(key); + * let ret_3: String = obj.get_max_key(); + * let ret_4: String = obj.get_min_key(); + */","class AllOne { + /** + */ + function __construct() { + + } + + /** + * @param String $key + * @return NULL + */ + function inc($key) { + + } + + /** + * @param String $key + * @return NULL + */ + function dec($key) { + + } + + /** + * @return String + */ + function getMaxKey() { + + } + + /** + * @return String + */ + function getMinKey() { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * $obj = AllOne(); + * $obj->inc($key); + * $obj->dec($key); + * $ret_3 = $obj->getMaxKey(); + * $ret_4 = $obj->getMinKey(); + */","class AllOne { + constructor() { + + } + + inc(key: string): void { + + } + + dec(key: string): void { + + } + + getMaxKey(): string { + + } + + getMinKey(): string { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * var obj = new AllOne() + * obj.inc(key) + * obj.dec(key) + * var param_3 = obj.getMaxKey() + * var param_4 = obj.getMinKey() + */","(define all-one% + (class object% + (super-new) + (init-field) + + ; inc : string? -> void? + (define/public (inc key) + + ) + ; dec : string? -> void? + (define/public (dec key) + + ) + ; get-max-key : -> string? + (define/public (get-max-key) + + ) + ; get-min-key : -> string? + (define/public (get-min-key) + + ))) + +;; Your all-one% object will be instantiated and called as such: +;; (define obj (new all-one%)) +;; (send obj inc key) +;; (send obj dec key) +;; (define param_3 (send obj get-max-key)) +;; (define param_4 (send obj get-min-key))","-spec all_one_init_() -> any(). +all_one_init_() -> + . + +-spec all_one_inc(Key :: unicode:unicode_binary()) -> any(). +all_one_inc(Key) -> + . + +-spec all_one_dec(Key :: unicode:unicode_binary()) -> any(). +all_one_dec(Key) -> + . + +-spec all_one_get_max_key() -> unicode:unicode_binary(). +all_one_get_max_key() -> + . + +-spec all_one_get_min_key() -> unicode:unicode_binary(). +all_one_get_min_key() -> + . + + +%% Your functions will be called as such: +%% all_one_init_(), +%% all_one_inc(Key), +%% all_one_dec(Key), +%% Param_3 = all_one_get_max_key(), +%% Param_4 = all_one_get_min_key(), + +%% all_one_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule AllOne do + @spec init_() :: any + def init_() do + + end + + @spec inc(key :: String.t) :: any + def inc(key) do + + end + + @spec dec(key :: String.t) :: any + def dec(key) do + + end + + @spec get_max_key() :: String.t + def get_max_key() do + + end + + @spec get_min_key() :: String.t + def get_min_key() do + + end +end + +# Your functions will be called as such: +# AllOne.init_() +# AllOne.inc(key) +# AllOne.dec(key) +# param_3 = AllOne.get_max_key() +# param_4 = AllOne.get_min_key() + +# AllOne.init_ will be called before every test case, in which you can do some necessary initializations.","class AllOne { + + AllOne() { + + } + + void inc(String key) { + + } + + void dec(String key) { + + } + + String getMaxKey() { + + } + + String getMinKey() { + + } +} + +/** + * Your AllOne object will be instantiated and called as such: + * AllOne obj = AllOne(); + * obj.inc(key); + * obj.dec(key); + * String param3 = obj.getMaxKey(); + * String param4 = obj.getMinKey(); + */", +1802,longest-repeating-character-replacement,Longest Repeating Character Replacement,424.0,424.0,"

You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times.

+ +

Return the length of the longest substring containing the same letter you can get after performing the above operations.

+ +

 

+

Example 1:

+ +
+Input: s = "ABAB", k = 2
+Output: 4
+Explanation: Replace the two 'A's with two 'B's or vice versa.
+
+ +

Example 2:

+ +
+Input: s = "AABABBA", k = 1
+Output: 4
+Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA".
+The substring "BBBB" has the longest repeating letters, which is 4.
+There may exists other ways to achive this answer too.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s consists of only uppercase English letters.
    • +
  • 0 <= k <= s.length
    • +
+",2.0,False,"class Solution { +public: + int characterReplacement(string s, int k) { + + } +};","class Solution { + public int characterReplacement(String s, int k) { + + } +}","class Solution(object): + def characterReplacement(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def characterReplacement(self, s: str, k: int) -> int: + ","int characterReplacement(char * s, int k){ + +}","public class Solution { + public int CharacterReplacement(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var characterReplacement = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def character_replacement(s, k) + +end","class Solution { + func characterReplacement(_ s: String, _ k: Int) -> Int { + + } +}","func characterReplacement(s string, k int) int { + +}","object Solution { + def characterReplacement(s: String, k: Int): Int = { + + } +}","class Solution { + fun characterReplacement(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn character_replacement(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function characterReplacement($s, $k) { + + } +}","function characterReplacement(s: string, k: number): number { + +};","(define/contract (character-replacement s k) + (-> string? exact-integer? exact-integer?) + + )","-spec character_replacement(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +character_replacement(S, K) -> + .","defmodule Solution do + @spec character_replacement(s :: String.t, k :: integer) :: integer + def character_replacement(s, k) do + + end +end","class Solution { + int characterReplacement(String s, int k) { + + } +}", +1803,reconstruct-original-digits-from-english,Reconstruct Original Digits from English,423.0,423.0,"

Given a string s containing an out-of-order English representation of digits 0-9, return the digits in ascending order.

+ +

 

+

Example 1:

+
Input: s = ""owoztneoer""
+Output: ""012""
+

Example 2:

+
Input: s = ""fviefuro""
+Output: ""45""
+
+

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 105
    • +
  • s[i] is one of the characters ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"].
    • +
  • s is guaranteed to be valid.
    • +
+",2.0,False,"class Solution { +public: + string originalDigits(string s) { + + } +};","class Solution { + public String originalDigits(String s) { + + } +}","class Solution(object): + def originalDigits(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def originalDigits(self, s: str) -> str: + ","char * originalDigits(char * s){ + +}","public class Solution { + public string OriginalDigits(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var originalDigits = function(s) { + +};","# @param {String} s +# @return {String} +def original_digits(s) + +end","class Solution { + func originalDigits(_ s: String) -> String { + + } +}","func originalDigits(s string) string { + +}","object Solution { + def originalDigits(s: String): String = { + + } +}","class Solution { + fun originalDigits(s: String): String { + + } +}","impl Solution { + pub fn original_digits(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function originalDigits($s) { + + } +}","function originalDigits(s: string): string { + +};","(define/contract (original-digits s) + (-> string? string?) + + )","-spec original_digits(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +original_digits(S) -> + .","defmodule Solution do + @spec original_digits(s :: String.t) :: String.t + def original_digits(s) do + + end +end","class Solution { + String originalDigits(String s) { + + } +}", +1804,maximum-xor-of-two-numbers-in-an-array,Maximum XOR of Two Numbers in an Array,421.0,421.0,"

Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,10,5,25,2,8]
+Output: 28
+Explanation: The maximum result is 5 XOR 25 = 28.
+
+ +

Example 2:

+ +
+Input: nums = [14,70,53,83,49,91,36,80,92,51,66,70]
+Output: 127
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 105
    • +
  • 0 <= nums[i] <= 231 - 1
    • +
+",2.0,False,"class Solution { +public: + int findMaximumXOR(vector& nums) { + + } +};","class Solution { + public int findMaximumXOR(int[] nums) { + + } +}","class Solution(object): + def findMaximumXOR(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findMaximumXOR(self, nums: List[int]) -> int: + ","int findMaximumXOR(int* nums, int numsSize){ + +}","public class Solution { + public int FindMaximumXOR(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findMaximumXOR = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_maximum_xor(nums) + +end","class Solution { + func findMaximumXOR(_ nums: [Int]) -> Int { + + } +}","func findMaximumXOR(nums []int) int { + +}","object Solution { + def findMaximumXOR(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findMaximumXOR(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_maximum_xor(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findMaximumXOR($nums) { + + } +}","function findMaximumXOR(nums: number[]): number { + +};","(define/contract (find-maximum-xor nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_maximum_xor(Nums :: [integer()]) -> integer(). +find_maximum_xor(Nums) -> + .","defmodule Solution do + @spec find_maximum_xor(nums :: [integer]) :: integer + def find_maximum_xor(nums) do + + end +end","class Solution { + int findMaximumXOR(List nums) { + + } +}", +1805,strong-password-checker,Strong Password Checker,420.0,420.0,"

A password is considered strong if the below conditions are all met:

+ +
    +
  • It has at least 6 characters and at most 20 characters.
    • +
  • It contains at least one lowercase letter, at least one uppercase letter, and at least one digit.
    • +
  • It does not contain three repeating characters in a row (i.e., "Baaabb0" is weak, but "Baaba0" is strong).
    • +
+ +

Given a string password, return the minimum number of steps required to make password strong. if password is already strong, return 0.

+ +

In one step, you can:

+ +
    +
  • Insert one character to password,
    • +
  • Delete one character from password, or
    • +
  • Replace one character of password with another character.
    • +
+ +

 

+

Example 1:

+
Input: password = ""a""
+Output: 5
+

Example 2:

+
Input: password = ""aA1""
+Output: 3
+

Example 3:

+
Input: password = ""1337C0d3""
+Output: 0
+
+

 

+

Constraints:

+ +
    +
  • 1 <= password.length <= 50
    • +
  • password consists of letters, digits, dot '.' or exclamation mark '!'.
    • +
+",3.0,False,"class Solution { +public: + int strongPasswordChecker(string password) { + + } +};","class Solution { + public int strongPasswordChecker(String password) { + + } +}","class Solution(object): + def strongPasswordChecker(self, password): + """""" + :type password: str + :rtype: int + """""" + ","class Solution: + def strongPasswordChecker(self, password: str) -> int: + ","int strongPasswordChecker(char * password){ + +}","public class Solution { + public int StrongPasswordChecker(string password) { + + } +}","/** + * @param {string} password + * @return {number} + */ +var strongPasswordChecker = function(password) { + +};","# @param {String} password +# @return {Integer} +def strong_password_checker(password) + +end","class Solution { + func strongPasswordChecker(_ password: String) -> Int { + + } +}","func strongPasswordChecker(password string) int { + +}","object Solution { + def strongPasswordChecker(password: String): Int = { + + } +}","class Solution { + fun strongPasswordChecker(password: String): Int { + + } +}","impl Solution { + pub fn strong_password_checker(password: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $password + * @return Integer + */ + function strongPasswordChecker($password) { + + } +}","function strongPasswordChecker(password: string): number { + +};","(define/contract (strong-password-checker password) + (-> string? exact-integer?) + + )","-spec strong_password_checker(Password :: unicode:unicode_binary()) -> integer(). +strong_password_checker(Password) -> + .","defmodule Solution do + @spec strong_password_checker(password :: String.t) :: integer + def strong_password_checker(password) do + + end +end","class Solution { + int strongPasswordChecker(String password) { + + } +}", +1806,battleships-in-a-board,Battleships in a Board,419.0,419.0,"

Given an m x n matrix board where each cell is a battleship 'X' or empty '.', return the number of the battleships on board.

+ +

Battleships can only be placed horizontally or vertically on board. In other words, they can only be made of the shape 1 x k (1 row, k columns) or k x 1 (k rows, 1 column), where k can be of any size. At least one horizontal or vertical cell separates between two battleships (i.e., there are no adjacent battleships).

+ +

 

+

Example 1:

+ +
+Input: board = [["X",".",".","X"],[".",".",".","X"],[".",".",".","X"]]
+Output: 2
+
+ +

Example 2:

+ +
+Input: board = [["."]]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • m == board.length
    • +
  • n == board[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • board[i][j] is either '.' or 'X'.
    • +
+ +

 

+

Follow up: Could you do it in one-pass, using only O(1) extra memory and without modifying the values board?

+",2.0,False,"class Solution { +public: + int countBattleships(vector>& board) { + + } +};","class Solution { + public int countBattleships(char[][] board) { + + } +}","class Solution(object): + def countBattleships(self, board): + """""" + :type board: List[List[str]] + :rtype: int + """""" + ","class Solution: + def countBattleships(self, board: List[List[str]]) -> int: + ","int countBattleships(char** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public int CountBattleships(char[][] board) { + + } +}","/** + * @param {character[][]} board + * @return {number} + */ +var countBattleships = function(board) { + +};","# @param {Character[][]} board +# @return {Integer} +def count_battleships(board) + +end","class Solution { + func countBattleships(_ board: [[Character]]) -> Int { + + } +}","func countBattleships(board [][]byte) int { + +}","object Solution { + def countBattleships(board: Array[Array[Char]]): Int = { + + } +}","class Solution { + fun countBattleships(board: Array): Int { + + } +}","impl Solution { + pub fn count_battleships(board: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String[][] $board + * @return Integer + */ + function countBattleships($board) { + + } +}","function countBattleships(board: string[][]): number { + +};","(define/contract (count-battleships board) + (-> (listof (listof char?)) exact-integer?) + + )","-spec count_battleships(Board :: [[char()]]) -> integer(). +count_battleships(Board) -> + .","defmodule Solution do + @spec count_battleships(board :: [[char]]) :: integer + def count_battleships(board) do + + end +end","class Solution { + int countBattleships(List> board) { + + } +}", +1810,third-maximum-number,Third Maximum Number,414.0,414.0,"

Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,1]
+Output: 1
+Explanation:
+The first distinct maximum is 3.
+The second distinct maximum is 2.
+The third distinct maximum is 1.
+
+ +

Example 2:

+ +
+Input: nums = [1,2]
+Output: 2
+Explanation:
+The first distinct maximum is 2.
+The second distinct maximum is 1.
+The third distinct maximum does not exist, so the maximum (2) is returned instead.
+
+ +

Example 3:

+ +
+Input: nums = [2,2,3,1]
+Output: 1
+Explanation:
+The first distinct maximum is 3.
+The second distinct maximum is 2 (both 2's are counted together since they have the same value).
+The third distinct maximum is 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
+ +

 

+Follow up: Can you find an O(n) solution?",1.0,False,"class Solution { +public: + int thirdMax(vector& nums) { + + } +};","class Solution { + public int thirdMax(int[] nums) { + + } +}","class Solution(object): + def thirdMax(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def thirdMax(self, nums: List[int]) -> int: + ","int thirdMax(int* nums, int numsSize){ + +}","public class Solution { + public int ThirdMax(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var thirdMax = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def third_max(nums) + +end","class Solution { + func thirdMax(_ nums: [Int]) -> Int { + + } +}","func thirdMax(nums []int) int { + +}","object Solution { + def thirdMax(nums: Array[Int]): Int = { + + } +}","class Solution { + fun thirdMax(nums: IntArray): Int { + + } +}","impl Solution { + pub fn third_max(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function thirdMax($nums) { + + } +}","function thirdMax(nums: number[]): number { + +};","(define/contract (third-max nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec third_max(Nums :: [integer()]) -> integer(). +third_max(Nums) -> + .","defmodule Solution do + @spec third_max(nums :: [integer]) :: integer + def third_max(nums) do + + end +end","class Solution { + int thirdMax(List nums) { + + } +}", +1811,arithmetic-slices,Arithmetic Slices,413.0,413.0,"

An integer array is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

+ +
    +
  • For example, [1,3,5,7,9], [7,7,7,7], and [3,-1,-5,-9] are arithmetic sequences.
    • +
+ +

Given an integer array nums, return the number of arithmetic subarrays of nums.

+ +

A subarray is a contiguous subsequence of the array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4]
+Output: 3
+Explanation: We have 3 arithmetic slices in nums: [1, 2, 3], [2, 3, 4] and [1,2,3,4] itself.
+
+ +

Example 2:

+ +
+Input: nums = [1]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5000
    • +
  • -1000 <= nums[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int numberOfArithmeticSlices(vector& nums) { + + } +};","class Solution { + public int numberOfArithmeticSlices(int[] nums) { + + } +}","class Solution(object): + def numberOfArithmeticSlices(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def numberOfArithmeticSlices(self, nums: List[int]) -> int: + ","int numberOfArithmeticSlices(int* nums, int numsSize){ + +}","public class Solution { + public int NumberOfArithmeticSlices(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var numberOfArithmeticSlices = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def number_of_arithmetic_slices(nums) + +end","class Solution { + func numberOfArithmeticSlices(_ nums: [Int]) -> Int { + + } +}","func numberOfArithmeticSlices(nums []int) int { + +}","object Solution { + def numberOfArithmeticSlices(nums: Array[Int]): Int = { + + } +}","class Solution { + fun numberOfArithmeticSlices(nums: IntArray): Int { + + } +}","impl Solution { + pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function numberOfArithmeticSlices($nums) { + + } +}","function numberOfArithmeticSlices(nums: number[]): number { + +};","(define/contract (number-of-arithmetic-slices nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec number_of_arithmetic_slices(Nums :: [integer()]) -> integer(). +number_of_arithmetic_slices(Nums) -> + .","defmodule Solution do + @spec number_of_arithmetic_slices(nums :: [integer]) :: integer + def number_of_arithmetic_slices(nums) do + + end +end","class Solution { + int numberOfArithmeticSlices(List nums) { + + } +}", +1813,split-array-largest-sum,Split Array Largest Sum,410.0,410.0,"

Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.

+ +

Return the minimized largest sum of the split.

+ +

A subarray is a contiguous part of the array.

+ +

 

+

Example 1:

+ +
+Input: nums = [7,2,5,10,8], k = 2
+Output: 18
+Explanation: There are four ways to split nums into two subarrays.
+The best way is to split it into [7,2,5] and [10,8], where the largest sum among the two subarrays is only 18.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4,5], k = 2
+Output: 9
+Explanation: There are four ways to split nums into two subarrays.
+The best way is to split it into [1,2,3] and [4,5], where the largest sum among the two subarrays is only 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] <= 106
    • +
  • 1 <= k <= min(50, nums.length)
    • +
+",3.0,False,"class Solution { +public: + int splitArray(vector& nums, int k) { + + } +};","class Solution { + public int splitArray(int[] nums, int k) { + + } +}","class Solution(object): + def splitArray(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: int + """""" + ","class Solution: + def splitArray(self, nums: List[int], k: int) -> int: + ","int splitArray(int* nums, int numsSize, int k){ + +}","public class Solution { + public int SplitArray(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number} + */ +var splitArray = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer} +def split_array(nums, k) + +end","class Solution { + func splitArray(_ nums: [Int], _ k: Int) -> Int { + + } +}","func splitArray(nums []int, k int) int { + +}","object Solution { + def splitArray(nums: Array[Int], k: Int): Int = { + + } +}","class Solution { + fun splitArray(nums: IntArray, k: Int): Int { + + } +}","impl Solution { + pub fn split_array(nums: Vec, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer + */ + function splitArray($nums, $k) { + + } +}","function splitArray(nums: number[], k: number): number { + +};","(define/contract (split-array nums k) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec split_array(Nums :: [integer()], K :: integer()) -> integer(). +split_array(Nums, K) -> + .","defmodule Solution do + @spec split_array(nums :: [integer], k :: integer) :: integer + def split_array(nums, k) do + + end +end","class Solution { + int splitArray(List nums, int k) { + + } +}", +1815,trapping-rain-water-ii,Trapping Rain Water II,407.0,407.0,"

Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water it can trap after raining.

+ +

 

+

Example 1:

+ +
+Input: heightMap = [[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]]
+Output: 4
+Explanation: After the rain, water is trapped between the blocks.
+We have two small ponds 1 and 3 units trapped.
+The total volume of water trapped is 4.
+
+ +

Example 2:

+ +
+Input: heightMap = [[3,3,3,3,3],[3,2,2,2,3],[3,2,1,2,3],[3,2,2,2,3],[3,3,3,3,3]]
+Output: 10
+
+ +

 

+

Constraints:

+ +
    +
  • m == heightMap.length
    • +
  • n == heightMap[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • 0 <= heightMap[i][j] <= 2 * 104
    • +
+",3.0,False,"class Solution { +public: + int trapRainWater(vector>& heightMap) { + + } +};","class Solution { + public int trapRainWater(int[][] heightMap) { + + } +}","class Solution(object): + def trapRainWater(self, heightMap): + """""" + :type heightMap: List[List[int]] + :rtype: int + """""" + ","class Solution: + def trapRainWater(self, heightMap: List[List[int]]) -> int: + ","int trapRainWater(int** heightMap, int heightMapSize, int* heightMapColSize){ + +}","public class Solution { + public int TrapRainWater(int[][] heightMap) { + + } +}","/** + * @param {number[][]} heightMap + * @return {number} + */ +var trapRainWater = function(heightMap) { + +};","# @param {Integer[][]} height_map +# @return {Integer} +def trap_rain_water(height_map) + +end","class Solution { + func trapRainWater(_ heightMap: [[Int]]) -> Int { + + } +}","func trapRainWater(heightMap [][]int) int { + +}","object Solution { + def trapRainWater(heightMap: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun trapRainWater(heightMap: Array): Int { + + } +}","impl Solution { + pub fn trap_rain_water(height_map: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $heightMap + * @return Integer + */ + function trapRainWater($heightMap) { + + } +}","function trapRainWater(heightMap: number[][]): number { + +};","(define/contract (trap-rain-water heightMap) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec trap_rain_water(HeightMap :: [[integer()]]) -> integer(). +trap_rain_water(HeightMap) -> + .","defmodule Solution do + @spec trap_rain_water(height_map :: [[integer]]) :: integer + def trap_rain_water(height_map) do + + end +end","class Solution { + int trapRainWater(List> heightMap) { + + } +}", +1816,queue-reconstruction-by-height,Queue Reconstruction by Height,406.0,406.0,"

You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi.

+ +

Reconstruct and return the queue that is represented by the input array people. The returned queue should be formatted as an array queue, where queue[j] = [hj, kj] is the attributes of the jth person in the queue (queue[0] is the person at the front of the queue).

+ +

 

+

Example 1:

+ +
+Input: people = [[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]
+Output: [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]]
+Explanation:
+Person 0 has height 5 with no other people taller or the same height in front.
+Person 1 has height 7 with no other people taller or the same height in front.
+Person 2 has height 5 with two persons taller or the same height in front, which is person 0 and 1.
+Person 3 has height 6 with one person taller or the same height in front, which is person 1.
+Person 4 has height 4 with four people taller or the same height in front, which are people 0, 1, 2, and 3.
+Person 5 has height 7 with one person taller or the same height in front, which is person 1.
+Hence [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] is the reconstructed queue.
+
+ +

Example 2:

+ +
+Input: people = [[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]
+Output: [[4,0],[5,0],[2,2],[3,2],[1,4],[6,0]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= people.length <= 2000
    • +
  • 0 <= hi <= 106
    • +
  • 0 <= ki < people.length
    • +
  • It is guaranteed that the queue can be reconstructed.
    • +
+",2.0,False,"class Solution { +public: + vector> reconstructQueue(vector>& people) { + + } +};","class Solution { + public int[][] reconstructQueue(int[][] people) { + + } +}","class Solution(object): + def reconstructQueue(self, people): + """""" + :type people: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** reconstructQueue(int** people, int peopleSize, int* peopleColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] ReconstructQueue(int[][] people) { + + } +}","/** + * @param {number[][]} people + * @return {number[][]} + */ +var reconstructQueue = function(people) { + +};","# @param {Integer[][]} people +# @return {Integer[][]} +def reconstruct_queue(people) + +end","class Solution { + func reconstructQueue(_ people: [[Int]]) -> [[Int]] { + + } +}","func reconstructQueue(people [][]int) [][]int { + +}","object Solution { + def reconstructQueue(people: Array[Array[Int]]): Array[Array[Int]] = { + + } +}","class Solution { + fun reconstructQueue(people: Array): Array { + + } +}","impl Solution { + pub fn reconstruct_queue(people: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $people + * @return Integer[][] + */ + function reconstructQueue($people) { + + } +}","function reconstructQueue(people: number[][]): number[][] { + +};","(define/contract (reconstruct-queue people) + (-> (listof (listof exact-integer?)) (listof (listof exact-integer?))) + + )","-spec reconstruct_queue(People :: [[integer()]]) -> [[integer()]]. +reconstruct_queue(People) -> + .","defmodule Solution do + @spec reconstruct_queue(people :: [[integer]]) :: [[integer]] + def reconstruct_queue(people) do + + end +end","class Solution { + List> reconstructQueue(List> people) { + + } +}", +1819,frog-jump,Frog Jump,403.0,403.0,"

A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.

+ +

Given a list of stones' positions (in units) in sorted ascending order, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be 1 unit.

+ +

If the frog's last jump was k units, its next jump must be either k - 1, k, or k + 1 units. The frog can only jump in the forward direction.

+ +

 

+

Example 1:

+ +
+Input: stones = [0,1,3,5,6,8,12,17]
+Output: true
+Explanation: The frog can jump to the last stone by jumping 1 unit to the 2nd stone, then 2 units to the 3rd stone, then 2 units to the 4th stone, then 3 units to the 6th stone, 4 units to the 7th stone, and 5 units to the 8th stone.
+
+ +

Example 2:

+ +
+Input: stones = [0,1,2,3,4,8,9,11]
+Output: false
+Explanation: There is no way to jump to the last stone as the gap between the 5th and 6th stone is too large.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= stones.length <= 2000
    • +
  • 0 <= stones[i] <= 231 - 1
    • +
  • stones[0] == 0
    • +
  • stones is sorted in a strictly increasing order.
    • +
+",3.0,False,"class Solution { +public: + bool canCross(vector& stones) { + + } +};","class Solution { + public boolean canCross(int[] stones) { + + } +}","class Solution(object): + def canCross(self, stones): + """""" + :type stones: List[int] + :rtype: bool + """""" + ","class Solution: + def canCross(self, stones: List[int]) -> bool: + ","bool canCross(int* stones, int stonesSize){ + +}","public class Solution { + public bool CanCross(int[] stones) { + + } +}","/** + * @param {number[]} stones + * @return {boolean} + */ +var canCross = function(stones) { + +};","# @param {Integer[]} stones +# @return {Boolean} +def can_cross(stones) + +end","class Solution { + func canCross(_ stones: [Int]) -> Bool { + + } +}","func canCross(stones []int) bool { + +}","object Solution { + def canCross(stones: Array[Int]): Boolean = { + + } +}","class Solution { + fun canCross(stones: IntArray): Boolean { + + } +}","impl Solution { + pub fn can_cross(stones: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $stones + * @return Boolean + */ + function canCross($stones) { + + } +}","function canCross(stones: number[]): boolean { + +};","(define/contract (can-cross stones) + (-> (listof exact-integer?) boolean?) + + )","-spec can_cross(Stones :: [integer()]) -> boolean(). +can_cross(Stones) -> + .","defmodule Solution do + @spec can_cross(stones :: [integer]) :: boolean + def can_cross(stones) do + + end +end","class Solution { + bool canCross(List stones) { + + } +}", +1820,remove-k-digits,Remove K Digits,402.0,402.0,"

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num.

+ +

 

+

Example 1:

+ +
+Input: num = "1432219", k = 3
+Output: "1219"
+Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest.
+
+ +

Example 2:

+ +
+Input: num = "10200", k = 1
+Output: "200"
+Explanation: Remove the leading 1 and the number is 200. Note that the output must not contain leading zeroes.
+
+ +

Example 3:

+ +
+Input: num = "10", k = 2
+Output: "0"
+Explanation: Remove all the digits from the number and it is left with nothing which is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= num.length <= 105
    • +
  • num consists of only digits.
    • +
  • num does not have any leading zeros except for the zero itself.
    • +
+",2.0,False,"class Solution { +public: + string removeKdigits(string num, int k) { + + } +};","class Solution { + public String removeKdigits(String num, int k) { + + } +}","class Solution(object): + def removeKdigits(self, num, k): + """""" + :type num: str + :type k: int + :rtype: str + """""" + ","class Solution: + def removeKdigits(self, num: str, k: int) -> str: + ","char * removeKdigits(char * num, int k){ + +}","public class Solution { + public string RemoveKdigits(string num, int k) { + + } +}","/** + * @param {string} num + * @param {number} k + * @return {string} + */ +var removeKdigits = function(num, k) { + +};","# @param {String} num +# @param {Integer} k +# @return {String} +def remove_kdigits(num, k) + +end","class Solution { + func removeKdigits(_ num: String, _ k: Int) -> String { + + } +}","func removeKdigits(num string, k int) string { + +}","object Solution { + def removeKdigits(num: String, k: Int): String = { + + } +}","class Solution { + fun removeKdigits(num: String, k: Int): String { + + } +}","impl Solution { + pub fn remove_kdigits(num: String, k: i32) -> String { + + } +}","class Solution { + + /** + * @param String $num + * @param Integer $k + * @return String + */ + function removeKdigits($num, $k) { + + } +}","function removeKdigits(num: string, k: number): string { + +};","(define/contract (remove-kdigits num k) + (-> string? exact-integer? string?) + + )","-spec remove_kdigits(Num :: unicode:unicode_binary(), K :: integer()) -> unicode:unicode_binary(). +remove_kdigits(Num, K) -> + .","defmodule Solution do + @spec remove_kdigits(num :: String.t, k :: integer) :: String.t + def remove_kdigits(num, k) do + + end +end","class Solution { + String removeKdigits(String num, int k) { + + } +}", +1823,evaluate-division,Evaluate Division,399.0,399.0,"

You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable.

+ +

You are also given some queries, where queries[j] = [Cj, Dj] represents the jth query where you must find the answer for Cj / Dj = ?.

+ +

Return the answers to all queries. If a single answer cannot be determined, return -1.0.

+ +

Note: The input is always valid. You may assume that evaluating the queries will not result in division by zero and that there is no contradiction.

+ +

Note: The variables that do not occur in the list of equations are undefined, so the answer cannot be determined for them.

+ +

 

+

Example 1:

+ +
+Input: equations = [["a","b"],["b","c"]], values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
+Output: [6.00000,0.50000,-1.00000,1.00000,-1.00000]
+Explanation: 
+Given: a / b = 2.0, b / c = 3.0
+queries are: a / c = ?, b / a = ?, a / e = ?, a / a = ?, x / x = ? 
+return: [6.0, 0.5, -1.0, 1.0, -1.0 ]
+note: x is undefined => -1.0
+ +

Example 2:

+ +
+Input: equations = [["a","b"],["b","c"],["bc","cd"]], values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
+Output: [3.75000,0.40000,5.00000,0.20000]
+
+ +

Example 3:

+ +
+Input: equations = [["a","b"]], values = [0.5], queries = [["a","b"],["b","a"],["a","c"],["x","y"]]
+Output: [0.50000,2.00000,-1.00000,-1.00000]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= equations.length <= 20
    • +
  • equations[i].length == 2
    • +
  • 1 <= Ai.length, Bi.length <= 5
    • +
  • values.length == equations.length
    • +
  • 0.0 < values[i] <= 20.0
    • +
  • 1 <= queries.length <= 20
    • +
  • queries[i].length == 2
    • +
  • 1 <= Cj.length, Dj.length <= 5
    • +
  • Ai, Bi, Cj, Dj consist of lower case English letters and digits.
    • +
+",2.0,False,"class Solution { +public: + vector calcEquation(vector>& equations, vector& values, vector>& queries) { + + } +};","class Solution { + public double[] calcEquation(List> equations, double[] values, List> queries) { + + } +}","class Solution(object): + def calcEquation(self, equations, values, queries): + """""" + :type equations: List[List[str]] + :type values: List[float] + :type queries: List[List[str]] + :rtype: List[float] + """""" + ","class Solution: + def calcEquation(self, equations: List[List[str]], values: List[float], queries: List[List[str]]) -> List[float]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +double* calcEquation(char *** equations, int equationsSize, int* equationsColSize, double* values, int valuesSize, char *** queries, int queriesSize, int* queriesColSize, int* returnSize){ + +}","public class Solution { + public double[] CalcEquation(IList> equations, double[] values, IList> queries) { + + } +}","/** + * @param {string[][]} equations + * @param {number[]} values + * @param {string[][]} queries + * @return {number[]} + */ +var calcEquation = function(equations, values, queries) { + +};","# @param {String[][]} equations +# @param {Float[]} values +# @param {String[][]} queries +# @return {Float[]} +def calc_equation(equations, values, queries) + +end","class Solution { + func calcEquation(_ equations: [[String]], _ values: [Double], _ queries: [[String]]) -> [Double] { + + } +}","func calcEquation(equations [][]string, values []float64, queries [][]string) []float64 { + +}","object Solution { + def calcEquation(equations: List[List[String]], values: Array[Double], queries: List[List[String]]): Array[Double] = { + + } +}","class Solution { + fun calcEquation(equations: List>, values: DoubleArray, queries: List>): DoubleArray { + + } +}","impl Solution { + pub fn calc_equation(equations: Vec>, values: Vec, queries: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param String[][] $equations + * @param Float[] $values + * @param String[][] $queries + * @return Float[] + */ + function calcEquation($equations, $values, $queries) { + + } +}","function calcEquation(equations: string[][], values: number[], queries: string[][]): number[] { + +};","(define/contract (calc-equation equations values queries) + (-> (listof (listof string?)) (listof flonum?) (listof (listof string?)) (listof flonum?)) + + )","-spec calc_equation(Equations :: [[unicode:unicode_binary()]], Values :: [float()], Queries :: [[unicode:unicode_binary()]]) -> [float()]. +calc_equation(Equations, Values, Queries) -> + .","defmodule Solution do + @spec calc_equation(equations :: [[String.t]], values :: [float], queries :: [[String.t]]) :: [float] + def calc_equation(equations, values, queries) do + + end +end","class Solution { + List calcEquation(List> equations, List values, List> queries) { + + } +}", +1824,random-pick-index,Random Pick Index,398.0,398.0,"

Given an integer array nums with possible duplicates, randomly output the index of a given target number. You can assume that the given target number must exist in the array.

+ +

Implement the Solution class:

+ +
    +
  • Solution(int[] nums) Initializes the object with the array nums.
    • +
  • int pick(int target) Picks a random index i from nums where nums[i] == target. If there are multiple valid i's, then each index should have an equal probability of returning.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution", "pick", "pick", "pick"]
+[[[1, 2, 3, 3, 3]], [3], [1], [3]]
+Output
+[null, 4, 0, 2]
+
+Explanation
+Solution solution = new Solution([1, 2, 3, 3, 3]);
+solution.pick(3); // It should return either index 2, 3, or 4 randomly. Each index should have equal probability of returning.
+solution.pick(1); // It should return 0. Since in the array only nums[0] is equal to 1.
+solution.pick(3); // It should return either index 2, 3, or 4 randomly. Each index should have equal probability of returning.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2 * 104
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
  • target is an integer from nums.
    • +
  • At most 104 calls will be made to pick.
    • +
+",2.0,False,"class Solution { +public: + Solution(vector& nums) { + + } + + int pick(int target) { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(nums); + * int param_1 = obj->pick(target); + */","class Solution { + + public Solution(int[] nums) { + + } + + public int pick(int target) { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(nums); + * int param_1 = obj.pick(target); + */","class Solution(object): + + def __init__(self, nums): + """""" + :type nums: List[int] + """""" + + + def pick(self, target): + """""" + :type target: int + :rtype: int + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(nums) +# param_1 = obj.pick(target)","class Solution: + + def __init__(self, nums: List[int]): + + + def pick(self, target: int) -> int: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(nums) +# param_1 = obj.pick(target)"," + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(int* nums, int numsSize) { + +} + +int solutionPick(Solution* obj, int target) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(nums, numsSize); + * int param_1 = solutionPick(obj, target); + + * solutionFree(obj); +*/","public class Solution { + + public Solution(int[] nums) { + + } + + public int Pick(int target) { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(nums); + * int param_1 = obj.Pick(target); + */","/** + * @param {number[]} nums + */ +var Solution = function(nums) { + +}; + +/** + * @param {number} target + * @return {number} + */ +Solution.prototype.pick = function(target) { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(nums) + * var param_1 = obj.pick(target) + */","class Solution + +=begin + :type nums: Integer[] +=end + def initialize(nums) + + end + + +=begin + :type target: Integer + :rtype: Integer +=end + def pick(target) + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(nums) +# param_1 = obj.pick(target)"," +class Solution { + + init(_ nums: [Int]) { + + } + + func pick(_ target: Int) -> Int { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(nums) + * let ret_1: Int = obj.pick(target) + */","type Solution struct { + +} + + +func Constructor(nums []int) Solution { + +} + + +func (this *Solution) Pick(target int) int { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(nums); + * param_1 := obj.Pick(target); + */","class Solution(_nums: Array[Int]) { + + def pick(target: Int): Int = { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(nums) + * var param_1 = obj.pick(target) + */","class Solution(nums: IntArray) { + + fun pick(target: Int): Int { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(nums) + * var param_1 = obj.pick(target) + */","struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(nums: Vec) -> Self { + + } + + fn pick(&self, target: i32) -> i32 { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(nums); + * let ret_1: i32 = obj.pick(target); + */","class Solution { + /** + * @param Integer[] $nums + */ + function __construct($nums) { + + } + + /** + * @param Integer $target + * @return Integer + */ + function pick($target) { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($nums); + * $ret_1 = $obj->pick($target); + */","class Solution { + constructor(nums: number[]) { + + } + + pick(target: number): number { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(nums) + * var param_1 = obj.pick(target) + */","(define solution% + (class object% + (super-new) + + ; nums : (listof exact-integer?) + (init-field + nums) + + ; pick : exact-integer? -> exact-integer? + (define/public (pick target) + + ))) + +;; Your solution% object will be instantiated and called as such: +;; (define obj (new solution% [nums nums])) +;; (define param_1 (send obj pick target))","-spec solution_init_(Nums :: [integer()]) -> any(). +solution_init_(Nums) -> + . + +-spec solution_pick(Target :: integer()) -> integer(). +solution_pick(Target) -> + . + + +%% Your functions will be called as such: +%% solution_init_(Nums), +%% Param_1 = solution_pick(Target), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Solution do + @spec init_(nums :: [integer]) :: any + def init_(nums) do + + end + + @spec pick(target :: integer) :: integer + def pick(target) do + + end +end + +# Your functions will be called as such: +# Solution.init_(nums) +# param_1 = Solution.pick(target) + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","class Solution { + + Solution(List nums) { + + } + + int pick(int target) { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(nums); + * int param1 = obj.pick(target); + */", +1825,integer-replacement,Integer Replacement,397.0,397.0,"

Given a positive integer n, you can apply one of the following operations:

+ +
    +
  1. If n is even, replace n with n / 2.
    2. +
  2. If n is odd, replace n with either n + 1 or n - 1.
    3. +
+ +

Return the minimum number of operations needed for n to become 1.

+ +

 

+

Example 1:

+ +
+Input: n = 8
+Output: 3
+Explanation: 8 -> 4 -> 2 -> 1
+
+ +

Example 2:

+ +
+Input: n = 7
+Output: 4
+Explanation: 7 -> 8 -> 4 -> 2 -> 1
+or 7 -> 6 -> 3 -> 2 -> 1
+
+ +

Example 3:

+ +
+Input: n = 4
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 231 - 1
    • +
+",2.0,False,"class Solution { +public: + int integerReplacement(int n) { + + } +};","class Solution { + public int integerReplacement(int n) { + + } +}","class Solution(object): + def integerReplacement(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def integerReplacement(self, n: int) -> int: + ","int integerReplacement(int n){ + +}","public class Solution { + public int IntegerReplacement(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var integerReplacement = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def integer_replacement(n) + +end","class Solution { + func integerReplacement(_ n: Int) -> Int { + + } +}","func integerReplacement(n int) int { + +}","object Solution { + def integerReplacement(n: Int): Int = { + + } +}","class Solution { + fun integerReplacement(n: Int): Int { + + } +}","impl Solution { + pub fn integer_replacement(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function integerReplacement($n) { + + } +}","function integerReplacement(n: number): number { + +};","(define/contract (integer-replacement n) + (-> exact-integer? exact-integer?) + + )","-spec integer_replacement(N :: integer()) -> integer(). +integer_replacement(N) -> + .","defmodule Solution do + @spec integer_replacement(n :: integer) :: integer + def integer_replacement(n) do + + end +end","class Solution { + int integerReplacement(int n) { + + } +}", +1827,longest-substring-with-at-least-k-repeating-characters,Longest Substring with At Least K Repeating Characters,395.0,395.0,"

Given a string s and an integer k, return the length of the longest substring of s such that the frequency of each character in this substring is greater than or equal to k.

+ +

if no such substring exists, return 0.

+ +

 

+

Example 1:

+ +
+Input: s = "aaabb", k = 3
+Output: 3
+Explanation: The longest substring is "aaa", as 'a' is repeated 3 times.
+
+ +

Example 2:

+ +
+Input: s = "ababbc", k = 2
+Output: 5
+Explanation: The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • s consists of only lowercase English letters.
    • +
  • 1 <= k <= 105
    • +
+",2.0,False,"class Solution { +public: + int longestSubstring(string s, int k) { + + } +};","class Solution { + public int longestSubstring(String s, int k) { + + } +}","class Solution(object): + def longestSubstring(self, s, k): + """""" + :type s: str + :type k: int + :rtype: int + """""" + ","class Solution: + def longestSubstring(self, s: str, k: int) -> int: + ","int longestSubstring(char * s, int k){ + +}","public class Solution { + public int LongestSubstring(string s, int k) { + + } +}","/** + * @param {string} s + * @param {number} k + * @return {number} + */ +var longestSubstring = function(s, k) { + +};","# @param {String} s +# @param {Integer} k +# @return {Integer} +def longest_substring(s, k) + +end","class Solution { + func longestSubstring(_ s: String, _ k: Int) -> Int { + + } +}","func longestSubstring(s string, k int) int { + +}","object Solution { + def longestSubstring(s: String, k: Int): Int = { + + } +}","class Solution { + fun longestSubstring(s: String, k: Int): Int { + + } +}","impl Solution { + pub fn longest_substring(s: String, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $k + * @return Integer + */ + function longestSubstring($s, $k) { + + } +}","function longestSubstring(s: string, k: number): number { + +};","(define/contract (longest-substring s k) + (-> string? exact-integer? exact-integer?) + + )","-spec longest_substring(S :: unicode:unicode_binary(), K :: integer()) -> integer(). +longest_substring(S, K) -> + .","defmodule Solution do + @spec longest_substring(s :: String.t, k :: integer) :: integer + def longest_substring(s, k) do + + end +end","class Solution { + int longestSubstring(String s, int k) { + + } +}", +1828,decode-string,Decode String,394.0,394.0,"

Given an encoded string, return its decoded string.

+ +

The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.

+ +

You may assume that the input string is always valid; there are no extra white spaces, square brackets are well-formed, etc. Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there will not be input like 3a or 2[4].

+ +

The test cases are generated so that the length of the output will never exceed 105.

+ +

 

+

Example 1:

+ +
+Input: s = "3[a]2[bc]"
+Output: "aaabcbc"
+
+ +

Example 2:

+ +
+Input: s = "3[a2[c]]"
+Output: "accaccacc"
+
+ +

Example 3:

+ +
+Input: s = "2[abc]3[cd]ef"
+Output: "abcabccdcdcdef"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 30
    • +
  • s consists of lowercase English letters, digits, and square brackets '[]'.
    • +
  • s is guaranteed to be a valid input.
    • +
  • All the integers in s are in the range [1, 300].
    • +
+",2.0,False,"class Solution { +public: + string decodeString(string s) { + + } +};","class Solution { + public String decodeString(String s) { + + } +}","class Solution(object): + def decodeString(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def decodeString(self, s: str) -> str: + ","char * decodeString(char * s){ + +}","public class Solution { + public string DecodeString(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var decodeString = function(s) { + +};","# @param {String} s +# @return {String} +def decode_string(s) + +end","class Solution { + func decodeString(_ s: String) -> String { + + } +}","func decodeString(s string) string { + +}","object Solution { + def decodeString(s: String): String = { + + } +}","class Solution { + fun decodeString(s: String): String { + + } +}","impl Solution { + pub fn decode_string(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function decodeString($s) { + + } +}","function decodeString(s: string): string { + +};",,"-spec decode_string(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +decode_string(S) -> + .","defmodule Solution do + @spec decode_string(s :: String.t) :: String.t + def decode_string(s) do + + end +end","class Solution { + String decodeString(String s) { + + } +}", +1831,perfect-rectangle,Perfect Rectangle,391.0,391.0,"

Given an array rectangles where rectangles[i] = [xi, yi, ai, bi] represents an axis-aligned rectangle. The bottom-left point of the rectangle is (xi, yi) and the top-right point of it is (ai, bi).

+ +

Return true if all the rectangles together form an exact cover of a rectangular region.

+ +

 

+

Example 1:

+ +
+Input: rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]
+Output: true
+Explanation: All 5 rectangles together form an exact cover of a rectangular region.
+
+ +

Example 2:

+ +
+Input: rectangles = [[1,1,2,3],[1,3,2,4],[3,1,4,2],[3,2,4,4]]
+Output: false
+Explanation: Because there is a gap between the two rectangular regions.
+
+ +

Example 3:

+ +
+Input: rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[2,2,4,4]]
+Output: false
+Explanation: Because two of the rectangles overlap with each other.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= rectangles.length <= 2 * 104
    • +
  • rectangles[i].length == 4
    • +
  • -105 <= xi, yi, ai, bi <= 105
    • +
+",3.0,False,"class Solution { +public: + bool isRectangleCover(vector>& rectangles) { + + } +};","class Solution { + public boolean isRectangleCover(int[][] rectangles) { + + } +}","class Solution(object): + def isRectangleCover(self, rectangles): + """""" + :type rectangles: List[List[int]] + :rtype: bool + """""" + ","class Solution: + def isRectangleCover(self, rectangles: List[List[int]]) -> bool: + ","bool isRectangleCover(int** rectangles, int rectanglesSize, int* rectanglesColSize){ + +}","public class Solution { + public bool IsRectangleCover(int[][] rectangles) { + + } +}","/** + * @param {number[][]} rectangles + * @return {boolean} + */ +var isRectangleCover = function(rectangles) { + +};","# @param {Integer[][]} rectangles +# @return {Boolean} +def is_rectangle_cover(rectangles) + +end","class Solution { + func isRectangleCover(_ rectangles: [[Int]]) -> Bool { + + } +}","func isRectangleCover(rectangles [][]int) bool { + +}","object Solution { + def isRectangleCover(rectangles: Array[Array[Int]]): Boolean = { + + } +}","class Solution { + fun isRectangleCover(rectangles: Array): Boolean { + + } +}","impl Solution { + pub fn is_rectangle_cover(rectangles: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param Integer[][] $rectangles + * @return Boolean + */ + function isRectangleCover($rectangles) { + + } +}","function isRectangleCover(rectangles: number[][]): boolean { + +};","(define/contract (is-rectangle-cover rectangles) + (-> (listof (listof exact-integer?)) boolean?) + + )","-spec is_rectangle_cover(Rectangles :: [[integer()]]) -> boolean(). +is_rectangle_cover(Rectangles) -> + .","defmodule Solution do + @spec is_rectangle_cover(rectangles :: [[integer]]) :: boolean + def is_rectangle_cover(rectangles) do + + end +end","class Solution { + bool isRectangleCover(List> rectangles) { + + } +}", +1836,lexicographical-numbers,Lexicographical Numbers,386.0,386.0,"

Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.

+ +

You must write an algorithm that runs in O(n) time and uses O(1) extra space. 

+ +

 

+

Example 1:

+
Input: n = 13
+Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]
+

Example 2:

+
Input: n = 2
+Output: [1,2]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= n <= 5 * 104
    • +
+",2.0,False,"class Solution { +public: + vector lexicalOrder(int n) { + + } +};","class Solution { + public List lexicalOrder(int n) { + + } +}","class Solution(object): + def lexicalOrder(self, n): + """""" + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def lexicalOrder(self, n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* lexicalOrder(int n, int* returnSize){ + +}","public class Solution { + public IList LexicalOrder(int n) { + + } +}","/** + * @param {number} n + * @return {number[]} + */ +var lexicalOrder = function(n) { + +};","# @param {Integer} n +# @return {Integer[]} +def lexical_order(n) + +end","class Solution { + func lexicalOrder(_ n: Int) -> [Int] { + + } +}","func lexicalOrder(n int) []int { + +}","object Solution { + def lexicalOrder(n: Int): List[Int] = { + + } +}","class Solution { + fun lexicalOrder(n: Int): List { + + } +}","impl Solution { + pub fn lexical_order(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer[] + */ + function lexicalOrder($n) { + + } +}","function lexicalOrder(n: number): number[] { + +};","(define/contract (lexical-order n) + (-> exact-integer? (listof exact-integer?)) + + )","-spec lexical_order(N :: integer()) -> [integer()]. +lexical_order(N) -> + .","defmodule Solution do + @spec lexical_order(n :: integer) :: [integer] + def lexical_order(n) do + + end +end","class Solution { + List lexicalOrder(int n) { + + } +}", +1837,mini-parser,Mini Parser,385.0,385.0,"

Given a string s represents the serialization of a nested list, implement a parser to deserialize it and return the deserialized NestedInteger.

+ +

Each element is either an integer or a list whose elements may also be integers or other lists.

+ +

 

+

Example 1:

+ +
+Input: s = "324"
+Output: 324
+Explanation: You should return a NestedInteger object which contains a single integer 324.
+
+ +

Example 2:

+ +
+Input: s = "[123,[456,[789]]]"
+Output: [123,[456,[789]]]
+Explanation: Return a NestedInteger object containing a nested list with 2 elements:
+1. An integer containing value 123.
+2. A nested list containing two elements:
+    i.  An integer containing value 456.
+    ii. A nested list with one element:
+         a. An integer containing value 789
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 5 * 104
    • +
  • s consists of digits, square brackets "[]", negative sign '-', and commas ','.
    • +
  • s is the serialization of valid NestedInteger.
    • +
  • All the values in the input are in the range [-106, 106].
    • +
+",2.0,False,"/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * public: + * // Constructor initializes an empty nested list. + * NestedInteger(); + * + * // Constructor initializes a single integer. + * NestedInteger(int value); + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * bool isInteger() const; + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * int getInteger() const; + * + * // Set this NestedInteger to hold a single integer. + * void setInteger(int value); + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * void add(const NestedInteger &ni); + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * const vector &getList() const; + * }; + */ +class Solution { +public: + NestedInteger deserialize(string s) { + + } +};","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * public interface NestedInteger { + * // Constructor initializes an empty nested list. + * public NestedInteger(); + * + * // Constructor initializes a single integer. + * public NestedInteger(int value); + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * public boolean isInteger(); + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * public Integer getInteger(); + * + * // Set this NestedInteger to hold a single integer. + * public void setInteger(int value); + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * public void add(NestedInteger ni); + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return empty list if this NestedInteger holds a single integer + * public List getList(); + * } + */ +class Solution { + public NestedInteger deserialize(String s) { + + } +}","# """""" +# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# """""" +#class NestedInteger(object): +# def __init__(self, value=None): +# """""" +# If value is not specified, initializes an empty list. +# Otherwise initializes a single integer equal to value. +# """""" +# +# def isInteger(self): +# """""" +# @return True if this NestedInteger holds a single integer, rather than a nested list. +# :rtype bool +# """""" +# +# def add(self, elem): +# """""" +# Set this NestedInteger to hold a nested list and adds a nested integer elem to it. +# :rtype void +# """""" +# +# def setInteger(self, value): +# """""" +# Set this NestedInteger to hold a single integer equal to value. +# :rtype void +# """""" +# +# def getInteger(self): +# """""" +# @return the single integer that this NestedInteger holds, if it holds a single integer +# Return None if this NestedInteger holds a nested list +# :rtype int +# """""" +# +# def getList(self): +# """""" +# @return the nested list that this NestedInteger holds, if it holds a nested list +# Return None if this NestedInteger holds a single integer +# :rtype List[NestedInteger] +# """""" + +class Solution(object): + def deserialize(self, s): + """""" + :type s: str + :rtype: NestedInteger + """""" + ","# """""" +# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# """""" +#class NestedInteger: +# def __init__(self, value=None): +# """""" +# If value is not specified, initializes an empty list. +# Otherwise initializes a single integer equal to value. +# """""" +# +# def isInteger(self): +# """""" +# @return True if this NestedInteger holds a single integer, rather than a nested list. +# :rtype bool +# """""" +# +# def add(self, elem): +# """""" +# Set this NestedInteger to hold a nested list and adds a nested integer elem to it. +# :rtype void +# """""" +# +# def setInteger(self, value): +# """""" +# Set this NestedInteger to hold a single integer equal to value. +# :rtype void +# """""" +# +# def getInteger(self): +# """""" +# @return the single integer that this NestedInteger holds, if it holds a single integer +# Return None if this NestedInteger holds a nested list +# :rtype int +# """""" +# +# def getList(self): +# """""" +# @return the nested list that this NestedInteger holds, if it holds a nested list +# Return None if this NestedInteger holds a single integer +# :rtype List[NestedInteger] +# """""" + +class Solution: + def deserialize(self, s: str) -> NestedInteger: + ","/** + * ********************************************************************* + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * ********************************************************************* + * + * // Initializes an empty nested list and return a reference to the nested integer. + * struct NestedInteger *NestedIntegerInit(); + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * bool NestedIntegerIsInteger(struct NestedInteger *); + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * int NestedIntegerGetInteger(struct NestedInteger *); + * + * // Set this NestedInteger to hold a single integer. + * void NestedIntegerSetInteger(struct NestedInteger *ni, int value); + * + * // Set this NestedInteger to hold a nested list and adds a nested integer elem to it. + * void NestedIntegerAdd(struct NestedInteger *ni, struct NestedInteger *elem); + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * struct NestedInteger **NestedIntegerGetList(struct NestedInteger *); + * + * // Return the nested list's size that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * int NestedIntegerGetListSize(struct NestedInteger *); + * }; + */ +struct NestedInteger* deserialize(char * s){ + +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * interface NestedInteger { + * + * // Constructor initializes an empty nested list. + * public NestedInteger(); + * + * // Constructor initializes a single integer. + * public NestedInteger(int value); + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * bool IsInteger(); + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * int GetInteger(); + * + * // Set this NestedInteger to hold a single integer. + * public void SetInteger(int value); + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * public void Add(NestedInteger ni); + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return null if this NestedInteger holds a single integer + * IList GetList(); + * } + */ +public class Solution { + public NestedInteger Deserialize(string s) { + + } +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * function NestedInteger() { + * + * Return true if this NestedInteger holds a single integer, rather than a nested list. + * @return {boolean} + * this.isInteger = function() { + * ... + * }; + * + * Return the single integer that this NestedInteger holds, if it holds a single integer + * Return null if this NestedInteger holds a nested list + * @return {integer} + * this.getInteger = function() { + * ... + * }; + * + * Set this NestedInteger to hold a single integer equal to value. + * @return {void} + * this.setInteger = function(value) { + * ... + * }; + * + * Set this NestedInteger to hold a nested list and adds a nested integer elem to it. + * @return {void} + * this.add = function(elem) { + * ... + * }; + * + * Return the nested list that this NestedInteger holds, if it holds a nested list + * Return null if this NestedInteger holds a single integer + * @return {NestedInteger[]} + * this.getList = function() { + * ... + * }; + * }; + */ +/** + * @param {string} s + * @return {NestedInteger} + */ +var deserialize = function(s) { + +};","# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# +#class NestedInteger +# def is_integer() +# """""" +# Return true if this NestedInteger holds a single integer, rather than a nested list. +# @return {Boolean} +# """""" +# +# def get_integer() +# """""" +# Return the single integer that this NestedInteger holds, if it holds a single integer +# Return nil if this NestedInteger holds a nested list +# @return {Integer} +# """""" +# +# def set_integer(value) +# """""" +# Set this NestedInteger to hold a single integer equal to value. +# @return {Void} +# """""" +# +# def add(elem) +# """""" +# Set this NestedInteger to hold a nested list and adds a nested integer elem to it. +# @return {Void} +# """""" +# +# def get_list() +# """""" +# Return the nested list that this NestedInteger holds, if it holds a nested list +# Return nil if this NestedInteger holds a single integer +# @return {NestedInteger[]} +# """""" + +# @param {String} s +# @return {NestedInteger} +def deserialize(s) + +end","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * public func isInteger() -> Bool + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * public func getInteger() -> Int + * + * // Set this NestedInteger to hold a single integer. + * public func setInteger(value: Int) + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * public func add(elem: NestedInteger) + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * public func getList() -> [NestedInteger] + * } + */ +class Solution { + func deserialize(_ s: String) -> NestedInteger { + + } +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * type NestedInteger struct { + * } + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * func (n NestedInteger) IsInteger() bool {} + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * // So before calling this method, you should have a check + * func (n NestedInteger) GetInteger() int {} + * + * // Set this NestedInteger to hold a single integer. + * func (n *NestedInteger) SetInteger(value int) {} + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * func (n *NestedInteger) Add(elem NestedInteger) {} + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The list length is zero if this NestedInteger holds a single integer + * // You can access NestedInteger's List element directly if you want to modify it + * func (n NestedInteger) GetList() []*NestedInteger {} + */ +func deserialize(s string) *NestedInteger { + +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * trait NestedInteger { + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * def isInteger: Boolean + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer. + * def getInteger: Int + * + * // Set this NestedInteger to hold a single integer. + * def setInteger(i: Int): Unit + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list. + * def getList: Array[NestedInteger] + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * def add(ni: NestedInteger): Unit + * } + */ +object Solution { + def deserialize(s: String): NestedInteger = { + + } +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * // Constructor initializes an empty nested list. + * constructor() + * + * // Constructor initializes a single integer. + * constructor(value: Int) + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * fun isInteger(): Boolean + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * fun getInteger(): Int? + * + * // Set this NestedInteger to hold a single integer. + * fun setInteger(value: Int): Unit + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * fun add(ni: NestedInteger): Unit + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return null if this NestedInteger holds a single integer + * fun getList(): List? + * } + */ +class Solution { + fun deserialize(s: String): NestedInteger { + + } +}","// #[derive(Debug, PartialEq, Eq)] +// pub enum NestedInteger { +// Int(i32), +// List(Vec) +// } +impl Solution { + pub fn deserialize(s: String) -> NestedInteger { + + } +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + + * // if value is not specified, initializes an empty list. + * // Otherwise initializes a single integer equal to value. + * function __construct($value = null) + + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * function isInteger() : bool + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * function getInteger() + * + * // Set this NestedInteger to hold a single integer. + * function setInteger($i) : void + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * function add($ni) : void + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * function getList() : array + * } + */ +class Solution { + + /** + * @param String $s + * @return NestedInteger + */ + function deserialize($s) { + + } +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * If value is provided, then it holds a single integer + * Otherwise it holds an empty nested list + * constructor(value?: number) { + * ... + * }; + * + * Return true if this NestedInteger holds a single integer, rather than a nested list. + * isInteger(): boolean { + * ... + * }; + * + * Return the single integer that this NestedInteger holds, if it holds a single integer + * Return null if this NestedInteger holds a nested list + * getInteger(): number | null { + * ... + * }; + * + * Set this NestedInteger to hold a single integer equal to value. + * setInteger(value: number) { + * ... + * }; + * + * Set this NestedInteger to hold a nested list and adds a nested integer elem to it. + * add(elem: NestedInteger) { + * ... + * }; + * + * Return the nested list that this NestedInteger holds, + * or an empty list if this NestedInteger holds a single integer + * getList(): NestedInteger[] { + * ... + * }; + * }; + */ + +function deserialize(s: string): NestedInteger { + +};",";; This is the interface that allows for creating nested lists. +;; You should not implement it, or speculate about its implementation + +#| + +(define nested-integer% + (class object% + ... + + ; Return true if this nested-integer% holds a single integer, rather than a nested list. + ; -> boolean? + (define/public (is-integer) + ...) + + ; Return the single integer that this nested-integer% holds, if it holds a single integer, + ; or #f if this nested-integer% holds a nested list. + ; -> integer? + (define/public (get-integer) + ...) + + ; Set this nested-integer% to hold a single integer equal to value. + ; -> integer? void? + (define/public (set-integer i) + ...) + + ; Set this nested-integer% to hold a nested list and adds a nested integer elem to it. + ; -> (is-a?/c nested-integer%) void? + (define/public (add ni) + ...) + + ; Return the nested list that this nested-integer% holds, + ; or an empty list if this nested-integer% holds a single integer. + ; -> gvector? + (define/public (get-list) + ...))) + +|# + +(define/contract (deserialize s) + (-> string? (is-a?/c nested-integer%)) + + )","%% % This is the interface that allows for creating nested lists. +%% % You should not implement it, or speculate about its implementation +%% +%% % Create an empty nested list. +%% nested_integer:new() -> nested_integer(). +%% +%% % Create a single integer. +%% nested_integer:new(Val :: integer()) -> nested_integer(). +%% +%% % Return true if argument NestedInteger holds a single integer, rather than a nested list. +%% nested_integer:is_integer(NestedInteger :: nested_integer()) -> boolean(). +%% +%% % Return the single integer that NestedInteger holds, if it holds a single integer. +%% % The result is undefined if it holds a nested list. +%% nested_integer:get_integer(NestedInteger :: nested_integer()) -> integer(). +%% +%% % Return a copy of argument NestedInteger with it set to hold a single integer Val. +%% nested_integer:set_integer(NestedInteger :: nested_integer(), Val :: integer()) -> nested_integer(). +%% +%% % Return a copy of argument NestedInteger with it set to hold a nested list and adds a nested_integer Elem to it. +%% nested_integer:add(NestedInteger :: nested_integer(), Elem :: nested_integer()) -> nested_integer(). +%% +%% % Return the nested list that NestedInteger holds, if it holds a nested list. +%% % The result is undefined if it holds a single integer. +%% nested_integer:get_list(NestedInteger :: nested_integer()) -> array:array(nested_integer()). + +-spec deserialize(S :: unicode:unicode_binary()) -> nested_integer:nested_integer(). +deserialize(S) -> + .","# # This is the interface that allows for creating nested lists. +# # You should not implement it, or speculate about its implementation +# +# # Create an empty nested list. +# :nested_integer.new() :: :nested_integer.nested_integer +# +# # Create a single integer. +# :nested_integer.new(val :: integer) :: :nested_integer.nested_integer +# +# # Return true if argument nested_integer holds a single integer, rather than a nested list. +# :nested_integer.is_integer(nested_integer :: :nested_integer.nested_integer) :: boolean +# +# # Return the single integer that nested_integer holds, if it holds a single integer +# # The result is undefined if it holds a nested list. +# :nested_integer.get_integer(nested_integer :: :nested_integer.nested_integer) :: integer +# +# # Return a copy of argument nested_integer with it set to hold a single integer val. +# :nested_integer.set_integer(nested_integer :: :nested_integer.nested_integer, val :: integer) :: :nested_integer.nested_integer +# +# # Return a copy of argument nested_integer with it set to hold a nested list and adds a nested_integer elem to it. +# :nested_integer.add(nested_integer :: :nested_integer.nested_integer, elem :: :nested_integer.nested_integer) :: :nested_integer.nested_integer +# +# # Return the nested list that nested_integer holds, if it holds a nested list. +# # The result is undefined if it holds a single integer. +# :nested_integer.get_list(nested_integer :: :nested_integer.nested_integer) :: :array.array(:nested_integer.nested_integer) + +defmodule Solution do + @spec deserialize(s :: String.t) :: :nested_integer.nested_integer + def deserialize(s) do + + end +end","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * // If [integer] is an int, constructor initializes a single integer. + * // Otherwise it initializes an empty nested list. + * NestedInteger([int? integer]); + * + * // Returns true if this NestedInteger holds a single integer, rather than a nested list. + * bool isInteger(); + * + * // Returns the single integer that this NestedInteger holds, if it holds a single integer. + * // Returns null if this NestedInteger holds a nested list. + * int getInteger(); + * + * // Sets this NestedInteger to hold a single integer. + * void setInteger(int value); + * + * // Sets this NestedInteger to hold a nested list and adds a nested integer to it. + * void add(NestedInteger ni); + * + * // Returns the nested list that this NestedInteger holds, if it holds a nested list. + * // Returns empty list if this NestedInteger holds a single integer. + * List getList(); + * } + */ +class Solution { + NestedInteger deserialize(String s) { + + } +}", +1840,linked-list-random-node,Linked List Random Node,382.0,382.0,"

Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.

+ +

Implement the Solution class:

+ +
    +
  • Solution(ListNode head) Initializes the object with the head of the singly-linked list head.
    • +
  • int getRandom() Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be chosen.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Solution", "getRandom", "getRandom", "getRandom", "getRandom", "getRandom"]
+[[[1, 2, 3]], [], [], [], [], []]
+Output
+[null, 1, 3, 2, 2, 3]
+
+Explanation
+Solution solution = new Solution([1, 2, 3]);
+solution.getRandom(); // return 1
+solution.getRandom(); // return 3
+solution.getRandom(); // return 2
+solution.getRandom(); // return 2
+solution.getRandom(); // return 3
+// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the linked list will be in the range [1, 104].
    • +
  • -104 <= Node.val <= 104
    • +
  • At most 104 calls will be made to getRandom.
    • +
+ +

 

+

Follow up:

+ +
    +
  • What if the linked list is extremely large and its length is unknown to you?
    • +
  • Could you solve this efficiently without using extra space?
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + Solution(ListNode* head) { + + } + + int getRandom() { + + } +}; + +/** + * Your Solution object will be instantiated and called as such: + * Solution* obj = new Solution(head); + * int param_1 = obj->getRandom(); + */","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + + public Solution(ListNode head) { + + } + + public int getRandom() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(head); + * int param_1 = obj.getRandom(); + */","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + + def __init__(self, head): + """""" + :type head: Optional[ListNode] + """""" + + + def getRandom(self): + """""" + :rtype: int + """""" + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(head) +# param_1 = obj.getRandom()","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + + def __init__(self, head: Optional[ListNode]): + + + def getRandom(self) -> int: + + + +# Your Solution object will be instantiated and called as such: +# obj = Solution(head) +# param_1 = obj.getRandom()","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ + + + +typedef struct { + +} Solution; + + +Solution* solutionCreate(struct ListNode* head) { + +} + +int solutionGetRandom(Solution* obj) { + +} + +void solutionFree(Solution* obj) { + +} + +/** + * Your Solution struct will be instantiated and called as such: + * Solution* obj = solutionCreate(head); + * int param_1 = solutionGetRandom(obj); + + * solutionFree(obj); +*/","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + + public Solution(ListNode head) { + + } + + public int GetRandom() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = new Solution(head); + * int param_1 = obj.GetRandom(); + */","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + */ +var Solution = function(head) { + +}; + +/** + * @return {number} + */ +Solution.prototype.getRandom = function() { + +}; + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(head) + * var param_1 = obj.getRandom() + */","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +class Solution + +=begin + :type head: ListNode +=end + def initialize(head) + + end + + +=begin + :rtype: Integer +=end + def get_random() + + end + + +end + +# Your Solution object will be instantiated and called as such: +# obj = Solution.new(head) +# param_1 = obj.get_random()","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ + +class Solution { + + init(_ head: ListNode?) { + + } + + func getRandom() -> Int { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution(head) + * let ret_1: Int = obj.getRandom() + */","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +type Solution struct { + +} + + +func Constructor(head *ListNode) Solution { + +} + + +func (this *Solution) GetRandom() int { + +} + + +/** + * Your Solution object will be instantiated and called as such: + * obj := Constructor(head); + * param_1 := obj.GetRandom(); + */","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +class Solution(_head: ListNode) { + + def getRandom(): Int = { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(head) + * var param_1 = obj.getRandom() + */","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution(head: ListNode?) { + + fun getRandom(): Int { + + } + +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = Solution(head) + * var param_1 = obj.getRandom() + */","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +struct Solution { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Solution { + + fn new(head: Option>) -> Self { + + } + + fn get_random(&self) -> i32 { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * let obj = Solution::new(head); + * let ret_1: i32 = obj.get_random(); + */","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + /** + * @param ListNode $head + */ + function __construct($head) { + + } + + /** + * @return Integer + */ + function getRandom() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * $obj = Solution($head); + * $ret_1 = $obj->getRandom(); + */","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +class Solution { + constructor(head: ListNode | null) { + + } + + getRandom(): number { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * var obj = new Solution(head) + * var param_1 = obj.getRandom() + */","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define solution% + (class object% + (super-new) + + ; head : (or/c list-node? #f) + (init-field + head) + + ; get-random : -> exact-integer? + (define/public (get-random) + + ))) + +;; Your solution% object will be instantiated and called as such: +;; (define obj (new solution% [head head])) +;; (define param_1 (send obj get-random))","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec solution_init_(Head :: #list_node{} | null) -> any(). +solution_init_(Head) -> + . + +-spec solution_get_random() -> integer(). +solution_get_random() -> + . + + +%% Your functions will be called as such: +%% solution_init_(Head), +%% Param_1 = solution_get_random(), + +%% solution_init_ will be called before every test case, in which you can do some necessary initializations.","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec init_(head :: ListNode.t | nil) :: any + def init_(head) do + + end + + @spec get_random() :: integer + def get_random() do + + end +end + +# Your functions will be called as such: +# Solution.init_(head) +# param_1 = Solution.get_random() + +# Solution.init_ will be called before every test case, in which you can do some necessary initializations.","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + + Solution(ListNode? head) { + + } + + int getRandom() { + + } +} + +/** + * Your Solution object will be instantiated and called as such: + * Solution obj = Solution(head); + * int param1 = obj.getRandom(); + */", +1841,insert-delete-getrandom-o1-duplicates-allowed,Insert Delete GetRandom O(1) - Duplicates allowed,381.0,381.0,"

RandomizedCollection is a data structure that contains a collection of numbers, possibly duplicates (i.e., a multiset). It should support inserting and removing specific elements and also reporting a random element.

+ +

Implement the RandomizedCollection class:

+ +
    +
  • RandomizedCollection() Initializes the empty RandomizedCollection object.
    • +
  • bool insert(int val) Inserts an item val into the multiset, even if the item is already present. Returns true if the item is not present, false otherwise.
    • +
  • bool remove(int val) Removes an item val from the multiset if present. Returns true if the item is present, false otherwise. Note that if val has multiple occurrences in the multiset, we only remove one of them.
    • +
  • int getRandom() Returns a random element from the current multiset of elements. The probability of each element being returned is linearly related to the number of the same values the multiset contains.
    • +
+ +

You must implement the functions of the class such that each function works on average O(1) time complexity.

+ +

Note: The test cases are generated such that getRandom will only be called if there is at least one item in the RandomizedCollection.

+ +

 

+

Example 1:

+ +
+Input
+["RandomizedCollection", "insert", "insert", "insert", "getRandom", "remove", "getRandom"]
+[[], [1], [1], [2], [], [1], []]
+Output
+[null, true, false, true, 2, true, 1]
+
+Explanation
+RandomizedCollection randomizedCollection = new RandomizedCollection();
+randomizedCollection.insert(1);   // return true since the collection does not contain 1.
+                                  // Inserts 1 into the collection.
+randomizedCollection.insert(1);   // return false since the collection contains 1.
+                                  // Inserts another 1 into the collection. Collection now contains [1,1].
+randomizedCollection.insert(2);   // return true since the collection does not contain 2.
+                                  // Inserts 2 into the collection. Collection now contains [1,1,2].
+randomizedCollection.getRandom(); // getRandom should:
+                                  // - return 1 with probability 2/3, or
+                                  // - return 2 with probability 1/3.
+randomizedCollection.remove(1);   // return true since the collection contains 1.
+                                  // Removes 1 from the collection. Collection now contains [1,2].
+randomizedCollection.getRandom(); // getRandom should return 1 or 2, both equally likely.
+
+ +

 

+

Constraints:

+ +
    +
  • -231 <= val <= 231 - 1
    • +
  • At most 2 * 105 calls in total will be made to insert, remove, and getRandom.
    • +
  • There will be at least one element in the data structure when getRandom is called.
    • +
+",3.0,False,"class RandomizedCollection { +public: + RandomizedCollection() { + + } + + bool insert(int val) { + + } + + bool remove(int val) { + + } + + int getRandom() { + + } +}; + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * RandomizedCollection* obj = new RandomizedCollection(); + * bool param_1 = obj->insert(val); + * bool param_2 = obj->remove(val); + * int param_3 = obj->getRandom(); + */","class RandomizedCollection { + + public RandomizedCollection() { + + } + + public boolean insert(int val) { + + } + + public boolean remove(int val) { + + } + + public int getRandom() { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * RandomizedCollection obj = new RandomizedCollection(); + * boolean param_1 = obj.insert(val); + * boolean param_2 = obj.remove(val); + * int param_3 = obj.getRandom(); + */","class RandomizedCollection(object): + + def __init__(self): + + + def insert(self, val): + """""" + :type val: int + :rtype: bool + """""" + + + def remove(self, val): + """""" + :type val: int + :rtype: bool + """""" + + + def getRandom(self): + """""" + :rtype: int + """""" + + + +# Your RandomizedCollection object will be instantiated and called as such: +# obj = RandomizedCollection() +# param_1 = obj.insert(val) +# param_2 = obj.remove(val) +# param_3 = obj.getRandom()","class RandomizedCollection: + + def __init__(self): + + + def insert(self, val: int) -> bool: + + + def remove(self, val: int) -> bool: + + + def getRandom(self) -> int: + + + +# Your RandomizedCollection object will be instantiated and called as such: +# obj = RandomizedCollection() +# param_1 = obj.insert(val) +# param_2 = obj.remove(val) +# param_3 = obj.getRandom()"," + + +typedef struct { + +} RandomizedCollection; + + +RandomizedCollection* randomizedCollectionCreate() { + +} + +bool randomizedCollectionInsert(RandomizedCollection* obj, int val) { + +} + +bool randomizedCollectionRemove(RandomizedCollection* obj, int val) { + +} + +int randomizedCollectionGetRandom(RandomizedCollection* obj) { + +} + +void randomizedCollectionFree(RandomizedCollection* obj) { + +} + +/** + * Your RandomizedCollection struct will be instantiated and called as such: + * RandomizedCollection* obj = randomizedCollectionCreate(); + * bool param_1 = randomizedCollectionInsert(obj, val); + + * bool param_2 = randomizedCollectionRemove(obj, val); + + * int param_3 = randomizedCollectionGetRandom(obj); + + * randomizedCollectionFree(obj); +*/","public class RandomizedCollection { + + public RandomizedCollection() { + + } + + public bool Insert(int val) { + + } + + public bool Remove(int val) { + + } + + public int GetRandom() { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * RandomizedCollection obj = new RandomizedCollection(); + * bool param_1 = obj.Insert(val); + * bool param_2 = obj.Remove(val); + * int param_3 = obj.GetRandom(); + */"," +var RandomizedCollection = function() { + +}; + +/** + * @param {number} val + * @return {boolean} + */ +RandomizedCollection.prototype.insert = function(val) { + +}; + +/** + * @param {number} val + * @return {boolean} + */ +RandomizedCollection.prototype.remove = function(val) { + +}; + +/** + * @return {number} + */ +RandomizedCollection.prototype.getRandom = function() { + +}; + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * var obj = new RandomizedCollection() + * var param_1 = obj.insert(val) + * var param_2 = obj.remove(val) + * var param_3 = obj.getRandom() + */","class RandomizedCollection + def initialize() + + end + + +=begin + :type val: Integer + :rtype: Boolean +=end + def insert(val) + + end + + +=begin + :type val: Integer + :rtype: Boolean +=end + def remove(val) + + end + + +=begin + :rtype: Integer +=end + def get_random() + + end + + +end + +# Your RandomizedCollection object will be instantiated and called as such: +# obj = RandomizedCollection.new() +# param_1 = obj.insert(val) +# param_2 = obj.remove(val) +# param_3 = obj.get_random()"," +class RandomizedCollection { + + init() { + + } + + func insert(_ val: Int) -> Bool { + + } + + func remove(_ val: Int) -> Bool { + + } + + func getRandom() -> Int { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * let obj = RandomizedCollection() + * let ret_1: Bool = obj.insert(val) + * let ret_2: Bool = obj.remove(val) + * let ret_3: Int = obj.getRandom() + */","type RandomizedCollection struct { + +} + + +func Constructor() RandomizedCollection { + +} + + +func (this *RandomizedCollection) Insert(val int) bool { + +} + + +func (this *RandomizedCollection) Remove(val int) bool { + +} + + +func (this *RandomizedCollection) GetRandom() int { + +} + + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * obj := Constructor(); + * param_1 := obj.Insert(val); + * param_2 := obj.Remove(val); + * param_3 := obj.GetRandom(); + */","class RandomizedCollection() { + + def insert(`val`: Int): Boolean = { + + } + + def remove(`val`: Int): Boolean = { + + } + + def getRandom(): Int = { + + } + +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * var obj = new RandomizedCollection() + * var param_1 = obj.insert(`val`) + * var param_2 = obj.remove(`val`) + * var param_3 = obj.getRandom() + */","class RandomizedCollection() { + + fun insert(`val`: Int): Boolean { + + } + + fun remove(`val`: Int): Boolean { + + } + + fun getRandom(): Int { + + } + +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * var obj = RandomizedCollection() + * var param_1 = obj.insert(`val`) + * var param_2 = obj.remove(`val`) + * var param_3 = obj.getRandom() + */","struct RandomizedCollection { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl RandomizedCollection { + + fn new() -> Self { + + } + + fn insert(&self, val: i32) -> bool { + + } + + fn remove(&self, val: i32) -> bool { + + } + + fn get_random(&self) -> i32 { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * let obj = RandomizedCollection::new(); + * let ret_1: bool = obj.insert(val); + * let ret_2: bool = obj.remove(val); + * let ret_3: i32 = obj.get_random(); + */","class RandomizedCollection { + /** + */ + function __construct() { + + } + + /** + * @param Integer $val + * @return Boolean + */ + function insert($val) { + + } + + /** + * @param Integer $val + * @return Boolean + */ + function remove($val) { + + } + + /** + * @return Integer + */ + function getRandom() { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * $obj = RandomizedCollection(); + * $ret_1 = $obj->insert($val); + * $ret_2 = $obj->remove($val); + * $ret_3 = $obj->getRandom(); + */","class RandomizedCollection { + constructor() { + + } + + insert(val: number): boolean { + + } + + remove(val: number): boolean { + + } + + getRandom(): number { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * var obj = new RandomizedCollection() + * var param_1 = obj.insert(val) + * var param_2 = obj.remove(val) + * var param_3 = obj.getRandom() + */","(define randomized-collection% + (class object% + (super-new) + (init-field) + + ; insert : exact-integer? -> boolean? + (define/public (insert val) + + ) + ; remove : exact-integer? -> boolean? + (define/public (remove val) + + ) + ; get-random : -> exact-integer? + (define/public (get-random) + + ))) + +;; Your randomized-collection% object will be instantiated and called as such: +;; (define obj (new randomized-collection%)) +;; (define param_1 (send obj insert val)) +;; (define param_2 (send obj remove val)) +;; (define param_3 (send obj get-random))","-spec randomized_collection_init_() -> any(). +randomized_collection_init_() -> + . + +-spec randomized_collection_insert(Val :: integer()) -> boolean(). +randomized_collection_insert(Val) -> + . + +-spec randomized_collection_remove(Val :: integer()) -> boolean(). +randomized_collection_remove(Val) -> + . + +-spec randomized_collection_get_random() -> integer(). +randomized_collection_get_random() -> + . + + +%% Your functions will be called as such: +%% randomized_collection_init_(), +%% Param_1 = randomized_collection_insert(Val), +%% Param_2 = randomized_collection_remove(Val), +%% Param_3 = randomized_collection_get_random(), + +%% randomized_collection_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule RandomizedCollection do + @spec init_() :: any + def init_() do + + end + + @spec insert(val :: integer) :: boolean + def insert(val) do + + end + + @spec remove(val :: integer) :: boolean + def remove(val) do + + end + + @spec get_random() :: integer + def get_random() do + + end +end + +# Your functions will be called as such: +# RandomizedCollection.init_() +# param_1 = RandomizedCollection.insert(val) +# param_2 = RandomizedCollection.remove(val) +# param_3 = RandomizedCollection.get_random() + +# RandomizedCollection.init_ will be called before every test case, in which you can do some necessary initializations.","class RandomizedCollection { + + RandomizedCollection() { + + } + + bool insert(int val) { + + } + + bool remove(int val) { + + } + + int getRandom() { + + } +} + +/** + * Your RandomizedCollection object will be instantiated and called as such: + * RandomizedCollection obj = RandomizedCollection(); + * bool param1 = obj.insert(val); + * bool param2 = obj.remove(val); + * int param3 = obj.getRandom(); + */", +1843,kth-smallest-element-in-a-sorted-matrix,Kth Smallest Element in a Sorted Matrix,378.0,378.0,"

Given an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix.

+ +

Note that it is the kth smallest element in the sorted order, not the kth distinct element.

+ +

You must find a solution with a memory complexity better than O(n2).

+ +

 

+

Example 1:

+ +
+Input: matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8
+Output: 13
+Explanation: The elements in the matrix are [1,5,9,10,11,12,13,13,15], and the 8th smallest number is 13
+
+ +

Example 2:

+ +
+Input: matrix = [[-5]], k = 1
+Output: -5
+
+ +

 

+

Constraints:

+ +
    +
  • n == matrix.length == matrix[i].length
    • +
  • 1 <= n <= 300
    • +
  • -109 <= matrix[i][j] <= 109
    • +
  • All the rows and columns of matrix are guaranteed to be sorted in non-decreasing order.
    • +
  • 1 <= k <= n2
    • +
+ +

 

+

Follow up:

+ +
    +
  • Could you solve the problem with a constant memory (i.e., O(1) memory complexity)?
    • +
  • Could you solve the problem in O(n) time complexity? The solution may be too advanced for an interview but you may find reading this paper fun.
    • +
+",2.0,False,"class Solution { +public: + int kthSmallest(vector>& matrix, int k) { + + } +};","class Solution { + public int kthSmallest(int[][] matrix, int k) { + + } +}","class Solution(object): + def kthSmallest(self, matrix, k): + """""" + :type matrix: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def kthSmallest(self, matrix: List[List[int]], k: int) -> int: + ","int kthSmallest(int** matrix, int matrixSize, int* matrixColSize, int k){ + +}","public class Solution { + public int KthSmallest(int[][] matrix, int k) { + + } +}","/** + * @param {number[][]} matrix + * @param {number} k + * @return {number} + */ +var kthSmallest = function(matrix, k) { + +};","# @param {Integer[][]} matrix +# @param {Integer} k +# @return {Integer} +def kth_smallest(matrix, k) + +end","class Solution { + func kthSmallest(_ matrix: [[Int]], _ k: Int) -> Int { + + } +}","func kthSmallest(matrix [][]int, k int) int { + +}","object Solution { + def kthSmallest(matrix: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun kthSmallest(matrix: Array, k: Int): Int { + + } +}","impl Solution { + pub fn kth_smallest(matrix: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @param Integer $k + * @return Integer + */ + function kthSmallest($matrix, $k) { + + } +}","function kthSmallest(matrix: number[][], k: number): number { + +};","(define/contract (kth-smallest matrix k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec kth_smallest(Matrix :: [[integer()]], K :: integer()) -> integer(). +kth_smallest(Matrix, K) -> + .","defmodule Solution do + @spec kth_smallest(matrix :: [[integer]], k :: integer) :: integer + def kth_smallest(matrix, k) do + + end +end","class Solution { + int kthSmallest(List> matrix, int k) { + + } +}", +1845,wiggle-subsequence,Wiggle Subsequence,376.0,376.0,"

A wiggle sequence is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with one element and a sequence with two non-equal elements are trivially wiggle sequences.

+ +
    +
  • For example, [1, 7, 4, 9, 2, 5] is a wiggle sequence because the differences (6, -3, 5, -7, 3) alternate between positive and negative.
    • +
  • In contrast, [1, 4, 7, 2, 5] and [1, 7, 4, 5, 5] are not wiggle sequences. The first is not because its first two differences are positive, and the second is not because its last difference is zero.
    • +
+ +

A subsequence is obtained by deleting some elements (possibly zero) from the original sequence, leaving the remaining elements in their original order.

+ +

Given an integer array nums, return the length of the longest wiggle subsequence of nums.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,7,4,9,2,5]
+Output: 6
+Explanation: The entire sequence is a wiggle sequence with differences (6, -3, 5, -7, 3).
+
+ +

Example 2:

+ +
+Input: nums = [1,17,5,10,13,15,10,5,16,8]
+Output: 7
+Explanation: There are several subsequences that achieve this length.
+One is [1, 17, 10, 13, 10, 16, 8] with differences (16, -7, 3, -3, 6, -8).
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4,5,6,7,8,9]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 0 <= nums[i] <= 1000
    • +
+ +

 

+

Follow up: Could you solve this in O(n) time?

+",2.0,False,"class Solution { +public: + int wiggleMaxLength(vector& nums) { + + } +};","class Solution { + public int wiggleMaxLength(int[] nums) { + + } +}","class Solution(object): + def wiggleMaxLength(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def wiggleMaxLength(self, nums: List[int]) -> int: + ","int wiggleMaxLength(int* nums, int numsSize){ + +}","public class Solution { + public int WiggleMaxLength(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var wiggleMaxLength = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def wiggle_max_length(nums) + +end","class Solution { + func wiggleMaxLength(_ nums: [Int]) -> Int { + + } +}","func wiggleMaxLength(nums []int) int { + +}","object Solution { + def wiggleMaxLength(nums: Array[Int]): Int = { + + } +}","class Solution { + fun wiggleMaxLength(nums: IntArray): Int { + + } +}","impl Solution { + pub fn wiggle_max_length(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function wiggleMaxLength($nums) { + + } +}","function wiggleMaxLength(nums: number[]): number { + +};","(define/contract (wiggle-max-length nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec wiggle_max_length(Nums :: [integer()]) -> integer(). +wiggle_max_length(Nums) -> + .","defmodule Solution do + @spec wiggle_max_length(nums :: [integer]) :: integer + def wiggle_max_length(nums) do + + end +end","class Solution { + int wiggleMaxLength(List nums) { + + } +}", +1846,guess-number-higher-or-lower-ii,Guess Number Higher or Lower II,375.0,375.0,"

We are playing the Guessing Game. The game will work as follows:

+ +
    +
  1. I pick a number between 1 and n.
    2. +
  2. You guess a number.
    3. +
  3. If you guess the right number, you win the game.
    4. +
  4. If you guess the wrong number, then I will tell you whether the number I picked is higher or lower, and you will continue guessing.
    5. +
  5. Every time you guess a wrong number x, you will pay x dollars. If you run out of money, you lose the game.
    6. +
+ +

Given a particular n, return the minimum amount of money you need to guarantee a win regardless of what number I pick.

+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 16
+Explanation: The winning strategy is as follows:
+- The range is [1,10]. Guess 7.
+    - If this is my number, your total is $0. Otherwise, you pay $7.
+    - If my number is higher, the range is [8,10]. Guess 9.
+        - If this is my number, your total is $7. Otherwise, you pay $9.
+        - If my number is higher, it must be 10. Guess 10. Your total is $7 + $9 = $16.
+        - If my number is lower, it must be 8. Guess 8. Your total is $7 + $9 = $16.
+    - If my number is lower, the range is [1,6]. Guess 3.
+        - If this is my number, your total is $7. Otherwise, you pay $3.
+        - If my number is higher, the range is [4,6]. Guess 5.
+            - If this is my number, your total is $7 + $3 = $10. Otherwise, you pay $5.
+            - If my number is higher, it must be 6. Guess 6. Your total is $7 + $3 + $5 = $15.
+            - If my number is lower, it must be 4. Guess 4. Your total is $7 + $3 + $5 = $15.
+        - If my number is lower, the range is [1,2]. Guess 1.
+            - If this is my number, your total is $7 + $3 = $10. Otherwise, you pay $1.
+            - If my number is higher, it must be 2. Guess 2. Your total is $7 + $3 + $1 = $11.
+The worst case in all these scenarios is that you pay $16. Hence, you only need $16 to guarantee a win.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 0
+Explanation: There is only one possible number, so you can guess 1 and not have to pay anything.
+
+ +

Example 3:

+ +
+Input: n = 2
+Output: 1
+Explanation: There are two possible numbers, 1 and 2.
+- Guess 1.
+    - If this is my number, your total is $0. Otherwise, you pay $1.
+    - If my number is higher, it must be 2. Guess 2. Your total is $1.
+The worst case is that you pay $1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 200
    • +
+",2.0,False,"class Solution { +public: + int getMoneyAmount(int n) { + + } +};","class Solution { + public int getMoneyAmount(int n) { + + } +}","class Solution(object): + def getMoneyAmount(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def getMoneyAmount(self, n: int) -> int: + ","int getMoneyAmount(int n){ + +}","public class Solution { + public int GetMoneyAmount(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var getMoneyAmount = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def get_money_amount(n) + +end","class Solution { + func getMoneyAmount(_ n: Int) -> Int { + + } +}","func getMoneyAmount(n int) int { + +}","object Solution { + def getMoneyAmount(n: Int): Int = { + + } +}","class Solution { + fun getMoneyAmount(n: Int): Int { + + } +}","impl Solution { + pub fn get_money_amount(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function getMoneyAmount($n) { + + } +}","function getMoneyAmount(n: number): number { + +};","(define/contract (get-money-amount n) + (-> exact-integer? exact-integer?) + + )","-spec get_money_amount(N :: integer()) -> integer(). +get_money_amount(N) -> + .","defmodule Solution do + @spec get_money_amount(n :: integer) :: integer + def get_money_amount(n) do + + end +end","class Solution { + int getMoneyAmount(int n) { + + } +}", +1848,find-k-pairs-with-smallest-sums,Find K Pairs with Smallest Sums,373.0,373.0,"

You are given two integer arrays nums1 and nums2 sorted in non-decreasing order and an integer k.

+ +

Define a pair (u, v) which consists of one element from the first array and one element from the second array.

+ +

Return the k pairs (u1, v1), (u2, v2), ..., (uk, vk) with the smallest sums.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3
+Output: [[1,2],[1,4],[1,6]]
+Explanation: The first 3 pairs are returned from the sequence: [1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
+
+ +

Example 2:

+ +
+Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2
+Output: [[1,1],[1,1]]
+Explanation: The first 2 pairs are returned from the sequence: [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
+
+ +

Example 3:

+ +
+Input: nums1 = [1,2], nums2 = [3], k = 3
+Output: [[1,3],[2,3]]
+Explanation: All possible pairs are returned from the sequence: [1,3],[2,3]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
    • +
  • -109 <= nums1[i], nums2[i] <= 109
    • +
  • nums1 and nums2 both are sorted in non-decreasing order.
    • +
  • 1 <= k <= 104
    • +
+",2.0,False,"class Solution { +public: + vector> kSmallestPairs(vector& nums1, vector& nums2, int k) { + + } +};","class Solution { + public List> kSmallestPairs(int[] nums1, int[] nums2, int k) { + + } +}","class Solution(object): + def kSmallestPairs(self, nums1, nums2, k): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type k: int + :rtype: List[List[int]] + """""" + ","class Solution: + def kSmallestPairs(self, nums1: List[int], nums2: List[int], k: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** kSmallestPairs(int* nums1, int nums1Size, int* nums2, int nums2Size, int k, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> KSmallestPairs(int[] nums1, int[] nums2, int k) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number[][]} + */ +var kSmallestPairs = function(nums1, nums2, k) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} k +# @return {Integer[][]} +def k_smallest_pairs(nums1, nums2, k) + +end","class Solution { + func kSmallestPairs(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> [[Int]] { + + } +}","func kSmallestPairs(nums1 []int, nums2 []int, k int) [][]int { + +}","object Solution { + def kSmallestPairs(nums1: Array[Int], nums2: Array[Int], k: Int): List[List[Int]] = { + + } +}","class Solution { + fun kSmallestPairs(nums1: IntArray, nums2: IntArray, k: Int): List> { + + } +}","impl Solution { + pub fn k_smallest_pairs(nums1: Vec, nums2: Vec, k: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $k + * @return Integer[][] + */ + function kSmallestPairs($nums1, $nums2, $k) { + + } +}","function kSmallestPairs(nums1: number[], nums2: number[], k: number): number[][] { + +};","(define/contract (k-smallest-pairs nums1 nums2 k) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? (listof (listof exact-integer?))) + + )","-spec k_smallest_pairs(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> [[integer()]]. +k_smallest_pairs(Nums1, Nums2, K) -> + .","defmodule Solution do + @spec k_smallest_pairs(nums1 :: [integer], nums2 :: [integer], k :: integer) :: [[integer]] + def k_smallest_pairs(nums1, nums2, k) do + + end +end","class Solution { + List> kSmallestPairs(List nums1, List nums2, int k) { + + } +}", +1849,super-pow,Super Pow,372.0,372.0,"

Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

+ +

 

+

Example 1:

+ +
+Input: a = 2, b = [3]
+Output: 8
+
+ +

Example 2:

+ +
+Input: a = 2, b = [1,0]
+Output: 1024
+
+ +

Example 3:

+ +
+Input: a = 1, b = [4,3,3,8,5,2]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= a <= 231 - 1
    • +
  • 1 <= b.length <= 2000
    • +
  • 0 <= b[i] <= 9
    • +
  • b does not contain leading zeros.
    • +
+",2.0,False,"class Solution { +public: + int superPow(int a, vector& b) { + + } +};","class Solution { + public int superPow(int a, int[] b) { + + } +}","class Solution(object): + def superPow(self, a, b): + """""" + :type a: int + :type b: List[int] + :rtype: int + """""" + ","class Solution: + def superPow(self, a: int, b: List[int]) -> int: + ","int superPow(int a, int* b, int bSize){ + +}","public class Solution { + public int SuperPow(int a, int[] b) { + + } +}","/** + * @param {number} a + * @param {number[]} b + * @return {number} + */ +var superPow = function(a, b) { + +};","# @param {Integer} a +# @param {Integer[]} b +# @return {Integer} +def super_pow(a, b) + +end","class Solution { + func superPow(_ a: Int, _ b: [Int]) -> Int { + + } +}","func superPow(a int, b []int) int { + +}","object Solution { + def superPow(a: Int, b: Array[Int]): Int = { + + } +}","class Solution { + fun superPow(a: Int, b: IntArray): Int { + + } +}","impl Solution { + pub fn super_pow(a: i32, b: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $a + * @param Integer[] $b + * @return Integer + */ + function superPow($a, $b) { + + } +}","function superPow(a: number, b: number[]): number { + +};","(define/contract (super-pow a b) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec super_pow(A :: integer(), B :: [integer()]) -> integer(). +super_pow(A, B) -> + .","defmodule Solution do + @spec super_pow(a :: integer, b :: [integer]) :: integer + def super_pow(a, b) do + + end +end","class Solution { + int superPow(int a, List b) { + + } +}", +1851,largest-divisible-subset,Largest Divisible Subset,368.0,368.0,"

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:

+ +
    +
  • answer[i] % answer[j] == 0, or
    • +
  • answer[j] % answer[i] == 0
    • +
+ +

If there are multiple solutions, return any of them.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3]
+Output: [1,2]
+Explanation: [1,3] is also accepted.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,4,8]
+Output: [1,2,4,8]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 2 * 109
    • +
  • All the integers in nums are unique.
    • +
+",2.0,False,"class Solution { +public: + vector largestDivisibleSubset(vector& nums) { + + } +};","class Solution { + public List largestDivisibleSubset(int[] nums) { + + } +}","class Solution(object): + def largestDivisibleSubset(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def largestDivisibleSubset(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* largestDivisibleSubset(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public IList LargestDivisibleSubset(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var largestDivisibleSubset = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def largest_divisible_subset(nums) + +end","class Solution { + func largestDivisibleSubset(_ nums: [Int]) -> [Int] { + + } +}","func largestDivisibleSubset(nums []int) []int { + +}","object Solution { + def largestDivisibleSubset(nums: Array[Int]): List[Int] = { + + } +}","class Solution { + fun largestDivisibleSubset(nums: IntArray): List { + + } +}","impl Solution { + pub fn largest_divisible_subset(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function largestDivisibleSubset($nums) { + + } +}","function largestDivisibleSubset(nums: number[]): number[] { + +};","(define/contract (largest-divisible-subset nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec largest_divisible_subset(Nums :: [integer()]) -> [integer()]. +largest_divisible_subset(Nums) -> + .","defmodule Solution do + @spec largest_divisible_subset(nums :: [integer]) :: [integer] + def largest_divisible_subset(nums) do + + end +end","class Solution { + List largestDivisibleSubset(List nums) { + + } +}", +1852,valid-perfect-square,Valid Perfect Square,367.0,367.0,"

Given a positive integer num, return true if num is a perfect square or false otherwise.

+ +

A perfect square is an integer that is the square of an integer. In other words, it is the product of some integer with itself.

+ +

You must not use any built-in library function, such as sqrt.

+ +

 

+

Example 1:

+ +
+Input: num = 16
+Output: true
+Explanation: We return true because 4 * 4 = 16 and 4 is an integer.
+
+ +

Example 2:

+ +
+Input: num = 14
+Output: false
+Explanation: We return false because 3.742 * 3.742 = 14 and 3.742 is not an integer.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num <= 231 - 1
    • +
+",1.0,False,"class Solution { +public: + bool isPerfectSquare(int num) { + + } +};","class Solution { + public boolean isPerfectSquare(int num) { + + } +}","class Solution(object): + def isPerfectSquare(self, num): + """""" + :type num: int + :rtype: bool + """""" + ","class Solution: + def isPerfectSquare(self, num: int) -> bool: + ","bool isPerfectSquare(int num){ + +}","public class Solution { + public bool IsPerfectSquare(int num) { + + } +}","/** + * @param {number} num + * @return {boolean} + */ +var isPerfectSquare = function(num) { + +};","# @param {Integer} num +# @return {Boolean} +def is_perfect_square(num) + +end","class Solution { + func isPerfectSquare(_ num: Int) -> Bool { + + } +}","func isPerfectSquare(num int) bool { + +}","object Solution { + def isPerfectSquare(num: Int): Boolean = { + + } +}","class Solution { + fun isPerfectSquare(num: Int): Boolean { + + } +}","impl Solution { + pub fn is_perfect_square(num: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $num + * @return Boolean + */ + function isPerfectSquare($num) { + + } +}","function isPerfectSquare(num: number): boolean { + +};","(define/contract (is-perfect-square num) + (-> exact-integer? boolean?) + + )","-spec is_perfect_square(Num :: integer()) -> boolean(). +is_perfect_square(Num) -> + .","defmodule Solution do + @spec is_perfect_square(num :: integer) :: boolean + def is_perfect_square(num) do + + end +end","class Solution { + bool isPerfectSquare(int num) { + + } +}", +1853,water-and-jug-problem,Water and Jug Problem,365.0,365.0,"

You are given two jugs with capacities jug1Capacity and jug2Capacity liters. There is an infinite amount of water supply available. Determine whether it is possible to measure exactly targetCapacity liters using these two jugs.

+ +

If targetCapacity liters of water are measurable, you must have targetCapacity liters of water contained within one or both buckets by the end.

+ +

Operations allowed:

+ +
    +
  • Fill any of the jugs with water.
    • +
  • Empty any of the jugs.
    • +
  • Pour water from one jug into another till the other jug is completely full, or the first jug itself is empty.
    • +
+ +

 

+

Example 1:

+ +
+Input: jug1Capacity = 3, jug2Capacity = 5, targetCapacity = 4
+Output: true
+Explanation: The famous Die Hard example 
+
+ +

Example 2:

+ +
+Input: jug1Capacity = 2, jug2Capacity = 6, targetCapacity = 5
+Output: false
+
+ +

Example 3:

+ +
+Input: jug1Capacity = 1, jug2Capacity = 2, targetCapacity = 3
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= jug1Capacity, jug2Capacity, targetCapacity <= 106
    • +
+",2.0,False,"class Solution { +public: + bool canMeasureWater(int jug1Capacity, int jug2Capacity, int targetCapacity) { + + } +};","class Solution { + public boolean canMeasureWater(int jug1Capacity, int jug2Capacity, int targetCapacity) { + + } +}","class Solution(object): + def canMeasureWater(self, jug1Capacity, jug2Capacity, targetCapacity): + """""" + :type jug1Capacity: int + :type jug2Capacity: int + :type targetCapacity: int + :rtype: bool + """""" + ","class Solution: + def canMeasureWater(self, jug1Capacity: int, jug2Capacity: int, targetCapacity: int) -> bool: + ","bool canMeasureWater(int jug1Capacity, int jug2Capacity, int targetCapacity){ + +}","public class Solution { + public bool CanMeasureWater(int jug1Capacity, int jug2Capacity, int targetCapacity) { + + } +}","/** + * @param {number} jug1Capacity + * @param {number} jug2Capacity + * @param {number} targetCapacity + * @return {boolean} + */ +var canMeasureWater = function(jug1Capacity, jug2Capacity, targetCapacity) { + +};","# @param {Integer} jug1_capacity +# @param {Integer} jug2_capacity +# @param {Integer} target_capacity +# @return {Boolean} +def can_measure_water(jug1_capacity, jug2_capacity, target_capacity) + +end","class Solution { + func canMeasureWater(_ jug1Capacity: Int, _ jug2Capacity: Int, _ targetCapacity: Int) -> Bool { + + } +}","func canMeasureWater(jug1Capacity int, jug2Capacity int, targetCapacity int) bool { + +}","object Solution { + def canMeasureWater(jug1Capacity: Int, jug2Capacity: Int, targetCapacity: Int): Boolean = { + + } +}","class Solution { + fun canMeasureWater(jug1Capacity: Int, jug2Capacity: Int, targetCapacity: Int): Boolean { + + } +}","impl Solution { + pub fn can_measure_water(jug1_capacity: i32, jug2_capacity: i32, target_capacity: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer $jug1Capacity + * @param Integer $jug2Capacity + * @param Integer $targetCapacity + * @return Boolean + */ + function canMeasureWater($jug1Capacity, $jug2Capacity, $targetCapacity) { + + } +}","function canMeasureWater(jug1Capacity: number, jug2Capacity: number, targetCapacity: number): boolean { + +};","(define/contract (can-measure-water jug1Capacity jug2Capacity targetCapacity) + (-> exact-integer? exact-integer? exact-integer? boolean?) + + )","-spec can_measure_water(Jug1Capacity :: integer(), Jug2Capacity :: integer(), TargetCapacity :: integer()) -> boolean(). +can_measure_water(Jug1Capacity, Jug2Capacity, TargetCapacity) -> + .","defmodule Solution do + @spec can_measure_water(jug1_capacity :: integer, jug2_capacity :: integer, target_capacity :: integer) :: boolean + def can_measure_water(jug1_capacity, jug2_capacity, target_capacity) do + + end +end","class Solution { + bool canMeasureWater(int jug1Capacity, int jug2Capacity, int targetCapacity) { + + } +}", +1854,max-sum-of-rectangle-no-larger-than-k,Max Sum of Rectangle No Larger Than K,363.0,363.0,"

Given an m x n matrix matrix and an integer k, return the max sum of a rectangle in the matrix such that its sum is no larger than k.

+ +

It is guaranteed that there will be a rectangle with a sum no larger than k.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[1,0,1],[0,-2,3]], k = 2
+Output: 2
+Explanation: Because the sum of the blue rectangle [[0, 1], [-2, 3]] is 2, and 2 is the max number no larger than k (k = 2).
+
+ +

Example 2:

+ +
+Input: matrix = [[2,2,-1]], k = 3
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 100
    • +
  • -100 <= matrix[i][j] <= 100
    • +
  • -105 <= k <= 105
    • +
+ +

 

+

Follow up: What if the number of rows is much larger than the number of columns?

+",3.0,False,"class Solution { +public: + int maxSumSubmatrix(vector>& matrix, int k) { + + } +};","class Solution { + public int maxSumSubmatrix(int[][] matrix, int k) { + + } +}","class Solution(object): + def maxSumSubmatrix(self, matrix, k): + """""" + :type matrix: List[List[int]] + :type k: int + :rtype: int + """""" + ","class Solution: + def maxSumSubmatrix(self, matrix: List[List[int]], k: int) -> int: + ","int maxSumSubmatrix(int** matrix, int matrixSize, int* matrixColSize, int k){ + +}","public class Solution { + public int MaxSumSubmatrix(int[][] matrix, int k) { + + } +}","/** + * @param {number[][]} matrix + * @param {number} k + * @return {number} + */ +var maxSumSubmatrix = function(matrix, k) { + +};","# @param {Integer[][]} matrix +# @param {Integer} k +# @return {Integer} +def max_sum_submatrix(matrix, k) + +end","class Solution { + func maxSumSubmatrix(_ matrix: [[Int]], _ k: Int) -> Int { + + } +}","func maxSumSubmatrix(matrix [][]int, k int) int { + +}","object Solution { + def maxSumSubmatrix(matrix: Array[Array[Int]], k: Int): Int = { + + } +}","class Solution { + fun maxSumSubmatrix(matrix: Array, k: Int): Int { + + } +}","impl Solution { + pub fn max_sum_submatrix(matrix: Vec>, k: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @param Integer $k + * @return Integer + */ + function maxSumSubmatrix($matrix, $k) { + + } +}","function maxSumSubmatrix(matrix: number[][], k: number): number { + +};","(define/contract (max-sum-submatrix matrix k) + (-> (listof (listof exact-integer?)) exact-integer? exact-integer?) + + )","-spec max_sum_submatrix(Matrix :: [[integer()]], K :: integer()) -> integer(). +max_sum_submatrix(Matrix, K) -> + .","defmodule Solution do + @spec max_sum_submatrix(matrix :: [[integer]], k :: integer) :: integer + def max_sum_submatrix(matrix, k) do + + end +end","class Solution { + int maxSumSubmatrix(List> matrix, int k) { + + } +}", +1855,count-numbers-with-unique-digits,Count Numbers with Unique Digits,357.0,357.0,"

Given an integer n, return the count of all numbers with unique digits, x, where 0 <= x < 10n.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: 91
+Explanation: The answer should be the total numbers in the range of 0 ≤ x < 100, excluding 11,22,33,44,55,66,77,88,99
+
+ +

Example 2:

+ +
+Input: n = 0
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 8
    • +
+",2.0,False,"class Solution { +public: + int countNumbersWithUniqueDigits(int n) { + + } +};","class Solution { + public int countNumbersWithUniqueDigits(int n) { + + } +}","class Solution(object): + def countNumbersWithUniqueDigits(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countNumbersWithUniqueDigits(self, n: int) -> int: + ","int countNumbersWithUniqueDigits(int n){ + +}","public class Solution { + public int CountNumbersWithUniqueDigits(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countNumbersWithUniqueDigits = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_numbers_with_unique_digits(n) + +end","class Solution { + func countNumbersWithUniqueDigits(_ n: Int) -> Int { + + } +}","func countNumbersWithUniqueDigits(n int) int { + +}","object Solution { + def countNumbersWithUniqueDigits(n: Int): Int = { + + } +}","class Solution { + fun countNumbersWithUniqueDigits(n: Int): Int { + + } +}","impl Solution { + pub fn count_numbers_with_unique_digits(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countNumbersWithUniqueDigits($n) { + + } +}","function countNumbersWithUniqueDigits(n: number): number { + +};","(define/contract (count-numbers-with-unique-digits n) + (-> exact-integer? exact-integer?) + + )","-spec count_numbers_with_unique_digits(N :: integer()) -> integer(). +count_numbers_with_unique_digits(N) -> + .","defmodule Solution do + @spec count_numbers_with_unique_digits(n :: integer) :: integer + def count_numbers_with_unique_digits(n) do + + end +end","class Solution { + int countNumbersWithUniqueDigits(int n) { + + } +}", +1857,russian-doll-envelopes,Russian Doll Envelopes,354.0,354.0,"

You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.

+ +

One envelope can fit into another if and only if both the width and height of one envelope are greater than the other envelope's width and height.

+ +

Return the maximum number of envelopes you can Russian doll (i.e., put one inside the other).

+ +

Note: You cannot rotate an envelope.

+ +

 

+

Example 1:

+ +
+Input: envelopes = [[5,4],[6,4],[6,7],[2,3]]
+Output: 3
+Explanation: The maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).
+
+ +

Example 2:

+ +
+Input: envelopes = [[1,1],[1,1],[1,1]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= envelopes.length <= 105
    • +
  • envelopes[i].length == 2
    • +
  • 1 <= wi, hi <= 105
    • +
+",3.0,False,"class Solution { +public: + int maxEnvelopes(vector>& envelopes) { + + } +};","class Solution { + public int maxEnvelopes(int[][] envelopes) { + + } +}","class Solution(object): + def maxEnvelopes(self, envelopes): + """""" + :type envelopes: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxEnvelopes(self, envelopes: List[List[int]]) -> int: + ","int maxEnvelopes(int** envelopes, int envelopesSize, int* envelopesColSize){ + +}","public class Solution { + public int MaxEnvelopes(int[][] envelopes) { + + } +}","/** + * @param {number[][]} envelopes + * @return {number} + */ +var maxEnvelopes = function(envelopes) { + +};","# @param {Integer[][]} envelopes +# @return {Integer} +def max_envelopes(envelopes) + +end","class Solution { + func maxEnvelopes(_ envelopes: [[Int]]) -> Int { + + } +}","func maxEnvelopes(envelopes [][]int) int { + +}","object Solution { + def maxEnvelopes(envelopes: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxEnvelopes(envelopes: Array): Int { + + } +}","impl Solution { + pub fn max_envelopes(envelopes: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $envelopes + * @return Integer + */ + function maxEnvelopes($envelopes) { + + } +}","function maxEnvelopes(envelopes: number[][]): number { + +};","(define/contract (max-envelopes envelopes) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_envelopes(Envelopes :: [[integer()]]) -> integer(). +max_envelopes(Envelopes) -> + .","defmodule Solution do + @spec max_envelopes(envelopes :: [[integer]]) :: integer + def max_envelopes(envelopes) do + + end +end","class Solution { + int maxEnvelopes(List> envelopes) { + + } +}", +1858,data-stream-as-disjoint-intervals,Data Stream as Disjoint Intervals,352.0,352.0,"

Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals.

+ +

Implement the SummaryRanges class:

+ +
    +
  • SummaryRanges() Initializes the object with an empty stream.
    • +
  • void addNum(int value) Adds the integer value to the stream.
    • +
  • int[][] getIntervals() Returns a summary of the integers in the stream currently as a list of disjoint intervals [starti, endi]. The answer should be sorted by starti.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["SummaryRanges", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals"]
+[[], [1], [], [3], [], [7], [], [2], [], [6], []]
+Output
+[null, null, [[1, 1]], null, [[1, 1], [3, 3]], null, [[1, 1], [3, 3], [7, 7]], null, [[1, 3], [7, 7]], null, [[1, 3], [6, 7]]]
+
+Explanation
+SummaryRanges summaryRanges = new SummaryRanges();
+summaryRanges.addNum(1);      // arr = [1]
+summaryRanges.getIntervals(); // return [[1, 1]]
+summaryRanges.addNum(3);      // arr = [1, 3]
+summaryRanges.getIntervals(); // return [[1, 1], [3, 3]]
+summaryRanges.addNum(7);      // arr = [1, 3, 7]
+summaryRanges.getIntervals(); // return [[1, 1], [3, 3], [7, 7]]
+summaryRanges.addNum(2);      // arr = [1, 2, 3, 7]
+summaryRanges.getIntervals(); // return [[1, 3], [7, 7]]
+summaryRanges.addNum(6);      // arr = [1, 2, 3, 6, 7]
+summaryRanges.getIntervals(); // return [[1, 3], [6, 7]]
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= value <= 104
    • +
  • At most 3 * 104 calls will be made to addNum and getIntervals.
    • +
  • At most 102 calls will be made to getIntervals.
    • +
+ +

 

+

Follow up: What if there are lots of merges and the number of disjoint intervals is small compared to the size of the data stream?

+",3.0,False,"class SummaryRanges { +public: + SummaryRanges() { + + } + + void addNum(int value) { + + } + + vector> getIntervals() { + + } +}; + +/** + * Your SummaryRanges object will be instantiated and called as such: + * SummaryRanges* obj = new SummaryRanges(); + * obj->addNum(value); + * vector> param_2 = obj->getIntervals(); + */","class SummaryRanges { + + public SummaryRanges() { + + } + + public void addNum(int value) { + + } + + public int[][] getIntervals() { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * SummaryRanges obj = new SummaryRanges(); + * obj.addNum(value); + * int[][] param_2 = obj.getIntervals(); + */","class SummaryRanges(object): + + def __init__(self): + + + def addNum(self, value): + """""" + :type value: int + :rtype: None + """""" + + + def getIntervals(self): + """""" + :rtype: List[List[int]] + """""" + + + +# Your SummaryRanges object will be instantiated and called as such: +# obj = SummaryRanges() +# obj.addNum(value) +# param_2 = obj.getIntervals()","class SummaryRanges: + + def __init__(self): + + + def addNum(self, value: int) -> None: + + + def getIntervals(self) -> List[List[int]]: + + + +# Your SummaryRanges object will be instantiated and called as such: +# obj = SummaryRanges() +# obj.addNum(value) +# param_2 = obj.getIntervals()"," + + +typedef struct { + +} SummaryRanges; + + +SummaryRanges* summaryRangesCreate() { + +} + +void summaryRangesAddNum(SummaryRanges* obj, int value) { + +} + +int** summaryRangesGetIntervals(SummaryRanges* obj, int* retSize, int** retColSize) { + +} + +void summaryRangesFree(SummaryRanges* obj) { + +} + +/** + * Your SummaryRanges struct will be instantiated and called as such: + * SummaryRanges* obj = summaryRangesCreate(); + * summaryRangesAddNum(obj, value); + + * int** param_2 = summaryRangesGetIntervals(obj, retSize, retColSize); + + * summaryRangesFree(obj); +*/","public class SummaryRanges { + + public SummaryRanges() { + + } + + public void AddNum(int value) { + + } + + public int[][] GetIntervals() { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * SummaryRanges obj = new SummaryRanges(); + * obj.AddNum(value); + * int[][] param_2 = obj.GetIntervals(); + */"," +var SummaryRanges = function() { + +}; + +/** + * @param {number} value + * @return {void} + */ +SummaryRanges.prototype.addNum = function(value) { + +}; + +/** + * @return {number[][]} + */ +SummaryRanges.prototype.getIntervals = function() { + +}; + +/** + * Your SummaryRanges object will be instantiated and called as such: + * var obj = new SummaryRanges() + * obj.addNum(value) + * var param_2 = obj.getIntervals() + */","class SummaryRanges + def initialize() + + end + + +=begin + :type value: Integer + :rtype: Void +=end + def add_num(value) + + end + + +=begin + :rtype: Integer[][] +=end + def get_intervals() + + end + + +end + +# Your SummaryRanges object will be instantiated and called as such: +# obj = SummaryRanges.new() +# obj.add_num(value) +# param_2 = obj.get_intervals()"," +class SummaryRanges { + + init() { + + } + + func addNum(_ value: Int) { + + } + + func getIntervals() -> [[Int]] { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * let obj = SummaryRanges() + * obj.addNum(value) + * let ret_2: [[Int]] = obj.getIntervals() + */","type SummaryRanges struct { + +} + + +func Constructor() SummaryRanges { + +} + + +func (this *SummaryRanges) AddNum(value int) { + +} + + +func (this *SummaryRanges) GetIntervals() [][]int { + +} + + +/** + * Your SummaryRanges object will be instantiated and called as such: + * obj := Constructor(); + * obj.AddNum(value); + * param_2 := obj.GetIntervals(); + */","class SummaryRanges() { + + def addNum(value: Int) { + + } + + def getIntervals(): Array[Array[Int]] = { + + } + +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * var obj = new SummaryRanges() + * obj.addNum(value) + * var param_2 = obj.getIntervals() + */","class SummaryRanges() { + + fun addNum(value: Int) { + + } + + fun getIntervals(): Array { + + } + +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * var obj = SummaryRanges() + * obj.addNum(value) + * var param_2 = obj.getIntervals() + */","struct SummaryRanges { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl SummaryRanges { + + fn new() -> Self { + + } + + fn add_num(&self, value: i32) { + + } + + fn get_intervals(&self) -> Vec> { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * let obj = SummaryRanges::new(); + * obj.add_num(value); + * let ret_2: Vec> = obj.get_intervals(); + */","class SummaryRanges { + /** + */ + function __construct() { + + } + + /** + * @param Integer $value + * @return NULL + */ + function addNum($value) { + + } + + /** + * @return Integer[][] + */ + function getIntervals() { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * $obj = SummaryRanges(); + * $obj->addNum($value); + * $ret_2 = $obj->getIntervals(); + */","class SummaryRanges { + constructor() { + + } + + addNum(value: number): void { + + } + + getIntervals(): number[][] { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * var obj = new SummaryRanges() + * obj.addNum(value) + * var param_2 = obj.getIntervals() + */","(define summary-ranges% + (class object% + (super-new) + + (init-field) + + ; add-num : exact-integer? -> void? + (define/public (add-num value) + + ) + ; get-intervals : -> (listof (listof exact-integer?)) + (define/public (get-intervals) + + ))) + +;; Your summary-ranges% object will be instantiated and called as such: +;; (define obj (new summary-ranges%)) +;; (send obj add-num value) +;; (define param_2 (send obj get-intervals))","-spec summary_ranges_init_() -> any(). +summary_ranges_init_() -> + . + +-spec summary_ranges_add_num(Value :: integer()) -> any(). +summary_ranges_add_num(Value) -> + . + +-spec summary_ranges_get_intervals() -> [[integer()]]. +summary_ranges_get_intervals() -> + . + + +%% Your functions will be called as such: +%% summary_ranges_init_(), +%% summary_ranges_add_num(Value), +%% Param_2 = summary_ranges_get_intervals(), + +%% summary_ranges_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule SummaryRanges do + @spec init_() :: any + def init_() do + + end + + @spec add_num(value :: integer) :: any + def add_num(value) do + + end + + @spec get_intervals() :: [[integer]] + def get_intervals() do + + end +end + +# Your functions will be called as such: +# SummaryRanges.init_() +# SummaryRanges.add_num(value) +# param_2 = SummaryRanges.get_intervals() + +# SummaryRanges.init_ will be called before every test case, in which you can do some necessary initializations.","class SummaryRanges { + + SummaryRanges() { + + } + + void addNum(int value) { + + } + + List> getIntervals() { + + } +} + +/** + * Your SummaryRanges object will be instantiated and called as such: + * SummaryRanges obj = SummaryRanges(); + * obj.addNum(value); + * List> param2 = obj.getIntervals(); + */", +1860,intersection-of-two-arrays,Intersection of Two Arrays,349.0,349.0,"

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,2,1], nums2 = [2,2]
+Output: [2]
+
+ +

Example 2:

+ +
+Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
+Output: [9,4]
+Explanation: [4,9] is also accepted.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 1000
    • +
  • 0 <= nums1[i], nums2[i] <= 1000
    • +
+",1.0,False,"class Solution { +public: + vector intersection(vector& nums1, vector& nums2) { + + } +};","class Solution { + public int[] intersection(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def intersection(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: List[int] + """""" + ","class Solution: + def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* intersection(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){ + +}","public class Solution { + public int[] Intersection(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number[]} + */ +var intersection = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Integer[]} +def intersection(nums1, nums2) + +end","class Solution { + func intersection(_ nums1: [Int], _ nums2: [Int]) -> [Int] { + + } +}","func intersection(nums1 []int, nums2 []int) []int { + +}","object Solution { + def intersection(nums1: Array[Int], nums2: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun intersection(nums1: IntArray, nums2: IntArray): IntArray { + + } +}","impl Solution { + pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Integer[] + */ + function intersection($nums1, $nums2) { + + } +}","function intersection(nums1: number[], nums2: number[]): number[] { + +};","(define/contract (intersection nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) (listof exact-integer?)) + + )","-spec intersection(Nums1 :: [integer()], Nums2 :: [integer()]) -> [integer()]. +intersection(Nums1, Nums2) -> + .","defmodule Solution do + @spec intersection(nums1 :: [integer], nums2 :: [integer]) :: [integer] + def intersection(nums1, nums2) do + + end +end","class Solution { + List intersection(List nums1, List nums2) { + + } +}", +1861,top-k-frequent-elements,Top K Frequent Elements,347.0,347.0,"

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

+ +

 

+

Example 1:

+
Input: nums = [1,1,1,2,2,3], k = 2
+Output: [1,2]
+

Example 2:

+
Input: nums = [1], k = 1
+Output: [1]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -104 <= nums[i] <= 104
    • +
  • k is in the range [1, the number of unique elements in the array].
    • +
  • It is guaranteed that the answer is unique.
    • +
+ +

 

+

Follow up: Your algorithm's time complexity must be better than O(n log n), where n is the array's size.

+",2.0,False,"class Solution { +public: + vector topKFrequent(vector& nums, int k) { + + } +};","class Solution { + public int[] topKFrequent(int[] nums, int k) { + + } +}","class Solution(object): + def topKFrequent(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def topKFrequent(self, nums: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* topKFrequent(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public int[] TopKFrequent(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var topKFrequent = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer[]} +def top_k_frequent(nums, k) + +end","class Solution { + func topKFrequent(_ nums: [Int], _ k: Int) -> [Int] { + + } +}","func topKFrequent(nums []int, k int) []int { + +}","object Solution { + def topKFrequent(nums: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun topKFrequent(nums: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer[] + */ + function topKFrequent($nums, $k) { + + } +}","function topKFrequent(nums: number[], k: number): number[] { + +};","(define/contract (top-k-frequent nums k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec top_k_frequent(Nums :: [integer()], K :: integer()) -> [integer()]. +top_k_frequent(Nums, K) -> + .","defmodule Solution do + @spec top_k_frequent(nums :: [integer], k :: integer) :: [integer] + def top_k_frequent(nums, k) do + + end +end","class Solution { + List topKFrequent(List nums, int k) { + + } +}", +1866,flatten-nested-list-iterator,Flatten Nested List Iterator,341.0,341.0,"

You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists. Implement an iterator to flatten it.

+ +

Implement the NestedIterator class:

+ +
    +
  • NestedIterator(List<NestedInteger> nestedList) Initializes the iterator with the nested list nestedList.
    • +
  • int next() Returns the next integer in the nested list.
    • +
  • boolean hasNext() Returns true if there are still some integers in the nested list and false otherwise.
    • +
+ +

Your code will be tested with the following pseudocode:

+ +
+initialize iterator with nestedList
+res = []
+while iterator.hasNext()
+    append iterator.next() to the end of res
+return res
+
+ +

If res matches the expected flattened list, then your code will be judged as correct.

+ +

 

+

Example 1:

+ +
+Input: nestedList = [[1,1],2,[1,1]]
+Output: [1,1,2,1,1]
+Explanation: By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,1,2,1,1].
+
+ +

Example 2:

+ +
+Input: nestedList = [1,[4,[6]]]
+Output: [1,4,6]
+Explanation: By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,4,6].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nestedList.length <= 500
    • +
  • The values of the integers in the nested list is in the range [-106, 106].
    • +
+",2.0,False,"/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * public: + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * bool isInteger() const; + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * int getInteger() const; + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * const vector &getList() const; + * }; + */ + +class NestedIterator { +public: + NestedIterator(vector &nestedList) { + + } + + int next() { + + } + + bool hasNext() { + + } +}; + +/** + * Your NestedIterator object will be instantiated and called as such: + * NestedIterator i(nestedList); + * while (i.hasNext()) cout << i.next(); + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * public interface NestedInteger { + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * public boolean isInteger(); + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * public Integer getInteger(); + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return empty list if this NestedInteger holds a single integer + * public List getList(); + * } + */ +public class NestedIterator implements Iterator { + + public NestedIterator(List nestedList) { + + } + + @Override + public Integer next() { + + } + + @Override + public boolean hasNext() { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * NestedIterator i = new NestedIterator(nestedList); + * while (i.hasNext()) v[f()] = i.next(); + */","# """""" +# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# """""" +#class NestedInteger(object): +# def isInteger(self): +# """""" +# @return True if this NestedInteger holds a single integer, rather than a nested list. +# :rtype bool +# """""" +# +# def getInteger(self): +# """""" +# @return the single integer that this NestedInteger holds, if it holds a single integer +# Return None if this NestedInteger holds a nested list +# :rtype int +# """""" +# +# def getList(self): +# """""" +# @return the nested list that this NestedInteger holds, if it holds a nested list +# Return None if this NestedInteger holds a single integer +# :rtype List[NestedInteger] +# """""" + +class NestedIterator(object): + + def __init__(self, nestedList): + """""" + Initialize your data structure here. + :type nestedList: List[NestedInteger] + """""" + + + def next(self): + """""" + :rtype: int + """""" + + + def hasNext(self): + """""" + :rtype: bool + """""" + + +# Your NestedIterator object will be instantiated and called as such: +# i, v = NestedIterator(nestedList), [] +# while i.hasNext(): v.append(i.next())","# """""" +# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# """""" +#class NestedInteger: +# def isInteger(self) -> bool: +# """""" +# @return True if this NestedInteger holds a single integer, rather than a nested list. +# """""" +# +# def getInteger(self) -> int: +# """""" +# @return the single integer that this NestedInteger holds, if it holds a single integer +# Return None if this NestedInteger holds a nested list +# """""" +# +# def getList(self) -> [NestedInteger]: +# """""" +# @return the nested list that this NestedInteger holds, if it holds a nested list +# Return None if this NestedInteger holds a single integer +# """""" + +class NestedIterator: + def __init__(self, nestedList: [NestedInteger]): + + + def next(self) -> int: + + + def hasNext(self) -> bool: + + +# Your NestedIterator object will be instantiated and called as such: +# i, v = NestedIterator(nestedList), [] +# while i.hasNext(): v.append(i.next())","/** + * ********************************************************************* + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * ********************************************************************* + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * bool NestedIntegerIsInteger(struct NestedInteger *); + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * int NestedIntegerGetInteger(struct NestedInteger *); + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * struct NestedInteger **NestedIntegerGetList(struct NestedInteger *); + * + * // Return the nested list's size that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * int NestedIntegerGetListSize(struct NestedInteger *); + * }; + */ +struct NestedIterator { + +}; + +struct NestedIterator *nestedIterCreate(struct NestedInteger** nestedList, int nestedListSize) { + +} + +bool nestedIterHasNext(struct NestedIterator *iter) { + +} + +int nestedIterNext(struct NestedIterator *iter) { + +} + +/** Deallocates memory previously allocated for the iterator */ +void nestedIterFree(struct NestedIterator *iter) { + +} + +/** + * Your NestedIterator will be called like this: + * struct NestedIterator *i = nestedIterCreate(nestedList, nestedListSize); + * while (nestedIterHasNext(i)) printf(""%d\n"", nestedIterNext(i)); + * nestedIterFree(i); + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * interface NestedInteger { + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * bool IsInteger(); + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * int GetInteger(); + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return null if this NestedInteger holds a single integer + * IList GetList(); + * } + */ +public class NestedIterator { + + public NestedIterator(IList nestedList) { + + } + + public bool HasNext() { + + } + + public int Next() { + + } +} + +/** + * Your NestedIterator will be called like this: + * NestedIterator i = new NestedIterator(nestedList); + * while (i.HasNext()) v[f()] = i.Next(); + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * function NestedInteger() { + * + * Return true if this NestedInteger holds a single integer, rather than a nested list. + * @return {boolean} + * this.isInteger = function() { + * ... + * }; + * + * Return the single integer that this NestedInteger holds, if it holds a single integer + * Return null if this NestedInteger holds a nested list + * @return {integer} + * this.getInteger = function() { + * ... + * }; + * + * Return the nested list that this NestedInteger holds, if it holds a nested list + * Return null if this NestedInteger holds a single integer + * @return {NestedInteger[]} + * this.getList = function() { + * ... + * }; + * }; + */ +/** + * @constructor + * @param {NestedInteger[]} nestedList + */ +var NestedIterator = function(nestedList) { + +}; + + +/** + * @this NestedIterator + * @returns {boolean} + */ +NestedIterator.prototype.hasNext = function() { + +}; + +/** + * @this NestedIterator + * @returns {integer} + */ +NestedIterator.prototype.next = function() { + +}; + +/** + * Your NestedIterator will be called like this: + * var i = new NestedIterator(nestedList), a = []; + * while (i.hasNext()) a.push(i.next()); +*/","# This is the interface that allows for creating nested lists. +# You should not implement it, or speculate about its implementation +# +#class NestedInteger +# def is_integer() +# """""" +# Return true if this NestedInteger holds a single integer, rather than a nested list. +# @return {Boolean} +# """""" +# +# def get_integer() +# """""" +# Return the single integer that this NestedInteger holds, if it holds a single integer +# Return nil if this NestedInteger holds a nested list +# @return {Integer} +# """""" +# +# def get_list() +# """""" +# Return the nested list that this NestedInteger holds, if it holds a nested list +# Return nil if this NestedInteger holds a single integer +# @return {NestedInteger[]} +# """""" + +class NestedIterator + # @param {NestedInteger[]} nested_list + def initialize(nested_list) + + end + + # @return {Boolean} + def has_next + + end + + # @return {Integer} + def next + + end +end + +# Your NestedIterator will be called like this: +# i, v = NestedIterator.new(nested_list), [] +# while i.has_next() +# v << i.next +# end","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * public func isInteger() -> Bool + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * public func getInteger() -> Int + * + * // Set this NestedInteger to hold a single integer. + * public func setInteger(value: Int) + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * public func add(elem: NestedInteger) + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * public func getList() -> [NestedInteger] + * } + */ + +class NestedIterator { + + init(_ nestedList: [NestedInteger]) { + + } + + func next() -> Int { + + } + + func hasNext() -> Bool { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * let obj = NestedIterator(nestedList) + * let ret_1: Int = obj.next() + * let ret_2: Bool = obj.hasNext() + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * type NestedInteger struct { + * } + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * func (this NestedInteger) IsInteger() bool {} + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * // So before calling this method, you should have a check + * func (this NestedInteger) GetInteger() int {} + * + * // Set this NestedInteger to hold a single integer. + * func (n *NestedInteger) SetInteger(value int) {} + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * func (this *NestedInteger) Add(elem NestedInteger) {} + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The list length is zero if this NestedInteger holds a single integer + * // You can access NestedInteger's List element directly if you want to modify it + * func (this NestedInteger) GetList() []*NestedInteger {} + */ + +type NestedIterator struct { + +} + +func Constructor(nestedList []*NestedInteger) *NestedIterator { + +} + +func (this *NestedIterator) Next() int { + +} + +func (this *NestedIterator) HasNext() bool { + +}","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * trait NestedInteger { + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * def isInteger: Boolean + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer. + * def getInteger: Int + * + * // Set this NestedInteger to hold a single integer. + * def setInteger(i: Int): Unit + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list. + * def getList: Array[NestedInteger] + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * def add(ni: NestedInteger): Unit + * } + */ + +class NestedIterator(_nestedList: List[NestedInteger]) { + def next(): Int = { + + } + + def hasNext(): Boolean = { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * var obj = new NestedIterator(nestedList) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * // Constructor initializes an empty nested list. + * constructor() + * + * // Constructor initializes a single integer. + * constructor(value: Int) + * + * // @return true if this NestedInteger holds a single integer, rather than a nested list. + * fun isInteger(): Boolean + * + * // @return the single integer that this NestedInteger holds, if it holds a single integer + * // Return null if this NestedInteger holds a nested list + * fun getInteger(): Int? + * + * // Set this NestedInteger to hold a single integer. + * fun setInteger(value: Int): Unit + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * fun add(ni: NestedInteger): Unit + * + * // @return the nested list that this NestedInteger holds, if it holds a nested list + * // Return null if this NestedInteger holds a single integer + * fun getList(): List? + * } + */ + +class NestedIterator(nestedList: List) { + fun next(): Int { + + } + + fun hasNext(): Boolean { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * var obj = NestedIterator(nestedList) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","// #[derive(Debug, PartialEq, Eq)] +// pub enum NestedInteger { +// Int(i32), +// List(Vec) +// } +struct NestedIterator { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl NestedIterator { + + fn new(nestedList: Vec) -> Self { + + } + + fn next(&self) -> i32 { + + } + + fn has_next(&self) -> bool { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * let obj = NestedIterator::new(nestedList); + * let ret_1: i32 = obj.next(); + * let ret_2: bool = obj.has_next(); + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * + * // if value is not specified, initializes an empty list. + * // Otherwise initializes a single integer equal to value. + * function __construct($value = null) + * + * // Return true if this NestedInteger holds a single integer, rather than a nested list. + * function isInteger() : bool + * + * // Return the single integer that this NestedInteger holds, if it holds a single integer + * // The result is undefined if this NestedInteger holds a nested list + * function getInteger() + * + * // Set this NestedInteger to hold a single integer. + * function setInteger($i) : void + * + * // Set this NestedInteger to hold a nested list and adds a nested integer to it. + * function add($ni) : void + * + * // Return the nested list that this NestedInteger holds, if it holds a nested list + * // The result is undefined if this NestedInteger holds a single integer + * function getList() : array + * } + */ + +class NestedIterator { + /** + * @param NestedInteger[] $nestedList + */ + function __construct($nestedList) { + + } + + /** + * @return Integer + */ + function next() { + + } + + /** + * @return Boolean + */ + function hasNext() { + + } +} + +/** + * Your NestedIterator object will be instantiated and called as such: + * $obj = NestedIterator($nestedList); + * $ret_1 = $obj->next(); + * $ret_2 = $obj->hasNext(); + */","/** + * // This is the interface that allows for creating nested lists. + * // You should not implement it, or speculate about its implementation + * class NestedInteger { + * If value is provided, then it holds a single integer + * Otherwise it holds an empty nested list + * constructor(value?: number) { + * ... + * }; + * + * Return true if this NestedInteger holds a single integer, rather than a nested list. + * isInteger(): boolean { + * ... + * }; + * + * Return the single integer that this NestedInteger holds, if it holds a single integer + * Return null if this NestedInteger holds a nested list + * getInteger(): number | null { + * ... + * }; + * + * Set this NestedInteger to hold a single integer equal to value. + * setInteger(value: number) { + * ... + * }; + * + * Set this NestedInteger to hold a nested list and adds a nested integer elem to it. + * add(elem: NestedInteger) { + * ... + * }; + * + * Return the nested list that this NestedInteger holds, + * or an empty list if this NestedInteger holds a single integer + * getList(): NestedInteger[] { + * ... + * }; + * }; + */ + +class NestedIterator { + constructor(nestedList: NestedInteger[]) { + + } + + hasNext(): boolean { + + } + + next(): number { + + } +} + +/** + * Your ParkingSystem object will be instantiated and called as such: + * var obj = new NestedIterator(nestedList) + * var a: number[] = [] + * while (obj.hasNext()) a.push(obj.next()); + */",,,,, +1867,counting-bits,Counting Bits,338.0,338.0,"

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.

+ +

 

+

Example 1:

+ +
+Input: n = 2
+Output: [0,1,1]
+Explanation:
+0 --> 0
+1 --> 1
+2 --> 10
+
+ +

Example 2:

+ +
+Input: n = 5
+Output: [0,1,1,2,1,2]
+Explanation:
+0 --> 0
+1 --> 1
+2 --> 10
+3 --> 11
+4 --> 100
+5 --> 101
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 105
    • +
+ +

 

+

Follow up:

+ +
    +
  • It is very easy to come up with a solution with a runtime of O(n log n). Can you do it in linear time O(n) and possibly in a single pass?
    • +
  • Can you do it without using any built-in function (i.e., like __builtin_popcount in C++)?
    • +
+",1.0,False,"class Solution { +public: + vector countBits(int n) { + + } +};","class Solution { + public int[] countBits(int n) { + + } +}","class Solution(object): + def countBits(self, n): + """""" + :type n: int + :rtype: List[int] + """""" + ","class Solution: + def countBits(self, n: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countBits(int n, int* returnSize){ + +}","public class Solution { + public int[] CountBits(int n) { + + } +}","/** + * @param {number} n + * @return {number[]} + */ +var countBits = function(n) { + +};","# @param {Integer} n +# @return {Integer[]} +def count_bits(n) + +end","class Solution { + func countBits(_ n: Int) -> [Int] { + + } +}","func countBits(n int) []int { + +}","object Solution { + def countBits(n: Int): Array[Int] = { + + } +}","class Solution { + fun countBits(n: Int): IntArray { + + } +}","impl Solution { + pub fn count_bits(n: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer[] + */ + function countBits($n) { + + } +}","function countBits(n: number): number[] { + +};","(define/contract (count-bits n) + (-> exact-integer? (listof exact-integer?)) + + )","-spec count_bits(N :: integer()) -> [integer()]. +count_bits(N) -> + .","defmodule Solution do + @spec count_bits(n :: integer) :: [integer] + def count_bits(n) do + + end +end","class Solution { + List countBits(int n) { + + } +}", +1868,house-robber-iii,House Robber III,337.0,337.0,"

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called root.

+ +

Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will automatically contact the police if two directly-linked houses were broken into on the same night.

+ +

Given the root of the binary tree, return the maximum amount of money the thief can rob without alerting the police.

+ +

 

+

Example 1:

+ +
+Input: root = [3,2,3,null,3,null,1]
+Output: 7
+Explanation: Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
+
+ +

Example 2:

+ +
+Input: root = [3,4,5,1,3,null,1]
+Output: 9
+Explanation: Maximum amount of money the thief can rob = 4 + 5 = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 104].
    • +
  • 0 <= Node.val <= 104
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int rob(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int rob(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def rob(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def rob(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int rob(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int Rob(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var rob = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def rob(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func rob(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func rob(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def rob(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun rob(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn rob(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function rob($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function rob(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (rob root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec rob(Root :: #tree_node{} | null) -> integer(). +rob(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec rob(root :: TreeNode.t | nil) :: integer + def rob(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int rob(TreeNode? root) { + + } +}", +1869,palindrome-pairs,Palindrome Pairs,336.0,336.0,"

You are given a 0-indexed array of unique strings words.

+ +

A palindrome pair is a pair of integers (i, j) such that:

+ +
    +
  • 0 <= i, j < words.length,
    • +
  • i != j, and
    • +
  • words[i] + words[j] (the concatenation of the two strings) is a palindrome.
    • +
+ +

Return an array of all the palindrome pairs of words.

+ +

 

+

Example 1:

+ +
+Input: words = ["abcd","dcba","lls","s","sssll"]
+Output: [[0,1],[1,0],[3,2],[2,4]]
+Explanation: The palindromes are ["abcddcba","dcbaabcd","slls","llssssll"]
+
+ +

Example 2:

+ +
+Input: words = ["bat","tab","cat"]
+Output: [[0,1],[1,0]]
+Explanation: The palindromes are ["battab","tabbat"]
+
+ +

Example 3:

+ +
+Input: words = ["a",""]
+Output: [[0,1],[1,0]]
+Explanation: The palindromes are ["a","a"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 5000
    • +
  • 0 <= words[i].length <= 300
    • +
  • words[i] consists of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + vector> palindromePairs(vector& words) { + + } +};","class Solution { + public List> palindromePairs(String[] words) { + + } +}","class Solution(object): + def palindromePairs(self, words): + """""" + :type words: List[str] + :rtype: List[List[int]] + """""" + ","class Solution: + def palindromePairs(self, words: List[str]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** palindromePairs(char ** words, int wordsSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> PalindromePairs(string[] words) { + + } +}","/** + * @param {string[]} words + * @return {number[][]} + */ +var palindromePairs = function(words) { + +};","# @param {String[]} words +# @return {Integer[][]} +def palindrome_pairs(words) + +end","class Solution { + func palindromePairs(_ words: [String]) -> [[Int]] { + + } +}","func palindromePairs(words []string) [][]int { + +}","object Solution { + def palindromePairs(words: Array[String]): List[List[Int]] = { + + } +}","class Solution { + fun palindromePairs(words: Array): List> { + + } +}","impl Solution { + pub fn palindrome_pairs(words: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param String[] $words + * @return Integer[][] + */ + function palindromePairs($words) { + + } +}","function palindromePairs(words: string[]): number[][] { + +};","(define/contract (palindrome-pairs words) + (-> (listof string?) (listof (listof exact-integer?))) + + )","-spec palindrome_pairs(Words :: [unicode:unicode_binary()]) -> [[integer()]]. +palindrome_pairs(Words) -> + .","defmodule Solution do + @spec palindrome_pairs(words :: [String.t]) :: [[integer]] + def palindrome_pairs(words) do + + end +end","class Solution { + List> palindromePairs(List words) { + + } +}", +1870,self-crossing,Self Crossing,335.0,335.0,"

You are given an array of integers distance.

+ +

You start at the point (0, 0) on an X-Y plane, and you move distance[0] meters to the north, then distance[1] meters to the west, distance[2] meters to the south, distance[3] meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise.

+ +

Return true if your path crosses itself or false if it does not.

+ +

 

+

Example 1:

+ +
+Input: distance = [2,1,1,2]
+Output: true
+Explanation: The path crosses itself at the point (0, 1).
+
+ +

Example 2:

+ +
+Input: distance = [1,2,3,4]
+Output: false
+Explanation: The path does not cross itself at any point.
+
+ +

Example 3:

+ +
+Input: distance = [1,1,1,2,1]
+Output: true
+Explanation: The path crosses itself at the point (0, 0).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= distance.length <= 105
    • +
  • 1 <= distance[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + bool isSelfCrossing(vector& distance) { + + } +};","class Solution { + public boolean isSelfCrossing(int[] distance) { + + } +}","class Solution(object): + def isSelfCrossing(self, distance): + """""" + :type distance: List[int] + :rtype: bool + """""" + ","class Solution: + def isSelfCrossing(self, distance: List[int]) -> bool: + ","bool isSelfCrossing(int* distance, int distanceSize){ + +}","public class Solution { + public bool IsSelfCrossing(int[] distance) { + + } +}","/** + * @param {number[]} distance + * @return {boolean} + */ +var isSelfCrossing = function(distance) { + +};","# @param {Integer[]} distance +# @return {Boolean} +def is_self_crossing(distance) + +end","class Solution { + func isSelfCrossing(_ distance: [Int]) -> Bool { + + } +}","func isSelfCrossing(distance []int) bool { + +}","object Solution { + def isSelfCrossing(distance: Array[Int]): Boolean = { + + } +}","class Solution { + fun isSelfCrossing(distance: IntArray): Boolean { + + } +}","impl Solution { + pub fn is_self_crossing(distance: Vec) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $distance + * @return Boolean + */ + function isSelfCrossing($distance) { + + } +}","function isSelfCrossing(distance: number[]): boolean { + +};","(define/contract (is-self-crossing distance) + (-> (listof exact-integer?) boolean?) + + )","-spec is_self_crossing(Distance :: [integer()]) -> boolean(). +is_self_crossing(Distance) -> + .","defmodule Solution do + @spec is_self_crossing(distance :: [integer]) :: boolean + def is_self_crossing(distance) do + + end +end","class Solution { + bool isSelfCrossing(List distance) { + + } +}", +1872,reconstruct-itinerary,Reconstruct Itinerary,332.0,332.0,"

You are given a list of airline tickets where tickets[i] = [fromi, toi] represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.

+ +

All of the tickets belong to a man who departs from "JFK", thus, the itinerary must begin with "JFK". If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string.

+ +
    +
  • For example, the itinerary ["JFK", "LGA"] has a smaller lexical order than ["JFK", "LGB"].
    • +
+ +

You may assume all tickets form at least one valid itinerary. You must use all the tickets once and only once.

+ +

 

+

Example 1:

+ +
+Input: tickets = [["MUC","LHR"],["JFK","MUC"],["SFO","SJC"],["LHR","SFO"]]
+Output: ["JFK","MUC","LHR","SFO","SJC"]
+
+ +

Example 2:

+ +
+Input: tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]
+Output: ["JFK","ATL","JFK","SFO","ATL","SFO"]
+Explanation: Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"] but it is larger in lexical order.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tickets.length <= 300
    • +
  • tickets[i].length == 2
    • +
  • fromi.length == 3
    • +
  • toi.length == 3
    • +
  • fromi and toi consist of uppercase English letters.
    • +
  • fromi != toi
    • +
+",3.0,False,"class Solution { +public: + vector findItinerary(vector>& tickets) { + + } +};","class Solution { + public List findItinerary(List> tickets) { + + } +}","class Solution(object): + def findItinerary(self, tickets): + """""" + :type tickets: List[List[str]] + :rtype: List[str] + """""" + ","class Solution: + def findItinerary(self, tickets: List[List[str]]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** findItinerary(char *** tickets, int ticketsSize, int* ticketsColSize, int* returnSize){ + +}","public class Solution { + public IList FindItinerary(IList> tickets) { + + } +}","/** + * @param {string[][]} tickets + * @return {string[]} + */ +var findItinerary = function(tickets) { + +};","# @param {String[][]} tickets +# @return {String[]} +def find_itinerary(tickets) + +end","class Solution { + func findItinerary(_ tickets: [[String]]) -> [String] { + + } +}","func findItinerary(tickets [][]string) []string { + +}","object Solution { + def findItinerary(tickets: List[List[String]]): List[String] = { + + } +}","class Solution { + fun findItinerary(tickets: List>): List { + + } +}","impl Solution { + pub fn find_itinerary(tickets: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param String[][] $tickets + * @return String[] + */ + function findItinerary($tickets) { + + } +}","function findItinerary(tickets: string[][]): string[] { + +};","(define/contract (find-itinerary tickets) + (-> (listof (listof string?)) (listof string?)) + + )","-spec find_itinerary(Tickets :: [[unicode:unicode_binary()]]) -> [unicode:unicode_binary()]. +find_itinerary(Tickets) -> + .","defmodule Solution do + @spec find_itinerary(tickets :: [[String.t]]) :: [String.t] + def find_itinerary(tickets) do + + end +end","class Solution { + List findItinerary(List> tickets) { + + } +}", +1874,patching-array,Patching Array,330.0,330.0,"

Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the range [1, n] inclusive can be formed by the sum of some elements in the array.

+ +

Return the minimum number of patches required.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3], n = 6
+Output: 1
+Explanation:
+Combinations of nums are [1], [3], [1,3], which form possible sums of: 1, 3, 4.
+Now if we add/patch 2 to nums, the combinations are: [1], [2], [3], [1,3], [2,3], [1,2,3].
+Possible sums are 1, 2, 3, 4, 5, 6, which now covers the range [1, 6].
+So we only need 1 patch.
+
+ +

Example 2:

+ +
+Input: nums = [1,5,10], n = 20
+Output: 2
+Explanation: The two patches can be [2, 4].
+
+ +

Example 3:

+ +
+Input: nums = [1,2,2], n = 5
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • 1 <= nums[i] <= 104
    • +
  • nums is sorted in ascending order.
    • +
  • 1 <= n <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + int minPatches(vector& nums, int n) { + + } +};","class Solution { + public int minPatches(int[] nums, int n) { + + } +}","class Solution(object): + def minPatches(self, nums, n): + """""" + :type nums: List[int] + :type n: int + :rtype: int + """""" + ","class Solution: + def minPatches(self, nums: List[int], n: int) -> int: + ","int minPatches(int* nums, int numsSize, int n){ + +}","public class Solution { + public int MinPatches(int[] nums, int n) { + + } +}","/** + * @param {number[]} nums + * @param {number} n + * @return {number} + */ +var minPatches = function(nums, n) { + +};","# @param {Integer[]} nums +# @param {Integer} n +# @return {Integer} +def min_patches(nums, n) + +end","class Solution { + func minPatches(_ nums: [Int], _ n: Int) -> Int { + + } +}","func minPatches(nums []int, n int) int { + +}","object Solution { + def minPatches(nums: Array[Int], n: Int): Int = { + + } +}","class Solution { + fun minPatches(nums: IntArray, n: Int): Int { + + } +}","impl Solution { + pub fn min_patches(nums: Vec, n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $n + * @return Integer + */ + function minPatches($nums, $n) { + + } +}","function minPatches(nums: number[], n: number): number { + +};","(define/contract (min-patches nums n) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec min_patches(Nums :: [integer()], N :: integer()) -> integer(). +min_patches(Nums, N) -> + .","defmodule Solution do + @spec min_patches(nums :: [integer], n :: integer) :: integer + def min_patches(nums, n) do + + end +end","class Solution { + int minPatches(List nums, int n) { + + } +}", +1875,longest-increasing-path-in-a-matrix,Longest Increasing Path in a Matrix,329.0,329.0,"

Given an m x n integers matrix, return the length of the longest increasing path in matrix.

+ +

From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary (i.e., wrap-around is not allowed).

+ +

 

+

Example 1:

+ +
+Input: matrix = [[9,9,4],[6,6,8],[2,1,1]]
+Output: 4
+Explanation: The longest increasing path is [1, 2, 6, 9].
+
+ +

Example 2:

+ +
+Input: matrix = [[3,4,5],[3,2,6],[2,2,1]]
+Output: 4
+Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.
+
+ +

Example 3:

+ +
+Input: matrix = [[1]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • 0 <= matrix[i][j] <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + int longestIncreasingPath(vector>& matrix) { + + } +};","class Solution { + public int longestIncreasingPath(int[][] matrix) { + + } +}","class Solution(object): + def longestIncreasingPath(self, matrix): + """""" + :type matrix: List[List[int]] + :rtype: int + """""" + ","class Solution: + def longestIncreasingPath(self, matrix: List[List[int]]) -> int: + ","int longestIncreasingPath(int** matrix, int matrixSize, int* matrixColSize){ + +}","public class Solution { + public int LongestIncreasingPath(int[][] matrix) { + + } +}","/** + * @param {number[][]} matrix + * @return {number} + */ +var longestIncreasingPath = function(matrix) { + +};","# @param {Integer[][]} matrix +# @return {Integer} +def longest_increasing_path(matrix) + +end","class Solution { + func longestIncreasingPath(_ matrix: [[Int]]) -> Int { + + } +}","func longestIncreasingPath(matrix [][]int) int { + +}","object Solution { + def longestIncreasingPath(matrix: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun longestIncreasingPath(matrix: Array): Int { + + } +}","impl Solution { + pub fn longest_increasing_path(matrix: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @return Integer + */ + function longestIncreasingPath($matrix) { + + } +}","function longestIncreasingPath(matrix: number[][]): number { + +};","(define/contract (longest-increasing-path matrix) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec longest_increasing_path(Matrix :: [[integer()]]) -> integer(). +longest_increasing_path(Matrix) -> + .","defmodule Solution do + @spec longest_increasing_path(matrix :: [[integer]]) :: integer + def longest_increasing_path(matrix) do + + end +end","class Solution { + int longestIncreasingPath(List> matrix) { + + } +}", +1877,count-of-range-sum,Count of Range Sum,327.0,327.0,"

Given an integer array nums and two integers lower and upper, return the number of range sums that lie in [lower, upper] inclusive.

+ +

Range sum S(i, j) is defined as the sum of the elements in nums between indices i and j inclusive, where i <= j.

+ +

 

+

Example 1:

+ +
+Input: nums = [-2,5,-1], lower = -2, upper = 2
+Output: 3
+Explanation: The three ranges are: [0,0], [2,2], and [0,2] and their respective sums are: -2, -1, 2.
+
+ +

Example 2:

+ +
+Input: nums = [0], lower = 0, upper = 0
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
  • -105 <= lower <= upper <= 105
    • +
  • The answer is guaranteed to fit in a 32-bit integer.
    • +
+",3.0,False,"class Solution { +public: + int countRangeSum(vector& nums, int lower, int upper) { + + } +};","class Solution { + public int countRangeSum(int[] nums, int lower, int upper) { + + } +}","class Solution(object): + def countRangeSum(self, nums, lower, upper): + """""" + :type nums: List[int] + :type lower: int + :type upper: int + :rtype: int + """""" + ","class Solution: + def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int: + ","int countRangeSum(int* nums, int numsSize, int lower, int upper){ + +}","public class Solution { + public int CountRangeSum(int[] nums, int lower, int upper) { + + } +}","/** + * @param {number[]} nums + * @param {number} lower + * @param {number} upper + * @return {number} + */ +var countRangeSum = function(nums, lower, upper) { + +};","# @param {Integer[]} nums +# @param {Integer} lower +# @param {Integer} upper +# @return {Integer} +def count_range_sum(nums, lower, upper) + +end","class Solution { + func countRangeSum(_ nums: [Int], _ lower: Int, _ upper: Int) -> Int { + + } +}","func countRangeSum(nums []int, lower int, upper int) int { + +}","object Solution { + def countRangeSum(nums: Array[Int], lower: Int, upper: Int): Int = { + + } +}","class Solution { + fun countRangeSum(nums: IntArray, lower: Int, upper: Int): Int { + + } +}","impl Solution { + pub fn count_range_sum(nums: Vec, lower: i32, upper: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $lower + * @param Integer $upper + * @return Integer + */ + function countRangeSum($nums, $lower, $upper) { + + } +}","function countRangeSum(nums: number[], lower: number, upper: number): number { + +};","(define/contract (count-range-sum nums lower upper) + (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?) + + )","-spec count_range_sum(Nums :: [integer()], Lower :: integer(), Upper :: integer()) -> integer(). +count_range_sum(Nums, Lower, Upper) -> + .","defmodule Solution do + @spec count_range_sum(nums :: [integer], lower :: integer, upper :: integer) :: integer + def count_range_sum(nums, lower, upper) do + + end +end","class Solution { + int countRangeSum(List nums, int lower, int upper) { + + } +}", +1879,wiggle-sort-ii,Wiggle Sort II,324.0,324.0,"

Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....

+ +

You may assume the input array always has a valid answer.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,1,1,6,4]
+Output: [1,6,1,5,1,4]
+Explanation: [1,4,1,5,1,6] is also accepted.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,2,2,3,1]
+Output: [2,3,1,3,1,2]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5 * 104
    • +
  • 0 <= nums[i] <= 5000
    • +
  • It is guaranteed that there will be an answer for the given input nums.
    • +
+ +

 

+Follow Up: Can you do it in O(n) time and/or in-place with O(1) extra space?",2.0,False,"class Solution { +public: + void wiggleSort(vector& nums) { + + } +};","class Solution { + public void wiggleSort(int[] nums) { + + } +}","class Solution(object): + def wiggleSort(self, nums): + """""" + :type nums: List[int] + :rtype: None Do not return anything, modify nums in-place instead. + """""" + ","class Solution: + def wiggleSort(self, nums: List[int]) -> None: + """""" + Do not return anything, modify nums in-place instead. + """""" + ","void wiggleSort(int* nums, int numsSize){ + +}","public class Solution { + public void WiggleSort(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {void} Do not return anything, modify nums in-place instead. + */ +var wiggleSort = function(nums) { + +};","# @param {Integer[]} nums +# @return {Void} Do not return anything, modify nums in-place instead. +def wiggle_sort(nums) + +end","class Solution { + func wiggleSort(_ nums: inout [Int]) { + + } +}","func wiggleSort(nums []int) { + +}","object Solution { + def wiggleSort(nums: Array[Int]): Unit = { + + } +}","class Solution { + fun wiggleSort(nums: IntArray): Unit { + + } +}","impl Solution { + pub fn wiggle_sort(nums: &mut Vec) { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return NULL + */ + function wiggleSort(&$nums) { + + } +}","/** + Do not return anything, modify nums in-place instead. + */ +function wiggleSort(nums: number[]): void { + +};",,,,"class Solution { + void wiggleSort(List nums) { + + } +}", +1881,create-maximum-number,Create Maximum Number,321.0,321.0,"

You are given two integer arrays nums1 and nums2 of lengths m and n respectively. nums1 and nums2 represent the digits of two numbers. You are also given an integer k.

+ +

Create the maximum number of length k <= m + n from digits of the two numbers. The relative order of the digits from the same array must be preserved.

+ +

Return an array of the k digits representing the answer.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
+Output: [9,8,6,5,3]
+
+ +

Example 2:

+ +
+Input: nums1 = [6,7], nums2 = [6,0,4], k = 5
+Output: [6,7,6,0,4]
+
+ +

Example 3:

+ +
+Input: nums1 = [3,9], nums2 = [8,9], k = 3
+Output: [9,8,9]
+
+ +

 

+

Constraints:

+ +
    +
  • m == nums1.length
    • +
  • n == nums2.length
    • +
  • 1 <= m, n <= 500
    • +
  • 0 <= nums1[i], nums2[i] <= 9
    • +
  • 1 <= k <= m + n
    • +
+",3.0,False,"class Solution { +public: + vector maxNumber(vector& nums1, vector& nums2, int k) { + + } +};","class Solution { + public int[] maxNumber(int[] nums1, int[] nums2, int k) { + + } +}","class Solution(object): + def maxNumber(self, nums1, nums2, k): + """""" + :type nums1: List[int] + :type nums2: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxNumber(int* nums1, int nums1Size, int* nums2, int nums2Size, int k, int* returnSize){ + +}","public class Solution { + public int[] MaxNumber(int[] nums1, int[] nums2, int k) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @param {number} k + * @return {number[]} + */ +var maxNumber = function(nums1, nums2, k) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @param {Integer} k +# @return {Integer[]} +def max_number(nums1, nums2, k) + +end","class Solution { + func maxNumber(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> [Int] { + + } +}","func maxNumber(nums1 []int, nums2 []int, k int) []int { + +}","object Solution { + def maxNumber(nums1: Array[Int], nums2: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun maxNumber(nums1: IntArray, nums2: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn max_number(nums1: Vec, nums2: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @param Integer $k + * @return Integer[] + */ + function maxNumber($nums1, $nums2, $k) { + + } +}","function maxNumber(nums1: number[], nums2: number[], k: number): number[] { + +};","(define/contract (max-number nums1 nums2 k) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec max_number(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> [integer()]. +max_number(Nums1, Nums2, K) -> + .","defmodule Solution do + @spec max_number(nums1 :: [integer], nums2 :: [integer], k :: integer) :: [integer] + def max_number(nums1, nums2, k) do + + end +end","class Solution { + List maxNumber(List nums1, List nums2, int k) { + + } +}", +1885,count-of-smaller-numbers-after-self,Count of Smaller Numbers After Self,315.0,315.0,"

Given an integer array nums, return an integer array counts where counts[i] is the number of smaller elements to the right of nums[i].

+ +

 

+

Example 1:

+ +
+Input: nums = [5,2,6,1]
+Output: [2,1,1,0]
+Explanation:
+To the right of 5 there are 2 smaller elements (2 and 1).
+To the right of 2 there is only 1 smaller element (1).
+To the right of 6 there is 1 smaller element (1).
+To the right of 1 there is 0 smaller element.
+
+ +

Example 2:

+ +
+Input: nums = [-1]
+Output: [0]
+
+ +

Example 3:

+ +
+Input: nums = [-1,-1]
+Output: [0,0]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -104 <= nums[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + vector countSmaller(vector& nums) { + + } +};","class Solution { + public List countSmaller(int[] nums) { + + } +}","class Solution(object): + def countSmaller(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def countSmaller(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* countSmaller(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public IList CountSmaller(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var countSmaller = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def count_smaller(nums) + +end","class Solution { + func countSmaller(_ nums: [Int]) -> [Int] { + + } +}","func countSmaller(nums []int) []int { + +}","object Solution { + def countSmaller(nums: Array[Int]): List[Int] = { + + } +}","class Solution { + fun countSmaller(nums: IntArray): List { + + } +}","impl Solution { + pub fn count_smaller(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function countSmaller($nums) { + + } +}","function countSmaller(nums: number[]): number[] { + +};","(define/contract (count-smaller nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec count_smaller(Nums :: [integer()]) -> [integer()]. +count_smaller(Nums) -> + .","defmodule Solution do + @spec count_smaller(nums :: [integer]) :: [integer] + def count_smaller(nums) do + + end +end","class Solution { + List countSmaller(List nums) { + + } +}", +1886,super-ugly-number,Super Ugly Number,313.0,313.0,"

A super ugly number is a positive integer whose prime factors are in the array primes.

+ +

Given an integer n and an array of integers primes, return the nth super ugly number.

+ +

The nth super ugly number is guaranteed to fit in a 32-bit signed integer.

+ +

 

+

Example 1:

+ +
+Input: n = 12, primes = [2,7,13,19]
+Output: 32
+Explanation: [1,2,4,7,8,13,14,16,19,26,28,32] is the sequence of the first 12 super ugly numbers given primes = [2,7,13,19].
+
+ +

Example 2:

+ +
+Input: n = 1, primes = [2,3,5]
+Output: 1
+Explanation: 1 has no prime factors, therefore all of its prime factors are in the array primes = [2,3,5].
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • 1 <= primes.length <= 100
    • +
  • 2 <= primes[i] <= 1000
    • +
  • primes[i] is guaranteed to be a prime number.
    • +
  • All the values of primes are unique and sorted in ascending order.
    • +
+",2.0,False,"class Solution { +public: + int nthSuperUglyNumber(int n, vector& primes) { + + } +};","class Solution { + public int nthSuperUglyNumber(int n, int[] primes) { + + } +}","class Solution(object): + def nthSuperUglyNumber(self, n, primes): + """""" + :type n: int + :type primes: List[int] + :rtype: int + """""" + ","class Solution: + def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int: + ","int nthSuperUglyNumber(int n, int* primes, int primesSize){ + +}","public class Solution { + public int NthSuperUglyNumber(int n, int[] primes) { + + } +}","/** + * @param {number} n + * @param {number[]} primes + * @return {number} + */ +var nthSuperUglyNumber = function(n, primes) { + +};","# @param {Integer} n +# @param {Integer[]} primes +# @return {Integer} +def nth_super_ugly_number(n, primes) + +end","class Solution { + func nthSuperUglyNumber(_ n: Int, _ primes: [Int]) -> Int { + + } +}","func nthSuperUglyNumber(n int, primes []int) int { + +}","object Solution { + def nthSuperUglyNumber(n: Int, primes: Array[Int]): Int = { + + } +}","class Solution { + fun nthSuperUglyNumber(n: Int, primes: IntArray): Int { + + } +}","impl Solution { + pub fn nth_super_ugly_number(n: i32, primes: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer[] $primes + * @return Integer + */ + function nthSuperUglyNumber($n, $primes) { + + } +}","function nthSuperUglyNumber(n: number, primes: number[]): number { + +};","(define/contract (nth-super-ugly-number n primes) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec nth_super_ugly_number(N :: integer(), Primes :: [integer()]) -> integer(). +nth_super_ugly_number(N, Primes) -> + .","defmodule Solution do + @spec nth_super_ugly_number(n :: integer, primes :: [integer]) :: integer + def nth_super_ugly_number(n, primes) do + + end +end","class Solution { + int nthSuperUglyNumber(int n, List primes) { + + } +}", +1887,burst-balloons,Burst Balloons,312.0,312.0,"

You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons.

+ +

If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds of the array, then treat it as if there is a balloon with a 1 painted on it.

+ +

Return the maximum coins you can collect by bursting the balloons wisely.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,1,5,8]
+Output: 167
+Explanation:
+nums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> []
+coins =  3*1*5    +   3*5*8   +  1*3*8  + 1*8*1 = 167
+ +

Example 2:

+ +
+Input: nums = [1,5]
+Output: 10
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 300
    • +
  • 0 <= nums[i] <= 100
    • +
+",3.0,False,"class Solution { +public: + int maxCoins(vector& nums) { + + } +};","class Solution { + public int maxCoins(int[] nums) { + + } +}","class Solution(object): + def maxCoins(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxCoins(self, nums: List[int]) -> int: + ","int maxCoins(int* nums, int numsSize){ + +}","public class Solution { + public int MaxCoins(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxCoins = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_coins(nums) + +end","class Solution { + func maxCoins(_ nums: [Int]) -> Int { + + } +}","func maxCoins(nums []int) int { + +}","object Solution { + def maxCoins(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxCoins(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_coins(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxCoins($nums) { + + } +}","function maxCoins(nums: number[]): number { + +};","(define/contract (max-coins nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_coins(Nums :: [integer()]) -> integer(). +max_coins(Nums) -> + .","defmodule Solution do + @spec max_coins(nums :: [integer]) :: integer + def max_coins(nums) do + + end +end","class Solution { + int maxCoins(List nums) { + + } +}", +1889,best-time-to-buy-and-sell-stock-with-cooldown,Best Time to Buy and Sell Stock with Cooldown,309.0,309.0,"

You are given an array prices where prices[i] is the price of a given stock on the ith day.

+ +

Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

+ +
    +
  • After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).
    • +
+ +

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

+ +

 

+

Example 1:

+ +
+Input: prices = [1,2,3,0,2]
+Output: 3
+Explanation: transactions = [buy, sell, cooldown, buy, sell]
+
+ +

Example 2:

+ +
+Input: prices = [1]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= prices.length <= 5000
    • +
  • 0 <= prices[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int maxProfit(vector& prices) { + + } +};","class Solution { + public int maxProfit(int[] prices) { + + } +}","class Solution(object): + def maxProfit(self, prices): + """""" + :type prices: List[int] + :rtype: int + """""" + ","class Solution: + def maxProfit(self, prices: List[int]) -> int: + ","int maxProfit(int* prices, int pricesSize){ + +}","public class Solution { + public int MaxProfit(int[] prices) { + + } +}","/** + * @param {number[]} prices + * @return {number} + */ +var maxProfit = function(prices) { + +};","# @param {Integer[]} prices +# @return {Integer} +def max_profit(prices) + +end","class Solution { + func maxProfit(_ prices: [Int]) -> Int { + + } +}","func maxProfit(prices []int) int { + +}","object Solution { + def maxProfit(prices: Array[Int]): Int = { + + } +}","class Solution { + fun maxProfit(prices: IntArray): Int { + + } +}","impl Solution { + pub fn max_profit(prices: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $prices + * @return Integer + */ + function maxProfit($prices) { + + } +}","function maxProfit(prices: number[]): number { + +};","(define/contract (max-profit prices) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_profit(Prices :: [integer()]) -> integer(). +max_profit(Prices) -> + .","defmodule Solution do + @spec max_profit(prices :: [integer]) :: integer + def max_profit(prices) do + + end +end","class Solution { + int maxProfit(List prices) { + + } +}", +1892,range-sum-query-2d-immutable,Range Sum Query 2D - Immutable,304.0,304.0,"

Given a 2D matrix matrix, handle multiple queries of the following type:

+ +
    +
  • Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
    • +
+ +

Implement the NumMatrix class:

+ +
    +
  • NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix.
    • +
  • int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
    • +
+ +

You must design an algorithm where sumRegion works on O(1) time complexity.

+ +

 

+

Example 1:

+ +
+Input
+["NumMatrix", "sumRegion", "sumRegion", "sumRegion"]
+[[[[3, 0, 1, 4, 2], [5, 6, 3, 2, 1], [1, 2, 0, 1, 5], [4, 1, 0, 1, 7], [1, 0, 3, 0, 5]]], [2, 1, 4, 3], [1, 1, 2, 2], [1, 2, 2, 4]]
+Output
+[null, 8, 11, 12]
+
+Explanation
+NumMatrix numMatrix = new NumMatrix([[3, 0, 1, 4, 2], [5, 6, 3, 2, 1], [1, 2, 0, 1, 5], [4, 1, 0, 1, 7], [1, 0, 3, 0, 5]]);
+numMatrix.sumRegion(2, 1, 4, 3); // return 8 (i.e sum of the red rectangle)
+numMatrix.sumRegion(1, 1, 2, 2); // return 11 (i.e sum of the green rectangle)
+numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle)
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • -104 <= matrix[i][j] <= 104
    • +
  • 0 <= row1 <= row2 < m
    • +
  • 0 <= col1 <= col2 < n
    • +
  • At most 104 calls will be made to sumRegion.
    • +
+",2.0,False,"class NumMatrix { +public: + NumMatrix(vector>& matrix) { + + } + + int sumRegion(int row1, int col1, int row2, int col2) { + + } +}; + +/** + * Your NumMatrix object will be instantiated and called as such: + * NumMatrix* obj = new NumMatrix(matrix); + * int param_1 = obj->sumRegion(row1,col1,row2,col2); + */","class NumMatrix { + + public NumMatrix(int[][] matrix) { + + } + + public int sumRegion(int row1, int col1, int row2, int col2) { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * NumMatrix obj = new NumMatrix(matrix); + * int param_1 = obj.sumRegion(row1,col1,row2,col2); + */","class NumMatrix(object): + + def __init__(self, matrix): + """""" + :type matrix: List[List[int]] + """""" + + + def sumRegion(self, row1, col1, row2, col2): + """""" + :type row1: int + :type col1: int + :type row2: int + :type col2: int + :rtype: int + """""" + + + +# Your NumMatrix object will be instantiated and called as such: +# obj = NumMatrix(matrix) +# param_1 = obj.sumRegion(row1,col1,row2,col2)","class NumMatrix: + + def __init__(self, matrix: List[List[int]]): + + + def sumRegion(self, row1: int, col1: int, row2: int, col2: int) -> int: + + + +# Your NumMatrix object will be instantiated and called as such: +# obj = NumMatrix(matrix) +# param_1 = obj.sumRegion(row1,col1,row2,col2)"," + + +typedef struct { + +} NumMatrix; + + +NumMatrix* numMatrixCreate(int** matrix, int matrixSize, int* matrixColSize) { + +} + +int numMatrixSumRegion(NumMatrix* obj, int row1, int col1, int row2, int col2) { + +} + +void numMatrixFree(NumMatrix* obj) { + +} + +/** + * Your NumMatrix struct will be instantiated and called as such: + * NumMatrix* obj = numMatrixCreate(matrix, matrixSize, matrixColSize); + * int param_1 = numMatrixSumRegion(obj, row1, col1, row2, col2); + + * numMatrixFree(obj); +*/","public class NumMatrix { + + public NumMatrix(int[][] matrix) { + + } + + public int SumRegion(int row1, int col1, int row2, int col2) { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * NumMatrix obj = new NumMatrix(matrix); + * int param_1 = obj.SumRegion(row1,col1,row2,col2); + */","/** + * @param {number[][]} matrix + */ +var NumMatrix = function(matrix) { + +}; + +/** + * @param {number} row1 + * @param {number} col1 + * @param {number} row2 + * @param {number} col2 + * @return {number} + */ +NumMatrix.prototype.sumRegion = function(row1, col1, row2, col2) { + +}; + +/** + * Your NumMatrix object will be instantiated and called as such: + * var obj = new NumMatrix(matrix) + * var param_1 = obj.sumRegion(row1,col1,row2,col2) + */","class NumMatrix + +=begin + :type matrix: Integer[][] +=end + def initialize(matrix) + + end + + +=begin + :type row1: Integer + :type col1: Integer + :type row2: Integer + :type col2: Integer + :rtype: Integer +=end + def sum_region(row1, col1, row2, col2) + + end + + +end + +# Your NumMatrix object will be instantiated and called as such: +# obj = NumMatrix.new(matrix) +# param_1 = obj.sum_region(row1, col1, row2, col2)"," +class NumMatrix { + + init(_ matrix: [[Int]]) { + + } + + func sumRegion(_ row1: Int, _ col1: Int, _ row2: Int, _ col2: Int) -> Int { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * let obj = NumMatrix(matrix) + * let ret_1: Int = obj.sumRegion(row1, col1, row2, col2) + */","type NumMatrix struct { + +} + + +func Constructor(matrix [][]int) NumMatrix { + +} + + +func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int { + +} + + +/** + * Your NumMatrix object will be instantiated and called as such: + * obj := Constructor(matrix); + * param_1 := obj.SumRegion(row1,col1,row2,col2); + */","class NumMatrix(_matrix: Array[Array[Int]]) { + + def sumRegion(row1: Int, col1: Int, row2: Int, col2: Int): Int = { + + } + +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * var obj = new NumMatrix(matrix) + * var param_1 = obj.sumRegion(row1,col1,row2,col2) + */","class NumMatrix(matrix: Array) { + + fun sumRegion(row1: Int, col1: Int, row2: Int, col2: Int): Int { + + } + +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * var obj = NumMatrix(matrix) + * var param_1 = obj.sumRegion(row1,col1,row2,col2) + */","struct NumMatrix { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl NumMatrix { + + fn new(matrix: Vec>) -> Self { + + } + + fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * let obj = NumMatrix::new(matrix); + * let ret_1: i32 = obj.sum_region(row1, col1, row2, col2); + */","class NumMatrix { + /** + * @param Integer[][] $matrix + */ + function __construct($matrix) { + + } + + /** + * @param Integer $row1 + * @param Integer $col1 + * @param Integer $row2 + * @param Integer $col2 + * @return Integer + */ + function sumRegion($row1, $col1, $row2, $col2) { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * $obj = NumMatrix($matrix); + * $ret_1 = $obj->sumRegion($row1, $col1, $row2, $col2); + */","class NumMatrix { + constructor(matrix: number[][]) { + + } + + sumRegion(row1: number, col1: number, row2: number, col2: number): number { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * var obj = new NumMatrix(matrix) + * var param_1 = obj.sumRegion(row1,col1,row2,col2) + */","(define num-matrix% + (class object% + (super-new) + + ; matrix : (listof (listof exact-integer?)) + (init-field + matrix) + + ; sum-region : exact-integer? exact-integer? exact-integer? exact-integer? -> exact-integer? + (define/public (sum-region row1 col1 row2 col2) + + ))) + +;; Your num-matrix% object will be instantiated and called as such: +;; (define obj (new num-matrix% [matrix matrix])) +;; (define param_1 (send obj sum-region row1 col1 row2 col2))","-spec num_matrix_init_(Matrix :: [[integer()]]) -> any(). +num_matrix_init_(Matrix) -> + . + +-spec num_matrix_sum_region(Row1 :: integer(), Col1 :: integer(), Row2 :: integer(), Col2 :: integer()) -> integer(). +num_matrix_sum_region(Row1, Col1, Row2, Col2) -> + . + + +%% Your functions will be called as such: +%% num_matrix_init_(Matrix), +%% Param_1 = num_matrix_sum_region(Row1, Col1, Row2, Col2), + +%% num_matrix_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule NumMatrix do + @spec init_(matrix :: [[integer]]) :: any + def init_(matrix) do + + end + + @spec sum_region(row1 :: integer, col1 :: integer, row2 :: integer, col2 :: integer) :: integer + def sum_region(row1, col1, row2, col2) do + + end +end + +# Your functions will be called as such: +# NumMatrix.init_(matrix) +# param_1 = NumMatrix.sum_region(row1, col1, row2, col2) + +# NumMatrix.init_ will be called before every test case, in which you can do some necessary initializations.","class NumMatrix { + + NumMatrix(List> matrix) { + + } + + int sumRegion(int row1, int col1, int row2, int col2) { + + } +} + +/** + * Your NumMatrix object will be instantiated and called as such: + * NumMatrix obj = NumMatrix(matrix); + * int param1 = obj.sumRegion(row1,col1,row2,col2); + */", +1894,remove-invalid-parentheses,Remove Invalid Parentheses,301.0,301.0,"

Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.

+ +

Return a list of unique strings that are valid with the minimum number of removals. You may return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: s = "()())()"
+Output: ["(())()","()()()"]
+
+ +

Example 2:

+ +
+Input: s = "(a)())()"
+Output: ["(a())()","(a)()()"]
+
+ +

Example 3:

+ +
+Input: s = ")("
+Output: [""]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 25
    • +
  • s consists of lowercase English letters and parentheses '(' and ')'.
    • +
  • There will be at most 20 parentheses in s.
    • +
+",3.0,False,"class Solution { +public: + vector removeInvalidParentheses(string s) { + + } +};","class Solution { + public List removeInvalidParentheses(String s) { + + } +}","class Solution(object): + def removeInvalidParentheses(self, s): + """""" + :type s: str + :rtype: List[str] + """""" + ","class Solution: + def removeInvalidParentheses(self, s: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** removeInvalidParentheses(char * s, int* returnSize){ + +}","public class Solution { + public IList RemoveInvalidParentheses(string s) { + + } +}","/** + * @param {string} s + * @return {string[]} + */ +var removeInvalidParentheses = function(s) { + +};","# @param {String} s +# @return {String[]} +def remove_invalid_parentheses(s) + +end","class Solution { + func removeInvalidParentheses(_ s: String) -> [String] { + + } +}","func removeInvalidParentheses(s string) []string { + +}","object Solution { + def removeInvalidParentheses(s: String): List[String] = { + + } +}","class Solution { + fun removeInvalidParentheses(s: String): List { + + } +}","impl Solution { + pub fn remove_invalid_parentheses(s: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @return String[] + */ + function removeInvalidParentheses($s) { + + } +}","function removeInvalidParentheses(s: string): string[] { + +};","(define/contract (remove-invalid-parentheses s) + (-> string? (listof string?)) + + )","-spec remove_invalid_parentheses(S :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +remove_invalid_parentheses(S) -> + .","defmodule Solution do + @spec remove_invalid_parentheses(s :: String.t) :: [String.t] + def remove_invalid_parentheses(s) do + + end +end","class Solution { + List removeInvalidParentheses(String s) { + + } +}", +1895,longest-increasing-subsequence,Longest Increasing Subsequence,300.0,300.0,"

Given an integer array nums, return the length of the longest strictly increasing subsequence.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,9,2,5,3,7,101,18]
+Output: 4
+Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
+
+ +

Example 2:

+ +
+Input: nums = [0,1,0,3,2,3]
+Output: 4
+
+ +

Example 3:

+ +
+Input: nums = [7,7,7,7,7,7,7]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2500
    • +
  • -104 <= nums[i] <= 104
    • +
+ +

 

+

Follow up: Can you come up with an algorithm that runs in O(n log(n)) time complexity?

+",2.0,False,"class Solution { +public: + int lengthOfLIS(vector& nums) { + + } +};","class Solution { + public int lengthOfLIS(int[] nums) { + + } +}","class Solution(object): + def lengthOfLIS(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def lengthOfLIS(self, nums: List[int]) -> int: + ","int lengthOfLIS(int* nums, int numsSize){ + +}","public class Solution { + public int LengthOfLIS(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var lengthOfLIS = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def length_of_lis(nums) + +end","class Solution { + func lengthOfLIS(_ nums: [Int]) -> Int { + + } +}","func lengthOfLIS(nums []int) int { + +}","object Solution { + def lengthOfLIS(nums: Array[Int]): Int = { + + } +}","class Solution { + fun lengthOfLIS(nums: IntArray): Int { + + } +}","impl Solution { + pub fn length_of_lis(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function lengthOfLIS($nums) { + + } +}","function lengthOfLIS(nums: number[]): number { + +};","(define/contract (length-of-lis nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec length_of_lis(Nums :: [integer()]) -> integer(). +length_of_lis(Nums) -> + .","defmodule Solution do + @spec length_of_lis(nums :: [integer]) :: integer + def length_of_lis(nums) do + + end +end","class Solution { + int lengthOfLIS(List nums) { + + } +}", +1896,bulls-and-cows,Bulls and Cows,299.0,299.0,"

You are playing the Bulls and Cows game with your friend.

+ +

You write down a secret number and ask your friend to guess what the number is. When your friend makes a guess, you provide a hint with the following info:

+ +
    +
  • The number of "bulls", which are digits in the guess that are in the correct position.
    • +
  • The number of "cows", which are digits in the guess that are in your secret number but are located in the wrong position. Specifically, the non-bull digits in the guess that could be rearranged such that they become bulls.
    • +
+ +

Given the secret number secret and your friend's guess guess, return the hint for your friend's guess.

+ +

The hint should be formatted as "xAyB", where x is the number of bulls and y is the number of cows. Note that both secret and guess may contain duplicate digits.

+ +

 

+

Example 1:

+ +
+Input: secret = "1807", guess = "7810"
+Output: "1A3B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1807"
+  |
+"7810"
+ +

Example 2:

+ +
+Input: secret = "1123", guess = "0111"
+Output: "1A1B"
+Explanation: Bulls are connected with a '|' and cows are underlined:
+"1123"        "1123"
+  |      or     |
+"0111"        "0111"
+Note that only one of the two unmatched 1s is counted as a cow since the non-bull digits can only be rearranged to allow one 1 to be a bull.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= secret.length, guess.length <= 1000
    • +
  • secret.length == guess.length
    • +
  • secret and guess consist of digits only.
    • +
+",2.0,False,"class Solution { +public: + string getHint(string secret, string guess) { + + } +};","class Solution { + public String getHint(String secret, String guess) { + + } +}","class Solution(object): + def getHint(self, secret, guess): + """""" + :type secret: str + :type guess: str + :rtype: str + """""" + ","class Solution: + def getHint(self, secret: str, guess: str) -> str: + ","char * getHint(char * secret, char * guess){ + +}","public class Solution { + public string GetHint(string secret, string guess) { + + } +}","/** + * @param {string} secret + * @param {string} guess + * @return {string} + */ +var getHint = function(secret, guess) { + +};","# @param {String} secret +# @param {String} guess +# @return {String} +def get_hint(secret, guess) + +end","class Solution { + func getHint(_ secret: String, _ guess: String) -> String { + + } +}","func getHint(secret string, guess string) string { + +}","object Solution { + def getHint(secret: String, guess: String): String = { + + } +}","class Solution { + fun getHint(secret: String, guess: String): String { + + } +}","impl Solution { + pub fn get_hint(secret: String, guess: String) -> String { + + } +}","class Solution { + + /** + * @param String $secret + * @param String $guess + * @return String + */ + function getHint($secret, $guess) { + + } +}","function getHint(secret: string, guess: string): string { + +};","(define/contract (get-hint secret guess) + (-> string? string? string?) + + )","-spec get_hint(Secret :: unicode:unicode_binary(), Guess :: unicode:unicode_binary()) -> unicode:unicode_binary(). +get_hint(Secret, Guess) -> + .","defmodule Solution do + @spec get_hint(secret :: String.t, guess :: String.t) :: String.t + def get_hint(secret, guess) do + + end +end","class Solution { + String getHint(String secret, String guess) { + + } +}", +1897,serialize-and-deserialize-binary-tree,Serialize and Deserialize Binary Tree,297.0,297.0,"

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

+ +

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

+ +

Clarification: The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,null,null,4,5]
+Output: [1,2,3,null,null,4,5]
+
+ +

Example 2:

+ +
+Input: root = []
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 104].
    • +
  • -1000 <= Node.val <= 1000
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode(int x) : val(x), left(NULL), right(NULL) {} + * }; + */ +class Codec { +public: + + // Encodes a tree to a single string. + string serialize(TreeNode* root) { + + } + + // Decodes your encoded data to tree. + TreeNode* deserialize(string data) { + + } +}; + +// Your Codec object will be instantiated and called as such: +// Codec ser, deser; +// TreeNode* ans = deser.deserialize(ser.serialize(root));","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ +public class Codec { + + // Encodes a tree to a single string. + public String serialize(TreeNode root) { + + } + + // Decodes your encoded data to tree. + public TreeNode deserialize(String data) { + + } +} + +// Your Codec object will be instantiated and called as such: +// Codec ser = new Codec(); +// Codec deser = new Codec(); +// TreeNode ans = deser.deserialize(ser.serialize(root));","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Codec: + + def serialize(self, root): + """"""Encodes a tree to a single string. + + :type root: TreeNode + :rtype: str + """""" + + + def deserialize(self, data): + """"""Decodes your encoded data to tree. + + :type data: str + :rtype: TreeNode + """""" + + +# Your Codec object will be instantiated and called as such: +# ser = Codec() +# deser = Codec() +# ans = deser.deserialize(ser.serialize(root))","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Codec: + + def serialize(self, root): + """"""Encodes a tree to a single string. + + :type root: TreeNode + :rtype: str + """""" + + + def deserialize(self, data): + """"""Decodes your encoded data to tree. + + :type data: str + :rtype: TreeNode + """""" + + +# Your Codec object will be instantiated and called as such: +# ser = Codec() +# deser = Codec() +# ans = deser.deserialize(ser.serialize(root))","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** Encodes a tree to a single string. */ +char* serialize(struct TreeNode* root) { + +} + +/** Decodes your encoded data to tree. */ +struct TreeNode* deserialize(char* data) { + +} + +// Your functions will be called as such: +// char* data = serialize(root); +// deserialize(data);","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int x) { val = x; } + * } + */ +public class Codec { + + // Encodes a tree to a single string. + public string serialize(TreeNode root) { + + } + + // Decodes your encoded data to tree. + public TreeNode deserialize(string data) { + + } +} + +// Your Codec object will be instantiated and called as such: +// Codec ser = new Codec(); +// Codec deser = new Codec(); +// TreeNode ans = deser.deserialize(ser.serialize(root));","/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ + +/** + * Encodes a tree to a single string. + * + * @param {TreeNode} root + * @return {string} + */ +var serialize = function(root) { + +}; + +/** + * Decodes your encoded data to tree. + * + * @param {string} data + * @return {TreeNode} + */ +var deserialize = function(data) { + +}; + +/** + * Your functions will be called as such: + * deserialize(serialize(root)); + */","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val) +# @val = val +# @left, @right = nil, nil +# end +# end + +# Encodes a tree to a single string. +# +# @param {TreeNode} root +# @return {string} +def serialize(root) + +end + +# Decodes your encoded data to tree. +# +# @param {string} data +# @return {TreeNode} +def deserialize(data) + +end + + +# Your functions will be called as such: +# deserialize(serialize(data))","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init(_ val: Int) { + * self.val = val + * self.left = nil + * self.right = nil + * } + * } + */ + +class Codec { + func serialize(_ root: TreeNode?) -> String { + + } + + func deserialize(_ data: String) -> TreeNode? { + + } +} + +// Your Codec object will be instantiated and called as such: +// var ser = Codec() +// var deser = Codec() +// deser.deserialize(ser.serialize(root))","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ + +type Codec struct { + +} + +func Constructor() Codec { + +} + +// Serializes a tree to a single string. +func (this *Codec) serialize(root *TreeNode) string { + +} + +// Deserializes your encoded data to tree. +func (this *Codec) deserialize(data string) *TreeNode { + +} + + +/** + * Your Codec object will be instantiated and called as such: + * ser := Constructor(); + * deser := Constructor(); + * data := ser.serialize(root); + * ans := deser.deserialize(data); + */","/** + * Definition for a binary tree node. + * class TreeNode(var _value: Int) { + * var value: Int = _value + * var left: TreeNode = null + * var right: TreeNode = null + * } + */ + +class Codec { + // Encodes a list of strings to a single string. + def serialize(root: TreeNode): String = { + + } + + // Decodes a single string to a list of strings. + def deserialize(data: String): TreeNode = { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * var ser = new Codec() + * var deser = new Codec() + * val s = ser.serialize(root) + * val ans = deser.deserialize(s) + */","/** + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ + +class Codec() { + // Encodes a URL to a shortened URL. + fun serialize(root: TreeNode?): String { + + } + + // Decodes your encoded data to tree. + fun deserialize(data: String): TreeNode? { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * var ser = Codec() + * var deser = Codec() + * var data = ser.serialize(longUrl) + * var ans = deser.deserialize(data) + */","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +struct Codec { + +} + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Codec { + fn new() -> Self { + + } + + fn serialize(&self, root: Option>>) -> String { + + } + + fn deserialize(&self, data: String) -> Option>> { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * let obj = Codec::new(); + * let data: String = obj.serialize(strs); + * let ans: Option>> = obj.deserialize(data); + */","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($value) { $this->val = $value; } + * } + */ + +class Codec { + function __construct() { + + } + + /** + * @param TreeNode $root + * @return String + */ + function serialize($root) { + + } + + /** + * @param String $data + * @return TreeNode + */ + function deserialize($data) { + + } +} + +/** + * Your Codec object will be instantiated and called as such: + * $ser = Codec(); + * $deser = Codec(); + * $data = $ser->serialize($root); + * $ans = $deser->deserialize($data); + */","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +/* + * Encodes a tree to a single string. + */ +function serialize(root: TreeNode | null): string { + +}; + +/* + * Decodes your encoded data to tree. + */ +function deserialize(data: string): TreeNode | null { + +}; + + +/** + * Your functions will be called as such: + * deserialize(serialize(root)); + */",,,,, +1898,find-median-from-data-stream,Find Median from Data Stream,295.0,295.0,"

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.

+ +
    +
  • For example, for arr = [2,3,4], the median is 3.
    • +
  • For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5.
    • +
+ +

Implement the MedianFinder class:

+ +
    +
  • MedianFinder() initializes the MedianFinder object.
    • +
  • void addNum(int num) adds the integer num from the data stream to the data structure.
    • +
  • double findMedian() returns the median of all elements so far. Answers within 10-5 of the actual answer will be accepted.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
+[[], [1], [2], [], [3], []]
+Output
+[null, null, null, 1.5, null, 2.0]
+
+Explanation
+MedianFinder medianFinder = new MedianFinder();
+medianFinder.addNum(1);    // arr = [1]
+medianFinder.addNum(2);    // arr = [1, 2]
+medianFinder.findMedian(); // return 1.5 (i.e., (1 + 2) / 2)
+medianFinder.addNum(3);    // arr[1, 2, 3]
+medianFinder.findMedian(); // return 2.0
+
+ +

 

+

Constraints:

+ +
    +
  • -105 <= num <= 105
    • +
  • There will be at least one element in the data structure before calling findMedian.
    • +
  • At most 5 * 104 calls will be made to addNum and findMedian.
    • +
+ +

 

+

Follow up:

+ +
    +
  • If all integer numbers from the stream are in the range [0, 100], how would you optimize your solution?
    • +
  • If 99% of all integer numbers from the stream are in the range [0, 100], how would you optimize your solution?
    • +
+",3.0,False,"class MedianFinder { +public: + MedianFinder() { + + } + + void addNum(int num) { + + } + + double findMedian() { + + } +}; + +/** + * Your MedianFinder object will be instantiated and called as such: + * MedianFinder* obj = new MedianFinder(); + * obj->addNum(num); + * double param_2 = obj->findMedian(); + */","class MedianFinder { + + public MedianFinder() { + + } + + public void addNum(int num) { + + } + + public double findMedian() { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * MedianFinder obj = new MedianFinder(); + * obj.addNum(num); + * double param_2 = obj.findMedian(); + */","class MedianFinder(object): + + def __init__(self): + + + def addNum(self, num): + """""" + :type num: int + :rtype: None + """""" + + + def findMedian(self): + """""" + :rtype: float + """""" + + + +# Your MedianFinder object will be instantiated and called as such: +# obj = MedianFinder() +# obj.addNum(num) +# param_2 = obj.findMedian()","class MedianFinder: + + def __init__(self): + + + def addNum(self, num: int) -> None: + + + def findMedian(self) -> float: + + + +# Your MedianFinder object will be instantiated and called as such: +# obj = MedianFinder() +# obj.addNum(num) +# param_2 = obj.findMedian()"," + + +typedef struct { + +} MedianFinder; + + +MedianFinder* medianFinderCreate() { + +} + +void medianFinderAddNum(MedianFinder* obj, int num) { + +} + +double medianFinderFindMedian(MedianFinder* obj) { + +} + +void medianFinderFree(MedianFinder* obj) { + +} + +/** + * Your MedianFinder struct will be instantiated and called as such: + * MedianFinder* obj = medianFinderCreate(); + * medianFinderAddNum(obj, num); + + * double param_2 = medianFinderFindMedian(obj); + + * medianFinderFree(obj); +*/","public class MedianFinder { + + public MedianFinder() { + + } + + public void AddNum(int num) { + + } + + public double FindMedian() { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * MedianFinder obj = new MedianFinder(); + * obj.AddNum(num); + * double param_2 = obj.FindMedian(); + */"," +var MedianFinder = function() { + +}; + +/** + * @param {number} num + * @return {void} + */ +MedianFinder.prototype.addNum = function(num) { + +}; + +/** + * @return {number} + */ +MedianFinder.prototype.findMedian = function() { + +}; + +/** + * Your MedianFinder object will be instantiated and called as such: + * var obj = new MedianFinder() + * obj.addNum(num) + * var param_2 = obj.findMedian() + */","class MedianFinder + def initialize() + + end + + +=begin + :type num: Integer + :rtype: Void +=end + def add_num(num) + + end + + +=begin + :rtype: Float +=end + def find_median() + + end + + +end + +# Your MedianFinder object will be instantiated and called as such: +# obj = MedianFinder.new() +# obj.add_num(num) +# param_2 = obj.find_median()"," +class MedianFinder { + + init() { + + } + + func addNum(_ num: Int) { + + } + + func findMedian() -> Double { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * let obj = MedianFinder() + * obj.addNum(num) + * let ret_2: Double = obj.findMedian() + */","type MedianFinder struct { + +} + + +func Constructor() MedianFinder { + +} + + +func (this *MedianFinder) AddNum(num int) { + +} + + +func (this *MedianFinder) FindMedian() float64 { + +} + + +/** + * Your MedianFinder object will be instantiated and called as such: + * obj := Constructor(); + * obj.AddNum(num); + * param_2 := obj.FindMedian(); + */","class MedianFinder() { + + def addNum(num: Int) { + + } + + def findMedian(): Double = { + + } + +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * var obj = new MedianFinder() + * obj.addNum(num) + * var param_2 = obj.findMedian() + */","class MedianFinder() { + + fun addNum(num: Int) { + + } + + fun findMedian(): Double { + + } + +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * var obj = MedianFinder() + * obj.addNum(num) + * var param_2 = obj.findMedian() + */","struct MedianFinder { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl MedianFinder { + + fn new() -> Self { + + } + + fn add_num(&self, num: i32) { + + } + + fn find_median(&self) -> f64 { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * let obj = MedianFinder::new(); + * obj.add_num(num); + * let ret_2: f64 = obj.find_median(); + */","class MedianFinder { + /** + */ + function __construct() { + + } + + /** + * @param Integer $num + * @return NULL + */ + function addNum($num) { + + } + + /** + * @return Float + */ + function findMedian() { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * $obj = MedianFinder(); + * $obj->addNum($num); + * $ret_2 = $obj->findMedian(); + */","class MedianFinder { + constructor() { + + } + + addNum(num: number): void { + + } + + findMedian(): number { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * var obj = new MedianFinder() + * obj.addNum(num) + * var param_2 = obj.findMedian() + */","(define median-finder% + (class object% + (super-new) + (init-field) + + ; add-num : exact-integer? -> void? + (define/public (add-num num) + + ) + ; find-median : -> flonum? + (define/public (find-median) + + ))) + +;; Your median-finder% object will be instantiated and called as such: +;; (define obj (new median-finder%)) +;; (send obj add-num num) +;; (define param_2 (send obj find-median))","-spec median_finder_init_() -> any(). +median_finder_init_() -> + . + +-spec median_finder_add_num(Num :: integer()) -> any(). +median_finder_add_num(Num) -> + . + +-spec median_finder_find_median() -> float(). +median_finder_find_median() -> + . + + +%% Your functions will be called as such: +%% median_finder_init_(), +%% median_finder_add_num(Num), +%% Param_2 = median_finder_find_median(), + +%% median_finder_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule MedianFinder do + @spec init_() :: any + def init_() do + + end + + @spec add_num(num :: integer) :: any + def add_num(num) do + + end + + @spec find_median() :: float + def find_median() do + + end +end + +# Your functions will be called as such: +# MedianFinder.init_() +# MedianFinder.add_num(num) +# param_2 = MedianFinder.find_median() + +# MedianFinder.init_ will be called before every test case, in which you can do some necessary initializations.","class MedianFinder { + + MedianFinder() { + + } + + void addNum(int num) { + + } + + double findMedian() { + + } +} + +/** + * Your MedianFinder object will be instantiated and called as such: + * MedianFinder obj = MedianFinder(); + * obj.addNum(num); + * double param2 = obj.findMedian(); + */", +1900,word-pattern,Word Pattern,290.0,290.0,"

Given a pattern and a string s, find if s follows the same pattern.

+ +

Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.

+ +

 

+

Example 1:

+ +
+Input: pattern = "abba", s = "dog cat cat dog"
+Output: true
+
+ +

Example 2:

+ +
+Input: pattern = "abba", s = "dog cat cat fish"
+Output: false
+
+ +

Example 3:

+ +
+Input: pattern = "aaaa", s = "dog cat cat dog"
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= pattern.length <= 300
    • +
  • pattern contains only lower-case English letters.
    • +
  • 1 <= s.length <= 3000
    • +
  • s contains only lowercase English letters and spaces ' '.
    • +
  • s does not contain any leading or trailing spaces.
    • +
  • All the words in s are separated by a single space.
    • +
+",1.0,False,"class Solution { +public: + bool wordPattern(string pattern, string s) { + + } +};","class Solution { + public boolean wordPattern(String pattern, String s) { + + } +}","class Solution(object): + def wordPattern(self, pattern, s): + """""" + :type pattern: str + :type s: str + :rtype: bool + """""" + ","class Solution: + def wordPattern(self, pattern: str, s: str) -> bool: + ","bool wordPattern(char * pattern, char * s){ + +}","public class Solution { + public bool WordPattern(string pattern, string s) { + + } +}","/** + * @param {string} pattern + * @param {string} s + * @return {boolean} + */ +var wordPattern = function(pattern, s) { + +};","# @param {String} pattern +# @param {String} s +# @return {Boolean} +def word_pattern(pattern, s) + +end","class Solution { + func wordPattern(_ pattern: String, _ s: String) -> Bool { + + } +}","func wordPattern(pattern string, s string) bool { + +}","object Solution { + def wordPattern(pattern: String, s: String): Boolean = { + + } +}","class Solution { + fun wordPattern(pattern: String, s: String): Boolean { + + } +}","impl Solution { + pub fn word_pattern(pattern: String, s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $pattern + * @param String $s + * @return Boolean + */ + function wordPattern($pattern, $s) { + + } +}","function wordPattern(pattern: string, s: string): boolean { + +};","(define/contract (word-pattern pattern s) + (-> string? string? boolean?) + + )","-spec word_pattern(Pattern :: unicode:unicode_binary(), S :: unicode:unicode_binary()) -> boolean(). +word_pattern(Pattern, S) -> + .","defmodule Solution do + @spec word_pattern(pattern :: String.t, s :: String.t) :: boolean + def word_pattern(pattern, s) do + + end +end","class Solution { + bool wordPattern(String pattern, String s) { + + } +}", +1902,find-the-duplicate-number,Find the Duplicate Number,287.0,287.0,"

Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.

+ +

There is only one repeated number in nums, return this repeated number.

+ +

You must solve the problem without modifying the array nums and uses only constant extra space.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,4,2,2]
+Output: 2
+
+ +

Example 2:

+ +
+Input: nums = [3,1,3,4,2]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
    • +
  • nums.length == n + 1
    • +
  • 1 <= nums[i] <= n
    • +
  • All the integers in nums appear only once except for precisely one integer which appears two or more times.
    • +
+ +

 

+

Follow up:

+ +
    +
  • How can we prove that at least one duplicate number must exist in nums?
    • +
  • Can you solve the problem in linear runtime complexity?
    • +
+",2.0,False,"class Solution { +public: + int findDuplicate(vector& nums) { + + } +};","class Solution { + public int findDuplicate(int[] nums) { + + } +}","class Solution(object): + def findDuplicate(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findDuplicate(self, nums: List[int]) -> int: + ","int findDuplicate(int* nums, int numsSize){ + +}","public class Solution { + public int FindDuplicate(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findDuplicate = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_duplicate(nums) + +end","class Solution { + func findDuplicate(_ nums: [Int]) -> Int { + + } +}","func findDuplicate(nums []int) int { + +}","object Solution { + def findDuplicate(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findDuplicate(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_duplicate(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findDuplicate($nums) { + + } +}","function findDuplicate(nums: number[]): number { + +};","(define/contract (find-duplicate nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_duplicate(Nums :: [integer()]) -> integer(). +find_duplicate(Nums) -> + .","defmodule Solution do + @spec find_duplicate(nums :: [integer]) :: integer + def find_duplicate(nums) do + + end +end","class Solution { + int findDuplicate(List nums) { + + } +}", +1905,expression-add-operators,Expression Add Operators,282.0,282.0,"

Given a string num that contains only digits and an integer target, return all possibilities to insert the binary operators '+', '-', and/or '*' between the digits of num so that the resultant expression evaluates to the target value.

+ +

Note that operands in the returned expressions should not contain leading zeros.

+ +

 

+

Example 1:

+ +
+Input: num = "123", target = 6
+Output: ["1*2*3","1+2+3"]
+Explanation: Both "1*2*3" and "1+2+3" evaluate to 6.
+
+ +

Example 2:

+ +
+Input: num = "232", target = 8
+Output: ["2*3+2","2+3*2"]
+Explanation: Both "2*3+2" and "2+3*2" evaluate to 8.
+
+ +

Example 3:

+ +
+Input: num = "3456237490", target = 9191
+Output: []
+Explanation: There are no expressions that can be created from "3456237490" to evaluate to 9191.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num.length <= 10
    • +
  • num consists of only digits.
    • +
  • -231 <= target <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + vector addOperators(string num, int target) { + + } +};","class Solution { + public List addOperators(String num, int target) { + + } +}","class Solution(object): + def addOperators(self, num, target): + """""" + :type num: str + :type target: int + :rtype: List[str] + """""" + ","class Solution: + def addOperators(self, num: str, target: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** addOperators(char * num, int target, int* returnSize){ + +}","public class Solution { + public IList AddOperators(string num, int target) { + + } +}","/** + * @param {string} num + * @param {number} target + * @return {string[]} + */ +var addOperators = function(num, target) { + +};","# @param {String} num +# @param {Integer} target +# @return {String[]} +def add_operators(num, target) + +end","class Solution { + func addOperators(_ num: String, _ target: Int) -> [String] { + + } +}","func addOperators(num string, target int) []string { + +}","object Solution { + def addOperators(num: String, target: Int): List[String] = { + + } +}","class Solution { + fun addOperators(num: String, target: Int): List { + + } +}","impl Solution { + pub fn add_operators(num: String, target: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String $num + * @param Integer $target + * @return String[] + */ + function addOperators($num, $target) { + + } +}","function addOperators(num: string, target: number): string[] { + +};","(define/contract (add-operators num target) + (-> string? exact-integer? (listof string?)) + + )","-spec add_operators(Num :: unicode:unicode_binary(), Target :: integer()) -> [unicode:unicode_binary()]. +add_operators(Num, Target) -> + .","defmodule Solution do + @spec add_operators(num :: String.t, target :: integer) :: [String.t] + def add_operators(num, target) do + + end +end","class Solution { + List addOperators(String num, int target) { + + } +}", +1906,perfect-squares,Perfect Squares,279.0,279.0,"

Given an integer n, return the least number of perfect square numbers that sum to n.

+ +

A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are perfect squares while 3 and 11 are not.

+ +

 

+

Example 1:

+ +
+Input: n = 12
+Output: 3
+Explanation: 12 = 4 + 4 + 4.
+
+ +

Example 2:

+ +
+Input: n = 13
+Output: 2
+Explanation: 13 = 4 + 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
    • +
+",2.0,False,"class Solution { +public: + int numSquares(int n) { + + } +};","class Solution { + public int numSquares(int n) { + + } +}","class Solution(object): + def numSquares(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def numSquares(self, n: int) -> int: + ","int numSquares(int n){ + +}","public class Solution { + public int NumSquares(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var numSquares = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def num_squares(n) + +end","class Solution { + func numSquares(_ n: Int) -> Int { + + } +}","func numSquares(n int) int { + +}","object Solution { + def numSquares(n: Int): Int = { + + } +}","class Solution { + fun numSquares(n: Int): Int { + + } +}","impl Solution { + pub fn num_squares(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function numSquares($n) { + + } +}","function numSquares(n: number): number { + +};","(define/contract (num-squares n) + (-> exact-integer? exact-integer?) + + )","-spec num_squares(N :: integer()) -> integer(). +num_squares(N) -> + .","defmodule Solution do + @spec num_squares(n :: integer) :: integer + def num_squares(n) do + + end +end","class Solution { + int numSquares(int n) { + + } +}", +1909,h-index,H-Index,274.0,274.0,"

Given an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper, return the researcher's h-index.

+ +

According to the definition of h-index on Wikipedia: The h-index is defined as the maximum value of h such that the given researcher has published at least h papers that have each been cited at least h times.

+ +

 

+

Example 1:

+ +
+Input: citations = [3,0,6,1,5]
+Output: 3
+Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had received 3, 0, 6, 1, 5 citations respectively.
+Since the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, their h-index is 3.
+
+ +

Example 2:

+ +
+Input: citations = [1,3,1]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • n == citations.length
    • +
  • 1 <= n <= 5000
    • +
  • 0 <= citations[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int hIndex(vector& citations) { + + } +};","class Solution { + public int hIndex(int[] citations) { + + } +}","class Solution(object): + def hIndex(self, citations): + """""" + :type citations: List[int] + :rtype: int + """""" + ","class Solution: + def hIndex(self, citations: List[int]) -> int: + ","int hIndex(int* citations, int citationsSize){ + +}","public class Solution { + public int HIndex(int[] citations) { + + } +}","/** + * @param {number[]} citations + * @return {number} + */ +var hIndex = function(citations) { + +};","# @param {Integer[]} citations +# @return {Integer} +def h_index(citations) + +end","class Solution { + func hIndex(_ citations: [Int]) -> Int { + + } +}","func hIndex(citations []int) int { + +}","object Solution { + def hIndex(citations: Array[Int]): Int = { + + } +}","class Solution { + fun hIndex(citations: IntArray): Int { + + } +}","impl Solution { + pub fn h_index(citations: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $citations + * @return Integer + */ + function hIndex($citations) { + + } +}","function hIndex(citations: number[]): number { + +};","(define/contract (h-index citations) + (-> (listof exact-integer?) exact-integer?) + + )","-spec h_index(Citations :: [integer()]) -> integer(). +h_index(Citations) -> + .","defmodule Solution do + @spec h_index(citations :: [integer]) :: integer + def h_index(citations) do + + end +end","class Solution { + int hIndex(List citations) { + + } +}", +1910,integer-to-english-words,Integer to English Words,273.0,273.0,"

Convert a non-negative integer num to its English words representation.

+ +

 

+

Example 1:

+ +
+Input: num = 123
+Output: "One Hundred Twenty Three"
+
+ +

Example 2:

+ +
+Input: num = 12345
+Output: "Twelve Thousand Three Hundred Forty Five"
+
+ +

Example 3:

+ +
+Input: num = 1234567
+Output: "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + string numberToWords(int num) { + + } +};","class Solution { + public String numberToWords(int num) { + + } +}","class Solution(object): + def numberToWords(self, num): + """""" + :type num: int + :rtype: str + """""" + ","class Solution: + def numberToWords(self, num: int) -> str: + ","char * numberToWords(int num){ + +}","public class Solution { + public string NumberToWords(int num) { + + } +}","/** + * @param {number} num + * @return {string} + */ +var numberToWords = function(num) { + +};","# @param {Integer} num +# @return {String} +def number_to_words(num) + +end","class Solution { + func numberToWords(_ num: Int) -> String { + + } +}","func numberToWords(num int) string { + +}","object Solution { + def numberToWords(num: Int): String = { + + } +}","class Solution { + fun numberToWords(num: Int): String { + + } +}","impl Solution { + pub fn number_to_words(num: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $num + * @return String + */ + function numberToWords($num) { + + } +}","function numberToWords(num: number): string { + +};","(define/contract (number-to-words num) + (-> exact-integer? string?) + + )","-spec number_to_words(Num :: integer()) -> unicode:unicode_binary(). +number_to_words(Num) -> + .","defmodule Solution do + @spec number_to_words(num :: integer) :: String.t + def number_to_words(num) do + + end +end","class Solution { + String numberToWords(int num) { + + } +}", +1911,missing-number,Missing Number,268.0,268.0,"

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,0,1]
+Output: 2
+Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
+
+ +

Example 2:

+ +
+Input: nums = [0,1]
+Output: 2
+Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
+
+ +

Example 3:

+ +
+Input: nums = [9,6,4,2,3,5,7,0,1]
+Output: 8
+Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 104
    • +
  • 0 <= nums[i] <= n
    • +
  • All the numbers of nums are unique.
    • +
+ +

 

+

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

+",1.0,False,"class Solution { +public: + int missingNumber(vector& nums) { + + } +};","class Solution { + public int missingNumber(int[] nums) { + + } +}","class Solution(object): + def missingNumber(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def missingNumber(self, nums: List[int]) -> int: + ","int missingNumber(int* nums, int numsSize){ + +}","public class Solution { + public int MissingNumber(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var missingNumber = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def missing_number(nums) + +end","class Solution { + func missingNumber(_ nums: [Int]) -> Int { + + } +}","func missingNumber(nums []int) int { + +}","object Solution { + def missingNumber(nums: Array[Int]): Int = { + + } +}","class Solution { + fun missingNumber(nums: IntArray): Int { + + } +}","impl Solution { + pub fn missing_number(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function missingNumber($nums) { + + } +}","function missingNumber(nums: number[]): number { + +};","(define/contract (missing-number nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec missing_number(Nums :: [integer()]) -> integer(). +missing_number(Nums) -> + .","defmodule Solution do + @spec missing_number(nums :: [integer]) :: integer + def missing_number(nums) do + + end +end","class Solution { + int missingNumber(List nums) { + + } +}", +1912,ugly-number-ii,Ugly Number II,264.0,264.0,"

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

+ +

Given an integer n, return the nth ugly number.

+ +

 

+

Example 1:

+ +
+Input: n = 10
+Output: 12
+Explanation: [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 1
+Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 1690
    • +
+",2.0,False,"class Solution { +public: + int nthUglyNumber(int n) { + + } +};","class Solution { + public int nthUglyNumber(int n) { + + } +}","class Solution(object): + def nthUglyNumber(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def nthUglyNumber(self, n: int) -> int: + ","int nthUglyNumber(int n){ + +}","public class Solution { + public int NthUglyNumber(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var nthUglyNumber = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def nth_ugly_number(n) + +end","class Solution { + func nthUglyNumber(_ n: Int) -> Int { + + } +}","func nthUglyNumber(n int) int { + +}","object Solution { + def nthUglyNumber(n: Int): Int = { + + } +}","class Solution { + fun nthUglyNumber(n: Int): Int { + + } +}","impl Solution { + pub fn nth_ugly_number(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function nthUglyNumber($n) { + + } +}","function nthUglyNumber(n: number): number { + +};","(define/contract (nth-ugly-number n) + (-> exact-integer? exact-integer?) + + )","-spec nth_ugly_number(N :: integer()) -> integer(). +nth_ugly_number(N) -> + .","defmodule Solution do + @spec nth_ugly_number(n :: integer) :: integer + def nth_ugly_number(n) do + + end +end","class Solution { + int nthUglyNumber(int n) { + + } +}", +1914,single-number-iii,Single Number III,260.0,260.0,"

Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

+ +

You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,3,2,5]
+Output: [3,5]
+Explanation:  [5, 3] is also a valid answer.
+
+ +

Example 2:

+ +
+Input: nums = [-1,0]
+Output: [-1,0]
+
+ +

Example 3:

+ +
+Input: nums = [0,1]
+Output: [1,0]
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 3 * 104
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
  • Each integer in nums will appear twice, only two integers will appear once.
    • +
+",2.0,False,"class Solution { +public: + vector singleNumber(vector& nums) { + + } +};","class Solution { + public int[] singleNumber(int[] nums) { + + } +}","class Solution(object): + def singleNumber(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def singleNumber(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* singleNumber(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public int[] SingleNumber(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var singleNumber = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def single_number(nums) + +end","class Solution { + func singleNumber(_ nums: [Int]) -> [Int] { + + } +}","func singleNumber(nums []int) []int { + +}","object Solution { + def singleNumber(nums: Array[Int]): Array[Int] = { + + } +}","class Solution { + fun singleNumber(nums: IntArray): IntArray { + + } +}","impl Solution { + pub fn single_number(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function singleNumber($nums) { + + } +}","function singleNumber(nums: number[]): number[] { + +};","(define/contract (single-number nums) + (-> (listof exact-integer?) (listof exact-integer?)) + + )","-spec single_number(Nums :: [integer()]) -> [integer()]. +single_number(Nums) -> + .","defmodule Solution do + @spec single_number(nums :: [integer]) :: [integer] + def single_number(nums) do + + end +end","class Solution { + List singleNumber(List nums) { + + } +}", +1917,valid-anagram,Valid Anagram,242.0,242.0,"

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

+ +

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

+ +

 

+

Example 1:

+
Input: s = ""anagram"", t = ""nagaram""
+Output: true
+

Example 2:

+
Input: s = ""rat"", t = ""car""
+Output: false
+
+

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 5 * 104
    • +
  • s and t consist of lowercase English letters.
    • +
+ +

 

+

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

+",1.0,False,"class Solution { +public: + bool isAnagram(string s, string t) { + + } +};","class Solution { + public boolean isAnagram(String s, String t) { + + } +}","class Solution(object): + def isAnagram(self, s, t): + """""" + :type s: str + :type t: str + :rtype: bool + """""" + ","class Solution: + def isAnagram(self, s: str, t: str) -> bool: + ","bool isAnagram(char * s, char * t){ + +}","public class Solution { + public bool IsAnagram(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {boolean} + */ +var isAnagram = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Boolean} +def is_anagram(s, t) + +end","class Solution { + func isAnagram(_ s: String, _ t: String) -> Bool { + + } +}","func isAnagram(s string, t string) bool { + +}","object Solution { + def isAnagram(s: String, t: String): Boolean = { + + } +}","class Solution { + fun isAnagram(s: String, t: String): Boolean { + + } +}","impl Solution { + pub fn is_anagram(s: String, t: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Boolean + */ + function isAnagram($s, $t) { + + } +}","function isAnagram(s: string, t: string): boolean { + +};","(define/contract (is-anagram s t) + (-> string? string? boolean?) + + )","-spec is_anagram(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> boolean(). +is_anagram(S, T) -> + .","defmodule Solution do + @spec is_anagram(s :: String.t, t :: String.t) :: boolean + def is_anagram(s, t) do + + end +end","class Solution { + bool isAnagram(String s, String t) { + + } +}", +1920,sliding-window-maximum,Sliding Window Maximum,239.0,239.0,"

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

+ +

Return the max sliding window.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
+Output: [3,3,5,5,6,7]
+Explanation: 
+Window position                Max
+---------------               -----
+[1  3  -1] -3  5  3  6  7       3
+ 1 [3  -1  -3] 5  3  6  7       3
+ 1  3 [-1  -3  5] 3  6  7       5
+ 1  3  -1 [-3  5  3] 6  7       5
+ 1  3  -1  -3 [5  3  6] 7       6
+ 1  3  -1  -3  5 [3  6  7]      7
+
+ +

Example 2:

+ +
+Input: nums = [1], k = 1
+Output: [1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -104 <= nums[i] <= 104
    • +
  • 1 <= k <= nums.length
    • +
+",3.0,False,"class Solution { +public: + vector maxSlidingWindow(vector& nums, int k) { + + } +};","class Solution { + public int[] maxSlidingWindow(int[] nums, int k) { + + } +}","class Solution(object): + def maxSlidingWindow(self, nums, k): + """""" + :type nums: List[int] + :type k: int + :rtype: List[int] + """""" + ","class Solution: + def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize){ + +}","public class Solution { + public int[] MaxSlidingWindow(int[] nums, int k) { + + } +}","/** + * @param {number[]} nums + * @param {number} k + * @return {number[]} + */ +var maxSlidingWindow = function(nums, k) { + +};","# @param {Integer[]} nums +# @param {Integer} k +# @return {Integer[]} +def max_sliding_window(nums, k) + +end","class Solution { + func maxSlidingWindow(_ nums: [Int], _ k: Int) -> [Int] { + + } +}","func maxSlidingWindow(nums []int, k int) []int { + +}","object Solution { + def maxSlidingWindow(nums: Array[Int], k: Int): Array[Int] = { + + } +}","class Solution { + fun maxSlidingWindow(nums: IntArray, k: Int): IntArray { + + } +}","impl Solution { + pub fn max_sliding_window(nums: Vec, k: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $k + * @return Integer[] + */ + function maxSlidingWindow($nums, $k) { + + } +}","function maxSlidingWindow(nums: number[], k: number): number[] { + +};","(define/contract (max-sliding-window nums k) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec max_sliding_window(Nums :: [integer()], K :: integer()) -> [integer()]. +max_sliding_window(Nums, K) -> + .","defmodule Solution do + @spec max_sliding_window(nums :: [integer], k :: integer) :: [integer] + def max_sliding_window(nums, k) do + + end +end","class Solution { + List maxSlidingWindow(List nums, int k) { + + } +}", +1924,lowest-common-ancestor-of-a-binary-search-tree,Lowest Common Ancestor of a Binary Search Tree,235.0,235.0,"

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.

+ +

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

+ +

 

+

Example 1:

+ +
+Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
+Output: 6
+Explanation: The LCA of nodes 2 and 8 is 6.
+
+ +

Example 2:

+ +
+Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
+Output: 2
+Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.
+
+ +

Example 3:

+ +
+Input: root = [2,1], p = 2, q = 1
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [2, 105].
    • +
  • -109 <= Node.val <= 109
    • +
  • All Node.val are unique.
    • +
  • p != q
    • +
  • p and q will exist in the BST.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode(int x) : val(x), left(NULL), right(NULL) {} + * }; + */ + +class Solution { +public: + TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ + +class Solution { + public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution(object): + def lowestCommonAncestor(self, root, p, q): + """""" + :type root: TreeNode + :type p: TreeNode + :type q: TreeNode + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution: + def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode': + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ + +struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) { + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int x) { val = x; } + * } + */ + +public class Solution { + public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val) { + * this.val = val; + * this.left = this.right = null; + * } + */ + +/** + * @param {TreeNode} root + * @param {TreeNode} p + * @param {TreeNode} q + * @return {TreeNode} + */ +var lowestCommonAncestor = function(root, p, q) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val) +# @val = val +# @left, @right = nil, nil +# end +# end + +# @param {TreeNode} root +# @param {TreeNode} p +# @param {TreeNode} q +# @return {TreeNode} +def lowest_common_ancestor(root, p, q) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init(_ val: Int) { + * self.val = val + * self.left = nil + * self.right = nil + * } + * } + */ + +class Solution { + func lowestCommonAncestor(_ root: TreeNode?, _ p: TreeNode?, _ q: TreeNode?) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ + +func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(var _value: Int) { + * var value: Int = _value + * var left: TreeNode = null + * var right: TreeNode = null + * } + */ + +object Solution { + def lowestCommonAncestor(root: TreeNode, p: TreeNode, q: TreeNode): TreeNode = { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode(var `val`: Int = 0) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ + +class Solution { + fun lowestCommonAncestor(root: TreeNode?, p: TreeNode?, q: TreeNode?): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($value) { $this->val = $value; } + * } + */ + +class Solution { + /** + * @param TreeNode $root + * @param TreeNode $p + * @param TreeNode $q + * @return TreeNode + */ + function lowestCommonAncestor($root, $p, $q) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null { + +};",,,,, +1926,number-of-digit-one,Number of Digit One,233.0,233.0,"

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.

+ +

 

+

Example 1:

+ +
+Input: n = 13
+Output: 6
+
+ +

Example 2:

+ +
+Input: n = 0
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 109
    • +
+",3.0,False,"class Solution { +public: + int countDigitOne(int n) { + + } +};","class Solution { + public int countDigitOne(int n) { + + } +}","class Solution(object): + def countDigitOne(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def countDigitOne(self, n: int) -> int: + ","int countDigitOne(int n){ + +}","public class Solution { + public int CountDigitOne(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var countDigitOne = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def count_digit_one(n) + +end","class Solution { + func countDigitOne(_ n: Int) -> Int { + + } +}","func countDigitOne(n int) int { + +}","object Solution { + def countDigitOne(n: Int): Int = { + + } +}","class Solution { + fun countDigitOne(n: Int): Int { + + } +}","impl Solution { + pub fn count_digit_one(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function countDigitOne($n) { + + } +}","function countDigitOne(n: number): number { + +};","(define/contract (count-digit-one n) + (-> exact-integer? exact-integer?) + + )","-spec count_digit_one(N :: integer()) -> integer(). +count_digit_one(N) -> + .","defmodule Solution do + @spec count_digit_one(n :: integer) :: integer + def count_digit_one(n) do + + end +end","class Solution { + int countDigitOne(int n) { + + } +}", +1930,majority-element-ii,Majority Element II,229.0,229.0,"

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,3]
+Output: [3]
+
+ +

Example 2:

+ +
+Input: nums = [1]
+Output: [1]
+
+ +

Example 3:

+ +
+Input: nums = [1,2]
+Output: [1,2]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5 * 104
    • +
  • -109 <= nums[i] <= 109
    • +
+ +

 

+

Follow up: Could you solve the problem in linear time and in O(1) space?

+",2.0,False,"class Solution { +public: + vector majorityElement(vector& nums) { + + } +};","class Solution { + public List majorityElement(int[] nums) { + + } +}","class Solution(object): + def majorityElement(self, nums): + """""" + :type nums: List[int] + :rtype: List[int] + """""" + ","class Solution: + def majorityElement(self, nums: List[int]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* majorityElement(int* nums, int numsSize, int* returnSize){ + +}","public class Solution { + public IList MajorityElement(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[]} + */ +var majorityElement = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[]} +def majority_element(nums) + +end","class Solution { + func majorityElement(_ nums: [Int]) -> [Int] { + + } +}","func majorityElement(nums []int) []int { + +}","object Solution { + def majorityElement(nums: Array[Int]): List[Int] = { + + } +}","class Solution { + fun majorityElement(nums: IntArray): List { + + } +}","impl Solution { + pub fn majority_element(nums: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[] + */ + function majorityElement($nums) { + + } +}","function majorityElement(nums: number[]): number[] { + +};",,"-spec majority_element(Nums :: [integer()]) -> [integer()]. +majority_element(Nums) -> + .","defmodule Solution do + @spec majority_element(nums :: [integer]) :: [integer] + def majority_element(nums) do + + end +end","class Solution { + List majorityElement(List nums) { + + } +}", +1932,basic-calculator-ii,Basic Calculator II,227.0,227.0,"

Given a string s which represents an expression, evaluate this expression and return its value. 

+ +

The integer division should truncate toward zero.

+ +

You may assume that the given expression is always valid. All intermediate results will be in the range of [-231, 231 - 1].

+ +

Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval().

+ +

 

+

Example 1:

+
Input: s = ""3+2*2""
+Output: 7
+

Example 2:

+
Input: s = "" 3/2 ""
+Output: 1
+

Example 3:

+
Input: s = "" 3+5 / 2 ""
+Output: 5
+
+

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 3 * 105
    • +
  • s consists of integers and operators ('+', '-', '*', '/') separated by some number of spaces.
    • +
  • s represents a valid expression.
    • +
  • All the integers in the expression are non-negative integers in the range [0, 231 - 1].
    • +
  • The answer is guaranteed to fit in a 32-bit integer.
    • +
+",2.0,False,"class Solution { +public: + int calculate(string s) { + + } +};","class Solution { + public int calculate(String s) { + + } +}","class Solution(object): + def calculate(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def calculate(self, s: str) -> int: + ","int calculate(char * s){ + +}","public class Solution { + public int Calculate(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var calculate = function(s) { + +};","# @param {String} s +# @return {Integer} +def calculate(s) + +end","class Solution { + func calculate(_ s: String) -> Int { + + } +}","func calculate(s string) int { + +}","object Solution { + def calculate(s: String): Int = { + + } +}","class Solution { + fun calculate(s: String): Int { + + } +}","impl Solution { + pub fn calculate(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function calculate($s) { + + } +}","function calculate(s: string): number { + +};","(define/contract (calculate s) + (-> string? exact-integer?) + + )","-spec calculate(S :: unicode:unicode_binary()) -> integer(). +calculate(S) -> + .","defmodule Solution do + @spec calculate(s :: String.t) :: integer + def calculate(s) do + + end +end","class Solution { + int calculate(String s) { + + } +}", +1935,basic-calculator,Basic Calculator,224.0,224.0,"

Given a string s representing a valid expression, implement a basic calculator to evaluate it, and return the result of the evaluation.

+ +

Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval().

+ +

 

+

Example 1:

+ +
+Input: s = "1 + 1"
+Output: 2
+
+ +

Example 2:

+ +
+Input: s = " 2-1 + 2 "
+Output: 3
+
+ +

Example 3:

+ +
+Input: s = "(1+(4+5+2)-3)+(6+8)"
+Output: 23
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 3 * 105
    • +
  • s consists of digits, '+', '-', '(', ')', and ' '.
    • +
  • s represents a valid expression.
    • +
  • '+' is not used as a unary operation (i.e., "+1" and "+(2 + 3)" is invalid).
    • +
  • '-' could be used as a unary operation (i.e., "-1" and "-(2 + 3)" is valid).
    • +
  • There will be no two consecutive operators in the input.
    • +
  • Every number and running calculation will fit in a signed 32-bit integer.
    • +
+",3.0,False,"class Solution { +public: + int calculate(string s) { + + } +};","class Solution { + public int calculate(String s) { + + } +}","class Solution(object): + def calculate(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def calculate(self, s: str) -> int: + ","int calculate(char * s){ + +}","public class Solution { + public int Calculate(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var calculate = function(s) { + +};","# @param {String} s +# @return {Integer} +def calculate(s) + +end","class Solution { + func calculate(_ s: String) -> Int { + + } +}","func calculate(s string) int { + +}","object Solution { + def calculate(s: String): Int = { + + } +}","class Solution { + fun calculate(s: String): Int { + + } +}","impl Solution { + pub fn calculate(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function calculate($s) { + + } +}","function calculate(s: string): number { + +};","(define/contract (calculate s) + (-> string? exact-integer?) + + )","-spec calculate(S :: unicode:unicode_binary()) -> integer(). +calculate(S) -> + .","defmodule Solution do + @spec calculate(s :: String.t) :: integer + def calculate(s) do + + end +end","class Solution { + int calculate(String s) { + + } +}", +1939,contains-duplicate-iii,Contains Duplicate III,220.0,220.0,"

You are given an integer array nums and two integers indexDiff and valueDiff.

+ +

Find a pair of indices (i, j) such that:

+ +
    +
  • i != j,
    • +
  • abs(i - j) <= indexDiff.
    • +
  • abs(nums[i] - nums[j]) <= valueDiff, and
    • +
+ +

Return true if such pair exists or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,1], indexDiff = 3, valueDiff = 0
+Output: true
+Explanation: We can choose (i, j) = (0, 3).
+We satisfy the three conditions:
+i != j --> 0 != 3
+abs(i - j) <= indexDiff --> abs(0 - 3) <= 3
+abs(nums[i] - nums[j]) <= valueDiff --> abs(1 - 1) <= 0
+
+ +

Example 2:

+ +
+Input: nums = [1,5,9,1,5,9], indexDiff = 2, valueDiff = 3
+Output: false
+Explanation: After trying all the possible pairs (i, j), we cannot satisfy the three conditions, so we return false.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
  • 1 <= indexDiff <= nums.length
    • +
  • 0 <= valueDiff <= 109
    • +
+",3.0,False,"class Solution { +public: + bool containsNearbyAlmostDuplicate(vector& nums, int indexDiff, int valueDiff) { + + } +};","class Solution { + public boolean containsNearbyAlmostDuplicate(int[] nums, int indexDiff, int valueDiff) { + + } +}","class Solution(object): + def containsNearbyAlmostDuplicate(self, nums, indexDiff, valueDiff): + """""" + :type nums: List[int] + :type indexDiff: int + :type valueDiff: int + :rtype: bool + """""" + ","class Solution: + def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool: + ","bool containsNearbyAlmostDuplicate(int* nums, int numsSize, int indexDiff, int valueDiff){ + +}","public class Solution { + public bool ContainsNearbyAlmostDuplicate(int[] nums, int indexDiff, int valueDiff) { + + } +}","/** + * @param {number[]} nums + * @param {number} indexDiff + * @param {number} valueDiff + * @return {boolean} + */ +var containsNearbyAlmostDuplicate = function(nums, indexDiff, valueDiff) { + +};","# @param {Integer[]} nums +# @param {Integer} index_diff +# @param {Integer} value_diff +# @return {Boolean} +def contains_nearby_almost_duplicate(nums, index_diff, value_diff) + +end","class Solution { + func containsNearbyAlmostDuplicate(_ nums: [Int], _ indexDiff: Int, _ valueDiff: Int) -> Bool { + + } +}","func containsNearbyAlmostDuplicate(nums []int, indexDiff int, valueDiff int) bool { + +}","object Solution { + def containsNearbyAlmostDuplicate(nums: Array[Int], indexDiff: Int, valueDiff: Int): Boolean = { + + } +}","class Solution { + fun containsNearbyAlmostDuplicate(nums: IntArray, indexDiff: Int, valueDiff: Int): Boolean { + + } +}","impl Solution { + pub fn contains_nearby_almost_duplicate(nums: Vec, index_diff: i32, value_diff: i32) -> bool { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $indexDiff + * @param Integer $valueDiff + * @return Boolean + */ + function containsNearbyAlmostDuplicate($nums, $indexDiff, $valueDiff) { + + } +}","function containsNearbyAlmostDuplicate(nums: number[], indexDiff: number, valueDiff: number): boolean { + +};","(define/contract (contains-nearby-almost-duplicate nums indexDiff valueDiff) + (-> (listof exact-integer?) exact-integer? exact-integer? boolean?) + + )","-spec contains_nearby_almost_duplicate(Nums :: [integer()], IndexDiff :: integer(), ValueDiff :: integer()) -> boolean(). +contains_nearby_almost_duplicate(Nums, IndexDiff, ValueDiff) -> + .","defmodule Solution do + @spec contains_nearby_almost_duplicate(nums :: [integer], index_diff :: integer, value_diff :: integer) :: boolean + def contains_nearby_almost_duplicate(nums, index_diff, value_diff) do + + end +end","class Solution { + bool containsNearbyAlmostDuplicate(List nums, int indexDiff, int valueDiff) { + + } +}", +1941,the-skyline-problem,The Skyline Problem,218.0,218.0,"

A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of all the buildings, return the skyline formed by these buildings collectively.

+ +

The geometric information of each building is given in the array buildings where buildings[i] = [lefti, righti, heighti]:

+ +
    +
  • lefti is the x coordinate of the left edge of the ith building.
    • +
  • righti is the x coordinate of the right edge of the ith building.
    • +
  • heighti is the height of the ith building.
    • +
+ +

You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.

+ +

The skyline should be represented as a list of "key points" sorted by their x-coordinate in the form [[x1,y1],[x2,y2],...]. Each key point is the left endpoint of some horizontal segment in the skyline except the last point in the list, which always has a y-coordinate 0 and is used to mark the skyline's termination where the rightmost building ends. Any ground between the leftmost and rightmost buildings should be part of the skyline's contour.

+ +

Note: There must be no consecutive horizontal lines of equal height in the output skyline. For instance, [...,[2 3],[4 5],[7 5],[11 5],[12 7],...] is not acceptable; the three lines of height 5 should be merged into one in the final output as such: [...,[2 3],[4 5],[12 7],...]

+ +

 

+

Example 1:

+ +
+Input: buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]
+Output: [[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]
+Explanation:
+Figure A shows the buildings of the input.
+Figure B shows the skyline formed by those buildings. The red points in figure B represent the key points in the output list.
+
+ +

Example 2:

+ +
+Input: buildings = [[0,2,3],[2,5,3]]
+Output: [[0,3],[5,0]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= buildings.length <= 104
    • +
  • 0 <= lefti < righti <= 231 - 1
    • +
  • 1 <= heighti <= 231 - 1
    • +
  • buildings is sorted by lefti in non-decreasing order.
    • +
+",3.0,False,"class Solution { +public: + vector> getSkyline(vector>& buildings) { + + } +};","class Solution { + public List> getSkyline(int[][] buildings) { + + } +}","class Solution(object): + def getSkyline(self, buildings): + """""" + :type buildings: List[List[int]] + :rtype: List[List[int]] + """""" + ","class Solution: + def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** getSkyline(int** buildings, int buildingsSize, int* buildingsColSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> GetSkyline(int[][] buildings) { + + } +}","/** + * @param {number[][]} buildings + * @return {number[][]} + */ +var getSkyline = function(buildings) { + +};","# @param {Integer[][]} buildings +# @return {Integer[][]} +def get_skyline(buildings) + +end","class Solution { + func getSkyline(_ buildings: [[Int]]) -> [[Int]] { + + } +}","func getSkyline(buildings [][]int) [][]int { + +}","object Solution { + def getSkyline(buildings: Array[Array[Int]]): List[List[Int]] = { + + } +}","class Solution { + fun getSkyline(buildings: Array): List> { + + } +}","impl Solution { + pub fn get_skyline(buildings: Vec>) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $buildings + * @return Integer[][] + */ + function getSkyline($buildings) { + + } +}","function getSkyline(buildings: number[][]): number[][] { + +};",,"-spec get_skyline(Buildings :: [[integer()]]) -> [[integer()]]. +get_skyline(Buildings) -> + .","defmodule Solution do + @spec get_skyline(buildings :: [[integer]]) :: [[integer]] + def get_skyline(buildings) do + + end +end","class Solution { + List> getSkyline(List> buildings) { + + } +}", +1943,combination-sum-iii,Combination Sum III,216.0,216.0,"

Find all valid combinations of k numbers that sum up to n such that the following conditions are true:

+ +
    +
  • Only numbers 1 through 9 are used.
    • +
  • Each number is used at most once.
    • +
+ +

Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order.

+ +

 

+

Example 1:

+ +
+Input: k = 3, n = 7
+Output: [[1,2,4]]
+Explanation:
+1 + 2 + 4 = 7
+There are no other valid combinations.
+ +

Example 2:

+ +
+Input: k = 3, n = 9
+Output: [[1,2,6],[1,3,5],[2,3,4]]
+Explanation:
+1 + 2 + 6 = 9
+1 + 3 + 5 = 9
+2 + 3 + 4 = 9
+There are no other valid combinations.
+
+ +

Example 3:

+ +
+Input: k = 4, n = 1
+Output: []
+Explanation: There are no valid combinations.
+Using 4 different numbers in the range [1,9], the smallest sum we can get is 1+2+3+4 = 10 and since 10 > 1, there are no valid combination.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= k <= 9
    • +
  • 1 <= n <= 60
    • +
+",2.0,False,"class Solution { +public: + vector> combinationSum3(int k, int n) { + + } +};","class Solution { + public List> combinationSum3(int k, int n) { + + } +}","class Solution(object): + def combinationSum3(self, k, n): + """""" + :type k: int + :type n: int + :rtype: List[List[int]] + """""" + ","class Solution: + def combinationSum3(self, k: int, n: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** combinationSum3(int k, int n, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> CombinationSum3(int k, int n) { + + } +}","/** + * @param {number} k + * @param {number} n + * @return {number[][]} + */ +var combinationSum3 = function(k, n) { + +};","# @param {Integer} k +# @param {Integer} n +# @return {Integer[][]} +def combination_sum3(k, n) + +end","class Solution { + func combinationSum3(_ k: Int, _ n: Int) -> [[Int]] { + + } +}","func combinationSum3(k int, n int) [][]int { + +}","object Solution { + def combinationSum3(k: Int, n: Int): List[List[Int]] = { + + } +}","class Solution { + fun combinationSum3(k: Int, n: Int): List> { + + } +}","impl Solution { + pub fn combination_sum3(k: i32, n: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer $n + * @return Integer[][] + */ + function combinationSum3($k, $n) { + + } +}","function combinationSum3(k: number, n: number): number[][] { + +};","(define/contract (combination-sum3 k n) + (-> exact-integer? exact-integer? (listof (listof exact-integer?))) + + )","-spec combination_sum3(K :: integer(), N :: integer()) -> [[integer()]]. +combination_sum3(K, N) -> + .","defmodule Solution do + @spec combination_sum3(k :: integer, n :: integer) :: [[integer]] + def combination_sum3(k, n) do + + end +end","class Solution { + List> combinationSum3(int k, int n) { + + } +}", +1945,shortest-palindrome,Shortest Palindrome,214.0,214.0,"

You are given a string s. You can convert s to a palindrome by adding characters in front of it.

+ +

Return the shortest palindrome you can find by performing this transformation.

+ +

 

+

Example 1:

+
Input: s = ""aacecaaa""
+Output: ""aaacecaaa""
+

Example 2:

+
Input: s = ""abcd""
+Output: ""dcbabcd""
+
+

 

+

Constraints:

+ +
    +
  • 0 <= s.length <= 5 * 104
    • +
  • s consists of lowercase English letters only.
    • +
+",3.0,False,"class Solution { +public: + string shortestPalindrome(string s) { + + } +};","class Solution { + public String shortestPalindrome(String s) { + + } +}","class Solution(object): + def shortestPalindrome(self, s): + """""" + :type s: str + :rtype: str + """""" + ","class Solution: + def shortestPalindrome(self, s: str) -> str: + ","char * shortestPalindrome(char * s){ + +}","public class Solution { + public string ShortestPalindrome(string s) { + + } +}","/** + * @param {string} s + * @return {string} + */ +var shortestPalindrome = function(s) { + +};","# @param {String} s +# @return {String} +def shortest_palindrome(s) + +end","class Solution { + func shortestPalindrome(_ s: String) -> String { + + } +}","func shortestPalindrome(s string) string { + +}","object Solution { + def shortestPalindrome(s: String): String = { + + } +}","class Solution { + fun shortestPalindrome(s: String): String { + + } +}","impl Solution { + pub fn shortest_palindrome(s: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @return String + */ + function shortestPalindrome($s) { + + } +}","function shortestPalindrome(s: string): string { + +};","(define/contract (shortest-palindrome s) + (-> string? string?) + + )","-spec shortest_palindrome(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). +shortest_palindrome(S) -> + .","defmodule Solution do + @spec shortest_palindrome(s :: String.t) :: String.t + def shortest_palindrome(s) do + + end +end","class Solution { + String shortestPalindrome(String s) { + + } +}", +1946,house-robber-ii,House Robber II,213.0,213.0,"

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night.

+ +

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,2]
+Output: 3
+Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,1]
+Output: 4
+Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
+Total amount you can rob = 1 + 3 = 4.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3]
+Output: 3
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 0 <= nums[i] <= 1000
    • +
+",2.0,False,"class Solution { +public: + int rob(vector& nums) { + + } +};","class Solution { + public int rob(int[] nums) { + + } +}","class Solution(object): + def rob(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def rob(self, nums: List[int]) -> int: + ","int rob(int* nums, int numsSize){ + +}","public class Solution { + public int Rob(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var rob = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def rob(nums) + +end","class Solution { + func rob(_ nums: [Int]) -> Int { + + } +}","func rob(nums []int) int { + +}","object Solution { + def rob(nums: Array[Int]): Int = { + + } +}","class Solution { + fun rob(nums: IntArray): Int { + + } +}","impl Solution { + pub fn rob(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function rob($nums) { + + } +}","function rob(nums: number[]): number { + +};","(define/contract (rob nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec rob(Nums :: [integer()]) -> integer(). +rob(Nums) -> + .","defmodule Solution do + @spec rob(nums :: [integer]) :: integer + def rob(nums) do + + end +end","class Solution { + int rob(List nums) { + + } +}", +1947,word-search-ii,Word Search II,212.0,212.0,"

Given an m x n board of characters and a list of strings words, return all words on the board.

+ +

Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.

+ +

 

+

Example 1:

+ +
+Input: board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]
+Output: ["eat","oath"]
+
+ +

Example 2:

+ +
+Input: board = [["a","b"],["c","d"]], words = ["abcb"]
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • m == board.length
    • +
  • n == board[i].length
    • +
  • 1 <= m, n <= 12
    • +
  • board[i][j] is a lowercase English letter.
    • +
  • 1 <= words.length <= 3 * 104
    • +
  • 1 <= words[i].length <= 10
    • +
  • words[i] consists of lowercase English letters.
    • +
  • All the strings of words are unique.
    • +
+",3.0,False,"class Solution { +public: + vector findWords(vector>& board, vector& words) { + + } +};","class Solution { + public List findWords(char[][] board, String[] words) { + + } +}","class Solution(object): + def findWords(self, board, words): + """""" + :type board: List[List[str]] + :type words: List[str] + :rtype: List[str] + """""" + ","class Solution: + def findWords(self, board: List[List[str]], words: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** findWords(char** board, int boardSize, int* boardColSize, char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public IList FindWords(char[][] board, string[] words) { + + } +}","/** + * @param {character[][]} board + * @param {string[]} words + * @return {string[]} + */ +var findWords = function(board, words) { + +};","# @param {Character[][]} board +# @param {String[]} words +# @return {String[]} +def find_words(board, words) + +end","class Solution { + func findWords(_ board: [[Character]], _ words: [String]) -> [String] { + + } +}","func findWords(board [][]byte, words []string) []string { + +}","object Solution { + def findWords(board: Array[Array[Char]], words: Array[String]): List[String] = { + + } +}","class Solution { + fun findWords(board: Array, words: Array): List { + + } +}","impl Solution { + pub fn find_words(board: Vec>, words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String[][] $board + * @param String[] $words + * @return String[] + */ + function findWords($board, $words) { + + } +}","function findWords(board: string[][], words: string[]): string[] { + +};","(define/contract (find-words board words) + (-> (listof (listof char?)) (listof string?) (listof string?)) + + )","-spec find_words(Board :: [[char()]], Words :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +find_words(Board, Words) -> + .","defmodule Solution do + @spec find_words(board :: [[char]], words :: [String.t]) :: [String.t] + def find_words(board, words) do + + end +end","class Solution { + List findWords(List> board, List words) { + + } +}", +1948,design-add-and-search-words-data-structure,Design Add and Search Words Data Structure,211.0,211.0,"

Design a data structure that supports adding new words and finding if a string matches any previously added string.

+ +

Implement the WordDictionary class:

+ +
    +
  • WordDictionary() Initializes the object.
    • +
  • void addWord(word) Adds word to the data structure, it can be matched later.
    • +
  • bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter.
    • +
+ +

 

+

Example:

+ +
+Input
+["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
+[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
+Output
+[null,null,null,null,false,true,true,true]
+
+Explanation
+WordDictionary wordDictionary = new WordDictionary();
+wordDictionary.addWord("bad");
+wordDictionary.addWord("dad");
+wordDictionary.addWord("mad");
+wordDictionary.search("pad"); // return False
+wordDictionary.search("bad"); // return True
+wordDictionary.search(".ad"); // return True
+wordDictionary.search("b.."); // return True
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length <= 25
    • +
  • word in addWord consists of lowercase English letters.
    • +
  • word in search consist of '.' or lowercase English letters.
    • +
  • There will be at most 2 dots in word for search queries.
    • +
  • At most 104 calls will be made to addWord and search.
    • +
+",2.0,False,"class WordDictionary { +public: + WordDictionary() { + + } + + void addWord(string word) { + + } + + bool search(string word) { + + } +}; + +/** + * Your WordDictionary object will be instantiated and called as such: + * WordDictionary* obj = new WordDictionary(); + * obj->addWord(word); + * bool param_2 = obj->search(word); + */","class WordDictionary { + + public WordDictionary() { + + } + + public void addWord(String word) { + + } + + public boolean search(String word) { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * WordDictionary obj = new WordDictionary(); + * obj.addWord(word); + * boolean param_2 = obj.search(word); + */","class WordDictionary(object): + + def __init__(self): + + + def addWord(self, word): + """""" + :type word: str + :rtype: None + """""" + + + def search(self, word): + """""" + :type word: str + :rtype: bool + """""" + + + +# Your WordDictionary object will be instantiated and called as such: +# obj = WordDictionary() +# obj.addWord(word) +# param_2 = obj.search(word)","class WordDictionary: + + def __init__(self): + + + def addWord(self, word: str) -> None: + + + def search(self, word: str) -> bool: + + + +# Your WordDictionary object will be instantiated and called as such: +# obj = WordDictionary() +# obj.addWord(word) +# param_2 = obj.search(word)"," + + +typedef struct { + +} WordDictionary; + + +WordDictionary* wordDictionaryCreate() { + +} + +void wordDictionaryAddWord(WordDictionary* obj, char * word) { + +} + +bool wordDictionarySearch(WordDictionary* obj, char * word) { + +} + +void wordDictionaryFree(WordDictionary* obj) { + +} + +/** + * Your WordDictionary struct will be instantiated and called as such: + * WordDictionary* obj = wordDictionaryCreate(); + * wordDictionaryAddWord(obj, word); + + * bool param_2 = wordDictionarySearch(obj, word); + + * wordDictionaryFree(obj); +*/","public class WordDictionary { + + public WordDictionary() { + + } + + public void AddWord(string word) { + + } + + public bool Search(string word) { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * WordDictionary obj = new WordDictionary(); + * obj.AddWord(word); + * bool param_2 = obj.Search(word); + */"," +var WordDictionary = function() { + +}; + +/** + * @param {string} word + * @return {void} + */ +WordDictionary.prototype.addWord = function(word) { + +}; + +/** + * @param {string} word + * @return {boolean} + */ +WordDictionary.prototype.search = function(word) { + +}; + +/** + * Your WordDictionary object will be instantiated and called as such: + * var obj = new WordDictionary() + * obj.addWord(word) + * var param_2 = obj.search(word) + */","class WordDictionary + def initialize() + + end + + +=begin + :type word: String + :rtype: Void +=end + def add_word(word) + + end + + +=begin + :type word: String + :rtype: Boolean +=end + def search(word) + + end + + +end + +# Your WordDictionary object will be instantiated and called as such: +# obj = WordDictionary.new() +# obj.add_word(word) +# param_2 = obj.search(word)"," +class WordDictionary { + + init() { + + } + + func addWord(_ word: String) { + + } + + func search(_ word: String) -> Bool { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * let obj = WordDictionary() + * obj.addWord(word) + * let ret_2: Bool = obj.search(word) + */","type WordDictionary struct { + +} + + +func Constructor() WordDictionary { + +} + + +func (this *WordDictionary) AddWord(word string) { + +} + + +func (this *WordDictionary) Search(word string) bool { + +} + + +/** + * Your WordDictionary object will be instantiated and called as such: + * obj := Constructor(); + * obj.AddWord(word); + * param_2 := obj.Search(word); + */","class WordDictionary() { + + def addWord(word: String) { + + } + + def search(word: String): Boolean = { + + } + +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * var obj = new WordDictionary() + * obj.addWord(word) + * var param_2 = obj.search(word) + */","class WordDictionary() { + + fun addWord(word: String) { + + } + + fun search(word: String): Boolean { + + } + +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * var obj = WordDictionary() + * obj.addWord(word) + * var param_2 = obj.search(word) + */","struct WordDictionary { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl WordDictionary { + + fn new() -> Self { + + } + + fn add_word(&self, word: String) { + + } + + fn search(&self, word: String) -> bool { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * let obj = WordDictionary::new(); + * obj.add_word(word); + * let ret_2: bool = obj.search(word); + */","class WordDictionary { + /** + */ + function __construct() { + + } + + /** + * @param String $word + * @return NULL + */ + function addWord($word) { + + } + + /** + * @param String $word + * @return Boolean + */ + function search($word) { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * $obj = WordDictionary(); + * $obj->addWord($word); + * $ret_2 = $obj->search($word); + */","class WordDictionary { + constructor() { + + } + + addWord(word: string): void { + + } + + search(word: string): boolean { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * var obj = new WordDictionary() + * obj.addWord(word) + * var param_2 = obj.search(word) + */","(define word-dictionary% + (class object% + (super-new) + + (init-field) + + ; add-word : string? -> void? + (define/public (add-word word) + + ) + ; search : string? -> boolean? + (define/public (search word) + + ))) + +;; Your word-dictionary% object will be instantiated and called as such: +;; (define obj (new word-dictionary%)) +;; (send obj add-word word) +;; (define param_2 (send obj search word))","-spec word_dictionary_init_() -> any(). +word_dictionary_init_() -> + . + +-spec word_dictionary_add_word(Word :: unicode:unicode_binary()) -> any(). +word_dictionary_add_word(Word) -> + . + +-spec word_dictionary_search(Word :: unicode:unicode_binary()) -> boolean(). +word_dictionary_search(Word) -> + . + + +%% Your functions will be called as such: +%% word_dictionary_init_(), +%% word_dictionary_add_word(Word), +%% Param_2 = word_dictionary_search(Word), + +%% word_dictionary_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule WordDictionary do + @spec init_() :: any + def init_() do + + end + + @spec add_word(word :: String.t) :: any + def add_word(word) do + + end + + @spec search(word :: String.t) :: boolean + def search(word) do + + end +end + +# Your functions will be called as such: +# WordDictionary.init_() +# WordDictionary.add_word(word) +# param_2 = WordDictionary.search(word) + +# WordDictionary.init_ will be called before every test case, in which you can do some necessary initializations.","class WordDictionary { + + WordDictionary() { + + } + + void addWord(String word) { + + } + + bool search(String word) { + + } +} + +/** + * Your WordDictionary object will be instantiated and called as such: + * WordDictionary obj = WordDictionary(); + * obj.addWord(word); + * bool param2 = obj.search(word); + */", +1950,minimum-size-subarray-sum,Minimum Size Subarray Sum,209.0,209.0,"

Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.

+ +

 

+

Example 1:

+ +
+Input: target = 7, nums = [2,3,1,2,4,3]
+Output: 2
+Explanation: The subarray [4,3] has the minimal length under the problem constraint.
+
+ +

Example 2:

+ +
+Input: target = 4, nums = [1,4,4]
+Output: 1
+
+ +

Example 3:

+ +
+Input: target = 11, nums = [1,1,1,1,1,1,1,1]
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= target <= 109
    • +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 104
    • +
+ +

 

+Follow up: If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log(n)).",2.0,False,"class Solution { +public: + int minSubArrayLen(int target, vector& nums) { + + } +};","class Solution { + public int minSubArrayLen(int target, int[] nums) { + + } +}","class Solution(object): + def minSubArrayLen(self, target, nums): + """""" + :type target: int + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def minSubArrayLen(self, target: int, nums: List[int]) -> int: + ","int minSubArrayLen(int target, int* nums, int numsSize){ + +}","public class Solution { + public int MinSubArrayLen(int target, int[] nums) { + + } +}","/** + * @param {number} target + * @param {number[]} nums + * @return {number} + */ +var minSubArrayLen = function(target, nums) { + +};","# @param {Integer} target +# @param {Integer[]} nums +# @return {Integer} +def min_sub_array_len(target, nums) + +end","class Solution { + func minSubArrayLen(_ target: Int, _ nums: [Int]) -> Int { + + } +}","func minSubArrayLen(target int, nums []int) int { + +}","object Solution { + def minSubArrayLen(target: Int, nums: Array[Int]): Int = { + + } +}","class Solution { + fun minSubArrayLen(target: Int, nums: IntArray): Int { + + } +}","impl Solution { + pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $target + * @param Integer[] $nums + * @return Integer + */ + function minSubArrayLen($target, $nums) { + + } +}","function minSubArrayLen(target: number, nums: number[]): number { + +};","(define/contract (min-sub-array-len target nums) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec min_sub_array_len(Target :: integer(), Nums :: [integer()]) -> integer(). +min_sub_array_len(Target, Nums) -> + .","defmodule Solution do + @spec min_sub_array_len(target :: integer, nums :: [integer]) :: integer + def min_sub_array_len(target, nums) do + + end +end","class Solution { + int minSubArrayLen(int target, List nums) { + + } +}", +1951,implement-trie-prefix-tree,Implement Trie (Prefix Tree),208.0,208.0,"

A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.

+ +

Implement the Trie class:

+ +
    +
  • Trie() Initializes the trie object.
    • +
  • void insert(String word) Inserts the string word into the trie.
    • +
  • boolean search(String word) Returns true if the string word is in the trie (i.e., was inserted before), and false otherwise.
    • +
  • boolean startsWith(String prefix) Returns true if there is a previously inserted string word that has the prefix prefix, and false otherwise.
    • +
+ +

 

+

Example 1:

+ +
+Input
+["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
+[[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
+Output
+[null, null, true, false, true, null, true]
+
+Explanation
+Trie trie = new Trie();
+trie.insert("apple");
+trie.search("apple");   // return True
+trie.search("app");     // return False
+trie.startsWith("app"); // return True
+trie.insert("app");
+trie.search("app");     // return True
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= word.length, prefix.length <= 2000
    • +
  • word and prefix consist only of lowercase English letters.
    • +
  • At most 3 * 104 calls in total will be made to insert, search, and startsWith.
    • +
+",2.0,False,"class Trie { +public: + Trie() { + + } + + void insert(string word) { + + } + + bool search(string word) { + + } + + bool startsWith(string prefix) { + + } +}; + +/** + * Your Trie object will be instantiated and called as such: + * Trie* obj = new Trie(); + * obj->insert(word); + * bool param_2 = obj->search(word); + * bool param_3 = obj->startsWith(prefix); + */","class Trie { + + public Trie() { + + } + + public void insert(String word) { + + } + + public boolean search(String word) { + + } + + public boolean startsWith(String prefix) { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * Trie obj = new Trie(); + * obj.insert(word); + * boolean param_2 = obj.search(word); + * boolean param_3 = obj.startsWith(prefix); + */","class Trie(object): + + def __init__(self): + + + def insert(self, word): + """""" + :type word: str + :rtype: None + """""" + + + def search(self, word): + """""" + :type word: str + :rtype: bool + """""" + + + def startsWith(self, prefix): + """""" + :type prefix: str + :rtype: bool + """""" + + + +# Your Trie object will be instantiated and called as such: +# obj = Trie() +# obj.insert(word) +# param_2 = obj.search(word) +# param_3 = obj.startsWith(prefix)","class Trie: + + def __init__(self): + + + def insert(self, word: str) -> None: + + + def search(self, word: str) -> bool: + + + def startsWith(self, prefix: str) -> bool: + + + +# Your Trie object will be instantiated and called as such: +# obj = Trie() +# obj.insert(word) +# param_2 = obj.search(word) +# param_3 = obj.startsWith(prefix)"," + + +typedef struct { + +} Trie; + + +Trie* trieCreate() { + +} + +void trieInsert(Trie* obj, char * word) { + +} + +bool trieSearch(Trie* obj, char * word) { + +} + +bool trieStartsWith(Trie* obj, char * prefix) { + +} + +void trieFree(Trie* obj) { + +} + +/** + * Your Trie struct will be instantiated and called as such: + * Trie* obj = trieCreate(); + * trieInsert(obj, word); + + * bool param_2 = trieSearch(obj, word); + + * bool param_3 = trieStartsWith(obj, prefix); + + * trieFree(obj); +*/","public class Trie { + + public Trie() { + + } + + public void Insert(string word) { + + } + + public bool Search(string word) { + + } + + public bool StartsWith(string prefix) { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * Trie obj = new Trie(); + * obj.Insert(word); + * bool param_2 = obj.Search(word); + * bool param_3 = obj.StartsWith(prefix); + */"," +var Trie = function() { + +}; + +/** + * @param {string} word + * @return {void} + */ +Trie.prototype.insert = function(word) { + +}; + +/** + * @param {string} word + * @return {boolean} + */ +Trie.prototype.search = function(word) { + +}; + +/** + * @param {string} prefix + * @return {boolean} + */ +Trie.prototype.startsWith = function(prefix) { + +}; + +/** + * Your Trie object will be instantiated and called as such: + * var obj = new Trie() + * obj.insert(word) + * var param_2 = obj.search(word) + * var param_3 = obj.startsWith(prefix) + */","class Trie + def initialize() + + end + + +=begin + :type word: String + :rtype: Void +=end + def insert(word) + + end + + +=begin + :type word: String + :rtype: Boolean +=end + def search(word) + + end + + +=begin + :type prefix: String + :rtype: Boolean +=end + def starts_with(prefix) + + end + + +end + +# Your Trie object will be instantiated and called as such: +# obj = Trie.new() +# obj.insert(word) +# param_2 = obj.search(word) +# param_3 = obj.starts_with(prefix)"," +class Trie { + + init() { + + } + + func insert(_ word: String) { + + } + + func search(_ word: String) -> Bool { + + } + + func startsWith(_ prefix: String) -> Bool { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * let obj = Trie() + * obj.insert(word) + * let ret_2: Bool = obj.search(word) + * let ret_3: Bool = obj.startsWith(prefix) + */","type Trie struct { + +} + + +func Constructor() Trie { + +} + + +func (this *Trie) Insert(word string) { + +} + + +func (this *Trie) Search(word string) bool { + +} + + +func (this *Trie) StartsWith(prefix string) bool { + +} + + +/** + * Your Trie object will be instantiated and called as such: + * obj := Constructor(); + * obj.Insert(word); + * param_2 := obj.Search(word); + * param_3 := obj.StartsWith(prefix); + */","class Trie() { + + def insert(word: String) { + + } + + def search(word: String): Boolean = { + + } + + def startsWith(prefix: String): Boolean = { + + } + +} + +/** + * Your Trie object will be instantiated and called as such: + * var obj = new Trie() + * obj.insert(word) + * var param_2 = obj.search(word) + * var param_3 = obj.startsWith(prefix) + */","class Trie() { + + fun insert(word: String) { + + } + + fun search(word: String): Boolean { + + } + + fun startsWith(prefix: String): Boolean { + + } + +} + +/** + * Your Trie object will be instantiated and called as such: + * var obj = Trie() + * obj.insert(word) + * var param_2 = obj.search(word) + * var param_3 = obj.startsWith(prefix) + */","struct Trie { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl Trie { + + fn new() -> Self { + + } + + fn insert(&self, word: String) { + + } + + fn search(&self, word: String) -> bool { + + } + + fn starts_with(&self, prefix: String) -> bool { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * let obj = Trie::new(); + * obj.insert(word); + * let ret_2: bool = obj.search(word); + * let ret_3: bool = obj.starts_with(prefix); + */","class Trie { + /** + */ + function __construct() { + + } + + /** + * @param String $word + * @return NULL + */ + function insert($word) { + + } + + /** + * @param String $word + * @return Boolean + */ + function search($word) { + + } + + /** + * @param String $prefix + * @return Boolean + */ + function startsWith($prefix) { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * $obj = Trie(); + * $obj->insert($word); + * $ret_2 = $obj->search($word); + * $ret_3 = $obj->startsWith($prefix); + */","class Trie { + constructor() { + + } + + insert(word: string): void { + + } + + search(word: string): boolean { + + } + + startsWith(prefix: string): boolean { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * var obj = new Trie() + * obj.insert(word) + * var param_2 = obj.search(word) + * var param_3 = obj.startsWith(prefix) + */","(define trie% + (class object% + (super-new) + (init-field) + + ; insert : string? -> void? + (define/public (insert word) + + ) + ; search : string? -> boolean? + (define/public (search word) + + ) + ; starts-with : string? -> boolean? + (define/public (starts-with prefix) + + ))) + +;; Your trie% object will be instantiated and called as such: +;; (define obj (new trie%)) +;; (send obj insert word) +;; (define param_2 (send obj search word)) +;; (define param_3 (send obj starts-with prefix))","-spec trie_init_() -> any(). +trie_init_() -> + . + +-spec trie_insert(Word :: unicode:unicode_binary()) -> any(). +trie_insert(Word) -> + . + +-spec trie_search(Word :: unicode:unicode_binary()) -> boolean(). +trie_search(Word) -> + . + +-spec trie_starts_with(Prefix :: unicode:unicode_binary()) -> boolean(). +trie_starts_with(Prefix) -> + . + + +%% Your functions will be called as such: +%% trie_init_(), +%% trie_insert(Word), +%% Param_2 = trie_search(Word), +%% Param_3 = trie_starts_with(Prefix), + +%% trie_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule Trie do + @spec init_() :: any + def init_() do + + end + + @spec insert(word :: String.t) :: any + def insert(word) do + + end + + @spec search(word :: String.t) :: boolean + def search(word) do + + end + + @spec starts_with(prefix :: String.t) :: boolean + def starts_with(prefix) do + + end +end + +# Your functions will be called as such: +# Trie.init_() +# Trie.insert(word) +# param_2 = Trie.search(word) +# param_3 = Trie.starts_with(prefix) + +# Trie.init_ will be called before every test case, in which you can do some necessary initializations.","class Trie { + + Trie() { + + } + + void insert(String word) { + + } + + bool search(String word) { + + } + + bool startsWith(String prefix) { + + } +} + +/** + * Your Trie object will be instantiated and called as such: + * Trie obj = Trie(); + * obj.insert(word); + * bool param2 = obj.search(word); + * bool param3 = obj.startsWith(prefix); + */", +1958,bitwise-and-of-numbers-range,Bitwise AND of Numbers Range,201.0,201.0,"

Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive.

+ +

 

+

Example 1:

+ +
+Input: left = 5, right = 7
+Output: 4
+
+ +

Example 2:

+ +
+Input: left = 0, right = 0
+Output: 0
+
+ +

Example 3:

+ +
+Input: left = 1, right = 2147483647
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= left <= right <= 231 - 1
    • +
+",2.0,False,"class Solution { +public: + int rangeBitwiseAnd(int left, int right) { + + } +};","class Solution { + public int rangeBitwiseAnd(int left, int right) { + + } +}","class Solution(object): + def rangeBitwiseAnd(self, left, right): + """""" + :type left: int + :type right: int + :rtype: int + """""" + ","class Solution: + def rangeBitwiseAnd(self, left: int, right: int) -> int: + ","int rangeBitwiseAnd(int left, int right){ + +}","public class Solution { + public int RangeBitwiseAnd(int left, int right) { + + } +}","/** + * @param {number} left + * @param {number} right + * @return {number} + */ +var rangeBitwiseAnd = function(left, right) { + +};","# @param {Integer} left +# @param {Integer} right +# @return {Integer} +def range_bitwise_and(left, right) + +end","class Solution { + func rangeBitwiseAnd(_ left: Int, _ right: Int) -> Int { + + } +}","func rangeBitwiseAnd(left int, right int) int { + +}","object Solution { + def rangeBitwiseAnd(left: Int, right: Int): Int = { + + } +}","class Solution { + fun rangeBitwiseAnd(left: Int, right: Int): Int { + + } +}","impl Solution { + pub fn range_bitwise_and(left: i32, right: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $left + * @param Integer $right + * @return Integer + */ + function rangeBitwiseAnd($left, $right) { + + } +}","function rangeBitwiseAnd(left: number, right: number): number { + +};","(define/contract (range-bitwise-and left right) + (-> exact-integer? exact-integer? exact-integer?) + + )","-spec range_bitwise_and(Left :: integer(), Right :: integer()) -> integer(). +range_bitwise_and(Left, Right) -> + .","defmodule Solution do + @spec range_bitwise_and(left :: integer, right :: integer) :: integer + def range_bitwise_and(left, right) do + + end +end","class Solution { + int rangeBitwiseAnd(int left, int right) { + + } +}", +1960,binary-tree-right-side-view,Binary Tree Right Side View,199.0,199.0,"

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3,null,5,null,4]
+Output: [1,3,4]
+
+ +

Example 2:

+ +
+Input: root = [1,null,3]
+Output: [1,3]
+
+ +

Example 3:

+ +
+Input: root = []
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 100].
    • +
  • -100 <= Node.val <= 100
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector rightSideView(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List rightSideView(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def rightSideView(self, root): + """""" + :type root: TreeNode + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def rightSideView(self, root: Optional[TreeNode]) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* rightSideView(struct TreeNode* root, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList RightSideView(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number[]} + */ +var rightSideView = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer[]} +def right_side_view(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func rightSideView(_ root: TreeNode?) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func rightSideView(root *TreeNode) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def rightSideView(root: TreeNode): List[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun rightSideView(root: TreeNode?): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn right_side_view(root: Option>>) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer[] + */ + function rightSideView($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function rightSideView(root: TreeNode | null): number[] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (right-side-view root) + (-> (or/c tree-node? #f) (listof exact-integer?)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec right_side_view(Root :: #tree_node{} | null) -> [integer()]. +right_side_view(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec right_side_view(root :: TreeNode.t | nil) :: [integer] + def right_side_view(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List rightSideView(TreeNode? root) { + + } +}", +1961,house-robber,House Robber,198.0,198.0,"

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

+ +

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,1]
+Output: 4
+Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
+Total amount you can rob = 1 + 3 = 4.
+
+ +

Example 2:

+ +
+Input: nums = [2,7,9,3,1]
+Output: 12
+Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
+Total amount you can rob = 2 + 9 + 1 = 12.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 0 <= nums[i] <= 400
    • +
+",2.0,False,"class Solution { +public: + int rob(vector& nums) { + + } +};","class Solution { + public int rob(int[] nums) { + + } +}","class Solution(object): + def rob(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def rob(self, nums: List[int]) -> int: + ","int rob(int* nums, int numsSize){ + +}","public class Solution { + public int Rob(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var rob = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def rob(nums) + +end","class Solution { + func rob(_ nums: [Int]) -> Int { + + } +}","func rob(nums []int) int { + +}","object Solution { + def rob(nums: Array[Int]): Int = { + + } +}","class Solution { + fun rob(nums: IntArray): Int { + + } +}","impl Solution { + pub fn rob(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function rob($nums) { + + } +}","function rob(nums: number[]): number { + +};","(define/contract (rob nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec rob(Nums :: [integer()]) -> integer(). +rob(Nums) -> + .","defmodule Solution do + @spec rob(nums :: [integer]) :: integer + def rob(nums) do + + end +end","class Solution { + int rob(List nums) { + + } +}", +1962,number-of-1-bits,Number of 1 Bits,191.0,191.0,"

Write a function that takes the binary representation of an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).

+ +

Note:

+ +
    +
  • Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.
    • +
  • In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 3, the input represents the signed integer. -3.
    • +
+ +

 

+

Example 1:

+ +
+Input: n = 00000000000000000000000000001011
+Output: 3
+Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.
+
+ +

Example 2:

+ +
+Input: n = 00000000000000000000000010000000
+Output: 1
+Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.
+
+ +

Example 3:

+ +
+Input: n = 11111111111111111111111111111101
+Output: 31
+Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.
+
+ +

 

+

Constraints:

+ +
    +
  • The input must be a binary string of length 32.
    • +
+ +

 

+Follow up: If this function is called many times, how would you optimize it?",1.0,False,"class Solution { +public: + int hammingWeight(uint32_t n) { + + } +};","public class Solution { + // you need to treat n as an unsigned value + public int hammingWeight(int n) { + + } +}","class Solution(object): + def hammingWeight(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def hammingWeight(self, n: int) -> int: + ","int hammingWeight(uint32_t n) { + +}","public class Solution { + public int HammingWeight(uint n) { + + } +}","/** + * @param {number} n - a positive integer + * @return {number} + */ +var hammingWeight = function(n) { + +};","# @param {Integer} n, a positive integer +# @return {Integer} +def hamming_weight(n) + +end","class Solution { + func hammingWeight(_ n: Int) -> Int { + + } +}","func hammingWeight(num uint32) int { + +}","object Solution { + // you need treat n as an unsigned value + def hammingWeight(n: Int): Int = { + + } +} +","class Solution { + // you need treat n as an unsigned value + fun hammingWeight(n:Int):Int { + + } +}","impl Solution { + pub fn hammingWeight (n: u32) -> i32 { + + } +}","class Solution { + /** + * @param Integer $n + * @return Integer + */ + function hammingWeight($n) { + + } +}","function hammingWeight(n: number): number { + +};",,,,, +1965,best-time-to-buy-and-sell-stock-iv,Best Time to Buy and Sell Stock IV,188.0,188.0,"

You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k.

+ +

Find the maximum profit you can achieve. You may complete at most k transactions: i.e. you may buy at most k times and sell at most k times.

+ +

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

+ +

 

+

Example 1:

+ +
+Input: k = 2, prices = [2,4,1]
+Output: 2
+Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.
+
+ +

Example 2:

+ +
+Input: k = 2, prices = [3,2,6,5,0,3]
+Output: 7
+Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= 100
    • +
  • 1 <= prices.length <= 1000
    • +
  • 0 <= prices[i] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int maxProfit(int k, vector& prices) { + + } +};","class Solution { + public int maxProfit(int k, int[] prices) { + + } +}","class Solution(object): + def maxProfit(self, k, prices): + """""" + :type k: int + :type prices: List[int] + :rtype: int + """""" + ","class Solution: + def maxProfit(self, k: int, prices: List[int]) -> int: + ","int maxProfit(int k, int* prices, int pricesSize){ + +}","public class Solution { + public int MaxProfit(int k, int[] prices) { + + } +}","/** + * @param {number} k + * @param {number[]} prices + * @return {number} + */ +var maxProfit = function(k, prices) { + +};","# @param {Integer} k +# @param {Integer[]} prices +# @return {Integer} +def max_profit(k, prices) + +end","class Solution { + func maxProfit(_ k: Int, _ prices: [Int]) -> Int { + + } +}","func maxProfit(k int, prices []int) int { + +}","object Solution { + def maxProfit(k: Int, prices: Array[Int]): Int = { + + } +}","class Solution { + fun maxProfit(k: Int, prices: IntArray): Int { + + } +}","impl Solution { + pub fn max_profit(k: i32, prices: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $k + * @param Integer[] $prices + * @return Integer + */ + function maxProfit($k, $prices) { + + } +}","function maxProfit(k: number, prices: number[]): number { + +};","(define/contract (max-profit k prices) + (-> exact-integer? (listof exact-integer?) exact-integer?) + + )","-spec max_profit(K :: integer(), Prices :: [integer()]) -> integer(). +max_profit(K, Prices) -> + .","defmodule Solution do + @spec max_profit(k :: integer, prices :: [integer]) :: integer + def max_profit(k, prices) do + + end +end","class Solution { + int maxProfit(int k, List prices) { + + } +}", +1967,largest-number,Largest Number,179.0,179.0,"

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

+ +

Since the result may be very large, so you need to return a string instead of an integer.

+ +

 

+

Example 1:

+ +
+Input: nums = [10,2]
+Output: "210"
+
+ +

Example 2:

+ +
+Input: nums = [3,30,34,5,9]
+Output: "9534330"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 0 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + string largestNumber(vector& nums) { + + } +};","class Solution { + public String largestNumber(int[] nums) { + + } +}","class Solution(object): + def largestNumber(self, nums): + """""" + :type nums: List[int] + :rtype: str + """""" + ","class Solution: + def largestNumber(self, nums: List[int]) -> str: + ","char * largestNumber(int* nums, int numsSize){ + +}","public class Solution { + public string LargestNumber(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {string} + */ +var largestNumber = function(nums) { + +};","# @param {Integer[]} nums +# @return {String} +def largest_number(nums) + +end","class Solution { + func largestNumber(_ nums: [Int]) -> String { + + } +}","func largestNumber(nums []int) string { + +}","object Solution { + def largestNumber(nums: Array[Int]): String = { + + } +}","class Solution { + fun largestNumber(nums: IntArray): String { + + } +}","impl Solution { + pub fn largest_number(nums: Vec) -> String { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return String + */ + function largestNumber($nums) { + + } +}","function largestNumber(nums: number[]): string { + +};","(define/contract (largest-number nums) + (-> (listof exact-integer?) string?) + + )","-spec largest_number(Nums :: [integer()]) -> unicode:unicode_binary(). +largest_number(Nums) -> + .","defmodule Solution do + @spec largest_number(nums :: [integer]) :: String.t + def largest_number(nums) do + + end +end","class Solution { + String largestNumber(List nums) { + + } +}", +1968,dungeon-game,Dungeon Game,174.0,174.0,"

The demons had captured the princess and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of m x n rooms laid out in a 2D grid. Our valiant knight was initially positioned in the top-left room and must fight his way through dungeon to rescue the princess.

+ +

The knight has an initial health point represented by a positive integer. If at any point his health point drops to 0 or below, he dies immediately.

+ +

Some of the rooms are guarded by demons (represented by negative integers), so the knight loses health upon entering these rooms; other rooms are either empty (represented as 0) or contain magic orbs that increase the knight's health (represented by positive integers).

+ +

To reach the princess as quickly as possible, the knight decides to move only rightward or downward in each step.

+ +

Return the knight's minimum initial health so that he can rescue the princess.

+ +

Note that any room can contain threats or power-ups, even the first room the knight enters and the bottom-right room where the princess is imprisoned.

+ +

 

+

Example 1:

+ +
+Input: dungeon = [[-2,-3,3],[-5,-10,1],[10,30,-5]]
+Output: 7
+Explanation: The initial health of the knight must be at least 7 if he follows the optimal path: RIGHT-> RIGHT -> DOWN -> DOWN.
+
+ +

Example 2:

+ +
+Input: dungeon = [[0]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • m == dungeon.length
    • +
  • n == dungeon[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • -1000 <= dungeon[i][j] <= 1000
    • +
+",3.0,False,"class Solution { +public: + int calculateMinimumHP(vector>& dungeon) { + + } +};","class Solution { + public int calculateMinimumHP(int[][] dungeon) { + + } +}","class Solution(object): + def calculateMinimumHP(self, dungeon): + """""" + :type dungeon: List[List[int]] + :rtype: int + """""" + ","class Solution: + def calculateMinimumHP(self, dungeon: List[List[int]]) -> int: + ","int calculateMinimumHP(int** dungeon, int dungeonSize, int* dungeonColSize){ + +}","public class Solution { + public int CalculateMinimumHP(int[][] dungeon) { + + } +}","/** + * @param {number[][]} dungeon + * @return {number} + */ +var calculateMinimumHP = function(dungeon) { + +};","# @param {Integer[][]} dungeon +# @return {Integer} +def calculate_minimum_hp(dungeon) + +end","class Solution { + func calculateMinimumHP(_ dungeon: [[Int]]) -> Int { + + } +}","func calculateMinimumHP(dungeon [][]int) int { + +}","object Solution { + def calculateMinimumHP(dungeon: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun calculateMinimumHP(dungeon: Array): Int { + + } +}","impl Solution { + pub fn calculate_minimum_hp(dungeon: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $dungeon + * @return Integer + */ + function calculateMinimumHP($dungeon) { + + } +}","function calculateMinimumHP(dungeon: number[][]): number { + +};","(define/contract (calculate-minimum-hp dungeon) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec calculate_minimum_hp(Dungeon :: [[integer()]]) -> integer(). +calculate_minimum_hp(Dungeon) -> + .","defmodule Solution do + @spec calculate_minimum_hp(dungeon :: [[integer]]) :: integer + def calculate_minimum_hp(dungeon) do + + end +end","class Solution { + int calculateMinimumHP(List> dungeon) { + + } +}", +1969,binary-search-tree-iterator,Binary Search Tree Iterator,173.0,173.0,"

Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):

+ +
    +
  • BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.
    • +
  • boolean hasNext() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.
    • +
  • int next() Moves the pointer to the right, then returns the number at the pointer.
    • +
+ +

Notice that by initializing the pointer to a non-existent smallest number, the first call to next() will return the smallest element in the BST.

+ +

You may assume that next() calls will always be valid. That is, there will be at least a next number in the in-order traversal when next() is called.

+ +

 

+

Example 1:

+ +
+Input
+["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
+[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
+Output
+[null, 3, 7, true, 9, true, 15, true, 20, false]
+
+Explanation
+BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
+bSTIterator.next();    // return 3
+bSTIterator.next();    // return 7
+bSTIterator.hasNext(); // return True
+bSTIterator.next();    // return 9
+bSTIterator.hasNext(); // return True
+bSTIterator.next();    // return 15
+bSTIterator.hasNext(); // return True
+bSTIterator.next();    // return 20
+bSTIterator.hasNext(); // return False
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 105].
    • +
  • 0 <= Node.val <= 106
    • +
  • At most 105 calls will be made to hasNext, and next.
    • +
+ +

 

+

Follow up:

+ +
    +
  • Could you implement next() and hasNext() to run in average O(1) time and use O(h) memory, where h is the height of the tree?
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class BSTIterator { +public: + BSTIterator(TreeNode* root) { + + } + + int next() { + + } + + bool hasNext() { + + } +}; + +/** + * Your BSTIterator object will be instantiated and called as such: + * BSTIterator* obj = new BSTIterator(root); + * int param_1 = obj->next(); + * bool param_2 = obj->hasNext(); + */","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class BSTIterator { + + public BSTIterator(TreeNode root) { + + } + + public int next() { + + } + + public boolean hasNext() { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * BSTIterator obj = new BSTIterator(root); + * int param_1 = obj.next(); + * boolean param_2 = obj.hasNext(); + */","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class BSTIterator(object): + + def __init__(self, root): + """""" + :type root: TreeNode + """""" + + + def next(self): + """""" + :rtype: int + """""" + + + def hasNext(self): + """""" + :rtype: bool + """""" + + + +# Your BSTIterator object will be instantiated and called as such: +# obj = BSTIterator(root) +# param_1 = obj.next() +# param_2 = obj.hasNext()","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class BSTIterator: + + def __init__(self, root: Optional[TreeNode]): + + + def next(self) -> int: + + + def hasNext(self) -> bool: + + + +# Your BSTIterator object will be instantiated and called as such: +# obj = BSTIterator(root) +# param_1 = obj.next() +# param_2 = obj.hasNext()","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ + + + +typedef struct { + +} BSTIterator; + + +BSTIterator* bSTIteratorCreate(struct TreeNode* root) { + +} + +int bSTIteratorNext(BSTIterator* obj) { + +} + +bool bSTIteratorHasNext(BSTIterator* obj) { + +} + +void bSTIteratorFree(BSTIterator* obj) { + +} + +/** + * Your BSTIterator struct will be instantiated and called as such: + * BSTIterator* obj = bSTIteratorCreate(root); + * int param_1 = bSTIteratorNext(obj); + + * bool param_2 = bSTIteratorHasNext(obj); + + * bSTIteratorFree(obj); +*/","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class BSTIterator { + + public BSTIterator(TreeNode root) { + + } + + public int Next() { + + } + + public bool HasNext() { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * BSTIterator obj = new BSTIterator(root); + * int param_1 = obj.Next(); + * bool param_2 = obj.HasNext(); + */","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + */ +var BSTIterator = function(root) { + +}; + +/** + * @return {number} + */ +BSTIterator.prototype.next = function() { + +}; + +/** + * @return {boolean} + */ +BSTIterator.prototype.hasNext = function() { + +}; + +/** + * Your BSTIterator object will be instantiated and called as such: + * var obj = new BSTIterator(root) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +class BSTIterator + +=begin + :type root: TreeNode +=end + def initialize(root) + + end + + +=begin + :rtype: Integer +=end + def next() + + end + + +=begin + :rtype: Boolean +=end + def has_next() + + end + + +end + +# Your BSTIterator object will be instantiated and called as such: +# obj = BSTIterator.new(root) +# param_1 = obj.next() +# param_2 = obj.has_next()","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ + +class BSTIterator { + + init(_ root: TreeNode?) { + + } + + func next() -> Int { + + } + + func hasNext() -> Bool { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * let obj = BSTIterator(root) + * let ret_1: Int = obj.next() + * let ret_2: Bool = obj.hasNext() + */","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +type BSTIterator struct { + +} + + +func Constructor(root *TreeNode) BSTIterator { + +} + + +func (this *BSTIterator) Next() int { + +} + + +func (this *BSTIterator) HasNext() bool { + +} + + +/** + * Your BSTIterator object will be instantiated and called as such: + * obj := Constructor(root); + * param_1 := obj.Next(); + * param_2 := obj.HasNext(); + */","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +class BSTIterator(_root: TreeNode) { + + def next(): Int = { + + } + + def hasNext(): Boolean = { + + } + +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * var obj = new BSTIterator(root) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class BSTIterator(root: TreeNode?) { + + fun next(): Int { + + } + + fun hasNext(): Boolean { + + } + +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * var obj = BSTIterator(root) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +struct BSTIterator { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl BSTIterator { + + fn new(root: Option>>) -> Self { + + } + + fn next(&self) -> i32 { + + } + + fn has_next(&self) -> bool { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * let obj = BSTIterator::new(root); + * let ret_1: i32 = obj.next(); + * let ret_2: bool = obj.has_next(); + */","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class BSTIterator { + /** + * @param TreeNode $root + */ + function __construct($root) { + + } + + /** + * @return Integer + */ + function next() { + + } + + /** + * @return Boolean + */ + function hasNext() { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * $obj = BSTIterator($root); + * $ret_1 = $obj->next(); + * $ret_2 = $obj->hasNext(); + */","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +class BSTIterator { + constructor(root: TreeNode | null) { + + } + + next(): number { + + } + + hasNext(): boolean { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * var obj = new BSTIterator(root) + * var param_1 = obj.next() + * var param_2 = obj.hasNext() + */","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define bst-iterator% + (class object% + (super-new) + + ; root : (or/c tree-node? #f) + (init-field + root) + + ; next : -> exact-integer? + (define/public (next) + + ) + ; has-next : -> boolean? + (define/public (has-next) + + ))) + +;; Your bst-iterator% object will be instantiated and called as such: +;; (define obj (new bst-iterator% [root root])) +;; (define param_1 (send obj next)) +;; (define param_2 (send obj has-next))","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec bst_iterator_init_(Root :: #tree_node{} | null) -> any(). +bst_iterator_init_(Root) -> + . + +-spec bst_iterator_next() -> integer(). +bst_iterator_next() -> + . + +-spec bst_iterator_has_next() -> boolean(). +bst_iterator_has_next() -> + . + + +%% Your functions will be called as such: +%% bst_iterator_init_(Root), +%% Param_1 = bst_iterator_next(), +%% Param_2 = bst_iterator_has_next(), + +%% bst_iterator_init_ will be called before every test case, in which you can do some necessary initializations.","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule BSTIterator do + @spec init_(root :: TreeNode.t | nil) :: any + def init_(root) do + + end + + @spec next() :: integer + def next() do + + end + + @spec has_next() :: boolean + def has_next() do + + end +end + +# Your functions will be called as such: +# BSTIterator.init_(root) +# param_1 = BSTIterator.next() +# param_2 = BSTIterator.has_next() + +# BSTIterator.init_ will be called before every test case, in which you can do some necessary initializations.","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class BSTIterator { + + BSTIterator(TreeNode? root) { + + } + + int next() { + + } + + bool hasNext() { + + } +} + +/** + * Your BSTIterator object will be instantiated and called as such: + * BSTIterator obj = BSTIterator(root); + * int param1 = obj.next(); + * bool param2 = obj.hasNext(); + */", +1970,factorial-trailing-zeroes,Factorial Trailing Zeroes,172.0,172.0,"

Given an integer n, return the number of trailing zeroes in n!.

+ +

Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1.

+ +

 

+

Example 1:

+ +
+Input: n = 3
+Output: 0
+Explanation: 3! = 6, no trailing zero.
+
+ +

Example 2:

+ +
+Input: n = 5
+Output: 1
+Explanation: 5! = 120, one trailing zero.
+
+ +

Example 3:

+ +
+Input: n = 0
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= n <= 104
    • +
+ +

 

+

Follow up: Could you write a solution that works in logarithmic time complexity?

+",2.0,False,"class Solution { +public: + int trailingZeroes(int n) { + + } +};","class Solution { + public int trailingZeroes(int n) { + + } +}","class Solution(object): + def trailingZeroes(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def trailingZeroes(self, n: int) -> int: + ","int trailingZeroes(int n){ + +}","public class Solution { + public int TrailingZeroes(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var trailingZeroes = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def trailing_zeroes(n) + +end","class Solution { + func trailingZeroes(_ n: Int) -> Int { + + } +}","func trailingZeroes(n int) int { + +}","object Solution { + def trailingZeroes(n: Int): Int = { + + } +}","class Solution { + fun trailingZeroes(n: Int): Int { + + } +}","impl Solution { + pub fn trailing_zeroes(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function trailingZeroes($n) { + + } +}","function trailingZeroes(n: number): number { + +};","(define/contract (trailing-zeroes n) + (-> exact-integer? exact-integer?) + + )","-spec trailing_zeroes(N :: integer()) -> integer(). +trailing_zeroes(N) -> + .","defmodule Solution do + @spec trailing_zeroes(n :: integer) :: integer + def trailing_zeroes(n) do + + end +end","class Solution { + int trailingZeroes(int n) { + + } +}", +1974,two-sum-ii-input-array-is-sorted,Two Sum II - Input Array Is Sorted,167.0,167.0,"

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 < numbers.length.

+ +

Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.

+ +

The tests are generated such that there is exactly one solution. You may not use the same element twice.

+ +

Your solution must use only constant extra space.

+ +

 

+

Example 1:

+ +
+Input: numbers = [2,7,11,15], target = 9
+Output: [1,2]
+Explanation: The sum of 2 and 7 is 9. Therefore, index1 = 1, index2 = 2. We return [1, 2].
+
+ +

Example 2:

+ +
+Input: numbers = [2,3,4], target = 6
+Output: [1,3]
+Explanation: The sum of 2 and 4 is 6. Therefore index1 = 1, index2 = 3. We return [1, 3].
+
+ +

Example 3:

+ +
+Input: numbers = [-1,0], target = -1
+Output: [1,2]
+Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1, index2 = 2. We return [1, 2].
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= numbers.length <= 3 * 104
    • +
  • -1000 <= numbers[i] <= 1000
    • +
  • numbers is sorted in non-decreasing order.
    • +
  • -1000 <= target <= 1000
    • +
  • The tests are generated such that there is exactly one solution.
    • +
+",2.0,False,"class Solution { +public: + vector twoSum(vector& numbers, int target) { + + } +};","class Solution { + public int[] twoSum(int[] numbers, int target) { + + } +}","class Solution(object): + def twoSum(self, numbers, target): + """""" + :type numbers: List[int] + :type target: int + :rtype: List[int] + """""" + ","class Solution: + def twoSum(self, numbers: List[int], target: int) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* twoSum(int* numbers, int numbersSize, int target, int* returnSize){ + +}","public class Solution { + public int[] TwoSum(int[] numbers, int target) { + + } +}","/** + * @param {number[]} numbers + * @param {number} target + * @return {number[]} + */ +var twoSum = function(numbers, target) { + +};","# @param {Integer[]} numbers +# @param {Integer} target +# @return {Integer[]} +def two_sum(numbers, target) + +end","class Solution { + func twoSum(_ numbers: [Int], _ target: Int) -> [Int] { + + } +}","func twoSum(numbers []int, target int) []int { + +}","object Solution { + def twoSum(numbers: Array[Int], target: Int): Array[Int] = { + + } +}","class Solution { + fun twoSum(numbers: IntArray, target: Int): IntArray { + + } +}","impl Solution { + pub fn two_sum(numbers: Vec, target: i32) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[] $numbers + * @param Integer $target + * @return Integer[] + */ + function twoSum($numbers, $target) { + + } +}","function twoSum(numbers: number[], target: number): number[] { + +};","(define/contract (two-sum numbers target) + (-> (listof exact-integer?) exact-integer? (listof exact-integer?)) + + )","-spec two_sum(Numbers :: [integer()], Target :: integer()) -> [integer()]. +two_sum(Numbers, Target) -> + .","defmodule Solution do + @spec two_sum(numbers :: [integer], target :: integer) :: [integer] + def two_sum(numbers, target) do + + end +end","class Solution { + List twoSum(List numbers, int target) { + + } +}", +1975,fraction-to-recurring-decimal,Fraction to Recurring Decimal,166.0,166.0,"

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

+ +

If the fractional part is repeating, enclose the repeating part in parentheses.

+ +

If multiple answers are possible, return any of them.

+ +

It is guaranteed that the length of the answer string is less than 104 for all the given inputs.

+ +

 

+

Example 1:

+ +
+Input: numerator = 1, denominator = 2
+Output: "0.5"
+
+ +

Example 2:

+ +
+Input: numerator = 2, denominator = 1
+Output: "2"
+
+ +

Example 3:

+ +
+Input: numerator = 4, denominator = 333
+Output: "0.(012)"
+
+ +

 

+

Constraints:

+ +
    +
  • -231 <= numerator, denominator <= 231 - 1
    • +
  • denominator != 0
    • +
+",2.0,False,"class Solution { +public: + string fractionToDecimal(int numerator, int denominator) { + + } +};","class Solution { + public String fractionToDecimal(int numerator, int denominator) { + + } +}","class Solution(object): + def fractionToDecimal(self, numerator, denominator): + """""" + :type numerator: int + :type denominator: int + :rtype: str + """""" + ","class Solution: + def fractionToDecimal(self, numerator: int, denominator: int) -> str: + ","char * fractionToDecimal(int numerator, int denominator){ + +}","public class Solution { + public string FractionToDecimal(int numerator, int denominator) { + + } +}","/** + * @param {number} numerator + * @param {number} denominator + * @return {string} + */ +var fractionToDecimal = function(numerator, denominator) { + +};","# @param {Integer} numerator +# @param {Integer} denominator +# @return {String} +def fraction_to_decimal(numerator, denominator) + +end","class Solution { + func fractionToDecimal(_ numerator: Int, _ denominator: Int) -> String { + + } +}","func fractionToDecimal(numerator int, denominator int) string { + +}","object Solution { + def fractionToDecimal(numerator: Int, denominator: Int): String = { + + } +}","class Solution { + fun fractionToDecimal(numerator: Int, denominator: Int): String { + + } +}","impl Solution { + pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $numerator + * @param Integer $denominator + * @return String + */ + function fractionToDecimal($numerator, $denominator) { + + } +}","function fractionToDecimal(numerator: number, denominator: number): string { + +};","(define/contract (fraction-to-decimal numerator denominator) + (-> exact-integer? exact-integer? string?) + + )","-spec fraction_to_decimal(Numerator :: integer(), Denominator :: integer()) -> unicode:unicode_binary(). +fraction_to_decimal(Numerator, Denominator) -> + .","defmodule Solution do + @spec fraction_to_decimal(numerator :: integer, denominator :: integer) :: String.t + def fraction_to_decimal(numerator, denominator) do + + end +end","class Solution { + String fractionToDecimal(int numerator, int denominator) { + + } +}", +1976,compare-version-numbers,Compare Version Numbers,165.0,165.0,"

Given two version numbers, version1 and version2, compare them.

+ +
    +
+ +

Version numbers consist of one or more revisions joined by a dot '.'. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character. Revisions are 0-indexed from left to right, with the leftmost revision being revision 0, the next revision being revision 1, and so on. For example 2.5.33 and 0.1 are valid version numbers.

+ +

To compare version numbers, compare their revisions in left-to-right order. Revisions are compared using their integer value ignoring any leading zeros. This means that revisions 1 and 001 are considered equal. If a version number does not specify a revision at an index, then treat the revision as 0. For example, version 1.0 is less than version 1.1 because their revision 0s are the same, but their revision 1s are 0 and 1 respectively, and 0 < 1.

+ +

Return the following:

+ +
    +
  • If version1 < version2, return -1.
    • +
  • If version1 > version2, return 1.
    • +
  • Otherwise, return 0.
    • +
+ +

 

+

Example 1:

+ +
+Input: version1 = "1.01", version2 = "1.001"
+Output: 0
+Explanation: Ignoring leading zeroes, both "01" and "001" represent the same integer "1".
+
+ +

Example 2:

+ +
+Input: version1 = "1.0", version2 = "1.0.0"
+Output: 0
+Explanation: version1 does not specify revision 2, which means it is treated as "0".
+
+ +

Example 3:

+ +
+Input: version1 = "0.1", version2 = "1.1"
+Output: -1
+Explanation: version1's revision 0 is "0", while version2's revision 0 is "1". 0 < 1, so version1 < version2.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= version1.length, version2.length <= 500
    • +
  • version1 and version2 only contain digits and '.'.
    • +
  • version1 and version2 are valid version numbers.
    • +
  • All the given revisions in version1 and version2 can be stored in a 32-bit integer.
    • +
+",2.0,False,"class Solution { +public: + int compareVersion(string version1, string version2) { + + } +};","class Solution { + public int compareVersion(String version1, String version2) { + + } +}","class Solution(object): + def compareVersion(self, version1, version2): + """""" + :type version1: str + :type version2: str + :rtype: int + """""" + ","class Solution: + def compareVersion(self, version1: str, version2: str) -> int: + ","int compareVersion(char * version1, char * version2){ + +}","public class Solution { + public int CompareVersion(string version1, string version2) { + + } +}","/** + * @param {string} version1 + * @param {string} version2 + * @return {number} + */ +var compareVersion = function(version1, version2) { + +};","# @param {String} version1 +# @param {String} version2 +# @return {Integer} +def compare_version(version1, version2) + +end","class Solution { + func compareVersion(_ version1: String, _ version2: String) -> Int { + + } +}","func compareVersion(version1 string, version2 string) int { + +}","object Solution { + def compareVersion(version1: String, version2: String): Int = { + + } +}","class Solution { + fun compareVersion(version1: String, version2: String): Int { + + } +}","impl Solution { + pub fn compare_version(version1: String, version2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $version1 + * @param String $version2 + * @return Integer + */ + function compareVersion($version1, $version2) { + + } +}","function compareVersion(version1: string, version2: string): number { + +};","(define/contract (compare-version version1 version2) + (-> string? string? exact-integer?) + + )","-spec compare_version(Version1 :: unicode:unicode_binary(), Version2 :: unicode:unicode_binary()) -> integer(). +compare_version(Version1, Version2) -> + .","defmodule Solution do + @spec compare_version(version1 :: String.t, version2 :: String.t) :: integer + def compare_version(version1, version2) do + + end +end","class Solution { + int compareVersion(String version1, String version2) { + + } +}", +1977,maximum-gap,Maximum Gap,164.0,164.0,"

Given an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return 0.

+ +

You must write an algorithm that runs in linear time and uses linear extra space.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,6,9,1]
+Output: 3
+Explanation: The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
+
+ +

Example 2:

+ +
+Input: nums = [10]
+Output: 0
+Explanation: The array contains less than 2 elements, therefore return 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 0 <= nums[i] <= 109
    • +
+",3.0,False,"class Solution { +public: + int maximumGap(vector& nums) { + + } +};","class Solution { + public int maximumGap(int[] nums) { + + } +}","class Solution(object): + def maximumGap(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maximumGap(self, nums: List[int]) -> int: + ","int maximumGap(int* nums, int numsSize){ + +}","public class Solution { + public int MaximumGap(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maximumGap = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def maximum_gap(nums) + +end","class Solution { + func maximumGap(_ nums: [Int]) -> Int { + + } +}","func maximumGap(nums []int) int { + +}","object Solution { + def maximumGap(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maximumGap(nums: IntArray): Int { + + } +}","impl Solution { + pub fn maximum_gap(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maximumGap($nums) { + + } +}","function maximumGap(nums: number[]): number { + +};","(define/contract (maximum-gap nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec maximum_gap(Nums :: [integer()]) -> integer(). +maximum_gap(Nums) -> + .","defmodule Solution do + @spec maximum_gap(nums :: [integer]) :: integer + def maximum_gap(nums) do + + end +end","class Solution { + int maximumGap(List nums) { + + } +}", +1978,find-peak-element,Find Peak Element,162.0,162.0,"

A peak element is an element that is strictly greater than its neighbors.

+ +

Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.

+ +

You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array.

+ +

You must write an algorithm that runs in O(log n) time.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,1]
+Output: 2
+Explanation: 3 is a peak element and your function should return the index number 2.
+ +

Example 2:

+ +
+Input: nums = [1,2,1,3,5,6,4]
+Output: 5
+Explanation: Your function can return either index number 1 where the peak element is 2, or index number 5 where the peak element is 6.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
  • nums[i] != nums[i + 1] for all valid i.
    • +
+",2.0,False,"class Solution { +public: + int findPeakElement(vector& nums) { + + } +};","class Solution { + public int findPeakElement(int[] nums) { + + } +}","class Solution(object): + def findPeakElement(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findPeakElement(self, nums: List[int]) -> int: + ","int findPeakElement(int* nums, int numsSize){ + +}","public class Solution { + public int FindPeakElement(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findPeakElement = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_peak_element(nums) + +end","class Solution { + func findPeakElement(_ nums: [Int]) -> Int { + + } +}","func findPeakElement(nums []int) int { + +}","object Solution { + def findPeakElement(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findPeakElement(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_peak_element(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findPeakElement($nums) { + + } +}","function findPeakElement(nums: number[]): number { + +};","(define/contract (find-peak-element nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_peak_element(Nums :: [integer()]) -> integer(). +find_peak_element(Nums) -> + .","defmodule Solution do + @spec find_peak_element(nums :: [integer]) :: integer + def find_peak_element(nums) do + + end +end","class Solution { + int findPeakElement(List nums) { + + } +}", +1981,find-minimum-in-rotated-sorted-array-ii,Find Minimum in Rotated Sorted Array II,154.0,154.0,"

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:

+ +
    +
  • [4,5,6,7,0,1,4] if it was rotated 4 times.
    • +
  • [0,1,4,4,5,6,7] if it was rotated 7 times.
    • +
+ +

Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

+ +

Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array.

+ +

You must decrease the overall operation steps as much as possible.

+ +

 

+

Example 1:

+
Input: nums = [1,3,5]
+Output: 1
+

Example 2:

+
Input: nums = [2,2,2,0,1]
+Output: 0
+
+

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 5000
    • +
  • -5000 <= nums[i] <= 5000
    • +
  • nums is sorted and rotated between 1 and n times.
    • +
+ +

 

+

Follow up: This problem is similar to Find Minimum in Rotated Sorted Array, but nums may contain duplicates. Would this affect the runtime complexity? How and why?

+ +

 

+",3.0,False,"class Solution { +public: + int findMin(vector& nums) { + + } +};","class Solution { + public int findMin(int[] nums) { + + } +}","class Solution(object): + def findMin(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findMin(self, nums: List[int]) -> int: + ","int findMin(int* nums, int numsSize){ + +}","public class Solution { + public int FindMin(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findMin = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_min(nums) + +end","class Solution { + func findMin(_ nums: [Int]) -> Int { + + } +}","func findMin(nums []int) int { + +}","object Solution { + def findMin(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findMin(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_min(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findMin($nums) { + + } +}","function findMin(nums: number[]): number { + +};","(define/contract (find-min nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_min(Nums :: [integer()]) -> integer(). +find_min(Nums) -> + .","defmodule Solution do + @spec find_min(nums :: [integer]) :: integer + def find_min(nums) do + + end +end","class Solution { + int findMin(List nums) { + + } +}", +1982,find-minimum-in-rotated-sorted-array,Find Minimum in Rotated Sorted Array,153.0,153.0,"

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:

+ +
    +
  • [4,5,6,7,0,1,2] if it was rotated 4 times.
    • +
  • [0,1,2,4,5,6,7] if it was rotated 7 times.
    • +
+ +

Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

+ +

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

+ +

You must write an algorithm that runs in O(log n) time.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,4,5,1,2]
+Output: 1
+Explanation: The original array was [1,2,3,4,5] rotated 3 times.
+
+ +

Example 2:

+ +
+Input: nums = [4,5,6,7,0,1,2]
+Output: 0
+Explanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
+
+ +

Example 3:

+ +
+Input: nums = [11,13,15,17]
+Output: 11
+Explanation: The original array was [11,13,15,17] and it was rotated 4 times. 
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 5000
    • +
  • -5000 <= nums[i] <= 5000
    • +
  • All the integers of nums are unique.
    • +
  • nums is sorted and rotated between 1 and n times.
    • +
+",2.0,False,"class Solution { +public: + int findMin(vector& nums) { + + } +};","class Solution { + public int findMin(int[] nums) { + + } +}","class Solution(object): + def findMin(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def findMin(self, nums: List[int]) -> int: + ","int findMin(int* nums, int numsSize){ + +}","public class Solution { + public int FindMin(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var findMin = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def find_min(nums) + +end","class Solution { + func findMin(_ nums: [Int]) -> Int { + + } +}","func findMin(nums []int) int { + +}","object Solution { + def findMin(nums: Array[Int]): Int = { + + } +}","class Solution { + fun findMin(nums: IntArray): Int { + + } +}","impl Solution { + pub fn find_min(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function findMin($nums) { + + } +}","function findMin(nums: number[]): number { + +};","(define/contract (find-min nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec find_min(Nums :: [integer()]) -> integer(). +find_min(Nums) -> + .","defmodule Solution do + @spec find_min(nums :: [integer]) :: integer + def find_min(nums) do + + end +end","class Solution { + int findMin(List nums) { + + } +}", +1985,evaluate-reverse-polish-notation,Evaluate Reverse Polish Notation,150.0,150.0,"

You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation.

+ +

Evaluate the expression. Return an integer that represents the value of the expression.

+ +

Note that:

+ +
    +
  • The valid operators are '+', '-', '*', and '/'.
    • +
  • Each operand may be an integer or another expression.
    • +
  • The division between two integers always truncates toward zero.
    • +
  • There will not be any division by zero.
    • +
  • The input represents a valid arithmetic expression in a reverse polish notation.
    • +
  • The answer and all the intermediate calculations can be represented in a 32-bit integer.
    • +
+ +

 

+

Example 1:

+ +
+Input: tokens = ["2","1","+","3","*"]
+Output: 9
+Explanation: ((2 + 1) * 3) = 9
+
+ +

Example 2:

+ +
+Input: tokens = ["4","13","5","/","+"]
+Output: 6
+Explanation: (4 + (13 / 5)) = 6
+
+ +

Example 3:

+ +
+Input: tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
+Output: 22
+Explanation: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
+= ((10 * (6 / (12 * -11))) + 17) + 5
+= ((10 * (6 / -132)) + 17) + 5
+= ((10 * 0) + 17) + 5
+= (0 + 17) + 5
+= 17 + 5
+= 22
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= tokens.length <= 104
    • +
  • tokens[i] is either an operator: "+", "-", "*", or "/", or an integer in the range [-200, 200].
    • +
+",2.0,False,"class Solution { +public: + int evalRPN(vector& tokens) { + + } +};","class Solution { + public int evalRPN(String[] tokens) { + + } +}","class Solution(object): + def evalRPN(self, tokens): + """""" + :type tokens: List[str] + :rtype: int + """""" + ","class Solution: + def evalRPN(self, tokens: List[str]) -> int: + ","int evalRPN(char ** tokens, int tokensSize){ + +}","public class Solution { + public int EvalRPN(string[] tokens) { + + } +}","/** + * @param {string[]} tokens + * @return {number} + */ +var evalRPN = function(tokens) { + +};","# @param {String[]} tokens +# @return {Integer} +def eval_rpn(tokens) + +end","class Solution { + func evalRPN(_ tokens: [String]) -> Int { + + } +}","func evalRPN(tokens []string) int { + +}","object Solution { + def evalRPN(tokens: Array[String]): Int = { + + } +}","class Solution { + fun evalRPN(tokens: Array): Int { + + } +}","impl Solution { + pub fn eval_rpn(tokens: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String[] $tokens + * @return Integer + */ + function evalRPN($tokens) { + + } +}","function evalRPN(tokens: string[]): number { + +};","(define/contract (eval-rpn tokens) + (-> (listof string?) exact-integer?) + + )","-spec eval_rpn(Tokens :: [unicode:unicode_binary()]) -> integer(). +eval_rpn(Tokens) -> + .","defmodule Solution do + @spec eval_rpn(tokens :: [String.t]) :: integer + def eval_rpn(tokens) do + + end +end","class Solution { + int evalRPN(List tokens) { + + } +}", +1986,max-points-on-a-line,Max Points on a Line,149.0,149.0,"

Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line.

+ +

 

+

Example 1:

+ +
+Input: points = [[1,1],[2,2],[3,3]]
+Output: 3
+
+ +

Example 2:

+ +
+Input: points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= points.length <= 300
    • +
  • points[i].length == 2
    • +
  • -104 <= xi, yi <= 104
    • +
  • All the points are unique.
    • +
+",3.0,False,"class Solution { +public: + int maxPoints(vector>& points) { + + } +};","class Solution { + public int maxPoints(int[][] points) { + + } +}","class Solution(object): + def maxPoints(self, points): + """""" + :type points: List[List[int]] + :rtype: int + """""" + ","class Solution: + def maxPoints(self, points: List[List[int]]) -> int: + ","int maxPoints(int** points, int pointsSize, int* pointsColSize){ + +}","public class Solution { + public int MaxPoints(int[][] points) { + + } +}","/** + * @param {number[][]} points + * @return {number} + */ +var maxPoints = function(points) { + +};","# @param {Integer[][]} points +# @return {Integer} +def max_points(points) + +end","class Solution { + func maxPoints(_ points: [[Int]]) -> Int { + + } +}","func maxPoints(points [][]int) int { + +}","object Solution { + def maxPoints(points: Array[Array[Int]]): Int = { + + } +}","class Solution { + fun maxPoints(points: Array): Int { + + } +}","impl Solution { + pub fn max_points(points: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[][] $points + * @return Integer + */ + function maxPoints($points) { + + } +}","function maxPoints(points: number[][]): number { + +};","(define/contract (max-points points) + (-> (listof (listof exact-integer?)) exact-integer?) + + )","-spec max_points(Points :: [[integer()]]) -> integer(). +max_points(Points) -> + .","defmodule Solution do + @spec max_points(points :: [[integer]]) :: integer + def max_points(points) do + + end +end","class Solution { + int maxPoints(List> points) { + + } +}", +1989,lru-cache,LRU Cache,146.0,146.0,"

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

+ +

Implement the LRUCache class:

+ +
    +
  • LRUCache(int capacity) Initialize the LRU cache with positive size capacity.
    • +
  • int get(int key) Return the value of the key if the key exists, otherwise return -1.
    • +
  • void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.
    • +
+ +

The functions get and put must each run in O(1) average time complexity.

+ +

 

+

Example 1:

+ +
+Input
+["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"]
+[[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]
+Output
+[null, null, null, 1, null, -1, null, -1, 3, 4]
+
+Explanation
+LRUCache lRUCache = new LRUCache(2);
+lRUCache.put(1, 1); // cache is {1=1}
+lRUCache.put(2, 2); // cache is {1=1, 2=2}
+lRUCache.get(1);    // return 1
+lRUCache.put(3, 3); // LRU key was 2, evicts key 2, cache is {1=1, 3=3}
+lRUCache.get(2);    // returns -1 (not found)
+lRUCache.put(4, 4); // LRU key was 1, evicts key 1, cache is {4=4, 3=3}
+lRUCache.get(1);    // return -1 (not found)
+lRUCache.get(3);    // return 3
+lRUCache.get(4);    // return 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= capacity <= 3000
    • +
  • 0 <= key <= 104
    • +
  • 0 <= value <= 105
    • +
  • At most 2 * 105 calls will be made to get and put.
    • +
+",2.0,False,"class LRUCache { +public: + LRUCache(int capacity) { + + } + + int get(int key) { + + } + + void put(int key, int value) { + + } +}; + +/** + * Your LRUCache object will be instantiated and called as such: + * LRUCache* obj = new LRUCache(capacity); + * int param_1 = obj->get(key); + * obj->put(key,value); + */","class LRUCache { + + public LRUCache(int capacity) { + + } + + public int get(int key) { + + } + + public void put(int key, int value) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * LRUCache obj = new LRUCache(capacity); + * int param_1 = obj.get(key); + * obj.put(key,value); + */","class LRUCache(object): + + def __init__(self, capacity): + """""" + :type capacity: int + """""" + + + def get(self, key): + """""" + :type key: int + :rtype: int + """""" + + + def put(self, key, value): + """""" + :type key: int + :type value: int + :rtype: None + """""" + + + +# Your LRUCache object will be instantiated and called as such: +# obj = LRUCache(capacity) +# param_1 = obj.get(key) +# obj.put(key,value)","class LRUCache: + + def __init__(self, capacity: int): + + + def get(self, key: int) -> int: + + + def put(self, key: int, value: int) -> None: + + + +# Your LRUCache object will be instantiated and called as such: +# obj = LRUCache(capacity) +# param_1 = obj.get(key) +# obj.put(key,value)"," + + +typedef struct { + +} LRUCache; + + +LRUCache* lRUCacheCreate(int capacity) { + +} + +int lRUCacheGet(LRUCache* obj, int key) { + +} + +void lRUCachePut(LRUCache* obj, int key, int value) { + +} + +void lRUCacheFree(LRUCache* obj) { + +} + +/** + * Your LRUCache struct will be instantiated and called as such: + * LRUCache* obj = lRUCacheCreate(capacity); + * int param_1 = lRUCacheGet(obj, key); + + * lRUCachePut(obj, key, value); + + * lRUCacheFree(obj); +*/","public class LRUCache { + + public LRUCache(int capacity) { + + } + + public int Get(int key) { + + } + + public void Put(int key, int value) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * LRUCache obj = new LRUCache(capacity); + * int param_1 = obj.Get(key); + * obj.Put(key,value); + */","/** + * @param {number} capacity + */ +var LRUCache = function(capacity) { + +}; + +/** + * @param {number} key + * @return {number} + */ +LRUCache.prototype.get = function(key) { + +}; + +/** + * @param {number} key + * @param {number} value + * @return {void} + */ +LRUCache.prototype.put = function(key, value) { + +}; + +/** + * Your LRUCache object will be instantiated and called as such: + * var obj = new LRUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","class LRUCache + +=begin + :type capacity: Integer +=end + def initialize(capacity) + + end + + +=begin + :type key: Integer + :rtype: Integer +=end + def get(key) + + end + + +=begin + :type key: Integer + :type value: Integer + :rtype: Void +=end + def put(key, value) + + end + + +end + +# Your LRUCache object will be instantiated and called as such: +# obj = LRUCache.new(capacity) +# param_1 = obj.get(key) +# obj.put(key, value)"," +class LRUCache { + + init(_ capacity: Int) { + + } + + func get(_ key: Int) -> Int { + + } + + func put(_ key: Int, _ value: Int) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * let obj = LRUCache(capacity) + * let ret_1: Int = obj.get(key) + * obj.put(key, value) + */","type LRUCache struct { + +} + + +func Constructor(capacity int) LRUCache { + +} + + +func (this *LRUCache) Get(key int) int { + +} + + +func (this *LRUCache) Put(key int, value int) { + +} + + +/** + * Your LRUCache object will be instantiated and called as such: + * obj := Constructor(capacity); + * param_1 := obj.Get(key); + * obj.Put(key,value); + */","class LRUCache(_capacity: Int) { + + def get(key: Int): Int = { + + } + + def put(key: Int, value: Int) { + + } + +} + +/** + * Your LRUCache object will be instantiated and called as such: + * var obj = new LRUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","class LRUCache(capacity: Int) { + + fun get(key: Int): Int { + + } + + fun put(key: Int, value: Int) { + + } + +} + +/** + * Your LRUCache object will be instantiated and called as such: + * var obj = LRUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","struct LRUCache { + +} + + +/** + * `&self` means the method takes an immutable reference. + * If you need a mutable reference, change it to `&mut self` instead. + */ +impl LRUCache { + + fn new(capacity: i32) -> Self { + + } + + fn get(&self, key: i32) -> i32 { + + } + + fn put(&self, key: i32, value: i32) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * let obj = LRUCache::new(capacity); + * let ret_1: i32 = obj.get(key); + * obj.put(key, value); + */","class LRUCache { + /** + * @param Integer $capacity + */ + function __construct($capacity) { + + } + + /** + * @param Integer $key + * @return Integer + */ + function get($key) { + + } + + /** + * @param Integer $key + * @param Integer $value + * @return NULL + */ + function put($key, $value) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * $obj = LRUCache($capacity); + * $ret_1 = $obj->get($key); + * $obj->put($key, $value); + */","class LRUCache { + constructor(capacity: number) { + + } + + get(key: number): number { + + } + + put(key: number, value: number): void { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * var obj = new LRUCache(capacity) + * var param_1 = obj.get(key) + * obj.put(key,value) + */","(define lru-cache% + (class object% + (super-new) + + ; capacity : exact-integer? + (init-field + capacity) + + ; get : exact-integer? -> exact-integer? + (define/public (get key) + + ) + ; put : exact-integer? exact-integer? -> void? + (define/public (put key value) + + ))) + +;; Your lru-cache% object will be instantiated and called as such: +;; (define obj (new lru-cache% [capacity capacity])) +;; (define param_1 (send obj get key)) +;; (send obj put key value)","-spec lru_cache_init_(Capacity :: integer()) -> any(). +lru_cache_init_(Capacity) -> + . + +-spec lru_cache_get(Key :: integer()) -> integer(). +lru_cache_get(Key) -> + . + +-spec lru_cache_put(Key :: integer(), Value :: integer()) -> any(). +lru_cache_put(Key, Value) -> + . + + +%% Your functions will be called as such: +%% lru_cache_init_(Capacity), +%% Param_1 = lru_cache_get(Key), +%% lru_cache_put(Key, Value), + +%% lru_cache_init_ will be called before every test case, in which you can do some necessary initializations.","defmodule LRUCache do + @spec init_(capacity :: integer) :: any + def init_(capacity) do + + end + + @spec get(key :: integer) :: integer + def get(key) do + + end + + @spec put(key :: integer, value :: integer) :: any + def put(key, value) do + + end +end + +# Your functions will be called as such: +# LRUCache.init_(capacity) +# param_1 = LRUCache.get(key) +# LRUCache.put(key, value) + +# LRUCache.init_ will be called before every test case, in which you can do some necessary initializations.","class LRUCache { + + LRUCache(int capacity) { + + } + + int get(int key) { + + } + + void put(int key, int value) { + + } +} + +/** + * Your LRUCache object will be instantiated and called as such: + * LRUCache obj = LRUCache(capacity); + * int param1 = obj.get(key); + * obj.put(key,value); + */", +1990,binary-tree-postorder-traversal,Binary Tree Postorder Traversal,145.0,145.0,"

Given the root of a binary tree, return the postorder traversal of its nodes' values.

+ +

 

+

Example 1:

+ +
+Input: root = [1,null,2,3]
+Output: [3,2,1]
+
+ +

Example 2:

+ +
+Input: root = []
+Output: []
+
+ +

Example 3:

+ +
+Input: root = [1]
+Output: [1]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of the nodes in the tree is in the range [0, 100].
    • +
  • -100 <= Node.val <= 100
    • +
+ +

 

+Follow up: Recursive solution is trivial, could you do it iteratively?",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector postorderTraversal(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List postorderTraversal(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def postorderTraversal(self, root): + """""" + :type root: TreeNode + :rtype: List[int] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* postorderTraversal(struct TreeNode* root, int* returnSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList PostorderTraversal(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number[]} + */ +var postorderTraversal = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer[]} +def postorder_traversal(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func postorderTraversal(_ root: TreeNode?) -> [Int] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func postorderTraversal(root *TreeNode) []int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def postorderTraversal(root: TreeNode): List[Int] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun postorderTraversal(root: TreeNode?): List { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn postorder_traversal(root: Option>>) -> Vec { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer[] + */ + function postorderTraversal($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function postorderTraversal(root: TreeNode | null): number[] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (postorder-traversal root) + (-> (or/c tree-node? #f) (listof exact-integer?)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec postorder_traversal(Root :: #tree_node{} | null) -> [integer()]. +postorder_traversal(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec postorder_traversal(root :: TreeNode.t | nil) :: [integer] + def postorder_traversal(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List postorderTraversal(TreeNode? root) { + + } +}", +1992,reorder-list,Reorder List,143.0,143.0,"

You are given the head of a singly linked-list. The list can be represented as:

+ +
+L0 → L1 → … → Ln - 1 → Ln
+
+ +

Reorder the list to be on the following form:

+ +
+L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …
+
+ +

You may not modify the values in the list's nodes. Only nodes themselves may be changed.

+ +

 

+

Example 1:

+ +
+Input: head = [1,2,3,4]
+Output: [1,4,2,3]
+
+ +

Example 2:

+ +
+Input: head = [1,2,3,4,5]
+Output: [1,5,2,4,3]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [1, 5 * 104].
    • +
  • 1 <= Node.val <= 1000
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + void reorderList(ListNode* head) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public void reorderList(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def reorderList(self, head): + """""" + :type head: ListNode + :rtype: None Do not return anything, modify head in-place instead. + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def reorderList(self, head: Optional[ListNode]) -> None: + """""" + Do not return anything, modify head in-place instead. + """""" + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +void reorderList(struct ListNode* head){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public void ReorderList(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @return {void} Do not return anything, modify head in-place instead. + */ +var reorderList = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @return {Void} Do not return anything, modify head in-place instead. +def reorder_list(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func reorderList(_ head: ListNode?) { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func reorderList(head *ListNode) { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def reorderList(head: ListNode): Unit = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun reorderList(head: ListNode?): Unit { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn reorder_list(head: &mut Option>) { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @return NULL + */ + function reorderList($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +/** + Do not return anything, modify head in-place instead. + */ +function reorderList(head: ListNode | null): void { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (reorder-list head) + (-> (or/c list-node? #f) void?) + + )",,,"/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + void reorderList(ListNode? head) { + + } +}", +1993,linked-list-cycle-ii,Linked List Cycle II,142.0,142.0,"

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

+ +

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to (0-indexed). It is -1 if there is no cycle. Note that pos is not passed as a parameter.

+ +

Do not modify the linked list.

+ +

 

+

Example 1:

+ +
+Input: head = [3,2,0,-4], pos = 1
+Output: tail connects to node index 1
+Explanation: There is a cycle in the linked list, where tail connects to the second node.
+
+ +

Example 2:

+ +
+Input: head = [1,2], pos = 0
+Output: tail connects to node index 0
+Explanation: There is a cycle in the linked list, where tail connects to the first node.
+
+ +

Example 3:

+ +
+Input: head = [1], pos = -1
+Output: no cycle
+Explanation: There is no cycle in the linked list.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of the nodes in the list is in the range [0, 104].
    • +
  • -105 <= Node.val <= 105
    • +
  • pos is -1 or a valid index in the linked-list.
    • +
+ +

 

+

Follow up: Can you solve it using O(1) (i.e. constant) memory?

+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode(int x) : val(x), next(NULL) {} + * }; + */ +class Solution { +public: + ListNode *detectCycle(ListNode *head) { + + } +};","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode next; + * ListNode(int x) { + * val = x; + * next = null; + * } + * } + */ +public class Solution { + public ListNode detectCycle(ListNode head) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, x): +# self.val = x +# self.next = None + +class Solution(object): + def detectCycle(self, head): + """""" + :type head: ListNode + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, x): +# self.val = x +# self.next = None + +class Solution: + def detectCycle(self, head: Optional[ListNode]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode *detectCycle(struct ListNode *head) { + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int x) { + * val = x; + * next = null; + * } + * } + */ +public class Solution { + public ListNode DetectCycle(ListNode head) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val) { + * this.val = val; + * this.next = null; + * } + */ + +/** + * @param {ListNode} head + * @return {ListNode} + */ +var detectCycle = function(head) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val) +# @val = val +# @next = nil +# end +# end + +# @param {ListNode} head +# @return {ListNode} +def detectCycle(head) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init(_ val: Int) { + * self.val = val + * self.next = nil + * } + * } + */ + +class Solution { + func detectCycle(_ head: ListNode?) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func detectCycle(head *ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(var _x: Int = 0) { + * var next: ListNode = null + * var x: Int = _x + * } + */ + +object Solution { + def detectCycle(head: ListNode): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ + +class Solution { + fun detectCycle(head: ListNode?): ListNode? { + + } +}",,"/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val) { $this->val = $val; } + * } + */ + +class Solution { + /** + * @param ListNode $head + * @return ListNode + */ + function detectCycle($head) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function detectCycle(head: ListNode | null): ListNode | null { + +};",,,,, +1995,word-break-ii,Word Break II,140.0,140.0,"

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order.

+ +

Note that the same word in the dictionary may be reused multiple times in the segmentation.

+ +

 

+

Example 1:

+ +
+Input: s = "catsanddog", wordDict = ["cat","cats","and","sand","dog"]
+Output: ["cats and dog","cat sand dog"]
+
+ +

Example 2:

+ +
+Input: s = "pineapplepenapple", wordDict = ["apple","pen","applepen","pine","pineapple"]
+Output: ["pine apple pen apple","pineapple pen apple","pine applepen apple"]
+Explanation: Note that you are allowed to reuse a dictionary word.
+
+ +

Example 3:

+ +
+Input: s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 20
    • +
  • 1 <= wordDict.length <= 1000
    • +
  • 1 <= wordDict[i].length <= 10
    • +
  • s and wordDict[i] consist of only lowercase English letters.
    • +
  • All the strings of wordDict are unique.
    • +
  • Input is generated in a way that the length of the answer doesn't exceed 105.
    • +
+",3.0,False,"class Solution { +public: + vector wordBreak(string s, vector& wordDict) { + + } +};","class Solution { + public List wordBreak(String s, List wordDict) { + + } +}","class Solution(object): + def wordBreak(self, s, wordDict): + """""" + :type s: str + :type wordDict: List[str] + :rtype: List[str] + """""" + ","class Solution: + def wordBreak(self, s: str, wordDict: List[str]) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** wordBreak(char * s, char ** wordDict, int wordDictSize, int* returnSize){ + +}","public class Solution { + public IList WordBreak(string s, IList wordDict) { + + } +}","/** + * @param {string} s + * @param {string[]} wordDict + * @return {string[]} + */ +var wordBreak = function(s, wordDict) { + +};","# @param {String} s +# @param {String[]} word_dict +# @return {String[]} +def word_break(s, word_dict) + +end","class Solution { + func wordBreak(_ s: String, _ wordDict: [String]) -> [String] { + + } +}","func wordBreak(s string, wordDict []string) []string { + +}","object Solution { + def wordBreak(s: String, wordDict: List[String]): List[String] = { + + } +}","class Solution { + fun wordBreak(s: String, wordDict: List): List { + + } +}","impl Solution { + pub fn word_break(s: String, word_dict: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $wordDict + * @return String[] + */ + function wordBreak($s, $wordDict) { + + } +}","function wordBreak(s: string, wordDict: string[]): string[] { + +};","(define/contract (word-break s wordDict) + (-> string? (listof string?) (listof string?)) + + )","-spec word_break(S :: unicode:unicode_binary(), WordDict :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()]. +word_break(S, WordDict) -> + .","defmodule Solution do + @spec word_break(s :: String.t, word_dict :: [String.t]) :: [String.t] + def word_break(s, word_dict) do + + end +end","class Solution { + List wordBreak(String s, List wordDict) { + + } +}", +1996,word-break,Word Break,139.0,139.0,"

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

+ +

Note that the same word in the dictionary may be reused multiple times in the segmentation.

+ +

 

+

Example 1:

+ +
+Input: s = "leetcode", wordDict = ["leet","code"]
+Output: true
+Explanation: Return true because "leetcode" can be segmented as "leet code".
+
+ +

Example 2:

+ +
+Input: s = "applepenapple", wordDict = ["apple","pen"]
+Output: true
+Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
+Note that you are allowed to reuse a dictionary word.
+
+ +

Example 3:

+ +
+Input: s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 300
    • +
  • 1 <= wordDict.length <= 1000
    • +
  • 1 <= wordDict[i].length <= 20
    • +
  • s and wordDict[i] consist of only lowercase English letters.
    • +
  • All the strings of wordDict are unique.
    • +
+",2.0,False,"class Solution { +public: + bool wordBreak(string s, vector& wordDict) { + + } +};","class Solution { + public boolean wordBreak(String s, List wordDict) { + + } +}","class Solution(object): + def wordBreak(self, s, wordDict): + """""" + :type s: str + :type wordDict: List[str] + :rtype: bool + """""" + ","class Solution: + def wordBreak(self, s: str, wordDict: List[str]) -> bool: + ","bool wordBreak(char * s, char ** wordDict, int wordDictSize){ + +}","public class Solution { + public bool WordBreak(string s, IList wordDict) { + + } +}","/** + * @param {string} s + * @param {string[]} wordDict + * @return {boolean} + */ +var wordBreak = function(s, wordDict) { + +};","# @param {String} s +# @param {String[]} word_dict +# @return {Boolean} +def word_break(s, word_dict) + +end","class Solution { + func wordBreak(_ s: String, _ wordDict: [String]) -> Bool { + + } +}","func wordBreak(s string, wordDict []string) bool { + +}","object Solution { + def wordBreak(s: String, wordDict: List[String]): Boolean = { + + } +}","class Solution { + fun wordBreak(s: String, wordDict: List): Boolean { + + } +}","impl Solution { + pub fn word_break(s: String, word_dict: Vec) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $wordDict + * @return Boolean + */ + function wordBreak($s, $wordDict) { + + } +}","function wordBreak(s: string, wordDict: string[]): boolean { + +};","(define/contract (word-break s wordDict) + (-> string? (listof string?) boolean?) + + )","-spec word_break(S :: unicode:unicode_binary(), WordDict :: [unicode:unicode_binary()]) -> boolean(). +word_break(S, WordDict) -> + .","defmodule Solution do + @spec word_break(s :: String.t, word_dict :: [String.t]) :: boolean + def word_break(s, word_dict) do + + end +end","class Solution { + bool wordBreak(String s, List wordDict) { + + } +}", +1998,single-number-ii,Single Number II,137.0,137.0,"

Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.

+ +

You must implement a solution with a linear runtime complexity and use only constant extra space.

+ +

 

+

Example 1:

+
Input: nums = [2,2,3,2]
+Output: 3
+

Example 2:

+
Input: nums = [0,1,0,1,0,1,99]
+Output: 99
+
+

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
  • Each element in nums appears exactly three times except for one element which appears once.
    • +
+",2.0,False,"class Solution { +public: + int singleNumber(vector& nums) { + + } +};","class Solution { + public int singleNumber(int[] nums) { + + } +}","class Solution(object): + def singleNumber(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def singleNumber(self, nums: List[int]) -> int: + ","int singleNumber(int* nums, int numsSize){ + +}","public class Solution { + public int SingleNumber(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var singleNumber = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def single_number(nums) + +end","class Solution { + func singleNumber(_ nums: [Int]) -> Int { + + } +}","func singleNumber(nums []int) int { + +}","object Solution { + def singleNumber(nums: Array[Int]): Int = { + + } +}","class Solution { + fun singleNumber(nums: IntArray): Int { + + } +}","impl Solution { + pub fn single_number(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function singleNumber($nums) { + + } +}","function singleNumber(nums: number[]): number { + +};","(define/contract (single-number nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec single_number(Nums :: [integer()]) -> integer(). +single_number(Nums) -> + .","defmodule Solution do + @spec single_number(nums :: [integer]) :: integer + def single_number(nums) do + + end +end","class Solution { + int singleNumber(List nums) { + + } +}", +2000,candy,Candy,135.0,135.0,"

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.

+ +

You are giving candies to these children subjected to the following requirements:

+ +
    +
  • Each child must have at least one candy.
    • +
  • Children with a higher rating get more candies than their neighbors.
    • +
+ +

Return the minimum number of candies you need to have to distribute the candies to the children.

+ +

 

+

Example 1:

+ +
+Input: ratings = [1,0,2]
+Output: 5
+Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
+
+ +

Example 2:

+ +
+Input: ratings = [1,2,2]
+Output: 4
+Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
+The third child gets 1 candy because it satisfies the above two conditions.
+
+ +

 

+

Constraints:

+ +
    +
  • n == ratings.length
    • +
  • 1 <= n <= 2 * 104
    • +
  • 0 <= ratings[i] <= 2 * 104
    • +
+",3.0,False,"class Solution { +public: + int candy(vector& ratings) { + + } +};","class Solution { + public int candy(int[] ratings) { + + } +}","class Solution(object): + def candy(self, ratings): + """""" + :type ratings: List[int] + :rtype: int + """""" + ","class Solution: + def candy(self, ratings: List[int]) -> int: + ","int candy(int* ratings, int ratingsSize){ + +}","public class Solution { + public int Candy(int[] ratings) { + + } +}","/** + * @param {number[]} ratings + * @return {number} + */ +var candy = function(ratings) { + +};","# @param {Integer[]} ratings +# @return {Integer} +def candy(ratings) + +end","class Solution { + func candy(_ ratings: [Int]) -> Int { + + } +}","func candy(ratings []int) int { + +}","object Solution { + def candy(ratings: Array[Int]): Int = { + + } +}","class Solution { + fun candy(ratings: IntArray): Int { + + } +}","impl Solution { + pub fn candy(ratings: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $ratings + * @return Integer + */ + function candy($ratings) { + + } +}","function candy(ratings: number[]): number { + +};","(define/contract (candy ratings) + (-> (listof exact-integer?) exact-integer?) + + )","-spec candy(Ratings :: [integer()]) -> integer(). +candy(Ratings) -> + .","defmodule Solution do + @spec candy(ratings :: [integer]) :: integer + def candy(ratings) do + + end +end","class Solution { + int candy(List ratings) { + + } +}", +2001,gas-station,Gas Station,134.0,134.0,"

There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].

+ +

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the journey with an empty tank at one of the gas stations.

+ +

Given two integer arrays gas and cost, return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique

+ +

 

+

Example 1:

+ +
+Input: gas = [1,2,3,4,5], cost = [3,4,5,1,2]
+Output: 3
+Explanation:
+Start at station 3 (index 3) and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
+Travel to station 4. Your tank = 4 - 1 + 5 = 8
+Travel to station 0. Your tank = 8 - 2 + 1 = 7
+Travel to station 1. Your tank = 7 - 3 + 2 = 6
+Travel to station 2. Your tank = 6 - 4 + 3 = 5
+Travel to station 3. The cost is 5. Your gas is just enough to travel back to station 3.
+Therefore, return 3 as the starting index.
+
+ +

Example 2:

+ +
+Input: gas = [2,3,4], cost = [3,4,3]
+Output: -1
+Explanation:
+You can't start at station 0 or 1, as there is not enough gas to travel to the next station.
+Let's start at station 2 and fill up with 4 unit of gas. Your tank = 0 + 4 = 4
+Travel to station 0. Your tank = 4 - 3 + 2 = 3
+Travel to station 1. Your tank = 3 - 3 + 3 = 3
+You cannot travel back to station 2, as it requires 4 unit of gas but you only have 3.
+Therefore, you can't travel around the circuit once no matter where you start.
+
+ +

 

+

Constraints:

+ +
    +
  • n == gas.length == cost.length
    • +
  • 1 <= n <= 105
    • +
  • 0 <= gas[i], cost[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int canCompleteCircuit(vector& gas, vector& cost) { + + } +};","class Solution { + public int canCompleteCircuit(int[] gas, int[] cost) { + + } +}","class Solution(object): + def canCompleteCircuit(self, gas, cost): + """""" + :type gas: List[int] + :type cost: List[int] + :rtype: int + """""" + ","class Solution: + def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int: + ","int canCompleteCircuit(int* gas, int gasSize, int* cost, int costSize){ + +}","public class Solution { + public int CanCompleteCircuit(int[] gas, int[] cost) { + + } +}","/** + * @param {number[]} gas + * @param {number[]} cost + * @return {number} + */ +var canCompleteCircuit = function(gas, cost) { + +};","# @param {Integer[]} gas +# @param {Integer[]} cost +# @return {Integer} +def can_complete_circuit(gas, cost) + +end","class Solution { + func canCompleteCircuit(_ gas: [Int], _ cost: [Int]) -> Int { + + } +}","func canCompleteCircuit(gas []int, cost []int) int { + +}","object Solution { + def canCompleteCircuit(gas: Array[Int], cost: Array[Int]): Int = { + + } +}","class Solution { + fun canCompleteCircuit(gas: IntArray, cost: IntArray): Int { + + } +}","impl Solution { + pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $gas + * @param Integer[] $cost + * @return Integer + */ + function canCompleteCircuit($gas, $cost) { + + } +}","function canCompleteCircuit(gas: number[], cost: number[]): number { + +};","(define/contract (can-complete-circuit gas cost) + (-> (listof exact-integer?) (listof exact-integer?) exact-integer?) + + )","-spec can_complete_circuit(Gas :: [integer()], Cost :: [integer()]) -> integer(). +can_complete_circuit(Gas, Cost) -> + .","defmodule Solution do + @spec can_complete_circuit(gas :: [integer], cost :: [integer]) :: integer + def can_complete_circuit(gas, cost) do + + end +end","class Solution { + int canCompleteCircuit(List gas, List cost) { + + } +}", +2002,clone-graph,Clone Graph,133.0,133.0,"

Given a reference of a node in a connected undirected graph.

+ +

Return a deep copy (clone) of the graph.

+ +

Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.

+ +
+class Node {
+    public int val;
+    public List<Node> neighbors;
+}
+
+ +

 

+ +

Test case format:

+ +

For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with val == 1, the second node with val == 2, and so on. The graph is represented in the test case using an adjacency list.

+ +

An adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.

+ +

The given node will always be the first node with val = 1. You must return the copy of the given node as a reference to the cloned graph.

+ +

 

+

Example 1:

+ +
+Input: adjList = [[2,4],[1,3],[2,4],[1,3]]
+Output: [[2,4],[1,3],[2,4],[1,3]]
+Explanation: There are 4 nodes in the graph.
+1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
+3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
+
+ +

Example 2:

+ +
+Input: adjList = [[]]
+Output: [[]]
+Explanation: Note that the input contains one empty list. The graph consists of only one node with val = 1 and it does not have any neighbors.
+
+ +

Example 3:

+ +
+Input: adjList = []
+Output: []
+Explanation: This an empty graph, it does not have any nodes.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the graph is in the range [0, 100].
    • +
  • 1 <= Node.val <= 100
    • +
  • Node.val is unique for each node.
    • +
  • There are no repeated edges and no self-loops in the graph.
    • +
  • The Graph is connected and all nodes can be visited starting from the given node.
    • +
+",2.0,False,"/* +// Definition for a Node. +class Node { +public: + int val; + vector neighbors; + Node() { + val = 0; + neighbors = vector(); + } + Node(int _val) { + val = _val; + neighbors = vector(); + } + Node(int _val, vector _neighbors) { + val = _val; + neighbors = _neighbors; + } +}; +*/ + +class Solution { +public: + Node* cloneGraph(Node* node) { + + } +};","/* +// Definition for a Node. +class Node { + public int val; + public List neighbors; + public Node() { + val = 0; + neighbors = new ArrayList(); + } + public Node(int _val) { + val = _val; + neighbors = new ArrayList(); + } + public Node(int _val, ArrayList _neighbors) { + val = _val; + neighbors = _neighbors; + } +} +*/ + +class Solution { + public Node cloneGraph(Node node) { + + } +}",""""""" +# Definition for a Node. +class Node(object): + def __init__(self, val = 0, neighbors = None): + self.val = val + self.neighbors = neighbors if neighbors is not None else [] +"""""" + +class Solution(object): + def cloneGraph(self, node): + """""" + :type node: Node + :rtype: Node + """""" + ",""""""" +# Definition for a Node. +class Node: + def __init__(self, val = 0, neighbors = None): + self.val = val + self.neighbors = neighbors if neighbors is not None else [] +"""""" + +class Solution: + def cloneGraph(self, node: 'Node') -> 'Node': + ","/** + * Definition for a Node. + * struct Node { + * int val; + * int numNeighbors; + * struct Node** neighbors; + * }; + */ + +struct Node *cloneGraph(struct Node *s) { + +}","/* +// Definition for a Node. +public class Node { + public int val; + public IList neighbors; + + public Node() { + val = 0; + neighbors = new List(); + } + + public Node(int _val) { + val = _val; + neighbors = new List(); + } + + public Node(int _val, List _neighbors) { + val = _val; + neighbors = _neighbors; + } +} +*/ + +public class Solution { + public Node CloneGraph(Node node) { + + } +}","/** + * // Definition for a Node. + * function Node(val, neighbors) { + * this.val = val === undefined ? 0 : val; + * this.neighbors = neighbors === undefined ? [] : neighbors; + * }; + */ + +/** + * @param {Node} node + * @return {Node} + */ +var cloneGraph = function(node) { + +};","# Definition for a Node. +# class Node +# attr_accessor :val, :neighbors +# def initialize(val = 0, neighbors = nil) +# @val = val +# neighbors = [] if neighbors.nil? +# @neighbors = neighbors +# end +# end + +# @param {Node} node +# @return {Node} +def cloneGraph(node) + +end","/** + * Definition for a Node. + * public class Node { + * public var val: Int + * public var neighbors: [Node?] + * public init(_ val: Int) { + * self.val = val + * self.neighbors = [] + * } + * } + */ + +class Solution { + func cloneGraph(_ node: Node?) -> Node? { + + } +}","/** + * Definition for a Node. + * type Node struct { + * Val int + * Neighbors []*Node + * } + */ + +func cloneGraph(node *Node) *Node { + +}","/** + * Definition for a Node. + * class Node(var _value: Int) { + * var value: Int = _value + * var neighbors: List[Node] = List() + * } + */ + +object Solution { + def cloneGraph(graph: Node): Node = { + + } +}","/** + * Definition for a Node. + * class Node(var `val`: Int) { + * var neighbors: ArrayList = ArrayList() + * } + */ + +class Solution { + fun cloneGraph(node: Node?): Node? { + + } +}",,"/** + * Definition for a Node. + * class Node { + * public $val = null; + * public $neighbors = null; + * function __construct($val = 0) { + * $this->val = $val; + * $this->neighbors = array(); + * } + * } + */ + +class Solution { + /** + * @param Node $node + * @return Node + */ + function cloneGraph($node) { + + } +}","/** + * Definition for Node. + * class Node { + * val: number + * neighbors: Node[] + * constructor(val?: number, neighbors?: Node[]) { + * this.val = (val===undefined ? 0 : val) + * this.neighbors = (neighbors===undefined ? [] : neighbors) + * } + * } + */ + +function cloneGraph(node: Node | null): Node | null { + +};",,,,, +2003,palindrome-partitioning-ii,Palindrome Partitioning II,132.0,132.0,"

Given a string s, partition s such that every substring of the partition is a palindrome.

+ +

Return the minimum cuts needed for a palindrome partitioning of s.

+ +

 

+

Example 1:

+ +
+Input: s = "aab"
+Output: 1
+Explanation: The palindrome partitioning ["aa","b"] could be produced using 1 cut.
+
+ +

Example 2:

+ +
+Input: s = "a"
+Output: 0
+
+ +

Example 3:

+ +
+Input: s = "ab"
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2000
    • +
  • s consists of lowercase English letters only.
    • +
+",3.0,False,"class Solution { +public: + int minCut(string s) { + + } +};","class Solution { + public int minCut(String s) { + + } +}","class Solution(object): + def minCut(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def minCut(self, s: str) -> int: + ","int minCut(char * s){ + +}","public class Solution { + public int MinCut(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var minCut = function(s) { + +};","# @param {String} s +# @return {Integer} +def min_cut(s) + +end","class Solution { + func minCut(_ s: String) -> Int { + + } +}","func minCut(s string) int { + +}","object Solution { + def minCut(s: String): Int = { + + } +}","class Solution { + fun minCut(s: String): Int { + + } +}","impl Solution { + pub fn min_cut(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function minCut($s) { + + } +}","function minCut(s: string): number { + +};","(define/contract (min-cut s) + (-> string? exact-integer?) + + )","-spec min_cut(S :: unicode:unicode_binary()) -> integer(). +min_cut(S) -> + .","defmodule Solution do + @spec min_cut(s :: String.t) :: integer + def min_cut(s) do + + end +end","class Solution { + int minCut(String s) { + + } +}", +2005,surrounded-regions,Surrounded Regions,130.0,130.0,"

Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'.

+ +

A region is captured by flipping all 'O's into 'X's in that surrounded region.

+ +

 

+

Example 1:

+ +
+Input: board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
+Output: [["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
+Explanation: Notice that an 'O' should not be flipped if:
+- It is on the border, or
+- It is adjacent to an 'O' that should not be flipped.
+The bottom 'O' is on the border, so it is not flipped.
+The other three 'O' form a surrounded region, so they are flipped.
+
+ +

Example 2:

+ +
+Input: board = [["X"]]
+Output: [["X"]]
+
+ +

 

+

Constraints:

+ +
    +
  • m == board.length
    • +
  • n == board[i].length
    • +
  • 1 <= m, n <= 200
    • +
  • board[i][j] is 'X' or 'O'.
    • +
+",2.0,False,"class Solution { +public: + void solve(vector>& board) { + + } +};","class Solution { + public void solve(char[][] board) { + + } +}","class Solution(object): + def solve(self, board): + """""" + :type board: List[List[str]] + :rtype: None Do not return anything, modify board in-place instead. + """""" + ","class Solution: + def solve(self, board: List[List[str]]) -> None: + """""" + Do not return anything, modify board in-place instead. + """""" + ","void solve(char** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public void Solve(char[][] board) { + + } +}","/** + * @param {character[][]} board + * @return {void} Do not return anything, modify board in-place instead. + */ +var solve = function(board) { + +};","# @param {Character[][]} board +# @return {Void} Do not return anything, modify board in-place instead. +def solve(board) + +end","class Solution { + func solve(_ board: inout [[Character]]) { + + } +}","func solve(board [][]byte) { + +}","object Solution { + def solve(board: Array[Array[Char]]): Unit = { + + } +}","class Solution { + fun solve(board: Array): Unit { + + } +}","impl Solution { + pub fn solve(board: &mut Vec>) { + + } +}","class Solution { + + /** + * @param String[][] $board + * @return NULL + */ + function solve(&$board) { + + } +}","/** + Do not return anything, modify board in-place instead. + */ +function solve(board: string[][]): void { + +};","(define/contract (solve board) + (-> (listof (listof char?)) void?) + + )",,,"class Solution { + void solve(List> board) { + + } +}", +2006,sum-root-to-leaf-numbers,Sum Root to Leaf Numbers,129.0,129.0,"

You are given the root of a binary tree containing digits from 0 to 9 only.

+ +

Each root-to-leaf path in the tree represents a number.

+ +
    +
  • For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123.
    • +
+ +

Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.

+ +

A leaf node is a node with no children.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3]
+Output: 25
+Explanation:
+The root-to-leaf path 1->2 represents the number 12.
+The root-to-leaf path 1->3 represents the number 13.
+Therefore, sum = 12 + 13 = 25.
+
+ +

Example 2:

+ +
+Input: root = [4,9,0,5,1]
+Output: 1026
+Explanation:
+The root-to-leaf path 4->9->5 represents the number 495.
+The root-to-leaf path 4->9->1 represents the number 491.
+The root-to-leaf path 4->0 represents the number 40.
+Therefore, sum = 495 + 491 + 40 = 1026.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 1000].
    • +
  • 0 <= Node.val <= 9
    • +
  • The depth of the tree will not exceed 10.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int sumNumbers(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int sumNumbers(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def sumNumbers(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def sumNumbers(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int sumNumbers(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int SumNumbers(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var sumNumbers = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def sum_numbers(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func sumNumbers(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func sumNumbers(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def sumNumbers(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun sumNumbers(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn sum_numbers(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function sumNumbers($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function sumNumbers(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (sum-numbers root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec sum_numbers(Root :: #tree_node{} | null) -> integer(). +sum_numbers(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec sum_numbers(root :: TreeNode.t | nil) :: integer + def sum_numbers(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int sumNumbers(TreeNode? root) { + + } +}", +2007,longest-consecutive-sequence,Longest Consecutive Sequence,128.0,128.0,"

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

+ +

You must write an algorithm that runs in O(n) time.

+ +

 

+

Example 1:

+ +
+Input: nums = [100,4,200,1,3,2]
+Output: 4
+Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
+
+ +

Example 2:

+ +
+Input: nums = [0,3,7,2,5,8,4,6,0,1]
+Output: 9
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= nums.length <= 105
    • +
  • -109 <= nums[i] <= 109
    • +
+",2.0,False,"class Solution { +public: + int longestConsecutive(vector& nums) { + + } +};","class Solution { + public int longestConsecutive(int[] nums) { + + } +}","class Solution(object): + def longestConsecutive(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def longestConsecutive(self, nums: List[int]) -> int: + ","int longestConsecutive(int* nums, int numsSize){ + +}","public class Solution { + public int LongestConsecutive(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var longestConsecutive = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def longest_consecutive(nums) + +end","class Solution { + func longestConsecutive(_ nums: [Int]) -> Int { + + } +}","func longestConsecutive(nums []int) int { + +}","object Solution { + def longestConsecutive(nums: Array[Int]): Int = { + + } +}","class Solution { + fun longestConsecutive(nums: IntArray): Int { + + } +}","impl Solution { + pub fn longest_consecutive(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function longestConsecutive($nums) { + + } +}","function longestConsecutive(nums: number[]): number { + +};","(define/contract (longest-consecutive nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec longest_consecutive(Nums :: [integer()]) -> integer(). +longest_consecutive(Nums) -> + .","defmodule Solution do + @spec longest_consecutive(nums :: [integer]) :: integer + def longest_consecutive(nums) do + + end +end","class Solution { + int longestConsecutive(List nums) { + + } +}", +2008,word-ladder,Word Ladder,127.0,127.0,"

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:

+ +
    +
  • Every adjacent pair of words differs by a single letter.
    • +
  • Every si for 1 <= i <= k is in wordList. Note that beginWord does not need to be in wordList.
    • +
  • sk == endWord
    • +
+ +

Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, or 0 if no such sequence exists.

+ +

 

+

Example 1:

+ +
+Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
+Output: 5
+Explanation: One shortest transformation sequence is "hit" -> "hot" -> "dot" -> "dog" -> cog", which is 5 words long.
+
+ +

Example 2:

+ +
+Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log"]
+Output: 0
+Explanation: The endWord "cog" is not in wordList, therefore there is no valid transformation sequence.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= beginWord.length <= 10
    • +
  • endWord.length == beginWord.length
    • +
  • 1 <= wordList.length <= 5000
    • +
  • wordList[i].length == beginWord.length
    • +
  • beginWord, endWord, and wordList[i] consist of lowercase English letters.
    • +
  • beginWord != endWord
    • +
  • All the words in wordList are unique.
    • +
+",3.0,False,"class Solution { +public: + int ladderLength(string beginWord, string endWord, vector& wordList) { + + } +};","class Solution { + public int ladderLength(String beginWord, String endWord, List wordList) { + + } +}","class Solution(object): + def ladderLength(self, beginWord, endWord, wordList): + """""" + :type beginWord: str + :type endWord: str + :type wordList: List[str] + :rtype: int + """""" + ","class Solution: + def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int: + ","int ladderLength(char * beginWord, char * endWord, char ** wordList, int wordListSize){ + +}","public class Solution { + public int LadderLength(string beginWord, string endWord, IList wordList) { + + } +}","/** + * @param {string} beginWord + * @param {string} endWord + * @param {string[]} wordList + * @return {number} + */ +var ladderLength = function(beginWord, endWord, wordList) { + +};","# @param {String} begin_word +# @param {String} end_word +# @param {String[]} word_list +# @return {Integer} +def ladder_length(begin_word, end_word, word_list) + +end","class Solution { + func ladderLength(_ beginWord: String, _ endWord: String, _ wordList: [String]) -> Int { + + } +}","func ladderLength(beginWord string, endWord string, wordList []string) int { + +}","object Solution { + def ladderLength(beginWord: String, endWord: String, wordList: List[String]): Int = { + + } +}","class Solution { + fun ladderLength(beginWord: String, endWord: String, wordList: List): Int { + + } +}","impl Solution { + pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param String $beginWord + * @param String $endWord + * @param String[] $wordList + * @return Integer + */ + function ladderLength($beginWord, $endWord, $wordList) { + + } +}","function ladderLength(beginWord: string, endWord: string, wordList: string[]): number { + +};","(define/contract (ladder-length beginWord endWord wordList) + (-> string? string? (listof string?) exact-integer?) + + )","-spec ladder_length(BeginWord :: unicode:unicode_binary(), EndWord :: unicode:unicode_binary(), WordList :: [unicode:unicode_binary()]) -> integer(). +ladder_length(BeginWord, EndWord, WordList) -> + .","defmodule Solution do + @spec ladder_length(begin_word :: String.t, end_word :: String.t, word_list :: [String.t]) :: integer + def ladder_length(begin_word, end_word, word_list) do + + end +end","class Solution { + int ladderLength(String beginWord, String endWord, List wordList) { + + } +}", +2009,word-ladder-ii,Word Ladder II,126.0,126.0,"

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:

+ +
    +
  • Every adjacent pair of words differs by a single letter.
    • +
  • Every si for 1 <= i <= k is in wordList. Note that beginWord does not need to be in wordList.
    • +
  • sk == endWord
    • +
+ +

Given two words, beginWord and endWord, and a dictionary wordList, return all the shortest transformation sequences from beginWord to endWord, or an empty list if no such sequence exists. Each sequence should be returned as a list of the words [beginWord, s1, s2, ..., sk].

+ +

 

+

Example 1:

+ +
+Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
+Output: [["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"]]
+Explanation: There are 2 shortest transformation sequences:
+"hit" -> "hot" -> "dot" -> "dog" -> "cog"
+"hit" -> "hot" -> "lot" -> "log" -> "cog"
+
+ +

Example 2:

+ +
+Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log"]
+Output: []
+Explanation: The endWord "cog" is not in wordList, therefore there is no valid transformation sequence.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= beginWord.length <= 5
    • +
  • endWord.length == beginWord.length
    • +
  • 1 <= wordList.length <= 500
    • +
  • wordList[i].length == beginWord.length
    • +
  • beginWord, endWord, and wordList[i] consist of lowercase English letters.
    • +
  • beginWord != endWord
    • +
  • All the words in wordList are unique.
    • +
  • The sum of all shortest transformation sequences does not exceed 105.
    • +
+",3.0,False,"class Solution { +public: + vector> findLadders(string beginWord, string endWord, vector& wordList) { + + } +};","class Solution { + public List> findLadders(String beginWord, String endWord, List wordList) { + + } +}","class Solution(object): + def findLadders(self, beginWord, endWord, wordList): + """""" + :type beginWord: str + :type endWord: str + :type wordList: List[str] + :rtype: List[List[str]] + """""" + ","class Solution: + def findLadders(self, beginWord: str, endWord: str, wordList: List[str]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** findLadders(char * beginWord, char * endWord, char ** wordList, int wordListSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> FindLadders(string beginWord, string endWord, IList wordList) { + + } +}","/** + * @param {string} beginWord + * @param {string} endWord + * @param {string[]} wordList + * @return {string[][]} + */ +var findLadders = function(beginWord, endWord, wordList) { + +};","# @param {String} begin_word +# @param {String} end_word +# @param {String[]} word_list +# @return {String[][]} +def find_ladders(begin_word, end_word, word_list) + +end","class Solution { + func findLadders(_ beginWord: String, _ endWord: String, _ wordList: [String]) -> [[String]] { + + } +}","func findLadders(beginWord string, endWord string, wordList []string) [][]string { + +}","object Solution { + def findLadders(beginWord: String, endWord: String, wordList: List[String]): List[List[String]] = { + + } +}","class Solution { + fun findLadders(beginWord: String, endWord: String, wordList: List): List> { + + } +}","impl Solution { + pub fn find_ladders(begin_word: String, end_word: String, word_list: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param String $beginWord + * @param String $endWord + * @param String[] $wordList + * @return String[][] + */ + function findLadders($beginWord, $endWord, $wordList) { + + } +}","function findLadders(beginWord: string, endWord: string, wordList: string[]): string[][] { + +};","(define/contract (find-ladders beginWord endWord wordList) + (-> string? string? (listof string?) (listof (listof string?))) + + )","-spec find_ladders(BeginWord :: unicode:unicode_binary(), EndWord :: unicode:unicode_binary(), WordList :: [unicode:unicode_binary()]) -> [[unicode:unicode_binary()]]. +find_ladders(BeginWord, EndWord, WordList) -> + .","defmodule Solution do + @spec find_ladders(begin_word :: String.t, end_word :: String.t, word_list :: [String.t]) :: [[String.t]] + def find_ladders(begin_word, end_word, word_list) do + + end +end","class Solution { + List> findLadders(String beginWord, String endWord, List wordList) { + + } +}", +2010,valid-palindrome,Valid Palindrome,125.0,125.0,"

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.

+ +

Given a string s, return true if it is a palindrome, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "A man, a plan, a canal: Panama"
+Output: true
+Explanation: "amanaplanacanalpanama" is a palindrome.
+
+ +

Example 2:

+ +
+Input: s = "race a car"
+Output: false
+Explanation: "raceacar" is not a palindrome.
+
+ +

Example 3:

+ +
+Input: s = " "
+Output: true
+Explanation: s is an empty string "" after removing non-alphanumeric characters.
+Since an empty string reads the same forward and backward, it is a palindrome.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 2 * 105
    • +
  • s consists only of printable ASCII characters.
    • +
+",1.0,False,"class Solution { +public: + bool isPalindrome(string s) { + + } +};","class Solution { + public boolean isPalindrome(String s) { + + } +}","class Solution(object): + def isPalindrome(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def isPalindrome(self, s: str) -> bool: + ","bool isPalindrome(char * s){ + +}","public class Solution { + public bool IsPalindrome(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var isPalindrome = function(s) { + +};","# @param {String} s +# @return {Boolean} +def is_palindrome(s) + +end","class Solution { + func isPalindrome(_ s: String) -> Bool { + + } +}","func isPalindrome(s string) bool { + +}","object Solution { + def isPalindrome(s: String): Boolean = { + + } +}","class Solution { + fun isPalindrome(s: String): Boolean { + + } +}","impl Solution { + pub fn is_palindrome(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function isPalindrome($s) { + + } +}","function isPalindrome(s: string): boolean { + +};","(define/contract (is-palindrome s) + (-> string? boolean?) + + )","-spec is_palindrome(S :: unicode:unicode_binary()) -> boolean(). +is_palindrome(S) -> + .","defmodule Solution do + @spec is_palindrome(s :: String.t) :: boolean + def is_palindrome(s) do + + end +end","class Solution { + bool isPalindrome(String s) { + + } +}", +2011,binary-tree-maximum-path-sum,Binary Tree Maximum Path Sum,124.0,124.0,"

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

+ +

The path sum of a path is the sum of the node's values in the path.

+ +

Given the root of a binary tree, return the maximum path sum of any non-empty path.

+ +

 

+

Example 1:

+ +
+Input: root = [1,2,3]
+Output: 6
+Explanation: The optimal path is 2 -> 1 -> 3 with a path sum of 2 + 1 + 3 = 6.
+
+ +

Example 2:

+ +
+Input: root = [-10,9,20,null,null,15,7]
+Output: 42
+Explanation: The optimal path is 15 -> 20 -> 7 with a path sum of 15 + 20 + 7 = 42.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 3 * 104].
    • +
  • -1000 <= Node.val <= 1000
    • +
+",3.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int maxPathSum(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int maxPathSum(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def maxPathSum(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def maxPathSum(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int maxPathSum(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int MaxPathSum(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var maxPathSum = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def max_path_sum(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func maxPathSum(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func maxPathSum(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def maxPathSum(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun maxPathSum(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn max_path_sum(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function maxPathSum($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function maxPathSum(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (max-path-sum root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec max_path_sum(Root :: #tree_node{} | null) -> integer(). +max_path_sum(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec max_path_sum(root :: TreeNode.t | nil) :: integer + def max_path_sum(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int maxPathSum(TreeNode? root) { + + } +}", +2012,best-time-to-buy-and-sell-stock-iii,Best Time to Buy and Sell Stock III,123.0,123.0,"

You are given an array prices where prices[i] is the price of a given stock on the ith day.

+ +

Find the maximum profit you can achieve. You may complete at most two transactions.

+ +

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

+ +

 

+

Example 1:

+ +
+Input: prices = [3,3,5,0,0,3,1,4]
+Output: 6
+Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
+Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.
+ +

Example 2:

+ +
+Input: prices = [1,2,3,4,5]
+Output: 4
+Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
+Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are engaging multiple transactions at the same time. You must sell before buying again.
+
+ +

Example 3:

+ +
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: In this case, no transaction is done, i.e. max profit = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= prices.length <= 105
    • +
  • 0 <= prices[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int maxProfit(vector& prices) { + + } +};","class Solution { + public int maxProfit(int[] prices) { + + } +}","class Solution(object): + def maxProfit(self, prices): + """""" + :type prices: List[int] + :rtype: int + """""" + ","class Solution: + def maxProfit(self, prices: List[int]) -> int: + ","int maxProfit(int* prices, int pricesSize){ + +}","public class Solution { + public int MaxProfit(int[] prices) { + + } +}","/** + * @param {number[]} prices + * @return {number} + */ +var maxProfit = function(prices) { + +};","# @param {Integer[]} prices +# @return {Integer} +def max_profit(prices) + +end","class Solution { + func maxProfit(_ prices: [Int]) -> Int { + + } +}","func maxProfit(prices []int) int { + +}","object Solution { + def maxProfit(prices: Array[Int]): Int = { + + } +}","class Solution { + fun maxProfit(prices: IntArray): Int { + + } +}","impl Solution { + pub fn max_profit(prices: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $prices + * @return Integer + */ + function maxProfit($prices) { + + } +}","function maxProfit(prices: number[]): number { + +};","(define/contract (max-profit prices) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_profit(Prices :: [integer()]) -> integer(). +max_profit(Prices) -> + .","defmodule Solution do + @spec max_profit(prices :: [integer]) :: integer + def max_profit(prices) do + + end +end","class Solution { + int maxProfit(List prices) { + + } +}", +2013,best-time-to-buy-and-sell-stock-ii,Best Time to Buy and Sell Stock II,122.0,122.0,"

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

+ +

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

+ +

Find and return the maximum profit you can achieve.

+ +

 

+

Example 1:

+ +
+Input: prices = [7,1,5,3,6,4]
+Output: 7
+Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
+Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
+Total profit is 4 + 3 = 7.
+
+ +

Example 2:

+ +
+Input: prices = [1,2,3,4,5]
+Output: 4
+Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
+Total profit is 4.
+
+ +

Example 3:

+ +
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= prices.length <= 3 * 104
    • +
  • 0 <= prices[i] <= 104
    • +
+",2.0,False,"class Solution { +public: + int maxProfit(vector& prices) { + + } +};","class Solution { + public int maxProfit(int[] prices) { + + } +}","class Solution(object): + def maxProfit(self, prices): + """""" + :type prices: List[int] + :rtype: int + """""" + ","class Solution: + def maxProfit(self, prices: List[int]) -> int: + ","int maxProfit(int* prices, int pricesSize){ + +}","public class Solution { + public int MaxProfit(int[] prices) { + + } +}","/** + * @param {number[]} prices + * @return {number} + */ +var maxProfit = function(prices) { + +};","# @param {Integer[]} prices +# @return {Integer} +def max_profit(prices) + +end","class Solution { + func maxProfit(_ prices: [Int]) -> Int { + + } +}","func maxProfit(prices []int) int { + +}","object Solution { + def maxProfit(prices: Array[Int]): Int = { + + } +}","class Solution { + fun maxProfit(prices: IntArray): Int { + + } +}","impl Solution { + pub fn max_profit(prices: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $prices + * @return Integer + */ + function maxProfit($prices) { + + } +}","function maxProfit(prices: number[]): number { + +};","(define/contract (max-profit prices) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_profit(Prices :: [integer()]) -> integer(). +max_profit(Prices) -> + .","defmodule Solution do + @spec max_profit(prices :: [integer]) :: integer + def max_profit(prices) do + + end +end","class Solution { + int maxProfit(List prices) { + + } +}", +2017,pascals-triangle,Pascal's Triangle,118.0,118.0,"

Given an integer numRows, return the first numRows of Pascal's triangle.

+ +

In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:

+ +

 

+

Example 1:

+
Input: numRows = 5
+Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
+

Example 2:

+
Input: numRows = 1
+Output: [[1]]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= numRows <= 30
    • +
+",1.0,False,"class Solution { +public: + vector> generate(int numRows) { + + } +};","class Solution { + public List> generate(int numRows) { + + } +}","class Solution(object): + def generate(self, numRows): + """""" + :type numRows: int + :rtype: List[List[int]] + """""" + ","class Solution: + def generate(self, numRows: int) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** generate(int numRows, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> Generate(int numRows) { + + } +}","/** + * @param {number} numRows + * @return {number[][]} + */ +var generate = function(numRows) { + +};","# @param {Integer} num_rows +# @return {Integer[][]} +def generate(num_rows) + +end","class Solution { + func generate(_ numRows: Int) -> [[Int]] { + + } +}","func generate(numRows int) [][]int { + +}","object Solution { + def generate(numRows: Int): List[List[Int]] = { + + } +}","class Solution { + fun generate(numRows: Int): List> { + + } +}","impl Solution { + pub fn generate(num_rows: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $numRows + * @return Integer[][] + */ + function generate($numRows) { + + } +}","function generate(numRows: number): number[][] { + +};","(define/contract (generate numRows) + (-> exact-integer? (listof (listof exact-integer?))) + + )","-spec generate(NumRows :: integer()) -> [[integer()]]. +generate(NumRows) -> + .","defmodule Solution do + @spec generate(num_rows :: integer) :: [[integer]] + def generate(num_rows) do + + end +end","class Solution { + List> generate(int numRows) { + + } +}", +2020,distinct-subsequences,Distinct Subsequences,115.0,115.0,"

Given two strings s and t, return the number of distinct subsequences of s which equals t.

+ +

The test cases are generated so that the answer fits on a 32-bit signed integer.

+ +

 

+

Example 1:

+ +
+Input: s = "rabbbit", t = "rabbit"
+Output: 3
+Explanation:
+As shown below, there are 3 ways you can generate "rabbit" from s.
+rabbbit
+rabbbit
+rabbbit
+
+ +

Example 2:

+ +
+Input: s = "babgbag", t = "bag"
+Output: 5
+Explanation:
+As shown below, there are 5 ways you can generate "bag" from s.
+babgbag
+babgbag
+babgbag
+babgbag
+babgbag
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length, t.length <= 1000
    • +
  • s and t consist of English letters.
    • +
+",3.0,False,"class Solution { +public: + int numDistinct(string s, string t) { + + } +};","class Solution { + public int numDistinct(String s, String t) { + + } +}","class Solution(object): + def numDistinct(self, s, t): + """""" + :type s: str + :type t: str + :rtype: int + """""" + ","class Solution: + def numDistinct(self, s: str, t: str) -> int: + ","int numDistinct(char * s, char * t){ + +}","public class Solution { + public int NumDistinct(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {number} + */ +var numDistinct = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {Integer} +def num_distinct(s, t) + +end","class Solution { + func numDistinct(_ s: String, _ t: String) -> Int { + + } +}","func numDistinct(s string, t string) int { + +}","object Solution { + def numDistinct(s: String, t: String): Int = { + + } +}","class Solution { + fun numDistinct(s: String, t: String): Int { + + } +}","impl Solution { + pub fn num_distinct(s: String, t: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return Integer + */ + function numDistinct($s, $t) { + + } +}","function numDistinct(s: string, t: string): number { + +};","(define/contract (num-distinct s t) + (-> string? string? exact-integer?) + + )","-spec num_distinct(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> integer(). +num_distinct(S, T) -> + .","defmodule Solution do + @spec num_distinct(s :: String.t, t :: String.t) :: integer + def num_distinct(s, t) do + + end +end","class Solution { + int numDistinct(String s, String t) { + + } +}", +2022,path-sum-ii,Path Sum II,113.0,113.0,"

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.

+ +

A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children.

+ +

 

+

Example 1:

+ +
+Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
+Output: [[5,4,11,2],[5,8,4,5]]
+Explanation: There are two paths whose sum equals targetSum:
+5 + 4 + 11 + 2 = 22
+5 + 8 + 4 + 5 = 22
+
+ +

Example 2:

+ +
+Input: root = [1,2,3], targetSum = 5
+Output: []
+
+ +

Example 3:

+ +
+Input: root = [1,2], targetSum = 0
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 5000].
    • +
  • -1000 <= Node.val <= 1000
    • +
  • -1000 <= targetSum <= 1000
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector> pathSum(TreeNode* root, int targetSum) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List> pathSum(TreeNode root, int targetSum) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def pathSum(self, root, targetSum): + """""" + :type root: TreeNode + :type targetSum: int + :rtype: List[List[int]] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** pathSum(struct TreeNode* root, int targetSum, int* returnSize, int** returnColumnSizes){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList> PathSum(TreeNode root, int targetSum) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @param {number} targetSum + * @return {number[][]} + */ +var pathSum = function(root, targetSum) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @param {Integer} target_sum +# @return {Integer[][]} +def path_sum(root, target_sum) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func pathSum(_ root: TreeNode?, _ targetSum: Int) -> [[Int]] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func pathSum(root *TreeNode, targetSum int) [][]int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def pathSum(root: TreeNode, targetSum: Int): List[List[Int]] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun pathSum(root: TreeNode?, targetSum: Int): List> { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn path_sum(root: Option>>, target_sum: i32) -> Vec> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @param Integer $targetSum + * @return Integer[][] + */ + function pathSum($root, $targetSum) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function pathSum(root: TreeNode | null, targetSum: number): number[][] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (path-sum root targetSum) + (-> (or/c tree-node? #f) exact-integer? (listof (listof exact-integer?))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec path_sum(Root :: #tree_node{} | null, TargetSum :: integer()) -> [[integer()]]. +path_sum(Root, TargetSum) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec path_sum(root :: TreeNode.t | nil, target_sum :: integer) :: [[integer]] + def path_sum(root, target_sum) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List> pathSum(TreeNode? root, int targetSum) { + + } +}", +2024,minimum-depth-of-binary-tree,Minimum Depth of Binary Tree,111.0,111.0,"

Given a binary tree, find its minimum depth.

+ +

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

+ +

Note: A leaf is a node with no children.

+ +

 

+

Example 1:

+ +
+Input: root = [3,9,20,null,null,15,7]
+Output: 2
+
+ +

Example 2:

+ +
+Input: root = [2,null,3,null,4,null,5,null,6]
+Output: 5
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 105].
    • +
  • -1000 <= Node.val <= 1000
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + int minDepth(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public int minDepth(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def minDepth(self, root): + """""" + :type root: TreeNode + :rtype: int + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def minDepth(self, root: Optional[TreeNode]) -> int: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +int minDepth(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public int MinDepth(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number} + */ +var minDepth = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer} +def min_depth(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func minDepth(_ root: TreeNode?) -> Int { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func minDepth(root *TreeNode) int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def minDepth(root: TreeNode): Int = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun minDepth(root: TreeNode?): Int { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn min_depth(root: Option>>) -> i32 { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer + */ + function minDepth($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function minDepth(root: TreeNode | null): number { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (min-depth root) + (-> (or/c tree-node? #f) exact-integer?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec min_depth(Root :: #tree_node{} | null) -> integer(). +min_depth(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec min_depth(root :: TreeNode.t | nil) :: integer + def min_depth(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + int minDepth(TreeNode? root) { + + } +}", +2025,balanced-binary-tree,Balanced Binary Tree,110.0,110.0,"

Given a binary tree, determine if it is height-balanced.

+ +

 

+

Example 1:

+ +
+Input: root = [3,9,20,null,null,15,7]
+Output: true
+
+ +

Example 2:

+ +
+Input: root = [1,2,2,3,3,null,null,4,4]
+Output: false
+
+ +

Example 3:

+ +
+Input: root = []
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 5000].
    • +
  • -104 <= Node.val <= 104
    • +
+",1.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isBalanced(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isBalanced(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isBalanced(self, root): + """""" + :type root: TreeNode + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isBalanced(self, root: Optional[TreeNode]) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isBalanced(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsBalanced(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {boolean} + */ +var isBalanced = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Boolean} +def is_balanced(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isBalanced(_ root: TreeNode?) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isBalanced(root *TreeNode) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isBalanced(root: TreeNode): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isBalanced(root: TreeNode?): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_balanced(root: Option>>) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Boolean + */ + function isBalanced($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isBalanced(root: TreeNode | null): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-balanced root) + (-> (or/c tree-node? #f) boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_balanced(Root :: #tree_node{} | null) -> boolean(). +is_balanced(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_balanced(root :: TreeNode.t | nil) :: boolean + def is_balanced(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isBalanced(TreeNode? root) { + + } +}", +2029,construct-binary-tree-from-inorder-and-postorder-traversal,Construct Binary Tree from Inorder and Postorder Traversal,106.0,106.0,"

Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.

+ +

 

+

Example 1:

+ +
+Input: inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
+Output: [3,9,20,null,null,15,7]
+
+ +

Example 2:

+ +
+Input: inorder = [-1], postorder = [-1]
+Output: [-1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= inorder.length <= 3000
    • +
  • postorder.length == inorder.length
    • +
  • -3000 <= inorder[i], postorder[i] <= 3000
    • +
  • inorder and postorder consist of unique values.
    • +
  • Each value of postorder also appears in inorder.
    • +
  • inorder is guaranteed to be the inorder traversal of the tree.
    • +
  • postorder is guaranteed to be the postorder traversal of the tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* buildTree(vector& inorder, vector& postorder) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode buildTree(int[] inorder, int[] postorder) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def buildTree(self, inorder, postorder): + """""" + :type inorder: List[int] + :type postorder: List[int] + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* buildTree(int* inorder, int inorderSize, int* postorder, int postorderSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode BuildTree(int[] inorder, int[] postorder) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {number[]} inorder + * @param {number[]} postorder + * @return {TreeNode} + */ +var buildTree = function(inorder, postorder) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {Integer[]} inorder +# @param {Integer[]} postorder +# @return {TreeNode} +def build_tree(inorder, postorder) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func buildTree(_ inorder: [Int], _ postorder: [Int]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func buildTree(inorder []int, postorder []int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def buildTree(inorder: Array[Int], postorder: Array[Int]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun buildTree(inorder: IntArray, postorder: IntArray): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param Integer[] $inorder + * @param Integer[] $postorder + * @return TreeNode + */ + function buildTree($inorder, $postorder) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function buildTree(inorder: number[], postorder: number[]): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (build-tree inorder postorder) + (-> (listof exact-integer?) (listof exact-integer?) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec build_tree(Inorder :: [integer()], Postorder :: [integer()]) -> #tree_node{} | null. +build_tree(Inorder, Postorder) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec build_tree(inorder :: [integer], postorder :: [integer]) :: TreeNode.t | nil + def build_tree(inorder, postorder) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? buildTree(List inorder, List postorder) { + + } +}", +2030,construct-binary-tree-from-preorder-and-inorder-traversal,Construct Binary Tree from Preorder and Inorder Traversal,105.0,105.0,"

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

+ +

 

+

Example 1:

+ +
+Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
+Output: [3,9,20,null,null,15,7]
+
+ +

Example 2:

+ +
+Input: preorder = [-1], inorder = [-1]
+Output: [-1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= preorder.length <= 3000
    • +
  • inorder.length == preorder.length
    • +
  • -3000 <= preorder[i], inorder[i] <= 3000
    • +
  • preorder and inorder consist of unique values.
    • +
  • Each value of inorder also appears in preorder.
    • +
  • preorder is guaranteed to be the preorder traversal of the tree.
    • +
  • inorder is guaranteed to be the inorder traversal of the tree.
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + TreeNode* buildTree(vector& preorder, vector& inorder) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public TreeNode buildTree(int[] preorder, int[] inorder) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def buildTree(self, preorder, inorder): + """""" + :type preorder: List[int] + :type inorder: List[int] + :rtype: TreeNode + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +struct TreeNode* buildTree(int* preorder, int preorderSize, int* inorder, int inorderSize){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public TreeNode BuildTree(int[] preorder, int[] inorder) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {number[]} preorder + * @param {number[]} inorder + * @return {TreeNode} + */ +var buildTree = function(preorder, inorder) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {Integer[]} preorder +# @param {Integer[]} inorder +# @return {TreeNode} +def build_tree(preorder, inorder) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func buildTree(_ preorder: [Int], _ inorder: [Int]) -> TreeNode? { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func buildTree(preorder []int, inorder []int) *TreeNode { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def buildTree(preorder: Array[Int], inorder: Array[Int]): TreeNode = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun buildTree(preorder: IntArray, inorder: IntArray): TreeNode? { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param Integer[] $preorder + * @param Integer[] $inorder + * @return TreeNode + */ + function buildTree($preorder, $inorder) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function buildTree(preorder: number[], inorder: number[]): TreeNode | null { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (build-tree preorder inorder) + (-> (listof exact-integer?) (listof exact-integer?) (or/c tree-node? #f)) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec build_tree(Preorder :: [integer()], Inorder :: [integer()]) -> #tree_node{} | null. +build_tree(Preorder, Inorder) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec build_tree(preorder :: [integer], inorder :: [integer]) :: TreeNode.t | nil + def build_tree(preorder, inorder) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + TreeNode? buildTree(List preorder, List inorder) { + + } +}", +2032,binary-tree-zigzag-level-order-traversal,Binary Tree Zigzag Level Order Traversal,103.0,103.0,"

Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

+ +

 

+

Example 1:

+ +
+Input: root = [3,9,20,null,null,15,7]
+Output: [[3],[20,9],[15,7]]
+
+ +

Example 2:

+ +
+Input: root = [1]
+Output: [[1]]
+
+ +

Example 3:

+ +
+Input: root = []
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [0, 2000].
    • +
  • -100 <= Node.val <= 100
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + vector> zigzagLevelOrder(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public List> zigzagLevelOrder(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def zigzagLevelOrder(self, root): + """""" + :type root: TreeNode + :rtype: List[List[int]] + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** zigzagLevelOrder(struct TreeNode* root, int* returnSize, int** returnColumnSizes){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public IList> ZigzagLevelOrder(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {number[][]} + */ +var zigzagLevelOrder = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Integer[][]} +def zigzag_level_order(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func zigzagLevelOrder(_ root: TreeNode?) -> [[Int]] { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func zigzagLevelOrder(root *TreeNode) [][]int { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def zigzagLevelOrder(root: TreeNode): List[List[Int]] = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun zigzagLevelOrder(root: TreeNode?): List> { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn zigzag_level_order(root: Option>>) -> Vec> { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Integer[][] + */ + function zigzagLevelOrder($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function zigzagLevelOrder(root: TreeNode | null): number[][] { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (zigzag-level-order root) + (-> (or/c tree-node? #f) (listof (listof exact-integer?))) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec zigzag_level_order(Root :: #tree_node{} | null) -> [[integer()]]. +zigzag_level_order(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec zigzag_level_order(root :: TreeNode.t | nil) :: [[integer]] + def zigzag_level_order(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + List> zigzagLevelOrder(TreeNode? root) { + + } +}", +2037,validate-binary-search-tree,Validate Binary Search Tree,98.0,98.0,"

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

+ +

A valid BST is defined as follows:

+ +
    +
  • The left subtree of a node contains only nodes with keys less than the node's key.
    • +
  • The right subtree of a node contains only nodes with keys greater than the node's key.
    • +
  • Both the left and right subtrees must also be binary search trees.
    • +
+ +

 

+

Example 1:

+ +
+Input: root = [2,1,3]
+Output: true
+
+ +

Example 2:

+ +
+Input: root = [5,1,4,null,null,3,6]
+Output: false
+Explanation: The root node's value is 5 but its right child's value is 4.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 104].
    • +
  • -231 <= Node.val <= 231 - 1
    • +
+",2.0,False,"/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * TreeNode *left; + * TreeNode *right; + * TreeNode() : val(0), left(nullptr), right(nullptr) {} + * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} + * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} + * }; + */ +class Solution { +public: + bool isValidBST(TreeNode* root) { + + } +};","/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode() {} + * TreeNode(int val) { this.val = val; } + * TreeNode(int val, TreeNode left, TreeNode right) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +class Solution { + public boolean isValidBST(TreeNode root) { + + } +}","# Definition for a binary tree node. +# class TreeNode(object): +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution(object): + def isValidBST(self, root): + """""" + :type root: TreeNode + :rtype: bool + """""" + ","# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, val=0, left=None, right=None): +# self.val = val +# self.left = left +# self.right = right +class Solution: + def isValidBST(self, root: Optional[TreeNode]) -> bool: + ","/** + * Definition for a binary tree node. + * struct TreeNode { + * int val; + * struct TreeNode *left; + * struct TreeNode *right; + * }; + */ +bool isValidBST(struct TreeNode* root){ + +}","/** + * Definition for a binary tree node. + * public class TreeNode { + * public int val; + * public TreeNode left; + * public TreeNode right; + * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { + * this.val = val; + * this.left = left; + * this.right = right; + * } + * } + */ +public class Solution { + public bool IsValidBST(TreeNode root) { + + } +}","/** + * Definition for a binary tree node. + * function TreeNode(val, left, right) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + */ +/** + * @param {TreeNode} root + * @return {boolean} + */ +var isValidBST = function(root) { + +};","# Definition for a binary tree node. +# class TreeNode +# attr_accessor :val, :left, :right +# def initialize(val = 0, left = nil, right = nil) +# @val = val +# @left = left +# @right = right +# end +# end +# @param {TreeNode} root +# @return {Boolean} +def is_valid_bst(root) + +end","/** + * Definition for a binary tree node. + * public class TreeNode { + * public var val: Int + * public var left: TreeNode? + * public var right: TreeNode? + * public init() { self.val = 0; self.left = nil; self.right = nil; } + * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; } + * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) { + * self.val = val + * self.left = left + * self.right = right + * } + * } + */ +class Solution { + func isValidBST(_ root: TreeNode?) -> Bool { + + } +}","/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ +func isValidBST(root *TreeNode) bool { + +}","/** + * Definition for a binary tree node. + * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) { + * var value: Int = _value + * var left: TreeNode = _left + * var right: TreeNode = _right + * } + */ +object Solution { + def isValidBST(root: TreeNode): Boolean = { + + } +}","/** + * Example: + * var ti = TreeNode(5) + * var v = ti.`val` + * Definition for a binary tree node. + * class TreeNode(var `val`: Int) { + * var left: TreeNode? = null + * var right: TreeNode? = null + * } + */ +class Solution { + fun isValidBST(root: TreeNode?): Boolean { + + } +}","// Definition for a binary tree node. +// #[derive(Debug, PartialEq, Eq)] +// pub struct TreeNode { +// pub val: i32, +// pub left: Option>>, +// pub right: Option>>, +// } +// +// impl TreeNode { +// #[inline] +// pub fn new(val: i32) -> Self { +// TreeNode { +// val, +// left: None, +// right: None +// } +// } +// } +use std::rc::Rc; +use std::cell::RefCell; +impl Solution { + pub fn is_valid_bst(root: Option>>) -> bool { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * public $val = null; + * public $left = null; + * public $right = null; + * function __construct($val = 0, $left = null, $right = null) { + * $this->val = $val; + * $this->left = $left; + * $this->right = $right; + * } + * } + */ +class Solution { + + /** + * @param TreeNode $root + * @return Boolean + */ + function isValidBST($root) { + + } +}","/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ + +function isValidBST(root: TreeNode | null): boolean { + +};","; Definition for a binary tree node. +#| + +; val : integer? +; left : (or/c tree-node? #f) +; right : (or/c tree-node? #f) +(struct tree-node + (val left right) #:mutable #:transparent) + +; constructor +(define (make-tree-node [val 0]) + (tree-node val #f #f)) + +|# + +(define/contract (is-valid-bst root) + (-> (or/c tree-node? #f) boolean?) + + )","%% Definition for a binary tree node. +%% +%% -record(tree_node, {val = 0 :: integer(), +%% left = null :: 'null' | #tree_node{}, +%% right = null :: 'null' | #tree_node{}}). + +-spec is_valid_bst(Root :: #tree_node{} | null) -> boolean(). +is_valid_bst(Root) -> + .","# Definition for a binary tree node. +# +# defmodule TreeNode do +# @type t :: %__MODULE__{ +# val: integer, +# left: TreeNode.t() | nil, +# right: TreeNode.t() | nil +# } +# defstruct val: 0, left: nil, right: nil +# end + +defmodule Solution do + @spec is_valid_bst(root :: TreeNode.t | nil) :: boolean + def is_valid_bst(root) do + + end +end","/** + * Definition for a binary tree node. + * class TreeNode { + * int val; + * TreeNode? left; + * TreeNode? right; + * TreeNode([this.val = 0, this.left, this.right]); + * } + */ +class Solution { + bool isValidBST(TreeNode? root) { + + } +}", +2042,restore-ip-addresses,Restore IP Addresses,93.0,93.0,"

A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.

+ +
    +
  • For example, "0.1.2.201" and "192.168.1.1" are valid IP addresses, but "0.011.255.245", "192.168.1.312" and "192.168@1.1" are invalid IP addresses.
    • +
+ +

Given a string s containing only digits, return all possible valid IP addresses that can be formed by inserting dots into s. You are not allowed to reorder or remove any digits in s. You may return the valid IP addresses in any order.

+ +

 

+

Example 1:

+ +
+Input: s = "25525511135"
+Output: ["255.255.11.135","255.255.111.35"]
+
+ +

Example 2:

+ +
+Input: s = "0000"
+Output: ["0.0.0.0"]
+
+ +

Example 3:

+ +
+Input: s = "101023"
+Output: ["1.0.10.23","1.0.102.3","10.1.0.23","10.10.2.3","101.0.2.3"]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 20
    • +
  • s consists of digits only.
    • +
+",2.0,False,"class Solution { +public: + vector restoreIpAddresses(string s) { + + } +};","class Solution { + public List restoreIpAddresses(String s) { + + } +}","class Solution(object): + def restoreIpAddresses(self, s): + """""" + :type s: str + :rtype: List[str] + """""" + ","class Solution: + def restoreIpAddresses(self, s: str) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** restoreIpAddresses(char * s, int* returnSize){ + +}","public class Solution { + public IList RestoreIpAddresses(string s) { + + } +}","/** + * @param {string} s + * @return {string[]} + */ +var restoreIpAddresses = function(s) { + +};","# @param {String} s +# @return {String[]} +def restore_ip_addresses(s) + +end","class Solution { + func restoreIpAddresses(_ s: String) -> [String] { + + } +}","func restoreIpAddresses(s string) []string { + +}","object Solution { + def restoreIpAddresses(s: String): List[String] = { + + } +}","class Solution { + fun restoreIpAddresses(s: String): List { + + } +}","impl Solution { + pub fn restore_ip_addresses(s: String) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @return String[] + */ + function restoreIpAddresses($s) { + + } +}","function restoreIpAddresses(s: string): string[] { + +};","(define/contract (restore-ip-addresses s) + (-> string? (listof string?)) + + )","-spec restore_ip_addresses(S :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. +restore_ip_addresses(S) -> + .","defmodule Solution do + @spec restore_ip_addresses(s :: String.t) :: [String.t] + def restore_ip_addresses(s) do + + end +end","class Solution { + List restoreIpAddresses(String s) { + + } +}", +2048,scramble-string,Scramble String,87.0,87.0,"

We can scramble a string s to get a string t using the following algorithm:

+ +
    +
  1. If the length of the string is 1, stop.
    2. +
  2. If the length of the string is > 1, do the following: +
      +
    • Split the string into two non-empty substrings at a random index, i.e., if the string is s, divide it to x and y where s = x + y.
      • +
    • Randomly decide to swap the two substrings or to keep them in the same order. i.e., after this step, s may become s = x + y or s = y + x.
      • +
    • Apply step 1 recursively on each of the two substrings x and y.
      • +
    +
    3. +
+ +

Given two strings s1 and s2 of the same length, return true if s2 is a scrambled string of s1, otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: s1 = "great", s2 = "rgeat"
+Output: true
+Explanation: One possible scenario applied on s1 is:
+"great" --> "gr/eat" // divide at random index.
+"gr/eat" --> "gr/eat" // random decision is not to swap the two substrings and keep them in order.
+"gr/eat" --> "g/r / e/at" // apply the same algorithm recursively on both substrings. divide at random index each of them.
+"g/r / e/at" --> "r/g / e/at" // random decision was to swap the first substring and to keep the second substring in the same order.
+"r/g / e/at" --> "r/g / e/ a/t" // again apply the algorithm recursively, divide "at" to "a/t".
+"r/g / e/ a/t" --> "r/g / e/ a/t" // random decision is to keep both substrings in the same order.
+The algorithm stops now, and the result string is "rgeat" which is s2.
+As one possible scenario led s1 to be scrambled to s2, we return true.
+
+ +

Example 2:

+ +
+Input: s1 = "abcde", s2 = "caebd"
+Output: false
+
+ +

Example 3:

+ +
+Input: s1 = "a", s2 = "a"
+Output: true
+
+ +

 

+

Constraints:

+ +
    +
  • s1.length == s2.length
    • +
  • 1 <= s1.length <= 30
    • +
  • s1 and s2 consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + bool isScramble(string s1, string s2) { + + } +};","class Solution { + public boolean isScramble(String s1, String s2) { + + } +}","class Solution(object): + def isScramble(self, s1, s2): + """""" + :type s1: str + :type s2: str + :rtype: bool + """""" + ","class Solution: + def isScramble(self, s1: str, s2: str) -> bool: + ","bool isScramble(char * s1, char * s2){ + +}","public class Solution { + public bool IsScramble(string s1, string s2) { + + } +}","/** + * @param {string} s1 + * @param {string} s2 + * @return {boolean} + */ +var isScramble = function(s1, s2) { + +};","# @param {String} s1 +# @param {String} s2 +# @return {Boolean} +def is_scramble(s1, s2) + +end","class Solution { + func isScramble(_ s1: String, _ s2: String) -> Bool { + + } +}","func isScramble(s1 string, s2 string) bool { + +}","object Solution { + def isScramble(s1: String, s2: String): Boolean = { + + } +}","class Solution { + fun isScramble(s1: String, s2: String): Boolean { + + } +}","impl Solution { + pub fn is_scramble(s1: String, s2: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s1 + * @param String $s2 + * @return Boolean + */ + function isScramble($s1, $s2) { + + } +}","function isScramble(s1: string, s2: string): boolean { + +};","(define/contract (is-scramble s1 s2) + (-> string? string? boolean?) + + )","-spec is_scramble(S1 :: unicode:unicode_binary(), S2 :: unicode:unicode_binary()) -> boolean(). +is_scramble(S1, S2) -> + .","defmodule Solution do + @spec is_scramble(s1 :: String.t, s2 :: String.t) :: boolean + def is_scramble(s1, s2) do + + end +end","class Solution { + bool isScramble(String s1, String s2) { + + } +}", +2049,partition-list,Partition List,86.0,86.0,"

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

+ +

You should preserve the original relative order of the nodes in each of the two partitions.

+ +

 

+

Example 1:

+ +
+Input: head = [1,4,3,2,5,2], x = 3
+Output: [1,2,2,4,3,5]
+
+ +

Example 2:

+ +
+Input: head = [2,1], x = 2
+Output: [1,2]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [0, 200].
    • +
  • -100 <= Node.val <= 100
    • +
  • -200 <= x <= 200
    • +
+",2.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* partition(ListNode* head, int x) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode partition(ListNode head, int x) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def partition(self, head, x): + """""" + :type head: ListNode + :type x: int + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def partition(self, head: Optional[ListNode], x: int) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* partition(struct ListNode* head, int x){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode Partition(ListNode head, int x) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @param {number} x + * @return {ListNode} + */ +var partition = function(head, x) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @param {Integer} x +# @return {ListNode} +def partition(head, x) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func partition(_ head: ListNode?, _ x: Int) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func partition(head *ListNode, x int) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def partition(head: ListNode, x: Int): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun partition(head: ListNode?, x: Int): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn partition(head: Option>, x: i32) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @param Integer $x + * @return ListNode + */ + function partition($head, $x) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function partition(head: ListNode | null, x: number): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (partition head x) + (-> (or/c list-node? #f) exact-integer? (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec partition(Head :: #list_node{} | null, X :: integer()) -> #list_node{} | null. +partition(Head, X) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec partition(head :: ListNode.t | nil, x :: integer) :: ListNode.t | nil + def partition(head, x) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? partition(ListNode? head, int x) { + + } +}", +2050,maximal-rectangle,Maximal Rectangle,85.0,85.0,"

Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

+ +

 

+

Example 1:

+ +
+Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
+Output: 6
+Explanation: The maximal rectangle is shown in the above picture.
+
+ +

Example 2:

+ +
+Input: matrix = [["0"]]
+Output: 0
+
+ +

Example 3:

+ +
+Input: matrix = [["1"]]
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • rows == matrix.length
    • +
  • cols == matrix[i].length
    • +
  • 1 <= row, cols <= 200
    • +
  • matrix[i][j] is '0' or '1'.
    • +
+",3.0,False,"class Solution { +public: + int maximalRectangle(vector>& matrix) { + + } +};","class Solution { + public int maximalRectangle(char[][] matrix) { + + } +}","class Solution(object): + def maximalRectangle(self, matrix): + """""" + :type matrix: List[List[str]] + :rtype: int + """""" + ","class Solution: + def maximalRectangle(self, matrix: List[List[str]]) -> int: + ","int maximalRectangle(char** matrix, int matrixSize, int* matrixColSize){ + +}","public class Solution { + public int MaximalRectangle(char[][] matrix) { + + } +}","/** + * @param {character[][]} matrix + * @return {number} + */ +var maximalRectangle = function(matrix) { + +};","# @param {Character[][]} matrix +# @return {Integer} +def maximal_rectangle(matrix) + +end","class Solution { + func maximalRectangle(_ matrix: [[Character]]) -> Int { + + } +}","func maximalRectangle(matrix [][]byte) int { + +}","object Solution { + def maximalRectangle(matrix: Array[Array[Char]]): Int = { + + } +}","class Solution { + fun maximalRectangle(matrix: Array): Int { + + } +}","impl Solution { + pub fn maximal_rectangle(matrix: Vec>) -> i32 { + + } +}","class Solution { + + /** + * @param String[][] $matrix + * @return Integer + */ + function maximalRectangle($matrix) { + + } +}","function maximalRectangle(matrix: string[][]): number { + +};","(define/contract (maximal-rectangle matrix) + (-> (listof (listof char?)) exact-integer?) + + )","-spec maximal_rectangle(Matrix :: [[char()]]) -> integer(). +maximal_rectangle(Matrix) -> + .","defmodule Solution do + @spec maximal_rectangle(matrix :: [[char]]) :: integer + def maximal_rectangle(matrix) do + + end +end","class Solution { + int maximalRectangle(List> matrix) { + + } +}", +2051,largest-rectangle-in-histogram,Largest Rectangle in Histogram,84.0,84.0,"

Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.

+ +

 

+

Example 1:

+ +
+Input: heights = [2,1,5,6,2,3]
+Output: 10
+Explanation: The above is a histogram where width of each bar is 1.
+The largest rectangle is shown in the red area, which has an area = 10 units.
+
+ +

Example 2:

+ +
+Input: heights = [2,4]
+Output: 4
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= heights.length <= 105
    • +
  • 0 <= heights[i] <= 104
    • +
+",3.0,False,"class Solution { +public: + int largestRectangleArea(vector& heights) { + + } +};","class Solution { + public int largestRectangleArea(int[] heights) { + + } +}","class Solution(object): + def largestRectangleArea(self, heights): + """""" + :type heights: List[int] + :rtype: int + """""" + ","class Solution: + def largestRectangleArea(self, heights: List[int]) -> int: + ","int largestRectangleArea(int* heights, int heightsSize){ + +}","public class Solution { + public int LargestRectangleArea(int[] heights) { + + } +}","/** + * @param {number[]} heights + * @return {number} + */ +var largestRectangleArea = function(heights) { + +};","# @param {Integer[]} heights +# @return {Integer} +def largest_rectangle_area(heights) + +end","class Solution { + func largestRectangleArea(_ heights: [Int]) -> Int { + + } +}","func largestRectangleArea(heights []int) int { + +}","object Solution { + def largestRectangleArea(heights: Array[Int]): Int = { + + } +}","class Solution { + fun largestRectangleArea(heights: IntArray): Int { + + } +}","impl Solution { + pub fn largest_rectangle_area(heights: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $heights + * @return Integer + */ + function largestRectangleArea($heights) { + + } +}","function largestRectangleArea(heights: number[]): number { + +};","(define/contract (largest-rectangle-area heights) + (-> (listof exact-integer?) exact-integer?) + + )","-spec largest_rectangle_area(Heights :: [integer()]) -> integer(). +largest_rectangle_area(Heights) -> + .","defmodule Solution do + @spec largest_rectangle_area(heights :: [integer]) :: integer + def largest_rectangle_area(heights) do + + end +end","class Solution { + int largestRectangleArea(List heights) { + + } +}", +2059,minimum-window-substring,Minimum Window Substring,76.0,76.0,"

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

+ +

The testcases will be generated such that the answer is unique.

+ +

 

+

Example 1:

+ +
+Input: s = "ADOBECODEBANC", t = "ABC"
+Output: "BANC"
+Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.
+
+ +

Example 2:

+ +
+Input: s = "a", t = "a"
+Output: "a"
+Explanation: The entire string s is the minimum window.
+
+ +

Example 3:

+ +
+Input: s = "a", t = "aa"
+Output: ""
+Explanation: Both 'a's from t must be included in the window.
+Since the largest window of s only has one 'a', return empty string.
+
+ +

 

+

Constraints:

+ +
    +
  • m == s.length
    • +
  • n == t.length
    • +
  • 1 <= m, n <= 105
    • +
  • s and t consist of uppercase and lowercase English letters.
    • +
+ +

 

+

Follow up: Could you find an algorithm that runs in O(m + n) time?

+",3.0,False,"class Solution { +public: + string minWindow(string s, string t) { + + } +};","class Solution { + public String minWindow(String s, String t) { + + } +}","class Solution(object): + def minWindow(self, s, t): + """""" + :type s: str + :type t: str + :rtype: str + """""" + ","class Solution: + def minWindow(self, s: str, t: str) -> str: + ","char * minWindow(char * s, char * t){ + +}","public class Solution { + public string MinWindow(string s, string t) { + + } +}","/** + * @param {string} s + * @param {string} t + * @return {string} + */ +var minWindow = function(s, t) { + +};","# @param {String} s +# @param {String} t +# @return {String} +def min_window(s, t) + +end","class Solution { + func minWindow(_ s: String, _ t: String) -> String { + + } +}","func minWindow(s string, t string) string { + +}","object Solution { + def minWindow(s: String, t: String): String = { + + } +}","class Solution { + fun minWindow(s: String, t: String): String { + + } +}","impl Solution { + pub fn min_window(s: String, t: String) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param String $t + * @return String + */ + function minWindow($s, $t) { + + } +}","function minWindow(s: string, t: string): string { + +};","(define/contract (min-window s t) + (-> string? string? string?) + + )","-spec min_window(S :: unicode:unicode_binary(), T :: unicode:unicode_binary()) -> unicode:unicode_binary(). +min_window(S, T) -> + .","defmodule Solution do + @spec min_window(s :: String.t, t :: String.t) :: String.t + def min_window(s, t) do + + end +end","class Solution { + String minWindow(String s, String t) { + + } +}", +2060,sort-colors,Sort Colors,75.0,75.0,"

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.

+ +

We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.

+ +

You must solve this problem without using the library's sort function.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,0,2,1,1,0]
+Output: [0,0,1,1,2,2]
+
+ +

Example 2:

+ +
+Input: nums = [2,0,1]
+Output: [0,1,2]
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
    • +
  • 1 <= n <= 300
    • +
  • nums[i] is either 0, 1, or 2.
    • +
+ +

 

+

Follow up: Could you come up with a one-pass algorithm using only constant extra space?

+",2.0,False,"class Solution { +public: + void sortColors(vector& nums) { + + } +};","class Solution { + public void sortColors(int[] nums) { + + } +}","class Solution(object): + def sortColors(self, nums): + """""" + :type nums: List[int] + :rtype: None Do not return anything, modify nums in-place instead. + """""" + ","class Solution: + def sortColors(self, nums: List[int]) -> None: + """""" + Do not return anything, modify nums in-place instead. + """""" + ","void sortColors(int* nums, int numsSize){ + +}","public class Solution { + public void SortColors(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {void} Do not return anything, modify nums in-place instead. + */ +var sortColors = function(nums) { + +};","# @param {Integer[]} nums +# @return {Void} Do not return anything, modify nums in-place instead. +def sort_colors(nums) + +end","class Solution { + func sortColors(_ nums: inout [Int]) { + + } +}","func sortColors(nums []int) { + +}","object Solution { + def sortColors(nums: Array[Int]): Unit = { + + } +}","class Solution { + fun sortColors(nums: IntArray): Unit { + + } +}","impl Solution { + pub fn sort_colors(nums: &mut Vec) { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return NULL + */ + function sortColors(&$nums) { + + } +}","/** + Do not return anything, modify nums in-place instead. + */ +function sortColors(nums: number[]): void { + +};",,,,"class Solution { + void sortColors(List nums) { + + } +}", +2063,edit-distance,Edit Distance,72.0,72.0,"

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

+ +

You have the following three operations permitted on a word:

+ +
    +
  • Insert a character
    • +
  • Delete a character
    • +
  • Replace a character
    • +
+ +

 

+

Example 1:

+ +
+Input: word1 = "horse", word2 = "ros"
+Output: 3
+Explanation: 
+horse -> rorse (replace 'h' with 'r')
+rorse -> rose (remove 'r')
+rose -> ros (remove 'e')
+
+ +

Example 2:

+ +
+Input: word1 = "intention", word2 = "execution"
+Output: 5
+Explanation: 
+intention -> inention (remove 't')
+inention -> enention (replace 'i' with 'e')
+enention -> exention (replace 'n' with 'x')
+exention -> exection (replace 'n' with 'c')
+exection -> execution (insert 'u')
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= word1.length, word2.length <= 500
    • +
  • word1 and word2 consist of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + int minDistance(string word1, string word2) { + + } +};","class Solution { + public int minDistance(String word1, String word2) { + + } +}","class Solution(object): + def minDistance(self, word1, word2): + """""" + :type word1: str + :type word2: str + :rtype: int + """""" + ","class Solution: + def minDistance(self, word1: str, word2: str) -> int: + ","int minDistance(char * word1, char * word2){ + +}","public class Solution { + public int MinDistance(string word1, string word2) { + + } +}","/** + * @param {string} word1 + * @param {string} word2 + * @return {number} + */ +var minDistance = function(word1, word2) { + +};","# @param {String} word1 +# @param {String} word2 +# @return {Integer} +def min_distance(word1, word2) + +end","class Solution { + func minDistance(_ word1: String, _ word2: String) -> Int { + + } +}","func minDistance(word1 string, word2 string) int { + +}","object Solution { + def minDistance(word1: String, word2: String): Int = { + + } +}","class Solution { + fun minDistance(word1: String, word2: String): Int { + + } +}","impl Solution { + pub fn min_distance(word1: String, word2: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $word1 + * @param String $word2 + * @return Integer + */ + function minDistance($word1, $word2) { + + } +}","function minDistance(word1: string, word2: string): number { + +};","(define/contract (min-distance word1 word2) + (-> string? string? exact-integer?) + + )","-spec min_distance(Word1 :: unicode:unicode_binary(), Word2 :: unicode:unicode_binary()) -> integer(). +min_distance(Word1, Word2) -> + .","defmodule Solution do + @spec min_distance(word1 :: String.t, word2 :: String.t) :: integer + def min_distance(word1, word2) do + + end +end","class Solution { + int minDistance(String word1, String word2) { + + } +}", +2064,simplify-path,Simplify Path,71.0,71.0,"

Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

+ +

In a Unix-style file system, a period '.' refers to the current directory, a double period '..' refers to the directory up a level, and any multiple consecutive slashes (i.e. '//') are treated as a single slash '/'. For this problem, any other format of periods such as '...' are treated as file/directory names.

+ +

The canonical path should have the following format:

+ +
    +
  • The path starts with a single slash '/'.
    • +
  • Any two directories are separated by a single slash '/'.
    • +
  • The path does not end with a trailing '/'.
    • +
  • The path only contains the directories on the path from the root directory to the target file or directory (i.e., no period '.' or double period '..')
    • +
+ +

Return the simplified canonical path.

+ +

 

+

Example 1:

+ +
+Input: path = "/home/"
+Output: "/home"
+Explanation: Note that there is no trailing slash after the last directory name.
+
+ +

Example 2:

+ +
+Input: path = "/../"
+Output: "/"
+Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.
+
+ +

Example 3:

+ +
+Input: path = "/home//foo/"
+Output: "/home/foo"
+Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= path.length <= 3000
    • +
  • path consists of English letters, digits, period '.', slash '/' or '_'.
    • +
  • path is a valid absolute Unix path.
    • +
+",2.0,False,"class Solution { +public: + string simplifyPath(string path) { + + } +};","class Solution { + public String simplifyPath(String path) { + + } +}","class Solution(object): + def simplifyPath(self, path): + """""" + :type path: str + :rtype: str + """""" + ","class Solution: + def simplifyPath(self, path: str) -> str: + ","char * simplifyPath(char * path){ + +}","public class Solution { + public string SimplifyPath(string path) { + + } +}","/** + * @param {string} path + * @return {string} + */ +var simplifyPath = function(path) { + +};","# @param {String} path +# @return {String} +def simplify_path(path) + +end","class Solution { + func simplifyPath(_ path: String) -> String { + + } +}","func simplifyPath(path string) string { + +}","object Solution { + def simplifyPath(path: String): String = { + + } +}","class Solution { + fun simplifyPath(path: String): String { + + } +}","impl Solution { + pub fn simplify_path(path: String) -> String { + + } +}","class Solution { + + /** + * @param String $path + * @return String + */ + function simplifyPath($path) { + + } +}","function simplifyPath(path: string): string { + +};","(define/contract (simplify-path path) + (-> string? string?) + + )","-spec simplify_path(Path :: unicode:unicode_binary()) -> unicode:unicode_binary(). +simplify_path(Path) -> + .","defmodule Solution do + @spec simplify_path(path :: String.t) :: String.t + def simplify_path(path) do + + end +end","class Solution { + String simplifyPath(String path) { + + } +}", +2067,text-justification,Text Justification,68.0,68.0,"

Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.

+ +

You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ' ' when necessary so that each line has exactly maxWidth characters.

+ +

Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line does not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.

+ +

For the last line of text, it should be left-justified, and no extra space is inserted between words.

+ +

Note:

+ +
    +
  • A word is defined as a character sequence consisting of non-space characters only.
    • +
  • Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
    • +
  • The input array words contains at least one word.
    • +
+ +

 

+

Example 1:

+ +
+Input: words = ["This", "is", "an", "example", "of", "text", "justification."], maxWidth = 16
+Output:
+[
+   "This    is    an",
+   "example  of text",
+   "justification.  "
+]
+ +

Example 2:

+ +
+Input: words = ["What","must","be","acknowledgment","shall","be"], maxWidth = 16
+Output:
+[
+  "What   must   be",
+  "acknowledgment  ",
+  "shall be        "
+]
+Explanation: Note that the last line is "shall be    " instead of "shall     be", because the last line must be left-justified instead of fully-justified.
+Note that the second line is also left-justified because it contains only one word.
+ +

Example 3:

+ +
+Input: words = ["Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"], maxWidth = 20
+Output:
+[
+  "Science  is  what we",
+  "understand      well",
+  "enough to explain to",
+  "a  computer.  Art is",
+  "everything  else  we",
+  "do                  "
+]
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 300
    • +
  • 1 <= words[i].length <= 20
    • +
  • words[i] consists of only English letters and symbols.
    • +
  • 1 <= maxWidth <= 100
    • +
  • words[i].length <= maxWidth
    • +
+",3.0,False,"class Solution { +public: + vector fullJustify(vector& words, int maxWidth) { + + } +};","class Solution { + public List fullJustify(String[] words, int maxWidth) { + + } +}","class Solution(object): + def fullJustify(self, words, maxWidth): + """""" + :type words: List[str] + :type maxWidth: int + :rtype: List[str] + """""" + ","class Solution: + def fullJustify(self, words: List[str], maxWidth: int) -> List[str]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +char ** fullJustify(char ** words, int wordsSize, int maxWidth, int* returnSize){ + +}","public class Solution { + public IList FullJustify(string[] words, int maxWidth) { + + } +}","/** + * @param {string[]} words + * @param {number} maxWidth + * @return {string[]} + */ +var fullJustify = function(words, maxWidth) { + +};","# @param {String[]} words +# @param {Integer} max_width +# @return {String[]} +def full_justify(words, max_width) + +end","class Solution { + func fullJustify(_ words: [String], _ maxWidth: Int) -> [String] { + + } +}","func fullJustify(words []string, maxWidth int) []string { + +}","object Solution { + def fullJustify(words: Array[String], maxWidth: Int): List[String] = { + + } +}","class Solution { + fun fullJustify(words: Array, maxWidth: Int): List { + + } +}","impl Solution { + pub fn full_justify(words: Vec, max_width: i32) -> Vec { + + } +}","class Solution { + + /** + * @param String[] $words + * @param Integer $maxWidth + * @return String[] + */ + function fullJustify($words, $maxWidth) { + + } +}","function fullJustify(words: string[], maxWidth: number): string[] { + +};","(define/contract (full-justify words maxWidth) + (-> (listof string?) exact-integer? (listof string?)) + + )","-spec full_justify(Words :: [unicode:unicode_binary()], MaxWidth :: integer()) -> [unicode:unicode_binary()]. +full_justify(Words, MaxWidth) -> + .","defmodule Solution do + @spec full_justify(words :: [String.t], max_width :: integer) :: [String.t] + def full_justify(words, max_width) do + + end +end","class Solution { + List fullJustify(List words, int maxWidth) { + + } +}", +2070,valid-number,Valid Number,65.0,65.0,"

A valid number can be split up into these components (in order):

+ +
    +
  1. A decimal number or an integer.
    2. +
  2. (Optional) An 'e' or 'E', followed by an integer.
    3. +
+ +

A decimal number can be split up into these components (in order):

+ +
    +
  1. (Optional) A sign character (either '+' or '-').
    2. +
  2. One of the following formats: +
      +
    1. One or more digits, followed by a dot '.'.
      2. +
    2. One or more digits, followed by a dot '.', followed by one or more digits.
      3. +
    3. A dot '.', followed by one or more digits.
      4. +
    +
    3. +
+ +

An integer can be split up into these components (in order):

+ +
    +
  1. (Optional) A sign character (either '+' or '-').
    2. +
  2. One or more digits.
    3. +
+ +

For example, all the following are valid numbers: ["2", "0089", "-0.1", "+3.14", "4.", "-.9", "2e10", "-90E3", "3e+7", "+6e-1", "53.5e93", "-123.456e789"], while the following are not valid numbers: ["abc", "1a", "1e", "e3", "99e2.5", "--6", "-+3", "95a54e53"].

+ +

Given a string s, return true if s is a valid number.

+ +

 

+

Example 1:

+ +
+Input: s = "0"
+Output: true
+
+ +

Example 2:

+ +
+Input: s = "e"
+Output: false
+
+ +

Example 3:

+ +
+Input: s = "."
+Output: false
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 20
    • +
  • s consists of only English letters (both uppercase and lowercase), digits (0-9), plus '+', minus '-', or dot '.'.
    • +
+",3.0,False,"class Solution { +public: + bool isNumber(string s) { + + } +};","class Solution { + public boolean isNumber(String s) { + + } +}","class Solution(object): + def isNumber(self, s): + """""" + :type s: str + :rtype: bool + """""" + ","class Solution: + def isNumber(self, s: str) -> bool: + ","bool isNumber(char * s){ + +}","public class Solution { + public bool IsNumber(string s) { + + } +}","/** + * @param {string} s + * @return {boolean} + */ +var isNumber = function(s) { + +};","# @param {String} s +# @return {Boolean} +def is_number(s) + +end","class Solution { + func isNumber(_ s: String) -> Bool { + + } +}","func isNumber(s string) bool { + +}","object Solution { + def isNumber(s: String): Boolean = { + + } +}","class Solution { + fun isNumber(s: String): Boolean { + + } +}","impl Solution { + pub fn is_number(s: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @return Boolean + */ + function isNumber($s) { + + } +}","function isNumber(s: string): boolean { + +};","(define/contract (is-number s) + (-> string? boolean?) + + )","-spec is_number(S :: unicode:unicode_binary()) -> boolean(). +is_number(S) -> + .","defmodule Solution do + @spec is_number(s :: String.t) :: boolean + def is_number(s) do + + end +end","class Solution { + bool isNumber(String s) { + + } +}", +2075,permutation-sequence,Permutation Sequence,60.0,60.0,"

The set [1, 2, 3, ..., n] contains a total of n! unique permutations.

+ +

By listing and labeling all of the permutations in order, we get the following sequence for n = 3:

+ +
    +
  1. "123"
    2. +
  2. "132"
    3. +
  3. "213"
    4. +
  4. "231"
    5. +
  5. "312"
    6. +
  6. "321"
    7. +
+ +

Given n and k, return the kth permutation sequence.

+ +

 

+

Example 1:

+
Input: n = 3, k = 3
+Output: ""213""
+

Example 2:

+
Input: n = 4, k = 9
+Output: ""2314""
+

Example 3:

+
Input: n = 3, k = 1
+Output: ""123""
+
+

 

+

Constraints:

+ +
    +
  • 1 <= n <= 9
    • +
  • 1 <= k <= n!
    • +
+",3.0,False,"class Solution { +public: + string getPermutation(int n, int k) { + + } +};","class Solution { + public String getPermutation(int n, int k) { + + } +}","class Solution(object): + def getPermutation(self, n, k): + """""" + :type n: int + :type k: int + :rtype: str + """""" + ","class Solution: + def getPermutation(self, n: int, k: int) -> str: + ","char * getPermutation(int n, int k){ + +}","public class Solution { + public string GetPermutation(int n, int k) { + + } +}","/** + * @param {number} n + * @param {number} k + * @return {string} + */ +var getPermutation = function(n, k) { + +};","# @param {Integer} n +# @param {Integer} k +# @return {String} +def get_permutation(n, k) + +end","class Solution { + func getPermutation(_ n: Int, _ k: Int) -> String { + + } +}","func getPermutation(n int, k int) string { + +}","object Solution { + def getPermutation(n: Int, k: Int): String = { + + } +}","class Solution { + fun getPermutation(n: Int, k: Int): String { + + } +}","impl Solution { + pub fn get_permutation(n: i32, k: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $n + * @param Integer $k + * @return String + */ + function getPermutation($n, $k) { + + } +}","function getPermutation(n: number, k: number): string { + +};","(define/contract (get-permutation n k) + (-> exact-integer? exact-integer? string?) + + )","-spec get_permutation(N :: integer(), K :: integer()) -> unicode:unicode_binary(). +get_permutation(N, K) -> + .","defmodule Solution do + @spec get_permutation(n :: integer, k :: integer) :: String.t + def get_permutation(n, k) do + + end +end","class Solution { + String getPermutation(int n, int k) { + + } +}", +2078,insert-interval,Insert Interval,57.0,57.0,"

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

+ +

Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).

+ +

Return intervals after the insertion.

+ +

 

+

Example 1:

+ +
+Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
+Output: [[1,5],[6,9]]
+
+ +

Example 2:

+ +
+Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
+Output: [[1,2],[3,10],[12,16]]
+Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= intervals.length <= 104
    • +
  • intervals[i].length == 2
    • +
  • 0 <= starti <= endi <= 105
    • +
  • intervals is sorted by starti in ascending order.
    • +
  • newInterval.length == 2
    • +
  • 0 <= start <= end <= 105
    • +
+",2.0,False,"class Solution { +public: + vector> insert(vector>& intervals, vector& newInterval) { + + } +};","class Solution { + public int[][] insert(int[][] intervals, int[] newInterval) { + + } +}","class Solution(object): + def insert(self, intervals, newInterval): + """""" + :type intervals: List[List[int]] + :type newInterval: List[int] + :rtype: List[List[int]] + """""" + ","class Solution: + def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** insert(int** intervals, int intervalsSize, int* intervalsColSize, int* newInterval, int newIntervalSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public int[][] Insert(int[][] intervals, int[] newInterval) { + + } +}","/** + * @param {number[][]} intervals + * @param {number[]} newInterval + * @return {number[][]} + */ +var insert = function(intervals, newInterval) { + +};","# @param {Integer[][]} intervals +# @param {Integer[]} new_interval +# @return {Integer[][]} +def insert(intervals, new_interval) + +end","class Solution { + func insert(_ intervals: [[Int]], _ newInterval: [Int]) -> [[Int]] { + + } +}","func insert(intervals [][]int, newInterval []int) [][]int { + +}","object Solution { + def insert(intervals: Array[Array[Int]], newInterval: Array[Int]): Array[Array[Int]] = { + + } +}","class Solution { + fun insert(intervals: Array, newInterval: IntArray): Array { + + } +}","impl Solution { + pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[][] $intervals + * @param Integer[] $newInterval + * @return Integer[][] + */ + function insert($intervals, $newInterval) { + + } +}","function insert(intervals: number[][], newInterval: number[]): number[][] { + +};","(define/contract (insert intervals newInterval) + (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof (listof exact-integer?))) + + )","-spec insert(Intervals :: [[integer()]], NewInterval :: [integer()]) -> [[integer()]]. +insert(Intervals, NewInterval) -> + .","defmodule Solution do + @spec insert(intervals :: [[integer]], new_interval :: [integer]) :: [[integer]] + def insert(intervals, new_interval) do + + end +end","class Solution { + List> insert(List> intervals, List newInterval) { + + } +}", +2081,spiral-matrix,Spiral Matrix,54.0,54.0,"

Given an m x n matrix, return all elements of the matrix in spiral order.

+ +

 

+

Example 1:

+ +
+Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [1,2,3,6,9,8,7,4,5]
+
+ +

Example 2:

+ +
+Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
+Output: [1,2,3,4,8,12,11,10,9,5,6,7]
+
+ +

 

+

Constraints:

+ +
    +
  • m == matrix.length
    • +
  • n == matrix[i].length
    • +
  • 1 <= m, n <= 10
    • +
  • -100 <= matrix[i][j] <= 100
    • +
+",2.0,False,"class Solution { +public: + vector spiralOrder(vector>& matrix) { + + } +};","class Solution { + public List spiralOrder(int[][] matrix) { + + } +}","class Solution(object): + def spiralOrder(self, matrix): + """""" + :type matrix: List[List[int]] + :rtype: List[int] + """""" + ","class Solution: + def spiralOrder(self, matrix: List[List[int]]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* spiralOrder(int** matrix, int matrixSize, int* matrixColSize, int* returnSize){ + +}","public class Solution { + public IList SpiralOrder(int[][] matrix) { + + } +}","/** + * @param {number[][]} matrix + * @return {number[]} + */ +var spiralOrder = function(matrix) { + +};","# @param {Integer[][]} matrix +# @return {Integer[]} +def spiral_order(matrix) + +end","class Solution { + func spiralOrder(_ matrix: [[Int]]) -> [Int] { + + } +}","func spiralOrder(matrix [][]int) []int { + +}","object Solution { + def spiralOrder(matrix: Array[Array[Int]]): List[Int] = { + + } +}","class Solution { + fun spiralOrder(matrix: Array): List { + + } +}","impl Solution { + pub fn spiral_order(matrix: Vec>) -> Vec { + + } +}","class Solution { + + /** + * @param Integer[][] $matrix + * @return Integer[] + */ + function spiralOrder($matrix) { + + } +}","function spiralOrder(matrix: number[][]): number[] { + +};","(define/contract (spiral-order matrix) + (-> (listof (listof exact-integer?)) (listof exact-integer?)) + + )","-spec spiral_order(Matrix :: [[integer()]]) -> [integer()]. +spiral_order(Matrix) -> + .","defmodule Solution do + @spec spiral_order(matrix :: [[integer]]) :: [integer] + def spiral_order(matrix) do + + end +end","class Solution { + List spiralOrder(List> matrix) { + + } +}", +2082,maximum-subarray,Maximum Subarray,53.0,53.0,"

Given an integer array nums, find the subarray with the largest sum, and return its sum.

+ +

 

+

Example 1:

+ +
+Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
+Output: 6
+Explanation: The subarray [4,-1,2,1] has the largest sum 6.
+
+ +

Example 2:

+ +
+Input: nums = [1]
+Output: 1
+Explanation: The subarray [1] has the largest sum 1.
+
+ +

Example 3:

+ +
+Input: nums = [5,4,-1,7,8]
+Output: 23
+Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -104 <= nums[i] <= 104
    • +
+ +

 

+

Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

+",2.0,False,"class Solution { +public: + int maxSubArray(vector& nums) { + + } +};","class Solution { + public int maxSubArray(int[] nums) { + + } +}","class Solution(object): + def maxSubArray(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def maxSubArray(self, nums: List[int]) -> int: + ","int maxSubArray(int* nums, int numsSize){ + +}","public class Solution { + public int MaxSubArray(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var maxSubArray = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def max_sub_array(nums) + +end","class Solution { + func maxSubArray(_ nums: [Int]) -> Int { + + } +}","func maxSubArray(nums []int) int { + +}","object Solution { + def maxSubArray(nums: Array[Int]): Int = { + + } +}","class Solution { + fun maxSubArray(nums: IntArray): Int { + + } +}","impl Solution { + pub fn max_sub_array(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function maxSubArray($nums) { + + } +}","function maxSubArray(nums: number[]): number { + +};","(define/contract (max-sub-array nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec max_sub_array(Nums :: [integer()]) -> integer(). +max_sub_array(Nums) -> + .","defmodule Solution do + @spec max_sub_array(nums :: [integer]) :: integer + def max_sub_array(nums) do + + end +end","class Solution { + int maxSubArray(List nums) { + + } +}", +2083,n-queens-ii,N-Queens II,52.0,52.0,"

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

+ +

Given an integer n, return the number of distinct solutions to the n-queens puzzle.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 2
+Explanation: There are two distinct solutions to the 4-queens puzzle as shown.
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: 1
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 9
    • +
+",3.0,False,"class Solution { +public: + int totalNQueens(int n) { + + } +};","class Solution { + public int totalNQueens(int n) { + + } +}","class Solution(object): + def totalNQueens(self, n): + """""" + :type n: int + :rtype: int + """""" + ","class Solution: + def totalNQueens(self, n: int) -> int: + ","int totalNQueens(int n){ + +}","public class Solution { + public int TotalNQueens(int n) { + + } +}","/** + * @param {number} n + * @return {number} + */ +var totalNQueens = function(n) { + +};","# @param {Integer} n +# @return {Integer} +def total_n_queens(n) + +end","class Solution { + func totalNQueens(_ n: Int) -> Int { + + } +}","func totalNQueens(n int) int { + +}","object Solution { + def totalNQueens(n: Int): Int = { + + } +}","class Solution { + fun totalNQueens(n: Int): Int { + + } +}","impl Solution { + pub fn total_n_queens(n: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer $n + * @return Integer + */ + function totalNQueens($n) { + + } +}","function totalNQueens(n: number): number { + +};","(define/contract (total-n-queens n) + (-> exact-integer? exact-integer?) + + )","-spec total_n_queens(N :: integer()) -> integer(). +total_n_queens(N) -> + .","defmodule Solution do + @spec total_n_queens(n :: integer) :: integer + def total_n_queens(n) do + + end +end","class Solution { + int totalNQueens(int n) { + + } +}", +2084,n-queens,N-Queens,51.0,51.0,"

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

+ +

Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.

+ +

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
+Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above
+
+ +

Example 2:

+ +
+Input: n = 1
+Output: [["Q"]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 9
    • +
+",3.0,False,"class Solution { +public: + vector> solveNQueens(int n) { + + } +};","class Solution { + public List> solveNQueens(int n) { + + } +}","class Solution(object): + def solveNQueens(self, n): + """""" + :type n: int + :rtype: List[List[str]] + """""" + ","class Solution: + def solveNQueens(self, n: int) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** solveNQueens(int n, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> SolveNQueens(int n) { + + } +}","/** + * @param {number} n + * @return {string[][]} + */ +var solveNQueens = function(n) { + +};","# @param {Integer} n +# @return {String[][]} +def solve_n_queens(n) + +end","class Solution { + func solveNQueens(_ n: Int) -> [[String]] { + + } +}","func solveNQueens(n int) [][]string { + +}","object Solution { + def solveNQueens(n: Int): List[List[String]] = { + + } +}","class Solution { + fun solveNQueens(n: Int): List> { + + } +}","impl Solution { + pub fn solve_n_queens(n: i32) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer $n + * @return String[][] + */ + function solveNQueens($n) { + + } +}","function solveNQueens(n: number): string[][] { + +};","(define/contract (solve-n-queens n) + (-> exact-integer? (listof (listof string?))) + + )","-spec solve_n_queens(N :: integer()) -> [[unicode:unicode_binary()]]. +solve_n_queens(N) -> + .","defmodule Solution do + @spec solve_n_queens(n :: integer) :: [[String.t]] + def solve_n_queens(n) do + + end +end","class Solution { + List> solveNQueens(int n) { + + } +}", +2086,group-anagrams,Group Anagrams,49.0,49.0,"

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

+ +

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

+ +

 

+

Example 1:

+
Input: strs = [""eat"",""tea"",""tan"",""ate"",""nat"",""bat""]
+Output: [[""bat""],[""nat"",""tan""],[""ate"",""eat"",""tea""]]
+

Example 2:

+
Input: strs = [""""]
+Output: [[""""]]
+

Example 3:

+
Input: strs = [""a""]
+Output: [[""a""]]
+
+

 

+

Constraints:

+ +
    +
  • 1 <= strs.length <= 104
    • +
  • 0 <= strs[i].length <= 100
    • +
  • strs[i] consists of lowercase English letters.
    • +
+",2.0,False,"class Solution { +public: + vector> groupAnagrams(vector& strs) { + + } +};","class Solution { + public List> groupAnagrams(String[] strs) { + + } +}","class Solution(object): + def groupAnagrams(self, strs): + """""" + :type strs: List[str] + :rtype: List[List[str]] + """""" + ","class Solution: + def groupAnagrams(self, strs: List[str]) -> List[List[str]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +char *** groupAnagrams(char ** strs, int strsSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> GroupAnagrams(string[] strs) { + + } +}","/** + * @param {string[]} strs + * @return {string[][]} + */ +var groupAnagrams = function(strs) { + +};","# @param {String[]} strs +# @return {String[][]} +def group_anagrams(strs) + +end","class Solution { + func groupAnagrams(_ strs: [String]) -> [[String]] { + + } +}","func groupAnagrams(strs []string) [][]string { + +}","object Solution { + def groupAnagrams(strs: Array[String]): List[List[String]] = { + + } +}","class Solution { + fun groupAnagrams(strs: Array): List> { + + } +}","impl Solution { + pub fn group_anagrams(strs: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param String[] $strs + * @return String[][] + */ + function groupAnagrams($strs) { + + } +}","function groupAnagrams(strs: string[]): string[][] { + +};","(define/contract (group-anagrams strs) + (-> (listof string?) (listof (listof string?))) + + )","-spec group_anagrams(Strs :: [unicode:unicode_binary()]) -> [[unicode:unicode_binary()]]. +group_anagrams(Strs) -> + .","defmodule Solution do + @spec group_anagrams(strs :: [String.t]) :: [[String.t]] + def group_anagrams(strs) do + + end +end","class Solution { + List> groupAnagrams(List strs) { + + } +}", +2088,permutations-ii,Permutations II,47.0,47.0,"

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,2]
+Output:
+[[1,1,2],
+ [1,2,1],
+ [2,1,1]]
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3]
+Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 8
    • +
  • -10 <= nums[i] <= 10
    • +
+",2.0,False,"class Solution { +public: + vector> permuteUnique(vector& nums) { + + } +};","class Solution { + public List> permuteUnique(int[] nums) { + + } +}","class Solution(object): + def permuteUnique(self, nums): + """""" + :type nums: List[int] + :rtype: List[List[int]] + """""" + ","class Solution: + def permuteUnique(self, nums: List[int]) -> List[List[int]]: + ","/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +int** permuteUnique(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){ + +}","public class Solution { + public IList> PermuteUnique(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number[][]} + */ +var permuteUnique = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer[][]} +def permute_unique(nums) + +end","class Solution { + func permuteUnique(_ nums: [Int]) -> [[Int]] { + + } +}","func permuteUnique(nums []int) [][]int { + +}","object Solution { + def permuteUnique(nums: Array[Int]): List[List[Int]] = { + + } +}","class Solution { + fun permuteUnique(nums: IntArray): List> { + + } +}","impl Solution { + pub fn permute_unique(nums: Vec) -> Vec> { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer[][] + */ + function permuteUnique($nums) { + + } +}","function permuteUnique(nums: number[]): number[][] { + +};","(define/contract (permute-unique nums) + (-> (listof exact-integer?) (listof (listof exact-integer?))) + + )","-spec permute_unique(Nums :: [integer()]) -> [[integer()]]. +permute_unique(Nums) -> + .","defmodule Solution do + @spec permute_unique(nums :: [integer]) :: [[integer]] + def permute_unique(nums) do + + end +end","class Solution { + List> permuteUnique(List nums) { + + } +}", +2090,jump-game-ii,Jump Game II,45.0,45.0,"

You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].

+ +

Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where:

+ +
    +
  • 0 <= j <= nums[i] and
    • +
  • i + j < n
    • +
+ +

Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,1,1,4]
+Output: 2
+Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
+
+ +

Example 2:

+ +
+Input: nums = [2,3,0,1,4]
+Output: 2
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 104
    • +
  • 0 <= nums[i] <= 1000
    • +
  • It's guaranteed that you can reach nums[n - 1].
    • +
+",2.0,False,"class Solution { +public: + int jump(vector& nums) { + + } +};","class Solution { + public int jump(int[] nums) { + + } +}","class Solution(object): + def jump(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def jump(self, nums: List[int]) -> int: + ","int jump(int* nums, int numsSize){ + +}","public class Solution { + public int Jump(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var jump = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def jump(nums) + +end","class Solution { + func jump(_ nums: [Int]) -> Int { + + } +}","func jump(nums []int) int { + +}","object Solution { + def jump(nums: Array[Int]): Int = { + + } +}","class Solution { + fun jump(nums: IntArray): Int { + + } +}","impl Solution { + pub fn jump(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function jump($nums) { + + } +}","function jump(nums: number[]): number { + +};","(define/contract (jump nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec jump(Nums :: [integer()]) -> integer(). +jump(Nums) -> + .","defmodule Solution do + @spec jump(nums :: [integer]) :: integer + def jump(nums) do + + end +end","class Solution { + int jump(List nums) { + + } +}", +2091,wildcard-matching,Wildcard Matching,44.0,44.0,"

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where:

+ +
    +
  • '?' Matches any single character.
    • +
  • '*' Matches any sequence of characters (including the empty sequence).
    • +
+ +

The matching should cover the entire input string (not partial).

+ +

 

+

Example 1:

+ +
+Input: s = "aa", p = "a"
+Output: false
+Explanation: "a" does not match the entire string "aa".
+
+ +

Example 2:

+ +
+Input: s = "aa", p = "*"
+Output: true
+Explanation: '*' matches any sequence.
+
+ +

Example 3:

+ +
+Input: s = "cb", p = "?a"
+Output: false
+Explanation: '?' matches 'c', but the second letter is 'a', which does not match 'b'.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= s.length, p.length <= 2000
    • +
  • s contains only lowercase English letters.
    • +
  • p contains only lowercase English letters, '?' or '*'.
    • +
+",3.0,False,"class Solution { +public: + bool isMatch(string s, string p) { + + } +};","class Solution { + public boolean isMatch(String s, String p) { + + } +}","class Solution(object): + def isMatch(self, s, p): + """""" + :type s: str + :type p: str + :rtype: bool + """""" + ","class Solution: + def isMatch(self, s: str, p: str) -> bool: + ","bool isMatch(char * s, char * p){ + +}","public class Solution { + public bool IsMatch(string s, string p) { + + } +}","/** + * @param {string} s + * @param {string} p + * @return {boolean} + */ +var isMatch = function(s, p) { + +};","# @param {String} s +# @param {String} p +# @return {Boolean} +def is_match(s, p) + +end","class Solution { + func isMatch(_ s: String, _ p: String) -> Bool { + + } +}","func isMatch(s string, p string) bool { + +}","object Solution { + def isMatch(s: String, p: String): Boolean = { + + } +}","class Solution { + fun isMatch(s: String, p: String): Boolean { + + } +}","impl Solution { + pub fn is_match(s: String, p: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $p + * @return Boolean + */ + function isMatch($s, $p) { + + } +}","function isMatch(s: string, p: string): boolean { + +};","(define/contract (is-match s p) + (-> string? string? boolean?) + + )","-spec is_match(S :: unicode:unicode_binary(), P :: unicode:unicode_binary()) -> boolean(). +is_match(S, P) -> + .","defmodule Solution do + @spec is_match(s :: String.t, p :: String.t) :: boolean + def is_match(s, p) do + + end +end","class Solution { + bool isMatch(String s, String p) { + + } +}", +2093,trapping-rain-water,Trapping Rain Water,42.0,42.0,"

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

+ +

 

+

Example 1:

+ +
+Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
+Output: 6
+Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.
+
+ +

Example 2:

+ +
+Input: height = [4,2,0,3,2,5]
+Output: 9
+
+ +

 

+

Constraints:

+ +
    +
  • n == height.length
    • +
  • 1 <= n <= 2 * 104
    • +
  • 0 <= height[i] <= 105
    • +
+",3.0,False,"class Solution { +public: + int trap(vector& height) { + + } +};","class Solution { + public int trap(int[] height) { + + } +}","class Solution(object): + def trap(self, height): + """""" + :type height: List[int] + :rtype: int + """""" + ","class Solution: + def trap(self, height: List[int]) -> int: + ","int trap(int* height, int heightSize){ + +}","public class Solution { + public int Trap(int[] height) { + + } +}","/** + * @param {number[]} height + * @return {number} + */ +var trap = function(height) { + +};","# @param {Integer[]} height +# @return {Integer} +def trap(height) + +end","class Solution { + func trap(_ height: [Int]) -> Int { + + } +}","func trap(height []int) int { + +}","object Solution { + def trap(height: Array[Int]): Int = { + + } +}","class Solution { + fun trap(height: IntArray): Int { + + } +}","impl Solution { + pub fn trap(height: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $height + * @return Integer + */ + function trap($height) { + + } +}","function trap(height: number[]): number { + +};","(define/contract (trap height) + (-> (listof exact-integer?) exact-integer?) + + )","-spec trap(Height :: [integer()]) -> integer(). +trap(Height) -> + .","defmodule Solution do + @spec trap(height :: [integer]) :: integer + def trap(height) do + + end +end","class Solution { + int trap(List height) { + + } +}", +2094,first-missing-positive,First Missing Positive,41.0,41.0,"

Given an unsorted integer array nums, return the smallest missing positive integer.

+ +

You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,0]
+Output: 3
+Explanation: The numbers in the range [1,2] are all in the array.
+
+ +

Example 2:

+ +
+Input: nums = [3,4,-1,1]
+Output: 2
+Explanation: 1 is in the array but 2 is missing.
+
+ +

Example 3:

+ +
+Input: nums = [7,8,9,11,12]
+Output: 1
+Explanation: The smallest positive integer 1 is missing.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • -231 <= nums[i] <= 231 - 1
    • +
+",3.0,False,"class Solution { +public: + int firstMissingPositive(vector& nums) { + + } +};","class Solution { + public int firstMissingPositive(int[] nums) { + + } +}","class Solution(object): + def firstMissingPositive(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def firstMissingPositive(self, nums: List[int]) -> int: + ","int firstMissingPositive(int* nums, int numsSize){ + +}","public class Solution { + public int FirstMissingPositive(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var firstMissingPositive = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def first_missing_positive(nums) + +end","class Solution { + func firstMissingPositive(_ nums: [Int]) -> Int { + + } +}","func firstMissingPositive(nums []int) int { + +}","object Solution { + def firstMissingPositive(nums: Array[Int]): Int = { + + } +}","class Solution { + fun firstMissingPositive(nums: IntArray): Int { + + } +}","impl Solution { + pub fn first_missing_positive(nums: Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function firstMissingPositive($nums) { + + } +}","function firstMissingPositive(nums: number[]): number { + +};","(define/contract (first-missing-positive nums) + (-> (listof exact-integer?) exact-integer?) + + )","-spec first_missing_positive(Nums :: [integer()]) -> integer(). +first_missing_positive(Nums) -> + .","defmodule Solution do + @spec first_missing_positive(nums :: [integer]) :: integer + def first_missing_positive(nums) do + + end +end","class Solution { + int firstMissingPositive(List nums) { + + } +}", +2097,count-and-say,Count and Say,38.0,38.0,"

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

+ +
    +
  • countAndSay(1) = "1"
    • +
  • countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different digit string.
    • +
+ +

To determine how you "say" a digit string, split it into the minimal number of substrings such that each substring contains exactly one unique digit. Then for each substring, say the number of digits, then say the digit. Finally, concatenate every said digit.

+ +

For example, the saying and conversion for digit string "3322251":

+ +

Given a positive integer n, return the nth term of the count-and-say sequence.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: "1"
+Explanation: This is the base case.
+
+ +

Example 2:

+ +
+Input: n = 4
+Output: "1211"
+Explanation:
+countAndSay(1) = "1"
+countAndSay(2) = say "1" = one 1 = "11"
+countAndSay(3) = say "11" = two 1's = "21"
+countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 30
    • +
+",2.0,False,"class Solution { +public: + string countAndSay(int n) { + + } +};","class Solution { + public String countAndSay(int n) { + + } +}","class Solution(object): + def countAndSay(self, n): + """""" + :type n: int + :rtype: str + """""" + ","class Solution: + def countAndSay(self, n: int) -> str: + ","char * countAndSay(int n){ + +}","public class Solution { + public string CountAndSay(int n) { + + } +}","/** + * @param {number} n + * @return {string} + */ +var countAndSay = function(n) { + +};","# @param {Integer} n +# @return {String} +def count_and_say(n) + +end","class Solution { + func countAndSay(_ n: Int) -> String { + + } +}","func countAndSay(n int) string { + +}","object Solution { + def countAndSay(n: Int): String = { + + } +}","class Solution { + fun countAndSay(n: Int): String { + + } +}","impl Solution { + pub fn count_and_say(n: i32) -> String { + + } +}","class Solution { + + /** + * @param Integer $n + * @return String + */ + function countAndSay($n) { + + } +}","function countAndSay(n: number): string { + +};","(define/contract (count-and-say n) + (-> exact-integer? string?) + + )","-spec count_and_say(N :: integer()) -> unicode:unicode_binary(). +count_and_say(N) -> + .","defmodule Solution do + @spec count_and_say(n :: integer) :: String.t + def count_and_say(n) do + + end +end","class Solution { + String countAndSay(int n) { + + } +}", +2098,sudoku-solver,Sudoku Solver,37.0,37.0,"

Write a program to solve a Sudoku puzzle by filling the empty cells.

+ +

A sudoku solution must satisfy all of the following rules:

+ +
    +
  1. Each of the digits 1-9 must occur exactly once in each row.
    2. +
  2. Each of the digits 1-9 must occur exactly once in each column.
    3. +
  3. Each of the digits 1-9 must occur exactly once in each of the 9 3x3 sub-boxes of the grid.
    4. +
+ +

The '.' character indicates empty cells.

+ +

 

+

Example 1:

+ +
+Input: board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
+Output: [["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
+Explanation: The input board is shown above and the only valid solution is shown below:
+
+
+
+ +

 

+

Constraints:

+ +
    +
  • board.length == 9
    • +
  • board[i].length == 9
    • +
  • board[i][j] is a digit or '.'.
    • +
  • It is guaranteed that the input board has only one solution.
    • +
+",3.0,False,"class Solution { +public: + void solveSudoku(vector>& board) { + + } +};","class Solution { + public void solveSudoku(char[][] board) { + + } +}","class Solution(object): + def solveSudoku(self, board): + """""" + :type board: List[List[str]] + :rtype: None Do not return anything, modify board in-place instead. + """""" + ","class Solution: + def solveSudoku(self, board: List[List[str]]) -> None: + """""" + Do not return anything, modify board in-place instead. + """""" + ","void solveSudoku(char** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public void SolveSudoku(char[][] board) { + + } +}","/** + * @param {character[][]} board + * @return {void} Do not return anything, modify board in-place instead. + */ +var solveSudoku = function(board) { + +};","# @param {Character[][]} board +# @return {Void} Do not return anything, modify board in-place instead. +def solve_sudoku(board) + +end","class Solution { + func solveSudoku(_ board: inout [[Character]]) { + + } +}","func solveSudoku(board [][]byte) { + +}","object Solution { + def solveSudoku(board: Array[Array[Char]]): Unit = { + + } +}","class Solution { + fun solveSudoku(board: Array): Unit { + + } +}","impl Solution { + pub fn solve_sudoku(board: &mut Vec>) { + + } +}","class Solution { + + /** + * @param String[][] $board + * @return NULL + */ + function solveSudoku(&$board) { + + } +}","/** + Do not return anything, modify board in-place instead. + */ +function solveSudoku(board: string[][]): void { + +};","(define/contract (solve-sudoku board) + (-> (listof (listof char?)) void?) + + )",,,"class Solution { + void solveSudoku(List> board) { + + } +}", +2099,valid-sudoku,Valid Sudoku,36.0,36.0,"

Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

+ +
    +
  1. Each row must contain the digits 1-9 without repetition.
    2. +
  2. Each column must contain the digits 1-9 without repetition.
    3. +
  3. Each of the nine 3 x 3 sub-boxes of the grid must contain the digits 1-9 without repetition.
    4. +
+ +

Note:

+ +
    +
  • A Sudoku board (partially filled) could be valid but is not necessarily solvable.
    • +
  • Only the filled cells need to be validated according to the mentioned rules.
    • +
+ +

 

+

Example 1:

+ +
+Input: board = 
+[["5","3",".",".","7",".",".",".","."]
+,["6",".",".","1","9","5",".",".","."]
+,[".","9","8",".",".",".",".","6","."]
+,["8",".",".",".","6",".",".",".","3"]
+,["4",".",".","8",".","3",".",".","1"]
+,["7",".",".",".","2",".",".",".","6"]
+,[".","6",".",".",".",".","2","8","."]
+,[".",".",".","4","1","9",".",".","5"]
+,[".",".",".",".","8",".",".","7","9"]]
+Output: true
+
+ +

Example 2:

+ +
+Input: board = 
+[["8","3",".",".","7",".",".",".","."]
+,["6",".",".","1","9","5",".",".","."]
+,[".","9","8",".",".",".",".","6","."]
+,["8",".",".",".","6",".",".",".","3"]
+,["4",".",".","8",".","3",".",".","1"]
+,["7",".",".",".","2",".",".",".","6"]
+,[".","6",".",".",".",".","2","8","."]
+,[".",".",".","4","1","9",".",".","5"]
+,[".",".",".",".","8",".",".","7","9"]]
+Output: false
+Explanation: Same as Example 1, except with the 5 in the top left corner being modified to 8. Since there are two 8's in the top left 3x3 sub-box, it is invalid.
+
+ +

 

+

Constraints:

+ +
    +
  • board.length == 9
    • +
  • board[i].length == 9
    • +
  • board[i][j] is a digit 1-9 or '.'.
    • +
+",2.0,False,"class Solution { +public: + bool isValidSudoku(vector>& board) { + + } +};","class Solution { + public boolean isValidSudoku(char[][] board) { + + } +}","class Solution(object): + def isValidSudoku(self, board): + """""" + :type board: List[List[str]] + :rtype: bool + """""" + ","class Solution: + def isValidSudoku(self, board: List[List[str]]) -> bool: + ","bool isValidSudoku(char** board, int boardSize, int* boardColSize){ + +}","public class Solution { + public bool IsValidSudoku(char[][] board) { + + } +}","/** + * @param {character[][]} board + * @return {boolean} + */ +var isValidSudoku = function(board) { + +};","# @param {Character[][]} board +# @return {Boolean} +def is_valid_sudoku(board) + +end","class Solution { + func isValidSudoku(_ board: [[Character]]) -> Bool { + + } +}","func isValidSudoku(board [][]byte) bool { + +}","object Solution { + def isValidSudoku(board: Array[Array[Char]]): Boolean = { + + } +}","class Solution { + fun isValidSudoku(board: Array): Boolean { + + } +}","impl Solution { + pub fn is_valid_sudoku(board: Vec>) -> bool { + + } +}","class Solution { + + /** + * @param String[][] $board + * @return Boolean + */ + function isValidSudoku($board) { + + } +}","function isValidSudoku(board: string[][]): boolean { + +};","(define/contract (is-valid-sudoku board) + (-> (listof (listof char?)) boolean?) + + )","-spec is_valid_sudoku(Board :: [[char()]]) -> boolean(). +is_valid_sudoku(Board) -> + .","defmodule Solution do + @spec is_valid_sudoku(board :: [[char]]) :: boolean + def is_valid_sudoku(board) do + + end +end","class Solution { + bool isValidSudoku(List> board) { + + } +}", +2102,search-in-rotated-sorted-array,Search in Rotated Sorted Array,33.0,33.0,"

There is an integer array nums sorted in ascending order (with distinct values).

+ +

Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].

+ +

Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

+ +

You must write an algorithm with O(log n) runtime complexity.

+ +

 

+

Example 1:

+
Input: nums = [4,5,6,7,0,1,2], target = 0
+Output: 4
+

Example 2:

+
Input: nums = [4,5,6,7,0,1,2], target = 3
+Output: -1
+

Example 3:

+
Input: nums = [1], target = 0
+Output: -1
+
+

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 5000
    • +
  • -104 <= nums[i] <= 104
    • +
  • All values of nums are unique.
    • +
  • nums is an ascending array that is possibly rotated.
    • +
  • -104 <= target <= 104
    • +
+",2.0,False,"class Solution { +public: + int search(vector& nums, int target) { + + } +};","class Solution { + public int search(int[] nums, int target) { + + } +}","class Solution(object): + def search(self, nums, target): + """""" + :type nums: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def search(self, nums: List[int], target: int) -> int: + ","int search(int* nums, int numsSize, int target){ + +}","public class Solution { + public int Search(int[] nums, int target) { + + } +}","/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var search = function(nums, target) { + +};","# @param {Integer[]} nums +# @param {Integer} target +# @return {Integer} +def search(nums, target) + +end","class Solution { + func search(_ nums: [Int], _ target: Int) -> Int { + + } +}","func search(nums []int, target int) int { + +}","object Solution { + def search(nums: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun search(nums: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn search(nums: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $target + * @return Integer + */ + function search($nums, $target) { + + } +}","function search(nums: number[], target: number): number { + +};","(define/contract (search nums target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec search(Nums :: [integer()], Target :: integer()) -> integer(). +search(Nums, Target) -> + .","defmodule Solution do + @spec search(nums :: [integer], target :: integer) :: integer + def search(nums, target) do + + end +end","class Solution { + int search(List nums, int target) { + + } +}", +2103,longest-valid-parentheses,Longest Valid Parentheses,32.0,32.0,"

Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.

+ +

 

+

Example 1:

+ +
+Input: s = "(()"
+Output: 2
+Explanation: The longest valid parentheses substring is "()".
+
+ +

Example 2:

+ +
+Input: s = ")()())"
+Output: 4
+Explanation: The longest valid parentheses substring is "()()".
+
+ +

Example 3:

+ +
+Input: s = ""
+Output: 0
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= s.length <= 3 * 104
    • +
  • s[i] is '(', or ')'.
    • +
+",3.0,False,"class Solution { +public: + int longestValidParentheses(string s) { + + } +};","class Solution { + public int longestValidParentheses(String s) { + + } +}","class Solution(object): + def longestValidParentheses(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def longestValidParentheses(self, s: str) -> int: + ","int longestValidParentheses(char * s){ + +}","public class Solution { + public int LongestValidParentheses(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var longestValidParentheses = function(s) { + +};","# @param {String} s +# @return {Integer} +def longest_valid_parentheses(s) + +end","class Solution { + func longestValidParentheses(_ s: String) -> Int { + + } +}","func longestValidParentheses(s string) int { + +}","object Solution { + def longestValidParentheses(s: String): Int = { + + } +}","class Solution { + fun longestValidParentheses(s: String): Int { + + } +}","impl Solution { + pub fn longest_valid_parentheses(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function longestValidParentheses($s) { + + } +}","function longestValidParentheses(s: string): number { + +};","(define/contract (longest-valid-parentheses s) + (-> string? exact-integer?) + + )","-spec longest_valid_parentheses(S :: unicode:unicode_binary()) -> integer(). +longest_valid_parentheses(S) -> + .","defmodule Solution do + @spec longest_valid_parentheses(s :: String.t) :: integer + def longest_valid_parentheses(s) do + + end +end","class Solution { + int longestValidParentheses(String s) { + + } +}", +2104,next-permutation,Next Permutation,31.0,31.0,"

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

+ +
    +
  • For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1].
    • +
+ +

The next permutation of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).

+ +
    +
  • For example, the next permutation of arr = [1,2,3] is [1,3,2].
    • +
  • Similarly, the next permutation of arr = [2,3,1] is [3,1,2].
    • +
  • While the next permutation of arr = [3,2,1] is [1,2,3] because [3,2,1] does not have a lexicographical larger rearrangement.
    • +
+ +

Given an array of integers nums, find the next permutation of nums.

+ +

The replacement must be in place and use only constant extra memory.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3]
+Output: [1,3,2]
+
+ +

Example 2:

+ +
+Input: nums = [3,2,1]
+Output: [1,2,3]
+
+ +

Example 3:

+ +
+Input: nums = [1,1,5]
+Output: [1,5,1]
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
    • +
  • 0 <= nums[i] <= 100
    • +
+",2.0,False,"class Solution { +public: + void nextPermutation(vector& nums) { + + } +};","class Solution { + public void nextPermutation(int[] nums) { + + } +}","class Solution(object): + def nextPermutation(self, nums): + """""" + :type nums: List[int] + :rtype: None Do not return anything, modify nums in-place instead. + """""" + ","class Solution: + def nextPermutation(self, nums: List[int]) -> None: + """""" + Do not return anything, modify nums in-place instead. + """""" + ","void nextPermutation(int* nums, int numsSize){ + +}","public class Solution { + public void NextPermutation(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {void} Do not return anything, modify nums in-place instead. + */ +var nextPermutation = function(nums) { + +};","# @param {Integer[]} nums +# @return {Void} Do not return anything, modify nums in-place instead. +def next_permutation(nums) + +end","class Solution { + func nextPermutation(_ nums: inout [Int]) { + + } +}","func nextPermutation(nums []int) { + +}","object Solution { + def nextPermutation(nums: Array[Int]): Unit = { + + } +}","class Solution { + fun nextPermutation(nums: IntArray): Unit { + + } +}","impl Solution { + pub fn next_permutation(nums: &mut Vec) { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return NULL + */ + function nextPermutation(&$nums) { + + } +}","/** + Do not return anything, modify nums in-place instead. + */ +function nextPermutation(nums: number[]): void { + +};","(define/contract (next-permutation nums) + (-> (listof exact-integer?) void?) + + )",,,"class Solution { + void nextPermutation(List nums) { + + } +}", +2105,substring-with-concatenation-of-all-words,Substring with Concatenation of All Words,30.0,30.0,"

You are given a string s and an array of strings words. All the strings of words are of the same length.

+ +

A concatenated substring in s is a substring that contains all the strings of any permutation of words concatenated.

+ +
    +
  • For example, if words = ["ab","cd","ef"], then "abcdef", "abefcd", "cdabef", "cdefab", "efabcd", and "efcdab" are all concatenated strings. "acdbef" is not a concatenated substring because it is not the concatenation of any permutation of words.
    • +
+ +

Return the starting indices of all the concatenated substrings in s. You can return the answer in any order.

+ +

 

+

Example 1:

+ +
+Input: s = "barfoothefoobarman", words = ["foo","bar"]
+Output: [0,9]
+Explanation: Since words.length == 2 and words[i].length == 3, the concatenated substring has to be of length 6.
+The substring starting at 0 is "barfoo". It is the concatenation of ["bar","foo"] which is a permutation of words.
+The substring starting at 9 is "foobar". It is the concatenation of ["foo","bar"] which is a permutation of words.
+The output order does not matter. Returning [9,0] is fine too.
+
+ +

Example 2:

+ +
+Input: s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"]
+Output: []
+Explanation: Since words.length == 4 and words[i].length == 4, the concatenated substring has to be of length 16.
+There is no substring of length 16 is s that is equal to the concatenation of any permutation of words.
+We return an empty array.
+
+ +

Example 3:

+ +
+Input: s = "barfoofoobarthefoobarman", words = ["bar","foo","the"]
+Output: [6,9,12]
+Explanation: Since words.length == 3 and words[i].length == 3, the concatenated substring has to be of length 9.
+The substring starting at 6 is "foobarthe". It is the concatenation of ["foo","bar","the"] which is a permutation of words.
+The substring starting at 9 is "barthefoo". It is the concatenation of ["bar","the","foo"] which is a permutation of words.
+The substring starting at 12 is "thefoobar". It is the concatenation of ["the","foo","bar"] which is a permutation of words.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 104
    • +
  • 1 <= words.length <= 5000
    • +
  • 1 <= words[i].length <= 30
    • +
  • s and words[i] consist of lowercase English letters.
    • +
+",3.0,False,"class Solution { +public: + vector findSubstring(string s, vector& words) { + + } +};","class Solution { + public List findSubstring(String s, String[] words) { + + } +}","class Solution(object): + def findSubstring(self, s, words): + """""" + :type s: str + :type words: List[str] + :rtype: List[int] + """""" + ","class Solution: + def findSubstring(self, s: str, words: List[str]) -> List[int]: + ","/** + * Note: The returned array must be malloced, assume caller calls free(). + */ +int* findSubstring(char * s, char ** words, int wordsSize, int* returnSize){ + +}","public class Solution { + public IList FindSubstring(string s, string[] words) { + + } +}","/** + * @param {string} s + * @param {string[]} words + * @return {number[]} + */ +var findSubstring = function(s, words) { + +};","# @param {String} s +# @param {String[]} words +# @return {Integer[]} +def find_substring(s, words) + +end","class Solution { + func findSubstring(_ s: String, _ words: [String]) -> [Int] { + + } +}","func findSubstring(s string, words []string) []int { + +}","object Solution { + def findSubstring(s: String, words: Array[String]): List[Int] = { + + } +}","class Solution { + fun findSubstring(s: String, words: Array): List { + + } +}","impl Solution { + pub fn find_substring(s: String, words: Vec) -> Vec { + + } +}","class Solution { + + /** + * @param String $s + * @param String[] $words + * @return Integer[] + */ + function findSubstring($s, $words) { + + } +}","function findSubstring(s: string, words: string[]): number[] { + +};","(define/contract (find-substring s words) + (-> string? (listof string?) (listof exact-integer?)) + + )","-spec find_substring(S :: unicode:unicode_binary(), Words :: [unicode:unicode_binary()]) -> [integer()]. +find_substring(S, Words) -> + .","defmodule Solution do + @spec find_substring(s :: String.t, words :: [String.t]) :: [integer] + def find_substring(s, words) do + + end +end","class Solution { + List findSubstring(String s, List words) { + + } +}", +2109,remove-duplicates-from-sorted-array,Remove Duplicates from Sorted Array,26.0,26.0,"

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.

+ +

Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:

+ +
    +
  • Change the array nums such that the first k elements of nums contain the unique elements in the order they were present in nums initially. The remaining elements of nums are not important as well as the size of nums.
    • +
  • Return k.
    • +
+ +

Custom Judge:

+ +

The judge will test your solution with the following code:

+ +
+int[] nums = [...]; // Input array
+int[] expectedNums = [...]; // The expected answer with correct length
+
+int k = removeDuplicates(nums); // Calls your implementation
+
+assert k == expectedNums.length;
+for (int i = 0; i < k; i++) {
+    assert nums[i] == expectedNums[i];
+}
+
+ +

If all assertions pass, then your solution will be accepted.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,2]
+Output: 2, nums = [1,2,_]
+Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+ +

Example 2:

+ +
+Input: nums = [0,0,1,1,1,2,2,3,3,4]
+Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
+Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 3 * 104
    • +
  • -100 <= nums[i] <= 100
    • +
  • nums is sorted in non-decreasing order.
    • +
+",1.0,False,"class Solution { +public: + int removeDuplicates(vector& nums) { + + } +};","class Solution { + public int removeDuplicates(int[] nums) { + + } +}","class Solution(object): + def removeDuplicates(self, nums): + """""" + :type nums: List[int] + :rtype: int + """""" + ","class Solution: + def removeDuplicates(self, nums: List[int]) -> int: + ","int removeDuplicates(int* nums, int numsSize){ + +}","public class Solution { + public int RemoveDuplicates(int[] nums) { + + } +}","/** + * @param {number[]} nums + * @return {number} + */ +var removeDuplicates = function(nums) { + +};","# @param {Integer[]} nums +# @return {Integer} +def remove_duplicates(nums) + +end","class Solution { + func removeDuplicates(_ nums: inout [Int]) -> Int { + + } +}","func removeDuplicates(nums []int) int { + +}","object Solution { + def removeDuplicates(nums: Array[Int]): Int = { + + } +}","class Solution { + fun removeDuplicates(nums: IntArray): Int { + + } +}","impl Solution { + pub fn remove_duplicates(nums: &mut Vec) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function removeDuplicates(&$nums) { + + } +}","function removeDuplicates(nums: number[]): number { + +};","(define/contract (remove-duplicates nums) + (-> (listof exact-integer?) exact-integer?) + + )",,,"class Solution { + int removeDuplicates(List nums) { + + } +}", +2110,reverse-nodes-in-k-group,Reverse Nodes in k-Group,25.0,25.0,"

Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.

+ +

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.

+ +

You may not alter the values in the list's nodes, only nodes themselves may be changed.

+ +

 

+

Example 1:

+ +
+Input: head = [1,2,3,4,5], k = 2
+Output: [2,1,4,3,5]
+
+ +

Example 2:

+ +
+Input: head = [1,2,3,4,5], k = 3
+Output: [3,2,1,4,5]
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is n.
    • +
  • 1 <= k <= n <= 5000
    • +
  • 0 <= Node.val <= 1000
    • +
+ +

 

+

Follow-up: Can you solve the problem in O(1) extra memory space?

+",3.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* reverseKGroup(ListNode* head, int k) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode reverseKGroup(ListNode head, int k) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def reverseKGroup(self, head, k): + """""" + :type head: ListNode + :type k: int + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def reverseKGroup(self, head: Optional[ListNode], k: int) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* reverseKGroup(struct ListNode* head, int k){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode ReverseKGroup(ListNode head, int k) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode} head + * @param {number} k + * @return {ListNode} + */ +var reverseKGroup = function(head, k) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} head +# @param {Integer} k +# @return {ListNode} +def reverse_k_group(head, k) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func reverseKGroup(_ head: ListNode?, _ k: Int) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func reverseKGroup(head *ListNode, k int) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def reverseKGroup(head: ListNode, k: Int): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun reverseKGroup(head: ListNode?, k: Int): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn reverse_k_group(head: Option>, k: i32) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode $head + * @param Integer $k + * @return ListNode + */ + function reverseKGroup($head, $k) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function reverseKGroup(head: ListNode | null, k: number): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (reverse-k-group head k) + (-> (or/c list-node? #f) exact-integer? (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec reverse_k_group(Head :: #list_node{} | null, K :: integer()) -> #list_node{} | null. +reverse_k_group(Head, K) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec reverse_k_group(head :: ListNode.t | nil, k :: integer) :: ListNode.t | nil + def reverse_k_group(head, k) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? reverseKGroup(ListNode? head, int k) { + + } +}", +2112,merge-k-sorted-lists,Merge k Sorted Lists,23.0,23.0,"

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

+ +

Merge all the linked-lists into one sorted linked-list and return it.

+ +

 

+

Example 1:

+ +
+Input: lists = [[1,4,5],[1,3,4],[2,6]]
+Output: [1,1,2,3,4,4,5,6]
+Explanation: The linked-lists are:
+[
+  1->4->5,
+  1->3->4,
+  2->6
+]
+merging them into one sorted list:
+1->1->2->3->4->4->5->6
+
+ +

Example 2:

+ +
+Input: lists = []
+Output: []
+
+ +

Example 3:

+ +
+Input: lists = [[]]
+Output: []
+
+ +

 

+

Constraints:

+ +
    +
  • k == lists.length
    • +
  • 0 <= k <= 104
    • +
  • 0 <= lists[i].length <= 500
    • +
  • -104 <= lists[i][j] <= 104
    • +
  • lists[i] is sorted in ascending order.
    • +
  • The sum of lists[i].length will not exceed 104.
    • +
+",3.0,False,"/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* mergeKLists(vector& lists) { + + } +};","/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode mergeKLists(ListNode[] lists) { + + } +}","# Definition for singly-linked list. +# class ListNode(object): +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution(object): + def mergeKLists(self, lists): + """""" + :type lists: List[ListNode] + :rtype: ListNode + """""" + ","# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]: + ","/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * struct ListNode *next; + * }; + */ +struct ListNode* mergeKLists(struct ListNode** lists, int listsSize){ + +}","/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeKLists(ListNode[] lists) { + + } +}","/** + * Definition for singly-linked list. + * function ListNode(val, next) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + */ +/** + * @param {ListNode[]} lists + * @return {ListNode} + */ +var mergeKLists = function(lists) { + +};","# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode[]} lists +# @return {ListNode} +def merge_k_lists(lists) + +end","/** + * Definition for singly-linked list. + * public class ListNode { + * public var val: Int + * public var next: ListNode? + * public init() { self.val = 0; self.next = nil; } + * public init(_ val: Int) { self.val = val; self.next = nil; } + * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } + * } + */ +class Solution { + func mergeKLists(_ lists: [ListNode?]) -> ListNode? { + + } +}","/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func mergeKLists(lists []*ListNode) *ListNode { + +}","/** + * Definition for singly-linked list. + * class ListNode(_x: Int = 0, _next: ListNode = null) { + * var next: ListNode = _next + * var x: Int = _x + * } + */ +object Solution { + def mergeKLists(lists: Array[ListNode]): ListNode = { + + } +}","/** + * Example: + * var li = ListNode(5) + * var v = li.`val` + * Definition for singly-linked list. + * class ListNode(var `val`: Int) { + * var next: ListNode? = null + * } + */ +class Solution { + fun mergeKLists(lists: Array): ListNode? { + + } +}","// Definition for singly-linked list. +// #[derive(PartialEq, Eq, Clone, Debug)] +// pub struct ListNode { +// pub val: i32, +// pub next: Option> +// } +// +// impl ListNode { +// #[inline] +// fn new(val: i32) -> Self { +// ListNode { +// next: None, +// val +// } +// } +// } +impl Solution { + pub fn merge_k_lists(lists: Vec>>) -> Option> { + + } +}","/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + + /** + * @param ListNode[] $lists + * @return ListNode + */ + function mergeKLists($lists) { + + } +}","/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function mergeKLists(lists: Array): ListNode | null { + +};","; Definition for singly-linked list: +#| + +; val : integer? +; next : (or/c list-node? #f) +(struct list-node + (val next) #:mutable #:transparent) + +; constructor +(define (make-list-node [val 0]) + (list-node val #f)) + +|# + +(define/contract (merge-k-lists lists) + (-> (listof (or/c list-node? #f)) (or/c list-node? #f)) + + )","%% Definition for singly-linked list. +%% +%% -record(list_node, {val = 0 :: integer(), +%% next = null :: 'null' | #list_node{}}). + +-spec merge_k_lists(Lists :: [#list_node{} | null]) -> #list_node{} | null. +merge_k_lists(Lists) -> + .","# Definition for singly-linked list. +# +# defmodule ListNode do +# @type t :: %__MODULE__{ +# val: integer, +# next: ListNode.t() | nil +# } +# defstruct val: 0, next: nil +# end + +defmodule Solution do + @spec merge_k_lists(lists :: [ListNode.t | nil]) :: ListNode.t | nil + def merge_k_lists(lists) do + + end +end","/** + * Definition for singly-linked list. + * class ListNode { + * int val; + * ListNode? next; + * ListNode([this.val = 0, this.next]); + * } + */ +class Solution { + ListNode? mergeKLists(List lists) { + + } +}", +2119,3sum-closest,3Sum Closest,16.0,16.0,"

Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.

+ +

Return the sum of the three integers.

+ +

You may assume that each input would have exactly one solution.

+ +

 

+

Example 1:

+ +
+Input: nums = [-1,2,1,-4], target = 1
+Output: 2
+Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
+
+ +

Example 2:

+ +
+Input: nums = [0,0,0], target = 1
+Output: 0
+Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= nums.length <= 500
    • +
  • -1000 <= nums[i] <= 1000
    • +
  • -104 <= target <= 104
    • +
+",2.0,False,"class Solution { +public: + int threeSumClosest(vector& nums, int target) { + + } +};","class Solution { + public int threeSumClosest(int[] nums, int target) { + + } +}","class Solution(object): + def threeSumClosest(self, nums, target): + """""" + :type nums: List[int] + :type target: int + :rtype: int + """""" + ","class Solution: + def threeSumClosest(self, nums: List[int], target: int) -> int: + ","int threeSumClosest(int* nums, int numsSize, int target){ + +}","public class Solution { + public int ThreeSumClosest(int[] nums, int target) { + + } +}","/** + * @param {number[]} nums + * @param {number} target + * @return {number} + */ +var threeSumClosest = function(nums, target) { + +};","# @param {Integer[]} nums +# @param {Integer} target +# @return {Integer} +def three_sum_closest(nums, target) + +end","class Solution { + func threeSumClosest(_ nums: [Int], _ target: Int) -> Int { + + } +}","func threeSumClosest(nums []int, target int) int { + +}","object Solution { + def threeSumClosest(nums: Array[Int], target: Int): Int = { + + } +}","class Solution { + fun threeSumClosest(nums: IntArray, target: Int): Int { + + } +}","impl Solution { + pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { + + } +}","class Solution { + + /** + * @param Integer[] $nums + * @param Integer $target + * @return Integer + */ + function threeSumClosest($nums, $target) { + + } +}","function threeSumClosest(nums: number[], target: number): number { + +};","(define/contract (three-sum-closest nums target) + (-> (listof exact-integer?) exact-integer? exact-integer?) + + )","-spec three_sum_closest(Nums :: [integer()], Target :: integer()) -> integer(). +three_sum_closest(Nums, Target) -> + .","defmodule Solution do + @spec three_sum_closest(nums :: [integer], target :: integer) :: integer + def three_sum_closest(nums, target) do + + end +end","class Solution { + int threeSumClosest(List nums, int target) { + + } +}", +2125,regular-expression-matching,Regular Expression Matching,10.0,10.0,"

Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where:

+ +
    +
  • '.' Matches any single character.​​​​
    • +
  • '*' Matches zero or more of the preceding element.
    • +
+ +

The matching should cover the entire input string (not partial).

+ +

 

+

Example 1:

+ +
+Input: s = "aa", p = "a"
+Output: false
+Explanation: "a" does not match the entire string "aa".
+
+ +

Example 2:

+ +
+Input: s = "aa", p = "a*"
+Output: true
+Explanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".
+
+ +

Example 3:

+ +
+Input: s = "ab", p = ".*"
+Output: true
+Explanation: ".*" means "zero or more (*) of any character (.)".
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 20
    • +
  • 1 <= p.length <= 20
    • +
  • s contains only lowercase English letters.
    • +
  • p contains only lowercase English letters, '.', and '*'.
    • +
  • It is guaranteed for each appearance of the character '*', there will be a previous valid character to match.
    • +
+",3.0,False,"class Solution { +public: + bool isMatch(string s, string p) { + + } +};","class Solution { + public boolean isMatch(String s, String p) { + + } +}","class Solution(object): + def isMatch(self, s, p): + """""" + :type s: str + :type p: str + :rtype: bool + """""" + ","class Solution: + def isMatch(self, s: str, p: str) -> bool: + ","bool isMatch(char * s, char * p){ + +}","public class Solution { + public bool IsMatch(string s, string p) { + + } +}","/** + * @param {string} s + * @param {string} p + * @return {boolean} + */ +var isMatch = function(s, p) { + +};","# @param {String} s +# @param {String} p +# @return {Boolean} +def is_match(s, p) + +end","class Solution { + func isMatch(_ s: String, _ p: String) -> Bool { + + } +}","func isMatch(s string, p string) bool { + +}","object Solution { + def isMatch(s: String, p: String): Boolean = { + + } +}","class Solution { + fun isMatch(s: String, p: String): Boolean { + + } +}","impl Solution { + pub fn is_match(s: String, p: String) -> bool { + + } +}","class Solution { + + /** + * @param String $s + * @param String $p + * @return Boolean + */ + function isMatch($s, $p) { + + } +}","function isMatch(s: string, p: string): boolean { + +};","(define/contract (is-match s p) + (-> string? string? boolean?) + + )","-spec is_match(S :: unicode:unicode_binary(), P :: unicode:unicode_binary()) -> boolean(). +is_match(S, P) -> + .","defmodule Solution do + @spec is_match(s :: String.t, p :: String.t) :: boolean + def is_match(s, p) do + + end +end","class Solution { + bool isMatch(String s, String p) { + + } +}", +2127,string-to-integer-atoi,String to Integer (atoi),8.0,8.0,"

Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function).

+ +

The algorithm for myAtoi(string s) is as follows:

+ +
    +
  1. Read in and ignore any leading whitespace.
    2. +
  2. Check if the next character (if not already at the end of the string) is '-' or '+'. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present.
    3. +
  3. Read in next the characters until the next non-digit character or the end of the input is reached. The rest of the string is ignored.
    4. +
  4. Convert these digits into an integer (i.e. "123" -> 123, "0032" -> 32). If no digits were read, then the integer is 0. Change the sign as necessary (from step 2).
    5. +
  5. If the integer is out of the 32-bit signed integer range [-231, 231 - 1], then clamp the integer so that it remains in the range. Specifically, integers less than -231 should be clamped to -231, and integers greater than 231 - 1 should be clamped to 231 - 1.
    6. +
  6. Return the integer as the final result.
    7. +
+ +

Note:

+ +
    +
  • Only the space character ' ' is considered a whitespace character.
    • +
  • Do not ignore any characters other than the leading whitespace or the rest of the string after the digits.
    • +
+ +

 

+

Example 1:

+ +
+Input: s = "42"
+Output: 42
+Explanation: The underlined characters are what is read in, the caret is the current reader position.
+Step 1: "42" (no characters read because there is no leading whitespace)
+         ^
+Step 2: "42" (no characters read because there is neither a '-' nor '+')
+         ^
+Step 3: "42" ("42" is read in)
+           ^
+The parsed integer is 42.
+Since 42 is in the range [-231, 231 - 1], the final result is 42.
+
+ +

Example 2:

+ +
+Input: s = "   -42"
+Output: -42
+Explanation:
+Step 1: "   -42" (leading whitespace is read and ignored)
+            ^
+Step 2: "   -42" ('-' is read, so the result should be negative)
+             ^
+Step 3: "   -42" ("42" is read in)
+               ^
+The parsed integer is -42.
+Since -42 is in the range [-231, 231 - 1], the final result is -42.
+
+ +

Example 3:

+ +
+Input: s = "4193 with words"
+Output: 4193
+Explanation:
+Step 1: "4193 with words" (no characters read because there is no leading whitespace)
+         ^
+Step 2: "4193 with words" (no characters read because there is neither a '-' nor '+')
+         ^
+Step 3: "4193 with words" ("4193" is read in; reading stops because the next character is a non-digit)
+             ^
+The parsed integer is 4193.
+Since 4193 is in the range [-231, 231 - 1], the final result is 4193.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= s.length <= 200
    • +
  • s consists of English letters (lower-case and upper-case), digits (0-9), ' ', '+', '-', and '.'.
    • +
+",2.0,False,"class Solution { +public: + int myAtoi(string s) { + + } +};","class Solution { + public int myAtoi(String s) { + + } +}","class Solution(object): + def myAtoi(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def myAtoi(self, s: str) -> int: + ","int myAtoi(char * s){ + +}","public class Solution { + public int MyAtoi(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var myAtoi = function(s) { + +};","# @param {String} s +# @return {Integer} +def my_atoi(s) + +end","class Solution { + func myAtoi(_ s: String) -> Int { + + } +}","func myAtoi(s string) int { + +}","object Solution { + def myAtoi(s: String): Int = { + + } +}","class Solution { + fun myAtoi(s: String): Int { + + } +}","impl Solution { + pub fn my_atoi(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function myAtoi($s) { + + } +}","function myAtoi(s: string): number { + +};","(define/contract (my-atoi s) + (-> string? exact-integer?) + + )","-spec my_atoi(S :: unicode:unicode_binary()) -> integer(). +my_atoi(S) -> + .","defmodule Solution do + @spec my_atoi(s :: String.t) :: integer + def my_atoi(s) do + + end +end","class Solution { + int myAtoi(String s) { + + } +}", +2129,zigzag-conversion,Zigzag Conversion,6.0,6.0,"

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

+ +
+P   A   H   N
+A P L S I I G
+Y   I   R
+
+ +

And then read line by line: "PAHNAPLSIIGYIR"

+ +

Write the code that will take a string and make this conversion given a number of rows:

+ +
+string convert(string s, int numRows);
+
+ +

 

+

Example 1:

+ +
+Input: s = "PAYPALISHIRING", numRows = 3
+Output: "PAHNAPLSIIGYIR"
+
+ +

Example 2:

+ +
+Input: s = "PAYPALISHIRING", numRows = 4
+Output: "PINALSIGYAHRPI"
+Explanation:
+P     I    N
+A   L S  I G
+Y A   H R
+P     I
+
+ +

Example 3:

+ +
+Input: s = "A", numRows = 1
+Output: "A"
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
    • +
  • s consists of English letters (lower-case and upper-case), ',' and '.'.
    • +
  • 1 <= numRows <= 1000
    • +
+",2.0,False,"class Solution { +public: + string convert(string s, int numRows) { + + } +};","class Solution { + public String convert(String s, int numRows) { + + } +}","class Solution(object): + def convert(self, s, numRows): + """""" + :type s: str + :type numRows: int + :rtype: str + """""" + ","class Solution: + def convert(self, s: str, numRows: int) -> str: + ","char * convert(char * s, int numRows){ + +}","public class Solution { + public string Convert(string s, int numRows) { + + } +}","/** + * @param {string} s + * @param {number} numRows + * @return {string} + */ +var convert = function(s, numRows) { + +};","# @param {String} s +# @param {Integer} num_rows +# @return {String} +def convert(s, num_rows) + +end","class Solution { + func convert(_ s: String, _ numRows: Int) -> String { + + } +}","func convert(s string, numRows int) string { + +}","object Solution { + def convert(s: String, numRows: Int): String = { + + } +}","class Solution { + fun convert(s: String, numRows: Int): String { + + } +}","impl Solution { + pub fn convert(s: String, num_rows: i32) -> String { + + } +}","class Solution { + + /** + * @param String $s + * @param Integer $numRows + * @return String + */ + function convert($s, $numRows) { + + } +}","function convert(s: string, numRows: number): string { + +};","(define/contract (convert s numRows) + (-> string? exact-integer? string?) + + )","-spec convert(S :: unicode:unicode_binary(), NumRows :: integer()) -> unicode:unicode_binary(). +convert(S, NumRows) -> + .","defmodule Solution do + @spec convert(s :: String.t, num_rows :: integer) :: String.t + def convert(s, num_rows) do + + end +end","class Solution { + String convert(String s, int numRows) { + + } +}", +2131,median-of-two-sorted-arrays,Median of Two Sorted Arrays,4.0,4.0,"

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

+ +

The overall run time complexity should be O(log (m+n)).

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,3], nums2 = [2]
+Output: 2.00000
+Explanation: merged array = [1,2,3] and median is 2.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,2], nums2 = [3,4]
+Output: 2.50000
+Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+
+ +

 

+

Constraints:

+ +
    +
  • nums1.length == m
    • +
  • nums2.length == n
    • +
  • 0 <= m <= 1000
    • +
  • 0 <= n <= 1000
    • +
  • 1 <= m + n <= 2000
    • +
  • -106 <= nums1[i], nums2[i] <= 106
    • +
+",3.0,False,"class Solution { +public: + double findMedianSortedArrays(vector& nums1, vector& nums2) { + + } +};","class Solution { + public double findMedianSortedArrays(int[] nums1, int[] nums2) { + + } +}","class Solution(object): + def findMedianSortedArrays(self, nums1, nums2): + """""" + :type nums1: List[int] + :type nums2: List[int] + :rtype: float + """""" + ","class Solution: + def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: + ","double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){ + +}","public class Solution { + public double FindMedianSortedArrays(int[] nums1, int[] nums2) { + + } +}","/** + * @param {number[]} nums1 + * @param {number[]} nums2 + * @return {number} + */ +var findMedianSortedArrays = function(nums1, nums2) { + +};","# @param {Integer[]} nums1 +# @param {Integer[]} nums2 +# @return {Float} +def find_median_sorted_arrays(nums1, nums2) + +end","class Solution { + func findMedianSortedArrays(_ nums1: [Int], _ nums2: [Int]) -> Double { + + } +}","func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { + +}","object Solution { + def findMedianSortedArrays(nums1: Array[Int], nums2: Array[Int]): Double = { + + } +}","class Solution { + fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double { + + } +}","impl Solution { + pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { + + } +}","class Solution { + + /** + * @param Integer[] $nums1 + * @param Integer[] $nums2 + * @return Float + */ + function findMedianSortedArrays($nums1, $nums2) { + + } +}","function findMedianSortedArrays(nums1: number[], nums2: number[]): number { + +};","(define/contract (find-median-sorted-arrays nums1 nums2) + (-> (listof exact-integer?) (listof exact-integer?) flonum?) + + )","-spec find_median_sorted_arrays(Nums1 :: [integer()], Nums2 :: [integer()]) -> float(). +find_median_sorted_arrays(Nums1, Nums2) -> + .","defmodule Solution do + @spec find_median_sorted_arrays(nums1 :: [integer], nums2 :: [integer]) :: float + def find_median_sorted_arrays(nums1, nums2) do + + end +end","class Solution { + double findMedianSortedArrays(List nums1, List nums2) { + + } +}", +2132,longest-substring-without-repeating-characters,Longest Substring Without Repeating Characters,3.0,3.0,"

Given a string s, find the length of the longest substring without repeating characters.

+ +

 

+

Example 1:

+ +
+Input: s = "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+
+ +

Example 2:

+ +
+Input: s = "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+
+ +

Example 3:

+ +
+Input: s = "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= s.length <= 5 * 104
    • +
  • s consists of English letters, digits, symbols and spaces.
    • +
+",2.0,False,"class Solution { +public: + int lengthOfLongestSubstring(string s) { + + } +};","class Solution { + public int lengthOfLongestSubstring(String s) { + + } +}","class Solution(object): + def lengthOfLongestSubstring(self, s): + """""" + :type s: str + :rtype: int + """""" + ","class Solution: + def lengthOfLongestSubstring(self, s: str) -> int: + ","int lengthOfLongestSubstring(char * s){ + +}","public class Solution { + public int LengthOfLongestSubstring(string s) { + + } +}","/** + * @param {string} s + * @return {number} + */ +var lengthOfLongestSubstring = function(s) { + +};","# @param {String} s +# @return {Integer} +def length_of_longest_substring(s) + +end","class Solution { + func lengthOfLongestSubstring(_ s: String) -> Int { + + } +}","func lengthOfLongestSubstring(s string) int { + +}","object Solution { + def lengthOfLongestSubstring(s: String): Int = { + + } +}","class Solution { + fun lengthOfLongestSubstring(s: String): Int { + + } +}","impl Solution { + pub fn length_of_longest_substring(s: String) -> i32 { + + } +}","class Solution { + + /** + * @param String $s + * @return Integer + */ + function lengthOfLongestSubstring($s) { + + } +}","function lengthOfLongestSubstring(s: string): number { + +};","(define/contract (length-of-longest-substring s) + (-> string? exact-integer?) + + )","-spec length_of_longest_substring(S :: unicode:unicode_binary()) -> integer(). +length_of_longest_substring(S) -> + .","defmodule Solution do + @spec length_of_longest_substring(s :: String.t) :: integer + def length_of_longest_substring(s) do + + end +end","class Solution { + int lengthOfLongestSubstring(String s) { + + } +}", diff --git a/results/openai/human_eval/gpt_3p5_turbo_0301/openai_human_eval__model_eq_gpt_3p5_turbo_0301__temperature_eq_0p7.jsonl b/results/openai/human_eval/gpt_3p5_turbo_0301/openai_human_eval__model_eq_gpt_3p5_turbo_0301__temperature_eq_0p7.jsonl index 5b3e7da4..849a3ccb 100644 --- a/results/openai/human_eval/gpt_3p5_turbo_0301/openai_human_eval__model_eq_gpt_3p5_turbo_0301__temperature_eq_0p7.jsonl +++ b/results/openai/human_eval/gpt_3p5_turbo_0301/openai_human_eval__model_eq_gpt_3p5_turbo_0301__temperature_eq_0p7.jsonl @@ -170,3 +170,62 @@ {"task_id": "HumanEval/17", "prompt": "from typing import List\n\n\ndef parse_music(music_string: str) -> List[int]:\n \"\"\" Input to this function is a string representing musical notes in a special ASCII format.\n Your task is to parse this string and return list of integers corresponding to how many beats does each\n not last.\n\n Here is a legend:\n 'o' - whole note, lasts four beats\n 'o|' - half note, lasts two beats\n '.|' - quater note, lasts one beat\n\n >>> parse_music('o o| .| o| o| .| .| .| .| o o')\n [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]\n \"\"\"\n", "entry_point": "parse_music", "canonical_solution": "\n\n def count_beats(note: str) -> int:\n if note == \"o\": return 4\n elif note == \"o|\": return 2\n elif note == \".|\": return 1\n \n if music_string == \"\": return []\n return list(map(count_beats, music_string.split(\" \")))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == []\n assert candidate('o o o o') == [4, 4, 4, 4]\n assert candidate('.| .| .| .|') == [1, 1, 1, 1]\n assert candidate('o| o| .| .| o o o o') == [2, 2, 1, 1, 4, 4, 4, 4]\n assert candidate('o| .| o| .| o o| o o|') == [2, 1, 2, 1, 4, 2, 4, 2]\n", "contract": "\n assert isinstance(music_string, str), \"invalid inputs\" # $_CONTRACT_$\n assert music_string == \"\" or all(map(lambda x: x in [\"o\", \"o|\", \".|\"], music_string.split(\" \"))), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["o o o o"], [".| .| .| .|"], ["o| o| .| .| o o o o"], ["o| .| o| .| o o| o o|"]], "atol": 0, "plus_input": [["o o| o| o|"], [".| .| o| o| .|"], ["o| o| o| .| o| .|"], [".| .| o| o| o| o| .| .| o| o| o| o| o| o| o o o o"], [".| .| o| o| .| .| o| o|"], ["o| .| .| .| o| o|"], ["o| o| o| o| .| .| .| .|"], [".| o| .| o| o| .| o| .|"], ["o o| o| o| o| o| o| o|"], [".| .| o| o| o| o| o| .| o| o| o| o| o| o o o o o o o| o|"], [".| .| o| o|"], [""], ["o| o| o| o| o| o| o|"], ["o| o| o| o| .| .| .|"], ["o o| o| o| o| o"], ["o| o|"], [".| .| o|"], ["o| .| .| .| o| o| .| .| o| o|"], ["o| o| o| o| o| .| .| .| .| o| .| o| .|"], ["o o| o| o| o|"], ["o| o| o| o| o| o"], ["o| o| o| .|"], ["o| o| o|"], ["o o| o| o| o"], ["o| o| o| o|"], ["o| .| .| o| o|"], ["o| o| o| o| o| o|"], ["o|"], ["o o| o| .| .| o| o| o| o| o| .| o| o| o| o| o| o o o o o o o| o| o| o| o"], ["o| o"], ["o| .| .| o| o| .| .| o| o|"], [".| .| o| o| o| o o o"], ["o| o| o| o"], ["o o| o"], ["o| .| .| .| o|"], ["o o| o| .| .| o| o| o| o| o| .| o o o o o o o o| o| o| o| o"], ["o"], ["o o"], ["o o| o| .| o| o| o| o| o| o o o o o o o| o| o| o| o"], [".| .| o| o| o"], ["o o| o| o"], ["o| .| .| o| o| .| .| o|"], ["o| .|"], ["o| .| .| o| o| .| o|"], [".| .| o| o| o| o| .| .| o| o| o| o| o| o| o o o| .| .| .| o| o| o"], [".| .| o| o| o o o"], ["o o| o| .| o| o| o| o| o| o| o| o| o| o"], ["o| o o| o| o| o| o|"], [".| .| o| o| o| o| o| .| o| o| o| o| o| o o o| o|"], ["o o| o| o o| o"], ["o| .| o| .|"], ["o| o o| o|"], ["o| .| .| o|"], ["o| o| o| o| .| o| .|"], [".| .| o"], ["o| o| o| o| o| o| o| .| .| .| .|"], ["o| o o| o| .| .| o| o| o| o| o| .| o| o| o| o| o| o o o o o o o| o| o| o| o|"], ["o| o| o"], ["o| .| o| o| o| o|"], ["o| o| o| o o| o| o| o| o| o| o| .| o| .| o| o|"], [".| .| o| o| o| o"], ["o| o| .|"], ["o o| o| .| .| o| o| o| o| o| .| o| o| o| o| o| o| o| o"], ["o o| o| o o"], ["o| o| o| o| o| o| o| .| .| .| .| o| o|"], ["o| .| .| .| o| o| o o| o"], ["o| .| .| .| .| o| o|"], [".| .| o| o| .| .| o| o o| o| .| .| o| o| o| o| o| .| o| o| o| o| o| o o o o o o o| o| o| o| o| .| o| o|"], ["o o| o| .| .| o| o| o| o| o| o| o| o| o| o"], ["o o| .|"], ["o o o"], ["o o|"], [".| .| o| o| o| o| .| .| o| o| o| o| o| o| o o o| .| .| .| o| o|"], ["o o| o| .| o o| o| o"], ["o| o o|"], [".| .| o| o"], ["o| o| o| o| .| o|"], ["o o| o| o o o"], ["o o o o"], ["o| .| .| o| o| .| o"], [".| .| o| o| o| o| .| .| o| o| o| o o o"], ["o| o| o| o| o| o| o| o| o| .| .| .|"], ["o o| o| .| o| o| o| o| o| o| o| o"], ["o| o .| o| .|"], ["o| o| o| o| .| .| .| .| o| .| o| .|"], ["o .|"], [".| .| o o"], ["o| o| o| .| o| .| o| .|"], ["o| o .|"], [".| .| o| o| o| o| .| .| o| o| o| o| o| o| o o| .| .| .| o| o|"], ["o| .| .| o| o| o|"], [".| .| o| o| o| o| .| .| o| o| o| o| o o| o o o| .| .| .| o| o|"], [".| o"], [".| .| o .|"], [".| .| o| o| o|"], ["o| .| .| .| .| o| .| o| .|"], ["o| o| .| o|"], ["o| .| .| o| o| o| o| o| .|"], ["o| o| o| o| o| .| .| .| .| o| o|"], ["o| o| o| o| o o| o| o| o| o| o| o| .| o| .| o| o| o| o| o| o|"], ["o o o o| o o| o| o| .| .|"], ["o| .| o| .| .| o| .| .| o| .| o| .| o| .| o| .| .| o|"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], [".| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .|"], ["o o o| o o| o| o|"], ["o| o| o| o| o| o| o| o|"], [".| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .|"], [".| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o"], ["o o| o| o| o| o|"], ["o| o| o| o| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o|"], [".|"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], [".| .| .| .| o o o o o o o| o| o o o o o o o| o| o| .| .|"], ["o| .| o| .| .| o| .| .| o .| o| .| o| .| .| o|"], ["o| o| o| o| o| o| o| o"], ["o| o| o o| o| o"], ["o| o| o| o| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| o|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o"], ["o o o o o o| o| o| .| .|"], ["o o o| o| .| .|"], ["o o| o| o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], [".| .|"], ["o o| o o| o o| o o| o o| o o| o o| o| .|"], ["o| o o| o o| o| o|"], ["o o o| o| o|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o o| o o| o| o| .| .| o| o"], ["o| o| o o| o| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .|"], ["o o| o o| o o| o| o| .| .|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o"], ["o| o| o o o o o o o o o| o o o o o o o| o| o| .| .|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| o"], ["o| .| o| .| .| o| .| .| o| .| o| .| o| .| o| .| .| o"], [".| .| .| .| o o o o o o o o o| o| o| .| .|"], ["o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o| o| o| .| .|"], [".| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o o o o| o| o| .| .|"], ["o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o| o| o| .| .|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o| .| o"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o o| o| o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .| o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o"], ["o| o| o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o o| o| o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .| o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o| o o o o o o o| o| o| .| .| o|"], ["o o o| o o| o|"], ["o o| o| o o| o| o| .| .|"], ["o| o o| o o| o|"], ["o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o| o| o| .| .| o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o| o| o| .| .|"], [".| .| .| .| o o o o| o o o o| o o o o o o o| o| o| .| .|"], ["o o o| o o| o"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o| o| o| o| .| .| o"], ["o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o| o| o| .| .|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| o"], ["o o o| o|"], ["o o| .| .|"], ["o o| o| o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], ["o o| o| o| o o| o o| o o| o o| o o| o o| o o| .| .|"], ["o| o| o o o o o o o o o| o o o o o o| o| o|"], ["o o| o o| o o| o o| o| o o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], ["o| o o| .| .| o|"], ["o o| o o| o| o o o o o| o o o o o| o o o o o| o o o o o| o o o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| o o| o| o| o| o o| o| o| .| .|"], ["o| o| o o o o o o o o o| o o o| o o| o| o| o| o|"], ["o| o| o| o| o o| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| o|"], ["o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o| o o o o o o o| o| o| .| .|"], ["o o o o o|"], ["o o o o o o o o"], ["o o o| o| o .| .| .| .| o o| o .| o| o| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o| o| o| o| o o o o o o o o o o o o o o o o o o o o o o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o| o|"], ["o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o| o| .| .| .| .|"], ["o o o| o o|"], [".| o o| o o o| .| o o| o o o| o o o| o"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o| o| .| .| .| .|"], ["o o o| o"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o| o o| o| o| .| .| .| .|"], [".| .| .| .| o o o o o o o o| o o o o o o o| o| o .|"], ["o o o| o o"], ["o o| o o| o| o|"], [".| o| o| o| .| .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o o| o o o o o o o| o| o .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o| o o o o o o o| o| o .|"], ["o o| o o| o| o"], ["o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o| o o o o o o o| o| o .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o"], [".| .| .| .| o o o o o o o o| o o o o o| o o| o| o .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o| o o| o o o| o o o o o o o o| o o o o o o o| o| o .|"], ["o o| o o| o o| o o| o o| o o| o o| o| o o| o o| o o| o o| o o| .| .| .| .|"], [".| .| .| .| o o o o o o o o| o o o o o| o o| .|"], ["o o| o o| o|"], ["o o| o o| o o| o o| o o| o o| o| o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o| o| .| .| .| .|"], ["o o o| o .| .| .| .| o o o o o o o o| o o o o o o o| o| o"], [".| o o| o o o| .| o o| o o o| .| o o o| .| o o| o o o| o o o| o o o o o o o| o o o o o o o| o| o .|"], ["o o| o o| o"], [".| .| .| .| o o o o o o o| .| .|"], [".| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o| o o o o o o o| o| o| .| .|"], [".| o| o| o .|"], [".| .| .| .| o o o o o o o o| o o o| o .|"], ["o o o o| o|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o| o o o o o o o o| o .|"], ["o o| o o| o o| o o| o o| o o| o| o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o|"], [".| .| .| .| .| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o| o o o o o o o| o| o .| .| .|"], ["o o| o o| o o| o o| o o| o o| o| o| o o o| o .| .| .| .| o o o o o o o o| o o o o o o o| o| o o| o| .| .| .| .|"], [".| o o| o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o| o o o| o o o o o o o o| o o o o o o| o| o .|"], ["o o| o|"], [".| o o| o o o| .| o o| o o o| .| o o o o o o| o| o .|"], ["o o| o o| o o| o o| o o| o o| o| o| o o| o o| o o| o o| o o| o|"], ["o o o| .| o o| o o o| .| o o| o o o| .| o o| o o o|"], [".| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .|"], [".| .| .| .| o o| o o o o o o| o o o o o| o o| .|"], [".| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o| o o o o o o o| o| o| .| o o o| o"], [".| .| .| .| o o o o o o o o| o o o o o .|"], ["o o| o o| o o| o o| o o| o o o| o o| o o| o o| o o| o o| o|"], ["o| o o"], [".| .| .| .| o o o o o o o| o o o o o o o| o| o| .| .|"], ["o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o .| .| .| .| .| .| .| .| o o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o o o| o o o o o o o| o"], [".| .| .| .| .| .| .| .| o| o o o o o o o| o o o o o o o| o| o| .| .| o o o o o o| o o o o o o o| o| o| .| .|"], ["o o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| o o| .| .| .| .|"], [".| o o| o o o| .| o o| o o o o| o .|"], [".| .| .| .| .| .| .| .| .| .| .| .| .| .| .| .|"]], "completion": "\ndef parse_music(music_string: str) -> List[int]:\n return [4 if note == 'o' else 2 if note == 'o|' else 1 for note in music_string.split()]\n", "raw_completion": "```python\ndef parse_music(music_string: str) -> List[int]:\n return [4 if note == 'o' else 2 if note == 'o|' else 1 for note in music_string.split()]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef parse_music(music_string: str) -> List[int]:\n \"\"\" Input to this function is a string representing musical notes in a special ASCII format.\n Your task is to parse this string and return list of integers corresponding to how many beats does each\n not last.\n\n Here is a legend:\n 'o' - whole note, lasts four beats\n 'o|' - half note, lasts two beats\n '.|' - quater note, lasts one beat\n\n >>> parse_music('o o| .| o| o| .| .| .| .| o o')\n [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} {"task_id": "HumanEval/18", "prompt": "\n\ndef how_many_times(string: str, substring: str) -> int:\n \"\"\" Find how many times a given substring can be found in the original string. Count overlaping cases.\n >>> how_many_times('', 'a')\n 0\n >>> how_many_times('aaa', 'a')\n 3\n >>> how_many_times('aaaa', 'aa')\n 3\n \"\"\"\n", "entry_point": "how_many_times", "canonical_solution": "\n\n occurences = 0\n for i in range(len(string)):\n if string[i:].startswith(substring):\n occurences += 1\n return occurences\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('', 'x') == 0\n assert candidate('xyxyxyx', 'x') == 4\n assert candidate('cacacacac', 'cac') == 4\n assert candidate('john doe', 'john') == 1\n", "contract": "\n assert isinstance(string, str) and isinstance(substring, str), \"invalid inputs\" # $_CONTRACT_$\n assert substring != \"\", \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["", "x"], ["xyxyxyx", "x"], ["cacacacac", "cac"], ["john doe", "john"]], "atol": 0, "plus_input": [["ababa", "aba"], ["abcdefg", "efg"], ["abababab", "aba"], ["hello world", "o"], ["aaaabbbbcccc", "bb"], ["12211221122", "122"], ["racecar", "car"], ["mississippi", "ss"], ["thequickbrownfox", "fox"], ["fizzbuzz", "zz"], ["aaaabbbbccccc", "bb"], ["bbb", "bb"], ["zz", "bbb"], ["122", "zz"], ["bb", "bb"], ["misracecarsissippi", "ss"], ["abababab", "fox"], ["e", "e"], ["thequickbrownfox", "thequickbrownfox"], ["bb", "thequickbrownfox"], ["fizzbuzz", "fizzbuzz"], ["122", "12mississippi2"], ["aaacarabbbbcccc", "efg"], ["hello world", "fox"], ["ababa", "ababa"], ["fizzbuzz", "fizzzbuzz"], ["12mississippi2", "efg"], ["hello worrld", "ababao"], ["thebquickbrownfox", "thequickbrownfox"], ["aaacarabbbbcccc", "aaacabrabbbbcccc"], ["zz", "ababao"], ["thequickbrrownfox", "thequickbrrownfox"], ["hello woorrld", "abaabaaoo"], ["aaaabbbbcccc", "thequickbrownfox"], ["abababab", "hello woorrld"], ["zz", "efhello worrldssg"], ["fiuzzbuzz", "efg"], ["aaaabbbcbcccc", "hello woorrld"], ["bb", "bssb"], ["zz", "zz"], ["12hello woorrld", "zz"], ["bbaaaabbbcbcccc", "bssb"], ["sss", "sefhello worrldssgs"], ["fiuzzbuzz", "aaaabbbbccccc"], ["efg", "hello woorrld"], ["ababathequickbrownfox", "abaaba"], ["efgg", "12mtheqabaabaaoouickbrrownfoxississippi2"], ["bb", "mississippababao"], ["fizzbuzz", "fizzzbbbzz"], ["sss", "sfizzzbbbzzss"], ["ccar", "rccar"], ["efg", "abaabaabcdefg"], ["bbaaaabbbcbccc", "bbb"], ["hello world", "oo"], ["fizzbuz", "zzz"], ["aaaabbbcbcccc", "aaaaabbbcbcccc"], ["hello lwoorrld", "hello lwoorr"], ["eg", "egccarfiuzzbuzz"], ["12211221122", "1222"], ["efg", "efg"], ["ss", "ssfizzzbbbzzsss"], ["zz", "zzz"], ["s1222bssbs", "s1222bssbbs"], ["12hello woo1rrcarld", "zz"], ["hello worrlod", "ababao"], ["sfizabaabazbbbzzss", "sfizabaabazbbbzzsabcdefg"], ["ezzbuzz", "essfizzzbbbzzssszzbuzz"], ["zz", "zmississippababaoz"], ["mississiezzbuzzpi", "ss"], ["eg", "eg"], ["abababab", "ab"], ["12hello woorrld", "zzz"], ["efgbbaaaabbbcbcccc", "efgbbaaababbbcbcccc"], ["hello woorrld", "hello worldaaacarabbbbcccc"], ["aba", "aba"], ["ef12mtheqabaabaaoouickbrrownfoxississippi2g", "effg"], ["ezzbuzz", "efg"], ["cgareg", "careg122"], ["122bbaaaabbbcbcccc11221122", "1221122112aaaabbbcbcccc2"], ["sefhello worrldssgs", "aaaaabbbcbcccc"], ["fiuababathequickbrownfoxzzbuzz", "fiuizzbuzz"], ["zzz", "z"], ["fizzbuzz", "effg"], ["caregsfizabaabazbbbzzss122", "cggareg"], ["fiuzzbuzz", "egfg"], ["hellol lwoorr", "hellol lw"], ["12mtheqabaabaaoouickbrrownfoxississippi2", "efgg"], ["12hello whello lwoorroorrld", "zabababab"], ["zz", "zzzz"], ["hello lwoorr", "zz"], ["efg", "effizzbuzzfg"], ["efg", "egfg"], ["zef12mtheqabaabaaoouickbrrownfoxississippi2gz", "zz"], ["hello woorrld", "whello woorrld"], ["thequickbrownfox", "thequickbrownracecarfox"], ["bb", "thequickbrownracecarfoxbbb"], ["fiessfizzzbbbzzssszzbuzzuababathequickbrownfoxzzbuzz", "fiuizzbuzz"], ["bbaaaabbbcb12hello whello lwoorroorrldcccc", "bssb"], ["therbquickbrownfox", "thequickbrownfox"], ["bbaaaabbbcbccc", "oo"], ["aaaaabbbbaaaa", "aaa"], ["abcdefghijklmnopqrstuvwxyzabc", "abc"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "ipsum"], ["The quick brown fox jumps over the lazy dog.", "the"], ["aaaaaaaabaaaaaaa", "ba"], ["banana", "ana"], ["cacccccac", "cac"], ["fofofofofofofof", "of"], ["racecarapenapapayapineapple", "ap"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAAAA"], ["dog.", "ap"], ["aaabrownaaaa", "aaaaabbbbaaaa"], ["The quicfoxk brown fox jumps over the lazy dog.", "the"], ["The quick brown fox jumps over the lazy dog.", "foipsumx"], [".dogfox.", "dogfox."], ["Lorem ipsum dolor sit amet, consetctetur adipiscing elit.", "ipsum"], ["ba", "aaaaadogfox.aa"], ["quickraceacarapenapapayapineapple", "quickracecarapenapapayapineapple"], ["AAAAAAA", "ap"], ["The quick brown fox jumps over the lazy dog.", "aaaaofabbbbtheaaaa"], ["the", "the"], ["The quick brown fox jumps over the lazy dog.", "aaaaofabbbbtheaelit.aaa"], ["aaaaaaaabaaaabrownaaaaaaaaaa", "ba"], ["abc", "abc"], ["quicfox", "ba"], ["sit", "sit"], ["The quick brown fox jumps over the lazy dog.", "The quick brown fox jumps over the lazy dog."], ["gg.", "dog."], ["cac", "cac"], ["quickraceacarapenapapayapineapple", "quickraceacarapenapapayapineapple"], ["amlazyet,", "ba"], ["cacccccac", "cacc"], [".dogfox.", "quickcfoxk"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["quicfoxcacccccac", "quicfoxcacccccac"], ["aaabrownaaaa", "over"], ["The quicfoxk brown fox jumps over the lazy dog.", "cacccccac"], ["cacccccac", "The quick brown fox jumps over the lazy dog."], ["cacccccaac", "cac"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "quickraceacarapenapapayapineapple"], ["the", "The quick brown fox jumps over the lazy dog."], ["The quicfoxk brown fox jumps over the lazy dog.", "The quick brown fox jumps over the lazy dog."], ["AAAAAAA", "foipsuconsecteturmx"], ["AAAAA", "abc"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["ataaaaaaaabaaaabrownaaaaaaaaaa", "thequickracecarapenapapayapineapple"], ["AAAAA", "elit."], ["taaaaofabbbbtheaelit.aaahe", "The quick brown fox jumps over the lazy dog."], ["The quick brown fox jumps over the lazy dog.", "brown"], ["baccac", "cacccccac"], ["ccccacc", "cacc"], ["cacccccaac", "quickraecarapenapapayapineapple"], ["taaaaofabbe", "ccccacc"], ["amet,", "cac"], ["consectetur", "ataaaaaaaabaaaabrownaaaaaaaaaa"], ["taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe", "taaaaofabbbbtheaelit.abrownaahe"], ["ap", "of"], ["quicaccfox", "ba"], ["The quicfoxk brown fox jumps over the lazy dog.", "cacccccacipsum"], ["quickraceacarapenapapayapineapple", "eapple"], ["Lorem ipsum dolor sit amet, consetctetur adipiscing elit.", "ielit.psum"], ["aaabrownaaaa", "aaabrownaaaa"], ["aaaaadogfox.aa", "ccccacc"], ["consectetur", "consectetur"], ["over", "over"], [".dogfox", "dogfdox."], ["abcdefghijklmnopqrstuvwxyzabc", "quickraceacarapenapapayapineapple"], ["foipsumx", "foipsumx"], ["aaaaaaaabaaaabrownaaaaaaaaaa", "aaaaaaaabaaaabrownaaaaaaaaaa"], ["ipsum", "ipsum"], ["consectetur", "consecur"], ["foipsumx", "cacccccaac"], ["aaaaathequickracecarapenapapayapineapplerownaaaaaaaaaa", "ba"], ["b", "b"], ["sit", "foipsuconsecteturmx"], ["aaAAAAAaaaaaabaaaabrownaaaaaaaaaa", "ba"], ["foipsuconsecteturmx", "foipsuconsecteturmx"], ["aaAAAAAaaaaaabaaLorem ipsum dolor sit amet, consectetur adipiscing elit.aaaaaaaa", "ba"], ["eapple", "ap"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "AAAAAAA"], ["bThe quick brown fox jumps over the lazycacccccacipsum dog.a", "bThe quick brown fox jumps over the lazy dog.a"], ["c", "cac"], ["amlazyet,", "amlazyet,"], ["bThe quick brown fox jumps over the lazy dog.a", "banana"], ["consectetur", "quickraceacarapenapapayapineapple"], ["cacccccac", "cacbaaaaofabbbbtheaelit.aaaa"], ["aaaaaaaabaaaaaaa", "jumps"], ["ccccacc", "ccccacc"], ["Lorem ipsum dolor sit amt, consectetur adipiscing elit.", "ipsum"], ["quicfoxcaccccccac", "quicfoxcacccccac"], ["abcdefghijklmnopqrstuvwxsityzabc", "abc"], ["bb", "bba"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "cac"], ["AAAAA", "AAAAAAAA"], ["banana", ".dogfox."], ["quicaccfox", "quicaccfox"], ["abcdefghijklmnopqrstuvwxsvityzabct", "abcdefghijklmnopqrstuvwxsityzabct"], ["foipsumx", "abcdefghijklmnopqrstuvwxyzabc"], ["AAA", "ipsum"], ["cacccccac", "caac"], ["bbb", "bbbb"], ["Lorem ipsum dolor sit amt, consectetur adipiscing elit.", "cacccccaac"], ["taaaaofabcacccccacipsumbbbtheaelit.aaahe", "The quick brown fox jumps over the lazy dog."], ["Lorem ipsum dolor sit amet, consetctetur adipiscing elit.", "The quick brown fox jumps over the lazy dog."], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "quickraceacarapenapapayapineapple"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "abcdefghijklmnopqrstuvwxsvityzabct"], ["aaabbaaabbbbaaaa", "aaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa"], ["laz", "lazy"], ["caac", "cacccccac"], ["foipsuconsequickcfoxkurmx", "AAAAAAA"], ["bana", "thequickracecarapenapapayapineapple"], ["ipoversum", "aaaaadogfox.aa"], ["foipsuconsequickcfoxkurmx", "foipsuconsecteturmx"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "amt,"], ["aaaaadogfLoremox.aa", "ccccacc"], ["quicfoxcacccccacc", "quicfoxcacccccacc"], ["The quicfoxk brown fox jumps over the lazy dog.", "quicaccfox"], ["thequickracecarapenapapayapineapple", "aaaaabbbbaaaa"], ["over", "aaaaabbbbaaaa"], ["b", "cac"], ["eapple", ".dogfox."], ["consecur", "aaAAAAAaaaaaabaaaabrownaaaaaaaAaaa"], ["quickraceacarapenapapayapineapple", "eaAAApple"], ["bba", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["aaaaathequickracecarapenapapayapineapplerownaaaaaaaaaa", "bbaba"], ["aap", "ap"], ["abcdefghijklmnopqrstuvwxsityzabc", "The"], ["amlazyet,", "amlazyety,"], ["ccccacc", "cacac"], ["banaipsum", "thequickracecarapenapapayapineapple"], ["ccaccccccac", "caccccccac"], ["bana", "cquicfoxkacc"], ["ovlazycacccccacipsumer", "over"], ["bLorem ipsum dolor sit amet, consetctetur adipiscing elit.a", "ba"], ["cacccccac", "aaaaabbbbaaaa"], ["bb", "cac"], ["aaaaadogfox.aa", "aaaaadogfox.aa"], ["foipsumx", "abcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabc"], ["bbaccac", "cacccccac"], ["ataaaaaaaabaaaabrownaaaaaaaaaa", "aaabrownaaaa"], ["cacbaaaaofabbbbtheaelit.aaaa", "cacccccacipsum"], ["fofofofofofofofaaabrownaaaa", "oof"], ["amlazyety,", "amlazyety,"], ["taaaaofabbbbtheaelit.aaahbThee", "taaaaofabbbbtheaelit.aaahe"], ["amet,", "AAAAA"], ["over", "dog."], ["aaAAAAAaaaaaabaaLorem", "quicfox"], ["oveamt,", "dog."], ["tAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "cacccccac"], ["tAAAAAAAAAAAbanaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "quickraceacarapenapapayapineapple"], ["ovlazycacccccacipsumer", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["cacbaaaaofabbbbtheaelit.aaaa", "aap"], ["The quick brown fox jumps over the lazy dog.", "sit"], ["consectetur", "bLorem ipsum dolor sit amet, consetctetur adipiscing elit.aconsecur"], ["dog.", "dog."], ["aaaamt,", "amt,"], ["cacbaaaaofabbbbtheaelit.aaaa", "cacbaaaaofabbbbtheaelit.aaaa"], ["AAAAAAA", "AAAAAAA"], ["bb", "sit"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAadipiscingAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["qLoremuicaccfox", "ba"], ["taaaaofabbe", "celit.acccacc"], ["baccac", "ccacccccac"], ["aaaamt,", "cacccccacamt,"], ["cacccccac", "cacccccac"], ["caac", "caac"], ["ap", "quick"], ["quicaccfox", "aa"], ["Lorem ipsum dolor sit amet, consetctetur adipiscilng elit.", "Lorem ipsum dolor sit amet, consetctetur adipiscilng elit."], ["thequickracecarapenapapayaquicfoxcacccccaccpineapple", "thequickracecaraaaapenapapayaquicfoxcacccccaccpineapple"], ["dogovlazycacccccacipstAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABheumer.", "over"], ["abcdefghijklmnopqrstuvwxyzabc", "oever"], [".dogfox.", "quicfoxcacccccacc"], ["AAAAA", "ba"], ["banana", "bbaba"], ["fofofofofofofofaaabroaaAAAAAaaaaaabaaaabrownaaaaaaaaaaaaaa", "oof"], ["consectetur", "The"], ["AAA", "cac"], ["dog.a", "epjs"], ["ipoccccaccversum", "aaaaadogfox.aa"], ["aap", "cacbaaaaofabbbbtheaelibLoremaaaa"], ["ataaaaaaaabaaaabrownaaaaaaaaaa", "The quicfoxk brown fox jumps over the lazy dog."], ["amt,", "sit"], [".dogfox", "dogfox."], ["Lorem ipsum dolor sit amet, consetctetur adipiscing eliot.", "ipsum"], ["cac", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["taaaaofabbbbtheaelit.aaahbThee", "quickraceacarapenapapayapineapple"], ["AAAAAAA", "AAAAAA"], ["elit.a", "foipsuconsequickcfoxquicfoxcaccccccackurmx"], ["consecteur", "ataaLorem ipsum dolor sit amet, consetctetur adipiscing elit.aaaaaabaaaabrownaaaaaaaaaa"], ["cquicfoxkacc", "quick"], ["AAAAAA", "AAAAAAAA"], ["AAA", "bbelit.a"], ["Lorem ipsum dolor sit amet, consetctetur aditamet,piscing elit.", "quicaccfoxsit amet, consetctetur adiamet,piscing elit."], ["The quicfoxk brown fobbaccacx jumps over the lazy dog.", "The quick brown fox jumps over the lazy dog."], ["aaaaabbbbaaaa", "aaaaabbbbaaaa"], ["fofoothequickracecarapenapapayapineapplefoofof", "of"], ["The quicfoxamlazyet,k brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumups over the lazy dog.", "The quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dog."], ["foipsuconsecteturmx", "foataaLorem ipsum dolor sit amet, consetctetur adipiscing elit.aaaaaabaaaabrownaaaaaaaaaaipsuconsecteturmx"], ["quicfoxcacccccac", "cacccccac"], ["cac", "cafoipsuconsecteturmxc"], ["foipsumx", "abcdefghijklmnopqrstuvwxsvityzabct"], ["the", "AAAAAA"], ["tAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "aaaaabbbbaaaa"], ["ba", "ba"], ["cacccccacamt,", "Lorem ipsum dolor sit amet, consetctetur adipiscing elit."], ["quicfoxcacccccacc", "quicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dog.oxcacccccacc"], ["cacccccaac", "cacc"], ["quicaccfox", "elit.a"], ["bba", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["consectetur", "consuecur"], ["ccccacc", "fofofofofofofof"], ["dogovlazycacccccacipstAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABheumer.", "fofofofofofofofaaabroaaAAAAAaaaaaabaaaabrownaaaaaaaaaaaaaa"], ["etaaaaofabbe", "taaaaofabbe"], ["anab", "ana"], ["boverb", "sit"], ["ovlazycacccccer", "over"], ["fobccacx", "aaAAAAAaaaaaabaaaabrownaaaaaaaAaaa"], ["gg.", "dodg."], ["aquicaccfoxsit amet, consetctetur adiamet,piscing elit.et,", "amet,"], ["quickcfoxk", "qLoremuicaccfox"], ["taaaaobfabbbbtheaelit.aaahe", "TThe quick brown fox jumps over the lazy dog.he quick brown fox jumps over the lazy dog."], ["Lorem ipsum odolor sit amet, consetctetur adipiscing elit.", "Lorem ipsum dolor sit amet, consetctetur adipiscing elit."], ["Thconsecteture", "The"], ["bba", "aaaaathequickracecarapenapapayapineapplerownaaaaaaaaaa"], ["AAA", "ap"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "ipsu"], ["quicfoxacccccac", "quicfoxcacccccac"], ["aaabrownaaaaa", "over"], ["aaAAAAAaaaaaabaaaabrownaaaaaaaaaa", "foataaLorem"], ["cccacc", "cccquicfoxcacccccaccacc"], ["aaabbThe quicfoxamlazyet,k brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumups over the lazy dog.aabbbbaaaa", "ccacccccac"], ["caccccc", "cacc"], ["AAAAAAA", "aap"], ["cafkoipsuconsequickcfoxkurmxcac", "cafoipsuconsequickcfoxkurmxcac"], ["quickcfoxk", "quickcfoxk"], ["aaaamt,", "aaaamt,"], ["dodg.", "abc"], ["AA", "Lorem ipsum dolor sit amet, consetctetur adipiscilng elit."], ["abc", "ab"], ["aaaaababbbaaaa", "aaa"], ["abcdefghijklmnopqrstuvwxsityzabc", "abcdefghijklmnopqrstuvwxsityzabc"], ["aaabrownaaaaa", "aaabrownaaaa"], ["fofofofofofofof", "AAAAAAAthequickracecaraaaapenapapayaquicfoxcacccccaccpineappleAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["eliot.", "ap"], ["cccacc", "ccaccccccac"], ["Lorem ipsum dolor sit amet, consetctetur adipiscilang elit.", "dolor"], ["aaaabrownaaaa", "aaabrownaaaa"], ["quuicaccfox", "elit.a"], ["quickraceacarapenapapayapineapplee", "quickraceacarapenapapayapineapple"], ["cac", "cacccccaac"], ["brothequickraAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABcarapenapapayaquicfoxcacccccaccpineapplewwn", "brothequickracecarapenapapayaquicfoxcacccccaccpineapplewwn"], ["gg", "brownfoipsuconsequickcfoxquicfoxcaccccccackurmx"], ["amet,", "aemet,"], ["caacc", "caac"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "AAA"], ["brothequickraAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAelit.aaaaaabaaaabrownaaaaaaaaaaipsuconsecteturmxAAAAAAAAAAAAAAAABcarapenapapayaquicfoxcacccccaccpineapplewwn", "brothequickraAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABcarapenapapayaquicfoxcacccccaccpineapplewwn"], ["o.dogffox", "aaaaofabbbbtheaaaa"], ["foipsuconsecteturmx", "faaaaaaaabaaaaaaaoiconsecteturmx"], ["foipsumx", "eaAAApple"], ["dog.he", "consuecur"], ["racecarapenapapayapineapple", "quickcfoxk"], ["dodg.", "b"], ["bbc", "cacccccac"], ["elit.aconsecur", "bbbbquicfoxcacccccacap"], ["brown", "brown"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["foipsuconsecteturmx", "faaaaaaaabaaaaoiconsecteturmx"], ["thequickracecaraaaapenapapayaquicfoxcacccccaccpineapple", "quickracecarapenapapayapineapple"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhAAAAAAAAAAAAAABhe"], ["The qfoxuick brown fox jumps over the lazy dog.", "The quick brown fox jumps over the lazy dog."], ["of", "brown"], ["fmoipsumx", "foipsumx"], ["elit.aconsecur", "ab"], ["amlazyetquicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccThconsectetureccccackurmx fox jumps over azy dog.oxcacccccacc", "amlazyetquicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dog.oxcacccccacc"], ["ovver", "oveThe quicfoxk brown fobbaccacx jumps over the lazy dog.r"], ["cacccc", "caac"], ["amt,", "aaabrownaaaa"], ["Lorem ipsum dolor sit amet, consetctetur adipiscing elit.", "Lorem ipsum dolor sit amet, consetctetur adipiscing elit."], ["tAAAAAAAAAAdolorAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["The quick brownn fox jumps over the lazy dog.", "the"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAadipiscingAAAAAAAAAAAAAAAAAAAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAadipiscingAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["quickraceacarapeabcnapapayapineapple", "eapple"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABhe", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABhe"], ["cacccccacccac", "cacc"], ["baditamet,piscinga", "quicaccfox"], ["etaaaaofabbe", "etaaaaofaeapplee"], ["ipsu", "cacc"], ["elit.aconsecur", "elit.aconsecur"], ["foipsumx", "cfofoothequickracecarapenapapayapineapplefoofofacccccaac"], ["ccaccccccac", "ccaccccccac"], ["foipsuconsecamlazyety,teturmx", "foipsuconsecteturmx"], ["aaaabrownaaaa", "brown"], ["elit.aaaaaaaa", "quicfox"], ["etaaaaofaeapplee", "The quick brown fox jumps over the lazy dog."], ["oveamt,", "aemet,"], ["foipsuconsecteturtmx", "foipsuconsecteturtmx"], [".cafoipsuconsecteturmxcdogfox.", ".dogfox."], ["aaaaabbbbaaaa", "aaaaabbbbaaaaa"], ["gg.", "Thconsecteture"], ["aaAAAAAaaaaaabaaaabrownaaaaaaaAaaa", "cacccccac"], ["taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe", "taaaaofabbbcfofoothequickracecaracaaccpenapapayapineapbbaccacplefoofofacccccaacbtheaelit.abrownaahe"], ["bannana", "banana"], ["cacccccc", "cacc"], ["dog.r", "cquicfoxkacc"], ["ba", "abcdefghijklmnopqrstuvwxyzabc"], ["cacccccacipsum", "cacccccacipsum"], ["sist", "sist"], ["cafoipsuconsequickcfoxkurmxcac", "cafoipsuconsequickcfoxkurmxcac"], ["bLorem ipsum dolor sit amet, consetctetur adipiscing elit.a", "bThe quick brown fox jumps over the lazycacccccacipsum dog.a"], ["laz", "cacccccacipsum"], ["caccccccaac", "cacccccaac"], ["ovvr", "ovver"], ["foipsucAAAAAx", "foipsuconsecteturtmx"], ["foipsuconsecteturmx", "aquicaccfoxsit"], ["quicfoxcacccccocac", "quicfoxcaccccThe quicfoxk brown fox jumps over the lazy dog.cac"], ["bbbbquicfoxcacccccacap", "bbbbquicfoxcacccccacap"], ["bbb", "oever"], ["taaabbaaabbbbaaaahe", "the"], ["browwn", "brown"], ["Lorem", "banana"], ["foipsuconsecteturmx", "fquickcfoxkaaaaaaaabaaaaoiconsecTThe quick brown fox jumps over the lazy dog.he quick brown fox jumps over the lazy dog.teturmx"], ["eappleThe qfoxuick brown fox jumps over the lazy dog.", "The qfoxuick brown fox jumps over the lazy dog."], ["quicaccfoxsit amet, consetctetur adiamet,piscing elit.", "quicaccfoxsit amet, consetctetur adiamet,piscing telit."], ["acaac", "caac"], ["ataaaaaaaabaaaabrownaaaaaaaaaa", "thequickracelcarapenapapayapineappl"], ["quicfoxdolor", "The"], ["ccaccccccac", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["ipsu", "sit"], ["caac", "ba"], ["baccac", "baccac"], ["caaaabrownaaaaac", "ccccacc"], ["Lorem ipsum dolor sit amet, consectetur adip.iscing elit.", "Lorem ipsum dolor sit amet, consectetur adipiscing elit."], ["faaaaaaaabasecteturmx", "faaaaaaaabasecteturmx"], ["dog.aaaaaofabbbbtheaaaa", "epjs"], ["browwn", "browwn"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "thequickracecaraaaapenapapayaquicfoxcacccccaccpineapple"], ["racecarapenapapayapineapple", "racecarapenapapaeyapineapple"], ["oof", "bThe quick brown fox jumps over the lazy dog.a"], ["Lorem ipmet, consectetur adip.iscing elit.", "Lorem ipsum dol adipiscing elit."], ["amet,", "aemaditamet,piscing"], ["aquicaccfoxsit amet, consetctetur adiamet,pistcing elit.et,", "amlazyet,"], ["caccccccacac", "cacccccacac"], ["quickcfoxk", "quic"], ["aaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa", "ana"], ["ccabbbccccccac", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["brothequirckracecarapenapapayaquicconsetcteturfoxcacccccaccpineapplewwn", "brothequickracecarapenapapayaquicfoxcacccaaaaofabbbbtheaelit.aaaccaccpineapplewwn"], ["AAAAAA", "sist"], ["dol", "a"], ["aaaamt,", "racecarapenapapayapineapple"], ["fofoothequickracecarapenapapayapineapplefoofof", "abcdefghijklmnopqrstuvwxsvityzabct"], ["dog.a", "cacc"], ["taaaaofoipsumxfabbbbtheaelit.aaahe", "The quick brown fox jumps over the lazy dog."], ["aaAAAAAaaaaaabaaaabrownaaaaaaaaaaa", "quicfoxamlazyet,k"], ["cacccccacccac", "banana"], ["quicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dog.oxcacccccacc", "cacccccacccac"], ["foipsruconsecteturmquicfoxcaccccccacx", "foipsuconsecteturmquicfoxcaccccccacx"], ["elit.aaaaaaa", "consectetur"], ["dogfdox.", "quickraceacarapenapapayapineapple"], ["dog.", "gdog."], ["qLoremuicaccfox", "of"], ["Lor", "Lorem"], ["aaabrowanaaaa", "aaabrowanaaaa"], ["caccccaaataaLoremc", "caccccaaataaLoremc"], ["ccafkoipsuconsequickcfoxkurmxcac", "ccafkoipsuconsequickcfoxkurmxcac"], ["banana", "g.dogfox."], ["AquicfoxAAAAA", "cafkoipsuconsequickcfoxkurmxcac"], ["cacccccc", "aaaaofabbbbtheaelit.aaa"], ["faaaaaaaabaaaaoiconsecteturmx", "foipsucoonsecteturmx"], ["adipiscingcor", "taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe"], ["quiickraecarapenapapayapineapple", "quickraecarapenapapayapineapple"], ["LLorem ipsum dolobanar sit amt, consectetur adipiscing elit.or", "LLorem ipsum dolobanar sit amt, consectetur adipiscing elit.or"], ["cccquicfoxcacccccaccacc", "b"], ["banna", "anna"], ["cactAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhAAAAAAAAAAAAAABheccc", "cactAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhAAAAAAAAAAAAAABheccc"], ["ieliLorem ipsum dol adipiscing elit.t.psum", "ielit.psum"], ["bananna", "bThe quick brown fox jumps over the lazy dog.a"], ["vvr", "vvr"], ["The quick brown fox jumps over the lazy dog.", "The quick brown fox jumps ovefr the lazy dog."], ["taaaaofabbbbtheaelit.aaahbThee", "tAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe"], ["aaabrowanaaaa", "aaaabrowanaaaa"], ["ovver", "sit"], ["aqeuicaccfoxsit amet, consetctetur adiamet,pistcing elit.et,", "aquicaccfoxsit amet, consetctetur adiamet,pistcing elit.et,"], ["aaaaabbbbaaaaa", "aaaaabbbbaaaa"], ["thequickracelcarapenapapayapineappl", "the"], ["", "adipiscilang"], ["tAAAAAAAAAAAAAAapAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "c"], ["Lorem ipsum dol adipiscing elit.", "Lorem ipsum dol adipiscing elit."], ["LLorem ipsum dolobanar sit amt, consectetur adipiscing elit.or", "Lorem ipsum dol adipiscing adip.iscingit."], ["fofoothequickracecarapenapapayapineapplefoofof", "abcdeuvwxsvityzabct"], ["Lorem ipsum dolor sit amet, consetctetur adipiscilng eolit.", "Lorem ipsum dolor sit amet, consetctetur adipiscilng elit."], ["aquicaccfoxsit amet, consetctetur adiamet,piscing elit.et,", "bba"], ["consecttetur", "The"], ["fofoothequickracecarapenapapayapineapplefoofof", "oabcdefghijklmnopqrstuvwxsvityzabctf"], ["b", "bbbb"], ["amet,", "aemaditametn,piscing"], ["aemet,", "aemet,"], ["dooveamt,dg.", "dodg."], ["Lorem ipsum dolor sit amet, consetcteadipiscilangtur adipiscing elit.", "Lorem ipsum dolor sit amet, consetctetur adipiscing elit."], ["etaaaaaofabbe", "etaaaaofabbe"], ["abcc", "abcc"], ["bananna", "bananna"], ["faaaaaaaabasecteturmx", "aaabrowanaaaa"], ["quickraceacarapenapapayapineapple", "quickraceacarapenapapayapineappple"], ["dolor", "Lorem ipsum dol adipiscing elit."], ["Lorem ipmet, consectetur adip.iscing elit.", "Lorem ipmet, consectetur adip.iscing elit."], ["taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe", "taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe"], ["aaaaoaaabbThefabbbbtheaelit.aaa", "cacccccc"], ["aaabbaaabbbbaaaa", "browwn"], ["ipsum", "quicbbbbquicfoxcacccccacapk"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "quickraceacarapenapapayapineapelit.t.psumple"], ["aaaaabbbbaaaa", "aacaccccccacacaaabbbbaaaaa"], ["quuicaccfox", "faaaaaaaabasecteturmx"], ["abcdefghijklmnopqrstuvwxyzabc", "quicfoxcacccccacc"], ["abcc", "elit.aconsecur"], ["browwn", "etaaaaaofabbe"], ["foipsucaaabbaaabbbbaaaaonsecteturmx", "foataaLorem ipsum dolor sit amet, consetctetur adipiscing elit.aaaaaabaaaabrownaaaaaaaaaaipsuconsecteturmx"], ["dogetaaaaofaeapplee.cac", "dog.cac"], ["dolor", "ana"], ["laz", "laz"], ["banaipsum", "acaadog.rc"], ["thte", "the"], ["bThe quick brown fox jumps over the lazycaccoveamt,cccacipsum dog.a", "bThe quick brown fox jumps over the lazycaccoveamt,cccacipsum dog.a"], ["LLorem ipsum dolobanar sit amt, consectetur adipiscing elit.or", "aemaditametn,piscing"], ["caacc", "abcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabc"], ["AA", "AA"], ["caaaabrownaaaaac", "aaaaathequickracecarapenapapayapineapplerownaaaaaaaaaa"], ["cquicfoxkacc", "dog.r"], ["banaana", "banaacaccccccacacaaabbbbaaaaaana"], ["quicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dog.oxcacccccacc", "bThe quick brown fox jumps over the lazycacccccacipsum dog.a"], ["AAA", "bThe quick brown fox jumps over the lazycaccoveamt,cccacipsum dog.a"], ["caaaabrownaaaaaac", "aaaaathequickracecarapenapapayapineapplerownaaaaaaaaaa"], ["LLorem ipsum dolobanar sit amt, consectetur adipiscing elit.or", "taaaaofoipsumxfabbbbtheaelit.aaahe"], ["fobccacx", "taaaaobfabbbbtheaelit.aaahe"], ["cacbaaaaofabbbbtheaelibLoremaaaa", "Lorem ipsum dolor sit amet, consetctetur aditpiacaacscilang elit."], ["caccccc", "AA"], ["The quicfoxk brown fox jumpxs over the lazy dog.", "quicaccfoxsit"], ["acaagdog.rc", "acaadog.quickraceacarapeabcnapapayapineapplerc"], ["bbbb", "bbbb"], ["dog.aaaaaofabbbbtheaaaa", "ovvr"], ["adiamet,piscing", "bannana"], ["ccaac", "caac"], ["cacccccac", "cacccccacipsum"], ["eielit.psumfabbe", "etaaaaofaeapplee"], ["aquicaccfoxsit amet, consetctetur adiamet,piscing elit.et,", "bThe quick brown fox jumps over the lazycacccccacipsum dog.a"], ["racecarapernapapayapineapple", "racecarapernapapayapineapple"], ["tAAAAAAquicfoxAAAAAeAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABhe", "aaaaabbbbaaaa"], ["a", "AAAAAA"], ["bbelit.a", "acaadog.rc"], ["bThse quick brown fox jumps over the lazycaccoveamt,cccacipsum dog.a", "bThse quick brown fox jumps over the lazycaccoveamt,cccacipsum dog.a"], ["bba", "quicfox"], [".cafoipsuconfobbaccacxsecteturmxcdogfox.", ".cafoipsuconsecteturmxcdogfox."], ["ccabcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabcccacc", "fofofofofofofof"], ["browbwn", "browwn"], ["aaaaamt,", "bbc"], ["banaana", "aaa"], ["bbbbb", "bbbb"], ["banaipsum", "banaipsum"], ["dogovlazycaccccAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABheumer.", "dogovlazycacccccacipstAAAAAAquicfoxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABheumer."], ["abcc", "aabcc"], ["anab", "adiamet,pistcing"], ["cacccccaac", "cacccccaac"], ["caacccccac", "caacccccac"], ["aap", "aaabbThe quicfoxamlazyet,k brownfoipsucolnsequickcfoxquicfoxcaccccccackurmx fox jumups over the lazy dog.aabbbbaaaaaap"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABcacccccaac", "caac"], ["quicfoxcacccccac", "racecarapenapapaeyapineapple"], ["aaAAAAAaaaaaabaaaabrownaaaaaaaaaa", "quickcfoxk"], ["foipsumx", "dodg."], ["fofofofofofofofaaabroaaAAAAAaaaaaabaaaabrownaaaaaaaaaaaaaa", "fofofofofofofofaaabroaaAAAAAaaaaaabaaaabrownaaaaaaaaaaaaaa"], ["abcdefghijklmnopqrstuvwxsityzabc", "ThLorem ipsum dolor sit amet, consetctetur adipiscilang elit.e"], ["aaAAAAAaaaaaabaaLorem", "daog.a"], ["vvr", "ba"], ["faaaaaaaabaaaaoaaabbThe quicfoxamlazyet,k brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumups over the lazy dog.aabbbbaaaaiconsecteturmx", "faaaaaaaabaaaaoaaabbThe quicfoxamlazyet,k brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumups over the lazy dog.aabbbbaaaaiconsecteturmx"], ["celit.aaaaaaacabcdefghijklmnopqovlazycacccccacipsumerrshtuvwxyzabcccacc", "dgog.cac"], ["The quicfoxk brown fox jumps over the lazy dog.", "cacccccabThe quick brown fox jumps over the lazy dog.ac"], ["laz", "cccaacacccccacipsum"], ["Lorem ipsccccaccum dolor sit amet, consetctetg elit.", "Lorem ipsum dooveamt,or sit ametfaaaaaaaabaaaaaaaoiconsecteturmx, consetctetur adipiscing elit."], ["The quicfoxk brown foxbrothequickracecarapenapapayaquicfoxcacccaaaaofabbbbtheaelit.aaaccaccpineapplewwn jumps over the lazy dog.", "The quicfoxk brown fox jumps over the lazy dog."], ["elit.", "Lor"], ["gg.", "dogg.dg."], ["bbaba", "bbaba"], ["aaabrquicbbbbquicfoxcacccccacapkaquicaccfoxsitowanaaaa", "aaabrowanaaaa"], ["quicfoxcacccccacc", "taaabbaaabbbbaaaahe"], ["The quicfoxkthe brown fox jumps over the lazy dog.", "The quicfoxk brown fox jumps over the lazy dog."], ["cacccccabThe", "ab"], ["The quick brown fps over the lazy dog.", "The quick brown fps over the lazy dog."], ["aaaaabbaaAAAAfoipsuconsequickcfoxkurmxAaaaaaabaaaabrownaaccccaccaaabbaaaa", "aaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa"], ["abcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabc", "abcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabc"], ["abcdefghijklmnopqovlazycacccccacipsumerrstuvkwxyzabc", "abcdefghijklmnopqovlazycacccccacipsumerrstuvwxyzabc"], ["quicacthequickracecarapenapapayapineapplecfox", "quicaccaaaaaaaabaaaabrownaaaaaaaaaafox"], ["cccaacacccccacipsum", "etaaaaofaeapplee"], ["fofofbLorem ipsum dolor sit amet, consetctetur adipiscing elit.aofofofofof", "fofofofofofofof"], ["consuecurAquicfoxAAAAA", "consuecur"], ["aaaaaaelit.aaaaaaaaabaaaabrownaaaaaaaaaa", "aaaaaaaabaaaabrownaaaaaaaaaa"], ["of", "ccaac"], ["elit.aconsbbbbecu", "elit.aconsecu"], ["g.dogfox.", "aaaabofabbbbtheaaaa"], ["quicaccfoxsit amet, consetctetur adiamet,piscing elit.", "quicaccfoxsit amet, consetctetur adiamet,piscing elit."], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABheaaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABhe"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABheaaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa", "acaagdog.rc"], ["ab", "ba"], ["cafoipsuconsequickcfoxkurmxcac", "consuecur"], ["quiaaaaoaaabbThefabbbbtheaelit.aaacfoxcacccccac", "cacccccaquicfThe quicfoxk brownfoipsuconsequickcfoxquicfoxcaccccccackurmx fox jumps over azy dofoxcaccc"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABheaaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa", "taaaaofabbbbtheaelitaaaaofabbbbtheaaaa.abrownaahe"], ["tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapcaaabbaaaa", "tAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAquickracecarapenapapayapineappleAAAAAABheaaaaabbaaAAAAAaaaaaabaaaabrownaaccccaccaaabbaaaa"], ["celit.aaaaaaacabcdefghijklmnopqovlazycacccccacipsumerrshtuvwxyzabcccacc", "dgog.cacc"], ["Lorem ipsum dolor sit amt, consectetur adipiscing elit.", "cac"], ["abaccac", "ccacccccac"], ["theequickracecarapenapapayaquicfoxcacccccaccpineapple", "theequickracecarapenapapayaquicfoxcacccccaccpineapple"], ["Lorem ipsum dolor sit amet, consetctetur aditpiacaacscilang elit.", "Lorem ipsum dolor sit amet, consetctetur aditpiacaacscilang elit."], ["", "xyz"], ["hello", "hello world"], ["apple", "pineapple"], ["12$34$56", "$"], ["x", "x"], ["x", "y"], [" ", " "], ["hellohello", "hello"], ["aaaaaa", "aa"], ["abcabcabc", "abcabc"], ["racecarapenapapayapineapple", "ana"], ["The quick brown foxamet, jumps over the lazy dog.", "the"], ["anaap", "ana"], ["racecarapenapapayapineapple", "The quick brown foxamet, jumps over the lazy dog."], ["elit.", "abcdefghijklmnopqrstuvwxyzabc"], ["racecarrapenapapayapineapple", "ana"], ["aAAAAAAAna", "racecaracecarrapenapapayapineapplerrapenapapayapineapple"], ["aaaaaaaabaaaaaaa", "jumpsba"], ["ipsum", "the"], ["racecarapenapapayapineapple", "appp"], ["AAAAaaaaaaaabaaaaaaaAAA", "AAAAAAA"], ["anabanana", "ana"], ["anracecarapenapapayapineapplea", "ana"], ["of", "fofofofofofofof"], ["racecarapenaapapayapineapple", "ap"], ["ipsum", "sit"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "racecarapenapapayapineapple"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAAAAA"], ["ba", "basit"], ["ap", "ap"], ["consectetur", "racecaracecarrapenapapayapineapplerrapenapapayapineapple"], ["of", "of"], ["ana", "anaap"], ["anaba", "anabanana"], ["consecteturr", "consectetur"], ["foxamet,", "foxamet,"], ["anracecarapenapapayapineapplea", "an"], ["AAAAAAAA", "racecarapenapapayapineapple"], ["racecarrapenapapayapineapple", "racecarrapenapapayapineapple"], ["aaaa", "aaa"], ["aaaaaaaabaaaaaaa", "jfoxumpsba"], ["racecaAAAAAAArapenapapayapineapple", "ana"], ["Lorem", "aAAAAaaaaaaaabaaaaaaaAAAaaaabbbbaaaa"], ["fofofofofofofof", "Th e quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["oof", "of"], ["anracecarapenapapayapineapplea", "lazzy"], ["fofofofofofofof", "lazy"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "sit"], ["foxaet,", "quick"], ["foxamconsecteturet,", "foxamet,"], ["abcdefghijklmnopqrstuvwxyzabc", "abcdefghijklmnopqrstuvwxyzabc"], ["anaap", "aaaaaaaabaaaaaaaana"], ["racecarapenapapayapineapple", "na"], ["racecarapenanpapayapineapple", "foxaet,"], ["AAAAAAA", "consecteturr"], ["aaaaabbbbaaaa", "of"], ["anaap", "anaap"], ["Lorem", "ipsum"], ["consecrteturr", "consecteturr"], ["ba", "of"], ["racecarapenaapapayapineapple", "The quick brown foLoremxamet, jumps over the lazy dog."], ["The", "ap"], ["ajumpsaaa", "jumps"], ["abcdefghijklmnopqrstuvwxyzabcipsum", "ipsum"], ["aaaaaaaabaaaaaaa", "ana"], ["na", "racecaracecarrapenapapayapineapapapayapineapple"], ["ba", "an"], ["abasitna", "ana"], ["abasitna", "racecaraquAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABrpenapapayapineapple"], ["obrownf", "anabanana"], ["ajumpsaaa", "racecaracecarrapenapapayapineapapapayapineapple"], ["racecarapenanpapayapineapeple", "foxfaet,"], ["fofofofofofofof", "dog."], ["abcdefghijklmnopqrstuvwxyzabcipsum", "consectetur"], ["Thazy dog.", "the"], ["racepcaAAAAAAArapenapapayapineapplee", "ana"], ["The", "dog."], ["racecarapenapapayapineapple", "ba"], ["appp", "apppp"], ["racecarapenaapapayapineapple", "racecarapenaapapayapineapple"], ["abasitna", "ba"], ["of", "aaaaabbbbaaaa"], ["appp", "appp"], ["cacccccac", "appp"], ["AAAAaaaaaaaabaaaaaaaAAA", "racepcaAAAAAAArapenapapayapineapplee"], ["racepcaAAAAAAArapenapaadipiscingpayapineapplee", "aaaaaaaabaaaaaaaaana"], ["cacc", "cacc"], ["elit.", "abcdefghijklmnopqrappppstuvwxyzabc"], ["the", "lazy"], ["ajumpsaaa", "anaba"], ["AAAAaaaafoxamconsecteturet,aaaabaaaaaaaAAA", "Aelit.AAAAAA"], ["foxamconsecteturet,", "p"], ["na", "sit"], ["appppconsAelit.AAAAAAectetur", "consecteturr"], ["consecteturr", "consecteturr"], ["na", "anaba"], ["aaaaabbbbaaaa", "consectedturThe quick brown foxamet, jumps over the lazy dog."], ["The quick brown fox jumps over the lazy dotheg.", "racecarapenaapapayapineapple"], ["racecarapenanpapayapineapple", "foxfaet,"], ["ba", "babcdefghijklmnopqrstuvwxyzabcsit"], ["fofofofofofofof", "dolorof"], ["oof", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["appp", "app"], ["cacccccac", "foxaet,"], ["The quick brown fox jumps over the lazy dotheg.", "racecarapenaapapayapineappale"], ["foxfaect,consecteturr", "appppconsAelit.AAAAAAectetur"], ["appppconsAelit.AAAAAAectetur", "conse ctedturThe quick brown foxamet, jumps over the lazy dog."], ["aAAAAAAAna", "aAAAAAAAnaracecarapenaapapayapineappale"], ["foxamconsecteturet,", "Th e quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["oof", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["foxamconsecteturet,", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["Aelit.AAAAAAA", "Aelit.AAAAAA"], ["AAAAAAAA", "AAAAAAA"], ["aaaaabbbbaaaa", "e"], ["conse ctedturThe quick brown foxamet, jumps over the lazy dog.", "abcdefghijklmnopqrappppstuvwxyzabc"], ["abcdefghijklmnopqrstuvwxyzaaAAAAAAAnabcipsum", "consectetur"], ["foxamconsecteturet,", "pp"], ["aaaaabbbbafofofofofofofofaaa", "aaaaabbbbafofofofofofofofaaa"], ["aaaaaaaabaaaaaaa", "appp"], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "conse ctedturThedotheg. quick brown foxamet, jumps over the lazy dog."], ["jumpsba", "AAAAAAA"], ["aaaaabbba", "aaa"], ["elit.", "jumpsba"], ["racecarapenaapapayapineappale", "racecarapenaapapayapineappale"], ["consecteturr", "racecarapenaapapayapineapple"], ["foxaomconsecteturet,", "foxamconsecteturet,"], ["conse ctedturThedotheg. quick brown foxamet, jumps over the lazy dog.", "aaa"], ["pcacp", "AAAAAAAA"], ["fofofofofofofof", "racecaAAAAAAArapenapapayapineapple"], ["aaaaracecarapenanpapayapineapeplea", "aaaaa"], ["Lorem", "cac"], ["The quick brown foLoremxamet, jumps over the lazy dog.", "an"], ["aanaap", "aaaaaaaabaaaaaaaana"], ["conse ctedturThsit over the lazy dog.", "conse ctedturThe quick brown foxamet, jumps over the lazy dog."], ["AAAAAAAanaba", "AAAAAAAanaba"], ["racecarapenaapapayapineapple", "The quick brown fox jumps over the lazy dotheg."], ["dog.", "foxamconsecteturet,"], ["quAAAAAAAAA", "quAAAAAAAAA"], ["elit.", "basit"], ["consectetuabcdefghijklmnopqrappppstuvwxyzabcrr", "consectetur"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["babcdefghijklmnopqrstuvwxyzabcsit", "consecuteturr"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["racecarapenapapayeapineapple", "ba"], ["foxaet,", "foxaet,"], ["cacccccac", "consecteturr"], ["baa", "ba"], ["anaaa", "anaaa"], ["racecarapenaapapayapineappale", "an"], ["anaap", "apfoox"], ["app", "apppp"], ["quick", "quicik"], ["conse", "The quick brown foxamet, jumps over the lazy doTg."], ["sbasit", "an"], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog.", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["nna", "racecaraquAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABrpenapapayapineapple"], ["anaaaLorem", "anaaa"], ["conse", "coonse"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "consectetur"], ["racecarapenaapapayapineappale", "racecarapenapapayapineapple"], ["foxamet,", "fxoxamet,"], ["apppp", "appp"], ["basit", "apppp"], ["oxaet,", "foxaet,"], ["Th e quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog.", "abc"], ["racepcaAAAAAAAranpenapapayapineapplee", "racepcaAAAAAAArapenapapayapinThazy dog.eapplee"], ["e", "conse"], ["AAAAAAAA", "quicik"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "ana"], ["sbasit", "anaap"], ["Lorem ipsum dolor sit amet, consectetur adipiscing elit.", "Lorem ipsum dolor sit amet, consectetur adipiscing elit."], ["AAAAAAAA", "AAAAAAAA"], ["fooff", "foof"], ["basit", "basit"], ["aaaaabbbbafofofofofofofofaaa", "Thazy dog."], ["na", "anaana"], ["sit", "na"], ["racecarapenaapapayapineappapfooxale", "racecarapenaapapayapineappale"], ["Aelit.AAAAAA", "racecaracecarrapenapapayapineapplerrapenapapayapineapple"], ["racecarapenaapapayapineappapfooxale", "ana"], ["quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr", "aaa"], ["The", "ddog."], ["foxamconsecteturetp,", "foxaomconsecteturet,p"], ["anaba", "anaba"], ["over", "racecarapenaapapayapineappale"], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "bc"], ["aThazynaap", "anaap"], ["The", "TAAAAaaaaaaaabaaaaaaaAAAhe"], ["e", "laazy"], ["coonsecteturr", "consecteturr"], ["conse ctedturThsit over the lazy dog.", "aThazynaap"], ["thhe", "the"], ["basit", "bassit"], ["foLoremxamet,", "quicik"], ["anaba", "abcdefghijklmnopqrappppstguvwxyzabc"], ["annnaaba", "anaba"], ["sit", "bassit"], ["racecaracecarrapenapapayapineapplerrapenapapayapineapple", "racecaracecarrapenapapayapineapplerrapenapapayapineapple"], ["fofofofofofofof", "Th e quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog.", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog."], ["racepcaAAAAAAArapenapapayapineapplee", "racecaAAAAAAArapenapapayapifoxaet,neapple"], ["sbasist", "anaap"], ["sitfox", "bassit"], ["bAAAAaaaafoxamconsecteturet,aaaabaaaaaaaAAAa", "ba"], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog.", "oxaet,"], ["fofofofofofofof", "racecarapenapapayapineapple"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr", "jracecarapenanpapayapineappleumps"], ["sit", "ncaca"], ["jumpsba", "consectedturThe quick brown foxamet, jumps over the lazy dog."], ["abcdefghijklmnopqrstuvwxyzaaAAAAAAAnaabcipsum", "consectetur"], ["AAAAAAA", "cac"], ["laazy", "aapfoox"], ["racecarapenracecaAAAAAAArapenapapayapineapple", "racecarapenaapapayapineapple"], ["jumpsba", "AA"], ["consectedturThe", "conse"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAaaaaaaaabaaaaaaaAAA"], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog.", "dolor"], ["jracecarapenanpapayapineappleumps", "consectetur"], ["conse ctedturacepcaAAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog.", "aThazynddog.aap"], ["racepcaAAAAAAArapenapapayapinThazy", "racecarapenaapapayapineappapfooxale"], ["tbassithe", "the"], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog.", "Lorem ipsum dolor sit amet, consectetur adipiscing elit."], ["racecarapenanpapayapineapeple", "an"], ["Lor", "ipsum"], ["Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog.", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog."], ["foxamconsectetret,", "Th e quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the lazy dog."], ["Lconse ctedturThsit over the lazy dog.orem ipsum dolor sit amet, consectetur adipiscing elit.", "sit"], ["foxamconsecteturet,", "foxamconsecteturetp,"], ["aaaaaaaabaaaaaaa", "racecarapenaapapayapineappale"], ["consectedtAelit.AAAAAAick brown foxamet, jumps over the lazy dog.", "dconsectedturThe quick brown foxamet, jumps over the lazy dog.og."], ["aAAAAAAAnaracecarapenaapapayapineappale", "foxfaect,consecteturr"], ["jraaaaaaaabaaaaaaaaanaaceacarapenanpapayapineappleumps", "consectetur"], ["foxaomconseet,", "foxamconsecteturet,"], ["jracecarapenanpapayapiracepcaAAAAAAArapenapapayapineappleeneappleumps", "jracecarapenanpapayapiracepcaAAAAAAArapenapapayapineappleeneappleumps"], ["Th", "doTg."], ["foxamconsecteturet,", "foxamconsecteturet,"], ["doTg.", "oof"], ["consectedtAelit.AAAAAAick brown foxamet, jumps over the lazy dog.", "foxaomconsecteturet,p"], ["babcdefghianaaajklmnopqrstuvwxyzabcsit", "babcdefghijklmnopqrstuvwxyzabcsit"], ["aaaaabbbbaaaa", "racecaAAAAAAArapenapapayapifoxaet,neapplee"], ["racecarapenanpapayapineapple", "racecarapenanpapayapineapple"], ["aAAAAAAAna", "racecaracecarrapenapapayapineracecaracecarrapenapapayapineapapapayapineappleapplerrapenarpapayapineapple"], ["aapfoox", "laazy"], ["abasitna", "racecarapenanpapayapineapeple"], ["aaaaabbbracecarapenaapapayapineappapfooxalebaaaa", "consectedturThe quick brown foxamet, jumps over the lazy dog."], ["thlaazyeana", "the"], ["oxt,", "oxaet,"], ["an", "an"], ["AAAAAAA", "apfoo"], ["racepcaAAAAAAArapenapapayapineapplee", "racepcaAAAAAAAraracecaracecarrapenapapayapineracecaracecarrapenapapayapineapapapayapineappleapplerrapenarpapayapineapplepenapapayapineapplee"], ["foLoremxamet,", "qk"], ["conse", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog."], ["rpapayeapineapple", "anaap"], ["ajumpsaaa", "racecaracecarrapenapapayanpineapapapayapineapple"], ["appppconsAelit.AAAAAAectetur", "bc"], ["AAAAAAThe quick brown foLoremxamet, jumps over the lazy dog.A", "AAAAAAThe quick brown foLoremxamet, jumps over the lazy dog.A"], ["baa", "Aelit.AAAAAA"], ["quAAAAAAAAA", "Aelit.AAAAAAAaaa"], ["aana", "ana"], ["racecarrapenapapayapineapple", "aaa"], ["abcdefghijklmnopqrappppstguvwxyzabc", "racecarapenaapapayapineappapfooxale"], ["consectedtAelit.AAAAAAick brown foxamet, jumps over the lazy dog.", "racecaraquAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABrpenapapayapineapple"], ["racecfoxfaect,consecteturrarapenaapapayapineappapfooxale", "racecarapenaapapayapineappale"], ["foxfaect,consecteturr", "anaaa"], ["aac", "abcappppbc"], ["anaaaLorem", "abcdefghijklmnopqrappppstguvwxyzabc"], ["Th e quAAAAAAAAA AAAAaazy dog.", "dconsectedturThe"], ["coonsecteturr", "consencteturr"], ["aaaa", "aaaa"], ["qobrownffuick", "abcdefghijklmnopqrstuvwxbc"], ["aapfoox", "aapfoox"], ["racecarapenanpapayapineappl", "racecarapenanpapayapineapple"], ["abcdefghijklmnopqrstuvwxyzabc", "racecarapenaapapayapineappale"], ["AAAsitAAAA", "apfoo"], ["na", "aanaana"], ["anracecarapenapapayapineapplea", "nan"], ["consectedturThe quick brown foxamet, jumps over the lazy dog.consecrteturr", "consecrteturr"], ["racecaAAAAAAArapenapapayapifoxaet,neapple", "jfoxumpsba"], ["ffoxamconsecteturet,", "ffoxamconsecteturet,"], ["racecarapenapapayapineapple", "The quick brown foxamet,racecarapenanpapayapineapple jumconsecteturps over the lazy dog."], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "conse ctedturThedotheg. quick brown foxamet, juAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABmps over the lazy dog."], ["racecarapenanpapayapineapepl", "racecarapenanpapayapineapeple"], ["oof", "babcdefghianaaajklmnopqrstuvwxyzabcsit"], ["consectetur", "AAAAAAA"], ["racecarapenaapapayapineappapfooxale", "of"], ["TAAAAaaaaaaaadog.AbaaaaaaaAAAhe", "TAAAAaaaaaaaabaaaaaaaAAAhe"], ["aanaap", "aaaaconsecteturaaaabaaaaaaaana"], ["confoLoremxamet,e", "conse"], ["AAAdotheg.AAA", "AAAAAAA"], ["The", "aap"], ["racecarapenapineppale", "racecarapenapapayapineapple"], ["aanaap", "rpapayeapineapple"], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "ee"], ["anabba", "anaba"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "conscectetur"], ["AAAAAAAA", "abcdefghijklmnopqrstuvwxyzaaAAAAAAAnabcipsum"], ["AAAAAAAanaba", "aaaaabbbbafofofofofofofofaaa"], ["consectedturThe", "dog.eapplee"], ["racecarapenaapapThe quick brown foLoremxamet, jumps over the lazy dog.ayapineapple", "racecarapenaapapayapineapple"], ["aaconsannnaabae ctedturacepcaAAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog.aa", "aaaa"], ["quAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr", "aThazynddog.aapquAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr"], ["deTg.", "conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog."], ["laaaaabbbbaaaaazy", "The quick brown foxamet, jumps over the lazy dog."], ["fofofofofofofof", ".dog."], ["dog.eapplee", "oof"], ["caccccacac", "cacccccac"], ["pappp", "appp"], ["Lorem", "Lorappem"], ["dog.A", "aaconsannnaabae ctedturacepcaAAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog.aa"], ["dog.eapplee", "quAAAAAAAAA"], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "racecaAAAAAAArapenapapayapineapple"], ["app", "app"], ["dog.eappleerT", "TAAAAaaaaaaaabaaaaaaaAAAhe"], ["iracecarapenracecaAAAAAAArapenapapayapineapplesum", "ipsum"], ["oof", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjracecarapenanpapayapineappleuctedturThempsAAAAAAAAAAAAAAAAAB"], ["aaaaabbba", "AAAdotheg.AAA"], ["Lor", "anaba"], ["jus", "aaaaaaaabaaaaaaaana"], ["TAAAAaaaaaaaabaaaaaaaAAAhe", "The"], ["consectedturThe quick brown foxamet, jumps over the lazThazy dog.y dog.", "consectedturThe quick brown foxamet, jumps over the lazy dog."], ["racepcaAAAAAAArapenapapayapineapplee", "racecaAAAAAAArapenapapAelit.AAAAAAayapifoxaet,neapple"], ["conse ctedturacepcaAAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog.", "conse ctedturacepcaAAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog."], ["babcdefghijklmnopqrstuvwxyzabcsit", "babcdefghijklmnopqrstuvwxyzabcsit"], ["oof", "ofracepcaAAAAAAArapenapaadipiscingpayapineapplee"], ["Tjfoxumpsbahe", "TAAAAaaaaaaaabaaaaaaaAAAhe"], ["nana", "ana"], ["aanaanasit", "na"], ["apgciRKR", "dPgciRKR"], ["an", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog."], ["sitoof", "na"], ["aaaaabbbbafofofofofofofofaaa", "aaaaabbbbafofofofofofaa"], ["aAAAAAAAnaconsecteturracecarapenaapapayapineappale", "foxfaect,consecteturr"], ["an", "AAAdotheg.AAA"], ["ajumpsaaa", "ajumpsaaa"], ["laaznay", "laazy"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "AAAAAAAAAAAAAAAAAAAAAAAAAAAB"], ["Lorem", "racepcaAAAAAAAraracecaracecarrapenapapayapineracecaracecarrapenapapayapineapapapayapineappleapplerrapenarpapayapineapplepenapapayapineapplee"], ["na", "na"], ["foxamconsecteracecarapenanpapayapineapplre,", "foxamconsecteracecarapenanpapayapineapplret,"], ["laazy", "alaazy"], ["abcdefghijklmnopqrstuvwxyzabc", "c"], ["o", "of"], ["p", "p"], ["conaaaaracecarapenanpapayapineapepleasectetur", "AAAAAAA"], ["ssit", "ncaca"], ["coonsecteturr", "aana"], ["foxamconsecteturet,", "racecfoxfaect,consecteturrarapenaapapayapineappapfooxale"], ["anaaaLelit.or", "anaaaLelit.or"], ["daog.aa", "daog.aa"], ["foxamconsectetuAAAdotheg.AAAret,", "foxamconsecteturet,"], ["racecarapenapineppale", "racecarapenapineppale"], ["foxaomconsecteturet,p", "foxaomconsecteturet,p"], ["brown", "e"], ["anabanana", "anabanana"], ["TAAAAaaaaaaaadog.AbaaaaaaaAAAhe", "TAAAAaaaaaaaadog.AbaaaaaaaAAAhe"], ["jumpsba", "jumpsba"], ["aaaaaa", "aaaaa"], ["abcdefghijklmnopqrstuvconsectedturThe quick brown foxamet, jumps over the lazy dog.wxyzabc", "abcdefghijklmnopqrstuvwxyzabc"], ["consectedtAelit.AAAAAAick brown foxamr theconse ctedturThe quick brown foxamet, jumps over the lazy dog.g.", "consectedtAelit.AAAAAAick brown foxamr the lazy dog."], ["cc", "cc"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB", "racecarapenaaanabapapayapineapple"], ["apppp", "apppp"], ["nana", "racecarapenanpapayapineapple"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjracecarapenanpapayapineappleuctedturThempsAAAAAAAAAAAAAAAAAB", "quAAAAAAAAA"], ["racecarapenapapayapineapple", "The quick brown foxamet,racecarapenanpapayapineapple jumconsecrps over the lazy dog."], ["dog.y", "dconsectedturThe quick brown foxamet, jumps over the lazy dog.og."], ["conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog.", "conse ctedturThedotheobrownfg. quick brown foxamet, jumps over the lazy dog."], ["iupsum", "the"], ["ansbasit", "Th e quAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr the laaaaabbbbaaaaazy dog."], ["ccac", "cac"], ["sitoof", "consectetur"], ["aana", "anaap"], ["aAAAAAAAAAAAAAAAAAAAAAAAAAAAABna", "ana"], ["foxaet,", "cquick"], ["racecarapenaapapayapbAAAAaaaafoxamconsecteturet,aaaabaaaaaaaAAAapple", "The quick brown foLoremxamet, jumps over the lazy dog."], ["anaaaLorem", "anaaaLorem"], ["anabanana", "anansbasitabanana"], ["oxaet,", "foxaeet,"], ["conse ctedturacepcaAcAAAAAArapenapapayapinThazy dog.eappleerThsit over the lazy dog.", "aThazynddog.aap"], ["abcdefghijklmnopqrappppstguvwxyzabc", "abcdefghijklmnopqrappppstguvwxyzabc"], ["anabanana", "annabanana"], ["TAAAAaaaaaaaaaaaaaadog.AbaaaaaaaAAAhe", "TAAAAaaaaaaaadog.AbaaaaaaaAAAhe"], ["broown", "e"], ["Th", "Th"], ["aadipiscing", "aadipiscing"], ["aAAAAAAAAabcdefghijklmnopqrstuvwxyzaaAAAAAaaaaaAAnabcipsumna", "aAAAAAAAAabcdefghijklmnopqrstuvwxyzaaAAAAAaaaaaAAnabcipsumna"], ["foxaet,", "quickanansbasitabanana"], ["appppconsAelit.AAAAAAectretur", "bc"], ["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjracecarapenanpapayapineappleuctedturThempsAAAAAAAAAAAAAAAAAB", "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjracecarapenanpapayapineappleuctedturThempsAAAAAAAAAAAAAAAAAB"], ["consecrteturr", "consecrteturr"]], "completion": "\ndef how_many_times(string: str, substring: str) -> int:\n \"\"\"\n Find how many times a given substring can be found in the original string. Count overlaping cases.\n \"\"\"\n if not string or not substring:\n return 0\n count = 0\n i = 0\n while i <= len(string) - len(substring):\n if string[i:i+len(substring)] == substring:\n count += 1\n i += 1\n else:\n i += 1\n return count\n", "raw_completion": "```python\ndef how_many_times(string: str, substring: str) -> int:\n \"\"\"\n Find how many times a given substring can be found in the original string. Count overlaping cases.\n \"\"\"\n if not string or not substring:\n return 0\n count = 0\n i = 0\n while i <= len(string) - len(substring):\n if string[i:i+len(substring)] == substring:\n count += 1\n i += 1\n else:\n i += 1\n return count\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef how_many_times(string: str, substring: str) -> int:\n \"\"\" Find how many times a given substring can be found in the original string. Count overlaping cases.\n >>> how_many_times('', 'a')\n 0\n >>> how_many_times('aaa', 'a')\n 3\n >>> how_many_times('aaaa', 'aa')\n 3\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} {"task_id": "HumanEval/19", "prompt": "from typing import List\n\n\ndef sort_numbers(numbers: str) -> str:\n \"\"\" Input is a space-delimited string of numberals from 'zero' to 'nine'.\n Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.\n Return the string with numbers sorted from smallest to largest\n >>> sort_numbers('three one five')\n 'one three five'\n \"\"\"\n", "entry_point": "sort_numbers", "canonical_solution": "\n \n to_int = {'zero': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9}\n\n if numbers == \"\": return \"\"\n return \" \".join(sorted(numbers.split(\" \"), key=lambda n: to_int[n]))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate('three') == 'three'\n assert candidate('three five nine') == 'three five nine'\n assert candidate('five zero four seven nine eight') == 'zero four five seven eight nine'\n assert candidate('six five four three two one zero') == 'zero one two three four five six'\n", "contract": "\n assert isinstance(numbers, str), \"invalid inputs\" # $_CONTRACT_$\n assert numbers == \"\" or all(map(lambda x: x in [\"zero\", \"one\", \"two\", \"three\", \"four\", \"five\", \"six\", \"seven\", \"eight\", \"nine\"], numbers.split(\" \"))), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["three"], ["three five nine"], ["five zero four seven nine eight"], ["six five four three two one zero"]], "atol": 0, "plus_input": [["four eight two"], ["nine"], ["one six two four nine"], ["two seven eight zero five"], ["nine zero"], ["seven three one"], ["two two three three four five six"], ["zero five four one seven eight two six"], ["nine eight seven six five four three two one zero"], ["two zero nine four five six"], ["nine eight seven six five four one zero"], ["two zero nine"], ["four eight"], [""], ["zero five four one seven"], ["six"], ["two two four five six"], ["zero five four one"], ["zero five seven"], ["four two"], ["four"], ["two six"], ["two two five six"], ["seven"], ["zero five four zero five four one seven eight two six"], ["zero five one seven eight two six"], ["four four eight two"], ["seven three"], ["nine eight seven five four three two one zero"], ["two four five six"], ["zero four one"], ["zero seven eight two six"], ["zero five eight two six"], ["zero"], ["three"], ["one six"], ["nine six"], ["two seven eight five"], ["two"], ["two three three four five six"], ["zero five four seven"], ["nine eight seven one zero"], ["four five six"], ["two nine"], ["two two three"], ["nine eight seven six five two one zero"], ["zero five six"], ["zero five"], ["zero five two six"], ["zero five four zero four one seven eight two six"], ["four eight two two three"], ["five four one seven eight two six"], ["nine seven six five two one zero"], ["nine eight seven six zero"], ["two nine seven six five two one zero"], ["two four six"], ["nine one zero"], ["four six"], ["zero five four"], ["zero two six"], ["zero five one"], ["nine six five two one zero"], ["two nine eight seven six five four one zero"], ["zero four one seven"], ["two zero nine four zero four one"], ["one zero five six"], ["nine seven six five two zero"], ["two nine eight seven six five four one zero one zero"], ["two nine seven six five two one zero five two six"], ["one"], ["nine eight seven five four three two one"], ["two seven"], ["nine eight seven six"], ["zero five one seven six"], ["nine one zero five four one seven eight two six"], ["zero two"], ["two four zero four one"], ["zero five four zero five four one seven"], ["two two four five"], ["zero one seven eight two six"], ["nine two six"], ["nine one zero five four one six"], ["two two seven eight zero five four five six"], ["two four zero four"], ["two zero six"], ["two three"], ["two nine seven six five two one zero four five six"], ["nine six five two three three four five six one zero"], ["nine eight one zero"], ["two four"], ["four two nine eight seven six five four one zero"], ["two two"], ["nine seven six five two one"], ["one six two nine"], ["zero five four one seven eight six"], ["nine seven four six"], ["five six"], ["two zero nine four one"], ["zero five four one eight two six"], ["nine one zero five four one"], ["one two three four five six seven eight nine"], ["nine eight seven six five four three two one"], ["five seven eight six nine four zero two one three"], ["four six nine eight seven one five zero two three"], ["seven one zero five two four eight six nine three"], ["zero one two three four five six seven eight nine"], ["two four six eight zero one three five seven nine"], ["nine seven five three one eight six four two zero"], ["one zero three four two six five seven eight nine"], ["seven five zero four nine eight two six one three"], ["five"], ["eight"], ["four six nine eight five zero two three"], ["one two three three"], ["two nine eight seven six five four three two one seven nine"], ["zero one two five six seven eight nine"], ["five four six nine eight seven one five zero two three two one three"], ["nine eight seven six five four two one"], ["one two one four"], ["one one one one one"], ["one two"], ["four four two six nine two zero"], ["nine eight seven six five two three two one"], ["nine eight seven two one"], ["one zero three nine"], ["nine eight"], ["seven one zero five three"], ["zero two three"]], "completion": "\nfrom typing import List\n\ndef sort_numbers(numbers: str) -> str:\n num_dict = {'zero': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9}\n nums = [num_dict[num] for num in numbers.split()]\n sorted_nums = sorted(nums)\n sorted_words = [list(num_dict.keys())[list(num_dict.values()).index(num)] for num in sorted_nums]\n return \" \".join(sorted_words)\n", "raw_completion": "```python\nfrom typing import List\n\ndef sort_numbers(numbers: str) -> str:\n num_dict = {'zero': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9}\n nums = [num_dict[num] for num in numbers.split()]\n sorted_nums = sorted(nums)\n sorted_words = [list(num_dict.keys())[list(num_dict.values()).index(num)] for num in sorted_nums]\n return \" \".join(sorted_words)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef sort_numbers(numbers: str) -> str:\n \"\"\" Input is a space-delimited string of numberals from 'zero' to 'nine'.\n Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.\n Return the string with numbers sorted from smallest to largest\n >>> sort_numbers('three one five')\n 'one three five'\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/20", "prompt": "from typing import List, Tuple\n\n\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"\n", "entry_point": "find_closest_elements", "canonical_solution": "\n\n numbers.sort()\n min_diff = float(\"inf\")\n min_pair = None\n for l, r in zip(numbers[:-1], numbers[1:]):\n diff = r - l\n if diff < min_diff:\n min_diff = diff\n min_pair = (l, r)\n return min_pair\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2]) == (3.9, 4.0)\n assert candidate([1.0, 2.0, 5.9, 4.0, 5.0]) == (5.0, 5.9)\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)\n assert candidate([1.1, 2.2, 3.1, 4.1, 5.1]) == (2.2, 3.1)\n\n", "contract": "\n assert all(type(x) in [int, float] for x in numbers), \"invalid inputs\" # $_CONTRACT_$\n assert len(numbers) >= 2, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1.0, 2.0, 3.9, 4.0, 5.0, 2.2]], [[1.0, 2.0, 5.9, 4.0, 5.0]], [[1.0, 2.0, 3.0, 4.0, 5.0, 2.2]], [[1.0, 2.0, 3.0, 4.0, 5.0, 2.0]], [[1.1, 2.2, 3.1, 4.1, 5.1]]], "atol": 0, "plus_input": [[[1.5, 2.5, 3.5, 4.5]], [[0.5, 1.0, 2.0, 3.0, 4.0, 5.0]], [[1.0, 1.2, 1.4, 1.6, 1.8]], [[3.4, 5.6, 8.1, 14.5, 21.7]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.9, 3.1]], [[2.0, 2.1, 2.2, 2.3, 2.4, 2.5]], [[1.1, 1.2, 1.3, 1.4, 10.0]], [[1.1, 2.2, 3.3, 5.1, 7.8, 9.9]], [[1.0, 3.0, 5.0, 7.0, 9.0]], [[1.5, 2.5, 3.5, 4.5, 5.5]], [[1.1, 2.2, 3.3, 5.1, 7.8]], [[-0.36581021654089096, 0.9, 1.0, 1.8, 2.5, 2.9]], [[2.0, 2.1, 2.3, 2.4]], [[1.1, 1.3, 1.395275547571625, 1.4, 10.0]], [[1.1, 1.2, 1.3, 10.0]], [[1.0, 1.2, 1.4, 1.4, 1.6, 1.8]], [[1.1, 2.2, 3.3, 5.1, 5.605725348678288, 7.8]], [[2.0, 2.1, 2.3, 2.4, 5.0, 7.8]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.5, 2.9, 3.1]], [[1.0, 1.2, 1.4]], [[1.1, 1.3, 1.395275547571625, 1.4]], [[0.5, 1.0, 2.0, 2.276052871016944, 3.0, 4.0, 5.0]], [[1.2, 1.3, 10.0]], [[2.0, 2.1, 2.3, 2.4, 5.0, 5.0, 7.8]], [[1.5, 1.5, 2.5, 3.5, 4.5]], [[1.2, 1.3556851172598539, 1.4, 1.6, 1.8]], [[1.5, 2.5, 3.5, 4.5, 4.5]], [[1.3, 10.0]], [[1.1, 1.3, 1.395275547571625, 1.9065922001939695, 10.0]], [[1.0, 1.0, 1.0, 3.0, 5.0, 7.0, 9.0]], [[0.5, 1.0, 2.0, 2.276052871016944, 2.276052871016944, 3.0, 4.0, 5.0]], [[2.0, 2.1, 2.1]], [[1.1963194756636508, 1.6325127784783873, 2.0, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5]], [[1.1, 1.3, 1.395275547571625, 1.4, 1.4603348592696748, 1.7891067661112277, 10.0]], [[1.5, 2.5, 3.4, 3.5]], [[1.2, 1.3556851172598539, 1.4, 1.6, 1.6, 1.8, 2.5]], [[1.2, 2.0, 2.1, 2.4]], [[1.1, 1.3, 1.395275547571625, 1.5310052282063495]], [[1.1963194756636508, 2.0, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5, 3.4]], [[1.1963194756636508, 1.3, 2.0, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5, 3.4]], [[1.2, 1.3556851172598539, 1.4, 1.4, 1.6, 1.8]], [[1.0, 1.2, 1.4, 1.4, 1.4, 1.6, 1.8]], [[1.5, 1.5, 2.5, 3.5, 4.5, 4.5]], [[0.5, 0.5, 0.6660078740884678, 1.1, 1.3, 1.4, 10.0]], [[1.1, 1.3, 1.395275547571625, 1.395275547571625, 1.4, 10.0]], [[1.3, 1.395275547571625, 1.4, 10.0]], [[1.1963194756636508, 1.8332957131132472, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5, 3.0198699773905164, 3.4]], [[0.5, 0.9, 1.2, 1.4603348592696748, 1.8, 2.5, 2.9, 3.1, 3.1]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.9, 3.1, 3.1]], [[1.0884212994945, 2.0, 2.0, 2.1, 2.1]], [[3.0, 3.3, 5.0, 7.0, 9.0]], [[2.2, 4.001419307404744, 5.1, 7.8, 9.9]], [[1.0, 1.0, 1.0, 1.0884212994945, 3.206051292454492, 5.0, 7.0, 7.0, 9.0]], [[1.1963194756636508, 2.0, 2.1, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5, 3.4, 5.0]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.6605281965718235, 2.9, 3.1]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.9, 3.1, 3.1, 14.5]], [[1.0, 1.0, 1.0, 1.0, 1.0884212994945, 3.206051292454492, 5.0, 7.0, 9.0, 9.819481586162372]], [[1.1, 1.3, 1.395275547571625, 1.395275547571625, 1.395275547571625, 1.4, 10.0, 10.511377904483744]], [[0.5, 0.9, 1.2, 1.8, 2.6605281965718235, 2.9, 3.1]], [[2.0, 2.4]], [[1.1, 1.3, 1.395275547571625, 1.395275547571625, 1.395275547571625, 1.395275547571625, 1.4, 10.0]], [[1.3, 1.5, 2.3827054707590554, 2.5, 3.5, 4.5, 4.5]], [[1.1, 1.2, 1.3, 10.0, 10.0]], [[1.1963194756636508, 1.8332957131132472, 2.1, 2.2, 2.3, 2.4, 2.424000205756431, 2.5, 3.0198699773905164, 3.4, 14.5, 18.924237928824464]], [[1.0, 1.2, 1.4, 1.4, 1.6, 1.6, 1.8]], [[1.0, 1.0, 1.2, 1.4, 1.4, 1.4, 1.5267476484891433, 1.6, 1.8]], [[1.1, 2.2, 3.3, 5.1, 5.605725348678288]], [[1.1, 1.3, 1.395275547571625, 1.4603348592696748, 1.7891067661112277, 2.3827054707590554, 10.0]], [[1.1, 1.3, 1.395275547571625, 1.5267476484891433, 1.9065922001939695, 10.0]], [[2.4, 5.1]], [[1.1963194756636508, 1.3, 2.0, 2.1, 2.2, 2.4, 2.424000205756431, 2.5, 3.4, 14.5]], [[0.5530302075029647, 1.1, 1.1, 1.3, 1.395275547571625, 1.395275547571625, 1.395275547571625, 1.395275547571625, 1.4, 10.0]], [[1.0, 1.0, 1.2, 1.4, 1.4, 1.5267476484891433, 1.6, 1.8, 2.3827054707590554, 9.819481586162372]], [[-0.36581021654089096, 0.9, 1.0, 1.8, 2.5]], [[1.1, 1.3, 1.395275547571625, 1.395275547571625, 1.4, 1.4603348592696748, 1.7891067661112277, 2.0458316789819433]], [[3.4, 5.6, 8.1, 14.5, 21.7, 21.7]], [[0.5, 0.9, 1.2, 2.5, 2.9, 3.1, 3.1, 14.5]], [[2.801058079332841, 5.6, 8.1, 14.5, 21.7, 21.7]], [[0.9785581741632983, 1.0, 1.2, 1.4, 1.4, 1.4, 1.6, 1.8]], [[0.5, 0.9, 1.2, 1.8, 2.5, 2.6605281965718235, 3.1]], [[0.833907583498922, 1.0, 1.0, 1.2, 1.4, 1.4, 1.4, 1.6, 1.8]], [[3.0, 3.3, 5.0, 7.0]], [[1.0, 2.0458316789819433, 3.0, 5.0, 7.0, 9.0]], [[0.5, 1.0, 2.0, 2.276052871016944, 3.0, 5.0, 5.5341526068204185]], [[1.0, 1.0, 1.0, 3.0, 5.0, 5.0, 7.0, 9.0]], [[0.5127269056999775, 1.0, 1.0, 1.0, 3.0, 5.0, 7.0, 9.0]], [[1.1, 3.3, 5.1, 5.605725348678288]], [[0.5, 2.0, 2.276052871016944, 2.276052871016944, 2.276052871016944, 3.0, 4.0, 5.0]], [[2.0, 2.3, 2.3, 2.4, 2.4]], [[1.3, 1.3, 1.395275547571625, 1.4, 1.9701824712767706]], [[1.0, 2.0458316789819433, 3.0, 4.565252363825356, 7.0, 7.0]], [[0.790113744385612, 1.0, 1.0, 1.2, 1.4, 1.4, 1.4, 1.5267476484891433, 1.6, 1.8, 1.8775084870729148, 2.3827054707590554, 9.819481586162372]], [[1.5575018658936712, 2.2, 3.3, 5.1, 7.8, 9.9]], [[1.1, 1.1, 1.2, 1.3, 10.0]], [[1.1, 2.65618349195373, 3.3, 5.1, 5.605725348678288, 7.8, 7.8]], [[0.8643084490077626, 1.1, 1.395275547571625, 1.4603348592696748, 1.7891067661112277, 2.3827054707590554, 10.0]], [[1.0, 1.0, 1.0, 1.0884212994945, 3.206051292454492, 5.0, 6.465751844577957, 7.0, 7.0, 9.0]], [[1.1963194756636508, 2.0, 2.2, 2.3, 2.3827054707590554, 2.4, 2.424000205756431, 2.5, 3.4]], [[2.1, 2.3, 2.4, 3.248590254248692, 5.0, 7.8]], [[0.9, 1.2, 1.8, 2.5, 2.9, 3.1]], [[1.0, 2.2, 3.0, 5.5, 7.0, 8.1, 10.0]], [[0.5, 1.5, 2.5, 4.4, 4.5, 4.6]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09]], [[10.0, 12.2, 15.0, 20.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[-20.0, -10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 30.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0]], [[0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[1.0, 2.0, 2.1, 2.2, 2.3, 2.4, 2.5, 3.0, 3.5, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[0.5, 1.5, 1.5, 2.5, 4.4, 4.5, 4.6]], [[1.0, 2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[1.0, 3.0, 5.5, 7.0, 8.1, 10.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.4]], [[1.1814576506974284, 4.0, 6.0, 8.0, 12.0, 14.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[1.0, 1.0, 2.2, 3.0, 5.5, 7.0, 8.1, 10.0, 12.0]], [[1.1814576506974284, 4.0, 8.0, 12.0, 14.0, 18.0]], [[-20.0, -10.0, -7.0, -5.5, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 30.0]], [[2.0, 4.0, 5.2655100630808445, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[1.02, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.0, 2.2, 2.5, 3.0, 5.5, 7.0, 8.1, 10.0, 12.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[1.0, 3.0, 5.5, 7.0, 8.78882547388092, 10.0]], [[0.04099142839372982, 1.02, 4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[8.0, 10.0, 15.0, 20.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[-10.0, 2.0, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.04099142839372982, 4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[0.9, 1.0, 1.1, 1.2, 1.3, 1.5]], [[0.5, 1.5, 1.5, 2.5, 4.5, 4.5, 4.6, 8.5]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[1.1, 1.5, 4.4, 4.6, 4.939076975024989, 30.0]], [[2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.3045571102030344, 4.0, 6.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 16.0, 18.0, 20.0, 20.0]], [[0.9, 1.0, 1.1, 1.2, 1.3, 1.5, 5.0]], [[2.0, 4.0, 6.0, 6.158193327872366, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0]], [[0.0, 1.0, 2.0, 3.0, 4.0, 4.116320447941627, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[8.0, 10.0, 15.0, 20.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[0.9, 1.0, 1.1, 1.2, 1.2994894489778384, 1.5]], [[0.9, 1.1, 1.2, 1.3, 1.5, 16.382610224991176]], [[1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[1.5690704627594818, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 4.0, 5.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 2.4746384005005804, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[1.0, 2.0, 2.0, 2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.0772407046865693, 1.09, 1.4, 1.5]], [[0.5, 1.5, 2.5, 4.4, 4.5, 4.6, 6.665410244529757]], [[0.9, 1.1, 1.2, 1.3, 1.5]], [[1.1814576506974284, 4.0, 6.0, 8.0, 14.0, 18.0, 20.0]], [[1.0, 3.0, 5.5, 7.0, 8.1, 8.1, 10.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[0.0, 1.0, 2.0, 3.0, 4.0, 4.116320447941627, 5.5, 6.5, 6.897666475955764, 7.0, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.8669891442380135, 0.9, 1.1, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874]], [[0.01, 0.02, 0.03, 0.034315406660118855, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 3.0, 4.0, 5.0]], [[0.9, 1.1, 1.2, 1.3, 1.5, 1.5, 1.5]], [[2.0, 2.0, 4.0, 6.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[0.8, 0.9, 1.0, 1.1, 1.3, 1.4, 1.5]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 18.0, 20.0, 20.0, 20.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[-10.0, 2.0, 2.0, 4.0, 6.0, 7.499866250660795, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[1.0, 1.5, 3.0, 5.5, 7.0, 8.1, 10.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[0.5139198781210071, 0.6184885915334304, 0.8669891442380135, 0.9, 1.02, 1.2, 1.2994894489778384, 1.5]], [[2.0, 6.0, 8.0, 10.0, 10.928876492306518, 16.0, 18.0, 20.0, 20.299145411424135]], [[1.1814576506974284, 4.0, 6.0, 8.0, 12.0, 18.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[1.6560261484277246, 2.0, 2.0, 4.0, 6.429181592060958, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[1.07, 1.5690704627594818, 6.0, 8.0, 10.0, 14.0, 15.798039725437825, 18.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[0.9, 1.1, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195]], [[1.08, 1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0]], [[0.5, 1.5, 1.5, 2.5, 4.5, 4.5, 4.6]], [[0.9, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195, 6.5]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0, 20.0]], [[0.5, 1.5, 1.5, 1.5, 2.5, 4.5, 4.5, 4.6, 8.5]], [[-5.5, 1.0, 1.01, 1.02, 1.03, 1.04, 1.06, 1.07, 1.0772407046865693, 1.09, 1.5]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[1.03, 2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[0.8, 0.8, 0.9, 1.0, 1.1, 1.3, 1.4, 1.5]], [[2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.1, 1.1814576506974284, 1.5, 4.6, 30.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 18.0, 20.0, 20.0, 20.0]], [[-5.5, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.09, 1.5]], [[1.5, 2.5, 4.4, 4.5, 4.6]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 40.0, 45.0, 45.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[1.0, 1.7865124688376424, 2.0, 2.1, 2.3, 2.4, 2.4746384005005804, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[6.599012700484447, 10.0, 15.0, 20.0, 25.0, 30.0, 32.696672390862496, 35.0, 40.0, 45.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[1.0, 2.2, 2.5, 3.0, 3.0, 5.5, 7.0, 8.1, 10.0, 12.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[1.0, 2.2, 2.5, 3.0, 3.0, 4.0767066000694365, 5.5, 5.5, 5.5, 7.0, 8.1, 10.0, 12.0]], [[2.0, 4.0, 6.0, 9.46529267466774, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[1.03, 2.0, 4.0, 4.5, 6.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 6.0, 7.114467485940238, 8.0, 10.0, 16.0, 18.0, 20.0, 20.0]], [[0.04099142839372982, 1.01, 4.0, 6.0, 6.0, 6.5, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.0, 2.0, 2.0, 2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 8.0, 9.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 6.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[1.02, 2.3, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[0.04099142839372982, 1.01, 4.0, 5.411478708195559, 6.0, 6.0, 6.5, 8.0, 10.0, 11.11260309319111, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.3045571102030344, 4.0, 6.0, 8.0, 8.0, 12.0, 14.0, 14.0, 15.546107430151807, 18.0]], [[1.02, 2.3, 4.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[1.0, 1.07, 1.1, 1.1, 1.2, 1.3, 1.5, 5.0]], [[0.9, 1.0, 1.2, 1.2994894489778384, 1.5, 40.0]], [[0.04099142839372982, 1.01, 4.0, 5.411478708195559, 5.411478708195559, 6.0, 6.0, 6.5, 8.0, 10.0, 11.11260309319111, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.0, 2.2, 2.5, 3.0, 5.5, 7.0, 8.1, 10.0, 12.0, 20.299145411424135]], [[-0.6666213882097827, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 3.0, 4.0, 5.0]], [[1.5, 7.499866250660795, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[0.8669891442380135, 0.9, 1.1, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874, 6.5]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 30.0, 35.0, 40.0, 40.0, 40.0, 45.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[6.599012700484447, 10.0, 15.0, 20.0, 25.155142584904603, 30.0, 32.696672390862496, 35.0, 39.332502120913084, 40.0, 45.0, 50.0, 55.0, 55.89445078247812, 68.29873194324149]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0]], [[1.3045571102030344, 4.0, 6.0, 8.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[-0.6666213882097827, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 3.0, 4.0, 4.0, 5.0]], [[2.0, 4.0, 4.0, 5.2655100630808445, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[-0.6666213882097827, 0.02, 0.03, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 3.0, 4.0, 5.0]], [[1.0, 2.2, 2.5, 3.0, 7.0, 8.1, 10.0, 12.0]], [[0.6184885915334304, 1.1, 1.5, 4.4, 4.6, 4.939076975024989]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.0, 8.160853174340843, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.8, 0.9, 1.0, 1.1, 1.4, 1.5]], [[1.5, 1.5, 9.53381250714651, 10.0, 12.2, 15.0, 25.0, 25.0, 29.831398888667575, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[1.0, 2.2, 3.0, 5.5, 5.551571029636836, 7.0, 8.1, 10.0]], [[-10.0, 2.0, 4.0, 6.0, 8.0, 9.0, 10.0, 14.0, 17.571401589748874, 20.0, 20.0]], [[0.0, 0.5, 2.0, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.9, 1.0, 1.1, 1.2, 1.3, 5.0]], [[1.08, 1.6560261484277246, 2.0, 2.0, 4.0, 5.947417635576787, 6.0, 8.0, 8.44265458853031, 12.0, 14.0, 16.0, 18.0]], [[0.5139198781210071, 0.8669891442380135, 0.9, 1.02, 1.2, 1.2994894489778384, 1.3863619602788184, 1.818731078819195]], [[1.0, 2.5, 3.0, 4.0, 7.0, 8.1, 10.0, 12.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 8.0, 8.5, 9.0, 11.0, 20.0]], [[1.1814576506974284, 4.0, 6.0, 12.0, 18.0, 20.0]], [[3.5, 8.0, 10.0, 11.11260309319111, 15.0, 20.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[1.0, 1.02, 3.0, 5.5, 7.0, 10.0]], [[0.5139198781210071, 0.6184885915334304, 0.8669891442380135, 0.9, 1.02, 1.2, 1.2, 1.2994894489778384, 55.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 40.0, 45.0, 45.0, 50.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[0.0, 0.01, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 7.806074229380199, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 17.017909644933226, 18.0, 20.0, 20.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 6.5, 6.599012700484447, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.01, 0.02, 0.03, 0.034315406660118855, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0, 5.221177911957358]], [[0.9, 0.9, 1.1, 1.2, 1.3, 1.5, 1.5, 1.818731078819195]], [[0.8469491643968111, 1.3045571102030344, 2.2, 2.5, 3.0, 7.0, 8.1, 10.0, 12.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 20.0, 25.0, 25.0, 25.0, 26.97451098928445, 30.0, 35.0, 40.0, 45.0, 49.10291931707272, 50.0, 55.0, 60.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.5050122069252874, 8.160853174340843]], [[0.9, 0.9724428236562728, 1.0, 1.1, 1.3, 1.4, 1.5]], [[-5.5, 0.9, 1.1, 1.2, 1.3, 1.5, 1.5, 1.818731078819195]], [[0.0, 0.5, 0.5139198781210071, 2.0, 2.5, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 20.0]], [[0.01, 0.02, 0.03, 0.034315406660118855, 0.04, 0.05, 0.12421918650107888, 2.0, 3.0, 4.0, 5.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 4.0, 5.0]], [[1.0, 1.5, 3.0, 5.5, 7.0, 8.1, 8.160853174340843, 10.0]], [[0.0, 1.0, 2.0, 3.0, 4.0, 4.116320447941627, 5.5, 6.5, 6.897666475955764, 7.0, 8.0, 8.5, 9.0, 11.0, 20.0, 20.0]], [[1.0, 2.2, 2.5, 3.0, 3.0, 3.0, 5.5, 7.0, 8.1, 10.0, 12.0]], [[0.28103973290652706, 0.8669891442380135, 0.9, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874, 6.5]], [[-20.0, 1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 45.0, 50.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 10.0, 20.0]], [[1.3045571102030344, 4.0, 6.0, 6.0, 8.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[0.5, 1.5, 4.4, 4.5, 4.6, 5.234353973789352, 6.665410244529757, 25.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 18.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 20.0]], [[1.0, 1.0, 2.2, 5.5, 5.947417635576787, 7.0, 8.1, 10.0, 12.0, 68.29873194324149]], [[6.599012700484447, 10.0, 15.0, 20.0, 25.0, 30.0, 32.696672390862496, 35.0, 40.0, 45.0, 50.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[2.0, 4.0, 6.0, 6.0, 8.0, 10.0, 12.0, 14.0, 14.0, 16.382610224991176, 18.0, 19.576719293639055]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 27.787145135987792]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 8.44265458853031, 10.0, 12.0, 13.788619379218963, 14.0, 16.0, 16.0, 27.787145135987792]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0]], [[0.04099142839372982, 1.01, 4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0, 20.0]], [[1.0, 1.7865124688376424, 2.0, 2.1, 2.3, 2.356960463661484, 2.4746384005005804, 3.0, 3.218109998725394, 3.3623458011252803, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[1.0, 2.2, 3.0, 5.5, 5.551571029636836, 7.0, 10.0]], [[0.9, 1.0, 1.1, 1.2, 1.5]], [[-20.0, 2.0, 4.0, 4.0, 5.2655100630808445, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[1.0, 1.0, 2.2, 3.0, 5.5, 8.1, 10.0, 12.0]], [[2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 20.0, 20.0, 20.0, 20.0]], [[0.12421918650107888, 1.0, 2.2, 3.0, 5.5, 5.551571029636836, 7.0]], [[1.08, 1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 9.822157022781347, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0]], [[-5.5, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.0772407046865693, 1.09, 1.5]], [[1.02, 2.3, 4.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0]], [[2.0, 4.0, 6.0, 9.46529267466774, 9.46529267466774, 10.0, 12.0, 14.0, 16.0, 20.0]], [[0.28103973290652706, 0.8669891442380135, 1.2, 1.2994894489778384, 1.5, 6.5]], [[0.04099142839372982, 1.01, 4.0, 5.411478708195559, 5.411478708195559, 6.0, 6.0, 6.0, 6.5, 8.0, 10.0, 11.11260309319111, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.0, 1.5, 3.0, 5.5, 7.0, 8.1, 8.466001202728346, 8.95101932968127, 10.0]], [[1.02, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[1.08, 1.6560261484277246, 2.0, 2.0, 4.0, 5.947417635576787, 6.0, 8.0, 8.44265458853031, 12.0, 12.418249060121813, 14.0, 16.0, 18.0]], [[0.8469491643968111, 2.2, 2.5, 3.0, 7.0, 8.1, 10.0, 12.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.269254657391212, 9.0, 10.0, 11.0, 20.0]], [[0.5, 1.02, 2.3, 3.14159, 4.0, 6.0, 8.0, 10.0, 14.0, 16.767545759200633, 17.017909644933226, 17.571401589748874, 18.0, 20.0, 20.0]], [[8.0, 10.0, 15.0, 20.0, 25.0, 35.0, 40.0, 45.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 10.0, 13.824069802841814, 20.0]], [[-0.4435944565678805, 0.01, 0.02, 0.03, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 3.0, 4.0, 5.0]], [[0.12421918650107888, 1.0, 1.818731078819195, 2.2, 3.0, 5.5, 5.551571029636836, 6.403237256252221]], [[0.5, 1.5, 1.5, 2.5, 4.4, 4.5, 4.6, 4.6]], [[1.5, 9.53381250714651, 10.0, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 25.0, 26.97451098928445, 30.0, 35.0, 40.0, 45.0, 49.10291931707272, 50.0, 55.0, 60.0]], [[1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0, 26.795571288047835]], [[4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 18.749468845893265, 20.0, 20.0, 20.0]], [[1.3045571102030344, 4.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[1.3045571102030344, 4.0, 6.0, 8.0, 8.0, 8.29697380414211, 12.0, 14.0, 14.0, 18.0, 20.0, 20.42203827416755]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.269254657391212, 9.0, 10.0, 11.0, 20.0]], [[1.3045571102030344, 4.0, 6.0, 6.429181592060958, 8.0, 8.0, 8.29697380414211, 12.0, 14.0, 18.0, 20.0, 20.42203827416755]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 15.76994730012607, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[0.5, 0.9662373014773534, 1.5, 2.5, 4.5, 4.5, 4.6]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 40.0, 45.0, 45.0, 50.0, 50.26009016575274, 55.0, 59.86524667040781, 60.0]], [[0.01, 0.02, 0.03, 0.04, 1.0, 2.0, 3.0, 4.0, 4.0, 5.0]], [[-20.0, 1.02, 2.3, 4.0, 6.0, 8.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.327988671440092, 20.0, 20.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 15.798039725437825, 20.0]], [[1.3045571102030344, 1.7865124688376424, 4.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[1.02, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 9.417859749600701, 10.0, 12.0, 14.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 12.2, 16.0, 18.0, 20.0, 20.0]], [[0.5, 1.5, 4.4, 4.5, 4.6, 4.6, 5.234353973789352, 6.665410244529757, 25.0]], [[1.0, 1.02, 3.0, 5.5, 10.0]], [[1.0, 3.0, 5.5, 8.1, 10.0, 10.0]], [[1.3045571102030344, 1.7865124688376424, 4.0, 8.0, 12.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[1.0, 3.0, 7.0, 8.1, 10.0]], [[-0.4435944565678805, 0.01, 0.02, 0.03, 0.05, 0.05028614760154865, 2.0, 3.0, 3.0, 4.0, 5.0, 19.576719293639055]], [[0.5, 1.5, 2.5, 4.4, 4.5, 4.6, 6.665410244529757, 25.155142584904603]], [[1.02, 2.9330272852017845, 4.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 4.798779233017978, 6.0, 7.0, 8.0, 9.0, 10.0]], [[0.04099142839372982, 0.04099142839372982, 4.0, 6.0, 6.0, 6.209009875631743, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 4.0, 5.0, 7.114467485940238, 55.89445078247812]], [[1.02, 1.466541278824319, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 14.0, 16.0, 16.0, 18.0, 20.0, 20.0]], [[-5.5, 0.4232216344489177, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.0772407046865693, 1.0772407046865693, 1.09, 1.5]], [[-10.0, 2.0, 2.0, 4.0, 6.0, 7.499866250660795, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[1.02, 1.1814576506974284, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0]], [[1.0, 1.1, 1.2, 1.5]], [[-20.0, 2.0, 4.0, 4.0, 5.2655100630808445, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 20.0]], [[0.0, 0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 13.77605677385521, 15.798039725437825, 20.0]], [[0.9662373014773534, 1.0, 2.2, 2.5, 2.5, 2.8599183671220882, 5.5, 7.0, 8.1, 10.0, 12.0, 12.0]], [[1.0, 2.8599183671220882, 3.0, 5.5, 8.1, 10.0]], [[0.04099142839372982, 1.02, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.01, 0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 1.9001113401579832, 2.0, 4.0, 4.0, 5.0]], [[4.4, 4.4, 4.6, 4.939076975024989, 6.158193327872366, 30.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0]], [[0.04, 0.5139198781210071, 0.688267766025751, 0.9, 1.1, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874]], [[0.9, 1.0, 1.1, 1.3, 1.4, 1.5, 3.14159]], [[0.0, 0.5, 2.0, 3.0, 3.472532087278931, 5.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[1.02, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 8.95101932968127, 10.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 3.0, 4.0, 4.0, 5.0]], [[2.0, 2.1, 2.3, 2.4, 3.0, 3.218109998725394, 4.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 3.0, 4.0, 5.0, 7.114467485940238, 55.89445078247812]], [[1.0, 2.0, 2.1, 2.3, 2.4, 2.8599183671220882, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 10.0, 35.0, 49.10291931707272]], [[0.5139198781210071, 0.688267766025751, 0.688267766025751, 0.9, 0.9, 1.1, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874]], [[1.02, 1.1814576506974284, 1.1814576506974284, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0]], [[2.3, 4.0, 6.0, 8.0, 8.165060725213888, 10.0, 14.0, 14.0, 16.0, 16.0, 20.0, 20.0, 20.0, 23.168506393906302]], [[-5.5, 1.0, 1.01, 1.02, 1.03, 1.04, 1.06, 1.07, 1.0772407046865693, 1.09, 1.2236675297369042, 1.5, 3.218109998725394]], [[0.5, 1.5, 2.5, 4.4, 4.5, 6.665410244529757, 7.114467485940238]], [[1.08, 1.6560261484277246, 2.0, 2.0, 4.0, 5.947417635576787, 5.947417635576787, 6.0, 8.0, 8.44265458853031, 12.0, 14.0, 16.0, 18.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 12.2, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 18.0, 20.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0, 8.5, 15.798039725437825]], [[0.9, 1.2, 1.2, 1.3, 1.5, 1.5, 1.5, 1.5297371940268396, 1.818731078819195]], [[-20.0, -10.0, -7.924856117004536, -7.924856117004536, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 30.0]], [[2.3, 4.0, 6.0, 6.205105396326149, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 19.602621522082107, 20.0, 20.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[-20.0, 1.5, 8.269254657391212, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 45.0, 50.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[1.0, 1.5, 3.0, 3.0, 5.5, 8.466001202728346, 8.95101932968127, 8.95101932968127, 10.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0, 21.776020048455045]], [[-10.0, 2.0, 4.0, 6.0, 8.0, 10.0, 13.824069802841814, 14.0, 16.0, 18.0, 20.0, 20.0]], [[1.1814576506974284, 6.0, 8.0, 12.0, 14.0, 18.0, 20.0]], [[1.0, 1.0, 2.0, 2.1, 2.3, 3.0, 3.218109998725394, 3.221514033861171, 4.0, 4.798779233017978, 6.0, 7.0, 8.0, 9.0, 10.0]], [[1.02, 2.3, 4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[0.8669891442380135, 0.9, 1.1, 1.1774230759627462, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874, 6.5]], [[0.02, 0.5, 1.5, 1.5, 1.5, 2.5, 4.5, 4.5]], [[0.9, 0.9, 1.0, 1.1, 1.3, 1.4, 1.5]], [[4.0, 6.0, 6.0, 8.0, 10.0, 12.0, 14.0, 18.0, 18.749468845893265, 20.0, 20.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 3.888075639562932, 4.0, 4.0767066000694365, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0]], [[1.5690704627594818, 1.5690704627594818, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 3.218109998725394, 4.0, 6.0, 7.0, 7.3360191113939095, 8.0, 8.0, 9.0, 10.0]], [[2.0, 4.0, 4.0, 5.2655100630808445, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[8.1, 10.0, 15.0, 20.0, 25.0, 35.0, 40.0, 50.0, 55.0, 55.0, 68.29873194324149]], [[1.0, 2.2, 2.5, 3.0, 3.0, 4.0767066000694365, 5.5, 5.5, 5.5, 5.5, 7.0, 10.0, 12.0]], [[0.9, 0.9037214840830983, 1.2, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195]], [[0.02, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0]], [[0.02, 0.05, 1.0, 1.0962359918452567, 2.0, 3.0, 4.0, 5.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 3.218109998725394, 4.0, 6.0, 7.0, 7.3360191113939095, 8.0, 8.0, 10.0]], [[0.04099142839372982, 1.01, 4.0, 4.349151293837573, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 18.0, 20.0, 20.0, 20.0, 26.229273556591572]], [[0.9, 0.9037214840830983, 1.2, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195, 15.0, 15.0]], [[2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 20.0, 20.0, 20.0, 20.0, 20.187288588389958]], [[1.3045571102030344, 2.0895046761278855, 6.0, 6.0, 8.0, 8.0, 8.92786079014893, 12.0, 14.0, 14.0, 18.0, 20.0]], [[1.0, 1.0, 2.2, 3.0, 5.5, 8.1, 10.0, 10.0, 12.0]], [[1.1, 1.2, 1.3, 1.5, 1.5, 1.5]], [[0.9, 0.943395611525982, 1.0, 1.1, 1.2, 1.3, 1.5]], [[0.02, 0.5, 1.5, 1.5, 1.5, 1.5, 2.5, 4.5, 4.5, 5.473257313004003]], [[4.0, 6.0, 10.0, 13.262375674219438, 14.0, 14.0, 16.0, 18.0, 18.436316131164133, 20.0, 20.0, 20.0]], [[1.02, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 9.91722512272562, 10.0, 12.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0]], [[1.0, 1.07, 1.1, 1.1, 1.2, 1.3, 1.5, 5.0, 39.332502120913084]], [[2.3, 4.0, 6.0, 6.0, 8.0, 12.0, 14.0, 18.0, 18.749468845893265, 20.0, 20.0, 20.0, 20.0]], [[2.0, 2.8856343453453412, 4.0, 4.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 18.129628808825963, 20.0]], [[1.02, 2.0, 2.0, 3.957403606421238, 4.0, 4.5, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[-0.6666213882097827, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 2.0, 3.0, 4.0, 4.0, 4.394299899024294, 5.0]], [[2.0, 2.0, 4.0, 4.116320447941627, 6.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 10.0, 14.0, 14.418547049602209, 16.0, 18.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[0.9, 0.9, 1.0, 1.1, 1.3, 1.3, 1.4, 1.5]], [[0.8669891442380135, 0.9, 1.02, 1.2, 1.2994894489778384, 1.3863619602788184, 1.818731078819195]], [[1.5, 9.53381250714651, 10.0, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 25.0, 26.97451098928445, 30.0, 35.0, 35.0, 40.0, 45.0, 49.10291931707272, 50.0, 55.0, 60.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.06, 1.0772407046865693, 1.09, 1.0955579192553242, 1.4, 7.0]], [[2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[0.6184885915334304, 1.02, 2.9330272852017845, 4.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0]], [[1.6455807679446233, 5.5, 7.0, 8.1, 10.0]], [[0.8669891442380135, 1.2994894489778384, 1.5, 6.5]], [[1.0, 1.0, 1.04, 2.2, 3.0, 5.5, 8.1, 12.0, 12.345]], [[1.0, 1.1924738153692487, 2.2, 3.0, 4.45315095513391, 5.280495862081772, 5.5, 10.0, 10.0, 12.0]], [[0.9, 1.0, 1.1, 1.3, 5.0]], [[0.0, 0.5, 1.1, 2.0, 3.0, 3.888075639562932, 4.0, 4.0767066000694365, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.0, 8.5, 9.0, 10.0, 11.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 1.0, 3.0, 4.0, 5.0, 8.5, 15.798039725437825]], [[2.0, 2.8856343453453412, 4.0, 4.0, 8.0, 10.0, 10.116257863367483, 12.0, 14.0, 16.382610224991176, 18.0, 18.129628808825963, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09, 35.0]], [[1.3045571102030344, 2.0895046761278855, 6.0, 6.0, 8.0, 8.0, 8.92786079014893, 12.0, 14.0, 14.0, 18.0, 20.0, 25.155142584904603]], [[0.0, 0.01, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.806074229380199, 8.0, 8.5, 9.0, 11.0, 13.064576749502223, 20.0, 45.0]], [[6.599012700484447, 6.599012700484447, 10.0, 15.0, 20.0, 25.155142584904603, 30.0, 32.696672390862496, 35.0, 39.332502120913084, 40.0, 45.0, 50.0, 55.0, 55.89445078247812, 68.29873194324149]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 16.0, 16.767545759200633, 18.0, 18.0, 20.0, 20.0, 20.0]], [[1.0, 1.0, 2.2, 5.5, 5.947417635576787, 5.947417635576787, 7.0, 8.1, 10.0, 12.0, 68.29873194324149]], [[1.02, 2.3, 4.0, 6.0, 7.475004333922216, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 5.0, 8.5, 15.798039725437825]], [[1.02, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0]], [[1.1, 1.3, 1.5, 1.5, 1.5, 1.5]], [[-7.0, 1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[1.02, 2.3, 2.3, 2.8618583668856092, 6.0, 8.0, 9.267942797567402, 10.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 18.0, 20.0, 20.0, 20.0]], [[-5.5, 0.4232216344489177, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.0772407046865693, 1.0772407046865693, 1.0772407046865693, 1.09, 1.5]], [[1.5, 7.499866250660795, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[0.5, 1.02, 3.14159, 4.0, 6.0, 8.0, 10.0, 14.0, 16.767545759200633, 17.017909644933226, 17.571401589748874, 18.0, 19.806219144943235, 20.0, 20.6630094716787]], [[1.0, 1.0, 2.2, 3.0, 5.5, 8.1, 8.1, 8.1, 10.0, 12.0, 14.161005217271027]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0, 20.0]], [[4.0, 6.0, 6.0, 10.0, 14.0, 16.0, 18.0, 18.749468845893265, 20.0, 20.0, 20.0]], [[0.04099142839372982, 1.0772407046865693, 4.0, 6.0, 6.5, 6.822814323950394, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[-20.0, 1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 45.0, 45.0, 50.0, 50.0, 50.0, 50.26009016575274, 55.0, 60.0]], [[1.0, 2.2, 2.5, 3.0, 3.0, 4.0767066000694365, 5.5, 5.5, 5.5, 7.0, 8.1, 10.0]], [[1.0, 1.5, 3.0, 3.0, 5.5, 8.466001202728346, 8.95101932968127, 10.0]], [[0.6184885915334304, 1.1, 1.5, 4.6, 4.939076975024989, 6.0]], [[0.0, 0.5, 0.5139198781210071, 1.3045571102030344, 2.0, 2.5, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 8.0, 8.5, 9.0, 10.0, 20.0]], [[0.047547201476359824, 2.2, 3.0, 5.5, 5.551571029636836, 5.551571029636836, 10.0]], [[0.28103973290652706, 0.8669891442380135, 0.9, 1.2, 1.2994894489778384, 1.5050122069252874, 1.7604712793484323, 6.5]], [[1.0, 2.2, 2.5, 5.5, 7.0, 8.1, 10.0, 12.0, 12.418249060121813]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 11.899754514324702, 12.0, 16.0, 16.0]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[1.6455807679446233, 1.9788644804016007, 5.5, 7.0, 8.1, 10.0]], [[0.5, 1.5, 2.5, 4.5, 4.5, 4.6]], [[2.0, 2.0, 4.0, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 12.0, 14.0, 16.0, 16.0, 16.0, 18.0, 20.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 2.0, 2.3, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 27.787145135987792]], [[2.3, 2.3, 2.4, 4.0, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 20.0, 20.0, 20.0]], [[1.08, 1.5297371940268396, 1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 9.822157022781347, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0]], [[0.5, 1.02, 2.3, 3.14159, 4.0, 6.0, 8.0, 10.0, 14.0, 16.767545759200633, 17.017909644933226, 17.571401589748874, 18.0, 18.0, 20.0, 20.0]], [[4.0, 6.0, 6.0, 8.0, 11.207230408564428, 12.0, 14.0, 18.0, 18.749468845893265, 20.0]], [[12.2, 20.0, 25.0, 30.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[-0.6666213882097827, 0.02, 0.03, 0.04, 0.05, 0.05028614760154865, 1.0, 1.0, 2.0, 3.0, 3.0, 4.0, 4.0, 5.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 2.4746384005005804, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 10.0]], [[0.01, 0.02, 0.03, 0.04, 0.05028614760154865, 3.0, 4.0, 4.0, 5.0, 7.114467485940238, 18.0, 56.85662291559699]], [[2.0, 4.0, 6.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.0, 0.01, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.806074229380199, 7.806074229380199, 8.0, 8.5, 9.0, 11.0, 13.064576749502223, 20.0, 45.0]], [[1.3863619602788184, 2.0895046761278855, 4.0767066000694365, 6.0, 6.0, 10.0, 14.0, 16.0, 18.0, 18.749468845893265, 20.0, 20.0]], [[0.04099142839372982, 1.08, 1.5297371940268396, 1.6560261484277246, 2.0, 2.0, 4.0, 6.0, 7.0820683754231695, 8.44265458853031, 9.822157022781347, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0]], [[1.5, 8.44265458853031, 9.53381250714651, 10.0, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 26.97451098928445, 30.0, 35.0, 35.0, 40.0, 45.0, 49.10291931707272, 50.0, 55.0, 60.0]], [[2.0, 4.0, 4.0, 5.2655100630808445, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 6.0, 7.114467485940238, 8.0, 10.0, 16.0, 18.0, 19.72261389713443, 20.0, 20.0]], [[2.0, 4.0, 4.349151293837573, 6.0, 8.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[1.02, 2.0, 2.0, 3.546654362764467, 4.0, 4.5, 6.029698420802205, 6.029698420802205, 8.44265458853031, 9.417859749600701, 10.0, 12.0, 14.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 6.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 14.0, 14.418547049602209, 16.0, 18.0, 18.0, 18.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 15.76994730012607, 16.0, 16.0, 18.0, 20.0]], [[1.0, 2.0082030251683296, 3.0, 5.5, 7.0, 8.1, 10.0]], [[0.5, 1.02, 2.3, 3.14159, 3.15574335268653, 4.0, 6.0, 6.927259205596625, 8.0, 10.0, 14.0, 16.767545759200633, 17.017909644933226, 17.571401589748874, 18.0, 18.0, 20.0, 20.0]], [[-5.5, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.0772407046865693, 1.09, 1.5, 10.0]], [[0.5, 1.5, 4.4, 4.5, 4.6, 4.6, 5.234353973789352, 6.665410244529757, 25.0, 25.0]], [[1.0, 1.01, 1.02, 1.03, 1.05, 1.06, 1.06, 1.0772407046865693, 1.09, 1.0955579192553242, 1.4, 1.5039503277778656, 4.180523818260757, 7.0]], [[1.1, 1.2, 1.5]], [[0.0, 0.5, 2.0, 2.8618583668856092, 3.0, 4.0, 5.0, 5.5, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.0, 8.160853174340843, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.234353973789352, 5.5, 5.5, 6.0, 6.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.269254657391212, 10.0, 11.0, 20.0]], [[1.7604712793484323, 2.0, 4.0, 6.0, 6.0, 8.0, 10.0, 12.0, 16.382610224991176, 18.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 17.017909644933226, 18.0, 20.0, 20.0, 20.0]], [[1.0, 1.7865124688376424, 2.0, 2.1, 2.3, 2.4, 2.4746384005005804, 3.0, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0]], [[0.0, 0.5, 0.8469491643968111, 2.0, 2.8618583668856092, 3.0, 4.0, 5.0, 5.5, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.0, 8.160853174340843, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[1.0, 2.0082030251683296, 5.5, 7.0, 8.1, 10.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0, 20.122031404033642]], [[1.0, 2.5, 3.0, 3.0, 4.0767066000694365, 5.5, 5.5, 5.5, 7.0, 8.1, 10.0]], [[1.0, 2.0, 2.1, 2.3, 2.4, 2.4, 2.8599183671220882, 3.0, 3.218109998725394, 4.0, 5.0, 6.0, 7.0, 8.0, 10.0, 35.0, 49.10291931707272]], [[1.0, 1.0, 1.0, 2.2, 3.0, 5.5, 8.1, 10.0, 10.0, 12.0]], [[0.047547201476359824, 0.047547201476359824, 1.0, 2.2, 2.5, 3.0, 5.5, 8.1, 10.0, 12.0]], [[-0.4435944565678805, 0.01, 0.01, 0.02, 0.03, 0.05, 0.05028614760154865, 3.0, 3.0, 4.0, 5.846567632615504, 19.576719293639055]], [[2.9330272852017845, 4.0, 8.0, 10.0, 13.064576749502223, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0]], [[1.0, 1.0, 1.04, 1.9399653370329437, 2.2, 2.2, 3.0, 5.5, 8.1, 12.0, 12.345]], [[0.04099142839372982, 1.01, 4.0, 6.0, 6.0, 6.5, 8.0, 8.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 8.44265458853031, 8.536569059145345, 10.0, 10.0, 12.0, 16.0, 16.0, 18.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0, 19.687269573467056]], [[0.5, 1.02, 2.3, 2.3, 3.14159, 3.15574335268653, 4.0, 6.0, 6.927259205596625, 8.0, 10.0, 14.0, 16.767545759200633, 17.017909644933226, 17.571401589748874, 18.0, 18.0, 20.0, 20.0]], [[0.5, 1.5, 4.4, 4.6, 5.234353973789352, 6.665410244529757, 25.0]], [[1.3045571102030344, 2.2, 2.5, 3.0, 3.0, 5.947417635576787, 7.0, 8.1, 10.0, 10.993269956834816, 12.0, 26.229273556591572]], [[1.5, 3.0, 5.5, 7.0, 8.1, 10.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.2191751894779]], [[6.599012700484447, 6.599012700484447, 10.0, 15.0, 25.155142584904603, 30.0, 32.696672390862496, 35.0, 39.332502120913084, 40.0, 45.0, 50.0, 55.0, 55.89445078247812, 68.29873194324149]], [[0.5, 1.5, 2.5, 4.4, 4.5, 4.6]], [[0.0, 0.5, 0.5139198781210071, 2.0, 2.5, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 9.0, 10.0, 20.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 14.0, 14.0, 16.0, 16.767545759200633, 17.53373065895191, 18.0, 20.0, 20.0, 20.0]], [[1.0, 1.01, 1.03, 1.04, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09, 1.3756762743992506, 1.5050122069252874, 8.160853174340843]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 25.0, 30.0, 35.0, 35.0, 40.0, 45.0, 50.0, 55.0, 60.0]], [[1.0, 3.0, 5.5, 5.551571029636836, 7.0, 8.1, 10.0, 12.0]], [[1.08, 1.6560261484277246, 2.0, 2.0, 2.5, 4.0, 6.0, 8.0, 8.0, 8.44265458853031, 12.0, 14.0, 16.0, 18.0]], [[1.0, 1.0, 1.0, 1.220256107767016, 2.2, 3.0, 5.5, 8.1, 10.0, 10.0, 12.0]], [[2.0, 4.0, 6.0, 9.46529267466774, 10.0, 11.142506383321514, 12.0, 14.0, 16.0, 20.0]], [[1.0, 1.5, 3.0, 3.0, 5.5, 8.466001202728346, 8.95101932968127, 10.0, 10.0]], [[1.0, 1.01, 1.03, 1.04, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09, 1.1774230759627462, 1.3756762743992506, 8.160853174340843]], [[0.02299168798800066, 0.04099142839372982, 4.0, 6.0, 6.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.9, 1.0, 1.0772407046865693, 1.3, 1.4, 1.5, 1.5739280052557727, 3.14159]], [[1.0, 3.0, 5.5, 5.5, 5.5, 7.0, 8.1, 8.1, 8.1, 10.0]], [[0.9, 1.0, 1.1, 1.2, 1.2, 1.2994894489778384]], [[0.12421918650107888, 1.0, 2.2, 3.0, 5.5, 5.551571029636836, 7.0, 19.806219144943235]], [[0.9, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195, 6.5, 19.806219144943235]], [[0.01, 0.02, 0.04, 0.05, 1.0, 3.0, 4.0, 4.0, 5.0, 26.229273556591572]], [[1.02, 1.1924738153692487, 2.0, 2.0, 4.5, 6.029698420802205, 8.44265458853031, 9.417859749600701, 10.0, 12.0, 14.0, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 8.44265458853031, 10.0, 12.0, 13.788619379218963, 14.0, 16.0, 16.0, 27.787145135987792]], [[1.02, 2.3, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 17.017909644933226, 18.0, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 4.5, 6.0, 8.44265458853031, 10.0, 10.0, 10.0, 10.340582780598625, 14.0, 16.0, 16.0, 18.0, 20.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 4.0, 4.0, 5.0]], [[1.0, 1.01, 1.04, 1.05, 1.06, 1.06, 1.0772407046865693, 1.09, 1.0955579192553242, 1.4, 7.0]], [[1.6560261484277246, 1.8674194929061803, 2.0, 2.0, 4.0, 5.947417635576787, 5.947417635576787, 6.0, 8.0, 8.44265458853031, 12.0, 14.0, 16.0, 18.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 30.0, 35.0, 40.0, 40.0, 40.0, 45.0, 50.0, 50.26009016575274, 55.0, 60.0, 60.0]], [[1.07, 2.0, 3.2272923514971583, 4.0, 4.0, 5.2655100630808445, 10.0, 12.0, 14.0, 14.89821624719136, 16.382610224991176, 18.0, 20.0]], [[2.0, 4.0, 6.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[1.0, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.5050122069252874, 8.160853174340843]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 4.0, 4.056125258588345, 5.0]], [[1.0, 1.0, 2.2, 2.5, 3.0, 3.0, 4.0767066000694365, 5.5, 5.5, 5.5, 7.0, 8.1, 10.0]], [[-1.0, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 12.0, 14.0, 15.76994730012607, 16.0, 16.0, 18.0, 20.0]], [[1.0, 1.0, 2.2, 3.0, 5.5, 8.1, 10.0, 10.0, 13.824069802841814]], [[2.0, 4.0, 6.0, 6.158193327872366, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0]], [[-20.0, 1.5, 9.53381250714651, 10.0, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 25.0, 26.97451098928445, 30.0, 35.0, 40.0, 45.0, 49.10291931707272, 50.0, 55.0, 60.0]], [[2.0, 4.0, 4.0, 4.0, 5.2655100630808445, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.05, 1.05, 1.06, 1.06, 1.0772407046865693, 1.09, 1.0955579192553242, 1.4, 1.5039503277778656, 4.180523818260757, 7.0]], [[0.9, 1.2, 1.3, 1.5, 1.5, 1.5, 1.818731078819195, 4.5]], [[1.8286805027884407, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[1.08, 1.5297371940268396, 1.6560261484277246, 2.0, 2.0, 2.0, 4.0, 6.0, 8.0, 8.44265458853031, 8.841367869022669, 9.822157022781347, 10.0, 10.0, 14.0, 16.0, 18.0]], [[1.0, 3.0, 3.0, 7.0, 8.1, 10.0]], [[-10.0, 2.0, 2.0, 4.0, 6.0, 7.499866250660795, 8.0, 8.44265458853031, 10.0, 10.0, 14.0, 14.418547049602209, 14.926417551298215, 16.0, 18.0, 18.0, 20.0]], [[0.9, 0.9, 1.0, 1.1, 1.3, 1.3, 1.3, 1.4, 1.5]], [[0.0, 0.5, 0.5139198781210071, 2.0, 2.5, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 10.0, 20.0]], [[0.02, 0.5, 1.5, 1.5, 1.5, 1.5, 3.4324193164878443, 4.5, 4.5, 5.473257313004003]], [[1.0, 1.0, 1.04, 2.2, 5.5, 8.1, 12.0, 12.345]], [[2.0, 3.957403606421238, 3.957403606421238, 4.0, 4.0, 10.0, 12.0, 14.0, 16.382610224991176, 16.382610224991176, 18.0, 20.0]], [[0.9, 0.9, 1.0, 1.1, 1.4, 1.5, 15.798039725437825]], [[2.0, 4.0, 4.0, 5.2655100630808445, 8.0, 12.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 12.908111205033855, 14.0, 16.0, 16.0, 16.382610224991176, 18.0, 20.0]], [[0.5, 1.5, 2.5, 4.4, 4.5, 6.665410244529757, 6.665410244529757, 6.665410244529757, 7.114467485940238]], [[0.02, 0.5, 1.5, 1.5, 1.5, 1.5, 1.5, 3.4324193164878443, 4.5, 4.5, 5.473257313004003]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 8.44265458853031, 10.0, 12.0, 13.788619379218963, 14.0, 14.0, 16.0, 16.0, 27.787145135987792]], [[0.5, 0.5, 1.1638488635239006, 1.5, 4.4, 4.6, 5.234353973789352, 6.665410244529757, 25.0]], [[0.01, 0.02, 0.03, 0.03, 0.04, 0.05028614760154865, 3.0, 4.0, 4.0, 5.0, 7.114467485940238, 18.0, 56.85662291559699]], [[2.2, 2.5, 3.0, 3.0, 5.947417635576787, 7.0, 8.1, 9.417859749600701, 10.0, 10.993269956834816, 12.0, 12.0, 26.229273556591572]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.4]], [[-7.0, 1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 18.0, 20.0, 20.0, 20.0]], [[1.5690704627594818, 3.291287160121577, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[1.0, 1.3, 2.2, 2.5, 3.0, 7.0, 8.1, 10.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 8.740097409064042, 9.0, 10.0, 11.0, 15.798039725437825, 20.0]], [[1.0, 1.0772407046865693, 1.3, 1.4, 1.4361047634988706, 1.5, 1.5739280052557727, 1.5739280052557727]], [[0.9, 1.0, 1.1, 1.2]], [[0.01, 0.02, 0.03, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0]], [[2.0, 3.957403606421238, 3.957403606421238, 4.0, 4.0, 10.0, 12.0, 14.0, 16.382610224991176, 16.382610224991176, 18.0]], [[2.0, 2.8856343453453412, 2.8856343453453412, 4.0, 4.0, 8.0, 10.0, 12.0, 14.0, 16.382610224991176, 18.129628808825963, 20.0]], [[1.0955579192553242, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 10.0, 12.0, 16.0, 20.0]], [[4.0, 4.0, 5.2655100630808445, 10.0, 12.0, 14.0, 16.229365343481472, 16.382610224991176, 18.0, 19.387299294011015]], [[1.5, 9.53381250714651, 10.0, 10.330189950938697, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 40.0, 40.0, 45.0, 45.0, 50.0, 50.26009016575274, 55.0, 59.86524667040781, 60.0]], [[1.02, 2.3, 4.0, 6.0, 8.0, 10.0, 14.0, 16.0, 16.767545759200633, 17.017909644933226, 18.0, 20.0, 20.0, 20.0, 20.0]], [[1.0, 1.0, 1.01, 1.04, 1.05, 1.06, 1.06, 1.0772407046865693, 1.09, 1.0955579192553242, 1.4, 7.0]], [[1.5, 2.5, 4.4, 4.5, 4.6, 25.155142584904603]], [[0.9, 1.0, 1.1, 1.4, 1.5, 1.6723797579915873, 3.14159, 20.122031404033642]], [[-5.5, 1.0, 1.01, 1.02, 1.03, 1.04, 1.06, 1.06, 1.07, 1.0772407046865693, 1.09, 1.2236675297369042, 1.5, 4.070661459029383]], [[2.0, 2.0, 4.0, 6.0, 6.0, 8.0, 8.44265458853031, 10.0, 10.0, 10.0, 12.0, 12.0, 14.418547049602209, 16.0, 18.0, 18.0, 20.0]], [[0.28103973290652706, 0.8669891442380135, 1.2, 1.2994894489778384, 1.5, 1.5050122069252874, 6.5]], [[-5.5, 0.9659281536235542, 1.0, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.09, 1.5, 9.46529267466774]], [[0.5, 0.9662373014773534, 1.5, 2.5, 4.5, 4.5, 4.5, 4.5, 4.6]], [[-5.5, 0.4232216344489177, 0.943395611525982, 0.9659281536235542, 1.0, 1.01, 1.02, 1.03, 1.06, 1.07, 1.0772407046865693, 1.0772407046865693, 1.0772407046865693, 1.09, 1.5]], [[-0.4435944565678805, 0.01, 0.01, 0.02, 0.03, 0.05, 0.05028614760154865, 3.0, 3.0, 4.0, 5.846567632615504, 12.2, 19.576719293639055, 19.576719293639055]], [[0.0, 0.0, 0.047547201476359824, 0.5, 0.5139198781210071, 3.0, 4.0, 5.0, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 13.77605677385521, 15.798039725437825, 20.0]], [[1.07, 6.0, 8.0, 10.0, 14.0, 15.798039725437825, 18.0, 20.0, 20.0, 50.26009016575274]], [[0.0, 0.5, 2.0, 3.0, 3.472532087278931, 5.0, 5.0, 5.068014067992758, 5.5, 5.5, 6.0, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[0.0, 0.5, 2.0, 3.0, 5.0, 5.5, 5.5, 6.5, 6.599012700484447, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0]], [[1.3045571102030344, 4.0, 6.5530082212075165, 8.0, 8.0, 12.0, 14.0, 14.0, 18.0, 20.0]], [[1.5, 9.53381250714651, 10.0, 12.2, 15.0, 20.0, 25.0, 25.0, 30.0, 35.0, 35.77435826950429, 38.06805732654565, 40.0, 45.0, 45.0, 50.0, 50.26009016575274, 55.0, 59.86524667040781, 60.0]], [[-20.0, 2.0, 4.0, 4.0, 5.2655100630808445, 8.0, 10.0, 14.0, 16.382610224991176, 18.0, 20.0]], [[1.8674194929061803, 2.0, 2.0, 4.0, 4.5, 5.866713664639396, 6.029698420802205, 8.44265458853031, 10.0, 12.0, 14.0, 15.798039725437825, 16.0, 16.0, 18.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.0369514424863993, 1.04, 1.05, 1.06, 1.06, 1.0955579192553242, 1.4, 1.6199722074463931, 7.0]], [[1.0, 1.0, 1.02, 3.0, 5.5, 10.0, 10.993269956834816]], [[1.466541278824319, 6.599012700484447, 10.0, 15.0, 20.0, 25.0, 25.0, 30.0, 32.696672390862496, 35.0, 40.0, 45.0, 50.0, 50.0, 55.0, 55.0, 55.0, 68.29873194324149]], [[4.0, 6.0, 6.0, 8.0, 10.0, 12.0, 14.0, 15.773751428593222, 18.0, 18.749468845893265, 20.0, 20.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 8.44265458853031, 10.0, 12.0, 13.788619379218963, 14.0, 14.0, 16.0, 16.0]], [[0.0, 0.5, 0.5139198781210071, 2.0, 3.0, 4.0, 5.0, 5.234353973789352, 5.5, 5.668034240494638, 6.0, 6.293798665928614, 6.5, 6.5, 6.599012700484447, 7.0, 8.269254657391212, 10.0, 11.0, 13.024100136084627, 20.0, 40.0]], [[1.030513371238777, 2.3, 2.3, 2.4, 4.0, 4.0, 6.0, 8.0, 10.0, 14.0, 14.0, 16.0, 20.0, 20.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 8.0, 10.0, 11.935743997019085, 14.0, 16.382610224991176, 18.0, 20.0]], [[2.0, 2.0, 4.0, 4.5, 4.5, 6.0, 8.0, 8.44265458853031, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[-1.8197650718991247, 2.0, 2.0, 4.0, 4.5, 6.029698420802205, 8.44265458853031, 10.0, 12.0, 14.0, 15.76994730012607, 16.0, 16.0, 18.0, 20.0]], [[0.01, 0.04, 0.05028614760154865, 0.688267766025751, 1.0, 2.0, 2.356960463661484, 3.0, 4.0, 5.0, 7.114467485940238, 55.89445078247812]], [[2.0, 4.0, 6.0, 6.158193327872366, 8.0, 10.0, 13.406348657660198, 14.0, 16.0, 16.767545759200633, 18.0, 20.0]], [[-10.0, 2.0, 4.0, 6.0, 6.429181592060958, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[1.8398837533018846, 2.0, 2.0, 4.0, 4.5, 8.44265458853031, 8.536569059145345, 10.0, 10.0, 10.0, 12.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[2.9330272852017845, 4.0, 8.0, 10.0, 13.064576749502223, 14.0, 14.0, 16.0, 16.767545759200633, 18.0, 20.0, 20.0, 20.0, 20.0, 20.0]], [[0.0, 1.0, 2.0, 4.0, 4.116320447941627, 5.5, 6.5, 6.897666475955764, 7.0, 8.0, 8.5, 9.0, 9.0, 11.0, 16.382610224991176, 20.0, 20.0]], [[-5.5, 0.9, 1.2, 1.3, 1.5, 1.5, 1.5, 1.5297371940268396, 1.818731078819195]], [[1.0, 1.0]], [[1.0, 1.00000000001]], [[1.0, 2.0, 3.0]], [[1.0, 2.0, 100000.0]], [[1.0, 1.0, 1.0, 1.0]], [[1.1, 1.1, 1.1, 1.1, 1.1]], [[1.0, 2.0, 3.0, 4.0, 5.0, 6.0]], [[-5.0, 1.0, 2.0, 3.0, 4.0, 5.0]], [[1.2345678901234567, 1.2345678901234567]], [[1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0]], [[-20.0, -10.0, -7.0, -5.5, -5.5, -1.0, 0.0, 8.0, 12.345, 30.0]], [[2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[0.0, 0.8, 1.0, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[-0.8524065671874532, 0.8, 1.0, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.0, 0.0, 1.0, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.05, 0.5, 1.5, 2.5, 4.4, 4.5, 4.6]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.4, 1.5]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[-20.0, -10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[0.8, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[-18.08893288433498, -10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 12.345, 30.0]], [[0.05, 0.5, 1.5, 2.5, 4.4, 4.4, 4.5, 4.6]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[0.02, 2.0, 2.0, 4.0, 6.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 20.0]], [[-20.0, -14.423047706741098, -10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 30.0]], [[0.8, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 30.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 24.697501417160133]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.4, 1.5, 4.5]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 4.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.644167366046243]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -5.5, -0.06417416146671462, 0.0, 0.05, 3.14159, 8.0, 12.345]], [[0.04, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.09, 2.3]], [[0.05, 1.4716414801909106, 1.5, 2.5, 4.4, 4.5, 4.6]], [[0.0, 2.0, 4.0, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[0.0, 1.01, 2.0, 4.0, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[0.8, 0.9, 1.0994458133327332, 1.2, 1.3, 1.3, 1.4, 1.5, 3.0269522005016203]], [[1.01, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09]], [[0.8, 0.8, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 14.855086127504585, 16.0, 18.0, 20.0]], [[0.8, 0.9, 1.0, 1.05, 1.1, 1.2, 1.3, 1.5]], [[-20.0, -20.0, -10.0, -7.0, -7.0, -5.5, -1.0, 0.0, 2.9986354234031958, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 12.965034001269252, 30.0]], [[0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 5.8744951186522565, 6.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.644167366046243]], [[0.04, 0.5758086456077687, 1.0, 1.01, 1.02, 1.05, 1.06, 1.06, 1.07, 1.09, 2.3]], [[0.01, 0.01250861301074531, 0.02, 0.03, 0.04, 0.05, 1.0, 2.0, 3.0, 4.0, 5.0]], [[0.0, 2.0, 4.0, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 16.00311047108897, 18.0, 20.0]], [[0.0, 4.0, 6.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[2.0, 6.0, 8.0, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 60.0]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0, 30.0]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.4, 1.4, 1.4, 1.5]], [[0.0, 0.0, 1.0, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.0, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.8, 0.9, 1.0, 1.06, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.3, 1.4, 1.5]], [[0.8, 2.0, 4.0, 6.0, 7.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.04, 0.5758086456077687, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.09]], [[-96, -3, 53]], [[0.8, 4.0, 4.0, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 14.855086127504585, 16.0, 18.0, 20.0]], [[0.8, 4.0, 6.0, 6.5, 7.0, 10.0, 12.2, 14.0, 16.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 0.8, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 12.0, 16.0, 18.0, 20.0]], [[0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 35.0]], [[0.8, 2.0, 6.0, 7.0, 7.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0]], [[0.0, 2.0, 4.0, 5.5, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 3.0, 4.0, 5.0, 24.697501417160133]], [[0.0, 2.0, 5.5, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 35.0]], [[0.8, 3.5, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 18.0, 20.0, 24.697501417160133]], [[0.8, 1.0, 1.06, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5]], [[0.8, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 35.0]], [[2.0, 2.2, 4.0, 6.0, 8.0, 10.0, 12.0, 16.0, 18.0]], [[0.04, 0.5712739898819572, 0.5758086456077687, 0.6805533190435746, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.07]], [[0.8, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.56256902148515, 35.0]], [[-1.0, 0.8, 0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5]], [[0.5, 1.5, 3.5541497590785474, 4.4, 4.5, 4.6]], [[0.0, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.5712739898819572, 2.0, 4.0, 6.0, 8.0, 9.538323525972185, 10.0, 12.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.8, 2.0, 4.0, 6.0, 7.0, 7.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0, 20.0]], [[0.05, 0.5, 1.5, 1.5, 2.5, 2.5, 4.4, 4.4, 4.5, 4.6]], [[0.0, 0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 16.0, 18.0, 19.3401788856025]], [[0.02, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 14.0, 18.0, 20.0, 24.697501417160133]], [[0.0, 0.0, 1.0, 1.05, 1.2, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.01, 0.01250861301074531, 0.02, 0.03, 0.04, 0.05, 1.0, 1.09, 2.0, 3.0, 4.0, 5.0]], [[0.0, 0.0, 1.0, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.04, 2.0, 4.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.0, 1.0, 2.0, 3.0, 3.0, 4.0, 5.0, 5.5, 6.5, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[0.8, 0.9, 1.0, 1.05, 1.1, 1.2, 1.3, 1.5, 5.0]], [[-0.8524065671874532, 0.8, 0.8, 2.0, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[0.8, 4.0, 4.0, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 14.855086127504585, 16.0, 16.0, 18.0, 20.0]], [[0.04, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.07, 1.09, 2.3, 19.3401788856025]], [[0.05, 1.6073110979187053, 4.4, 4.4, 4.4, 4.5, 4.6]], [[0.01, 0.02, 0.022622611806456354, 0.03, 0.05, 1.0, 1.1269746014414654, 2.0, 3.0, 4.0, 5.0]], [[10.0, 12.2, 15.0, 20.0, 25.0, 30.0, 35.0, 40.0, 45.0, 50.0, 55.0, 59.84586734141382, 59.84586734141382]], [[0.02, 2.0, 3.159662147541001, 6.0, 7.0, 8.0, 10.0, 14.0, 18.0, 20.0, 24.697501417160133]], [[0.06144179097710181, 1.6073110979187053, 4.4, 4.4, 4.4, 4.5, 4.6]], [[2.0, 4.0, 9.538323525972185, 12.0, 16.0, 18.0, 20.0]], [[0.8, 0.8, 4.0, 4.0, 6.0, 6.714969366390512, 7.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 35.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.09]], [[2.0, 4.0, 6.0, 7.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 4.0229659469356465, 6.0, 8.0, 12.0, 16.0, 18.0, 20.0]], [[0.0, 1.01, 2.0, 4.0, 6.0, 8.5, 9.0, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.09]], [[0.8, 0.9, 1.0, 1.2, 1.2, 1.3, 1.4, 1.5]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[-20.0, 2.0, 4.0, 6.0, 8.0, 12.0, 16.0, 18.0, 20.0]], [[0.8, 2.0, 5.8744951186522565, 6.0, 7.0, 7.0, 8.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0, 59.84586734141382]], [[0.8, 1.0994458133327332, 2.0, 6.0, 7.0, 7.0, 8.0, 8.0, 10.0, 11.290230065355765, 14.0, 16.0, 18.0, 20.0, 40.0]], [[0.8, 1.0, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5]], [[-20.0, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.5415097875278347, 0.8, 0.9, 1.05, 1.1, 1.3, 1.5]], [[0.0, 0.0, 1.0, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.0, 8.5, 9.0, 9.146514817612198, 10.0, 11.0, 11.0, 20.0]], [[0.0, 0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 16.0, 17.737539738329957, 18.0, 19.3401788856025]], [[2.0, 4.0, 6.0, 7.0, 7.282214606279208, 10.0, 10.0, 11.697133369832247, 14.0, 16.0, 18.0, 20.0]], [[0.03, 0.04, 0.5758086456077687, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.09]], [[0.8, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 20.0, 35.0]], [[-20.0, -10.0, -7.0, -5.5, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[2.0, 4.0, 4.0229659469356465, 6.0, 8.0, 12.0, 12.0, 16.0, 18.0, 18.0, 20.0]], [[0.8, 2.0, 6.0, 7.0, 7.0, 7.0, 8.0, 10.0, 10.0, 11.693705971213628, 14.0, 16.0, 18.0, 20.0, 40.0]], [[0.0, 0.8, 1.0, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 20.0]], [[-10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 12.345, 30.0]], [[0.8, 1.03, 2.0, 4.0, 7.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 18.0]], [[0.03, 0.04, 0.5758086456077687, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.09, 9.538323525972185]], [[0.0, 0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 12.0, 16.0, 17.737539738329957, 18.0, 19.3401788856025]], [[0.0, 1.0, 2.0, 2.0, 3.0, 3.0, 4.0, 5.0, 5.5, 6.5, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[-1.0, 0.8, 0.8345159491263733, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5]], [[0.8, 1.0994458133327332, 2.0, 6.0, 7.0, 7.0, 8.0, 8.0, 10.0, 11.030069920319809, 11.290230065355765, 14.0, 16.0, 18.0, 20.0, 40.0]], [[0.0, 0.022622611806456354, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 11.697133369832247, 12.0, 16.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 20.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 7.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.8, 0.9, 1.05, 1.1, 1.2, 1.3, 1.5, 5.0]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -5.5, -0.06417416146671462, 0.0, 0.05, 3.14159, 8.0, 12.345]], [[0.0, 2.0, 4.0, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[0.8, 1.06, 4.0, 6.0, 6.5, 7.0, 10.0, 10.0, 12.2, 14.0, 16.0, 18.0, 20.0]], [[0.0, 0.0, 1.0, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 4.0, 6.0, 6.701501440579012, 7.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 16.0, 17.737539738329957, 19.3401788856025]], [[-20.0, -20.0, -10.0, -7.0, -7.0, -5.5, -1.0, -0.0938649548441084, 0.0, 2.9986354234031958, 3.14159, 3.14159, 8.0, 12.345, 14.0, 30.0]], [[2.0, 4.0, 6.0, 6.701501440579012, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 0.022622611806456354, 2.0, 4.0, 6.5, 8.0, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.06144179097710181, 1.6073110979187053, 4.4, 4.4, 4.4, 4.4, 4.5, 4.6]], [[0.06144179097710181, 0.9368100559625199, 0.9368100559625199, 1.6073110979187053, 4.4, 4.4, 4.4, 4.4, 4.5, 4.6]], [[0.04, 0.5758086456077687, 1.0, 1.01, 1.05, 1.06, 1.06, 1.07, 1.09, 2.3]], [[0.04, 0.05, 0.5758086456077687, 1.0, 1.01, 1.05, 1.06, 1.06, 1.09, 2.3]], [[0.5, 1.5, 3.5541497590785474, 4.4, 4.5, 4.6, 5.5]], [[2.0, 2.3, 4.0, 4.0, 6.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 19.805644956157728]], [[0.8, 1.03, 4.0, 7.0, 7.0, 8.0, 10.0, 10.0, 14.0, 14.0, 16.0, 18.0, 18.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 4.4, 8.0, 8.0, 12.0, 12.345, 30.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 14.0]], [[0.3561918525384038, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 35.0]], [[0.04, 1.0, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.09, 2.3, 12.0]], [[-20.0, -10.0, -7.0, -5.5, -1.0, 0.0, 3.0269522005016203, 3.14159, 8.0, 12.345, 30.0]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 12.0]], [[0.05, 0.5, 1.5, 4.4, 4.4, 4.5, 4.6]], [[0.8, 0.8, 4.0, 4.0, 6.0, 6.714969366390512, 7.0, 10.0, 10.0, 14.0, 16.0, 19.798932046638598, 20.0, 35.0]], [[0.5, 1.5, 3.5541497590785474, 4.212440367134072, 4.4, 4.5, 4.6, 5.5]], [[0.05, 1.4716414801909106, 1.5, 2.5, 4.4, 4.4, 4.5, 4.6]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.17228227492222]], [[1.0, 1.01, 1.02, 1.04, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09]], [[-10.0, 0.0, 4.0, 6.0, 7.0, 8.0, 9.146514817612198, 10.0, 10.0, 12.0, 16.0, 16.0, 18.0]], [[0.04, 0.5758086456077687, 1.0, 1.01, 1.01, 1.05, 1.06, 1.06, 1.07, 1.09, 2.3]], [[0.8, 2.0, 5.8744951186522565, 5.8744951186522565, 6.0, 7.0, 8.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0, 59.84586734141382]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.4, 1.5]], [[2.0, 4.0, 5.8744951186522565, 6.0, 8.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.644167366046243]], [[0.0, 0.05, 2.0, 4.0, 5.5, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 20.0, 24.697501417160133]], [[0.5712739898819572, 2.0, 4.0, 6.0, 8.0, 9.538323525972185, 10.0, 12.0, 12.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 4.0, 6.0, 6.0, 7.0, 8.0, 10.0, 11.0, 12.0, 14.0, 16.0, 16.00311047108897, 18.0, 20.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 3.0, 4.0, 5.0, 16.0, 20.443252094871035]], [[2.0, 4.0, 9.538323525972185, 11.0, 12.0, 18.0, 20.0]], [[0.0, 0.022622611806456354, 2.0, 4.0, 6.5, 8.0, 8.5, 10.0, 10.0, 11.290230065355765, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.05, 0.05, 0.8, 6.0, 6.5, 7.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 16.0, 18.0]], [[0.05, 1.4716414801909106, 1.5, 2.5, 4.4, 4.5, 4.6, 5.92226678224185]], [[-20.0, -10.0, -5.5, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 12.965034001269252, 20.58758307748205]], [[0.8, 0.9, 1.0, 1.05, 1.2, 1.2, 1.2, 1.4, 1.5, 2.0]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[-20.0, -10.0, -7.0, -5.5, -5.5, 0.0, 8.0, 12.345, 30.0]], [[2.0, 4.0, 6.0, 8.0, 9.538323525972185, 10.0, 12.0, 12.0, 16.0, 18.0, 18.0, 20.0]], [[0.8, 2.0, 5.8744951186522565, 5.8744951186522565, 6.0, 7.0, 8.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0, 60.35249699488476]], [[0.01250861301074531, 0.04, 2.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.21793066808776018, 1.01, 2.0, 4.0, 5.61577318250191, 6.0, 8.5, 9.0, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 15.722587027895802, 16.0, 16.0, 18.0, 20.0]], [[0.0, 0.022622611806456354, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 16.0, 18.0, 20.0, 35.0]], [[0.2747322526795788, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.09]], [[0.8, 0.9, 1.0, 1.05, 1.111529158986113, 1.2, 1.2, 1.2, 1.4, 1.5]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.4, 1.5]], [[0.21793066808776018, 1.01, 2.0, 2.1, 4.0, 5.61577318250191, 6.0, 8.5, 9.0, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 15.722587027895802, 16.0, 16.0, 18.0, 20.0]], [[1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 14.0]], [[0.0, 0.0, 0.04, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 12.0, 16.0, 18.0, 19.3401788856025]], [[0.05, 0.5, 1.5, 3.5, 4.4, 4.4, 4.5]], [[0.0, 1.06, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 1.06, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 4.0, 4.6, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 14.16179769990585, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 22.644167366046243]], [[0.8, 0.8, 4.0, 4.0, 6.0, 6.714969366390512, 7.0, 9.729758978205926, 10.0, 14.0, 16.0, 19.798932046638598, 20.0, 35.0]], [[0.0, 4.0229659469356465, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 10.0, 12.0, 14.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 55.0]], [[0.8, 0.9, 1.0, 1.111529158986113, 1.2, 1.2, 1.2, 1.4, 1.5, 1.5, 6.0]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 1.7748618325074756, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.5, 7.0, 8.0, 8.5, 9.0, 9.538323525972185, 10.0, 12.0]], [[2.0, 4.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243, 22.644167366046243]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 14.16179769990585, 30.0]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.5, 7.5, 8.0, 8.5, 8.5, 9.0, 9.929567956225537, 12.0]], [[0.5712739898819572, 2.0, 4.0, 6.0, 8.0, 9.538323525972185, 10.0, 10.0, 12.0, 16.0, 18.0, 18.0, 20.0]], [[0.0, 0.0, 1.0, 1.111529158986113, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 14.0, 16.0, 18.0, 20.0]], [[0.5632953387482663, 0.5632953387482663, 0.8, 4.0, 6.5, 7.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.21793066808776018, 1.01, 2.0, 2.1, 4.0, 5.61577318250191, 6.0, 8.5, 9.0, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 15.722587027895802, 16.0, 16.0, 20.0]], [[1.0, 1.01, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.09]], [[2.0, 4.0, 6.0, 6.0, 8.0, 10.0, 12.0, 16.0, 18.0, 20.0]], [[0.0, 0.022622611806456354, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 13.419140471954321, 14.0, 15.303486822725638, 16.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.01250861301074531, 0.016952550727578522, 0.04, 2.0, 5.8744951186522565, 6.0, 8.0, 8.5, 8.5, 10.0, 12.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.8, 0.9, 1.0, 1.111529158986113, 1.2, 1.2, 1.2, 1.2, 1.4, 1.5, 1.5, 6.0]], [[0.0, 0.0, 1.06, 2.0, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.05, 0.5, 1.5, 2.5, 2.5, 4.4, 4.4, 4.5, 4.6]], [[2.0, 4.0, 5.5, 6.0, 8.0, 10.0, 12.0, 14.16179769990585, 16.0, 18.0, 20.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 4.125317976404242, 4.4, 8.0, 8.0, 8.996746373653892, 12.345, 12.965034001269252, 30.0]], [[2.0, 4.0, 6.0, 7.0, 12.0, 14.0, 16.0, 18.0, 20.0]], [[0.8, 0.9, 1.0, 1.05, 1.0821671281626561, 1.2, 1.2, 1.2, 1.4, 1.5, 2.0]], [[0.0, 0.05, 0.07168518646226235, 0.5, 1.5, 3.5, 4.4]], [[2.0, 4.0, 5.5, 6.0, 8.0, 9.85192697433108, 10.0, 12.0, 12.0, 12.0, 14.16179769990585, 16.0, 18.0, 20.0]], [[-20.0, -10.0, -10.0, -7.0, -5.5, 0.0, 3.14159, 3.14159, 8.0, 12.345, 30.0]], [[1.03, 2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.8, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 7.5, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 24.697501417160133]], [[0.04, 0.8, 0.9, 1.0, 1.111529158986113, 1.2, 1.2, 1.2, 1.2, 1.2, 1.338773099099953, 1.4, 1.5, 1.5, 6.0]], [[0.02, 2.0, 3.159662147541001, 7.0, 8.0, 10.0, 14.0, 17.737539738329957, 18.0, 20.0, 24.697501417160133]], [[2.0, 4.0, 4.6, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 14.16179769990585, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 22.644167366046243]], [[2.0, 4.0, 4.6, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 14.16179769990585, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 22.644167366046243]], [[0.02, 0.02, 2.0, 2.2491103932861414, 3.159662147541001, 7.0, 8.0, 10.0, 14.0, 17.737539738329957, 18.0, 20.0, 24.697501417160133]], [[0.0, 1.0, 2.0, 2.0, 3.0, 4.0, 5.0, 5.5, 6.5, 7.0, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[0.0, 1.06, 2.0, 4.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[2.0, 4.0, 4.5, 6.0, 8.0, 12.0, 16.0, 18.0, 20.0]], [[-1.0, 0.8, 0.8345159491263733, 1.0, 1.1, 1.1, 1.2, 1.3, 1.4, 1.5]], [[0.0, 0.0, 1.0, 1.111529158986113, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 20.0]], [[0.8, 0.8, 0.9, 1.0, 1.02, 1.1, 1.2, 1.2, 1.3, 1.4, 1.5]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 8.0, 9.662066208660672, 12.0, 12.345, 30.0]], [[-20.0, -10.0, -5.5, -1.0, -0.8451952774545579, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.17228227492222]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.0]], [[0.0, 0.8, 1.0, 2.0, 3.0, 4.0, 5.5, 6.0, 6.5, 7.0, 8.0, 8.5, 9.0, 11.0, 15.722587027895802, 20.0]], [[0.3561918525384038, 0.8, 1.0, 1.1, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.4, 1.5, 1.5]], [[0.0, 0.0, 1.0, 1.1269746014414654, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 5.839067476181994, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.5415097875278347, 0.8, 0.9, 1.05, 1.1, 1.5]], [[0.8, 0.9, 1.0, 1.02, 1.1, 1.2, 1.2078775689231043, 1.3, 1.5, 19.3401788856025]], [[0.02, 2.0, 4.0, 6.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[-20.0, -10.0, -7.0, -5.5, -1.0, 0.0, 3.14159, 3.14159, 8.0, 9.589021834286934, 12.345, 30.0]], [[0.05, 1.06, 1.4716414801909106, 2.5, 4.4, 4.4, 4.5, 4.6]], [[-0.8524065671874532, 0.8, 0.8, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.04, 0.05, 1.0, 3.0, 4.0, 5.0, 16.0, 20.443252094871035]], [[0.0, 4.0, 6.0, 6.0, 7.0, 8.0, 10.0, 10.0, 12.0, 14.0, 16.0, 20.0]], [[0.05, 0.05, 4.4, 4.5, 4.6, 30.0]], [[1.0, 1.01, 1.04, 1.05, 1.05, 1.06, 1.08, 1.09, 1.6073110979187053]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 4.4, 8.0, 12.345, 30.0, 35.0]], [[0.21793066808776018, 1.01, 2.0, 2.1, 4.0, 5.61577318250191, 6.0, 8.5, 9.0, 9.589021834286934, 10.0, 10.0, 12.0, 12.0, 12.0, 14.0, 15.303486822725638, 15.722587027895802, 16.0, 16.0, 20.0]], [[0.04, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.07, 1.09, 2.3, 19.3401788856025, 19.3401788856025]], [[0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 14.451903901388377, 16.0, 18.0, 20.0, 35.0]], [[0.02, 0.02, 2.0, 2.2491103932861414, 3.159662147541001, 7.0, 8.0, 8.0, 10.0, 14.0, 17.737539738329957, 18.0, 20.0, 24.697501417160133]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 1.6073110979187053, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 12.0]], [[0.02, 2.0, 2.0, 4.0, 6.0, 7.0, 8.0, 18.0, 20.0, 24.697501417160133]], [[-20.0, -10.0, -5.5, -1.0, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.0]], [[-20.0, -10.0, -9.98565761369873, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 12.965034001269252, 30.0]], [[0.0, 0.0, 0.0, 1.0, 1.1269746014414654, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 5.839067476181994, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.8, 2.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 16.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.5, 9.0, 10.0, 14.0, 20.0, 20.0, 20.56256902148515]], [[0.022622611806456354, 2.0, 4.0, 6.0, 7.0, 10.0, 10.0, 12.0, 14.0, 16.0, 18.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 1.0, 1.0, 1.3, 2.0, 3.0, 4.0, 5.0, 5.177724132812417, 5.61577318250191, 6.0, 6.5, 7.5, 8.0, 8.0, 9.0, 10.0, 20.0]], [[2.0, 4.0, 6.0, 7.0, 7.282214606279208, 10.0, 10.0, 10.0, 11.697133369832247, 14.0, 16.0, 18.0, 20.0]], [[1.0, 2.0, 2.1, 2.2, 2.3, 2.4, 2.5, 3.0, 3.5, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0]], [[0.05, 1.06, 1.4716414801909106, 2.5, 4.4, 4.4, 4.5, 4.6, 6.0]], [[0.02, 2.0, 4.0, 6.0, 7.0, 7.0, 8.0, 10.0, 14.0, 16.0, 17.15657241220536, 20.0, 23.462202369042487, 24.697501417160133]], [[2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 12.345, 16.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.4302724918976677]], [[0.01, 0.02, 0.03, 0.04, 0.05, 1.0, 4.0, 5.0, 5.0, 24.697501417160133]], [[0.02, 1.141769393086327, 2.0, 2.0957837440905673, 4.0, 6.0, 7.0, 7.5, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 24.697501417160133]], [[0.0, 0.0, 1.0, 1.111529158986113, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 20.0]], [[0.8, 1.0994458133327332, 2.0, 5.839067476181994, 6.0, 7.0, 7.0, 8.0, 8.0, 10.0, 11.030069920319809, 11.290230065355765, 14.0, 16.0, 18.0, 20.0]], [[0.8, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5, 1.5]], [[0.05, 0.05, 4.272365978237809, 4.4, 4.6, 6.5, 30.0]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.3, 1.4, 1.4, 1.5, 1.5]], [[0.02, 1.0821671281626561, 2.0, 2.0, 4.0, 6.0, 7.0, 8.0, 20.0, 24.697501417160133]], [[0.8, 1.06, 4.0, 6.0, 6.5, 7.0, 10.0, 10.0, 10.164258174640661, 12.2, 14.0, 16.0, 18.0, 20.0]], [[0.0, 0.0, 0.9368100559625199, 1.0, 1.4716414801909106, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.04, 0.04, 0.9, 1.0, 1.111529158986113, 1.2, 1.2, 1.2, 1.2, 1.2, 1.338773099099953, 1.4, 1.5, 1.5, 1.5052879684662968, 6.0]], [[0.8, 0.9, 0.9, 1.0, 1.1, 1.2, 1.2, 1.3, 1.4, 1.5, 4.5]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 2.542858051830748, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 30.17228227492222]], [[0.01250861301074531, 2.0, 5.8744951186522565, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.04, 0.04, 0.9, 1.0, 1.111529158986113, 1.2, 1.2, 1.2, 1.2, 1.338773099099953, 1.4, 1.5, 1.5, 1.5052879684662968, 6.0]], [[1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 14.0, 17.644189800821962]], [[0.0, 0.022622611806456354, 2.0, 4.0, 6.5, 8.0, 8.5, 10.0, 10.0, 11.290230065355765, 12.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 55.0]], [[0.8, 2.0, 3.0, 3.0269522005016203, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 15.303486822725638, 20.0]], [[-20.0, -10.0, -9.98565761369873, -5.5, -1.0, 0.0, 3.14159, 3.14159, 4.4, 8.0, 8.0, 12.345, 12.965034001269252, 12.965034001269252, 30.0]], [[0.8, 2.0, 4.0, 6.0, 7.0, 8.0, 8.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[-3, 53]], [[-0.8524065671874532, 0.8, 1.0, 1.3, 1.7748618325074756, 2.0, 4.0, 5.0, 5.61577318250191, 6.5, 7.0, 8.0, 8.5, 9.0, 9.538323525972185, 10.0, 12.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.54697726221557, 10.805497134389963, 12.0, 13.42140966570392, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[0.21793066808776018, 0.5712739898819572, 1.01, 2.1, 5.61577318250191, 6.0, 8.5, 9.0, 9.589021834286934, 9.662066208660672, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 15.722587027895802, 16.0, 20.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 8.0, 12.345, 14.16179769990585, 30.0, 60.0]], [[0.0, 0.07168518646226235, 2.0, 5.5, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[0.8, 0.8, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.56256902148515, 35.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243, 22.644167366046243]], [[0.8, 2.0, 6.0, 7.0, 7.0, 7.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0]], [[0.0, 0.0, 0.0, 1.0, 1.1269746014414654, 1.4716414801909106, 2.0, 2.9310236194554102, 4.0, 5.0, 5.5, 5.839067476181994, 6.0, 6.5, 7.0, 7.5, 7.912787863600908, 8.5, 9.0, 10.0, 11.0, 11.0, 20.0]], [[0.5632953387482663, 0.8, 0.8, 4.0, 6.5, 7.0, 10.0, 14.0, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.01, 0.02, 0.03, 0.04, 0.04, 0.04, 0.05, 1.0, 3.0, 4.0, 5.0, 16.0, 20.443252094871035]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 3.777267213631494, 4.0, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[0.8, 0.8, 0.9, 1.0, 1.05, 1.2, 1.3, 1.5]], [[0.02, 2.0, 4.0, 6.0, 6.0, 6.952047495611096, 7.0, 7.0, 8.0, 10.0, 14.0, 16.0, 17.15657241220536, 20.0, 23.462202369042487, 23.462202369042487, 24.697501417160133]], [[0.8, 0.8, 3.8551330358860647, 6.0, 6.0, 7.0, 10.0, 10.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 20.56256902148515, 35.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.4302724918976677, 35.0]], [[0.8, 0.9, 1.0, 1.05, 1.111529158986113, 1.2, 1.2, 1.4, 1.5, 3.0269522005016203]], [[0.0, 0.0, 0.8, 1.0, 2.0, 3.0, 4.0, 5.0, 5.5, 6.0, 6.5, 7.0, 7.199792726774513, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[0.6551091374202295, 1.0, 1.01, 1.03, 1.04, 1.04, 1.05, 1.06, 1.07, 1.08, 1.08, 1.08, 1.09, 1.4302724918976677]], [[0.04, 0.5758086456077687, 1.0, 1.01, 1.05, 1.06, 1.09, 2.3, 30.17228227492222]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 3.14159, 4.125317976404242, 4.4, 8.0, 8.0, 8.996746373653892, 12.345, 12.965034001269252]], [[0.01250861301074531, 0.016952550727578522, 0.04, 2.0, 4.6, 5.8744951186522565, 6.0, 8.0, 8.5, 8.5, 10.0, 12.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.2, 1.3, 1.3, 1.4, 1.4, 1.5, 1.5, 1.5]], [[-20.0, -10.0, -5.5, 0.0, 3.14159, 3.14159, 4.4, 7.113599411319828, 7.113599411319828, 8.0, 8.0, 12.345, 12.965034001269252, 20.58758307748205]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.54697726221557, 10.805497134389963, 12.0, 13.42140966570392, 14.0, 15.303486822725638, 16.0, 16.0, 20.0]], [[-0.8524065671874532, -0.8524065671874532, 0.8, 0.8, 2.0, 3.0, 4.0, 5.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 9.0, 10.0, 10.0, 11.0, 14.0, 20.0]], [[0.8, 2.0, 5.8744951186522565, 6.0, 6.0, 6.0, 7.0, 7.0, 7.12406400580325, 7.810357871166485, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0, 59.84586734141382]], [[0.022622611806456354, 2.0, 4.0, 6.0, 7.0, 10.0, 10.0, 12.0, 14.0, 14.0, 16.0, 18.0, 18.0, 20.0]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0, 14.0, 20.0]], [[0.5171963354416271, 0.8, 4.0, 4.0, 6.0, 6.714969366390512, 7.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0, 35.0]], [[0.01, 0.02, 0.04, 0.04, 0.04, 0.05, 1.0, 3.0, 4.0, 4.272365978237809, 16.0, 20.443252094871035]], [[-0.8524065671874532, 0.8, 0.8, 2.0, 3.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 20.0]], [[-1.0, -0.8524065671874532, 0.8, 2.0, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 11.0, 14.0, 20.0]], [[1.0, 1.01, 1.05, 1.05, 1.06, 1.07, 1.08, 1.09, 1.132725505831892, 1.6073110979187053]], [[0.8, 1.0994458133327332, 2.0, 6.0, 7.0, 7.0, 8.0, 8.0, 10.0, 11.290230065355765, 14.0, 14.855086127504585, 16.0, 18.0, 40.0]], [[0.05, 0.5, 1.5, 2.5, 4.4, 4.5, 4.536861868373288, 4.6]], [[0.7507135704528902, 0.9, 1.0, 1.05, 1.111529158986113, 1.2, 1.3, 5.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 22.627144745696587, 22.644167366046243, 22.644167366046243, 23.094907457927814]], [[0.8, 4.0, 4.0, 4.0, 6.0, 6.5, 7.0, 10.0, 14.0, 14.855086127504585, 16.0, 18.0, 20.0, 20.0]], [[0.0, 0.0, 4.0, 6.0, 6.0, 7.0, 8.0, 9.786113047700132, 10.0, 12.0, 16.0, 18.0, 19.3401788856025]], [[0.0, 0.0, 1.0, 1.4716414801909106, 1.8688902893311938, 2.9310236194554102, 4.0, 5.0, 6.0, 6.5, 7.0, 7.0, 7.5, 8.0, 8.0, 8.5, 8.5, 9.0, 9.146514817612198, 10.0, 11.0, 11.0, 20.0]], [[0.02, 1.141769393086327, 2.0, 2.0957837440905673, 4.0, 6.0, 7.0, 7.5, 8.0, 10.0, 14.0, 16.0, 18.0, 24.697501417160133]], [[0.0, 0.0, 0.8, 1.0, 2.0, 3.0, 4.0, 4.888716888170878, 5.0, 5.5, 6.0, 6.5, 7.0, 7.199792726774513, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 20.0]], [[1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.09, 2.3]], [[0.04, 0.3240403506571168, 0.5758086456077687, 1.0, 1.01, 1.01, 1.06, 1.06, 1.07, 1.09]], [[0.02, 2.0, 2.0628035674357235, 3.0, 3.159662147541001, 7.0, 8.0, 10.0, 14.0, 18.0, 20.0, 24.697501417160133]], [[2.0, 4.0, 5.5, 6.0, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0, 24.697501417160133]], [[-10.0, -7.0, -5.5, -1.0, 0.0, 3.0269522005016203, 3.14159, 8.0, 12.345]], [[0.05, 1.06, 1.4716414801909106, 2.5, 4.4, 4.4, 4.4, 4.5, 4.6, 6.0]], [[0.0, 1.06, 2.0, 4.0, 8.0, 8.0, 8.5, 9.589021834286934, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 16.0, 16.351469754902595, 18.0, 18.0, 20.0]], [[0.01250861301074531, 0.04, 2.0, 5.8744951186522565, 6.0, 8.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 22.627144745696587, 22.644167366046243]], [[-20.0, -7.0, -7.0, -5.5, -5.5, -5.5, -0.06417416146671462, 0.0, 0.05, 1.5052879684662968, 3.14159, 8.0, 12.345]], [[1.2862128755925808, 2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[0.05, 1.5, 1.5, 4.4, 4.4, 4.5]], [[-20.0, -10.0, -7.0, -7.0, -5.5, -1.0, 0.07168518646226235, 3.14159, 3.14159, 8.0, 12.345, 30.0, 30.0, 30.0]], [[-0.8524065671874532, 0.8, 2.0, 3.0, 5.61577318250191, 6.412490479428987, 6.5, 7.0, 7.5, 8.0, 9.0, 10.0, 11.0, 14.0, 20.0]], [[0.8, 1.0, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.5, 1.5]], [[0.05, 0.05, 0.8, 6.0, 6.5, 7.0, 10.0, 14.0, 15.470056628946939, 16.0, 18.0, 20.0]], [[-20.0, -20.0, -10.0, -7.0, -7.0, -5.5, -1.0, 0.0, 2.9986354234031958, 3.14159, 3.14159, 8.0, 12.345, 30.0, 50.0]], [[-20.0, -10.0, -5.5, -1.0, -0.8451952774545579, 0.0, 3.14159, 3.14159, 3.1914676303501026, 4.4, 8.0, 8.0, 11.982961391265457, 30.17228227492222]], [[0.3561918525384038, 2.0, 4.0, 4.0, 6.0, 8.0, 8.5, 10.0, 10.54697726221557, 10.54697726221557, 10.805497134389963, 11.693705971213628, 12.0, 13.42140966570392, 14.0, 16.0, 16.0, 18.0, 20.0]], [[0.0, 0.5539275007752722, 1.0, 2.0, 3.0, 4.0, 5.5, 6.0, 6.5, 7.0, 7.282214606279208, 8.0, 8.5, 9.0, 11.0, 15.722587027895802, 20.0]], [[0.8, 5.8744951186522565, 5.8744951186522565, 6.0, 7.0, 8.0, 8.0, 10.0, 14.0, 16.0, 18.0, 20.0, 40.0, 59.84586734141382]], [[-0.8524065671874532, 0.8, 0.8, 3.0, 4.0, 5.61577318250191, 6.0, 6.5, 7.0, 7.0, 7.5, 8.0, 8.5, 9.0, 9.555936301193714, 10.0, 11.0, 14.0, 14.0, 20.0]], [[0.0, 1.0, 2.0, 2.0, 3.0, 4.0, 4.536861868373288, 5.0, 5.5, 6.5, 7.0, 7.0, 7.5, 8.0, 8.5, 10.0, 11.0, 20.0]], [[0.8, 2.0, 3.0, 3.0269522005016203, 4.0, 6.0, 6.5, 7.0, 7.5, 8.0, 8.5, 9.0, 10.0, 11.0, 14.0, 15.0, 15.303486822725638, 20.0]], [[-20.0, -10.0, -5.5, -1.0, 0.0, 4.4, 4.4, 8.0, 12.345, 14.16179769990585, 30.0]], [[0.8, 1.0821671281626561, 4.0, 6.0, 8.0, 10.0, 10.0, 10.270542934758373, 14.0, 16.0, 18.0, 20.0, 35.0]], [[0.8, 4.0, 4.2685375147658675, 6.0, 7.0, 8.0, 10.0, 10.0, 14.0, 16.0, 16.0, 18.0, 20.0, 35.0]], [[0.02, 1.141769393086327, 2.0, 2.0957837440905673, 4.0, 6.0, 7.0, 7.0, 7.5, 8.0, 10.0, 14.0, 16.0, 18.0, 24.697501417160133]], [[0.0, 2.0, 4.0, 6.0, 7.113599411319828, 8.0, 8.5, 9.589021834286934, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 20.0]], [[2.0, 4.0, 8.0, 10.0, 11.743186336204177, 12.0, 16.0, 18.0, 19.657395792321434, 20.0]], [[-1.0, 0.8, 0.8345159491263733, 1.0, 1.1, 1.1, 1.2, 1.4, 1.5, 6.412490479428987]], [[0.0, 1.0821671281626561, 2.0, 3.208558701627241, 4.0, 8.0, 8.5, 9.384078545821367, 9.589021834286934, 10.0, 10.0, 12.0, 13.419140471954321, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[-20.0, -10.0, -7.0, -5.5, -5.5, -1.0, 0.0, 3.14159, 3.14159, 5.839067476181994, 8.0, 12.345, 30.0]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 12.0, 13.419140471954321, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 22.627144745696587, 22.644167366046243, 22.644167366046243, 24.017042408988246, 28.648838627219234]], [[2.0, 4.0, 6.0, 8.0, 8.5, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 18.0, 18.0, 22.627144745696587, 22.644167366046243, 22.644167366046243, 23.094907457927814]], [[0.0, 0.022622611806456354, 2.0, 2.0, 2.0628035674357235, 4.0, 6.5, 8.5, 10.0, 10.0, 12.0, 14.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0]], [[-20.0, 0.0, 0.8, 4.0, 7.0, 8.0, 10.0, 10.0, 10.0, 10.0, 14.0, 16.0, 18.0, 20.0]], [[0.02, 1.141769393086327, 2.0, 2.0957837440905673, 4.0, 6.0, 7.0, 7.5, 8.0, 10.0, 14.0, 18.0, 24.697501417160133]], [[0.0, 0.022622611806456354, 4.0, 6.5, 8.0, 8.5, 10.0, 10.0, 11.290230065355765, 12.0, 15.303486822725638, 16.0, 16.0, 18.0, 18.0, 20.0, 55.0]], [[0.0, 0.0, 0.0, 4.0, 6.0, 7.0, 8.0, 10.0, 10.0, 10.0, 12.0, 16.0, 17.737539738329957, 18.0, 19.3401788856025]], [[0.02, 2.0, 4.0, 6.0, 6.0, 6.952047495611096, 7.0, 7.9602780711389105, 8.0, 10.0, 14.0, 16.0, 17.15657241220536, 20.0, 23.462202369042487, 23.462202369042487, 24.697501417160133]], [[0.8, 0.9, 1.0, 1.1, 1.2, 1.2, 1.3, 1.4, 1.4, 1.4, 1.4, 1.5, 1.7980687330126581]]], "completion": "\nfrom typing import List, Tuple\n\n\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"\n numbers.sort()\n closest_pair = (numbers[0], numbers[1])\n smallest_difference = numbers[1] - numbers[0]\n for i in range(1, len(numbers)-1):\n difference = numbers[i+1] - numbers[i]\n if difference < smallest_difference:\n smallest_difference = difference\n closest_pair = (numbers[i], numbers[i+1])\n return closest_pair\n", "raw_completion": "```python\nfrom typing import List, Tuple\n\n\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"\n numbers.sort()\n closest_pair = (numbers[0], numbers[1])\n smallest_difference = numbers[1] - numbers[0]\n for i in range(1, len(numbers)-1):\n difference = numbers[i+1] - numbers[i]\n if difference < smallest_difference:\n smallest_difference = difference\n closest_pair = (numbers[i], numbers[i+1])\n return closest_pair\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List, Tuple\n\n\ndef find_closest_elements(numbers: List[float]) -> Tuple[float, float]:\n \"\"\" From a supplied list of numbers (of length at least two) select and return two that are the closest to each\n other and return them in order (smaller number, larger number).\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])\n (2.0, 2.2)\n >>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])\n (2.0, 2.0)\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/21", "prompt": "from typing import List\n\n\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"\n", "entry_point": "rescale_to_unit", "canonical_solution": "\n\n ma, mi = max(numbers), min(numbers)\n k = 1 / (ma - mi)\n return list(map(lambda x: (x - mi) * k, numbers))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([2.0, 49.9]) == [0.0, 1.0]\n assert candidate([100.0, 49.9]) == [1.0, 0.0]\n assert candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]\n assert candidate([2.0, 1.0, 5.0, 3.0, 4.0]) == [0.25, 0.0, 1.0, 0.5, 0.75]\n assert candidate([12.0, 11.0, 15.0, 13.0, 14.0]) == [0.25, 0.0, 1.0, 0.5, 0.75]\n", "contract": "\n assert all(type(x) in [int, float] for x in numbers), \"invalid inputs\" # $_CONTRACT_$\n assert len(numbers) >= 2, \"invalid inputs\" # $_CONTRACT_$\n assert max(numbers) > min(numbers), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[2.0, 49.9]], [[100.0, 49.9]], [[1.0, 2.0, 3.0, 4.0, 5.0]], [[2.0, 1.0, 5.0, 3.0, 4.0]], [[12.0, 11.0, 15.0, 13.0, 14.0]]], "atol": 0, "plus_input": [[[-10.0, 0.0, 10.0]], [[5.0, 2.0, 2.0, 5.0]], [[1.5, 2.0, 2.5, 3.0, 3.5]], [[10.0, 5.0, 2.5, 0.0, -2.5, -5.0, -10.0]], [[1.0, -1.0, 1.0, -1.0, 1.0]], [[0.1, 0.5, 0.9, 0.3, 0.7]], [[5.0, 10.0, 15.0, 20.0, 25.0]], [[-100.0, -50.0, 0.0, 50.0, 100.0]], [[1.0, 2.0, 3.0, 4.0]], [[7.0, 3.0, 8.0, 2.0]], [[1.5, 2.0, 2.5, 3.0, 3.5, 3.5, 3.4499912778820896]], [[1.0, -1.0, 1.0, -1.0, 1.0, 0.6831806134735121]], [[1.0, -1.0, 1.0, -1.0, 1.0, 0.531467821985593]], [[10.0, 5.0, 0.0, -2.5, -5.0, -9.46747586475692]], [[0.5, 0.9, 0.3, 0.7]], [[3.0, 8.0, 2.0]], [[10.0, 5.0, 0.0, -2.5, -5.0, -2.5]], [[1.0, -1.0, 1.0, -1.0, 0.6831806134735121, -1.0]], [[1.0, 2.0, 3.0, 4.88337557029465]], [[1.0, 1.0, -1.0, 1.0]], [[4.130142616161574, 2.0, 5.0, 5.0]], [[-10.0, 10.0]], [[0.1, 0.9, 0.3, 0.7]], [[1.5, 2.0, 2.1745158364579007, 3.0, 3.5, 3.5, 3.4499912778820896, 2.7376185386525926, 3.5]], [[5.0, 2.0, 2.0, 5.0, 2.0, 5.0]], [[1.0, 1.0, -1.0, 1.0, -1.0]], [[-10.0, 0.0, 10.0, 0.5218127444499308]], [[10.0, 5.0, 0.0, -2.5, -5.0, -9.46747586475692, 3.5]], [[-9.142847173489907, 0.0, 10.0, -10.0]], [[-100.0, -62.89269313319225, 0.0, 50.0, 100.0]], [[1.0, -1.0, -10.0, -1.0, 0.6831806134735121, -1.0, 1.0]], [[0.1, 0.3, 0.7]], [[1.0, -1.0, 1.0, 1.0]], [[10.0, 4.067002335783351, 0.0, -2.5, -5.0, -9.46747586475692]], [[10.0, 5.0, 2.5, 0.26171065189523324, -2.5, -5.0, -10.0, -100.0]], [[0.1, 0.3, 0.7, 0.2985177336558441]], [[1.0, -1.0, 1.0, -1.0, 0.531467821985593]], [[5.0, 2.0, 2.0, 5.0, 2.0]], [[1.0, -1.0, 1.0, -1.0, 0.6831806134735121, -1.0, -1.0]], [[10.0, 0.0, -2.5, -5.0, -9.46747586475692]], [[1.0, -1.0, 3.4499912778820896, -1.0, -1.0, 1.0, 0.5838719823105398]], [[-10.0, 0.0, 10.0, 0.5218127444499308, 0.0, 0.531467821985593, -10.0]], [[3.0, 8.0, 2.0, -50.0]], [[10.0, 5.0, 0.0, -2.5, -9.46747586475692, -3.3072700859535313]], [[-1.0, 1.0, -1.0, 0.531467821985593]], [[0.1, 0.9, 0.3, 0.7, 0.7]], [[1.0, -1.0, 1.0, -1.0, 0.531467821985593, 1.0]], [[1.0, -1.0, 1.0, -1.0, 0.531467821985593, 0.0]], [[-5.937376318260506, 10.0]], [[3.944887597354252, 2.0, 2.0, 5.0, 2.0]], [[-1.0, 1.0, -1.0, 0.6831806134735121, -1.0, 1.1140129329785569]], [[-10.0, 0.0, 0.5218127444499308, 0.0, -10.0]], [[5.0, 2.0, 2.0, 5.0, 5.5393493405344465]], [[10.0, 5.0, 0.0, -2.5, -5.0, -7.758548951714786]], [[7.0, 3.0, 2.0]], [[1.0, 1.0, 1.0, -0.6653352961236785, 1.0]], [[1.5, 2.0, 2.5, 3.0, 3.5, 3.4499912778820896]], [[0.1, 0.3, 0.7, 0.2985177336558441, 0.2985177336558441]], [[-1.342224527290663, 1.0, -1.0, 0.531467821985593]], [[0.1, 0.9, 0.3, 0.7, 0.7, 0.9]], [[-10.0, 0.0, 10.0, 0.0]], [[10.0, 5.0, 0.0, -2.5, -5.0, -7.758548951714786, 10.0]], [[-10.0, 0.0, 10.0, 0.5218127444499308, -10.0]], [[-1.0, 1.0, -1.0, 1.1140129329785569]], [[-1.0, 1.0, -1.0, 0.531467821985593, 4.067002335783351]], [[1.5, 2.0, 4.067002335783351, 3.0, 3.5, 3.5, 3.4499912778820896, 2.7376185386525926, 3.5]], [[0.1, 0.9, 0.3, 0.7, 0.7, 0.9, 0.7]], [[5.0, 2.0, 2.0, 5.0, 3.4499912778820896, 5.165207408346182, 2.5]], [[0.0, 10.0, 0.5218127444499308, 0.0, 0.531467821985593, -10.0]], [[5.0, 15.0, 20.0, 25.0, 15.0]], [[5.0, 2.0, 4.067002335783351, 5.0, 2.0, 4.067002335783351]], [[0.0, -5.0, -9.46747586475692]], [[5.0, 2.0, 2.0, 5.0, 3.4499912778820896, 5.165207408346182, 2.5, 4.067002335783351, 2.0, 1.3728105527515997]], [[0.13529057908833445, 0.3, 0.7, 0.2985177336558441, 0.2985177336558441, 10.0]], [[1.0, 2.0, 3.0, 4.88337557029465, 1.2200287334177464]], [[1.0, -1.0, 3.4499912778820896, -1.0, -1.0, 1.0, 0.5838719823105398, 0.13529057908833445]], [[3.0, 2.0]], [[5.0, 20.0, 25.0, 15.0]], [[-10.0, 0.0, 10.0, 0.5218127444499308, -9.863742780614741]], [[7.0, 3.0, 2.0, 3.0, 7.0]], [[10.0, 5.0, 0.0, -2.5, -9.46747586475692, -3.3072700859535313, 0.26171065189523324]], [[-1.0, -10.0, -1.0, 0.6831806134735121, -1.0, 1.0]], [[10.0, 5.0, 2.5, 0.0, -2.5, -10.0]], [[5.0, 2.0, 3.1490494688822803, 5.0, 2.0]], [[-1.0, 1.0, -1.0]], [[10.0, 4.067002335783351, 0.0, -2.5, -5.0, -9.46747586475692, 0.0]], [[3.944887597354252, 2.0, 0.13529057908833445, 5.0, 3.5]], [[5.0, 5.0, 2.0, 5.0, 2.0]], [[1.5, 2.0, 2.5, 3.0, 3.5, 1.7631948427633328, 3.0]], [[10.0, 5.0, 2.5, 0.0, -2.5, -5.0, -10.0, 0.0, -10.0]], [[10.0, 0.0, -2.5, -5.0, -9.46747586475692, 10.0]], [[-1.0, 1.0, -1.0, 0.6831806134735121, -1.0, 1.1140129329785569, 3.4499912778820896, 0.8299626343906432]], [[5.0, 2.0, 2.0, 5.0, 3.4499912778820896, 5.165207408346182, 2.5, 4.067002335783351, 2.0, 1.3728105527515997, 6.451678726414332]], [[10.0, 5.0, 0.0, -2.5, -5.0, 50.0]], [[1.0, -1.0, 1.0, -1.0, 0.531467821985593, -7.758548951714786, 1.0]], [[5.0, 2.0, 5.0, 5.5393493405344465, 10.0]], [[0.0, 10.0, 0.5218127444499308, -9.863742780614741]], [[10.0, 4.067002335783351, 0.0, -2.5, -5.0, -9.46747586475692, 4.067002335783351]], [[-6.486753627961523, 0.0]], [[-100.0, 0.0, 50.0, 100.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0, 11.0]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, 17.0, 19.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0]], [[-3.0, -2.5, -1.2, 0.0, 1.3, 2.6]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[-10.0, -5.5, -1.0, -0.5, -0.1]], [[1.0, 2.0, 2.0, 3.0, 4.0, 4.0]], [[5e-09, 1000000000]], [[-10.0, -5.5, -1.0, -0.5, -0.1, -0.1]], [[-10.0, -5.5, -1.0, -5.0, -0.1]], [[7.0, 3.0, 9.0, -1.0, -5.0, 3.0, 4.0, 6.0]], [[0.0, 0.0, 0.0, 0.499560300532895, 0.0, 0.0, 0.0, 1.0, 0.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 1.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[7.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0]], [[-100000.0, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.2451826892610212, 2.6, -0.1]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[-10.0, -5.5, -1.0, -0.5, -0.1, -0.1, -0.5]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 2.6, -0.1]], [[-10.0, -5.5, -1.0, -0.5, -9.66675615633341, -0.1, -0.1]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, -100000.0]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0]], [[-10.0, -5.5, -100000.0, -1.0, -0.5, -9.66675615633341, -0.1, -0.1]], [[-3.0, -2.5, 0.0, 1.3, 2.6]], [[7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 13.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0]], [[-100000.0, 5.0, 9.0, 11.0, 13.0, 17.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 1.9850204264692954, 6.0]], [[7.0, 9.0, -1.0, -5.0, -3.0, 2.0, 4.0, 6.0]], [[-100000.0, 5.0, 9.0, 11.0, 17.0, 19.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, -87387.4823957305]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0]], [[7.0, -0.5, 9.0, -1.0, -5.0, 1.9850204264692954, 6.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 1.2451826892610212, 4.0, 4.0, 4.0]], [[-0.7849750781391729, 0.499560300532895, 7.0, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 19.0]], [[7.0, 9.0, -1.0, 2.0, 4.0, 6.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 2.0]], [[-1.0, -5.5, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 9.0, 8.422739790413504]], [[7.0, 3.0, 9.0, -1.2400220924963046, -5.0, 3.0, 4.0, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, -1.0, 11.0]], [[11.0, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[-100000.0, 5.0, -1.2, 11.0, 17.0, 19.0, 11.0, 11.0, 17.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, 2.0, 4.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0]], [[3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[0.0, 0.0, 0.0, -100000.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[-10.0, -5.5, -1.0, 2.0, -0.1]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 5.0]], [[2.0, 2.0, 3.0, 3.0, 1.5222176980104452, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 13.0, 17.0, 19.0, -87387.4823957305]], [[2.0, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, 2.0, 4.0, 4.0, 4.0]], [[7.0, 9.0, -1.0, -5.0, -3.0, -5.5, 4.0, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0, 9.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.029460583547525, 17.0, 19.0]], [[-0.5, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0]], [[-9.66675615633341, -3.0, 0.0, 1.3, 2.6]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.494052310009373, 7.824002367662983, 9.0, 8.422739790413504, -100000.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.029460583547525, 19.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 9.0]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, 0.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, -93935.84316983708, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 3.0]], [[2.0, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-10.0, -5.5, -1.2400220924963046, -1.0, 2.0, -0.1]], [[-0.9741314779560433, -5.5, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 11.0]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.2451826892610212, -0.1, -0.1]], [[-0.7849750781391729, 0.499560300532895, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 19.0]], [[-10.0, -5.5, -1.0, -9.66675615633341, -0.1, -0.1]], [[7.0, 3.0, 9.0, -1.0, -5.0, 3.0, 4.0, 6.0, 3.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0, 6.0, 4.0]], [[-3.0, 1.4117100309373578, -2.37372058193593, -1.2, 0.0, 1.3, 2.6, -1.2]], [[-100000.0, 5.0, -1.2, 11.0, 17.0, 19.0, 11.0, 11.0, 17.0, 19.0]], [[2.0, 2.0, 4.046541901582966, 3.0, -100000.0, 3.458912167325974, 3.0, 4.0, 1.2451826892610212, 4.0, 4.0, 4.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 16.290878548158467, 15.0, 5e-09, 17.0, 19.0, 9.0, 19.0]], [[-10.0, -5.5, -1.0, -0.1, -0.1]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, 0.0, 11.0]], [[2.0, 2.0, 3.0, 3.0, 1.46050216156186, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 3.0, 4.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 2.071031386145096, 5.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.970622647728508, 4.0, 4.0, 4.0, 4.0, -100000.0]], [[-5.0, 1.0, 2.0, 2.0, 3.0, 4.0, 2.492199888107555]], [[0.0, 0.0, 1.0932387793203828, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, 19.0]], [[-10.0, 2.0, -1.0, -0.6513673284956263, -0.1]], [[-0.7849750781391729, 0.499560300532895, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 0.8986163754356359, 19.0]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, 17.0, 19.0, 5.0]], [[1.2451826892610212, 2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[-5.0, 10.401137390833725, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 4.0, 4.0, 4.0]], [[7.0, -2.37372058193593, 9.0, -1.2400220924963046, -5.0, 3.0, 4.0, 6.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0, 13.0]], [[2.0, 2.0, 3.0, -1.0, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 13.0, 17.0, 19.0, -1.2176086883151271]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0]], [[-1.0, -5.5, 4.769631488983501, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, -1.0, 10.151375828019562]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 2.6]], [[-0.7849750781391729, 0.499560300532895, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 0.8986163754356359, 19.0, 0.8986163754356359]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 9.883843909648547, 17.0, 19.0, -1.0]], [[-10.0, -5.5, -100000.0, -1.0, -0.5, -9.66675615633341, -0.1, -0.12405312115430803]], [[7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0, 6.0, 4.0, 4.0, 4.0]], [[-100000.0, 8.422739790413504, 9.0, 11.0, 13.0, 17.0, 19.0, -100000.0]], [[7.0, 3.0, 9.0, -1.0, -6.434931263616406, 2.0, 4.0, 6.0, 6.0]], [[-10.0, -5.5, -1.0, -0.1]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, -3.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0, 9.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 19.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, 17.0, 19.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, 1.5222176980104452, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[1.2451826892610212, 2.0, 2.0, 3.0, 3.0, 3.0, 2.232577808710385, 4.0, 4.0, 4.0, 100000.0, 1.8392488338004267, -100000.0]], [[2.0, 10.401137390833725, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 100000.0]], [[7.0, -2.37372058193593, 9.0, -1.2400220924963046, -5.0, 3.0, 4.0, 6.0, 7.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, -5.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 2.071031386145096, 5.0, -1.0, 20.193269967400774]], [[7.0, 3.0, 5.486580591351534, -1.2400220924963046, -5.0, 3.0, 4.0, 6.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 9.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0]], [[0.0, 0.0, 0.0, 0.499560300532895, 0.0, 0.0, 0.0, 9.883843909648547, 1.0, 0.0]], [[2.0, 2.0, 3.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271]], [[-1.0, -5.5, 4.769631488983501, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 10.151375828019562, 17.0, 19.0, -1.0, 10.151375828019562]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 17.725302075603715, 15.0, 17.0, 19.0, 5.0]], [[-1.0, 5.0, 7.0, 9.0, 2.071031386145096, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 9.0, 2.0, 4.0, 6.0, 6.0, 4.0]], [[-5.0, 4.769631488983501, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.906463496197338, 4.0, 4.0, -87387.4823957305, 100000.0, -100000.0, 100000.0]], [[0.0, 0.4269239279743262, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0]], [[-88211.32021789154, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 3.0]], [[-0.9741314779560433, 7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.2176086883151271, 1.0, 0.0, 0.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.324887692190664, 17.0, 19.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0, 3.458912167325974]], [[-5.0, 10.401137390833725, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6]], [[-10.0, -5.5, -100000.0, -1.0, -0.5, -0.1, 4.970622647728508, 4.970622647728508]], [[-1.0, 5.0, 7.0, 9.0, 2.071031386145096, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, -1.0]], [[-10.0, -5.5, -100000.0, -1.0, -0.5, -9.66675615633341, -0.1, -0.12405312115430803, 4.769631488983501, -0.5]], [[2.0, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0]], [[2.0, 3.0, 3.0, 1.5222176980104452, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[7.0, 2.258580593854103, 12.527987311788877, -1.0, -5.0, 1.9850204264692954, 6.0]], [[2.0, 2.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 2.0]], [[7.0, 3.0, 9.0, 0.4269239279743262, -5.0, 3.0, 4.0, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, 19.0, 8.422739790413504]], [[7.0, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 3.0, 4.0, 6.0]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, -3.0, 1.3]], [[-1.0, -5.5, 7.0, 11.0, 5.0, 13.0, 15.0, 17.0, 18.55562594891745]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -147046.595120599, 19.0, 19.0]], [[7.0, 3.0, 9.0, 0.4269239279743262, -5.0, 3.0, 4.0, -5.392186064112541, 6.0]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, -5.0, 3.0, 4.0, 6.0, 9.0]], [[-100000.0, 5.0, 9.0, 11.0, 13.0, -116505.32195163157, 17.0]], [[7.0, 3.0, 9.0, -5.0, 3.0, 4.0, 6.0, 3.0]], [[2.0, 2.0, 3.562048029970825, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 6.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 17.725302075603715, 17.0, 19.0, 3.458912167325974]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 11.0]], [[2.0, 2.0, 3.0, 3.626959923143518, 4.0]], [[-1.2176086883151271, -0.5899488856573549, -3.0, -2.5, -1.2, 0.0, 1.3, 2.6]], [[9.0, -1.2400220924963046, 3.0, 4.0, 6.0]], [[-100000.0, 8.422739790413504, -88211.32021789154, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0]], [[-100000.0, 5.0, 9.0, 13.0, 17.0, 19.0, -1.9494985562533456]], [[7.0, 9.0, -1.0, -5.0, 2.0, 4.0, 9.294663202788586, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, -100000.0, 19.0]], [[7.0, 3.0, 9.0, -1.0, 19.0, 3.0, 4.0, 6.0, 3.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5, 19.0]], [[7.0, 3.0, 3.0, 9.0, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[-100000.0, 19.41864539875061, 5.0, 9.0, 11.0, 11.029460583547525, 17.0, 19.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 4.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, 12.435097367794613, -2.5, 2.0, 4.0, 6.0, 3.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0, 11.0, 17.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, -1.9494985562533456, 2.0, 4.0, 6.0, 3.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 17.725302075603715]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 16.290878548158467, 15.0, 3.6477041535209116, 5e-09, 17.0, 19.0, 9.0, 19.0]], [[7.0, 19.41864539875061, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[7.0, 19.41864539875061, 3.0, 3.562048029970825, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[-1.0, -5.5, 7.0, 9.0, 6.822138554696681, 5.0, 13.0, 15.0, 17.0, 19.0, 5.0]], [[-10.0, -5.5, -1.0, -5.0]], [[-10.0, -5.5, -1.0, 2.0, -0.1, 2.0]], [[-3.913461319358456, -10.0, -5.5, -1.0, -9.66675615633341, -0.1, -0.1, -3.913461319358456]], [[5.0, 9.0, 11.0, 11.029460583547525, 18.149298285479812, 19.0]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, 0.0, 100000.0, 11.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 17.0, 19.0]], [[-87387.4823957305, 3.0, 9.0, -1.0, -5.0, 3.0, 4.0, 3.0]], [[7.0, 9.0, -1.0, -5.0, 9.0, 2.0, 4.0, 6.0, 6.0, 4.0, 2.0]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, 2.0, -5.0, 3.0, 4.0, 6.0, 9.0]], [[-10.0, -5.5, -1.0, 1.2451826892610212, -0.1]], [[-10.0, -0.11712437774261075, -5.5, -1.1252324395847113, -0.5, -0.1, -0.1]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 19.0, 13.0]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, 2.0, -5.0, 3.3850444114672107, 4.0, 6.0, 9.0]], [[2.0, 3.0, 4.0, 4.0, 4.0]], [[2.258580593854103, 12.527987311788877, -1.0, -5.0, 1.9850204264692954, 6.0]], [[-1.0, 18.803842168566185, 5.0, 7.0, 2.071031386145096, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 1.46050216156186]], [[-10.0, -5.5, -1.5661416747342105, -0.5, -0.1, -0.1, -0.5, -5.5]], [[-5.0, 10.401137390833725, 4.0, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[2.0, 2.0, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, 4.0]], [[-10.0, -5.5, -1.0, -0.5, -0.1, -0.5]], [[-1.0, 18.803842168566185, 5.0, 7.0, 2.071031386145096, -0.5, 5.0, 13.0, 15.0, 17.0, 19.0, 1.46050216156186]], [[-3.9976986611875804, 10.401137390833725, 4.0, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[-10.0, -5.5, 4.906463496197338, -0.1]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0, 11.0, 17.0, 7.0]], [[10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 10.282719410300084, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.8340070003829894, 10.31652351054666, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 2.071031386145096, 5.0, 7.0]], [[-10.0, -9.194474676157663, -5.5, -1.0, -9.66675615633341, -0.1, -0.1]], [[18.149298285479812, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, -1.2176086883151271]], [[7.0, 3.0, 5.486580591351534, -1.2400220924963046, 3.0, 4.0, 4.006918996620226, 6.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -99999.35396643436, 19.0, 19.0, 8.004448108665093]], [[5.0, 9.0, 11.0, 10.971192509868965, 18.149298285479812, 19.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 3.562048029970825, 13.0, -6.434931263616406, 15.0, 17.0, 19.0, -1.0, 11.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5, 19.0, -5.5]], [[2.0, 2.0, 3.562048029970825, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 2.0, 4.0]], [[-5.0, 1.0, 2.0, 2.0, 4.0, 2.492199888107555]], [[-1.0, 1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 5.0]], [[-10.0, -0.11712437774261075, -5.5, -1.1252324395847113, -0.1716125073528473, -0.5, -0.1, -0.1]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0, 6.0]], [[-0.7849750781391729, 15.73361557746605, 0.499560300532895, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 19.0, -0.7849750781391729, 11.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 13.0, 3.626959923143518, -87387.4823957305]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 17.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, 12.751538518728971, -2.5, 2.0, 4.0, 6.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, 2.0, 4.0, 4.0, 4.0, 4.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 3.562048029970825, 13.0, -6.434931263616406, 15.0, 17.0, 19.0, 11.0]], [[2.258580593854103, -1.0, -5.0, 1.9850204264692954, 6.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 5.234060683691759, 2.0, 4.0, 4.0, 3.0]], [[3.3850444114672107, 7.0, 3.0, 9.0, 0.4269239279743262, -5.0, 3.0, 4.0, -5.392186064112541, 6.0]], [[0.3815710434538918, -10.0, -5.5, -1.0, -0.5, -0.1, -1.0]], [[-10.0, -6.022656626008542, -1.0, 1.2451826892610212, -0.1, 1.2451826892610212]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 9.0, 9.294663202788586, 8.422739790413504]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 17.0, 19.0, -99999.35396643436, 17.725302075603715]], [[24.263901532923043, 9.0, 11.0, 10.971192509868965, 18.149298285479812, 16.116478869765537, 19.0]], [[-100000.0, 19.41864539875061, 5.0, 9.0, 11.0, 17.0, 15.0, -100000.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 8.873088049958566, 19.0]], [[2.0, 10.401137390833725, -1.0858890328967417, 0.8986163754356359, 1.46050216156186, 100000.0]], [[2.232577808710385, 2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.514661959966183, 2.0]], [[6.822138554696681, -5.0, 10.401137390833725, 4.0, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[20.193269967400774, -116505.32195163157, -100000.0, 5.0, 9.0, 11.0, 13.0, 17.0, 1.46050216156186, -100000.0, 19.0]], [[5.0, 11.324887692190664, 9.0, 11.0, 10.971192509868965, 18.149298285479812, 19.0]], [[-88211.32021789154, 8.422739790413504, 5.0, 7.295974043936857, 9.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 6.887143430238047, 13.0, 17.0, 19.0, 0.499560300532895, 13.0]], [[10.971192509868965, 2.0, 10.401137390833725, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 100000.0]], [[-10.0, -5.5, -100000.0, -1.0, -0.09622505532175613, -0.5, -9.66675615633341, -0.1, -0.1, -1.0, -0.1]], [[-100000.0, 8.422739790413504, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5, 19.0, -5.5]], [[-100000.0, 6.361720364471644, 5.0, 13.0, 19.0, -1.9494985562533456]], [[2.0, 2.0, 3.0, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0]], [[7.0, 19.41864539875061, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.707385811718033, 4.0, 6.0]], [[7.0, 3.0, 9.0, 0.4269239279743262, -5.0, 3.0, 2.492199888107555, -5.392186064112541, 6.0]], [[2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 3.6375526859691534, 4.0, 4.0, 4.0, 100000.0, -100000.0, 2.0, 100000.0]], [[-10.0, -9.194474676157663, -5.5, -1.0, -0.5, -0.7178865318555435, -0.1, -10.0, -10.0]], [[4.970622647728508, 7.0, 3.0, 6.822138554696681, 9.0, 0.4269239279743262, -5.0, 3.0, 4.0, 6.0]], [[2.0, -1.2176086883151271, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 3.0]], [[10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 10.282719410300084, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0, 2.232577808710385]], [[-3.0, 7.295974043936857, -2.5, -1.2, 0.0, 1.3, 2.6]], [[-10.0, 9.0, -100000.0, -1.0, -0.5, -9.66675615633341, -0.1, -0.12405312115430803, 4.769631488983501, -0.5]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 20.193269967400774, 3.0, 4.0, 4.0, 4.0, 5.234060683691759, 2.0, 4.0, 4.0, 3.0]], [[-0.7849750781391729, 0.499560300532895, 8.932911673408139, 11.98005133446692, 13.0, 15.0, 17.0, 0.8986163754356359, 19.0, 0.8986163754356359, 0.8986163754356359]], [[11.0, 4.970622647728508, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 11.0]], [[2.0, 2.0, 3.0, 3.0, 1.5222176980104452, 4.0, 4.0, 5e-09, 4.0, 127422.41835526374, -100000.0]], [[-1.0, -5.5, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 10.151375828019562, 17.0, 19.0, -1.0, 10.151375828019562]], [[2.0, 2.0, 3.0, 3.0, 20.193269967400774, 3.0, 4.0, 4.0, 4.0, 5.234060683691759, 2.0, 4.0, 4.0, 3.0, 3.0]], [[-3.0, -0.1, 0.5283826421326979, -1.2176086883151271, 0.0, 2.6, -0.1]], [[0.0, 0.0, 0.0, 0.0, 0.9325817584583431, 1.0, 1.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 13.0]], [[-0.7849750781391729, 0.499560300532895, 7.0, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 19.0, 15.0]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, 2.0, -5.0, 3.3850444114672107, 4.0, 6.0]], [[-12.436351439193258, -3.0, 0.0, 5.0, 2.6]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, -5.0, 3.0, 3.4732209828361675, 4.0, 6.0, 9.0]], [[2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, -100000.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5, -1.0858890328967417, -100000.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.690179826736281, 6.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 8.722521795855851, 2.0, 4.0, 6.0, 6.0, 4.0, 4.0, 4.0]], [[-3.0, -0.1, 0.5283826421326979, -1.2176086883151271, 0.0, 2.6, -0.1, 0.5283826421326979]], [[11.0, 6.0, 5.0, 7.0, 9.0, -5.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 2.071031386145096, 5.0, -1.0, 20.193269967400774]], [[2.0, 2.0, 3.0, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, 2.0, 3.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 9.883843909648547, 17.0, 19.0, -1.0, 5.0]], [[-100000.0, 8.422739790413504, 9.0, 11.0, 13.0, 17.0, 19.0, -100000.0, 17.0]], [[12.527987311788877, -10.0, -9.194474676157663, -5.5, -1.0, -0.5, -0.7178865318555435, -0.1, -10.0, -10.0]], [[11.0, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 16.290878548158467, 15.0, 5e-09, 17.0, 19.0, 9.0, 19.0, 7.0]], [[-0.7849750781391729, 0.499560300532895, 8.932911673408139, 9.270697628078713, 11.0, 13.0, 15.0, 17.0, 0.8986163754356359, 19.0]], [[10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0]], [[7.0, 19.41864539875061, 3.0, 6.880428028847085, -1.0, -0.09622505532175613, -2.5, 2.0, 4.0, 6.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.970622647728508, 1.631962701646998, 4.0, 0.8986163754356359, 4.0, 4.0, -100000.0]], [[-100000.0, 5.0, 9.0, 11.0, 13.0, -155640.12451219512, 17.0]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.707385811718033, 1.3]], [[-2.5, 9.0, 3.0, 6.880428028847085, 10.971192509868965, -5.0, 12.751538518728971, -2.5, 2.0, 4.0, 6.0, 3.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, 19.0, 8.422739790413504, -5.5]], [[2.0, 2.0, 4.046541901582966, 3.0, -100000.0, 3.0, 2.2157899019980976, 4.0, 1.2451826892610212, 4.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.970622647728508, 1.631962701646998, 16.290878548158467, 4.0, 0.8986163754356359, 4.0, 4.0, -100000.0, 0.8986163754356359]], [[-10.0, -5.5, -1.0, -0.1, -0.1, -0.1, -0.1]], [[8.422739790413504, -88211.32021789154, 11.0, 13.0, -5.5, 20.193269967400774, 19.0, 19.0]], [[-10.0, -5.5, -1.0, -0.5, -9.66675615633341, -0.1, -0.12405312115430803, 4.769631488983501, -0.5, -10.0]], [[-1.0, 5.0, 7.0, 8.341045402099477, 9.0, 2.071031386145096, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, -1.0, 15.0]], [[-0.9741314779560433, -5.5, 7.0, 9.0, 11.0, 5.0, 15.0, 17.0, 19.0, 11.0]], [[10.401137390833725, 2.232577808710385, 11.0, 10.282719410300084, 13.0, 6.887143430238047, 12.435097367794613, 3.458912167325974, 17.0, 19.0]], [[-10.0, -5.5, -1.0, 0.4269239279743262, -5.0]], [[-1.0, 18.803842168566185, 5.0, 7.0, 2.071031386145096, -0.5, 13.0, 15.0, 17.0, 19.0, 1.46050216156186]], [[6.822138554696681, -5.0, 10.401137390833725, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6, 0.8986163754356359]], [[-100000.0, 5.0, 7.295974043936857, 11.0, 17.0, 19.0, 6.718598622152663, 11.0, 17.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 4.690179826736281, 6.0]], [[3.0, -5.392186064112541, 6.822138554696681, -1.0, -5.0, -2.5, 4.046541901582966, 4.0, 6.0]], [[-3.0, -1.2176086883151271, 0.0, 1.3, 2.6, -3.0, 1.5688721641863903, 1.3]], [[-100000.0, 5.0, 3.3850444114672107, 11.0, 13.0, -116505.32195163157, 17.0]], [[2.0, 10.401137390833725, -1.0858890328967417, 0.8986163754356359, 1.46050216156186, 100000.0, 2.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.906463496197338, 4.0, -87387.4823957305, 100000.0, -100000.0, 100000.0]], [[2.258580593854103, 18.255935636763752, 20.193269967400774, -1.0, -5.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 4.690179826736281, 6.0, -5.0]], [[-100000.0, 8.422739790413504, 9.0, 11.0, 13.0, 17.0, 19.0, -100000.0, 2.2157899019980976, 17.0]], [[-100000.0, 5.0, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, 19.0, 8.422739790413504]], [[2.258580593854103, 18.255935636763752, 20.193269967400774, -1.0, 6.361720364471644, -5.0, 18.255935636763752, 2.258580593854103]], [[7.0, 4.482372439717762, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0, 6.0, 4.0, 7.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.23828023614698846, 1.0, 1.0, 0.0]], [[-100000.0, 8.422739790413504, 4.336363527402568, 11.0, 13.0, -100000.0]], [[-5.0, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6, -0.1, -1.2176086883151271]], [[7.0, 3.0, -1.0, -5.0, -2.5, 4.690179826736281, 6.0, -5.0]], [[-1.0, -5.5, 7.0, 9.0, 11.0, 5.0, 3.562048029970825, 13.0, 11.0, 15.0, 17.0, 19.0, -1.0, 11.0]], [[-0.5, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 3.0, 4.0, 6.0]], [[-3.0, -2.5, -1.2, 3.0, 1.3, 4.690179826736281, 2.6]], [[7.0, 3.0, 9.0, 1.322975733592047, 0.4269239279743262, 2.0, -5.0, 3.0, 4.0, 6.0, 9.0, 9.0]], [[-100000.0, 8.422739790413504, 11.0, 13.0, -5.5, 19.0, -100000.0, 19.0, -5.5, 19.0, -5.5, -100000.0]], [[3.0, 6.880428028847085, 6.124505038471483, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0]], [[-100000.0, 8.422739790413504, 10.151375828019562, 13.0, 17.0, 19.0, -100000.0, 17.0]], [[-6.434931263616406, -100000.0, 19.41864539875061, 5.0, 9.0, 11.0, 15.0, -100000.0]], [[7.0, -0.5, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 3.0, 4.0, 6.0]], [[3.0, -5.847428382699748, 5.578999868638974, 6.822138554696681, -1.0, -5.0, -2.5, 4.046541901582966, 4.0, 6.0]], [[-100000.0, 8.422739790413504, 18.255935636763752, 11.0, 14.357147265189116, 13.0, 17.0, 19.0, -100000.0]], [[-100000.0, 6.361720364471644, 5.0, 13.0, 19.0, 7.340064277412082, -1.9494985562533456]], [[2.0, 2.0, 3.0, -1.2176086883151271, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0]], [[-1.0, 18.803842168566185, 5.0, 11.0, -116505.32195163157, 2.071031386145096, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 1.46050216156186]], [[-10.0, -9.194474676157663, -5.5, -1.0, -9.66675615633341, -0.1, -0.1, -9.66675615633341]], [[-3.0, -0.1, -1.2176086883151271, -1.4695256238944465, 0.0, 1.2451826892610212, -0.1, -0.1]], [[-100000.0, 8.422739790413504, 5.0, 11.942680122481894, 11.0, 13.0, 17.0, 19.0, -87387.4823957305]], [[7.0, 3.0, 9.0, -1.0, -5.0, 3.0, 6.0]], [[-1.0, 4.769631488983501, 7.0, 9.0, 11.0, 5.0, 13.0, 17.0, 19.0, -1.0]], [[2.0, 3.0, 1.5222176980104452, 4.0, 4.0, 5e-09, 6.361720364471644, 100000.0, -100000.0]], [[-1.0, 5.0, 7.0, 9.0, 2.071031386145096, 11.0, 3.0, -3.0, 15.0, 17.0, 19.0, -1.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.029460583547525, 19.0, 11.0]], [[11.0, -0.1, 1.7387690576468535, -1.2176086883151271, 0.0, 1.3, 2.6, 0.0, 11.0]], [[2.0, 10.401137390833725, -1.0858890328967417, 0.8986163754356359, 1.46050216156186, 100000.0, 3.0, 2.0]], [[8.422739790413504, 5.0, 13.0]], [[5.0, 9.0, 11.0, 11.029460583547525, 23.88238347602904, 19.0]], [[-10.0, -5.5, -1.0, -0.015599539923190964, -0.1, -0.1, -0.1, -0.1]], [[7.0, -1.1252324395847113, 2.258580593854103, 12.527987311788877, -1.0, -5.0, 1.9850204264692954, 6.0]], [[-1.0, -5.5, 7.0, 9.0, 6.822138554696681, 5.0, 13.0, 15.0, 17.0, 19.0]], [[-1.1252324395847113, 8.422739790413504, 5.0, 4.514661959966183, 13.0, -5.5, 13.327637346787848, 19.0, -100000.0, 19.0, 19.0]], [[-10.0, -4.737351970693368, -100000.0, -1.0, -0.09622505532175613, -0.5, -9.66675615633341, -0.1, -0.1, -1.0, -0.1]], [[-100000.0, 8.422739790413504, 11.0, 13.0, -5.5, 19.0, 19.0, -5.5, 19.0, -5.5, -100000.0, -100000.0]], [[1.0, 2.0, 2.258580593854103, 3.0, 4.0, 4.0]], [[5.0, 9.0, 11.0, 11.029460583547525, 18.149298285479812, 24.457547670728097, 19.0, 9.0]], [[3.0, -5.847428382699748, 5.578999868638974, -4.211888230877799, 6.822138554696681, -1.0, -5.0, -2.5, 4.046541901582966, 4.0, 6.0]], [[20.193269967400774, -116505.32195163157, -100000.0, 5.0, 11.942680122481894, 11.0, 13.0, 17.0, 1.46050216156186, -100000.0, 19.0]], [[3.0, 6.880428028847085, 6.124505038471483, -1.0, -5.0, -2.5, 2.0, 4.0, -2.5402928043798356, -116505.32195163157, 6.0, 6.124505038471483]], [[-3.0, 7.51554490959548, -2.5, 8.722521795855851, -1.2, 0.0, 1.3, 2.6]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, -3.0, 2.6]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 11.168244657255205, 9.0, 9.294663202788586, 8.422739790413504]], [[2.0, 2.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0]], [[20.193269967400774, -116505.32195163157, -100000.0, 5.0, 9.0, 11.0, 13.0, 1.46050216156186, -100000.0, 19.0]], [[-100000.0, 8.422739790413504, 11.0, 13.0, -5.5, 19.0, 5.578999868638974, 19.0, -5.5, 19.0, -5.5, -100000.0, -100000.0]], [[-3.0, 1.4117100309373578, -2.37372058193593, -1.2, 0.0, 1.3, 2.6, -1.2, 1.3]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.970622647728508, 4.0, 4.0, 4.0, 4.0, -100000.0, 3.0]], [[7.0, 3.0, 9.0, 0.4269239279743262, -5.0, 3.0, 3.4732209828361675, -5.392186064112541, 6.0]], [[10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 10.282719410300084, 13.0, 12.435097367794613, 3.707031356089287, 17.0, 19.0, 2.232577808710385]], [[-3.0, -0.1, -1.2176086883151271, 0.5997629033964986, 1.3, 2.6]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.494052310009373, 7.824002367662983, 9.0, 8.422739790413504, -100000.0, -100000.0, 5.0, 11.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.029460583547525, 19.0, 16.47865507751967]], [[-1.0, -5.5, 7.0, 5.0, 13.0, 15.0, 17.0, 18.55562594891745]], [[-1.0, 3.6375526859691534, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, -1.5661416747342105, 19.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 13.0, 12.435097367794613, 17.725302075603715, 17.0, 19.0, 3.458912167325974]], [[7.0, 19.41864539875061, 3.0, 6.880428028847085, -1.0, -0.09622505532175613, -2.5, 2.0, 4.0]], [[11.0, 4.970622647728508, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 11.0, 11.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0, 5.0]], [[-0.7849750781391729, 10.401137390833725, 8.932911673408139, 11.0, 13.0, 12.435097367794613, 3.458912167325974, 17.0, 19.0, 3.458912167325974, 19.0, 17.0]], [[7.0, 3.0, -1.0, -5.0, -2.5, 4.690179826736281, 6.0, -5.0, -1.0]], [[7.0, 3.0, 4.784100732862937, -1.0, -5.0, -2.5, 4.690179826736281, 6.0, -5.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 5.0, 3.562048029970825, 13.0, -6.434931263616406, 15.0, 17.0, 19.0, 11.0]], [[-2.5, 3.0, 6.880428028847085, -5.0, -2.5, -1.9494985562533456, 2.0, 4.0, 6.0]], [[-10.0, -4.737351970693368, -100000.0, -1.0, -0.09622505532175613, -0.5, -9.66675615633341, -0.657703561355692, -0.1, -1.0, -0.1]], [[-100000.0, 19.477741831900236, 8.422739790413504, 10.151375828019562, 13.0, 17.0, 19.0, -100000.0, 17.0]], [[-9.66675615633341, -3.0, 0.0, 1.3, -93935.84316983708, -2.5]], [[-1.0, 3.6375526859691534, 5.0, 9.0, 11.0, 13.0, 15.0, -1.5661416747342105, 19.0]], [[7.0, 3.0, 6.880428028847085, 18.149298285479812, -5.0, -2.5, 2.0, 4.690179826736281, 6.0]], [[-100000.0, 8.422739790413504, 10.151375828019562, -94845.99165474174, 13.0, 17.0, 19.0, -100000.0, 17.0, 19.0]], [[2.0, 2.0, 4.046541901582966, 3.0, -100000.0, 3.458912167325974, 3.0, 4.0, 1.8392488338004267, 4.0, 4.0, 4.0]], [[0.0, 0.0, 0.0, -100000.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[2.0, 2.0, 4.046541901582966, 3.0, -100000.0, 3.0, 2.2157899019980976, 4.0, 1.2451826892610212, 4.0, 4.0, 4.0, 2.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 4.0, 4.0, 4.0]], [[2.0, 10.401137390833725, -1.0858890328967417, 0.8986163754356359, 1.46050216156186]], [[3.0, 7.0, 5.578999868638974, 6.822138554696681, -1.0, -2.5, 4.046541901582966, 4.0, 6.822138554696681]], [[-100000.0, 5.0, 13.0, 17.0, 19.0, 14.357147265189116]], [[7.0, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 4.0, 6.0]], [[2.0, 2.0, 3.0, 3.626959923143518, 4.0, 4.0]], [[2.0, 2.0, 3.0, -1.2176086883151271, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, -100000.0, 4.0]], [[-0.7849750781391729, 10.401137390833725, 2.232577808710385, 8.932911673408139, 11.0, 13.0, -0.657703561355692, 12.435097367794613, 17.0, 19.0, 3.458912167325974, -0.7348076171425224]], [[-100000.0, 9.0, 18.469247120829454, 11.0, 11.029460583547525, 19.0]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 13.0, 9.883843909648547, 17.0, 12.528000738941515, 19.0, -1.0, 5.0, 5.486580591351534, 17.0]], [[5.0, 9.0, 11.0, 11.029460583547525, 18.149298285479812, 24.457547670728097, 19.0, 9.0, 19.0]], [[2.0, 2.088536751425015, 3.0, 3.0, 3.0, 4.970622647728508, 1.631962701646998, 16.290878548158467, 4.0, 0.8986163754356359, 4.0, 4.0, -100000.0, 0.8986163754356359, 3.0]], [[7.0, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 4.0, 6.0, -10.0]], [[2.258580593854103, -1.0, -5.0, 1.9850204264692954, 16.47865507751967, 6.0, 2.258580593854103]], [[18.149298285479812, 2.0, 3.0, -0.5292714556132707, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, -1.2176086883151271]], [[2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271]], [[-100000.0, 8.422739790413504, 5.0, 9.0, 4.006918996620226, 11.0, 13.0, 17.0, -100000.0, 19.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 1.4902206382938175]], [[7.0, 3.0, 9.0, -9.66675615633341, -5.0, 3.0, 4.0, 6.0, 7.0]], [[-100000.0, 5.0, 1.3, 9.0, 11.0, 13.0, 17.0]], [[12.528000738941515, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, 17.0, 19.0, 0.499560300532895, 13.72122445462381, 13.0]], [[-5.0, 10.401137390833725, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6, -0.1]], [[3.0, 7.0, 5.578999868638974, 6.822138554696681, -1.0, -2.5, 4.046541901582966, 4.0, 6.822138554696681, 6.822138554696681, -1.0]], [[-0.9741314779560433, 7.0, 3.0, 9.0, -1.0, -5.0, 2.0, 4.0, 6.0, -1.0]], [[2.0, 2.0, 4.602606106550939, 3.0, -100000.0, 3.458912167325974, 3.0, 4.0, 1.2451826892610212, 4.0, 4.0, 4.0, 1.2451826892610212]], [[2.0, 2.0, 3.0, 4.0, 4.0, 5e-09, 4.0, -100000.0, -1.2176086883151271, 4.0]], [[11.0, -0.3933151616068914, -1.2176086883151271, 11.743598807823856, 0.0, 1.3, 2.6, 0.0, 100000.0, 11.0]], [[-5.0, 2.0, 4.0, 2.492199888107555]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 14.803481340003744, -147046.595120599, 19.0, 19.0]], [[8.873088049958566, 5.0, 9.0, 11.0, 10.971192509868965, 18.149298285479812, 19.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 4.0, 4.0]], [[-1.0, 18.803842168566185, 5.0, 16.290878548158467, 7.0, 2.071031386145096, -0.5, 13.0, 15.0, 17.0, 19.0, 1.46050216156186, -1.0]], [[-1.0, -5.5, 5.0, 7.0, 9.0, 11.0, 5.0, 15.0, 17.0, 19.0, 17.0]], [[12.528000738941515, 2.0, 3.0, -1.2176086883151271, 4.0, 4.0, 5e-09, 100000.0, -100000.0]], [[-3.0, -0.1, -1.2176086883151271, -1.4695256238944465, 0.0, 1.2451826892610212, -0.1, -0.1, -1.4695256238944465]], [[2.0, 3.0, -1.0, 4.0, 4.0, -1.9494985562533456, 4.0, 100000.0, -100000.0, -1.0]], [[-0.5, -2.37372058193593, 9.0, -1.2400220924963046, -10.0, -5.0, 3.0, 4.046541901582966, 6.0]], [[5.486580591351534, -3.0, 7.51554490959548, -2.5, 8.722521795855851, -1.2, 11.324887692190664, 0.0, 1.3, 2.6]], [[11.0, -87387.4823957305, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 17.0, 20.193269967400774, 19.0]], [[-1.0, 5.0, 7.0, 3.621270797455902, 9.0, 11.0, 5.0, 13.0, 15.0, 17.0, 19.0]], [[-10.0, -5.5, -1.0, -0.1, -0.1, -0.1, -0.1, -10.0]], [[2.0, -3.9976986611875804, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 4.0, 3.0, 2.0, 4.0]], [[2.0, 3.0, 3.0, 1.8139876754497708, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 20.193269967400774, 3.0, 4.0, 4.0, 4.0, 5.234060683691759, 2.0, 4.0, 4.0, 3.0, 3.0, 3.0]], [[-100000.0, 5.0, -1.2, 11.0, 17.0, 19.0, 11.0, 14.001363610040931, 17.0, 19.0]], [[-100000.0, 8.422739790413504, 1.0, 10.151375828019562, -94845.99165474174, 13.0, 17.0, 19.0, -100000.0, 17.0, 19.0]], [[-10.0, -5.5, -1.0, -0.5, -9.66675615633341, -0.1, -155640.12451219512, 4.336363527402568, -0.1]], [[-5.0, 10.401137390833725, 4.0, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6]], [[-100000.0, 8.422739790413504, 11.736647377028104, 13.0, -5.5, 19.0, -149710.3331618766, 19.0, -5.5, 19.0, -5.5]], [[-3.0, -0.1, -1.2176086883151271, 1.3, 2.6, -3.0]], [[1.9850204264692954, -2.5, -1.2, 0.0, 1.3, 2.6]], [[-0.7849750781391729, 0.499560300532895, 7.0, 8.932911673408139, 11.0, 13.0, 15.0, 17.0, 19.0, 15.0, 15.0, 15.0]], [[-100000.0, 8.422739790413504, 5.0, 11.0, -5.5, 19.0, -100000.0, 19.0, 8.422739790413504, -100000.0]], [[2.0, 2.0, 3.0, 4.0, 4.0, 4.0]], [[-2.371036804582337, 6.361720364471644, 5.0, 13.0, 7.340064277412082, -1.9494985562533456]], [[-3.913461319358456, -1.0, 5.0, 9.883843909648547, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 14.803481340003744, 17.0, 20.193269967400774, 19.0, 2.6]], [[2.0, 2.088536751425015, 3.0, 3.0, 3.0, 1.250889673660545, 4.970622647728508, 1.631962701646998, 16.290878548158467, 4.0, 0.8986163754356359, 4.0, 4.0, -100000.0, 0.8986163754356359, 3.0]], [[7.0, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 6.0, -1.0, 6.880428028847085]], [[2.0, 2.0, 3.0, 3.0, -1.2176086883151271, 4.784100732862937, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, -1.9494985562533456, 2.0, 4.0, 6.0, 11.743598807823856, 6.880428028847085, -5.0]], [[-3.0, -2.5, 0.0, 1.3]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 3.0, 4.0]], [[-100000.0, 5.0, 9.0, 11.0, 11.029460583547525, -4.737351970693368, 19.0]], [[7.0, 3.0, 9.0, -1.2400220924963046, -5.0, 3.0, 4.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0, 2.492199888107555, 3.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, 1.9052748416682936, -5.0, -2.5, -1.9494985562533456, 2.0, 4.0, 6.0, 3.0]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, 0.0, 3.458912167325974, 11.0]], [[0.0, 0.4269239279743262, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0]], [[-10.0, -5.5, -1.0, -0.09622505532175613, -5.0, -0.1, -0.1]], [[-3.0, 0.46837860635787776, -1.2176086883151271, 0.0, 1.2451826892610212, 2.6, -0.1]], [[3.0, 7.0, 5.578999868638974, 6.822138554696681, -1.0, -2.5, 4.046541901582966, 4.0, 6.822138554696681, 6.822138554696681, -1.0, 7.0, -1.0, 6.822138554696681]], [[2.0, 10.401137390833725, -1.0858890328967417, 0.8986163754356359, -0.1716125073528473, 1.46050216156186]], [[-5.392186064112541, -6.028697603862666, -100000.0, -1.0, -0.5, -9.66675615633341, -0.1, -0.12405312115430803]], [[-5.0, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6, -0.1]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.0, 4.0, 3.0, 2.0]], [[-2.5, 3.0, 6.880428028847085, -1.0, -5.0, -2.5, 2.0, 4.0, 6.0, 3.5026414432127666]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 2.6, -3.0, 1.3]], [[-100000.0, 9.0, 18.469247120829454, 11.0, 11.029460583547525, 11.307879951386456, 19.0, 9.0]], [[-3.0, -2.5, -1.2, 1.3, 2.6]], [[-9.66675615633341, -2.3146433358554312, 0.0, 1.3, -93935.84316983708, -2.5]], [[-1.0, -12.436351439193258, 1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 13.0, 17.0, 19.0, 5.0, 9.0]], [[-3.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, -3.0, 2.6, -1.2176086883151271]], [[18.065380446624353, -100000.0, 8.422739790413504, 5.0, 9.0, 11.0, 9.578249337079814, 17.0, 19.0, -87387.4823957305]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 0.0, 100000.0, 11.0]], [[7.0, 9.0, -1.0, -5.0, -3.0, -5.5, 4.0, 6.0, -5.5]], [[-10.0, -5.5, -1.0638245062379739, -9.66675615633341, -0.1, -0.12405312115430803, 4.769631488983501, -0.5, -10.0]], [[7.0, 3.0, 9.0, -1.0, -5.0, 3.0, 4.0, 3.0]], [[6.822138554696681, -5.0, 10.401137390833725, -0.1, -1.2176086883151271, 0.8986163754356359, 1.46050216156186, 2.6]], [[-100000.0, 8.422739790413504, 9.0, 11.0, 13.0, -100000.0]], [[-93935.84316983708, -1.0, 5.0, 7.0, 9.0, 2.6, 11.0, 13.0, 15.0, 5e-09, 17.0, 20.193269967400774, 19.0, 15.0]], [[-100000.0, 5.0, 11.0, 1.8139876754497708, -5.5, 19.0, -99999.35396643436, 19.0, 19.0, 8.004448108665093]], [[-99999.95414373039, 5.0, 3.3850444114672107, 11.0, 13.0, -116505.32195163157, 17.0]], [[10.733186857378628, -71087.59728792847, 8.422739790413504, 9.0, 11.0, 13.0, 17.0, 19.0]], [[-10.0, -4.737351970693368, -100000.0, -1.0, -0.09622505532175613, -0.5, -9.66675615633341, -0.1, -0.1, -1.0, -0.1, -0.1]], [[-100000.0, 8.620022473016821, 5.0, 11.0, 13.0, -5.5, 14.803481340003744, -147046.595120599, 19.0, 19.0]], [[2.0, 3.0, -1.0, 4.0, -1.9494985562533456, 4.0, 100000.0, -100000.0, -1.0, 4.0]], [[-100000.0, 8.620022473016821, 5.0, 11.0, 13.0, -5.5, 14.803481340003744, -147046.595120599, 19.0, 23.38614527981872, -100000.0, 14.803481340003744]], [[-1.0, 6.361720364471644, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, 17.0, 19.0, 7.277367751488355]], [[2.0, 4.0, 4.0, 5e-09, 4.0, 100000.0, -100000.0, -1.2176086883151271, 4.0, 4.0]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 5.0, 15.0, 17.0, 19.0, 5.0]], [[-3.0, 0.46837860635787776, -1.2176086883151271, 0.0, 1.2451826892610212, 2.6, 7.51554490959548]], [[-5.0, 10.151375828019562, 4.0, -0.1, -1.2176086883151271, 0.8986163754356359, 2.6]], [[-100000.0, 8.422739790413504, 5.0, 11.0, 13.0, -5.5, 8.9984541936865, 19.0, -100000.0, 19.0, -5.5, 19.0, -5.5]], [[-10.0, -5.5, -1.0, -0.1, -0.1, -0.1, -0.1, -10.0, -5.5, -1.0]], [[-100000.0, 8.422739790413504, 12.900300750606242, 5.0, 11.0, 13.0, 17.0, 19.0]], [[11.0, -0.1, -1.2176086883151271, 0.0, 1.3, 2.6, -0.31657732340816347, 0.0, 3.458912167325974, 11.0]], [[1.0, 2.0, 3.0, 3.0, 4.0, 5.0]], [[-5.0, -2.0, -1.0]], [[-5.0, -2.0, 0.0, 1.0, 3.0]], [[1.1, 2.2, 3.3]], [[5.0, -3.0, 1.0, 2.0, 5.0, 0.0]], [[1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, 19.0, 20.0]], [[-4.0, 4.0]], [[-1.0, -2.0, -3.0, -4.0]], [[5.0, 6.0, 7.0, 8.0]], [[3.4028235e+38, -3.4028235e+38]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.6]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0, 11.0, -1.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 4.0, 6.0]], [[1.0, 2.0, 2.0, 3.0, 4.0, 4.0, 2.0]], [[2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6]], [[2.3974061228253545, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.0]], [[1.0, 2.0, 2.0, 3.0, 4.0, 4.0, 2.0, 4.0, 3.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 1.0]], [[1.0, 2.0, 2.0, 3.0, 4.0, 2.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0]], [[0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 1.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0]], [[-5.0, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[1.0, 2.0, 2.0, 3.0, 4.0, 4.0, 2.0, 3.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, -2.5, 3.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 11.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6, 11.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.0, 0.0, 1.0]], [[2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 1.0, 1.0]], [[2.0, 1.8568589519865748, 3.63532512522154, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0]], [[2.317700548477839, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, -0.5]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, 1.0]], [[1.0, -0.1, 2.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0]], [[2.0, 2.604901901518098, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 11.0, -5.0]], [[2.0, 2.604901901518098, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 100000.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, 5.0]], [[0.0, 0.0, 0.0, 1.3, 0.0, 0.0, 1.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 4.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 15.0, 100000.0, 1.8803882689883606, -100000.0, 100000.0]], [[-5.0, -2.1195243965065043, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.0, 4.0, 6.0]], [[2.0, 2.3613347876448154, 4.009964202838896, 3.0, 2.604901901518098, 4.0, 4.0, 4.0, 4.0]], [[-5.0, -2.1195243965065043, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 9.0]], [[-5.0, -2.1195243965065043, 3.093771311909787, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-5.0, -1.8821461758972977, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 100000.0, -100000.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0, 11.0, 11.0, -5.0]], [[2.3974061228253545, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.0, 3.0]], [[2.3974061228253545, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.95439506042047, 4.0, 3.0]], [[1.0, 2.0, 3.0, 4.0, 2.0]], [[2.3974061228253545, 2.7499191886213326, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.0, 2.3974061228253545]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[2.0, 1.8568589519865748, 3.63532512522154, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825]], [[13.0, 0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 1.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825]], [[1.89085792733363, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0]], [[0.0, 2.6, 0.0, 0.0, 0.0, 0.0, 1.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, 11.0, -1.0, 3.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 0.3084506581856825]], [[2.0, 1.8568589519865748, 3.0, 3.0, 2.7499191886213326, 3.0, 4.0, 4.0, 1.89085792733363, 100000.0, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 4.0, 0.3084506581856825]], [[-0.5100337078730766, -0.7560991815460972, 0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 1.0]], [[-5.0, 3.132612632596544, -3.0, 1.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[-0.1, 2.0, 3.63532512522154, 4.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, 1.0]], [[-5.0, -1.8821461758972977, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.0, 1.9879782849688847, 6.0, 2.0]], [[0.0, 2.6, 0.0, 0.0, 0.0, 1.0]], [[7.0, 3.0, 9.0, 2.0, 4.0, 6.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, 11.0, -1.0, 3.0, 1.0]], [[-5.5, -1.0, -1.0, -0.5, -0.1]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 0.3084506581856825]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 2.6, 4.0, 4.0]], [[-5.0, 8.485686893878379, -1.8821461758972977, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, -1.8821461758972977]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 17.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825]], [[7.0, 3.0, 15.0, -1.0, -5.0, 2.0, 4.0, 6.0, 3.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0]], [[0.0, -10.0, 0.0, 1.3, 0.0, 0.0, -12.900064462349789, 1.0]], [[0.0, 0.0, 0.0, 0.0, -0.2950823455421112, 0.0, 1.0]], [[7.0, 3.0, -1.0, 2.0, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[-5.0, -3.0, 0.3128608452500923, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.0, 4.0, 6.0, 3.0, 7.0]], [[-0.5100337078730766, -0.7560991815460972, 0.0, 0.0, 0.927368319637066, 0.0, 0.0, 1.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.047004414913656, 5.0, 9.0, 11.0, -1.0, 3.0, 1.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 100000.0, -100000.0, 100000.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825]], [[-5.0, -3.0, -1.0, 1.0, 2.0, 6.210898792063733, 5.0, 7.0, 9.0]], [[7.0, 3.0, 15.0, -1.0, -5.0, 2.0, 4.0, 6.0, 3.0, -5.0, 6.0]], [[-3.0, -2.5, -1.2, 0.0, -1.9243870830593395, 1.3, 2.6, -2.033802097685287, 2.317700548477839, 2.6, 11.0, -1.9243870830593395]], [[2.0, 1.8568589519865748, 3.0, -2.5, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 3.0]], [[1.0, 2.0, 1.0, 3.0, 4.0, 2.0]], [[2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 2.604901901518098, 4.0, 4.0, 100000.0, -100000.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6, 11.0, 2.6]], [[-5.0, -3.0, -1.0, 1.0, 2.0, 6.210898792063733, 5.0, 9.0]], [[0.0, 0.1581270304608839, 0.0, 0.0, 0.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, -1.0]], [[7.0, 3.0, 9.0, -1.0, 1.377524891878108, 2.0, 1.9879782849688847, 6.0, 2.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 4.0, 4.295988999465306, 6.0]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, 17.0, 19.0, 17.0, 17.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 2.604901901518098, 2.996533149237559, 4.0, 4.0, 100000.0, -100000.0]], [[2.331382164224474, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 17.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825]], [[2.0, 6.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 4.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, -0.2950823455421112, 100000.0, -100000.0, -100000.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 6.0, 2.0, 2.0, 3.0]], [[-5.0, -2.1195243965065043, 3.093771311909787, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, -5.0]], [[7.0, 3.0, 9.0, 1.9879782849688847, -1.0, 2.0, 2.0, 4.0, 6.0, 3.0]], [[7.0, 3.0, 9.0, 6.0, 2.0, 2.0, 2.709339832728434, 4.0, 6.0, 3.0, 7.0, 3.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 6.0, 2.0, 2.0, 3.0, 7.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.6, 4.0, -0.5, 6.0]], [[-5.0, -3.0, 1.0, 3.0, 5.0, 7.0, 9.0, 11.0, 7.0]], [[-5.0, -3.9359140818779, -1.0, 10.012494985460352, 1.0, 3.0, 5.0, 7.0, 9.0, 11.0, -1.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 17.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825, 2.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 2.6, 2.317700548477839, 2.6, 2.6]], [[2.3974061228253545, 2.7499191886213326, -0.2950823455421112, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.009964202838896, 2.3974061228253545]], [[7.0, 3.0, -1.0, 2.0, 2.0, 4.0, 6.0, 3.0, 6.941347396260423]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0, -2.5]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, 11.0, -1.0]], [[-5.0, -3.0, 0.3128608452500923, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, -5.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, -2.212238668183224, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0]], [[11.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0, 3.0]], [[13.0, 0.0, 0.0, 0.0, 0.0, 1.0]], [[7.0, 3.0, 15.0, -1.0, -5.0, 2.0, 6.0, 3.0, 4.0]], [[3.6010757126300734, 2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0]], [[1.0, 2.0, 2.0, 3.0, 4.0, 4.0, 2.0, 3.0, 4.0]], [[-0.5100337078730766, -2.5869330155418675, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, -2.5, 3.0]], [[-5.0, 3.844455868175311, 1.0, 3.0, 5.0, 4.833878055412355, 9.0, 11.0, 7.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, -3.6497815875309945, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[2.0, 2.0, 3.0, 3.0, 4.5024139185226595, 6.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0, 3.0]], [[2.0, 1.8568589519865748, 3.63532512522154, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 2.996533149237559, 4.0, 4.0, 100000.0, -100000.0]], [[-3.0, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6, 2.6]], [[-5.0, -3.0, 1.0, 2.9770126806470683, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 13.0]], [[13.0, 0.0, 0.0, 0.0, 0.0, 17.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0, 3.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, -2.870785908662275, 5.0, 7.0, 9.0, 11.0, -1.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 6.89535009486304, 11.0, 6.210898792063733]], [[-3.0, -1.5885610609142073, -1.2, 0.0, -1.9243870830593395, 1.3, 2.6, -2.033802097685287, 2.317700548477839, 2.6, 11.0, -1.9243870830593395]], [[-3.0, -1.2, 0.0, -2.5, 1.991219214535127, 2.6, 2.317700548477839, 2.6, 2.6]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6, -1.2]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 4.0, 0.3084506581856825, 2.3242811798678176]], [[7.0, 3.0, -1.0, -5.0, 2.0, 4.0, 6.0, 3.0, -5.0, 6.0]], [[8.485686893878379, 2.0, 2.604901901518098, 3.0, 3.0, 4.0, 4.0, 4.0, -3.0, -100000.0, 100000.0]], [[1.0, 2.0, 3.0, 4.0, 19.0]], [[1.0, 2.0, 3.0, 19.0]], [[7.0, 3.0, -1.0, 2.0, -0.2950823455421112, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[2.0, 2.0, 3.0, 3.77124784854875, 3.0, 3.0, 4.0, 4.0, 4.0, 3.3437558978820334, 100000.0, -100000.0, 4.0, 100000.0]], [[7.0, 3.0, 15.0, -1.0, -0.9053077270335478, -5.0, 6.0, 3.0, 3.7435131776430204, 15.0]], [[0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0]], [[2.3974061228253545, 2.0, 1.5971393412498083, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.95439506042047, 4.0, 3.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, -0.9053077270335478, 4.0, 4.0, 4.0, 4.0]], [[-5.0, -3.0, -0.3115474205775115, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 11.0]], [[7.0, 1.89085792733363, 3.0, -1.0, 2.0, -0.2950823455421112, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 2.0, 6.0, 3.0, 7.0]], [[-5.0, 3.844455868175311, 1.0, 3.0, 5.0, 1.5971393412498083, 9.0, 11.0, 7.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 2.996533149237559, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0]], [[2.3974061228253545, 2.0, 1.5971393412498083, -2.1195243965065043, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.95439506042047, 4.0, 3.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 4.0, 6.0, -1.0]], [[-3.9436012405046843, -1.0, 1.0, 3.0, 5.0, 2.6, 7.0, 9.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, -5.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, -2.212238668183224, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, -2.212238668183224, 7.0, -2.033802097685287]], [[-5.0, -1.8821461758972977, -1.0, 1.89085792733363, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[7.0, 3.0, -1.0, 2.0, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[-5.0, 3.132612632596544, -3.0, 1.0, 6.210898792063733, 5.0, 7.0, 9.0, 2.709339832728434, 7.0]], [[3.6010757126300734, 2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 7.0, 3.7435131776430204, 4.0, 4.0]], [[-1.0, 3.0, 9.0, -1.0, 2.0, 2.0, 1.9879782849688847, 6.0, 2.0]], [[7.0, 3.286574222026122, 3.0, -1.0, 2.0, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, -1.0, -2.5, 3.0]], [[7.0, 3.0, 2.0, 2.0, 6.0, 3.0, 7.0, 2.0]], [[7.0, 3.0, 15.0, -1.0, -5.0, 2.0, 4.0, 6.0, 3.0, -5.0, 6.0, 3.0]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 4.0]], [[7.0, 3.0, -1.0, -5.0, 2.0, 4.0, 6.0, -5.0, 6.0]], [[2.0, -3.6497815875309945, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0, 2.317700548477839]], [[-5.0, -3.0, 3.0, 4.009964202838896, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, -5.0]], [[2.0, 2.0, 3.6728877465517957, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, -100000.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.0, 1.0, 1.8568589519865748]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 5.423014615696999, 9.0, 11.0, -1.0, 3.0, 5.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, 11.0, -1.0, 3.0, -2.033802097685287]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 1.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-5.0, -1.8821461758972977, -1.0, 1.89085792733363, 3.0, 6.210898792063733, 5.0, 7.0, 9.0]], [[-4.747059300613937, -0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0, -2.5]], [[13.0, 0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 0.1581270304608839, 1.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 0.546353249751977, 1.0, 1.0]], [[1.89085792733363, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0, 4.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 1.0, 100000.0, 1.8568589519865748, 1.8568589519865748]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 3.0, 1.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, -5.0, 11.0]], [[2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 2.317700548477839, -100000.0]], [[-5.0, -1.8821461758972977, -10.0, 1.0, 3.0, 8.214348434556833, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[0.0, 1.8568589519865748, 0.38904762141515903, 0.0, 1.0, 100000.0, 1.8568589519865748, 1.8568589519865748, 0.0, 1.0]], [[2.0, 3.0, 3.0, 2.093512706816888, 3.0, 4.0, 4.0, 2.317700548477839, -100000.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 3.0]], [[7.0, 15.0, -1.0, -5.0, 2.0, 4.0, 6.0, 3.0, -5.0, 6.0, 3.0]], [[2.0, 2.0, -2.1195243965065043, 4.009964202838896, 2.996533149237559, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 3.0]], [[-5.0, -2.033802097685287, 10.012494985460352, -1.0, 1.0, 3.0, 10.216971081237052, 5.0, 4.95439506042047, 9.0, 6.0, -1.0, 3.0, 1.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 2.539730481972406, 0.1581270304608839, 0.3084506581856825, 4.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 1.3, 6.210898792063733, 0.1581270304608839, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[-3.0, -1.2, 0.0, -2.5, -2.5, 2.6, 2.317700548477839, 2.6, 5.0, 2.6]], [[7.0, 15.0, -1.0, -5.0, 2.0, 6.0, 3.0, -5.0, 6.0, 3.0, 3.0]], [[-5.0, 8.485686893878379, -1.8821461758972977, -1.0, 1.0, 2.7499191886213326, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, -1.8821461758972977]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0, 3.0, -5.0]], [[-5.0, 0.927368319637066, -2.1195243965065043, 3.093771311909787, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, -5.0, 6.210898792063733]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 1.8568589519865748]], [[1.0, -0.1, 2.0, 4.0, 4.0, 4.0]], [[7.0, 3.0, 9.0, -1.0, 13.0, 2.0, 2.0, 6.0, 3.0, 7.0]], [[7.0, 3.0, -1.0, 2.0, -0.2950823455421112, 2.0, 2.989630289631409, 4.0, 1.9879782849688847, 6.0, 2.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, 5.0, 4.95439506042047]], [[-3.0, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6]], [[1.377524891878108, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 17.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825]], [[7.0, 3.0, 9.0, -1.0, 4.0, 6.0, -1.0]], [[7.0, 3.0, -1.0, 2.0, 2.0, 4.0, 6.0, 3.0, 6.698272723595944, 6.941347396260423]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 9.0, 11.0, -1.0, 3.0, -2.033802097685287, 1.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 1.1519077916929108, 2.317700548477839, 2.6, 11.0, -3.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0, 3.0]], [[-3.0, -2.5, -1.2, 0.0, 1.3, 2.6, 2.317700548477839, 2.6]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 5.167048792887977, -3.0, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0]], [[2.0, 3.0479423465957955, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 4.0]], [[2.675310403852642, 2.0, 3.6728877465517957, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, -100000.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 3.0, 4.0, 4.0, 100000.0, 100000.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, -3.6497815875309945, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 2.8812658011312893, 3.0, 4.0, 17.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825]], [[-2.5, -1.2, 0.0, -1.9243870830593395, 1.3, 2.6, -2.033802097685287, 2.317700548477839, -100000.0, 2.6, 11.0, -1.9243870830593395]], [[2.6, 0.0, 0.0, 0.0, 1.0]], [[-2.212238668183224, 0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 1.0, 1.0]], [[-3.0, -2.5, -1.2, 0.0, -3.271286856294544, 1.3, 2.6, 1.1519077916929108, 2.317700548477839, 2.6, 11.0, -3.0, 1.3]], [[7.0, 3.286574222026122, 3.0, -1.0, 2.940752465498065, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0, 2.0]], [[2.0, 1.8568589519865748, 3.0, 3.0, 4.0, 2.3974061228253545, 100000.0, -100000.0]], [[-5.0, -3.0, 0.3128608452500923, 3.0, 6.210898792063733, 0.3128608452500923, 5.0, 7.0, 9.0, 11.0]], [[-0.3440825794661051, -3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6]], [[2.0, -3.6497815875309945, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0, 2.317700548477839, 3.0, 2.317700548477839]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6, 2.6]], [[4.833878055412355, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 6.0, 2.0, 2.0, 3.0, 7.687190467376851]], [[2.675310403852642, 2.0, 3.6728877465517957, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, -100000.0, 2.675310403852642]], [[2.0, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 2.996533149237559, 4.0, 100000.0, -100000.0, 4.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 0.0, 0.546353249751977, 1.0, 1.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, -3.271286856294544, 6.89535009486304, 11.0, 6.210898792063733, -2.033802097685287, 6.210898792063733]], [[2.0, -3.6497815875309945, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0, 2.317700548477839, 3.0, 17.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 9.344477625800707, 2.317700548477839, 2.6, 11.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 6.0, 2.0, 3.0, 7.0]], [[7.0, 3.0, 9.0, -1.0, 2.0, 4.0, 6.577002407130273]], [[-1.8821461758972977, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 7.0, 3.0, -5.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 4.268063860875567, 1.3, 6.210898792063733, 0.1581270304608839, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, -3.271286856294544, 0.38904762141515903, 6.89535009486304, 11.0, 6.210898792063733, -2.033802097685287, 6.210898792063733, 6.210898792063733]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 1.1519077916929108, 2.317700548477839, 2.6, 11.0, -3.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 0.546353249751977, 1.0, 1.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, -1.9490889498022153, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0]], [[-5.0, -1.8821461758972977, -1.0, 1.0, 6.210898792063733, 5.0, 7.0, 8.670628219354063, 11.0]], [[-0.5100337078730766, -5.0, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0]], [[7.0, 3.0, -1.0, 2.0, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0, 2.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 3.0, 6.210898792063733, 5.0, -3.6497815875309945, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[-5.0, -2.1195243965065043, 3.093771311909787, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 6.210898792063733]], [[1.89085792733363, 2.0, 3.0, 3.0, 4.0, 4.0, 100000.0, -100000.0, 4.0, 4.0]], [[-5.0, -3.0, -1.0, 1.0, 1.9231874764034629, 6.210898792063733, 5.0, 7.0, 9.0, 4.770428788329857, 13.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, -3.6497815875309945, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0, -3.0]], [[7.0, 3.0, 0.0, 9.0, -1.0, 2.0, 2.0, 4.0, 5.125238815616499, 6.0, 6.0]], [[-2.870785908662275, -3.0, -2.5, -1.2, 0.0, -2.5, 1.3, 2.6, 1.1519077916929108, 2.317700548477839, 2.6, 11.0, -3.0]], [[2.0, 2.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0]], [[-5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 13.0, 6.210898792063733, 5.0, -3.271286856294544, 0.38904762141515903, 6.89535009486304, 6.210898792063733, -2.033802097685287, 6.210898792063733, 6.210898792063733]], [[1.0, 2.0, 2.604901901518098, 3.0, 19.0]], [[2.0, 2.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[1.89085792733363, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 3.0]], [[7.0, 3.0, -5.0, 4.0, 6.0, -5.0, 6.0, 4.0]], [[7.0, 1.7028886023781937, 3.0, 9.0, -1.0, 5.001164845966617, 2.0, 2.0, 1.9879782849688847, 6.0]], [[5.373081551848091, 2.0, 2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0, 3.0]], [[-3.0, -1.2, -2.298305269747882, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6]], [[2.0, 2.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.0]], [[2.3974061228253545, 2.0, 1.5971393412498083, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, -0.3440825794661051, 4.95439506042047, 4.0, 3.0]], [[-5.0, -1.8821461758972977, -1.0, 1.0, -1.2, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-0.5100337078730766, -5.0, -2.033802097685287, -1.0, 1.0, 3.38441078074546, 3.0, 5.0, 9.0, 11.0, -1.0, 3.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, -0.9053077270335478, 4.0, 4.0, 4.0]], [[2.0, 2.0, 3.0, 0.18490766288493937, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825]], [[2.0, -3.6497815875309945, 3.0, 3.0, 3.0, 4.0, 4.0, 2.317700548477839, -100000.0, 2.317700548477839]], [[-0.5100337078730766, -0.7560991815460972, 0.0, 0.0, 0.927368319637066, 0.0, 11.0, 1.0, 0.0]], [[13.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[7.0, 3.0, -1.0, 2.0, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0, 2.0, 6.0]], [[-5.0, -3.0, 3.0, 4.009964202838896, 6.210898792063733, 7.0, 9.0, 11.0, -5.0]], [[2.0, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0]], [[7.0, 3.0, -1.0, 2.0, -0.2950823455421112, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0, -0.2950823455421112]], [[0.0, 1.8568589519865748, 0.0, 0.0, 0.3084506581856825, 0.0, 0.0, 0.0, 0.546353249751977, 1.0, 1.0, 1.0]], [[2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, -100000.0]], [[7.0, 9.0, -1.0, 4.0, 6.0, -1.0, 9.0]], [[7.0, 3.0, 9.0, 1.9879782849688847, -1.0, 2.6672071366353363, 2.0, 4.0, 6.0, 3.0]], [[-5.0, -3.0, -0.3115474205775115, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 11.0, 11.0]], [[-3.0, -2.5, -12.900064462349789, 0.0, -1.9243870830593395, 1.3, 2.6, -2.033802097685287, 2.317700548477839, 2.6, 11.0, -1.9243870830593395, 0.0]], [[1.377524891878108, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.424148152025293, 0.3084506581856825, 4.0, 0.3084506581856825]], [[1.0, -0.1, 2.0, 4.0, 4.0, 4.0, 1.0]], [[1.89085792733363, 2.0, 3.0, 3.0, 3.0, 2.675310403852642, 4.0, 4.0, 4.0, 0.546353249751977, -100000.0, 4.0, 4.0]], [[4.833878055412355, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 2.0, 2.0, 3.0, 7.687190467376851]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 4.0, 3.518404627675752, 0.3084506581856825]], [[7.0, 1.613929098849716, 3.0, 9.0, -1.0, 1.377524891878108, 2.0, 1.9879782849688847, 6.0, 2.0]], [[-2.033802097685287, -5.0, 3.266924662181324, -2.1195243965065043, -3.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[2.317700548477839, -3.0, -1.0, 1.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, -0.5]], [[-4.747059300613937, -0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 1.1519077916929108, 11.0, -1.0, -2.5, 3.0, -2.5]], [[3.0, 0.0, 9.0, -1.0, 2.0, 2.0, 4.0, 5.125238815616499, 6.0, 6.0]], [[0.0, 0.1581270304608839, 0.0, 0.0, 0.0, 0.0]], [[-5.0, 2.709339832728434, -2.1195243965065043, 3.093771311909787, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 6.210898792063733]], [[13.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 13.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 5.423014615696999, 9.0, 11.0, -1.0, 3.0, 5.0, 5.0]], [[-5.0, -3.0, -0.3115474205775115, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0]], [[3.0, 0.0, 9.0, -1.0, 2.0, 2.0, 4.0, 6.0, 0.3128608452500923, 6.0]], [[13.0, 0.3084506581856825, 0.0, 0.0, 0.0, 1.0]], [[1.89085792733363, 2.0, 3.0, 3.0, 4.0, 4.0, 100000.0, 4.0, 4.0]], [[7.0, 3.0, 9.0, 1.9879782849688847, -1.0, 2.6672071366353363, 2.0, 4.0, 3.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 13.0, -3.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, -2.5, 3.0, -2.5]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 0.3084506581856825, 4.0, 3.0]], [[-3.0, -2.5, -1.2, 0.0, -2.5, 2.6, 2.317700548477839, 2.6, 11.439507913526228, 2.6]], [[13.0, 0.0, 0.0, 0.0, 0.0, 1.0, 13.0]], [[2.0, 2.6274907176106725, 3.3897940249536718, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 15.0, 100000.0, 1.8803882689883606, -100000.0, 100000.0]], [[0.0, 1.8568589519865748, 0.0, 0.0, 1.0, 0.546353249751977, 1.8568589519865748, 1.8568589519865748]], [[4.833878055412355, 3.0, 9.0, -1.0, 2.0, 1.9879782849688847, 6.0, 1.1020021624546297, 2.0, 3.0, 7.687190467376851]], [[2.0, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 3.7435131776430204, 4.0, 4.0]], [[-3.0, -1.2, -2.298305269747882, 0.0, -2.5, 1.3, 2.6274907176106725, 2.317700548477839]], [[2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.317700548477839, 1.0, -100000.0, -100000.0]], [[2.3974061228253545, 2.7499191886213326, 2.0, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 2.3974061228253545, 4.0]], [[2.0, 3.5496229973645987, 3.0, 3.0, 2.093512706816888, 3.0, 4.0, 4.0, 2.317700548477839, -100000.0]], [[2.0, 2.0, 3.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 0.3084506581856825, 4.0, 3.0]], [[-2.1195243965065043, 2.3974061228253545, 2.7499191886213326, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 2.3974061228253545, 4.0]], [[2.0, 1.8568589519865748, 3.0, 4.0, 2.3974061228253545, 100000.0, -100000.0, 2.0]], [[2.0, 2.0, 3.0, 3.0, 3.132612632596544, 4.0, 4.0, 4.0, 3.0]], [[0.0, 0.0, 0.0, -4.747059300613937, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[2.0, 3.63532512522154, 3.0, 3.0, 3.0, 4.0, 4.0, 4.0, 100000.0, -100000.0]], [[8.485686893878379, 0.0, 0.0, 0.0, 1.0]], [[2.0, 2.0, 3.0, 3.0, 3.0, 3.0164328160662626, 4.0, 4.0, 4.0, 3.0]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, 3.0, 1.0, 5.0]], [[2.0, 2.0, 4.009964202838896, 3.0, 3.0, 4.0, 4.0]], [[1.0, 2.0, 3.0, 1.991219214535127]], [[-1.0, 5.0, 7.0, 9.0, 11.0, 13.0, 15.0, 17.0, 24.946980870408836, 19.0, 17.0, 23.70225109869183, 17.0]], [[7.0, 3.0, 9.0, -0.09033406201985716, 2.0, 4.0, 6.577002407130273]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 3.0164328160662626, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0, 3.0]], [[2.0, 3.0, 3.0, 5.373081551848091, 4.0, 4.0, 2.317700548477839, -100000.0, -100000.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 3.0, 1.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 3.0]], [[7.0, 15.0, -0.6957571854516531, -5.0, 2.0, 4.0, 6.0, -5.0, 6.0, 2.2570567824361802, 3.0]], [[-4.747059300613937, -0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 1.1519077916929108, 11.0, -1.0, 3.0, -2.5]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 5.423014615696999, 8.509277922044287, 11.0, -1.0, 3.0, 5.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0, 1.0]], [[-5.0, -1.8821461758972977, -1.0, 1.0, -1.2, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 6.210898792063733, 5.0]], [[7.0, 3.0, 9.0, -0.09033406201985716, 2.0, 5.829250022189214, 6.577002407130273, 2.0]], [[-5.063682676514065, -3.0, 1.0, 2.9770126806470683, -3.9144111138034585, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733]], [[-5.0, -2.033802097685287, -1.0, 1.0, 5.0, 9.0, -5.0, 11.0]], [[1.882888909339558, -3.0, -1.2, 0.0, -2.5, 1.3, 2.6, 2.317700548477839, 2.6]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 1.3, 6.210898792063733, 0.1581270304608839, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733]], [[2.0, 2.0, 3.0, 3.510011823263119, 4.009964202838896, 3.0, 3.0, 4.0, 4.0, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825, 4.0, 0.3084506581856825]], [[-5.0, -2.1195243965065043, -3.0, -1.0, 0.46169913310022603, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 11.0, 6.210898792063733, 9.0]], [[1.89085792733363, 2.0, 3.0, 3.0, 3.0, 4.0, 3.6864156720265173, 4.0, 100000.0, -100000.0, 4.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, -3.0, 1.0, 1.3, 6.210898792063733, 0.1581270304608839, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[2.3974061228253545, 1.6182674623272582, 3.0, 3.0, 3.844455868175311, 3.0, 4.0, 4.0, 4.0, 4.95439506042047, 4.0, 3.0]], [[-5.0, -2.1195243965065043, -3.0, -1.0, 1.0, 3.0, 6.210898792063733, 5.0, 7.0, 9.0, 6.210898792063733, 2.996533149237559]], [[0.0, 1.8568589519865748, 0.0, 0.0, 1.0, 3.266924662181324, 1.8568589519865748, 1.8568589519865748]], [[-5.0, -3.0, 0.3128608452500923, 3.0, 6.210898792063733, 0.3128608452500923, 5.0, 7.0, 9.0, 11.0, -3.0]], [[2.0, 2.0, 3.0, 3.0, 4.0, 4.0, 4.0, 4.0, 100000.0, -100000.0, 4.0, 4.0]], [[-0.5100337078730766, -5.0, -2.033802097685287, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, 9.0, 11.0, -1.0, -2.5, 3.0, 11.0, -5.0]], [[4.833878055412355, 3.254937912294724, 9.0, -1.0, 2.0, 1.9879782849688847, 2.0, 2.0, 3.0, 7.687190467376851]], [[0.0, 0.0, 0.0, 0.0, 0.0, 1.0, 1.0]], [[-5.0, -3.0, -1.0, 1.0, 3.0, 5.0, 7.0, 9.0, -5.0]], [[13.0, 0.3084506581856825, 0.0, 0.0, -0.31361409536449547, 1.0]], [[-0.5100337078730766, -0.7560991815460972, 0.0, 0.3084506581856825, 3.3897940249536718, 0.0, 0.0, 11.0, 1.0]], [[2.604901901518098, 3.0, -1.0, 2.0, 4.009964202838896, 2.0, 4.0, 1.9879782849688847, 6.0, 2.0, 2.0, 6.0]], [[-5.0, -3.0, -1.0, 1.0, 7.0, 6.210898792063733, 5.0, 7.0, 9.0, 4.770428788329857, 13.0]], [[0.0, 2.6, 0.0, 0.0, 1.0, 0.20411598356772886]], [[0.0, 0.0, 0.0, 0.0, 1.0, 0.0]], [[-2.033802097685287, -5.0, -2.1195243965065043, 3.38441078074546, -2.077778522892178, 1.0, 1.3, 6.210898792063733, 0.1581270304608839, 5.0, 7.0, 9.0, 11.947768299915708, 6.210898792063733, -3.0]], [[1.0, 3.0, 4.0, 2.0, 4.0]], [[2.0, -3.6497815875309945, 3.0, 3.0, 3.0, 4.0, 4.0, -3.4147617533948647, 4.0, 2.317700548477839, -100000.0, 2.317700548477839, 3.0, 2.317700548477839]], [[-3.0, 5.423014615696999, -2.5, -1.2, 0.0, 1.3, 2.6, 2.317700548477839, 2.6]], [[-5.0, -2.033802097685287, -1.0, 1.0, 3.0, 5.0, 5.423014615696999, 8.509277922044287, 11.0, -1.0, 3.941667953273927, 5.0]], [[-0.5100337078730766, -5.063682676514065, -5.0, -1.0, 1.0, 3.0, 5.0, 4.95439506042047, -2.5, 9.0, 11.0, -1.0, -2.5, 3.0]]], "completion": "\nfrom typing import List\nimport numpy as np\n\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"\n min_num = np.min(numbers)\n max_num = np.max(numbers)\n result = [(x - min_num) / (max_num - min_num) for x in numbers]\n return result\n", "raw_completion": "Here's the complete function definition:\n\n```python\nfrom typing import List\nimport numpy as np\n\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"\n min_num = np.min(numbers)\n max_num = np.max(numbers)\n result = [(x - min_num) / (max_num - min_num) for x in numbers]\n return result\n```\n\nThis function takes a list of numbers and rescales them to fit within the range [0, 1]. The minimum value in the input list becomes 0 and the maximum value becomes 1. The rest of the numbers are scaled proportionally. The function returns a new list with the rescaled values.", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef rescale_to_unit(numbers: List[float]) -> List[float]:\n \"\"\" Given list of numbers (of at least two elements), apply a linear transform to that list,\n such that the smallest number will become 0 and the largest will become 1\n >>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])\n [0.0, 0.25, 0.5, 0.75, 1.0]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/22", "prompt": "from typing import List, Any\n\n\ndef filter_integers(values: List[Any]) -> List[int]:\n \"\"\" Filter given list of any python values only for integers\n >>> filter_integers(['a', 3.14, 5])\n [5]\n >>> filter_integers([1, 2, 3, 'abc', {}, []])\n [1, 2, 3]\n \"\"\"\n", "entry_point": "filter_integers", "canonical_solution": "\n return list(filter(lambda x: type(x) == int, values))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([4, {}, [], 23.2, 9, 'adasd']) == [4, 9]\n assert candidate([3, 'c', 3, 3, 'a', 'b']) == [3, 3, 3]\n", "contract": "\n assert type(values) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[]], [[4, {}, [], 23.2, 9, "adasd"]], [[3, "c", 3, 3, "a", "b"]]], "atol": 0, "plus_input": [[[1, 2, 3, 4, 5]], [[2.5, 4.6, 7.8, "abc", {}, []]], [[true, false, null, 0, -10, "test", [], {}, 3.14]], [[1, "2", "3", 4, -5]], [[1000000, -1000000, 1.32, "-1", "-2", [1, 2, "three"]]], [["apple", 2.71828, null, false, "watermelon", 42]], [[1, -1, 0, 999]], [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]], [[1.5, 2.7, 3.0, -4.6]], [["hello", "world", "how", "are", "you"]], [[true, false, null, 0, 3.253739830287621, -10, "test", [], {}, 3.14]], [["arare", "world", "how", "are", "you"]], [["hello", "worldd", "how", "are", "you", "hellhelloo", "how"]], [[1.5, 2.7, 3.0, -4.6, 1.5, 1.5]], [[1.5, 2.7, 3.0, 1.5]], [[4.6, 7.8, "aapplebc", {}, [], 2.5]], [["apple", 2.71828, null, false, "watermelon", 42, 2.71828]], [[1.5, 2.7, 3.0, -4.6, -4.6]], [[2.7, 3.0, -4.6, 1.5, 1.5]], [["hello", "how", "world", "how", "test", "you"]], [[true, false, null, 0, -10, "test", [], {"1.5": "hellhelloo", "2.5": "-2", "2.7": "-2", "3.0": "-2", "82.08860694438306": "hello", "-51.08332919278058": "Guxr", "18.590257578242174": "are", "61.76736727274371": "HECIzOixT", "62.37768526891736": "hello"}, 3.14]], [[{"1.5": "hellhelloo", "2.5": "-2", "2.7": "-2", "3.0": "-2", "82.08860694438306": "hello", "-51.08332919278058": "Guxr", "18.590257578242174": "are", "61.76736727274371": "HECIzOixT", "62.37768526891736": "hello", "4.6": "watermelon"}, true, false, null, 0, -10, "test", [], {"1.5": "hellhelloo", "2.5": "-2", "2.7": "-2", "3.0": "-2", "82.08860694438306": "hello", "-51.08332919278058": "Guxr", "18.590257578242174": "are", "61.76736727274371": "HECIzOixT", "62.37768526891736": "hello", "4.6": "watermelon"}, 3.14]], [[1.5, 2.7, 3.0, -51.08332919278058, -4.6]], [[78.61928819331277, -6.77509560458482, -16.107923403329096, -80.34678514569492]], [[1.5, 2.7, 3.0, 1.5, 2.7]], [["hello", "how", "world", "how", "", "ho-2w", "worldhow", "test", "you"]], [[2.7, 3.0, 1.5, 1.5]], [[true, false, null, 0, -10, "test", [], {}, 3.14, "test"]], [[4.6, 7.8, "aapplebc", {}, [], 2.5, []]], [[2.5, 4.178596277327428, 7.8, "abc", {}, [], {}]], [[8, 1, 2, 3, 4, 5, 5, 1]], [["apple", "appaapplebcle", 2.71828, null, false, "watermelon", 42, 2.71828, "apple"]], [[2.5, 4.6, 7.8, "abc", {}, [], 7.8]], [[1.5, 2.7, 3.0, -16.107923403329096, -4.6, -4.6]], [[2.7, 1.5, 1.5]], [[1.5, 1.32, 3.0, 1.5]], [["hello", "worldd", "how", "are", "you", "hellhelloo", "howatermelonw"]], [[2.5, 4.6, 7.8, "abc", "cabc", {}, []]], [[true, false, null, 0, -10, "test", [], {}, 3.14, null]], [[true, false, null, 0, -10, "test", [8], {}, 3.14, null]], [["hello", "worldd", "how", "heho-2wllhelloo", "are", "you", "hellhelloo", "how"]], [[2.7, 1.32, 3.0, 1.5, 1.5]], [["hello", "worldd", "how", "-2", "you", "htestlHECIzOixTonw", "hellhelloo", "howatermelHECIzOixTonw"]], [[2.7, 1.5, 2.8509645275834243, 2.212995480233853, 2.8509645275834243]], [[1, -1, 0, 999, 1]], [["hello", "worldd", "-22", "how", "-2", "you", "htestlHECIzOixTonw", "hellhelloo", "howatermelHECIzOixTonw"]], [[3.0, 1.5, 1.5]], [[true, false, null, 0, -10, "watermelon", [], {}, 3.14, "test"]], [[2.5, 4.6, 7.8, "abc", {}, [], 7.8, 4.6]], [[2.7, 3.0, 1.5, 1.5, 3.0]], [["hello", "worldd", "-22", "htestlHECoIzOixTonw", "how", "-2", "you", "htestlHECIzOixTonw", "hellhelloo", "howatermelHECIzOixTonw"]], [[4.6, 7.8, 3.14, "aapplebc", {}, 5.274713462957015, [], 2.5, 7.8]], [[2.7, 1.5, 2.8509645275834243, 2.212995480233853, 2.5072599122885295, 2.8509645275834243, 2.7]], [[0, 1, 42, 3, 4, 5, 6, 7, 8, 9]], [["hello", "how", "world", "habcow", "te"]], [[2.5, 4.750003778215635, 7.8, "abc", {}, [], 7.8]], [[1.5, 2.7, 3.0, -16.107923403329096, -4.6, -4.6, -16.107923403329096]], [["hello", "how", "world", "", "ho-2w", "worldhow", "test", "you"]], [["hello", "world", "hhow", "how", "are"]], [[2.5, 4.6, 7.8, "abc", "cabc", {}, [], "cabc"]], [[2.5, 4.6, 8.693163028136272, "abc", {}, []]], [[2.5, 8.693163028136272, "abc", 2.5]], [[78.61928819331277, 2.8509645275834243, 2.71828, -80.34678514569492]], [["apple", 2.71828, null, false, "watermelon", 42, 2.71828, "watermelon"]], [[2.5, 7.554464521917485, 4.6, -80.34678514569492, "abc", 1.5283152591294504, {}, [], 7.8, 4.6]], [["hello", "how", "world", "", "ho-2w", "worldhow", "test", "you", "test"]], [["apple", 2.71828, null, false, "wahellhellootermelon", 42]], [[1.5, 1.5]], [["hello", "how", "world", "how", "", "ho-2w", "worldhowhow", "test", "you"]], [[78.61928819331277, 2.8509645275834243, 2.71828, -80.34678514569492, -80.34678514569492]], [[2.5, 4.6, 7.8, "abc", {}, "abchaFbcowF", []]], [[1, "2", "3", 4, -5, "2"]], [[2.7, 3.0, 1.8262900227722207, -4.6, 1.5, 1.5]], [["hello", "how", "world", "how", "", "ho-2w", "worldhowhowworldhow", "test", "you"]], [[1, "2", "3", 4, -5, 1]], [[1.5, 3.0, 1.5, 3.0]], [[2.5, 4.750003778215635, 7.8, "abc", {}, [], 8.164599210590822]], [["apple", 2.71828, null, "-2", false, "wahellhellootermelon", 42]], [[1.5, 3.253739830287621, 3.0, -4.6, -4.6]], [[7.8, "aapplebc", {}, [], 2.5, []]], [[2.7, 3.0, 1.9007953338604962, 1.8262900227722207, 1.5, 1.5]], [[1, -1, 0, 999, 999, 1]], [[4.6, 7.8, 3.14, "aapplebc", [39], {}, 5.274713462957015, [], 2.5, 7.8]], [["hello", "how", "world", "", "ho-2w", "worldhow", "test", "you", "how"]], [[1.5, 3.0, 1.5, 61.76736727274371]], [[2.5, 3.2332014890113814, 4.6, 7.8, "abc", {}]], [[true, false, null, 0, -10, "test", [], {}, 3.14, 3.14]], [["hello", "worldd", "how", "are", "you", "hellhelloo"]], [[1, -1, 0, 999, 5, 998, 1, 1]], [[2.7, 3.0, -16.107923403329096, -4.6, 2.7, -4.6, -4.6]], [[4.178596277327428, 7.8, "abc", {}, [], 4.6, {}]], [[2.5, 3.9551271039754745, 7.8, 5.274713462957015, "abc", "cabc", {}, [], "cabc"]], [[2.7, 1.5, 2.5072599122885295, 1.5]], [[8, 1, 2, 3, 4, 5, 5, 1, 1]], [[true, null, 0, -10, "watermelon", [], {}, 3.14, "test"]], [[1.5, 1.32, 3.0, 1.5, 1.5]], [["apple", 7.554464521917485, null, "-2", 42]], [["hello", "worldd", "how", "heho-2wllhelloo", "are", "you", "hellhelloo", "how", "you"]], [[2.7, 3.0, 8.164599210590822, 1.5, 3.0]], [[1, "2", {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}]], [[1, [2, "3"], "4", ["5", 6], 7]], [[[1, "2"], ["3", [4, "5"]], [], ["abc", "def"]]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"]]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0]], [[1, [2, "3"], [4], [5, 6], [7, 8], 9]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, 2, "3", 4, 5.6, [], {}, true, false]], [[1, [2, 3], 4, [5, 6], [], [7, "8"], {}, "9"]], [[false, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, [4], [5], [7, 8], 9]], [[1, [2, "3"], "4", ["5", 6], 7, [2, "3"]]], [[1, [], [], [5], [7, 8], 9, 9]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], [4], {}, {"a": 1, "b": 2}, [4], [5, 6, "7"]]], [[1, [], [], 8, [5], [7, 8], 9, 9, []]], [[1, [4], [5], [7, 8, 8], 9]], [[1, [2, 3], 4, [5, 6], [], [7, "8"], {}, "9", [5, 6]]], [[1, [2, "3"], [8], [5, 6], [7, 8], 9]], [[1, [], [], 8, [5], [7, 8], 9, 9, [], [7, 8]]], [[1, false, 2, 3, "four", 3, 5.5, 6, "seven", "8", 9.0, "8"]], [[1, 2, 4, "four", 5.5, 6, "seven", "8", 9.0]], [[1, [4], [5], [7, 8], 9, [4]]], [[true, false, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, 10, [2, "3"], [4], [5, 6], [7, 2], [7, 2], 9]], [[1, [], [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8]]], [[[1, "2"], ["3", [4, "5"]], [], ["abc", "def"], [1, "2"]]], [[[1, "2"], ["3", [4, "5"], [4, "5"]], [3.2561962704756695, 5.6, 9.0, 78.78537654009631, 5.5, 9.0, -64.85350532834121], ["3", [4, "5"], [4, "5"]], [], ["abc", "def"]]], [[false, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], "b"]], [[1, [2, "3"], "4", ["5", 6], 7, [2, "3"], 1]], [[1, [4], [5], [7, 8], 8]], [[1, "one", [1, 2, 3], {"six": 6}]], [[1, [], [], 8, [5], [8], 9, 9, [], [8]]], [[1, [2, "3"], [4], [5, 6, 6], [7, 8], 9, 1]], [[1, [2, "3"], [5, "5", 6], "4", [5, "5", 6], 7, [2, "3"]]], [[1, [4], [5], [7, 8], 7, [5]]], [[1, [2, "3"], [4], [5, 8, 6, 6], [5, 8, 6, 6], [7, 8], 9, 1]], [[[2, "3"], ["5", 6], 7]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5]]], [[1, [], [], 8, [5], [8], 9, 9, [], [8], 9]], [[1, [2, "3"], [8], [5, 6], [7, 8], 9, [2, "3"]]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [78.78537654009631], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], null, [3, 4]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], 8, [5], [9], 9, 9, [], [9], 9, [9]]], [[2, 1, "one", [1, 2, 3], {"six": 6}]], [[1, 2, 4, "four", 5.5, 7, "seven", "8", 9.0]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], 8, [5], [9], 9, 9, 6, [], [9], 9, [9]]], [[1, [2, 3], 4, [5], [], [7, "8"], {}, "9"]], [[[], [], [6], [true, true, true, true, false, true, true, true, true], [7, 8], 9, [6]]], [[1, [2, "3"], [4], [5, 8, 6, 5, 6], [5, 8, 6, 5, 6], [7, 8], 9, 1]], [[0, [2, "3"], [4], [5, 8, 6, 6], [5, 8, 6, 6], [7, 8], 9, 1]], [[2, false, 2, 3, "four", 3, 5.5, 6, "seven", "8", 9.0, "8"]], [[2, 1, "one", [1, 3], {"six": 6}]], [[[1, "2"], ["3", "33", 4], [5, "six"], [], ["seven", "8"]]], [[1, [2, "3"], [4], [5, 6, 6], [7, 8], 9, 1, [4]]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5], [true, true, true, true, false, true, true, true, true]]], [[[5, 8, 1, 6], 2, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1]], [[["5", 6], 7, [2, "3"]]], [[1, [2, "3"], "4", ["5", 6], 7, 7]], [[0, 2, 3, "four", 5.5, 6, "seven", "8", 9.0]], [[[5, 8, 1, 6], 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1]], [[[4], [5], 8]], [[[5, 8, 1, 6], 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [4]]], [[1, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}]], [[1, [2, "3"], [8, 5, 8, 6, 6], [4], [8, 5, 8, 6, 6], [8, 5, 8, 6, 6], [7, 8], 9, 1]], [[1, 2, 3, 5.5, 6, "seven", "8", 9.0]], [[1, [2, "3", 2], [4], [5, 6], [7, 8], 9]], [[["2"], ["3", [4, "5"]], [], ["2"], ["abc", "def"]]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5], [5]]], [[[5], 8]], [[1, [4], [5], [7, 8, 8], 9, [5]]], [[1, [2, 3], 4, [5], [], [7, "8"], "9", "9", {}, 1]], [[1, 2, 4, "four", 5.5, 6, "33", "seven", "8"]], [[[1, "2"], ["3", 4], ["sixx", 5, "six"], [], ["sixx", 5, "six"], ["seven", "8"]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], [5], [9], 9, 9, [], [9], 9, [9]]], [[1, [4], [5], [7, 8, 8], 8]], [[1, 2, "3", 4, 5.6, [], {}, 1]], [[["5"], ["5"], 7, [2, "3"]]], [[1, [91, -6, -34, -7, 1, -62, 8, 3], [], [], 8, [5], [7, 8], 9, 9, [], [7, 8]]], [[1, [], [], [7, 8], 7, []]], [[1, [2, "3"], [4], [5, 6, 6], [7, 8], 9, 1, 1]], [[[6, 5], 8, [6, 5]]], [[1, [2, 3], 4, [5], [], [7, "8"], "KGNzr", "9", "9", {}, 1]], [[[], [], [6], [false, true, true, true, true, false, true, true, true, true], [7, 8], 9, [6]]], [[[4], [5], [7, 8], 9, [4], [4], [7, 8]]], [[0, 2, 3, "four", -64.85350532834121, 5.5, 6, "seven", "8", 9.0, 2]], [[1, [], [], 8, [5], [8, 7, 8], [8, 7, 8], 9, 9, []]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [-77.73982610929997, 38.97150492748381, 5.5, -60.70727279859112], 2.160209422392441, [], {}, {"a": 1, "b": 2}, -8, [3, 4], [5, "7"], 5]], [[-6, [5, 8, 1, 6], 2, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1]], [[[], [], 8, 8]], [[1, [2, 3], 4, [5], [], 1, [7, "8"], {}, "9"]], [[2, [2, "3"], [8, 5, 8, 7, 6, 6], [4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, 1]], [[1, [], [], 8, [], [7, 8], 9, 9, [], [], [7, 8], []]], [[[1, "2"], ["3", [4, "5"]], [], ["abc", "def"], ["abc", "def"]]], [[[5, 8, 1, 6], 2, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [7, 8]]], [[1, 2, "33", 4, 5.6, [], {}, 1]], [[1, [4], [5], 9, [5]]], [[1, 2, 3, "8", 5.5, 6, "seven", "8", 9.0]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], [5], [9], 9, 9, [], [9], 9, [9], 9]], [[1, [2, 3], 4, [5], [], [7, "8"], "9", {}, 1]], [[[2, "8", "3"], [8], [5, 6], [7, 8], 9, [2, "8", "3"]]], [[0, 2, 3, "foneour", 5.5, 6, "seven", "8", 9.0]], [[[5, 8, 1, 6], 2, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [5, 8, 1, 6]]], [[1, 2, "3", 4, 5.6, {}, true, false, "3"]], [[[], [], [6], [7, 8], 9, [6]]], [[1, [], [], 8, [5], [7, 3, 8], 9, 9, ["", false], [7, 3, 8]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [-77.73982610929997, 38.97150492748381, 5.5, -60.70727279859112], 2.160209422392441, {}, {"a": 1, "b": 2}, -8, [3, 4], [5, "7"], 5, [5, "7"]]], [[6, [7, 8, 8], 1, [], [], [7, 8, 8], 7, []]], [[[1, "2"], ["3", "fe", 4], [5, "six"], [], ["seven", "8"]]], [[[5, 8, 1, 6], 2, -1, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [7, 8]]], [[[], 1, [8, 4], [], [8, 4], [7, 8], 9]], [[[4], 8, [4]]], [[1, [2, 3], 4, [5], 91, [], [7, "8"], "9", {}, 1]], [[1, [2, 4, 3], 4, [5], [], [7, "8"], "9", "9", {}, 1]], [[1, [], 8, [5], [8], 9, 9, [], [8]]], [[["3", "33", 4], [5, "six"], [], ["seven", "8"]]], [[["3", "fe", -8, 4], [1, "2"], ["3", "fe", -8, 4], [5, "six"], [], ["seven", "8"], [5, "six"], [5, "six"]]], [[[5, 8, 1, 6], 2, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [5, 8, 1, 6], [5, 8, 1, 6], [5, 8, 1, 6]]], [[2, 1, "one", [1, 2, 3], {"six": 6}, 2, {"six": 6}]], [[10, [91, 31, 89, 1, -8, -1], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], [5], [9], 9, 9, [], [9], 9, [9], 9]], [[1, 2, 4, "four", 6, "KmDGrOFc", 9.0]], [[1, [], [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], [7, 8]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false, ["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"]], [5], [9], 9, 9, [], [9], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false, ["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"]], 9, [9]]], [[[1, "2"], ["3", [4, "5"]], ["abc", "def"], [1, "2"]]], [[1, [], [], 8, [8, 3, 8], [5], [8, 3, 8], 9, 9, ["", false], [8, 3, 8]]], [[[1, "2"], ["3", "33", 4], [], ["seven", "8"], [], []]], [[1, [4], [5], [7, 8, 8], 9, [5], 9]], [[1, [], [], 8, [5], [8], 9, 9, [], [8], 9, 91, 9]], [[true, false, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, [3, 4], [5, 6, "7"]]], [[["3", "fe", -8, 4], [1, "2"], ["3", "fe", -8, 4], ["six"], [], ["seven", "8"], ["six"], ["six"], ["six"]]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, [5], [5]]], [[[5, 8, 1, 9, 6], [5, 8, 1, 9, 6], -34, 2, 0, [2, "3"], [4], [5, 8, 1, 9, 6], [5, 8, 1, 9, 6], [7, 8], 1]], [[1, [2, 3], 4, [5], [], 4, [7, "8"], "9", {}, 1]], [[6, [2, "3"]]], [[[1, "2"], [5, "six", 5, "six"], ["3", 4], [5, "six", 5, "six"], [], ["seven", "8"]]], [[10, [], [5], [9], 9, 9, [], [9], 9, [9]]], [[0, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, 2]], [[1, [2, "3"], [4], [6, 8, 6, 5, 6], [6, 8, 6, 5, 6], [7, 8], 9, 1, [4]]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {"mA": false, "8": "five", "": null, "two": [1, 0, 3, 98, 9], "oZAXtkfeOn": "AFlfnbQj", "gxqoouhnE": [true, true, true, true, true, true, false, true], "rHiG": -64.18845567266615, "Xd": false, "rjpWKmrF": false}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[1, [2, "3"], [8], [-8, 5, 6], [7, 8], [-8, 5, 6], 9]], [[1, "2", {"six": -1}, {"three": 3}, [1, 2, 3], "rjpWKmrF", [4, 5, 4], {"six": -1}]], [[1, [4], [5], [7, 8, 8], 8, 1]], [[89, 1, "one", [1, 2, 3], {"six": 6}]], [[true, false, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], false]], [[1, [2, 4, 3], 4, [5], [], [7, "8", 7], "9", "9", {}, 1]], [[[], [], 8, [5], [8, 7, 8], [8, 7, 8], 9, 9, []]], [[[1, "2"], [5, "six", 5, "six"], ["3", 4], [5, "six", 5, "six"], [], ["seven", "8"], [5, "six", 5, "six"]]], [[[2, "3"], [8, 5, 8, 7, 6, 6], [4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, 1]], [[1, 10, [2, "3"], [4], [5, 6], [7, 2], 8]], [[[8, 5, 8, 7, 6, 6], [4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, [8, 5, 8, 7, 6, 6]]], [[[], [], [6], [7, 8], 9, [6], [7, 8], 9]], [[1, [2, "3"], [4, 4], [5, 6, 6], [7, 8], 9, 1, 1, 9]], [[1, [2, 3], 4, [5], [], 1, [7, "8"], {}, "9rHiG", "9"]], [[1, [91, -6, -34, -7, 1, -62, 8, 3], [], [], 8, [5], [7, 8, 7], 9, 9, [], [7, 8, 7]]], [[[true, true, false, false], 1, [], [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], 1]], [[1, 2, 3, "8", 5.5, 6, "seven", "8", 9.0, 5.5]], [[[1, "2", "2"], [5, "six", 5, "six"], [1, "2", "2"], ["3", 4], [5, "six", 5, "six"], [], [1, "2", "2"], ["seven", "8"], [5, "six", 5, "six"]]], [[1, [2, "3", 2], [8], [5, 6], [7, 8], 9, [2, "3", 2]]], [[1, [2, 3], 4, [8, -34], [5], [], 1, [7, "8"], {}, "9rHiG", "9"]], [[1, [2, "3"], [4], [5, 6], [7, 8], 9, [5, 6]]], [[6, 2, 1, "one", [1, 3], {"six": 6}]], [[[4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, [8, 5, 8, 7, 6, 6]]], [[1, "33", 4, 5.6, [], {}, 1, 4]], [[1, {"three": 3}, [4, 5, 5], [1, 31, 2, 3], [1, 31, 2, 3], [4, 5, 5], {}]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5], [5], [5], []]], [[[1, "2"], ["abc", "def"], [1, "2"]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], 8, [-12.150421779464011, 26.154702412083537, 5.6], [5], [9], 9, 9, 6, [], [9], 9, [9], 9]], [[[5, 8, 1, 6, 6], 0, [2, "3"], [4], [5, 8, 1, 6, 6], [5, 8, 1, 6, 6], [5, 8, 1, 6, 6], [7, 8], 1]], [[["3", "33", 4], [5, "six"], [], ["8", "seven", "8"], ["8", "seven", "8"]]], [[false, false, null, 1.3, 4, [5, "7"], -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"]]], [[0, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "four"]], [[1, [4], [5], 10, 9, [5]]], [[1, "33", 4, 5.6, [], {}, 1, 4, 4]], [[1, -8, [2, 3], 4, [5], [7, "8r"], [], [7, "8r"], {}, "9"]], [["8seven", 2, false, 2, 3, "four", 3, 5.5, 6, "seven", "8", 9.0, "8"]], [[1, "33", [2, "3"], [5, "5", 6], "4", [5, "5", 6], 7, [2, "3"]]], [[7, [], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5], [true, true, true, true, false, true, true, true, true]]], [[{"three": 3}, 1, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}]], [[1, [4], [5], [7, 8], 3]], [[[5, 8, 1, 6], -1, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [7, 8]]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [78.78537654009631], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], null, [3, 4], [78.78537654009631]]], [[1, [2, "3"], [6, 8, 6, 5, 6, 5], [6, 8, 6, 5, 6, 5], [6, 8, 6, 5, 6, 5], [7, 8], 9, 1, [4]]], [[2, 3, "foneour", 5.5, 6, "seven", "8", 9.0]], [[1, -8, [2, 3], 4, [5], [7, "8r"], [], [7, "8r"], {}, 0, "9"]], [[1, 2, 3, "8", 5.5, 6, -8, "seven", "8", 9.0]], [[1, [], 8, [], [5], [7, 8], 9, 9]], [[1, [2, "3"], [5], [5, 8, 6, 6], [5, 8, 6, 6], [7, 8], 9, 1]], [[10, [], [5], [9], 9, 9, [51, 10], [], [9], [9]]], [[[1], ["3", [4, "5"]], ["abc", "def"], [1]]], [[1, 10, [2, "3"], [-82, 4], [5, 6], [7, 2], [7, 2], 9]], [[1, 10, [3], [2, "3"], [3], [5, 6], [7, 2], 8]], [[10, [], [5], [9], 9, [], [9], [false, false, false, true, true, true, false], 9, [9]]], [[1, 2, 3, "four", 5.5, 6, "seven", 6, "8", 9.0]], [[1, [4], [false], [7, 8], [false], 7, [false]]], [[2, false, 2, 3, "four", "sevefour", 3, 5.5, 6, "seven", "8", 9.0, "8"]], [[1, -8, [2, 3], 4, [5], [7, "8r"], [], [7, "8r"], {}, 31, 0, "9"]], [[1, "2", {"six": -1}, {"three": 3}, [1, 2, 3], "8seven", [4, 5, 4], {"six": -1}, {"six": -1}]], [[1, [2, 3], 4, [5], [false, false, false, false, false, false, false, true], 4, [7, "8"], "9", {}, 1]], [[10, [], [5], [9], 9, [], [9], [false, false, false, true, true, true, false], 10, [9], [9]]], [[1, "33", 4, 5.6, [], {}, 8, 4]], [[1, 2, "3", 4, 4.38335732992138, [], {}, 1]], [[0, 2, 3, "four", -64.85350532834121, 5.5, 6, "r7", "8", 9.0]], [[1, [], 8, [], [7, 8], 9, 9, [], [], [7, 8], []]], [[6, [7, 8, 8], [], [], [7, 8, 8], 7, []]], [[1, [2, "3"], [4], [5, 6, 5], [7, 8]]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5], [33], [5], [5], [], [7, 8]]], [[[6, 5, 5, 5], 8, [6, 5, 5, 5], [6, 5, 5, 5], [6, 5, 5, 5]]], [[1, 2, "3", 4, 5.6, {}, 1, 5.6]], [[[33, 4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, [33, 4, 4], [8, 5, 8, 7, 6, 6]]], [[1, [2, "3"], [4], [5, 6], [7, 8], 9, [5, 6], [5, 6], [5, 6]]], [[1, [2, "3"], [4], [5, 8, -6, 6, 5, 6], [5, 8, -6, 6, 5, 6], [7, 8], 9, 1]], [[[1, "2"], [5, "six"], [], ["seven", "8"]]], [[2, 4, "foneour", 5.5, 6, "seven", "8", 9.0]], [[10, [], [5], [9], 9, [], [9], [false, true, false, true, true, true, false], 9, [9]]], [[1, [4], [5], 9, 9]], [[1, [3, 2, "3"], [4], [6, 8, 6, 5, 6], [3, 2, "3"], [6, 8, 6, 5, 6], [7, 8], 9, 1, [4]]], [[[], [], [6], [7, 8], 9, [7, 8], 9]], [[10, [], [5], [9], 9, [true, false, false, 2.160209422392441, "OCEUXUKZO", false, 49, true], [9], [false, false, false, true, true, true, false], 10, [9], [9]]], [[[5, 8, -62, 6], 2, [2, "3"], [4], [5, 8, -62, 6], [5, 8, -62, 6], [7, 8], 1, [5, 8, -62, 6], [5, 8, -62, 6], [5, 8, -62, 6]]], [[[4], 8]], [[1, "2", {"six": -1}, {"three": 3}, [1, 2, 3], "8seven", [4, 5, 4], "n8seven", {"six": -1}, {"six": -1}]], [[1, [2, "3"], [6, 8, 6, 5, 6], [6, 8, 6, 5, 6], [6, 8, 6, 5, 6], [7, 8], 9, 1, [4]]], [[[], 1, [3, 8, 4], [3, 8, 4], [], [3, 8, 4], [7, 8], 9]], [[1, [2, "3"], [8], [-8, 5, 6, -8], [7, 8], [-8, 5, 6, -8], 9, 9]], [[0, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "four8"]], [[false, null, 1.3, 5, -7, 0, "a", "b", [], [], [4], {}, {"a": 1, "b": 2}, [4], [5, 6, "7"]]], [[true, false, null, 1.3, 5, null, -7, 0, "a", "b", [], [78.78537654009631], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], null, [3, 4], [78.78537654009631], false, "a"]], [[false, false, null, 1.3, 4, ["7"], -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], ["7"]]], [[[1, "2"], ["3", "33", 4], [5], [], ["seven", "8"]]], [[1, [4], [5], [7, -85, 8, 8], 9, [7, -85, 8, 8]]], [[6, [7, 8, 8], [], [], [7, 8, 8], 7, [], []]], [[1, [2, 3], 4, [5, 6], [], [7, "8"], {}, "9", 1]], [[[33, 4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, [33, 4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6]]], [[false, false, null, 1.3, -7, 0, "b", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[[2, "3"], [4], [5, 8, 6, 5, 6], [5, 8, 6, 5, 6], [7, 8], 9, 1]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "four"]], [[false, true, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, -8, 4, [7, "8r"], [], [7, "8r"], {}, 31, 0, "9"]], [[[2, "3"], [8, 5, 8, 7, 6, 6], [4, 4], [8, 5, 8, 7, 6, 6], [8, 5, 8, 7, 6, 6], [7, 8], 9, 1, [8, 5, 8, 7, 6, 6]]], [[[], [], 8, [5], [8, 7, 8], [8, 7, 8], 31, 9, []]], [[[5, 8, 1, 6], 2, [2, "3"], [4], [5, 8, 1, 6], [7, 8], 1, [5, 8, 1, 6], [5, 8, 1, 6], [5, 8, 1, 6]]], [[1, [4], [33], [-34, 7, 8], 7, [33]]], [[1, 33, [2, 4, 3], 4, [], [7, "8"], "9", "9", {}, 1]], [[1, {"three": 3}, [4, 5, 5], [1, 31, 2, 3, 1], [1, 31, 2, 3, 1], [4, 5, 5], {}]], [[1, [2, "3"], [4, 4], [5, 6, 6], [7, 8], 9, 1, 1, 5, 5]], [[98, 1, 2, 4, "four", 5.5, 6, "33", "8"]], [[[7, -1, 2], 1, [2, "3"], [4], [5, 6], [7, -1, 2], [7, -1, 2], 9]], [[1, [2, 3], 4, [5, 6], [], [7, "8"], {}, "9", [5, 6], []]], [[1, "33", 5.6, [], {}, 1, 4, 1]], [[4, [2, 3], 4, [5], [], [7, "8"], {}, "9"]], [[1, [2, "3"], "4", ["5", 6], 7, [2, "3"], "4", [2, "3"]]], [["33", 5.6, [], {}, 1, 4, 4]], [[["5", 6], 7, [2, "3"], [2, "3"]]], [[1, [2, "3", 2], [7, 8, 7], [4], [5, 6], [7, 8, 7], 9]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], "bb", [5, 6, "7"]]], [[[5, 8, 1, 6], 0, [2, "3"], [4], [5, 8, 1, 6], [7, 8], 1, [4]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"], [5, "7"], 5]], [[1, 10, [2, "3"], [-82, 6], [5, 6], [-82, 6], [7, 2], [7, 2], 9]], [[1, ["3"], [4], [7, 5, 6], [7, 8], 9, [7, 5, 6], [7, 5, 6]]], [[3, 0, 2, 3, "four", 5.5, 6, "seven", 9.0, "four", 3]], [[1, [], 8, [], [7, 8], 9, 10, [], [], [7, 8], []]], [[1, 2, 4, 5.6, [], {"64": true, "-39": false, "-34": false, "7": true, "-75": false, "10": true, "-46": true}, 1]], [[1, 2, 4, "four", 5.5, 6, "b", 9.0]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8, 8], 9, 9, [5], [7, 8, 8], [5], []]], [[1, [2, "3", 2], [88, 89], [5, 6], [7, 8], [88, 89], [88, 89], 9, [2, "3", 2]]], [[[], [], 8, [5], [8, 7, 8], [8, 7, 8], -1, []]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], [4], {}, {"a": 1, "b": 2}, [4], [5, 6, "7"], [4]]], [[1, [4], [5], 10, 9, [5], 10]], [[0, 2, 3, 5.5, 6, "seven", "8", 9.0, "four"]], [[[], [], [5, 5], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5, 5], [5, 5], [5, 5], [5, 5], []]], [[1, [2, "3"], [4], [5, 6], [7, 8], 9, [5, 6], [5, 6], [5, 6], [5, 6]]], [[[4], [5], [7, 8], 9, [4], [4], [7, 8], [4], [5]]], [[1, [2, "3"], [4], [6, 8, 6, 4, 6], [6, 8, 6, 4, 6], [7, 8], 9, 1, [4]]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], [4], {}, {"a": 1, "b": 2, "2": -85}, [4], [5, 6, "7"], [4]]], [[0, 2, 3, "foneour", 5.5, 6, "seven", 10.26739187055086, "8", 9.0]], [[[true, true, false, false], 1, [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], 1, []]], [[[6, 5]]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], "bb", [5, 6, "7"], -7]], [[1, [2, "3"], [5, 6], [7, 8], 9, [2, "3"]]], [[[2, "3"], [8, 5, 8, 7, 6, 6], [4, 4], [8, 5, 8, 7, 6, 6], 91, [8, 5, 8, 7, 6, 6], [7, 8], 9, 1, [8, 5, 8, 7, 6, 6]]], [[1, -8, 4, [7, "8r"], [], [7, "8r"], {}, 31, 0, "9", [7, "8r"]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false, ["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"]], [], [9], 9, 9, [], [9], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false, ["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"]], 9, [9]]], [[[], 8, 8]], [[2, 1, "one", [1, 2, 3], {"six": 6}, 5, {"six": 6}]], [[1, {"three": 3}, [4, 5, 5], [1, 31, 2, 3, 1], [1, 31, 2, 3, 1], [4, 5, 5], {}, {}]], [[[4], [5], [7, 8], 8]], [[1, [], [], 8, 8, [5], 9, 9, ["", false], [7, 8], [7, 8]]], [[1, [2, 3], 4, [], [false, false, false, false, false, false, false, true], 4, [7, "8"], "", {}, 1]], [[6, 1, [], [], [7, 8, 6, 8], [7, 8, 6, 8], 7, [], 7]], [[1, [], [], 8, 8, 49, 9, ["", false], [7, 8], [7, 8]]], [[false, false, null, 1.3, 5, -7, 0, null, "a", "b", [], [], {}, -46, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, [2, "3"], [4, 4], [5, 6, 6], 9, 1, 9]], [[10, [], [5], [1, 9], [true, false, false, 2.160209422392441, "OCEUXUKZO", false, 49, true], [1, 9], [false, false, false, true, true, true, false], 10, [1, 9], [1, 9]]], [[1, 2, 10, 4, 5.5, 6, "b", 9.0]], [[1, [], [], 8, [5], [7, 8], 9, 9, ["", false]]], [[true, false, null, 1.3, 5, -34, 1, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], false]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], "bb", [5, 6, "7"], [5, 6, "7"]]], [[[], 1, [3, 8, 4], [3, 8, 4], [], [3, 8, 4], [7, 8], 9, [7, 8]]], [[true, false, null, 1.3, 5, null, -7, 0, 6, "a", "b", [], [78.78537654009631], {}, {"a": 1, "b": 2}, [3, 4, 4], [5, 6, "7"], null, [3, 4, 4], [78.78537654009631], false, "a"]], [[2, 1, "one", [1, 2, 3], {"six": 6}, 5, {"six": 6}, [1, 2, 3]]], [[1, [2, "3"], [4, 4], [7, 5, 6, 6], [7, 5, 6, 6], [7, 8], 9, 1, 1, 9, [7, 5, 6, 6]]], [[[2, "8", "3"], [8], [5, 6], [7, 8], 9, [2, "8", "3"], [2, "8", "3"]]], [[1, 4, [5, 6], [], [7, "8"], {}, "9", [5, 6], []]], [[[33, 4, 4], [8, 5, 33, 8, 7, 6, 6], [8, 5, 33, 8, 7, 6, 6], [8, 5, 33, 8, 7, 6, 6], [7, 8], 9, [33, 4, 4], [8, 5, 33, 8, 7, 6, 6]]], [[1, [2, "3"], [5], [5, 8, 6, 6], [7, 8], 9, 1]], [[[2, "3", 2]]], [[4, [2, 3], 4, [5], [], [7, "8"], {}, "9", []]], [["8seven", 2, false, 2, 3, "four", 3, 5.5, 6, "seven", "8", 5.6, "8"]], [[true, false, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, [3, 4], null, [5, 6, "7"], []]], [[[], 88, [], [5], [true, true, true, true, false, true, true, true, true], [8, 8], 9, 9, [5], [8, 8], [8, 8], [5], []]], [[2, false, 2, 3, "four", "sevefour", 3, 5.5, 6, false, "seven", "8", 9.0, "8"]], [[1, [4], [5, 5], [7, 8], 9, [7, 8]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false, ["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"]], [5], [9], 9, 9, [], [9], 9, [9], 9]], [[1, [2, "3"], [4, 4], [5, 6, 6], [7, 8], 9, -6, 1, 1, 9]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 7, 8], 9, [5], [7, 7, 8], [5]]], [[[4], 5, 8, [4]]], [[1, [], [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], [7, 8], []]], [[1, [], [], 8, [5], [8, 8, 8], 9, 1, 9, [], [8, 8, 8], 9]], [[[2, "3"], [5], [5, 8, 6, 6], [7, 8], 9, 1, [2, "3"], [5, 8, 6, 6]]], [["8seven", 2, false, 2, 3, "four", 3, 5.5, 6, "seve", "8", 5.6, "8"]], [[1, 2, "3", 4, 4.38335732992138, [], {}, 1, 4.38335732992138]], [[false, false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"], [5, "7"], 5]], [[2, 1, "one", [1, 2, 3], {"six": 6}, 5, {"six": 6}, "one"]], [[1, 2, 10, 4, "b", 9.0]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "8", 2]], [[["5", "5"], ["5", "5"], ["5", "5"], 7, [2, "3"]]], [[-85, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}]], [[1, 10, [2, "33", "3"], [-82, 4], [5, 6], [7, 2], [7, 2], 9]], [[[], [], [5], [-14.291974746911734, 78.78537654009631, -64.85350532834121, 9.0, 2.1936660852041427, 4.38335732992138, 10.26739187055086, 46.39190795333232, -64.85350532834121], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5], [5], [5], []]], [[[1], ["abc", "def"], [1]]], [[1, [5, 5], 10, 9, [5, 5]]], [[1, [4], 0, [5], [7, 8, 7], [7, 8, 7], 8]], [[[1, "2"], ["3", "33", 4], [5], [], ["seven", "8"], [5]]], [[[2, "gxqoouhnE3"], 6, [2, "gxqoouhnE3"]]], [[true, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[[], [], [5, 5], [-14.291974746911734, 78.78537654009631, -64.85350532834121, 9.0, 2.1936660852041427, 4.38335732992138, 10.26739187055086, 46.39190795333232, -64.85350532834121], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5, 5], [5, 5], [5, 5], [], [3, -82, 4, -7, -85]]], [[true, false, true, null, 1.3, 5, -7, 1, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], false]], [[1, [2, "3"], [4, 4], [5, 6, 6], [7, 8], 1, 1, 5, 5]], [[2, "foneour", 5.5, 6, "seven", "8", 9.0]], [[10, [], [5], [9], 9, 9, [], [9], 9, [9], []]], [[2, "one", [1, 2, 3], {"six": 6}, 2, {"six": 6}]], [[1, [], 8, [5], [8], 9, 9, [8]]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5], [5], [5], [], []]], [[1, "one", [1, 2, 3], {"six": 6}, 5, {"six": 6}, "one", [1, 2, 3]]], [[1, 2, 4, "four", 5.5, 6, "seven", 5.47111118517439, "8", 9.0, 9.0]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5], [5], [true, true, true, true, false, true, true, true, true]]], [[1, "33", 4, 5.6, [], {}, 1, 4, 4, 4, 4, 4]], [[[8], 1, [2, "3"], [4], [5, 6], [8]]], [[false, false, null, 1.3, 5, [5, "7"], 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"], [5, "7"], 5]], [[1, {"three": 3}, [5, 4, 5, 5], [32, 1, 31, 2, 3, 1], [5, 4, 5, 5], [32, 1, 31, 2, 3, 1], [5, 4, 5, 5], {}]], [[1, [2, "3", 2], [88, 89], [5, 7, 6], [7, 88, 8], [88, 89], [88, 89], [5, 7, 6], [2, "3", 2]]], [[1, 2, "3", 4, 0, [], {}, 1]], [[1, [2, 3], 4, [5], [], [7, "8"], "9", {}, 1, 4]], [[[1, "2"], ["3", [4, "5"]], [], [1, "2"]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [], [], {}, {"a": 2, "b": 2, "aa": 3}, [3, 4], [5, "7"]]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], 8, [-12.150421779464011, 26.154702412083537, 5.6], [5], [9], 9, 9, 51, [], [9], 9, [9], 9]], [[1, [2, 4, 3], 4, [5], [], [7, "8", 7], "9", 7, "9", {}, 1]], [[1, 4, [5, 6], [], [7, "8"], "9", 1]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "four", 9.0, 3]], [[[], [], [6], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], [6], 9, [6], [6], [6], []]], [[true, null, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], "bb", [5, 6, "7"], [5, 6, "7"], []]], [[1, [2, 4, 3], 4, [5], [], [7, "8"], "9", "9", {"5.992347830691955": "cLcCOaRd"}, 1]], [[[5, 8, 1, 6, 8], 2, -1, [2, "3"], [4], [5, 8, 1, 6, 8], [5, 8, 1, 6, 8], [7, 8], 1, [7, 8]]], [[["3", "33", 4], [5, "six"], ["8", "seven", "8"], ["8", "seven", "8"]]], [[1, [4], [5]]], [[1, 2, 4, 5.6, [], {"64": true, "-39": false, "-34": false, "7": true, "-75": false, "10": true, "-46": true}, 1, 4]], [[1, [2], 10, [2, "3"], [-82, 6], [-82, 6], [2], [2], 9]], [[[], [], [5, 5], [-14.291974746911734, 78.78537654009631, -64.85350532834121, 9.0, 2.1936660852041427, 4.38335732992138, 10.26739187055086, 46.39190795333232, -64.85350532834121], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [5, 5], [5, 5], [5, 5], [], [3, -82, 4, -7, -85], [5, 5]]], [[1, 4, [5, 6], [], [7, "8"], "9", -82, 1]], [[1, [5, 5], 10, 9, [5, 5], 9]], [[[5, 6], 1, [2, "3"], [4], [5, 6], [7, 8], 9, [5, 6], [5, 6], [5, 6], [5, 6]]], [[[1, "2"], [], ["seven", "8"]]], [[1, [2, 3], 4, [5], 1, [7, "8"], {}, "9rHiG", "9", [5]]], [[1, [2, "cLcCOaRd"], [8, 5, -82, 6, 6], [4], [8, 5, -82, 6, 6], [8, 5, -82, 6, 6], [7, 8], 9, [2, "cLcCOaRd"], 1]], [[1, [2, "3"], [4], [5, 6], [7, 8], 9, [5, 6], [5, 6], [5, 6], 1]], [[10, [], [5], [9, 9], 9, [], [9, 9], [false, false, false, true, true, true, false], 9, [9, 9]]], [[10, [2, "33sixx", "3"], 10, [2, "33sixx", "3"], [-82, 4], [5, 6], [7, 2], [7, 2], 9, 10]], [[["5"], ["5"], 7, [2, "3"], 7]], [[[], [], [true, true, true, true, false, true, true, true, true, true], [6], [true, true, true, true, false, true, true, true, true, true], [7, 8], 9, [6], [true, true, true, true, false, true, true, true, true, true]]], [[1, [5, 5, 5], {"three": 3}, [5, 5, 5], {"-87.67350452877344": false, "26.154702412083537": true, "10.26739187055086": false}, [32, 1, 31, 2, 3, 1], [5, 5, 5], [32, 1, 31, 2, 3, 1], [5, 5, 5], {}]], [[[true, true, false, false], 1, [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], 1]], [[1, 1, "3", 4, 4.38335732992138, [], {}, 1, 4.38335732992138]], [[[7, 8, 7, 8], 1, [2, "3"], [4], [7, 8, 7, 8], 9, [7, 8, 7, 8], [5, 6], [2, "3"]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [], [], {"82": "JEXjp", "89": "33sixx", "52": "rHiG", "37": "seven", "81": "a", "-17": "yPnTiQSee", "9": "EM", "46": "gxqoouhnE", "-8": "AFlfnbQj", "58": ""}, {}, {"a": 2, "b": 2, "aa": 3}, [3, 4], [5, "7"]]], [[1, [2, "3"], "44", ["5", 6], 7, 7]], [[["3", 4], ["sixx", 5, "six"], [], ["sixx", 5, "six"], ["seven", "8"]]], [["oe", 2, 1, "one", [1, 3], {"six": 6}]], [[1, [2, "3"], [4], [5, 6], [7, 8], 10, [5, 6]]], [[1, [2, "3"], [46], [5, 6, 5], [7, 8]]], [[0, 2, 3, "four", -56.438301600649005, 5.5, 6, "8", 9.0]], [[true, false, null, 1.3, 5, -7, false, 1, "33", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[[4], [5, 5], [7, 8], 9, [7, 8]]], [[[2, "3"], [4], [5, 8, 6, 5, 6], [5, 8, 6, 5, 6], [7, 8], 9, 1, [7, 8]]], [[1, [2, "3", 2], [88, -46], [5, 6], [7, 8], [88, -46], [88, -46], 9, [2, "3", 2]]], [[1, [2, 4, 3, 3], 4, [5], [], [7, "8"], "9", "9", {"5.992347830691955": "cLcCOaRd", "-12.150421779464011": "cLRcCOaRd"}, 1, []]], [[10, [], [["gKLFhi", "3", "rHiG", "three", "7", "KGNzr", "four"], false, true, 9.0, false], 8, [-12.150421779464011, 26.154702412083537, 5.6], [5], [9], 9, 9, 6, [], [9], 9, [9], 9, [-12.150421779464011, 26.154702412083537, 5.6]]], [[true, false, null, 1.3, null, -7, 0, 6, "a", "b", [], [78.78537654009631], ["AfNJ", "N", "VAsp", "XpdkWQlEq", "yPnTiQSeeb", "T", "voJZE", "a", "yPnTiQSeeb", "chs"], {}, {"a": 1, "b": 2}, [3, 4, 4], [5, 6, "7"], null, [78.78537654009631], false, "a"]], [[[], [], [5], [true, true, true, true, false, true, true, true, true], [7, 7, 8], 9, [5], [7, 7, 8], [5], [5]]], [[[5, 8, 1, 6], -75, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 0, 1, 1, [5, 8, 1, 6]]], [[false, false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"], [5, "7"], 5, -7]], [[["3", "33", 4], [5], [], ["seven", "8"]]], [[["2"], ["abc", "def"], ["2"]]], [[[2, "3"], 7, [2, "3"], 7]], [[2, 3, 5.5, 6, "seven", 9.0, "four"]], [[1, [2, 3], 4, [8, -34], [5], [], -17, [7, "8"], {}, "9rHiG", "9"]], [[true, false, true, true, true, false, false]], [[["5", "5"], ["5", "5"], ["5", "5"], 7, [2, "3", "3"]]], [[["3", 4], ["XpdkWQlEq", 5, "six"], [], ["XpdkWQlEq", 5, "six"], ["XpdkWQlEq", 5, "six"], ["seven", "8"]]], [[1, ["33", 2, "3"], "4", ["33", 2, "3"], "five", ["5", 6], ["33", 2, "3"], 1]], [[1, [], [], 8, [5, 5], [8], 9, 9, [], [8]]], [["33", 4, 5.6, [], {}, "yPnTiQSee", 8, 4]], [[3, 0, 2, 3, "four", 5.5, 6, "seven", "four", 3, 6]], [[2, 1, [2, 3], 4, [-17, 5], 1, [7, "8"], {}, "9rHiG", "9", [-17, 5]]], [[1, [2, "3"], [4, 4], [5, 6, 6], 1, 9]], [[1, [4, 4], [5, 6, 6], [7, 8], -6, 1, 88, 9]], [[["2"], ["3", [4, "5"]], [], ["2"], ["eightabc", "def"]]], [[[], [], [5, 5], [true, true, true, true, false, true, true, true, true], [7, 8], 9, 9, [5, 5], [5, 5], [5, 5]]], [[1, [2, "3"], "4", ["5", 6], 64, [2, "3"], 7]], [[-85, [7, 8, 8], 1, [], [], [7, 8, 8], 7, []]], [[1, "33", 4, 5.6, [], {}, 1, 4, 4, 4, 4, 4, []]], [[[], 8, [], [7, 8], 9, 10, [], [], []]], [[1, [], [4], [7, 5, 6], [], [7, 8], 9, [7, 5, 6], [7, 5, 6]]], [[1, ["3"], [4], [7, 5, 6], [7, 8], -34, [7, 5, 6], [7, 5, 6]]], [["foneour", 5.5, 6, "seven", "8", 9.0, 9.0]], [[[], ["abc", "def"], []]], [[[4], [5], 9, [4], [4], [7, 8], [5]]], [[[7, 8, 7, 8], 1, [2, "3"], [4], [7, 8, 7, 8], 9, [7, 8, 7, 8], [5, 6], [2, "3"], [7, 8, 7, 8]]], [[1, [4], 9, [], 9, [], 9]], [[1, [2, "3"], [8], 2, [5, 6], [7, 8], 9]], [[[5, 8, 1, 6], 2, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 1, [7, 8], [2, "3"]]], [[1, 1, [2, 3], 4, [5], 0, [], 1, [7, "8"], {}, "9rHiG", "9"]], [[1, 3, 3, "8", 5.5, "seven", "8", 9.0, 5.5, 9.0]], [[[5, 8, 1, 6], -75, 0, [2, "3"], [4], [5, 8, 1, 6], [5, 8, 1, 6], [7, 8], 0, 1, 1, 1, [5, 8, 1, 6]]], [[[4, 4], [5], [7, 8], 9, [4, 4], [4, 4], [7, 8], [4, 4], [5]]], [[1, [4], [5], [7, 8, 8], [5]]], [[1, 2, "3", 4, 5.6, [], {"-70.36440522028158": "4", "5.5": "JGIGeY"}, 1]], [[1, [2, "3"], [6, 8, 6, 5, 6, 5], [6, 8, 6, 5, 6, 5], [6, 8, 6, 5, 6, 5], [7, 8], 9, 1]], [[[], 88, [], [5], [true, true, true, true, false, true, true, true, true], [8, 8], 9, 9, [5], [8, 8], [8, 8], [5], [], 9]], [[1, [2, "3"], [8, 5, 8, 6, 6], [4], [8, 5, 8, 6, 6], [8, 5, 8, 6, 6], [7, 8], 9, 1, [2, "3"]]], [[1, 2, "88KGNzr", 4, 0, [], {}, 1]], [[["2"], ["3", [4, "5"]], ["2"], ["abc", "de", "def"]]], [[[4, 4], 1, [4, 4], [5], 10, 9, 1, [5], 10]], [[[], [], [false, true, true, true, false, true, true, true, true], [7, 8], [false, true, true, true, false, true, true, true, true], 9, [6], [false, true, true, true, false, true, true, true, true]]], [[1, [4], [7, 8, 8], 8, 1]], [[1, -8, [7, 88, "8r"], 4, [7, 88, "8r"], [], [7, 88, "8r"], {}, 31, 0, "9"]], [[[5, 8, 1, 6, 5], 98, 2, [4], [2, "3"], [4], [5, 8, 1, 6, 5], [5, 8, 1, 6, 5], [7, 8], 1, [5, 8, 1, 6, 5]]], [[[4, "six", 5, "six"], [1, "2"], [4, "six", 5, "six"], [], ["3", 4], [4, "six", 5, "six"], [], ["seven", "8"], [4, "six", 5, "six"]]], [[1, [4], [7, 8, 8], 8, 1, [4], [4]]], [[1, 2, 3, 5.5, 6, "seven", "8", 9.0, 1]], [[1, [4], [5, 5], [7, 8], -1, [7, 8]]], [[1, [2, 3], 4, [7, "ilLfRiWjv8", "8"], [8, -34], [5], [], -17, [7, "ilLfRiWjv8", "8"], {}, "9rHiG", "9"]], [[false, false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", 51, [], [], {}, {"a": 1, "b": 2}, [3, 4], {"twPZYf": 78, "oe": -17, "VAsp": 43, "bb": 54, "BuNS": 0, "PjdhPI": -34, "p": -91, "Zineqra": 7}, [5, "7"], [5, "7"], 5, -7]], [[1, [2, "3", 2], [88, 89], [5, 6], [7, 8], [88, 89], [88, 89], 9, [2, "3", 2], [7, 8]]], [[["2"], ["2"], ["3", [4, "5"]], [], ["abc", "def"], ["2"]]], [[1, [2, 4, 3, 3], 4, [5], [], [7, "8"], "9", {"5.992347830691955": "cLcCOaRd", "-12.150421779464011": "cLRcCOaRd"}, 1, [], [2, 4, 3, 3]]], [[1, -8, [2, 3], 37, 4, [5], [7, "8r"], [], [7, "8r"], {}, 0, "9"]], [[1, "2", {"six": -1}, {"78.78537654009631": false, "56.1614380073037": false, "-56.438301600649005": false}, [1, 2, 3], "rjpWKmrF", [4, 5, 4], {"six": -1}, {"six": -1}]], [[1, [], [], 8, 8, 49, 9, ["", false], [8], [8], [8]]], [[-46, 2, 1, "one", {"six": 6}]], [[1, {"three": 3}, [4, 5, 5], [1, 31, 2, 3], [4, 5, 5], {}]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, "a", "b", [-77.73982610929997, 38.97150492748381, 5.5, -60.70727279859112], 2.160209422392441, [], {}, {"a": 1, "b": 3}, -8, [3, 4], [5, "7"], 5]], [[[8, 1, 6], 2, -1, [2, "3"], [4], [8, 1, 6], [8, 1, 6], [7, 8], 1, [7, 8]]], [[0, 2, 3, 5.5, 6, "seven", "sveven", "88", "four"]], [[[4], [7, 8, 8], 8, 1]], [[[5, 6, 5, 5, 5], 8, [5, 6, 5, 5, 5], [5, 6, 5, 5, 5], [5, 6, 5, 5, 5]]], [[false, false, null, 1.3, {"-8": -33, "31": 2, "2": -85}, 5, [5, "7"], 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, "7"], [5, "7"], 5]], [[[4], [5], [7, 8], 8, 8]], [[1, [], 8, [], [7, 8], 9, 9, [], [], [7, 8], 10, []]], [[[], [], [4], [-14.291974746911734, 78.78537654009631, -64.85350532834121, 9.0, 2.1936660852041427, 4.38335732992138, 10.26739187055086, 46.39190795333232, -64.85350532834121], [true, true, true, true, false, true, true, true, true], [3, -82, 4, -7, -85], [7, 8], 9, [4], [4], [4], [], []]], [[1, -8, [2, 3], 4, [5], [7, "8r"], {}, 0, "9"]], [[1, [], [], 8, [5], [8], 9, 9, [], [8], [8]]], [[[], 1, [3, 8, 4], [3, 8, 4], [], [3, 8, 4], [7], 9, [7]]], [[false, false, null, 1.3, 5, [5, "7"], -7, 0, true, "a", "b", [], [], {"82": "JEXjp", "89": "33sixx", "52": "rHiG", "37": "seven", "81": "a", "-17": "yPnTiQSee", "9": "EM", "46": "gxqoouhnE", "-8": "AFlfnbQj", "58": ""}, {}, {"a": 2, "b": 2, "aa": 3}, [3, 4], [5, "7"]]], [[1, [2, "3"], [4], [5, 6, 6], [7, 8], 9, 1, [4], [7, 8]]], [[[1, "2"], ["3", "JGIGeY3", "33", 4], [5, "six"], [], ["seven", "8"]]], [[[], 1, [3, 8, 4], [], [7, 8], 9, [7, 8]]], [[1, -8, 4, [7], [7], [], [7], 31, 0, "9", [7], 4]], [[true, false, null, 1.3, 5, -7, 1, "a", "b", [10, {}, false, 6, -86, 2.1936660852041427, true, "six", "gRH"], [], {}, [3, 4], null, [5, 6, "7"], [], []]], [[6, 2, [33, 1, 3], 1, "one", [33, 1, 3], {"six": 6}, "one"]], [[1, [2, 3], 4, [5], [], 4, [7, "8"], "two", {}, 1]], [[1, 2, 4, "four", 5.5, 7, "8", 9.0]], [[[8], 1, [2, "3"], [4], [8], [8]]], [[1, -8, 4, [7], [[-96, -56.012823445328074, "kWifGJ", [true, false, false, true]], "ZAzrtCG", 10.705168450500778], [7], [], [7], 31, 0, "9", [7], 4]], [[2, [2, "3", 2], [4], [5, 6], [7, 8], 9]], [[1, [], 8, [5], [7, 8], 9, 9, ["", false], [7, 8], [7, 8]]], [[0, 89, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, 2, 2]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, "four", 9.0, 3, 2]], [[1, [2, 2, "3"], ["5", 6], 7, [2, 2, "3"], 1]], [[false, false, -6, false, null, 1.3, 5, [5, "7"], -7, 0, "a", 51, [], [], {}, {"a": 1, "b": 2}, [3, 4], {"twPZYf": 78, "oe": -17, "VAsp": 43, "bb": 54, "BuNS": 0, "PjdhPI": -34, "p": -91, "Zineqra": 7}, [5, "7"], [5, "7"], 5, -7]], [[true, false, 1, 1.0, "1", [1], {"1": 1}, null]], [[null]], [[1, 2, 3, true, false]], [[0, 0.0, "0", false]], [[3, 3, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, null, 4, 5, null, 6]], [[{}, [], ""]], [[null, true, false, "", {}, [], "", []]], [[1.23, "1", 18, 15, 83]], [[99999999999999999999999, -99999999999999999999999]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], []]], [[1, 2, "3", 4, 5.6, [], {}, true, false, []]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "ieight": 3}]], [[1, [2, "3"], [9, 4], [9, 4], [5, 6], [7, 8], 9]], [[1, "2", {}, [1, 2, 3], [4, 5]]], [[2, 3, "four", 5.5, 5, "seven", "8", 9.0, 9.0]], [[2, 3, "four", 5.5, 5, "seven", "8", 9.0, 9.0, "four"]], [[1, "2", {}, {}, [1, 2, 3], [4, 5]]], [[0, 2, "3", 4, 5.6, [], {}, true, false]], [[{"one": 1, "two": "2"}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "ieight": 3}]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}, {}]], [[{"three": [3, "four"]}, {}, {"five": 5, "six": "6", "e": 4}, {"seven": "7", "eight": 8, "ieight": 3}]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {}]], [[61, [1, "3"], "4", ["5", 6], 7]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}]], [[0, 2, "3", 4, 5.6, [], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[true, false, null, 0.7145384384689315, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"seven": "7", "eight": 8}]], [[61, ["3"], ["3"], "4", [6], 7]], [[15, [2, 3], 4, [5, 6], [], [7, "8"], {}, "9"]], [[{"one": 1, "two": "2"}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {}]], [[true, false, null, 1.3, 5, -7, 0, "a", "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[true, false, true, true, false, true, true, false, true, false]], [[1, 2, 3, "four", 5.5, 6, "seven", 9.0]], [[1, {}, {"": 8, "HGqT": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88}, [1, 2, 3], [4, 5], {"six": 6}, {}]], [[{"one": 1, "two": "2", "2": 6}, {"three": [3, "four"]}, {}, {"five": 6, "six": "6"}, {"seven": "7", "eight": 8}]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[false, null, 1.3, 5, -7, 0, "a", "b", {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}, {}, "2"]], [[true, false, true, true, true, false, true, true, false, true, false]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {"three": [3, 1, "ffour"], "5": [3, 1, "ffour"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[0, "2", {}, [1, 2, 3], [4, 5]]], [[{"three": [3, "four"]}, {}, {"seven": "7", "eight": 8}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"two": "2"}, {"five": 5, "six": "6"}, {}]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5}, {"five": 5}, {"seven": "7", "eight": 8, "ieight": 3}]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574]]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[1, {"2": "def", "32": "e", "9": "ZFWxOITt", "-77": "KrbucqKYo", "3": "4", "-7": "cwhDbmHbxo", "88": "3", "-39": "b"}, [2, 3], [4, 5], {"six": 6}, {}]], [[[1, 3], "2", {}, [4, 5]]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574]]], [[true, false, null, 1.3, 5, -7, 0, "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[1, 2, "3", 4, 5.6, [], {}, true, false, 5.6]], [[1, [2, "3"], [5, 6], [7, 8], 9]], [[true, false, null, 1.3, 5, -7, 0, "a", "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], false]], [[{"one": 1, "two": "2"}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"seven": "7", "eight": 8, "ieight": 3}]], [[1, [2, "3"], [9, 4], [9, 4], [5], [5], [7, 8], 9]], [[0, "2", {}, [1, 2, 3], [4, -77]]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[1, 2, "3", 4, 5.6, [], {}, true, true, []]], [[false, null, 1.3, 5, -7, 0, "a", "b", {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], {"5.6": 37.306238284726476, "35.50077440707028": 0.7145384384689315, "9.0": 77.33841772040307}, null]], [[true, false, true, true, false, true, true, false, true, false, false]], [[true, true, false, true, true, false, true, true, false, true, false]], [[true, false, null, 0.7145384384689315, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [6, "7"], [6, "7"]]], [[{"three": [3]}, {}, {"seven": "7", "eight": 8}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}]], [[2, 3, "four", 5.5, 8.103551238465293, 5, "seven", "8", 9.0, 9.0, "four"]], [[0, 2, "3", 4, 5.6, [], {}, true, false, {}]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {"three": [3, 1, "ffour"], "5": [3, 1, "ffour"]}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}, {"five": 5, "six": "6"}]], [[["3"], 1, ["3"], "cusZwMFvpu", ["5", 6], 7]], [[{"EWGKODI": true, "3": false, "fd": false, "cwhDbmHbxo": false, "pZrsjm": false, "bdef": true}, {"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}]], [[2, 3, "four", 5.5, 5, "seven", "8", 9.0, 9.0, "four", 5]], [[{"one": 1, "two": "2"}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"seven": "7", "eight": 8, "ieight": 3}]], [[2, 3, "four", 5.5, 3, "seven", "8", 9.0, 9.0]], [[1, {}, {"": 8, "HGqT": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88}, [1, 2, 3], [5], {"six": 6}, [5], {}]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}, {"-43": 81, "20": 9, "2": -45, "-87": true}, "2"]], [[false, null, 1.3, 5, -7, 0, 1.050449309718769, "a", "b", {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {"-58": "three"}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[{}, {}, {"three": [3, "four"]}, {"75.06494853429405": true, "5.5": false, "9.0": false, "-8.01599287644595": true, "47.41964484826693": false, "77.33841772040307": true}, {}, {}, {"five": 5, "six": "6"}]], [[1, 2, 3, "four", 5.5, "seven", 9.0, "four"]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3]]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}, {"seven": "7"}]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {"-58": "three"}, true, false, {"-58": "three"}]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "62"}, {"seven": "7"}]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {}, {}, {"five": 5, "six": "62"}, {}]], [[0, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4]]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}]], [[{"one": 1, "two": "2"}, {}, {"five": 5, "six": "7"}, {}]], [[1, 2, "3", 4, 5.6, -77, [], {}, true, false, 5.6]], [[2, 3, "four", 5.5, 8.103551238465293, 5, "seven", "8", 9.0, 9.0, "four", 2]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {}, {"five": "66", "six": "6"}, {"seven": "7", "eight": 8}]], [[1, "2", {"35.50077440707028": false, "-15.842422215662566": true, "35.28128866609691": false, "48.26663824348839": false, "37.306238284726476": false, "8.103551238465293": false, "71.56718429097134": false, "5.6": false}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3]]], [[1, {}, [1, 2, 3], [4, 5], {"six": 6, "sthree": 6}, {"six": 6, "sthree": 6}, {"-43": 81, "20": 9, "2": -45, "-87": true}, "2"]], [[1, "2", 29, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}]], [[0, "2", {}, {"5": false}, [1, 2, 3], [4, 5]]], [[{"three": [3, "four"]}, {}, {"seven": "7", "eight": 8}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}]], [[true, false, true, true, false, true, true, false, true, false, true]], [[{"one": 1}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"seven": "7", "ieight": 3}]], [[0, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4], "2"]], [[2, 3, "four", 5.5, 5, "seven", 9.0, 9.0, "four", 5, 5.5, 5]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], [-84, 49, 4], []]], [[{"one": 1, "two": "22"}, {"three": [3, "four"]}, {}, {"five": 5}, {"five": 5}, {"seven": "7", "eight": 8, "ieight": 3}]], [[[1, "2"], ["3", 4], [5, "six"], [-77, 73, 9, 29], [-84, 49, 4], []]], [[15, [2, 3], 4, [5, 6], [], [7, "8"], "9", [], []]], [[1, "2", 29, {"three": 3}, [4, 5]]], [[61, [1, "3"], "4", ["5", 6], 6]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "2", "9": "ZFWxOITt"}, {}, {"five": 5, "six": "6"}, {"seven": "2", "9": "ZFWxOITt"}]], [[1, [2, "3"], [9, 4], [9, 4], [5], [5], [7, 8], 9, 9, [9, 4]]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"one": 1, "two": "2"}]], [["2", {}, [1, 2, 3], [4, 5], "wsYK", 0]], [[{"one": 1, "two": "2"}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"one": 1, "two": "2"}]], [[61, 62, ["3"], ["3"], "4", [6], 7]], [[1, "2", 29, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3]]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"one": 1, "two": "2"}, {"three": [3, "four"]}]], [[0, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4], [1, 2, 3]]], [[15, [2, 3], 4, [5, 6], [], [7, "8"], "9", [], [], []]], [[2, 3, "four", 8.103551238465293, 5, "seven", "8", 9.0, 9.0, "four", 2]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}]], [[1, "2", {}, [1, 2, 3], [4, 5], {"six": 6}, {}, "2", "2", [1, 2, 3]]], [[true, false, null, 1.3, 5, -7, 0, "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "77"], 0]], [[true, false, true, true, true, false, true, false, true, true]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {}, 29, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[1, 2, 3, 88, "four", 5.5, 6, "seven", "8", 9.0]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 5.6, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {"cgvOtL": 94, "NK": 38, "": 93, "gRqSI": 4}, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[[2, "3"], 7, "KrbucqKYo", ["5", 6], 7]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}]], [[[2, "3"], 7, "KrbucqKYo", ["5", 6], 7, 7]], [[15, [2, 3], 4, [5, 6], [], ["8"], "9", [], [-52, 39, -77, -85, -31, -73, -27], []]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], [-84, 49, 4], [], [1, "2"]]], [[20, 1, [2, "3"], [9, 4], [9, 4], [], [], [7, 8], 9, 9, [7, 8]]], [[true, false, true, true, false, true, false, true, false, false, true]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[true, false, true, true, true, false, true, false, true, false, true]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}, {}]], [[0, false, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[[1, "2"], ["3", 4], [5, "six"], []]], [[0, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4], [1, 2, 3], [4, 5, 4]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"two": "2"}, {"five": 5}, {}, {"five": 5}]], [[{"one": 1, "two": "2"}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5", "3": "VcusZwMFvpuf"}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "ieight": 3}, {"five": 5, "six": "6"}]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {}, {"five": 5, "six": "6"}]], [[true, false, null, 1.3, 5, -7, 0, "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [15, 6, "7"]]], [[false, null, 5, -6, 0, "a", "b", {}, {"b": 2}, [3, 4], [5, 6, "7"], {"5.6": 37.306238284726476, "35.50077440707028": 0.7145384384689315, "9.0": 77.33841772040307}, null]], [[1, [5, 6], [], {}, "9"]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5}, {"seven": "7", "eight": 8}, {"five": 5}, {"seven": "7", "eight": 8}]], [[[1, "2"], [5, "six"], [-77, 73, 9, 29], [-84, 49, 4], []]], [[61, [1, "3"], "4", ["5", 6], 7, ["5", 6]]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}, {}, {"seven": "7"}]], [["2", {}, [1, 2, 3, 2], [4, 5], {"six": 6}]], [[1, [2, "3"], [5, 6], [7, 8], 9, [7, 8]]], [[{}, {"five": 5, "six": "7"}, {}]], [[false, null, 1.3, 5, -7, 0, "a", "b", {}, {"a": 1, "b": 2}, [5, 6, "7"]]], [[false, null, 1.3, 5, -7, 0, "a", "b", {}, {"a": 1, "b": 2}, [3, 32, 4], [3, 32, 4], [5, 6, "7"], {"5.6": 37.306238284726476, "35.50077440707028": 0.7145384384689315, "9.0": 77.33841772040307}, null]], [[2, 3, "four", 5.5, 8.103551238465293, 5, "seven", "8", 9.0, 9.0, "four", 2, "four"]], [[{"one": 1, "two": "2"}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "ieight": 3}]], [[true, false, null, 5, -7, 0, "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"two": "2"}, {"five": 5}, {}]], [[true, false, null, 1.3, 5, -7, 0, "bdef", [], [], {"a": 1, "b": 2}, [3, 4], [5, 6, "77"], 0]], [[[2, "3"], 7, "cgvOtL", ["5", 6], 7]], [[{}, 1, {}, {"": 8, "HGqT": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88}, [1, 2, 3], [4, 5], {}, {}]], [[false, false, null, 0.7145384384689315, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [6, "7"], [6, "7"]]], [[true, false, null, 1.3, 5, -7, 0, "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [64, 31, -57, 6, 20], [15, 6, "7"]]], [[1, [5.6, -91.64995486742458, 36.87380586293398, -39.73466216049497, -97.4543891854423, -34.863898336778206, 77.9888126831583, 1.3], 2, "3", 5.6, [], {}, true, true, [-63.32672563437423, "one"], [], []]], [[{"9": [3]}, {"one": 1}, {"9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"seven": "7", "ieight": 3}]], [[[1, "2"], ["3", 4], [5, "six"], ["seven", "8"]]], [[-1, "2", {}, {"a": 20}, [1, 2, 3], [4, 5]]], [[false, null, 5, -6, 0, "a", "b", {"59.31892072989703": "vbiLqOQgc", "0.7145384384689315": "cDHYdLb", "18.49102083179814": "VcusZwMFvpuf", "-63.32672563437423": "9"}, {"b": 2}, [3, 4], [5, 6, "7"], {"5.6": 37.306238284726476, "35.50077440707028": 0.7145384384689315, "9.0": 77.33841772040307}, null]], [[true, false, true, true, false, true, true, false, true, false, true, true]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, 3]], [[1, "2", {}, {}, [1, 2, 3], [4, 5], 1]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"two": "2"}, {"five": 5, "six": "6"}, {}, {}]], [[true, true, true, false, true, true, false, true, false, true, true]], [[{"one": 1, "two": "2"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"seven": "7", "eight": 8, "ieight": 3}, {"five": 5, "six": "6", "9": -7, "2": -31}]], [[1, "2", {}, [1, 2, 3], [4, 5], {}, "2"]], [[1, {"2": "def", "32": "e", "9": "ZFWxOITt", "-77": "KrbucqKYo", "3": "4", "-7": "cwhDbmHbxo", "88": "3", "-39": "b"}, [2, 3], {"six": 1}, {"six": 1}, {}]], [[{"three": [3]}, {}, {"five": 5, "six": "6", "ffoursix": false}, {"five": 5, "six": "6", "ffoursix": false}, {"seven": "7", "eight": 8}, {"seven": "7", "eight": 8}]], [[[1, "2"], ["3", 4, 4], [5, "six"], ["seven", "8"]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {}, {"five": 5, "six": "6"}, {}, {}, {}, {}]], [[1, "3", 4, 5.6, [], {}, true, false, 5.6]], [[2, 3, "four", 5.5, 8.103551238465293, 4, "seven", "8", 9.0, "four"]], [[-1, "2", {}, {"a": 20}, -57, [1, 2, 3], [4, 5]]], [[0, "2", {}, [1, 2, 3], [4, -77, -77], [4, -77, -77]]], [[[1, "2"], ["3", 4], [5, "six"], [-77, 73, 9, 29], [-84, 49, 4], [], [5, "six"]]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], ["3", 4], [5, "six"]]], [[2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, 29, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], false]], [[1, "five", {}, [1, 2, 3], [4, 5], {"six": 6}, {"-43": 81, "20": 9, "2": -45, "-87": true}, "2"]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"one": 1, "two": "2"}]], [[0, "2", "22", {}, [1, 2, 3], [4, -77, -77], [4, -77, -77]]], [[[1, 3], "M2", {}, [4, 5]]], [[15, 4, [], [7, "8"], {}, "9"]], [[1, 2, "3", 4, 5.6, -77, [], {}, true, false, 5.6, 4]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], false]], [["2", {}, [1, 2, 3], [4, 5], "wsYK"]], [[1, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4]]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {"seven": "7", "eight": 8}, {}]], [[{"one": 1, "two": "2"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"seven": "7", "eight": 8, "ieight": 3}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"one": 1, "two": "2"}]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {}, {}, {"five": 5, "six": "62"}, {"83.22791903415117": -63.32672563437423, "86.22528389061216": [-26.363205548902727], "18.49102083179814": [], "-51.84107482467499": false, "12.372679952362972": 49}]], [[["3"], 1, "cusZwMFvpu", ["5", 6], 7, ["5", 6]]], [[true, false, true, true, false, true, false, true, false, false, true, false]], [[1, "2", {}, {"six": 6}, {}, "2"]], [[{"three": [3, "four"]}, {}, {"seven": "7", "eight": 8, "ieight": 3}]], [[["3"], 1, "cusZwMFvpu", ["5", 6, "5"], ["5", 6, "5"], 7, ["5", 6, "5"]]], [[{"three": [3, "four"]}, {}, {"seven": "77", "eight": 8}, {"five": 5, "six": "6"}, {"seven": "77", "eight": 8}, {"seven": "77", "eight": 8}]], [[["3", 4], [5, "six"], [], [-84, -31, 49, 4], [], [1, "2"]]], [[1, "2", {}, [1, 2, 3], [4, 5], "KrbucqKYo2", {}, "2"]], [[1, [5.6, -91.64995486742458, 36.87380586293398, -39.73466216049497, -97.4543891854423, -34.863898336778206, 77.9888126831583, 1.3], 2, "3", 5.6, [], {}, true, true, [-63.32672563437423, "one"], []]], [[{"three": [3, "four"]}, {}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"five": 5, "six": ""}, {"one": 1, "two": "2"}]], [[{"one": 1, "two": "2"}, {"three": [2, "four"], "thrree": [2, "four"]}, {}, {"five": 5, "six": "6"}, {"three": [2, "four"], "thrree": [2, "four"]}, {"seven": "7", "eight": 8}, {}]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {"three": [3, 1, "ffour"], "5": [3, 1, "ffour"]}, {"eighEWGKODIt": 62, "UgeMtOIu": 84, "H": 2, "yuCTQ": -52, "KXZN": 62, "vbiLqOQgc": 6, "SIPe": 73, "a": 21, "7": 17}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8}]], [[{"three": [3, "four"]}, {}, {"seven": "77", "eight": -27}, {"five": 5, "six": "6"}, {"seven": "77", "eight": -27}, {"seven": "77", "eight": -27}]], [[2, 3, "four", 5.5, 5, "seven", 9.0, "four", 5, 5.5, 5]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 7}, {}, {"five": "66", "six": "6"}, {"seven": "7", "eight": 7}, {"seven": "7", "eight": 7}, {"seven": "7", "eight": 7}]], [[1, "2", {"abc": -27.569606066450092}, {"six": 6}, 2, "2"]], [[1, 2, 3, 88, "four", 5.5, 6, "seven", "8", 9.0, "seven"]], [[false, true, false, true, true, false, true, true, false, true, false, true]], [[{"one": 1, "two": "2"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"seven": "7", "eight": 8, "ieight": 3}, {"five": 5, "six": "6", "9": -7, "2": -31}, {"one": 1, "two": "2"}, {"one": 1, "two": "2"}]], [[2, 3, "four", 9.88644526278784, 5, "seven", "8", 9.0, 9.0, "four"]], [[true, true, true, false, true, true, false, true, false, true, true, true]], [[5.6, 2, 3, "four", 5.5, 5, "seven", "8", 9.0, 9.0, "four", 5, 3]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {}, {"five": 5, "six": "6"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {"five": 5, "six": "6"}]], [["2", {}, [4, 5, 4], [1, 2, 3, 2], [4, 5, 4], {"six": 6}, {"six": 6}]], [[1, "2", 29, {"three": 3}, [1, 2, 3], [4, 5], "22", {"six": 6}, 1]], [[1, [2, 3], "2", {}, {}, [2, 3], [4, 5], 1]], [["a", {}, [1, 2, 3], [4, 5], {"six": 6}, {"-43": 81, "20": 9, "2": -45, "-87": true}, "2", {"six": 6}]], [[{"one": 1}, {"one": 1}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}]], [[{}, {}, {"three": [3, "four"]}, {}, {}, {"five": 5, "six": "62"}, {}]], [[0, "2", "22", {}, [1, 2, 2, 3], [1, 2, 2, 3], [4, -77, -77], [4, -77, -77]]], [[[1, "2"], ["3", 4], [5, "six"], [-84, -84, 49, 4], [-77, 73, 9, 29], [-84, -84, 49, 4], []]], [[1, [2, "3"], [5, 6], 9, [7, 8]]], [[{}, {}, {"three": [3, "four"]}, {"75.06494853429405": true, "5.5": false, "9.0": false, "-8.01599287644595": true, "47.41964484826693": false, "77.33841772040307": true}, {}, {}]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {}, {"five": 5, "six": "6"}, {}, {}, {}, {}, {"three": [3, "four"]}]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], [15, 81, false]]], [[[1, 3], "three", {}, [4, 5]]], [[true, false, null, 0.7145384384689315, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [6, "7"]]], [[[false, "3", 9, 6, true, true, -15.842422215662566, 79], [1, "2"], ["3", 4], [5, "six"], [-84, -84, 49, 4], [-77, 73, 9, 29], [-84, -84, 49, 4], []]], [[-1, "2", {}, {"a": 20}, -57, [1, 2, 3], [4, 5], {"a": 20}]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}, {"three": [3, "four"]}]], [[20, 1, [2, "3"], [9, 3], [9, 3], [9, 3], [], [], [7, 8, 7], 9, 9, [7, 8, 7]]], [[75.4577532294401]], [[1, [2, "3"], [5, 6], 1]], [[false, null, 1.3, 5, -7, 0, "b", {}, {"a": 1, "b": 2}, [5, 6, "7"]]], [[0, 2, "3", 4, 5.6, [], {}, true, false, {}, []]], [[1, "2", 29, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3], {"three": 3}]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], [1, "2"]]], [[true, false, null, 1.3, 5, -7, 0, "a", "b", [], {}, {"a": 1}, [3, 4], [5, 6, "7"]]], [[2, "eighEWGKODIt", 3, "four", 5.5, 5, 35.50077440707028, "seven", "8", 9.0, 9.0, "four", 5]], [[0, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {"-58": "three"}, true, false, {"-58": "three"}]], [[1, "2", {}, [1, 2, 3], [4, 5], {}, "2", {}, "2", [4, 5]]], [[{"one": 1, "two": "2"}, {}, {"five": 5, "six": "7"}, {"anNy": false, "L": true, "GNjA": false, "six": true, "one": false, "bBHMqFdc": true}, {"one": 1, "two": "2"}]], [[1, [2, 3], {}, {}, {}]], [[61, [1, "3"], "4", ["5", 6, "5"], 7, ["5", 6, "5"]]], [[true, false, null, 0.7145384384689315, 5, 0.643208239507049, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [6, "7"], [6, "7"], -7]], [[0, 2, "3", 4, 5.6, {"cgvOtL": 94, "NK": 38, "": 93, "gRqSI": 4}, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[0, "2", "22", {}, [4, -77, -77], [4, -77, -77]]], [[2, 3, "four", 5.5, 5, "seven", "8", 9.0, 9.0, 2]], [[["3"], 1, "cusZwMFvpu", ["5", 6], 7, ["5", 6], ["3"]]], [[1, {"-97.4543891854423": false, "-49.66051645096719": true, "-63.32672563437423": false, "13.184526524844827": true, "90.21171391091707": true, "-21.76423177612179": true}, {}, {"": 8, "HGqT": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88}, {"six": -6}, [1, 2, 3], [5, 4, 5], {"six": -6}, [5, 4, 5], {}]], [[2, 3, "four", 8.103551238465293, "seven", "8", 9.0, 9.0, "four", 2]], [[0, 2, "3", 4, 5.6, [], 4.857451407639946, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[{"one": 1}, {"one": 1}, {"three": [3, "four"]}, {}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"one": 1}]], [[0, false, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, true, "", {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[1, 2, 3, 88, 5.5, 6, "seven", "8", 9.0, "seven"]], [[true, false, 1.3, 5, -7, 0, "a", "b", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"]]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 5.6, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {"cgvOtL": 94, "NK": 38, "": 93, "gRqSI": 4}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[1, "2", {}, {}, [1, 2, 3], 1]], [[1, [5.6, -91.64995486742458, 36.87380586293398, -39.73466216049497, -97.4543891854423, -34.863898336778206, 77.9888126831583, 1.3], 2, "3", 5.6, [], {}, true, true, [-63.32672563437423, "one", -63.32672563437423], [], true]], [[[2, "3"], 7, "cgvOtL", ["5", 6], 7, [2, "3"]]], [[[1, "2"], ["3", 4, 4], [5, "six"]]], [["9ieight", 15, [2, 3], 4, [5, 6], [7, "8", 7], [], [7, "8", 7], {}, "9"]], [[1, "2", 5, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3], {"three": 3}]], [[true, false, null, 1.3, 5, -7, 0, "a", "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], 5]], [[true, false, null, 0.7145384384689315, 5, -7, 0, "a", "b", [], {}, {"a": 1, "b": 2}, [3, 4], [6, "7"], []]], [[1, [5.6, -91.64995486742458, 36.87380586293398, -39.73466216049497, -97.4543891854423, -34.863898336778206, 77.9888126831583, 1.3], 2, "3", 5.6, [], {}, true, true, [-63.32672563437423, "one"], [], [], true]], [[2, 3, "four", 8.103551238465293, 5, "seven", "8", 9.0, 9.0, "four", 2, "four"]], [[1, "2", {}, {"six": 5}, [1, 2, 3], [4, 5], {"six": 5}, {}, "2"]], [["2", {}, [1, 2, 3], [4, 5], {}, "2", "2"]], [[-58, 0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, true, 4]], [[61, [1, "3"], "4", ["5", "piG", 6], 7]], [[true, false, null, 1.3, 4, -7, null, 0, "a", "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], 5]], [[{"61": "b", "9": "ei", "4": "Vf", "-58": "5"}, {"three": [3], "9": [3]}, {"61": "b", "9": "ei", "4": "Vf", "-58": "5"}, {"five": 5, "six": "6", "9": -7}, {"seven": "7", "eight": 8, "ieight": 3}]], [[false, null, 5, -6, 0, "a", "b", {}, "bbdef", {"b": 2}, [3, 4], [5, 6, "7"], {"5.6": 37.306238284726476, "35.50077440707028": 0.7145384384689315, "9.0": 77.33841772040307}, null]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"three": [3, "four"]}]], [[[1, "2"], ["3", 4], [-27, 5, "six"], [-27, 5, "six"], [], ["88", "seven", "8"], [15, 81, false]]], [[{"one": 1, "two": "2"}, {}, {"five": 5, "six": "7"}, {"anNy": false, "L": true, "GNjA": false, "six": true, "one": false, "bBHMqFdc": true}, {"one": 1, "two": "2"}, {"one": 1, "two": "2"}]], [["2", {}, [4, 5, 4], [1, 2, 3, 2], [4, 5, 4], {"six": 6}, {"six": 6}, {"six": 6}]], [[1, 2, 3, "four", 5.5, 6, "seven", "8", 9.0, 2, 5.5, 2]], [[true, false, null, 5, -7, 0, "a", "b", [], {}, {"a": 1}, [3, 4], [5, 6, "7"]]], [[1, [2, "3"], "ZFWxOITt", ["5", 6], 7]], [[["3"], 1, "cusZwMFvpu", ["5", "5"], ["5", "5"], 7, ["5", "5"]]], [[1, 29, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3], {"three": 3}]], [[1, "2", {"three": 3}, [4, 5]]], [["2", {}, [4, 5, 4], [1, 2, 3, 2], [1, 2, 3, 2], [4, 5, 4], {"six": 6}, {"six": 6}]], [[0, false, "3", 4, [79.39385924319336, 49.594049472095335, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, [79.39385924319336, 49.594049472095335, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[{"two": "2"}, {"three": [3, "four"]}, {}, {}, {"-48.36360896397747": 37.306238284726476, "9.0": 0.7145384384689315, "43.68781663560574": 75.06494853429405, "-27.569606066450092": 37.306238284726476}, {"five": 5, "six": "6"}, {}, {}, {}, {}]], [[0, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {}, 29, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true}, false]], [[2, 3, "four", 5.5, 8.103551238465293, 4, "seven", 1, "8", 9.0, "four"]], [[2, "four", 5.5, 5, "seven", "8", 9.0, 9.0, 2]], [[[1, "2"], ["3", 4, "3"], [5, "six"], []]], [[{}, {}, {"three": [3, "four"]}, {"75.06494853429405": true, "5.5": false, "9.0": false, "-8.01599287644595": true, "47.41964484826693": false, "77.33841772040307": true}, {}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}]], [[1, "2", {}, {"-49.66051645096719": -73, "13.184526524844827": -31, "-97.4543891854423": 15, "78.9818831196215": false, "-39.73466216049497": -35, "75.06494853429405": -33, "-13.880147275038041": 53, "97.93873630636239": -36}, [4, 5], {}, "2", {}]], [[0, "2", [1, 2, 3], [4, 5], [4, 5]]], [[1, 2, 2, "four", 5.5, 6, "seven", 9.0]], [[{"one": 1, "def": -36}, {"one": 1, "def": -36}, {"three": [3, "four"]}, {}, {"one": 1, "def": -36}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"one": 1, "def": -36}]], [[1, "2", 29, {"three": 3}, [1, 2, 3], [4, 5], "22", {"six": 39}, {"six": 39}]], [["9ieight", 15, [2, 3], 4, [5, 6], [7, "8", 7], [], [7, "8", 7], {}, {}]], [[0, 2, "3", 4, 5.6, [], true, false, {}, []]], [[{"Euq": -51.268307787490144, "gn": 43.68781663560574, "gRqSI": -13.324245400181894, "XgKdCCzUpb": -90.43508845946826, "kZqixRtNtY": -81.52388939145081, "SLGdJC": 5.6, "EnBsDBhyo": -69.12207297923977, "R": -34.863898336778206, "daOoxXE": 18.49102083179814}, {"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}, {"seven": "7"}]], [[0, false, 4, [79.39385924319336, 49.594049472095335, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, [79.39385924319336, 49.594049472095335, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[2, "3", 4, 5.6, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [[0, "2", {}, [1, 2, 3], [4, 5, 4], [4, 5, 4], [1, 2, 3], [4, 5, 4], 0]], [[true, true, true, false, true, true, false, true, false, true, true, true, false]], [["2", {}, [4, 5, 4], [1, 2, 3, 2], [4, 5, 4], {"six": 6}, {"six": 6}, {"six": 6}, {"six": 6}]], [[1, {"2": "def", "32": "e", "9": "ZFWxOITt", "-77": "KrbucqKYo", "3": "4", "-7": "cwhDbmHbxo", "88": "3", "-39": "b"}, [2], {"six": 1}, [2], {"six": 1}, {}]], [[{"one": 1, "two": "2", "2": 6}, {"three": [3, "four"]}, {}, {"six": "6"}, {"six": "6"}, {"seven": "7", "eight": 8}, {"one": 1, "two": "2", "2": 6}]], [[1, "2", {}, [1, 93, 3], [4, 5], {"six": 6}, [1, 93, 3]]], [[[1, "2"], [5, "six"], [-77, 73, 9, 29], [-84, 49, 4], [], []]], [[1, 2, "3", 4, 5.6, [], {}, true, false, [], []]], [[["3"], 1, "cusZwMFvpu", ["5", 6, "5"], ["5", 6, "5"], 7, ["5", 6, "5"], 7]], [["2", {}, [3, 4, 5, 4, 4], [3, 4, 5, 4, 4], [1, 2, 3, 2], [3, 4, 5, 4, 4], [3, 4, 5, 4, 4], {"six": 6}, {"six": 6}, {"six": 6}, {"six": 6}]], [[1, 2, "3", 4, 5.6, 38, [], {}, true, false, 5.6, 4]], [[{"one": 1}, {"one": 1}, {"three": [3, "four"]}, {}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"five": 6, "six": ""}, {"one": 1}, {"five": 6, "six": ""}]], [[{"one": 1, "two": "2"}, {"qbgoCBzBK": 99.70129825332367, "": 96.49878140613427, "d": 1.050449309718769, "gtM": 9.435039861338495}, {"three": [3, "four"]}, {}, {}, {"seven": "7", "eight": 81}, {}, {"seven": "7", "eight": 81}]], [[2, "3", 4, 5.6, [], {}, true, false, []]], [[["3"], 1, "cusZwMFvpu", ["5", "5"], 7, ["5", "5"], 7]], [[{"three": [3, "four"]}, {}, {"seven": "77", "eight": 8}, {"five": 5}, {"seven": "77", "eight": 8}, {"seven": "77", "eight": 8}]], [[{}, {}, {"three": [3, "four"]}, {"75.06494853429405": true, "5.5": true, "9.0": false, "47.41964484826693": false, "77.33841772040307": true}, {}, {}, {"five": 5, "six": "6"}, {"75.06494853429405": true, "5.5": true, "9.0": false, "47.41964484826693": false, "77.33841772040307": true}, {"five": 5, "six": "6"}]], [[{"one": 1, "two": "2"}, {"three": [2, "four"], "thrree": [2, "four"]}, {}, {"seven": "ffour7", "eight": 8}, {"five": 5, "six": "6"}, {"three": [2, "four"], "thrree": [2, "four"]}, {"seven": "ffour7", "eight": 8}, {}, {"three": [2, "four"], "thrree": [2, "four"]}]], [[1, "2", {}, [1, 93, 3], [4, 5], {"six": 6}, [1, 93, 3], {"six": 6}]], [[0, 2, "3", 4, 5.6, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, true, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574]]], [[{"-97.4543891854423": false, "-49.66051645096719": true, "-63.32672563437423": false, "13.184526524844827": true, "90.21171391091707": true, "-21.76423177612179": true}, {}, {"": 8, "HGqT": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88}, {"six": -6}, [1, 2, 3], [5, 4, 5, 4], [5, 4, 5, 4], [5, 4, 5, 4], {}]], [[1, "2", 5, {"three": 3}, [1, -57, 3], [4, 5], {"six": 6}, [1, -57, 3], {"three": 3}]], [[0, "four", "22", {}, [1, 2, 2, 3], [1, 2, 2, 3], [4, -77, -77], [4, -77, -77]]], [[["3"], 1, ["5", 6], 7, ["5", 6], ["3"]]], [[{"EWGKODI": true, "3": false, "fd": false, "cwhDbmHbxo": false, "pZrsjm": false, "bdef": true}, {"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}, {"five": 5, "six": "6"}]], [[1, 2, "3", 4, 5.6, [], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, 0, true]], [[true, false, true, true, false, true, true, true, true, false, true]], [[6.235719294932776, 0, 2, "3", 4, 5.6, [], {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}]], [[0, 2, 5, "3", 4, 7.9826049819970235, [], {}, true, true, 2]], [[1, "2", {}, {"six": 5}, [1, 2, 3], [4, 5], {"six": 5}, {}, "2", 1]], [[["3", "3"], ["3", "3"], 1, [6], 7, [6]]], [[{"one": 1, "two": "2"}, {"seven": "7"}, {}, {"five": "66", "six": "6"}, {"seven": "7"}, {"seven": "7"}, {"seven": "7"}, {"seven": "7"}]], [["2", {}, [4, 5, 4], [1, 2, 3, 2], [4, 5, 4], {"six": 6}, {"six": 6}, [1, 2, 3, 2]]], [[true, false, null, 1.3, 4, -7, null, 0, "a", "bdef", [], [], {}, {"a": -87, "b": 2}, {"a": -87, "b": 2}, [3, 4], [5, 6, "7"], 5, 5]], [[1, 2, 3, "four", "foufr", 5.5, 6, "seven", "8", 9.0, 2, 5.5, 2]], [[{"two": "2"}, {"seven": "2", "9": "ZFWxOITt", "seveen": "gn"}, {"three": [3, "four"]}, {"seven": "2", "9": "ZFWxOITt", "seveen": "gn"}, {}, {"five": 5, "six": "6"}, {"seven": "2", "9": "ZFWxOITt", "seveen": "gn"}]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8}, {}, {"five": "66", "six": "6"}, {"seven": "7", "eight": 8}, {"five": "66", "six": "6"}]], [[-57, 2, "3", 4, [79.39385924319336, 75.06494853429405, 35.50077440707028, 37.306238284726476, 77.9888126831583, -22.544858750883094, 43.68781663560574], 61, {}, true, {"9.0": "", "77.9888126831583": "zFA", "96.49878140613427": 15, "1.3": "b", "43.68781663560574": 4, "37.306238284726476": true, "5.6": null}, false]], [["2", {}, [1, 2, 3], [3, 5, 4], [3, 5, 4], [1, 2, 3], [3, 5, 4], 0]], [[{"two": "2"}, {"three": [3, "four"]}, {"five": 5, "six": "62", "NNK": "eight2"}, {"seven": "7"}, {}, {"five": 5, "six": "62", "NNK": "eight2"}, {"seven": "7"}]], [[{"one": 1, "two": "2"}, {"seven": "7", "eight": 8, "eighEWGKODIt": 7}, {}, {"six": "6"}]], [[{}, {"three": [3, "four"]}, {}, {}, {"-15.842422215662566": false, "9.435039861338495": true, "6.733087772135377": true, "-69.12207297923977": false, "-84.39276411726209": false, "-16.267889483115": false, "-99.6018588630581": true, "18.79725092012319": true, "16.32275391068592": true, "-10.758925193989825": false}, {"five": 5}, {}, {"five": 5}]], [[{"one": 1, "two": "2"}, {"three": [3, "four"]}, {}, {"five": 5, "six": "", "fi": "6666"}, {"five": 5, "six": "", "fi": "6666"}, {"five": 5, "six": "", "fi": "6666"}, {"one": 1, "two": "2"}, {"three": [3, "four"]}]], [[["NKsix", 5, "six"], [1, "2"], ["3", 4, 4], ["NKsix", 5, "six"]]], [[{"one": 1, "two": "2"}, {"three": [3], "9": [3]}, {"61": "b", "9": "eight", "4": "Vf", "-58": "5", "3": "VcusZwMFvpuf"}, {"five": -35, "sEWGKODIix": 4}, {"seven": "7", "eight": 8, "ieight": 3}, {"five": -35, "sEWGKODIix": 4}, {"five": -35, "sEWGKODIix": 4}, {"five": -35, "sEWGKODIix": 4}]], [[{"two": "2"}, {"three": [3, "four"]}, {"seven": "7"}, {}, {"five": 5, "six": "6"}, {"three": [3, "four"]}]], [[[1, "2"], ["3", 4], [5, "six"], [], ["seven", "8"], [-84, 49, 4], [], [1, "2"], ["seven", "8"]]], [[1, [1, 2, 0, 3], {}, {"": 8, "vbiLqOQgc": 3, "cusZwMFvpu": 1, "four": 29, "M": 88, "cwhDbmHbxo": -36}, [1, 2, 0, 3], [4, 5], {"six": 6}, {}]], [[1, [2, 3, 3], "2", {}, {}, [2, 3, 3], [4, 5], 1]], [[61, [1, "3"], "4", ["NK", 6], 7, ["NK", 6]]], [[true, false, null, 1.3, -7, null, 0, "a", "bdef", [], [], {}, {"a": 1, "b": 2}, [3, 4], [5, 6, "7"], 5]], [[1, "2", 94, {"three": 3}, [1, 2, 3], [4, 5], {"six": 6}, [1, 2, 3], {"three": 3}]], [[{"three": [3, "four"]}, {"VvUwelV": true, "Eb": true, "five": false, "R": false, "Quo": false, "SIPe": true, "jCDAG": false, "7": false, "ffour7": false}, {"five": 6, "six": "6"}, {"seven": "7", "eight": 8}]], [[1, "2", -84, {}, [1, 2, 3], [4, 5], "KrbucqKYo2", {}, "2"]], [[{}, {}, {"three": [3, "four"]}, {"RXB": "three"}, {"75.06494853429405": true, "5.5": false, "9.0": false, "-8.01599287644595": true, "47.41964484826693": false, "77.33841772040307": true, "41.03430562738179": false}, {}, {}]]], "completion": "\nfrom typing import List, Any\n\n\ndef filter_integers(values: List[Any]) -> List[int]:\n return [x for x in values if isinstance(x, int)]\n", "raw_completion": "```python\nfrom typing import List, Any\n\n\ndef filter_integers(values: List[Any]) -> List[int]:\n return [x for x in values if isinstance(x, int)]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List, Any\n\n\ndef filter_integers(values: List[Any]) -> List[int]:\n \"\"\" Filter given list of any python values only for integers\n >>> filter_integers(['a', 3.14, 5])\n [5]\n >>> filter_integers([1, 2, 3, 'abc', {}, []])\n [1, 2, 3]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/23", "prompt": "\n\ndef strlen(string: str) -> int:\n \"\"\" Return length of given string\n >>> strlen('')\n 0\n >>> strlen('abc')\n 3\n \"\"\"\n", "entry_point": "strlen", "canonical_solution": "\n return len(string)\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == 0\n assert candidate('x') == 1\n assert candidate('asdasnakj') == 9\n", "contract": "\n assert isinstance(string, str), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["x"], ["asdasnakj"]], "atol": 0, "plus_input": [["Hello, World!"], ["12345"], [" "], ["This is a long string that has many characters in it"], ["abcdefghijklmnopqrstuvwxyz"], ["Testing testing 123"], ["The quick brown fox jumps over the lazy dog"], ["one\ntwo\nthree\nfour\nfive"], ["1234567890"], ["This string has a \n newline character"], ["one\ntwo\nthree\nf\nfoive"], ["The quick brown fox jumps overq the lazy dog"], ["abcdefgjklmnopqrstuvwxyz"], ["three\nfour\nfive"], [" This striThis is a long string that has many characters in itng has a \n newline character"], [""], ["The quick brown fox jumps over the lazy This striThis is a long string that has many characters in itng has a \n newline character dog"], ["1234 This striThis is a long string that has many characters in itng has a \n newline character5"], ["The quick brown fox jumps over the lazy This striThis is aaracter dog"], ["one\ntwot\nthree\nfour\nfive"], ["11234567890"], ["one\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfive"], ["The quick brown f ox jumps over the lazy dog"], ["122345"], ["Testing testingone\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfive 123"], ["one\ntwot\nthrThis is a long string thtat has many characters in itee\nfour\nfive"], ["123345"], ["The quick brown fox jumps over the lazy Thisthree\nfour\nfiveracter dog"], ["GNDKQyadEb"], ["Hello, Woorld!"], ["of\nfoive"], ["The quick brown fox jumps overq theHello, World! lazy dog"], ["M"], ["NEvG"], ["Hello, Woorlod!"], ["thrieeThe quick brown fox jumps overq the lazy dog\nfour\nfive"], ["one\ntwot\nthree\nfour\nfiv"], ["abcdefghijklmnopq1234 This striThis is a long string that has many characters in itng has a \n newline character5rstuvwxyz"], ["Hello, Woo12345rld!"], ["one\ntwot This striThis is a long streing that has many characters in itng has a \n newline character\nthree\nfour\nfive"], [" This striThis is a long string that has many characters in itng has a \n neawline character"], ["1223545"], ["one\ntwota\nthrThis is a long string that has many characters in itee\nfour\nfive"], ["The quick brzown fox jumps over the leazy Thisis is aaracter dog"], ["1234 This sitriThis is a long string that has many characters in itng has a \n newline character5"], ["TestiTng testing 123"], ["GNDThis string has a \n newline characterdEb"], ["The quick brzown fox sjumps over the leazy Thisis is aaracter dog"], ["G1234 This sitriThis is a long string that has many characters in itng has a \n newline character5NDKQyadEb"], ["The quick brown fox jumps over theThe quick brown fox jumps overq the lazy dog lazy Thisthree\nfour\nfiveracter dog"], ["G1234 This sitriThis is a long string that has many characters in itng has a \n newline character5NDKThe quick brown fox jumps over theThe quick brown fox jumps overq the lazy dog lazy Thisthree\nfour\nfiveracter dogQyadEb"], ["oef\nffoive"], ["one\ntwot\nthrThis is a long string that has many characters in itee\nfoour\nfive"], ["of\nfoivfe"], ["Testing te stingone\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfive 123"], ["Hello, WoG1234 This sitriThis is a long string that has many characters in itng has a \n newline character5NDKThe quick brown fox jumps over theThe quick brown fox jumps overq the lazy dog lazby Thisthree\nfour\nfiveracter dogQyadEborlod!"], ["Hello,The quick brown fox jumps over the lazy Thisthree\nfour\nfiveracter dog Woo12345rld!"], ["Hello, WoG1234 This sitriThis is a long string that has many characters in itng has a \n newline character5NDKThe quick brown fox jumps over theThe quick by Thisthree\nfour\nfiveracter dogQyadEborlod!"], ["off\nfoiivfe"], ["912345667890"], ["abcdefgjklmnopqrstuvwxyzive"], ["The quick brown fox jumps over the lazy This striThis is aaracter dogM"], ["Hello, WoG1234 This sitriThis is a long string that has many characters in itng h as a \n newline character5NDKThe quick brown fox jumps over theThe quick brown fox jumps overq the lazy dog lazby Thisthree\nfour\nfiveracter dogQyadEborlod!"], ["The quick brown f ox jumps over the lazyg"], ["one\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfive"], ["one\n\ntwot\nthrThis is a long string that has many characters in itee\nfoour\nfive"], ["thrieeThe quick brown f ox jumps over the lazy dogThe quick brown fox jumps overq the lazy dog\nfour\nfive"], ["G1The quick brown f ox jumps over the lazy dog234 has a \n newline character5NDKQyadEb"], ["TheHello,The quick brown fox jumps over the lazy Thisthree\nfour\nfiveracter dog Woo12345rld! quick broThis string Thas a \n newline characterwn fox jumps over the lazy Thisthree\nfour\nfiveracter dog"], ["off\nfoivife"], ["three\nefour\noff\nfoiivfe"], ["Test1iTng testing 123"], ["one\ntwota\nthrThis is a long string that has many chone\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfivearacters in itee\nfour\nfive"], ["TheHello,The quick brown fox jumps over the lazy Thisthree\nfour\nfiveracter dog Woo12345rld! quick broThis string Thas a \n newline characterwn fox jumps over theone\ntwota\nthrThis is a long string that has many characters in itee\nfour\nfive dog"], ["thrieeThe quick brown f ox jumps over the lazy dogThe quick brown fox jumps overq the lazy dog\nfour\nfive "], ["oene"], ["off\nabcdefgjklmnopqrstuvwxyzfoivife"], ["The quick brown f ox jumps over the lazy"], ["abcdefghijklTest1iTng testing 123mnopq1234 This striThis is a long string that has many characters in itnghas a \n newline character5rstuvwxyz"], ["abcdeflghijklmnopqrstuvwxyz"], ["1o, Woorld!890"], ["12333345"], ["1122345"], ["one\ntwota\nthrThis is a long string that has many characters ien itee\nfour\nfive"], ["Hello, W123345orld!"], ["one\ntwo\nthrfoive"], ["one\ntwot\nthrThis is a long string that has many characterns in itee\nfour\nfive"], ["one\ntwotaa\nthrThis is a long string that has many characters ien itee\n1234 This sitriThis is a long string that has many characters in itng has a \n newline character5four\nfive"], ["The quick brzown fox sjumps over the leazy Thisis is aaThe quick brown fox jumps overq theHello, World! lazy dogracter dog"], ["MThe quick brown fox jumps over the lazy This striThis is aaracter dogM"], ["The quick brzown fox jumps over the leazy Thisis is aaracter Hello, Woorld!dog"], ["1234 This sitriThis is a long string that has many character12345s in itng has a \n newline character5"], ["1234 This sitriThis is a long string that has many characters in itng has a \n neThe quick brown f ox jumps over the lazygwline character5"], ["912345667890The quick brown fox jumps over the lazy This striThis is aaracter dogM"], ["Hellone\ntwot\nthree\nfour\nfivo, WoG1234 This sitriThis is a long string that has many characters in itng has a \n newline character5NDKThe quirck brown fox jumps over theThe quick by Thisthree\nfour\nfiveracter dogQyadEborlod!"], ["The quick brown fox11234567890 jumps over the lazy This striThis is aaracter dog"], ["one\ntwota\nthrThis is a long string that has many characters iThe quick bis striThis is aaracter dogMen itee\nfour\nfive"], ["The quick brown fox jumps over theThe quick brown fox jxumps overq the lazy dog lazy Thisthree\nfour\nfiveracter dog"], ["one\ntwot\nthrThis is a long string that has many characters in itee\nfour\nfiveabcdefghijklmnopqrstuvwxyz"], ["Testing te stingone\ntwot\nthrThis is a long strinThe quick brown fox jumps over theThe quick brown fox jumps overq the lazy dog lazy Thisthree\nfour\nfiveracter dogg that has many characters in itee\nfour\nfive 123"], [" "], ["\t"], ["\n"], ["\r"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["This is a sample string to test the function"], ["The Quick Brown Fox Jumps Over The Lazy Dog"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1t"], [" "], [" \n\n "], ["Quick"], [" "], [" "], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], [" "], ["w1th"], ["Th!"], [" \n\n 1s "], ["Jumps"], ["Fox"], ["1t"], [" This is a sample string to test the function "], ["Th!s 1s 4 str1ng wtest5ymb0ls !n 1t"], [" This is a sampleto string to test the function "], ["Qukick"], [" \t "], [" "], [" \n\n string"], ["Tish!"], ["Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n"], ["ps"], ["a"], ["Dog"], ["Tish! "], ["4"], ["is"], ["Jummtops"], ["!n"], ["Tish! 4"], ["yLazy"], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["LqNCZA"], ["Over"], ["hyNcJH"], ["QFoxukick"], ["Fo This is a sampleto string to test the function n x"], ["!nn"], ["\t\t"], ["whyNcJH1th"], ["TheTe"], [" This is a sampl eto string to test the func tion "], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 "], ["QFoQxukick"], ["tn"], ["Th!s 1s 4 str1ng wtest5ymb0ls !nsampleto 1t\n"], ["iw1th"], ["x "], ["D\u00e0\u00e8\u00ec\u00f2\u00f94\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7gog"], [" This is a sample \n\n 1s string to test the functoion "], ["isJumps"], ["function"], ["func"], ["D\u00eb\u00e0\u00e8\u00ec\u00f2\u00f94\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00ff\u00e7gog"], ["sampl"], ["funcc"], ["Lazy"], ["Th!s 1s 4 str1ng wtest5ymb40ls !n 1t\n"], ["n"], ["Doo"], ["aOver"], ["Th!s 1s 4 str1ng wtest5ymb0lse !n 1t\n"], ["D\u00eb\u00e0\u00e8\u00ec\u00f2\u00f9\u00f5\u00e4\u00eb\u00ef\u00ff\u00e7gog"], ["str1ng"], [" This is a sampl eto string to test the func Theon "], ["Tish! 4!n"], ["Th!s40ls !n 1t\n"], ["cQukick"], [" \n\n "], ["QuaOverick"], ["Te"], ["QFoxuk"], ["Jum5ymb0lsmtops"], ["Th!s40ls"], [" \n\n 1s "], ["funnc"], ["eto"], [" This is a sample string to test the function i "], ["sample"], [" functoion "], [" \u00e3 \u00f4 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 "], ["Tetn"], ["mThfGqorZJum5ymb0lsmtops"], [" \n\nwtest5ymb40ls "], [" This is a sample strinisg to test the function "], [" \nhyNcJH\n string"], ["str1ngsampl"], [" "], [" \n\nwwtest5ymb40ls "], ["iwTish!1th"], ["test"], ["TTetn"], [" "], [" \n\nwwtes ls "], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyicky"], ["ver"], [" 4\n\n 1s "], [" This is a sample TTetnstrinisg to test the function "], ["This is a sample string This is a sampl eto string to test the func Theon to test the function"], ["tn \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["Tish! 4"], ["strin"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00e8\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], [" \nhy This is a sample strinisg to test the fuunction NcJH\n string"], ["funthec"], [" Tish! 4!n \n\n 1s "], ["funtThis is a sample string This is a sampl eto string to test the func Theon to test the functionhec"], [" "], ["Th!s1s 1s 4 str1ng w1th 5ymb0ls !n 1t"], [" \n\nBrown"], [" \n\n wwtest5ymb40ls "], ["iis"], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00f6\u00fc\u00ff\u00e7 "], ["astr1ngsampl"], ["QQFoxuk"], ["functoion"], [" \nTetn\nBrown"], ["Th!s40ls !n 1t \n\n wwtest5ymb40ls \n"], ["nFo"], ["The QuiisJumpsck Brown Fox Jg"], ["Th!s 1s 4 stTheTer1ng wtest5ymb0lse !n 1t\n"], ["Jum5ymb0lsmfunction"], ["iiis"], [" funthec "], ["hyNcJ"], ["TTh!s40lsh!s 1s 4 str1ng wtest5ymb0lse !n 1t\n"], [" This is a sample string to tea "], ["fufncc"], ["p1ss"], ["wiw1th"], ["44"], ["eeTe"], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["Lazyy"], ["This is a sample string This is a sampl eto string to test the func Theon to test the function"], ["RLkion"], ["stricQukickn"], ["funtht"], ["TheyLazyTe"], [" \nhy This is a sample strinisg to test the fuunction NcJH\n string4"], ["i s"], ["etoo"], ["Th!s 1s 4 str1ng wtest5ymb40ls s!n 1t\n"], ["FoFxuk"], ["The Quick Brown Fox Jumpe Lazy Dog"], ["4!n"], ["QuiisJumpsck"], ["This is a sample string This is a sampl eto string to LqNCZAtest the func Theon to test the function"], [" "], ["!"], ["TT"], ["mThftGqorZJum5ymb0lsmtops"], ["wwtes"], ["Tis "], ["wtest5ymb40ls"], [" This is a sample strintg to test the function "], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 \n\nwtest5ymb40ls "], ["QFoxukcick"], ["Tis"], ["fux ncc"], ["fux"], ["YJvcL"], ["Qck"], ["TTh!s40lsh!s 1s 4 str1nb0lse !n 1t\n"], [" Th!s \n\n 1s "], [" This is a sampl tothe func tion "], ["nn"], ["sTh!s4strinisg05ymb0lsls"], [" Th!s 1s 4 str1ng wtest5ymb0ls !nsampleto 1t\n"], ["whyNcJH1thfunnc"], ["why1NcJH1th"], ["iisTe"], ["Th!s40ls !n 1This is a sample string This is a sampl eto string to LqNCZAtest the func Theon to test the functi \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7nt\n"], ["stcricQukDogickn"], ["why1N This is a sampleto string to test the function cJH1th"], ["ssps"], ["Th This is a sample TTetnstrinisg to test the function !s40ls !n 1t\n"], [" This irs a sample string to tea "], ["fuwhy1N This is a sampleto string to test the function cJH1th"], [" \n\nwwtes ls Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n "], ["hy"], ["strinisg"], [" fux"], ["ii\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00e8\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], [" \nhy This is a sample strinisg to test the fuunction NcJH\n strin"], ["why1N"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyicky"], [" \nhy This is a sample strinisg to test othe fuunction NcJH\n string4"], ["!s40ls"], ["This is a sample string This is a sampl eto string to test thLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickythe function"], ["Theon"], ["t1t"], [" cJH1th1s 4 funthec ls !nsampleto 1t\n"], ["Th!s 1s 4 stsr1ng wtest5ymb0ls !n 1t\n"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], [" This is a sample string to test the function 1s "], ["whyLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothe \t H1th"], ["wwwtes"], ["\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickythe"], [" \n\nBro \n\n 1s n"], [" This is a sample TTetnstrinisg tiiiso test the function "], ["\n\n"], ["Tishstrintg4"], ["why1N This is a sampleto string to test e function cJH1th"], ["sThe Quick Brown Fox Jumps Over The Lazy DogtcricQukDogickn"], [" This is a sample sttotherintg to test the function "], ["to"], ["tt1t"], ["RL \n\n 1s kion"], ["LqNCZAtest"], ["ps1ss"], ["nF"], ["wwhyNcJH1thfunnchy1N"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00f6\u00fc\u00ff\u00e7"], ["sJummtops"], [" \n\nwwtens ls Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n "], [" \u00e3 \t "], ["fuunction"], ["\n\nfunc"], ["wtest5ymb0lse"], ["QQFoTTxuk"], ["sQuiisJsumpsck"], ["Brown"], ["FMc"], ["p1sBrown"], ["TlTh!s40lsh!s"], ["This is a sample string This is a sampl eto string to test thLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n Bro1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickythe function"], ["i s "], [" This is a sample sttotherintg to test the funcstricQukickntion "], [" LqNCZAtest"], ["hyisJumpsJ"], [" \nhyN cJH\n string"], ["OvhyNcJer"], ["othe"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9QFoxukcky"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ediisTe\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], ["fuuni sction"], ["fuon"], ["stgrsr1ng"], ["Ove This is a sample \n\n 1s string to test the functoion r"], [" Tsh!s \n\n 1s "], ["Jum5ymbops"], ["The"], ["whyLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothe \t H1th"], ["tiiiiso"], ["pFomThfGqorZJum5ymb0lsmtopss"], ["LqqNCZA"], ["ncc"], ["Tishstrintgi s4"], ["!ncnncc"], ["string"], [" \n \n\nBrownrown"], ["4n"], ["B functoion rown"], ["vemThfGqorZJum5ymb0lsmtopsr"], ["Th!s40ls !n 1This is a sample string This is a samplt1t eto string to LqNCZAtest the func Theon to test the functi \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7nt\n"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["Th This is a sample TTetnstrinisg Jumpeto test the function !s40ls !n 1t\n"], ["Ove"], ["FoF1Thisxuk"], [" \n\nwwtes ls Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n "], ["B"], ["\n\nfnunc"], ["sns"], ["wiw1thstricQukickn"], [" ring to tea "], ["DogtcricQukDogickn"], ["D\u00e0\u00e8\u00ec\u00f2\u00f94\u00e1\u00e9\u00ed\u00f3\u00fa\u00fdp1ss\u00e2\u00ea\u00ee\u00f4cJH1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7gog"], [" Th!s \n\n 1s "], [" Th!s 1s 4 str1ng wtest5nymb0ls !nsampleto 1t\n"], ["Do"], [" \n\n striing"], ["Th!s 1s 4 stsr1ng wtest5ymb0TTh!s40lsh!sls !n 1t\n"], ["striing"], ["wteb40ls"], ["fJumpeuon"], ["hyNycJ"], ["mThfGeeTeqorZJum5ymb0lsmtops"], ["cJH1th"], ["TTh!s40lsh!s"], ["nfuntThis is a sample string This is a sampl eto string to test the func Theon to test the functionheccc"], ["fnunnc"], [" \u00e3 "], ["whyLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], ["\u00f4"], ["LaazLyy"], ["psx "], ["stgrsr1ngLqNCZAtest"], ["This is a sample string This is a sampl eto string to test thLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1h\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n Bro1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxwtest5ymb0lseukyickythe function"], ["This is a sample string This is a sampl eto string to LqNCZAtmThfGeeTeqorZJum5ymb0lsmtopsest the func Theon to test the function"], ["Foxx"], ["\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyicky"], ["The Quick Br owsttotherintgn Fox Jumpe Lazy og"], ["og"], ["str1ngsampaOverl"], ["Fo stgrsr1ng This is aTh!s 1s 4 str1ng wtest5ymb0lse !n 1t\n sampleto string to test the function n x"], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00fc\u00ff\u00e7"], ["This"], [" This is a sampl eto string to test thes func tion "], ["funthstr1ng"], ["tet"], ["whyNcJH1c"], [" This is a sample strinisg to test the functiostgrsr1ngLqNCZAtestn "], [" This is a sample \n\n 1s string to te "], ["x cJH1th1s 4 funthec ls !nsampleto 1t\n "], ["hTheTe"], ["funaTh!s"], [" \nhy This is a sample strinisg to test the fuunction NcJH\n string4cJH1Jth"], ["BB"], ["why1N p This is a sampleto string to test the function cJH1th"], ["mThftGqorZJum5ymb0lsmtstricQukicknops"], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 \n\nwtest5ymb40ls "], [" \n\nRL 1s "], ["Th!s 1s RL4 str1ng wtest5ymb0l !n 1t\n"], ["str1nb0lse"], [" \nhy This is a sample strinisg to test the fuunction NcJH\n string4cJH1Jth"], ["nfuntThis"], ["samplt1t"], ["wiw1s1th"], [" Th!s 1s 4 st1r1ng wtest5nymb0ls !nsampleto 1t\n"], ["nfuntThis "], ["Tish! TTh!s40lsh!s 1s 4 str1ng wtest5ymb0lse !n 1t\n "], ["Tish! This is a sample string This is a sampl unction4"], ["p"], ["Th!s 1s str1ng wtest5ymb0ls !n 1t\n"], ["FMcc"], ["BBo"], ["f\n\nfnunc"], ["\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoyQxukyickythe"], ["functionheccc"], ["Th!s40ls !n 1This is a sample string This is a samplt1t etto string to LqNCZAtest the func Theon to test the functi \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7nt\n"], ["Bro"], ["JTh!s 1s 4 str1ng wtest5ymb0ls !nsampleto 1t\num5ymb0lsmfunction"], ["sThe Quick Brown Fox Jumps Over The Lazy DogttcricQukDogickn"], ["sTh!s4strinisg05ymb0lslTs"], ["puobAuk"], ["Juom5ymbops"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9QFoxxukcky"], ["whyNcJH1funnc"], ["Th"], ["Jg"], ["thLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], ["fuwhy1N"], ["fuuni"], ["Bro1s"], ["\r\r"], ["why1N p This is a samplefunction cJH1th"], ["QQFoTfuuniTxuk"], [" o test the function1s "], ["QFoxucick"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f1\u00f6\u00fc\u00ff\u00e7"], ["fnuncc"], ["Th!s 1s 4 sTtTheTer1ng wtest5ymb0lse !n 1t\nJum5ymb0lsmfunction"], ["Ths !n\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoyQxukyickythe 1t\n"], ["p1s4Bnrown"], [" \n\n "], ["k"], ["etfuntThisoo"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00fc\u00ff\u00e7"], ["La\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickThs !n\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoyQxukyickythe 1t\ny"], ["hy\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00fc\u00ff\u00e7"], ["Tish!whyNcJH1th 4"], ["Th This iTh!s 1s RL4 str1ng wtest5ymb0l !n 1t\ns a sample TTetnstrinisg Jumpet \n\nwtest5ymb40ls t\n"], ["Tish!whyNcJH1whyLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothe \t H1th 4"], ["wDohycJHt"], ["TtTetn"], ["isJuis"], ["Th!s1s"], [" s is a sample \n\n 1s string to te "], ["wiiw1th"], ["OvOe"], ["sJTh!s 1s 4 str1ng wtest5ymb0ls !nsampleto 1t\num5ymb0lsmfunctionJummtop This is a sample sttotherintg to test the function QuaOverick s"], ["La\u00e0a\u00e8\u00ec\u00f2\u00f9!nn\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], [" Tish! sThe Quick Brown Fox Jumps Over The Lazy DogttcricQukDogickn 4!n \n\n 1s "], ["!nirs"], ["sJTh!s 1s 4 str1ng wtest5ymb0ls !nsampleto 1t\num5ymb0lsmfunctionJummtop This is a sample sttotherintg to test \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QuaOverick s"], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTstgrsr1ng\u00ef\u00f6\u00fc\u00ff\u00e7"], ["Tsh!s"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1is\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00fc\u00ff\u00e7"], ["i s "], [" Tish! sThe Quick Brown Fox Jumps Over The Lazy DogttcricQukickn 4!n \n\n 1s "], ["RL4"], ["st1r1ng"], ["sTtTheTer1stgrsr1ngLqNCZAtestng"], ["zPyWTI"], ["aTh!s"], ["Fow1thF1Thisxuk"], ["saTh!s40lsmplt1t"], [" nFo "], ["t1"], [" This is a sample sttotherintg t\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00f6\u00fc\u00ff\u00e7o test the funcstricQukickntion "], [" \n\nwwtes t ls Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n "], ["string4cJH1Jth"], [" This is a sampl tothe func tion "], ["BBro"], ["nnnp1ss"], ["BBBo"], ["The QuiisJumpsck Brown Fox JgLa\u00e0a\u00e8\u00ec\u00f2\u00f9!nn\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea"], ["wtest5ymb0lscQukiwhyLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothe \t H1thkn"], ["TBrownrown"], ["vemThfGqorZJum5ymb0lsmtstgrsr1ngLqNCZAtestpsr"], [" \nhy This is a sample strinisg to ttest the fuunction NcJH\n string"], ["wtest5nymb0ls"], ["whyNcJH1thFox"], ["1This"], ["x cJH1th1s 4 funtthec ls !nsampleto 1t\n "], ["eo"], [" Th!s 1s 4 st1 \n\nwwtest5ymb40ls r1ng wtest5nymb0ls !nsampleto 1t\n"], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00ec\u00fd\u00e2\u00ea\u00ee\u00f4stgrsr1ng\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 "], ["wtest5ymb0T\u00ee\u00f4\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothesh!sls"], ["This is a sample string This is a sampl eto string to test thLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1h\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n Bro1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxwtest5ymb0lseukyickythe ction"], ["striing This is a sampl tothe func tion "], ["QQFoTkTxu"], ["thes"], ["Th!s40ls !n 1This is a sample string This D\u00e0\u00e8\u00ec\u00f2\u00f94\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7gogis a samplt1t etto string to LqNCZAtest the func Theon to test the functi \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00eeQck\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7nt\n"], [" \u00e3 \u00e0\u00e8\u00f2\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00fc\u00ff\u00e7"], ["rBrown"], ["hy functoio"], ["nnshthes"], ["wtest5ymb0l"], [" \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!!1th1\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 \n\nwtest5ymb40ls "], ["This is a sample string Theonto test the function"], [" \u00e3 \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1DogttcricQukDogickn\u00e9\u00ed\u00f3\u00fa\u00ec\u00fd\u00e2\u00ea\u00ee\u00f4stwhy1Ngrsr1ng\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 "], ["sQuiisJsmpsck"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4iwTish!!1th\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7tnwtest5ymb0lscQukiwhyLLa\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00f9\u00fd\u00e2\u00ea \n\n 1s \u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxukyickytothe \t H1thkn\nBrown"], [" Jum5ymbops \u00e3 i\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 "], ["o"], ["why1N p This is a sampleto string to test the function cJH1t1sh"], ["ywwtensLazy This is a samQuaOverickple TTetnstrinisg to test the function "], ["OZn"], ["cJH1t1s"], ["stgrsr1ngLqNtCZAtest"], [" This is a sample TTetnstrinisg to test the function "], ["yyy"], ["Th!s 1s 4 str1n0g wtest5ymb0lse !n 1t\n"], ["kRLkion"], ["Juom5This is a sample string This is a sampl eto string to test the func Theon to test the functionymbops"], [" \n\nRL 1Ls "], ["Th!s 1s 4 sTtTheTer1ng wtest5ymb0lse !n 1t\nJum5ymb0lsmfunct ion"], [" funthec tothet "], [" Tish! sThe Quick Brown Fox Jumps Over The Lazy DogttTcricQukickn 4!n \n\n 1s "], [" This is a sample strinitsg to test the functiostgrsr1ngLqNCZAtestn "], ["hyNJcJ"], [" This is a sample TTetnstrinisg tiiiso test the function n "], ["iwTish!1Fo"], ["Tish! This is a sample string This is a sampl unction!n4"], ["whyNcJH11th\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7QFoQxwtest5ymb0lseukyickythefunnc"], ["strinifunctitsg"], ["44n"], [" cJH1th1s 4 funthec lwiiw1ths !nsampleto 1t\n"], [" This is a "], [" \n\nwwtes ls Th!s 1s 4 str1ng wtest5ymb0ls !n 1t\n "], ["st1r1n"], ["fuwiw1thstricQukicknnc"], ["cJH1t1sh"], ["mThfGeeTebqorZJum5ymb0lsmtops"], ["wtestm5nTheymb0ls"], ["iTh!s"], ["This is a sample string Thits is a sampl eto string to test the func Theon to test the function"], ["tion"], ["funtThis is a sample string This is a sampl eto string to test the func Theon \u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7 to test the functionhec"], ["Th!st\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00f6\u00fc\u00ff\u00e7o40ls !n 1t\n"], ["D\u00eb\u00e0\u00e8\u00ec\u00f2\u00f9hyNJcJ\u00f5\u00e4\u00eb\u00ef\u00ff\u00e7g"], [" zPyWTI functoion "], ["aOwtest5nymb0lsver"], ["QQFoTfuuniTxusample"], ["rstn1r1n"], [" \u00e0\u00e8\u00ec\u00f2h "], [" "], ["123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789"], ["MNhqmCdV"], [" The "], [" 1t The "], ["MNhqmCV"], ["MNhqThe Quick Brown Fox Jumps Over The BrownLazy DogmCV"], ["1s"], ["sampLazyle"], ["ttest"], ["Lazy "], ["ThTis"], ["MN!nhqmCCdV"], ["MNhqThe"], [" \r \n "], ["MNhqThe CQuick Brown Fox Jumps Over The BrownLazy DogmCV"], [" \r \n "], ["BrownLazy"], ["samplse"], ["Lazy z "], [" \r \n\r "], ["TTBrownis"], ["\u00e0\u00e8\u00ec\u00f2\u00f5\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["MNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCV"], ["ThTi"], ["MNhqThe CQuick Brown Fox oJumps Over The BrownLazy DogmCV"], ["MNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCV\n"], ["MNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCV"], ["BBrownLazyLazy "], ["BrownsampBrownleLazy"], ["MNMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCV\nhqmCV"], ["This is a sample strOvering to test the function"], ["MNhqThe CQuicJumpsk Brown Fox Jumps Over The BrownLazy DogmCV"], ["MNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test the function The BrownLazy DogmCV"], [" \n\n z"], [" \r \n "], ["CQuick"], ["This is a sample strintog to test the function"], ["TTBrownis "], [" 1t 1 The "], ["testt"], [" \n\n "], ["aa"], [" This is a sample string to test the function\n\n z"], ["BrownLazys"], ["ThT 1t 1 The i"], ["BBrownLazyLazy"], ["GThT 1t 1 The ic"], ["Th!s 1s 4 str1str1ngng w1th 5ymb0ls !n 1t"], ["RGTk"], ["MNhqTMNMNhqThehe"], ["CQuicJumpsk\r"], ["DogmVCVBBrownLazyLazy "], ["MNhqThe Quick Brown FoxJumps Over The BrownLazy DogmCV"], ["\u00e0\u00e8\u00ec\u00f2\u00f5\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7\u00e7"], ["BBrownLaazyLazy "], ["This is a sample strintog ton test the function"], ["BrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCVnsampBrownleLazy"], ["Lazy zThTi "], ["MNhqThe CQuick Brown Fox oJutesttmps Over The BrownLazy DogmCV"], ["w1This is a sample sstrintog ton test the functiont"], [" \n\n function "], [" \r\n \n "], ["MNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thCV"], ["Th!s 1s 4 sstr1str1ngng w1th 5ymb0ls !n 1t"], ["OverThisBBrownLaazyLazy "], [" \r \n "], ["BrowMNhqThe CQuick Brown Fstrintogwox Jumpes Over The BrownLazey DogmCVnsampBrownleLazy"], ["CQuicJstrOveringumpsk"], ["thCV"], ["Jumpes"], [" 1t The "], [" MNhqm CdV "], ["MNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thCV"], ["ThhT 1t 1 The i"], ["ThTTi"], ["Foxa"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1t Over The TTBrownisgmCV"], [" str1ng 1t The This is a sampleOvering to test the function"], ["Th!s 1s 4 str1str1ngng w1th 5ymb0ls !n 1tBrownLazys"], ["BrownL \r \n azys"], ["\u00e0\u00e8\u00ec\u00f2\u00f5\n\u00e7"], ["BBrownLaazyLazy"], ["MNhqmCdCQuicJumpsk\r"], [" The "], ["BBrownLMNhqThe CQuick BrMNhqThe Quick Brown Fox Jumps Over The BrownLazy DogmCVown Fox Jumpes Over The BrownLazy DogmCVaazyLazy "], ["BrLownL \r \n azys"], ["OverThis"], [" str1ng 1t The This is a samp leOvering to test the function"], [" This is a sample string to test th e function\n\n z"], ["This nction"], ["zThTi "], ["BBrownLMNhqThehTTi"], ["Th!s 1s 4 str1str1ngng w1th 5ymb0ls !n 1tBrow"], ["MNhqThe CQuick Brown hFox Jumps Over The BrownLazy DogmCV"], ["oJutesttmps"], ["functont"], ["MNMNhqThe CQuick Brown Fox Jumpes OvewnLazy DogmCV\nhqmCV"], ["Fstrintogwox"], ["MNhqThe CQuicJumpsk BrowMNhqmn Fox Jumps OverThis to test t"], ["ic"], ["MNhqThe CQuick Brown Fox oJutesttmps Oqver The BrownLazy DogmCV"], ["This sample string to The test the function"], ["DogmCVown GThT "], ["Th!s 1s 4 str1str1ngnsg w1th 5ymb0ls !n 1t"], ["Do The g"], ["\t\t\t"], [" \n\n func!ntion "], ["te 1t The stt"], ["ThT testt1t 1 The i"], ["bUmvrK"], ["Tihis sample string to The test the function"], ["Th!s 1s 4 str1ng w1thTTBrownis 5ymb0ls !n 1t"], ["ThT"], ["r1ng"], ["leOvering"], ["te 1t sThe s tt"], ["ttV"], [" This is a sample stringunction\n\n z"], ["The The Lazy Dog"], ["MNhqThe CQuick Brown hFox Jumps Over The BrownLazy DoMNhqmCdCQuicJumpsk\rgmCV"], ["TThTi"], ["MNhq1TMNMNhqThehe"], [" T he "], ["MNhqmC The "], ["aaa"], ["BrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCVnsampBrownleLazyhTiTh!s 1s 4 str1ng w1th 5ymb0ls !n 1ts"], ["TTBrownisgmCV"], ["MNhqThe CQuicJumpsk Brown Foxstr1str1ngng Jumps OverThis is a sample string to test thCV"], ["leOvMNhqThe CQuick Brown Fox oJumps Over The BrownLazy DogmCVering"], ["ThT OverThisBBrownLaazyLazy t1t 1 The i"], ["MNhqThe CQuDogmCVnsampBrownleLazyick Brown Fox oJutesttmps Oqver The BrownLazy DogmCV"], ["BzyLazy"], ["MNhqThe CQuicJumpsk Brown Fox Jumpsw1This is a sample sstrintog ton test the functiont OverThis is a sample string to test the function The BrownLazy DogmCV"], ["ThT testt1t 1 The iMNhq1TMNMNhqThehe"], ["ThT 1sampLazylet 1 The i"], ["s"], ["ThT i"], [" CdV "], ["\t\t\t\t"], ["\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00edBrMNhqThe\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], [" \n\n !func!ntion "], [" 1t 1 "], [" 1tBrownsampBrownleLazy 1 "], ["tVhCV"], ["BBrownLaayLazy "], ["MNhqThe CQuick Brown Fox Jumpes OveJr The BrownLazy DogmCV"], ["BrownL"], ["BwBrownLazyLazy "], ["BwownLazyLazy "], ["TTBris "], [" 1t The "], ["MNhqThe CQuick Brown Fox Jumps Over The BrownLaz \n\n zy DomgmCV"], ["Th!s 1sr 4 str1str1ngnsg w1th 5ymb0ls !n 1t"], ["ttV\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7"], ["MNhqThe CQuticJumpsk Brown Fox Jumps OverThis is a sample string to test thCV"], ["MNhqmCdCQuicJumpsk\rhqmCV"], ["DogmCVering"], ["OverThisBBrownLaazyLazy \t\t\t"], ["MNhqThe CQuicJumpsk BBrownLazyLazyBrown Fox Jumps OverThis is a sample string to test thCV"], [" This is a sample strg to test t function\n\n z"], ["MNe CQuick Brown Fox oJumps Over The BrownLazy DogmCV"], ["DogmCVerinDog"], ["JumbUmvrKpes"], ["BrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCLazy"], [" 1t 1 Thestring "], ["rstr1ng"], ["to This is a sample string to test the function\n\n z"], ["MNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test th e functionCdV The BrownLazy DogmCV"], ["BwownisLazyLazy "], ["ThT Th!s 1s 4 sstr1str1ngng w1th 5ymb0ls !n 1t 1t 1 The i"], ["CQuicJumpskg\r"], ["s \n\n !func!ntion e"], ["aLLa zy z aa"], ["ThTMNei"], ["g"], ["MNhqThe CQuicJumpsk Browno Fox Jumps Over The BrownLazy DogmCV"], ["BrownsampBrownlMNhqThe CQuicJumpsk BBrownLazyLazyBrown Fox Jumps OverThis is a sample string to test thCVeLazy"], ["thCVeLBrownLazazy"], ["JuTTBrownismbUmvrKpes"], ["CQuDogmCVnsampBrownleLazyick"], ["Th1tBrownsampBrownleLazy!s 1s 4 str1str1ngng w1th 5ymb0ls !n 1tBrownLazys"], ["samp"], ["rrstr1ng"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1t Over The TrownisgmCV"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1testt1tt Over The TBrowMNhqmnrownisgmCV"], ["Brow"], ["\u00e0\u00e8\u00ec\u00f2\u00f5\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff"], ["MNhqThe CQuick Brown hFox Jumps OveMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thCVr The BrownLazy DoMNhqmCdCQuicJumpsk\rgmCV"], ["bUmv"], [" \rLazy \n\r "], ["stri ntog"], ["Th!s 1s 4 str1ng w1thTTBrownis 55ymb0ls !n 1t"], ["teestt"], ["MNhqThBrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCLazyk BrowMNhqmn Fox Jumps OverThis to test t"], ["tetest"], [" t "], ["OverThisBBrownLaazLazy "], ["DogmCLazyk"], ["Thi"], ["MNhqThe CQuDogmCVnsampBrownleLazyick Brown Fox oJutesttmps OqveThT testt1t 1 The iMNhq1TMNMNhqTheher The BrownLazy DogmCV"], ["aaaaa"], [" Th!s 1s 4 str1ng w1th 5ymb0ls !n 1t Over The TTBrownisgmCV"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1testt1tt Over The TBrowMNhqmnrownisgmCVstrC1ng"], [" 1tBrownsampBrownleLazy 1 \t"], ["Tntoghis"], ["functontMNhqThe CQuDogmCVnsampBrownleLazyick Brown Fox oJutesttmps OqveThT testt1t 1 The iMNhq1TMNMNhqTheher The BrownLazy DogmCV"], ["1CQuicJstrOveringumpskt"], ["JumJp"], [" \rLazy \n\r Th!s 1s 4 str1ng w1th 5ymb0ls !n 1testt1tt Over The TBrowMNhqmnrownisgmCVstrC1ng 1s"], ["BBroownLazyLazy"], ["s \n\n !fu55ymb0lsnc!ntion e"], ["tVtV"], ["MNhqmCdCV"], ["oMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thCV"], ["MNhqThe CuQuicJumpsk Brown Foxstr1str1ngng Jumps OverThis is a sample string to test thCV"], ["RDogmCLazyGGTk"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !n 1testMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCVt1tt Over The TBrowMNhqmnrownisgmCV"], ["MNhqThe CQu\t\t\tick Brown func!ntionFox oJutesttmps Over The BrownLazy DogmCV"], ["This is ao sample starintog ton test the function"], ["MNhqThe\t\t"], ["to Thihs is a sa\nmple string to test the function\n\n z"], ["FstrintoBrLownLgwox"], ["ttV\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00ec\u00f6\u00fc\u00ff\u00e7"], ["BwownLazyLazy"], ["BrowwnL"], ["Th!s"], ["MNhqThe CQuick Brown hFox Jumps Over The BrownLazy DoMNhThis is a sample strintog to test the function\rgmCV"], ["MNMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCV\nhCV"], ["MNhqThBrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCLazyk BrowMNhqmn Fox Jumps OverThis to tehst t"], ["MNMNhqThe CQuick Brown Fox JumpBrownL \r \n azyses Over The BrownLazy DogmCV\nhCV"], ["MNhqThe CQuick Brown Fox Jumpes OveJr The BrownLazy DogmBrownCV"], ["r1g"], ["UcBwownisLazyLazy "], ["UcBwDomgmCVownisLazyLazy "], ["MNhqThe C Quick Brown Fox Jumps Over The BrownLazy DogmCV"], ["BrownL tt\r \n azys"], ["stCQuicJstrOveringumpskt"], ["LaOverThisBBrownLaazyLazy \t\t\tzy "], ["TTBr ownis "], ["aLLa zy z a"], ["This is ao sample starintog ton test the n"], [" 1t T"], [" str1ng 1t The This is a samThT 1sampLazylet 1 The ipleOvering to test the function"], ["TTBrownnnis "], [" 1tBrownsampBrownleLazy B1 \t"], ["functBwownisLazyLazy ion"], ["MNhqThe C Quick Brown Fox zy DogmCV"], ["ickk"], ["BrozwnLazys"], ["This i s a sample strintog to test the hfuncti on"], ["1tBrownLazys"], ["z"], ["Lazyy z "], ["BBrownLLazyLazy "], ["stCQuicMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCVstrOveringumpskt"], ["i"], ["CQuDogmCVnsampBrownfunctBwownisLazyLazy"], ["aLLaa zz aa"], ["UcBwDomgmCVownisLazyLazy"], ["DogmCLazy"], ["BrownLazMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test th e functionCdV The BrownLazy DogmCVys"], ["1testt1tt"], ["sThe"], ["MNhqThe C Quic k Brown FTh!s 1s 4 str1ng w1th 5ymb0ls !n 1testMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCVt1tt Over The TBrowMNhqmnrownisgmCVox Jumps Over TheC BrownLazy DogmCV"], ["Jumpsw1This"], ["QGLWea"], ["1testt1t"], ["CCQuicJumpsk"], ["MNhqmThTis "], ["This is a sample strintog to tesMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test the function The BrownLazy DogmCVt the function"], [" This is a sampleT stringunction\n\n z"], ["aLLa zyz z a"], ["nction"], ["TBrowMNhqmnrownisgmCV"], ["DogmC \n\n func!ntion Lazyk"], ["BryownLazys"], ["ThTiTi"], ["TMNhqmCVhis is ao sample starintog ton test the n"], [" str1ng 1t The This is a samThT 1sampLazylet 1 The MNhqThe CuQuicJumpsk Brown Fo \n\n xstr1str1ngng Jumps OverThis is a sample string to test thCVt the function"], ["ntog"], ["hCV"], ["Th!s 1s 4Cr1ngng w1th 5ymb0ls !n 1t"], ["ThT OverThisBBrownLaazyLazy t1DomgmCV i"], [" \r \n \u00e0\u00e8\u00ec t 1t The \u00f2\u00f5\u00f9\u00e1\u00e9\u00ed\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff"], ["samplsme"], ["on"], ["ThT ttestt1t 1 TBrownLazyhe i"], ["sasmplsme"], ["\n\n\n"], ["CQuticJumpsk"], ["OqvveThT"], ["functontMNhqThLe CQuDogmCVnsampBrownleLazyick Brown Fox oJutesttmps OqveThT testt1t 1 The iMNhq1TMNMNhqTheher The BrownLazy D\u00e0\u00e8\u00ec\u00f2\u00f9\u00e1\u00e9\u00edBrMNhqThe\u00f3\u00fa\u00fd\u00e2\u00ea\u00ee\u00f4\u00fb\u00e3\u00f1\u00f5\u00e4\u00eb\u00ef\u00f6\u00fc\u00ff\u00e7ogmCV"], ["C"], ["sTe"], ["w1thTTBrownis"], [" samThT "], ["CQuicJumpskg"], ["CQuicJumpskg\r\r"], ["!func!ontion"], ["MNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thhe function The BrownLazy DogmCV"], ["Jumpsw1Tntoghiss"], ["BBrownLaayLazy"], ["saasmplsme"], ["MNhqThe Quick Brown Fox Jumps Over The BrownLazy DogmCrV"], ["1seampLazyleat"], ["ThhT"], [" 1t 1 The aaaaa"], ["BrownLazMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sastr1str1ngnsgmple string to test th e functionCdV The BrownLazy DogmCVys"], ["MNhqThe CQuick Brown hFox Jumps Over The BrownLazy DoMNhThis is a sample strintoTh!s 1s 4 str1ng w1th 5ymb0ls !n 1testMNhqThe CQuick Brown Fox Jumpes Over The BrownLazy DogmCVt1tt Over The TBrowMNhqmnrownisgmCVg to test the function\rgmCV"], ["GThT 1t 1 The CuQuicJumpsk ic"], [" The "], ["BBrownLaayLazystringunction"], ["UcBwDnomgmCVownisLazyLazy"], ["BBrownLaayLazystrizngunction"], ["BrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCVnsampBrownleLaLazy z zyhTiTh!s 1s 4 str1ng w1th 5ymb0ls !n 1ts"], ["zz"], ["w CdV 1This is a sample sstrintogt ton test the functiont"], ["qygh"], ["BrowMNhqThe CQuick Brown Fstrintogwox Jumpes Over The BrownLazuey DogmCVnsampBrownleLazy"], ["TheC"], [" 1t 1 The "], [" te 1t sThe s tt\r \n\r Foxstr1str1ngng"], ["DogmCV"], ["OverTh"], [" ThiBrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCLazys is a sample string to test th e function\n\n z"], [" str1ng 1t The This is a samThT 1sampLazylet i1 The MNhqThe CuQuicJumpBsk Brown Fo \n\n xstr1str1ngng Jumps OverThis is a sample string to test thCVt the function"], ["Th!s 1s 4 str1str1 1t"], ["nctoion"], ["TTBrown"], ["BBroownLaaLLa zy z aazyLazy"], ["str1g"], ["MNhqThBrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCLazyk BrowMNhqmn Fox Jumps OverThis to ytehst t"], ["BrowMNhqThe CQuick Brown Fstrintogwox Jumpes Over zy"], [" 1t Theion "], ["TTBrownis "], ["MNhqm"], [" ThiBrowMNhqThe CQuick FoxJumpsBrown Fwox Jumpes Over The BrownLazey DogmCLazys is a sample string to test th e function\n\n z"], ["Th!s 1s 4 str1ng w1th 5ymb0ls !nw 1testt1tt Over The TBrowMNhqmnrownisgmCV"], ["JumbstringunctionUmvrKpes"], ["Lazy "], ["BwownLazyaLa zy "], ["CCQuicJumt1DomgmCVpsk"], ["Jumpsw1TntoghiTTBrisss"], ["BrownL tt\r \n aCQuDogmCVnsampBrownleLazyickzys"], ["UrK"], ["BBrownLaayLazystringunctionn"], ["VhCV"], ["CQuicJstrOveJringumpsk"], ["MNhqThe CQuick Brown hFox Jumps OcveMNhqThe CQuicJumpsk Brown Fox Jumps OverThis is a sample string to test thCVr The BrownLazy DoMNhqmCdCQuicJumpsk\rgmCV"], ["BrowMNhqThe CQuick Brown Fwox Jumpes Over The BrownLazey DogmCVnsampBrownleLaLazy z zyhTiTh!s 1s 4 str1ng w1th 5ymb0ls !n 1tsrrstr1ng"], ["OverThisBBrownLaazyLazy"], ["aCQuDogmCVnsampBrownleLazyickzys"], ["UcBwownisLazzyz "], ["iii"], ["s \n\n !func!ntio \n\n func!ntion n e"], ["Th!s 1s 4 str1sMNhqmtr1 1t"], ["testVhCVtt"], ["DogmCVBrownsampBrownlMNhqThensampBrownleLazy"], [" te 1t sThe s tt\r \n1\r Foxstr1str1ngng"], ["MNhqThe Quick BrowTBrowMNhqmnrownisgmCVgn FoxJumpws Over The BrownLazy DogmCV"], ["Th!s 1s 4 str1str1ngng w1th 5ymb0lDogmVCVBBrownLazyLazy s !n 1tBrow"], ["Ju This is a sampleT stringunction\n\n zTTBrownismbUmvrKpes"], ["\u00e7"], ["TBrowMNhqmnrownisgmCVstrC1ng"], [" This is a sample strinazysgunction\n\n z"], ["aLLa"], ["Th!s 1s 4s str1str1ngng w1th 5ymb0ls !n 1tBrow"], ["BrownLazuey"], ["MNhqThe CQugicJumpsk Brown Foxstr1str1ngng Jumps OverThis is a sample string to test thCV"], ["\nzTTBrownismbUmvrKpesBrMNhqThe\nTh!s 1s 4 str1str1ngng w1th 5ymb0lDogmVCVBBrownLazyLazy s !n 1tBrow\n"], ["LaOverThissBBrownLaazyLazy \t\t\tzy "], ["stCQuicJstrOveringumpsktoJutesttmps"], ["tstr1g"], ["Th!s 1s !4 str1str1ngnsg w1th 5ymb0ls !n 1t"], ["leOvMNhqThe CQuick Brown Fox oJumps Ovepr The BrownLazy DogmCVering"], ["CQuck"], ["aLaLBrowTBrowMNhqmnrownisgmCVgna"], ["thThT OaverThisBBrownLaazyLazye t1t 1 The iCVeLBrownLazazy"], ["BBrownLLazyLazy"], ["Th!s 1s w1This is a sample sstrintog ton test the functiont4 str1str1ngng w1th 5ymb0ls !n 1t"], [" Th!s 1s 4 str1ng w1thn 5ymb0ls !n 1t Over The TTBrownisgmCV"], ["testtt"], ["aLLaa zz aaick"], ["DogmCrV"], ["hThT testt1t 1 The iMNhq1TMNMNhqThehe"], [" The "]], "completion": "\ndef strlen(string: str) -> int:\n return len(string)\n", "raw_completion": "Here is the complete function definition:\n\n```python\ndef strlen(string: str) -> int:\n return len(string)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef strlen(string: str) -> int:\n \"\"\" Return length of given string\n >>> strlen('')\n 0\n >>> strlen('abc')\n 3\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/24", "prompt": "\n\ndef largest_divisor(n: int) -> int:\n \"\"\" For a given number n, find the largest number that divides n evenly, smaller than n\n >>> largest_divisor(15)\n 5\n \"\"\"\n", "entry_point": "largest_divisor", "canonical_solution": "\n\n for i in range(2, n):\n if n % i == 0: return n // i\n return 1\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(3) == 1\n assert candidate(7) == 1\n assert candidate(10) == 5\n assert candidate(100) == 50\n assert candidate(49) == 7\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n > 1, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[3], [7], [10], [100], [49]], "atol": 0, "plus_input": [[2], [27], [101], [235], [500], [999], [1000], [36], [72], [81], [499], [234], [73], [998], [35], [22], [23], [1001], [74], [236], [82], [75], [99], [76], [77], [24], [28], [80], [238], [29], [237], [56], [57], [3], [997], [30], [4], [102], [37], [233], [103], [78], [55], [5], [58], [21], [83], [25], [1003], [996], [11], [501], [34], [232], [100], [995], [231], [33], [79], [502], [1004], [54], [1005], [1002], [20], [230], [98], [32], [31], [53], [65], [59], [38], [52], [19], [97], [64], [12], [51], [1006], [39], [40], [49], [60], [61], [10], [6], [96], [63], [26], [104], [239], [41], [88], [42], [84], [503], [43], [62], [18], [127], [1321], [500027], [732312], [1234567], [732313], [126], [500028], [1322], [732314], [1234568], [1320], [500029], [95], [500030], [732311], [1323], [1234569], [1234566], [500031], [50], [732315], [1234570], [732310], [128], [732309], [1324], [500026], [71], [732316], [131], [125], [500025], [70], [48], [47], [46], [994], [69], [124], [1234572], [1325], [500024], [132], [1234571], [1319], [94], [993], [130], [992], [129], [1318], [732317], [732318], [990], [44], [989], [732308], [732306], [732307], [732305], [732304], [1234565], [732303], [8], [732302], [92], [93]], "completion": "\nimport numpy as np\n\ndef largest_divisor(n: int) -> int:\n return max(i for i in range(1, n) if n % i == 0)\n", "raw_completion": "```python\nimport numpy as np\n\ndef largest_divisor(n: int) -> int:\n return max(i for i in range(1, n) if n % i == 0)\n```\n", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef largest_divisor(n: int) -> int:\n \"\"\" For a given number n, find the largest number that divides n evenly, smaller than n\n >>> largest_divisor(15)\n 5\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/25", "prompt": "from typing import List\n\n\ndef factorize(n: int) -> List[int]:\n \"\"\" Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"\n", "entry_point": "factorize", "canonical_solution": "\n import math\n fact = []\n i = 2\n while i <= int(math.sqrt(n) + 1):\n if n % i == 0:\n fact.append(i)\n n //= i\n else:\n i += 1\n\n if n > 1:\n fact.append(n)\n return fact\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate(2) == [2]\n assert candidate(4) == [2, 2]\n assert candidate(8) == [2, 2, 2]\n assert candidate(3 * 19) == [3, 19]\n assert candidate(3 * 19 * 3 * 19) == [3, 3, 19, 19]\n assert candidate(3 * 19 * 3 * 19 * 3 * 19) == [3, 3, 3, 19, 19, 19]\n assert candidate(3 * 19 * 19 * 19) == [3, 19, 19, 19]\n assert candidate(3 * 2 * 3) == [2, 3, 3]\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n >= 2, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[2], [4], [8], [57], [3249], [185193], [20577], [18]], "atol": 0, "plus_input": [[10], [15], [28], [1024], [131], [33], [1000], [100], [123456789], [987654321], [1025], [11], [1026], [29], [1027], [14], [34], [13], [99], [132], [123456790], [1023], [123456788], [32], [31], [1022], [987654320], [123456791], [1028], [123456787], [123456792], [27], [39], [12], [30], [2147483647], [1207943], [112234369], [999983], [1003001001], [43121192843], [1073741789], [9999999967], [1003001000], [112234370], [56], [9999999966], [2147483646], [1003000999], [1207942], [999984], [79], [80], [1003001002], [78], [77], [112234368], [9999999965], [83], [76], [75], [112234367], [52], [112234371], [2147483645], [53], [9999999964], [112234372], [1003001004], [101], [6], [1003001005], [1073741788], [67], [123456786], [1003001003], [47], [57], [58], [26], [51], [55], [38], [37], [17], [125], [7919], [987654322], [43121192841], [43121192844], [987654323], [43121192842], [123456785], [112234366], [999982], [112234365], [43121192845], [2147483644], [1207944], [1073741790], [1073741791], [9999999969], [2147483643], [1207945], [43121192840], [1207946], [1003000998], [43121192839], [112234364], [9999999968], [987654324], [1207947], [999980], [999979], [999981], [43121192838], [987654319], [999985], [2147483642], [2147483641], [46], [43121192837], [999987], [987654325], [1003000997], [987654326], [1207948], [999986], [987654327], [50], [999978], [999988], [999977], [999989], [9999999963], [44], [43], [42]], "completion": "\nfrom typing import List\n\n\ndef factorize(n: int) -> List[int]:\n \"\"\" \n Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"\n factors = []\n divisor = 2\n while n > 1:\n if n % divisor == 0:\n factors.append(divisor)\n n //= divisor\n else:\n divisor += 1\n return factors\n", "raw_completion": "```python\nfrom typing import List\n\n\ndef factorize(n: int) -> List[int]:\n \"\"\" \n Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"\n factors = []\n divisor = 2\n while n > 1:\n if n % divisor == 0:\n factors.append(divisor)\n n //= divisor\n else:\n divisor += 1\n return factors\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef factorize(n: int) -> List[int]:\n \"\"\" Return list of prime factors of given integer in the order from smallest to largest.\n Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\n Input number should be equal to the product of all factors\n >>> factorize(8)\n [2, 2, 2]\n >>> factorize(25)\n [5, 5]\n >>> factorize(70)\n [2, 5, 7]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/26", "prompt": "from typing import List\n\n\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"\n", "entry_point": "remove_duplicates", "canonical_solution": "\n num_cnt = dict()\n for number in numbers:\n if number not in num_cnt:\n num_cnt[number] = 0\n num_cnt[number] += 1\n return [number for number in numbers if num_cnt[number] == 1]\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([1, 2, 3, 4]) == [1, 2, 3, 4]\n assert candidate([1, 2, 3, 2, 4, 3, 5]) == [1, 4, 5]\n", "contract": "\n assert type(numbers) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) == int for x in numbers), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[]], [[1, 2, 3, 4]], [[1, 2, 3, 2, 4, 3, 5]]], "atol": 0, "plus_input": [[[1, 1, 2, 2, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4]], [[2, 2, 2, 2]], [[1, 1, 1, 1]], [[-1, 0, 1, 0, -1, 1]], [[1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 6, 7, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9, 9]], [[1, 2, 3, 4, 4, 6, 7, 8, 9]], [[1, 2, 3, 4, 6, 7, 8, 9]], [[1, 2, 3, 4, 4, 7, 8, 9]], [[2, 2, 2, 2, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 9, 9]], [[1, 2, 3, 4, 6, 8, 9]], [[2, 2, 4]], [[1, 2, 3, 4, 5, 6, -1, 7, 8, 9, 8, 9, 9]], [[1, 2, 3, 4, 4, 6, 7, 8, 4, 9]], [[2, 3, 4, 6, 8, 9]], [[1, 2, 3, 4, 4, 7, 8, 9, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 7, 9, 9, 9]], [[1, 2, 3, 4, 4, 6, 7, 8, 9, 4]], [[1, 1, 1, 1, 1, 1]], [[1, 1, 2, 2, 3, 3, 4, 4, 3]], [[1, 2, 3, 4, 4, 6, 1, 7, 8, 9, 4]], [[2, 2, 2]], [[1, 2, 4, 6, 7, 8, 2]], [[1, 1, 1]], [[2, 1, 2, 1, 1, 1]], [[1, 2, 3, 5, 6, 7, 8, 9, 8, 9, 9]], [[1, 1, 1, 2, 2, 3, 4, 4, 4]], [[1, 2, 3, 4, 4, 7, 8, 3, 9, 2]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 1, 3, 1]], [[2, 1, 2, 1, 1]], [[1, 1]], [[1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 6, 8, 9, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9]], [[1, 2, 3, 4, 6, 7, 8, 9, 7, 9, 9, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 7, 9, 9, 9, 9]], [[2, 1, 2, 3, 1, 1]], [[1, 2, 3, 4, 4, 6, 7, 8, 9, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9, 9, 1]], [[1, 1, 2, 2, 3, 4, 4]], [[1, 1, 6, 2, 2, 3, 4, 4]], [[1, 3, 4, 5, 6, 7, 8, 9, 9, 4, 9]], [[9, 1, 2, 9, 3, 8, 6, 8, 9]], [[1, 1, 1, 1, 3, 2, 2, 3, 3, 4, 4, 4, 1, 3, 1]], [[1, 1, 1, 1, 2, 3, 3, 4, 4, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 6, 8, 9, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 6, 8, 9, 9, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 7, 9, 7, 9, 9, 9, 8]], [[1, 2, 4, 6, 7, 8]], [[1, 3, 4, 5, 6, -1, 7, 8, 9, 8, 9, 9]], [[-1, 0, 0, -1, 1]], [[1, 2, 4, 3, 4, 5, 6, 7, 8, 9, 6, 8, 9, 9]], [[1, 1, 1, 1, 3, 2, 2, 3, 3, 4, 3, 4, 1, 3, 1, 3]], [[1, 2, 2, 3, 4, 4, 7, 8, 2]], [[2, 1, 2, 2, 1, 1, 1]], [[1, 2, 4, 7, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 6, 8, 9, 9, 9]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 9, 9, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 6, 8, 9, 9, 9]], [[1, 0, 2, 2, 3, 3, 4, 4]], [[-1, 0, 10, -1, 1]], [[-1, 0, 10, -1, -1]], [[2, 1, 3, 4, 5, 6, 3, 7, 8, 9, 9, 4, 9, 5]], [[1, 2, 3, 4, 4, 0, 8, 9]], [[1, 1, 1, 1, 3, 2, 2, 3, 3, 4, 4, 4, 1, 3, 7, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9, 9, 5]], [[1, 2, 3, 4, 4, 7, 8, 9, 2, 9]], [[2, 2, 3, 2, 10]], [[2, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 7, 9, 7, 9, 9, 9, 8, 5]], [[2, 9, 2, 3, 2, 10]], [[1, 2, 4, 3, 4, 5, 6, 7, 8, 9, 6, 8, 9, 9, 6, 3]], [[1, 2, 3, 4, 6, 8, 9, 8]], [[1, 2, 3, 4, 4, 3, 6, 7, 8, 9, 4]], [[1, 2, 4, 5, 6, 7, 8, 7, 9, 7, 9, 8, 9, 9, 8]], [[1, 2, 3, 4, 6, 7, 9]], [[1, 2, 3, 4, 4, 6, 1, 7, 8, 3, 4]], [[1, 2, 3, 4, 4, 6, 7, 8, 9, 8, 9, 9]], [[1, -1, 3, 4, 5, 6, 7, 4, 9, 9, 9, 9]], [[2, 1, 1, 1, 3, 2, 2, 3, 3, 4, 3, 4, 1, 3, 1, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30]], [[10, 10, 10, 10, 10, 10, 10]], [[2, 2, 2, 2, 2, 2, 2, 1]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 13]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 4, 4, 5, 5, 5, 2, 5]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 2]], [[1, 5, 7, 9, 11, 13, 15, 17, 19]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 1, 5, 2]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 3]], [[1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 5, 7, 9, 11, 13, 15, 17, 19, 7]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5]], [[2, 2, 2, 2, 2, 2, 2, 1, 2]], [[5, 0, 1, 3, 5, 7, 9, 11, -5, 15, 17, 19, 13]], [[-10, 4, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 3]], [[1, 5, 12, 9, 11, 13, 15, 17, 19, 7, 1]], [[-10, 5, 2, 5, -10, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 5, 5, 4, 2, 5, 4, 5]], [[1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5]], [[12, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 1, 5, 2]], [[1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4]], [[1, 1, 2, 2, 3, 4, 5, 4, 5, 5, 5]], [[12, 1, 1, 2, 5, 0, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2]], [[0, 1, 3, 5, 7, 9, 11, 13, 15, 1000, 19, 13]], [[12, 0, 1, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 5, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 2, 5, 4, 5]], [[1, 1, 1, 2, 2, 3, 3, 1000, 4, 5, 4, 5, 5, 5, 2]], [[1, 1, 1, 2, 2, 2, 15, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 5, 4, 5]], [[-10, 5, 2, 11, 17, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 2, 5, 4, 5, 1]], [[0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, 13]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4]], [[1, 1, 1, 2, 2, 3, 3, 1000, 4, 5, 4, 5, 5, 5, 2, 5]], [[12, 1, 1, 2, 5, 2, 3, 4, 4, 4, 5, 4, 2, 5, 4, 2, 2]], [[1, 0, 1, 1, 2, 2, 2, 15, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 5, 7, 9, 11, 13, 15, 17, 19, 7, 11]], [[1, -10, 1, 1, 2, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[12, 1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4]], [[1, -10, 1, 1, 2, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4]], [[12, 1, 1, 2, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2]], [[12, 1, 1, 2, 2, 4, 2, 4, 3, 4, 5, 5, 4, 2, 5, 4, 5, 2]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2]], [[0, 1, 19, 5, 7, 9, 11, 13, 15, 17, 8, 19, 13]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 13, 4, 2, 5, 4, 5, 1]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 5, 5, 5, 4, 2, 5, 4]], [[1, 1, 1, 2, 4, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 4, 5]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 3, 4, 5, 5, 5, 2, 5]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 14, 5, 4, 2, 5, 4, 5, 14]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5]], [[1, 1, 1, 4, 2, 4, 2, 3, 3, 4, 4, 4, 5]], [[12, 1, 1, 2, 5, 2, 3, -10, 4, 4, 5, 4, 2, 4, 4, 2, 2]], [[1, 5, 12, 9, 11, 13, 15, 17, 19, 7, 1, 19]], [[12, 1, 2, 2, 3, 3, 4, 2, 5, 5, 4, 6, 5, 5, 2, 5, 12, 1, 5, 2]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 1, 5, 3]], [[1, 5, 6, 9, 11, 13, 15, 17, 19, 7]], [[2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2]], [[13, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5]], [[1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4]], [[2, 2, 2, 2, 2, 2, 3, 2, 1]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 4, 4, 2, 5, 4, 2]], [[13, 1, 1, 2, 5, 2, 3, -10, 4, 5, 4, 2, 4, 4, 2, 2]], [[-10, 4, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, 2, -30, 12]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 2, 2]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 4, 2, 5, 4, 2, 12]], [[1, 1, 1, 2, 2, 15, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[12, 0, 2, 5, 0, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 5]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 5]], [[12, 1, 2, 5, 2, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 2]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 1]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 13]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 14, 15, 16, 17, 13, 18, 19, 20]], [[0, 1, 19, 5, 7, 9, 11, 13, 15, 17, 8, 19, 13, 19]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2]], [[1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[12, 1, 15, 5, 2, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 5, 4, 5]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 5, 5, 4, 1, 5, 4, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 5]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12, 20]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 2, 3, 20, 4, 5, 5, 2, 5, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 14, 15, 16, 17, 13, 18, 19, 20, 13]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 11, 5, 5, 4, 2, 5, 4, 2, 6, 2, 2]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 3]], [[1, 5, 7, 9, 11, 13, 12, 8, 15, 17, 19, 7, 11]], [[10, 10, 10, 10, 10, 10, 10, 10]], [[2, 2, 2, 2, 3, 2, 3, 2, 1]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 9, 9, 9, 9, 10, 11, 11, 12, 11, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[1, -10, 1, 1, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 3]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 4, 2, 5, 4, 2, 12, 4, 4]], [[1, 5, 12, 9, 11, 13, 15, 15, 17, 19, 7, 1]], [[1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 2]], [[1, 3, 5, 4, 7, 9, 11, 13, 15, 17, 19]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 4, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 16]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 10]], [[1, 1, 1, 2, 4, 2, 15, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[11, 1, 5, 12, 7, 11, 13, 15, 17, 19, 7, 1, 19, 7]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 4, 12, 14, 16, 18, 19, 20, 18, 10, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2]], [[12, 1, 1, 1, 4, 2, 3, 4, 4, 4, 5, 4, 2, 5, 4, 2]], [[1, 5, 12, 9, 10, 11, 13, 15, 15, 17, 19, 7, 1]], [[12, 1, 1, 2, 2, 3, 3, 4, 3, 4, 5, 5, 5, 2, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 3]], [[12, 0, 2, 5, 0, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 5, 5]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 13, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 5]], [[1, 5, 6, 9, 11, 13, 15, 17, 19, 7, 5]], [[1, 2, 3, 3, 3, 4, 4, 19, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3]], [[1, 3, 5, 4, 1000, 7, 9, 11, 13, 15, 19]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 10, 11, 11, 12, 3, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 18, 4]], [[12, 0, 1, 2, 3, 3, 4, 2, 5, 4, 4, 16, 5, 5, 2, 5, 12, 5, 2]], [[1, 5, 7, 9, 11, 13, 10, 15, 17, 19]], [[12, 1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 3]], [[1, 18, 9, 11, 13, 15, 15, 17, 19, 7, 1]], [[1, 2, 3, -30, 1, 4, -10, 5, 7, 6, 17, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[1, 1, 2, 2, 3, 2, 4, 4, 4, 5, 5, 6, 2]], [[12, 1, 1, 2, 5, 2, 4, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 14, 5, 4, 2, 5, 4, 5]], [[12, 0, 2, 5, 0, 2, 3, 4, 4, 4, 5, 5, 11, 4, 2, 5, 4, 2, 5, 5]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 8, 18]], [[12, 4, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4]], [[12, 1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 15, 2, 5, 4]], [[1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 5]], [[0, 1, 3, 5, 7, 9, 11, 13, 18, 15, 1000, 19, 13, 11]], [[1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 0, 5, 5, 5, 2]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 2, 4, 4, 5, 4, 4, 2, 5, 4, 2]], [[12, 1, 1, 2, 2, 3, 4, 3, 4, 5, 5, 5, 4, 2, 5, 4, 2]], [[1, 3, 3, 5, 7, 9, 11, 13, 15, 17, 19, 13, 15, 13]], [[12, 1, 1, 2, 4, 2, 3, 4, 0, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[1, 1, 1, 2, 2, 3, 3, 1000, 4, 5, 5, 5, 5, 2, 5]], [[1, -10, 1, 1, 2, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 2, 2]], [[1, 10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5]], [[12, 1, 1, 2, 2, 3, 4, 3, 4, 5, 5, 5, 4, 2, 5, 4, 2, 1]], [[1, 1, 1, 2, 2, 2, 5, 3, 3, 4, 4, 4, 5, 5, 3]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 3, 5, 2, 5, 3]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12, 12, 20, 0]], [[1, 1, 1, 2, 2, 5, 3, 3, 4, 4, -5, 5, 5, 3]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2, 2]], [[1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 3]], [[1, 2, 3, -30, 1, 4, -10, 5, 7, 6, 17, 8, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[-10, 5, -30, 5, -10, 8, 12, 12, 0, -5, 9, -5, 20, 20, -30, 12, 12, 20]], [[1, 5, 6, 9, 11, 17, 13, 15, 17, 19, 7, 5]], [[12, 1, 1, 2, 4, 2, 3, 4, 0, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3, 7]], [[-10, 5, -30, 5, -10, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12, 12, 20, 0]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 3, 2]], [[1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5, 4, 1]], [[1, 5, 6, 9, 11, 13, 15, 17, 7, 5, 1, 13]], [[12, 1, 1, 2, 4, 3, 4, 4, 0, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[12, 1, 2, 5, 2, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2]], [[5, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 13, 4, 5, 4, 5, 1]], [[1, 18, 9, 11, 13, 12, 15, 15, 17, 0, 19, 7, 1]], [[1, 5, 12, 9, 11, 13, 15, 15, 17, 19, 7, 1, 15]], [[12, 1, 1, 2, 5, 2, 3, 3, 2, 3, 4, 3, 5, 5, 5, 2, 5]], [[1, 1, 1, 1, 2, 2, 4, 3, 4, 4, 4, 5, 5, 5, 3]], [[12, 4, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 20, 2, 5, 4, 5, 4]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 4]], [[1, 10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 3]], [[1, 3, 5, 7, 9, 11, 13, 14, 1, 17, 19, 19]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 3]], [[1, 1, 1, 2, 2, 2, 5, 3, 3, 4, 4, 4, 5, 3]], [[12, 0, 1, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 5, 2, 2]], [[12, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 1, 5, 2, 4]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 17, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2, 2]], [[2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 8, 10, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3, 7]], [[1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 5]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 13]], [[12, 0, 1, 2, 3, 3, 4, 2, 5, 4, 4, 16, 5, 5, 2, 5, 12, 5, 2, 4]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 5, 4, 5, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 3, 5, 1]], [[12, 1, 1, 2, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 1]], [[0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, 13, 7]], [[1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 4, 5, 4, 1]], [[1, 1, 4, 1, 2, 4, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 18, 9, 11, 13, 12, 15, 15, 17, 0, 19, 7, 1, 18]], [[2, 2, 2, 2, 2, 2, 2, 2, 1]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 17, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 16, 4]], [[12, 1, 1, 2, 4, 2, 3, 4, 0, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5, 1]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 5, 5, 5, 4, 2, 5, -30, 4]], [[1, 3, 3, 5, 7, 9, 11, 13, 15, 17, 19, 8, 15, 13]], [[12, 0, 2, 5, 0, 2, 3, 9, 4, 4, 4, 5, 5, 11, 4, 2, 5, 5, 2, 5, 5]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 6, 5, 5, 2, 5]], [[5, 1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 0, 5, 5, 5, 2]], [[1, 0, 1, 1, 2, 2, 2, 15, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 2, 3, 3, 4, 4, 19, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 5, 12]], [[12, 1, 2, 2, 3, 4, 2, 2, 4, 3, 4, 5, 5, 4, 4, 2, 5, 4, 5]], [[-10, 5, 1, 11, 17, -10, 8, 12, 12, 1, 0, -5, 9, -5, -9, 20, 20, -30]], [[1, 5, 12, 9, 11, 13, 15, 15, 17, 19, 7, 1, 13]], [[1, 3, 5, 7, 9, 11, 13, 15, 1, 17, 19, 19]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 14, 15, 16, 17, 13, 18, 19, 20, 13, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 4, 5, 4, 2, 5, 4, 5, 1]], [[12, 1, 1, 2, 2, 3, 5, 2, 4, 5, 5, 5, 4, 2, 5, -30, 4]], [[1, 1, 1, 4, 2, 4, 2, 10, 3, 3, 4, 4, 4, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5]], [[1, 1, 1, 2, 2, 3, -5, 3, 4, 4, 5, 5, 5]], [[1, 1, 2, 3, 2, 3, 4, 2, 4, 3, 4, 4, 5, 4, 2, 5, 4, 5, 1]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 5, 4, 2]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 21, 20, -30, 12, 12]], [[1, 2, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 8, 18]], [[1, 2, 3, 4, 5, 3, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 14, 15, 16, 17, 13, 18, 19, 20, 13, 2]], [[0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, -9, 13, 7]], [[12, 1, 1, 2, 4, 3, 5, 4, 4, 0, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[12, 1, 1, 2, 6, 2, 16, 3, 4, 2, 4, 4, 5, 5, 10, 15, 2, 5, 4, 4]], [[12, 1, 1, 5, 2, 3, 3, 2, 3, 4, 3, 5, 5, 2, 5, 5]], [[-10, 5, -30, 5, -10, 12, 12, 1, 0, -5, 9, 5, 20, 20, -30, 12, 12, 12, 20, 0]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 13, 4, 5, 4, 5, 1, 1]], [[1, 5, 12, 9, 11, 13, 15, 15, 17, 19, 7, 1, 13, 13]], [[12, 0, 2, 5, 0, 2, 3, 15, 4, 2, 4, 4, 5, 5, 4, 2, 5, 14, 2, 5, 5]], [[1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 4, 5, 4, 1]], [[12, 0, 2, 5, 0, 2, 3, 15, 4, 2, 4, 4, 5, 5, 4, 2, 5, 14, 2, 5, 5, 5, 5]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 19]], [[1, 1, 11, 2, 2, 3, 3, 1000, 4, 5, 4, 5, 5, 5, 2, 5]], [[12, 1, 1, 2, 2, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 4, 5]], [[0, 1, 3, 5, 7, 9, 11, 10, 18, 15, 1000, 19, 13, 11]], [[1, 5, 6, 11, 17, 13, -9, 18, 19, 7, 5]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 19]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 9, 9, 9, 9, 10, 11, 11, 12, 11, 12, 13, 13, 13, 13, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[2, 2, 2, 2, 3, 2, 2, 3, 2, 1]], [[1, 1, 1, 15, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 5, 3]], [[-10, 5, -30, 5, -10, 8, 12, 12, 0, -5, 9, 20, 20, -30, 12, 12, 20]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 2, 4, 4, 5, 4, 4, 2, 4, 5, 4, 2]], [[1, 1, 1, 2, 2, 3, 4, 4, 5, 4, 5, -10, 5, 5, 2, 5]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 5, 5, 5, 2, 5, 4, 4, 1]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 5, 4, 5, 2]], [[1, 5, 6, 11, 17, 13, -9, 18, 19, -5, -30, 7, 5]], [[1, 1, 6, 2, 2, 3, 3, 4, 4, 5, 6, 2]], [[-10, 5, -30, 5, -10, 8, 12, 12, 1, 0, 20, -5, 9, -5, 20, 20, -30, 11, 12, 20]], [[1, 1, 4, 1, 2, 4, 2, 3, 3, 4, 4, 0, 4, 5, 5, 5]], [[12, 1, 1, 2, 2, 4, 2, 4, 3, 4, 5, 6, 4, 4, 4, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 3, 5, 4]], [[1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 4]], [[1, 1, 2, 2, 3, 4, 5, 4, 2, 5, 5, 5]], [[2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3, 7]], [[1, 1, 1, 1, 2, 2, 4, 3, 4, 4, 4, 5, 5, 5, 3, 4]], [[0, 1, 3, 5, 7, 9, 11, 21, 18, 15, 1000, 19, 13, 11]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 5, 4]], [[1, 5, 7, 9, 11, 13, 12, 8, 15, 18, 19, 7, 11]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 13, 4, 5, 5, 1, 1]], [[1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5]], [[1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 3]], [[1, 1, 1, 1, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[7, 1, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 16]], [[1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 5, 5, 5, 2, 7, 5, 4, 4, 1]], [[1, 1, 2, 2, 3, 4, 4, 3, 4, 5, 13, 4, 2, 5, 4, 5, 1]], [[12, 0, 2, 5, 0, 2, 3, 15, 4, 2, 3, 4, 5, 5, 4, 2, 5, 2, 5, 5, 5, 5, 2]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 1, 18, 16, 16]], [[1, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 5]], [[1, 9, 11, 13, 15, 15, 17, 19, 7, 1]], [[3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 12, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3, 7]], [[12, 1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 999, 4, 5, 4]], [[5, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 0, 12]], [[12, 1, 2, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 5, 4, 5]], [[0, 1, 14, 5, 7, 9, 11, 10, 18, 15, 1000, 19, 13, 11]], [[0, 1, 3, 7, 9, 20, 11, 13, 15, 17, 19, -9, 13, 7]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 2, 4, 4, 5, 4, 4, 2, 4, 5, 4, 2, 2]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 4, 14, 5, 4, 2, 5, 4, 5, 14, 14]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 14, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 9, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[12, 0, 1, 2, 3, 3, 4, 2, 4, 4, 6, 4, 5, 2, 5, 12, 2]], [[0, 1, 3, 5, 7, 9, 11, 13, 18, 15, 1000, 19, 13, 11, 13]], [[1, 5, 6, 9, 1, 11, 13, 15, 17, 19, 7, 5]], [[1, 3, 5, 4, 7, 9, 11, 13, 15, 17, 19, 5, 1]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 1, 18, 16, 16]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 4, 4, 2, 4, 5]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 4, 5, 2]], [[12, 1, 1, 2, 6, 2, 3, 4, 14, 2, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 18, 4]], [[1, 1, 2, 2, 3, 2, 4, 4, 8, 5, 5, 6, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 6, 13, 4, 2, 5, 4, 5, 4]], [[-10, 5, -30, 5, -10, 12, 13, 1, 0, -5, 9, 5, 20, 20, -30, 12, 12, 12, 20, 0]], [[7, 0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, 13, 7]], [[1, 8, 5, 7, 9, 11, 8, 13, 15, 17, 19, 7, 11]], [[1, 1, 1, 1, 2, 3, 3, 4, 4, 19, 4, 5, 5]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 2, 4, 4, 5, 4, 4, 5, 4, 2]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 14, 6, 7, 8, 9, 14, 9, 9, 9, 10, 11, 11, 9, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[1, 2, 3, -30, 1, 4, -10, 5, 7, 6, 17, 8, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 3]], [[17, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 5, 5, 5]], [[1, 1, 1, 4, 2, 4, 2, 10, 3, 4, 4, 4, 4, 5]], [[12, 1, 1, 2, 1, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5, 4]], [[5, 5, -30, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 12, 0]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 2, 4, 3, 2]], [[12, 1, 1, 2, 2, 3, 3, 0, 3, 4, 5, 5, 5, 2, 5]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 2, 4, 3, 2, 2]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 9, 9, 9, 9, 10, 11, 9, 11, 12, 11, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3]], [[0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, 13, 13]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 5, 4, 4]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16]], [[1, 1, 1, -1, 2, 2, 3, 3, 4, 5, 4, 0, 5, 5, 5, 2]], [[9, 10, 10, 10, 10, 10, 10, 10]], [[1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2, 2]], [[3, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5]], [[12, 4, 1, 1, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 5, 4]], [[1, 3, 5, 4, 1000, 3, 7, 9, 11, 13, 15, 19]], [[10, 10, 10, 10, 10, 10, 10, 1]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 12, 7, 16, 10, 18, 19, 20, 7, 10, 20, 16, 1, 18, 16, 16]], [[12, 1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12, 4]], [[1, -10, 1, 1, 2, 2, 2, 3, 4, 5, 4, 5, 5, 5, 2, 4, 2]], [[1, 1, 4, 1, 2, 4, 2, 3, 3, 4, 4, 4, 0, 4, 5, 5, 5]], [[1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 2, 2]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 3, 4]], [[12, 0, 1, 2, 3, 3, 4, 1, 5, 4, 4, 16, 5, 5, 2, 5, 12, 5, 2, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 3, 5, 2, 5, 3, 1]], [[-30, 1, -10, 1, 1, 2, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 2, 2]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 5, 18, 4, 4]], [[1, 1, 1, 2, 2, 3, 3, -5, 4, 4, 5, 5, 5]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 18, 10, 9, 10, 3, 12, 14, 16, 18, 19, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 19, 3]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 16, 3, 5, 3]], [[1, 2, 3, -30, 1, 4, -10, 5, 6, 17, 8, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18]], [[12, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 4, 5]], [[1, 3, 1, 4, 1, 2, 4, 2, 3, 3, 4, 4, 0, 4, 5, 5, 5, 2, 4]], [[12, 1, 1, 2, 2, 4, 2, 4, 3, 4, 5, 5, 4, 2, 5, 4, 5, 2, 4]], [[-30, 10, 10, 10, 10, 10, 10]], [[17, 1, 5, 7, 9, 11, 13, 15, 17, 19, 7, 9]], [[1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 5, 5, 5, 2, 7, 5, 4, 4, 1, 1]], [[10, 10, 10, 10, 11, -1, 10, 10, 10]], [[1, 5, 7, 9, 11, 13, 12, 8, 15, 17, 19, 7, 11, 8]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 20, 4, 5, 5]], [[12, 1, 2, 2, 3, 3, 4, 2, 5, 5, 6, 5, 5, 2, 5, 12, 1, 5, 2]], [[2, 2, 2, 2, 2, 2, 2, 2, 1, 1]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 17, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 16, 4]], [[2, 2, 2, 2, 3, 2, 3, 2, 1, 1]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 19, 20, 7, 10, 20, 16, 18]], [[12, 1, 1, 2, 5, 2, 3, 4, 2, 4, 4, 5, 5, 4, 1, 2, 5, 4, 2, 2, 2]], [[1, 2, 3, 2, 1, 20, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 8, 18]], [[1, 1, 1, 12, 2, 2, 4, 3, 4, 4, 4, 5, 1, 4, 5, 3, 4]], [[1, 1, 2, 2, 3, 2, 4, 4, 5, 5, 6, 2]], [[5, 0, 1, 3, 5, 7, 9, 11, 1, 15, 17, 19, 13]], [[12, 1, 1, 2, 6, 2, 3, 4, 14, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 16, 3, 5, 3, 4]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 1, 5, 4, 5, 4]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 999, 4, 4, 4]], [[12, 1, 1, 2, 2, 2, 6, 4, 2, 4, 4, 5, 5, 4, 5, 4, 2]], [[1, 1, 4, -9, 2, 4, 2, 3, 3, 4, 4, 4, 0, 4, 5, 4, 5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 13, 19]], [[-10, 5, 2, 5, -10, 12, 12, 1, -5, -31, 9, -5, 20, 20, -30]], [[-10, 5, -30, -10, 8, 12, 12, 1, 0, 0, -5, 9, -5, 20, 20, -30, 12, 12, 12]], [[3, 5, 4, 1000, 7, 9, 11, 13, 15, 19]], [[-30, 1, 1, 2, 2, 3, 4, 14, 4, 999, 14, 5, 4, 2, 5, 4, 5, 14]], [[12, 1, 1, 1, 4, 2, 3, 4, 4, 4, 5, 4, 2, 5, 4, 2, 5]], [[2, 2, 2, 2, 2, 2, 2, 2, -31, 1, 1]], [[12, 1, 1, 2, 2, 3, 999, 4, 2, 4, 3, 4, 5, 4, 4, 0, 4, -10]], [[12, 1, 1, 2, 2, 4, 4, 3, 4, 5, 13, 5, 4, 4, 2, 4, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 10, 5, 5, 6, 7, 8, 3, 9, 9, 9, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 16, 4, 12]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 999, 5, 18, 4, 4, 1]], [[12, 1, 1, 2, 4, 2, 3, 4, 0, 4, 4, 5, 4, 2, 5, 4, 7, 5, 1]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 6]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 5, 999, 9, 4, 4]], [[13, 1, 2, 2, 4, 3, 5, 4, 4, 0, 2, 4, 4, 5, 5, 4, 2, 5, 4, 7, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1000, 4, 4, 5, 5, 3, 4]], [[1, 5, 12, 9, 11, 13, 15, 15, 8, 17, 19, 7, 1, 13]], [[12, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 3, 2, 5, 12, 1, 5, 2]], [[1, 1, 1, 1, 2, 3, 3, 2, 4, 4, 4, 5, 5, 5]], [[12, 0, 2, 5, 0, 2, 3, 9, 4, 4, 4, 4, 5, 5, 11, 4, 2, 5, 5, 2, 5, 5]], [[12, 2, 1, 1, 2, 2, 4, 2, 4, 3, 4, 5, 5, 4, 2, 5, 4, 5, 2, 4]], [[2, 2, 2, 2, 2, 13, 3, 2, 1]], [[1, 1, 2, 6, 2, 3, 4, 2, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12, 4]], [[12, 1, 1, 2, 2, 2, 3, 4, 2, 4, 4, 5, 5, 4, 2, 1, 5, 4, 5]], [[1, 1, 4, -9, 2, 4, 2, 3, 3, 4, 4, 4, 0, 4, 5, 4, 1, 5]], [[12, 1, 1, 5, 2, 3, 3, 2, 3, 4, 3, 5, 5, 2, 5, 15, 5]], [[12, 0, 2, 5, 0, 2, 3, 4, 4, 4, 5, 5, 5, 11, 4, 2, 5, 4, 1, 5, 5, 5]], [[7, 1, 3, 2, 1, 4, 5, 7, 6, 7, 18, 9, 10, 3, -31, 14, 16, 18, 19, 20, 18, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 16]], [[2, 2, 2, 2, 8, 2, 2, 2, 2, 1]], [[1, 18, 9, 11, 13, 12, 15, 17, 0, 19, 7, 1, 18]], [[12, 1, 1, 2, 4, 2, 3, 4, 0, 2, 4, 5, 5, 4, 2, 5, 4, 8, 5, 4]], [[1, 5, 7, 9, 11, 13, 10, 15, 16, 19]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 16, 9]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 9, 2, 2, 3, 2, 2, 2]], [[1, -10, 1, 1, 2, 2, 2, 3, 3, 5, 4, 5, 5, 5, 2, 4, 2, 2]], [[1, 19, 5, 7, 9, 11, 13, 15, 17, 8, 6, 0, 19, 13]], [[12, 1, 2, 2, 3, 3, 4, 2, 5, 5, 4, 6, 5, 5, 2, 5, 12, 1, 5, 2, 4]], [[1, 5, 12, 11, 13, 15, 15, 17, 19, 7, 1, 13, 13]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 13, 12, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 3]], [[1, 1, 1, 2, 2, 2, 3, 4, 4, 4, 3, 5, 2, 5, 3, 1]], [[1, 2, 3, 3, 1, 20, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 12, 14, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, -10, 16, 8, 18]], [[1, 1, 1, 2, 2, 3, -5, 3, 4, 4, 5, 5, 5, 1]], [[1, 1, 1, 2, 2, 3, 1000, 4, 5, 4, 5, 5, 5, 2, 5]], [[1, 2, 6, 16, 3, 4, 2, 4, 4, 5, 5, 10, 15, 2, 5, 4, 4]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, -5, 5, 5, 2, 4, 5]], [[1, 2, 3, 4, 5, 3, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 14, 15, 16, 17, 13, 18, 19, 13, 2]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 5, 4, 5, 6, 5, 2, 4, 3]], [[12, 1, 1, 7, 2, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 5, 2, 5, 12, 1, 5, 3]], [[1, 5, 6, 9, 11, 13, 9, 17, 7, 5, 1, 13]], [[1, -10, 1, 1, 2, 2, 3, 3, 4, 2, 5, 4, 5, 5, 18, 4]], [[1, 1, 4, 1, 1, 2, 3, 3, 4, 19, 4, 5, 5]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[12, 1, 1, 2, 2, 4, 2, 4, 3, 4, 6, 5, 4, 9, 2, 5, 4, 5, 2]], [[-10, -6, 5, 5, -10, 8, 12, 12, 0, -5, 9, -5, 20, 20, 20, 12, 12, 20]], [[1, 2, 3, 2, 1, 20, 4, 5, 7, 6, 7, 8, 18, 9, 10, 3, 15, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 8, 18, 19]], [[12, 0, 1, 2, 3, 3, 4, 1, 5, 4, 4, 16, 5, 5, 2, 5, 12, 5, 2, 4, 2]], [[1, 3, 5, 4, 7, 9, 11, 13, 11, 15, 17, 19, 5, 1]], [[1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 16, 3, 5, 3]], [[12, 1, 15, 5, 2, 9, 2, 4, 4, 5, 5, 4, 2, 5, 4, 2, 2]], [[1, 1, 2, 2, 2, 3, 3, 3, 1000, 4, 4, 5, 5, 3, 4, 5]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 18, 10, 9, 10, 3, 12, 14, 16, 18, 19, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 19, 999]], [[1, -10, 1, 1, 2, 2, 2, 3, 3, 4, 5, 4, 5, 5, 5, 2, 4, 2, 2, 5]], [[1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 1, 1, 2, 2, 3, 3, 5, 4, 5, 5, 5, 3]], [[12, 1, 1, 2, 3, 4, 2, 4, 3, 4, 6, 5, 4, 9, 2, 5, 4, 5, 2, 2]], [[1, 1, 4, 1, 1, 2, 3, 3, 4, 19, 4, 5, 5, 5, 1]], [[1, -10, 1, 1, 2, 2, 4, 4, 2, 5, 4, 5, 5, 18, 4, 4]], [[-30, 10, 10, 10, 10, 10]], [[12, 1, 3, 1, 2, 5, 2, 3, -10, 4, 4, 5, 4, 2, 4, 4, 2, 2]], [[12, 1, 1, 2, 2, 3, 4, 2, 4, 3, 4, 5, 5, 4, 4, 2, 20, 4, 5, 5, 20]], [[1, 3, 5, 4, 4, 1000, 3, 7, 9, 11, 13, 15, 19, 3]], [[0, 1, 3, 5, 7, 9, 11, 1000, 13, 10, 1000, 19, 13, 1000]], [[1, 8, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 3, 5, 1]], [[0, 1, 3, 5, 7, 9, 21, 18, 15, 19, 13, 11]], [[1, 1, 2, 6, 11, 3, 5, 2, 4, 4, 5, 5, 15, 2, 5, 4, 12, 12, 4]], [[2, 2, 2, 2, 3, 2, 3, 2, 1, 1, 2]], [[0, 1, 3, 5, 7, 9, 20, 11, 13, 15, 17, 19, -9, 13, 7, 11]], [[1]], [[1, 2, 3, 4, 5]], [[1, 2, 3, 2, 4, 3, 5, 5, 6, 6, 7, 8, 8, 8, 9, 9, 9, 9]], [[-1, -2, 3, 4, -1, 0, -2]], [[1, -1, 0, 1, -1, 0]], [[0, 0, 0, 0, 0, 0]], [[1, 2, 2, 1, 4, 4, 4, 4]], [[10, 10, 10, 10, 9, 9, 10, 11, 10]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[10, 10, 10, 10, 10, 10]], [[2, 2, 2, 2, 2, 2, 2, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3]], [[1, 3, 5, 7, 8, 11, 13, 15, 1000, 13]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 18]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20, 11]], [[2, 2, 2, 3, 2, 2, 2, 1]], [[10, 11, 10, 10, 10, 10, 10, 10]], [[1, 3, 5, 7, 9, 13, 15, 17, 19]], [[10, 10, 10, 9, 9, 10, 10, 10]], [[10, 10, 10, 10, 10]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1]], [[10, 0, 10, 10, 9, 10, 10, 10, 9]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[10, 11, 10, 13, 10, 10, 10, 10]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12]], [[1, 3, 5, 7, 9, 11, 13, 15, 18, 19, 18]], [[1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 12, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[0, 10, 10, 9, 10, 8, 10, 10, 5, 10]], [[0, 10, 10, 9, 10, 8, 10, 10, 5, 10, 10]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 0, 12]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, -10]], [[1, 3, 7, 8, 11, 13, 15, 1000, 13]], [[1, 2, 5, 7, 9, 11, 13, 15, 17, 19, 19]], [[10, 11, 10, 13, 10, 10, 10, 11]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20]], [[-10, 5, 2, 3, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, -10, 2]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2]], [[10, 11, 10, 10, 10]], [[2, 2, 2, 2, 2, 2, 2, 0, 1]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11]], [[1, 1, 2, 2, 9, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 3, 5, 18, 7, 9, 11, 13, 15, 18, 19, 18]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 6]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, -5, 0, -5, 9, -5, 20, 20, 7, 12]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 2]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2]], [[1, 1, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 18, 15, 16, 17, 18, 18, 19, 20, 12]], [[0, 10, 10, 9, -5, 11, 8, 10, 10, 5, 10, 10, 10]], [[10, 0, 10, 10, 9, 10, 10, 10, 10]], [[2, 2, 2, 2, 2, 2, 18, 1]], [[1, 3, 5, -5, 7, 9, 11, 13, 15, 18, 19, 18]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 19, 20]], [[10, 11, 10, 10]], [[10, 11, 13, 10, 10, 10, 11, 13]], [[20, 10, 10]], [[1, 2, 3, 2, 1, 4, 5, 7, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[10, 11, 10, 13, 10, 10, 10, 11, 10]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2]], [[10, 0, 10, 10, 9, 9, 10, 6, 10, 10]], [[2, 2, 4, 3, 2, 2, 2, 1]], [[10, 11, 10, 13, 10, 10, 11, 10, 11, 10]], [[10, 10, 10, 11, 10, 10, 10]], [[3, 5, -5, 7, 9, 0, 11, 13, 15, 18, 19, 18]], [[7, 10, 10, 10, 10, 9, 9, 10, 11, 10]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2]], [[10, 10, 10, 10, 9, 9, 11, 10, 10]], [[0, 10, 10, 9, 10, 8, 10, 10, 17, 0, 10, 10]], [[10, 0, 10, 10, 9, 9, 10, 10, 10]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 10, 10, 11, 12, 12, 12, 10, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 16, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3]], [[10, 0, 10, 10, 9, 10, 10, 10, 10, 10]], [[10, 0, 10, 10, 9, 10, 10, 10, 10, 15, 10, 10]], [[1, 1, 3, 3, 4, 3, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 18, 16, 17, 18, 18, 19, 20]], [[1, 1, 2, 2, 9, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5]], [[10, 11, 9, 13, 10, 10, 10, 11, 13]], [[1, 1, 3, 3, 10, 4, 3, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 18, 16, 17, 18, 18, 19, 20]], [[1, 1, 1, 3, 2, 2, 2, 3, 3, -10, 4, 4, 4, 5, 5, 5]], [[1, 3, 5, 7, 8, 11, 13, 13]], [[10, 0, 10, 10, 9, 9, 10, 10, 10, 10, 9]], [[10, 0, 10, 9, 9, 10, 10, 10, 10, 9, 10]], [[1, 3, 5, 18, 7, 9, 11, 13, 15, 18, 19, 16, 18]], [[10, 10, 10, 10, 13, 10]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 18]], [[0, 10, 10, 9, -5, 11, 8, 10, 10, 5, 10, 10, 10, 10]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 9]], [[10, 0, 10, 9, 9, 10, 10, 10, 10, 15, 10, 10]], [[1, 3, 7, 8, 11, 13, 15, 1000, 10, 13]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, -10]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, -10]], [[1000, 10, 10, 10, 10, 9, 9, 11, 10, 10, 11, 10]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 20, 20]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 19, 20, 15]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 19, 20, 18]], [[10, 10]], [[0, -30, 10, 9, 10, 8, 10, 10, 17, 0, 10, 10]], [[10, 10, 10, 10, 9, 9, 11, 10, 11, 10, 11]], [[1, 3, 5, 7, 9, 13, 15, 16, 5, 19]], [[0, 10, 9, 10, 9, 8, 10, 10, 5, 10, 10, 5]], [[10, 0, 10, 9, 9, 10, 10, 10, 10, 15, 10, 10, 10]], [[1, 2, 5, 13, 7, 9, 11, 13, 15, 17, 19, 19, 13]], [[2, 2, 4, 3, 4, 2, 2, 2, 1]], [[0, 10, 10, 9, 10, 8, 10, 10, 17, 0, 10, 10, 10]], [[1, 3, 7, 8, 11, 13, 10, 15, 1000, 10, 13, 10, 13]], [[14, 10, 11, 10, 10]], [[10, 0, 10, 9, 9, 10, 10, 10, 10, 10, 10, 10]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 20, 20, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 20]], [[10, 0, 11, 10, 9, 9, 10, 6, 10, 10]], [[10, 11, 10, 13, 10, 9, 10, 11, 10, 10]], [[10, 0, 11, 10, 9, 9, 10, 6, 10, 10, 0]], [[1, 1, 1, 3, 2, 2, 2, 3, -10, 4, 4, 4, 5, 5, 5]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 6, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 19, 20, 18]], [[1, 3, 5, -5, 7, 9, 11, 13, 15, 18, 18]], [[2, 2, 2, 2, 2, 2, 2]], [[1, 3, 5, 7, 9, 13, 15, 16, -30, 5, 19]], [[1, 2, 3, 16, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 19, 10, 20, 18, 12]], [[1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12]], [[1, 1, 2, 2, 9, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 3, 2]], [[1, 3, 7, 8, 11, 15, 1000, 13]], [[1, 3, 5, 7, 8, 10, 13, 15, 1000, 13]], [[10, 11, 10, 13, 11, 10, 10, 11, 10, 11, 10, 10]], [[1, 2, 3, 8, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 3, 15, 16, 17, 18, 18, 19, 20, 9]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[0, 10, 10, 9, -10, 10, 10, 10, 9]], [[1, 2, 3, 3, 3, 11, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 10, 11, 12, 12, 12, 13, 14, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20]], [[18, -10, 5, 2, 7, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 1000, -10]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 10, -30, 12, -10, 0]], [[1, 6, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[10, 0, 10, 10, 9, 10, 10, 10, 10, 10, 10]], [[1, 3, 5, 7, 12, 11, 13, 15, 18, 19, 18]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 6, 12, 12, 12, 13, 13, 13, 14, 15, 16, 17, 18, 19, 20, 18, 13]], [[10, 0, 10, 9, 10, 10, 10, 10, 10, 9]], [[3, 5, -5, 7, 9, 0, 11, -30, 13, 15, 18, 19, 18, 9]], [[10, 0, 9, 9, 10, 10, 10, 10, 15, 10, 10, 10]], [[-10, 5, 2, 7, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 0, 20, 20, -30, 1000, -10]], [[3, 5, -5, 7, 9, 0, 20, 11, 13, 15, 18, 19, 0, 18, 18]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 2, 7]], [[1, 6, 2, -5, 3, 16, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 19, 10, 20, 18, 12, 16, 18]], [[1, 9, 6, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 1]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 18, 19, 20, 7, 10, 20, 16, 18, 12, 12]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2]], [[1, 3, 5, 7, 9, 13, 15, 16, -30, 5, 6]], [[1, 2, 3, 16, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 9, 16, 18, 19, 20, 18, 10, 12, 7, 14, 16, 10, 18, 19, 3, 20, 7, 19, 10, 20, 18, 12]], [[1, 2, 19, 5, 7, 9, 11, 13, 15, -5, 19, 19]], [[1, 3, 5, 18, 7, 9, 11, 13, 15, 18, 19, 18, 18]], [[10, 0, 10, 9, 8, 9, 10, 10, 10, 10, 15, 10, 10, 10]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1]], [[1, 6, 2, 2, 2, 3, 3, 3, 4, 4, 9, 5, 5, 5]], [[1, 3, 4, 7, 1001, 13, 15, 16, -30, 5, 19]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 20, 15]], [[10, 11, 13, 10, 10, 10, 11, 13, 13]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 2, 3]], [[10, 11, 10, 10, 10, 10]], [[10, 11, 10, 13, 10, 10, 1, 11, 10, 11, 10, 10]], [[10, 11, 10, 13, 10, 10, 10, 10, 10]], [[1, 3, 5, 7, 13, 9, 13, 15, 16, -30, 5, 6]], [[7, 10, 10, 10, 10, 9, 9, 10, 11, 10, 9]], [[0, -30, 11, 10, 9, 10, 8, 10, 10, 17, 0, 10, 10]], [[0, 10, 10, 9, 10, 10, 10, 10, 10, 10]], [[1, 6, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20]], [[10, 0, 10, 9, 8, 9, 10, 15, 10, 10, 10, 15, 10, 10, 10]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2]], [[8, 1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 6, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 19, 20, 18]], [[-10, 5, 3, 5, -10, 8, 12, 12, 1, -5, 9, -5, 19, 20, -30, 12, -10, 2]], [[10, 10, 10, 10, 6, 10]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, -30, -10]], [[2, 1, 2, 2, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, -4, 14, -30, 12, -10]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 6]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 20, 20, 10, 4]], [[5, 2, 5, -10, 8, 12, 12, 1, 0, -5, -5, 20, 20, -30]], [[1, 1, 2, 2, 9, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 3, 2, 3, 1]], [[1, 3, 5, 7, 13, 15, 16, -30, 5, 19]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 16, 5, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3]], [[1, 1, 1, -4, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[10, 11, 13, 10, 10, 10, 11, 9, 13]], [[1, 6, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 1]], [[1, 2, 3, 16, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 19, 10, 20, 18, 12, 3]], [[10, 0, 9, 9, 10, 10, 10, 10, 15, 10, 10]], [[10, 10, 11, 10, 12, 10]], [[3, 5, -5, 7, 9, 0, 6, 11, -30, 13, 15, 18, 19, 18, 9]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 19, 20, 15]], [[999, 5, 3, 5, -10, 8, 12, 12, 1, -5, 9, -5, 19, 20, -30, 12, -10, 2]], [[1, 3, 5, 18, 7, 9, 11, 11, 13, 15, 18, 19, 18, 18]], [[10, 10, 10, 10, 9, 8, 11, 10, 10]], [[3, 5, -5, 7, 9, 0, 20, 11, 13, 16, 18, 19, 0, 15, 18]], [[1, 18, 3, 2, 1, 4, 5, 7, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 3, 14, 16, 10, 18, 20, 7, 10, 20, 16, 18, 12]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20, 11, 18]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20, 5]], [[10, 10, 10, 10, 9, 9, 10, 11, 10, 11]], [[1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 15, 16, 17, 18, 18, 19, 0, 12]], [[7, 10, 6]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 6, 20, -30, 12, -10]], [[7, 8, 5, 10, 6, 6]], [[1, 2, 19, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20]], [[3, 5, -5, 7, 9, 0, 6, 11, -30, 13, 15, 18, 19, 18, 9, 13, 0]], [[11, 10, 3, 7, 8, 11, 13, 10, 15, 1000, 10, 13, 10, 13]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, -4, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2]], [[1, 9, 6, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 1, 9]], [[-10, 5, 2, 7, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 0, 20, 20, -30, 14, -10, 11, -10]], [[2, 2, 14, 2, 2, 2, 2]], [[3, 10, 0, 10, 9, 9, 10, 10, 10, 10, 9, 10]], [[7, 10, 10, 10, 10, 9, 9, 10, 11, 10, 9, 10, 9]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, -30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2]], [[7, 10, 10, 10, 10, 9, 9, 10, 11, 10, 9, 10, 9, 10]], [[0, -30, 10, 9, 10, 8, 10, 10, 17, 0, 10, 10, 10]], [[10, 10, 10, -4, 6, 10, 10]], [[1, 3, 4, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 11, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 19, 20, 18, 1]], [[2, 1, 2, 2, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 4]], [[1, 3, 5, 7, 8, 13, 10, 13, 15, 1000, 13]], [[10, 11, 10, 13, 10, 10, 0, 10, 11]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 13, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 1, 2, 9, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 3, 2, 3]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 4, 8]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 19]], [[1, 3, 5, 7, 12, 11, 13, 15, 18, 19, 18, 18]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 6, 12]], [[1, 2, 3, 2, 1, 3, 4, 6, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 2, 7]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 18, 19, 20, 7, 10, 20, 16, 18, 12, 12, 20]], [[10, 0, 10, 10, 9, 9, 10, 10]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[10, 10, 11, 10, 12, 10, 10, 12, 11]], [[1, 2, 3, 2, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 14, 16, 18, 19, 20, 18, 10, 1000, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12]], [[1, 3, 5, 7, 13, 9, 13, 15, 16, -30, 5, 6, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 10, 10, 11, 12, 12, 12, 10, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 20, 13]], [[1, 2, 1, -4, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[3, 5, -5, 7, 9, 0, 6, 11, -30, 8, 13, 15, 18, 19, 18, 9]], [[10, 10, 10, 6, 10]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, -5, 0, -5, 9, -5, 20, 20, 7, 12, -10]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 19, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 12, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[2, 1, 2, 2, 2, 2, 2, 5, 999, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3]], [[999, 5, 3, 5, -10, 8, 12, 12, 1, -5, 5, -5, 19, 20, -30, 12, -10, 2]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 13, 18, 6, 12, 12, 12, 13, 13, 13, 14, 15, 16, 17, 18, 19, 20, 18, 13]], [[10, 0, 9, 9, 10, 10, 10, 10, 10, 10]], [[2, 1, 2, 1000, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 1, 2, 2, 3]], [[10, 0, 11, 10, 9, 9, 10, 1001, 10, 10]], [[7, 8, 5, 10, 6]], [[1, 3, 5, -5, 7, 9, 11, 13, 15, 18, 19, 18, 13]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 6, 12, 12, 12, 13, 13, 13, 14, 15, 16, 17, 18, 19, 20, 18, 13, 5]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, -10, 8]], [[7, 10, 10, 10, 10, 9, 9, 9, 10, 11, 10, 9]], [[1, 3, 5, 18, 7, 9, 11, 11, 13, 15, 18, 19, 20, 18, 18, 1]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 6, 10, 20, 16, 18, 12, 6, 12, 20, 7]], [[1, 3, 5, -5, 7, 9, 3, 11, 13, 15, 18, 18, 18, 18]], [[1, 3, 6, 7, 8, 11, 13, 13]], [[10, 10, 10, 11, 9, 9, 10, 11, 10]], [[10, 11, 10, 13, 10, 10, 10, 11, 10, 13]], [[1, 2, 19, 5, 7, 9, 11, 13, 15, -5, 19, 19, 13]], [[999, 5, 3, 5, -10, 8, 12, 12, 1, -5, 5, -5, 19, -6, 20, -30, 12, -10, 2]], [[1, 2, 5, 13, 7, 9, 11, 13, 15, 17, 19, 19, 13, 11]], [[1, 2, 3, 2, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 6, 10, 10]], [[10, 10, 10, 9, 9, 11, 10, 11, 10, 11]], [[1, 3, 5, 7, 9, 13, 15, 16, -30, 5, 6, 9, 6]], [[1, 3, 5, 7, 13, 15, 16, -30, 5, 20]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 6, 20, -30, 12, -10, 5]], [[1, 3, 5, 7, 8, 11, 13, 13, 13]], [[1, 2, 3, 2, 2, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 1, 7, 3, 14, 16, 18, 19, 20, 7, 10, 20, 16, 18, 12, 12]], [[3, 5, -5, 7, 9, 0, 20, 11, 13, 15, 18, 19, 0, 18, 18, 13]], [[-11, 5, 2, 5, -10, 8, 12, 12, 1, 0, 0, -5, 20, 20, 9, -30, 12]], [[2, 2, 4, 3, 4, 2, 2, 2, 1, 2]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 4, 8]], [[1, 2, 3, 16, 1, 3, 4, 5, 7, 6, 7, 8, 9, 10, 3, 12, 15, 16, 18, 19, 20, 18, 10, 12, 7, 14, 16, 10, 18, 19, 20, 7, 19, 10, 20, 18, 12]], [[1, 2, 3, 3, 4, 16, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 2, 3, 18, 1, 4, 5, 7, 6, 7, 8, 9, 10, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 1001, 18, 16, 18, 19, 20, 7, 10, 20, 16, 18, 12, 12]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 18, 6, 12, 12, 12, 13, 13, 13, 16, 14, 15, 16, 17, 18, 19, 20, 18, 13, 12]], [[10, 11, 11, 10, 12, 10]], [[0, 10, 10, 9, 10, 8, 4, 10, 10, 5, 10, 10]], [[1, 3, 7, 8, 11, 13, 10, 15, 1000, 10, 13, 10, 13, 1]], [[3, 5, -5, 7, 9, 21, 0, 20, 11, 13, 15, 18, 19, 0, 18, 18, 13]], [[1, 2, 5, 13, 7, 9, 11, 13, 17, 19, 19, 13]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 9, 1001, 9, 9, 10, 11, 19, 6, 12, 12, 12, 13, 13, 13, 16, 14, 15, 16, 17, 18, 19, 20, 18, 13, 12]], [[-10, 5, 2, 5, -10, 8, 6, 13, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30]], [[1, 3, 5, 7, 12, 11, 13, 15, 19, 18, 5]], [[1, 2, 3, 1, 4, 5, 7, 6, 7, 8, 9, 12, 14, 16, 18, 19, 20, 18, 10, 12, 7, 3, 14, 16, 8, 10, 18, 19, 20, 7, 10, 20, 16, 18, 12, 6]], [[1, 3, 5, 18, 7, 9, 11, 13, 15, 18, 19, 18, 15]], [[1, 3, 5, 7, 9, 11, 13, 19, 15, 18, 19, 18]], [[1, 2, 3, 3, 4, 16, 4, 5, 15, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 17, 11, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[10, 10, 10, 10, 9, 9, 11, 10, 10, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 10, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[7, 10, 10, 10, 10, 9, 9, 10, 11, 10, 9, 10, 10, 9, 10, 10]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 7, 7, 8, 9, 9, 9, 9, 10, 11, 18, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 18]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, 9, -5, 20, 20, -30, -10]], [[3, 5, -5, 7, 9, 21, 0, 20, 11, 13, 15, 18, 19, 0, 11, 18, 18, 13]], [[1, 13, 3, 5, 7, 8, 11, 13, 13, 13, 5, 5]], [[1, 2, 19, 3, 3, 3, 4, 4, 21, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20]], [[0, 10, 10, 9, -10, 10, 10, 19, 10, 9, -10]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12]], [[1, 17, 5, -5, 7, 9, 11, 13, 15, 18, 19, 18]], [[10, 10, 10, 10, 13, 999, 10]], [[0, 10, -6, 11, 10, 13, 10, 10, 0, 10, 11]], [[10, 10, 10, 10, 10, 9, 10]], [[1, 9, 6, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 1, 9, 5, 5]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 12, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 20]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 0, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, 9, -5, 20, 20, -30, 1, -10, -10]], [[1, 3, 5, 7, 13, 15, 16, 5, 19]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 6, 7, 8, 9, 21, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 4, 8, 8]], [[1, 3, 5, 7, 8, 13, 10, 13, 15, 1000, 13, 15]], [[2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, -30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2]], [[1, 1, 1, 3, 2, 2, 2, 3, -10, 4, 4, 5, 5, 5]], [[1, 1, 2, 2, 9, 2, 3, 3, 4, 4, 4, 5, 5, 5]], [[7, 10, 10, 10, 10, 9, 9, 9, 10, 11, 18, 10, 9]], [[1, 1, 3, 3, 4, 4, 5, 5, 5, 7, 8, 9, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 12, 11, 4]], [[10, 0, 4, 10, 9, 9, 10, 6, 10, 10, 0]], [[18, -10, 5, 2, 7, 5, -10, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 1000, -10, 1]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 17]], [[-10, 5, 2, 5, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 20, -30, 12, 20]], [[1, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 15, 16, 17, -11, 18, 18, 19, 20]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 18, 13, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20]], [[1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 8, 11, 20, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 4, 19, 20, 15]], [[10, 10, 10, 10, 19, 10, 15, 9, 10, 10]], [[1, 3, 5, -5, 7, 9, 11, 13, 15, 18, 18, 15]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 6]], [[1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 16, 1000, 18, 18, 19, 20, 11, 6]], [[2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2]], [[1, 3, 5, 7, 12, 11, 13, 15, 20, 18, 5]], [[10, 10, 10, 9, 1000, 9, 11, 10, 11, 10, 11]], [[1, 3, 5, 18, 13, 9, 11, 15, 18, 19, 18, 5]], [[10, 0, 10, 9, 10, 10, 10, 10, 10, 9, 9]], [[2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 2, 2, 2]], [[-10, 5, 2, 5, 1001, -10, 8, 12, 12, 1, 0, -5, 9, -5, 20, 7, -30, -10]]], "completion": "\nfrom typing import List\n\n\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"\n return list(dict.fromkeys(numbers))\n", "raw_completion": "```python\nfrom typing import List\n\n\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"\n return list(dict.fromkeys(numbers))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef remove_duplicates(numbers: List[int]) -> List[int]:\n \"\"\" From a list of integers, remove all elements that occur more than once.\n Keep order of elements left the same as in the input.\n >>> remove_duplicates([1, 2, 3, 2, 4])\n [1, 3, 4]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/27", "prompt": "\n\ndef flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"\n", "entry_point": "flip_case", "canonical_solution": "\n return \"\".join(map(lambda x: x.swapcase(), string))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate('Hello!') == 'hELLO!'\n assert candidate('These violent delights have violent ends') == 'tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS'\n", "contract": "\n assert type(string) == str, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["Hello!"], ["These violent delights have violent ends"]], "atol": 0, "plus_input": [["123abc"], ["Toggle Me"], ["Flipping cases is so easy!"], ["Flipping Cases Is So Easy!"], ["Python Is Fun"], ["toGGlE Me"], ["fLiP YOuR cAsE"], ["1234"], ["TOGGLE ME"], ["toggle me"], ["123toggle me4"], ["Togg"], ["totggle me"], ["tgoggle me"], ["PtoGGlE Meython Is Fun"], ["PtuoGGlE Meython Is Fun"], ["togglTOGGLE MEe me"], ["Flipping Cases Is So Eassy!"], ["1PtoGGlE Meython Is Fun234"], ["Fun"], ["12134"], ["FunFlippi ng Cases Is So Easy!"], ["12134TOGGLE ME"], ["Toggle toggle meMe"], ["1toggFlipping cases is so easy!le me2134TOGG"], ["tltoGGlE Megoggle me"], ["toGGlE e"], ["tltoGGlE Megoe me"], ["nbfLDUjAi"], ["toTOGGLE MEtggle me"], ["PtoFlipping cases is so easy!GGlE Meython Is Fun"], ["1toggFlipping cases is sotoTOGGLE MEtggle me easy!le me2134TOGG"], ["tgoggleFunFlippi ng Cases Is So Easy!me"], ["112134"], ["FunFlippFlipping cases is so easy!i ng Cases Is So Easy!"], ["112111213434"], ["1213112134abc"], ["1toggFlipping cases is sotoTOGGLE MEtggle me easy!le me2134TOGG"], ["PtoGGlE Meython Isu Fun"], ["PtuoGGlE Meytheon Is Fun"], ["etltoGGlE Megoe me"], ["togPtoGGlE Meython Isu Fungle me"], ["tgotggle me"], ["toTOGGLE ME112111213434tggle me"], ["ToggMle Me"], ["togPtoGGlE Meython Isu Fungle me12134"], ["gTogg"], ["toTe me"], ["TOGtltoGGlE Megoggle meGLE ME"], ["1PtoGGlE Meython Is FunTOGGLE ME234"], ["1toggFlipping cases is soto TOGGLE MEtggle me easy!le me2134TOGG"], ["PtoFlipping cases is so easy!hon Is Fun"], ["togPtoGGlE Meytho Fungle me"], ["1PtoGGlE Meython Is FutogPtoGGlE Meytho Fungle menTOGGLE ME234"], ["JmWn"], ["PtoFin"], ["1toggFlipping cases is sotoTOGGLE MEtgglePtoFlipping cases is so easy!hon Is Fun me easy!le me2134TOGgG"], ["1ptoggFlipping cases is sotoTOGGLE MEtggle me easy!leme2134TOGG"], ["1PtoGGlE Meython IFun234"], ["FunFlippFlipping cases is so easyTogg!i ng Cases Is So Easy!"], ["1ptoggFlipping cases is soto1toggFlPtoGGlE Meython Is Funme2134TOGgGTOGGLE MEtggle me easy!leme2134TOGG"], ["1PtoGFunFlippFlipping cases is so easy!i ng Cases Is So Easy!GlE Meython Is Fun234"], ["tgotgge me"], ["Fu123abcn"], ["1PtoGGlE Meython IFlipping Cases Is So Eassy!Fun234"], ["PtoGGlE Meython I su Fun"], ["1PtoGGlE Meython IFun23toggle me4"], ["gToggg"], ["tgotggFlipping Cases Is So Easy!e me"], ["TOGGGLE ME"], ["FunFlippFlipping casetgotggFlipping Cases Is So Easy!e mes is so easy!i ng Cases Is So Easy!"], ["1PtoGGlE Meytlhon Is FunTOGGLE ME234"], ["totggleme"], ["toTToggle toggle meMeOGGLE MEtgggle me"], ["12toTToggle toggle meMeOGGLE MEtgggle me134"], ["PtoFlipping cases is so easy!hon Isun"], ["oTog1PtoGGlE Meython IFun23toggle me4g"], ["togge me"], ["sFunFlippinbfLDUjAi ng Cases Is So Easy!"], ["Python Iss Fun"], ["ttotggl"], ["tolGGlE Me"], ["etoltoGGlgE lMegoe me"], ["1PtoGGlE Meython Is Futog123abcPtoGGlE Meytho Fungle menTOGGLE ME234"], ["1toggFlipping cases is sotoTOGGLE MEtgglePtoFlicpping cases is so easy!hon Is Fun me easy!le me2134TOGgG"], ["1PtoGGlE Me34"], ["1ptoggFlipping cases is sotoTOGGLE MEtggle me easy!leme211toggFlipping cases is so easy!le me2134TOGG34TOGG"], ["FunFlippi ng Cases Is So Ea1toggFlipping cases is sotoTOGGLE MEtggle me easy!le me2134TOGGsy!"], ["qJzU"], ["ggleme"], ["etoltoGGgE lMegoe me"], ["tltoGGlE Megoggle mEe"], ["1PtoGGlE Meython IFlipping Cases Is So Eassy!Fun2qJzU34"], ["Python hIs Fun"], ["1121PtoGGlE4"], ["TogMle Me"], ["Fu121ptoggFlipping cases is sotoTOGGLE MEtggle me easy!leme2134TOGG3abcn"], ["FunFlippFlipping cases is so easy!i Cases Is So Easy!"], ["ttotgtoGGlE Megl"], ["PythoPtoGGlE Meython I su Funn Iss Fun"], ["AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["1234567890"], ["The Quick Brown FOX JUMPS Over the lazy dog"], ["tHe quIck bROwn fOX jUMPed over the LAZY DOG"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no."], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["tHe quIck bROwn fOX DOG"], ["Quick"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0443\u043a\u0440\u0430\u043b"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u0443\u043a\u0440\u0430\u0443\u043a\u043b"], ["\u0443\u043a\u0440\u0430\u043b\u0430Quick"], ["tHe quIck bROwn fOX DO\u041a\u043b\u0430\u0440\u0430"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["tHe quIck bROwn fOX jUMPed over the ULAZY DOG"], ["tHe quIck bROwn fOOX DOG"], ["1234656890"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["1portugu\u00e9s?234567890"], ["\u03ba\u03b1\u03b3\u1f7c\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["The Quick Brown FOX JUMPS Over ttHe quIck bROwn fOX jUMPed over the LAZY DOGe lazy dog"], ["\u0443\u043a\u0440\u0430\u043b\u0430Quic"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u043b\u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b \u0430\u0440\u043d\u0435\u0442"], ["DOGe"], ["\u0443\u043a\u0440\u0430\u043b\u0430"], ["jUMPed"], ["\u0443Quick"], ["jUMePPed"], ["\u041a"], ["jUeMePP"], ["tHe qILAZY\u0442DOG"], ["\u0443\u043a\u0440\u0430\u043b\u0430Qu\u043a\u043b\u0430\u0440\u043d\u0435\u0442ck"], ["\u041a\u0430\u0440\u043b\u0430"], ["\u098f\u0995\u099f\u09bf"], ["\u041a\u0430\u0440\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b\u0430fOOX"], ["\u041a\u0430\u0440\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["ABCDEFGHIJKLMNOPQRSTUVWtheXYZabcdefghijklmnopqrstuvwxyz"], ["\u03bc\u03c7\u1fc3"], ["tHe q\u0989\u09a6\u09be\u09b9\u09b0\u09a3uIck bROwn fOX jUMPed over the LAZY DOG"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["espa\u00f1ol?"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["AaBbccDEfFgHiIjJKkLMmnnoOPtpqQrRSstTuUVvwWXxyYZz"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 LAZY\u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440 \u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["e?spa\u00f1ol?"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00dc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u0440\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["The Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0443\u0443\u043a\u0440\u0430\u0443\u043a\u043b"], ["\u00ef\u00ee\u00c1\u00cf\u00ce\u00f1\u00d1\u00e0\u0443\u043a\u0440\u0430\u0430\u043b\u0430\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u0430\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["AaBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b\u0430\u0440\u0430"], ["S\u00ed,"], ["portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["ABCDzEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrsz"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0"], ["The Quick BrTheown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["sKawvm"], ["\u041a\u0430\u0440\u043b"], ["\u099c\u098f\u099f\u09bf"], ["\u00ef\u00ee\u00c1\u00cf\u00ce\u00f1\u00d1\u00e0\u0443\u043a\u0440\u0430\u0430\u043b\u0430\u00c0\u00e1\u00c1\u00e9\u03c1\u03bc\u03ac\u03c7\u1fc3\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["tHe qu bROwn fOX DOG"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0"], ["\u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4"], ["\u00bfHabla"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["1po\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u0443\u043a\u0440\u0430\u043b\u0430Quic\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["12\u0443\u043a\u0440\u0430\u0430\u043b\u0443\u043034567890"], ["ABCDzEFGHIJKLMNOPQRklmnopqrsz"], ["S\u00edS,"], ["12\u0443\u043a\u0440\u0430\u0430\u043b\u0443\u0430434567890"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.The Quick Brown FOX JUMPS Over the lazy dog\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["\u043a\u043b\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u041a\u0430"], ["\u041a\u0430\u0440\u043bqILAZYno.\u0442DOG\u041a\u043b\u0430\u0440\u0430"], ["\u041a\u0430\u0440\u043bqILAZY\u043b\u0430 \u043a\u0440\u043d\u0435\u0442"], ["\u041a\u041a\u0430\u0440\u043b"], ["espa\u00f1oll?"], ["espa\u00f1ol\u0443\u043a\u0440\u0430\u043b\u0430Quic?"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443lazy\u043b\u0430\u0440\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["\u0430\u0440\u043d\u0435\u0442"], ["Brown"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043bJUMPS\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u0443lazy\u043b\u0430\u0440\u0430"], ["dotHe"], ["\u041ae\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.The Quick Brown FOX JUMPS Over the lazy dog\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["jUeMeP\u098f\u099f\u09bfPP"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u0442\u043a\u0440\u043d\u0435\u0442"], ["tHe jUeMePPquIcIk bROwn fOX DO\u041a\u043b\u0430\u0440\u0430"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm"], ["KX"], ["\u041a\u043b\u0430\u0440\u0430\u0430"], ["\u098f\u0995\u099f\u098f\u09bf"], ["\u098f\u0995\u099f\u09bf\u09bf"], ["12340656890"], ["esquIckpa\u00f1ol?"], ["ABCDzEFGHIJKOPQRSTUVWXYZabcdefghijklmnopqrsz"], ["\u0443\u043alazy\u0440\u0430\u043b"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03ba\u03b1\u03b3\u1f7c\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f1234567890\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u041a\u0430\u0430\u0440\u043b\u0430\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u00ef\u00ee\u00c1\u00cf\u00ce\u00f1\u00d1\u00e0\u0443\u043a\u0440\u0430\u0430\u043b\u0430\u00c0\u00e1\u00c1\u00e9\u03c1\u03bc\u03ac\u03c7\u1fc3\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00ee\u00d9\u00fc\u00dc"], ["tHe qu bROwn fOX f DOG"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poc\u098f\u099f\u09bf\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0"], ["\u0443Qu\u0443ick"], ["The Quick BrTheown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09ae\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u0442\u043b\u043b\u044b, \u0430\u0440 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["usted"], ["N\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03c1\u03b1\u03c4ABCDEFGHIJKLMNOPCQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u03c1\u03b1\u03c4ABCDEFGHIJKLMNOPCQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["ULAZY"], ["e?spa\u00f1ol?\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["1p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890"], ["\u0989\u09a6\u09be\u09b9\u09b0\u09a3"], ["\u0443\u043a\u0440\u0440\u0430\u043b"], ["e?spa\u00f1ol?\u041a\u0430\u0435\u0442"], ["\u043a\u043e\u0440\u0430\u043b\u043b\u044b,"], ["\u0443\u0443\u043a\u0440\u0430\u0443\u043a\u043b\u043b"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043be?spa\u00f1ol?\u041a\u0430\u0435\u0442\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], [",\u043a\u043e\u0440\u0430\u043b\u043b\u044b,"], ["nl"], ["\u0443\u043a\u0440\u0443\u0440\u0430\u043b"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u041a\u041a\u043b"], ["\u041a\u0430\u0440"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0995\u041a\u041a\u043bpoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["\u0443\u043alazy\u0440\u0430\u043b\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["ULAbROwnZY"], ["\u098f\u099f\u09bf \u098f\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u041a\u041a\u043b"], ["12\u0443\u043a\u0440\u0430\u0430\u043b\u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4\u0443\u0430345\u0443Quick67890"], ["sKa\u098f\u099ftHe jUeMePPquIcIk bROwn fOX DO\u041a\u043b\u0430\u0440\u0430\u09bf"], ["ABCDzEFGHIJKOPQRSTUVWXYZabcdqefghijklmnopqrsz"], ["12\u0443\u043a\u0440\u04302\u0430\u043b\u0443\u0430434567890"], ["ABCDzE\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0FGHIJKLMNOPQRklmnopqrsz"], ["\u041a\u0430\u0440\u041a\u0430\u043b \u0443tHe quIck bROwn fOX jUMPed over the LAZY DOG\u09b0\u0430\u043d\u0435\u0442"], ["portugu\u00e9s?"], ["\u041a\u043b\u0430\u0440\u0430"], ["\u043a\u043e\u0440\u0430\u0442\u043b\u043b\u044b,"], ["The"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoc.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd \u09b0\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["DON\u00e3o,Ge"], ["AapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz"], ["ABCDEFGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"], ["\u03ba\u03b1\u03b3\u1f7c\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044bportugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u043b\u0430\u0440\u044b"], ["JUMPS"], ["Brown\u041ae\u0430\u0440\u043b"], ["\u0443\u043a\u0440\u0430\u043be?spa\u00f1ol?\u041a\u0430\u098f\u099f\u09bf \u098f\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0435\u0442\u0430"], ["realmente"], ["JUMP\u03bc\u03c7\u1fc3S"], ["Qui\u0443\u043a\u0440\u0430\u0430\u043b\u0430ck"], ["\u041aOX"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043be?spa\u00f1ol?\u041a\u0430\u0435\u0442\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u0995\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf"], ["lazy"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043be?spa\u00f1ol?\u041a\u0430\u0435\u0442\u0430 \u043a\u043bpoco.\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0443\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0HeS\u00ed,\u043b\u0430\u0440\u0430"], ["esckpa\u00f1ol?"], ["tHe jUeMePP\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u098f\u099f\u09bf \u098f\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u043b\u0430\u0440\u0430"], ["1p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?2345678\u043090"], ["\u041a\u0430\u0440\u043b \u043b\u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u0440\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["qILAZY\u0442DOOG"], ["\u043a\u043e\u0995\u041a\u041a\u043bpoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["jUeMe\u098f\u099f\u09bfPP"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00f1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["\u043a\u043b\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.The Quick Brown FOX JUMPS Over the lazy dog\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm"], ["\u03b3\u0443\u043a\u0440\u0430\u043b\u0430Quic\u03bd\u03ce\u03bc\u03b7\u03bd"], ["AaBbccDEfFgHiIjJKkLMmnnoOPtpqQrRSstTuUVvwWsKa\u098f\u099f\u09bfXxyYZz"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0"], ["\u041a\u0430\u0440 \u043bqI1p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890LA\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["esquILAZY\u041a\u0430\u0440\u043b\u0430ckpa\u00f1ol?"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u0442\u043b\u043b\u044b, \u0430\u0440 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u0995\u09cd\u09a4 \u09cd\u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u0443\u043a\u0440\u0430\u043b\u0430Qu"], ["tHe quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz bROwn fOX f DOG"], ["\u03b3\u0443\u043a\u0440\u0430\u043b\u0430\u03b7Quic\u03bd\u03ce\u03bc\u03b7\u03bd"], ["quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz"], ["\u041a\u043b\u0430\u0440\u044b\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no."], ["AaBbThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0ccDkEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["\u041a\u041a\u0430\u0440\u043bDOGe"], ["\u098ftHe quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz bROwn fOX f DOG\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["gXGi\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442UdHu"], ["\u0443\u043alazy\u0440\u0430\u043b\u041a\u0430\u0440\u043b"], ["10234567890"], ["Bnrown"], ["ly"], ["\u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4\u0430\u0440"], ["UJPUMPS"], ["612340656890"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.The Quick Brown FOX JUMPS Over the lazy dog\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043b"], ["fOOX"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0435\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 LAZY\u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["ABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brsz"], ["AaBbccDEfFgHiIjJfrRSstTuUVvwWXxyYZz"], ["ABCDEFGHIJnKLMNOPQRSTUVWXYZabcdefguhijklmnopqrstuvwxyz"], ["\u0443\u043a\u0440\u0440\u0430\u0430\u043b\u0443\u043b"], ["Qui\u0443cck"], ["\u041a\u0430\u0440\u043b \u0443 \u0430\u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u044b \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u043d\u0435\u0442"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00f1\u00e0\u00ef\u00c0\u00e1\u00c1\u00e9\u00c9\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd \u09b0\u0430\u0440\u043b\u0430 \u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u043a\u043e\u0440\u0440\u0430\u043b\u043b\u044b,"], ["\u041a\u0430\u0440\u041a\u0430\u043b"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfun\u03bc\u03b11234656890\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0440\u041a\u0430\u041a\u0440"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442UdHu"], ["\u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4"], ["1234\u041a\u043b\u0430\u0440\u044b\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no.6562890"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfun\u03bc\u03b112346568290\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["esquIL\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442AZY\u041a\u0430\u0440\u043b\u0430ckpa\u00f1ol?"], ["\u041a\u0440\u044b\u0443\u043a\u0440\u0440\u0430\u043b"], ["e?spa\u00f1ol?\u041aULAbROwnZY\u0430\u0435\u0442"], ["e?spa\u00f1ol?\u041aULAbROwnZY\u0430\u0435"], ["ABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brsz"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u043a\u043b\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf \u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u09cd\u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["tHe quIck bROwn fN\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03c1\u03b1\u03c4ABCDEFGHIJKLMNOPCQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u03ad\u03bf\u03bc\u03b1\u03b9OX DOG"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u0440\u043d\u0435\u0442"], ["\u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf"], ["FOX"], ["reamlmente"], ["jUeM\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442ePP"], ["dog\u098f\u098f\u099f\u09bf"], ["\u03ba\u03b1\u03b3\u1f7c\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u04431p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?2345678\u043090\u043d2\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b \u0443 \u0443\u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd \u09b0\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["tHe quIck \u0443\u043a\u0440\u0430\u043b\u0430QuickbROwn fOX DOG"], ["BroS\u00edS,n"], ["The Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0"], ["KXX"], ["\u098f\u099f\u09bf \u098f\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099fAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz\u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["reamlmen\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4"], ["BnroABCDzEFGHIJKLMNOPQRklmstTuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brszwn"], ["12\u0443\u043a\u0440\u0430\u0430\u043b\u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4\u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0443\u0430345\u0443Quick67890"], ["\u0443\u043a\u0440\u0430\u043b\u0430Qu\u043a\u043b\u0430\u0440\u043d\u0443\u0435\u0442ck"], ["jUeM\u041a\u0430\u0440\u043bdog\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442ePP"], ["\u0443\u043a\u0440\u0430\u043be?spa\u00f1ol?\u041a\u0430\u098f\u099f\u09bf"], ["\u041a\u0430\u0440 \u043bqI1\u043ap8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890\u0440LA\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfun\u03bc\u03b112346568904\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0443\u043alazy\u0440\u0430\u0430\u043b"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0440e?spa\u00f1ol?\u041a\u0430\u0435\u0442\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09c7\u09b7\u09c7\u09a4\u09cd\u09b0wvm0"], ["ThTe"], ["\u1f15\u03bb\u03b5 \u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfun\u03bc\u03b112346568904\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u0443\u043a\u0440\u043b\u0430\u0440\u0430\u03bf\u03bc\u03b1\u03b9"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00f1\u00e0\u00ef\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u0430\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u00c0\u00e1\u00c1\u00e9\u00c9\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["BrTheown"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4"], ["\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00f1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c0\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00f2\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["DOG\u043b\u0430\u0440\u0430e"], ["\u041a\u0430\u0440\u043b\u0430\u044b"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u03c7\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03ba\u03b1\u03b3\u1f7c\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["DOGe\u03c1\u03bc\u03ac\u03c7\u03c7\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u1fc3"], ["Qui\u0430\u0430\u043b\u0430ck"], ["Thewn FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["tHe quIck bROwn fOX DO\u041a\u03b3\u0443\u043a\u0440\u0430\u043b\u0430\u03b7Quic\u03bd\u03ce\u03bc\u03b7\u03bd\u043b\u0430\u0440\u0430"], ["esquILAZY\u041a\u0430\u0440\u043b\u0430ck?"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09ae\u09c1\u09ae\u0995\u09cd\u09a4"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijkClmnopqrstuvwxyz"], ["llsKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm"], ["\u098fthe\u0995\u099f\u09bf\u09bf"], ["\u041a\u0440\u044b\u0443\u043a\u0440\u0430\u043b\u0430Quic"], ["\u03c1\u03bc\u03ac\u03c7\u03c7\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u1fc3"], ["re\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 "], ["tHe quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUVvwWXxyYZz bROwn fOX f RDOG"], ["espa\u00f1\u00f1ol?"], ["\u0443\u0443\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm\u043a\u0440\u0430\u0443\u043a\u043b\u043b"], ["esckpa\u00f1ol?e?spa\u00f1ol?\u041aULAbROwnZY\u0430\u0435"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430"], ["The Quick Brown FOX \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9JUMPS Over the lazy dog"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09b9\u09a4\u09b0"], ["\u0995p\u09aeo"], ["\u0995po\u041a\u043b\u0430\u0440\u044b\u00bfHablaco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09ae\u09c1\u09ae\u0995\u09cd\u09a4"], ["jUeM\u041a\u0430\u0440\u043b"], ["ABCDEFAaBbThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0ccDkEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZzGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"], ["N\u1f15\u03bb\u03b5\u03bd\u03b1"], ["ABCDEFGHIJnKLMNOPQRSTUVWXYZabcdefg\u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4hijklmnopqrstuvwxyz"], ["RDOG"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09aeThe Quick Brown FOX \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9JUMPS Over the lazy dog\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["The Qu\u043b\u0430ick Brown FOX JUMPS Over ttHe quIck bROwn fOX jUMPed over the LAZY DOGe lazy dog"], ["N\u00e3o,"], ["sKa\u098f\u099ftHe"], ["\u098f\u0995\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf"], ["1port\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9ugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0"], ["\u041a\u0430\u0440\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430"], ["\u0443\u0443\u043a\u0440\u043b\u043b"], ["tHe jUeMePP\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u098f\u099f\u0443Qu\u0443ick\u09bf \u098f\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4ABCDEFGHIJnKLMNOPQRSTUVWXYZabcdefg\u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4hijklmnopqrstuvwxyz \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u043b\u0430\u0440\u0430"], ["portugu\u00e9\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u043b\u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b \u0430\u0440\u043d\u0435\u0442s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic"], ["\u0430\u0440\u043d\u0435\u0442s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u0430\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9Quic"], ["ABCDzE\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09bf\u09b0FGHIJKLMNOPQRklmnopqrsztugu\u00e9s?234567890"], ["DO\u041a\u043b\u0430\u0440\u0430\u09bf"], ["\u0430\u0440"], ["The Quick BrTheown FOX JUMP\u03bc1porvtugu\u09bf\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u043a\u043e\u043e\u0440\u0430\u043b\u043b\u044b,"], ["ABCDEFGHIJnKLMNOPQRS\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00dc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcTUVWXYZabcdefguhijklmnopqrstuvwxyz"], ["Qui\u0430\u0430\u043b\u0430\u0430ck"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZallsKa\u098f\u099f\u09bfbcdefghijklmnopq\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0rstuvwxyz"], ["DOGe\u03c1\u03bc\u03ac\u03c7\u03c7\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u03b1\u03c4\u03ad\u03bf\u03bf\u03bc\u03b1\u03b9\u1fc3"], ["\u041a\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442AZY\u041a\u0430\u0440\u043b\u0430ckpa\u00f1ol?"], ["qY\u0442DOOG"], ["\u0443\u043a\u0440\u0430\u043b\u0430Qu\u0430ic"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u098f\u0995\u099f\u098f\u09bf"], ["UL1port\u1f15\u03bb\u03b5\u03bd\u03b1AbROwnZY"], ["portugu\u00e9"], ["\u0995poco.\u09cd\u09b7\u09c7\u09b0\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4"], ["jUeMePPquIcIk"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b5\u03b3\u0443\u043a\u0440\u0430\u043b\u0430Quic\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0"], ["\u041a\u043b\u0430\u0440\u043bqILAZY\u0442portugu\u00e9\u041a\u0430\u0440\u043bDO\u0430"], ["\u043b\u0430\u0440\u0430jUeMe\u098f\u099f\u09bfPP"], ["\u03c1\u03b1\u03c4ABCDEFGHIJKLMNOPCQRSTUVWXYZabcdefghijklmnopq\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9rstuvwxyz\u03ad\u03bf\u03bc\u03b1\u03b9OX"], ["OX"], ["\u0995poco.\u041a\u0430\u0440\u043b\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0995\u09cd\u09b7\u09c7\u09a4\u09b0FGHIJKLMNOPQRklmnopqrsz"], ["ABCDEFAaBbThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0ccDkEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZzGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwnxyz"], ["\u0440tHe quIck bROwn fOX DOG\u041a\u0430\u041a\u0440\u03c1\u03bc\u03ac\u03c7\u03c7\u1fc3"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u098f\u0995\u099f\u098f\u09bf"], ["no.65.62890"], ["U\u098f\u00ef\u00ee\u00c1\u00cf\u00ce\u00f1\u00d1\u00e0\u0443\u043a\u0440\u0430\u0430\u043b\u0430\u00c0\u00e1\u00c1\u00e9\u03c1\u03bc\u03ac\u03c7\u1fc3\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dctHeY"], ["\u1fc3"], ["\u03bc\u03ac\u03c7\u1fc3"], ["jUeMePPquI,\u043a\u043e\u0440\u0430\u043b\u043b\u044b,cIk"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u0430\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u0440\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS\u00ed,\u043b\u0430\u0440\u0430\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["ABCDEFAaBbThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S VvwWXxyYZzGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwnxyz"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u03b3\u03bd\u03ceo\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0443\u043a\u0440\u043a\u0440\u0430\u0430\u043b\u0443\u043b"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9ugu\u00e9s?23456789sKa\u098f\u099f\u09bf"], ["\u098f\u09b0\u0995\u099f\u09bf"], ["\u041a\u0430\u0440 \u043bqI1p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?2345tHe quIck bROwn fOX DO\u041a\u043b\u0430\u0440\u0430\u0440\u043d\u0435\u0442"], ["xwnjQ"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442tHeS,\u043b\u0430\u0440\u0430"], ["\u03bc\u1fc3"], ["ABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSst\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430TuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brsz"], ["XfOOX"], ["\u041a\u0430\u0440 \u043bqI1p8o\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890LA\u0440\u0430 \u0443 \u041ag\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0rstuvwxyz"], ["fN\u1f15\u03bb\u03b5\u03bd\u03b1"], ["The Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u0430\u041a\u043b\u0430\u0440\u044b\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["esquIckp\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 \u041a\u0443\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442tThe Quick Brown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0HeS\u00ed,\u043b\u0430\u0440\u0430a\u00f1ol?"], ["AapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSsDO\u041a\u043b\u0430\u0440\u0430tTuUVvwWXxyYZz"], ["jMUeeMe\u098f\u099f\u09bfPP"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099fu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u098f\u0995\u099f\u098f\u09bf"], ["ABCDzE\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1opqrsztugu\u00e9s?234567890"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043bportugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u0435\u0442\u0430 \u043a\u043bpoco.\u0430\u0440\u043d\u0435\u0442"], ["tHe q\u0989\u09a6\u09be\u09b9\u09b0\u09a3uIck bROwn fOX jUMPed over th\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00f1\u00e0\u00ef\u1f15\u03bb\u03b5\u03bd\u03b1e LAZY DOG"], ["\u1f15\u03bb\u03b5\u03bd\u03b1"], ["ABCDEFAaBbThe QutHe quIck \u0443\u043a\u0440\u0430\u043b\u0430QuickbROwn fOX DOGick Brown FOX JUMP\u03bc\u03c7\u1fc3S VvwWXxyYZzGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwnxyz"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u0430\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u0430\u03ce\u03bc\u03b7\u03bd"], ["\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["jMUeeMe\u098f\u099fPP"], ["Qu\u0995p\u09aeoc.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0k"], ["\u0443tH\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u043a\u041a\u0430\u0440\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["porrrtugu\u00e9"], ["\u0995poco.\u041a\u0430\u0440\u043b\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0995\u09cd\u09b7\u09c7\u09a4\u09b0FGHIJKLMNOPQRklmnopqrsLz"], ["AaBbccDEfFgHiIjJKkLMm\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0nnoOPtpqQrRSstTuUVvwWXxyYZz"], ["BrTheowAaBbccDEfFgHiIjJKkLMmnnoOPtpqQrRSstTuUVvwWXxyYZzn"], ["por\u0995p\u0443\u0443\u043a\u0440\u0430\u0443\u043a\u043b\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic"], ["\u041a\u0443\u0430\u0440\u043b\u0430"], ["\u043a\u043e\u0995\u041a\u041a\u043bpoc\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0o.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u0430\u041a\u0430\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u043a\u043b\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf \u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cdABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSst\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430TuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brsz\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u09a3\u0989\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4"], ["UJP\u098f\u0995\u099f\u09bf\u09bfUMPS"], ["dtotHe"], ["\u00bfHabl\u041a\u0443\u0430\u0440\u043b\u0430a"], ["espa\u00f1\u00f1ol?\u09ae\u0995\u041a\u0430\u0440\u043b\u09a4\u0430\u0430\u0440"], ["\u098ftHe quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTuUROwn fOX f DOG\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["Thh"], ["portugABCDzE\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u0443\u043a\u0440\u0430\u043b\u0430\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09bf\u09b0FGHIJKLMNOPQRklmnopqrsztugu\u00e9s?234567890u\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u043a\u043b\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf \u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cdABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7AaBbccDEfFgHiThe Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u0430\u041a\u043b\u0430\u0440\u044b\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0IjJKkLMmnnoOPpqQrRSst\u043bqILAZY\u0442DOG\u041a\u043b\u0430\u0440\u0430TuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brsz\u09cd\u09a4 \u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0443\u043a\u0440\u043a\u0440\u0430\u0430\u043b\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u043b"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09ae\u09c1"], ["AB CDEFGHIJKLMNOPQRSTUVWXYZallsKa\u098f\u099f\u09bfbcdefghijklmnopq\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0rstuvwxyz"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03bc\u03c7\u1fc3\u03bc\u0440\u03b1\u03b9"], ["\u041a\u0430\u0440\u043bqILAZY\u043b\u0430"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bdesquIckp\u041a\u0430\u0440\u043b\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u0430\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["esquIckp\u041a\u0430\u0440\u043b"], ["\u0440tHefN\u1f15\u03bb\u03b5\u03bd\u03b1"], ["\u09a3\u0995p\u09aeoco.\u09cd\u09c7\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4"], ["e?spa\u00f1ol?\u041aULAbR?OwnZY\u0430\u0435\u0442"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099fu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoc\u0995o.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u098f\u0995\u099f\u098f\u09bf"], ["\u043b\u0443\u043a\u0440\u0430\u043b"], ["The Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u0430\u041a\u044b\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["n\u041a\u0430\u0440\u043b \u0443 \u0430\u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u044b \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u043b\u043d\u0435\u0442l"], ["\u03bc\u03c7BnroABCDzEFGHIJKLMNOPQRklmstTuUVvwWXxyYZz\u09a4\u09cd\u09b0\u0430\u043d\u0435\u0442\u041a\u0430\u0440\u043brszwn\u1fc3"], ["\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09cd\u09b0"], ["\u0430\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0430\u041a\u043b\u0430\u0440\u044b\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["The Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S O ver the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0443\u043a\u0440\u0443\u0443\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm\u043a\u0440\u0430\u0443\u043a\u043b\u043b\u0440\u0430\u0430\u043b\u0443\u043b"], ["The Quick Brown FOX \u1f15\u03bb\u03b5ABCDEFGHIJnKLMNOPQRSTUVWXYZabcdefguhijklmnopqrstuvwxyz\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9JUMPS Over the lazy dog"], ["\u09a3\u0989\u03b3\u03bd\u03ceo\u03bc\u03b7\u03bd\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4"], ["\u0995\u09cd\u09b7\u09c7\u09a4\u09b0nnoOPtpqQrRSstTuUVvwWXxyYZz"], ["\u098ftHe quAapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSstTu UROwn fOX f DOG\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["esp\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09aeThea\u00f1\u00f1ol?"], ["\u041a\u0430\u0440\u043bq\u098f\u0995\u099fu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4ILAZY\u043bY\u0430 \u043a\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cdDOGe\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4"], ["\u03bc\u03c7fOOX"], ["\u0989\u0989\u09a6\u09be\u09b9\u09b0\u09a3"], ["\u041a\u041a\u0430\u0430\u0440\u043bDOGe"], ["\u041a\u043b\u041a\u041a\u043b"], ["\u09bf\u098f\u0995\u099f\u098f\u09bf"], ["1\u043a\u043e\u0995\u041a\u041a\u043bpoc\u098f\u099f\u09bf234656890"], ["\u0443tH\u041a\u0430\u0440\u043b"], ["\u09b0\u0430\u0440\u043b\u0430"], ["\u03c1\u03b1\u03c4ABCDEFGHIJKLMNOPCQRSTUVWXYZabcdefghijTklmnopqrstuvwxyz\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442ePPQui\u0430\u0430\u043b\u0430ck"], ["tHe qqu bROwn fOX DOG"], ["\u03c1\u03bc\u03ac\u03c7\u1fc3"], ["The Quick BOrown FOX \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9JUMPS Over the lazy d"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u043be?spa\u00f1ol?\u041a\u0430\u0435\u0442\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b\u0430fOjUeM\u041a\u0430\u0440\u043bOX"], ["\u098f\u0995\u099f\u09bf\u098f\u09bf"], ["n\u041a\u0430\u0440\u043b \u0443 \u0430\u041a\u043b\u0430\u0440\u044b \u0443\u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u044b \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u043b\u043d\u0435\u0442l"], ["The Quick Brown FOX \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u098f\u0995\u099f\u09bf\u09bf\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9JUMPS Over the lazy dog"], ["reamlmenr\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u09cd\u09a4"], ["\u09a3\u0989\u09a6\u09be\u099f\u09b9\u09b0\u09a3\u0995\u09cdABCDzEFGHIJKLMNOPQRklmnopqdogJUMPS\u09b7\u09c7AaBbccDEfFgHiThe"], ["\u0443\u043a\u0440\u0440\u0430\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["portuguo\u00e9"], ["\u0443\u0995\u09cd\u09b7\u043b\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf\u0440\u0430\u043b"], ["N\u00e3\u00e3o,"], ["BroVvwWXxyYZzGHIJnKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwnxyzwn"], ["d\u098fog\u098f\u098f\u099f\u09bf"], ["esckpaABCDzEFGHIJKOPQRSTUVWXYZabcdqefghijklmnopqrsz\u00f1ol?e?spa\u00f1ol?\u041aULAbROwnZY\u0430\u0435"], ["\u0989\u09a3\u09a6\u09be\u09b9\u09b0\u09a3"], ["Qui\u043a\u041a\u0430\u0440\u043bqILAZY\u0443\u0995\u09cd\u09b7\u043b\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u09bf\u0440\u0430\u043b\u0442DOG\u041a\u043b\u0430\u0440\u0430\u0443\u043a\u0440\u0430\u0430\u043b\u0430ck"], ["esquIuckpa\u00f1ol?"], ["\u043a\u043b\u0430\u0440\u043d\u0435\u0442tThe"], ["AB"], ["tHe quIck bROw DOG"], ["\u0443\u043a\u0440\u0443\u0443\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm\u0440\u043a\u0440\u0430\u0443\u043a\u043b\u043b\u043b\u0440\u0430\u0430\u043b\u0443\u043b"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijktHe q\u0989\u09a6\u09be\u09b9\u09b0\u09a3uIck bROwn fOX jUMPed over the LAZY DOGClmnopqrstuvwxyz"], ["\u1f15\u03bb\u03b5\u03bd\u03bc\u03ac\u03bc\u03c7\u1fc3\u03bc\u0440\u03b1\u03b9 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b5\u03b3\u0443\u043a\u0440\u0430\u043b\u0430Quic\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["dog\u0995\u0995\u09cd\u09a4"], ["cQui\u0443\u043a\u0440\u0430\u0430\u043b\u0430ck"], ["Brown\u041ae\u0430\u0440\u043b\u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["AapBbccDEfFgHiIjJKkjUMPedLMmnnoOPtpqQrRSsDO\u041a\u041a\u041a\u043b\u041a\u043b\u0430\u0440\u0430tTuUVvwWXxyYZz"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a \u043b\u0430\u0440\u0430 \u0443 LAZY\u041a\u0430\u0440\u043b\u0430 \u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u043a\u043e\u0995\u041a\u041a\u043bp\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09b0\u0430\u043d\u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0rstuvwxyz\u0435\u0442"], ["DO\u041a\u043b\u041a\u0430\u0440\u0430\u09bf"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u03bc\u03ac\u03c7\u1fc3\u09cd\u09b0"], ["1portugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3c\u0995\u09cd\u09cd\u09a4 \u0995\u0995p\u09aeoco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0\u098f\u0995\u099f\u098f\u09bf"], ["1\u0430\u0430\u043b\u0430rtugu\u00e9s?2345678\u043090"], ["ILAZY\u0442DOOG"], ["Brown\u041ae\u0430\u0430\u0440\u043b\u043a\u043b\u0430\u0440\u043d"], ["xwjQ"], ["\u0443\u043alazy\u0440\u0430\u043b\u041a\u041a\u043b\u0435\u0430\u0440\u044b"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0440e?spa\u00f1ol?\u041a\u0430XfOOX\u0435\u0442\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u0443\u043a\u0440\u0430\u043b\u0430Quic\u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f1234567890\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u041a\u0430\u0430\u0440\u043b\u0430\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u04401po\u0443\u043a\u0440\u0430\u0430\u043b\u0430rtugu\u00e9s?234567890\u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0440e?spa\u00f1ol\u043d\u0435\u0442"], ["The Quick BrTheown FOX JUMP\u03bc1portugu\u00e9s?23UJPUMPS456789sKa\u098f\u099f\u09bf\u03c7\u1fc3S O ver the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd1234656890\u09cd\u09a4"], ["\u0989\u09a6\u09be\u09b9"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0989\u09a3\u09be\u09a6\u09be\u09b9\u09b0\u09a3"], ["\u1f15\u03bb\u03b5 \u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u1f7c\u03bd\u03ce\u03bc\u03b7\u03bd \u03c1\u03bc\u03ac\u03c7\u1fc3 \u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfun\u03bc\u03b112346568904\u03b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["Browon"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u0440\u044b \u0443\u043a\u0440\u0443\u0443\u043a\u0440\u0430\u0443\u043a\u043b\u043b\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u043b\u041a\u043bportugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Qui\u0995p\u09aeoco.\u09cd\u09c7\u09b7\u09c7\u09a4\u09cd\u09b0wvm0c\u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4\u0435\u0442\u0430 \u043a\u043bpoco.\u0430\u0440\u043d\u0435\u0442"], ["un"], ["Br"], ["\u043a\u043e\u0440\u0430\u0442\u043b\u043b\u044b,\u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u043b\u0430\u0440\u0430"], ["\u098f\u099f\u09bf"], ["\u0443\u043a\u0440\u0443\u0443\u043a\u0440\u0430\u0443\u043a\u043b\u043b\u0430\u043b"], ["ABCDEFGHIJnKLMNOPQRSTUVWXYZabcThe Quick BrTheown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0defguhijklmnopqrstuvwxyz"], ["jUeMePPquI,\u043a\u043e"], ["1port\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9ugu\u00e9s?23456789sKa\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cd\u09cd\u09a4 \u0995p\u09aeoco .\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0wvm0"], ["The Quick Br\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u09a3 \u099c\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09bf\u09be\u09b9\u09b0\u09a3 \u099c\u09c1\u09ae\u0995\u09cd\u09cd\u09a4 \u0995poco.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0\u09c1\u09ae\u0995\u0995\u09cd\u09a4 \u0995\u09cd\u09b7\u09c7\u09a4\u09b0\u0443\u043a\u0440\u0430\u043b\u0430\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdTheown FOX JUMP\u03bc\u03c7\u1fc3S Over the lazy dog\u098f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u09a3\u0989\u09a6\u09be\u09b9\u09b0\u09a3\u0995\u09cdt\u09cd\u09a4 \u0995p\u09aeo co.\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b\u0430fThTeOOX"], ["\u0989\u09a6\u09be\u09b9\u09b0\u09b0\u09a3"], ["BroVvwWXxyYZzGHIJnKLMNOnPQRSTUVWXYZabcdefghijklmnopqrstuvwnxyzwn"], ["esquIc\u03c1\u03bc\u03ac\u03c7\u1fc3kpa\u00f1ol?"], ["\u03c0"], ["portu?gu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic"], ["N\u00e3oo\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u0440\u043d\u0435\u0442,"], ["\u03bc\u03ac\u03c7\u1fc3\u1f15\u03bb\u03b5\u03bd\u03b1"], ["BrTrrheown"], ["\u041a\u043a\u043e\u0440\u0430\u043b\u043b\u044b,\u043b\u0430e\u0430\u043b\u0440\u043b"], ["\u0443\u043alazy\u0440"], ["DSRMJumt"], ["portugu\u00e9s?\u0443\u043a\u0440\u0443\u0430\u043b\u0430Quic\u09a3\u0989\u09a64656890\u09cd\u09a4"], ["\u0995\u09cd\u09b7\u09c7\u09a4\u09bf\u09b0FGHIJKLMNOPQRklmnopqrsztugu\u00e9s?234567890"], ["\u0443\u043a\u0440\u0430\u043bi\u0430Quic"], ["a"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9s? N\u00e3o, realmente no."], ["\u041a\u0430\u0440\u043b \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b\u0430AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["\u099c\u09c1\u09ae\u0995\u09cd\u09a4"], ["S\u00ed,,"], ["trealmente"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["reallazymente"], ["AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no."], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9s? N\u00e3o, realmente no.S\u00ed,,"], ["The Quick Bunrown FOX JUMPS Over the lazy dog"], ["S\u00ed\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no.,,"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["no."], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no.no."], ["\u0443"], ["AaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["dog\u0443"], ["do\u0443"], ["treatlmente"], ["do\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dc"], ["AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZz"], ["Bunrown"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no.."], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, la por\u00edtugu\u00e9s? N\u00e3o, realmente no.S\u00ed,,"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["treatlmeno.S\u00ed,,nmte"], ["port\u00edno.no.tugu\u00e9s?"], ["the"], ["tHe quIck bROwn fOX jUMPed ovePr the LAZY DOG"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["S\u00ed\u00bfHabla"], ["AaBbccDEfFgHiIjJKkLMxmnnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZz"], ["quIck"], ["\u041a\u0430\u0440\u043b \u0443\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstoveruvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09beq\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9sN,,"], ["WNvhUnzb"], ["opoco."], ["\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u0440\u044b\u09cd\u09b0"], ["\u099f\u098f\u099f\u09bf \u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["por\u00edtugu\u00e9s?"], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o."], ["port\u00edtugu\u00e9s?"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1S\u00ed,,\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0 bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o."], ["opo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0 bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o."], ["\u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u00bfHabla usted espa\u00f1ol? e no.S\u00ed,,"], ["tHeeZY"], ["DOG\u09bf"], ["kxF"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["ovePr"], ["AaBbccDEfFgjJKkLMmnnoOPpqopo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["no.."], ["AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u0440\u044b\u09cd\u09b0"], ["iZv\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no.no."], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un"], ["realmene"], ["\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstoveruvwxyz \u0430\u098f\u0995\u099f\u09bf \u0989\u09a6\u09beq\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0"], ["\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0995\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0443\u043a\u0440\u043b\u0430\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no..\u043b\u0430"], ["\u098f\u099f\u09bf \u098f\u0995\u099fBrown\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u09a4\u09cd\u09b0"], ["\u09bfDOOG\u09bf"], ["AaBbccDEfFgjJKkLMmnnoOPpqopo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1Y\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u09bfDOGOG\u09bf"], ["\u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bf"], ["iZvR"], ["\u00bfH\u041a\u0430\u0440\u043babla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00e3o, realmente no.."], ["\u0989\u09a6\u09be\u09b9\u09b0Qu\u0989icno.k\u09b7\u09c7\u09a4\u09cd\u09b0"], ["S\u00ed\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz,"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOLAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.uick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["no..."], ["\u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u0443\u043a\u0440\u0430\u043b"], ["ovPePr"], ["Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["tHe"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmentDOGe no.no."], ["AaBbEccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["iZv\u00bfHaZbla"], ["\u098f\u099f\u09bf \u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0\u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["DOG"], ["opgoco."], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["Bun"], ["\u0989\u09a6\u09be\u09b9\u09b0\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.uick\u09b7\u09c7\u09a4\u09cd\u09b0\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["tropoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0 bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u09b0"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u00e9sN,,"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u09b0"], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bfThe\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstport\u00edtugu\u00e9s?TuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["FkF"], ["S\u00edS\u00ed\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz,\u00bfHabla"], ["Qf"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn f OLAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0\u09a4\u09cd\u09b0"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5u\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u03bc\u09b0"], ["fOLAZY"], ["\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bff \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u00bfHabla usoverted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u00e9sN,,"], ["realme\u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bfnte"], ["BuBn"], ["AaBbcciDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u0989\u09a6\u09beq\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u0989\u09a6\u09be\u09b9\u09b0\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.uick\u09b7\u09c7\u09a4\u09cd\u09b0\u1f15\u03bb\u03b5\u03bd\u03b1"], ["ovP"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["\u03ce\u03bc\u03b7\u03bd"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["\u098fABCDEFGHIJKLMNOPQRSTYZabcdefghijklmnopqrstoveruvwxyz \u0430\u098f\u0995\u099f\u09bf \u0989\u09a6\u09beq\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd\u0430"], ["por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u00e9sN,,"], ["e"], ["The Quick Bunrown FOX JUMPS Over te lazy dog"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u09a4\u09cd\u09b0"], ["jUMPUed"], ["no.no."], ["\u0989\u09a4\u09cd\u09b0\u098f\u0995\u099f\u09bf"], ["no.nJUMPSo."], ["\u0430\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442\u098f\u0995\u099f\u09bf"], ["\u0443\u043a\u0440\u043b\u0430\u00bfHabla"], ["reamlmene"], ["DO"], ["QuckLAZY"], ["Fk"], ["FF"], ["S\u00ed\u00bfHabla usted esp?a\u00f1ol? S\u00ed, un pocrealmentDOGeo. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no.,,"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmente no.niZv\u00bfHablao."], ["\u098f\u0995\u099ftHe"], ["DOQf"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 \u03ba\u03b1\u03b3\u1f7c \u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u03bc\u03ac\u03c7\u1fc3 AaBbccDEfFgHiIjJKS\u00ed\u00bfHabla usted esp?a\u00f1ol? S\u00ed, un pocrealmentDOGeo. \u00bfHabla portugu\u00e9s? N\u00e3o, realmente no.,,kLMmnnoOPpqQrRSstport\u00edtugu\u00e9s?TuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099fS\u09bf \u0989Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["Ove\u041a\u043b\u0430\u0440\u044br"], ["real\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0mene"], ["\u099f\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0"], ["\u09bfDOGO\u09bf\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u098f\u0995f\u099fBun\u09bfG\u09bf"], ["nbROwn"], ["tHeeZtY"], ["AaLBbEccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxymYZz\u00bfHabla"], ["S\u00ed\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyoverYZabcdefghijklmnopqrstuvwxyz,"], ["\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bff \u0989\u09a6i\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["F\u09bfDOGO\u09bf\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u098f\u0995f\u099fBun\u09bfG\u09bfkF"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03adOver\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u1f15\u03bb\u03b5\u03bd\u03b1"], ["portugu\u00e9\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b9\u03b9\u098f\u099f\u09bf\u09b0s?"], ["\u098f\u099f\u09bf \u098f\u0995\u099fBrow\u098fn\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u09a4\u09cd\u09b0"], ["b\u0443\u043a\u0440\u043b\u0430\u00bfHabla"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ck\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["no.,,kLMmnnoOPpqQrRSstport\u00edtugu\u00e9s?TuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u041a\u0430\u0440\u043b \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u0430\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["T\u098f\u099f\u09bf \u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0\u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u098fA\u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u0443\u043a\u0440\u0430\u043bBCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bff \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["FAaBbccDEfFgHiIjJKkLMm\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZznnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZzkF"], ["PovPePr"], ["port\u00edno.no.tugu\u00e9s?\u09a4\u09cd\u09b0\u098f\u0995\u099f\u09bf"], ["\u099f\u098f\u099f\u09bf \u098fstTuUVvwWXxyYZz"], ["\u0989\u09a6\u09beqreamlmene\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03cedo\u0443\u03bc\u03b7\u03bd"], ["por\u00edtugu\u00e9sN,,"], ["\u041a\u0430\u0440\u043b\u0430AaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSsJtTuUVvwWXJxyYZz"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u09cd\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOLAZY DOG\u09bf\u09be \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["AaBbccDEfFgjJKkLMmnnoOPpqopo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1Y\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdQrRSno.S\u00ed,,stTuUVvwWXxyYZz\u00bfHabla"], ["AaBbEccDEfFgHiIjJKkLMmnnoOPpqQrRSs\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bfH \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0tTuUVvwWXxyYZz\u00bfHabla"], ["thee"], ["\u099f\u098f\u099f\u09bf"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["kLAZY"], ["jUMPeUed"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u03bc\u09b0"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bfreallazymente \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed,, un"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYBZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["AaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUKVvwWXxyYZz\u00bfHabla"], ["The Quick BABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzunrown FOX JUMPS Over the lazy dog"], ["treatlmen\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0te"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bf\u03bc\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["GDOG"], ["\u041a\u0430\u0440\u043b\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09be\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ck\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["\u0995\u09cd\u09b7\u09c7\u0995\u09a4\u09cd\u09b0"], ["tHe quIck bROwn fOXd vover the LAZY DOG"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u098f\u099f\u09bf"], ["D\u00bfH\u041a\u0430\u0440\u043bablaO"], ["tHe quIck bROwn\u00bfHabla usted espa\u00f1ol? e no.S\u00ed,, fOX jUMPed ovePr the LAZY DOG"], ["ABCDEAFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"], ["\u098f\u099ftHe"], ["doo\u0443"], ["SzyYZabcdefghijklmnopqrstuvwxyz,"], ["\u0989\u09a6\u09be\u09b9\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u0440\u044b\u09cd\u09b0\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u09b0"], ["\u09bfDOGOG\u099fespa\u00f1ol?\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0\u09bf"], ["T\u098f\u099f\u09bf"], ["dKKIqRkw"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u03b9\u03b9\u098f\u099f\u09bf\u09b0"], [""], ["non.nJUMPSo."], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOGno.ui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["\u00bfH\u041a\u0430\u0440a\u043babla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00e3o, realmente no.."], ["\u0989\u09a4\u09cd\u09b0\u098f\u0995\u0995\u099f\u09bf"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099fu\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["tpor\u00e3o,hee"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u099f\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u09cd\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOLAZY DOG\u09bf\u09be \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["O"], ["The Quick Bunrown FOX JUMPS Over the lazey dog"], ["iZv\u00bfHaABCDEAFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzZbla"], ["AaBbccDEfFgHiIjJKkLMxm\u09bfDOGOG\u099fespa\u00f1ol?\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0\u09bf\u0430\u043bUVvwWXxyYZz"], ["bROwn\u00bfHabla"], ["noSo."], ["\u041a\u0430\u0440\u043b \u0443\u043b\u043b\u044b,\u0430 \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaug\u00e9sN,,"], ["S\u00ed\u00bfHabla usted esp?a\u00f1ol? S\u00ed, un pocrealmentDOGeo. \u00bfHabla portugu\u00e9s? N\u00e3\u041a\u0430\u043b\u0430\u0440\u0430o, realmente no.,,"], ["f"], ["\u0989\u09a4realme\u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bfnte\u09cd\u09b0\u098f\u0995\u099f\u09bf"], ["bROwn"], ["\u099f\u098f\u099f\u099f\u09bf"], ["\u099f\u098f\u099f\u09bf \u098fstTuUVvVwWXxy\u0989\u09a4\u09cd\u09b0\u098f\u0995\u0995\u099f\u09bfYZz"], ["\u00bfHablted espa\u00f1ol?u S\u00ed, un poco. \u00bfHabla por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u00e9sN,,"], ["\u00bf\u00bfHabla"], ["portugu\u00e9\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0zyYZabcdefghijklmnopqrstuvwxyz,\u09b0s?"], ["\u098f\u041a\u0430\u0440\u0440\u043b\u0995\u099f\u09bf"], ["AaBbEccDEfFgHiaIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u0995\u09cd\u09b0"], ["AaBbccDEfFgjJKkLMmnnoOPpqopo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099fS\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROw\u09cdn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0440\u044b\u09cd\u09b0"], ["bROwHn\u00bfHabla"], ["\u09bfDOGO\u09bf\u043a\u043b\u0430\u0440\u043d\u0435\u0440\u0442\u098f\u0995f\u099fBu\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdn\u09bfG\u09bf"], ["fThe"], ["AaBbEccDEfFgHiIjJKkLMmnnoOPpqQrRSs\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bfH \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0tTuUVvwWXxyYZz\u00bfHabl\u0995a"], ["n\u041a\u043b\u0430\u0440\u0440\u0430."], ["\u0443\u043b\u043b\u044b,"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0QbROw\u09cdnuick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["S\u00ed\u098fABCDhEF\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5u\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u03bc\u09b0GHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstIuvwxyz,"], ["\u00bfH\u041a\u0430\u0440a\u043babla usted espa\u00f1ol? S\u00edn, fOXun poco. \u00bfHabla por\u00e3o, realmente no.."], ["portugu\u00e9\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b9\u03b9\u098f\u099f\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1\u09bf\u09b0s?"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1ABCDEFGHIJWXYZabcdefghijklmnopqrstuvwxyz\u03b9\u03b9\u098f\u099f\u09bf\u09b0"], ["\u041a\u043b"], ["\u00bfH\u041a\u0430\u0440a\u043babla usted espa\u00f1ol? S\u00edn, fOXun rpoco. \u00bfHabla por\u00e3o, realmente no.."], ["S\u00ed\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabpla portugu\u00e9s? N\u00e3o, realmente no.,,"], ["no.S\u00ed,,"], ["FAaBbccDEfFgHiIjJKkLMm\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZznnoOPpq\u098f\u0995\u099f\u09be\u09bfQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZzkF"], ["fOXd"], ["The Quick Bunro\u09bfDOOG\u09bf JUMPS Over the lazy dog"], ["\u099f\u098f\u099f\u09bf \u098fN\u00e3o,\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, u \u00bfHapbla por\u00edtugu\u00e9s? N\u00e3o, realmente no."], ["S\u00ed\u00bfHabla usted esp?a\u00f1ol? S\u00ed, un pocrealmentDOGeo. \u00bfHabla portugu\u00e9s? N\u00e3\u041a\u0430\u043b\u0430\u0440\u0430o, realmeustednte no.,,"], ["S\u00edS\u00ed\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz,a\u00bfHabla"], ["\u00bfHabla usted\u00bfHablted espa\u00f1ol? S\u00ed, la por\u00edtugu\u00e9s? N\u00e3o, realmente no.S\u00ed,,"], ["b\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmentDOGe no.no."], ["Qu"], ["\u041a\u0430\u0440\u043b \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u0440\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043b\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u041a\u0430\u0440\u043b \u0443\u041a\u043b\u043b\u044b,\u0430tHe \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["D\u03ce\u03bc\u03b7\u03bdG\u09bf"], ["DtheO"], ["Dthe\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0O"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0tTuUVvwWXxyYZz\u00bfHabla"], ["AaBbEccrealme\u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bfnteDEfFgHiIjJKkLMmnnoOPpqQrRSs\u099f\u098f\u099f\u09bf"], ["no.,,kLMmnnoOPpqQrRSstport\u00edtupor\u00e3o,gu\u00e9s?TuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["\u041a\u0430\u0440\u043b \u0443\u041a\u043b\u043b\u044b\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd,\u0430tHe \u0430 \u041a\u043b\u0430\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.trealmeante"], ["\u09bfDOGG\u09bf"], ["fOX\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn f OLAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0\u09a4\u09cd\u09b0un"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTJuUVvwWXxyYBZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u041a\u043b\u0430\u0440no.nJUMPSo.\u044b"], ["LAZY"], ["AaBbxccDEfFgHiIjJKkLMmnnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZz"], ["\u1f15\u03bb\u03b5\u03bd\u03b1 IjJKkLMmnnoOPpqQrRSstport\u00edtugu\u00e9s?TuUVvwWXxyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["\u0989\u09a4\u09cd\u09b0\u098f\u0995\u099f"], ["AaBbcciDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTuU\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0VvwWXxyYZz\u00bfHabla"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0mene"], ["\u0989\u09a6\u09be\u09b9\u09b0\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.uick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bb\u03b5\u03bd\u03b1"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmentDOGe no.no.\u09be\u09b9\u09b0Qu\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["no.,,kLM\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9s? N\u00e3o, realmente no.S\u00ed,,xyYZz\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9"], ["feThe"], ["\u0443\u043a\u0440\u043b\u0430\u00bfHabla usted espa\u00f1ol? S\u00edente no..\u043b\u0430"], ["\u09bfDOGOG\u099fespa\u00f1ol?\u098f\u099f\u09bf \u098f\u0995\u09bf \u0989\u09a4\u09cd\u09b0\u09bf"], ["\u1f15\u03bb\u03b5\u099f\u098f\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u1f15\u03bb\u03b5\u03bd\u03b1\u099f\u09bfreallazymente \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["portugu\u00e9\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b9\u03b9\u098f\u099f\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bf"], ["Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVWXxyYZz"], ["\u0989\u09a6\u00bfHabla"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIjJKkLMmnnoOPBunrownpqQrRSstTJuUVvwWXxyYBbla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4u\u099f\u098f\u099f\u099f\u09bfIck bROw\u09cdn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0440\u044b\u09cd\u09b0"], ["u"], ["\u041a\u0430\u0440\u043b \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430b\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla port\u00edtugu\u00e9s? N\u00e3o, realmentDOGe no.no.\u0440\u0430 \u0443 \u041a\u0430\u0440\u043b\u0430\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u1f15\u03bb\u03b5\u03bd\u03b1 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["iZv\u00bfHaABCDEAFGHIJKLMNOPQRSTUVWXYZabcdefgijklmnopqrstuvwxyzZbla"], ["AaBbccDEfFgHiIjTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZz"], ["DteO"], ["n"], ["\u0989\u09a4\u099f\u09cd\u09b0\u098f\u0995\u099f"], ["\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Q\u098fbROw\u1f15\u03bb\u03b5\u099f\u098f\u099f\u09bfreallazymente \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qu\u0989i\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1uick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["port\u00edno.no.tugu\u00e9sla"], ["Over"], ["The\u0443\u043b\u043b\u044b, Quick Bunrown FOX JUMPS Over te lazy dog"], ["tHe quIck bROwn\u00bfHabla usted espa\u00f1ol? e no.S\u00ed,, fOX j UMPed ovePr the LAZY DOG"], ["12345678950"], ["\u099f\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0k"], ["por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u0430\u00e9sN,,"], ["RnbROwn"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09cd\u09b7\u09c7\u09a4\u09cd\u09b0mene"], ["AaBbccDEfFgHiIjJKkLMmnnoO\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0QbROw\u09cdnuick\u09b7\u09c7\u09a4\u09cd\u09b0PBunrownpqQrRSstTuUKVvwWXxyYZz\u00bfHabala"], ["noo."], ["por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaHug\u00e9sN,,e"], ["por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHabl\u09bfDOGOG\u099fespa\u00f1ol?\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a4\u09cd\u09b0\u09bfaugu\u00e9sN,,"], ["dKKAaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZzIqRkw"], ["tHe quIck bROwn fOXd vover the LAZYY DOG"], ["opoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03c1The\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["iZv\u00bfHabla"], ["AaBbccDEfFgjJKkLMmnnoOPpqopo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u043a\u043b\u0430\u0440\u043d\u0435\u0442\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099fS\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bdQrRSstTuUVvwWXxyYZz\u00bfHabla"], ["\u00bfH\u041a\u0430\u0440a\u043babla usted espa\u00f1ol? S\u00edn, fOXun poco. \u00bfHabla por\u00e3o, rea lmente no.."], ["\u0989\u09a6\u09be\u09b9\u09b0\u0989Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["BABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzunrown"], ["\u041a\u0430\u0440\u043b\u0430AaBxbccDEfFgHiIjJK\u041a\u0430\u0440\u043b\u0430kLMmnnoOPpqQrRSstTuUVvwWXxyYZz"], ["fOX"], ["tpor\u00e3oo,heeS\u00ed\u098fABCDEFGHIJKLMNOPQRSTUVWXlazyoverYZabcdefghijklmnopqrstuvwxyz,"], ["\u0989\u09a6\u09be\u09b9\u09b0Qu\u00bfHabla usted espa\u00f1ol? S\u00ed,, uani\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0"], ["iaZv\u00bfHabla"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099fPovPePr\u09b0"], ["bRHabla"], ["fOX\u099f\u098f\u099f\u09bf"], ["FAaBbccDEfFgHiIjJKkLMm\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf o\u0989Ano..\u043b\u0430aBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTuUVvwWXxyYZznnoOPpq\u098f\u0995\u099f\u09be\u09bfQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZzkF"], ["n\u041a\u043b\u0430bROwHn\u00bfHabla\u0440\u0440\u0430."], ["\u1f15\u03bb\u03b5\u099f\u098f\u099fu\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Q\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9sN,,u\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["\u0443\u043b\u043b\u044bDteO,"], ["\u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u0440\u044b\u09cd\u09b0\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u03b9\u098f\u099f\u09bf\u09b0Brown"], ["tropoc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck \u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe q\u03c4uIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0 bROwn fOX jUMPed ovePr the L\u03bcAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["\u0989\u09a6\u09be\u09b9\u09b0lazy\u0989Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["The Quick Bunrown FOX JUMPS Over the lauzey dog"], ["\u098fstTuUVvVwWXxy\u0989\u09a4\u09cd\u09b0\u098f\u0995\u0995\u099f\u09bfYZz"], ["\u00bfHabla usoverted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edt\u0443\u043a\u0440\u043b\u0430\u00bfHablaugu\u0430\u041a\u0430\u0440\u043b\u00e9sN,,"], ["real\u098fABCDEFGHIJKLLMNOPQRSTUVWXlazyYZabcdefghijklmnopqrstuvwxyz \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0meneO"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u09a4\u09cd\u09b0\u098f\u099f\u09bf"], ["dKKAaBbccDEfFgHiIjJKkLMmnnoOPpqQrRSstTu\u0443\u043a\u0440\u0430\u043bUVvwWXxyYZzIqRkw\u041a\u0430\u0440\u043babla"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghij\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u0440\u044b\u09cd\u09b0klmnopqrstuvwxyz"], ["\u0989\u09a6\u09be\u09b9\u09b0QiZv\u00bfHaABCDEAFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzZblauick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u09b0"], ["\u099f\u098f\u099f\u09bf \u098f\u0995\u099f\u09bf \u0989\u09a6\u09be\u09b9\u09b0The\u0443\u043b\u043b\u044b,Quick\u09b7\u09c7\u09a4\u09cd\u09b0"], ["\u041a\u0430\u0440\u043b \u0443 \u041a\u043b\u0430\u0440\u044b \u0443\u043a\u0440\u0430\u043b \u043a\u043e\u0440\u0430\u043b\u043b\u044b, \u0430 \u041a\u043b\u0430\u0440\u0440\u0430 \u0443 \u041a\u0430\u0440portugu\u00e9\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0zyYZabcdefghijklmnopqrstuvwxyz,\u09b0s?\u043b\u0430 \u0443\u043a\u0440\u0430\u043b\u0430 \u043a\u043b\u0430\u0440\u043d\u0435\u0442"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla poN\u00e3o, realmente no."], ["wBunrown"], ["\u0989\u09a6\u09be\u09b9\u09b0Quick\u09b7\u09c7\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u0989\u09a6\u09be\u09b9\u09b0\u0989\u0989Qui\u041a\u043b\u0430\u0440\u044b\u09cd\u09b0o.ealmente"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bfAaBbccDEfFgHiIport\u00edno.no.tugu\u00e9s?jJKkLMmnnoOPBunrownpqQrRSstTuUVvwWXxyYBZz\u00bfHabla\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugu\u00e9s? N\u00e3o, realme\u00bfHabla usted espa\u00f1ol? e no.S\u00ed,,nte no."], ["\u0989\u09a6\u09be\u09b9\u09b0\u0989\u0430Qui\u041a\u043b\u0430\u0440ente"], ["AaBbEccrealmUMPede\u098f\u041a\u0430\u0440\u043b\u0995\u099f\u09bfnteDEfFgHiIjJKkLMmnnoOPpqQrRSs\u099f\u098f\u099f\u09bf"], ["opo\u00ef\u00ee\u00cf\u00ce\u00f1\u00d1\u00e0\u00c0\u00e1\u00c1\u00e9\u00c9\u00e8\u00c8\u00ec\u00cc\u00ed\u00cd\u00f2\u00d2\u00fa\u00d9\u00fc\u00dcc\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd"], ["no.,,"], ["\u03c0\u03b5\u03b9\u03c1\u03b1\u03c4\u03ad\u03bf\u03bc\u03b1\u03b9\u098f\u099f\u09bf\u03b3\u03bd\u03ce\u03bc\u03b7\u03bd \u098f\u0995\u099ftHe quIck bROwn fOX jUMPed ovePr the LAZY DOG\u09bf \u0989\u09a6\u09be\u09b9\u09b0Qui\u041a\u043b\u0430O\u044b\u09cd\u09b0"], ["\u1f15\u03bb\u03b5\u099f\u098f\u099fu\u09bf \u098f\u0995\u099f\u09b7\u09bf \u0989\u09a6\u09be\u09b9\u09b0Q\u00bfHabla usted espa\u00f1ol? S\u00ed, un poco. \u00bfHabla por\u00edtugHu\u00e9sN,,u\u0989ick\u09b7\u09c7\u09a4\u09cd\u09b0\u03bd\u03b1"], ["\u041a\u0430\u043b\u0430\u0440\u0430"], ["\u00bfH\u041a\u0430\u0440\u043babla"]], "completion": "\ndef flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"\n return string.swapcase()\n", "raw_completion": "```python\ndef flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"\n return string.swapcase()\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef flip_case(string: str) -> str:\n \"\"\" For a given string, flip lowercase characters to uppercase and uppercase to lowercase.\n >>> flip_case('Hello')\n 'hELLO'\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/28", "prompt": "from typing import List\n\n\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"\n", "entry_point": "concatenate", "canonical_solution": "\n return \"\".join(strings)\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([]) == ''\n assert candidate(['x', 'y', 'z']) == 'xyz'\n assert candidate(['x', 'y', 'z', 'w', 'k']) == 'xyzwk'\n", "contract": "\n assert all(isinstance(s, str) for s in strings), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[]], [["x", "y", "z"]], [["x", "y", "z", "w", "k"]]], "atol": 0, "plus_input": [[["apple", "banana", "orange"]], [["python", "is", "a", "great", "language"]], [["Rock", "Paper", "Scissors"]], [["123", "456", "789"]], [["Hello"]], [["hello"]], [["", "world"]], [["Python", "is", "a", "programming", "language"]], [["a"]], [["", "", ""]], [[]], [["python", "is", "pythonhello", "a", "great", "language", "is"]], [["", "Hello", "world"]], [["python", "is", "pythonhello", "a", "pyothonhello", "great", "language", "is"]], [["1323", "pythonhello", "789"]], [["python", "is", "pythonhello", "great", "language", "is"]], [["python", "is", "laPapernguage", "language"]], [["Paper", "woorld"]], [["Hello", "world"]], [["python", "i456", "is", "pyothonhello", "language"]], [["apple", "i456banana", "orange", "apple"]], [["python", "a", "great", "language", "language"]], [["Scissors", "python", "a", "great", "language", "language"]], [["hellbananao", "hello"]], [["python", "a", "great", "language", "language", "python"]], [["python", "great", "language", "language", "pythoon", "python"]], [["Paper", "Scissorslanguage"]], [["oran456ge", "apple", "banana", "orange"]], [["Hello", "world", "world"]], [["python", "is", "pythonhello", "a", "great", "language", "is", "is"]], [["Rock", "Paper", "Scisi456bananasoors", "Scissoors"]], [["Helloo", "Hello", "wordld", "world"]], [["python", "is", "laPapernguage", "language", "language"]], [["", "Hello", "world", ""]], [["python", "a", "great", "language", "pythlaPapernguageon", "language"]], [["Helloo", "Hello", "wordld", "world", "wordld"]], [["Paper", "Hello", "woorld"]], [["1323", "789"]], [["1323", "great789"]], [["python", "great", "language", "language", "laHelloonguage", "pythoon", "python", "python"]], ["Paper"], [["orana45e6ge", "apple", "banana", "orange"]], [["orld", "Hello", "world", "world"]], [["apple", "i456banana", "apple"]], [["python", "a", "great", "language", "language", "a"]], [["hellbananao", "789", "", "", ""]], [["hell"]], [["python", "is", "laPapernguage", "laPaapernguage", "language", "python"]], [["1323", "pythonhello", "789", "pythonhello"]], [["python", "aa", "is", "a", "great", "language"]], [["", "laPapernguage", "", "", "", ""]], [["language", "", ""]], [[""]], [["python", "is", "a", "gereat", "language"]], [["python", "is", "a", "programmging", "Python", "language", "gereat"]], [["orld", "Hello", "world", "world", "Hello"]], [["", "Hello", "worldaa", ""]], [["pythoon", "1323", "789"]], [["1323", "789", "1323"]], [["i456banana", "orange"]], [["orana45e6ge", "apple", "banaworldaana", "banana", "orange"]], [["rPaper", "Peaper", "Hello", "woorld", "Paper"]], [["rPaper", "Peaper", "Hello", "woorld", "Paper", "rPaper"]], [["pythoon", "1323", "789", "pythoon"]], [["python", "is", "pythonhello", "a", "pyothonhello", "pythgreat789on", "great", "language", "is"]], [["orld", "Hello", "pythlaPapernguageon", "world", "worldaa"]], [["1323", "789", "pythonhello"]], [["123", "456"]], [["world", "banana", "orange"]], [["pythoon", "1323", "ppythonhelloythoon", "789", "pythoon"]], [["oran456ge", "banana", "orangeoran456ge"]], [["python", "laPapernguage", "laPapernguage", "language"]], [["python", "is", "pythonhello", "a", "pyothonhello", "pythgreat789on", "great", "language", "is", "language"]], [["apple", "i456banana", "apple", "i456banana"]], [["sis", "Python", "is", "a", "programming", "language"]], [["sis", "1323", "789"]], [["i456banana", "ppythonhelloythoon", "a", "i456banana"]], [["python", "is", "pythonhello", "pyothonhello", "great", "language", "is"]], [["oran456ge", "apple", "banana", "orange", "orange"]], [["python", "a", "great", "language", "python"]], [["oran456ge", "bana", "orangeoran456ge"]], [["Rock", "orangeoran456ge", "Scisi456bananasoors", "Scissoors"]], [["python", "is", "a", "great", "is", "is"]], [["Paper", "python", "is", "a", "gereat", "language"]], [["is", "pythonhello", "great", "language", "is"]], [["python", "a", "language", "great", "language", "pythlaPapernoguageon", "language"]], [["python", "a", "great", "apple", "pythlaPapernguageon"]], [["pythoon", "1323", "pythoon"]], [["world", "banana", "orang"]], [["orld", "Hello", "world", "world", "world", "orld"]], [["python", "is", "pyothonhello", "pythonhello", "a", "great", "language", "is"]], [["is", "laPapernguage", "laPaapernguage", "lanuage", "python", "laPapernguage"]], [["Scissorslanguage", "Helloo", "Hello", "wordld", "world", "wordld"]], [["python", "great", "language", "language"]], [["Helloo"]], [["", "laPapernguage", "", "", "", "", ""]], [["Hello", "Hello"]], [["python", "is", "language", "language"]], [["python", "is", "pythonhello", "a", "pyothonhello", "language", "is"]], [["R", "Rock", "Paper", "Scissors"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10"]], [["a", "ab", "abc", "abcd", "abcde", "abcdef"]], [["Hello, World!"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much"]], ["11"], [["1", "2", "3", "2\ud83e\udd8c", "4", "5", "6", "7", "8", "9", "10"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wood"]], [["How", "much", "wowod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wood", "a", "wood"]], [["How", "much", "wood", "would", "a", "woodchuck", "2", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines"]], ["ab"], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\n\na..\nlong\nstring"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\u2605", "!"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them", "be"]], ["Dywneedst"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines"]], ["a"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22"]], [["woood", "How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\u2605has", "\u2605", "!"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "18"]], [["1", "2", "3", "4", "", "6", "7", "8", "9", "10"]], [["This", "is", "a", "long", "list", "betweenn", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them", "be"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\u26051", "\u2605", "!"]], [["How", "much", "wood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "a", "could", "chuck", "wood"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83d\udc22"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "16", "\ud83e\udd9b", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["\ud83d\ude00", "this", "\ud83e\uddd0", "spaces", "\u2605", "!"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wood", "How"]], ["if"], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wood", "How", "wood"]], [["How", "much", "wood", "would", "a", "chuck", "if", "a", "aa", "woodchuck", "could", "wood", "How"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0\ud83e\uddd0", "spaces", "\u2605has", "\u2605", "!"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "5"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "5", "\ud83d\udc22"]], [["Hello123orld!", "Hello, World!"]], ["\ud83d\udc3c"], [["How", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck"]], [["hello\nworld", "7"]], [["\ud83d\ude00", "\ud83c\udf1e", "\ud83e\uddd0", "spaces", "\u26051", "\u2605", "!", "\u2605"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22"]], [["a", "ab", "abc", "abcd", "abcde"]], [["\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 10.344968582086025, "bEC": 69.74335770313701}], [["\ud83d\udc3b", "\ud83e\udd8a", "quick", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "could\ud83d\udc22", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["hello\nworld", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spac13s", "\u26051", "\u2605"]], [["string", "1", "2", "3", "2\ud83e\udd8c", "4", "5", "6", "7", "1or", "8", "9", "10"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18"]], [["How", "much", "wood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "a", "chuck", "wood"]], [["Hw", "How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["lHello, W,orld!", "Hello, World!", "Hello, W,orld!"]], [["Hw", "How", "much", "woHwod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "woood"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "list", "5"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28\ud83d\udc28", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "5", "5"]], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!"]], [["How", "much", "wood", "a", "woodchuck", "chuck", "if", "a", "could", "chuck", "wood", "\ud83d\udc28"]], [["\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd89", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udda2"]], [["12", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jumps"]], ["iff"], [["How", "much", "wowod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "could"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "chukck", "if", "a", "woodchuck", "could", "wood", "chuck"]], [["1", "2", "3", "4", "5", "6", "7", "8", "555", "", "9", "10", "list", "5"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "How\ud83e\udd8c", "any", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83d\udc22"]], [["1", "2", "3", "4", "5", "6", "\u2605", "7", "8", "555", "", "9", "10", "list", "5"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!", "\ud83c\udf1e"]], [["How", "much", "wvSood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "a", "chuck", "wood", "wood"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "5", "\ud83d\udc22", "\ud83e\udd8c"]], [["12", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "jumps", "jumps"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "2"]], [["How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "wood", "How"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could"]], [["This", "mucch", "How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "wood", "How"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "quick"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewleines", "hello\nworld"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 10.344968582086025, "bEC": 69.74335770313701, "brown": 51.80576640475656}], [["Hello, World!", "Hellsingleo, World!"]], [["How", "much", "wvSood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "a", "chuck", "wood", "wood", "much"]], ["aa"], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f\ud83d\udc2f", "18"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines"]], [["1", "2", "", "4", "5", "6", "7", "8", "9", "10", "2"]], [["How", "much", "wood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "a", "could", "chuck", "wood", "a"]], [["hello\nworld", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld"]], [["How", "much", "wood", "a", "woodchuck", "chuck", "if", "a", "could", "chuck", "wood"]], [["hello\nworld", "7", "7"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much"]], ["2\ud83e\udd8ceedst"], [["Hello, World!", "list"]], ["2\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd9ct"], [["How", "mucuh", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could"]], ["\ud83d\udc3ccharacters"], [["woood", "How", "wood", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmulntiple\nnewlines"]], [["How", "much", "wowod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "\ud83d\udc2f", "wood"]], [["12", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums"]], ["S"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["This", "is", "a", "long", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them", "be"]], [["string", "1", "2", "3", "2\ud83e\udd8c", "4", "5", "6", "7", "1or", "8", "9"]], [["1", "2", "3", "4", "\ud83c\udf1e", "5", "6", "7", "8", "555", "", "9", "10", "list", "5", "1", "list"]], ["much"], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "118", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18", "\ud83d\udc2f"]], [["hello\nworld"]], [["How", "much", "wood", "a", "woodchuck", "if", "a", "could", "chuck", "wood"]], [["How", "much", "wood", "would", "a", "chuck", "if", "a", "aa", "woodchuck", "could", "wood"]], [["This", "is", "a", "long", "list", "of", "strings", "spcaces", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "7\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much", "would"]], [["This", "mucch", "How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "wood", "How", "would"]], [""], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "chukck", "if", "a", "woodchuck", "could", "wood", "chuck", "woodchuck"]], [["\ud83d\ude00", "Hw\u2605", "\ud83c\udf1e", "this", "\ud83e\uddd0\ud83e\uddd0", "spaces", "\u2605has", "\u2605", "ithis", "!", "\ud83e\uddd0\ud83e\uddd0"]], [["Hello123orld!", "Hello, World!", "Hello, World!", "Hello, World!", "Hello123orld!"]], [["hello\nw555orld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\n\na..\nlong\nstring"]], [["woood", "How", "much", "wood", "into", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "wood", "much"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "aa", "this\nstring\nhas\nmulntiple\nnewlines"]], [["How", "much", "wowod", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "How"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "\u26051", "5"]], ["is"], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hellld", "this\nstring\nhas\nmultiple\nnewleines", "hello\nworld"]], [["How", "ch\ud83c\udf1euck", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much", "would", "would"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "9", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28"]], [["How", "much", "wood", "a", "woodchucmucchk", "if", "a", "could", "wood"]], [["1", "2", "4", "5", "6", "66", "7", "8", "9", "5"]], [["abc", "abcd"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "over"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "chukck", "if", "a", "woodchuck", "could", "chuck", "chthis\nstring\nhas\nmultiple\nnewleinesukck", "woodchuck", "chuck"]], [["\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udda210", "\ud83e\udd89", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd89"]], [["a", "ab", "abc", "abcd", "\ud83e\udd89", "abc"]], [["Hello, World!", "Hello, World!"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "118", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18", "\ud83d\udc2f", ""]], ["any"], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "a", "wood"]], [["\ud83c\udf1e", "th6is", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!"]], ["\ud83d\udc3cjumpscharacters"], [["1", "2", "3", "4", "", "66", "7", "8", "9", "10"]], [["t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "a", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines"]], ["abb"], [["1", "55", "2", "3", "4", "5", "6", "7", "8", "9", "10", "2"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "newline", "\ud83e\udd9c", "\ud83d\udc22"]], [["woood", "How", "wood", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "owood", "could", "chuck", "wood"]], [["How", "much", "wood", "aif", "would", "a", "woodchuck", "chuck", "chukck", "if", "a", "woodchuck", "could", "wood", "chuck"]], ["or"], [["How", "much", "wood", "a", "woodchuck", "chuck", "a", "could", "chuck", "wood"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "bEC": 69.74335770313701}], [["\ud83c\udf1e", "\ud83e\uddd0", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!", "\ud83c\udf1e", "\ud83c\udf1e"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck"]], [["1", "2", "3", "4that", "5", "6", "7", "8", "9", "10", "list", "5"]], [["\ud83d\udc3b", "lHello, W,orld!", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8a"]], ["owood"], [["12", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums", "jums"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "if", "woodchuck", "could", "chuck", "wood", "much", "woodchuck"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "bEC": 69.74335770313701, "\ud83e\uddd0\ud83e\uddd0": 69.74335770313701}], ["woHwod"], [["\ud83d\udc3b\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22"]], [["1", "2", "", "3", "4", "5", "6", "7", "8", "9", "10", "5"]], [["Hello123orld!", "\ud83d\udc3bDywneedst", "Hello, World!", "Hello, World!", "Hello, World!", "Hello123orld!"]], ["anthisy"], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "bEC": 69.74335770313701, "bEEC": 69.74335770313701}], [["\ud83d\ude00", "this", "\ud83e\uddd0", "spaces", "\u2605", "!", "spaces"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "hello\nworld", "hello\nworld", "hello\nworld"]], ["\ud83e\udd8aS"], [["How", "much", "wowod", "a", "woodchuck", "chuck", "iff", "a", "woodchuck", "could", "chuck"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "a", "woodchuck", "chuck", "\ud83e\uddd0", "a", "could", "chuck", "wood"]], [["1", "2", "3", "4", "This", "6", "\u2605", "7", "8", "555", "", "9", "10", "list", "5"]], [["1", "this\nstring\nhas\nmultiple\nnewleines", "", "3", "abcdef", "4", "5", "6", "7", "8", "9", "10", "5"]], [["How", "much", "wood", "fox", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["\ud83d\ude00", "\ud83c\udf1e", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!", "\ud83c\udf1e"]], [["123", "456", "789", "10", "11", "13", "14", "15", "16", "17", "18"]], ["mulntmiple"], [["\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["1", "2", "", "4", "5", "6", "7", "8", "9", "10", "2", "8", "6"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums"]], ["Dywnesedst"], [["1", "2", "3strings", "4that", "5", "6", "7", "8", "9", "10", "list", "5"]], ["12"], [["\ud83e\udd81", "\ud83e\udd89Hw", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "7\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "woodchuck", "hello\nworld", "hello\nworld"]], ["strings"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "", "\ud83e\udda2", "\ud83d\udc22", "\ud83d\udc22"]], [["7"]], [["abc", "abcd", "abc"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "jumps"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83e\udd89"]], [["How", "much", "wood", "would", "a", "chuck", "a", "aa", "woodchuck", "could", "wood"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "fox", "jumps", "fox", "extra", "the", "lazy", "dog", "over"]], [["1", "2", "4", "without", "6", "7", "8", "9", "10", "\u26051", "5", "6"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "\ud83d\udc28\ud83d\udc28", "18"]], [["\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89Hw", "\ud83e\udd89"]], [["How", "much", "wowod", "would", "a", "woodchuock", "chuck", "if", "a", "woodchuck", "could", "chuck", "\ud83d\udc2f", "wood"]], [["1", "2", "", "3", "5", "6", "7", "8", "9", "10", "5"]], ["!!"], [["this\nstring\nhas\nmultiple\nnewlines", "lthis\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmulntiple\nnewlines"]], [["1", "2", "3strings", "4that", "88", "5", "6", "7", "8", "9", "10", "list", "5"]], [["\ud83d\udc3b", "\ud83e\udd8a", "quick", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "this\nstring\nhas\nmulntiple\nnewlines", "\ud83e\udd89", "could\ud83d\udc22", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83d\udc3b", "2", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["\ud83d\ude00", "this", "\ud83e\uddd0", "spaces", "\u2605", "!", "spaces", "!"]], [["hello\nworld", "this\ne\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "aa", "this\nstring\nhas\nmulntiple\nnewlines"]], [["How", "much", "wood", "would", "a", "woodchuck", "2", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "How"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 10.344968582086025, "bEC": 69.74335770313701, "brown": 51.80576640475656, "br": 69.74335770313701}], [["string", "1", "2", "3", "2\ud83e\udd8c", "4", "6", "7", "1or", "8", "9"]], [["\ud83d\udc3b", "\ud83e\udd8a", "ch\ud83c\udf1euck", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "wood", "How", "if"]], ["f"], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "newline", "\ud83e\udd9c", "\ud83d\udc22"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83c\udf1e\ud83c\udf1e", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "9", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28"]], [["1", "2", "3", "4", "5", "Hellsingleo,6", "7", "9", "10", "5", "\ud83c\udf1e\ud83c\udf1e5", "Hellsingleo,6"]], [["11", "2", "3strings", "4that", "88", "5", "6", "7", "8", "9", "10", "list", "5"]], [["1", "no\nnewline\nthis\nis\na..\nlong\nstring", "2", "110", "5\ud83e\udd89", "", "3", "4", "5", "6", "7", "8", "9", "10", "5"]], ["dog"], ["\ud83d\udc3bDywneedst"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8a"]], [["um", "jum", "jumps", "jumps", "jums"]], [["\ud83e\udd9c\ud83e\udd9c", "this\nstring\nhas\nmultiple\nnewlines", "\ud83e\udd9c\ud83e\udd9cbetweenn", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hellld", "this\nstring\nhas\nmultiple\nnewleines", "hello\nworld"]], [["um", "jum", "jumps", "jus", "jums", "jum"]], [["\ud83d\udc28", "Hello, World!"]], [["\ud83e\udd9c\ud83e\udd9c", "this\nstring\nhas\nmultiple\nnewlines", "\ud83e\udd9c\ud83e\udd9cbetweenn", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hellld", "this\nstring\nhas\nmultiple\nnewleines", "hello\nworld", "this\nstring\nhas\nmultipule\nnewlines", "this\nstring\nhas\nmultipule\nnewlines"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "spaces", "\u2605has", "\u2605", "!"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "fox": 10.344968582086025}], [["How", "much", "wvSood", "would", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "chuck", "wood", "wood", "much"]], [["1", "11", "55", "2", "3", "4", "5", "6", "7", "8", "9", "10", "2"]], [["\ud83e\udd81", "\ud83e\udd89Hw", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["12", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums", "jumps"]], [["The", "quick", "brown", "Hellsingleo, World!", "fox", "jumps", "fox", "extra", "the", "lazy", "dog", "over", "Hellsingleo, World!"]], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3ccharacters", "!"]], ["quvSick"], [["1", "2", "3", "4", "This", "6", "99", "\u2605", "7", "8", "555", "", "9", "10", "list", "5", "6"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["\ud83d\udc3b", "\ud83e\udd8a", "quick", "\ud83d\udc3c", "\ud83d\udc2f", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "could\ud83d\udc22", "!!", "\ud83d\udc22"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "quick\ud83e\udd9b", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f\ud83d\udc2f", "18", "S", "!!"]], [["How", "much", "wvSood", "\ud83e\udd8c", "a", "\ud83d\udc28", "woodchuck", "chuck", "if", "chuck", "wood", "wood", "much"]], ["2\ud83e\udd8ceemulntmipleds\ud83e\udd9c\ud83e\udd9ct"], [["How", "much", "wood", "woodchuck", "chhuck", "a", "could", "chuck", "wood"]], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "9", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28", "\ud83d\udc28", "\ud83e\udd8a"]], [["\ud83d\udc3b\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3c\ud83d\udc3c"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "5", "\ud83d\udc22"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "1or", "jumps", "hello\nw14orld", "hello\nworld", "hello\nworld", "hello\nworld"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "How\ud83e\udd8c", "any", "\ud83e\udd8c8", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83d\udc22"]], [["This", "mulntiple", "How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "wood", "How"]], [["1", "2", "3", "4", "", "6", "8", "9", "10", "6"]], [["\ud83e\udd81", "\ud83e\udd89w", "\ud83e\udd89\ud83e\udd89", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "7\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc22", "\ud83e\udd89"]], ["xoGhI"], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much", "much"]], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "jumps"]], [["1", "2", "3strings", "5", "6", "7", "8", "9", "10", "list", "5"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\u26051", "\u2605"]], [["1", "2", "3", "4", "5", "Hellsingleo,6", "7", "9", "10", "Helabcdelsingleo,6", "5", "\ud83c\udf1e\ud83c\udf1e5", "Hellsingleo,6"]], [["1", "2", "3", "4", "5", "6", "7", "555", "", "9", "10", "list", "5", "10", "7"]], ["quuvthatSic"], [["\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd89", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["1", "2", "3", "2\ud83e\udd8c", "4", "5", "6", "7", "8", "9", "e"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "", "\u2605", "\ud83c\udf08", "!"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "a", "woodchuck", "could", "chuck", "wood", "much"]], [["How", "much", "wood", "aa", "woodchuck", "if", "a", "\ud83e\udd8aSw", "could", "chuck", "wood"]], [["\ud83e\udd81", "\ud83d\udc3c", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "hello\nworld", "hello\nworld", "hello\nworld", "hello\nw14orld"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "\u26051"]], [["abcd"]], [["lthis\nstring\nhas\nmultipule\nnewllHello, W,orld!ines", "this\nstring\nhas\nmultiple\nnewlines", "lthis\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmulntiple\nnewlines", "this\nstring\nhas\nmulntiple\nnewlines"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "fox", "jumps", "fox", "11", "extra", "the", "lazy", "over"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "5", "\ud83d\udc22", "\ud83e\udd8c"]], ["Jy"], [["1", "2", "3", "4", "", "6", "8", "10", "6"]], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "jumps", "hello\nworld"]], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "jumps", "hello\nworld", "t!!his\nstring\nhas\nmultiple\nnewlines"]], [["Hello123orld!", "f"]], [["string", "1", "2", "3", "2\ud83e\udd8c", "4", "5", "6", "7", "1or", "8", "9", "10", "9"]], [["\ud83e\udd9c\ud83e\udd9cbetweenn\ud83d\udc2f", "\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "", "\ud83e\udd89", "!!", "118", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18", "\ud83d\udc2f", ""]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "", "5", "\ud83d\udc22", "\ud83e\udd8c"]], ["\ud83d\udc3ccharac\u2605hascters"], [["", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "Hw\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83e\udd89\ud83e\udd89", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "jumps", "fox", "11", "extra", "the", "lazy", "over"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "fox", "jumps", "fox", "extra", "the", "lazy", "over"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "1or", "\ud83d\udc3b", "\ud83e\udd89"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "woquvSick": 69.74335770313701}], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f\ud83d\udc2f", "18", "S", "!!"]], [{"any": 51.80576640475656, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "woquvSick": 69.74335770313701, "wooo\ud83d\udc3ccharactersd": 52.12790878761069}], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "jumps", "hello\nworld", "t!!his\nstring\nhas\nmultiple\nnewlines"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83e\udd81", "\ud83d\udc3c", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "!!", "\ud83e\udd89", "\ud83e\udd8c"]], [["\ud83d\udc3b", "newline", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83d\udc22"]], [["How", "", "much", "wood", "a", "woodchuck", "chuck", "\ud83e\uddd0", "a", "could", "chuck", "wood"]], ["\ud83e\udd89\ud83e\udd89"], [["This", "is", "a", "long", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "woHwod", "spaces", "or", "characters", "in", "between", "them", "be"]], [["hello\nworld", "jum", "jumps", "jumps"]], ["dDywneedstog"], ["2\ud83e\udd8ceepuledst"], [["How", "much", "wood", "a", "wooodchuck", "chuck", "a", "could", "chuck", "wood"]], [["Hello123orld!", "\ud83d\udc3bDywneedst", "Hello, World!", "Hello, World!", "Hello123orld!"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "spaces", "\u2605has", "\u2605", "!", "this"]], [["hello\norld", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "jumps"]], ["vFbjXZEj"], ["annewleinesy"], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "hello\nworld", "hello\nworld", "hello\nworld", "hello\nw14orld"]], ["dDywnseedstog"], ["dDywneedsto2\ud83e\udd8ceepuledstg"], [["a", "ab", "aabc", "abcd", "abcde"]], [["1", "this\nstring\nhas\nmultiple\nnewleines", "", "3", "or", "4", "5", "6", "7", "8", "9", "10", "5", "wood"]], [["1", "2", "", "4", "5", "6", "7", "8", "9", "10", "2", "8", "6", "2"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "ju\ud83e\udd8c8mps", "jumps", "jumps", "jums"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "ju\ud83e\udd8c8mps", "jumps", "this\nstring\nhas\nmultiple\nnewlins", "much", "jumps", "jums", "jum"]], [{"any": 51.80576640475656, "woood": -44.62697367582944, "multiple": 28.986177867416473, "vS": 52.12790878761069, "woquvSick": 69.74335770313701, "wooo\ud83d\udc3ccharactersd": 52.12790878761069, "wo\ud83e\udd89Hwood": 19.70066326411307}], [["\ud83e\udd81", "\ud83d\udc3c", "\ud83e\udd9b", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["123", "456", "789", "10", "11", "13", "14", "15", "16", "17", "18", "13"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9", "0"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "if", "woodchuck", "could", "chuck", "wowoquvSickod", "much", "woodchuock", "would"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "spaces", "chuck", "\u2605", "!", "\ud83d\ude00"]], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines"]], ["aab"], [["\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "jumps", "fox", "11", "extra", "the", "or", "lazy", "over"]], [["\ud83d\udc3b", "\ud83e\udd8a", "quick", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "188", "\ud83e\udd8c", "\ud83e\udda2", "this\nstring\nhas\nmulntiple\nnewlines", "\ud83e\udd89", "could\ud83d\udc22", "!!", "\ud83d\udc22", "\ud83e\udd89"]], ["W,orld!ines"], [["\ud83e\udd81", "\ud83e\udd89Hw", "\ud83e\udd8a", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "woquvSick": 69.74335770313701}], [["Hw", "How", "much", "woHwod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "woood"]], ["ithis"], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "spaces", "$", "or", "characters", "in", "between", "them"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd9b\ud83e\udd9b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], [["\ud83c\udf1e", "this", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3ccharacters", "!"]], [{"any": 69.63616178329318, "woood": -35.59833938440427, "multiple": 28.986177867416473, "much": 52.12790878761069, "vS": 69.74335770313701, "bEC": 69.74335770313701, "bEEC": 69.74335770313701, "muhch": 69.74335770313701}], [["Hw", "How", "much", "woHwod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "woood", "could"]], [["1", "2", "3", "4", "5", "6", "7", "8", "9"]], [["The", "quick", "brown", "fox", "jumps", "over", "lazy", "dog", "quick"]], [["Hello123orld!", "Hello, World!", "Hello, World!", "Hello, World!", "Hello123orld!", "Hello123orld!"]], [["jum", "ju\ud83e\udd8c8mps", "jumps", "jumps", "jums", "jumps"]], [["um", "jum", "jumps", "jumps", "jums", "um"]], [["1", "2", "3", "4", "This", "6", "99", "\u2605", "strings", "8", "555", "", "9", "10", "list", "5", "6"]], [["1", "2", "3", "5", "6", "7", "8", "9", "9"]], [{"any": 63.17204589847489, "woood": -44.62697367582944, "much": 52.12790878761069, "vS": 69.74335770313701, "woquvSick": 69.74335770313701}], [["t!!shis\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "t!!his\nstring\nhas\nmultiple\nnewlines", "jumps", "hello\nworld", "t!!his\nstring\nhas\nminultiple\nnewlines"]], ["wooodjum"], ["spac13s"], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "muhch", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udda2"]], [["1", "2", "3", "", "4", "5", "6", "7", "8", "9", "10", "list", "5"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "hello\nw14orld", "\ud83e\udd9b", "\ud83e\udd8c", "", "5", "\ud83d\udc22", "\ud83e\udd8c"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "lthis\nstring\nhas\nmultipule\nnewlines", "7\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "muhch", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83e\udd9c\ud83e\udd9c\ud83d\udc22", "\ud83e\udd89", "\ud83e\udda2"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "jumps", "jumps"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "7\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd9c", "\ud83d\udc22", "$multipule", "\ud83e\udd89"]], [["\ud83d\udc3b", "\ud83e\udd8a", "quick", "\ud83d\udc3c", "\ud83d\udc2f", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "could\ud83d\udc22", "!!", "\ud83d\udc22", "\ud83e\udda2"]], [["How", "much", "would", "woodchuck", "chuck", "if", "if", "wook", "could", "chuck", "wowoquvSickod", "much", "woodchuock", "would"]], [["The", "quick", "brown", "fox", "jumps", "over", "a", "dog", "quick"]], [["this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3ccharacters", "!", "\ud83d\udc3c\ud83d\udc3c"]], [["1", "2", "", "", "5", "6", "7", "8", "9", "10", "5"]], [["H\ud83d\udc3ccharactersw", "How", "much", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "a", "wood"]], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83e\udd8a", "\ud83d\udc3ccharacters", "!"]], ["2\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd8c\ud83e\udd9ct"], [["How", "much", "wood", "would", "a", "chuck", "a", "aa", "between", "could", "wood"]], [["\ud83e\udd81", "\ud83e\udd9b", "", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "!!", "\ud83e\udd89", "\ud83e\udd8c"]], [["How", "much", "would", "a", "chuck", "a", "aa", "woodchuck", "could", "wood"]], [["", "Hello, World!", "Hello123orld!"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83c\udf1e\ud83c\udf1e", "\ud83e\uddd0", "\u2605", "\ud83c\udf08", "!"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "vS": 69.74335770313701, "woquvSick": 69.74335770313701, "anory": 69.74335770313701}], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "hello", "into", "a", "single", "string", "without", "any", "extra", "spaces", "or", "characters", "in", "between", "them"]], [["\ud83d\udc285", "Hello, World!"]], [["t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "hel\nworld", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "chthis\nstring\nhas\nmultiple\nnewleinesukck", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "hello\nworld", "hello\nworld", "hello\nworld"]], [["um", "jumps", "jums", "jum"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "9", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28", "\ud83d\udc28", "\ud83e\udd8a", "\ud83d\udc3b"]], [["This", "mucch", "How", "woo\ud83e\udd9b\ud83e\udd9bdchuck", "much", "wood0", "would", "a", "chuck", "Howmuhch", "if", "a", "woodchuck", "could", "wood", "How"]], [["1", "2", "3", "4", "", "6", "8", "9", "10", "6", "6", "3"]], [["this\nstring\nhas\nmultiple\nnewlines\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd89", "minultiple\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["How", "much", "would", "woodchuck", "chuck", "f", "if", "wook", "could", "chuck", "wowoquvSickod", "much", "woodchuock", "would", "chuck", "chuck"]], [["hello\nworld", "this\ne\nnewlines", "jumps", "dDywneedsto2\ud83e\udd8ceepuledstg", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "aa", "this\nstring\nhas\nmulntiple\nnewlines", "this\nstring\nhas\nmulntiple\nnewlines"]], [["hello\nworld", "jumps", "dDywneedsto2\ud83e\udd8ceepuledstg", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "aa", "this\nstring\nhas\nmulntiple\nnewlines", "this\nstring\nhas\nmulntiple\nnewlines"]], [["\ud83d\udc3b\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3b\ud83d\udc3b"]], [["1", "2", "3", "5", "6", "7", "8", "9", "8", "9"]], [["\ud83d\udc3b", "\ud83e\udd81", "a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83d\udc22"]], [["12", "jumwowoquvSickod", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "th6is", "jumps", "12"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22"]], ["mullnetmpiple"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "Hellsingleo,", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "vS": 69.74335770313701, "woquvSick": 69.74335770313701, "anory": 89.8627079295053}], [["\ud83d\ude00", "\ud83c\udf1e", "this", "ths", "spaces", "\u2605has", "\u2605", "!"]], [["\ud83d\ude00", "\ud83c\udf1e", "spaces", "chuck", "\u2605", "!", "\ud83d\ude00"]], [["12", "jumwowoquvSickod", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "th6is", "jumps", "12", "jum"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "a", "coculd", "woodchuck", "could", "chuck", "wood", "much"]], ["minultiple\ud83e\udd8c"], [["1", "2", "3", "4", "5woHwod", "6", "7", "8", "9", "10", "\u26051"]], [["hello\nworld", "jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultiple\nnewlines"]], [["hello\norld", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "jums", "jumps"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "s", "\u2605hass", "\u2605", "!", "13", "this"]], [["How", "", "much", "Hw", "a", "woodchuck", "chuck", "\ud83e\uddd0", "a", "could", "chuck", "wood"]], ["662\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd9ct"], [["12", "jumwowoquvSickod", "multipule", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "th6is", "jumps", "12"]], [["How", "much", "wood", "couldthis\ne\nnewlines", "would", "a", "woodchuck", "a", "coculd", "woodchuck", "could", "chuck", "wood", "much"]], ["Dywnt"], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83e\udd8a", "\ud83d\udc3ccharacters"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "without", "any", "extra", "spaces", "$", "or", "characters", "in", "between", "them"]], ["mulntiple"], ["World!"], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "jumps", "jumps", "jumps"]], [["much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wood", "a", "wood"]], [["The", "quick", "woood", "brown", "Hellsingleo, World!", "fox", "jumps", "fox", "extra", "the", "lazy", "dog", "over", "lazy"]], [["\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83e\udd89", "\ud83e\udd8c", "\ud83e\udd89"]], [["1", "2", "3", "4", "\ud83c\udf1e", "5", "6", "7", "8", "555", "", "9", "10", "list", "5", "1", "list", "5"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18", "\ud83e\udd8c\ud83e\udd8c"]], [["1", "3", "Hw\u26054", "", "66", "7", "716", "xoGhI8", "8", "9"]], [["\ud83e\udd9c\ud83e\udd9cbetweenn\ud83d\udc2f", "\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "be", "18", "bEEC", "\ud83e\udd8c", "", "\ud83e\udd89", "!!", "118", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "18", "\ud83d\udc2f", "", "\ud83d\udc2f"]], [["1", "2", "", "4", "5", "6", "7", "8", "9", "10", "2", "8", "6", "2", "5"]], [["hello\nworld", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "aa", "this\nstring\nhas\nmulntiple\nnewlines", "this\nstring\nhas\nmulntiple\nnewlines"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums", "jumps"]], [["789", "How", "much", "wood", "a", "woodchucmucchk", "if", "aa", "coDywnesedstld", "wood", "a"]], [["Hello123orld!", "662\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd9ct", "\ud83d\udc3bDywneedst", "Hello, World!", "Hello, World!", "Hello, World!", "\ud83d\udc3bDywneeedst", "Hello123orld!", "Hello, World!"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "9", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28", "\ud83d\udc28", "\ud83e\udd8a", "\ud83d\udc28"]], ["\ud83d\udc3cst"], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!", "\ud83c\udf1e"]], [["123", "456", "10", "11", "13", "14", "15", "16", "17", "18"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\n\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld"]], [["\ud83d\udc3b", "\ud83e\udd81", "", "\ud83e\udd8a", "\ud83d\udc3c", "9", "\ud83d\udc2f", "\ud83e\udd9b", "17", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b", "\ud83d\udc28"]], [["77"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "no", "hello\nworld", "this\nstring\nhas\nmulntiple\nnewlines", "this\nstring\nhas\nmultipule\nnewlines"]], [["\ud83d\ude00", "\ud83c\udf1e", "this", "\ud83e\uddd0", "spaces", "\u2605", "!", "\ud83c\udf1e"]], [["\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "", "\ud83e\udd8c", "\ud83e\udda2\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "5", "\ud83d\udc22", "\ud83d\udc3b"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewes", "hello\nworld", "hello\nworlrd", "this\nstring\nhas\nmultiple\nnewleines", "hello\nworld"]], [["abcd", "this\nstring\nhas\nmultiple\nnewlines", "lthis\nstring\nhas\nmultipule\nnewlines", "hello\nworld", "this\nstring\nhas\nmulntiple\nnewlines"]], [["\ud83d\udc3b", "lHello, ld!", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8a"]], [["t!!his\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "thist!!his\nstring\nhas\nmultiple\nnewlines", "this\nstring\nhas\nmultiple\nnewlines", "hel\nworld", "jumps", "t!!his\nstring\nhas\nmultiple\nnewlines", "this\nstring\nhas\nmultiple\nnewlines"]], [["How", "much", "wowod", "a", "chuck", "if", "a", "woodchuck", "could", "chuck", "How", "much"]], [["Dywnt\ud83e\udda2", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89Hw", "\ud83e\udd89"]], ["Hellsingleo,6"], [["Hello123orld!", "f", "Hello123orld!"]], [["How", "much", "wood", "", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "wood"]], [["How", "much", "11", "wood", "a", "woodchucmucchk", "if", "a", "could", "wood"]], [["\ud83c\udf1e", "this", "\ud83e\uddd0", "spcaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83e\udd8a", "\ud83d\udc3ccharacters"]], [["\ud83c\udf1e", "this", "\ud83e\uddd0\ud83e\uddd0", "spaces", "\u2605", "!"]], [["\ud83d\udc3b\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3b\ud83d\udc3b", "\ud83d\udc3bDywneedst"]], [["woood", "How", "much", "wood", "into", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "coucouldthis\nce\nnewlinesld", "chuck", "wood", "wood", "much", "a"]], ["FGgYu"], [["\ud83e\udd81", "\ud83e\udd89Hw", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd8c", "multipule", "newlins", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c", "\ud83d\udc22"]], [["\ud83c\udf1e", "thi\ud83d\udc3cs", "", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!", "\ud83c\udf1e"]], [["\ud83c\udf1e", "th6is", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!", "!"]], [["12", "jumwowoquvSickod", "multipule", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "th6is", "jusmps", "12"]], [["\ud83e\udd8a", "newlines\ud83e\udd9c\ud83e\udd9c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], ["owvS"], [["this\nstring\nhas\nmultiple\nnewlines", "jumps", "jumps", "jums", "jums", "this\nstring\nhas\nmultiple\nnewlines"]], [["this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3ccharacters", "!", "\ud83d\udc3c\ud83d\udc3c", "\ud83e\uddd0"]], [["How", "much", "wood", "couldthis\ne\nnewlines", "would", "a", "woodchuck", "coculd", "woodchuck", "could", "chuck", "wood", "much", "woodchuck"]], [["123", "456", "789", "10", "11", "13", "14", "15", "16", "17", "18", "789"]], [["1", "FGgYu2", "3", "", "5", "6", "8Hellsingleo, World!", "7", "8", "9", "10", "list", "5"]], ["8Hellsingleo,"], [{"any": 69.63616178329318, "woood": -44.62697367582944, "multiple": 28.986177867416473, "much": 52.12790878761069, "bEC": 69.74335770313701}], [["in", "this\nstring\nhas\nmultiple\nnewlines", "jumps"]], [["How", "much", "would", "a", "woodchuck", "chuck", "if", "if", "woodchuck", "\ud83d\udc2f\ud83d\udc2f", "could", "chuck", "wowoquvSickod", "much", "woodchuock", "would", "woodchuck"]], ["dsR"], ["qquuv\ud83e\udd81thatSic"], [["The", "brown", "fox", "over", "a", "dog", "quick"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "jumps", "this\nstring\nhas\nmultipule\nnewlines", "hello\nw14orld", "hello\nworld", "hello\nworld", "1or", "hello\nw14orld"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "aab", "\ud83e\udd89", "\ud83d\udc2f\ud83d\udc2f", "\ud83d\udc28"]], [["\ud83d\udc3b\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "between", "\ud83d\udc3bDywneedst", "\ud83e\udd89", "789", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3c\ud83d\udc3c", "\ud83d\udc3b\ud83d\udc3b", "\ud83d\udc3bDywneedst", "\ud83e\udd81"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "\ud83d\udc28\ud83d\udc28", "18", "\ud83e\udda2"]], [["\ud83d\udc3b", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2fspcaces", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "", "\ud83e\udd89", "!!", "mulntiple\ud83e\udd8c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc2f", "\ud83d\udc2f\ud83d\udc2f", "\ud83d\udc28\ud83d\udc28", "18"]], [["\ud83d\udc3b8Hellsingleo,", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "couldthis\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8a"]], ["2\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd8c\ud83e\udd9clthis\nstring\nhas\nmultipule\nnewlinest"], ["chthis"], [["\ud83e\udd81", "\ud83d\udc3c", "\ud83e\udd9b", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "wooo\ud83d\udc3ccharactersd", "\ud83e\udd8c"]], [["1", "2", "aab", "2\ud83e\udd8c", "4", "5", "6", "7", "1or", "8", "9", "10"]], [["\ud83e\uddd0"]], [["\ud83c\udf1e", "\ud83e\uddd0", "this", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "coDywnesedstld", "\u2605", "!", "\ud83c\udf1e", "\ud83c\udf1e", "\u2605"]], [["\ud83e\udd81", "\ud83e\udd89Hw", "How", "\ud83e\udd8a", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c"]], [["jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "jumps"]], [["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "18", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "!!", "\ud83d\udc22", "\ud83e\udd89"]], [["Hello123orld!", "662\ud83e\udd8ceeds\ud83e\udd9c\ud83e\udd9ct", "\ud83d\udc3bDywneedst", "Hello, World!", "Hello, World!", "\ud83d\udc3bDywneeedst", "Hello123orld!", "Hello, World!", "Hello123orld!"]], ["123"], [["Hw", "How", "much", "woHwod", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "wooood"]], [["Ho", "much", "wowod", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "How"]], [["1", "2", "3", "4", "This", "6", "99", "\u2605", "strings", "8", "555", "", "9", "10", "li8Hellsingleo,st", "5", "6"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "characters", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "5", "\ud83d\udc22", "\ud83e\udd8c"]], [["12", "jumwowoquvSickod", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "jumps", "th6is", "jumps", "12", "jum"]], [["12", "jumwowoquvSickod", "multipule", "jum", "this\nstring\nhas\nmultiple\nnewlines", "wooodjum", "th6is", "12", "multipule"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "", "\ud83e\udda2", "\ud83d\udc22", "\ud83d\udc22"]], [["\ud83c\udf1e", "\ud83e\uddd0\ud83e\uddd0", "spaces", "\u2605", "!"]], [["How", "much", "would", "woodchuck", "chuck", "if", "if", "wook", "could", "chuck", "wowoquvSickod", "much", "woodchuock", "would", "woodchuck"]], [["1", "2", "3", "4", "6", "7", "8", "9"]], [["be", "How", "much", "would", "a", "woodchuck", "chuck", "if", "wooodchuck", "a", "woodchuck", "could"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "How\ud83e\udd8c", "minultiple\ud83e\udd9b", "any", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83d\udc22"]], [["\ud83c\udf1e", "\ud83e\uddd0\ud83e\uddd0", "8Hellsingle5woHwodo, World!", "\u2605", "strings!"]], [["\u2605\ud83e\udda2", "\ud83c\udf1e", "th6is", "\ud83e\uddd0", "spaces", "\ud83d\udc3c\ud83d\udc3c", "\u2605", "!", "\ud83c\udf1e"]], [["\ud83d\ude00", "Jy", "$", "\ud83c\udf1e\ud83c\udf1e", "\ud83e\uddd0", "\u2605", "\ud83c\udf08", "!"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3ct!!shis\nstring\nhas\nmultiple\nnewlines", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8a"]], ["bHH"], [["How", "mucuh", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "could"]], [["\ud83e\udd81", "\ud83e\udd89Hw", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83e\udd9b", "\ud83e\udd8c", "multipule", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83e\udd8c", "\ud83d\udc28"]], [["A", "b", "C"]], [["x", "Y", "z", "W", "k"]], [["x", "", "y", "z"]], [["x"]], [[" "]], [["a", "ab", "abcd", "abcde", "abcdef"]], [["123", "456", "789", "10", "11", "12", "14", "15", "16", "17", "18"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "11"]], [["123", "456", "789", "10", "11", "12", "13", "14", "needs", "15", "16", "17", "18", "456"]], [["The", "quick", "brown", "strings", "fox", "jumps", "over", "the", "lazy", "dog"]], [["How", "much", "wood", "would", "thea", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "chuck"]], [["123", "456", "789", "10", "any", "11", "12", "13", "14", "string", "15", "16", "17", "18"]], ["Dr\ud83e\udd9b"], ["brown789"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], [["that", "a", "ab", "abc", "abcd", "abcde", "abcdef", "abc"]], [["123", "456", "789", "10", "any", "11", "12", "13", "14", "string", "15", "16", "17", "18", "any"]], ["without"], [["How", "much", "wood", "would", "thea", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "cchuck"]], [["a", "amuchb", "abcd", "abcde", "abcdef"]], [["a", "ab", "abcde", "abcdef"]], [["a", "amuchb", "abcd"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "18", "11"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck"]], [["123", "456", "789", "10", "11", "12", "14", "15", "16", "17", "18", "123"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "18", "\u2605", "\ud83c\udf08", "!", "\ud83c\udf1e"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck"]], [["The", "quick", "brown", "fox", "8", "jumps", "over", "the", "lazy", "dog"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["The", "qu\ud83e\uddd0ck", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["123", "456", "8789", "10", "11", "12", "\ud83e\udd9b", "14", "15", "16", "lazy", "313", "18", "11"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "a"]], ["16"], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "3113", "18", "11"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a\ud83e\udd8a", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "spaces", "or", "characters", "in", "between", "them"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!"]], [["a", "ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "abcdef"]], [["1", "2", "3", "", "5", "66", "8", "9", "10"]], [["Hello, World!", "Hello, Woworldrld!"]], [["123", "\u2605", "456", "789", "10", "11", "12", "13", "14", "15", "16", "thea", "lazy", "3113", "18", "11"]], [["ab", "abc", "abcd", "\ud83e\udd8c\ud83e\udd8c", "abcde", "abcdef"]], [["quick", "Hello, World!", "sovertrings"]], [["thhe", "The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["123", "456", "8789", "10", "11", "12", "1614", "\ud83e\udd9b", "14", "15", "16", "lazy", "313", "18", "11"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "woodchuck", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "no\nnewline\nthis\nis\na..\nlong\nstring\ud83d\udc22", "\ud83e\udd8c", "\ud83e\udd81", "woodchuck", "\ud83d\udc28"]], ["7"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "thea", "lazy", "3113", "18", "11"]], [["123", "789", "10", "11", "12", "13", "14", "15", "123", "16", "17", "18"]], ["mvVhM"], [["313", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "3113", "18", "11", "16"]], ["brown"], [["ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "abcdef"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc3b"]], [["\ud83e\udd9c", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], ["cuvYLYH"], [["a", "amuchb", "abcd", "chb", "abcde", "abcdef"]], [["123", "456", "789", "10", "11", "12", "111", "13", "14", "15", "115", "16", "17", "18"]], [["How", "much", "wood", "would", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11"]], ["brown7789"], [["123", "456", "789", "10", "11", "12", "13", "14", "115", "16", "lazy", "3113", "18", "11", "16"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "10"]], [["123", "456", "1amuchb0", "789", "10", "11", "12", "14", "15", "16", "17", "18"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "spaces", "or", "characters", "in", "between", "iin", "them"]], [["This", "is", "a", "long", "list", "of", "strings", "that", "needs", "to", "be", "concatenated", "into", "a", "single", "string", "without", "any", "or", "characters", "in", "between", "iin", "them"]], [["1", "2", "3", "", "66", "8", "11", "9", "10"]], ["1between6"], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "wouislthis", "wmultipleood", "if", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "would", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "much"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110"]], [["\ud83d\udc3b", "chuck", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much"]], [["123", "456", "114", "789", "10", "any", "11", "12", "13", "14", "string", "15", "16", "17", "18"]], [["123", "456", "10", "11", "12", "13", "14", "15", "1", "17"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd81any", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89"]], [["The", "qu\ud83e\uddd0ck", "brown", "spaces", "fox", "jumps", "the", "lazy", "dog"]], [["chara1longcters", "hello\nworld", "characters", "no\nnewline\nthis\nis\na..\nlong\nstring", "has", "this\nstring\nhas\nmultiple\nnewlines"]], ["Mt"], [["123", "456", "789", "10", "11", "12", "1", "14", "15", "16", "17", "18", "123"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], ["brownthis\nstring\nhas\nmultiple\nnewlines7789"], [["This", "is", "a", "long", "list", "of", "strings", "needs", "tto", "be", "concatenated", "into", "a", "single", "string", "without", "any", "extra", "or", "characters", "hello\nworld", "in", "between", "them"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "chuck"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd81"]], [["abc", "abcd", "\ud83e\udd8c", "abcde", "abcdef", "abc"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11", "11"]], [["qu\ud83e\uddd0ck", "brown", "spaces", "fox", "jumps", "the", "lazy", "dog"]], ["needs"], ["a.."], [["123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "17", "18"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "world", "11"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc3b"]], [["The", "qu\ud83e\uddd0ck", "brown", "spaces", "fox", "jumps", "lazy", "dog", "The"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c", "9"]], [["How", "much", "wood", "cck", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much"]], [["hello", "a", "ammuchb", "amuchb", "abcd"]], [["quick", "\ud83e\udd9c", "Hello, World!", "sovertrings"]], [["ab", "abc", "abcd", "betweenab", "\ud83e\udd8c\ud83e\udd8c", "abcde", "abcdef"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["that", "a", "ab", "abc", "abcd", "abcde", "abcdef", "abc", "a"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "wocodchuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck"]], [["a", "ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "abc8789d", "abcdef"]], [["a", "ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "ab", "\ud83e\udd8c"]], [["123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "17", "18", "13"]], [["123", "456", "789", "10", "11", "12", "111", "13", "14", "15", "115", "16", "18"]], ["browrn"], [["313", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "cotheauld", "chuck", "wood", "chuck"]], [["chara1longHello, Woworldrld!rs", "hello\nworld", "characters", "no\nnewline\nthis\nis\na..\nlong\nstring", "has", "this\nstring\nhas\nmultiple\nnewlines"]], [["111", "123", "456", "789", "10", "11", "12", "1", "14", "15", "16", "17", "18", "123"]], [["ab", "abc", "abcd", "\ud83e\udd8c\ud83e\udd8c", "abcde", "abcdef", "abcde"]], [["1", "2", "3", "", "66", "8", "11", "9", "10", "2"]], [["123", "456", "10", "11", "12", "13", "14", "15", "1", "17", "14"]], [["123", "amuchb", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11", "789"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11", "789", "13"]], ["string\ud83d\udc22"], [["woodch8789uck", "How", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "wood"]], ["lazy"], [["a", "amuchb", "chb", "313", "abcdef"]], [["123", "456", "that", "10", "11", "12", "fox", "13", "14", "15", "16", "lazy", "18", "be"]], ["160"], [["1", "2", "3", "", "66", "8", "11", "9", "10", "2", "10"]], [["The", "quick", "brown", "xfox", "8", "jumps", "over", "the", "lazy", "dog"]], [["123", "456", "789", "10", "11", "14", "15", "16", "17", "18"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "15", "16", "The", "lazy", "313", "18", "11", "11"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "11", "10"]], [["1", "2", "3", "", "66", "8", "11", "9", "10", "9"]], [["123", "16", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110"]], [["amucmhb", "a", "amuchb", "abcd"]], [["123", "456", "10", "11", "12", "13", "144", "15", "1", "17"]], [["thhe", "The", "quick", "brown", "fox", "jupmps", "over", "the", "lazy", "dog"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["123", "no", "789", "10", "11", "12", "13", "14", "15", "16", "thea", "lazy", "3113", "18", "11"]], [["\ud83d\udc3b", "\ud83e\udd81", "10", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udda2", "12", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "without", "18", "13", "12"]], [["chtock", "\ud83d\udc3b", "chuck", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8c\ud83e\udd8c", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22How", "\ud83e\udd8c"]], ["\ud83e\udd81"], [["single", "ab", "abcde", "abcdef"]], [["123", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "115", "16", "6", "313", "18", "11", "789", "13"]], [["thhe", "The", "quick", "brown", "fox", "jupmps", "over", "the", "dog"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "115", "16", "6", "313", "18", "11", "789", "13", "10", "123"]], [["\ud83d\udc3b", "chuck", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c", "\ud83d\udc3c"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83d\udc3f\ufe0f", "\u2605", "!"]], [["1", "2", "3", "", "5", "8", "9", "10"]], [["123", "16", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110", "15"]], [["123", "456", "789", "10", "11", "12", "13", "15", "16", "17", "18", "11"]], [["a", "ab", "abcd", "\ud83e\udd8c", "abcde", "achara1longctersbc8789d", "abcdef"]], [["1", "2", "3", "", "5", "66", "8", "9", "3jupmps", "10"]], [["789", "10", "11", "12", "13", "14", "15", "123", "16", "17", "18"]], [["no", "789", "10", "11", "12", "13", "14", "15", "16", "thea", "lazy", "3113", "18"]], [["123", "133", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "17"]], ["77"], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "18"]], ["abcde"], [["woodch8789uck", "How", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "wood", "wood"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "woodchuck"]], [["extra123", "456", "between789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "much", "313", "18", "11", "10", "10"]], [["a", "ab", "abcde", "abcdef", "abcde"]], [["qu\ud83e\uddd0ck", "brown", "spaces", "fox", "jumps", "the", "this\nstring\nhas\nmultiple\nnewlines", "dog"]], [["hello\nwrld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "would", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "chuck"]], [["cotheauld14", "no", "789", "10", "11", "13", "14", "15", "16", "thea", "lazy", "3113", "18"]], [["The", "qu\ud83e\uddd0ck", "brown", "sspaces", "fox", "jumps", "lazy", "dog", "The"]], [["123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "133", "16", "without", "18", "13", "133", "12", "12"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "115", "16", "6", "313", "18", "11", "789", "13", "78"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc22"]], [["123", "amuchb", "789", "10", "78", "newlines", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11", "789"]], [["much", "wood", "would", "\ud83d\udc3c", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "a"]], [["How", "much", "wood", "would", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "coulld", "chuck", "wood"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "coulld", "woodchuck", "could", "chuck", "wood", "chuck", "a", "a"]], [["6", "123", "456", "789", "10", "11", "12", "13", "14", "115", "16", "lazy", "much", "313", "18", "11", "10", "10"]], [["Ho", "much", "wood", "would", "a", "woodchuck", "chuck", "wocodchuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck"]], [["amucmhb", "a", "!amuchb", "abcd"]], [["123", "56", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "18", "\u2605", "\ud83c\udf08", "!", "\ud83c\udf1e", "18"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "would", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "Hw", "chuck"]], [["123", "456", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "17", "18", "114"]], [["123", "133", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "abc8789d"]], [["no", "789", "10", "11", "12", "13", "14", "15", "16", "", "lazy", "3113", "18"]], [["a", "ab", "abcd", "abcde", "abcdef", "abcd"]], [["hello", "amhb", "a", "ammuchb", "amuchb", "abcd"]], [["123", "456", "1a..", "789", "10", "11", "100", "\ud83e\udd81any", "1", "14", "15", "16", "17", "18", "123"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "amucmhb", "17", "18", "18"]], [["How", "much", "would", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "coulld", "chuck", "wood", "chuck"]], ["brospaceswn"], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "18", "456"]], [["123", "456", "789", "\ud83e\udd8c", "111", "12", "13", "14", "15", "16", "17", "18"]], ["\ud83c\udf1e"], [["123", "6", "10", "11", "12", "13", "14", "15", "16", "lazy", "18", "11", "10"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "thea", "lazy", "3113", "18", "11", "3113"]], [["123", "133", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "abc8789d", "11"]], [["123", "133", "4566", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "17"]], [["123", "456", "789", "10", "11", "12", "13", "15", "16", "17", "18", "11", "11"]], [["chtock", "\ud83d\udc3b", "8789", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "strings", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd81"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd9b", "9"]], [["123", "133", "4566", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "144", "15", "1", "17", "15"]], [["1", "chara1longcters", "3", "", "66", "8", "the", "9", "10"]], [["brownthis\nstring\nhas\nmultiple\nnewlines7789", "1", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "no\nnewline\nthis\nis\na..\nlong\nstring"]], [["a", "\ud83e\udd9b", "abc", "abcd", "abcdef", "ab"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "wouislthis", "wmultipleood", "iif", "a", "woodchuck", "could", "chuck", "wood"]], [["How", "much", "wood", "would", "if", "woodchuck", "chuck", "if", "a", "coulld", "chuck", "wood", "wood"]], [["1", "2", "3", "", "456", "66", "8", "11", "9", "10", ""]], [["abc", "no\nnewline\nthis\nis\na..\nlong\nstring\ud83d\udc22", "abcd", "\ud83e\udd8c", "abcde", "abcdef", "abc", "no\nnewline\nthis\nis\na..\nlong\nstring\ud83d\udc22"]], ["mvV1amuchb0hM"], [["123", "456", "1amuchb0", "7abcde89", "10", "118", "11", "12", "14", "15", "16", "17", "18"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "1jupmps0"]], [["123", "789", "10", "11", "12", "13", "\ud83e\udd8c\ud83e\udd8c", "16", "17", "18"]], [["123", "456", "10", "11", "12", "13", "14", "15", "1", "17", "1"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "77\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc3b", "\ud83d\udc3b", "\ud83d\udc3b"]], ["layzy"], [["123", "456", "1amuchb0", "7abcde89", "10", "118", "11", "12", "14", "15", "16", "17", "18", "11"]], [["How", "much", "wood", "would", "a", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much"]], [["123", "456", "789", "10", "11", "13", "14", "15", "16", "thea", "lazy", "3113", "18", "11", "3113"]], [["123", "45", "789", "10", "11", "12", "14", "15", "16", "17", "18", "123"]], [["123", "456", "789", "10", "11", "12", "15", "16", "17", "18"]], [["789", "10", "6", "11", "12", "13", "14", "15", "123", "12abc3", "16", "17", "18"]], [["456", "789", "10", "11", "12", "13", "17", "18", "11", "123!amuchb", "11"]], [["The", "qu\ud83e\uddd0ck", "brown", "spaces", "fox", "the", "lazy", "dog"]], [["between", "789", "10", "11", "12", "13", "\ud83e\udd8c\ud83e\udd8c", "16", "17", "18"]], [["123", "456", "789", "10", "11", "12", "spaces", "13", "14", "15", "16", "17", "18", "15", "10"]], [["456", "789", "10", "11", "12", "13", "17", "18", "11", "123!amuchb", "11", "123!amuchb"]], [["single", "aab", "abcde", "abcdef"]], [["123", "6", "11", "12", "13", "14", "15", "16", "lazy", "18", "11", "10"]], [["Hello, World!", "Hello, Waborld!", "Hello, Woworldrld!"]], [["123", "133", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "3jupmps", "11", "12", "13", "144", "15", "1", "abc8789d"]], [["a", "amuchb", "abcd", "amuchb"]], [["123", "456", "1amuchb0", "789", "10", "11", "12", "14", "16", "117", "18"]], [["abcdefHello, Woworldrld!", "a", "ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "abcdef"]], [["a", "ab", "abcde", "abcdef", "this", "a"]], [["123", "456", "789", "10", "11", "12", "14", "15", "16", "17"]], [["How", "much", "would", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "coulld", "chuck", "wood", "chuck", "much"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "9", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89"]], [["123", "133", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "abc878Dr\ud83e\udd9b9d", "10", "3jupmps", "11", "12", "13", "144", "15", "1", "abc8789d", "15"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "11", "a"]], ["chuck"], ["string"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc22"]], [["How", "much", "wood", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "1amuchb0chuck", "woodchuck", "much", "chuck"]], ["US"], [["a", "amuchb", "abcd", "abcde", "abcdef", "abcdef"]], [["hello\nwrld", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines"]], ["s66trsing"], ["aoQs"], [["a", "ab", "abcde", "abcde"]], [["12", "456", "789", "10", "11", "12", "13", "14", "lazyy", "15", "16", "thea", "lazy", "3113", "18", "11", "3113", "10"]], [["123", "6", "10", "11", "12", "13", "14", "15", "lazy", "18", "11", "10"]], ["The144"], [["12", "456", "789", "10", "11", "12", "13", "14", "lazyy", "15", "16", "thea", "lazy", "3113", "18", "11", "3113", "10", "12"]], [["123", "456", "10", "11", "13", "14", "15", "1", "17", "14"]], [["123", "456", "8789", "10", "11", "12", "1614", "\ud83e\udd9b", "14", "15", "16", "3123", "lazy", "313", "18", "11"]], [["The", "quick", "brown", "strings", "fox", "jumps", "over", "the", "lazy", "dog", "the"]], ["do\ud83e\udd81g"], ["cckS"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "\ud83e\udd89", "\ud83e\udd9b\ud83e\udd9b", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "would", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "Hw", "chuck", "woodchuck"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "14", "could", "chuck", "wood", "chuck", "a"]], [["no", "789", "10", "11", "12", "13", "14", "15", "16", "", "lazy", "3113", "18", "18"]], [["123", "456", "789", "10", "11", "12", "1", "14", "15", "16", "17", "18characters", "123"]], [["123", "456", "", "7879", "10", "78", "11", "1long", "13", "1", "15", "16", "lazy", "313", "18", "11"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "18", "\u2605", "\ud83c\udf08", "!", "achara1longctersbc8789d", "\ud83c\udf1e"]], ["qX"], [["quick", "\ud83e\udd9c", "Hello, World!", "sovertrings", "quick"]], [["How", "much", "wood", "would", "if", "woodchuck", "chuck", "if", "a", "coulld", "chuck", "woood", "wood"]], [["a", "ab18characters", "ab", "abcd", "\ud83e\udd8c", "\ud83d\udc2f", "abcde", "achara1longctersbc8789d", "abcdef"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89"]], [["chtock", "\ud83d\udc3b", "chuck", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc2f", "\ud83e\udd9b", "", "\ud83e\udd8c", "\ud83e\udda2", "9", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd8c"]], [["a", "abc1amuchb0d", "amuchb", "abcd"]], ["1a.."], ["9"], ["456nochuck"], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "if", "couldd", "a", "woodchuck", "could", "chuck", "wood", "woodchuck"]], [["456", "789", "10", "11", "12", "13", "17", "78", "11", "123!amuchb", "11", "123!amuchb"]], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "a", "woodchuck", "cotheauld", "chuck", "wood", "chuck"]], [["The", "qu\ud83e\uddd0ck", "brown", "spaces", "fox", "the", "lazy", "fox"]], [["a", "ab", "abcde", "ab13cde"]], [["a", "ab", "abc", "abcd", "\ud83e\udd8c", "abcde", "abc8789d", "abcdef", "abcd"]], [["123", "789", "10", "11", "12", "13", "\ud83e\udd8c\ud83e\udd8c", "16", "1", "18"]], [["123", "456", "that", "10", "11", "12", "fox", "13", "wouisld", "14", "characters", "15", "16", "lazy", "18", "be"]], [["111", "123", "456", "789", "10", "11", "12", "1", "14", "15", "world", "17", "18", "123"]], [["456", "10", "11", "12", "18characters10", "13", "14", "15", "1", "17", "14"]], [["123", "456", "10", "11", "12", "13", "14", "15", "1", "17", "12"]], [["123", "45", "789", "10", "11", "12", "14", "15", "16", "17", "or", "18", "123"]], ["1b456noetwe6en6"], [["a", "aa..b", "abc", "abcd", "\ud83e\udd8c", "abcde", "abcdef"]], [["12", "cckS", "789", "10", "11", "12", "13", "14", "lazyy", "15", "16", "thea", "lazy", "3113", "18", "11", "3113", "10"]], [["123", "456", "789", "10", "11", "12", "13", "14", "1ab18characters5", "16", "17", "18"]], [["hello\nworld", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld"]], [["456", "789", "10", "11", "12", "113", "17", "woodch8789uck", "11", "123!amuchb", "11", "123!amuchb"]], [["123", "456", "1a..", "789", "10", "11", "100", "\ud83e\udd81any", "1", "14", "15", "16", "17", "18", "123", "\ud83e\udd81any", "16"]], [["123", "456", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "17"]], ["$"], [["\ud83d\ude00", "\ud83c\udf1e", "$", "!!", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "!"]], [["123", "456", "789", "10", "111", "11", "12", "13", "14", "15", "16", "lazy", "3113", "18", "11"]], ["UeUQapP"], [["123", "amuchb", "789", "10", "78", "newlines", "1long", "13", "14", "15", "16", "lazy", "iif3\ud83e\uddd0", "18", "11", "789"]], [["The", "qu\ud83e\uddd0ck", "brown", "fox", "jumps", "the", "lazy", "dog", "dog"]], [["123", "45", "789", "10", "11", "12", "14", "15", "16", "17", "18", "123", "11"]], ["abcdefHello, Woworldrld!\ud83c\udf1e"], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83d\udc22\ud83d\udc22", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89"]], [["The", "quick", "brown", "strings66trsings", "fox", "jumps", "over", "the", "lazy", "dog"]], [["123", "789", "10", "11", "12", "13", "14", "16", "17", "18"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udda2", "9", "1", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd81"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "mucch", "woodchuck", "chuck", "if", "would", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck", "much", "Hw", "chuck", "woodchuck"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83d\udc22\ud83d\udc22", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc22", "\ud83e\udd89", "\ud83d\udc3c"]], [["much", "wood", "wouisld", "if", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "wouisld"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "a", "woodchuck", "could", "chuck", "wood"]], [["much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "woodchuck"]], [["\ud83d\udc3b", "\ud83e\udd81", "10", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udda2", "12", "\ud83e\udd9c", "\ud83d\udc22", "\ud83d\udc3b"]], ["Hello, Waborld!"], [["123", "10", "11", "12", "13", "14", "15", "123", "16", "17", "18", "11"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "if", "a", "wouisold", "woodchuck", "could", "chuck", "wood"]], ["V"], [["\ud83d\ude00", "\ud83c\udf1e", "$", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "18", "\u2605", "!", "\ud83c\udf1e"]], [["The", "quick", "brown", "fox", "jumps", "laz\ud83e\udd8cy", "over", "the", "lazy", "dog"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "11", "a", "15", "123"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "wouislthis", "wmultipleood", "iif", "aHw", "woodchuck", "could", "chuck", "wood"]], [["123", "789", "10", "11", "12", "", "\ud83d\udc2f", "13", "15", "123", "16", "17", "18"]], [["\ud83d\udc3b", "\ud83e\udd81", "\ud83e\udd8a", "\ud83d\udc3c", "\ud83d\udc28", "\ud83d\udc2f", "\ud83e\udd9b", "\ud83e\udd8c", "\ud83e\udd89", "\ud83e\udd9c", "77\ud83d\udc22", "abcdefHello, Woworldrld!\ud83c\udf1e\ud83d\udc3b", "\ud83d\udc3b", "\ud83d\udc3b"]], [["123", "456", "789", "10", "78", "11", "1long", "13", "14", "115", "16", "6", "313", "18", "11", "789", "13", "10", "123", "456"]], ["110"], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "wouislthis", "wmultipleood", "a", "woodchuck", "could", "chuck", "wood"]], [["123", "456", "789", "10", "1cotheauld14", "12", "14", "15", "this\nstring\nhas\nmultiple\nnewlines", "16", "17", "18"]], [["12newlines77893", "456", "10", "11", "12", "13", "144", "15", "1", "17"]], [["How", "much", "wood", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "1amuchb0chuck", "woodchuck", "much", "chuck", "woodchuck"]], [["no", "789", "10", "11", "12", "13", "14", "15", "16", "", "lazy", "3113", "18", "3113"]], ["1b456noetwe6enThe1446"], [["1123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "17", "18"]], ["MCUlNCjQJr"], [["no", "789", "10", "11", "extra123", "12", "14", "15", "16", "", "3113", "18"]], [["123", "133", "4566", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "17", "1", "123"]], [["quick", "\ud83e\udd9c", "144", "Hello, World!", "sovertrings"]], [["123", "6", "10", "11", "1", "13", "14", "15", "qX", "\ud83e\udd8a", "11", "10"]], [["hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "this\nstring\nhas\nmultiple\nnewlines"]], ["dWoworldrld!\ud83c\udf1e\ud83d\udc3bo110g"], [["123", "456", "1amuchb0", "789", "10", "11", "12", "14", "16", "117", "8789", "18"]], [["123", "456", "7989", "10", "78", "11", "1long", "13", "14", "115", "16", "6", "313", "18", "11", "789", "13", "78", "18"]], [["123", "456", "1a..", "789", "10", "11", "100", "\ud83e\udd81any", "1", "14", "15", "16", "17", "18", "123", "123"]], [["123", "no", "789", "10", "11", "12", "13", "14", "15woodch8789uck", "16", "thea", "lazy", "3113", "laaoQsy", "18", "11", "laaoQsy"]], [["quick", "Hello, World!", "sovertrings", "sovertrings"]], [["123", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "without", "18", "13", "12", "13", "13"]], [["How", "much", "wood", "would", "\ud83e\udd8ca", "woodchuck", "chuck", "if", "a", "woodchuck", "could", "chuck", "wood", "chuck", "odchuck", "much", "chuck"]], [["hello\nworld", "newlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "this\nstring\nhas\nmultiple\nnewlines", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines"]], [["a", "amumchb", "abcd", "amuchb"]], ["1amuchb0"], [["456", "10", "11", "12", "18characters10", "13", "14", "15", "1", "17", "14", "1"]], [["\ud83e\udd9c", "Hello, World!", "sovertrings", "cuvYLYH", "quick"]], [["123", "16", "456", "789", "10", "11", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110", "15", "456"]], [["123", "16", "456", "789", "10", "11", "Hello, Woworldrld!", "12", "13", "14", "15", "16", "lazy", "313", "18", "11", "110", "15"]], [["123", "456", "789", "10", "11", "12", "15", "16", "17", "18", "123"]], [["123", "456", "789", "10", "11", "12", "13", "14", "15", "16", "17", "18", "456"]], [["123", "456", "10", "11", "12", "13", "14", "15", "16", "amucmhb", "17", "18", "18"]], [["1", "33", "2", "3", "", "5", "66", "8", "9", "3jupmps", "10", "2"]], ["pgRzQORkD"], [["How", "much", "wood", "would", "a", "woodchuck", "chuck", "if", "a", "coulld", "woodchuck", "could", "chuck", "wood", "chuck", "a", "chubrownthisck", "a"]], [["How", "much", "wood", "wouisld", "if", "woodchuck", "chuck", "wouislthis", "wmultipleood", "iif", "a", "woodchuck", "could", "chuck"]], [["123", "133", "4566", "456no\nnewline\nthis\nis\na..\nlong\nstring", "10", "11", "12", "13", "144", "15", "1", "17", "456no\nnewline\nthis\nis\na..\nlong\nstring"]], [["123", "456", "789", "111", "78", "11", "1long", "13", "14", "15", "16", "lazy", "313", "18", "11"]], ["ammuchb"], [["\ud83d\ude00", "\ud83c\udf1e", "$", "!!", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "\u2605", "\ud83c\udf08", "114\ud83d\ude00", "!"]], ["abcdefHelflo,"], [["313", "456no", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring"]], ["a..."], ["no"], [["123", "454", "789", "10", "11", "13", "14", "1ab18characters5", "16", "17", "18", "14"]], [["1123", "9789", "456", "789", "\ud83e\udd8c", "11", "12", "13", "14", "15", "16", "17", "18", "11"]], [["123", "456", "789", "10", "11", "12", "14", "15", "16", "17", "18", "123", "11"]], ["betweenab"], [["313", "this\nstring\nhas\nmultiple\nnewlines"]], [["chara1longHello, Woworldrld!rs", "hello\nworld", "no\nnewline\nthis\nis\na..\nlong\nstring", "has", "this\nstring\nhas\nmultiple\nnewlines"]], [["a", "aa..b", "abc", "\ud83e\udd8c", "abcde", "abcdef"]], [["Hello, World!", "hello\nworld", "this\nstring\nhas\nmultiple\nnewlines", "no\nnewline\nthis\nis\na..\nlong\nstring", "hello\nworld", "hello\nworld"]], [["2", "3", "", "5", "66", "8", "9", "3jupmps", "10"]], [["1", "33", "2", "3", "", "5", "66", "8", "9", "10", "2"]], [["789", "10", "11", "extra123", "12", "14", "15", "16", "", "3113", "18"]], [["The", "qu\ud83e\uddd0ck", "brown", "spaces", "fox", "jumps", "if", "lazy", "dog", "The"]], [["amucmhb", "a", "amuchb", "1jupmps0"]], [["\ud83d\ude00", "\ud83c\udf1e", "$", "10", "\ud83e\uddd0", "\ud83d\udc3f\ufe0f", "18", "\u2605", "!", "\ud83c\udf1e"]], ["could"]], "completion": "\nfrom typing import List\n\n\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"\n return ''.join(strings)\n", "raw_completion": "```python\nfrom typing import List\n\n\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"\n return ''.join(strings)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef concatenate(strings: List[str]) -> str:\n \"\"\" Concatenate list of strings into a single string\n >>> concatenate([])\n ''\n >>> concatenate(['a', 'b', 'c'])\n 'abc'\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/29", "prompt": "from typing import List\n\n\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that start with a given prefix.\n >>> filter_by_prefix([], 'a')\n []\n >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')\n ['abc', 'array']\n \"\"\"\n", "entry_point": "filter_by_prefix", "canonical_solution": "\n return list(filter(lambda x: x.startswith(prefix), strings))\n\n", "test": "\n\nMETADATA = {\n 'author': 'jt',\n 'dataset': 'test'\n}\n\n\ndef check(candidate):\n assert candidate([], 'john') == []\n assert candidate(['xxx', 'asd', 'xxy', 'john doe', 'xxxAAA', 'xxx'], 'xxx') == ['xxx', 'xxxAAA', 'xxx']\n", "contract": "\n assert all(isinstance(s, str) for s in strings), \"invalid inputs\" # $_CONTRACT_$\n assert isinstance(prefix, str), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[], "john"], [["xxx", "asd", "xxy", "john doe", "xxxAAA", "xxx"], "xxx"]], "atol": 0, "plus_input": [[[], ""], [["abc", "abcd", "abcde"], "abc"], [["xyz", "efg", "hij"], "a"], [["cat", "dog", "bat"], "elephant"], [["apple", "banana", "orange", "apricot", "kiwi"], "ap"], [["a", "ab", "abc", "ba", "bb", "bc"], "a"], [["zzz", "zzz", "zzz"], "z"], [["hello", "world", "house"], "h"], [["apple", "orange", "banana"], "b"], [["python", "java", "javascript", "c++"], "java"], [["hello", "world", "heworldlo", "house"], "h"], [["cat", "dog"], "apricot"], [["hello", "world", "heworldlo", "house"], "hh"], ["hah", "hah"], [["world", "heworldlo", "house"], "h"], [["apple", "banana", "orange", "apricot", "kiwi"], "a"], ["apricot", "apricot"], ["orange", "apicapot"], ["aa", "a"], ["aaa", "heworldlo"], [["hello", "world", "house"], ""], ["kiwi", "z"], [["hello", "world"], ""], ["zz", "z"], ["oapricot", "apricot"], [["hello", "world", "house"], "hh"], [["apple", "orange", "hello"], "bananab"], ["aaaajavascript", "aaaa"], ["", ""], ["apriccot", "apricot"], [["xyz", "efg", "hij", "hij"], "aaaajavascript"], [["apple", "orange", "banana"], "heworldlo"], ["", "aa"], ["aaaajavascript", "aaaajavascript"], ["zzbb", "zz"], [["a", "ab", "abc", "ba", "bb", "bc"], "banana"], ["aboapricot", "boapricot"], ["kiwwi", "z"], ["aboapricot", "aboapricot"], ["boaprictot", "boapricot"], ["java", "java"], [["apple", "orange", "baanana"], "z"], ["zzbbb", "zjavascriptz"], ["zzz", "apicapoot"], ["oapricot", "appricott"], [["world", "hello", "world", "house"], ""], ["jaava", "java"], [["world", "hello", "world"], ""], [["a", "ab", "abc", "ba", "bb", "aa", "bc"], "banana"], [["hello", "heworldlo", "house"], "h"], ["a", "a"], [["python", "java", "javascript", "c++"], "javakiwwi"], [["world", "house"], "h"], ["hah", "bc"], ["aboapricot", "boaipricot"], ["jjava", "java"], [["hello", "worlwd", "worldwd", "world"], "orange"], ["kiwi", "kiwapriccotibanana"], ["jaava", "jaava"], ["hahworldwd", "hahworlhhdwd"], ["elephant", "hhh"], [["boaprictotbb", "a", "ab", "abc", "ba", "bb", "aa", "bc"], "banana"], ["world", "apric"], [["hello", "world"], "apriccot"], [["hello", "bc", "world"], ""], ["hhh", ""], [["hello", "aworlwdbcdworld"], "apriccot"], ["bkiwirt", "boaiprt"], [["apple", "orange", "aboapricot", "banana"], ""], ["world", "java"], ["oapricoelepohantt", "apricot"], ["b", "b"], ["zzbb", "jaava"], ["aboapricot", "rboapricot"], [["hello", "wdorld", "house"], ""], ["hahoerange", "bc"], ["bopaprictot", "boaprictot"], ["harboapricothh", "harboapricothh"], ["hhah", "bc"], ["orange", "apicaptot"], ["aboaprpythonicot", "boaipricot"], ["world", "wworlwdorld"], ["apriccot", ""], ["house", "zjavascriptz"], ["zjavascriptz", "house"], ["kiwapcriccotibanana", "kiwapriccotibanana"], ["bananna", "aboaprpythonicot"], ["hahlworldwd", "hahlworldwd"], ["kiwapcriccotibanana", "javva"], ["zzz", "apicaopoot"], [["hello", "world", "heworldlo"], "h"], ["aaa", "aaaajavascript"], ["h", "h"], ["apple", "kiwapriccotibanana"], ["zzbbb", "hhah"], ["aboapriczzbbbt", "rboapricot"], ["boaipricot", "boaipricot"], ["ap", "aap"], [["amy", "apple", "pams", "alligator", "maple", "mops"], "a"], [["batman"], "superman"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6"], "\u7535"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "qwe"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock"], "bu"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forward", "forgive", "foliage"], "fi"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "a"], [["", " ", "\n", "\t", "a", "ab", "abc", "abcde"], ""], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "grape", "honeydew", "jujube", "kiwi", "lemon"], "e"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "c"], ["qwe", "qwe"], ["qe", "qwe"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock", "bulldog"], "buu"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], ""], [["123", "abc", "ABC", "ab1c", "_abc", "alphabet", "abc1", "1abc"], "a"], [["", " ", "\n", "\t", "ab", "abc", "abcde"], ""], ["facetious", "facetious"], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "applpe", "honeydew", "jujube", "kiwi", "lemon"], "e"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "\u7535"], "a"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6", "\u7535\u5f71"], "\u7535"], ["bu", "\u7535\u5f71"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "cfidelity"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc_"], "a"], ["fgKilometerh", "fgh"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "burdock", "\u7535\u5f71"], ""], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "a"], [["apple", "banana", "durian", "elderberry", "fig", "applpe", "honeydew", "jujube", "kiwi", "lemon", "durian"], "e"], ["Kilometfaulter", "Kilometer"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "bu"], ["Kilometer", "Kilometer"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "ASDFGH"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampABCersand", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "bu"], [["", "\n", "\t", "a", "ab", "abc", "abcde"], "ampABCersand"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "fiburgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock", "butter"], "bu"], ["\u7535\u5b50", "aa"], ["cfidelity", "cfidelity"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "apple"], [["A SD FGH", "qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "ASDFGH"], "faceless"], ["\u7535\u5b50", "mops"], ["fgKilomkwieterh", "fgKamputeeilomkiwieterh"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "aa"], [["", " ", "\nelderberry", "\t\t", "a", "ab", "abc", "abcde"], ""], ["fgKilomkwieterh", "fgKilomkwieterh"], ["buufaceless", "buu"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock", "bulldog", "burdock"], "buu"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "as fgh", "ASD FGH"], "qwe"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "ABC"], ["qwe", "qwwe"], ["buamputeeu", "buamputeeu"], ["qwwe", "qwe"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "cfacetious"], ["qwe", "elderberryqwe"], ["qwetea", "qamiablee"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535", "abc_"], "aa"], [["123", "abc", "ABC", "application123", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "aa"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "fiburgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock", "butter"], "cfidelity"], [["amy", "apple", "pams", "applQWERTYUIOPe", "alligator", "maple", "mops"], "a"], [["abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc_"], "a"], [["", " ", "\n", "\t", "ab", "abc", "abcde", " "], ""], ["f", "f"], [["", " ", "\n", "\t", "ab", "abc", "abcde", " ", "\t"], ""], ["jujitsu", "bully"], ["f", " "], ["abc1", "abc1"], ["foothills", "jujitsu"], ["fiburgher", "facetious"], ["\u7535\u7535\u8bdd", "\u7535\u7535\u8bdd"], ["\u7535facetious", "\u7535"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535", "budget", "abc_"], "facade"], [["qwerty", "QwertY", "qwertyuiop", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "AASDFGH"], [["", "\n", "\t", "a", "ab", "abc", "abcde"], "buds"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc", "ab1c"], "QWERTYUIOP"], ["abc1", "abfanfare"], [["123", "aabc1", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "a"], ["facade", "facade"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "teea", "\u7535"], "a"], ["cfacetious", ""], ["fgKilomkwieterhABC", "fgKilofmkwieterhABC"], ["qwbulldogetea", "qwbulldogetea"], [["abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc_"], "aa"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1cabc", "abc", "ab1c"], "QWERTYUIOflabbergastedP"], ["e", "e"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh"], "ASDFGH"], [["", "\n", "\t", "a", "abbatman", "ab", "abc", "abcde"], "a\u7535\u7535\u8bddmpABCersand"], ["Kilometer", "pams"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forward", "forgive", "foliage"], "f"], ["filmbu", "bu"], ["filmbu", ""], ["alphabet", "wPwhchT"], ["qwe", "buamputefaulteu"], ["elderberryqwe", "burgher"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forgive", "foliage", "foothills"], "f"], [["amy", "apple", "pams", "applQWERTYUIOPe", "alligator", "maple", "mops"], ""], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "amy"], ["qwertyuiop", ""], ["\u7535\u7535\u8bdd", "\u7535foliage\u7535\u8bdd"], ["\u7535\u5b50", "fgKilomkwieterh"], ["QWERTYURIOP", "QWERTYUIOP"], ["ampoule", "qwe"], ["abbananac1", "aabc1"], ["forwaard", "ambulance"], [["", "\n", "\t", "a", "abbatman", "ab", "abc", "abcde", "abbatman"], "a\u7535\u7535\u8bddmpABCersand"], ["asdfgh", "abfanfare"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "qwefacetious"], [["123", "abc", "ABC", "application123", "amaze", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "aa"], ["\u7535\u7535\u8bdd\u8bdd", "\u7535\u7535\u8bdd"], ["aa", "aa"], ["burghber", "bur"], [["water", "wine", "coffee", "tea", "beer", "wwine", "cocoa", "cocoa"], "film"], ["bfilterurghber", "buambulancer"], ["c", "c"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1cabc", "abc", "ab1c"], "QWERTYUIOflabberrgastedP"], ["abc1buds", "buds"], ["buufaceless", "bu"], [["", " ", "\nelderberry", "a", "ab", "abc", "abcde"], "s fgh"], ["alphabet", "pams"], ["ab1c", "aa"], ["faceless", "faceless"], ["amy", "yamy"], ["\u5b50", "\u5b50"], ["f", "faa"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "ABC"], "amazoamputeen"], ["f", ""], ["foot\t\thiills", "foothills"], ["qwwe", "cfidelity"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "b"], ["forwaard", "banana"], [["123", "abc", "ABC", "application123", "amaze", "ab1c", "_amaple_bc", "filmabc_", "abc1", "tea"], "aabuu"], ["\u7535\u5f71", "\u7535"], ["build", "bluild"], ["abuu1", "ab1caabc1"], [["qwerty", "QwertY", "qwertyuiop", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "qwerty"], "AASDFGH"], ["qforwardwwe", "qforwardwwe"], ["dsflabbergasted", "b"], ["abfanfare", "abfanfare"], ["abbatmanABC", "ABC"], [["", " ", "\n", "\t", "ab", "abc", "abcde"], "ampoule"], ["bcocoa", "figb"], ["\u7535\u7535", "\u7535facetious"], [["abc", "ABC", "ab1c", "_abc", "1cabc", "abc_", "abc1", "1abc", "abc_"], "aa"], ["aabccqwertyuiop1", "alphabet"], ["", "ab1caabc1"], [["Joyride", "batman"], "superman"], ["ampoule", "qqwe"], ["faapplicationcade", "facade"], ["1bcabc", "1cabc"], [["water", "wine", "coffee", "tea", "beer", "wwine", "cocoa", "cocoa"], "fillm"], [["qwerty", "QwertY", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "qwe"], ["QWERTYURIPOP", "QWERTYUIOP"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "ABC", "ABC"], "aa"], ["fgKilomkwieterh", "wwine"], ["alaphabet", "pams"], ["foolish", "a\u7535\u7535\u8bddmpABCersand"], ["bur", "fgKilomkwieterhABC"], ["taea", "tea"], ["Kilometer", "\u7535\u5b50"], ["bfirllterurghber", "bfillterurghber"], ["ampoule", "wqqwqe"], [["123", "abc", "ABC", "application123", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "aaa"], ["\u7535\u5b50", "fgrKilofmkwieterh"], ["fiburgher", "qwe"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "as fgh", "asdforwardfgh", "ASD FGH"], "qwe"], [["123", "abc", "ab1c", "_a_bc", "abc_", "abc1", "\u7535"], "a"], [["amy", "apple", "pams", "alligator", "foot\t\thiills", "mops"], "a"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "jinx"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forward", "forgive", "foliage", "faceless"], ""], ["yamy", "burrow"], ["a", "aa"], ["dsfldabbergasted", "dsflabbergasted"], ["yamy", "qwwe"], ["elderberryqwe", "burgcherryher"], ["qwetea", "qamiaablee"], ["taea", "bu"], ["abcfidelityc1", "abfanfare"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "burgcherryher"], ["burdoforgiveck", "burdock"], ["burrow", "yamy"], ["bfirll", "befillterurgfhber"], [["water", "tea", "beer", "wwine", "cocoa", "cocoa", "wwine"], "fillm"], ["1bcabc", "1bcabc"], [["", "\n", "\t", "a", "abbatman", "ab", "foolish", "abc", "abcde"], "a\u7535\u7535\u8bddmprABCersand"], [["water", "wine", "coffee", "tea", "ebeer", "wwine", "cocoa", "cocoa"], "fillm"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock", "build"], "bfootf\t\thiills"], ["\u7535\u5b50", "\u7535ASDFGH\u5b50"], ["qewee", "qqwe"], ["Joyride", "qaabccqwertyuiop1qwe"], [["abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc_"], "foothills"], ["f", "kiwi"], ["ASDFGH", "ASDFGH"], ["a\u7535facetiouslaphabet", "alaphabet"], ["bureaucracy", "cfacetious"], ["elderberryqwe", "ab1caabc1"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "\n", "ASD FGH", "ASD FGH"], "qwefacetious"], ["aabc1", "bu"], [["batman", "batman"], "superman"], ["jujisu", "bbullby"], ["abfanrfare", "abfanfare"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "fgh", "tea", "\u7535", "abc_"], "aa"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampABCersand", "ampersand", "amputee", "ambulance", "amiable", "buttter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "buforgive"], ["QWERTYURIPOP", "durian"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "fgh", "tea", "\u7535", "1cabc"], "aa"], ["amy", "yam"], [["qwerty", "QwertY", "QWERTYUIOP", "ASDFGH", "as fgh", "ASD FGH"], "qwwe"], ["\u7535\u5b50", "\u7535\u5b50"], [["amy", "apple", "pams", "alligator", "1bcabc", "mops"], ""], ["dsfldabbergasted", "\u7535\u5f71"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "businsess", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "bu"], ["bbuly", "jujisu"], ["jujitsu", "fgh"], ["faapplicationcade", "facadee"], ["\u7535\u5b50", "favicon"], ["fgh", "faapplicationcade"], ["forgive", "dsflabbergasted"], ["1bcabc", "1bcabeerbamazec"], ["cocoa", "wPwhchT"], ["ococoa", "wPwhchT"], ["dsfldabbergasted", "\n"], ["jujisu", "faa"], ["fgKilometerh", "fabric"], ["fiamaze", "amaze"], ["ampoumle", "ampoule"], ["qwefacetious", "qwefacetious"], ["AASDFGH", "ab1caabc1"], ["aburrowmaze", "wwine"], ["aaa", "aa"], [["water", "wine", "coffee", "tea", "beer", "cocoa", "coffee"], "cfidelity"], ["blluild", "bluild"], ["abc1\u7535", "\u7535"], ["e", "qaabccqwertyuiop1qwe"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "1cabc", "abc", "ab1c"], "QWERTYUIOflabbergastedP"], [["qwerty", "QwertY", "qwertyuiop", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "qwerty", "ASD FGH"], "b"], ["ABC", "ABC"], ["amaze", "amaze"], ["fantajinxsy", "fantasy"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "as fgh", "asdforwardfgh", "ASD FGH"], "qwqe"], ["ambulance", "qqwewe"], ["qwerty", "cfidelity"], ["cfacetious", "b"], ["\t\talligator", "alligator"], ["amwPwhchTle", "ampoule"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "businsess", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "ffaceless", "bulge", "bulb", "bulldog", "burdock"], "bu"], ["A SD FGH", "ab1c"], ["qforwardwwe", "c"], ["fantajinxsyab", "ab"], ["qwefacetious", "qampersandwefacetious"], ["fiburgher", "fiburgher"], [["amy", "apple", "pams", "1bcabc", "mops"], "ccocoa"], ["QWERTYURIPOP", "QWERTYURIPOP"], ["fasacA SD FGHade", "facade"], [["A SD FGH", "qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "ASDFGH"], "faceleamazess"], ["FGHade", "qwwqe"], ["fidelity", "babc1\u7535u"], [["", "\n", "\t", "a", "abbatman", "ab", "abc", "bur", "_a_bca", "abcde", "a"], "a\u7535\u7535\u8bddmpABCersand"], ["br", "br"], ["faapplicactioencade", "faapplicationcade"], [["", " ", "\nelderberry", "a", "ab", "abc", "abcde", "a"], "s fgh"], ["buforgive", "buforgive"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock", "bulldog"], "amazoamputeen"], ["fiburgher", "faqaabccqwertyuiop1qwecetious"], ["durian", "ab1caabc1"], ["a", "Gigabyte"], ["alligator", "facade"], ["a\u7535\u7535\u8bddmprABCersand", "a\u7535\u7535\u8bddmprABCersand"], ["\u7535facetious", "\u7535facetious"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "burdock", "\u7535\u5f71"], "fabric"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "ASDFGebeerH"], ["forwaard", "dsflabbergasted"], ["1bbullbybcabc", "1c"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "ASDFGH", "as fgh", "ASD FGH"], "qwe"], [["water", "wine", "coffee", "tea", "beer", "cocoa"], "facadee"], ["s\u7535asdforwardfgherman", "superman"], ["1bcabeerbamazec", "1cabc"], [["", "\n", "\t", "a", "ab", "abc", "abcde", "\t"], "ampABCersand"], [["", "\n", "\t", "a", "abbatman", "ab", "abc", "abcde", ""], "a\u7535\u7535\u8bddmpABCersand"], ["burghber", "burghber"], ["forwaard", "amazon"], ["fgKilometerh", "\nelderberry"], ["ABAC", "AC"], ["1babc1\u7535bullbybcabc", "1c"], ["ubu", "1bbullbybcabc"], [["", "\n", "\t", "a", "ab", "abc", "abcde", "\n"], "ampABCersafaand"], ["bbuu", "ai"], ["bully", "bully"], ["ffaapplicationcade", "ffaapplicationcade"], ["buufaceless", "wPwhchT"], ["\u7535\u5b50", "wwine"], ["\u7535\u7535", "\u7535\u7535"], ["dsflabberfillmgasted", "dsflabberfillmgasted"], ["", "f"], ["Kilometfaulter", "1cabc"], ["fabric", "alaphabet"], ["qforwardwwe", "1abc"], [["qwerty", "QwertY", "qwertyuiop", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "qwerty", "ASD FGH"], "bubu"], ["fgrKilofmkwieterh", "\u7535ASDFGH\u5b50"], ["fghqwertyuio", "fgh"], ["filmbu", "filmbu"], ["applQWERTYUIOPe", "f"], ["ffaapplicationcade", "ffaappliocationcade"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock", "build"], "bfootf\t\thiills"], ["fig", "abfanfare"], ["yam", "qwe"], ["1bc1abc", "1bcabc"], ["abcfidelifacadeetyc1", "abfanfare"], ["abuilda", "jujube"], ["ab1cabc1\u7535facetious", "ab1cabc1\u7535facetious"], ["bfootf", "wPwhchT"], ["Kilometer", "\u7535\u7535"], ["abfanrfare", "foliage"], [["amy", "apple", "pams", "applQWERTYUIOPe", "alligator", "maple", "applQWERTUYUIOPe", "mops", "maple"], "a"], ["emon", "lemon"], ["a\u7535\u7535\u8bddmpABCersand", "a\u7535\u7535\u8bddmpABCersand"], [["", " ", "\n", "\t", "a", "ab", "abc", "abcde"], "fgrKilofmkwieterh"], ["fgKilomkwieterh", "fgrapegKamputeeilomkiwieterh"], ["fgh", "fgh"], ["forgyamive", "dsflabbergasted"], [["abc", "ABC", "ab1c", "_abc", "1cabc", "abc_", "A", "abc1", "1abc", "abc_"], "aa"], ["butter", "faqaabccqwertyuiop1qwecetious"], ["babc1\u7535bur", "babc1\u7535u"], ["ffaa", "fgKilomkwieterh"], ["bu", "QWERTYUIOP"], [["water", "wine", "coffee", "tea", "ebeer", "wwine", "cocoa", "cocoa"], "qwwqe"], ["afgKilofmkwieterhABCi", "ai"], ["Kilomete", "Kilometer"], ["ampoule", "ampoule"], ["yamy", "yamy"], ["buamputefaulteuive", "forgive"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "cfacetiousfavicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forward", "forgive", "foliage", "faceless"], ""], ["ddsfldabbergasted", "dsfldabbergasted"], ["qwertyuiop", "facadee"], ["abc1", "bu"], ["buforgive", "bufgKamputeeilomkiwieterhforfiggive"], ["abc_", "fantasy"], ["durian", "babc1\u7535bur"], ["abfanffare", "bfootf\t\thiills"], ["qwqe", ""], ["ab1caabc1", "abuu1"], ["wPwhchT", "wPwhchT"], ["foliage", "bufgKamputeeilomkiwieterhforfiggive"], ["fi", "abbananac1"], ["ampAaBCersand", "a"], ["buuu", "jujube"], ["bfilterurghber", "cbuambulancer"], [["water", "wine", "coffee", "tea", "beer", "cocoa", "cocoa"], "coffee"], ["1bcabACc", "1bcabACc"], ["\u7535\u5b50", "abfanrfare"], ["facade", "facadefacade"], ["d1abcsfldabbergastedamiable", "dsabuu1fldabbergastedamiable"], [" ", "abc1"], ["filmbu", "QWERTYURIPOP"], ["aa", "aABC"], ["Kfilometfaulr", "Kilometfaulr"], ["bfilterurghber", "bfilterurghber"], ["1bcacbc", "1cabc"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], ""], ["", "\u7535"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "as fgh", "asdforwardfgh", "ASD FGH"], "fiduciary"], ["aoambfirllterurghberputeen", "aoamputeen"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "abc"], "aa"], [["123", "abc", "ABC", "application123", "ab1c", "_a_bc", "abcab", "abc1", "tea", "\u7535"], "aa"], ["buamputeeu", "fgfh"], ["fantajinxsyab", "fantajinxsyab"], ["cfacus", ""], ["m", "qwe"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "fgh", "m", "\u7535", "abc_"], "akiwi"], ["abbanananc1", "buttteraabc1"], ["amnbulance", "qqwewe"], ["bampersanduamputeeu", "buamputeeu"], ["jujitsu", "build"], [["water", "wine", "coffee", "tea", "beer", "cocoa", "coffee"], "abcfidelityc1"], ["forgyamfive", "dsflabbergasteburdoforgiveckd"], ["fgrKilofmkwietKerh", "fgrKilofmkwieterh"], ["AASDFGH", "AASDFGH"], ["\u7535\u7535\u8bdd", "cfidelity"], ["cocoajujitsu", "cocoajujitsu"], ["qQWERTYUIOPwe", "qwe"], ["QWERTYURIOP", "QWERTYURIOP"], ["", "1abc"], ["bbuu", "bbuu"], ["facadee", "facadee"], ["bbu", "bu"], ["abare", "abfanfare"], ["", "qe"], ["qqwe", "asdforwardfgh"], [["apple", "banana", "durian", "elderberry", "fig", "applpe", "honeydew", "jujube", "ABC", "kiwi", "lemon", "durian"], "fantajinxsy"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forgive", "foliage", "foothills"], "ff"], ["applpe", "qwwe"], ["bureaucracy", "buuu"], [["123", "abc", "ABC", "ab1c", "_abc", "abc__", "1cabc", "abc", "ab1c", "abc", "ABC"], "QWERTYUIOflabbergastedP"], ["ffaa", "\u7535"], ["fidelaABCity", "babc1\u7535u"], [" alphabet", " alphabet"], [["qforwardwwe", "abc", "ABC", "ab1c", "_abc", "abc_", "bbullby", "1abc", "abc_", "abc_"], "aa"], ["jujisu", "ai"], ["bfootf\t\thiills", "bfootf\t\thiills"], ["abc1", "afgKilofmkwieterhABCi"], ["Kilometfacadefacader", "\u7535\u5b50"], ["\u7535", "abcab"], [["123", "abc", "ABC", "ab1c", "_a_bc", "abc_", "abc1", "tea", "\u7535"], "ampAaBCersand"], ["buufaceless", "a"], ["blluild", "123"], ["pams", "ab1caabc1"], ["\u7535\u5f71", "\u7535\u7535"], ["abare", "abare"], ["bfillterurghber", "forgyamfive"], ["jujisu", "jujisu"], ["abfanfare", "abcab"], ["QWERTYUIOflabbergastedemon", "QWERTYUIOflabbergastedP"], ["ab1burgcherryherc", "aa"], [["qwerty", "QwertY", "qwertyuiop", "asdfgh", "as fgh", "asdforwardfgh", "ASD FGH"], "qwe"], [["amy", "pams", "applQWERTYUIOPe", "alligator", "maple", "applQWERTUYUIOPe", "mops", "maple"], "a"], ["forgive", "dsffaultlabbergast\u5b50ed"], ["aabc1", "QWERTYURIPOforwaardP"], ["qwefacetious", "forgive"], ["burgcherryher", "burgcherryher"], ["\u7535foliage\u7535\u8bdd", "\u7535foliage\u7535\u8bdd"], ["qweetea", "qamiablee"], ["aoampputeen", "allaigator"], ["AASDFGH", "ASDFGH"], ["aaa", "buforgive"], ["wqqewqe", "wqqwqe"], ["ubu", ""], ["bud\u7535\u7535\u8bdds", "buds"], ["\nelderberryaffaa", "\u7535"], [["123", "aabc1", "abc", "ab1c", "_abc", "abc_", "abc1", "1abc", "aabc1"], "qeaabcab"], ["\u7535\u7535\u8bdd", "\u7535fo\u8bdd"], ["alligatqQWERTYUIOPweor", "alligator"], ["buttter", "batman"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "ffacelessb"], [["apple", "buforgivecherry", "banana", "cherry", "durian", "elderberry", "fig", "grape", "honeydew", "jujube", "kiwi", "lemon"], "e"], ["buforgivechherry", "buforgivecherry"], ["\u7535ffoliage\u7535\u8bdd", "\u7535ffoliagASDFGebeerHe\u7535\u8bdd"], ["fabric", "fabric"], [["fgh", "Kilometer", "Gigabyte", "Kiwi", "jinx", "jujitsu", "Joyride", "foothills", "filter", "fiduciary", "fidelity", "film", "fault", "fantasy", "fanfare", "favicon", "fabric", "facetious", "facade", "faceless", "flabbergasted", "foolish", "forgive", "foliage", "foothills"], "ABC"], ["faceless", "facealphabetless"], ["ABC", "abfanffare"], ["amazon", "ABAC"], [["", "\n", "\t", "a", "abbatman", "ab", "abc", "bur", "_a_bca", "abcde", "a"], "ebeer"], ["apWplQWERTYUbfootfIOPe", "f"], ["apple", "apple"], ["jubuforgivecherryjitsu", "bully"], ["aa", "aaa"], ["fgrKilotfmkrwieterh", "\u7535ASDFGH\u5b50"], ["Kilometer", "Kilomeer"], ["oocoa", "wPwhchT"], ["\u7535\u5b50batmtan", "\u7535\u5b50batmtan"], ["qwQWERTYURIPOPefacetious", "qwefacetious"], ["1bbullbybcabc", "1bbullbybcabc"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "businsess", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "faceless", "bulge", "bulb", "bulldog", "burdock"], "b\nelderberry"], ["bur", "qwwqe"], ["ABC", "ABAC"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc", "abc_"], "abuuu"], ["Kilometdsffaultlabbergast\u5b50eder", "1cabc"], [["water", "wine", "coffee", "tea", "beer"], "facadee"], ["ubu", "qqwqewe"], ["jujitsu", "bulluy"], ["hiills", "burdock"], ["sapplication123 fgh", "s fgh"], ["burgcherryher", "bbbuher"], ["qwwe", "qwwe"], ["fasacA", "dsfldabbergasted"], ["m", "m"], ["elderberryaffaa", "a\u7535\u7535\u8bddmpaABCersand"], ["\u7535\u5b50batmmtan", "\u7535\u5b50batmtan"], ["bbu", "buufaceless"], ["_a_bc", "fgrKilofmkwieterh"], ["bbu", "bb\u5b50u"], ["ampAaBCersand\u7535\u7535\u8bdd\u8bdd", "\u7535\u7535\u8bdd"], [["water", "wine", "ccoffee", "tea", "beer", "cocoa"], "cfidelity"], ["\u7535\u7535\u8bdd", "Kfilometfaulr"], ["filmbqwQWERTYURIPOPefacetiousu", "fiu"], ["1cabc", "b"], ["1bcacbc", "bcocoa"], ["ab11caabc1", "ab1burghber1caabc1"], ["abare", "aebare"], ["aabccfgfhqwertyuiop1", "allphfabet"], ["bureaucracy", "\u7535\u5b50batmtan"], ["burghber", "buamputeeu"], ["qwwqe1cabc", "1cabc"], ["abcfidelityc1", "ab"], ["amazon", "amazon"], ["oocab1coa", "oocab1coa"], ["s\u7535asdforwardfgherman", "spuperman"], ["wqqwqe", "ai"], ["A SD FGH", "A SD FGH"], ["afgKilofmkwieterhABCi", "afgKilofmkwieterhABCi"], ["aallphfabet", "abfanrfare"], [["water", "wine", "coffee", "tea", "beer", "tea"], "facadee"], ["abqweteacfidelifacadeetyyc1", "abcfidelifacadeetyyc1"], ["qfdwwe", "c"], ["fafaa", "fafaa"], ["foothills", "foothills"], ["forgive", "forgive"], ["bbullfasacA SD FGHadeby", "bbullby"], [["A SD FGH", "qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "ASDFGH", "ASDFGH"], "fmazes"], ["bureaucracy", "bu"], ["forward", "f"], ["dsflbbergasted", "dsfldabbergasted"], ["1bcacbc", "1bcacbc"], ["wqqewqe", "qwwe"], [["", " ", "\nelderberry", "a", "ab", "abc", "abcde", ""], "s fgh"], ["aabet", "pams"], ["\u7535\u7535", "\u7535face\u7535tious"], ["burgjujisucherryher", "yher"], [[""], "a"], [[], "xyz"], [["a", "ab", "abc"], ""], [["", "", ""], ""], [["asdf", "b", "04", "as df", "as-df"], "-"], [["", "21", "abc", "", "", "asdf"], " "], [[], "a"], [["a", "aa", "ab", "abc", "aba"], "a"], [["bcdef", "efgh", "hijk"], "a"], ["fii", "fi"], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "honeydew", "jujube", "kiwi", "lemon"], "e"], ["fgh", "\u7535"], ["fhgh", "\u7535"], [["\u7535\u5f71", "\u7535\u8bdd", "\u90ae\u4ef6"], "\u7535superman"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], ""], ["fcoffeeii", "fi"], ["fghJoyride", "fgh"], ["honeydew", "\u7535\u7535"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "ab1", "1abc"], "a"], ["alligator", "fgh"], ["\u7535", "\u7535"], ["f", "fgh"], ["fii", "cocoa"], ["faceless", "\u7535"], ["f\u7535\u7535gh", "fgh"], ["abc_", "QWERTYUIO"], ["gh", "fgh"], ["a", "application"], ["fampersandghJoyride", "fgh"], ["\t", "fgh"], ["honeydew", "\u7535honeydew"], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "honeydew", "jujube", "kiwi", "lemon"], ""], ["123", "fgh"], [["abc", "ABC", "ab1c", "_abc", "abc_", "ab1", "1abc"], "a"], ["qwecherry", "qwe"], ["honeydeww", "burgher"], ["fii", "tea"], ["fampegrsandghJoyride", "fgh"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6"], "forward"], ["abelderrberry", "abelderberry"], ["hfiduciaryew", "hfiduciaryew"], ["fghh", "forgive"], ["fii", "jujube"], ["bulb", "\u7535"], ["banana", "banana"], ["abc_", "QWERTYUIUO"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "fanfare"], ["fampegrsandghJoyride", "fampegrsandghJoyride"], [["\u7535\u5f71", "\u7535\u5b50", "\u90aekiwi\u4ef6", "\u7535\u8bdd", "\u90ae\u4ef6"], "forward"], ["hfiduciaryew", "tea"], ["facelaess", "\u7535"], [["fii", "123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], ""], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "ab1", "1abc"], "aa"], ["qwecherry", "we"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u7535\u7535\u5b50", "\u90ae\u4ef6"], "\u7535"], [["123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "\u7535\u8bdda"], ["foliage", "ab"], ["honeydGigabyteew", "\u7535\u7535"], ["honeydew", "1abc"], ["burdocdk", "fgh"], ["fii", "jjujube"], ["jjujubeaa", "a"], ["bbfacelaessu", "bbu"], [["\u7535\u5f71", "\u7535\u8bdd"], "\u7535superman"], ["forgive", "a"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "QwertY"], "qwwe"], ["hqwertyuioponeydew", "honeydew"], ["a", "burdocdk"], ["fhghh", "forgfcoffeeiiive"], ["fii", "jujubealphabet"], ["fcoffeeii", "fgh"], ["bulb", "fighoneydGigabyteew"], ["wine", "qwwe\u7535"], ["mops", "qwertyuiop"], [["fii", "123", "abc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "qwwe\u7535"], [["123", "abc", "ab1c", "_abc", "abc_", "ab1", "1abc"], "aqwecherry"], ["fii", "facetious"], ["fiburdocki", "a"], ["abelderrberry", "abelderrberry"], ["hfiduciaryew", "qwe"], [["apple", "banana", "cherry", "durian", "honeydewburgher", "elderberry", "fig", "grape", "honeydew", "jujube", "kiwi", "lemon"], "e"], ["facelaessbatmanh", "fgh"], ["fii", "jujubue"], ["fanfare", "\u7535"], ["jjinx", "jinx"], ["kiwi", "\u90aekiwi\u4ef6"], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "honeydew", "jujube", "kiwi", "lemon"], "honeydewburgher"], ["honeydewburgher", "honeydewburgher"], ["bbfacelaessu", "ubbu"], ["fhgfhh", "fhghh"], ["f", "ABC"], ["facwineeless", "forgive"], ["QWERTYUIO", "qwe"], ["jjujubeaa", "ASD FGH"], ["abeldery", "abelderrberry"], ["fanfare", "f\u7535\u7535gh"], ["cocofghh", "cocoa"], ["we\u7535", "\u7535"], ["\u90ae", "foliage"], ["abc_", "abc_"], ["f\u7535\u7535gh", "f\u7535\u7535gh"], [["123", "abc", "ABC", "ab1c", "_abc", "durian", "abc_", "1abc"], "amorous"], ["burdocd\u90ae\u4ef6k", "fgh"], ["pamsfii", "jjujube"], ["fcoffeeii", "\u7535\u8bdda"], ["\u90ae\u4ef6", "fiduciary"], ["honeydew", "oneydew"], ["qwecherwghry", "qabcwecherwry"], ["cocofghh", "fi"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6", "\u7535\u5b50"], "hqwertyuioponeydew"], ["f\u7535\u7535gh", "f\u7535\u7535ghfavicon"], ["f\u7535\u7535gh", "f\u7535\u7535ghfaon"], ["f", "maple"], ["facelaessbatmanh", "\u7535\u7535"], ["amazon", "\u7535superman"], ["fantasy", "jinx"], ["fii", "fii"], ["fiif", "fi"], ["qwecdurianherry", "we"], [["\n"], "superman"], ["SffUs", "BOY"], ["winne", "winnfoolish"], ["amazon", "a"], ["ffii", "fi"], ["amazon", "fighoneydGigabyteew"], [["amy", "apple", "pams", "amputee", "maple", "mops", "apple"], "a"], ["cocofghh", "fijujubealphabet"], ["1abc", "fhghh"], ["hfiduciaryew", "foliage"], ["fhghh", "fhghh"], ["abc_", "QWERTYUIRO"], ["azmazon", "amazon"], ["yfampegrsandghJoyride", "abcfgh"], ["fhgfilterh", "\u7535"], ["fhghh", "\u7535\u8bdda"], ["amazolemonn", "amazoon"], ["foothills", "fhgfilterh"], ["SffUs", "\u7535"], ["ejjujube", "jjujube"], [["123", "abc", "ABC", "ab1c", "abc_", "abc1", "1abc"], "fanfare"], ["QwertY", "fii"], ["fcoffeeifi", "burgher"], ["ifii", "jujubfhghe"], ["honeydew", "ohqwertyuioponeydewew"], ["fi", "fi"], ["SffUs", "SfffUs"], ["jiinx\u90aei\u4ef6", "fantasy"], ["ASD FGH", "\u7535\u7535"], ["bbefacelaessu", "bbuubbu"], ["jjinx", "jxinx"], ["maplp", "maplpe"], ["babc_", "abc_"], ["abac_", "abc_"], ["azmazon", "SfffUs"], ["honeydew", "howneydew"], [["\u7535\u5f71", "\u7535\u8bdd"], "\u7535supesrman"], [["\u7535\u5f71", "\u7535\u5b50", "\u90aekiwi\u4ef6", "\u7535\u8bdd"], "forward"], ["batman", "\u7535"], ["facade", "jjujube"], ["f\u7535\u7535gh", "application"], [["\u7535\u5f71", "\u7535\u8bdd", "\u90ae\u4ef6"], "\u7535"], ["honeydew", "\u7535\u7535forward"], ["\t", "\t"], ["wwe", "we"], ["fi", "\u7535"], ["abc1", "fighoneydGigabytfhghyeew"], ["mops", "mops"], ["foliage", "foliage"], ["fiif", "ifi"], ["abeldberrberry", "abelderrberry"], [["qwerty", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH", "ASDFGH"], "qwe"], ["burdocddk", "burdocddk"], ["abac_", "burGigabytedocodkfgh"], ["foothills", "qwecdurianherry"], ["fcoffebureaucuracyeiSfffUsi", "fcoffeeii"], ["amazolemonn", "bbuubbu"], ["mapl", "maplpe"], [["bman"], "superman"], ["f", "fiduciary"], [["apple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock"], "bbu"], [["bman"], "suhowneydewpefhghrman"], ["\t", "facelaess"], ["bu", "qabcwecherwry"], ["fhgh", "1abc"], ["fighoneforwarddGigabytfhghyeew", "fighoneforwarddGigabytfhghyeew"], ["bbbuubbu", "bbbuubbu"], ["a", "cocoa"], [["apple", "banana", "cherry", "durian", "honeydewburgher", "elderberry", "fig", "grape", "honeydew", "jujube", "kiwi", "lemon"], "ambulance"], ["fhgfhh", "\u7535\u7535"], ["qwertyuiop", "fghazmazon"], ["fiburcki", "a"], ["f1ab", "facetious"], ["amperabeldberrberryand", "foiburdocki"], ["qwecdurjinxry", "we"], ["fhghhfacelaessbhatmanh", "afijujubealphabet\u7535\u8bdda"], [["apple", "banana", "cherry", "durian", "elderberry", "fig", "kiapplicationwi", "honeydew", "jujube", "kiwi", "lemon"], "honeydewburgher"], ["fgifiih", "f"], ["winne", "abelderberry"], ["ccocofghhocofghh", "fi"], ["ASD", "abelderberry"], ["fhjujubfhghegh", "fhgh"], ["bu", "\u90aekiwi\u4ef6"], ["abc_", "jinx"], ["SffUs", "SfsfUs"], ["SffUUs", "SffUUs"], ["\u7535\u7535", "\u7535a\u8bdda"], ["fbananaary", "fbananaary"], ["\u7535\u7535\u7535", "\u7535\u7535"], ["azmazaon", "qwecdurianherry"], ["ampersand", "ampersand"], ["amfbananaaryperabeldberrberryand", "ubbu"], ["\tpamsfii", "fghh"], ["fhgfhh", "\u7535wqwe\u7535"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6", "\u7535\u5b50"], "amperabeldberrberryand"], ["bbulb", "ASDFGH"], ["f\u7535\u7535gh", "f\u7535\u7535ghfaflabbergastedon"], ["123", "\u7535"], ["\u7535honeydew", "fii"], ["mapl", "a"], ["f1ab", "\u90aekiwi\u4ef6"], ["banana", "fampegrsandghJoyride"], [["qwerty", "asdfgh", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "as fgh", "ASD FGH"], "qwe"], ["QwertY", "QwertY"], ["ifi", "fi"], ["\n", "\n"], [["123", "ab", "abc", "ABC", "ab1c", "abc_", "abc1", "1abc", "abc_"], "lemon"], ["SffUUs", "fhgh"], ["SUfsfUs", "SUfsfUs"], ["f\u7535\u7535gh", "f\u7535\u7535ghh"], ["fghazmazon", "fighoneydGigabyteew"], [["qwerty", "asdfgh", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "favicon", "ASD FGH"], "qbatmanwne"], ["fabric", "fhghh"], ["fgh", "bbbuubbu"], ["fiburddocki", "a"], ["honeydew", "abc_"], ["hfiduew", "hfiduciaryew"], ["fii", "fiii"], ["fantasy", "fatasy"], ["abelrderberry", "abelrderberry"], [["\u7535\u5f71", "\u7535\u5b50", "\u7535\u8bdd", "\u90ae\u4ef6"], "\u7535\u7535"], ["amazolemonn", "amazzoon"], [["appple", "application", "airport", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock"], "bbu"], ["qwehoneydewburgher", "qwe"], [["fii", "123", "abc", "ABC", "ab1c", "bbulb", "abc_", "abc1", "1abc"], "qwwe\u7535"], ["fb1ab", "\u90aekiwi\u4ef6"], ["fii", "ju\u7535wqwe\u7535jube"], ["bcoffeebulb", "ASDFGH"], ["qfwecdurianher\u7535\u7535\u7535ry", "foothills"], ["f\u7535\u7535gh", "Kilometer"], ["fighoneydGigabytfhghyeew", "fighoneydGigabytfhghyeew"], ["tea", "tea"], ["Kilometer", "ifi"], ["efacelaessburdocddk", "facelaessburdocddk"], ["\u7535honapplicationeydew", "\u7535honeydew"], ["bbuuubbu", "gh"], ["cherrybanana", "banana"], ["batmabn", "batman"], ["coocofampegrsandghJoyridefghhwine", "coocofghhwine"], ["fhgh", "fh"], ["amazolemonn", "amaazoon"], ["fhgh", "1ab"], ["fantfhgfilterhasy", "fantasy"], ["jiinx\u90aei\u4ef6", "jiinx\u90aei\u4ef6"], ["fiig", "fig"], ["fggh", "bbbuubbhoneydewu"], ["\u7535SffUs\u7535", "\u7535\u7535"], ["ampersand", "abelderberry"], ["A", "ASDFGH"], ["\t", "forgfcoffeeiiivefg"], ["jjin\u7535SffUs\u7535x", "jxinx"], ["\u7535superman", "\u7535superman"], ["alligator\t", "\t"], ["amperabeldberrberryandjujubfhghe", "jujubfhghe"], [["\u7535coffee\u5f71", "\u7535\u8bdd"], "\u7535supesrman"], ["fighoneydGigabytfhghyeamazolemonnew", "fighoneydGigabytfhghyeew"], ["fbanyanaary", "fbananaary"], ["fighoneydGigabytfhghyeama\u90aezolemonnew", "fighoneydGigabytfhghyeew"], ["bu", "qabecwbbuy"], ["jujube", "1ab"], ["hfiduciaryew", "fiii"], ["mops", "12fgifiih3"], ["oneydew", "oneydew"], ["ASD FGH", "ASD FGH"], ["cocofghh", "f\u7535\u7535ghfaflabbergastedon"], ["honeydew", "\u7535"], ["bappleman", "fatasy"], ["hqwertyuioponeydew", "hqwertyuioponeydew"], ["bb\u7535coffee\u5f71uuubbu\u90aejjinx", "gh"], ["qwecdurianherry", "qwecdurianheramiablery"], ["ccocofghhocofghh", "fantfhgfilterhasy"], ["jujubue", "jiinx\u90aei\u4ef6"], ["facelaess", "facelaess"], ["foiburdockia", "foiburdockia"], ["a", "applicaburdocktabcion"], ["faecelaess", "fgghh"], ["alphabet", "\u90aekiwi\u4ef6"], ["hqwertyuioponeydew", "hqwerty\u7535supesrmanuioponeydew"], ["jjujubeaa", "bbu"], ["fabelderrberrygh", "fabelderrberrygh"], ["\u7535\u7535\u5b50burrow", "burrow"], ["ftoothills", "qwecdurianherry"], ["jiinx\u90aei\u4ef6", "fbbuuubby"], ["ba\nbc_", "abc_"], ["\u7535suuperman", "\u7535superman"], ["qwerty", "\u7535\u7535\u8bdda"], ["\u7535supean", "\u7535superman"], ["\u7535\u7535", "\u7535ifiiju\u7535wqwe\u7535jube"], ["fantfhgfilterhasy", "fantasay"], ["burdocdk", "oneydew"], ["abelerbry", "abelerry"], [["fii", "123", "aabc", "ABC", "ab1c", "_abc", "abc_", "abc1", "1abc"], "qwwe\u7535"], ["fighoneydGigabytfhghyeew", "\n"], ["bb\u7535coffee\u5f71uuubbu\u90aejojinx", "bb\u7535coffee\u5f71uuubbu\u90aejjinx"], ["ae", "a"], [["\u7535\u5f71", "\u7535\u5b50", "\u90aekiwi\u4ef6", "\u7535\u8bdd"], "forwardburGigabytedocodkfgh"], ["\u7535fhgh", "\u7535"], ["abelerbry", "alligator\t"], ["gfhgfhh", "gfhgfhh"], [["appple", "application", "alligator", "alphabet", "ampoule", "amazon", "amorous", "amaze", "ampersand", "amputee", "ambulance", "amiable", "butter", "budget", "buds", "bureaucracy", "burgher", "business", "burrow", "build", "bully", "bulge", "bulb", "bulldog", "burdock"], "bbu"], [["maplp"], "suhowneydewpefhghrman"], ["amperabefoothillsldberhqwertyuioponeydewrberryand", "amperabeldberrberryand"], ["fcoffeeii", "fcoffeeii"], ["\u7535\u7535forward", "abelderberry"], ["bannana", "banana"], ["qfwecdurianher\u7535\u7535\u7535ry", "qfwecdurianher\u7535\u7535\u7535ry"], ["ejjujube", "amiable"], ["\u7535", "\u7535\u7535"], ["fhwine", "fhwine"], ["qwwe\u7535", "\u7535qwwe\u7535"], ["qwecdurianheramiableryfoothills", "qwecdurianherry"], ["fighoneydGigabw", "fighoneydGigabyteew"], ["mopss", "mops"], ["fh", "bbuu"], ["acade", "efacelaessburdocddk"], ["lalligator\t", "lalligator\t"], ["a", "aforgive"], ["burgher", "burgher"], ["alligator\t", "\tffb1abault"], ["fighoneydGijjujubeaagabyteew", "fighoneydGigabyteew"], ["abcc_", "abc_"], ["jjinx", "fabelderrberryi"], ["abelderberry", "abelderberry"], ["burGigabytedocodkfgh", "burGigabytedocodkfgh"], ["foigve", "forgigve"], ["fhjujubfhghegh", "bbu"], ["ASADFGH", "ASDFGH"], ["f\u7535\u7535ghfaviconabc_", "f\u7535\u7535ghfaviconabc_"], ["abelrderemopssberry", "abelrderberry"], ["ffii", "fiburddocki"], ["filter", "fhghapplicaburdocktabcionhfacelaessbhatmanh"], ["jujubealphabet", "\u7535"], ["QWERTYUIOP", "QWERTYUIOP"], ["honeydew", "honeydew"], ["honeyde", "1abc"], ["bu", "\u7535superman"], ["Kilometemapl", "azmazon"], ["\tpamsfii", "gh"], ["bb\u7535coffee\u5f71uuubbu\u90aejojinx", "fabelderrberryi"], ["FGH", "bbuu"], ["fbbuuubby", "QWERTbuYUIOP"], ["jujubealphabet", "film"], ["fggh", "bbbuubbu"], ["\u7535\u7535forwardKilometemapl", "\u7535\u7535forward"], ["fiigh", "fiigh"], ["fcoffebureaucuracyeiSfffsi", "fcoffeeii"], ["eQwertaY", "\u7535\u8bdda"], ["ccocofghhocofghh", "\u7535superman"], ["babc_", "qabecwbbuy"], ["ab", "ftoothills"], ["fcoffeeii", "facelaessbatmanh"], ["fcoffeeii\u7535superman", "\u7535\u8bdda"], ["howneydewfghJghoyride", "fghJoyride"], ["fighoneydGigabyteew", "\u7535\u8bdda"], ["watreer", "water"], [["apple", "banana", "cherry", "durian", "honeydewburgher", "elderberry", "fig", "grape", "honeydew", "jujube", "kiwi", "cocofghh", "lemon"], "ambulance"], ["efacelaessburdocd", "facelaessburdocddk"], ["qabcwecherwry", "hfidrew"], ["kiwi", "kiwi"], ["amaazflabbergastedoon", "amazolemonn"], ["\u7535honeydew", "fi"], ["bulance", "ambulance"], ["fggh", "buds"], ["fiburcki", "fiburcki"], ["apple", "efacelaessburdocd"], [["qwerty", "asdfgh", "\u7535a\u8bdda", "QwertY", "qwertyuiop", "QWERTYUIOP", "asdfgh", "ASDFGH", "favicon", "ASD FGH"], "qbatmanwne"], ["f\u7535\u7535gh", "bulge"], ["heoneydew", "heoneydew"], ["fijujubealphabet", "bbbuubbu"], ["bb\u7535coffee\u5f71uuubbu\u90aejojinx", "winne"], ["honeydGigabyteew\t", "honeydGigabyteew\t"], ["\u7535\u7535\u5b50", "FGH\u7535\u7535\u5b50"], ["Joyride", "\u7535"], ["jujubue\u7535", "jujubue\u7535"], ["fgh", "bbbu\u7535\u7535ubbu"], [["123", "fabric", "ab1c", "_abc", "abc_", "ab1", "1abc"], "aqwecherry"]], "completion": "\nfrom typing import List\n\n\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n return [s for s in strings if s.startswith(prefix)]\n", "raw_completion": "```python\nfrom typing import List\n\n\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n return [s for s in strings if s.startswith(prefix)]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nfrom typing import List\n\n\ndef filter_by_prefix(strings: List[str], prefix: str) -> List[str]:\n \"\"\" Filter an input list of strings only for ones that start with a given prefix.\n >>> filter_by_prefix([], 'a')\n []\n >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')\n ['abc', 'array']\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/30", "prompt": "\n\ndef get_positive(l: list):\n \"\"\"Return only positive numbers in the list.\n >>> get_positive([-1, 2, -4, 5, 6])\n [2, 5, 6]\n >>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n [5, 3, 2, 3, 9, 123, 1]\n \"\"\"\n", "entry_point": "get_positive", "canonical_solution": "\n return list(filter(lambda x: x > 0, l))\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([-1, -2, 4, 5, 6]) == [4, 5, 6]\n assert candidate([5, 3, -5, 2, 3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 3, 9, 123, 1]\n assert candidate([-1, -2]) == []\n assert candidate([]) == []\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[-1, -2, 4, 5, 6]], [[5, 3, -5, 2, 3, 3, 9, 0, 123, 1, -10]], [[-1, -2]], [[]]], "atol": 0, "plus_input": [[[0, 1, -1, 2, -2, 3, -3, 4, -4]], [[1, -1, 2, -2, 3, -3, 4, -4, 0]], [[1, 2, 3, 4]], [[0, 0, 0]], [[-1, -2, -3, -4]], [[-5, -4, -1, 0, 1, 4, 5]], [[7, 8, 10, 11, 12, 15, 17, -1]], [[5, 9, -3, -6, 2, 3, 8, 1, 0]], [[-2, -4, -6, 0, 2, 4, 6]], [[10, -10, 15, -15, 20, -20, 25, -25]], [[10, -10, 15, -3, 20, -20, 25, -25]], [[-1, -1, -3, -4, -1]], [[1, 0, 0]], [[-2, -1, -1, -3, -4, -1]], [[-5, -4, -1, 0, 1, 4]], [[0, -1, 2, -2, 3, -3, 4, -4, -2]], [[-5, -4, -1, 0, 1, 4, 1]], [[0, 1, 1, 2, -2, 3, -3, 4, -4]], [[10, -10, 15, -3, 20, -20, 25, -25, -20]], [[5, 9, -3, -6, 2, 3, 8, 1, 1]], [[0, 0]], [[-5, -4, -1, 1, 4]], [[-5, 8, -1, 0, 1, 4]], [[1, 2, 4, 4]], [[-1, -3, -1]], [[-5, 0]], [[7, 8, 11, 12, 15, 17, -1]], [[10, 15, -3, 20, -20, 8, -25]], [[1, 17, 2, 2, 4, 4]], [[-5, -4, -1, 9, 0, 1, -10, 5]], [[0, -5, -4, -1, 5, 0, 4, 1]], [[-1, -3, -2, -1]], [[-1, -3, -2, -1, -1]], [[5, 9, -4, -6, 2, 8, 1, 1]], [[-1, -1, -3, -4, -2, -1]], [[0, -5, -4, -1, 5, 0, 4, 1, 4, 0]], [[-2, -1, -1, -3, -4, -1, -1]], [[-1, 8, -3, -15, -1, -1]], [[-2, -1, -1, -3, 10, -1]], [[10, -10, 15, -3, 20, -20, 25, -20]], [[5, 9, -6, 2, 3, 8, 0]], [[-2, -1, -1, -3, -4, -1, -3, -1]], [[0]], [[-5, -4, 0, 1, 4]], [[-5, 8, -1, 0, 4, -5]], [[7, 8, 11, 12, 15, 17, -1, 11]], [[-2, -1, -1, -3, 6, 9, -4, -1]], [[]], [[10, -10, 15, -3, 20, -20, 25, -20, -10]], [[1, -1, 2, -2, 3, 4, -4, 0]], [[10, -10, 3, -3, 20, -20, 25, -20, -10, 3]], [[-5, 8, -1, 0, 1, 4, -1]], [[-1, -1, -3, -4, -1, -1, -1, -1]], [[10, -10, 15, -3, 20, -20, 25, -20, -20, 15]], [[1, -1, 2, 3, 4, -4, 0]], [[1, -1, 2, 3, 4, -4, 0, 4]], [[5, 9, -3, -6, 2, 3, 10, 1]], [[1, -1, 2, -2, -3, 4, -4, 0]], [[-20, -5, -4, -1, 0, 1, 4]], [[5, -3, -6, 2, 3, 10, 1, 5]], [[10, 15, -3, 20, -20, 8, -25, 20]], [[1, -1, 2, -2, -3, 4, -4, 0, 1]], [[3, -3, 20, -20, 25, -20, -10, 5, 3]], [[10, -10, 15, -3, 20, -20, 25, -20, -5]], [[10, -10, 15, -3, 20, -20, 19, 25, -20, -5, 15]], [[10, -10, 10, 3, -3, 20, -20, 25, -20, -10, 3]], [[-2, -1, -1, -3, -1]], [[1, -1, 2, -2, -3, 4, -4, 0, 4]], [[10, 10, -10, 15, -15, 20, -20, 25, -25, 25]], [[-5, 8, 1, -1, 0, 1, 4, -1]], [[0, -5, -4, -1, 5, 0, -10, 1]], [[-1, -1, -1, -3, -4, -1, -1, -1, -1]], [[5, 9, -3, -6, 2, 3, 8, 1, -4, 2]], [[1, -1, 2, -2, -3, 4, -4, 0, 4, -3]], [[-3, 20, -20, 25, -20, -10, 5, 3]], [[1, -1, 2, -2, -3, 4, -4, 0, 0]], [[9, -2, -1, -1, -3, 6, 9, -4, -1]], [[-5, -4, -1, 0, 1, 5, 4, 5, 4]], [[-2, -1, -1, -3, -4, -2, -1]], [[1, -1, 1, -2, 3, -3, 4, -5, -4, 0]], [[-2, -1, -1, -3, -4]], [[-5, -4, -1, 1, 1, 4]], [[10, -10, 15, -3, 20, -20, 26, -20, -10]], [[1, -1, 2, 4, 4, -4, 0, 4]], [[-1, -3, -2, -1, 0, -1]], [[1, -1, 2, -2, -3, 4, -4, -1, 4]], [[0, -5, -4, -1, 5, 0, -10, 1, -10]], [[1, -1, 2, -2, -3, 4, -4, 0, 0, 0]], [[-5, -4, -1, 0, 1, 6, 1]], [[1, -1, 1, 3, -3, 4, -5, -4, 0]], [[-4, -4, -1, 0, 1, 5, 6, 1, 1, -1]], [[1, -1, 2, -2, -3, 4, -4, 0, -1]], [[5, 7, 8, 11, 12, 15, 17, -1]], [[-2, -1, -1, -4, -1]], [[5, 5, 9, -3, -6, 2, 3, 8, 1, 1]], [[1, -1, 3, 4, -4, 0, 4]], [[-4, -5, -4, -1, 0, 1, 4, 5]], [[-1, 8, -3, -15, -1]], [[-5, 8, -1, 0, 4]], [[5, 9, -3, -6, 2, 3]], [[0, -1, -2, -3, -4, -5]], [[1, 2, -4, -5, 0, 6, 7, -9, 10]], [[-1, -2, -3, -4, 5, 0, 6, 7, -9, 10]], [[-5, -4, -3, -2, -1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[-1]], [[0, -1]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6]], [[5]], [[0, -1, -3, -4, -5]], [[1, 2, -4, -5, 0, 6, 7, 2, -9, 10]], [[1, 2, -4, -5, 0, 6, 7, -9, 10, 10]], [[0.5, -4, 2.5, 5, -2.2, -8, -7, -10.5, 9.9, -10.5]], [[1, 2, -4, -5, 0, 6, -9, 10, 6]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2]], [[1, 2, -4, -5, 0, 0, 6, 7, -9, 10, 10]], [[-1, -2, -3, -4, 6, 0, 6, 7, -9, 10]], [[-5, -1]], [[-1, -7, -1, -1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2]], [[-1, -2, -3, 5, -5, 6, 7, -9, 10]], [[1, 1]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 7]], [[-1, -2, -5, -3, 2, -4, 6, 0, 6, 7, -9, 10]], [[-2, -3, -4, 6, 0, 6, 7, -9, 10, -3]], [[-1, 2, -9, -4, -4, 7, -100, 1, 0]], [[-1, -2, -5, -3, -3, -4, 6, 0, 6, 7, -9, 8, 10]], [[1, 2, -1, -5, 0, 6, 7, -9, 10]], [[0, -9]], [[-9]], [[1, 2, 3, -4, -5, 0, 6, 7, -9, 10]], [[0.5, -4, 2.5, 5, -2.2, -8, -4, -7, -10.5, 9.9, -10.5]], [[6, -5, -4, -3, -2, -1, -5, -1]], [[-8, -8]], [[-2, 10, -4, 6, 0, 6, 7, -9, 10, -3]], [[1, 1, 2, -1, -5, 0, 6, 7, -9, 10]], [[6, -5, -4, -1, -3, -2, -1, -5, -1]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, -9]], [[8, -7, -1, -1]], [[-2, -3, -4, 6, 0, 6, 7, -9, 10, -3, -9]], [[1, 1, 1, -8, 1, 1, 2, 2, 2, 2, 2, 2]], [[0, -5, -1, -3, -4, -5]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -3, -2.25]], [[1]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0]], [[1, 1, 1, 1, 1, 2, 2, 2, 1, 2]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9]], [[1, 2, 3, -4, -5, 0, 6, -9, -5, 10]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2]], [[1, 2, -4, -5, 0, 6, 7, -9, 10, 9]], [[-5, -4, -3, 5, -1]], [[-9, -9]], [[0, -1, -3, -4, -5, -4]], [[1, 2, -4, 1, -5, 0, 0, 6, 7, -9, 10, 10]], [[6, -5, -4, 8, -3, -2, -1, -5, -1]], [[1, 2, -4, -5, 0, 0, 6, 7, -9, 10, 10, 6]], [[-1, -2, -5, -3, -4, 6, -3, 0, 6, 7, -9, 10, 5]], [[-1, -2, -3, -4, 5, 0, 6, 7, -9]], [[-9, -9, -9]], [[-1, -2, -4, 5, 0, 5, 7, -9]], [[1, 2, -4, -5, 0, 6, -9, 10, -4]], [[6, -5, -4, 8, -8, -2, -1, -5, -1]], [[1, 2, -4, -5, 0, 7, -9, 10, -4]], [[1, 2, -4, -5, 0, 1, 6, 7, -9, 10]], [[-2, 10, -4, 6, 0, 6, 7, -9, 10, -3, -4]], [[0.5, -4, 2.5, 5, -2.2, -8, -4, -7, 9.9, -11.18889279027017, -10.5]], [[-8, -8, -8]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0, 0]], [[-1, 2, -9, -4, -4, 7, -100, 1, 0, 2]], [[1, 2, -1, -5, 0, 6, 7, 10]], [[1, 0, -1]], [[-1, -5, -5, -3, -4, 6, 0, 6, 7, -9, 10, 7]], [[1, 1, 2, -1, -5, 11, 6, 7, -9, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1]], [[1, 2, -4, -5, -5, 6, -9, 10, 6]], [[1, 2, -4, -5, 0, 1, 2, 6, 7, -9, 10]], [[6, -5, -4, 8, -3, 6, -2, -1, -5, -1]], [[0.5, -4, 2.5, 5, -2.2, -8, -4, -7, 9.9, -11.18889279027017, -10.5, 2.5]], [[1, 1, 1]], [[1, 2, -2, -5, 0, 6, 7, -9, 10]], [[-1, -2, -5, -3, 8, -4, 6, 0, 11, -6, -9, 10, 7, 7]], [[1, 2, -4, -5, 0, 1, 2, 6, 7, -9, 10, -5]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, -8, 2]], [[1, 2, 1, 1]], [[1, 1, 2, -1, 9, -5, 0, 6, -100, -9, 10]], [[-1, -2, -3, 5, 10, -5, 6, 7, -9, 7]], [[6, -5, 8, -3, 6, -2, -1, -4, -1]], [[2, -4, -5, 0, 1, 2, 6, 7, -9, 10]], [[0, -1, -3, -4, -5, -3]], [[1, 2, -4, -5, 0, 0, 6, 7, -9, 10, 10, 2]], [[-1, -7, -1]], [[11, 2, -4, -5, 0, 1, 2, 6, 7, -9, 10]], [[-1, -100, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10]], [[1, 2, -3, -5, 0, 6, 7, 2, -9, 10]], [[-1, -5, -5, -3, -4, 6, 6, 5, 7, -9, 10, 7]], [[-1, -2, -3, 0, -4, 6, 6, 7, -9, 10]], [[1, 2, -4, -5, 0, 6, -9, -2, 10, 6, -9, 10]], [[-8]], [[-8, -7]], [[11, -1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9]], [[1, 2, 3, -4, -5, 0, 6, -9, -5, 10, -9]], [[7, 1]], [[-1, -3, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9]], [[6, -5, -4, 8, -3, 6, -1, -1, -5, -1]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9, -1]], [[-5, 5]], [[-1, -2, -4, 6, 0, 6, 7, -9, 10, 0]], [[-2, -3, -4, 6, 0, 6, -5, 7, -9, 10, -3, -9]], [[1, 1, 1, -8, 1, 1, 2, 2, 2, 2, 2, 2, 2]], [[1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2]], [[11, 1, 1, -8, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2]], [[8, -1, -7, -1, -1]], [[1, 2, -4, -5, 0, 6, -9, 11, 6]], [[10, 2, -4, -5, 0, 2, 2, 6, 7, -9, 10]], [[1, 2, -4, -3, -5, 0, 0, 6, 7, -9, 10, 10, 1]], [[1, 2, -100, -1, -5, 0, 6, 7, 10]], [[-5, -2, -3, -4, -5]], [[1, 2, -1, -2, -5, 0, 6, 7, -9, 10]], [[-1, -2, -5, -9, -3, -3, -4, 6, 0, 6, 7, -9, 8, 10]], [[-3, 0.5, -4, 2.5, 5, -2.2, -8, -4, -7, -10.5, 9.9, -10.5]], [[11, 1, 2, -4, -5, 0, 1, 2, 6, 7, -9, 10]], [[0.5, -4, 2.5, 5, -8, -4, -7, 9.9, -11.18889279027017, -10.5, 2.5]], [[1, 2, -3, -5, 0, 7, 6, 7, 2, -9, 10]], [[6, -5, -4, -6, -3, 6, -1, -1, -5, -1]], [[0, -1.25, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0]], [[1, 2, -100, -1, -5, 0, 6, 7, 2]], [[1, 2, -4, -5, 0, 2, 6, 7, -9, 7]], [[6, -5, -4, 8, -3, 6, -1, -5, -1]], [[2, 1, 1, 1]], [[-1, -2, -5, -3, -4, -1, 6, 0, 6, 7, -9, 10, 5]], [[1, 1, 1, 0, 1]], [[-1, -2, -5, -3, -3, -3, 2, -4, 6, 0, 6, 7, -9, 8, 10]], [[10, 1, 0, -1, -1, 0]], [[1, 2, -4, -5, 0, 3, 6, 7, 2, -9, 10]], [[-2, 10, -4, 6, 0, 6, 7, -9, 10, -3, -4, -4]], [[-1, -2, -3, 5, 10, -5, 7, -9, 7]], [[1, 2, -4, -5, 0, 6, -9, 10, 6, -4]], [[1, 1, 0]], [[1, 2, -4, -5, 0, 3, 6, 7, 2, -9, 10, 2]], [[6, 8, -3, 6, -2, -1, 6, -4, -1, 8]], [[1, 2, -4, -5, 0, 6, 7, -9, 10, 1, 0]], [[-1, -5, -5, -3, -4, 6, 6, 7, -9, 10, 7]], [[1, -2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -3, -2.25, 0]], [[1, -100, -1, -5, 0, 6, 7, 2]], [[0.5, -4, 2.5, 5, -11.18889279027017, -8, -4, -7, 9.9, -11.18889279027017, -10.5]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -4, -5, -3, -2.25, 0]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0, 0, -2.25]], [[-2, -3, -4, 6, 0, 6, -5, 7, -9, 10, -3, -9, 6]], [[6, -5, -4, -3, -2, -1, -5]], [[1, 3, -1, -2, -5, 0, 6, 7, -9, 10, 6]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, 0, -9, 10, 5, -5]], [[6, -5, -8, -4, 8, -8, -2, -1, -5, -7]], [[1, 2, -3, -1, -5, -1, 6, 7, 2, -9, 10]], [[0.5, 0, 2.5, 5, -2.2, -8, -0.75, 7.7, 9.9, -10.5]], [[11, -3, -9, -9]], [[11, -3, -9, -8, -9]], [[-1, -2, -3, 0, -4, 6, 6, -8, 7, -9, 10, -2]], [[6, -5, 8, -3, 6, -2, -1, -4, -1, -1]], [[1, 2, 3, -5, 0, 6, 7, -9, 10]], [[1, 2, -2, -5, 0, 6, 7, -9, -9, 10]], [[-1, -2, -5, -4, -7, -3, 0, 6, 7, -9, 10, 5]], [[1, 1, 1, 1, 1, 2, 2, 2, 3, 1, 2, 2]], [[9, -8, -7]], [[10, 2, -4, -5, 0, 2, 2, 6, 6, -9, 10, -5]], [[8, 0]], [[0.5, 0, 2.5, -3.144306649398891, 5, -2.2, -8, -0.75, 7.7, 9.9, -10.5]], [[6, -5, -4, 8, -3, -100, 6, -1, -1, -5, -1]], [[7, -5, -4, -3, -2, -1, -5]], [[-1, -3, -5, -3, -4, 6, 0, 6, 7, -9, -100, 10, 5, 10, -9]], [[1, 2, -4, -5, 0, 3, 6, 7, 2, 10, 2]], [[-1, -2, -5, -3, -4, -1, 6, 11, 0, 6, 7, -9, 10, 5, 10]], [[-1, -2, -5, -3, 2, -4, 6, -9, 6, 7, -9]], [[-2, 1]], [[6, -5, -4, -1, -3, -4, -1, -5, -1]], [[-2, -3, -4, 6, 0, 7, -9, 10, -3]], [[1, 2, -4, -5, 0, 0, 6, 7, -9, 10, 6]], [[-100, -101, 1, 1, 1]], [[-1, -100, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 6]], [[1, 2, -2, -5, 0, 6, 7, -9, -9, 10, 7]], [[9, -8, -8]], [[-1, -2, -5, -4, -7, -3, 0, 6, 7, -9, 10, 6, -4]], [[6, 8, 7]], [[1, 2, -7, -4, -4, -5, 0, 6, -9, 10, 6, -4]], [[-5, -5, -3, 5, -1]], [[-1, -2, -5, -4, -7, -3, 0, 6, 7, -9, 10, 5, -4]], [[-2, 10, -4, 1, 0, 6, 7, -9, 10, -3]], [[11, 2, -4, -5, 0, 1, 2, 6, 7, -9, 10, 2]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 0, 5, -9]], [[1, 2, -4, -3, -5, 0, 0, 6, 7, -9, 10, 10, 1, 10]], [[-1, -2, -5, -4, 6, 0, 6, 7, -9, 10, 5, -7, -9]], [[1, 2, -4, -5, 1, 2, 7, -9, 10]], [[1, 2, -100, -1, -5, 0, 6, 2, 7, 2]], [[1, 2, -1, -5, 0, 6, 7, -9, 11]], [[-3, 0.5, -4, 2.5, 5, -2.2, -8, -4, -7, -10.5, 9.9, -10.5, -4]], [[1, 3, -1, -2, -5, 0, 6, 7, -9, 10, 6, 3]], [[1, 9]], [[-5, -2, -3, -5]], [[1, 2, -1, -5, 0, 6, 10]], [[-5, -2, -3, -4, -5, -5]], [[1, 2, -4, -5, 0, 6, -9, 10, -4, -4]], [[0, 7.7, -1.5, -0.75, -2.25, -1, -2, -4, -5, -3, -2.25, 0, -0.75]], [[11, -1, -2, -5, -3, -4, 6, 0, 6, 7, -3, 6, 10, 5, 10, -9]], [[1, -9, 2, 3, -4, -5, 0, 6, -9, -5, 10, -9]], [[2, 3, 0, -5, 0, 6, -9]], [[-1, -2, -5, -3, 8, -4, 6, 0, 11, -6, -9, 10, 7, 7, 10]], [[0.5, 0, 2.5, 5, -2.2, -8, -0.75, 7.7, 9.9, -10.5, 5]], [[-100, -101, 1, 1, 1, 1]], [[-8, -7, -7]], [[-5, -2, -3, -4, -5, -3]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9, -1, 10]], [[8, -4, -101, -7, -1, -1]], [[10, 2, -4, -5, 0, 2, 6, 7, -9, 10]], [[11, 2, -4, -5, 0, 1, 2, 6, 7, -9, 11, 2]], [[1, -1, -1, -5, 0, 6, 7, 1, 10, -5]], [[-4, -2, -2, -1]], [[-5, -4, -3, 5]], [[1, 3, -1, -2, -5, 0, 0, 6, 7, -9, 10, 6, 6, -9]], [[-1, -5, -5, -3, -4, 6, 6, 5, 7, -9, 10, 7, -4]], [[8, -6, 0, 8]], [[-100, -101, 1, 1, 1, 1, -101]], [[0, 1, 2, -4, -3, -5, 0, 0, 6, 7, -10, 10, 10, 1, 10, 6, 6]], [[2, 1, 1, 2, 1, 1]], [[1, 3, -1, -2, -5, 0, 6, 7, 10, 6, 6, -9, -5]], [[-2, -3, -3, -5, -2]], [[-1, -2, -5, -3, -4, 6, 6, 7, -9, 10, 5, 10, -9]], [[1, 2, 3, -4, -2, 0, -3, 6, -9, -5, 10]], [[1, 2, -4, 10, 0, -3, 0, 6, 7, -9, 10, 10]], [[0, -1.25, -1.5, -0.75, -2.25, -2, -3, -4, -5, -6]], [[6, 1, -4, 8, -3, 6, -1, -5, -1]], [[10, -5, 0, 2, 2, 6, 7, -9, 10]], [[-1, -2, -5, -3, -4, 6, 0, 6, -100, 7, 0, -9, 10, 5, -5, -1]], [[6, -5, 11, -1, -3, -4, -1, -5, -1]], [[-1, -2, -5, -3, 6, 6, 7, -9, 6, 5, 10, -9]], [[1, 2, -4, -5, 0, 6, 7, 10, 9, 6]], [[-1, -4, 6, 0, 6, 7, -9, 10, 0]], [[-1, -2, -3, -4, 6, 0, 6, 7, -9, 10, 6]], [[8, -1, -2, -1]], [[-1, -7]], [[1, -100, -1, -2, -5, 0, -5, 6, 7, 2]], [[-8, -1, -3, -4, -5, -3]], [[-1, 3, -5, -3, -4, 6, 6, 7, -9, 10, 5, 10, -9]], [[-5, -5, -3, -4, 6, 6, 5, 7, -9, 10, 7, -4, -1]], [[-1, -2, -3, 5, -5, 7, -9, 10]], [[-2, 10, -4, 6, 0, 6, 7, -9, 10, -3, -4, -4, -9]], [[-1, -5, -5, -3, -4, 6, 6, 8, -9, -5, 10, 7]], [[1, 3, -1, -2, -5, 0, 8, 6, 7, -9, 10, 6, 3]], [[2, 2, -4, -3, -5, -100, 0, 0, 6, 7, -9, 10, 10, 1]], [[1, 1, 1, 1, 9, 1, 2, 2, 2, 2, 1, 2]], [[2, 1, 0, 1, 1]], [[-2, -3, -10, -4, 6, 0, 6, -5, -9, 10, -3, -9, -2]], [[5, -1, -2, -5, -4, 6, 0, 6, 7, -9, 10, 5, -7, -9]], [[1, 2, -3, -5, 0, 6, 7, 2, -9, 10, 10]], [[1, 2, -4, -5, 0, -4, 6, 7, 2, -9, 10]], [[1, 1, 1, 1, 2, 2, 2, 1, 2]], [[-5, -4, 8, -3, 6, -2, -1, -5, -1]], [[-1, -2, -5, -3, -4, 6, 6, 7, -9, 10, 5, 10, -9, -2, 10, -9]], [[0, -1.25, -1.5, -2.25, -2, -3, -5, -6]], [[1, 3, -1, -2, -5, 0, 6, 7, -9, 10, 10, 6, 3]], [[2, -10, -7, 1, 1]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, -2, 5]], [[-1, -5, -5, -3, -4, 6, 6, 6, 5, 7, -9, 10, 7, -4]], [[1, 2, -4, -5, -5, 0, 0, 6, -9, 10, 10]], [[-2, -3, -4, 6, 0, 6, 7, -9, 10]], [[10, 2, -4, -4, -5, 0, 2, 2, 6, 7, -9, 10, 0]], [[false, true, false, false, true]], [[1, 2, -4, 1, -5, 0, 0, 6, 7, 9, -9, 10, 10]], [[1, 2, 2, -4, 1, -5, 0, 0, 6, 7, 9, -9, 10, 10]], [[1, 5, 3, -1, -2, -5, 0, 6, 7, 10, 6, 6, -9, -5]], [[1, 2, -1, -5, 0, 6, 7, -9, 11, 0]], [[6, 8, -5, 6, -2, -1, 6, -4, -1, 8]], [[1, 1, 1, -8, 1, 2, 2, 2, 2, 2, 2, -100, 2]], [[1, 7, 3, -4, -5, 0, 6, -9, -5, 10, -9]], [[1, 2, -4, -3, -5, 0, 0, 6, 7, -9, 10, 10, 1, 7]], [[-1, -2, -5, 0, -9, -3, -3, -4, 6, 0, 6, 7, -9, 8, 10]], [[1, 2, -4, -5, 0, 6, -9, 10, -4, -4, -4]], [[1, 2, 10, 1, -5, 0, 0, 6, 10, 9, -9, 10, 10, 0]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -2, 5]], [[-1, -2, -3, 6, 5, 10, -5, 6, 7, -9, 7]], [[-5, -4, -3, 5, -5]], [[1, 2, -101, -1, -5, 0, 6, 7, -9, 11]], [[-1, -3, -5, -3, -4, 6, 0, 6, 7, -9, 9, 10, 10, -9]], [[-5, -3, 5, -1]], [[-1.25, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0]], [[6, 8, -5, -4, 8, -3, -100, 6, -1, -1, -5, -1]], [[1, 2, -4, -5, 0, 6, -9, -1, 11, 6]], [[-7, -1, -1]], [[-8, -1, -3, -5, -3]], [[-5, -3, -5]], [[6, -5, 11, -1, -3, -4, -1, -5, -1, 11]], [[-7, -1]], [[-7, -8, -6]], [[6, -5, 11, -1, -3, -1, -5, -1, 11]], [[8, -1, 0]], [[1, -1, -1, -5, 0, 6, 7, 1, 10, -5, -1]], [[-3, 0.5, -4, 2.5, 5, -2.2, 0.3470794389448922, -8, -4, -7, -10.5, 9.9, -10.5]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6, -0.75, -0.75]], [[2, 9, -10, -7, 1, 1]], [[1, 2, -3, -5, 0, 6, 7, 2, -9, 10, 10, -5]], [[6, 8, -5, 6, -2, -1, 6, -4, -1, 8, -1]], [[7, -4, -3, -2, -1]], [[6, -5, -4, -100, -2, -1, -5, -1]], [[1, 2, -4, -5, 6, -9, 10, 6]], [[1, 2, -100, 1, -5, 0, 0, 6, 7, 9, -9, 10, 10]], [[1, 2, -4, -5, 6, -9, 10, 6, -4, -9]], [[6, -5, 11, -1, -3, -4, -1, -5, -1, 6]], [[-2, 2]], [[-1, -2, -3, -4, 6, 0, 6, 7, -9, 10, 5, -9]], [[1, 2, -3, -5, 0, 6, 7, -9, 10]], [[6, -5, -4, 8, -3, -2, -1, -5, -1, -1, -2]], [[1, 2, -1, -5, 0, 6, 10, 2]], [[-3, 0.5, -4, 2.5, 5, -2.2, -8, -4, -7, -10.5, 9.9, -10.5, 2.5]], [[5, -1, -2, -5, -4, 6, 0, 6, -8, -9, 10, 5, -7, -9]], [[6, -4, -3, -2, -1, -5, -1]], [[1, -100, -5, 0, 6, 7, 2]], [[-5, -1, -3, -4, -5]], [[-1, -2, -3, 5, -5, 2, 7, -9, 10, 10, 10]], [[8, -1, -2, -1, -1]], [[-1, -2, -3, 0, -4, 6, 6, 7, -7, -9, 10, 6]], [[-1, -2, -5, -3, -4, 6, -3, -5, 0, 6, 7, -9, 10, 5]], [[11, -1, -2, -5, -3, -4, 6, 6, 0, 6, 7, -9, 10, 5, 10, -9]], [[1, 6, 2, -7, -4, -4, -5, 0, 6, -9, 10, 6, -4]], [[1, 6, -5, -4, 8, -3, -100, 6, -1, -1, -5, -1]], [[-1, -2, -5, -3, -4, -1, 6, 0, 6, 7, -8, 10, 5]], [[1, 1, 1, -8, 1, 1, 11, 2, 2, 2, 2, 2, 2]], [[8, -1, -2, -2, -1]], [[1, 6, 2, -7, -4, -4, 0, 6, -9, 10, 6, -4]], [[8, 6, 8, 7]], [[6, 8, 7, 6, 6]], [[-2, 10, 6, 0, 6, 7, -9, 10, -3, -4, -4, -1]], [[0.5, -4, 2.5, 5, -8, -4, -7, -11.18889279027017, -10.5, 2.5]], [[1, 2, -100, -1, -6, -5, 0, 6, 7, 2]], [[1, 2, -3, -1, -101, -1, 6, 7, 2, -9, 10]], [[3, 1, 3, -1, -2, -5, 0, 0, 6, 7, -9, 10, 6, 6, -9]], [[-1, -2, -3, -4, 0, 6, 7, -9, 10, -3]], [[1, 2, -3, -5, 0, 7, 6, 7, 10, -9, 10]], [[1, -4, 8, -3, 6, -1, -5, -1]], [[0, -9, 0]], [[-7, 5]], [[0.5, -4, 2.5, 5, -2.2, -8, -4, -7, 9.9, -11.18889279027017, -10.5, 2.5, 9.9]], [[-101, -9, -9, -9, -9]], [[1, 2, -2, -5, 6, 7, -9, -9, 10, 7]], [[1, 2, -4, -5, 0, 6, 7, -1, -9, 10, 10]], [[-7, -1, -3, -4, -5]], [[5, -1, -2, -5, -100, 6, 0, 6, -8, -9, 10, 5, -7, -9]], [[-1, -2, -3, 0, 6, 6, 7, -9, 10]], [[1, -100, -5, 6, 7, 2, -100]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, -10]], [[1, 2, 1, 2, 1]], [[0, -1.25, -1.6712853697787629, -0.75, -2.25, -1, -2, -4, -9, -5, -3, -2.25, 0]], [[1, 2, 1, 2, -7, 1]], [[6, -5, -4, 8, -3, -100, 6, -1, -1, -5, -1, -4]], [[-100, 1]], [[1, 1, 1, -5, 1, 1, 2, 2, 2, 2, 2, 1]], [[6, 8, -5, -10, -2, -1, 6, -4, -1, 8]], [[1, 2, 2, -4, 1, -5, 0, 0, 3, 6, 7, 9, -9, 10, 10]], [[1, 2, -4, -5, 0, 6, -9, 10, 6, 10]], [[-1, -2, -5, -3, -4, 6, 7, 7, -9, 10, 5, 10, -9]], [[11, -1, -2, -5, -3, -4, 5, 6, 0, 6, 7, -9, -9, 5, 10, -9]], [[-8, -4, -3, 5, 0]], [[-1, -2, -3, 5, -5, 7, -9, 10, -3]], [[2, 1, 7, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2]], [[-1, -2, -3, 0, -4, 6, 7, -7, -9, 10, 6]], [[1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 4, 1, 2, 2, 2]], [[-1, -2, -5, -3, -4, 0, 6, 7, -9, 10, 0, 5, -9]], [[-1, 0, -7, -1, -1]], [[1, 2, -4, -5, 0, 7, -100, -9, 10, -4]], [[-101, 1, 1, 1, 1, -101]], [[0, -1, -2, -3, -4, -5, -3]], [[-6, 0, 8]], [[-8, -7, -4]], [[6, -5, -4, 8, 8, -2, -100, 6, -100, -1, -1, -5, -1, 8, -100]], [[-1, -5, -5, -3, -4, 6, 0, 7, -9, 10, 7, -3, -9]], [[3, -1, -2, -5, 0, 6, -5, 7, -9, 10, 10, 6, 3]], [[0, -1.25, -1.5, -2.25, -2, -3, -5, -6, -3]], [[1, 2, -4, -5, 8, 6, 7, 7, -9, 10, 1, 0, 6]], [[1, 2, -1, 3, -5, 0, 6, 7, -9, 11, 0]], [[3, 1, 3, -1, -5, 0, 0, 6, 7, -9, 10, 6, 6, -9]], [[-1, 2, -9, -4, -1, 7, -100, 1, 0, 2]], [[-2, 10, -4, 6, 0, 6, -7, 7, -9, 10, -3, -4, 1, 0]], [[6, 8, -5, -10, -2, -1, 6, -4, -1, 8, -1]], [[0, -1.25, -1.5, -2.25, -2, 2, -5, -6, -3]], [[1, 6, -7, -100, -4, -4, -4, 0, 6, -9, 10, 6, -4]], [[-1, -2, -5, -2, -4, 6, 6, 1, 7, -9, 10, 5, 10, -9]], [[-7, -5]], [[8, -1, -2, 1, -2, -1]], [[0, 7.7, -1.5, 7, -0.75, -2.25, -1, -2, -4, -5, -3, -2.25, 0, -0.75]], [[1, 9, -3, 2, -4, -5, 0, -100, -9, 10, -4]], [[1, -1, -1, -5, 0, 6, 7, 1, 10, -5, -1, -1]], [[-1, -2, -3, -4, 0, 6, 7, -9, 10, -3, 0]], [[-3, 0.5, -4, 2.5, 5, -2.2, 0.3470794389448922, -8, -4, -7, 9.9, -10.5]], [[1, 2, 2]], [[7, 2, -4, -5, 0, 6, 7, -9, 10, 1, 0, 2, 0]], [[-1, 2, -9, -4, -1, 7, -100, 1, 0, 2, -9, -4]], [[1, 2, -4, -5, 0, 0, 6, 7, -9, 10, 10, 3]], [[0, -1.25, -1.5, -2, -3, -5, -6]], [[1, 2, -4, -5, -3, 0, 6, -9, 10, -4, -4]], [[-1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9, -4]], [[1, 3, -1, -2, -5, 8, 6, 7, -9, 10, 6, 3, 10]], [[1, 6, -7, -9, -100, -4, -4, -4, 0, 6, -9, 10, 6, -4, 0]], [[1, 2, -4, -5, 0, -4, 6, 7, 2, 10]], [[-8, 9, -8, -7]], [[-5, 6, 5]], [[-1, -5, -5, -3, -4, 6, 0, 6, 7, 10, 7]], [[7, 5, 4]], [[3, -1, -2, -5, 0, 6, -5, 7, -9, 10, 0, 6, 3]], [[8, -6, 0, 8, -6]], [[6, 8, -5, 6, -2, -1, 6, -4, -1, 8, -5]], [[1, 2, -4, 1, -5, 0, 0, 6, 7, 9, -9, 10, 10, 10]], [[-1, -2, -2, -5, -3, 2, -4, 6, -9, 6, 7, -9]], [[-2, -3, -4, -5, -3]], [[0.5, -4, 2.5, 5, -2.2, -8, -7, 9.9, -11.18889279027017, -10.5]], [[6, -9, -4, 8, -2, 6, -1, -5, -1, 6]], [[-7, -10, -1, -1]], [[8, 6, 7]], [[0, -1.5, -2.25, -2, 2, -5, -6, -3, -2.25]], [[8, -1, -2, -1, -1, -2, -1]], [[10, -4, -5, 0, 2, 6, 7, -9, 10]], [[-8, -3, -5, -3]], [[1, 2, -4, -5, 8, 6, 7, 7, -9, 10, 1, 0, 6, 1]], [[6, 10, -3, -5, 11, -1, -3, -4, -1, -5, -1, 11]], [[1, 1, 1, 1, 1, 2, 2, 2, 1, 2, -1, 1, 1, 1]], [[1, -3, 2, -4, -3, -5, 0, 0, 6, 7, -9, 10, 10, 1, 10, -3]], [[1, 2, -4, -4, 1, -5, 0, 0, 6, 7, -9, 10, 10]], [[6, 8, 6, -2, -1, 6, -4, -1, 8, -5]], [[1, -100, -5, 2, 6, 7, 2, -100]], [[10, 2, -4, -5, 0, 6, 2, 2, 6, 6, -9, 10, -5, 2]], [[2, -10, -7, 1, 1, 1]], [[-2, -8]], [[-2, -3, -8]], [[1, 2, -1, 9, -5, 0, 6, -100, -9, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, -10, 2]], [[-3, -5]], [[-1, 2, -9, -4, -1, 7, -100, 1, 0, 2, -9, -4, -4]], [[1, 1, 1, 1, 1, 1, 2, 3, 0, 2, 1, 2, -10]], [[1, 2, -2, -5, 0, 6, -1, 7, -9, -9, 10]], [[11, 5, 4]], [[-8, -1, -3, -5, -3, -8]], [[-1, -2, 6, 5, 10, -5, 6, 7, -8, 7]], [[1, 2, -2, -5, 0, 6, 7, 4, -9, 10]], [[0, -1.25, -0.75, -2.25, -1, -2, -3, -4, -5, -6, 0, -2.25]], [[-1, -2, -5, -3, 6, 6, 7, -9, -1, 5, 10, -9]], [[6, 1, -4, 8, -3, 7, 6, -1, -5, -1]], [[0, 1, 2, -4, -3, -5, 0, 0, 6, 7, -10, 10, 10, 1, 10, 6]], [[-1, -2, -3, 0, 6, 6, 7, -9, 10, -4]], [[false, true, false, false, true, true]], [[-1, -5, -5, -3, -4, 6, 0, 6, 7, 10, 7, -5, 0]], [[-6, -5, -4, 8, 8, -2, -100, 6, -100, -1, -1, -5, -1, 8, -100, -4]], [[-1, -2, -3, -4, 5, 0, 6, 7, -9, 10, 10]], [[0.5, 0, 2.5, 5, -2.2, -8, -0.75, 7.7, 9.9, -10.5, 5, -8]], [[8, -1, -2, -1, -1, -2, -1, -1]], [[-6, -5, -4, 8, 8, -2, -100, 6, -100, -1, -1, -5, -1, 8, -100, -4, -2]], [[-1, -2, -5, -2, -4, 6, 6, 7, -9, 10, 5, 10, -9, -2, 10, -9]], [[1, -100, -5, 0, 6, 7]], [[2, 1, -10, 0, 1, 1]], [[-1, -2, -5, -3, 0, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9, -1, 10, 6]], [[-7, -1, -1, 11, -1]], [[1, 2, -100, -1, -5, 0, 6, 7]], [[10, 2, -4, -5, -2, 0, 6, 2, 2, 6, 6, -9, 10, -5, 2]], [[7, 2, -4, -3, -5, -2, 0, 0, 6, 7, -9, 10, 10, 1, 10]], [[2, -4, 1, -5, -1, 0, 0, 6, 7, 9, -9, 10, 10, 10]], [[6, -5, -1, -4, -100, -2, -1, -5, -1]], [[-1, -3, -4, 6, 0, 6, 7, -9, 10, 6, -9]], [[-1, -2, -3, -4, 0, 6, 7, -9, 10, 6]], [[-1, 2, -9, -4, -1, 7, -100, 1, 2, -9, -4]], [[1, 2, -3, -5, 0, 6, 6, 2, -9, 10, 10, -5]], [[8, -1, -2, 6]], [[-1, -2, -3, 5, 0, -5, 7, -9, 7]], [[10, -4, 6, 0, 6, 7, -9, 10, -3, -4, -4]], [[-3, 0.5, -4, 2.5, -10.5, -3.144306649398891, 5, -2.2, 0.5, -8, -4, -7, 9.9, -10.5]], [[1, 3, -1, -2, -5, 8, 6, 7, -9, 10, 6, 10]], [[-1, -4, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, -5, 0, 5, -9]], [[8, -1]], [[-1, -100, -2, -1, -3, -4, 6, 0, 6, 7, -9, -3, 10, 6]], [[-1, -3, -5, -3, -8]], [[0, -1.25, -1.5, -0.75, 9.9, -2.25, -1, -2, -3, -4, -5, 7, 0]], [[2, -4, -5, 0, 2, 6, 7, -9, 7, 7]], [[1, 2, -4, -5, 9, 0, -4, 6, 7, 2, -9, 10]], [[0, -1, -3, -4, -5, -4, -1]], [[-1, -2, -5, 11, -3, -4, 6, -3, -5, 0, 6, 7, -9, 10, 5]], [[-2.25, -4, 2.5, 5, -8, -4, -7, -11.18889279027017, -10.5, 2.5, -11.18889279027017]], [[-2, -3, -5, -2]], [[-1, -2, -5, -9, -1, -3, -3, -4, 6, 0, 6, 7, -9, 8, 10]], [[10, 1, 0, -1, -1]], [[-1, -2, -5, -3, 8, -5, 6, 0, 11, -6, -9, 10, 7, 7]], [[11, -1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 5, 10, -9, 0]], [[1, 1, 1, -8, -10, 2, 2, 2, 2, 2, 2, -100, 2, -8]], [[1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1]], [[6, 8, -3, 6, -2, -1, 6, -4, -1, 8, 8]], [[-1, -5, -5, -3, -4, 6, 6, 6, 5, 7, -9, 10, 7, -4, 7]], [[-1, -2, -5, -4, -7, 5, -3, 0, 6, 7, -9, 10, 6, -4]], [[1, 1, 1, 1, 1, 2, 2, 2, -7, 2, 1, 2]], [[1, 2, -4, -5, 0, 6, 7, 2, -9]], [[5, -1, -2, -5, -100, 6, 0, 6, 10, -9, 10, 5, -7, -9, 0]], [[1, 3, -1, -2, 7, 0, 6, 7, 6, 6, -9, -5]], [[11, -1, -2, -5, -3, -4, 6, 0, 6, 7, -9, 10, 5, 10, -9, -9]], [[10, 2, -4, -5, -2, 5, 0, 6, 2, 2, 6, 6, -9, 10, -5, 2, -9]], [[11, -1, -2, -5, -3, -4, 6, 0, 7, -2, 5, 10, -9, 0]], [[1, -100, -5, 6, 7, 2, -101, -100]], [[1, 1, 1, 0, 1, 0]], [[false, true, false, true, true, true]], [[0, -100, -5, -8, 7, 2, -100]], [[-5, -4, -3, -2, -1, 0]], [[1, 2, 3, 4, 5, 6]], [[0, 1, 2, 0, 3, 4, 5, 0, 0, 6, 0, 7]], [[1, 2, 3, 4, 5]], [[-1, -2, -3, -4, -5]], [[0, 0, 0, 0, 0]], [[1.5, 2.7, -3.6, 0, 5]], [[1.2, 2.5, 3.7]], [[-2, -1]], [[-2, 2, -1]], [[1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2]], [[-2, -1, -1]], [[1, 2, -4, -5, 0, 7, -9, 10, 0]], [[1, 1, 1, 1, 1, 2, 2, 1, -3, -3, 2, 2]], [[-89.04346588476734, 9.9, 32.97170491287429, -2.25]], [[9.9, 33.195768044846155, -2.25]], [[0, -1, -1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, -3, -3, 2, 2]], [[1, 1, 1, 1, 1, 2, -1, 1, -3, -3, 2, 2]], [[0, -1.25, -1.5, -2.25, -1, -6, -4, -3, -4, -5, -6, -3]], [[-1, -1, -1]], [[98, 99]], [[-89.04346588476734, 32.97170491287429, -2.25]], [[-5, -4, -3, -2, -1, -5]], [[7]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25]], [[-2, 99, -1]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, 9.9]], [[9.9, 0.5, -2.25]], [[1, 1, 1, -2, 1, 99, 2, 2, 2, 2, -3, 1, -3, 2, 2]], [[-89.04346588476734, -2.651030586877352, 33.195768044846155, 32.97170491287429, -2.25]], [[-1, -2, 0, -3, -4, -5]], [[9.9, 25.12472520208241, 33.195768044846155, -2.25]], [[1, 2, 1, 1, 1, 2, -1, 1, -3, 3, -3, 2, 2]], [[-1, -2, -4, 5, 0, 6, 7, -9, 9]], [[0, -1, -2, -3, -4, 9]], [[-1, -2, -3, -4, 5, 0, 6, 7, -9, 10, -9]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25, -2.25, -2.25]], [[-5, 3, -2, -1, -5]], [[-5, -3, -2, -1]], [[0, -1, -6, -3, -4, 9]], [[0, -1, -5, -3, -4, 9]], [[2, -1, -2]], [[1, 1, 1, 1, 1, 2, 2, 2, -3, -3, 2, 2, 2]], [[-2, 99]], [[0, -2, -3, -4, -5]], [[1, 2, -4, -5, 0, 7, -9, 10, 0, 1]], [[9.9, -2.6958053769612267, 33.195768044846155, -2.25]], [[2, -4, -5, 0, 7, -9, 10, 0]], [[0, -1, -1, -1, 5, -1]], [[33.195768044846155, -2.25]], [[false, true, true, false, true, true]], [[1, 2, -4, -5, 0, 7, -9, 10, 0, 1, -5]], [[-3, -1, -1, 0, 5, -1]], [[-1, -2, -3, 6, -4, 5, 0, 6, 7, -9, 10]], [[-1, -1]], [[0, 99, -1, 6, -3, -4, -5]], [[-2, 2, -1, -1]], [[0, 6]], [[1, -1, 0]], [[0.5, 0, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9]], [[-5, -9, -4, -2, -1, -5]], [[1, -1, 0, 0]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2]], [[-5, 3, -2, -1, -5, 3]], [[98, 0, 99, -1, 6, -9, -5]], [[0, -2, -3, 2, -5]], [[9.9, 25.221353337136023, 24.93175152910768, 33.195768044846155, -2.25]], [[-5, -5, -9, -4, -2, -1, -5]], [[0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, 7.7]], [[9.9, -2.6958053769612267, 9.9]], [[9.9, 24.93175152910768, 33.195768044846155, -2.25]], [[0, -1, 7, -2, -3, -4, -2, 9]], [[1, 2, -4, -5, 0, 7, -9, 10, 0, 2, 1]], [[9.9, 25.221353337136023, 24.93175152910768, 33.195768044846155, -2.25, 33.195768044846155]], [[9.9, -2.6958053769612267, 25.12472520208241, 9.9]], [[-89.04346588476734, 32.97170491287429, -2.6958053769612267, 7.7]], [[-1, -2, -2, -3, 6, -4, 5, 0, 6, 7, -9, 10]], [[-5, -9, -4, -2, -1, -5, -5]], [[9.9, 25.12472520208241, 33.195768044846155, -2.25, 33.195768044846155, 25.12472520208241, -2.25]], [[9.9, 25.12472520208241, 33.195768044846155, -2.25, 9.9]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1]], [[-1, 1, -3, -4, 5, 0, 6, 7, -9, 10]], [[0, -1, -2, -9, -3, -6, -4, 9]], [[-3, -1, -1]], [[-5, -9, -4, -2, -5]], [[7.878953248636265, 25.12472520208241, 33.195768044846155, -2.25, 33.195768044846155]], [[1, 2, -4, -5, 0, 7, -9, 10, 0, 3, 1, 0, -4]], [[1, -3, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2]], [[-3, -1, -1, -1]], [[0, -3, -8, -5]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, 10, -5, -6]], [[1, 2, -4, -5, 0, 7, -9, 10]], [[9.9, 25.221353337136023, 24.93175152910768, 33.195768044846155, -3.1836537136945844, -1.5]], [[0.5, 0, -4, -13.662203687087855, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, 9.9, -13.662203687087855]], [[0, -3, -5]], [[24.93175152910768, 33.195768044846155, -2.25]], [[-4, 1]], [[-3, -8, -5, -5]], [[-89.04346588476734, -2.25, -2.6958053769612267, 7.7]], [[1, 2, -5, -5, 0, 6, 7, -9, 10]], [[9.9, 25.221353337136023, 24.93175152910768, -3.1836537136945844, -3.1836537136945844, -0.75, -1.5]], [[1, 2, -4, -5, 6, 7, -9, 10, 2, 1, 2]], [[1, 1, -6, 1, 1, 2, 2, 2, 2, 2, 2]], [[-9, -5, -4, -3, -2, -1, -5]], [[5, -3, -5]], [[false, true, true, false, false, true]], [[1, 1, 1, 1, 1, 6, 1, 2, 2, 2, 2, 1, 2]], [[99, 3, -2, -1, -5]], [[1, 1, 1, 6, 1, 1, 2, 1, 2, 2, 2]], [[1, 1, 1, 1, 99, 2, 2, 2, -3, 2, 2]], [[0.5, 0, -4, 5, -2.6307909667819085, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9]], [[0, -1.25, -1.5, -0.75, -2.25, -1, 3, -2, -3, 10, -5, -6]], [[1, 0, -1, -1]], [[0, -1.25, -1.5, -2.25, -1, -6, -4, -3, -4, -5, -7, -3]], [[0, -2.651030586877352, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9, -2.2]], [[0.5, 0, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9, 9.9]], [[-4, 2, -4, 0, 7, -9, 10, 0]], [[0, -2, -3, -4, -5, -3, -4]], [[0.5, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9]], [[-5, 3, -2, -1, -5, 4]], [[1, 2, 1, 1, 1, 1, 2, -1, 1, -3, 3, -3, 2, 2]], [[-3, -1, 0, -1, 0, 5]], [[1, 1, 1, 1, 1, 6, 1, 2, 2, 2, 1, 2]], [[-2.651030586877352, -4, 2.5, 5, -2.651030586877352, -8, 8.193677988449515, 7.7, 9.9, -10.5, 9.9, -2.2]], [[1, 2, -4, -5, 0, 7, -9, 10, 0, 98, 3, 1, 0, -4]], [[1, 2, -4, -5, 0, 7, -9, -2, 10, 0, 98, 3, 1, 0, -4, 3]], [[0, -1, 0, 5, -1]], [[9.9, -2.6958053769612267, 25.12472520208241, 0.5, -2.6958053769612267]], [[-6, 0, -1.25, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25, -2.25, -2.25, 9.9]], [[1, 2, -4, 0, 7, -9, 10, 0, 2, 1]], [[0, -1, -1, 0, 0]], [[1, 1, 1, 1, 2, 2, 1, 2, 2, 2]], [[1, 1, 1, -2, 1, 2, -1, 1, -3, -3, 2, 1, 2, 1]], [[0, -3, -4, -5, -3, -4]], [[98, 0, 99, -1, 6, -9, -6]], [[2, 3, -2, -1, -5, 4]], [[1, 1, 1, 1, 99, 2, 2, 2, -3, 1, 2]], [[0, -1, 0, 5, -1, 0]], [[9.9, -2.6958053769612267, 33.195768044846155, -1.9199320509072952]], [[9.9, 25.221353337136023, 24.93175152910768, -3.1836537136945844, -3.1836537136945844, -0.42322814636615796]], [[9.9, 25.221353337136023, 24.93175152910768, -0.42322814636615796, 33.195768044846155, -2.6307909667819085, -2.25]], [[2, -4, -5, 0, 7, -9, 10, 0, 1, -5, 1, 7]], [[0, -1, -3, 9]], [[0, -2, 0, -3, -4, -5]], [[1, 2, -4, -5, 6, 7, -9, 10, 2, 1, 2, 2]], [[-5, -4, -3, -2, -1, -1]], [[5, 3, -2, -1, -5, 4]], [[1, 1, 1, 1, 99, 0, 2, 2, 2, -3, -5, 2, 1, 2, 1]], [[0, -1.25, -1.5, -2.25, -1, -6, -4, -3, -4, -5, -6, -3, -4]], [[0.5, 0, 24.93175152910768, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9, -8]], [[-6]], [[-3, -8, -5, -5, -8]], [[98, 0, 99, -1, 6, 4, -9, -6]], [[-5, -9, -2, -5]], [[1, 1, 1, 1, 2, 2, 2, 2, 2]], [[2, 3, -1, -5, 4]], [[1, 1, 6, 1, 1, 2, 1, 2, 2, 2]], [[3, 0, -1, -2, -9, -3, 4, -6, -4, 7, 9]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2]], [[3, -1, -2, 2]], [[5, 3, -6, -2, -1, -5, 4, -1]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -3, -4, -5, -6]], [[2, -1, -1, -2]], [[-2.25, -2.25, 33.195768044846155]], [[-1, -3]], [[-2, 99, -1, -2, -2]], [[6, -1, -3]], [[-1, 0, -1, -1]], [[7, 99, 3, -2, -1, -5, -5]], [[-2, -1, -2]], [[-1.3426789806479305, 32.97170491287429, -2.25]], [[3, 0, -1, -2, -9, -3, 4, -6, -4, 7, 9, 4]], [[3, -1, -2, -2, 2]], [[1, 1, 1, 1, 1, 6, 1, 2, 2, 2, 2, 2, 1, 2]], [[-5, -6, 99, -1, 99]], [[-6, 98, 0, 99, -2, 6, -9, -6]], [[1, 1, 6, 1, 1, 2, 1, 2, 2, 2, 2]], [[1, 6, 1, 1, 2, 1, 2, 2, 2, 2]], [[9.9, 24.93175152910768, -3.1836537136945844, -3.1836537136945844, -0.42322814636615796]], [[1, -1, 0, -1]], [[-5, -5, -9, -4, -9, -2, -1, -5, -5]], [[9.9, 25.12472520208241, -2.6958053769612267, 33.195768044846155, -1.9199320509072952]], [[0, -8, -3, -4, -5, -3, -4]], [[1, 2, -4, -5, 0, -9, 10, 0, 98, 3, 1, 0, -4]], [[-5, -5, -9, -9, -2, -1, -5, -5, -9]], [[0, 1, 2, -4, -5, 0, 7, -9, -2, 10, 0, 98, 3, 1, 0, -4, 3]], [[21.28666897792971, 9.9, 25.12472520208241, 33.195768044846155, -2.25, 33.195768044846155, 25.12472520208241]], [[2, -1, -1]], [[0, -3, -4, -5, -3, -4, -3]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, -10.338878645170468, -8]], [[1, -1, 1, 1, 1, 1, 2, -1, 1, -3, -3, 2, 2]], [[1, 1, 1, 1, 1, 1, -3, 2, 2, 2, 1, 2]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25, 33.195768044846155]], [[0.5, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9]], [[0, -1.25, -1.5, -2.25, -1, -6, -4, -4, -5, 4, -3]], [[3, -1, 2, -2, 2]], [[0, -1, 10]], [[-6, 0, -1.25, -1.5, -0.75, -1, -2, -3, -4, -5, -6]], [[-5, 3, -4, -4, -1, -5, 3]], [[-1, -4, 5, 0, 6, 7, -9, 9]], [[-1, -1.25, -1.5, -2.25, -1, -6, -4, -3, -4, -5, -7, -3]], [[-2.651030586877352, -4, 2.5, 5, -2.651030586877352, -8, 8.193677988449515, 7.7, 9.9, -10.5, -0.42322814636615796, -2.2]], [[-5, -9, -4, -2, -1, -2, -5]], [[7, 99, 3, -2, -5, -1, -5, -5]], [[-4, -3, -2, -1]], [[24.93175152910768, -2.25]], [[-9, -9, -4, -2, -1, -5]], [[-2, 2, -2]], [[1, 2, 1, 1, 2, 1, 2, -1, 1, -3, 3, -3, 2, 2]], [[1, 1, 1, 1, 1, 1, -3, 2, 2, 2, 2]], [[-2.651030586877352, 37.590357356685196, 33.195768044846155, -2.25]], [[0, -9, -1, 7, -3, -3, -4, -2]], [[-4, 0, -1, -2, -3, -4, -5]], [[-5, -6, 99, -2, 99]], [[-2]], [[0, -2, -3, 2, -5, -3, -2]], [[9.9, -2.4785868920126473, 9.9]], [[9.9, 25.221353337136023, 24.93175152910768, 12.829932365585156, 33.195768044846155, -3.1836537136945844, -1.5]], [[98, -2, 99]], [[-5, -9, -4, -2, 0, -5, -5]], [[0, -1, 7, -2, -3, -4, -7, -2, 9]], [[1, 1, 1, 1, 1, 2, 2, 1, -3, -3, 2, 2, 2]], [[0, -1.25, -1.5, -0.75, -2.25, -1, -3, -4, -6]], [[6, -1]], [[2, -4, 0, 7, -9, 10, 0]], [[-5, 3, -2, 4, -5]], [[5.803598881698951, 25.221353337136023, 33.195768044846155, -2.25, -2.25, -2.25]], [[-1, -2, -3, 6, -4, 5, 0, 6, 7, -9, 10, -1]], [[-5, -9, -2, -5, -5]], [[-5, -9, -4, -2, -1, -2, -5, -1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2]], [[-5, -9, -2, -10, -5]], [[0, -6, -1, -1, 0, 0]], [[98, 0, 99, -9, 6, -9, -5]], [[9.9, -2.25, 9.9]], [[0, -1.25, -1.5, -2.25, -1, -6, -4, -4, -5, 4, -3, -5, -4, -5]], [[0.5, 0, -1.6451572106484336, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, 9.9, -13.662203687087855]], [[9.9, 25.221353337136023, 24.93175152910768, 33.195768044846155, -2.25, -10.338878645170468, 33.195768044846155]], [[3, 0, -1, -2, -9, -3, 4, -6, -4, 7, 9, 0]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25, -2.25, -2.25, 25.221353337136023]], [[-5, -5, -9, -4, -6, -2, -1, -5]], [[0.5, 0, 10.538283343362641, 24.93175152910768, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, 9.9, -8, 7.7]], [[0, -1, -2, -3, -4, 98, 9]], [[-9, -4, -2, 98, -1, -5, -5, -9]], [[-2, 98, -2]], [[-1.492221190549314, 0, -1.25, -1.5, -0.75, -2.25, -1, 3, -4, -3, 10, -5, -6]], [[-2.651030586877352, 9.9, 25.221353337136023, 24.93175152910768, -0.42322814636615796, 33.195768044846155, -2.6307909667819085, -2.25]], [[-9, -4, 4, -2, 98, -1, -5, -5, -9]], [[1, 2, -10, -4, 6, -5, 0, 7, -9, 10, 0, 1, -5]], [[1, 0, -1, 0, 0]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, 11.253319035677885, -10.5, 10.800982930222133]], [[0, -1.5, -2.25, -1, 3, -2, -3, 10, -5, -6]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, 9.9, -10.5, -2.2, 0.5]], [[20.235836471463873, -89.04346588476734, -2.651030586877352, 33.195768044846155, 32.97170491287429, -2.25]], [[9.9, 25.221353337136023, 24.93175152910768, -0.42322814636615796, 33.195768044846155, -0.5037419809615695, -2.6307909667819085, -2.25]], [[6, -1, -3, -3]], [[1, 1, -6, 1, 1, 2, 2, 2, 2, 2, 2, 2]], [[7, 98, 99]], [[1, 1, 1, -2, 1, 2, -1, 1, -3, -3, 2, 2, 2, 1]], [[5.803598881698951, 25.221353337136023, -2.25, 8.193677988449515, -2.25]], [[1, 2, 2, -3, 0, 7, -9, 10, 0, 1]], [[-4, 0, -1, -2, -1, -3, -4, -5]], [[-3, -2, -1]], [[1, 1, 6, 1, 2, 1, 2, 2, 2]], [[-5, -9, -4, -2, -5, -4]], [[1, 0, 1, 1, 1, 2, 2, 1, -3, -3, 2, 2, 2]], [[-5, 3, -4, -1, -5, 3]], [[0, -9, -1, 7, -3, -3, -4, 10]], [[1, -1, -1]], [[0, -1, -1, 7, -2, -3, -4, -7, -2, 9]], [[2, -2, -1, -1]], [[-5, -9, 6, -5, -5]], [[0, 0, -1, -1, -1]], [[2, 4, -1]], [[2, -1, -1, -1, -1]], [[1, 1, 1, 1, 1, 6, 1, 2, 2, 2, 4, 1, 2]], [[0, -2, -3, 2, -5, 3, -3, -2, 2]], [[-2, 7]], [[1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2]], [[-1, -1, -1, -1]], [[3, 0, -1, -2, -9, -3, 4, -6, -4, 7, 9, 2, 4]], [[false, true, false, true, false, true, true]], [[3, 0, -1, -2, -9, -3, 4, -4, 9, 0]], [[1, 3, 6, 1, 1, 2, 1, 2, 2, 2, 2, 3]], [[0, -1, 98, -1, 5, -1]], [[-5, 3, -1, -5, 4]], [[-3]], [[5.803598881698951, 25.221353337136023, 33.195768044846155, -2.25, -2.25]], [[1, 2, 1, 1, 1, 1, 2, -1, 1, -3, 3, -3, 2, 2, 2]], [[9.9, 33.195768044846155, 10.538283343362641, -2.25]], [[-2, 4, 5]], [[-1, -2, -4, 5, 0, 6, 7, -9, 9, -9]], [[-89.04346588476734, -2.6958053769612267]], [[-1, -2, -4, 5, 0, 6, 7, -9, 9, -4]], [[-6, 0, -1.25, -1.5, -0.75, -1, -3, -4, -5, -6]], [[0, -1, -2, 0, -9, -3, -6, -4, 9]], [[9.9, -2.8683444012540678, 25.12472520208241, 9.9, 12.997289062694836]], [[1, 1, 1, 99, 1, 1, 6, 1, 2, 2, 2, 1, 2]], [[0, -3, -3]], [[0, -1, -6, -3, -4, 9, -3]], [[1, 1, -6, 1, 1, 2, 2, 2, 10, 2, 2]], [[0, -1, -1, -1, 99, 5, -1]], [[-1, 1, 4, -3, -4, 5, 0, 6, 7, 4, 10]], [[9.9, -2.8683444012540678, 25.12472520208241, 9.9]], [[7, 97]], [[2, -1]], [[-5, 4, -2, -1, -5]], [[-5, -2, -10, 4, -4]], [[-10.5, 25.12472520208241, -1.5, -2.25]], [[9.9, 25.221353337136023, 25.376288083829433, -3.1836537136945844, -1.5]], [[21.28666897792971, 25.221353337136023, 24.93175152910768, 33.195768044846155, -3.1836537136945844, -1.5]], [[10.791699079028088, 25.221353337136023, 25.376288083829433, -3.1836537136945844, -2.6958053769612267, -1.5]], [[0, -6, -1, -1, 0, 0, 0]], [[-2.25, -2.25, 33.195768044846155, -2.25]], [[-1, -2, -4, 5, 7, 0, 6, 7, -9, 9, -4]], [[0.5, -1, 24.93175152910768, -4, 2.5, 5, -2.2, -2.651030586877352, -8, 7.7, 9.9, -10.5, -8, 9.9]], [[0, -2, 0, -3, -4, -5, 0]], [[1, 2, -4, -5, 0, 7, -9, -6, 0, 2, 1]], [[-5, 3, -2, 97, -1, -5, 4]], [[0, -2, -3, 2, -5, 3, -3, -2, 2, 0]], [[0, -1, -1, 0, 0, 0]], [[-5, -5, -10, -9, -4, -6, -2, -1, -5]], [[2, -4, -5, 0, 7, -9, 10, 0, 7]], [[-6, 0, -1.25, -2, -1.5, -0.75, -2.25, -1, -2, -3, -4, -5, -6]], [[-2, 1, 2, -10, -4, 6, -5, 0, 7, -9, 10, 0, 1, -5]], [[6, -7, -1, -3, -4, -3]], [[1, 2, -4, -5, 6, 7, -9, 10, 2, 1, 2, 10]], [[-9, -4, 7, 4, -2, 98, -1, -8, -5, -5, -9, -5]], [[1, 2, 1, 1, 1, 1, 2, -1, -3, 3, -3, 2, 2, 2]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2]], [[-5, -6, -4, -2, -1, -2, -5]], [[-5, -9, -4, -2, 1, -5, -5]], [[1, 1, -6, 1, 2, 2, 2, 2, 2, 2]], [[1, 3, 1, 1, 2, 2, 2, 2]], [[-3, -8, -5, 97, -8]], [[0, 10.538283343362641, -1.25, -1.5, -0.75, -2.25, -1, -2, 2, -4, -4, -5, -6]], [[1, -9, 1, 1, 1, 2, 2, 1, -3, -3, 2, 2, 2]], [[1, 1, 1, 1, -7, 1, 1, -3, 2, 2, 2, 2]], [[0, -9, -1, 7, -3, -3, -4, 10, -4]], [[3, -2, 2]], [[-2.6958053769612267, 33.195768044846155, -2.25]], [[1, 2, -10, -4, 6, -5, 0, 7, -9, 10, 0, 1, -5, 1]], [[9.9, 25.221353337136023, 33.195768044846155, -2.25, 25.12472520208241, -2.25]], [[-3, -1]], [[0, -8, -3, -4, -10, -3, -4]], [[1, 1, 1, 1, 1, 2, 2, 1, -3, -3, 2, 2, 1]], [[0.5, 2.5, 5, -2.2, -2.651030586877352, -8, 9.9, -10.5, 9.9]], [[9.9, 25.12472520208241, 25.12472520208241, 29.75618118087544, 33.195768044846155, -2.25, 33.195768044846155, 25.12472520208241, -2.25]], [[-6, 0, 0.5, -1.5, -0.75, -1, -3, -4, -5, -6]], [[-5, -9, -2, -10, -4, -9]], [[7, -1, -2]], [[0, -1, -5, -3, -4, 9, -5, -5, 0]], [[-5, -4, -3, 0, -5, -1, -1]], [[1, 1, 1, 1, 99, 1, 2, 2, 1, -3, -3, 2, 2, 2, 2]], [[0, -1, -2, -1, -9, -3, -6, -4, -4, 0]], [[6, 99, 3, -2, -5, -5]], [[1, 1, 1, 1, 2, -7, 1, 2, 6, 5, -1, 1, -3, -3, 2, 2]], [[1, 1, 1, 1, 1, 2, 1, -3, -3, 2, 2, 1]], [[21.28666897792971, 9.9, 21.859816644520016, 25.12472520208241, 33.195768044846155, -2.25, 33.195768044846155, 25.12472520208241, 33.195768044846155]], [[24.93175152910768, -2.25, 24.93175152910768, -2.25]], [[7, -7, 99, 3, -2, -1, -5, -5]], [[0.5, -1.6451572106484336, -4, 2.5, -8, 7.7, 9.9, -10.5, 9.9, -13.662203687087855]], [[0.5, -1, 24.93175152910768, -4, 2.5, 5, -2.651030586877352, -8, 7.7, 9.9, -10.5, -8, 9.9]], [[-1, -2, -4, 5, 7, 0, 6, 7, -9, -4]], [[1, 2, -4, -5, 6, 7, -9, 10]], [[9.9, 25.221353337136023, 24.93175152910768, -0.42322814636615796, 33.195768044846155, -0.5037419809615695, -2.25]], [[-1, -10]], [[1, 3, 6, 1, 1, 2, 1, 2, 2, 2, 2, 3, 1]], [[1, 1, 1, 1, 1, 98, 1, -3, 2, 2, 2]], [[98, -1]], [[-2.6958053769612267, -3.1836537136945844, 33.195768044846155, -2.25]], [[0, -1, -1, 7, -2, -3, -4, -7, -2, 9, 7]], [[7.878953248636265, 7.1018462924316985, 25.12472520208241, 33.195768044846155, -2.25, 33.195768044846155, 33.195768044846155, 33.195768044846155]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 2]], [[98, -2, 99, 99]], [[-1.3426789806479305, 32.97170491287429, -2.25, 32.97170491287429]], [[2, 0, -1, -2, -9, -3, 4, -6, -4, 7, 9]], [[-1, -2, -3, -4, 5, -1, 6, 7, 10]], [[1, 2, -4, -5, 0, 7, -10, -6, 0, 2, 1]], [[9.9, 33.195768044846155, 5.803598881698951]], [[-3, 5, -2, -5]], [[7, 98, 99, 99]], [[7, 1, 99]], [[-5, -9, -4, -2]], [[1, 1, 6, 1, 1, 2, 1, 2, 2, 2, 0, 2]], [[0.5, 0, -4, 2.5, 5, -2.2, -8, 7.7, -10.5, -10.338878645170468, -8]], [[0.5, 0, -4, -13.662203687087855, 2.5, 5, -1.2888053553154275, -8, 7.7, 9.9, -10.5, 9.9, -13.662203687087855, 9.9]], [[0, -1, -1, -1, 5, -9]], [[-5, -2, -10, 4, -4, -10]], [[0.5, -1.6451572106484336, -4, 2.5, 5, 7.7, 9.9, -10.5, 9.9, -13.662203687087855]]], "completion": "\ndef get_positive(l: list):\n return [num for num in l if num > 0]\n", "raw_completion": "```python\ndef get_positive(l: list):\n return [num for num in l if num > 0]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef get_positive(l: list):\n \"\"\"Return only positive numbers in the list.\n >>> get_positive([-1, 2, -4, 5, 6])\n [2, 5, 6]\n >>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n [5, 3, 2, 3, 9, 123, 1]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/31", "prompt": "\n\ndef is_prime(n):\n \"\"\"Return true if a given number is prime, and false otherwise.\n >>> is_prime(6)\n False\n >>> is_prime(101)\n True\n >>> is_prime(11)\n True\n >>> is_prime(13441)\n True\n >>> is_prime(61)\n True\n >>> is_prime(4)\n False\n >>> is_prime(1)\n False\n \"\"\"\n", "entry_point": "is_prime", "canonical_solution": "\n if n <= 1: return False\n n_sqrt = 1\n while n_sqrt ** 2 < n: n_sqrt += 1\n for i in range(2, min(n_sqrt + 1, n)):\n if n % i == 0:\n return False\n return True\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(6) == False\n assert candidate(101) == True\n assert candidate(11) == True\n assert candidate(13441) == True\n assert candidate(61) == True\n assert candidate(4) == False\n assert candidate(1) == False\n assert candidate(5) == True\n assert candidate(11) == True\n assert candidate(17) == True\n assert candidate(5 * 17) == False\n assert candidate(11 * 7) == False\n assert candidate(13441 * 19) == False\n\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[6], [101], [11], [13441], [61], [4], [1], [5], [11], [17], [85], [77], [255379]], "atol": 0, "plus_input": [[-5], [0], [2], [31], [40], [103], [199], [1009], [8999], [1234567], [9000], [32], [9001], [-1], [39], [1234566], [-4], [9002], [-6], [102], [101], [200], [56], [38], [37], [1010], [1234568], [1008], [33], [35], [64], [63], [1234564], [34], [1011], [1234569], [197], [-3], [1], [8998], [57], [28], [-2], [3], [1234563], [36], [9003], [30], [1234570], [-29], [9004], [-7], [16], [1012], [55], [-30], [-17], [7937], [34981], [42043], [-10], [10000000029], [123456789], [-9], [-18], [10000000028], [42042], [12], [11], [123456790], [-16], [10000000030], [-15], [7939], [7938], [7936], [13], [7935], [23], [42044], [-11], [-14], [7934], [7933], [10000000027], [14], [34980], [24], [15], [42041], [-8], [7940], [70], [-13], [-40], [18], [-12], [-47], [-49], [34979], [42040], [34978], [-41], [-42], [22], [25], [10], [67], [-39], [26], [62], [-48], [66], [-20], [7941], [-50], [-37], [61], [-21], [-28], [-101], [-255379], [-2147483648], [9999991], [7567216125], [34982], [34977], [123456788], [123456791], [-91], [93], [10000000031], [-90], [92], [17], [34983], [-92], [-89], [4], [-78], [82], [-76], [45], [5], [10000000032], [42045], [44], [46], [-100], [19], [72], [91], [-38], [-75]], "completion": "\n\nimport numpy as np\n\ndef is_prime(n):\n \"\"\"\n Return true if a given number is prime, and false otherwise.\n \"\"\"\n if n < 2:\n return False\n for i in range(2, int(np.sqrt(n))+1):\n if n % i == 0:\n return False\n return True\n\n", "raw_completion": "```python\n\nimport numpy as np\n\ndef is_prime(n):\n \"\"\"\n Return true if a given number is prime, and false otherwise.\n \"\"\"\n if n < 2:\n return False\n for i in range(2, int(np.sqrt(n))+1):\n if n % i == 0:\n return False\n return True\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef is_prime(n):\n \"\"\"Return true if a given number is prime, and false otherwise.\n >>> is_prime(6)\n False\n >>> is_prime(101)\n True\n >>> is_prime(11)\n True\n >>> is_prime(13441)\n True\n >>> is_prime(61)\n True\n >>> is_prime(4)\n False\n >>> is_prime(1)\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/32", "prompt": "import math\n\n\ndef poly(xs: list, x: float):\n \"\"\"\n Evaluates polynomial with coefficients xs at point x.\n return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n\n \"\"\"\n return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])\n\n\ndef find_zero(xs: list):\n \"\"\" xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"\n", "entry_point": "find_zero", "canonical_solution": "\n\n dxs = [xs[i] * i for i in range(1, len(xs))]\n def func(x):\n return poly(xs, x)\n def derivative(x):\n return poly(dxs, x)\n \n x, tol = 0, 1e-5\n for _ in range(1000):\n fx = func(x)\n dfx = derivative(x)\n if abs(fx) < tol: break\n x = x - fx / dfx\n\n return x\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n import math\n import random\n rng = random.Random(42)\n import copy\n for _ in range(100):\n ncoeff = 2 * rng.randint(1, 4)\n coeffs = []\n for _ in range(ncoeff):\n coeff = rng.randint(-10, 10)\n if coeff == 0:\n coeff = 1\n coeffs.append(coeff)\n solution = candidate(copy.deepcopy(coeffs))\n assert math.fabs(poly(coeffs, solution)) < 1e-4\n\n", "contract": "\n assert len(xs) > 0 and len(xs) % 2 == 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[-10, -2]], [[-3, -6, -7, 7]], [[8, 3]], [[-10, -8]], [[-3, 6, 9, -10]], [[10, 7, 3, -3]], [[8, -2, -10, -5, 3, 1, -2, -6]], [[1, -7, -8, 2]], [[1, 1]], [[-9, 4, 7, -7, 2, -8]], [[10, 9, 1, 8, -4, -8]], [[-3, -1]], [[-3, -7]], [[-2, 4, 10, 1, -5, 1, 1, -4]], [[10, -8, 9, 10, -5, 7]], [[-5, 4, 2, -2]], [[1, -9, -3, -9]], [[2, -2, -8, -4, 8, 1]], [[10, 5, 2, 10]], [[-6, -2, -6, -3, 7, 7, -2, 8]], [[8, 2, 1, -3, -6, 6, 5, -8]], [[-7, -6]], [[3, 9, -8, 2]], [[9, 4, 6, -2, 7, -10, -7, 7]], [[10, 1, -7, -1, 3, -5]], [[-10, -2, 6, -5, 6, -7, 10, -1]], [[-6, 1, -5, 7]], [[9, 1]], [[-10, -7, 1, -1, -3, -9, -3, 8]], [[-8, 5]], [[7, -6]], [[5, 7, -5, -2]], [[-4, 7, -4, -1, 2, 10, 1, 4]], [[-7, -3, -3, -8, 1, -10, 8, 7]], [[8, -3, -10, -8]], [[-3, -8]], [[1, -8]], [[-2, 5, -4, 7]], [[8, 8, 5, -3]], [[3, -4, -7, -7, 3, 1, 3, 3]], [[-9, 10, 10, -7, -9, 2, 1, -7]], [[-4, -4, 7, 4]], [[3, -5, -2, 4]], [[-8, 4, 7, -7]], [[10, 7]], [[-8, -3]], [[3, 5, 5, -4]], [[-9, -5, 2, -10, 2, -2, 4, -1]], [[7, 5, -6, -4, -1, -4, -9, 8]], [[1, -9]], [[8, 5]], [[-9, 6, -8, -5]], [[9, -8]], [[2, -7, 8, -3]], [[9, -8]], [[8, 8, 6, 1, -2, -4, 1, -3]], [[2, -6, 10, -1, 4, 1]], [[-10, 4]], [[-8, 7]], [[6, -2, -6, 1]], [[-3, 1]], [[-5, 4, 7, -1, 9, 10]], [[7, -1]], [[-6, -2]], [[-7, 7]], [[-2, -1, 9, -4]], [[-4, 10, -2, 6, 5, -2]], [[-8, 10]], [[-2, -9, -10, 1, -6, 10, -2, -5]], [[7, 3, 7, -10, -7, -8, -6, 7]], [[1, 8]], [[3, -6, -9, -1]], [[-9, 1, -4, -3, -7, 1]], [[9, -6, -3, -5, -5, 3, -10, -5]], [[3, -3, -2, -5, -7, 2]], [[5, -3]], [[4, 1, -1, -3]], [[-10, -4, 2, 1]], [[-8, -2, 1, 10, 6, 2]], [[-10, -7, -2, -5, 8, -2]], [[-7, 9]], [[1, 1, 3, 9, 6, -7, 2, 8]], [[-2, -9, 3, -10]], [[1, 3, -8, 1]], [[-7, -1, 6, -1, 3, 1]], [[-1, 7, -6, -4, 3, 2, -5, 9]], [[2, 7, -10, -1, -1, -4]], [[8, 9, 10, 1, 4, 4, 4, -4]], [[-5, -8, -1, 6, 10, 9, 1, -8]], [[-1, -3, -4, -6]], [[-9, -3]], [[9, -8, 4, 3, 10, 8, -4, 2]], [[2, -3, -6, 10, -10, -7, 3, -3]], [[6, 4, -9, 7]], [[-7, 4, -6, 4]], [[4, 9, 6, 3, 7, 4]], [[5, 4, -2, -3]], [[6, 5, 10, -3, -2, 4]], [[-1, -3]], [[1, 1, 7, -8, -6, -6]]], "atol": 0.0001, "plus_input": [[[5, 10, -3, 1]], [[1, -20, 156, -864, 2667, -4392, 3744, -1440]], [[0, 2]], [[-1, -1, 1, 1]], [[1, -1, 0, 1]], [[6, -1, 2, 1, -3, 1]], [[-1, 10, 1, 1]], [[-1, -36, 6, -1440, 1, 1]], [[3744, 1, 0, 2]], [[1, -20, 156, -864, 2667, -4391, 3743, -1440]], [[1, -20, 156, -864, 2667, -4391, 3743, -4, -1440, -4391]], [[0, -36, 0, 54, 7, 54]], [[-3, 2]], [[0, -36, 0, -3, 7, 54]], [[-20, 156, -864, 2667, -4391, 3743, -4, -1440, -1440, -4391]], [[-36, 6, -1440, 1]], [[-36, 6, -1441, 1]], [[6, 1, -1, 2, 1, -3, -4, 1]], [[6, 1, -1, 2, 1, -2, -4, 1]], [[0, 0, 6, -1]], [[0, -36, 0, -4, 7, 54]], [[2667, 6, 1, -1, -2, -4, 1, -1]], [[0, -1, -36, 6, -1440, 1, 1, -36]], [[6, -1, -4392, 2, 1, -3, 1, 1]], [[-36, -20, 6, -1440, 1, 1]], [[2, 5, -36, 1, 54, 7]], [[0, 2667, 0, 0]], [[0, -36, 0, 4, -4, 7, 54, 7]], [[-36, 6, 6, -1441]], [[0, -1, 0, 1]], [[2667, 6, 1, -1, 1, -1]], [[true, true, true, true, false, true, false, false]], [[0, 6, -1440, 1, 1, -36]], [[-36, 6, -1440, -36]], [[-1, -36, 6, -1440, 1, 0]], [[6, 1, -1, 1, -3, -4, 1, 6]], [[-4392, -1, 6, -2]], [[2667, 6, 1, -1, -2, 1, -1, 2667]], [[6, -1, 2, 1, -3, 3744]], [[-36, -20, -20, 6, -1440, 1]], [[1, -1, 0, -1441]], [[-4, -1, 0, 1]], [[0, -1, 1, 1]], [[-4392, -20, 6, 4]], [[1, 2]], [[6, -1, -4392, 2, 1, 3743, 1, 1]], [[5, 10, 7, 10, -3, 1]], [[0, -20, 0, 0]], [[1, -20, 156, -864, 2667, -4392, 3743, -1440]], [[0, -1, -36, 6, -1440, 1, 1, -36, 0, 1]], [[-3, 6, -2, 6]], [[0, -4391, 0, 0]], [[-1, -36, 1, 0]], [[1, -1, 10, 1]], [[-3, 6, -2, 6, -2, -2]], [[6, -2, 2, 1, -3, 3744]], [[-1, -1, -3, -36, 1, 0]], [[-1, -4391, 0, 0]], [[6, -1, -4392, 2, 1, 1, 1, 6]], [[6, 2, 1, -3, 1, 2]], [[0, -36, 0, -4, -5, 7, 54, -36]], [[0, -36, 0, -3, -5, 7, 54, -36]], [[-36, -19, 6, -1440, 3743, 1]], [[5, 10, 1, 1]], [[1, -4391, 0, 0]], [[6, 2, 1, -3, 1, 1]], [[6, -36]], [[-1, -4391, -1440, 0, 0, -4391]], [[1, 1]], [[-1, 5, 1, 0]], [[1, -4391, 4, 0]], [[-1, -864, 1, 0]], [[0, -4, 0, -4, 6, 54]], [[2, 7, -36, 0, 54, 7]], [[6, -1, -4392, 2, 1, 0, 1, 6]], [[7, -1, -4392, 2, 1, 0, 1, 6]], [[0, -3, 4, 7, 54, -36]], [[6, 10, 1, -1, 2, 1, 1, -2, -4, 1]], [[2667, 6, 1, -1, -2, 1, 0, 2667]], [[-37, 6, -1440, 1]], [[-1, -2, -3, -36, 1, 0]], [[-20, 156, 7, -3, -4391, 3743, -4, -1440, -1440, -4391]], [[6, 5, 10, 7, 10, -3, -37, 1]], [[6, 1, -1, -864, 1, -36, -2, -4]], [[7, -1, -4392, -19, 1, 0, 1, 6]], [[0, 2, 0, 1, 54, 7]], [[-1, -4391, -1, 0]], [[0, 0, 0, 0, 0, 1]], [[0, -3, 0, 1]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, -10]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, -10]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000]], [[-2, -5, -10, -17, -26, -37]], [[2, 5, 10, 17, 26, 37]], [[0, 2, 0, 3, 0, 4, 0, 5]], [[9, -7, 3, 2, 8, -4, -10, 6, 5, -1]], [[0, -4, 0, 0, 2, 0, 1, 0]], [[0, 2, 0, 3, 0, 4, 8, 5, -5, 0]], [[0, 0]], [[0, 0, -1186740000, 1]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, -11]], [[1, 3, 10, -4, 5, -6, 7, -8, 9, -10]], [[26, 1, -2, 3, -4, 5, -6, 7, 21000, -8, 9, -10]], [[1, 3, 10, -4, 4, 8, 2, -6, 7, -8, 9, -10]], [[0, 2, 0, 3, 0, 4, 0, 26, 5, 0]], [[2, 5, 17, 26, 4, 4]], [[2, 5, 10, 17, 26, 17]], [[3, 5, 17, 26, 4, 4]], [[2, 5, -6, 26, 4, 4]], [[9450000, 9, -7, 3, 2, 8, 2, -4, -10, 6, 5, -1]], [[9450000, 9, -7, 3, 2, 8, 1, -4, -10, 6, 5, -1]], [[5, 17, 26, 3, 4, 4]], [[9450000, 9, 9450000, -7, 3, 2, 6, 8, 2, -4, -10, 6, 5, -1]], [[2, 5, 10, 17, 26, 37, 10, 2]], [[0, 0, 0, 0, 0, 0, 0, -37, 0, -10, 0, 0]], [[9450000, 9, 3, 2, 8, 2, -4, -8, -10, 6, -1, 5]], [[-2, -5, -10, -17]], [[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[2, 2, 26, 3, 4, 4]], [[9450000, 9, -7, 3, 2, 6, 1, -4, -10, 6, 5, -1]], [[1, -2, 4, -4, 5, -6, 7, -8, 9, -11]], [[9, -6, 3, 2, 8, -4, -10, 6, 5, -1]], [[5, 17, 26, 3, 4, 26, 4, 26]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -10, 7, 5, -1, 9450000]], [[9450000, 9, -7, 3, 2, 6, 1, -4, -10, 6, 17, -1]], [[-1, -3, 1, -3]], [[26, 1, 0, -1186740000, 1, 0]], [[9450000, 9, -6, 3, -7, 2, 6, 1, -4, -10, 6, 5, -1, 9450000]], [[0, 2, -630000, 3, 0, 4, 0, 5]], [[9, -6, 3, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[9450000, 9, -6, 3, -7, 2, 6, 1, -4, -10, 6, -11, -1, 9450000]], [[26, -2, 4, -4, 5, -6, 7, -8, 9, -11]], [[0, -78840000, 0, 3, 0, 4, 0, 26, 5, 0]], [[-2, -5, -11, -17]], [[9450000, -2, -7, 3, 2, 8, 1, -4, -10, 6, 5, -1]], [[0, 0, 0, -4, 0, 1]], [[26, 1, 3, -4, 5, -10, 7, 21000, -8, 9, -10, 26]], [[1, 3, 10, -4, -3, 5, -6, 7, -8, 9]], [[-5, 26, 1, 3, -10, -4, 5, -10, 7, 21000, -8, 9, -10, 26]], [[9, -6, 4, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[1, -630000, 3, -4, 5, -10, 7, -8, -8, 9, -10, 26]], [[9, -6, -8, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[9450000, 6, 9, 8, 3, 2, 8, 2, -4, -10, 7, 5, -1, 9450000]], [[1, 3, 10, -4, 5, -6, 7, -8, 9, 9, -10, 9]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -10, 7, -22, -1, 9450000]], [[9, -6, -8, 2, -630000, -4, -10, 26, 6, 5, -1, 8, 10, -8]], [[1, -630000, 3, -4, 5, -10, 7, -8, -8, 9, -10, 26, 5, -10]], [[2, 5, 10, 26, 37, 10]], [[26, 1, 3, -4, 4, -10, 7, 21000, -8, 9, -10, 26]], [[1, 3, 10, -4, 5, -6, 7, -8, 9, -10, -8, -8]], [[0, 2, 0, 2, 0, 4, 0, 5]], [[9450000, 9, -7, 3, 2, 1, -4, 6, 5, -1]], [[9, -7, 2, 8, -4, -10, 6, 5, -1186740000, -1]], [[9450000, -2, -7, 3, 2, 8, 1, -2, -4, 6, 5, -1]], [[9450000, 9, -6, 3, -7, 2, 6, 1, -4, -10, 6, -11, -1, 9450000, 9, 6]], [[1, -2, 4, -4, 5, 7, -8, 9]], [[1, 3, -4, 5, -6, 7, -8, 9, -11, -6]], [[5, 10, 17, 26, 37, 10, 2, 2]], [[-10, 10, 0, -83, 0, 0, 0, 1]], [[1, 3, 4, -4, 5, -6, 7, -8, 9, 9, -10, 8]], [[-300, -6, 4, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[9450000, 9, -6, 3, -7, 2, 6, 2, -4, -10, 6, -11, -1, 9450000]], [[-11, 5, 10, 17, 26, 17]], [[-2, -5, -10, -17, -26, -1186740000, -37, -1186740000]], [[9, -6, 21000, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[2, 5, 26, 37, 10, 2]], [[9, -7, 3, 2, 8, -4, -10, 6, 5, -1, -1, 2]], [[1, 3, 10, -4, 5, 8, 2, -6, 7, -8, 9, -9]], [[2, 5, 10, 17, 26, 37, 26, 2]], [[0, -78840000, 0, 3, 0, 4, 26, 5, 0, 26]], [[2, 5, -6, 26, -630000, 4]], [[1, -2, 4, -4, 5, -6, 7, 9, -11, -4]], [[9450000, 9, -7, 3, 2, 8, 2, -4, -10, 6, 5, -1, 6, -10]], [[-2, -5, -10, 6, -17, -26, -1186740000, -37, -1186740000, -1186740000]], [[-2, -5, -4, -10, -17, -37]], [[2, 5, -300, 10, 17, 26, 37, 10, 2, 10]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -10, 6, 5, -1, 9450000]], [[0, 0, 0, 2, 0, 1]], [[5, 17, 26, 3, 4, -6, 26, 4, 26, 26]], [[2, 6, 17, 26, 4, 4]], [[17, 6, 9, -7, 3, 2, 8, 2, -4, -10, 7, -22, -1, 9450000]], [[0, 1, 2, -3, -630000, 3, 0, 4, 0, 5]], [[9, -6, 20999, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[2, 5, 10, 17, -7, 37]], [[-300, -6, 2, 2, 8, -4, -10, -6, 6, 5, -1, 8]], [[1, 3, 80, -4, 5, 8, 2, -6, 7, -8, 9, -9]], [[26, 1, -2, 3, -4, 5, -6, 7, 9450000, 21000, -8, 9, -10, -10]], [[9450000, 6, 9, -7, 4, 2, 8, 2, -4, -10, 7, -22, -1, 9450000]], [[26, 6, 1, 3, -4, 5, -6, 7, -1186740000, 21000, -8, 9, -10, 21000]], [[0, 2, 0, 3, -4, 0, 4, 8, 5, -5, 0, -5]], [[5, 17, 26, 3, 4, -6, 26, 4, 9450000, 26]], [[0, 0, 2, 0, 0, 1]], [[-300, 21000, -630000, 9450000, -78840000, -6, -1186740000, 1935360000, -1663750000, 725760000]], [[26, 1, 2, 80, -4, 5, 8, 2, -6, 7, -8, 9, -9, -8]], [[0, -4, 0, 1, 2, 0, 1, 0]], [[1, 3, 5, -6, 7, -8, 9, -10]], [[5, 10, 17, 37, 26, 2]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -78840000, 6, 5, -1, 9450000]], [[26, -2, 4, -4, 5, -6, -26, -8, 9, -11]], [[1, 10, -3, 5, -6, 7, -8, 9]], [[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -37, 0, 0]], [[27, 1, 3, -4, 4, -10, 7, 21000, -9, 9, -10, 26]], [[2, 10, 26, 4, 37, 10]], [[-630000, 3, -4, 5, -11, 7, -8, -8, 9, -10, 37, 26]], [[0, 2, 0, 3, -4, 0, 4, 8, 5, -5, 0, -5, -5, 3]], [[1, 3, 10, -9, -4, 5, -6, 3, 7, -8, 9, -10]], [[0, -37, -78840000, 0, 3, 0, 4, 26, 0, 26]], [[2, 3, 4, 4]], [[-2, -7, 3, 2, 8, 1, -2, -4, 5, -1]], [[9450000, 5, 9, 3, 2, 8, 2, -4, 3, -8, -10, 6, -1, 5]], [[-630000, 2, -630000, 3, 0, 4, 0, 5]], [[1, 3, 80, -4, 17, 8, 2, -6, 7, -8, 9, -9]], [[9, -6, 3, 2, 8, -4, -10, 6, 5, -1, 2, -6]], [[2, -6, 26, 4, 4, 4]], [[0, 2, 0, 3, 0, -37, 8, 5, -5, 0]], [[1, 4, -4, 7, -8, 9]], [[-2, -5, -10, 6, -17, -26, -1186740000, -37, -1186740000, -1186740000, -26, -1186740000]], [[9, -6, 21000, 2, 8, -4, 37, -10, 1935360000, 26, -22, 5, -1, 8]], [[2, 5, -300, 10, 17, 26, 37, 10, 2, 20999]], [[0, 2, 0, 0, 3, -4, 0, 4, 8, 5, -5, 0, -5, -5, 27, 3]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 0, 0, 0, 0, 1, 1]], [[3, 9450000, 5, 17, 26, 4]], [[-300, 3, -6, 4, 2, 8, -4, -10, 27, 26, 6, 5, -1, 8]], [[2, 5, -300, 17, 26, 17]], [[9450000, 9, -6, 3, -7, 2, 6, 2, -4, 4, 6, -11, -1, 9450000]], [[0, -4, 0, 0, 1, 2, 0, 1, 0, 0]], [[0, -4, 0, 0, 2, 0, 0, 0]], [[-300, 21000, -630000, 9450000, -78840000, -6, 37, 1935360000, -1663750000, 725760000]], [[26, 1, -2, -1186740000, 1, 0]], [[-10, 10, 0, 27, 0, 0, 0, 10]], [[36.21659531317661, -93.3300585215481, -70.42249030811152, 80.48334419444029, 51.5786156390196, -4.496170735344691]], [[27, 5, 10, 26, 37, 10]], [[0, 2, 0, 3, 0, 4, 8, -26, -5, 0]], [[1, -2, 4, -1663750000, 5, 3, -1, 9]], [[2, 16, 6, 17, 9, 26, 4, 4]], [[1, 10, -3, 5, -6, -1186740000, 9, 7, -8, 9]], [[3, 9450000, -1, 17, 26, 4]], [[1, 3, 5, -6, 7, -8, 21000, -10]], [[2, 5, -300, 17, 26, 37, 10, 2]], [[27, -37, -78840000, 0, 3, 0, 4, 26, 0, 26]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, 3]], [[0, -4, 0, 0, -7, 2, 0, 0]], [[17, 6, 9, -7, 4, 2, 8, -4, -10, 7, -7, -22, -1, 9450000]], [[-2, -3, -11, -17]], [[17, -6, 6, 9, -7, 4, 2, 8, -4, -10, 7, -7, -22, -1, 9450000, 9450000]], [[9449999, 9, -6, 3, -7, 2, 6, 1, -4, -10, 6, -11, -1, 9450000, 9, 6]], [[0, 2, -630000, 3, 1, 0, 0, 5]], [[0, 2, 0, 3, 0, 4, 8, 5, -5, 0, -5, 5]], [[0, -6, -8, 2, 8, -4, -10, 26, 6, 5, -1, 8]], [[-300, 21000, -630000, 9450000, -78840000, 9449999, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -1186740000]], [[-26, 9, -6, 3, -7, 2, 6, -4, -10, 6, -11, -1, 9450000, -26]], [[9, -7, 3, 2, -4, -10, 6, 5, -1, -1, 2, 2]], [[2, 5, 9, 17, 26, 37]], [[2, 5, 10, 26, 37, 5]], [[1, 3, 10, -4, 5, -22, 7, -8, 9, -10, -8, -8, 5, -8]], [[2, 5, 17, 26, 37, 2]], [[-4, 1, -2, 4, -4, 5, -6, 7, 9, -11, -4, -6]], [[3, 5, 17, 26, 4, -9]], [[0, -78840000, 0, 3, 0, 1, 0, 26, 5, 0]], [[1, -300]], [[9450000, 5, 9, 3, 8, 2, -4, 3, -8, -10, 6, -1, 5, -1]], [[27, 5, 26, 37, 10, 26]], [[0, -7, 0, 0, 0, 0, 0, 0, 0, 0, 26, 0, 0, -1, 1, 1]], [[-630000, 3, 5, -11, 7, -8, -8, 9, -10, 37, 26, -10]], [[-2, -3, -11, -16]], [[0, -7, 0, 0, 0, 0, 0, 0, 5, 0, 0, 26, 0, 0, -1, 1, 1, 0]], [[-630000, 2, -630000, 2, 10, 4, 0, 5]], [[1, 3, 10, -4, 5, -6, 8, 7, 10, -8, 9, 9, -10, 9]], [[-2, -5, -11, -18]], [[9, -6, 3, 2, 8, -4, -10, 6, 7, 5, -1, 2, -6, 3]], [[9, -6, 3, 2, 8, -4, -10, -4, 6, -5, 5, -1]], [[-2, -15]], [[2, 10, 26, 17]], [[0, -4, 0, 0, 2, 0, 1, 1]], [[2, 5, 3, 26, 4, 4]], [[0, 2, 0, 0, 4, 0, 1, 26, 5, 0]], [[9, -6, 21000, 2, 8, -4, -10, 26, 6, 5, -1, 1935360000]], [[2, 2, 26, 3, -10, 4]], [[1, 3, 10, 0, -4, 5, -6, 3, 7, -8, 9, -10]], [[0, 2, -630000, 3, 16, 4, 0, 5]], [[1, -2, 4, -1663750000, 5, -4, -1, 9]], [[26, 1, 2, -4, 5, -10, 7, 21000, -8, 9, -10, 26]], [[9450000, 9, -6, 3, -7, -18, 6, 2, -4, -10, 6, -11, -1, 9450000]], [[-10, 20999, 0, -1, 0, 0, 0, 1]], [[9, -6, 3, 8, -10, 6, 5, -1, 2, -6]], [[0, 2, 0, 80, 0, 4, 0, 5]], [[-300, -300, 21000, -630000, 9450000, -78840000, -6, 37, 1935360000, -1663750000, 725760000, -300]], [[2, 5, -300, 10, 17, 26, 37, 2, 20999, 37]], [[-26, 9, -6, 3, -7, 2, -4, -10, 6, -1, 9450000, -26]], [[9, -7, 3, 2, 8, -4, -10, -3, 6, 5, -1, -7]], [[26, 1, 2, 80, -4, 5, 8, 2, -6, 7, -8, 9, -9, -8, -8, 7]], [[-11, 5, 10, 25, 26, 17]], [[1, 3, 10, -4, -7, -3, 5, -6, 7, -8, 9, -3]], [[9, -6, 2, 8, -4, -10, 26, 6, 5, -1, 8, -6]], [[1, 3, 10, 0, -4, 5, -6, 3, 7, -9, 9, -10]], [[0, 2, 0, 3, 0, 5, 0, 26, 5, 0]], [[8, -16, 26, 3, 4, 4]], [[-300, -300, 21000, -630000, 9450000, -78840000, -6, 36, 1935360000, -1663750000, 725760000, -300]], [[1, 3, 10, -4, 5, 10, 7, -8, 9, -10, -8, -8]], [[26, -2, 4, -4, 5, -6, -8, 9, -11, -6]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 0, 0, 0, 0, 1, 1, 0, 0]], [[9, -7, 3, 2, 8, 17, -10, 6, 5, -1]], [[-5, -2, -5, -11, -18, -5]], [[0, 1935360000, 0, 3, 0, 4, 26, 5, 0, 26]], [[5, 17, 26, 3, -22, -6, 26, 4, 9450000, 26]], [[-6, -2, -5, -11, -18, -5]], [[9, -6, -8, 2, -630000, -4, -10, 26, 6, 5, -1, -15, 10, -8]], [[5, 17, 26, 3, 4, -6]], [[9450000, 9, -7, 17, 2, 6, 1, -4, -10, 6, 5, -1]], [[-300, -300, 21000, -630000, 9450000, -78840000, -6, 37, 1935360001, -1663750000, 725760000, -300, 725760000, -300]], [[1, -2, 3, -4, 5, -26, 7, -8, 9, 3]], [[0, -78840000, 0, 3, 36, 0, 1, 0, -1, 26, 5, 0]], [[-2, -1]], [[3, 5, 17, 26, 4, -83]], [[3, 5, 17, 21000, 4, -9]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -10, 7, 4, -1, 9450000]], [[9, -7, 3, -1186740000, 2, 8, 17, 6, 5, -1]], [[2, 5, -300, 17, 26, 17, -300, 26]], [[0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[1, 2, 3, 5, -6, 7, -8, 21000, -10, 5]], [[2, 5, -300, 10, 17, 26, 37, 10, 2, 20999, -10, 2]], [[-2, -5, -10, -17, -26, -1186740000, -1186740000, -26]], [[1, -2, 3, -3, 5, -6, 7, -8, 9, -10]], [[9450000, 8, -7, 3, 2, 1, -4, 6, 5, -1]], [[1, -2, 3, -3, 5, -6, 7, -8, 9, -10, 5, -3]], [[9, -6, -8, 6, -630000, -4, -10, 26, 6, 395580000, -1, -15, 10, -8]], [[-300, -6, 4, -11, 8, -4, -10, 26, 6, 5, -1, 8]], [[0, -4, 0, 0, 1, 2, 0, 1, 0, 80]], [[1, 4, -4, 16, 7, -8, 9, -8]], [[0, 2, 0, 3, 0, 5, 0, 26, 9450000, -18]], [[9, -6, 2, 8, -4, -10, 26, 6, 5, -15, -1, 8, 4, -6]], [[27, 1, 3, -4, 4, -10, 7, 7, 21000, -9, 9, -10, 26, -9]], [[-26, 9, -6, 3, 2, -630000, 6, -4, -10, 6, -11, -1, 9450000, -26]], [[0, 2, 0, 3, -4, 0, 4, 8, 5, -5, 25, -5]], [[26, -2, 4, -4, 4, -6, 7, -8, 9, -11]], [[0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[0, -26, 0, 0, 1, 0, 0, 0, 0, 0, 0, -37, -1, 0]], [[2, 5, -300, 16, 26, 37, 10, 2]], [[2, 2, 16, 3, 4, 4]], [[1, 3, 5, -6, 7, -8, -10, 5]], [[9450000, 5, 9, 3, 2, -15, 2, -4, 3, -8, -10, 6, -1, 5]], [[-300, -630000, 9450000, -78840000, 9449999, 395580000, -1186740000, 1935360001, 1935360000, -1663750000, 725760000, -1186740000]], [[0, -630000, 3, 16, 4, 0, -630001, 5]], [[3, 9450000, -1, 16, 26, 4]], [[1, 3, 10, 10, -4, 5, -6, 3, 7, -8, 9, -10]], [[-9, 1, 1, 2, -3, -630000, 3, 0, 4, 0]], [[0, 0, 0, -4, 0, 5]], [[2, 5, -300, 10, 17, 26, 37, 9, 2, 20999]], [[0, -78840000, 3, 0, 4, 26, -1663750000, 5, 0, 26]], [[1, -6, -1, 0, 0, 0, 26, 0, 0, -10]], [[0, -78840000, 0, 3, 36, 0, 1, 0, -1, 26, 5, 0, 0, 0]], [[-6, 21000, 3, 2, 8, -4, 26, 6, 5, -1, 1935360000, 26]], [[2, 5, -300, 10, 17, 26, 36, 9, 2, 20999]], [[9, -7, 3, 2, 8, -4, -10, -3, 6, 80, 5, -1]], [[1, -2, 4, -1663750000, 5, -4, -1, -3]], [[9, -6, 3, 2, 8, -4, -10, -4, 6, -5, 4, 5, -1, 3]], [[9450000, 6, 9, -7, 3, 2, 8, 2, -4, -10, 6, -27, -1, 9450000]], [[9, -7, 2, 8, -4, -10, 6, -8, -1186740000, -1]], [[5, 17, 25, 3, 4, -6]], [[26, -2, 4, -5, 5, -6, -8, 9, -11, -6]], [[-2, -3, -11, -15, -17, -3]], [[1, 3, 4, -4, 5, -6, 7, -8, 9, -10]], [[5, -300, 17, 26, 17, -300, 26, 26]], [[9, -6, 2, 8, 7, -10, 26, 6, 5, -1, 7, -6]], [[-11, 5, 10, 17, 26, -9]], [[9, -7, 2, -4, -10, 6, -8, -1186740000]], [[0, 0, 2, 0, 1, 1]], [[1, 1, 0, -1186740000, 1, -1186740000]], [[0, 0, -83, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[2, 2, 6, 17, 26, 4, 4, 4]], [[80, -11, 5, 10, 17, 10, 26, -9, 10, 5]], [[-2, -5, -10, -17, -26, -38]], [[2, 5, 3, 26, 4, 4, 26, 4]], [[5, 10, 17, 38, 26, 2]], [[1, 3, 10, -4, 5, -6, 3, 7, -9, 9, -10, -6]], [[2, 5, -300, 10, 17, 26, 37, -4, 2, 20999]], [[-6.1509041036015475, 29.8879778900332, -40.31623230535513, 61.77041874240217, -40.10043520968048, -53.63099863438985, -95.5546085993868, 67.31201760943709, -66.42748743462532, -40.10043520968048]], [[-27, 4, -4, 16, 7, -8, 9, -83]], [[-8, 2, 9, 17, 26, 37]], [[1, 1, 0, 1]], [[9, -6, 3, 2, 8, -4, -10, -4, 7, 5, -1, 2, -6, 3]], [[-26, -1, 26, 0, 3, 0, 5, 0, 26, 5, -1, 0, 0, 4]], [[27, -37, -78840000, 0, 4, 0, 4, 26, 0, 26]], [[5, 17, 26, 3, 4, -6, 4, 9450000, 26, 9450000]], [[1, 3, 4, -10, 5, -6, 7, -8, 9, -10]], [[9, -6, 2, 8, -4, -10, 6, 5, -1, -10]], [[1, -2, -6, 3, -3, 5, -6, 7, -8, 9, -10, 5, -3, 3]], [[9450000, 9, -6, 3, -7, 2, 6, 1, -4, -10, 5, -11, -1, 9450000]], [[-4, 1, -2, 4, -4, -26, -6, 7, 9, -11, -4, -6]], [[1, 3, 10, -4, 4, 8, 2, -6, 7, -8, 8, -10]], [[2, 5, -300, 10, 17, 25, 37, -300, -4, 2, 20999, 37]], [[-26, 9, 3, 2, -630000, 6, -4, -10, 6, -11, -1, 9450000, -26, -630000]], [[1, 3, 5, -6, 7, -8, 26, -10]], [[2, 5, -6, 26, 6, 4]], [[9, -10, -8, 2, -630000, -4, -10, 26, 6, 5, -1, -15, 10, -8]], [[0, 2, 0, 80, 0, 4, 0, 0]], [[9, -6, 20999, 2, 8, -5, -4, 26, 6, 5, -1, 8]], [[26, 1, 3, -4, 4, -10, 7, 21000, 9, -10, 26, 21000]], [[2, 5, 3, 27, 4, 4, 26, 4]], [[2, -1186740000, 26, 3, -10, 4]], [[-11, 5, 27, 17]], [[1, 3, 10, -4, 3, 8, 2, -6, 7, -8, 8, -10]], [[1, -2, -6, 3, -3, 5, -6, 7, -8, 9, -10, 5, -3, -3]], [[-2, -6, -4, -10, -17, -37]], [[2, 5, -300, 17, 26, 17, -299, 26]], [[-6, -2, -15, -11, -5, -15]], [[-6, 21000, 2, 8, -4, -10, 26, -300, -37, 5, -1, 1935360000]], [[-8, 5, -300, 10, 17, 26, 26, 36, 9, 2, 20999, 9]], [[-26, 2, 16, 3, 4, 4]], [[4, 17, 26, 3, 4, 4]], [[26, -2, 3, -4, 5, -6, 7, 21000, -8, 9, -10, 7]], [[26, 1, -2, 3, -4, 6, -6, 7, 21000, -8, 9, -10]], [[26, -2, 4, -5, 5, -6, -8, 9, -1186740000, -7, -11, -6]], [[26, 1, 3, -4, 4, -10, 21000, 9, -10, 21000]], [[6, 9450000, 9, -6, -7, 2, 6, 1, -4, -10, 6, -11, -1, 9450000, 9, 6]], [[0, 0, 0, 0, 0, 0, 0, 0]], [[1, 1, 1, 1, 1, 1, 1, 1]], [[-4, 7, -4, -1, 2, 10, -1, -4]], [[0, 5, 0, 4, 0, -3]], [[0, 0, 0, 0, 0, 0, -3, 0, 0, 0, -10, -3]], [[9, -6, 3, 2, 8, -4, -10, 6, 5, -1, 2, 3]], [[1, -3, 0, 1]], [[0, 2, 0, 3, 1, 4, 0, 5]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000]], [[0, 5, 10, 17, 26, 37]], [[9, -7, 3, 2, 8, -4, -10, 5, 5, -1]], [[1, -2, 3, -4, -6, 7, -8, 9, -10, 3]], [[0, 2, 0, 5, 1, 4, 0, 5]], [[0, 2, 0, 3, 1, 0, 0, 5]], [[9, 4, -6, 3, 2, 8, -4, 725760000, -10, 6, 5, -1, 2, 3]], [[0, 2, 0, 6, 1, 4, 0, 5]], [[1, -2, 3, -4, -6, 7, -8, 9, -10, -3]], [[-2, -5, -10, -37, -17, -26, -37, -5]], [[-2, -17, -10, 3, -26, -37]], [[0, 0, 0, -1, 0, 1]], [[9, -7, 3, 2, 8, -3, -4, -10, 6, 5, -8, -1]], [[1, -2, 3, -4, -6, 7, -9, 9, -10, 3]], [[1, -2, 3, -4, -6, 7, -8, -2, -10, 3]], [[-300, 21000, -630000, 9450000, -78840000, -300, -1186740000, -1663750000, 725760000, -78840000]], [[-1, 5, 10, 17, 26, 37]], [[9, -6, 3, 2, 8, -10, 6, 5, -1, 2, 3, 9]], [[-2, -6, -10, -17, -26, -37]], [[0, 10, 17, 26, 37, 0]], [[1, -2, 3, -4, -6, 7, -9, 8, 9, -10]], [[7, -10, -17, -26, -37, -37]], [[9, -7, 3, 2, 8, -4, -10, 5, -6, 5, -1, 8]], [[1, -2, 3, 5, -6, 7, -8, 9, -10, -8]], [[1, -2, 3, -7, -4, -6, 7, -8, -1186740000, 9, -10, -3]], [[-2, -5, -10, -17, -27, -37]], [[-300, 21000, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000]], [[9, -7, 3, 2, 8, -4, -10, 6, 5, -1, 2, 3]], [[-300, 21000, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, 725760000, 7, -630000, -1186740000]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -10, 0, 0, 0, 1]], [[-2, -6, -10, -7, -26, -37]], [[-5, -10, -17, -27, -18, -7]], [[-300, 21000, 9450000, -78840000, -300, -1186740000, -1663750000, 725760000, -78840000, -300]], [[-2, -6, -10, -17, -26, -36]], [[-2, 3, -3, 5, -6, 7, -8, 9, -10, 3]], [[9, -6, 3, 2, 8, -4, -10, 6, 5, -1, 395580000, 3]], [[-2, -6, -10, -7, -26, -38]], [[-2, -6, -10, 9, -26, -10]], [[2, 5, 17, 26, 37, 5]], [[-300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000]], [[-300, 21000, -630001, -78840000, 395580000, -1186740000, -36, 1935360000, -1663750000, -630001, 725760000, -630000]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, -5]], [[-2, -6, -10, -7, 4, -38]], [[1, 3, 5, -6, 7, -8, 9, -10, -8, -8]], [[-6, -10, -7, 4, -38, 4]], [[0, 10, 17, 26, 9, 0]], [[-2, -6, 9450000, -10, -17, -38, -26, -37]], [[1, -2, 3, 5, -6, 7, -8, -37, -10, -8]], [[-300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000, -1663750000, -78840000]], [[-1663750000, 10, 17, 26, 9, -1]], [[0, 0, 0, -1663750000, 0, 0, 0, 0, 0, 0, -10, -1663750000]], [[0, -1186740000, 0, 0, 0, 0, 0, -3, 0, 0, -10, -3]], [[1, -2, 3, 5, -6, 7, -8, 9, -10, 8]], [[-2, 3, -6, -3, 5, -6, -630001, -8, 9, -10, 3, -10]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000]], [[9, -6, 3, 2, 8, -4, -10, 8, 6, 5, 9, -1, 395580000, 3]], [[-9, 1, -2, 3, -4, -6, 7, -9, 9, -10, 3, -2]], [[2, 5, 10, 4, 26, 37]], [[1, -26, 3, -4, -6, 7, -9, 9, -10, 3]], [[0, 10, 17, 26, 0, 26]], [[-1663750000, 10, 10, 26, 9, -1]], [[1, -36, 0, 1]], [[0, 17, 0, 26]], [[0, 0, 0, 0, 0, 0, -10, 0, 0, -10]], [[0, 2, 0, 3, 1, 0, 1, 5]], [[9, -7, 3, 8, -4, -10, -6, 5, -1, 8]], [[-9, 1, -2, 3, -4, -6, 7, -9, 9, 3, -3, -6]], [[1, -2, 3, 5, -6, 7, 5, -8, 9, -10]], [[0, 0, 0, -1663750000, 0, 0, 0, 0, 0, 1, 0, -10, -1663750000, 0]], [[9, -7, 3, 8, -4, -10, -6, -7, 5, -1, 8, -4]], [[0, 10, 26, 37, 0, 26]], [[10, 17, 26, -6, 37, 0]], [[0, 0, 0, 0, -26, 1]], [[9, -7, 3, 2, 8, -3, -4, -10, 6, 5, -8, 2]], [[-300, 21000, 4, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, 725760000, 7, -630000]], [[-2, -6, -10, -7, -26, -630001]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9449999, -630000]], [[-1, 10, 17, 26, 9, 0]], [[1, 1935360000, 3, -7, -4, -6, 7, -8, -1186740000, 9, -10, -3]], [[1, -2, 3, -4, -6, 7, -8, 8, -10, -3]], [[-1, -6, -10, -7, -26, -38]], [[2, -36, -4, 1]], [[1, -2, 3, 5, -6, 7, 5, -8, 10, -10]], [[-300, 21000, -630000, -78840000, 395580000, -1186740000, 1935360000, 1, -1663750000, 725760000, 1, -630000]], [[-300, 21000, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, 725760000, 7, -629999, -1186740000]], [[9, -6, 395580000, 3, 2, 8, -10, 6, 5, -1, 2, 3, 9, -1]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, 1935360000, -1663750000, 725760000, 9450000]], [[-2, -6, 4, -7, 395580000, -630001]], [[-2, -6, -9, -8, -26, -630002]], [[0, -1186740000, 0, 0, 0, 0, 0, 0, -10, -3]], [[-8, 4, -6, 3, 2, 8, -4, 725760000, -10, 6, 5, -1, 2, 3]], [[9, -6, 395580000, 3, 2, 8, -10, 6, 5, 395580000, 2, 3, 9, -1]], [[9, -7, 3, 2, 8, -3, -4, -10, 5, -8, 2, 9]], [[1, 3, 5, -6, -8, 9, -10, -8, -8, -6]], [[-3, -2, 3, 3, -6, -3, 5, -6, 37, -630001, -38, -8, 9, -10, 3, -10]], [[-300, 21000, -630001, -78840000, -36, -1186740000, -36, 1935360000, -1663750000, -630001, 725760000, -630000]], [[1, -630002, 1935360000, 3, -7, -4, -6, 7, -4, -8, -1663750000, -1186740000, 9, -10, -3, 9]], [[1, -630002, 1935360000, 3, -7, -630002, -4, -6, 7, -4, -8, -1663750000, -1186740000, 9, -10, 8, -3, 9]], [[9, -7, 3, 2, 8, -4, -10, 6, 5, 5]], [[1, 3, -4, -6, 7, -8, 8, -10, -3, -8]], [[-9, 3, 5, -6, -8, 9, -10, -8, -8, -6]], [[-1, 2, 0, 3, 1, 0, -17, 0, 5, 3]], [[0, 9450001, 0, 0, 0, 0, -10, 0, 0, -10]], [[0, 0, 0, 0, 0, 8]], [[-1, 2, 0, 3, -36, 0, -17, 0, 5, 3]], [[-2, -6, -10, -3, -17, -37]], [[-5, -1186740000, 0, 0, 0, 0, 0, 0, -10, -3]], [[-2, -6, 9450000, -11, -10, -17, -38, -26, -37, 9450000]], [[-2, -6, -10, -7, -26, 3]], [[0, 9450001, 0, 0, 0, 0, -10, 0, 0, 1, -10, -10]], [[0, -8, 2, 0, 3, 1, 0, 1, 5, 1]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, 1935360000, -1663750000, 725760000, 9449999, -630000, 1935360000]], [[0, 2, 0, 3, 1, 1, 4, 5]], [[-2, -4, -10, -17, -26, -37]], [[1, -2, 3, 8, -6, 37, 5, -8, 10, -10]], [[-2, -17, -10, 21000, 3, -10, -26, -37]], [[2, -2, 3, -4, 8, -6, 7, -8, 9, -10, 3, 3]], [[0, 0, 0, 0, -1, 0, 0, -3, 0, 0, 0, -10, -3, -3]], [[-2, -4, -10, -17, -26, 395580000]], [[0, 10, 17, 26, 0, 27]], [[9, -7, 3, 2, 8, -4, -10, 6, 5, 6]], [[-17, -6, -10, 3, -26, -37]], [[1, -2, 3, 5, -6, 7, 5, -8, 8, -10]], [[-1, -1186740000, 0, 0, 0, 0, 0, -3, 4, 0, -10, -3]], [[0, -17, 17, 26, 9, 0]], [[0, 5, 10, 18, 26, 37]], [[0, 2, 0, 5, 1, -1663750000, 0, 5]], [[-300, 21000, -630001, 9450000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -1186740000]], [[0, 0, 0, 0, -630000, 1]], [[0, 0, 0, 0, -630000, 1, 0, 1]], [[-300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, 725760000, -630000, -1663750000, -78840000, -1663750000]], [[-300, 21000, -630002, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000]], [[1, -2, 3, 5, -6, -78840000, 27, 10, 5, -8, 10, -10]], [[0, 0, 0, 0, 0, -27]], [[9450000, -17, -6, -10, 3, -26, -37, 9450000]], [[-28, -2, -5, -10, -17, -27, -17, -37]], [[1, -2, 3, -7, -4, -6, 7, -8, 9, -10, -3, 3]], [[-300, 21000, -630000, 9450000, -78840000, 6, 395580000, 1935360000, -1663750000, 725760000, 9450000, 395580000]], [[0, 11, 26, 0]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, -1186740000, -1663750000, 725760000]], [[-1663750000, 10, 395580000, 10, 26, 9, -1, 395580000]], [[-1663750000, 10, 395580000, 9, -10, 9, -1, 395580000]], [[9, -6, 3, 2, 8, -630000, 6, 5, -1, 2, 3, 9]], [[-9, 2, -2, 3, -4, -6, 8, -9, 9, -10, 3, -2]], [[0, 0, -629999, 0, 0, 0, 0, 0, 0, -10]], [[0, 0, -7, -1, 0, 1]], [[0, 11, 17, 26, 9, 0]], [[9, -6, 395580000, 0, 3, 2, -78840000, 8, -10, 6, 5, -1, 2, 3, 9, -1]], [[11, 9450001, 0, 0, 0, 0, -10, 0, 0, 1, -10, -10]], [[9450000, -2, 3, -4, -6, 7, -8, 8, -10, -3]], [[0, 2, 0, 1, -1663750000, 0, 5, 5]], [[1, -2, 3, -4, -6, 7, -3, -2, -10, 3]], [[0, 2, 0, 10, 1, 4, 0, 5]], [[0, -3, 0, 2]], [[-2, -6, 4, -7, 395580000, -630000]], [[0, -17, 0, 0, 0, 0, -10, 0, 0, -10]], [[-300, 20999, -630000, 9450001, -78840000, 395580000, 1935360000, -629999, -1663750000, -301, 725760000, 9449999, -630000, 1935360000]], [[-2, -6, -7, 4, -38, -7]], [[-3, -2, 3, 3, -6, -3, 5, -6, 37, 3, -630001, -38, -8, 9, -10, 3, -10, 9]], [[-1663750000, 10, 10, 26, 9, -1, -1, 26]], [[9, -5, 3, 2, 8, -4, -10, 8, 6, 5, 9, -1, 395580000, 3]], [[-630000, -2, -10, 9, -26, -10]], [[-300, 21000, -78840000, -36, 1935360000, -1663750000, -630001, 9450000, 725760000, -630000]], [[-2, -5, -9, -37, -17, -26, -37, -17]], [[-1, -1186740000, 0, 0, 0, 0, -3, 4, 0, -1, -10, -3, 0, 0]], [[1, -2, 3, 4, -4, -6, 7, -3, -2, -10, 3, 4]], [[1, -630002, 1935360000, -7, -4, -6, 7, -4, -8, 26, 9, -10, -3, 9]], [[-300, 21000, -1, 9450000, -78840000, -300, -1186740000, -1663750000, 725760000, -78840000]], [[8, -1663750000, 10, 10, 26, -1, -1, 26]], [[-300, 21000, 4, -630001, 9450000, 1935360000, 395580000, -1186740000, 1935360000, 725760000, 7, -630000]], [[1, -630002, 1935360000, 3, -7, -4, -6, 7, -7, -4, -8, -1663750000, -1186740000, -7, 9, -10, -3, 9]], [[-2, 3, 4, -4, -6, 7, -3, -2, -10, -300, 3, 4]], [[-78840000, -300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000, -1663750000]], [[1, -2, 3, 4, -4, -6, 9449999, -3, -2, -10, 3, 4]], [[0, 0, 0, 0, -1, 0, 1, 1]], [[9, -6, 3, 2, 8, -10, 395580000, 5, -1, 2, 3, 9]], [[-300, 21000, -630000, 9450000, 395580000, -1186740000, -1186740000, -1663750000, 725760000, 21000]], [[1, -2, 3, 5, -6, 7, 5, -1663750000, 9, -10]], [[-2, -6, -8, -7, 4, -38]], [[0, 0, 0, -26]], [[-2, -6, -9, -8, -26, -300]], [[0, 0, 0, 0, -629999, -1]], [[1, -2, -1663750001, 4, -4, -6, 7, -3, -2, -10, 3, 4]], [[-1, -37, 10, 17, 26, 37]], [[-300, 21000, -630000, 9450000, 395580001, -1186740000, -1186740000, -1663750000, 725760000, 21000]], [[-4, -10, -26, -37, -37, -37]], [[0, 2, 0, 5, 1, 4, 0, 4]], [[-2, -6, -10, -17, -26, -630001, -36, -17]], [[0, -7, -1, 0, 1, -7]], [[1, -2, 3, 5, -5, 7, -8, -37, -10, -8]], [[7, -38, -10, -17, -26, -37]], [[-9, 1, -2, 3, -4, -6, 7, 9, 9, -10, 4, -2]], [[-9, 2, -2, 3, -4, 8, -2, 9, -10, -2]], [[-300, -300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000, 1935360000]], [[2, -36, 0, 1]], [[7, -38, -10, -18, -26, -37]], [[-2, -6, 395580001, -7, -26, -630001]], [[-300, 21000, 11, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000]], [[0, -3, -2, 1]], [[0, 0, -629999, -1]], [[0, -17, 0, 0, 0, -8, 0, -10, -7, -10]], [[-1, -8, 0, 3, 1, 0, -17, 0, 5, 3]], [[-300, 21000, -630000, 9450001, 725760000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -629999, -630000, -630000]], [[-2, -17, -10, -26, -37, -10]], [[-2, -5, -9, -18, -17, -26, -37, -17]], [[0, 2, 0, 18, 0, 3, 4, 0, 5, 5]], [[7, -28, -38, -10, -17, -37, 7, -10]], [[9, -7, 3, 2, 8, -4, -10, 6, -1, -7]], [[-300, -2, -5, -10, -17, -27, -17, -37]], [[10, 3, 9450001, 5, -6, -8, 9, -10, -8, -6]], [[1, -2, 3, -2, -4, -6, 7, -8, 9, -10, -3, 1]], [[0, 2, -1, 3, 1, 0, 1, 5]], [[9, -6, 395580000, 0, -78840000, 3, 2, 7, -78840000, 8, -10, 6, 5, -1, 2, 3, 9, -1, -10, 2]], [[0, -8, 2, 0, 3, 1, 0, 0, 5, 1]], [[0, -1186740000, 0, 0, 0, 0, -10, 4]], [[1, -629999, -630002, 1935360000, 37, -7, -4, -6, 7, -4, -8, 26, 9, -10, 17, 9]], [[9, -6, 395580000, 0, 3, 2, -78840000, 8, -10, 5, -1, 2, 3, 9, -1, 3]], [[-1, -37, 10, 26, 37, 26]], [[-300, 21000, -630001, 9450000, -78840000, -8, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000]], [[-2, -10, -11, -7, -26, -630001]], [[0, -4, 0, -26]], [[-300, 21000, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, -5, 725760000, 9450000, -630000, -1663750000]], [[0, -4, 0, 0, 0, 0, -10, 4]], [[-26, -630000, 1, -36, 0, -36]], [[-2, 3, -3, 5, -6, -8, 9, -10, -1663750001, 3]], [[0, 0, 0, 0, -1, 0, 0, -3, 0, -629999, 0, -10, -3, -3]], [[1, -26, 3, -4, -6, 8, -9, 9, -10, 3]], [[0, 1, -630002, 1935360000, 3, -7, -4, -6, 7, -7, -4, -8, -1663750000, -1186740000, -7, 9, -10, -3, 9, 0]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -78840000, -630000]], [[0, 1, 0, 0, -26, 0]], [[-2, 3, 4, -4, -6, 7, -3, -2, -10, -300, 3, 4, -6, -6]], [[0, 3, 0, 3, 1, 1, 4, 5]], [[-9, 2, -2, 3, -4, -6, 8, -9, 9, -10, 3, -2, -6, 2]], [[-300, 21000, -630001, 9450000, 395580000, -1186740000, 1935360000, 725760000, 7, -630000]], [[9, -7, 3, -1, 10, 8, -1186740000, -10, 6, 5, -26, 6]], [[-2, -17, -5, -10, 3, 10, -26, -37]], [[-2, -6, -9, -8, -25, -630002]], [[-9, 1, -2, 20999, 3, -4, -6, 7, -300, -9, 9, -10, 3, -2]], [[2, -1, 0, 3, -36, 0, -17, 0, 5, 3]], [[10, 17, 26, -6, 0, 26]], [[1, -2, 4, 4, -4, -6, 9449999, -3, -2, -10, 3, 4, 4, -4]], [[9, 2, 8, -10, 395580000, 5, -1, 2, 3, 9]], [[0, -26, 3, -4, -6, 8, -9, 9, -10, -36]], [[-2, -10, -11, -7, 37, -630001]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -301, 1935360000, -1663750000, 725760000, 9449999, -1, -630000, 1935360000]], [[-9, 1, -2, 3, -4, -6, 7, -9, 10, -10, 3, -2, -2, -2]], [[395580000, 5, 10, 4, 26, 37]], [[-2, 3, -5, -10, 3, 10, -26, -37]], [[0, 0, 0, 0, -630000, 7, 0, 1]], [[0, 20999, 2, 0, 3, 1, 0, 1, 5, 1]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, 1935360000, -629999, 725760000, 9449999, -630000, 1935360000]], [[-300, 21000, -630000, 9450000, 395580001, -1186740000, -1186740000, 725760000, 21000, -1186740000]], [[1, 11, 26, 5, 395580000, 0]], [[1, -26, 3, -3, -6, 8, -9, 9, -10, 3]], [[-300, 1935360000, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -78840000, -630000, -630000]], [[-1186740000, 9, -7, 2, 8, -4, -10, 7, 5, 6, -4, 9]], [[-1663750000, 10, 10, -1663750001, 26, -1663750001, -1, -1663750001, -1, 26]], [[9, -9, 3, 2, 8, -3, -4, -10, 6, 5, -8, -1]], [[-300, 37, 21000, -630000, 9450000, 20999, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -78840000, -630000, -630000, 9450000]], [[-28, -2, -1186740000, -10, -17, -27, -17, -37]], [[-2, 9450000, -300, -17, -38, -26, -37, -2]], [[9, -7, 3, -28, 2, 8, -4, -10, 6, -1, -7, 8]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -1186740000, 1935360001, -1663750000, 725760000, 9450000, -630000]], [[1935360000, -3, 0, 1]], [[-300, 21000, -630001, -78840000, -36, -1186740000, -36, 1935360000, -1663750000, -630001, 725760000, -630000, -36, -630001]], [[-300, 21000, -630001, 9450000, 395580000, -1186740000, 1935360001, 725760000, 7, -630000]], [[-4, -10, -26, -37, -37, -4]], [[-300, 21000, 0, -630001, -1663749999, -78840000, 395580000, -1186740000, 1935360000, 725760000, -630000, -78840000, -6, -1663750000]], [[10, 3, 9450001, 5, -6, -8, 8, 9, -10, -8, -6, -6]], [[0, 2, 0, 3, 1, 0, 1, -10]], [[-8, 4, -6, 3, 2, 8, -4, 725760000, -10, 6, 5, -1, 2, 17]], [[10, 3, 9450001, 5, -6, 3, 9, -10, -8, -6]], [[9, -6, 3, 2, 8, -4, -10, 6, -1, 2]], [[-300, -36, -78840000, -36, 1935360000, -1663750000, -630001, 9450000, 725760000, -630000]], [[-1, -6, -10, -6, -26, -38]], [[2, 5, 9450000, 17, 26, 5]], [[1, -629999, -630002, 1935360000, 37, -7, -4, -5, -6, 7, -4, -8, 26, 37, -10, 17, 9, 17]], [[9, -7, 3, 8, -4, -10, -6, -7, 5, -1, 1935360000, -4]], [[-300, 21000, -630000, 9450000, -78840000, -300, -1663750000, 725760000, -78840000, -630000]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, 1935360000, -1663750000, 725760000, 9450000, -300, 1935360000]], [[9, -9, 3, 2, 8, -3, -10, 6, 8, 5, -8, -1]], [[1, -2, -4, -6, 7, -9, 9, -10, 3, 1]], [[-6, 5, 10, 18, 26, 37]], [[1, -2, 3, 10, -6, -78840000, 27, 10, 5, -8, 10, -10]], [[-2, -6, 9450000, -11, -17, -38, 17, -26, -37, 9450000]], [[-300, 21000, 9450000, -78840000, -300, -1186740000, -1663750000, 725760000, 3, -300]], [[0, 0, 0, -1663750000, 0, 0, 0, 0, 0, -10, -1663750000, 0]], [[-1, -7, -10, -6, 9450001, -38]], [[-630002, -2, -6, -7, 4, -38]], [[1, -2, 4, 5, -6, 7, 5, -8, 8, -10]], [[0, 2, 0, 3, -630000, 0, 1, 5]], [[1, -26, 3, -3, -6, 8, -9, 9, -10, -26]], [[1, -36, -4, 1]], [[1, -26, 3, -3, -6, -9, 9, -25]], [[-300, 21000, -630000, 9450000, -78840000, -300, 725760000, -78840000, -630000, -1663750000]], [[-2, -6, -7, -7, -26, -38]], [[1, -2, 3, -2, -4, -6, 7, -8, 9, -10, -3, -5]], [[-11, -27, -2, -6, -10, -7, -26, -37]], [[0, 5, 10, 395580001, 26, 10]], [[-2, -10, -17, -26, -37, -2]], [[-26, -630000, -36, -36, 0, -36]], [[-8, 4, -6, 3, 2, 8, -4, 4, 725760000, -10, 6, 5, -1, 2, 3, 6]], [[2, 5, 17, -36, 26, 37, 4, -36]], [[1, -2, 3, -2, -6, 7, -8, 9, -10, -3, -5, 9]], [[-300, 21000, 11, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 9450000, -630000]], [[-300, 21000, -630001, 9450000, -78840000, 395580000, -1186740000, 1935360000, 725760000, 7, -1186740000, 725760000]], [[1, -2, 3, 5, -6, 5, -1663750000, 3, 9, -10]], [[-3, -2, 3, 3, -6, -3, 5, -6, 37, 3, -630001, -38, 9, -10, 3, -10, 9, 3]], [[-3, -2, 3, 3, -6, -3, 5, -6, 37, 3, -630001, -38, 9, -10, 3, -1186740000, 9, 3]], [[2, -36, -4, 0, 1, 0]], [[3, -2, 3, -4, 8, -6, 7, -8, 9, -10, 3, 3]], [[-300, 21000, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, -630000, 1935360000, 725760000]], [[-2, -6, 9450000, -10, -17, -38, -26, -37, -37, -37]], [[-300, 21000, -78840000, -36, -28, -1663750000, -630001, 9450000, 725760000, -630000]], [[-300, 21000, -630000, 9450000, 395580001, -1186740000, -1663750000, 21000]], [[1, -2, 3, -4, -6, 6, -9, 9, -10, 3]], [[6, 1, -26, 3, -4, -6, 7, -9, 9, 0, -10, 3]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630001]], [[-2, -8, -3, 5, -6, 7, -8, 9, -10, 3]], [[-300, 21000, -25, -630000, -78840000, 395580000, 1935360000, -1663750000, 1935360000, 725760000, 9449999, -1, -630000, 1935360000]], [[-1, 10, 17, 26, 17, 9, 0, 17]], [[-1, -37, 10, 26, -36, 26]], [[0, 20999, 2, 0, 3, 1, 0, 1, 5, 8, 1, 5]], [[9, -6, 3, 2, 8, -10, 6, 5, 0, 2, 3, 9]], [[-301, -6, 9450000, -10, -17, -38, -26, -37]], [[-300, 20999, -630000, 9450001, 725760000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -630000, 725760000]], [[0, 2, 0, 3, 1, 4, 5, 1]], [[-2, -7, 395580001, -7, -26, -630001]], [[-1, -8, 0, 3, 1, 0, -17, 0, 5, 21000]], [[0, 0, 0, 0, 0, 0, 0, 0, -1, 0, -10, 0]], [[0, 2, 0, 3, 1, 0, 0, 0, 5, 0]], [[-9, 1, -2, 3, -4, -6, 7, -9, 9, 3, 6, -6]], [[0, 0, 0, 0, 0, 0, 0, 1, 0, -10, -1663750000, 0]], [[3, -2, 3, -4, 8, -630000, 7, -8, 9, -10, 3, 3]], [[1, -2, 3, -4, -6, 7, -8, 9, -26, 3]], [[9, -7, 3, 725760000, -28, 2, 8, -6, -4, -10, 6, -1, -7, 8]], [[0, -1663750001, 0, 3, 1, 4, 0, 5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -10, 0, 0, 0, 1, 0, 0]], [[1, -630002, 1935360000, 3, -7, -4, -6, 7, -1, -4, -8, -1663750000, -1186740000, 9, -10, -3, 9, -6]], [[-2, 3, -2, -4, -6, 7, -8, 9, -10, -3, 1, -8]], [[-300, 21000, -630000, 9450001, -38, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9449999, -630000, 1935360000]], [[-300, 21000, -630000, -78840000, 395580000, -1186740000, -1186740000, -1663750000, 725760000, -1186740000]], [[-3, -2, 3, 1935360001, 9449999, -3, 5, -6, 37, 3, -630001, -630000, -8, 9, -10, 3, -10, 9]], [[-300, -78840001, 21000, -630001, -78840000, -36, -1186740000, -36, 1935360000, -1663750000, -630001, -630000]], [[-300, 21000, -630000, 7, 9450000, -78840000, -18, 395580000, 1935360000, -1663750000, 725760000, 9450000, -300, 1935360000]], [[-1, 10, 17, 26, 17, 9, 0, 18]], [[-5, -10, -27, -18, -7, -10]], [[-300, 37, 21000, -630000, 9449999, 20999, -17, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -78840000, -630000, -630000, 9450000]], [[0, 1, 0, -26]], [[2, 5, 10, 37]], [[7, -17, -10, -18, -26, 7]], [[-4, -10, -26, -37, 26, -4]], [[0, 1935360001, 0, 3, 1, 0, 1, 5]], [[-1186740000, 9, -7, 2, 8, -4, 395580001, 7, 5, 6, -4, 9]], [[9, -7, 3, 3, 8, -4, -10, 6, 5, -1]], [[-27, 21000, -630000, -78840000, 395580000, -1186740000, 1935360000, 1, -1663750000, 725760000, 1, -630000]], [[9, -6, 3, 2, 8, -78840001, 6, 5, -1, 2, 3, 9]], [[9, -6, 3, 2, 8, -9, -4, -10, 6, 5, -1, 3]], [[-2, 3, -3, 5, -5, 7, -8, 9, -10, 3]], [[-17, -301, -10, 3, -26, -37]], [[1, -2, 3, -6, 6, -9, 9, -10]], [[-300, 21000, -630001, 9450000, 395580000, -1186740000, -1663750000, 725760000, 9450000, -630000, -1186740000, -1186740000]], [[1, -2, 3, 5, -5, 5, -1663750000, 3, 9, -10]], [[-300, 21000, -78840000, -36, 1935360000, -1663750000, -630001, 9450000, 725760000, -630000, 21000, -630000]], [[1, -26, 3, -3, -6, 8, -9, 9, -10, -26, -3, -26]], [[-2, 3, -2, -4, -6, 7, -8, 9, -10, -3, 1, -8, -6, -6]], [[725759999, -300, 21000, -630001, 9450000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -1186740000]], [[1, -630002, 1935360000, 3, -7, -630002, -4, -6, 7, -4, -8, -1663750000, -1186740000, 9, -18, 8, -3, 9]], [[-300, 21000, 0, -630001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, -7, 725760000, -630000, 1935360000, 725760000]], [[-300, -78840001, 21000, -630001, -78840000, -36, -1186740000, -36, 1935360000, -1663750000, -630001, -630000, -300, 1935360000]], [[9, -7, 3, 2, 8, -4, -10, -10, 6, -1, -7, 9]], [[-1, -10, -38, -6, -26, -38]], [[-2, 27, -6, -10, -7, -26, -38, -26]], [[1, -629999, -630002, 1935360001, 37, -7, -4, -6, 7, -4, -8, 26, 9, -10, 17, 9]], [[1, -26, 3, -9, 9, -25]], [[-2, -6, -10, -7, -630001, -2]], [[0, 17, 0, 7]], [[1, -27, 3, -4, -6, 8, -9, 9, -10, 3]], [[-8, -6, 3, 2, 8, -4, 725760000, -10, 5, -1, 5, 3]], [[2, -36, 2, -4, 1, 0]], [[7, -38, -10, -17, -26, 4, -37, -17]], [[1, -11, -2, 3, 5, -6, 7, 5, -1663750000, 9, -10, -11]], [[1, -2, 3, 5, 18, 7, -8, -37, -10, -8]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -10, 0, 0, 0, 0, 1, 0]], [[-9, 3, 5, -6, -8, 9, -10, -8, -8, 3]], [[-1, 5, -1663750001, 18, 17, 26, 37, 26]], [[9, 4, -6, 3, 2, 8, -4, 725760000, -9, 6, 5, -1, 2, 3]], [[-300, 21000, -299, -630001, -78840000, -1186740000, 1935360000, -1663750000, 725760000, -630000, -1663750000, -78840000]], [[-1, 5, 10, 21000, 17, 37]], [[0, 26, 0, 3, -9, 0, 5, -9]], [[-300, 21000, -630000, 9450001, -78840000, 395580000, -1186740000, 1935360000, -1663750000, 725760000, 9450000, -630000, -1186740000, 725760000]], [[9, -6, 3, 2, 8, -4, -10, -25, 6, 5, 9, -1, 395580000, 3]], [[-630001, -2, 3, 5, -6, 7, 5, -8, 8, -10]], [[-1, -37, 17, 26, 37, 10]], [[0, 0, 0, 0, -630000, 1, 0, 1, 0, -630000]], [[-1, 10, 17, -1663749999, 9, 0]], [[-300, 21000, -630000, 9450000, -78840000, 395580000, -1186740000, -1186740000, -1663750000, -1663750001, 725760000, 21000]], [[-2, -6, -10, 9, -26, -10, -10, -10]], [[-300, 21000, 27, -78840000, 395580000, -1186740000, 1935360000, 1, -1663750000, 725760000, 1, -630000]], [[-16, -17, -301, -10, 3, -26, -37, 3]], [[-17, -10, 21000, 3, -10, -26, -37, -10]], [[1, -2, 3, -3, -6, 7, -8, -2, -10, 3]], [[-630001, -2, 3, 5, -6, 8, 5, -8, 8, -10]], [[7, -28, -38, -27, -17, -37, 7, -10]]], "completion": "\ndef find_zero(xs: list):\n \"\"\"\n xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"\n assert len(xs) % 2 == 0, \"The list xs must have an even number of coefficients.\"\n n = len(xs) - 1\n assert xs[n] != 0, \"The largest non-zero coefficient must be non-zero.\"\n if n == 0:\n return None\n elif n == 1:\n return -xs[0] / xs[1]\n elif n == 2:\n a, b, c = xs\n delta = b**2 - 4*a*c\n if delta < 0:\n return None\n elif delta == 0:\n return -b / (2*a)\n else:\n x1 = (-b + math.sqrt(delta)) / (2*a)\n x2 = (-b - math.sqrt(delta)) / (2*a)\n return x1 if x1 < x2 else x2\n else:\n f = lambda x: poly(xs, x)\n a, b = -1, 1\n fa, fb = f(a), f(b)\n if fa * fb > 0:\n return None\n else:\n while b - a > 1e-9:\n c = (a + b) / 2\n fc = f(c)\n if fc == 0:\n return c\n elif fc * fa < 0:\n b, fb = c, fc\n else:\n a, fa = c, fc\n return (a + b) / 2\n", "raw_completion": "```python\ndef find_zero(xs: list):\n \"\"\"\n xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"\n assert len(xs) % 2 == 0, \"The list xs must have an even number of coefficients.\"\n n = len(xs) - 1\n assert xs[n] != 0, \"The largest non-zero coefficient must be non-zero.\"\n if n == 0:\n return None\n elif n == 1:\n return -xs[0] / xs[1]\n elif n == 2:\n a, b, c = xs\n delta = b**2 - 4*a*c\n if delta < 0:\n return None\n elif delta == 0:\n return -b / (2*a)\n else:\n x1 = (-b + math.sqrt(delta)) / (2*a)\n x2 = (-b - math.sqrt(delta)) / (2*a)\n return x1 if x1 < x2 else x2\n else:\n f = lambda x: poly(xs, x)\n a, b = -1, 1\n fa, fb = f(a), f(b)\n if fa * fb > 0:\n return None\n else:\n while b - a > 1e-9:\n c = (a + b) / 2\n fc = f(c)\n if fc == 0:\n return c\n elif fc * fa < 0:\n b, fb = c, fc\n else:\n a, fa = c, fc\n return (a + b) / 2\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\nimport math\n\n\ndef poly(xs: list, x: float):\n \"\"\"\n Evaluates polynomial with coefficients xs at point x.\n return xs[0] + xs[1] * x + xs[1] * x^2 + .... xs[n] * x^n\n \"\"\"\n return sum([coeff * math.pow(x, i) for i, coeff in enumerate(xs)])\n\n\ndef find_zero(xs: list):\n \"\"\" xs are coefficients of a polynomial.\n find_zero find x such that poly(x) = 0.\n find_zero returns only only zero point, even if there are many.\n Moreover, find_zero only takes list xs having even number of coefficients\n and largest non zero coefficient as it guarantees\n a solution.\n >>> round(find_zero([1, 2]), 2) # f(x) = 1 + 2x\n -0.5\n >>> round(find_zero([-6, 11, -6, 1]), 2) # (x - 1) * (x - 2) * (x - 3) = -6 + 11x - 6x^2 + x^3\n 1.0\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/33", "prompt": "\n\ndef sort_third(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal\n to the values of the corresponding indicies of l, but sorted.\n >>> sort_third([1, 2, 3])\n [1, 2, 3]\n >>> sort_third([5, 6, 3, 4, 8, 9, 2])\n [2, 6, 3, 4, 8, 9, 5]\n \"\"\"\n", "entry_point": "sort_third", "canonical_solution": "\n third = [l[i] for i in range(len(l)) if i % 3 == 0]\n third.sort()\n return [third[i // 3] if i % 3 == 0 else l[i] for i in range(len(l))]\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert tuple(candidate([1, 2, 3])) == tuple(sort_third([1, 2, 3]))\n assert tuple(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])) == tuple(sort_third([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]))\n assert tuple(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10])) == tuple(sort_third([5, 8, -12, 4, 23, 2, 3, 11, 12, -10]))\n assert tuple(candidate([5, 6, 3, 4, 8, 9, 2])) == tuple([2, 6, 3, 4, 8, 9, 5])\n assert tuple(candidate([5, 8, 3, 4, 6, 9, 2])) == tuple([2, 8, 3, 4, 6, 9, 5])\n assert tuple(candidate([5, 6, 9, 4, 8, 3, 2])) == tuple([2, 6, 9, 4, 8, 3, 5])\n assert tuple(candidate([5, 6, 3, 4, 8, 9, 2, 1])) == tuple([2, 6, 3, 4, 8, 9, 5, 1])\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 3]], [[1, 2, 3]], [[5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]], [[5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]], [[5, 8, -12, 4, 23, 2, 3, 11, 12, -10]], [[5, 8, -12, 4, 23, 2, 3, 11, 12, -10]], [[5, 6, 3, 4, 8, 9, 2]], [[5, 8, 3, 4, 6, 9, 2]], [[5, 6, 9, 4, 8, 3, 2]], [[5, 6, 3, 4, 8, 9, 2, 1]]], "atol": 0, "plus_input": [[[9, 12, 15, 6, 3, 8, 10, 23, 7]], [[2, 1, 3, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]], [[9, 12, 15, 6, 3, 8, 13, 18, 7]], [[2, 10, 20, 15, 18, 13, 7]], [[5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60]], [[3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36]], [[11, 22, 33, 44, 55, 66, 77, 88, 99]], [[]], [[1]], [[2, 3, 7, 8, 9, 10, 9]], [[1, 1]], [[11, 22, 33, 44, 55, 66, 77, 88, 32, 99, 77]], [[11, 22, 33, 44, 55, 66, 77, 88, 88, 32, 99, 77, 77, 11]], [[54, 3, 7, 8, 9, 10, 9]], [[27, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 3]], [[3, 6, 9, 12, 15, 24, 27, 30, 33, 36]], [[11, 22, 33, 44, 55, 66, 77, 88, 32, 77]], [[2, 35, 1, 3, 7, 8, 9, 10]], [[46, 32, 77, 22, 18, 57, 88, 66, 54]], [[27, 1, 1, 27, 1]], [[54, 3, 7, 8, 9, 10]], [[2, 35, 1, 3, 7, 9, 10]], [[47, 32, 77, 22, 18, 57, 88, 66, 54]], [[9, 12, 15, 6, 3, 8, 13, 18]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 3, 15]], [[54, 3, 7, 8, 9, 35, 10, 9]], [[9, 12, 15, 6, 3, 8, 10, 23, 7, 23]], [[9, 12, 15, 6, 3, 8, 13, 18, 15]], [[1, 2, 3, 4, 5, 6, 7, 45, 9, 11, 12, 14, 15, 3, 13]], [[3, 6, 9, 12, 15, 25, 27, 30, 33, 36]], [[27, 1, 1, 1, 1, 27, 1]], [[27, 55, 1]], [[32, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 88, 11, 12, 13, 14, 15]], [[9, 12, 25, 27, 30, 33]], [[1, 2, 3, 4, 5, 6, 7, 45, 9, 12, 14, 15, 3, 13]], [[2, 4, 20, 15, 18, 13, 7]], [[1, 2, 3, 4, 5, 6, 7, 45, 9, 12, 14, 15, 21, 3, 13]], [[9, 12, 27, 30, 33]], [[3, 6, 9, 12, 15, 25, 27, 30, 33, 18, 36]], [[8, 55, 1, 1]], [[2, 27, 55, 1]], [[3, 6, 9, 12, 15, 24, 27, 30, 34, 36]], [[5, 10, 15, 20, 25, 35, 40, 47, 45, 50, 55, 60]], [[28, 1, 1, 27, 1]], [[3, 1, 2, 3, 4, 5, 6, 7, 45, 9, 12, 14, 15, 21, 3, 13]], [[0]], [[2, 1, 7, 8, 9, 10]], [[3, 1, 2, 3, 4, 5, 6, 7, 45, 10, 12, 14, 15, 21, 3, 13]], [[2, 1]], [[11, 22, 33, 44, 55, 66, 77, 88, 32, 77, 55]], [[3, 6, 20, 9, 12, 15, 25, 27, 30, 33, 18, 60, 36]], [[3, 18, 6, 9, 12, 15, 24, 27, 30, 27, 36]], [[27, 55, 0]], [[5, 10, 15, 20, 25, 30, 35, 40, 50, 55, 60]], [[46, 32, 77, 22, 18, 57, 77, 88, 66, 54]], [[1, 2, 3, 4, 5, 6, 7, 45, 9, 12, 14, 21, 3, 13]], [[46, 32, 77, 22, 18, 57, 57, 88, 66, 54]], [[46, 40, 32, 77, 22, 18, 77, 57, 88, 66, 54, 54, 66]], [[46, 32, 77, 22, 57, 23, 66, 54]], [[22, 33, 44, 55, 66, 77, 88, 99]], [[11, 22, 33, 44, 55, 66, 77, 88, 88, 32, 99, 77, 77, 11, 77, 66]], [[5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 40, 55, 60]], [[47, 28, 1, 1, 27, 1]], [[11, 22, 33, 44, 55, 77, 88, 32, 77, 55]], [[27, 1, 1, 27]], [[23, 9, 12, 15, 6, 3, 8, 54, 18]], [[9, 12, 25, 27, 30, 33, 25]], [[69, 18]], [[27, 1, 1, 1, 1, 4, 27, 1]], [[3, 26, 6, 20, 9, 12, 15, 25, 27, 30, 33, 18, 60, 36]], [[2, 2, 35, 1, 3, 7, 8, 9, 10]], [[46, 32, 77, 22, 18, 57, 77, 88, 66, 18, 54]], [[11, 22, 100, 33, 44, 55, 66, 77, 88, 88, 32, 99, 77, 77, 11]], [[5, 10, 20, 15, 20, 25, 35, 40, 47, 45, 50, 55, 60]], [[1, 2, 3, 6, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 57, 15]], [[9, 12, 15, 6, 21, 8, 13, 26, 18, 12, 13]], [[11, 22, 33, 44, 55, 77, 88, 99, 77]], [[27, 1, 1, 1, 4, 27, 1]], [[11, 33, 44, 55, 66, 77, 88, 32, 77, 11]], [[2, 3, 8, 8, 9, 10, 9]], [[9, 12, 15, 6, 21, 8, 40, 26, 18, 12, 13]], [[27, 1, 1, 1, 1, 11, 4, 27, 1]], [[33]], [[11, 23, 33, 44, 55, 77, 88, 99, 77]], [[47, 32, 77, 22, 18, 57, 26, 66, 54]], [[9, 12, 15, 6, 8, 10, 23, 7, 23, 8]], [[1, 2, 3, 4, 5, 6, 7, 45, 9, 11, 6, 12, 13, 15, 3, 13]], [[47, 32, 77, 22, 18, 47, 57, 88, 66, 54]], [[9, 12, 15, 6, 3, 9, 13, 18, 7]], [[77, 4, 20, 15, 18, 13, 7]], [[3, 1, 2, 3, 4, 5, 6, 7, 9, 12, 14, 15, 21, 3, 13, 13]], [[1, 2, 3, 4, 3, 5, 6, 7, 45, 9, 11, 6, 12, 13, 15, 3, 13, 3]], [[54, 3, 11, 7, 8, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 88, 11, 12, 13, 14, 15]], [[2, 4, 66, 15, 18, 13, 7]], [[11, 33, 44, 55, 88, 99, 77]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8]], [[1, 2, 3, -3, 5, 1, 0, -8, 9, -12, 7, 6]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 1, 13, 6, -2, 19]], [[9, 12, 3, 6, 15, 0, -3, -6, 18, 21, 30, -9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10]], [[5]], [[9, 0, 6, 3, 12]], [[19, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[9, 0, 6, 3, 12, 3]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0, 3]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 5, 1]], [[9, 12, 3, 6, 15, 0, -3, 18, 21, 30, -9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1]], [[9, 0, -1, 6, -4, 3, 12]], [[9, 0, -1, 6, -4, 3, 12, 3]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 14, 0]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, 6]], [[9, 0, 6, 500, 3, 12, 3]], [[9, 6, 500, 3, 12, 3]], [[-4, 7, 3, -6, 3, 0, -8, 2, 1, 8, 14, 0]], [[-4, 7, 3, -6, 1000, 0, -8, 6, 2, 0, 1]], [[9, 0, -1, 6, -4, -5, 3, 12]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 4, 6]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, 0, 6, -8]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 20]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, -901, 800, 1000, 0, -277]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, -8, 0]], [[-4, 7, 3, -6, 1000, 0, -8, 6, 2, 289, 1]], [[1, 2, 3, -7, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1]], [[19.13452041495991, 19.18319187411889, -92.90661646941159]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 21, 20]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277]], [[300, 500, 6, 7, 8, 289, 21, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[1, 2, 3, -3, 5, 1, 0, 4, 9, -12, 7, 6]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6, 16]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, -12]], [[1, 2, 3, 6, 1, 0, -8, 9, -12, 7, 6, 5, 1, 1]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 20]], [[-4, 7, 3, -6, 1000, 0, -8, -6, 8, 6, 2, 289, 1, 7]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16]], [[300, 500, 6, 17, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277]], [[19, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 20]], [[19, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11]], [[1, 2, 3, 5, 1, 0, -8, 9, 0, -12, 7, 6, 6, 1, -12]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 11]], [[1, 2, 3, -3, 5, 1, -8, 16, 16, -8, 14, 9, -12, 7, 6, -12]], [[9, 0, 8, -1, 6, -4, -5, 12]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -13]], [[9, 0, 6, 3, 3, 12, 2]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, 6]], [[9, 0, 3, -4, 9, -5, 3, 12, -4]], [[1, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 800, 0]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 1, 13, 6, -2, 19, 13]], [[9, 0, 3, -4, 9, -5, 1, 12, -4]], [[300, 500, 6, 7, 200, 7, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, 6]], [[9, 0, 3, -4, 9, 289, 3, 12, 900, 3]], [[19, 0, -901, 2, 3, 4, 5, 6, 16, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 20]], [[1, 2, 3, 1, 0, -8, 9, -12, 7, 6, 6, 1]], [[-4, 7, 3, 3, 0, -8, 2, 1, 8, 14, 0]], [[9, 0, 8, -1, 6, -4, -5, 12, 0]], [[900, 2, 7, 11, 9, 3, -7, 11, 8, 0, 1, 13, 6, -2, 19]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, -3, 900, 18, -901, 800, 1000, 0, -277]], [[-4, 7, 3, -6, 3, 0, -8, 5, 2, 0, 1, 8, 14, 0, 6]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, -1, 6, -8, 6]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6, -12, 7]], [[-4, 7, 3, -6, 3, 0, -8, 2, 1, 8, 14, 0, 2]], [[0, 0, 6, 3, 12]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0, 0]], [[7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 14, 1]], [[-4, 7, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0, 3]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 18, 19, 21, 20, 6]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 19, 1, 8, -200, 0, 6]], [[9, 6, 500, 3, 12, 20]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, -12, -8]], [[8, 7, 3, -6, 1000, 0, -8, 6, 2, 0, 1]], [[-4, 7, 3, -6, 3, 0, -8, 5, 2, 0, 1, 8, 14, 0]], [[-4, 7, 1, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 16, 0, 4, 6, 1]], [[1, 2, -3, 5, 1, 0, 4, 9, -12, 7, 6]], [[-4, 7, 3, -6, 0, -8, 7, 2, 1, 8, 14, 0, 6, -8]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -3, -4, -5, -6, -7, -8, -9, -10]], [[300, 500, 6, 7, 8, 289, 21, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000]], [[-4, 7, 3, 3, 0, -7, 1, 8, 14, 0]], [[-4, 7, 3, -10, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 4, 6]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6, 1, 16]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, -13]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 4, -12, 7]], [[1, 2, 3, -3, 5, 1, 0, 18, 4, 9, -12, 0, 7, 6]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, -13, 9]], [[9, -5, 0, -1, 6, -4, -5, 3, 12, 0]], [[2, -3, 5, 1, 0, 18, 4, 9, -12, 0, 7, 6]], [[-8, 9, 12, 3, 6, 15, 0, -3, -6, 18, 21, 30, -9]], [[300, 500, 6, 7, 200, 7, 289, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, 6]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, -4, 6, 1, 6]], [[9, 6, 500, 3, 11, 3]], [[5, 2, 9, 3, -7, 8, 8, 0, 1, 13, 6, -2, 19]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 1, -1, 13, 11, 6, -2, 104, 13]], [[-4, 7, 3, -6, 1000, 0, -8, 6, 290, 2, 289, 1, 1000]], [[1, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, 6]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277, -277]], [[-4, 7, 3, -6, 3, 0, -8, -7, 2, 0, 1, 8, 0, 0]], [[1, 2, 3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16]], [[1, 2, 3, -3, 2, 1, 0, -8, 9, -12, 7, 6]], [[1, 2, 3, -3, 5, 1, 16, 16, 9, -12, 7, 6, -12, 7]], [[9, 0, 3, -4, 9, 289, 3, 12, 3]], [[2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16]], [[300, 500, 6, 7, 289, 20, -105, -277, 200, 19, 3, 0, 5, 700, -3, 900, 18, -901, 800, 1000, 0, -277]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 1, 800, 0]], [[0, 0, 300, 6, 3, 12, 0]], [[1, 2, 3, 5, 1, 0, -8, 9, 0, -12, 7, 6, 6, 1, -12, 1]], [[9, 0, 8, -1, 6, -4, 12]], [[-4, 7, 3, -6, 3, 900, 0, -8, 6, 2, 0, 1, 8]], [[9, 0, 30, 8, -1, 6, -4, -5, 12]], [[9, 0, 30, 8, -1, 6, -3, -4, -5, 12]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -6]], [[9, 0, 6, 5, 500, 3, 12]], [[2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16, 7]], [[1, 2, 3, 5, 1, 16, 16, -8, 9, -12, 7, 4, 6, -12, 16]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, 0, 6, -8, 14]], [[9, 0, 3, 3, -4, 9, 289, 3, 12, 3]], [[1, 2, 3, -3, 5, 1, 16, 15, 16, 9, -12, 7, 6, -12, 7]], [[-4, 7, 3, -6, 3, 900, 0, -8, 6, 2, 0, 1, 9]], [[1, 2, 3, 5, 1, -1, -8, 9, -12, 7, -7, 0, 6, 6, 1, 16, -8]], [[1, 2, 3, -3, 5, 1, 16, 16, 9, -12, 7, 6, -2, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 105, 4, 5, 700, 900, -200, -901, 800, 1000, 6]], [[9, 0, 30, -200, 8, -1, -9, -3, -4, -5, 12]], [[900, 2, 7, 11, 9, 3, -7, 8, 0, 1, -12, 6, -2, 19, 13]], [[-4, 7, 3, -6, 3, 0, 6, 2, 0, 1, 8, 0, 0]], [[1, 2, 3, -3, 5, 1, 0, 4, 9, 0, 7, 6, 0]], [[1, 2, 3, -3, 5, 1, 16, 16, 10, -12, 7, 6, -2, 7]], [[19, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11, 16]], [[1, 1, 2, 3, 5, 1, 0, -8, 9, 0, -12, 7, 6, 6, 1, -12, 1]], [[300, 500, 6, 7, 8, 289, 21, -6, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, 8]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 4, 6, 8]], [[-4, 7, 3, -6, 1000, 0, 6, 2, 0, 1]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, -8, 0, 5, 11, 900, 18, -901, 800, 1000, 0, -277, -277, 500]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 105, 8, -8, 0]], [[-4, 7, 1, 3, -6, 3, 0, -8, 6, 2, 0, 1, 16, 8, 16, 0, 4, 1, 0]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -8]], [[-4, 7, 3, -6, 3, 0, 7, -8, -7, 2, 0, 1, 20, 0, 0]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -8, -901, 800, 1000, 0, -277]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 14]], [[-5, 1, 2, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16, 1, 5]], [[1, 2, 3, -3, 5, 1, 0, 18, 9, -12, 0, 7, 6, 3]], [[-4, 7, 9, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 4, 6]], [[9, 0, 289, -200, 8, -1, -9, -3, -4, -5, 12, 9]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 4, 9, -12, 7, 6, -12, 16]], [[19, 0, 2, 4, 3, 4, 5, 6, 7, -9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11, 16]], [[-4, 7, 9, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 4, 6, 9]], [[-4, 7, 3, -6, 3, 0, 7, -8, -7, 2, 0, 1, 20, 0, 0, 1]], [[-4, 7, 3, 105, 0, -8, 7, 2, 1, 8, 14, 0, 6, -8]], [[9, -1, 700, -1, 6, -4, 3, 11, 3, -1]], [[1, 2, 3, 11, 5, 1, 16, -8, 9, -11, 7, 4, -12, 7, 7]], [[1, 2, 3, -3, 5, 300, 4, 9, 0, 7, 6, 0]], [[-4, 1, 3, -6, 3, 0, -8, 6, 2, 0, 1, 16, 8, 16, 0, 4, 1, 0]], [[9, 0, -4, 3, 12, 3]], [[9, 12, 3, 6, 15, 0, -3, 18, 30, -9, -9]], [[9, 0, 8, -1, 6, -4, -5, 12, 0, 8]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, -1, 5, 700, 900, -901, 800, 1000, 6, 0, -277]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 105, 2, 8, -8, 0]], [[0, -1, 6, -4, 3, 12, -4]], [[2, 3, -3, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16, 7]], [[9, 0, 3, -3, -4, 0, 9, -5, 3, -4, 3]], [[1, 2, 3, -3, 5, 1, 0, 0, 9, 0, 7, 6, 0]], [[9, 0, 3, -4, -5, 1, 12, -4]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6, 16, 9]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, 6, 6, -8, 14]], [[-4, 7, 105, 3, 3, 0, 7, -8, -2, 2, 0, 1, 20, 0, 0, 1]], [[-4, 7, 9, -6, 3, 0, 6, 2, 0, 1, 8, 14, 0, 4, 6]], [[9, 0, 8, -2, -1, 6, -4, 13, 12, 0, 8]], [[9, 0, 6, 3, 3, 2]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, 6, 6, -8, 14, 0]], [[1, 2, 3, -3, 5, 300, 5, 9, 0, 7, 6, 0]], [[false, false, true, true, false]], [[1, 2, 3, -3, 5, 1, 8, 0, 4, 9, 0, 7, 6, 0]], [[-4, 3, 105, 3, 14, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6]], [[-4, 8, 3, -6, 0, -8, 6, 2, 1, 8, 14, 6, 6, -8, 14, 0]], [[30, 1, 2, 3, -3, 5, 1, 16, 16, -8, 4, 9, -12, 7, 6, -12, 16]], [[9, 13, 0, 3, -4, 9, 289, 3, 12, 900, 3]], [[-4, 7, 3, -6, -13, 3, 0, -8, 6, 2, 0, 1, 8, -8, 8]], [[16, 7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 14]], [[-4, 7, 3, -6, 1000, 0, -8, -6, 8, 6, 2, 289, 1, 7, -8]], [[1, 2, 3, 5, 1, 16, -11, 16, -8, 9, -12, 7, 6, -12, 16]], [[1, 2, -3, 5, 1, 0, 6, 4, 9, -12, 7, 6]], [[9, 0, 6, 15, 3, 9, 15]], [[9, 0, -1, 6, -4, 3, 12, -4]], [[9, 12, 3, 6, 15, 4, 0, -3, 18, 30, -9, -9]], [[1, 2, 3, -3, 5, 1, 0, 0, 9, 0, 7, 0]], [[9, 6, 500, 3, 11, 16]], [[-105, 0, 30, -200, 8, -1, -9, -3, -4, -5, 12]], [[-4, 290, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6, 1]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 4, -12, 7, 7, 4]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, 104, -13, 9]], [[-4, 7, 3, -6, 1000, 700, 6, 0, 1]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 700, 1, 13, 6, -2, 19, 19, 13, 9]], [[900, 2, 7, 11, 9, 3, -7, 8, 0, 1, -12, 6, 200, -2, 19, 13]], [[9, 0, -200, 8, -1, -9, -3, -4, -5, 12, 9]], [[-4, 7, 105, 3, 3, 0, 7, -8, -2, 2, 0, 1, 20, 0, 0, 0, 1]], [[9, 0, 3, -4, 9, -5, 1, 12, -4, 12]], [[1, 2, 3, 5, 16, -11, 16, -8, 9, -12, 7, 6, -12, 16]], [[9, 12, 0, 6, 3, 12, 3]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6, 1, 0, 0]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 19, 21, 20, 2]], [[-4, 8, 3, -6, 0, -8, 6, 2, 1, 8, 13, 6, 6, -8, 14, -6]], [[9, 0, -1, 6, -4, 3, 900, 3]], [[-4, 8, 4, -6, 0, -8, 6, 2, 1, 8, 13, 6, 6, -8, 14, -6, 8]], [[9, 6, 500, 500, 3, 12, 20, 9]], [[-4, 7, 3, -6, 0, -8, 5, 2, 1, 8, 14, 0, 6, -8, 14]], [[9, 0, 6, 700, 12, 3]], [[10, 0, 8, -1, 6, -4, -5, 12, 0]], [[1, 2, 3, 5, 1, 0, -8, 9, 200, -12, 7, 6, 6, 1, -13, 9]], [[1, 2, 3, -7, 105, 1, 0, -8, 9, -12, 7, 6, 6, 1]], [[-4, 7, -6, 1000, 0, -8, 6, 290, 2, 289, 1, 1000]], [[-4, 7, 3, -6, 3, -8, -7, 2, 0, 1, 8, 0]], [[9, 0, 8, -1, 6, -4, -5, 12, 18, 12]], [[1, 2, 3, -3, 5, 1, 0, 18, 4, 9, -12, 7, 6]], [[9, 12, 3, 6, 15, 0, -3, 30, -9, -9]], [[-4, 7, 3, -6, 3, 0, -8, 6, 1, 8, 14]], [[1, 3, -3, 5, 1, 16, -12, 7, 4, -12, 7]], [[1, 2, 3, -3, 5, 1, 0, 18, 4, 9, -12, 6]], [[9, -5, 0, -1, 6, 19, -5, 3, 12, 0]], [[-4, 6, 3, 3, 0, 6, 2, 1, 800, 0]], [[9, 3, -4, 9, -5, 1, 12, 300, -4]], [[-4, 7, 9, -6, 3, 11, -8, 6, 2, -11, 1, 8, 14, 0, 4, 6, 9, 2, 0]], [[-92.90661646941159, 19.18319187411889, 19.18319187411889]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 18, 19, 104, 20, 6]], [[-4, 7, 9, -6, 3, 11, -8, 6, 2, -11, 1, 8, 14, 0, 4, 6, 9, 2]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, -1, 5, 700, 900, -901, 800, 1000, 6, 0, -277, 500]], [[19, 0, -901, 2, 3, 4, 5, 6, 16, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 20, 4]], [[300, 500, 6, -10, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, -278, 700, 900, -901, 800, 1000, -105]], [[9, 0, 3, -4, 12, 1, 12, -4]], [[9, 6, 700, 12, 15, 0]], [[9, 0, -1, 6, 105, -5, 3, 12]], [[-92.90661646941159, 19.18319187411889]], [[300, 500, 6, 7, 8, 289, 21, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000, 300]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 1, 105, 8, -8, 0]], [[-4, 18, 7, 3, -6, 3, 0, -8, 6, 1, 8, 14, 14]], [[-4, 7, 15, 3, 0, 105, -8, 2, 1, 8, 14, 0]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 4, 5, 700, -200, 900, -200, -901, 800, 1000]], [[2, 3, 5, 1, 0, -8, 9, 200, -12, 7, 6, 6, 1, -13, 7, 9]], [[300, 500, 6, -10, 8, 289, 20, -105, -277, 104, 200, 3, 4, 11, 5, -278, 700, 900, -901, 800, 1000, -105]], [[900, 2, 7, 11, 9, 3, -7, 11, 0, 1, 13, 6, -2, 19, 1]], [[300, 500, 6, 7, 289, 21, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000]], [[-4, 7, 3, -6, 3, 0, -8, -7, 2, 0, 1, 5, 500, 0, 0, -7, 3]], [[2, 3, -3, 1, 16, 16, -8, 9, -12, 19, 7, 6, -12, 16, 7]], [[1, 2, 3, -3, 5, 1, 0, 18, 4, 5, 9, -12, 7, 6]], [[1, 2, 3, -3, 6, 300, 4, 9, 0, 7, 6, 0, -3]], [[1, 2, 3, 5, 16, -11, 16, -8, 9, -12, 7, -12, 16]], [[1, 2, 3, -3, 5, 1, 16, -8, 8, -12, 7, 6, 2, 16]], [[-4, 7, 14, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, -4, 7]], [[9, 0, 3, -4, 9, -5, 1, 12, -4, 11]], [[9, 6, 500, 3, 1000, 11, 16]], [[9, 0, 3, -4, 9, -5, 1, 17, 12, -4, 12]], [[9, 0, 3, -4, 9, 289, 3, 900, 3]], [[2, 7, 11, 9, 3, -7, 11, 0, 1, 13, 7, -2, 19, 1]], [[9, 0, 6, 700, 12, 3, 3, 700]], [[1, 3, 5, 1, 0, -8, 9, -12, 7, 6, 6, 1, 6, 1]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, 2, -12, 7, 7, 6, 1, 16]], [[-4, 7, 1, 3, -6, 3, 0, -8, 6, 2, 0, 1, 16, 7, 16, 0, 4, 1, 0]], [[1, 2, 3, -3, 13, 1, 16, 16, 9, -12, 7, 6, -2, 7]], [[9, 0, 30, 13, 8, -1, -9, -3, -4, -5, 12, -3]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6, 8]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, 289, -277]], [[300, 500, 6, 7, 289, 20, -105, -277, 200, 19, 3, 0, 5, 700, -3, 900, 18, -901, 800, 1001, 0, -277]], [[300, 500, 6, 17, 8, 289, 20, -105, 2, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277]], [[300, 500, 6, 7, 289, 20, -105, -277, 200, 19, 3, 699, 0, 5, 700, 900, 18, -901, 800, 1001, 0, -277]], [[1, 3, 5, 1, 0, -8, 9, -12, 7, -4, 6, 1, 6]], [[15.581341935092604, 19.18319187411889, -92.90661646941159]], [[1, 2, 3, 5, 1, -1, -8, 9, -12, 7, 6, 5, 1, 2]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, 289, -277, 18]], [[19, 0, -901, 2, 3, 4, 5, 6, 16, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 20, 16]], [[5, 2, 7, 9, 3, -7, 11, 8, 1, 13, 6, -2, 19, 8]], [[1, 2, 3, 4, 5, 6, 7, 9, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 11]], [[2, 3, -3, 1, 16, -8, 9, -12, 7, 6, -12, 16, 7]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 19, 21, 20, 200, 2]], [[9, -5, 0, -1, 6, -4, -5, 3, 3, 12, 0]], [[-4, 3, -6, 3, 0, -8, 2, 1, 8, 14, 0, 2]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 10, 11, 9, 12, 13, 14, 15, 16, 17, 18, 19, 21, 20, 0]], [[9, 0, 6, -4, 3, 12]], [[1, 2, 3, 11, 5, 1, 16, -8, 0, 9, -11, 7, -2, 4, -12, 7, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000, 6]], [[-4, 8, 3, -6, 0, -8, 6, 2, 1, 8, 13, 6, 6, -8, 14, -6, 6, 13]], [[1, 2, 3, 11, 5, 8, 1, 16, -8, 9, -11, 7, 4, -12, 7, 7, 7]], [[2, 3, -3, 1, 16, -8, 9, -12, 7, 6, -4, 16, 7, 16]], [[1, 1, 2, 3, 5, 1, 0, -8, 9, 11, 0, -12, 7, 6, 6, 1, -12, 1, 1]], [[900, 2, 7, 900, 9, 3, -7, 8, 0, 1, -12, 6, -2, 19, 13, 19]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, 0, 6, -8, 0]], [[-4, 7, 3, -2, -6, 3, 0, -8, 6, 0, 2, 0, 1, 8, 14, -12, 4, 6]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 700, 1, 13, 6, -2, 19, 19, 13, 9, 13]], [[9, 0, 8, -1, 6, -4, 10, 12]], [[22, 9, 12, 3, 6, 15, 0, -3, 18, 21, 30, -9, 22]], [[7, 3, 3, -7, 1, 8, 14, 0]], [[-4, 7, -6, 3, 0, -8, 6, 2, 699, 1, 8, 0, 0]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, 2, -5, -6, -7, -8, -9, -10]], [[9, 0, 3, -3, -4, 0, 9, -5, -4, 3]], [[9, 700, 12, 699, 15, 0, 0]], [[9, 289, 11, 15, 0]], [[9, 0, 8, -1, 6, -4, -10, 10, 12, 0, -1]], [[9, -1, 7, 700, -1, 6, -4, 3, 11, 3, -1]], [[1, 2, 3, -3, 5, 1, 5, 16, -8, 9, -12, 7, 6, 16, 5]], [[300, 500, 16, 7, 8, 289, 21, -105, -277, 200, 4, 5, 700, -200, -901, 800, 1000, 300]], [[2, 3, -3, 1, 16, -8, 9, -12, 6, -12, 16, 7]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, 2, -12, 7, 6, 1, 16]], [[9, 0, 8, -1, 6, -4, -5, 12, 0, -1]], [[2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, -12, -9, 16]], [[-4, 8, 3, -6, 0, 6, 2, 1, 8, 14, 6, 6, -8, 14, 0]], [[1, 7, 3, -3, 5, 1, 16, -8, 9, 104, 7, 6, 16, 9]], [[19, 0, 2, 4, 3, 4, 5, 6, 7, -9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11, 16, 11]], [[1, 2, 3, 5, 1, 0, -8, 1, 10, -12, 7, 6, 6, 1, -12, -8]], [[300, 499, 6, 17, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277]], [[-4, 7, -6, 1000, 0, -8, 6, 290, 2, 289, 1, 1000, 290]], [[9, 0, 800, 700, 2, 699, 12]], [[300, 500, 6, 7, 8, 289, -277, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277, -277]], [[9, 0, 3, -3, -4, 0, 9, -5, 3, -4, 3, -4]], [[19, 0, -901, 2, 3, 4, 5, 6, 16, 7, 7, 9, 10, 12, 14, 15, 16, 17, 18, 19, 21, 20, 16]], [[9, 0, 30, -200, 8, -1, -9, -3, -4, -5, 12, 12]], [[1, 2, 3, -3, 5, 1, 16, -8, 9, -12, 7, 6, 16, 3]], [[1, 2, 3, -3, 5, -2, 1, 16, -8, 9, -12, 7, 6, 16]], [[-4, 7, 3, -6, 3, 0, -8, 2, 1, 8, 14, 0, 2, 14]], [[-4, 1, 3, -6, 3, 0, -8, 6, 2, 1, 16, 8, 16, 0, 4, 1, 0]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 200, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, 289, -277, 18, -277]], [[1, 2, 3, 5, 1, 20, -8, 9, -12, 7, 6, 5, 2]], [[-4, 7, 3, -5, 200, -8, -7, 2, 0, 1, 8, 0, -6]], [[9, 0, 10, -4, 9, 289, 3, 12, 900, 3]], [[1, 2, 3, -3, 5, 16, 16, -8, 9, -12, 7, 6, -12]], [[1, 2, 3, -3, 5, 16, 16, -8, 10, -12, 7, 0, -12]], [[-4, 7, 105, 3, 3, 0, 7, -8, -2, 2, 0, 12, 1, 20, 0, 0, 0, 1]], [[1, 2, 3, 11, 5, 8, 1, 16, -8, 9, -12, 7, 4, -12, 7, 7, 7]], [[1, 2, 3, -3, -10, 1, 16, 16, 9, -12, 7, 6, -12, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, -3, 900, 18, -901, 800, 1000, 0, -277, -277]], [[16, 3, -6, 3, 0, 21, 6, 2, 1, 8, 14]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, 2, -5, -6, -7, -8, -9, -10, 6]], [[1, 2, 3, 5, 1, 0, -8, 9, -12, 6, -4, 6, 1, 6]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, 105, -901, 800, 1000, 6, 7]], [[0, 0, 3, 12]], [[-4, 7, 3, -6, -12, -8, 5, 2, 1, 8, 14, 0, 6, -8, 14]], [[1, 2, 3, 5, -9, 1, 0, -8, 9, -12, 7, -4, 6, 1, 6, 3]], [[1, 2, 3, 4, 5, 6, 7, 9, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 11, 15]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -8, -901, 800, 1000, 0, -277, -8]], [[1, 2, 3, 5, 1, 0, -8, 9, 200, -12, 7, 6, 6, 1, -13, 9, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 11, 10]], [[9, 0, -4, 9, 289, 3, 12, 900, 3]], [[9, 0, 8, -1, 6, -3, -4, -5, 12]], [[9, 6, 500, 3, 20]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 105, 4, 5, 700, 900, -200, -901, 800, 1000, 6, 300]], [[-91.9549202660326, 19.13452041495991, 19.18319187411889, -92.90661646941159]], [[1, 2, 3, 5, -9, 1, 0, -8, 9, -12, 7, -4, 6, 6, 1, 6, 3]], [[9, -5, 0, -1, 6, 19, -5, 3, 9, 12, 0]], [[1, 1, 2, 3, 5, 1, 0, -8, 9, 0, -12, 7, 6, 6, -12, 1]], [[19, 0, -901, 2, 3, 4, 17, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19, 21, 20]], [[1, 2, 3, -3, 5, 16, 15, 16, -8, 10, -12, 7, 0, -12]], [[-4, 7, 3, -6, 3, 0, -8, 2, 1, 8, 14, 0, 2, -8]], [[9, 0, 8, 9, -1, 6, -4, -5, 12, 0, 8]], [[9, 0, 6, 12, 3, 3]], [[9, 0, 9, 3, -4, 289, 3, 12, 3]], [[1, 2, 3, -3, 5, 1, 16, 15, 16, 9, -12, 7, 6, -12, 7, 5]], [[9, -1, 700, -1, 6, -4, 3, 20, 11, 17, 3, -1]], [[9, 289, 10, 16, 0]], [[19, 0, -901, 2, 14, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 19, 21, 20, 200, 2]], [[1, 2, 3, -3, 5, 1, 16, -8, 8, -12, 7, 6, 1, 16]], [[9, 12, 3, 6, 15, 4, 300, 0, -3, 18, 30, -9, -9]], [[-4, 7, -6, 3, 0, 6, 2, 0, 1, 8, 0, 0]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 21, 20]], [[-4, 18, 7, 3, -6, 3, 0, -8, 6, 0, 8, 14, 14]], [[2, -3, 5, 1, 0, 18, 4, 9, -5, -12, 0, 7, 6]], [[-91.9549202660326, -92.90661646941159]], [[-4, 7, 3, -6, 3, -1, 0, 7, -8, -7, 2, 0, 1, 20, 0, 0]], [[19, 0, -901, 2, 3, 4, 5, 6, 7, 8, 10, 11, 9, 12, 13, 14, 15, 11, 16, 17, 18, 19, 21, 20, 0]], [[-4, 8, 3, -6, 3, 0, 7, -8, -7, 2, 0, 1, 20, 0, 0]], [[300, 500, 16, 7, 8, 289, 21, 3, -105, -277, 200, 4, 5, 700, -200, -901, 800, 1000, 300]], [[-4, 8, 3, -6, 3, 0, -8, 6, 2, 1, 800, 0, 800]], [[9, 0, -1, 6, 3, 12, 6]], [[-91.9549202660326, 19.13452041495991, 19.18319187411889, -92.90661646941159, 19.18319187411889]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -8, 1001, -901, 800, 1000, 0, -277, -8, 300]], [[-4, 8, 3, -6, 3, 0, -8, 6, 799, 2, 1, 800, 0, 800]], [[6, 300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, -276, 18, -901, 800, 1000, 0, -277]], [[19, 0, -901, 2, 3, -276, 4, 5, 6, 16, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 20]], [[3, -3, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16, 7]], [[9, 0, 13, 3, 4, -4, 9, -5, 289, 12, 3]], [[300, 500, 6, 7, 8, 289, -277, 22, -277, 104, 200, 3, 0, 5, 700, 901, 18, -901, 800, 1000, 0, -277, -277]], [[-4, 3, 105, 3, -1, 10, 14, 0, -8, 6, 2, 0, 1, 8, 14, 0, 6]], [[7, 3, -6, 3, 0, -8, 6, 2, 2, 1, 8, 14, 1, 6]], [[19, 0, -901, 2, 3, 4, 5, 6, 16, 7, 8, 10, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 20, 16]], [[9, 0, 3, -4, -5, 1, -11, -4, 3]], [[1, 2, -3, 1, 0, 6, 4, 9, -12, 7, 6]], [[9, 12, 3, 6, 15, 0, 30, -9, -9, 3]], [[1, 2, 3, -3, 5, 16, 15, 16, -8, 10, -12, 7, 0, -12, 5]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 105, 4, 5, 700, 900, -200, -901, 800, 1000, 6, 6]], [[-4, 8, 4, -6, 0, -8, 6, 2, 1, 13, 6, 6, -8, 14, -6, 8]], [[9, -1, 700, -1, 17, 6, -4, 3, 11, 3, -1, 9]], [[19, 14, 0, -901, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 20, 7]], [[1, 2, 3, -3, 5, 16, -278, 15, 16, -8, 10, -12, 7, 0, -12, 5]], [[6, 300, 500, 6, 7, 1001, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, -276, 18, -901, 800, 1000, 0, -277]], [[-5, 1, 2, -3, 5, 1, 289, 16, 16, -8, 9, -12, 7, 6, -12, 16, 1, 5, 5]], [[300, 500, 6, 7, 8, 1001, 20, -105, -277, 104, 200, 3, 105, 4, 5, 700, 900, -200, -901, 800, 1000, 22, 6]], [[-4, 8, 3, -6, 3, 0, 7, -8, -7, 2, 0, 0, 1, -7, 20, 0, 0, -7]], [[1, 2, 3, -3, 5, 16, -278, 15, 16, -8, 10, -12, 7, 0, -12, 5, 10]], [[1, 2, 3, -3, 5, 1, 0, 18, 4, 9, -12, 7, 4]], [[1, 3, 5, 1, 0, -8, 9, -12, 105, 6, 6, 1, 6]], [[0, 8, 9, -1, 6, -4, -5, 12, 0, 8, 0]], [[-3, 7, 3, -6, 3, 0, -8, 6, 2, 0, 901, 8, 0, 0, 3]], [[19.13452041495991, -91.9549202660326, -92.90661646941159]], [[16, 7, 3, -6, 3, 0, -8, 6, 2, 1, 8, 14, 8, 1]], [[1, 2, 3, -3, 5, 1, 0, 4, 9, 0, 6, 6, 0]], [[-4, 7, -6, 1000, 0, -8, -6, 8, 6, 2, 289, 1, 7, -8, -6]], [[-4, 7, 3, -6, 0, -8, 6, 2, 1, 8, 14, -1, 6, -8, 6, 8]], [[9, 0, 3, 9, 289, 3, 12, 900, 3]], [[1, 2, 3, 5, 1, 0, -8, 9, 0, -12, -6, 6, 6, 1, -12, 1, 9]], [[-4, 7, -6, 1000, 0, -8, -6, 8, 6, 2, 289, 1, 7, -8, -6, 289]], [[900, 2, 7, 11, 9, 3, -7, 8, 0, 1, -12, 6, 200, -2, 19, 13, 1]], [[300, 500, 801, 7, 8, 289, 20, -105, -277, 104, 200, 3, 0, 5, 700, 900, 18, -8, -901, 800, 1000, 0, -277, -8]], [[1, 2, 3, 1, -1, -8, 9, -12, 7, 6, 5, 1, 2]], [[1, 2, 3, -3, -10, 1, 16, 16, 9, -12, 7, 1, -12, 7]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -9, -3, -4, -5, -6, -7, -8, -9, -10]], [[2, 3, -2, 1, 16, -8, 9, -12, 7, 6, -12, 16, -7]], [[1, 2, 3, -3, 5, 1, 0, 4, 9, 7, 6]], [[-4, 7, 14, 3, -5, 3, 0, -8, 6, 2, 0, 1, 8, -4, 7]], [[-4, 20, 7, 3, -6, 3, 0, -8, 6, 0, 1, 105, 8, -8, 0]], [[900, 2, 7, 900, 9, 3, -7, 8, 0, 1000, -12, 6, -2, 19, 13, 19]], [[1, 2, 3, -3, 16, 16, -8, 9, -12, 7, 6, -12]], [[900, 2, 7, 900, 9, 3, -7, 8, 0, 1000, -12, -278, -2, 19, 13, 19]], [[0, 300, 6, 3, 12, 0, 300]], [[1, 2, 3, -3, 5, 1, -9, 16, 16, -8, -12, 7, 6, -12, 7]], [[-1, -4, 7, 105, 3, 3, 0, 7, -8, -2, 2, 0, 1, 20, 0, 0, 1]], [[19, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 19, 21, 20, 200, 2]], [[9, 0, 20, 6, 3, 3, 2]], [[500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 5, 700, 900, -901, 800, -11, 4]], [[300, 500, 6, 2, 7, 8, 6, -277, 22, -277, 104, 200, 3, 0, 5, 901, 18, -901, 800, 1000, 0, -277, -277]], [[1, 2, 3, -3, 5, 16, 15, -2, -8, 10, -12, 7, 0, -12, 5]], [[9, -1, 700, -1, 17, 6, -4, 11, 3, -1, 9]], [[300, 500, 6, 7, 8, 289, 21, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000, 300, 6]], [[1, 2, 3, -3, 5, 16, 15, -2, -8, 10, -12, 7, 0, 5]], [[9, 0, 6, 3, 3]], [[9, 0, 3, 9, 289, 3, 12, 900, 3, 289]], [[2, 3, -3, 1, 16, -8, 9, -12, 6, 6, -12, 16, 7]], [[-4, 7, 4, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0, 0]], [[0, 3, 12]], [[9, 0, 8, -2, 6, -4, 10, 12]], [[900, 1, 2, 3, -3, 5, 1, 801, 4, 9, 0, 6, 6, 0]], [[19, 0, 2, 4, 3, 4, 5, 6, 7, -9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11, 16, 11]], [[9, 0, 6, 3, 4, 12]], [[9, 12, 3, 6, 15, 0, 30, -9, -9, 3, 30, -9]], [[5, 13, 2, 7, 9, 3, -7, 11, 8, 0, 700, 1, 13, 6, -2, 19, 19, 13, 9, 13, 13]], [[1, 3, -3, 5, 1, 16, 15, 16, 9, -12, 7, 6, -12, 7]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 0, 19]], [[-4, 8, -12, -6, 4, 900, -8, 6, 799, 2, 1, 800, 0, 800, -6]], [[9, 3, -4, 9, -5, 1, 12, 300, -4, 9]], [[9, 0, 8, -1, 6, -4, -5, 12, 18, 12, -5]], [[-4, 18, 7, 3, -6, 3, 289, -8, 6, 1, 8, 14, 14, 3]], [[-4, 7, 3, -6, 3, 0, -8, 2, -277, 1, 8, 14, 0, 2, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 4, 5, 700, 900, -200, -901, 499, 1000]], [[1, 2, 3, -3, 5, 1, 0, 4, 9, 0, 6, 6, 0, 0]], [[-1, 6, -4, 3, 12]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 701, 900, -200, 105, -901, 800, 1000, 6, 7]], [[1, 2, 3, -3, 5, 1, 16, 16, -8, 9, -12, 7, 6, -12, 16, -12]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 104, 200, 4, 5, 700, 900, -200, -901, 800, 1000]], [[5, 2, 9, 3, -7, 8, -8, 8, 0, 1, 13, 6, -2, 19]], [[9, 0, 10, -4, 9, 289, 3, 12, 900, 3, 3]], [[300, 500, 6, 7, 200, 7, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, 6, -901]], [[1, 2, 3, -3, 5, 16, 15, 16, 10, -12, 7, 0, -12, 5]], [[-4, 7, 105, 3, 3, 0, 7, -8, -2, 2, 1, 1, 20, 0, 0, 0, 1]], [[9, 0, 14, 6, 105, -4, -5, 14, 3, 12]], [[1, 2, 3, -3, 5, 16, 16, -8, 10, -12, 7, 0, -12, -12]], [[1, 2, 3, 5, 1, 16, -11, 16, -8, 9, -12, 7, 6, -12, 16, 7, 9]], [[300, 499, 6, 17, 8, 289, 20, -105, -277, -200, 104, 200, 37, 3, 0, 5, 700, 900, 18, -901, 800, 1000, 0, -277, 0]], [[1, 2, 3, 1, 1, -1, -8, 9, -12, 7, 6, 5, 1, 2]], [[-4, 18, 7, -6, 3, -6, 3, 0, -8, 6, 0, 8, 14, 14]], [[6, 9, 3, 12, 15]], [[1, 2, 4, 5, 7]], [[1, 2, 2, 3, 3, 3, 4, 5]], [[4, -3, 9, -5, 0, -7, 2]], [[1.2, 2.5, 3.7, 4.1, 5.0]], [["cat", "dog", "apple", "banana"]], [[1, 2.5, "cat", true, null]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, 900, -901, 800, 1000]], [[9, 0, 6, -5, 12]], [[9, 12, 3, 6, 15, 0, -3, -6, 18, 21, 30, -9, 9]], [[9, 0, 7, 6, 3, 12]], [[-4, 7, 3, 290, 3, 0, -8, 6, 2, 0, 1, 8]], [[9, 0, 6, 3, 12, 9]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000, -901]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[-4, 7, 3, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8]], [[9, 12, 3, 6, 0, -3, -6, 18, 21, 30, -9, 9]], [[300, 500, 6, 7, -901, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000, 900]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 104]], [[290, 5]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 104, 3]], [[9, 12, 3, 6, 15, 0, -3, -6, -9, 21, 30, -9]], [[-4, 7, -7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 900]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 300, 3, 4, 5, 700, 900, -901, 800, 1000, -901]], [[300, 500, 6, 289, 290, 8, 289, 20, 104, -277, 104, 200, -8, 700, 900, -901, 800, 1000, 15, -8, 700]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8]], [[false, -99.72274847671751, "FlYijS", true, true, true, true, [false, false], null, false]], [[5, 5, 5]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 7, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[290, 290]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -1, -2, -3, -4, -1, -5, -6, -7, -8, -9, -11]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8]], [[5, 2, 7, 9, 3, -7, 11, 8, -6, 0, 1, 13, 6, -2, 19]], [[5, 2, 7, 9, 3, -6, 11, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [[false, true, false, false, true, true, true, true, true]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, 72.36056595235235, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -7, -1, -2, -3, -4, -1, -5, -6, -7, -8, -9, -11]], [[8, 9, 0, 0, 6, -5, 12]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 500]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8, 7]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, 104]], [[500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, 104]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 7, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 1000]], [[500, 6, 7, 290, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, 900, -901, 800, 1000]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, -4]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 8, 7]], [[300, 500, 21, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000, -901]], [[1, 2, 3, 4, 5, 6, 7, 8, -901, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 20, 7, 8]], [[300, 500, 6, 7, 289, 20, -105, 899, -277, 104, 8, 7, 3, 4, 5, 19, 700, 900, -200, -901, 800, 1000, 500]], [[300, 500, 6, 7, -901, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, -277]], [[1, 2, 3, -3, 5, 0, -8, -7, 9, -12, 7, 6]], [[5, 2, 7, 9, 3, -6, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, 7]], [[300, 500, 6, 7, 291, 8, -3, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8]], [[9, 12, 3, 6, 15, 0, -3, 1000, 18, 21, 30, -9]], [[9, 12, 3, 6, 15, 0, -3, -6, 18, 29, 21, 30, -9, 3]], [[-4, 3, 289, 290, 3, 0, -8, 899, 2, 0, 8, 7]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 1000]], [[500, 6, 7, -2, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 10, 700, 900, -200, -901, 800, 1000, -277]], [["FlYijS", "FlYijS"]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 8, 7, 2, 3]], [[1, 2, 3, -3, 5, 1, -8, 9, -12, 7]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 3, 3]], [[500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, 105]], [[5, 2, 7, 9, 15, 3, 7, -7, 11, 8, 0, 1, 13, 6, -2, 19, 5]], [[-99.72274847671751, -83.09912721681734, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323]], [[-99.72274847671751, -83.09912721681734, -65.7881626366349, 40.58689270655174, -93.33888003792336]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, 95.49028567433459, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 800, 1000, 7]], [[500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 291, 800, 1000, 105, 290]], [[1, 2, 3, -7, -3, 5, 0, -8, -7, 9, -12, 7, 6]], [[9, 11, 3, 6, 15, 0, -3, 1000, 18, 21, 30, -9]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800]], [[-83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[false, false, true, false, false, true, true, true, true, true]], [[false, true, false, false, true, true, true, true, true, true]], [["KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "VFE", "BKRP", "FlYijS", "DAxnifdXi"]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, 5, -200, -104, -901, 800]], [[300, 500, 6, 7, -901, 8, 289, -105, -277, 11, 200, 3, 4, 5, 700, 900, -901, 800, 1000]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[9, 900, 0, 6, 12, 3, 12]], [[9, 0, -5, -6, 12]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 8, 900, -901, 800, 1000, -901, 1000]], [[9, 0, 6, 3]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000, -277]], [[300, 500, 6, 7, 291, 8, -3, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 6]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 0, 3, 6]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000, -277, 7]], [[300, 500, 6, 7, -901, 8, 289, 20, -105, -277, 104, 5, 200, 3, 4, 5, 700, 900, -901, 800, 1000, 900]], [[9, 0, -5, -6, 12, 9]], [[300, 500, 6, 7, 291, 8, -3, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 104, 290, -8]], [[-99.72274847671751, -83.09912721681734, -65.7881626366349, 40.58689270655174, -117.53764672581704, 8.760174116134323]], [[500, 6, 7, -2, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 11, 700, -200, -901, 800, 1000, -277]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 20, 7, 8]], [[true, false, false, true, true, true, true, true]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, 104, 3]], [[5, 2, 7, 9, 3, -7, 11, 8, -6, 0, 6, 1, 13, 6, -2, 19]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 1000, 5]], [[-4, 300, 7, 3, 289, 290, 0, -8, 6, 2, 0, 8, 7, 2, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 11, 16, 17, 18, 20, 20, 7, 8]], [[500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 801, 1000, -277, 7]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, -9, 700, 900, -901, 800, 1000, -901, 104, 899, 17, 3]], [[1, 0, -5, -6, 12, -5]], [[300, 500, 6, 7, 290, 8, 289, 20, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901]], [[1, 2, 3, -7, -3, 5, 0, -8, -7, 1, -12, 7, 6]], [[500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -8, -901, 800, 1000, -277]], [["KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "DAxnifdXi", "VFE", "BKRP", "FlYijS", "DAxnifdXi"]], [[5, -9, -9]], [[1, 15, 2, 3, 4, 5, 6, 7, 8, 10, 11, 1000, 12, 13, 14, 15, 16, 17, 18, 20, 20, 7, 8]], [[300, 500, 6, 7, 291, 8, -3, 289, 20, 104, -277, 8, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 200]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 7, 3, 12, 4, 5, 700, 900, -200, -901, 800, 1000]], [[false, true, false, false, true, false, true, true, true, true, true]], [[500, 6, 7, -2, 8, 289, 20, -105, -277, 104, 200, 3, 4, 11, 700, -200, -901, 800, 1000, -277]], [[false, false, false, true, false, false, true, true, true, true, true]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, -104, -200, -104, -901, 800, 1000]], [[300, 500, 300, 6, 289, 290, 8, 289, 20, 104, -277, 104, 200, -8, 700, 900, -901, 800, 1000, 15, -8, 700]], [[-4, 7, 3, -6, 29, 3, 0, -8, 6, 2, 0, 1, 8]], [[500, 6, 6, 8, 289, 20, -105, -277, 104, 200, 3, 20, 4, 5, 700, 900, -200, -901, 800, 1000, -277]], [[false, true, false, false, false, true, true, true, true]], [[5, 2, 7, 9, 3, -6, -6, 0, 300, 1, 13, 6, -2, 19]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 15, 7, 3, 12, 4, 5, 700, 900, 799, -200, -901, 800, 1000, 5, 8]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, -93.33888003792336, 8.760174116134323, 95.49028567433459, 72.36056595235235, 8.760174116134323]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, -4, 3, 4, 700, 900, -901, 800, 1000, -901]], [[5, 2, 7, 9, 3, -7, 11, 8, -6, 0, 1, 6, -2, 19]], [[1, 9, 12, 3, 6, 15, 0, -3, 1000, 18, 30, -9]], [[300, 500, 6, 104, 7, 8, 289, 20, -105, -277, 104, 8, 9, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[-99.72274847671751, -63.93182529303477, -83.09912721681734, 72.36056595235235, 72.36056595235235, 40.58689270655174, -93.33888003792336, 8.760174116134323, 8.760174116134323, 95.49028567433459]], [[9, 0, -4, 6, -5, 12]], [[-4, 7, 3, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8, 0]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -7, -1, -3, -4, 800, -5, -6, -7, -8, -9, -11, -2]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -3, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 290]], [[-99.72274847671751, -83.09912721681734, -65.7881626366349, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323]], [[-99.72274847671751, -65.7881626366349, 72.36056595235235, -65.7881626366349, -93.33888003792336, 8.760174116134323, -63.93182529303477, 8.760174116134323]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -276, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 1000]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 20, 3, 6, 8]], [[5, 2, 7, 9, 15, 3, 7, -7, 11, 8, 0, 1, 13, 6, -2, 19, 5, 15]], [[10, 9, 8, 7, 7, 5, 4, 3, 2, 1, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10]], [[5, 2, 7, 3, -7, 11, 8, -6, 0, 6, 1, 13, 6, -2, 19]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, -901, 0, 1000, 104]], [[5, 2, 9, 3, -7, 11, 8, -6, 0, 6, 1, 13, 6, -2, 19]], [[500, 6, 7, 290, 8, 899, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 291, 800, 1000, 105, 290]], [[-83.59177604914281, -99.72274847671751, -83.09912721681734, 72.36056595235235, 72.36056595235235, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[500, 6, 7, 1001, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 7, 3, 12, 4, 5, 700, 900, 799, 6, -200, -901, 800, 1000, 5, 8]], [[500, 6, 6, 8, 289, 20, 8, -277, 104, 200, 3, 20, 300, 4, 5, 700, 900, -200, -901, 800, 1000, -277]], [[-83.09912721681734, -83.09912721681734, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323]], [["BKRP", "KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "VFE", "xDAxnifdXi", "BKRP", "FlYijS", "DAxnifdXi"]], [[300, 500, 6, 104, 7, 8, 289, 20, -105, -277, 104, 8, 9, 3, 9, 5, 700, 900, -200, -901, 800, 1000, -105]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -902, 800, 1000, 103, 3]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 12, 1, 8, 7]], [[5, 2, 7, 9, 3, -6, 9, 11, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [[1, 2, 3, -3, 5, 2, 0, -8, 9, -12, 7, 6, -3]], [[-99.72274847671751, -83.09912721681734, -106.70482262238853, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[300, 500, 6, 8, 289, -105, -277, 11, 3, 4, 5, 700, 900, -901, 800, 1000]], [[290, 5, 5]], [[301, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 1000, 20]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, -199, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 8, 2, 7]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459, -65.7881626366349]], [[9, 5, 0, -5, -6, 12, 9, 9]], [[-4, 7, 10, 3, 289, 290, 3, 0, -8, 6, 2, 0, 8, 7, 2, 3]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 6.0403607760564215, 95.49028567433459, -65.7881626366349]], [[1, 2, 3, 4, 5, 6, 7, 8, -901, 10, 11, 12, 13, 14, 15, -276, 17, 18, 20, 20, 7, 8]], [[300, 500, 6, 7, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 1000, 5]], [[9, 5, 0, -5, -6, 12, 9, 9, -6]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 2, -8, 700, -2, -901, 800, 1000, 7]], [[500, 6, 7, -2, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 11, 700, -200, -901, 800, 1000, -277, 289]], [[false, true, false, false, true, false, true, true, true, true, true, true]], [[300, 500, 6, 7, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 29, 5]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, -4, -11, 3, 4, 700, 900, -901, 800, 1000]], [[1, 2, 3, -3, 1, 5, 2, 0, -8, 9, -12, 7, 6, -3]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 15, 7, 3, 4, 5, 700, 900, 799, -200, -901, 800, 1000, 5, 8, 5]], [[-4, 7, 3, 290, 3, 0, -8, 6, 2, 0, 8, 2, 7, 7]], [[5, -9, -9, 5]], [[9, 0, 5, 3, 12]], [[1, 9, 12, 3, 6, 15, 0, -3, 1000, 30, -9]], [[9, 900, 0, 4, 6, 12, 3, 12, 9, 12]], [[-4, 3, 289, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8]], [[9, 0, 7, 3, 12, 9]], [["KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "DAxnifdXi", "VFE", "BKRP", "FlYijS", "DAxnifdXi", "DAxnifdXi"]], [[-99.72274847671751, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -63.93182529303477, 8.760174116134323, 95.49028567433459]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 18, 1000, 7]], [[9, 0, -5, 29, -6, 12, 9]], [["BKRP", "KaTQ", "DAnxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "BKDAxnifdXiRP", "VFE", "xDAxnifdXi", "BKRP", "FlYijS", "DAxnifdXi"]], [["KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "VFE", "BKRP", "FlYijS", "DAxnifdXi", "VFE"]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, 72.36056595235235, 40.58689270655174, -93.33888003792336, 8.760174116134323, 120.16237056855249, 72.36056595235235]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 120.16237056855249, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, -8, 1, 13, 6, -2, 19, 13]], [[1, 2, 3, -3, 1, 5, 2, 0, -8, 9, -12, 7, 6, -3, 9]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 8, 7, 2, 3, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20]], [[9, 0, -5, 29, -6, 105, 9]], [[500, 6, 7, 290, 8, 289, 20, 104, -277, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[false, true, false, true, false, false, false, true, true]], [[1, 2, 3, 4, 10, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 6]], [[1, -5, -6, 12, -5]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, -901, 800, 1000, 104, 3]], [[500, 6, 7, 290, 30, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 18, 1000, 7]], [[5, 5, 6, 5]], [[1, 15, 2, 3, 4, 5, 19, 6, 7, 8, 10, 11, 1000, 12, 13, 14, 15, 16, 17, 18, 20, 20, 7, 8]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 7, 3, 12, 4, 5, 700, 900, -901, 800, 1000]], [[290, 290, 290]], [[-99.72274847671751, -63.93182529303477, -83.09912721681734, 72.36056595235235, 40.58689270655174, -63.93182529303477, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [["BKRP", "KaTQ", "DAnxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "BKDAxniifdXiRP", "VFE", "xDAxnifdXi", "BKRP", "FlYijS", "DAxnifdXi"]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 104]], [[-4, 7, 3, 290, 3, 0, -8, 6, 0, 1, -8, 8, 0]], [[5, 2, 7, 9, 3, -6, 500, 8, 21, -6, 0, 300, 13, 6, -2, 19]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 104, 1000]], [[300, 1, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -902, 800, 1000, 103, 1001]], [[300, 500, 6, 7, 8, 289, 103, 20, -105, -277, 104, 8, 7, 3, 12, 4, 5, 700, 900, -901, 800, 1000]], [[299, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 104]], [[9, 0, -5, 29, -6, 900, 9, 29, 9]], [[9, -2, -5, 29, -276, -6, 12, 9, -6]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 9, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 1000]], [[1, 300, -5, -6, 12, -5]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, -200, 800, 1000, 290, -8, 104, 1000]], [[1, 2, 3, -3, 1, 5, 2, 11, 0, -8, 105, 9, -12, 7, 6, 2, -3]], [[-99.7842461107317, -99.72274847671751, -83.09912721681734, -106.70482262238853, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, -84.10256408187446, 8.760174116134323, 95.49028567433459]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 8, 300, 900, -901, 800, 1000, -901, 1000]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 15, 7, 3, 4, 5, 700, 900, 799, -200, -901, 800, 1000, 4, 8, 5]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, -104, -200, -104, -901, 800, 1000, 289]], [[5, 2, 7, 9, 15, 3, 7, -7, 11, 8, 0, 13, 6, -2, 19, 5, 15]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 6.0403607760564215, 95.49028567433459, -65.7881626366349, 40.58689270655174]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 4, 4, 5, 700, 900, -200, -104, -901, 800, 1000, 1000]], [[299, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 3, 4, 700, 900, -901, 800, 1000, -901, 104]], [[300, 500, 6, 7, 8, 289, 20, -105, 104, -199, 200, 3, 4, 5, 700, 900, 699, -200, -901, 800, 1000]], [[300, 6, 7, 290, -276, 289, 20, -105, -277, 104, 200, 3, 4, -9, 700, 900, -901, 800, 1000, -901, 104, 899, 17, 3]], [[500, 6, 7, 8, 288, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 801, 1000, -277, 7]], [[300, 500, 7, 8, 289, 20, -105, 104, 200, 3, 4, 5, 700, -104, -200, -104, -901, 800, 1000, 289, 200]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 0, 5, 700, -104, -200, -104, -901, 800, 1000]], [[9, 0, 6, 1000]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -901, 800]], [[5, 2, 7, 299, 3, -7, 11, 8, 0, 1, 13, 6, -2, 19]], [[300, 500, 6, 7, 9, 8, 289, 20, -105, -277, 700, 103, 200, 7, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[1, 15, 2, 3, 4, 5, 19, 6, 7, 8, 10, 1000, 12, 13, 14, 15, 16, 17, 18, 20, 20, 7, 8]], [[-4, 7, -7, -6, 3, 0, -8, 6, 2, 0, 1, 8, 7]], [[-7, 6, 7, 290, 8, 289, 20, 104, -277, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[290, 291, 290]], [[9, 0, -5, 29, -6, 105, 9, 9]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, -901, 20, 3, 6, 8]], [[300, 500, 6, 7, 291, 8, -3, 289, 20, 104, -277, 8, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 200, 104]], [[1, 5, 2, 7, 9, 3, -7, 11, 0, 1, 13, 6, -2, 8, 19]], [[6, 2, 7, 9, 15, 3, 7, -7, 11, 8, 0, 13, 6, -2, 19, 5, 15, 5]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 10, 3, 4, 700, 900, -901, 800, 1000, -901, -277]], [[-4, 7, 3, -6, 3, 0, -8, 6, 2, 0, 1, 8, -6]], [[300, 500, 7, 290, 8, 289, 20, 104, -277, 900, 8, 6, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 104]], [[-7, 6, 7, 290, 8, 289, 104, -277, 200, 3, 4, -8, 700, -2, -901, 800, 1000, 1000]], [[-54.69467732901731, -99.72274847671751, -83.09912721681734, -65.7881626366349, 40.58689270655174]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 3, 4, 700, 900, -901, 800, 1000, -901, -277]], [[9, 900, 0, 4, -105, 12, 3, 12, 12]], [[-4, 301, 7, 3, 289, 290, 699, -8, 6, 2, 0, 8, 7, 2, 3, 3]], [[1, 2, 3, 5, 2, 0, -8, 9, -12, 7, 6, -3]], [[300, 500, 7, 7, -901, 289, -105, -277, 11, 200, 3, 4, 5, 700, 900, -901, 800, 1000, 7, 7]], [[1, 15, 2, 3, 4, 5, 19, -276, 7, 8, 10, 11, 1000, 12, 13, 14, 15, 16, 17, 18, 20, 20, 8]], [[5, 2, 7, -1, 9, 0, 3, -6, 9, 11, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [["KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "VFE", "BKRP", "FlYij", "FlYijS", "DAxnifdXi", "VFE"]], [[-4, 3, 290, 290, 3, 0, -8, 6, 2, 0, 1, -9]], [[5, 2, 7, -1, 9, 0, 3, -6, 9, 7, 11, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [[true, false, false, true, true, true, true]], [[5, 2, 7, 9, 15, 3, 7, -7, 11, 8, 0, 13, 6, -2, 19, 5, 15, 11, 6]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 500, -901]], [[10, 8, 7, 7, 5, 4, 3, 2, 1, 899, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -4]], [[-4, 3, 3, 290, 3, 0, -8, 6, 2, 0, 8, 2, 19, 7]], [[5, 2, 7, 9, 3, -6, 11, 8, -6, 0, 300, 5, 1, 13, 6, -2, 19]], [[1, -5, 12, -5]], [[300, 500, 6, 7, 290, 8, 289, 20, -7, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, 1000, 289]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, 700, -901, 800, -901, 20, 3, 6, 8, 8]], [[5, 2, 7, 9, 3, -6, 8, -6, 0, 300, 1, 13, 6, -2]], [[300, 6, 7, 290, 8, 289, 20, -105, -278, 104, 200, 3, 4, 700, -901, 800, 1000, 104, 3]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 9, 290, 200, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[9, 12, 3, 6, 15, 0, -3, -6, 18, 21, 30, -9, 0]], [[5, 2, 7, -1, 9, 0, 3, -6, 9, 11, 8, -6, 0, 300, 13, 6, -2, 19]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, -200, -901, 800, 200]], [[500, 6, 7, 1001, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 1000]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -6, -1, -3, -4, 800, -5, -6, -7, -8, -9, -11, -2, -1]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 9, 7, 3, 12, 4, 5, 700, 900, -200, -901, 800, 1000, 7]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459, -65.7881626366349, 72.36056595235235]], [[-4, 7, 3, 2, -6, 3, 0, -8, 6, 2, 0, 1, 8, -4]], [[-4, 7, 3, 289, 290, 3, 0, -8, 6, 2, 0, 1, -9, 8, 7, 0]], [[9, 12, 3, 6, 14, 0, -3, -6, 18, 21, 30, -9, 0]], [[9, 0, 6, -5, 12, 12]], [[9, 0, -5, 29, 20, -6, 105, 9]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -6, -1, -3, -4, 800, -5, -7, -8, -9, -11, -2, -1]], [[10, 8, 7, 7, 5, 4, 3, 2, 1, 899, 0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -4]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459, 40.58689270655174]], [[-4, 3, 3, 290, 3, 0, -8, 6, 2, 0, 8, 2, 19, 7, -4]], [[300, 500, 6, 7, 20, 8, 289, 20, -105, -277, 700, 103, 200, 7, 3, 4, 5, 700, 900, -200, -901, 800, 1000]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 2, -8, 700, -2, -901, 800, 1000, 7, 500]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[300, 6, 7, 290, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, 700, -901, 800, -901, 20, 3, 6, 8, 8]], [[-5, 12, -5]], [[300, 500, 6, 7, -901, 8, 289, -105, -277, 5, 200, 3, 4, 5, 700, 900, -901, 800, 1000, 801]], [[-200, 899, 5, 1000]], [[9, -5, 29, -276, -6, 12, 9, -6]], [[5, 2, 7, 9, 3, -7, 11, 8, 0, 1, -200, 13, 6, -2, 19, 13]], [[10, 8, 7, 7, 5, 4, 3, 2, 1, 899, 0, -1, -2, -4, -6, -7, -8, -9, -10, -4]], [["BKRP", "KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "FlYij", "VFE", "xDAxnifdXi", "BKRP", "FlYijS", "DAxnifdXi"]], [[-83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -117.53764672581704, -93.33888003792336, 8.760174116134323, 95.49028567433459]], [[500, 6, 7, 290, 3, 8, 289, 20, 104, -277, 104, 200, 3, 4, -8, 700, 290, -2, -901, 18, 1000, 7, 104]], [[1, 2, 3, -3, 5, 1, 0, -8, 9, -12, 7, 6, 6]], [[300, 500, 6, 7, 8, 289, 103, 20, -105, 104, 3, 7, 3, 12, 5, 700, 900, -901, 800, 1000]], [[-99.72274847671751, -83.09912721681734, -106.70482262238853, 73.18274033266016, 6.0403607760564215, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, 95.49028567433459]], [[300, 500, 6, 7, 290, 300, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 8, 900, -901, 800, 1000, -901, 1000]], [[1, 300, -5, -6, 12, -5, -5]], [[9, 0, 6, -6, 12, 9]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -6, -1, -3, -4, 800, -5, -7, -8, -9, -11, -2, -1, -6]], [["FlYijS", "FlYijS", "FlYijS"]], [[1, 2, 3, -3, 1, 5, 2, 11, 0, -8, 105, 9, -12, 7, 6, 2, -3, 1]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 7, 3, 4, 8, 700, 900, 16, -901, 800, 1000]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 11, 16, 17, 18, 20, 20, 7, 8, 6]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -276, 104, 200, 3, 4, 700, 800, 1000, -901, 1000]], [[-83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, 40.58689270655174, -117.53764672581704, -93.33888003792336, 95.49028567433459, -93.33888003792336]], [[5, 2, 7, 9, 3, -6, 11, 8, -6, -11, 0, 300, 5, 1, 13, 6, 19, 19]], [[500, 6, 7, -2, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 11, 700, -200, -901, 800, 1000, -277, 289, -105]], [[1, -5, -6, -105, 12, -5, -5]], [[5, 2, -199, 7, 9, 3, -7, 11, 8, -6, 0, 1, 6, -2, 19]], [[9, 900, 0, 4, 6, 13, 3, 12, 9, 12]], [[5, 2, 7, 9, 3, -7, 11, 8, -6, 0, 1, 6, 19]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 8.760174116134323, -100.43365896431499, 95.49028567433459, -65.7881626366349, 72.36056595235235, -65.7881626366349, 95.49028567433459]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 8, 7, 3, 12, 4, 5, 700, -5, -200, -901, 800, 1000]], [[1, 2, 3, -3, 3, 1, 5, 2, 11, 0, -8, 105, 9, -12, 7, 6, 2, -3]], [[300, 6, 699, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 19, 104, 3, -901]], [[300, 6, 699, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 801, 19, 104, 3, -901]], [["FlYijS", "jS", "FlYijS", "FlYijS"]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 800, 1000, 300]], [[300, 500, 6, 7, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 5, -200, -104, -901, 800, 29, 5]], [[300, 799, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 104]], [[9, -5, 29, -276, -6, 9, -6]], [[5, 2, 7, 9, 3, -6, -6, 288, 300, 1, 13, 6, -2, 19]], [[300, 6, 7, 290, -276, 289, 20, -105, -277, 104, 200, 3, -8, 4, -9, 700, 900, -901, 800, 1000, -901, 104, 899, 17, 3, 7]], [[9, 900, 0, 4, 6, 12, 12, 9, 12, 0]], [[300, 500, 6, 7, 289, 20, 899, -105, -277, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 29, 5]], [[300, 500, 6, 7, 290, 8, 289, 20, 104, -277, 8, 104, 200, -8, 700, 900, -901, 800, 1000, 290, -8, 104, 800]], [[29, 9, 8, 7, 6, 5, 4, 2, 0, -6, -1, -3, -4, 800, -5, -7, -8, -9, -11, -2, -1, -6]], [[300, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 289, 3, 4, 700, 8, 300, 900, -901, 800, 1000, -901, 1000]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -1, -2, -4, -1, -5, -6, -7, -8, -9, -11]], [[1, -5, -6, -5]], [[500, 9, 8, 7, 6, 5, 4, 2, 1, -7, -1, -2, -3, -4, -1, -6, -6, -7, -8, -9, -11, 9, 9]], [[-7, 6, 7, 290, 8, 289, 20, -4, 104, -277, 200, 3, 4, -8, 700, -2, -901, 800, 1000]], [[29, 9, 8, 7, 6, 5, 4, 1, 0, -6, -1, -3, -4, 800, -5, -7, -8, -9, -11, -2, -1, -6, -1]], [[5, 2, 7, 299, 3, -7, 11, 8, 0, 1, 13, 6, -2, 19, 2]], [[5, 2, 7, 9, 3, 7, -7, 11, 8, 0, 1, 13, 6, -2, 19, 5]], [["BKRP", "KaTQ", "DAxnifdXi", "DAxnifdXi", "DAxnifdXi", "DAxnifdXiBKRP", "VFE", "xDAxnifdXi", "BKRP", "VFE", "DAxnifdXi", "VFE"]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 900, -901, 3, 800, 1000, 300]], [[5, 2, 7, 7, -1, 9, 0, 3, -6, 9, 7, 11, 8, -6, 0, 300, 1, 13, 6, -2, 19]], [["BKRP", "KaTQ", "DAxnifdXi", "aTQ", "DAxnifdXi", "DAxnifdXiBKRP", "VFE", "xDAxnifdXi", "BKRP", "VFE", "DAxnifdXi", "VFE"]], [[-99.72274847671751, -65.7881626366349, 40.58689270655174, -93.33888003792336]], [[9, 900, 0, 4, 6, 3, 12, 9, -4, 12]], [[5, 5, 5, 5]], [[-99.72274847671751, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.40129767373196, 72.36056595235235, 95.49028567433459]], [[5, 2, 7, 9, 3, -6, 9, 11, 8, 0, 300, 1, 13, 6, -2, 19]], [[71.56782461129204, -83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323, 40.16510314966561]], [[300, 500, 6, 7, 8, 289, 20, -105, -277, 9, 104, 200, 3, 4, 5, 700, 900, -200, -104, -901, 800, 6, 1000]], [[500, 6, 7, 290, 3, 8, 289, -9, 20, 104, -277, 104, 200, 3, 4, -8, 700, -2, -901, 800, 1000, 7]], [[6.0403607760564215, -83.09912721681734, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323]], [[5, 2, 7, 9, 3, -6, -6, 0, 300, 1, 13, 1, 6, -2, 19]], [[300, 500, 6, 7, 290, 8, 289, 20, -105, -277, 104, 200, 3, 4, 700, 900, -901, 800, 1000, -901, -9]], [[300, 500, 6, 289, 20, -105, -277, 104, 200, 3, 4, 5, 700, 5, -200, -104, -901, 800, 29, 5]], [[-4, 3, 289, 3, 0, -8, 6, 2, 0, 1, -9, 8]], [[500, 6, 7, 8, 288, 20, -105, -277, 104, 200, 4, 3, 4, 5, 700, 900, -200, -901, 801, 1000, -277, 7]], [[9, 11, 3, 6, 15, 0, -3, 1001, 21, 30, -9]], [[300, 6, 7, 290, -276, 289, 20, -105, -277, 104, 200, 3, 4, -9, 700, 900, -901, 800, 1000, -901, 104, 700, 17, 3]], [[29, 9, 8, 7, 6, 5, 4, 1, 0, -6, -1, -3, -4, 800, -5, -7, -8, -9, -11, -2, -1, -6, -1, -1]], [[-99.72274847671751, -83.09912721681734, 72.36056595235235, -65.7881626366349, 40.58689270655174, -93.33888003792336, 8.760174116134323, 95.49028567433459, -93.33888003792336]], [[1, 2, -11, 3, -3, 1, 5, 2, 11, 0, -8, 105, 9, -4, -12, 7, 6, 2, -3, 1]], [[-99.72274847671751, 58.62972680466558, -83.09912721681734, 72.36056595235235, -99.72274847671751, -65.7881626366349, 40.58689270655174, -94.56530028394049, 6.0403607760564215, 95.49028567433459, -65.7881626366349, 40.58689270655174]], [[-4, 7, -7, -6, 3, 8, 0, -8, 6, 2, 0, 1, 8, 7, 1]]], "completion": "\ndef sort_third(l: list):\n \"\"\"\n This function takes a list l and returns a list l' such that\n l' is identical to l in the indices that are not divisible by three, while its values at the indices that are divisible by three are equal\n to the values of the corresponding indices of l, but sorted.\n \"\"\"\n return [sorted(l[i:i+3]) if (i+1)%3 == 0 else l[i] for i in range(len(l))]\n\n", "raw_completion": "```python\ndef sort_third(l: list):\n \"\"\"\n This function takes a list l and returns a list l' such that\n l' is identical to l in the indices that are not divisible by three, while its values at the indices that are divisible by three are equal\n to the values of the corresponding indices of l, but sorted.\n \"\"\"\n return [sorted(l[i:i+3]) if (i+1)%3 == 0 else l[i] for i in range(len(l))]\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef sort_third(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal\n to the values of the corresponding indicies of l, but sorted.\n >>> sort_third([1, 2, 3])\n [1, 2, 3]\n >>> sort_third([5, 6, 3, 4, 8, 9, 2])\n [2, 6, 3, 4, 8, 9, 5]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/34", "prompt": "\n\ndef unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"\n", "entry_point": "unique", "canonical_solution": "\n return sorted(set(l))\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[5, 3, 5, 2, 3, 3, 9, 0, 123]]], "atol": 0, "plus_input": [[[1, 1, 1, 1]], [[2, 1, 2, 1]], [[0, 0, 0, 0]], [[-1, 5, -1, 3, 5, 2, 5]], [["a", "b", "b", "c", "d", "d"]], [[1.1, 2.2, 3.3, 4.4, 4.4]], [[true, false, false, true]], [[]], [[2, 2, 2, 2, 2, 2]], [["apple", "banana", "orange"]], [[true]], [[2, 1, 2, 1, 1, 1]], [["apple", "banana", "d", "orange"]], [["apple", "banana", "lQd", "orange"]], [["apple", "banana", "olQdrange"]], [[false, true, false, false, true, false]], [["apple", "d", "orange"]], [[2, 1, 1, 1]], [[false, false, false, true, true]], [[2, 2, 5, 2, 2, 2]], [[1, 1, 1]], [[2, 1, 1, 1, 1]], [[3.0219968583931567, 1.1, 2.2, 4.4, 4.4]], [[2, 2, 5, 2, 2, 2, 2, 2]], [[2, 1, 2, 1, 1, 3, 1]], [[-1, 1]], [[1.1, 2.2, 3.3, 4.4, 4.4, 2.2]], [[1.1, 3.187467502157803, 3.3, 4.4, 4.4]], [[1, 2, 1, 1]], [[1.1, 2.2, 3.3, 4.4, 4.4, 2.2, 1.1]], [[2, 1, 2, 1, 1, 1, 1]], [[1.1, 2.2, 3.3, 4.4, 4.4, 4.4]], [["apple", "d", "orange", "d"]], [[2, 1, 2, 1, 1, 1, 2, 1]], [["apple", "banana", "lQd", "oralQdnge"]], [["apple", "banana", "lQd", "llQd", "orange"]], [[2, 1, 1, 1, 2, 1]], [[true, false, false, true, false]], [[3.0219968583931567, 1.1, 2.2, 2.2, 4.4, 4.4, 3.0219968583931567, 2.2]], [["alQd", "dapple", "banana", "oralQdnge"]], [[true, true, false, false, true, true]], [[2, 1, 1, 2, 1, 1]], [[3, 1, 1, 1]], [["apple", "banana", "orange", "banana"]], [[1, 1, 1, 2, 1, 1]], [[true, false, true, true, true]], [[3.0219968583931567, 1.1, 2.2, 4.4]], [[2, 1, 1, 1, 1, 2, 1]], [[3.4145447979043606, 1.5142493540603779, 1.1, 2.2, 2.2, 4.4, 4.4, 3.0219968583931567, 2.2]], [[2, 1, 1]], [[2, 1, 1, 1, 0, 2, 1, 1]], [["alQd", "dapple", "banana", "aQd", "oralQdnge"]], [[2, 1, 1, 1, 1, 1]], [["a", "b", "b", "c", "dd", "d"]], [[3.0219968583931567, 1.1, 4.4, 4.4, 1.1]], [["apple", "nbanana", "lQd", "oralQdnge"]], [["a", "banana", "b", "b", "c", "dd", "d"]], [["apple", "banana", "lQd", "oralQdnge", "oralQdnge"]], [[false, true, false, false, true, true]], [["apple", "banana", "orangce", "banana"]], [[2, 1, 1, 2, 1, 1, 1]], [["orappleange", "apple", "banana", "lQd", "llQd", "orange", "banana", "banana"]], [[1.1, 2.2, 1.5142493540603779, 4.4, 2.2, 1.1]], [[1.1, 2.2, 3.3, 4.4, 4.4, 1.1]], [["adapplelQd", "dapple", "dapple", "banana", "aQd", "oralQdnge"]], [[-1, 1, 2, 1, 1]], [[1, 0, 1, 1]], [[false, false, true, true]], [[3, 1, 2, 1, 1, 3, 2]], [[false, false, true, false, false, true, true]], [["banana", "olQdrange"]], [["apple", "banana", "banaorangcena", "d", "orange"]], [[1.1, 2.2, 4.4, 4.4, 4.4]], [[2, -1, 5, 2, 2, 2, 2]], [[3, 1, 1]], [["orappleange", "apple", "banana", "lQd", "llQd", "orange", "banaorangcena", "banana", "banana"]], [["apple", "orange"]], [[3.0219968583931567, 1.1, 2.2, 4.4, 4.4, 3.0219968583931567, 2.2]], [["apple", "d", "orange", "appple", "d"]], [[2, 1, 2, 1, 1]], [[true, true, false, true, true, true, true]], [[2, 5, 2, 2, 2]], [[2, 2, 2, 2, 2]], [["orappleange", "apple", "banana", "lQd", "llQd", "orange", "banana"]], [[0, 1, 1]], [[false, false, true, false, false, true, true, true, true]], [["adapplelQd", "dapple", "davcvAoc", "banana", "aQd", "oralQdnge"]], [[-2, -5, 5, 0, -84, 2, -19]], [[2, 1, 2, 1, 1, -19, 1, 2, 1]], [["apple", "banana", "alpple", "lQd", "oralQdngee"]], [["banana", "orangce", "banana", "banana", "banana"]], [["apple", "orange", "orange"]], [["apple", "banana", "banaorangcena", "d"]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 123, -1]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g", "h"]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [["e", "h", "", "e", "b", "pExeV", "j"]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 1, 2, 1, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[1.2, 3, 2.1, 5, 3, 123, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -4]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 9]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[-1, -2, -3, -3, -4, -4, -5, -4, -6, -1, -2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, 2, -999999999999999999999999999999999, -5555555555555555555555, 9]], [["e", "h", "", "e", "b", "pExeV", "j", "e"]], [[-1, -2, -3, -4, -4, -4, -5, -6, -2]], [[999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[1, -2, 0, 1.0, -1.0, 6, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, -5555555555555555555555, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[6, 999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [[5555555555555555555555, 1, 0, 0, -1, -5555555555555555555555, -5555555555555555555555]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g"]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 7]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 9, 10, 7]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 9, 10, 5, 7, 2, 8]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 7]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [["e", "jc", "h", "", "e", "b", "pExeV", "j"]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, -6, 9, 9, 9, 10, 7]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 9]], [[1, 1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 0, -999999999999999999999999999999999, -1, -5555555555555555555555, -5555555555555555555555, 0]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, 3, 9, 0, 123, -1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554]], [[999999999999999999999999999999999, 5555555555555555555555, 1, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555555, 0, 123, -1]], [[5555555555555555555555, 0, 5555555555555555555555, 2, -999999999999999999999999999999999, -5555555555555555555555, 9]], [["e", "ECshjYINy", "h", "", "e", "b", "pExeV", "e"]], [[3, 2.1, 5, 3, 5, 1, 2, 3, 3, 9, 0, 123, -1]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9, 7]], [[1, -2, 0, 1.0, -1.0, 6, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555555, 0, 123, 4, -1]], [["h", "h", "", "e", "b", "pExeV", "j", "e"]], [[1, 1, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 56.54080059170911, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 4, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555, 0]], [[1, 2, 2, 3, 4, 4, 4, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10]], [[1.2, -1, 4, 2.1, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555555, 0, 123, 4, -1]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 8, 9, 0, 9, 10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 2, -999999999999999999999999999999999, -5555555555555555555555, 9, 0]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 1]], [[-1, -2, 10, -3, -4, -4, -4, -5, -6, -4, -6]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[1, 2, 2, 3, 4, 4, 5, 6, 7]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "b", "d", "e", "", "e", "f", "f", "f", "g", "g", "g"]], [["e", "ECshjYINy", "h", "", "e", "b", "pExeV"]], [[-1, -2, -3, -3, -4, -4, -5]], [[1.2, 3, 2.1, 3, 5, 123, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 2]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -1, -3, -2]], [[-1, -2, 7, 10, -3, -4, -4, -4, -5, -6, -4, -6]], [["e", "", "e", "b", "pExeV"]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3]], [[-1, -2, -3, -3, -3, -4, -4, -5]], [[999999999999999999999999999999999, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555]], [[1, 1, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10]], [[7, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 6, 8, 8, 9, 9, 9, 10, 9]], [[123, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555]], [[1.2, 3, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555555, 0, 123, 4, -1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 56.54080059170911, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0]], [["e", "h", "", "b", "pExeV", "j"]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, 7, 7, 7, 8, -4, 8, 8, 9, 3, 9, 9, 10, 9]], [[1, 2, 3, -999999999999999999999999999999999, 4, 4, 5, 6, 7, 7, 7, 8, -4, 6, 8, 8, 9, 9, 9, 10, 9]], [[1, 2, 2, 3, 4, 4, 5, 6, 9, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 56.54080059170911, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0]], [[-1, -2, 7, 10, -3, -4, -4, -4, -5, -6, -5555555555555555555554, -6]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[79.99554601308219, 1.0, 67.273871303927, -37.870125015714585, 42.7293925790639]], [[-1, -2, -3, -3, -4, -4, -4, -5, -3, -6]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -5555555555555555555556, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[2, 2, 3, 4, 6, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 1, 0, 1.0, 1, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555, 2, -999999999999999999999999999999999, -5555555555555555555555, 9]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -6, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, 2, 1, 3, 4, 5, 6, 7]], [[-1, -2, 7, -3, -4, -4, -4, -5, -6, -4, -6]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 10, 5, 7, 2, 8]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2]], [[5555555555555555555555, 1, 0, 0, -1, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555]], [[999999999999999999999999999999999, 5555555555555555555556, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[1, -1, 1, 0, -1.0, 0.0, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, 5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999]], [["e", "jc", "h", "", "e", "b", "j"]], [[-1, -2, 7, 10, -3, -4, -4, -4, -5, -6, -5555555555555555555554, -6, -6]], [[-1, -2, 10, -3, -4, -4, -4, -5, -6, -5555555555555555555554, -6, 8]], [[1, 2, 1, 2, 1, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[1, 2, 1, 1, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[2, 2, 3, 4, 6, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9]], [[1, 1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1e-05]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 2, -999999999999999999999999999999999, -5555555555555555555555, 9, -1]], [[1, 2, 2, 3, 4, 4, 4, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 9]], [[1, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 7, 10]], [["e", "h", "", "e", "pExeV", "j", "e", "pExeV"]], [[1.2, 3, 5, 3, 5, 1, 2, 4, 3, 3, -5555555555555555555555, 0, 123, 4, -1]], [[1.2, 3, 2.1, 3, 5, 123, 2, -5555555555555555555556, 3, 3, 9, 0, 123, -1, 2.1, 3.0, 9.9, 0.1, 123.0, 2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555, 5555555555555555555555]], [[1, 2, -5, 1, 0, -1.0, 0.0, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 9, 2, 2, 3, 4, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 123, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, -8.994991491430363e-11, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 9, 0, 9, 10]], [[7, 10, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 1.0, 0.1, 0.3, 123.0]], [[7, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7]], [[-999999999999999999999999999999999, -1, -2, -3, -4, -4, -4, -5, -4, -6, -2]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 5]], [[1, -1, 1, 0, -1.0, 0.3, -8.994991491430363e-11, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0]], [[1, -1, 1, 0, -1.0, 0.3, -8.994991491430363e-11, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -37.870125015714585, -0.3091755696233933, 1.0, -1.0]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[7, 1, 2, 2, 3, 4, 5, 6, 7, 7]], [[-1, -2, 10, -3, -4, -4, -4, -5, -6, -4, -6, -4]], [[5555555555555555555555, 1, 0, 0, -1, 7, -5555555555555555555555]], [[1, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 6, 8, 8, 9, 9, 9, 10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 7, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [[1.2, 3, 2.1, 5, 3, 5, 2, 4, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 1.0, 0.1, 0.3, 123.0, 3]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, 7, 7, 7, 8, -5, 8, 8, 9, 9, 9, 10, 9]], [[-1, -2, -3, -3, -4, -4, -4, -5, -3]], [[999999999999999999999999999999999, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, 8]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5, -999999999999999999999999999999999]], [[2, 1, 2, 2, 3, 4, 4, 4, 5, 6, 2, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9, 9]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 7, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 2, -2]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, 7, 7, 7, 10, 8, -4, 8, 8, 9, 9, 9, 10, 9]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -5555555555555555555556, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555, 5555555555555555555555]], [[3, 2.1, 5, 3, 5, 1, 2, 3, 3, 9, 0, 123, -1, 3]], [[1.2, 3, 5, 3, 1, 2, 4, 3, 3, -5555555555555555555555, 0, 123, 5, -1]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 42.7293925790639, 1, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, 8, -999999999999999999999999999999999]], [[6, 6, 999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [[7, 10, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 8, 9, 1, 9, 10]], [["", "e", "b", "pExeV"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -3, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 1, 0, 1.0, 1, -1.0, 0.0, 0.0, 0.3288249897444142, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10, 1.0]], [[1, -1, 1, 0, -1.0, -999999999999999999999999999999999, 0.3, -8.994991491430363e-11, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0]], [["e", "h", "", "e", "b", "j", "e"]], [[999999999999999999999999999999999, 3, 0, -5555555555555555555556, -999999999999999999999999999999999, -5555555555555555555555, 8, 6]], [[-1, -2, -3, -4, -5, -4, -5, -3, -6]], [["e", "h", "", "ff", "b", "pExeV", "j"]], [[-1, -2, 5555555555555555555554, -3, -4, -5]], [[1, 2, -5, 1, 0, -1.0, 0.0, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0, 10000000000.0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555]], [["", "jc", "h", "", "b", "pExeV", "j"]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 3.0]], [[79.99554601308219, 1.0, 67.273871303927, 42.7293925790639]], [[7, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7]], [[1.2, 3, 2.1, 5, 3, 5, 2, -5555555555555555555556, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [["", "h", "", "b", "pExeV", "j"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 123, -999999999999999999999999999999999, 7, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5, 3, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 1, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554]], [[1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 4, 3, 4, 3, 5, 3, 4, 2]], [[1.2, 3, 2.1, 5, 3, 5, 2, 4, -6, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 1.0, 0.1, 0.3, 123.0, 3]], [[123, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 123, 5555555555555555555554, -1]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 6, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 2, 1, 2, 1, 2, 9, 2, 5555555555555555555554, 4, 3, 3, 3, 4, 3, 4, 3, 2]], [[1, 2, 3, 4, 4, 6, 7, 7, 7, 8, -4, 6, 8, 8, 9, 9, 9, 10]], [[1, 1, 0, 0.3, 1.0, 1, -1.0, 0.0, 0.17546866697957042, 0.3288249897444142, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10, 1.0]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-10, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0, 10000000000.0, 1e-10]], [[1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 2, 4, 3, 4, 3, 5, 3, 4, 2]], [[5555555555555555555555, 0, 2, -999999999999999999999999999999999, -5555555555555555555555, 9]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 9, 10, -5555555555555555555555, 7]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-10, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0, 10000000000.0, 1e-10, 1e-10]], [[1, -1, 0, 0, 1.0, -1.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[1.2, 3, 2.1, -5, 5, 1, 2, 3, 3, 9, 0, 123, -1]], [[5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5, 3, -999999999999999999999999999999999]], [[1.2, 3, 2.1, 3, 5, 1, 2, 3, -5555555555555555555555, 0, 123, 4, -1, 3]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 3.0, 3]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 56.54080059170911, 1.2, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0]], [[-1, -2, -3, -3, -4, -4, -5, -3]], [[1, 2, -5, 1, 0, 0.0, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0, 10000000000.0]], [[5555555555555555555555, 1, 0, 0, -5555555555555555555555, -5555555555555555555556, -5555555555555555555555]], [[-66.10046531531907, 0.1, 3.0, 0.1, -71.3414441891051, -90.7188481644048]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -999999999999999999999999999999999, -1000000000000000000000000000000000, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 2, 0, 1, 2, 0, 1, 2, 1, 2, 3, 4, 4, 3, 4, 3, 4]], [[7, 10, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 0]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "d", "e", "", "e", "e", "f", "f", "f", "g", "g", "g", "e"]], [[1, 2, 1, 2, 1, 5, 3, 1, 2, 1, 2, 2, 4, 3, 4, 3, 5, 3, 4, 2]], [[1, 1, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 56.54080059170911, 9278210287.241545, -10000000000.0, 1e-10, -1e-10, -1.0, 0.0]], [[1, 2, 2, 3, 4, 4, 5, 6, -1, 7, 7, 8, 8, 8, 6, 9, 9, 10, 5, 7, 2, 8]], [[1.2, 3, 2.1, 5, 3, 5, 2, 4, 3, 9, -4, 1, 123, -1, 2.1, 2.1, 3.0, 1.0, 0.1, 0.3, 123.0, -999999999999999999999999999999999]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -12314420669.112356, 1e-10, -1e-10]], [["e", "ECshjYINy", "h", "", "e", "b", "pExeV", "dddddd", "e", "e"]], [[1, 2, 2, 3, 4, 4, 4, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, -1, 9, 10, 7]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 1, 4]], [[1, 1, 0, 1.0, 1, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10, 10000000000.0]], [[6, 6, 999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 6]], [[1, 1, 0, 1.0, 1, -1.0, 0.0, 0.0, 0.3288249897444142, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10, 1.0, 1.0]], [["a", "b", "b", "h", "c", "ab", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 4]], [[-1, -2, 10, -3, -4, -4, -1, -5, -6, -4, -6, -4]], [[7, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -999999999999999999999999999999999, -1000000000000000000000000000000000, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1000000000000000000000000000000000, 5555555555555555555555]], [[-2, -2, -3, -3, -4, -4, -5, -3]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554, 5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 10]], [[1.2, 3, 2.1, 5, 3, 5, 2, -3, 3, 3, 9, 0, 123, -1]], [[1, 2, 1, 2, 1, 1, 2, 1, 2, 3, 3, 4, 3, 4, 2, 4, 3, 4, 2]], [[1, 2, 1, 1, 1, 2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [["t", "e", "ECshjYINy", "h", "", "e", "b", "pExeV", "dddddd", "e", "e"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999]], [[1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 2, 4, 3, 4, 5, 3, 4, 2]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -12314420669.112356, 10000000000.0, -1e-10]], [[-1, -2, -3, -3, -4, -4, -5, -6, -1]], [[-2, -2, -3, -3, -4, -4, -5, -3, -3]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 7, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 2, -2, 2]], [[1, 1, 0, 0.3, 1.0, 1, -1.0, 0.0, 0.17546866697957042, 0.3288249897444142, -1.2893213949526219, 1e-05, -10000000000.0, -1e-10, 1.0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, -5, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[-1, -2, -3, -3, -4, -4, -5, -6, -1, -1]], [[1, -1, 0, 0, 1.0, -1.0, -66.10046531531907, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -66.10046531531907, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -1000000000000000000000000000000000, -2]], [[-1, -2, -3, -4, -5, -4, -5, -7, -3, -6]], [[1.2, 3, 2.9580363044770213, 5, 3, 5, 2, 3, 3, 9, 0, 1, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 4, 3, 4, 2, 4, 3, 4, 2]], [[7, 10, -4, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1, -4]], [[-1, -2, 7, -3, -4, 1000000000000000000000000000000000, -4, -4, -5, -6, -4]], [[-2, -3, -3, -4, -4, -5]], [[-66.10046531531907, 0.1, 42.7293925790639, 3.0, 0.1, -72.21907533088742, -90.7188481644048]], [["e", "h", "", "pExeV", "j", "e"]], [[999999999999999999999999999999999, 3, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, 8, -999999999999999999999999999999999]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-10, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0, 10000000000.0, 1e-10, 1e-10, 1]], [[1, 2, 2, 3, 4, 5, 7]], [[999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, -1000000000000000000000000000000000, -2]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "b", "d", "e", "bdddddd", "e", "", "e", "", "f", "f", "f", "g", "g", "g"]], [[999999999999999999999999999999999, 5555555555555555555554, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[-1, -2, 2, 10, -3, -4, -4, -4, -5, -6, -5555555555555555555554, -6, 8]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -999999999999999999999999999999999]], [[1, 2, 3, 4, 4, 4, 5, 6, 7]], [[1, 2, 3, 4, 4, 4, 5, 6, 7, 1]], [[5555555555555555555555, 1, 0, 0, -1, -1, -5555555555555555555555, 1, -5555555555555555555555]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554, 5555555555555555555555, 0, 0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5]], [[999999999999999999999999999999999, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 3, -999999999999999999999999999999999, 4, 4, 5, 6, 7, 7, 7, 8, -4, 6, 8, 9, 9, 9, 10, 9]], [[1.2, -1, 3, 2.1, 5, 3, 5, 87.01359618153987, 2, 3, 3, -5555555555555555555555, 0, 123, -1, 2.1]], [["h", "h", "", "e", "b", "b", "pExeV", "j", "e"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -10000000000.0, 1e-10, -1e-10, -1.0]], [[-1, -2, 7, -3, -4, -4, -4, -5, -6, -4, -6, -4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[1, 1, 0, 1.0, -1.0, 0.0, -1.2893213949526219, 1e-05, -10000000000.0, -1e-10, 1.0, 1.0]], [[-58.88949054355421, 79.99554601308219, 1.0, 67.273871303927, 42.7293925790639]], [[-1, -2, 10, -4, -4, -4, -4, -5, -6, -5555555555555555555554, -6, 8]], [[-999999999999999999999999999999999, 999999999999999999999999999999999, 5555555555555555555556, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 2, 3, 4, 0, 4, 5, 6, 7, 6]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [["e", "ECshjYINy", "egddddd", "h", "", "e", "b", "pExeV", "dddddd", "e", "e"]], [[999999999999999999999999999999999, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, 5555555555555555555555, 5]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, 4, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, 8, -5555555555555555555555, -999999999999999999999999999999999, 5555555555555555555555]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, -5, 1, 0, 1.9483835605403843, 0.0, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0, 10000000000.0, -1.0]], [[7, 5555555555555555555555, 0, 5555555555555555555555, 2, -5555555555555555555555, -5555555555555555555555, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10, -1]], [[999999999999999999999999999999999, 5555555555555555555556, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 5555555555555555555556]], [[1, 2, 1, 2, 1, 5, -61, 3, 1, 2, 1, 2, 2, 4, 3, 4, 3, 5, 3, 4, 2]], [[1, 2, 1, 1, 1, 2, 2, 2, 3, 3, 4, 3, 4, 3, 4]], [[1, 2, 1, 1, 1, 2, 2, 2, 3, 4, 3, 4, 3, 4, 1, 3, 4]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 10, 5, 7, 2, 8, 4]], [[1.2, 3, 2.1, 5, 3, 5, 3, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 5, 5]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 1]], [[999999999999999999999999999999999, 5555555555555555555556, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 7, -5555555555555555555556, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, 2, -999999999999999999999999999999999, -999999999999999999999999999999999]], [[-66.10046531531907, 42.7293925790639, 3.0, 0.1, -72.21907533088742, -46.81086533024782, -90.7188481644048]], [[1.2, 3, 5, 3, 1.0, 5, 1, 2, 3, 3, 4, -5555555555555555555555, 0, 123, 4, -1]], [[999999999999999999999999999999999, 5555555555555555555556, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, 5555555555555555555554]], [[1, 2, 1, 2, 1, 1, 2, 1, -6, 3, 3, 4, 3, 4, 3, 4]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555556, 0, 123, -1, 5, 3]], [[1, 2, -5, 1, 0, 0.0, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0, 10000000000.0, 1.0]], [[1, 2, 3, 4, 4, 4, 6, 7, 7, 7, 8, 8, 9, 9, 10, 9]], [["e", "ECshjYINy", "h", "", "e", "b", "pExeV", "dddddd", "e", "e", "e"]], [[1, 2, 2, 3, 5, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 10, 5, 7, 2, 8]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 2, -999999999999999999999999999999999, -5555555555555555555555, 9, 0, 0]], [[-1, -2, -3, -3, -4, -5555555555555555555556, -4, -5, -3]], [[1, 2, 2, 3, 4, 4, -6, 6, 7, 7, 999999999999999999999999999999999, 7, 8, 8, 9, 9, 9, 10, 9]], [["a", "b", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "NECshjYINy", "g", "h"]], [[-37.870125015714585, 1.0, 67.273871303927, 42.7293925790639]], [[5555555555555555555555, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, 2, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 0]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, -0.3091755696233933, 3, -5555555555555555555555, 0, 123, -1, 2]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, -4, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 9]], [[-6, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 9, 0, 9, 10]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-10, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0, -4, 10000000000.0, 1e-10, 0.006947841568300186, 1e-10, 1]], [[1.2, 3, 2.1, 3, 5, 123, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 2, 9]], [[999999999999999999999999999999999, 5555555555555555555554, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999]], [[-2, 10, -4, -4, -4, -4, -5, -6, -5555555555555555555554, -6, 8]], [[-1, -2, -3, -3, -4, -7, -4, -5, -6, -1, -3, -2]], [[1.2, 3, 5, 3, 1, 2, 4, 3, 3, -5555555555555555555555, 0, 123, 5]], [[-2, -2, -3, -3, -4, -4, -3]], [[1.0]], [["h", "h", "gddddd", "e", "b", "pExeV", "j", "e"]], [["", "jc", "h", "", "b", "hdd", "j"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, 0, -999999999999999999999999999999999]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 0, 123, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0]], [[1, 2, 2, 3, 4, 4, 4, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10]], [[999999999999999999999999999999998, 3, 6, -5555555555555555555556, 8]], [[-1, -2, 5555555555555555555554, -3, -4, -5, -1]], [[-1, 0, 0, 1.0, -1.0, 1e-05, 1, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [[3, 2.1, 5, 3, 5, -61, 1, 2, 3, 3, 9, 0, -5555555555555555555554, 123, -1, 3, 3]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "b", "d", "e", "", "e", "f", "f", "f", "jc", "g", "g", "g"]], [[-1, -2, -3, -4, -5, -4, -5, -3, -6, -2]], [[3, 7, 1, 2, 2, 3, 4, 5, 7, 7]], [[1, 1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 87.01359618153987, 1e-10, -1e-10]], [[-1, -1, -3, -3, -5, -4, -5, -3, -1]], [[1, 1, 0, 1.3535014664074156e-05, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 10000000000.0, -10000000000.0, -1e-10, 0.0]], [[1, -2, 0, 0, 1.0, -1.0, 0.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0]], [["h", "h", "", "e", "b", "ejc", "b", "pExeV", "j", "e"]], [["e", "ECshjYINy", "tt", "", "e", "b", "pExeV", "e"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555554, -999999999999999999999999999999999, -1000000000000000000000000000000000, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 1000000000000000000000000000000000, 5555555555555555555555, -5555555555555555555555]], [[-1, -2, 7, -3, -4, -4, -4, -1, -4, -6, -4]], [[-1, -2, -6, -3, -3, -4, -4, -5, -3, -6, -1, -1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 2, -999999999999999999999999999999999, -5555555555555555555555, 9, -1, -999999999999999999999999999999999]], [["b", "b", "h", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "ggNEEeejce", "g", "g", "g"]], [[-2, -3, -4, -4, -5]], [[-1, -2, 10, -3, -4, -4, -4, -5, -6, -4, 123, -6]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -1000000000000000000000000000000000, 7, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 2, -2]], [["a", "b", "b", "h", "c", "c", "c", "d", "d", "b", "d", "e", "", "e", "f", "f", "f", "jc", "g", "g", "VGObmuVg"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, 5555555555555555555555, -999999999999999999999999999999999, 5, 5555555555555555555555]], [[1, 2, 3, 4, 4, 5, 6, -1, 7, 7, 8, 8, 8, 6, 9, 9, 10, 5, 7, 2, 8]], [[-1, -2, -3, -3, -4, -7, -4, -5, -6, -3, -1, -3, -2, -4]], [["a", "f", "b", "b", "h", "c", "c", "c", "d", "d", "b", "d", "e", "fff", "e", "", "e", "", "f", "f", "f", "g", "g", "g"]], [[1, 2, 2, 3, 4, 4, 5, 0, 6, -4, 7, 7, 8, -4, 8, 8, 9, 9, 9, 10, 9, 9]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 4, -0.3091755696233933, 3, -5555555555555555555555, 0, 123, -1, 2]], [["e", "jc", "h", "", "e", "b", "j", "e"]], [[1, 2, 3, 8, 4, 4, 5, 6, 7, 7, 7, 8, -4, 6, 8, 8, 9, 9, 9, 10, 9]], [[1, -1, 0, 0, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1.054925686181878e-10, -1]], [[999999999999999999999999999999999, 5555555555555555555556, 0, 1, -5555555555555555555555, -5555555555555555555555]], [[999999999999999999999999999999999, 3, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554]], [[2, 1, 2, 2, 4, 4, 4, 5, 6, 2, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9, 9]], [[-1, -2, -3, -3, -4, -4, -4, -5, -1, -3, -2]], [[999999999999999999999999999999999, 5555555555555555555554, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555, 5555555555555555555556]], [[1, -1, 0, 0, 1.0, 0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, -8.994991491430363e-11, 10000000000.0, -10000000000.0, 87.01359618153987, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555554, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555, 5555555555555555555556, 5555555555555555555556]], [[1.2, 3, 2.1, 5, 3, 5, 1, 2, 3, 3, -5555555555555555555555, 0, -1]], [[-6, 1, 2, 2, -5555555555555555555555, 3, 4, 4, 5, 6, 7, 7, 8, -4, 8, 9, -5555555555555555555556, 9, 10, 3]], [[999999999999999999999999999999999, 5555555555555555555556, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[1, 1, 0, 1.0, -3, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, 1e-10, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1.0, 10000000000.0, 1e-10, 9.63281881608511e-11, 1]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, 999999999999999999999999999999999, 8, -5555555555555555555555, 8, -999999999999999999999999999999999, 5555555555555555555555]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0]], [[2, 2, 3, 4, 6, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10]], [[-1, -2, -3, -3, -4, -4, -4, -5, -1, -2, -3]], [[-66.10046531531907, 0.1, 42.7293925790639, 3.0, 0.1, -72.21907533088742, -90.7188481644048, -66.10046531531907]], [[1, 2, 1, 1, 1, 2, 2, 2, 1, 3, 4, 3, 4, 3, 4, 1, 3, 4]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, -1e-10, 10000000000.0, -10000000000.0, 1e-10, -0.3091755696233933, 1.0, -1.0, 1e-10]], [[1.2, 3, 2.1, 3, 5, 123, 2, -5555555555555555555556, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 123.0, 2]], [[5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, 8, -5555555555555555555555, 8, -999999999999999999999999999999999, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 123, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [["nECshxpEddddddxdeVjYINy", "h", "", "e", "b", "pExeV", "j", "e"]], [[999999999999999999999999999999999, -1000000000000000000000000000000000, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -1000000000000000000000000000000000, 5, 3, -999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554, 5555555555555555555555, 999999999999999999999999999999999]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555555, -5555555555555555555555, 0, -999999999999999999999999999999999, 5]], [[1, -0.13236501764490655, -1, 0, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -12314420669.112356, 1e-10, -1e-10]], [[1, -1, 0, 9, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, -8.994991491430363e-11, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 3, 7, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -2]], [["e", "jc", "", "e", "b", "j"]], [[1, -2, -8932278951.378878, 1.0, -1.0, 6, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.956617, -10000000000.0, 1e-10, -1e-10]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, 10000000000.0, -10000000000.0, 0, 1e-10, -0.3091755696233933, 1.0, 1e-10]], [[1, 2, 1, 2, 9, 1, 2, 1, -6, 3, 3, 4, 3, 3, 4, 3]], [[7, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 2, 7, 2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -5555555555555555555554, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555]], [[1, -8932278951.378878, 1.0, -1.0, 6, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.956617, -10000000000.0, 1e-10, -1e-10]], [[-1, -2, -6, 10, -3, -4, -4, -5, -6, 8]], [[1, -8932278951.378878, 1.0, -1.0, 6, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.956617, -10000000000.0, -46.81086533024782, 1e-10, -1e-10]], [[1.0, 67.273871303927, 42.7293925790639]], [[1, 2, 2, 3, 4, 4, 4, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, -1, 10, 9, 10, 7]], [[999999999999999999999999999999999, -1000000000000000000000000000000000, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -1000000000000000000000000000000000, 5, -999999999999999999999999999999999]], [[1, 2, 2, 3, 4, 4, 5, 6, 9, 7, 7, 7, 8, -4, 8, 8, 9, 9, 10]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9]], [[-1, -2, -3, 0, -3, -4, -4, -4, -5, -1, -3, -2]], [["e", "h", "", "e", "b", "pExeV", "j", "e", "j"]], [[1.2, 3, 2.1, 5, 3, 123, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 3]], [["a", "b", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "NECshjYINy", "g", "h"]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555554, 5555555555555555555555, 999999999999999999999999999999999, -5555555555555555555554, -5555555555555555555554]], [[-1, -2, 10, -3, -4, -4, 8, -1, -5, -6, -4, -6, -4]], [[1, 2, 2, 3, -4, 4, 5, 6, 7, 7, -4, 8, 9, 0, 9, 10]], [[1.2, 3, 2.1, 3, 5, 123, 2, 3, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 2, 9, 2.1]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 9, 10, -5555555555555555555555, 7, 6]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 7]], [[1, 2, 2, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 6, 9, 9, 9, 10, -5555555555555555555555, 7, 6]], [[1, -0.13236501764490655, -1, 1000000000000000000000000000000000, 0, 1.0, -1.0, 0.0, 1e-05, 1e-05, 2.1, 10000000000.0, -12314420669.112356, 1e-10, -1e-10]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, 5555555555555555555555, 0]], [["ECshjYINy", "hh", "", "e", "b", "pExeV", "e", "e"]], [[1, -1, 1, 0, 1.0, -1.0, 0.0, 1e-05, 10000000000.0, -10000000000.0, 0, 1e-10, -0.3091755696233933, 1.0, 1e-10, 0]], [[-1, -2, 7, 10, -3, -4, -4, -4, -5, -6, -6, -3]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999, -999999999999999999999999999999999]], [["a", "b", "b", "h", "c", "a", "c", "d", "d", "b", "d", "e", "", "e", "f", "f", "f", "g", "g", "g"]], [[7, 2, 2, 3, 4, 5, 6, 7]], [["e", "kVdECshjyYINygDDtKkp", "ECshjYINy", "h", "", "e", "b", "pExeV"]], [[1, 2, 1, 1, 1, 2, 2, 2, 3, 3, 4, 3, 4, 4]], [[-1, -2, -6, -3, -3, -1, -4, -4, -5, -3, -6, -1, -1]], [[999999999999999999999999999999999, 5555555555555555555555, 5555555555555555555555, -5, -5555555555555555555554, -5555555555555555555555, -5555555555555555555555, -999999999999999999999999999999999, 5]], [[1, 2, 1, 2, 999999999999999999999999999999998, 1, 2, 1, 2, 3, 4, 3, 3, 4, 3, 4, 3]], [[1, 2, 2, 4, 4, 4, 5, 6, 7]], [[1, 1, 0, 1.3535014664074156e-05, 1.0, -1.0, 0.0, 0.0, -1.2893213949526219, 1e-05, -10000000000.0, -1e-10, 0.0]], [[2, 1, 1, 1, 2, 1, 2, 2, 4, 3, 4, 3, 5, 3, 4, 2]], [[1, 2, 1, 2, 9, 1, 2, -1, -6, 3, 3, 4, 3, 3, 4, 3]], [[1, 1, 2, 3, 4, 5]], [[1]], [[5, 5, 5, 5, 5, 5]], [[null, null, null, null]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -3]], [[1, 2, 2, 3, 4, 3, 4, 5, 6, 7]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -2, -3]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g", "h", "h"]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "gg", "e", "e", "e", "f", "f", "f", "g", "g", "g", "h", "h"]], [[1, 9, 3, 4, 4, 4, 5, 6, 7]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 9, 9, 10, 8, 6]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 4, 3, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 3, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, 10]], [[64, 8, -57, 66, 4, 9, 98, 28]], [[-1, -2, -3, -3, -4, -4, -4, -5, 4, -6, -3]], [[9.9, 1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, -4, 2, 3, 4, 3, 4, 5, 6, 7]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 3, 4, 3, 4, 3, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 3, 3]], [[1, 2, 0, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6]], [[1, 2, 2, 2, 4, 3, 4, 5, 6, 7]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 9, 9, 10, 8, 6]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[-1, -2, -3, 65, -4, -4, -4, -5, 4, -6, -3]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -2, 0, -3, -1]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 28, 4, 0, 3, 4, 3, 4, 2, 2]], [[1, 98, 2, 2, 3, 4, 4, 4, -3, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 98, 2, 2, 3, 4, 4, 4, -3, 5, 6, 7, 7, 7, 5, 8, 8, 9, 9, 9, 9]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[-1, 9, -2, -3, -3, -4, -4, -5, -4, -5, -6]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, -5555555555555555555555]], [[1, 2, 1, 2, 28, 1, 1, 2, 4, 3, 4, 4, 3, 4, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 4, 4]], [[-1, -2, -3, -3, -4, -4, -4, -6, -2, 0, -3, -1]], [[-1, -2, -3, -3, -999999999999999999999999999999998, -4, -4, -4, -5, -6, -2, 0, -3, -1]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[-1, -2, -3, -3, -4, -4, -4, -4, 4, -6, -3]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[1, 9, 123, 4, 4, 4, 5, 6, 7]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4, 1]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4, 1, 3]], [[-5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555]], [[1, -1, 0, 1.0, -1.0, 0.0, -1.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 1, 2, 28, 1, 1, 2, 4, 3, 4, 4, 4, 3, 4, 4]], [[5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[5555555555555555555555, 3, -999999999999999999999999999999999, -5555555555555555555555, 0]], [[1, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, 9, 123, 2, 4, 4, 4, 5, 6, 7]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4]], [[1, 1, 2, 1, 2, 1, 2, 3, 5555555555555555555555, 4, 3, 4, 3, 4, 3, 4]], [[-2, -3, -3, 65, -4, -4, -5, -6, -2]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, -10000000000.0, 1e-10, 0.6615193392842611, -1e-10]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10]], [[1, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, 999999999999999999999999999999998, -5555555555555555555555, -5555555555555555555555]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9]], [[1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 2, 4, 3, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, -6, 10]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555554, 0, -5555555555555555555555, 999999999999999999999999999999999]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g", "aa"]], [[-4, 65, 0, -2, -3, -3, -4, -4, -4, -4, 4, -6, -3, -4]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555554, 0, 999999999999999999999999999999999, 0]], [[999999999999999999999999999999999, 3, 4, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1]], [[999999999999999999999999999999999, 3, -2, 4, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[1, 0, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 4, 0, 3, 4, 3, 4, 4]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 0.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[-999999999999999999999999999999998, 1, 9, 3, 4, 4, 4, 5, 6, 7]], [[5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, 5555555555555555555555, 5555555555555555555555]], [[-5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, 999999999999999999999999999999999, 0]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 3, 4, 3, 4, 1, 3, 4]], [[1, 9, 123, 2, 4, 4, 5, 6, 7]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 999999999999999999999999999999999, 0]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4, 2]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 2, 4, 3, 4, 2, 3]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, -4, 4, 0, 3, 4, 3, 4, 2, 4]], [[4, 2, 1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 0, 3, 4, 3, 4, 2, 4, 2]], [[-1, -5555555555555555555555, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 3, 3, 3]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10, 1]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 4, 3, 4, 3, 123, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 4, 8, 8, 9, 9, 9, 10, 8, 6]], [[-1, -2, -3, -3, -4, -4, -4, -5, 4, -6, 0]], [[1, -2, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 2, 9, 9, 1, 8, 6]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 1, 8, 6]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 4, 4, 0, 3, 4, 2]], [[1, -1, 0, 1.0, -1.0, 0.0, -1.0, -10000000000.0, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, 3, 4, 2]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 4, 5, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 2, 2, 3, -6, 9, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 9, 9, 10, 8, 6, -1]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 3, -4, 4, 0, 3, 4, 3, 4, 2, 4]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, 0, 0]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 2, 4, 3, 4, 2, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, -6, 10, 4]], [[1, 2, -4, 2, 3, 6, 4, 3, 1, 4, 5, 6, 7]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 3, 3, 4, 1, 3, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, 3, 9, 9, 4]], [[1, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 5, 7, 7, 4, 7, 8, 8, 8, 9, 3, 9, 9, 4]], [[3, -999999999999999999999999999999999, -5555555555555555555555, 0]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 4, 3, 4, 3, 4]], [[1, 9, 123, 2, 4, 4, 4, 5, 6]], [[-1, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 0, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 2, 4, 3, 4, 2, 2]], [[-1, -2, -3, -3, -4, -4, -5, -6, -3, -3]], [[1, 2, -4, 2, 3, 6, 4, 3, 1, 4, 5, 6, 7, 7]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 4, 3, 4]], [[1, 2, 2, 3, 4, 4, 3, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, -6, 10, 4]], [[999999999999999999999999999999999, 3, 65, -2, 4, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, -1, 4, 4, 0, 3, 4]], [[-1, 9, -2, -3, -3, -4, -4, -4, -5, -4, -5, -6]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6, 2]], [[3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, 65, -5555555555555555555555]], [[1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[-1, -5555555555555555555555, 1, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 9, 2, 9, 9, 3, 8, 6]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 3, 2]], [[64, 8, -57, 66, 4, 9, 28]], [[64, 8, -57, 66, 4, -3, 28, 66]], [[-1, -5555555555555555555555, -5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555]], [[10, 1, 2, 2, 3, 4, 4, 4, 5, 7, 7, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1]], [[1, 98, 4, 2, 3, 4, 4, 4, 5, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 9]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 2, 4, 3, 4, 2, 3, 1]], [[5555555555555555555555, 0, 0, -999999999999999999999999999999999, -5555555555555555555555, 0]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4, 3]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, 999999999999999999999999999999999, 0, 999999999999999999999999999999999]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 4, 3, 4, 1]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555554, -1, 999999999999999999999999999999999, 0]], [[-5555555555555555555555, 5555555555555555555555, 0, 999999999999999999999999999999999, 0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, 5555555555555555555555]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 3]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, -4, 4, 0, 3, 4, 3, 4, 2, 4, 1]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 4, 4, 3, 4, 3, 4, 2]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -2, 0, -1]], [[1, 2, 1, -6, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 4, 4]], [[1, 2, 0, 2, 65, -999999999999999999999999999999999, 1, 3, 2, 4, 3, 4, 3, 123, 4, 2]], [[1, 2, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 1, 9, 4, 4, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10]], [[1, 9, 123, 4, 4, 5, 6, 7]], [[1, 2, 0, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 2, 4, 3, 4, 2, 2, 2]], [[1, 2, 8, 3, 4, 4, 4, 5, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10]], [[1, -2, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[9.9, -1, 0, 1.0, 0.0, 0.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 3, 4, 1]], [[999999999999999999999999999999999, 5555555555555555555555, -5, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, 65, 5555555555555555555555, -5555555555555555555555]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 2, 3, 4, 4, 3, 4, 3, 4, 3, 1]], [[3, 3, -999999999999999999999999999999999, -5555555555555555555555, 5555555555555555555554, 0]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, 999999999999999999999999999999998, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555]], [["a", "b", "b", "c", "c", "c", "d", "d", "gg", "e", "e", "e", "f", "f", "f", "g", "g", "g", "h", "h"]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, -6, 3, 4, 3, 4, 4, 3, 4]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10, 5]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 6, 3, 4, 5, 2, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, -4, 3, 3]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, -3, -6]], [[1, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, -4, 4, 3, 4]], [[-5555555555555555555555, 5555555555555555555555, 1000000000000000000000000000000000, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[-1, -2, -3, -3, -999999999999999999999999999999998, -4, -4, -4, -5, -6, -2, -3, -1]], [[999999999999999999999999999999999, 5555555555555555555554, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1, 2]], [[66, 1, 2, 2, 3, 4, 4, 4, 5, 5, 7, 7, 4, 7, 8, 8, 8, 9, 1000000000000000000000000000000000, 3, 9, 9, 4]], [[40.93744393654052, 0.1, 9.9, -60.38789960708315, -1.0]], [[1, 9, 123, 2, 4, 7, 4, 4, 4, 5, 6, 7]], [[1, 2, -5555555555555555555555, 2, 3, 4, 4, 4, 5, 6, 7]], [[-1, -5555555555555555555555, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555, -1]], [[1, 2, -4, 2, 3, 6, 4, 3, 1, 4, 5, 6, 7, 7, 3]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1, 9]], [[-2, -3, -3, 65, -4, -4, -6, -2]], [[5555555555555555555555, 0, -999999999999999999999999999999999, 65]], [[1, -3, 2, 3, 4, 3, 4, 5, 6, 7]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 2]], [[-1, -2, -3, -3, -4, -4, -5, -6, -3, -3, -3]], [[1, 2, 1, 2, 0, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 4, 3, 4, 3, 4]], [[1, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 3, 4, 1]], [[-5555555555555555555555, -999999999999999999999999999999998, 999999999999999999999999999999999, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[-1, -2, 5555555555555555555555, -3, -3, -4, 10, -4, -5, -6, -3, -3, -2]], [[-1, -2, -3, -4, -3, -4, -4, -4, -4, -5, -6, -2, -3]], [[4, 2, 1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 3, 4, -999999999999999999999999999999999]], [[1, 2, 2, 3, 1, 9, 4, 4, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 8]], [[-1, -2, -3, -3, -2, -4, -4, -5, -6, -3, -3, -3]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6, 2, 9]], [[999999999999999999999999999999999, 3, 65, 4, -2, 4, 2, 1, 2, 1, -999999999999999999999999999999999, 2, 4, 3, -1, 4, 4, 0, 3, 4]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 2, -5555555555555555555555]], [[-2, -2, -3, -5, -3, -4, -4, -4, -5, -6, -2, -3]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 10, 2, -5555555555555555555555]], [[1, 2, 2, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, -10000000000.0, 1e-10, 0.6615193392842611, -1e-10]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 9, 9, 10, 8, 6, 2, 9]], [[0, -5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 999999999999999999999999999999999, -1]], [[1, 2, 1, 2, 1, 2, 1, 3, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, -4, 4, 0, 3, 4, 3, 4, 2, 9, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, -5555555555555555555555, 7, 7, 4, 7, 8, 8, 8, 9, 3, 9, 9, 5, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 2, 3, 4, 4, 0, 3, 4, 1, 3]], [[1, 98, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10]], [[1, 2, 2, 3, 4, 4, 3, 4, 5, 6, 7, 7, 4, 8, 7, 8, 8, 8, 9, 9, -6, 10, 4, -6]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 8, 4, 4, 4, 5, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6]], [[1, 2, -4, 2, 3, 6, 4, 3, 64, 1, 4, 5, 7, 6, 3]], [[1, 9, 123, 4, 4, 4, 5, 6, 7, 1]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 3, -4, 3, 3]], [[64, 8, -57, 66, 4, 9, 98, 28, 98]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1]], [[-1, -2, -3, -3, -4, -3, -4, -4, -5, -6, -3]], [[-1, -2, -3, -3, -4, -4, -4, -5, -6, 999999999999999999999999999999998, -3]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 66, 4, 0, -5555555555555555555555, 4, 10, 2, -5555555555555555555555]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 0, 3, 4, 3, 4, 2, 4, 2, 2]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 4, 4, 3, 4, 3, 4, 2, 2]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555554, 0, -5555555555555555555555, 999999999999999999999999999999999, -5555555555555555555555]], [[-1, -2, -3, -3, -999999999999999999999999999999998, -4, -4, -4, -5, -6, -2, -1]], [[-5555555555555555555555, 5555555555555555555554, -5555555555555555555555, 9, 999999999999999999999999999999999]], [[-4, 65, 0, -3, -3, -3, -4, -4, -4, -4, 4, -6, -3, -4]], [[1, 2, 2, 3, 4, 4, -6, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 6, 3, 4]], [[-1, -2, -3, -3, -2, -4, -6, -6, -3, -3, -3]], [[1, 3, 2, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 0, 123, -1, 2.1, 1e-05, 2.1, 3.0, 9.9, 0.3, 123.0]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 66, 4, 0, -5555555555555555555555, 4, 10, 2, -5555555555555555555555, 4]], [[0, -2, -3, -3, -4, -4, -4, -5, -6, -2, 0, -1]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 2]], [[1, 2, 8, -3, 3, 4, 4, 4, 5, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10, 8]], [[2, 1, 2, 1, 98, 2, 1, 3, 2, 3, 4, 3, 4, 0, 3, 4, 3, 4, 2, 4, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 1000000000000000000000000000000000, 9, 9, -6, 10, 4]], [[1, -999999999999999999999999999999999, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 4, 4, 3, 4, 3, 4, 2]], [[1, 9, 123, 2, 4, 4, 5, 6, 7, 4]], [[-1, -2, -3, -3, -4, -4, -4, -4, -5, -6, -3]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 2, -5555555555555555555555, 999999999999999999999999999999999]], [[-1, -2, -3, 7, -3, -4, -4, 65, -5, -6, -2, 0, -3, -1, -1]], [[-5555555555555555555555, 2, 1000000000000000000000000000000000, 0, -999999999999999999999999999999999, -5555555555555555555555]], [[-5555555555555555555555, 1, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555, -5555555555555555555555]], [[-1, -2, -3, -4, -4, -4, -5, 1, -6, 999999999999999999999999999999998, -3, 999999999999999999999999999999998]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 4, 0, 3, 4, 2, 3, 4, 2, 4]], [[2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 3, 123, 4, 2, 2, 2]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10, 5]], [[999999999999999999999999999999999, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, 65, -5555555555555555555555]], [[-4, 65, -5, 0, -2, -3, -3, -4, -4, -4, -4, 4, -6, -3, -4]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 5, -4, 4, 0, 3, 4, 3, 4, 2, 4]], [[10, 1, 2, 2, 3, 4, 4, 4, 5, 7, 7, 7, 8, 8, 8, 9, 9, -6, 10, 6, 1, -6]], [[1, 3, 2, 1, 5, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4]], [[1, 2, 1, 2, 1, 2, 2, 1, 2, 3, 4, 3, 4, 4, 3, 4, 1]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6, 9]], [[1.2, 3, 2.1, -1, 3, 5, 2, 3, 3, 9, 0, 123, -1]], [[9, 1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 4, 4, 3, 4, 3, 4, 2]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 1000000000000000000000000000000000, 4, 3, 4, 3, 4, 3]], [[66, 1, 2, 2, 3, 4, 4, 5, 5, 7, 7, 4, 7, 8, 8, 8, 98, 1000000000000000000000000000000000, 3, 9, 9, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 7, -1, 8, 8, 9, 2, 9, 9, 3, 8, 6]], [[1.0482573026378013, 3, 2.1, 5, 3, 5, 66.45989172921813, 2, 3, 3, 9, 0, 123, -1, 2.1, 1e-05, 2.1, 3.0, 9.9, 0.3, 123.0]], [[-1, 65, -5, 0, -2, -3, -3, -4, -4, -4, -4, 4, -6, -3, -4]], [[999999999999999999999999999999999, 3, 65, -2, 4, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 4, 8, 9, 2, 9, 9, 10, 8, 6, 2, 9]], [[1000000000000000000000000000000000, 999999999999999999999999999999999, 5555555555555555555554, 0, -5555555555555555555555, 999999999999999999999999999999999]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1e-05, -10000000000.0, 1e-10, 0.6615193392842611, -1e-10, 1e-10]], [[1, 5555555555555555555555, -5, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, 64, 5555555555555555555555, -5555555555555555555555]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "e", "e", "e", "f", "f", "f", "g", "g", "g", "h", "h", "f"]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 5, 3, 9, 0, 123, -1, 2.1, 2.1, 3.0, 9.9, 0.1, 0.3, 123.0, 0.1]], [[1, -999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 9, 9, -6, 10, 4]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 66, 4, 0, -5555555555555555555555, 4, 999999999999999999999999999999998, 10, 2, -5555555555555555555555, 4]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555, 5555555555555555555555]], [[-1, 9, -6, -2, -3, -3, -4, -4, -4, -5, -4, -5, -6]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 999999999999999999999999999999999, 4, 2, -5555555555555555555555, 999999999999999999999999999999999]], [[-1, -3, -3, -4, -4, -4, -5, -6, -3, -6]], [[1, 2, 2, 3, 4, 8, 3, 4, 5, 6, 7, 7, 4, 8, 7, 8, 8, 8, 9, 9, -6, 10, 4, -6]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 0, 1, 3, 2, 3, 4, 3, 4, 3, 4, 3, 10, 4, 2]], [[-5555555555555555555555, -999999999999999999999999999999998, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555, -5555555555555555555555]], [[-5555555555555555555555, -999999999999999999999999999999998, 5555555555555555555555, -999999999999999999999999999999999, 3, -5555555555555555555555]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, -1, 8, 8, 8, 9, 2, 9, 9, 1, 8, 6, 5]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 9, 10, 6, 2]], [[1, 98, 2, 2, 3, 4, 4, 5, 6, 7, 7, 7, 8, -3, 8, 9, 9, 9, 10, 9]], [[1, 9, 3, 4, 4, 4, 5, 0, 6, 7]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10, 8]], [[1, 2, 8, 3, 4, 4, 4, 5, 7, 7, 4, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10]], [[1, 2, 0, 2, 0, 0, 1, 3, 2, 3, 4, 3, 4, 3, 4, 3, 10, 4, 2, 4]], [[1, 2, 2, 3, 4, 4, 3, 5, 6, 7, 7, 4, 8, 7, 8, 8, 8, 9, 9, -6, 10, 4, -6]], [[1, -999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 3, -1, 4, 4, 0, 3, 4]], [[1, 2, 2, 3, 4, 4, 5, 6, 7, 2]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6, 2, 1]], [["a", "b", "b", "c", "c", "c", "d", "d", "d", "e", "e", "f", "f", "f", "g", "g", "g", "h", "h", "f", "f"]], [[-5555555555555555555555, 5555555555555555555553, -5555555555555555555556, 9]], [[3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 4, 0, 3, 7]], [[64, 8, -57, 66, 4, 9, 98, 999999999999999999999999999999998]], [[1, 2, 2, 3, 4, 4, 4, 5, -5555555555555555555555, 7, 7, 4, 8, 8, 8, 9, 3, 9, 9, 5, 4]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 2, 3, 4, 4, 3, 4, 3, 4, 3, 1, 1]], [[1, 9, 123, 2, 4, 4, 5, 6, 7, 2]], [[-1, -5555555555555555555555, 5555555555555555555555, 5555555555555555555555, 0, -2, -5555555555555555555555, -1]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 7, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10, 5, 9]], [[1.2, 3, 2.1, 5, 3, 5, 2, 3, 3, 9, 123, -1, 2.1, 1e-05, 2.1, 3.0, 9.9, 0.3, 123.0]], [[1, 2, 8, -3, 3, 4, 4, 4, 5, 7, 7, 4, 7, 8, 8, 8, 9, 9, 9, -2, 10, 8, 7]], [[1, -1, 0, 1.0, -1.0, 0.0, 0.0, 1e-05, 1, 1e-05, -10000000000.0, 1e-10, 0.6615193392842611, -1e-10]], [[1, 2, 2, 5555555555555555555555, 4, 4, 3, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, -6, 10, 4]], [[1, 2, 1, 2, 2, 1, 2, 3, 4, 3, -4, 4, 0, 4, 3, 4, 2, 9, 4, 3]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 7, 7, -1, 8, 8, 9, 2, 9, 9, 3, 8, 6, 5]], [[1000000000000000000000000000000000, -5555555555555555555555, 5555555555555555555554, -5555555555555555555555, 9, 999999999999999999999999999999999]], [[66, 1, 2, 2, 3, 4, 4, 4, 5, 5, 7, 7, 4, 7, 8, 8, 8, 9, 1000000000000000000000000000000000, 3, 9, 6, 9, 4, 7]], [[999999999999999999999999999999999, 5555555555555555555555, 0, -999999999999999999999999999999999, 999999999999999999999999999999998, -5555555555555555555555, -5555555555555555555555, 4]], [[1, 98, 2, 2, 3, 4, 4, 4, 5, 6, 7, 6, 7, 8, 8, 9, 9, 9, 10]], [[64, 8, -57, 66, 4, 9, 98, 28, 8]], [[3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, -1, 4, 0, 3, 7]], [[-6, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 2, -5555555555555555555555, 999999999999999999999999999999999]], [[-5555555555555555555555, 999999999999999999999999999999999, -5555555555555555555556, 5555555555555555555555, 0, -5555555555555555555555]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, -5, -1, 4, 4, 0, 3, 4, 2]], [[4, 1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 1, 8, 6]], [[1, 1, 2, 3, 7, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 9, 10, 8, 6, 2, 9]], [[1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4]], [[-5555555555555555555555, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555, -1]], [[1, -1, 0, 1.0, 10000000000.0, -1.0, 0.0, -1.0, 1e-05, 1e-05, 10000000000.0, -10000000000.0, 1e-10, -1e-10]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 66, 4, 0, -5555555555555555555555, 4, 10, 2, -5555555555555555555555, 4, 66]], [[1, 2, 8, 4, 4, 4, 5, 7, 7, 4, 5555555555555555555552, 5555555555555555555553, 8, 8, 8, 9, 9, 9, -2, 10]], [[3, -999999999999999999999999999999999, -5555555555555555555555, 0, -5555555555555555555555]], [[4, 2, 1, 2, 1, 2, 1, -999999999999999999999999999999999, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4]], [[0, -2, -3, -3, -4, -4, -4, -5, -6, -2, 0]], [[-999999999999999999999999999999998, 1, 9, 3, 4, 4, 4, 5, 6, 999999999999999999999999999999999, 7]], [[1, 2, 8, 4, 4, 4, 5, 7, 7, 4, 7, 8, 3, 8, 8, 9, 9, 9, -2, 10]], [[-1, 10, -5555555555555555555555, 5555555555555555555555, 5555555555555555555555, 0, -5555555555555555555555, -5555555555555555555555, -1]], [[1, 98, 1, 2, 1, -999999999999999999999999999999999, 1, 2, -6, 3, 4, 3, 4, 4, 3, 4]], [[1, 2, -4, 2, 3, 6, 4, 3, 1, -999999999999999999999999999999998, 4, 5, 6, 7]], [[1, 0, 65, -5555555555555555555555, 5555555555555555555555, 5555555555555555555556, 5555555555555555555555]], [[0, 2, 1, 2, 1, -999999999999999999999999999999999, 2, 3, 4, 4, 4, 3, 4, 3, 4, 3, 1, 4]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555555, 1000000000000000000000000000000000, 0, 999999999999999999999999999999999, 0, 999999999999999999999999999999999]], [[999999999999999999999999999999999, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, -999999999999999999999999999999999, 3, 5, 5, 4, 0, -5555555555555555555555, 4, 10, 2, -5555555555555555555555]], [[1, 2, 2, 2, 1, 5555555555555555555554, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4]], [[1, -3, 2, 3, 3, 4, 5, 6, 7]], [[-3, -5555555555555555555555, -999999999999999999999999999999998, 5555555555555555555555, -999999999999999999999999999999999, -5555555555555555555555]], [[5555555555555555555553, -999999999999999999999999999999999, -5555555555555555555555]], [[5555555555555555555556, 1, 98, 2, 2, 3, 4, 4, 4, -3, 5, 6, 7, 7, 7, 5, 8, 8, 9, 9, 9, 9, 8]], [[2, 2, 64, 1, 4, 2, 1, -999999999999999999999999999999999, 1, 2, 4, 3, 4, 4, 0, 3, 4]], [[999999999999999999999999999999999, 3, 2, 1, 2, 28, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 5, 4, 0, 3, 4, 2]], [[999999999999999999999999999999999, 3, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 1, 4, 3, 5, 4, 4, 0, 3, 4]], [[1, 2, 8, -3, 3, 4, 4, 4, 5, 7, 7, 4, 7, -999999999999999999999999999999998, 8, 8, 9, 9, 9, -2, 10, 8, 7]], [[1, 2, 2, 3, 4, 4, -6, 4, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 4]], [[1, 9, 2, 2, 3, 4, 5, 4, 5, 6, 7, 7, -1, 8, 4, 8, 9, 2, 9, 9, 10, 8, 6, 2, 9]], [[1, 5555555555555555555555, -5, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, -6, 5555555555555555555555, -5555555555555555555555]], [[1, 5, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 3, 4, 4, 4, 3, 4, 3, 4, 2]], [[64, 7, -57, 66, 4, 9, 98, 28]], [[1, 2, 2, 1000000000000000000000000000000000, 4, 4, 4, 5, 6, 7, 7, -1, 8, 8, 9, 2, 9, 1, 8, 6]], [[1, 2, 0, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 5, 2]], [[1, 9, 2, 3, 4, 5, 4, 5, 6, 7, 7, -1, 8, 4, 8, 9, 2, 9, 9, 8, 6, 2, 9]], [[64, 8, -57, 66, 4, 8, 98, 28]], [[1, 2, 1, 2, -999999999999999999999999999999999, 1, 2, -6, 3, 4, 3, 4, 4, 3, 4]], [[-1, -2, -3, 65, -4, -4, -4, -5, 4, 5555555555555555555552, -3, -1]], [[1000000000000000000000000000000000, -5555555555555555555555, 5555555555555555555554, -5555555555555555555555, 9, 999999999999999999999999999999999, 999999999999999999999999999999999]], [[1, -1, 0.3, -1.0, 0.0, 1e-05, -10000000000.0, 1e-10, 0.6615193392842611, -1e-10, 1e-10]], [[1, 64, 9, 123, 4, 4, 5, 4, 6, 7]], [[1, 2, 0, 2, 0, 0, 1, 3, 2, 3, 4, 3, 4, 3, 3, 10, 4, 2, 4]], [[-1, -2, -3, -3, -4, -3, -4, -4, -5, 5555555555555555555553, -6, -3]], [[1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 4, 7, 8, 8, 8, 9, 9, -6, 10, 8]], [[1, 2, 2, 3, -1, 4, 4, 5, 6, 7, 2]], [[1, 2, 0, 2, 0, -999999999999999999999999999999999, 1, 3, 2, 0, 3, 4, 3, 4, 3, 4, 3, 4, 2]], [[1, 2, 1, 2, 1, -999999999999999999999999999999999, 1, 2, 3, 4, 3, 3, 4, 3, 4, 2]], [[999999999999999999999999999999999, 5555555555555555555552, 5555555555555555555555, 0, 999999999999999999999999999999998, -999999999999999999999999999999999, 65, -5555555555555555555555, 999999999999999999999999999999999]], [[1, 2, 1, 2, 1, -999999999999999999999999999999998, 1, 2, 3, 4, 3, 4, 4, 3, 4, 2]], [[-5555555555555555555555, 999999999999999999999999999999999, 5555555555555555555554, 0, 999999999999999999999999999999999, 0, 999999999999999999999999999999999]]], "completion": "\ndef unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"\n return sorted(list(set(l)))\n", "raw_completion": "```python\ndef unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"\n return sorted(list(set(l)))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef unique(l: list):\n \"\"\"Return sorted unique elements in a list\n >>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [0, 2, 3, 5, 9, 123]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/35", "prompt": "\n\ndef max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"\n", "entry_point": "max_element", "canonical_solution": "\n assert all(type(x) in [int, float] for x in l), \"invalid inputs\"\n return max(l)\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 3]) == 3\n assert candidate([5, 3, -5, 2, -3, 3, 9, 0, 124, 1, -10]) == 124\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 3]], [[5, 3, -5, 2, -3, 3, 9, 0, 124, 1, -10]]], "atol": 0, "plus_input": [[[0, 0, 0, 0]], [[-1, -2, -3, -4, -5]], [[1, 2, 9, 4, 5, 6, 7]], [[8, 7, 6, 5, 4, 3]], [[100]], [[100, 100, 99, 98, 97, 96]], [[1.5, 3, 2, -4, -3.5, 0, 2.5]], [[1, 1, 1, 1]], [[2, 2, 2, 1, 2, 2]], [[50, 49, 48, 47, 46]], [[50, 49, 100, 48, 47, 46]], [[101]], [[-5, 2, 9, 4, 5, 6, 7]], [[50, 49, 49, 47, 47]], [[50, 49, 49, 47, 47, 49]], [[3, 1, 2, 9, 4, 5, 6, 7, 5]], [[50, -2, 49, 49, 47, 47, 49, 47]], [[50, 49, 49, 47, 49]], [[100, 100]], [[99]], [[-1, -2, -3, -4, 0]], [[50, 49, 49, 100, 47, 46]], [[0, 50, 49, 49, 47]], [[8, 6, 6, 4, 6, 3]], [[101, 100, 100, 100]], [[49, 49, 47, 47, 49]], [[-5, 2, 9, 5, 6, 7, 2]], [[-1, -2, -3, -4, 100, -3]], [[1, 2, 9, 5, 5, 6, 7, 7]], [[49, 49, 47, 47, 47, 49]], [[-5, 2, 48, 9, 4, 5, 6, 7]], [[3, 1, 2, 9, 4, 5, 6, 7, 5, 5]], [[-5, 47, 9, 4, 5, 6, 7]], [[-1, -2, -3, -4, 0, -2]], [[-5, 2, 48, 9, 4, 0, 6, 7]], [[-5, 2, 48, 9, 8, 6, 6, 7]], [[1, 2, 9, 4, 5, 6, -1, -1]], [[1.5, 3, 2, -4, -3.5, 0]], [[8, 6, 6, 4, 47, 3]], [[49, 47, 46, 5, 47, 49]], [[50, 49, 49, 100, 47, 46, 47]], [[1.5, 3, 2, -3.5, 0]], [[1.5, 3, -4, 2, -3.5, -1, 2]], [[50, 49, 49, 100, 100, 46]], [[2.218145004627112, 3, -4, 2, -3.5, -1, 2]], [[50, 49, 49, 100, 100, 46, 50, 49]], [[8, 6, 6, 4, 3, 98, 8]], [[3, 2, -3.5, 0]], [[1.5, 3, -4, 2, -3.5, -1, 2, -4]], [[101, 100, 100]], [[2, 2, 3, 2, 47, 2, 2]], [[-1, 5, -3, -4, 0]], [[-2, -3, 0]], [[3, 6, -3.5, 0]], [[9, 49, 49, 100, 100, 46]], [[101, 100, 100, 100, 100]], [[-5, 2, 9, 5, 6, 0, 7, 2]], [[-5, 99, 2, 48, 9, 4, 6, 7, 2]], [[2, 48, 9, 8, 6, 7]], [[8, 6, 6, 4, 3, 98, 3, 8]], [[9, 8, 6, 6, 4, 3, 98, 8]], [[-1, -2, -4, -5]], [[-3, 5, -3, -4, 0, 5]], [[8, 6, 6, 6, 47, 46, 3]], [[9, 49, 49, 100, 46]], [[49, 49, 47, 47, 47, 47, 49]], [[1, 2, 9, 4, 5, 6, 7, 4]], [[2, 47, 2, 3, 2, 47, 3, 2, 2]], [[50, 49, 49, 47]], [[49, 49, 47, 5, 47, 49, 47]], [[3, 1, 2, 9, 4, 5, 6, 7, 5, 5, 5, 6]], [[-5, 9, 4, 5, 6, 7, 9]], [[100, 100, 99, 98, 97]], [[-5, 9, 4, 5, 7, 9]], [[50, 49, 49, 100, 47]], [[8, 6, 6, 4, 6, 3, 6, 8]], [[50, 49, 48, 47, 47]], [[-1, -4, -5]], [[9, 8, 98, 6, 4, 3, 98, 8, 3]], [[1, 2, 9, 5, 5, 6, 7, 7, 5]], [[50, 49, 48, 100, 48, 47, 46]], [[-5, 47, 9, 4, 5, 6, 48, 7]], [[97, 100, 100, 100, 100]], [[2, 48, 9, 8, 6, 7, 9]], [[8, 6, 6, 4, 3, 99, 3, 8]], [[8, 6, 6, 4, 47, 3, 6]], [[-5, 99, 2, 48, 9, 4, 6, 2, 7]], [[100, 100, 99, 99, 97, 100, 99, 97]], [[-5, 99, 2, 48, 9, 4, 6, 2, 7, 6]], [[50, 49, 49, 47, 50]], [[49, 49, 47, 47, 49, 47]], [[8, 6, 6, 4, 3, 99, 3, -4, 8]], [[50, 49, 49, 99, 47]], [[50, 49, 49, 100, 47, 49, 46, 47, 49]], [[49, 49, 49, 47, 47, 47]], [[49, 100]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[-5, -5, -5, -5, -5, -5]], [[1, 1, 1, 1, 1, 1, 1]], [[-1, -100, -1000]], [[2, 2, 2, 2, 2, 2, 3]], [[1.2, -4.5, -3.4, 5.6, 15.4, -9.0, 10.1]], [[2, 2, 2, 2, 2, 2, 2]], [[2, 2, 2, 2, 2, 2]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 1.2]], [[2, 2, 2, 2, 3, 2, 2]], [[1.2, -4.5, -3.4, 5.6, 15.4, -8.601314347821834, 10.1]], [[-5, -6, -5, -5, -5, -5, -5]], [[1.2, -3.4, 1.2, -3.4, 5.6, 15.4, -9.0, 10.1]], [[1.2, -4.5, -3.4, 5.6, 99.9, -8.601314347821834, 10.1]], [[-5, -6, -5, -5, -5, -5, -5, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 30.7, 7.8, -9.0, 10.1, 1.2]], [[1.2, -4.5, -3.4, 5.6, 99.9, -8.601314347821834, 10.1, 99.9, -4.5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 10.1]], [[2, 3, 2, 2, 2, 2, 2]], [[1.2, -3.4, 1.2, -3.4, 5.6, 69.4, -9.0, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 3]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3]], [[-5, -6, -5, -5, -5, -6, -5, -5, -5]], [[2, 1, 3, 2, 2, 2, 2, 2]], [[2, 1, 3, 2, 2, 2, 2]], [[1.2, -3.4, 1.2, -3.4, 5.6, 15.4, -9.0, 10.1, 10.1]], [[2, 2, 2, 2, 2, 2, 2, 2]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[1.2, 1.3749746958929525, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 1.2]], [[2, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 999997]], [[2, 1, 3, 2, 2, 2]], [[-5, -6, -5, -5, -5, -5, -5, -5, -5, -5]], [[-5, -6, -5, -5, -5, -5, -5, -145, -5, -5, -6]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[3, 2, 2, 2, 2, 2]], [[1, 1, 1, 1, 1, 1, 1, 1]], [[-5, -6, -5, -5, -5, -6, -5, -5, -5, -6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]], [[3, 2, 999985, 2, 2, 2]], [[2, 2, 2, 3, 3, 2, 2]], [[1, 1, 1, 1, 1, 1]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[-5, -6, -5, -5, -5, -5, -145, -5, -5, -6]], [[2, 1, 3, 2, 2, 2, 2, 2, 2]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-5, -6, -5, -5, -5, -5, -5, -5, -5, -6]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, 3]], [[1000000, 999999, 999998, 999997, 999996, 18, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999974]], [[1.2, -4.5, -3.4, -46.0, 5.6, 7.8, -9.0, 10.1, 10.1]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[1.2, -3.4, 1.2, -3.4, 5.6, 17.742268880987826, -9.0, 10.1]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 30.7]], [[-5, -6, -5, -6, -5, -5, -5, -5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, -150, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, 3]], [[-5, -6, -5, -5, -5, -5, -5, -145, -5, -4, -5, -6]], [[-34, -1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3, 3]], [[-1, 10, -100, -1000]], [[2, 2, 2, 1, -145, 2, 2, 2, 2]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -40, -130, -135, -140, -145, -150, -80]], [[-5, -6, -5, -5, -5, -5, -4, -145, -5, -5, -6]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 15, 15, 17, 17, 18, 19, 999976, 3, 3]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999988, 999974, 999973, 999972, 999971, 999970, 999975, 999978]], [[2, 2, 1, 2, 2, 2, 2, 3]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 12.377301343805572, 93.8, 99.9, 30.7]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 77.07852302260174, 99.9]], [[-5, -6, -5, -5, -5, -6, -5, -49, -5, -5]], [[-5, -5, -5, -5, -6, -5, -49, -5, -5]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 999983, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4, 5.6]], [[-4.430953128389664, -3.4, 5.6, 8.95595695919447, -9.0, 10.1]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 15.4, 5.6]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3, 12]], [[1.2, -3.4, 1.2, -3.4, 1.6651177816249232, 5.6, 15.4, -9.0, 10.902787118383477, -3.4]], [[-5, -5, -6, -5, -5, -5, -5]], [[1, 3, 3, 5, 6, 16, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -71, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -40, -130, -135, -140, -145, -150, -80, -55, -71]], [[1.2, -4.5, -3.4, 5.6, -9.0, 10.1, 1.2]], [[-5, -5, -6, -5, -5, -90, -5, -5, -6]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999988, 999976, 999975, 999988, 999974, 999973, 999972, 999971, 999970, 999975, 999978]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 10.1]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 10.1]], [[-5, -6, -5, -5, -5, -5, -145, -5, -5, -5, -6]], [[1.2, -3.4, 1.2, -3.4, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1]], [[1.2, 10.1, -3.4, 1.2, -3.4, 5.6, 17.742268880987826, -9.0, 10.1, -9.0]], [[1, 3, 3, 5, 6, 16, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 17, 17, 18, 19, 20, 3]], [[1.2, -3.4, 1.2, -3.4, 2.2154688089923265, 5.6, 15.4, -9.0, 10.902787118383477, -3.4]], [[-4.430953128389664, 6.3422586624915915, -3.4, 5.6, 8.95595695919447, -9.0, 10.1]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4]], [[2, 3, 2, 2, 2, -49, 2]], [[1000000, 999999, 999998, 999997, 999991, 999996, 999995, 999994, 999992, 999991, 999990, 999987, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1.2, -4.5, -3.4, -46.0, 17.742268880987826, 5.6, 7.8, -9.0, 10.1, 10.1]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[-5, -6, -5, -5, -6, -6, -5, -5, -5, -6]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -35]], [[1.2, -4.5, 6.808256183253008, -3.4, 5.6, 7.8, -9.0, 10.1, 10.1]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 10, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, 3, 19]], [[-5, 17, -6, -5, -5, -5, -6, -5, -5, -5]], [[-5, -5, -6, -5, -5, -5, -5, -5]], [[-5, -6, -75, -5, -5, -5, -5, -145, -5, -4, -5, -6]], [[-3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4]], [[2, 1, 3, -130, 2, 2, 2, 2]], [[1.2, -1.7653933945886042, 1.2, -3.4, -9.0, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 3, 5]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 10.1, 10.1]], [[999983, 2, 2, 1, 2, 2]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -40]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 14, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, 3, 13]], [[1.2, -4.5, -3.4, 5.6, -1.7653933945886042, 7.8, -9.0, 10.1, 1.2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 2, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3, 3]], [[-3.4, -4.5, -3.4, 5.6, 51.1, 10.1, 1.2, 1.2]], [[1.2, -3.4, 1.2, -11.39330787369553, -3.4, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, -1, 3]], [[1.2, -3.4, 1.2, -3.4, 5.6, -3.4, 17.742268880987826, -9.0, 11.393628605126539]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[2, 1, 3, 2, 2, 1, 2, 2]], [[2, 3, 2, 2, 2, 2, 2, 2]], [[8.95595695919447, -3.4, 1.2, 5.6, -9.0, 10.1, 15.4, 5.6]], [[1, 3, 3, -49, 5, 6, 16, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 17, 17, 18, 19, 20, 3]], [[2, 0, 3, 2, 2, 2, 2, 2]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 10.1]], [[-5, -5, -5, 999992, -5, -5]], [[2, 999990, 2, 2, 2]], [[1.2, -4.5, -3.4, 6.3422586624915915, 7.8, -9.0, 10.1, 10.1, 10.1]], [[999990, 2, 1, 3, 2, 2, 2, 2, 2, 999971, 2]], [[3, -5, -5, 999974, 999992, -5]], [[-5, -5, -5, -5, -150, -5, -5, -5, -5, -5]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, -1, 3, 14]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, 11.393628605126539, 93.8, 99.9, 30.7]], [[-5, -6, -130, -5, -5, -5, -5, -5, -6]], [[-5, -10, -6, -5, -5, -5, -5, -5, -5, -5, -5]], [[2, 3, 3, 2, 2, -49, 2]], [[-5, -6, -5, -5, -5, -105, -5, -145, -5, -5, -6]], [[1.2, -3.4, 1.2, -12.22100463885235, -3.4, 2.2154688089923265, 5.6, 15.4, -9.0, 10.902787118383477, -3.4, 2.2154688089923265]], [[-6, -5, -5, -5, -6, -5, -5, -5, -6, -6]], [[-5, -6, -5, -5, -5, -6, -5, -49, -5, -40]], [[1000000, 999999, 999998, 999997, 999996, 18, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, -145, 999970, 999974]], [[-5, -6, -5, 17, -5, -5, -5, -5]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 5.6]], [[-5, -6, -5, -5, -5, -6, -5, -5, -5, -5]], [[-5, -10, -5, -5, -5, -5, -5, -5, -5, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 7.8, 10.889126081885, -9.0, 10.1, 10.1]], [[1.2, -3.4, 81.6, 1.2, 5.6, 15.4, -9.0, 10.1]], [[2, 2, 2, 2, 3, 2, 2, 2]], [[999990, 2, 3, 1, 3, 2, 2, 2, 2, -140, 2, 999971, 2]], [[2, 2, 1, 3, 2, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 5, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3]], [[-5, -6, -5, -5, -5, -5, -4, -145, -5, -5, -6, -5]], [[-4.5, -3.4, 5.6, 7.8, 10.889126081885, -9.0, 10.1, 10.1]], [[999975, -1, -100, -1000]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, 7.8, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[1.2, -4.5, -3.4, 5.6, 15.4, -9.0, 93.8]], [[1, 3, 3, 5, 6, 16, 13, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 17, 17, 18, 19, 20, 3]], [[1.2, -3.4, 1.2, 5.6, 15.4, -3.4, -9.0, 10.1, 5.6]], [[-5, -6, -5, -5, -5, -5, -5, -7, -5, -5, -5]], [[-4.430953128389664, -3.4, 5.6, 8.95595695919447, 1.3749746958929525, 10.1]], [[-5, -5, -5, -6, -5, -5, -5, -6, -6]], [[1.2, -3.4, 81.6, 5.6, 15.4, -9.0, 10.1]], [[-5, -6, -5, -5, -5, -5, -145, -5, -5, -6, -6]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -105, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -5]], [[-5, -6, -5, -5, -4, -5, -5, -145, 999993, -5, -5, -6]], [[-5, 17, -6, -5, -5, -5, -6, 17, -5, -5, -5, -5]], [[1.2, -3.4, 1.2, -11.39330787369553, -3.4, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1, -3.4]], [[-5, 16, -6, -5, -5, -5, -6, 17, -5, -4, -5, -5, -5]], [[-5, -5, -5, -6, -5, -5, -6, -6]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -35, -65]], [[2, 999973, 1, 3, 2, 2, 2, 2, 2]], [[1.2, -3.4, 1.2, -3.4, 2.2154688089923265, 16.33840969484739, 5.6, 15.4, -9.0, 10.902787118383477, -3.4]], [[2, 3, 2, 2, 2, -49, 2, -49]], [[-5, 17, -6, -5, -5, -5, -6, -5, -5, -4]], [[2, -20, 1, 1, 3, 2, 2, 2, 2]], [[-100, -1, 10, -100, -1000, 10, -100, -100]], [[999992, 1, 3, 2, 2, 1, 2, 2, 2, 1]], [[2, 2, 1, 2, 1, 3, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 3, 5, 13]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999988, 999976, 999975, 999988, 999974, 999974, 999972, 999971, 999970, 999975, 999978]], [[1.2, 6.808256183253008, -3.4, 5.6, 7.8, -9.0, 10.1, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 999997, 10]], [[-5, 999995, -6, -5, -5, -5, -105, -5, -145, -5, -5, -6, -5]], [[1.2, -4.5, -46.0, 17.742268880987826, 5.6, 7.8, -9.0, 10.1, 10.1, 10.1]], [[2, -20, 1, 1, 3, 2, 2, 2, 2, 2]], [[-4.5, -3.4, 7.8, -4.430953128389664, -9.0, 10.1, 10.1]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 9.135389490896912]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -130]], [[1.2, 10.1, 1.2, 5.6, -11.968486437933775, 15.4, -9.0, 10.1]], [[-5, -6, -130, 999981, -5, -5, -5, -5, -5, -6]], [[-5, -6, -130, -5, -5, -5, -5, -6, -6]], [[-4.5, -3.4, 5.6, -1.7653933945886042, 7.8, -9.0, 10.1, 1.2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 3, 9, 9, 9, 9, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 15, 15, 17, 17, 18, 19, 999976, 3, 3]], [[2, 3, 3, 2, 3, -49, -5]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, -1, 10]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, -1, 3]], [[2, 3, 2, 2, 2, 2, -49]], [[-1, -5, -10, -15, -20, -25, -30, -36, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, 999970, -145, -150]], [[1.2, 1.3749746958929525, -4.5, 7.8, -9.0, 10.1, 1.2]], [[1.2, -3.4, 1.2, -11.39330787369553, -3.4, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1, 1.6571859182906408]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 10.1, 1.2]], [[2, 2, 2, 2]], [[1.2, -4.5, -3.4, 5.6, -9.0, 1.2, 1.2]], [[1.2, -4.5, -3.4, -50.04662603741016, 5.6, 15.4, -8.601314347821834, 10.1]], [[-5, -6, -75, -5, -5, -5, -5, -145, -5, -4, -5, -49]], [[-5, -6, -5, -5, -5, -5, -5, -145, -5, -4, -4, -5, -6]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1.2, -4.5, -3.4, 69.4, -9.0, 1.2, 1.2]], [[2, 2, 1, 3, 2, 2, 999981, 2, 2, 2, 2]], [[1000000, 999999, 999998, 999998, 999996, 999995, 999994, 999993, 999992, 999971, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 16, 17, 18, 19, 20, 3]], [[2, 1, 3, 2, 2, 1, 2, 2, 3]], [[-5, -5, -6, -5, -5, -6, -6]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999996, 999977, 999988, 999976, 999975, 999988, 999974, 999973, 999972, 999971, 999970, 999975, 999978]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, -1, 10]], [[1.2, -4.5, -3.4, 5.6, 10.1, 1.2]], [[-5, -6, -5, -6, -6, -5, -5, -5, -6, -6]], [[1.2, -4.5, -3.4, 5.6, -9.0, 1.2, 1.2, -4.5]], [[-7, -6, -5, -5, -105, -5, -145, -5, -5, -6, -5]], [[-5, -6, -5, -5, -5, -5, -49, -5, -5]], [[-20, 1, 1, 3, 2, 2, 2, 2, 2]], [[-5, -5, 17, -5, -5, -20, -5]], [[1.3749746958929525, -4.5, -3.4, 5.6, 7.8, -7.710030265326744, -9.0, 10.1, -50.04662603741016]], [[-4.5, -3.4, 5.6, 7.8, -7.710030265326744, -9.0, 10.1, -50.04662603741016]], [[1.2, -3.4, 81.6, 0.6809434700413334, 12.377301343805572, 5.6, 15.4, -9.0, 10.1, 1.2, 10.1]], [[999985, 2, 2]], [[-100, -1, 10, -100, -1000, 10, -100, -100, 10]], [[1, 2, 3, 4, 16, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1.2, 1.3749746958929525, -4.5, 0.6809434700413334, 7.8, -9.0, 10.1, 1.2, 10.1, 10.1]], [[1000000, 999999, 999971, 999998, 999997, 999996, 999995, 999999, 999994, 999993, 999992, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1.2, -3.4, 81.6, 1.2, -3.4, 10.675343474768061, 15.4, -9.0, 99.9, 9.135389490896912]], [[-5, -6, -5, -5, -5, -4, -5]], [[-5, -6, -5, -6, -6, -5, -5, -5, -6, -6, -6]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 30.7]], [[-5, -6, -5, -5, -6, -5, -5, -49, -5, -5]], [[18, -5, -5, -6, -5, -5, -5, -5, -145, -5, -7, -6]], [[-5, -6, -5, -5, -5, -5, -5, -6, -5, -5, -6]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 999983, 9, 9, 10, -35, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 5]], [[1.2, -4.5, -3.4, -46.0, 17.742268880987826, 5.6, 7.8, 77.07852302260174, 10.1, 7.8, 10.1]], [[1.2, 1.3749746958929525, -4.5, 0.6809434700413334, 7.8, -9.0, 10.1, 20.5, 10.1, 10.1]], [[1, 3, 3, 5, 6, 5, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 999993, 17, 18, 19, 20, 3]], [[-5, -5, -5, -150, -5, -5, -5, -5, -5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999976]], [[12, 1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 999997]], [[1, 3, 3, 5, 6, 5, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 999993, 17, 18, 19, 20, 3, 14]], [[-5, 16, 18, -6, -5, -5, -5, -6, 17, -5, -4, -5, -5, -5]], [[-5, -6, -5, -5, 4, -5, -105, -5, -5, -5, -6]], [[-5, -6, -5, -5, -4, -15, -5, -5]], [[-5, -6, -5, -5, 999987, -5, -5, -5]], [[-4.5, -3.4, 5.6, -9.0, 10.1, 1.2]], [[-5, -6, -5, -5, -145, -5, -5, -4, -145, -125, -5, -6]], [[1.2, -3.4, 1.2, 10.675343474768061, -3.4, 5.6, -9.0, 10.1]], [[1.2, -3.4, 1.2, 5.6, -9.0, 10.1, 15.4, 10.1]], [[-5, -5, -6, -5, -5, -120, -5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999976, 999991]], [[12.377301343805572, -4.430953128389664, -3.4, 5.6, 10.889126081885, 10.1]], [[-5, -5, -5, -5, 999979, -5, -5]], [[-5, -6, -5, -5, -5, -5, -49, -5, -5, -5]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -80]], [[2, 2, 1, 3, 2, 2, 999981, 2, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 3, 17, 17, 18, 19, -95, 20, 3, 6]], [[-5, -5, -6, -5, -5, -5, -5, -5, -5]], [[-3.4, 1.2, 5.6, 15.4, -9.0, 10.1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 17, 17, 18, 19, -95, 20, -1, 10]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4, 5.6, 5.6]], [[-5, -7, -5, -5, -5, -5, -4, -7, -145, -5, -5, -6, -5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999988, 999976, 999975, 999988, 999974, 999974, 999972, 999971, 999970, 999975, 999978]], [[12.377301343805572, 1.6651177816249232, -4.430953128389664, -3.4, 11.754416969860902, 5.6, 10.889126081885, 10.1, 12.377301343805572]], [[1.3749746958929525, -3.4, 1.2, 5.6, 15.4, -3.4, -9.0, 10.1, 5.6]], [[2, 2, 2, 2, 2, 2, 2, 3, 2]], [[2, 2, 2, 2, 2, 2, 2, -20, 2, 2]], [[-5, -5, -6, -5, -5, -5, -5, -5, -5, -6]], [[1.2, -3.4, -11.39330787369553, -3.4, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1, 1.6571859182906408]], [[-5, -5, -6, -5, -5, -5]], [[-3.4, 1.2, -12.22100463885235, -3.4, 2.2154688089923265, 5.6, 15.4, -9.0, 10.902787118383477, -3.4, 2.2154688089923265]], [[1.2, -4.5, -46.0, 17.742268880987826, 11.01793702200241, 7.8, -9.0, 10.1, 10.1, 10.1]], [[1.2, -3.4, 1.2, 81.6, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1]], [[1.2, 1.2, -3.4, 5.6, 30.7, -9.0, 10.1, 1.2]], [[1.2, -4.5, 0.6809434700413334, 7.8, -9.0, 10.1, 20.5, 10.1, 10.1]], [[-5, -6, -5, -5, -5, -5, -5, -5]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, 999983, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -130, -5]], [[-5, -10, -15, -20, -25, -30, 11, -35, -40, -45, -104, -50, -55, -60, -65, -105, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -5, -95]], [[2, 1, 2, 2, 2, 2, 3, 2]], [[-5, -6, -5, -30, -5, -5, -4, -5]], [[-5, -6, -75, -5, -5, -5, -5, -145, -5, -4, -5, -6, -4, -6]], [[-5, -6, -5, -115, -5, -5, -5, -5]], [[2, 1, 3, 2, 2, 3]], [[2, 2, 2, 2, 15, 2, 2, 2, 2]], [[-5, -5, -5, -5, -6, -6, -5, -5, -5, -6, -6, -6, -5]], [[999970, 2, 1, 3, 2, 2, 1, 2, 2, 3]], [[-5, -7, -5, -5, -5, -4, -5, -5, -145, -145, 999993, -5, -5, -6]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 3]], [[1.2, -4.5, -3.4, 6.3422586624915915, 7.8, 10.1, 10.1, 10.1]], [[999985, 2, 2, 2, 2]], [[-5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -5, -115]], [[16.33840969484739, 1.2, 5.6, 15.4, -9.0, 10.1]], [[1.2, -3.4, 1.6192214722595881, 5.6, 15.4, -9.0, 10.1, 15.4, 5.6, 5.6]], [[2, 2, 1, 999974, 2]], [[1.2, -3.4, 1.2, 5.958120335680599, 15.4, -3.4, -9.0, 10.1, 5.6]], [[1, 3, 3, 5, 6, 6, 6, 8, -135, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 3, 17, 17, 18, 19, -95, 20, 3, 6]], [[1000000, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-5, -6, -5, -5, -5, -6, -5, -49, -5, -104, -40]], [[999973, 2, 3, 3, 2, 2, -49, 2]], [[1, 3, 3, 5, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 3, 12]], [[1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 1, 3, 1, 2, 2, 2, 2]], [[88.15713024897141, -11.39330787369553, 10.675343474768061, 10.675343474768061]], [[-5, -6, -5, -5, -5, 999979, -5, -5, -5, -6]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 30.7, -46.0]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999988, 999976, 999975, 999988, 999974, 999973, 999972, 999971, 999970, 999975, 999978, 999978]], [[-1, -5, -10, -15, -20, -25, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, 999983, -111, -115, -120, -7, -130, -135, -140, -145, -150, -80, -130, -5, -150]], [[-5, -10, -15, -20, -25, -30, 11, -35, -40, -45, -104, -50, -55, -60, -65, -105, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -100, -5, -95, -95]], [[1.2, -1.7653933945886042, 1.2, -3.4, -9.0, 10.1, -3.4]], [[-5, -4, -5, -5, -6, -5, -49, -5, -5]], [[1.2, -3.4, 1.2, -3.4, 15.4, -9.0, 10.1]], [[1.2, -3.4, 1.2, 10.889126081885, -3.4, 5.6, 6.19089849046658, 17.742268880987826, 10.675343474768061, -9.0, 10.1, -9.0]], [[-5, -6, -5, -5, -5, -5, -145, -5, -145, -4, -5, -6]], [[8.95595695919447, -2.3691922330784125, 1.2, 5.6, -9.0, 10.1, 5.214241269834682, 7.8, 5.6]], [[2, 19, 1, 3, 2, 2, 3, 999983, 19]], [[4, 999990, 2, 3, 1, 3, 14, 2, 2, 2, -140, 999989, 2, 999971, 2]], [[-95, -5, -6, -5, -5, -5, -5, -5, -145, -5, 14, -5, -6]], [[1.2, -4.5, -3.4, 6.3422586624915915, -12.22100463885235, 7.8, -9.0, 10.1, 10.1, 10.1, 10.1]], [[1.2, -9.330628700461988, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, -8.601314347821834, 10.1]], [[999970, 999971, 2, 1, 3, 2, 2, 1, 2, 2, 3]], [[1.2, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4, 5.6, 1.2]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -80, -85, -90, -95, -100, 999983, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -130, -5]], [[1.2, -3.4, 1.2, -3.4, 2.396908423313876, 5.6, 15.4, -9.0, 10.902787118383477, -3.4]], [[-5, -125, -6, -5, -5, -6, -6, -5, -5, -5, -6]], [[1.2, 1.2, -3.4, 2.2154688089923265, 5.6, 15.4, -9.0, 1.6571859182906408, -3.4]], [[1, 3, 3, 5, 6, 16, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 9, 14, 15, 17, 17, 18, 19, 20, 3]], [[-5, -111, -5, -5, -5, -5, -5]], [[999975, -1, 7, -1000]], [[-5, -6, -5, -5, -5, -6, -5, -145, -5, -5, -5, -6, -5]], [[-4.5, -3.4, 6.518281252174621, -9.0, 10.1, 1.2]], [[1, 3, 3, 5, 6, 16, 6, 8, -71, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 17, 17, 18, 19, 20, 3, 9]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.645230325881018, -9.0, 10.1]], [[-1, -5, -10, -15, -20, -25, -30, -36, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -79, -105, -110, -115, -120, -125, -130, -140, 999970, -145, -150]], [[-5, -5, -5, -5, -150, -5, -5, -5, -5, -5, -5]], [[999973, 2, 3, 3, 2, -49]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -104, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -115]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -49, -80]], [[999970, 2, 1, 3, 2, 2, 1, 2, 2, 2, 3, 3]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 9.135389490896912, 99.9]], [[2, 2, 2, 3, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 14, 13, 999977, 13, -100, 13, 14, 14, 15, 15, 3, 17, 17, 18, 19, -95, 20, 3, 13]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, 11.393628605126539, 93.8, 99.9, 30.7, 20.5]], [[1.2, -3.4, 1.2, -3.4, -9.599057077266757, 5.6, 69.4, -9.0, 10.1]], [[2, 2, -49, 3, 2, 2, 2, 2]], [[1, 15, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 17, 17, 18, 999980, -95, 20, -1, 10]], [[1.2, -3.4, 1.2, -3.4, -9.599057077266757, 5.6, -8.483231457866996, 30.7, -9.0, 10.1]], [[1.2, 81.6, 1.2, -3.4, 5.6, 70.40853398642157, 15.4, 99.9, 9.135389490896912, 1.2]], [[-5, -6, -5, -5, -5, -5, -5, -145, -5, -5, -6, -5]], [[1.2, -3.4, 0.9700042499864547, -3.4, 15.4, -9.0, 10.1, -3.4]], [[999970, 999971, 2, 1, 3, 2, 2, 1, 2, 2, 3, 1]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 3, 17, 17, 18, 15, 19, -95, 20, 3]], [[1.2, -4.5, -3.4, 5.6, -9.0, 1.2, 1.2, -4.5, -9.0]], [[1.2, 1.49359242815912, -3.4, 5.6, 30.7, -9.0, 10.1, 1.6192214722595881]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 999984, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, -25]], [[1.2, -35.8, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 10.1]], [[-5, -6, -5, -5, -5, -5, -5, -5, -5, -5, -5]], [[1.2, -3.4, 1.2, 1.6651177816249232, 5.6, 15.4, -9.0, 10.902787118383477, -3.4]], [[999970, 999971, 2, 1, 3, 2, 2, 1, 2, 2, 9, 2]], [[999992, 1, 3, 2, 1, 2, 2, 2, 1]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, 9, -70, -75, -80, -85, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -49, -80]], [[2, 999991, 2, 1, 3, 2, 2, 999981, 1, 2, 2, -25]], [[2, 1, 3, 2, 2, 3, 2, 2]], [[-4.5, -3.4, 5.6, 7.8, 6.403591150311957, -9.0, 10.1, 10.1]], [[-1, -5, -10, -15, -20, -25, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -115, -120, -125, -130, -135, -140, -145, -150]], [[-130, -5, -30, 999991, -5, -5, -6, -6, -5, -5, -5, -6]], [[2, 2, 2, 2, 2, 2, 3, 2]], [[2, 999991, 1, 3, 2, 2, 999981, 1, 2, 2, -25]], [[1.2, -12.22100463885235, -3.4, 81.6, -3.948645877240116, 1.2, -3.4, 5.6, 15.4, -9.0, 9.135389490896912]], [[1.2, 69.4, -3.4, 77.07852302260174, 10.1, 1.2]], [[1.2, -3.4, 11.01793702200241, 1.6651177816249232, 5.6, -11.037827955758988, 15.4, -9.0, 10.902787118383477, -3.4]], [[-5, -5, 17, -5, -5, -105, -21, -5]], [[1.2, -3.4, 81.6, 53.538682600998605, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 10.1, 99.9]], [[1.2, -4.5, -3.4, 5.6, 10.1, 1.2, 10.1]], [[1.2, -4.5, -3.4, 15.4, -9.0, 93.8]], [[-5, -6, -5, -5, -5, -105, -5, -145, -5, -6]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, -150, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999974, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1.2, -3.4, 81.6, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 9.135389490896912, 99.9, 81.1055009810944, 99.9, -3.4]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, 7.8, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, -8.601314347821834, 93.8, 99.9, -25.6]], [[-5, -6, -5, -5, -5, -6, -5, -49, -5, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 10.1, 1.2, -4.5]], [[1.0253670684322702, -4.5, -3.4, 5.6, 10.1, 1.2]], [[3, 19, 1, 3, 2, 2, 3, 999983, 3, 19]], [[1.2, 1.2, -3.4, 2.2154688089923265, 16.33840969484739, 6.08019296465832, 15.4, -7.039672779730257, 10.902787118383477, -3.4]], [[-101, 0, 10, -100, -1000, 10, -100, -100, 10]], [[1.2, -4.5, -3.7892244599120666, 5.6, 10.1, 1.2, -9.330628700461988, 10.1]], [[1.2, -4.5, 6.808256183253008, -3.4, 5.6, 7.8, 10.1, 10.1]], [[-5, -6, -130, -5, -5, -5, -6, -6]], [[-20, 1, 1, 3, 2, 2, 2, 2, 2, -20]], [[30.7, -3.4, 1.2, 5.6, 15.4, -3.4, -8.014535244332631, 10.1, 5.6]], [[1.2, 1.2, -3.4, 2.2154688089923265, 6.08019296465832, 15.4, -7.039672779730257, 10.902787118383477, -3.4]], [[1.2, -3.4, 81.6, -25.6, 5.6, 15.4, -9.0, 10.1]], [[-5, -6, -5, -4, -15, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, 11.393628605126539, 93.8, 99.9, 30.7, 20.5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 30.7, 20.5]], [[3, 2, 2, 2, 2, -49]], [[-4, -5, -5, -5, -5, -5, -6, -6]], [[1, 15, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, -100, 13, 14, 14, 15, 15, 17, 17, 18, 999980, -95, 20, -1, 10, 10, 15]], [[1.2, -3.4, 1.2, -3.4, 1.6651177816249232, 5.6, 0.6809434700413334, 15.4, -9.0, 10.902787118383477, -3.4]], [[-5, -6, -5, -5, -4, -6, -6, -5, -5, -20, -6]], [[-5, -5, -7, -6, -5, -5, -120, -5]], [[2, 2, 2, 2, 2, 3]], [[2, 999991, -79, 1, 3, 2, 2, 999981, 1, 2, 2, -25]], [[1000000, 999999, 999998, 999997, 999991, 999996, 999995, 999994, 999992, 18, 999990, 999987, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1000000, 999999, 999998, 999997, 999996, 18, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999974, 999985]], [[1.2, -4.5, -3.4, 5.6, -9.0, 10.1, -9.0]], [[-5, 999973, -5, -5, -5, -145, -5, -10, -6]], [[-5, -5, -5, -5, -5, -150, -5, -145, -5, -5, -6, -5]], [[-5, -6, -130, -5, -5, -95, -5, -6, -6]], [[-5, -5, -5, -5, -5, -5, -5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999979, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999976, 999991]], [[3, 3, 2, 2, -49, 2]], [[1.2, 1.3749746958929525, -4.5, -3.4, 4.842879905706559, 7.8, -9.0, 10.1, 1.2, -4.5]], [[1.2, -4.5, -3.4, 5.6, -9.0, 1.2, -4.5, -4.5]], [[1.2, -3.4, 53.538682600998605, 1.2, -3.4, 5.6, 15.4, -9.0, 99.9, 9.135389490896912, 99.9]], [[-4.5, -3.4, 6.518281252174621, -9.0, 8.41380798939046, 1.2]], [[-5, -5, -5, -150, -5, -5, -5, -5, -5, -5]], [[3, 19, 1, 3, 2, 2, 4, 3, 999983, 19]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -50.04662603741016, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 30.7, 20.5, -87.7]], [[1000000, 999999, 999998, 999998, 999996, 999995, 999994, 999993, 999992, 999971, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[1, 3, 3, 5, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 20, 3, 12]], [[-5, -6, -5, -5, -5, -5, -5, -145, -1000, -5, -5, -6, -5]], [[1000000, 999999, 999998, 999997, 999991, 999996, 999995, 999994, 999992, 18, 999990, 999987, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999979, 999978, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-5, -6, -5, -5, -5, -6, -5, -4, -5, -49, -5, -40]], [[1.2, -3.4, 1.2, 5.6, -9.330628700461988, -9.0, 10.1, 15.4, 5.6]], [[1.2, -3.4, 1.2, 5.6, -9.0, 10.1, 15.4, 10.1, 1.2]], [[1.2, -4.5, -3.4, 5.6, -1.7653933945886042, 7.8, 10.1, 1.2]], [[2, 2, 1, 1, 1, 3, 2, 2, 2, 2]], [[1, 3, 3, 5, 6, 6, 8, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 20, 3, 12]], [[1.2, -4.5, -3.4, 5.6, 7.8, 10.831149818591966, -9.0, 10.1, 10.1]], [[-4.430953128389664, -3.4, 5.6, -3.4057601884353406, 8.95595695919447, -9.0, 10.1]], [[-5, -111, -5, -5, -5, -5, 999988, -5]], [[-3.4, 5.6, 15.4, -9.0, 10.1]], [[1, 1, 1]], [[2, 3, 2, 4, 2, 2, -49, 2, -49]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 77.07852302260174, 99.9, 10.1]], [[1.2, -4.5, -3.4, 6.3422586624915915, 7.8, 10.1, 10.1]], [[1.2, 10.1, 1.2, 5.6, -11.968486437933775, 15.4, -9.0, 13.827938557795427, 10.1]], [[-5, -6, -5, -5, -5, 999979, -5, -5, -5, -6, 999979]], [[-5, -6, -130, -5, -5, -5, -5, -6, -5]], [[1.2, -4.5, -3.4, 15.4, -9.0, 93.8, 1.2]], [[1, 1, 1, 1, 1, 1, -25, 1, 1]], [[-5, -5, -5, 999992, -5, -5, -5]], [[-5, -6, -5, -5, -5, -6, -6, -5, -5, -5, -6, -6, -6, -5]], [[1.2, -3.4, 1.2, -3.4, 5.6, 15.4, -9.0, 10.1, -9.0]], [[1.2, 0.6809434700413334, 81.6, -25.6, 5.6, 15.4, -9.0, 10.1, 1.2]], [[999970, 999971, 2, -104, 1, 3, 2, 2, 1, 2, 2, 3]], [[-80, 52, 11, 51, 99, -40, 7, 59, -34]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -3.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[-4.5, -3.4, 5.6, -9.0, 10.889126081885, 1.2]], [[1.2, -3.4, 1.2, 5.6, 5.214241269834682, 15.4, -3.4, -9.0, 10.1, 5.6]], [[1.2, -4.5, 6.3422586624915915, 7.8, -9.0, 10.1, 10.1, 8.41380798939046, 10.1]], [[-5, -10, -5, -5, -6, -5, -5, -5, -5, -5, -5, -5]], [[1.2, -4.5, -3.4, -25.6, -9.0, 1.2, 1.2, -4.5]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, 999972, -45, -50, -55, -60, 9, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -49, -80]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -8.601314347821834, 57.2, -63.3, 69.4, -3.4, -75.5, 81.6, -87.7, 93.8, 99.9, -46.0]], [[999970, 2, 1, 4, 2, 2, 1, 1, 2, 2, 2, 3, 3]], [[999970, 999971, 2, 1, 3, 2, 2, 1, 2, 2, 9, 999981]], [[-1, -5, -10, -5, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -106, -150, -55]], [[1.2, -8.483231457866996, -3.4, 1.2, 5.6, 15.4, -9.0, 10.1, 15.4, 5.6, 1.2, 5.6]], [[2, 2, 3, 3, 2, 2]], [[1.2, -3.4, 1.2, -11.39330787369553, -5.051492982058698, 5.6, 17.742268880987826, 10.675343474768061, -9.0, 10.1, 1.6571859182906408]], [[2, 20, 19, 1, 3, 2, 2, 3, 999983, 19]], [[-5, -70, -15, -20, -25, -30, 11, -35, -40, -45, -104, -50, -55, -60, -65, -105, -75, -80, -85, -90, -95, -100, 8, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -80, -5, -95]], [[1000000, 999999, 999998, 999998, 999996, 999995, 999994, 999993, 999992, 999971, 999991, 999990, 999989, -150, 999976, 999987, 999986, 999985, 999984, 999983, 999982, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999987]], [[999975, -1, -79, -100, -1000]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, 5, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-100, -1000]], [[-5, -5, -5, -5, -5]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -15, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[-5, -75, -5, -5, -5, -5]], [[1, 2, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9]], [[1, 3, 3, -25, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 13]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-1000]], [[-110, -5, -5, -5, -5, -5]], [[-110, -5, -5, -5, -5]], [[1, 3, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 13, 17, 18, 19, 20]], [[-110, -6, -5, -5, -5, -5]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -140, -145, -150]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[3, 2, 2, 2, 2, 2, 3, 2]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[-1, 999989, -100, -1000]], [[999974]], [[-1, -99, -100, -1000]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 16, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 16, 7, 6, 8, 9, 10, 9, -95, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[-100, -1000, -1000]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 5.6]], [[-1, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -15]], [[1.2, -4.5, 30.7, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[1, 3, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 2, 2, 999986, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 5, 16, 17, 18, 19, 20, 20]], [[1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[1, 2, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 5, 8]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, 1.2, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[1.2, 57.2, -3.4, 5.6, 7.8, -9.0, 10.1, 5.6]], [[-110, -5, -5, -5]], [[-1000, -1000]], [[1, 3, 3, -25, 999976, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 20]], [[1, 2, 3, 4, 5, 7, 8, 9, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -25.6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1.2, -4.5, -3.4, 5.6, 7.8, 1.9737820350258957, -9.0, 11.838575197213943]], [[1, 3, 3, -25, 6, 7, -130, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-110, -6, -5, -5, -5, -5, -5]], [[-1000, -1000, -1000]], [[1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 19, 13, 5]], [[1, 3, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-1, -5, -10, -15, -35, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -15, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[-110, -5, 999976, -5, -5, -5, -110, -110]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -4.5, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -25.6, -4.5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998]], [[1, 3, 3, -25, 999998, 6, 7, 6, 8, 9, 9, 8, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 10, 15]], [[-1, 999989, -1, -100, -1000, -1]], [[1, 3, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12, 10]], [[-110, -5, 21, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -12.3]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998, 999978]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9]], [[-110, -6, -5, -5, -5, -5, -5, -6]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[-110, -5, 999976, -6, -5, -5, -110, -110]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[-110, -6, -5, 17, -5, -5, -5]], [[-1, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -15]], [[1, 2, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 5, 11]], [[1, 2, 3, 4, 5, 6, 18, -20, 8, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[1, 2, 3, 3, 5, 7, 8, 9, 999992, 10, 11, 12, 13, 14, 15, 16, -40, 999976, 19, 20, 15, 11]], [[1.2, -4.5, -3.4, 5.6, -8.535314934192398, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[1, 2, 2, 999986, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 999983, 5, 16, 17, 18, 19, 20, 20]], [[1, 2, 3, 4, 5, 7, 16, 8, 9, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11, 999976, 2]], [[1000000, 999999, 999998, 999997, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-1, -99, -100, -1000, -1000]], [[1, 2, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, -135, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-1, 999989, -100]], [[-1, -5, -10, -15, -35, -30, -35, -40, -120, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, 14, -100, -105, 999979, -15, -110, -115, -120, -125, -130, -135, -140, -145, -150]], [[1000000, 999999, 999998, 999997, 1, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999975, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-1, 999989, -101]], [[3, 2, 2, 2, 2, 5]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 18, 19, 20, 16, 12, 16]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[-1, 999989, -1, -100, -1000, -1, -1]], [[-1, -99, -2, -100, -1000, -1000, -1000]], [[1, 2, 3, 4, 5, 7, 8, 999992, 16, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11, 20, 17]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1000000, 999999, 999998, 999974, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, -115, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998, -115]], [[1, 21, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 2, 2, 4, 5, 18, 7, 8, 9, 10, 12, 12, 14, 15, 16, 17, 18, 19, 20, 5, 8]], [[1.2, 57.2, -3.4, 5.6, 7.8, -9.0, 10.1, 5.6, 7.8]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -62.311142747739765, 69.4, -75.5, -87.7, 93.8, 99.9, -25.6, 99.9]], [[-1000, -1000, -1000, -1000]], [[1.2, -4.5, -3.4, 5.6, -8.535314934192398, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 57.2]], [[1, 21, 1, 1, 2, 1, 1, 1, 1, 1, 1]], [[-1, -99, -100, 999971, -1000]], [[-100, -100, -1000]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9]], [[1, 2, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, -135, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 18]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 14, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, -120, 13, 13, 13, 13, 14, 14, 15, 15, 17, 18, 19, 20, 16, 12, 16]], [[-4.5, -3.4, 5.6, 7.8, 1.9737820350258957, -9.0, 11.838575197213943, 1.9737820350258957, 1.9737820350258957]], [[1, 3, 3, 5, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 13]], [[1, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 999972, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 21, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]], [[-1, 999989, -1]], [[17, 2, 3, 5, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 18]], [[1, 2, 3, 4, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[-100, -100, -100]], [[-1, 999980, -1]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 7, 1, 20]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 5, 11]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[1, 3, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1.2, -4.5, -3.4, 5.6, 4.977938453667969, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -34.08965445380225, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[-1, -100, -1000, -1, -100]], [[1, 1, 21, 1, 1, 2, 1, 1, 1, 1, 1, 1]], [[-1, -99, -100]], [[2, 2, 12, 2, 2]], [[4.977938453667969, 1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, -25.6, -68.11296101258709, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 999979, 15, 11]], [[19, 999974]], [[1000000, 4, 999998, 999974, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, -115, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998, -115]], [[-1, 999989, -1, -100, -1000, -1, -1, -1]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 10, 6, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 19]], [[999975, 999974]], [[1, 2, 4, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[1, 3, 3, -25, 12, 6, 16, 12, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 999985, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, -60, 19, 999979, 15, 11]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999984, 999983, 999982, 999981, 999980, 999979, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970]], [[-1, 999989, -100, -1000, -1, -1]], [[1, 2, 3, 4, 5, 6, 18, -20, 7, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20, 999990]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 2, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 10, 17, 18, 19, 20, 9]], [[1000000, 4, 999998, 999974, 999997, 999996, 999995, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, -115, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998, -116]], [[-110, -5, -5, -5, -5, -5, -5]], [[1.2, -4.144845462417584, -3.4, 5.6, 7.8, -75.92066881481027, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9]], [[3, 2, 2, 2, 5]], [[-110, -6, -5, -5, -5, -5, -5, -6, -6]], [[-1, -100, -1, -100]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 10, 6, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 999971, 19]], [[-5, -5, -5, -5, -6, -5]], [[3, 3, -25, 999998, 6, 7, 6, 8, 9, 9, 8, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 10, 15, 3]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 999994, 15, 15, 15, 17, 17, 18, 19, 20, 14]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 12, 13, 14, 16, 17, 999976, 19, 20, 15, 11]], [[-110, -6, -5, -5, -5, -5, -5, -5]], [[1, 2, 3, 4, 6, 6, 18, -20, 8, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[-110, -5, -5, -5, -6, -5, -5]], [[1, 1, 21, 1, 1, 2, 1, 1, 1, 1, 1, 1, 21]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[1.2, 57.2, -3.4, 5.6, 7.8, -9.0, 10.1, 5.744630563753921, 7.8]], [[1, 2, 3, 4, 5, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 8, 17, 999976, 19, 20, 15, 11]], [[1.2, -4.5, -3.4, 5.6, -8.535314934192398, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 57.2, 5.6]], [[-1, 999989, -100, -1000, -1, -1, 999982]], [[1, 3, 3, 12, 6, 16, 12, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 999985, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 2, 3, 4, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20, 2]], [[1.2, -4.5, -3.4, 5.6, -8.535314934192398, 40.05810514411828, 10.1, -12.3, 15.4, 20.5, -25.6, -87.7, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, 5.6]], [[-1, 999989, -1, -1]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 13, 4, 14, 15, 16, 17, 999976, 19, 20, 999991, 11]], [[17, 3, 5, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 18]], [[1.2, -4.5, -3.4, 5.6, 4.977938453667969, -4.063025842367273, -9.0, 10.1, -12.3, 15.4, 20.5, -34.08965445380225, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[-110, -6, -5, 17, -4, -5, -5]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.350553370484185, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[-5, -5, -5, -5]], [[1, 2, 3, 999992, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[-115, -1, -100, -1000, -1, -1, -1]], [[999988, 1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 13, 4, 14, 15, 17, 999976, 19, 20, 999991, 11]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 2, 3, -116, 5, 6, 18, -20, 8, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[-1, 999989, -101, -1000, -1, -1]], [[1.2, -4.5, 8.147935111748893, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[17, 3, 5, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 18]], [[1, -145, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 13, 12, 12, 13, 2, 13, 13, 13, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 6, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20, 2, 18]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 7, 1, -1000]], [[1.2, -4.5, 30.7, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9, 40.9]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3]], [[1, 2, -70, 4, 5, 7, 8, 999992, 11, 12, 13, 14, 15, 16, 17, 999976, -60, 19, 999979, 15, 11]], [[-1, 999989, -1000]], [[1, 3, 3, 12, 6, 16, 12, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, -40, 14, 15, 999985, 15, 17, 17, 18, 20, 16, 12]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 57.2, -63.3, 69.4, -75.5, 81.6, -87.7, 93.8, 99.9, -25.6]], [[1, 2, 3, 4, 5, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 8, 17, 999976, 19, 20, 15, 11, 17]], [[-1, -100, -1, -100, -100]], [[1, 1, 21, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 21]], [[1, -30, 3, 5, 6, 6, 6, 999975, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 16, 13, 13, 14, 14, 15, 15, 15, 17, 18, 19, 20, 14]], [[1, 3, 3, -25, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[1, -145, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 13, 12, 12, 13, 2, 13, 13, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 13, 13, 13, 13, 13, 14, 14, 15, 999982, -5, 17, 17, 18, 19, 20]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, -12.3, -87.7, 93.8, 99.9]], [[1.2, -4.5, -3.4, 5.6, 7.8, 2.3356007610251286, -9.0, 11.838575197213943]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 51.1, 57.2, -63.3, 69.4, 20.5, 81.6, -87.7, 93.8, 99.9]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3, 19]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -12.3]], [[1, 3, 14, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[-1, -100, 999972, -1, -100]], [[-100, -100, -100, -100]], [[1, 3, 3, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1.2, 57.2, -3.4, 5.6, 7.8, -9.0, 10.1, 7.8]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -90, -120, -125, -130, -140, -145, -150]], [[1.2, -4.5, -3.4, 5.6, 7.8, -10.492535520433075, 2.3356007610251286, -9.0, 11.838575197213943, -4.5]], [[1, 2, 3, 4, 5, 999977, 7, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[2, 18, 2, 2, 2, 2, 2]], [[-110, -5, -5, -5, 999991, -5]], [[1, 3, -25, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 13]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 13, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3, 19]], [[-1, -5, -10, 16, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -90, -120, -125, -130, -140, -145, -150]], [[-4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, 30.7, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 20.793566236740514]], [[-100, 1, -1000]], [[-1, -5, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -90, -120, -125, -130, -140, -145, -150, -50]], [[0, 1]], [[1, 2, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 13, 9, 9, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3, 19, 10]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 13, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3, 19, 1]], [[-110, -5, 21, 999973, -5]], [[-4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -25.6]], [[1.2, -4.5, 8.147935111748893, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 10.1, 99.9, 7.8]], [[1, 3, 3, -25, 6, 7, 6, 18, 8, 9, 9, 13, 9, 9, 10, -120, 10, 12, 12, 18, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3, 19, 10]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 13, 4, 14, 15, 16, 17, 19, 20, 999991, 11]], [[2, 2, 2, 1, 2, 2, 3, 2]], [[999988, 1, 2, 3, 4, 5, 7, 8, -120, 999992, 10, 21, 13, 4, 14, 15, 17, 999976, 19, 20, 999991, 11]], [[1.2, -4.5, -3.4, 5.6, -21.001516927331863, 4.977938453667969, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -34.08965445380225, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7]], [[1, 2, 2, 999986, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 5, 16, 17, 18, 19, 20, 20, 8]], [[2, 2, 2, 1, 2, 2, 1, 3, 2]], [[-5, 999978, -5]], [[-1, -5, -10, 16, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -64, -90, -95, -100, -105, -110, -90, -120, -125, -130, -140, -145, -150, -80]], [[1.2, -4.5, -3.4, 5.6, -21.001516927331863, 4.977938453667969, 7.8, -9.0, 10.1, 15.4, 20.5, -34.08965445380225, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, -35.8, 99.9, 7.8]], [[-1, -100, 999995, -1000]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 11, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 11, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9]], [[-1, 999989, 999984, -100, -1000, -1, -1, -1]], [[17, 3, 5, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 16, 17, 18, 19, 18]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 999986, 13, 13, 14, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 7, 999992, 10, 21, 13, 4, 14, 15, 16, 17, 19, 20, 999991]], [[1, 2, 3, 4, 12, 5, 6, 18, 7, 8, 9, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 19, 9]], [[1.2, -4.5, -3.4, 2.929311287687052, 7.8, -10.492535520433075, 2.3356007610251286, -9.0, 11.838575197213943, -4.5]], [[1, 3, 3, 12, 6, 16, 12, 7, 6, 8, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, -40, 14, 15, 999985, 15, 17, 17, 18, 20, 16, 12]], [[-1, -10, -15, -20, -25, -30, -40, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, -145, -150, -15, -25]], [[-1001]], [[1, 2, 3, 4, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, -90, 15, 16, 17, 18, 19, 20, 2]], [[1, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 999972, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 10]], [[-4.5, 30.7, -3.4, -68.11296101258709, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, 30.7, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 20.793566236740514]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 18, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 15, 15, 17, 17, 18, 19, 20]], [[-35, 1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 10, 10, 13, 10, 12, 12, 2, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[999999, 1, 15, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 11, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.9077445521308, 99.9, -25.6]], [[-1001, 1, 2, 3, 4, 5, 999977, 7, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11, 15, 5, 11]], [[1, 3, 3, -25, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 19, 20, 13]], [[1, 2, 11, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7]], [[0, 1, 0]], [[-5, -5, -5, -5, -6, -5, -6]], [[1, 3, -60, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, -120, 3, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, -80, 19, 20]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, -1, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 13, 15, 17, 17, 18, 19, 20, 15, 3, 8]], [[1.2, -4.5, -3.4, 5.6, -8.535314934192398, 10.1, -12.3, 15.4, 20.5, -25.6, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, 81.6, 93.8, 99.9, 57.2]], [[-1, 999988, 999989]], [[1, 3, 5, 6, 6, 6, 8, 8, 10, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 999972, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 8]], [[999988, 1, 2, 3, 4, 5, 7, 8, -120, 999992, 10, 21, 13, 4, 14, 15, 17, 999976, 19, 20, 999991, 11, 1]], [[1, 2, 3, 3, 5, 7, 8, 9, 999992, 10, 11, 999981, 12, 13, 14, 15, 16, -40, 999976, 19, 20, 15, 11, 10]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 20.5, -25.6, 30.7, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, 93.8]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9]], [[999999, 1, 15, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 11, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9, 11]], [[1, -1000]], [[1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 19]], [[2, 1, 2, 1, 2, 2, 1, 3]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, 999982, 999973, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998]], [[1, 3, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 18, 20]], [[-4.5, 30.7, -3.4, -68.11296101258709, 7.8, -9.0, 10.1, -12.3, 15.4, 25.170907376089314, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, 30.7, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 20.793566236740514]], [[-1, -5, -10, -14, -15, -35, -30, -35, -40, -120, -45, -50, -55, -60, -65, -70, -75, -80, -85, -90, -95, 14, -100, -105, 999979, -15, -110, -115, -120, -125, -130, -135, -140, -145, -150, -125]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999972, 999971, 999970, 999978, 999998]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -87.7, 57.2, -63.3, 69.4, -75.5, 81.6, -12.3, -87.7, 93.8, 99.9]], [[1, -145, 2, 3, 4, 5, 6, -20, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20, 2, 18]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12, 9, 12]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 9, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 19, 20]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 13, 13, 13, 13, 13, 14, 14, 15, 2, 999982, -5, 17, 17, 18, 19, 20, 14]], [[999999, 1, 15, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 11, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9, 11, 17]], [[1.2, -4.5, -3.4, 5.6, 2.3356007610251286, -9.0, 11.838575197213943]], [[1.2, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, 11.838575197213943, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -12.3]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 13, 4, 14, 15, 16, 18, 19, 20, 999991, 11, 2]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 5, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 7, 1, 20]], [[1.2, 57.2, -3.4, 5.6, 7.8, -9.0, 10.1, 5.6, -3.4]], [[-1, -5, -10, 16, -15, -20, -25, -30, -35, -40, -45, -50, -55, -60, -89, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -90, -120, -125, -130, -105, -140, -145, -150]], [[1, 3, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 4, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 999993, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15]], [[-4.5, 30.7, -3.4, -68.11296101258709, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, 30.7, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 20.793566236740514, 93.8]], [[1, 2, 3, 4, 5, 6, 18, -20, 999990, 1000000, 9, 11, 12, 13, -145, 14, 999999, 15, 16, 17, 18, 19, 20, 12]], [[1, 3, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 13, 999993, 14, 15, 15, -125, 15, 17, 17, 18, 19, 20, 15, 9]], [[1.2, -4.5, 30.7, -3.4, -68.11296101258709, -13.107365398979242, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 99.9]], [[1, 2, 3, 4, 5, 7, 12, 8, 999992, 10, 11, 12, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1, 3, 3, -25, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 17, 17, 18, 19, 20]], [[-5, 999978, -5, -5]], [[-1, 999989, -100, -14]], [[-95, 2, 2, 2, 999999]], [[-100, -100, -1000, -1000]], [[1.2, -4.5, -25.6, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, -25.6, -68.11296101258709, -35.8, 40.9, -46.0, 51.1, 57.06819846937895, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12]], [[1, 2, 3, 4, 5, 7, 8, 999992, 10, 21, 13, 4, 14, 15, 16, 8, 18, 19, 20, 999991, 11, 2]], [[1, 2, 3, 4, 5, 16, 8, 9, 999992, 10, 11, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11, 999976, 2]], [[1, 2, 3, 4, 6, 6, -20, 8, 999990, 9, 11, 12, 13, -145, 14, 15, 16, 17, 18, 20]], [[-100, -70, -100, -71]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999984, 999982]], [[4.977938453667969, 1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, -25.6, -68.11296101258709, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -4.5]], [[2, 18, 2, 2, 2, 3, 2]], [[1, 2, 3, 5, 7, 8, 9, 999992, 10, 11, 12, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 18, 19, 20, 16, 12, 16, 14]], [[-20, -100, -1000]], [[1, 2, 3, -116, 5, 6, 18, -20, 8, 999990, 10, 11, 12, 13, -145, 14, 15, 16, 17, 18, 19, 20]], [[1000000, 999999, 999998, 999997, 3, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, 999982, 999973, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, -30, 999970, 999978, 999998, 999973]], [[-1, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, -120, -125, -130, -135, -140, 15, -145, -150, -15, -130]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999984, 999982, 999998]], [[1, 2, 3, 4, 999977, 999977, 7, 8, 999992, 10, 21, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 5]], [[1.2, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, -87.7, 57.2, -63.3, 69.4, -75.5, 81.6, -12.3, -87.7, 93.8, 99.9, -4.5]], [[1000000, 999999, 999998, 999997, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999984, 999982, 999980]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, -24, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 18, 19, 20, 16, 12]], [[1, 3, 3, 6, 6, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 999981, 18, 19, 20]], [[-1, -99, -1000, -100, -1000]], [[3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 15, 15, 17, 17, 18, 19, 20, 16, 12, 6]], [[1.2, -4.5, 5.6, 7.8, 1.9737820350258957, -9.0, 11.838575197213943]], [[-110, -145, -5, -5, -5, -5, 999978, -5, -5]], [[1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 18.835810291770926, 51.1, 57.2, 1.2, 69.4, -75.5, -87.7, 93.8, 99.9, 7.8, -12.3]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, -99, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 15, 3]], [[1, 3, 3, -25, 6, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 14, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 7, 1, -1000]], [[-4.5, 30.7, -3.4, -68.11296101258709, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, 30.7, -35.8, 40.9, 20.5, -46.0, 51.1, 57.2, -63.3, 20.793566236740514, 69.4, 30.7, -75.5, 81.6, -68.11296101258709, -87.7, 93.8, 20.793566236740514]], [[1, 3, 3, 999987, -25, 6, 7, -130, 6, 8, 9, 9, 9, 9, 10, 10, -120, 10, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 6, 16, 7, 8, 9, 10, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 16, 7, 12]], [[17, 3, -50, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, 12, 18, 19, 20, 18]], [[1, 2, 3, -116, 5, 6, 18, -20, 8, 999990, 10, 9, 11, 12, 13, -145, 14, -99, 16, 18, 19, 20]], [[1, 3, 14, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 2, 2, 999986, 5, 6, 7, 8, 9, 10, 11, 12, 13, 999983, 5, 16, 17, 18, 19, 20]], [[1.2, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, 30.7, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.9077445521308, 99.9, -25.6, -46.0, 93.9077445521308]], [[2, 2, 2, 2, 999973, 2, 2]], [[17, 3, -50, 6, 18, 7, 8, -1, 10, 11, 12, 13, 14, 17, 16, 17, 12, 18, 19, 20, -1000, 18]], [[999989, 999972, -1000]], [[1000000, 999999, 999998, 999974, 999997, 999996, 999995, 999987, 999994, 999993, 999992, 999991, 999990, 999989, 999988, -95, 999987, 999986, 999985, 999984, 999983, -115, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999978, 999998, -115, 999971]], [[1, 3, 3, -25, 6, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 6, 10]], [[1.2, -4.5, -3.4, 25.170907376089314, 7.8, -9.0, 10.1, -12.3, 15.4, 20.5, -25.6, -35.8, 40.9, -46.0, -4.5, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 99.9, -25.6, -4.5]], [[1, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 999972, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 13]], [[1, 2, 3, -25, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 999988, 10, 10, 12, 12, 13, 13, 13, 999981, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 6, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20, 9]], [[-99, -2, -100, -1000, -1000, -1000]], [[-1, -10, -15, -20, -25, -30, -35, -40, -45, -50, -55, -65, -70, -75, -80, -85, -90, -95, -100, -105, -110, -115, 999989, -120, -125, -130, -135, -140, 15, -145, -150, -15, -130, -1]], [[1000000, 999999, 999998, 999996, 999995, 999994, 999993, 999992, 999991, 999990, 999989, 999988, 999987, 999986, 999985, 999984, 999983, 999982, 999981, 999980, 999979, 999978, 999977, 999976, 999975, 999974, 999973, 999972, 999971, 999970, 999984, 999982, 999998]], [[1, 3, 5, 6, 6, 6, 8, 8, 10, 9, 9, 9, 10, 10, 10, 12, 12, 13, 13, 13, 13, 999972, 14, 14, 15, 15, 15, 17, 17, 18, 999977, 20, 8]], [[4.977938453667969, 1.2, -4.5, -3.4, 5.6, 7.8, -9.0, 10.1, -12.3, -25.6, -2.1544108467456975, -68.11296101258709, -35.8, 40.9, -46.0, 51.1, 57.2, -63.3, 69.4, -75.5, -87.7, 93.8, 124.5611385860338, -4.5]], [[1, 2, 3, 4, 5, 999977, 7, 8, -2, 10, 21, 12, 13, 14, 15, 16, 17, 999976, 19, 20, 15, 11]], [[1, 3, 3, -25, 999976, 6, 6, 8, 8, 9, 9, 9, 10, 10, 13, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 20]], [[1, 2, 3, 4, 5, 6, 18, -20, 999990, 9, 11, 12, 13, 19, 14, -90, 15, 16, 17, 18, 19, 20, 2]], [[1, -30, 3, 5, 6, 6, 6, 8, 8, 9, 9, 9, 9, 10, 10, 10, 12, 13, 13, 16, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]], [[1, 3, 3, -25, 16, 7, 6, 8, 9, 10, 9, 9, 10, 10, 5, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 17, 17, 18, 19, 20, 7, 1, 20]], [[1, 3, 3, -25, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 17, 17, 18, 19, 20]]], "completion": "\ndef max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"\n return max(l)\n", "raw_completion": "```python\ndef max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"\n return max(l)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef max_element(l: list):\n \"\"\"Return maximum element in the list.\n >>> max_element([1, 2, 3])\n 3\n >>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])\n 123\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/36", "prompt": "\n\ndef fizz_buzz(n: int):\n \"\"\"Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n >>> fizz_buzz(50)\n 0\n >>> fizz_buzz(78)\n 2\n >>> fizz_buzz(79)\n 3\n \"\"\"\n", "entry_point": "fizz_buzz", "canonical_solution": "\n cnt = 0\n for i in range(n):\n if i % 11 == 0 or i % 13 == 0:\n cnt += len(list(filter(lambda c: c == \"7\", str(i))))\n return cnt\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(50) == 0\n assert candidate(78) == 2\n assert candidate(79) == 3\n assert candidate(100) == 3\n assert candidate(200) == 6\n assert candidate(4000) == 192\n assert candidate(10000) == 639\n assert candidate(100000) == 8026\n\n", "contract": "\n assert type(n) == int and n > 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[50], [78], [79], [100], [200], [4000], [10000], [100000]], "atol": 0, "plus_input": [[1], [10], [20], [30], [70], [71], [72], [73], [74], [75], [31], [69], [9], [77], [78], [76], [8], [2], [21], [68], [22], [29], [23], [32], [3], [11], [33], [19], [86], [7], [12], [4], [79], [28], [6], [60], [85], [5], [80], [61], [59], [62], [63], [84], [18], [27], [81], [64], [26], [83], [82], [13], [66], [24], [34], [43], [42], [14], [65], [67], [50], [94], [25], [51], [17], [52], [41], [40], [16], [58], [15], [555555], [303], [12345], [2000], [9999], [123456], [304], [9998], [12344], [10000], [302], [12346], [12347], [12348], [12343], [123455], [123454], [555554], [123453], [10001], [301], [123457], [12341], [1999], [12342], [123452], [555556], [9997], [92], [90], [91], [123451], [93], [12350], [555552], [12351], [555551], [123458], [9996], [12352], [555550], [555557], [12340], [10002], [555553], [555558], [44], [12349], [555549], [45], [123459], [12339], [305], [49], [300], [555559], [555560], [123460], [95], [1000], [2001], [2002], [2004], [1998], [2003], [53], [54], [2005], [555561], [1997], [55], [48], [555562], [1996], [47], [306], [307]], "completion": "\ndef fizz_buzz(n: int):\n \"\"\"\n Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n \"\"\"\n count = 0\n for i in range(1, n):\n if i % 11 == 0 or i % 13 == 0:\n if '7' in str(i):\n count += 1\n return count\n", "raw_completion": "```python\ndef fizz_buzz(n: int):\n \"\"\"\n Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n \"\"\"\n count = 0\n for i in range(1, n):\n if i % 11 == 0 or i % 13 == 0:\n if '7' in str(i):\n count += 1\n return count\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef fizz_buzz(n: int):\n \"\"\"Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.\n >>> fizz_buzz(50)\n 0\n >>> fizz_buzz(78)\n 2\n >>> fizz_buzz(79)\n 3\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/37", "prompt": "\n\ndef sort_even(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the odd indicies, while its values at the even indicies are equal\n to the values of the even indicies of l, but sorted.\n >>> sort_even([1, 2, 3])\n [1, 2, 3]\n >>> sort_even([5, 6, 3, 4])\n [3, 6, 5, 4]\n \"\"\"\n", "entry_point": "sort_even", "canonical_solution": "\n even = [l[i] for i in range(len(l)) if i % 2 == 0]\n even.sort()\n return [even[i // 2] if i % 2 == 0 else l[i] for i in range(len(l))]\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert tuple(candidate([1, 2, 3])) == tuple([1, 2, 3])\n assert tuple(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])) == tuple([-10, 3, -5, 2, -3, 3, 5, 0, 9, 1, 123])\n assert tuple(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10])) == tuple([-12, 8, 3, 4, 5, 2, 12, 11, 23, -10])\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) in [int, float] for x in l), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 3]], [[5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]], [[5, 8, -12, 4, 23, 2, 3, 11, 12, -10]]], "atol": 0, "plus_input": [[[2, 6, 4, 8, 10]], [[1, 0, 3, 6, 5]], [[3, 3, 2, 2, 1, 1]], [[11, 7, 6, 9, 14, -1]], [[]], [[3]], [[5, 9, 3, 8, -1, 12, -14, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]], [[8, 7, 6, 5, 4, 3, 2, 1]], [[0, 0, 0, -1, -1, -1, 2, 2, 2]], [[1, 0, 3, 4, 6, 5]], [[4, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]], [[3, 3, 2, 2, 1, 11, 1]], [[29.192135197854643, 33.66238184288656, 29.291147603502964]], [[3, 2, 5, 2, 2, 1, 1]], [[3, 3, 2, 2, 1, 11, 1, 3]], [[3, 4, 10, 2, 2, 1]], [[1, 3, 4, 6, 5, 4]], [[3, 3, 2, 2, 1, 1, 3]], [[3, 3, 2, 2, 2, 11, 1, 3]], [[4, 1, 3, 4, 5, 6, 3, 7, 8, 9, 10, 11, 12]], [[1, 1, 3, 6, 5]], [[1, 0, 3, 4, 6, -1, 10, 0]], [[4, 1, 3, 4, 5, 6, 3, 7, 8, 5, 9, 10, 11, 12]], [[3, 4, 10, -14, 2, 4, 2, 1]], [[3, 2, 5, 2, 14, 1, 1]], [[-1, 1, 3, 6, 5]], [[3, 3, 2, 0, 2, 1, 1]], [[-1, 1, 3, 5]], [[3, 3, 2, 8, 2, 2, 11, 1, 3, 0, 11]], [[1, 3, 4, 5, 6, 7, 10, 8, 9, 10, 11, 12]], [[0, 3, 4, 6, -1, 10, 0]], [[0, 4, 4, 6, -1, 10, 0, 10]], [[2, 1, 0, 3, 4, 6, 5]], [[3, 2, 5, 14, 1, 1]], [[3, 1, 3, 2, 2, 1]], [[1, 3, 2, 2, 1, 1]], [[4, 3, 2, 5, 2, 2, 1, 1]], [[3, 3, 2, 2, 1, 11, 1, 3, 2]], [[3, 14, 2, 5, 14, 1, 1]], [[3, 3, 2, 2, 1, 11, 1, 3, 2, 3]], [[1, 0, 3, 6]], [[3, 3, 2, 2, 1, -1, 1, 3, 2]], [[4, 0, 3, 4, 5, 6, 7, 8, 5, 9, 10, 11, 12]], [[2, 3, 4, 10, -14, 2, 4, 2, 1]], [[3, 3, 2, 2, 0, 11, 1, 3, 1]], [[3, 3, 2, 2, 1, 11, 1, 11]], [[1, 0, 3, 5]], [[1, 4, 0, 3]], [[0, 0, 0, -1, -1, -1, 2, 2, 2, 2]], [[3, 2, 5, 2, 2, 1, 1, 3, 1]], [[3, 1, 3, 2, 2, 1, 3]], [[0, 4, 4, 6, 0, 10, 0, 10, 10]], [[1, 4, 0, -1, 3, 3]], [[3, -14, 10, -14, 2, 4, 2, 1]], [[3, 4, 10, -14, 2, 4, 2, 1, -14]], [[3, 3, 2, 8, 2, 2, 11, 0, 1, 3, 0, 11]], [[2, 5]], [[2, 6, 4, 8, 11]], [[1, 0, 14, 3]], [[3, 2, 4, 2, 14, 0, 1]], [[4, 1, 3, 4, 5, 6, 2, 7, 8, 5, 9, 10, 11]], [[3, 2, 2, 1, 1]], [[4, 3, 2, 5, 2, 2, 1, 1, 1]], [[0, 3, 4, 6, -1, 10, 0, 0]], [[1, 0, 3, 4, 6, -1, -14, 0]], [[4, 1, 3, 4, 5, 6, 3, 7, 8, 9, -1, 11, 12, 12]], [[3, 2, 2, 1, 1, 1]], [[2, 3, 4, 10, -14, 2, 4, 2, 1, 10]], [[8, 7, 6, 5, 4, 3, 2, 1, 2]], [[1, 0, 3, 6, 5, 0, 1]], [[4, 1, 3, 4, 4, 5, 5, 6, 3, 7, 8, 9, -1, 11, 12, 12, 1]], [[2, 1, 0, 3, 4, 4, 6, 5]], [[0, 3, 4, 6, -1, 10, 0, 0, 10]], [[3, 4, 2, 2, 1, 2]], [[1, 1, 3, 5]], [[33.66238184288656, 29.291147603502964]], [[4, 1, 1, 3, 4, 5, 6, 3, 7, 8, 5, 9, 10, 11, 10]], [[1, 0, 3, 4, 6, -1, -14, 0, 0]], [[4, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 1]], [[3, 2, 10, -14, 2, 4, 2, 1, 10]], [[3, 3, 2, 5, 0, 2, 1, 1]], [[3, 3, 2, 2, 1, 14, 1, 3, 2, 2, 3]], [[3, 3, 2, 0, 2, 1, 11, 1, 4, 3, 2]], [[1, 3, 4, 5, 6, 3, 7, 8, 9, -1, 11, 12]], [[3, 3, 2, 2, 1, 11, 1, 3, 11]], [[33.66238184288656, 29.291147603502964, 29.291147603502964]], [[0, 5, 5]], [[0, 3, 4, 6, -1, 10, 0, 5]], [[0, 0, 0, -1, -1, 2, 2, 0]], [[2, 3, 4, -14, 2, 4, 2, 1, 10]], [[0, 0, 0, -1, -1, -1, 2, 2, 2, -1]], [[3, 0, 3, -14, -14, 2, 4, 2, 0]], [[3, 3, 2, 2, 1, 11, 1, 3, 2, 0]], [[2, 4, 10, -14, -14, 2, 4, 2, 1]], [[40.82822270856693, 33.66238184288656, 29.291147603502964, 29.291147603502964]], [[3, 3, 2, 5, 0, 2, 1, 1, 1]], [[1, 1, 2, 3, 5]], [[3, 1, 2, 2, -14, 1]], [[1, 3, 4, 5, 6, 3, 7, 8, 14, 9, -1, 11, 12]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -10]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10]], [[1, 2, 3, 4, 5, 6, 7, 8]], [[1, 1, 1, 1, 2, 2, 2, 2]], [[5, 0, 5, 0, 5, 0, 5, 0]], [[1, 1, 1, 1, 1, 1, 1, 1]], [[2, 2, 2, 2]], [[3, 3, 3, 3, 3]], [[3, 1, 4, 1, 5, 9, 2, 6, 5, 3]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2]], [[3, 3, 3, 3, 3, 3]], [[3, 3, 3, 3]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 123]], [[2, 2, 8, 2]], [[1, 2, 3, 4, 5, 6, 7, 10]], [[3, -3, 3, 3, 3, 3, 3]], [[1, 1, 2, 3, 4, 5, 6, 7, 10]], [[5, 0, 5, 0, 5, -12, 0, 5, 0]], [[1, 2, 3, 4, 6, 7, 8, 2]], [[5, -2, -12, 4, 4, 23, 2, 3, 11, 12, -10]], [[3, 2, 3, 3, 3, 3]], [[1, 2, 3, 4, 6, 7, 7, 8, 2]], [[-7, 2, 3, 4, 5, 6, 7, 10, 2]], [[-7, 2, 3, 4, 5, 6, 7, 10, 5, 10]], [[3, 1, 1, 1, 1, 2, 2, 2, 2]], [[6, 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 3, 6]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3]], [[2, 2, 2, 123]], [[-7, 2, 3, 4, 5, 7, 7, 10, 2, 4]], [[6, 3, 6, 1, 4, 1, 5, 9, 2, 6, 5, 3, 3, 6]], [[5, -2, -12, 11, 4, 4, 23, 2, 4, 3, 11, 12, -10]], [[3, 2, 3, 3, 3, -5, 3]], [[6, 3, 6, 1, 4, 1, 5, 9, 2, 6, 5, 3, 6]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -10, 3]], [[3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, 122]], [[1, 2, 3, 4, 6, 7, 2, 2]], [[1, 2, 8, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 2]], [[5, -2, -12, 4, 23, 2, 3, 3, 11, 12, -10, 3]], [[5, 3, -5, 2, -3, 3, -9, 0, 6, 123, 1, -10, 123]], [[1, 1, 1, 1, 1, 1, 1, -10, 1]], [[5, 0, 6, 0, 5, -12, 0, 5, 0]], [[11, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7]], [[5, -2, -12, 4, 23, 2, 3, -13, 11, 12, -10, 3, 2, 4]], [[11, -7, 2, 10, 0, 9, 5, -3, 2, 8, 2, 3, 7]], [[1, 1, 1, 1, 2, 2, 2, 2, 1]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3, 1]], [[1, 1, 1, 1, 2, 0, 2, 2, 2]], [[5, 0, 6, 0, 5, -12, 0, -5, 3]], [[-7, 2, 3, 4, 3, 5, 7, 7, 10, 2, 4, 4]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3, 2]], [[1, 2, 3, 4, 5, 6, 7]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 1, 3, 11]], [[12, 3, 10, 3]], [[6, 3, 5, 1, 4, 1, 5, 9, 2, 6, 5, 3, 6]], [[5, 3, -5, 2, -3, -9, 0, 123, 1, -10, 123]], [[1, 1, 1, 1, 1, 1, 1, 1, 1]], [[3, 2, 3, 3, 4, 3, -5, 3]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 2]], [[1, 2, 4, 3, 4, 5, 6, 7, 10]], [[3, 1, 4, 1, 9, 2, 6, 5, 3]], [[5, -2, -12, 4, 4, 123, 23, 2, 3, 11, 12, -10]], [[5, -2, -12, 4, 4, 23, 3, 11, 12, -10, 4]], [[5, -2, -12, 4, 4, 123, 23, 2, 3, 11, 12]], [[1, 1, 3, 4, 6, 7, 8, 2]], [[4, -2, -12, 4, 23, 2, 3, 11, 12, -10]], [[-5, -7, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2]], [[5, 3, -5, 12, -3, 3, -9, 0, 123, -10]], [[-3, 1, 1, 1, 2, 2, 1, 2, 2, 3, 1, 1]], [[-5, -7, 2, 10, 11, 0, 9, 5, 2, 8, 3, 7]], [[-7, 2, 3, 4, 6, 7, 10, 5, 10]], [[3, 3, 3, 3, 6, 3]], [[-7, 2, 3, 4, 6, 7, 10, 5, 10, 10, -7]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7]], [[5, 3, 6, -5, 2, -3, 3, -9, 0, 123, 1, -10]], [[2, 2, 2, 123, 2]], [[3, 3, 3, 2, 6, 3]], [[1, 1, 1, 1, 2, 0, 2, 2, 2, 1]], [[1, 2, 8, 2, 2]], [[3, -5, 12, -3, 3, -9, 0, 123, -10]], [[3, 2, 3, 3, 4, 4, 3, -5, 3]], [[3, 2, 2, 6, 123, 2]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8]], [[3, -3, 1, 1, 1, 2, 2, 2, 3, 2]], [[5, 3, -5, 2, -3, -2, 3, -9, 0, 123, 1, -10, -9]], [[5, 3, -5, -4, 2, -3, 3, -9, 0, 123, 1, -10, 123]], [[11, -7, 2, 10, 2, 9, 5, -3, 2, 8, 3, 7]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8, 3]], [[5, -2, -12, 23, 2, 3, 11, 12, -10, 3]], [[2, 2, 2, 123, 2, 123]], [[1, 3, 4, 7, 2, 2]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 8, 2]], [[12, 3, 10, 3, 12, 10]], [[2, 3, 4, 5, 7, 7, 10, 2, 4]], [[3, -3, 1, 1, 1, 2, 2, 2, 3, 3, 2]], [[-3, 2, 2, 3, 4, 6, 7, 8, 2, 1]], [[-5, -7, 123, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8]], [[2, 2, 2, 123, 2, 122]], [[5, 3, -5, 2, -3, -2, -9, 0, 123, 1, -10, -9]], [[5, 3, -5, 2, -3, -2, 3, -9, 0, 1, -10, -9]], [[5, 3, -5, 2, -3, -3, 3, -9, 123, 1, -10]], [[6, 1, 2, 3, 4, 5, 6, 7, 6, 8, 2]], [[1, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7]], [[-5, 4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8]], [[5, 3, -5, 2, -3, -9, 0, 123, 1, -10, 123, 5]], [[6, 3, 6, 1, 4, 1, 5, 9, 2, 6, 5, 3, 3, 6, 2]], [[9, -7, 2, 3, 4, 6, 7, 10, 5, 10]], [[123, 2, 3, 4, 5, 6, 7, 8]], [[4, -2, -12, 4, 23, 2, 3, 11, 12, -10, 4, -12]], [[1, 2, 3, -4, 6, 7, 8, 2]], [[2, 2, 123, 2, 122]], [[1, 1, 1, 2, 2, 2, 2]], [[-7, 2, 3, 4, 5, 7, 7, 10, 4, 2]], [[1, 1, 1, 1, 2, 0, 2, 2, 1, 1]], [[-5, -7, 123, 2, -3, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8]], [[1, 1, -4, 0, 2, 2, 2, 2, -5, 2]], [[1, 1, 3, 4, 5, -3, 7, 10]], [[3, 2, 3, 3, 3, 3, 3, 3]], [[-7, 2, 3, 4, 5, 6, 7, 10, 2, 4]], [[-3, 2, 2, 2, 4, 6, 7, 8, 2, -7, 1]], [[-5, -7, -2, 10, 11, 0, 9, 5, 2, 8, 3, 7]], [[-5, -7, 2, 10, 9, -3, 2, 8, 3, 7, 2, 8, 2]], [[3, 3, 3, 3, 4, 3, 3]], [[5, -2, -12, 4, 23, 2, 3, -13, 11, 12, -10, 3, 2, 4, -10]], [[2, 8, 2, 2, 2]], [[1, 1, 5, 3, 4, 5, -3, 7, 10]], [[5, 0, 5, 0, 5, -12, 0, 5]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 12, 1, 3, 11]], [[3, -3, 4, 3, 3, 3, 3, 3]], [[-7, 2, 3, 4, 4, 6, 7, 10, 5, 10]], [[6, 3, 3, 3, 3, 3]], [[1, 2, 3, -4, 6, 7, 8, 2, 2, 8]], [[-3, 2, 2, 3, 4, 6, 7, 123, 8, 2]], [[4, -2, -12, 4, 23, 2, 3, 11, 12, -10, 4, -12, 23]], [[2, 2, 122, 2, 123, 2, 123]], [[2, 2, 2, 123, 2, 11, 123]], [[2, 2, 2, 2, 2]], [[-5, -7, 2, 10, 11, 0, 9, 5, 2, 8, 11, 7]], [[3, -3, 1, 1, 1, 2, 2, 2, 3, 3, 2, 2]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 2, 2]], [[1, 2, 3, 4, 5, 6, 7, 7]], [[-5, -7, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2]], [[5, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, 1, -10, -9]], [[-7, 2, 3, 4, 6, 7, 10, 5, 10, 7]], [[-7, 2, 3, 4, 5, 6, -2, 7, 10, 2, 4]], [[-5, -7, 2, -5, 2, 9, -4, -3, 2, 8, 7, 3, 7, 2, 2]], [[6, 1, 2, 3, 4, 6, 7, 6, 8, 2]], [[3, -5, 12, -3, 3, 0, 123, -10, 123]], [[5, 3, -5, -4, 2, -3, 3, -10, 0, 123, 1, -10, 123]], [[1, 2, 3, -12, 5, 6, 7, 10]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 2, -3]], [[6, 3, 4, 3, 3, 4]], [[2, 2, 8, 2, 2]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7, 6]], [[6, 5, 3, 6, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 2]], [[1, 0, 3, 4, 5, -3, 7, 10]], [[-7, 2, 3, 4, 6, 7, 10, 5, 4, 7]], [[2, 2, 3, 2, 2]], [[6, 3, 4, 3, 3, 3, 4, 3]], [[2, 3, 4, 6, 7, 10, 5, 10, 7, 2]], [[5, 3, -4, 2, -3, 3, -9, 0, 123, 1, -10, 2, -3, -10]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, 1, -10, -9]], [[-5, -7, 2, -5, 2, 9, 5, -4, -12, 2, 8, 7, 3, 7, 2, 2]], [[1, 4, 1, 9, 2, 6, 5, 3]], [[4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8, 2]], [[4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8, 2, 2]], [[-3, 1, 1, 1, -5, 2, 1, 2, 2, 3, 1, 1]], [[4, -2, -12, -9, 23, 2, 3, 11, 12, -10, 4, -12]], [[3, 1, 4, 1, 6, 9, 2, 6, 5, 3]], [[-7, 2, 3, 4, 5, 6, 7, -5, 10, 2]], [[2, 3, 4, 4, 6, 7, 10, 5, 10]], [[3, 10, 3]], [[3, 1, 4, 1, 5, 9, 9, 2, 6, 5, 3]], [[1, 1, 1, 1, 1, 2, 0, 2, 2, 2]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 12, 2]], [[2, 2, 3, 4, 7, 7, 8, 2, 8, 2]], [[-5, -7, 2, 10, 0, 5, -3, 2, 8, 3, 7, 0]], [[-5, -7, 123, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8]], [[5, 0, 6, 0, 5, -12, 0, -5, 3, -5]], [[-5, -7, 11, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 3, 3, 2]], [[0, 3, -5, 2, -3, -3, 3, -9, 123, 1, -10]], [[6, 3, 3, 4, 3, 3, 3]], [[1, 1, 1, 1, 2, 0, 2, 2, 2, 1, 2, 2]], [[-5, 4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8, 2]], [[5, 3, -5, -3, -9, 0, 123, 1, -10, 123, 123]], [[1, 2, 3, 4, 4, 6, 7, 8, 2, 4, 3]], [[1, 1, 1, 1, 1, -5, 1, 1, -10, 1]], [[1, 3, 4, 6, 7, 8, 2]], [[5, 3, -4, 2, 3, -9, 0, 123, 1, -10, 2, -3, -10]], [[5, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -10, -9, 2]], [[5, 3, -5, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123, 5]], [[5, -2, -12, 23, 2, 3, 11, 12, 3]], [[1, 3, 4, 7, 2, 2, 4]], [[5, -11, 4, 6, -5, 2, -3, 3, -9, 0, 123, 1, -10]], [[1, 2, 3, -4, 6, 7, 2, 2, 8]], [[1, 1, 1, 1, 1, -2, 2, 0, 2, 2]], [[4, -2, -12, -9, 23, 2, 3, 11, 12, -10, 4, -12, 4]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7, 6, 6]], [[1, 2, 4, 6, 7, 7, 8, 2, 2, 7]], [[6, 3, -3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 6, 2]], [[-5, 4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 4, 2, 2, 8, 2]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 12, 2, 11, 9]], [[3, -3, 3, 3, 3, 3, 3, 3]], [[3, 3, 3, 2, 6, 3, 3]], [[2, 3, 4, 6, 7, 10, 5, 10, 7, 2, 6]], [[2, 2, 3, 4, 6, 7, 8, 2, 2, 7]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -5, 1, -10, -9]], [[-5, 2, 3, -12, 5, 6, 7, 10]], [[-7, 2, 3, 4, 6, 7, 10, 10, 7]], [[1, 2, 3, -4, 6, 7, 8, 2, 8]], [[5, 3, 7, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123, 5]], [[2, 3, -4, 7, 7, 8, 2, 2, 8]], [[-7, 2, 3, 5, 6, 7, 2, 4, 6]], [[5, -2, -12, 4, 4, 12, 23, 3, 11, 12, -10, 4]], [[2, 2, 3, 4, 6, 7, 7, 3, 8, 2, 2, 7, 6]], [[1, 1, 2, 3, -11, 5, 6, 7, 10]], [[-7, 2, 3, 4, 6, 7, 5, 10]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -5, 1, -10, -9, 3]], [[-12, -5, -7, 2, -5, 9, -4, -3, 2, 8, 7, 3, 7, 2, 2]], [[5, 3, -5, -4, 2, -3, 3, -9, 0, 23, 1, -10, 123, 5]], [[1, 1, 1, 1, -2, 2, 0, 2, 2]], [[5, 3, 7, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123]], [[5, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, 1, -10, -9, -8]], [[5, -2, -12, 4, 4, 123, 23, 1, 3, 11, 12]], [[2, -3, 3, 3, 3, 3]], [[-5, -7, 2, -5, 2, 9, -4, -3, 2, 8, 7, 3, 7, 2, 2, 2]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7, 8, 6]], [[5, 2, 3, -5, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123, 5]], [[5, 3, 6, -5, 2, -3, 3, -9, 0, 123, 1, -10, 3, 123]], [[1, 2, 8, 8]], [[-7, 2, 3, 4, 6, 10, 5, 10, 7]], [[1, 1, 1, 1, 1, -5, 1, 1, 1, 1]], [[1, 3, 4, 6, 7, 8, -4, 2]], [[1, 1, 1, -4, 2, 2, 2, 2]], [[-7, 2, 3, 4, 5, 6, 7, 10, 5, 10, -7]], [[3, 1, 4, 1, 6, 9, 2, 6, 5, 3, 6]], [[5, -2, -12, 4, 4, 123, 23, 2, 3, 11, 12, 4]], [[1, 2, 4, 3, 4, 5, 6, 7, 10, 4]], [[6, 1, 1, 2, 3, 4, 5, 6, 8]], [[1, 8, 10]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 2, 2, 3]], [[1, 2, 3, -4, 6, 8, 2, 8]], [[3, 3, 2, 6, 3, 3]], [[5, 0, 5, 0, 4, 0, 5, 0]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3, 2, -3]], [[122, -2, -12, 4, 23, 2, 3, 3, 11, 12, -10, 3]], [[-8, 3, -2, 3, 3]], [[-5, -7, 2, 10, 11, 0, 9, 5, 8, 11, 7]], [[11, -7, 2, 10, 2, 9, 5, -3, 2, 8, 3, 7, 10]], [[2, 1, 1, 2, 3, 4, 5, 6, 7, 10, 2]], [[1, 1, 3, 4, 5, -3, 7, 10, 1]], [[-13, 2, 3, 4, 5, 6, 7]], [[1, 2, 8, 2, 3, 8]], [[5, 3, -5, 2, -3, -2, 0, 123, 1, -10, -9]], [[1, -12, 1, 2, 3, -11, 5, 6, 7, 10]], [[11, -7, 2, 10, 0, 9, 5, -3, 2, 2, 3, 7]], [[-3, 2, 2, 4, 6, 7, 123, 8, 2]], [[-7, 2, 2, 10, 11, 0, 9, 5, 2, 8, 11, 7]], [[-7, 2, 3, 4, 5, 7, 10, 5, 4, 7]], [[1, 2, 3, -12, 5, 6, 7]], [[2, 2, 3, 4, 6, 7, 8, -5, 2, 2, 7]], [[-7, 2, 3, 4, 5, 6, 7, 10, 2, 4, 4]], [[5, -2, -12, 11, 4, 4, 23, 2, 4, 3, 12, -10]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3, 2, -3, 1]], [[3, -3, 1, 1, 1, 2, 2, 2, 3, 3, 2, 3]], [[-3, 1, 1, 1, 2, 2, 1, 2, 2, 3, 1, 1, 1]], [[2, 1, 1, 2, 3, 4, 5, 6, 7, 10, 2, 1]], [[1, 4, 1, 9, 2, 6, 5]], [[-7, 2, 3, 4, 7, 10, 5, 10, 10, -7]], [[-3, 2, 10, 2, 2, 4, 6, 7, 4, 2, -7, 1]], [[5, 3, 7, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123, -3]], [[5, -5, 2, -3, -3, 3, -9, 123, 1, -10]], [[1, -4, 6, 7, 2, 2, 8]], [[4, -2, -12, 4, 23, 2, 3, 11, 12, -10, 4, -12, -12]], [[-3, 2, 2, 3, 4, 6, 7, 122, 123, 8, 2]], [[1, -4, 6, 7, 2, 2, 8, -4]], [[4, -2, -12, 4, -5, 23, 2, 3, 11, 12, -10]], [[5, -5, 2, -3, -2, 1, -9, 1, -9]], [[5, 3, -5, 2, -3, -9, 0, 123, 1, -10, 123, 5, 1]], [[4, 2, 2, 0, 9, 5, 2, 8, 3, 7, 2, 2, 8, 2]], [[3, 4, 3, 3]], [[1, 2, 4, 3, 4, 5, 6, 7, 10, 4, 4]], [[1, 1, 1, 1, 1, 2, 1, 1, 1]], [[5, 0, 5, 0, 5, -12, 0, 5, -12]], [[1, 1, 2, 2, 2, 2]], [[5, 3, 11, 2, -3, -3, 3, -9, 123, 1, -10]], [[2, 2, 3, 2, 2, 3]], [[5, -2, -12, 4, 4, 23, 3, 11, 12, -10, 4, 4, 3]], [[-7, 2, 3, 4, 5, 6, 7, 5, 10, 2]], [[2, 3, 3, 3, -5, 3]], [[1, 1, 1, 1, 1, 1, -2, 2, 0, 2, 2, 0]], [[5, 3, -5, 2, -3, -2, -9, 0, 123, 1, -10, -9, -10]], [[5, -2, -12, 23, 2, 3, 11, 12, 3, 2]], [[6, 3, 3, 6, 4]], [[2, 3, 4, 6, 7, 10, 5, 10, 7, 2, 6, 7, 7]], [[2, 3, 3, 4, 6, 7, 7, 8, 2, 2]], [[1, 3, 4, -8, 7, 2, 2]], [[-12, -5, -7, 2, -5, 9, -4, -3, 2, 8, 7, 3, 7, 2]], [[2, 2, 2, 123, -7, 2, 11, 123]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, 2, -8, 0, -10, -9]], [[1, 8, 10, 8]], [[5, 3, -5, -4, 2, -3, 3, 0, 123, 1, -10, -2, 123]], [[122, 5, 3, -5, 2, -3, -9, 0, 123, 1, -10, 123]], [[6, 3, 3, -3, 3, 4, 3]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 4, 7, 12, 2, 9]], [[2, 3, 4, 5, 7, -4, 9, 2, 5, 4]], [[3, 3, 3, 3, 4, 4, 3]], [[1, 1, 1, 1, 1, 1, 1]], [[5, 3, -5, 5, -3, -2, 3, -9, 0, 1, -10, -9]], [[4, -2, -12, 4, 23, 2, 3, 11, 12, 4, -12]], [[1, 1, 1, 2, 0, 2, 2, 1, 1]], [[6, 3, 3, 4, 3, 3, 4, 3]], [[6, 3, 3, -3, 3, 4, -2, 3]], [[-7, 2, 3, 4, 5, 6, 7, 10, 5, 10, -7, 7]], [[2, 2, 3, 123, 6, 7, 8, 2, 2, 7]], [[5, -2, -12, 4, 2, 23, 2, 3, -13, 11, 12, -10, 3, 2, 4, -10, 3]], [[-3, 1, 1, 1, -2, 2, 2, 1, 2, 2, 3, 1, 1]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 4, 8, 7, 3, 7, 12, 2]], [[5, -2, -12, -3, 2, 3, 11, 12, 3, 5, 12]], [[1, 1, 1, 2, 10, 2, 2, 1, 1]], [[-3, 2, 2, 3, 4, 6, 7, 122, 123, 8, 2, 8]], [[5, 3, 7, 0, 2, -3, -10, 0, 123, 1, 0, -10, 1, -3, 1]], [[1, 3, 4, 6, 7, 8, -9, -4, 2]], [[-5, -7, 2, -13, 0, 2, 9, -4, -3, 2, 8, 7, 3, 7, 2, 2]], [[1, -4, 6, 5, 7, 2, 2, 8, 6]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -5, -10, -9, 3]], [[-3, 2, 2, 3, 4, 6, 7, 122, 123, 8, 8, 2]], [[3, -3, 1, 1, 2, 2, 2, 2, 1, 3, 11, 2]], [[1, 1, 1, -9, 1, 1, 2, 0, 2, 2, 2]], [[3, -3, 1, 1, 1, 2, 2, 3, 3, 2, 2]], [[2, 3, -4, 8, 7, 7, 8, 2, 2, 8]], [[6, 3, 3, -3, 4, -2, 3]], [[5, -13, 3, -5, 2, -3, -2, 3, -8, 0, 1, -10, -9]], [[5, -5, 2, -3, -9, 0, 123, 1, -10, 2, -3]], [[3, 3, 3, 3, 4, 7, 3, 2]], [[5, 3, -5, 2, -3, -2, 3, -9, 0, 123, 1, -10, -9, -10, 123]], [[2, 2, 2]], [[11, -7, 2, 10, 2, 9, 5, -3, 10, 8, 3, 7]], [[1, -11, 3, -11, 5, 6, 7, 10, 3]], [[3, -3, 1, 1, 1, 2, 2, 3, 2, 3, 2, -3, 3]], [[-7, 3, 4, -11, 7, 10, 10, 7]], [[5, 123, 3, 7, 0, 2, -3, -10, 0, 123, 1, 0, -10, 123]], [[3, -7, 2, 10, 11, 0, 9, 5, 2, 8, 11, 7]], [[-7, 2, 3, 4, 5, 6, 7, 10, 5, 10, 6, -7]], [[6, 3, 23, 3, 3, 3, 3]], [[3, 3, 3]], [[2, 2, 3, 2, 2, 2]], [[2, 1, 1, 2, 2, 4, 5, 6, 7, 10, 2, 1]], [[1, 3, 4, 6, 7, 8, 2, 6]], [[1, 2, 4, 3, 4, 5, 6, 12, 10, 4]], [[11, -7, 2, 10, 0, 5, -3, 2, 8, 3, 7]], [[6, 3, 23, 3, -12, 3, 3, 3]], [[-5, -7, -6, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2, 8, 2]], [[1, 1, 1, 1, 2, 0, 2, 2, 1, 1, 1, 2]], [[2, 4, 6, 7, 7, 8, 2, 2, 4]], [[6, 3, 3, 6, 4, 3]], [[3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 2]], [[1, 1, 1, 1, 1, 1, -10, 1]], [[-13, 3, 4, 5, 6, 7]], [[-7, 2, 3, 4, 5, 7, 10, 5, 10, -7, 7]], [[-3, 1, 1, 1, 2, 2, 3, 2, 3, 2, -3, 3]], [[11, -7, -5, 2, 10, 2, 9, 5, -3, 2, 8, 3, 7]], [[5, 3, 6, -5, 2, -3, 3, -9, 0, 123, 1, -10, 123]], [[5, 3, 6, -5, 2, -3, -9, 0, 123, 1, -10, 3, 123, 123, -9]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -5, 1, -10, -9, 3, -2]], [[2, 2, 123, 2, 122, -11]], [[4, -2, -12, 4, -5, 23, 122, 3, 11, 12, -10]], [[5, -13, 3, -5, 2, -3, -2, 3, -8, 0, 1, -10, -9, -10]], [[5, 3, -5, -4, 2, -3, 3, -9, 0, 123, 1, 123, 3]], [[2, 2, 3, 123, 6, 7, 8, 2, 2, 7, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 5]], [[-7, 2, 3, 4, 6, 7, 10, 10, 7, 4]], [[1, 1, 1, 1, 1, 2, -11, 23, 1, 1]], [[11, -3, 1, 1, 1, 2, 2, 2, 3, 3, 2, 3]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 1, 3, 2, 2]], [[-5, -7, -6, 2, 10, 0, 9, 5, -3, 2, 8, 7, 2, 8, 2]], [[4, -2, -12, -9, 23, 2, 3, 11, 13, -10, 4, -13, -12, 4]], [[3, 1, 4, 1, 5, 9, 2, 1, 6, 5, 3, 3, 6]], [[5, -13, 4, 3, -4, 2, -10, -3, -2, 3, -8, 0, 1, -10, -9, -8]], [[-5, -7, -2, 10, 11, 0, 8, 9, 5, 2, 8, 4, 7]], [[-3, 2, 2, 4, 6, 7, 123, 7, 8, 2]], [[-5, -7, 2, -5, 2, 9, -4, -3, 2, 8, 7, 3, 7, 3, -7, 2, -4]], [[11, -7, 2, 10, 0, 5, -3, 2, 8, 3, 7, 5]], [[-7, 2, 3, 4, 6, 7, 10, 5, 7, 4]], [[2, 8, 10, 8]], [[122, -3, 4, 3, 3, 3, -4, 3, 3]], [[122, -3, 4, 3, 3, -4, 3, 3]], [[5, 3, 6, -11, -5, 2, -3, -9, 0, 123, 1, -10, 3, 123, -9]], [[6, 3, 24, 3, 3, 3]], [[-7, 2, 3, 4, 6, 7, 10, 5, 10, 7, 7]], [[6, 1, 2, 4, 3, 4, 5, 6, 7, 10, 4, 4]], [[1, 2, 3, -12, 5, 6, 3, 7, 10]], [[1, -12, 1, 2, 3, -11, 5, 6, 7, 10, 5]], [[2, 2, 3, 4, 7, 13, 123, 8, 2]], [[2, 1, 2, 6, 1, 2, 3, 4, 5, 6, 7, 2, 1, 4, 2]], [[4, -2, -12, -9, 23, 2, 3, 11, 13, -10, 13, 4, -13, -12, 4]], [[2, 3, 2, 2, 2]], [[5, 0, 5, 0, 5, -12, 0, -5, 3, -5, 1]], [[5, 3, -5, -4, 2, -3, 3, -9, 0, 23, 1, -10, 123, 5, -10]], [[-5, -7, 2, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 12, 2, 11, 9, 8]], [[3, -3, 1, 1, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3]], [[4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8, 2, 2, 2]], [[5, 0, 6, 0, 5, -12, -5, 3, -5, -5]], [[3, 10, 3, 3]], [[2, 3, -8, 3, 3, -5, 3]], [[2, 3, -4, 8, 7, 8, 2, 2, 8]], [[1, 3, 4, 7, 2]], [[-5, -7, 2, 10, 9, -3, 2, 8, -6, 7, 2, 8, 2]], [[1, 2, 3, 0, 4, 5, 7, 8, 2, 2]], [[-7, 2, 3, 5, 7, 10, 5, 10, -7, 7, 2]], [[3, -3, 1, 1, 1, 2, 2, 2, -2, 2, 3, 2, -3, 1]], [[-3, 1, 1, 1, 2, 2, 1, 2, 2, -2, 1, 1, 1, 1]], [[1, 3, 4, 6, 7, 8, -9, -4, -4, 2]], [[-7, -6, 2, 10, 0, 9, 8, 5, -3, 2, 8, 3, 7, 2, 8, 11, 2, 7]], [[3, -3, 4, 3, -13, 3, 3, 4]], [[2, 2]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, -7, -5, 1, -10, -9, 3]], [[1, 2, 4, 6, 7, 7, 8, 2]], [[2, 3, 3, 123, 6, 7, 2, 2, 7, 2]], [[1, 1, 1, 1, 2, 0, 2, 2, 2, 1, 1, 2, 2]], [[5, 2, -13, 3, -5, 2, -10, -3, -2, -2, 3, 2, -8, 0, -10, -9, -10, 3]], [[2, 3, 4, 5, 6, 7, 10, 5, 10]], [[1, 2, 3, 4, 6, 7, 7, 8, 10, 2]], [[3, -3, 1, 1, 1, 2, 2, 3, 2, 3, 2, -3, 3, 2, 3]], [[1, 3, -8, -7, 7, 2, 2]], [[1, 1, 1, 1, 1, 0, 2, 2, 2]], [[-13, 3, 4, 5, 6, 7, 6]], [[2, 8, 2, 2, 3, 2]], [[-5, 8, -5, 2, 9, 5, -3, 2, 8, 7, 3, 7, 2]], [[1, -12, 1, 2, 3, -11, 5, 5, 6, 7, 10, 5, 1]], [[4, -2, -12, -9, 23, 3, 11, 13, -10, 13, 4, 122, -12, 4]], [[-7, 2, -8, 3, 5, 7, 10, 5, 10, -7, 7, 2]], [[1, 2, 1, 1, 2, 2, 2, 2]], [[-7, 3, 4, -11, 10, 10, 7]], [[3, 1, -3, 1, 1, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 1]], [[2, 8, 2, 2, 4, 2]], [[3, 2, -3, 1, 1, 1, 2, 2, 2, 2, 3, 2]], [[5, -5, 2, -3, -2, 1, -7, 1, -9]], [[5, 0, 5, 0, 5, -1, 5, 0]], [[1, 3, 4, -8, 2, 2, -8]], [[5, 5, 0, 5, -1, 5, 0]], [[3, 2, -3, 1, 1, 6, 1, 2, 2, 2, 3, 2]], [[4, -2, -12, 4, -5, 23, 2, 3, -4, 11, 12, -10]], [[2, 3, 4, 5, 7, 7, 10, 2, 7]], [[1, 1, 1, 2, 2, 2, 2, 1]], [[3, 2, 3, 3, 3, 3, 3]], [[-3, 2, 2, 3, 4, 7, 7, 123, 2, 3]], [[5, -2, -10, 4, 4, 12, 23, 3, 11, 12, -10, 4, 4]], [[-6, 5, -13, 3, -5, 2, -10, -3, -2, 3, -8, 0, 1, -10, -9, -8]], [[-7, 3, 4, 3, 5, 7, 7, 10, 2, 4, 4, 3]], [[-4, -5, 4, 2, 2, 0, 9, 5, -3, 2, 8, 3, 7, 2, 2, 8]], [[1, 1, 1, 1, 0, 2, 10]], [[2, 3, 3, 123, 6, 6, 7, 2, 2, 7, 2]], [[6, 3, 5, 1, 1, 5, 9, 2, 6, 4, 5, 3, 6]], [[5, 3, -5, 2, -3, -2, 3, -9, 0, 123, 1, -10]], [[1, 2, 3, 4, 6, 7, 7, 8, 2, 2]], [[11, -7, 2, 10, 2, 9, 5, -3, 2, 8, 3, 7, 10, -7]], [[1, 12, 3, 4, 6, 7, 7, 8, 10, 2, 2]], [[-10, 3, 7, 0, 2, -3, -10, -9, 0, 123, 1, 0, -10, 123]], [[2, 1, 1, 2, 2, 4, 5, 6, 7, 10, -8, 1]], [[1, 3, 4, 6, 8, 2]], [[-7, 2, 3, 4, 7, 10, 5, 10, 10, -7, 10]], [[1, 1, 1, 0, 2, -12, 10]], [[6, 3, 6, 1, 4, 1, 10, 9, 2, 6, 2, 5, 3, 6]], [[2, 2, 2, 123, 2, 123, 2]], [[11, 1, 2, 10, 0, 5, -3, 2, 8, 3, 7]], [[-5, -7, 2, 10, 0, 5, 123, -3, 2, 8, 3, 7, 0]], [[1, 1, 1, 1, 2, 0, 2, 2, 2, 1, 1, 2, 2, 2]], [[-13, 3, 4, 5, -14, 6, 6, 7, 3]], [[5, 2, -13, 3, -5, 2, -10, -2, 3, 2, -8, 0, -10, -9]], [[1, 2, 3, 4, 6, 7, 8, 10, 2]], [[-3, 1, 1, 1, 2, 2, 1, 2, 2, 13, 1, 1, 1]], [[122, 4, 3, 2, -4, -11, 3, 3]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 1]], [[-14, 3, 4, 3, 3]], [[1, 2, -4, 6, 2, 8]], [[8, -5, -7, -2, 10, 11, 0, 8, 9, 5, 2, 8, 4, 7, 0]], [[2, 3, 2, 2, 8, 2, 2]], [[1, 3, -4, 6, 7, 8, 2, 7]], [[6, 3, 3, -3, 4, -2, 3, 3]], [[-3, 2, 2, 3, 4, 6, 7, 122, 123, 8, 8, 2, 7, 4, 8]], [[1, 2, 1, 8, 2]], [[1, 2, 8]], [[-5, -7, -6, 2, 10, 0, 9, 5, -3, 2, 11, 7, 2, 8, 2]], [[1, 2, 3, 4, 5, 6, 7, 7, 1]], [[5, -14, 3, 6, -5, -6, -3, 3, -9, 0, 123, 1, -10, 123]], [[1, 1, 1, 1, 1, -5, -10, 1, 1, 1]], [[5, -2, -12, 4, 4, 123, 23, 3, 11, 12, 4, 4]], [[1, -10, 1, 2, 2, 2, 2, 1]], [[2, 2, 3, 4, 6, 7, 7, 8, 2, 2, 7, 6, 2]], [[2, 2, 0, 9, 5, 2, 8, 3, 7, 2, 2, 8, 2]], [[2, 4, 6, 0, 7, 10, 5, 10, 7, 2, 8, 10]], [[6, 3, 3, 6, 4, 3, 3]], [[2, 2, 3, 4, 11, 6, 7, 7, 8, 2, 2, 7, 6]], [[5, 3, 6, -5, 2, -3, 3, 0, 123, 1, -10, 5]], [[1, 1, 3, 4, 6, 7, 8, -9, -4, -4, 6, 2]], [[-3, 1, 1, 1, -5, 2, 1, 2, 2, 3, 1, 2]], [[12, 8, 10, 3]], [[3, -3, 1, 1, 1, -10, 2, 3, 3, 2, 2]], [[2, 2, 2, 8, 2, 2]], [[1, 9, 1, 1, 2, 1, 1, -5, 1, 1, 1, 1]], [[3, 3, 6, 4]], [[-14, 3, 4, 2, 3, 3, 3]], [[122, -5, 4, 3, 3, 3, 3, -4, 3, 3]], [[5, -2, -12, 23, 2, 3, 11, 12, -10, 3, 3]], [[1, 1, 10, 1, 4, 0, 2, -12, 10, 4]], [[3, 11, 2, -3, -3, 3, -9, 123, 1, -10]], [[5, 6, 5, 4]], [[1]], [[5, 5, 5, 5, 5, 5]], [[1, 3, 5, 7, 9]], [[2, 4, 6, 8]], [[2, 2, 2, 1, 1, 1]], [[1, 1, 1, 1, 0, 1, 1, 1, 1]], [[2, 2, 2, 3, 2]], [[1, 2, 3, 5, 6, 7, 8]], [[5, 3, -5, -3, 3, -9, 0, 123, -2, -10]], [[5, 3, -5, 3, -9, 0, 123, -2, -10]], [[5, 0, 5, 5, 0, 5, 0]], [[1, 2, 3, 4, 6, 7, 8]], [[2, 2, -5, 2, 2]], [[2, 1, 1, 1, 1, 1, 1, 1, 1]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -9]], [[5, 0, 5, 5, 0, 5, 0, 5]], [[5, 0, 5, 5, 0, 5, 0, 5, 0]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10]], [[3, 1, 4, 1, 5, 9, 6, 5, 4]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, 10]], [[1, 1, 1, 2, 1, 0, 1, 1, 1, 1]], [[5, 3, -5, -3, 3, -2, -9, 0, 123, -2, -10]], [[5, 0, 5, 5, 0, 5, 0, 5, 0, -2, 5]], [[5, 3, -5, -3, 3, -2, -9, 0, 123, -2]], [[1, 6, 23, 1, 1, 7, 1, 1]], [[1, 6, 23, 1, 1, 7, 1, 2, 1]], [[5, 3, -5, 2, -2, 3, -9, 0, 123, 1, -10, 1]], [[1, 2, 3, 2, 3, 6, 7, 8, 2]], [[5, 0, 5, 0, 5, 0, 5, 0, -2, 5]], [[5, 0, 5, -1, 5, 0, 5, 0]], [[1, 2, 4, 5, 5, 6, 7, 8]], [[1, 1, 1, 1, 2, 2, 2, 2, 2]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5]], [[1, 2, 2, 3, 2]], [[1, 1, 1, 2, -12, 0, 1, 1, 1, 1]], [[1, 1, 1, 1, 0, 0, 1, 1, 1, 1]], [[5, 3, -5, 23, -3, 3, -9, 0, 123, 1, -10]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5, 0]], [[1, 2, 4, 5, 5, 6, 8]], [[1, 1, 1, 2, 1, 0, 0, -12, 1, 1, 1, 1]], [[5, 10, -6, 2, -3, 3, -9, 0, 1, -10, 10]], [[5, 10, -6, 2, -3, 3, -9, 0, 1, -10, 10, 2]], [[-5, -7, 2, 10, 0, 9, 5, -5, 2, 8, 3, 7, 9]], [[5, 3, 4, 3, 3]], [[1, 2, 2, 3, 2, 1]], [[3, 1, 4, 1, 5, 9, 2, 6, 5]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0]], [[5, 0, 5, -1, 5, 0, 5, 0, 0]], [[1, 2, 3, 2, 3, 6, 2, 7, 8, 2]], [[6, 5, 0, 5, 5, 0, 5, -1, 5, 5, 0, 5]], [[-2, 2, 4, 5, 5, 6, 7, 8, -2]], [[5, 0, 5, 5, 0, 6, 5, -1, 5, 5, 0, 5]], [[3, 1, 4, 1, 5, 9, 6, 4, 4]], [[5, -3, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5]], [[5, -3, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5, 1]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0, 5, 5]], [[5, 4, 4, 5, 0, 5, 0, 5]], [[-10, 2, 2, 2, 2]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0, 5]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0, 5, 0]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 3]], [[3, 4, 3]], [[-2, -5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7]], [[0, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, -5]], [[1, 2, 4, 5, 5, 4, 6, 8]], [[2, 3, 2, 9, 3, 6, 7, 8, 2]], [[2, 3, 2, 9, 3, 6, 7, 8, 9, 2, 2, 3]], [[5, -6, 2, -3, 3, -9, 0, 1, -10, 10, 2]], [[1, 1, 1, 2, -12, 0, 1, 1, 1, -5]], [[5, -6, 2, -7, -3, 3, -9, 0, 1, -10, 10, 2, 1]], [[1, 2, 2, 2, 2]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, 2, -3]], [[5, 0, 5, 5, 0, 5, 4, 0, 0, 5, 0, 5]], [[5, 0, 5, 5, 5, 0, 5, 0]], [[2, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1]], [[2, 2, -5, 6, 2, 2]], [[1, 2, 4, 5, 2, 6, 7, 8]], [[5, 0, 5, -1, 5, 0, 9, 0, 0]], [[1, 2, 1, 1, 1, 0, 0, -10, 1, 1, 1, 1, 1]], [[1, 2, 2, -11, 2, 1]], [[1, 1, 23, 1, 0, 8, 1, 1, 1]], [[5, 10, -6, 2, 2, -3, 3, -9, 0, 1, -10, 10, 3, 2]], [[2, 3, 2, 9, 6, 7, 8, 2]], [[1, 2, 123, 5, 5, 4, 6, 8]], [[2, 3, 1, 2, 9, 6, 7, 6, 8, 2, 9]], [[1, 2, 2, 3, 2, 6]], [[5, 3, -5, 23, -3, 3, -9, 0, 123, -1, -10]], [[1, 1, 1, 1, 0, 1, 1, 1]], [[2, 1, 1, 1, 2, 1, 0, -3, 1, 1, 1]], [[1, 1, 23, 1, 0, 8, 1, 1, 1, 1]], [[5, 0, 5, 0, 5, 0, 8, 0]], [[1, 2, 4, 5, 5, 6, 8, 1]], [[1, 1, 1, 1, 0, 0, 2, 1, 1, 1, 1, 1]], [[1, 1, 1, 0, 0, 12, 1, 1, 1, 1, 1]], [[1, 1, 2, 3, 2, 6]], [[5, 3, 10, -5, 2, -3, -9, 0, 123, 1, -10, 10]], [[1, 2, 5, 5, 4, 6, 8]], [[2, 11, -5, 6, 2, 2, 2]], [[1, 1, 1, 2, 1, 0, 0, -12, 1, 1, 1]], [[1, 2, 2, -11, 2, 0]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -9, 3, 3]], [[1, 2, 123, 5, 5, 4, 6, 8, 123, 5]], [[5, 3, 10, -5, 2, -3, 3, -9, -6, 123, 1, 10]], [[6, 3, -5, -3, 3, -2, -9, 0, 123, -2]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 10, 3, 7, 2, -3]], [[5, 4, 4, 5, 0, 5, 0, 5, 0]], [[5, 3, -5, 23, -3, 3, -9, 0, 123, 1, 3, -10]], [[-2, -5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 3, 7, -5]], [[5, 0, 5, 0, 5, 0, 5, 0, 5, 0]], [[5, 0, 5, 5, 0, 6, 5, -1, 4, 5, 5, 0, 5]], [[5, 10, -6, 2, -3, 3, 0, -9, 0, 1, -10, 10, 2]], [[5, 0, 5, 5, 0, 5, 0, 5, 0, -2, 5, 0]], [[5, 3, -5, 23, -3, 3, 4, -9, 0, 123, 1, -10]], [[5, 4, 4, 5, 0, 8, 0, 5]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -10, 5, 2]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 2]], [[5, -6, 2, -3, 3, -9, 0, 1, -9, -10, 10, 2]], [[2, 3, 2, 9, 3, 6, 7, 8, 9, 2, 2, 3, 3]], [[3, 1, 4, 1, 5, 9, 6, 5, 4, 4]], [[5, -2, -1, -12, 4, 23, 2, 3, 11, 12, -10]], [[2, 11, -5, -6, 2, 6, 2, 2, 2]], [[2, 3, 7, 2, 9, 3, 6, 7, 8, 2]], [[2, 1, 2, 3, 2]], [[2, 2, -11, 2, 1]], [[5, 3, 2, -3, 3, -9, 0, 123, 1, -10, 3]], [[5, 0, 5, -1, 6, 0, 9, 0]], [[1, 5, 3, -5, 23, -3, 3, -9, 0, 123, -1, -10]], [[2, 1, 3, 2]], [[5, 4, 4, 5, 0, -11, 0, 5]], [[5, -3, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5, 3]], [[5, -2, -12, 4, 23, 2, 3, 11, 12, -10, 4]], [[1, 1, 1, 2, -12, 0, 1, 1, 1, -5, -5]], [[5, 0, 5, 5, 0, 9, 0, 0]], [[5, 3, -5, 2, -2, 3, -9, 1, 0, 123, 1, -10, 12]], [[-7, 2, 10, 0, 9, 5, -5, 2, 8, 3, 7, 9]], [[1, 1, 1, 1, 0, 1, 1, 0, 1, 1]], [[5, 4, 4, 5, 0, 8, 8, 0, 5]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 3, 3]], [[1, 2, 4, 5, 5, 5, 6, 8, 1, 6]], [[1, 1, 1, 2, 1, 0, -12, 1, 1, 1]], [[5, 0, 5, 0, 5, 0, 5, 0, 5, 0, 5]], [[5, 0, 5, -1, 5, 9, 5, 0, 0]], [[5, 5, 4, 4, 0, 5, 0, 5]], [[1, 2, 3, 2, 3, 7, 8, 2]], [[5, 4, 4, 5, 0, 8, 5, 8, 0, 5]], [[5, 3, -5, 2, -3, -9, 0, 123, 1, -10, 3]], [[4, 1, 4, 1, 3, 5, 9, 2, 6, 5, 3]], [[5, 3, -5, 2, -3, 3, -9, 0, 123, 1, -10, 3, -4, 3]], [[1, 1, 1, 2, -12, 0, 1, 1, -5]], [[5, 0, 5, 5, 0, 5, 5, 5, 0, 5]], [[1, 1, 1, 1, 0, 1, 0, 1, 1]], [[5, -4, 3, -5, -3, 3, -12, -2, -9, 0, 123, -2]], [[5, 5, 4, 4, 0, 0, 5]], [[-5, 2, 2, -11, 2, 1, -5]], [[1, 1, 1, 1, 0, 0, 2, 1, 1, 1, 0, 1]], [[1, 1, 1, 0, 0, 12, 0, 1, 1, 1, 1, 1]], [[5, 3, 10, -5, 2, -3, 3, -9, -10, 0, 123, 1, -10, 10, -5]], [[1, 5, 3, -5, 23, -3, 3, -9, 0, 123, -1, -10, -1]], [[2, 3, 7, 2, 9, 3, 6, -12, 8, 3, 3]], [[1, 6, 24, 1, 1, 7, 1, 1]], [[5, 0, 5, 5, 0, 5, 0, 5, 0, -2, 5, -3, 0]], [[5, 3, 24, 2, -3, 3, -9, 0, 123, 1, -10, 3, 3]], [[5, -2, 1, -12, 4, 23, 2, 3, 11, 12, -9, 3, 3]], [[5, 0, 5, 5, 0, 6, 5, -1, 5, 5, 0]], [[5, 3, 10, -8, -5, 2, -3, -9, 0, 123, 1, -10, 10]], [[5, 4, 4, 5, 0, 8, 8, 0, 5, 4]], [[5, 3, -5, 2, 5, -3, 3, -11, -9, 0, 123, 0, -10, 3, 3]], [[5, 3, -5, 2, -2, 3, -9, 1, 0, 123, 1, 9, -10, 12]], [[5, 3, -5, 2, -3, 3, 0, 123, 1, -10, 3]], [[2, 3, 7, 2, 9, 3, 6, 7, -3, 2, 3, 2]], [[-5, 2, -11, 2, 1, -5]], [[2, 2, 1, 23, 2, 2]], [[5, 3, 4, 3]], [[5, -3, 3, -5, 2, -3, 3, -9, 123, 1, -10, 10, -5, 3]], [[5, -6, 2, -3, 3, 0, -9, 0, 1, -10, 10, 2]], [[2, 3, 2, 9, 3, 6, 7, 8, -10, 2, 2, 3]], [[5, 3, 2, 5, -3, 3, -11, 0, 123, 0, -10, 3, 3, 3]], [[2, 3, 1, 2, 9, 6, 7, 6, 8, 2, 9, 6]], [[5, 4, 4, 5, 4, 0, 8, 8, 0, 5, 4]], [[-5, -7, 2, 10, 9, 5, -3, 2, 8, 3, 7, 2]], [[1, 1, 23, 1, 0, 3, 1, 1, 1, 1, 1]], [[1, 2, 2, 3, 3, 2, 1, 2]], [[5, 3, -5, -3, 3, -2, -9, 0, 6, -2, -10]], [[5, 5, 4, 4, 0, 5, 0, 5, 0]], [[1, 6, 24, 1, 1, 7, 1, 1, 7]], [[5, 3, -5, 2, -2, 3, -9, 2, 0, 123, 1, 9, -10, 12]], [[1, 1, 1, 2, -12, 0, 1, 1, 1, -4, 1]], [[1, 1, -10, 2, 1, 0, 0, -12, 1, 1, 1, 1]], [[5, -6, 2, -3, 3, -9, 0, 1, -9, -10, 2]], [[5, 0, 0, 5, 0, 5, 0, 5, 0, 0]], [[5, 3, -5, -3, 3, 4, -9, 0, 123, 1, -10]], [[5, 0, 5, 5, 0, 5, 5]], [[1, 2, 3, 2, 3, 6, 2, 7, 8, 2, 2]], [[0, 5, 0, 5, 0, 5, 0, -2, 5]], [[5, -2, -12, 4, 23, 3, 11, 10, 12, -10]], [[2, 2, -5, 5, 2, 2, 3]], [[1, 2, 3, -5, 6, 7, 8]], [[-7, 2, 10, 0, 9, 5, 12, 2, 8, 3, 7, 9]], [[5, 3, -5, 23, -3, 3, -9, 0, 123, 1, 3, -10, 5]], [[5, 4, 4, -7, 0, 5, 0, 5]], [[6, 1, 2, 1, 4, -11, 4, 5, 5, 6, 7, 8]], [[5, 3, 10, -5, 2, -12, -3, 3, -9, 1, 123, 1, -10, 10, -5]], [[6, 3, -5, -3, -2, -9, 0, 123, -2]], [[11, -5, -7, 2, 10, 0, 9, 5, -5, 2, 8, 3, 7, 9]], [[5, 3, -5, 2, -2, 4, 3, -9, 2, 0, 1, 9, -10, 12]], [[1, 1, 23, 2, 2]], [[1, 2, 3, 2, 12, 6, -8, 8, 2]], [[-5, 2, 2, -7, -11, 2, 1, -5]], [[5, 3, 2, 3]], [[1, 2, 2, 2]], [[5, 4, 0, 4, 5, 0, 8, 0, 5]], [[5, 0, 5, -1, 5, 9, 5, 0, -1]], [[6, 3, -5, -3, -2, 3, 0, 123, -2]], [[1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1]], [[3, 7, 7, 2, 9, 3, 6, 7, 8, 2]], [[0, 3, -5, 2, -3, 3, -8, 0, 123, 1, -10, -5]], [[1, 1, 1, 1, 0, 0, 1, 1, 0, 1]], [[5, 4, 0, 4, 4, 5, 0, 8, 8, 0, 5]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0, 0]], [[1, 1, 23, 1, 0, 8, 7, 1, 1]], [[5, 0, 4, 4, 0, 5, 0, 5]], [[5, 0, 5, -11, 0, 6, 5, -1, 5, 5, 0, 5]], [[0, 5, 0, 5, 0, 5, 0, 0]], [[5, 4, 4, 5, 0, 3, 8, 8, 0, 5, 4]], [[1, -13, 1, 2, 1, 0, -12, 1, 1, 1, 1]], [[1, 2, 4, 5, 5, 6, 8, 2]], [[5, 0, 5, 5, 0, 5, 0, 5, 5, 0, 5, 0, 5, 5]], [[-5, -7, 2, 10, 0, 9, 5, -3, 2, 8, 10, 3, 7, 2, -3, -5]], [[5, 0, 5, -1, 5, 5, 0]], [[3, 1, 4, 1, 5, 9, 6, 5, 4, 4, 4]], [[5, 4, 4, 0, 5, 0, 5, 0]], [[5, 0, 4, 5, 5, 0, 5]], [[5, 10, -6, 2, 3, -9, 0, 1, -10, 10, 2]], [[1, 1, -7, 2, 3, 2, 6]], [[2, 4, 5, 5, 6, 8, 2]], [[2, 1, 1, 23, 1, 0, 8, 7, 1, 1]], [[3, -5, -3, 3, -2, -9, 0, 123, -2]], [[1, 1, 1, 2, -12, 0, 1, 9, 1, -5, -5]], [[1, 1, 1, 2, -12, 0, 1, 1, 1, 1, 1]], [[1, 6, 24, 1, 1, 7, 1, 7]], [[1, 1, 2, 1, 0, 1, 0, 1, 1]], [[1, 1, 1, 0, 0, 12, 1, 1, 1, 1, 1, 0]], [[5, -2, -12, 4, 23, 6, 3, 11, 12, -10, 4]], [[1, 2, 3, 2, -6, -1, 6, -1, 7, 8, 2]], [[1, 1, -10, 1, 1, 0, 0, -12, 1, 1, 1, 1]], [[5, 0, 5, 5, 0, 5, 4, 0, 0, 5, 0, 5, 4]], [[1, 6, 1, 1, 7, 1, 7, 1]], [[2, 2, -5, 2, 1, 2]], [[5, 4, 0, -10, 4, 5, 0, 8, 8, 0, 5]], [[5, -3, 4, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5, 1]], [[1, 1, 1, 0, 1, 1, 1]], [[1, 2, 123, 5, 5, 4, 6, 8, 12, 123, 5]], [[4, 1, 2, 4, 5, 5, 6, 0]], [[5, 5, 5, -4, 5, 0, 5, 0]], [[5, 3, 10, -5, 2, -3, -9, -10, 0, 123, 1, -10, 10, -5]], [[5, 3, -5, -3, 3, -2, -9, 0, 6, -6, -2, -10, -5]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, -10, 1, 10, -5, 0]], [[5, 4, 0, 4, 4, 5, 0, -13, 8, 0, 5]], [[-11, 5, 0, 5, 5, 0, 6, 0, 5, 5, 0, 4, 0]], [[6, 5, 0, 5, 5, 0, -1, 5, 5, 0, 5]], [[1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]], [[5, 0, 5, -1, 5, 0, 5, 0, 0, 0]], [[1, 5, 3, -5, 23, -3, 3, -9, 0, 23, 123, -1, -10, 5]], [[5, 3, -5, 11, -3, 2, 3, -9, 0, 123, 1, -10, 3, 3, 123]], [[0, 5, -1, 5, 5, 0]], [[0, 5, 0, 5, 0, 5, 0, 5, 0, 5]], [[5, 3, -5, 2, -2, 3, -9, 1, 0, 123, 1, -10, 12, 12]], [[5, 0, 5, 5, 0, 6, 5, 5, 5, 0]], [[5, -2, -12, 2, 4, 23, 2, 3, 11, 12, -9, 3, 3]], [[5, -2, -11, 4, 23, 6, 3, 11, 12, -10, 4]], [[0, -7, 5, -1, 5, 5, 0]], [[5, 122, 3, -9, -5, 2, -3, 3, -9, 0, 123, 1, -10, 3, 3]], [[5, 3, -5, 2, 3, -10, 0, 123, 1, -10]], [[5, 0, 5, 0, 5, 0, 5, 5, 0, 0, 5]], [[5, 10, 2, 3, -9, 0, 1, -10, 10, 2]], [[5, 0, 5, -1, 5, 0, 5, 0, 0, 0, 5]], [[5, 3, -10, -5, 2, -2, 3, -9, 1, 0, 123, 1, -10, 12, 12, -5]], [[1, 1, 23, 1, 0, 8, 1, 1]], [[5, 122, 5, 0, 5, 5, 0, 5, 5, 0, 0, 5]], [[5, 0, 4, 5, 0, 5, 0, 5, 0, 0]], [[-11, 5, 0, 5, 5, 0, 6, 0, 5, 5, 10, 4, 0]], [[2, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 3, 2, 9, 3, 6, 7, 8, -10, 2, 2, 3, 3]], [[3, -5, 23, -3, 3, -9, 0, 123, 1, -10, 1]], [[1, 2, 3, 2, 3, 6, 2, 7, 8, 2, 2, 1]], [[2, 3, 1, 2, 9, 6, 7, 6, 8, 2, 9, 6, 2]], [[5, 3, -5, -3, 3, -2, -9, 0, 123, -2, 3]], [[5, 3, 10, -5, 2, -12, -3, 3, -9, 1, 123, -10, 10, -5]], [[2, 2, 2, 23, 2, 2]], [[-2, 2, 4, 5, 5, 6, 7, -12, 8, -2]], [[5, 0, 4, 0, 5, 0, 5, 0, 5, 0, 5, 0]], [[5, 0, 5, 5, 5, 5, 0, 5, 5, 0]], [[5, 10, -6, 2, -3, 3, -9, 0, 1, -10, 10, 10]], [[-4, 5, 3, -5, -3, 3, 4, -10, -9, 0, 123, 1, -10]], [[5, 4, 0, 4, 4, 5, 0, -13, 9, 0, 5]], [[5, 3, 2, 5, -3, 3, -11, 0, 123, 0, -10, 3, 3, 5]], [[2, 1, 3]], [[5, 0, 5, 5, 0, 5, -1, 5, 5, 0]], [[0, 5, 0, 5, 0, -3, 12, 5, 0, -2, 5]], [[2, 2, 1, 23, 2]], [[5, 122, 5, 0, 5, 5, 0, 5, 5, 0, 0, 5, 5]], [[2, 2, 1, 23, 2, 1]], [[2, 123, 5, -3, 5, 4, 6, 8]], [[3, 0, 0, 4, 1, 5, 9, 2, 6, 5, 3, 3]], [[3, 1, 4, -6, 1, 5, 9, 10, 5, 4, 4]], [[5, 3, 10, -8, -5, 2, -9, 0, 123, 1, -10, 10]], [[5, 3, 10, -5, 2, -3, 3, -9, 0, 123, 1, -10, 10, -5, 5]], [[5, 0, 5, -11, 0, 6, -1, 5, 5, 0, 5]], [[5, 3, -5, 2, -3, 3, 0, 123, -9, 1, -10, 3, 1]], [[6, 5, 3, 0, 5, 5, 0, -1, 5, 5, 0, 5]], [[5, 3, 2, 5, -3, 3, -11, 0, 123, 0, -10, 3, 3, -9, 3]], [[5, 3, -5, -2, 3, -9, 1, 0, 123, 1, 9, -10, 12, 123]], [[5, 3, -10, -5, 2, 3, -9, 1, 0, 123, 1, -10, 12, -4]], [[2, 11, -5, 6, 2, 2, 2, 11, 2]], [[5, 1, 1, 1, 2, 1, 0, -3, 1, 1, 1]], [[3, -5, -3, -2, 3, 0, 123, -2]], [[1, 2, 1, 1, 1, 0, 0, -10, 1, 1, 1, 1]], [[2, 2, 2, 23, 0, 2]], [[4, 5, 0, 5, -11, 0, 5, 1]], [[1, 2, 122, 3, -5, 6, 7, 8]], [[2, 1, 7, 3]], [[1, 2, 3, 2, 1, 1]], [[1, 2, 2, -11, 2, 0, 2]], [[5, 0, 4, 0, 5, 0, 5, 0, 5, 0, 5, 0, 0]], [[5, 0, 5, 0, 5, 0, 5, 0, 0, 0]], [[2, 3, 2, 1, 3, 6, 7, 9, -10, 2, 5, 2, 3]], [[3, 1, 4, 1, 5, 9, 6, 5, 4, 4, 4, 1]], [[1, 2, 2, 3, 2, 1, 3]], [[6, 5, 3, 0, 5, 5, 0, -1, 5, 5, -1, 5]], [[5, 3, 10, -5, 2, -12, -3, 3, -9, 1, 123, -1, 1, -10, 10, -5]], [[10, -6, 2, 3, -9, 0, 1, -10, 10, 2, 2]], [[1, 2, 4, 2, -6, -1, -4, 6, -6, 3, -1, 7, 8, 2]], [[3, 1, 4, -6, 1, 5, 9, 10, 6, 4, 4]], [[5, 3, 10, -5, 2, -3, -9, -10, 0, 123, 1, -10, 10, -5, -3]], [[5, 0, 4, 5, 5, 6, 0, 7]], [[2, 2, -10, 2, 1]], [[2, 2, 1, 1, 1, 1, 1, 1, 1, 1]], [[5, -2, -12, 4, -6, 2, 3, 11, 12, -10, 4]], [[5, 0, 5, 5, 0, 5, 0, 5, 6, 5, 0, 5, 0, 0, 0]], [[2, 1, 23]], [[0, -1, 5, 5, 0, 5, 0]], [[-2, -11, 4, 23, 6, 3, 11, 12, -10, 4]], [[2, 2, 9, 3, 6, 23, 8, 2]], [[1, 1, -7, 2, 3, 6]], [[1, 2, 1, 3, 2, -1, 6, -1, 7, 8, 2]], [[2, 2, -1, 2, 3, 2, 2, 2]], [[5, 3, 10, -5, 2, -3, 2, 12, 3, -9, 0, 123, 1, 10, 5]], [[1, 1, -10, 2, 1, 0, -12, 1, 1, 1, 1]], [[5, 4, 4, 0, 5, 5]], [[5, -2, -1, -12, 4, 23, 2, 12, 3, 11, 12, -10, 11]], [[5, 3, 2, 5, -3, 3, -11, 0, 123, 0, -10, 3, 3, 3, -9, 3]], [[1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 2]], [[3, -5, 2, -3, 3, 0, -11, 1, -10, 3]], [[5, 3, 2, 5, -3, 3, -11, 0, 123, 0, -10, 3, 3, -9, 3, 3]], [[2, 3, 7, 2, 2, 9, 3, 6, 7, -3, 2, 3, 2]], [[-2, 1, 1, 1, 2, 2, 2, 2, 2]], [[5, 3, 4, -6, 3]], [[2, 1, 4, 3]], [[5, 0, 5, 1, 5, 0, 5, 0, 5, 5, 0, 5]], [[6, 3, -5, 1, -3, -2, -9, 0, 123, -2]], [[1, 1, -7, 2, 3, 6, -7, -7]], [[1, 1, -3, 2, 3, 6]], [[0, -7, 5, -1, 5, 0, 0]]], "completion": "\ndef sort_even(l: list):\n return [x if i%2!=0 else sorted(l[::2])[i//2] for i,x in enumerate(l)]\n", "raw_completion": "```python\ndef sort_even(l: list):\n return [x if i%2!=0 else sorted(l[::2])[i//2] for i,x in enumerate(l)]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef sort_even(l: list):\n \"\"\"This function takes a list l and returns a list l' such that\n l' is identical to l in the odd indicies, while its values at the even indicies are equal\n to the values of the even indicies of l, but sorted.\n >>> sort_even([1, 2, 3])\n [1, 2, 3]\n >>> sort_even([5, 6, 3, 4])\n [3, 6, 5, 4]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/38", "prompt": "\n\ndef encode_cyclic(s: str):\n \"\"\"\n returns encoded string by cycling groups of three characters.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n\ndef decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n", "entry_point": "decode_cyclic", "canonical_solution": "\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n groups = [(group[2] + group[:2]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n from random import randint, choice\n import string\n\n letters = string.ascii_lowercase\n for _ in range(100):\n str = ''.join(choice(letters) for i in range(randint(10, 20)))\n encoded_str = encode_cyclic(str)\n assert candidate(encoded_str) == str\n\n", "contract": "\n assert isinstance(s, str), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["uzfplzjfzcltmdly"], ["nzyegaghrzqwrdzxckn"], ["zxolecqvzyausohgzdod"], ["cjhzuelsabstpbq"], ["lfgmjpqnvzwvbusr"], ["cvxcvhmtgbeweum"], ["jgjvebqagrtwheytsyff"], ["swbkfgqnvuahcnqgpcu"], ["ssjgajmprs"], ["enrrdusnffcnkotf"], ["cpfgdusjrzf"], ["gconqokfgb"], ["effmnsvrgsdbhffn"], ["zwsrgynxlmh"], ["nqdjadvhlu"], ["fpkocdqllglypkj"], ["aosjbowaac"], ["fvdumeezuebnlkqnvwfc"], ["tzfoanbvufs"], ["mnzbtfatwfxpqstecjm"], ["nkxxaitehrj"], ["nwxwbyaavoevbjbig"], ["gmamklorekv"], ["rihdqvrbxaycb"], ["gwvexchafqe"], ["pymjpgzjnva"], ["aobgbpwjritkq"], ["nuccsadagbriq"], ["gdktamtzhdmj"], ["dcprihgimgnjx"], ["kljtwssfqty"], ["frbqiejenuvxwoy"], ["tjfuyuhxly"], ["fimmmlfohx"], ["xwtgrxfyytcyyjdjoni"], ["bzekhcvbldsd"], ["ghzgwvsorsye"], ["xkaxuitdibnplwpucw"], ["qcszxfbaocdzseekb"], ["ueaztzzgmex"], ["jsjyrkasqpujtnvrbmtr"], ["fyiurdclyxoalovncksg"], ["erxobpjrpkxbsgobas"], ["lizudkhwdzwjzziyex"], ["vpuzbwgjyicrh"], ["sajlxmochmknulkxecik"], ["klzoujwdjfwqzk"], ["kiccixaihigbhftw"], ["hyrkynsmkvndymdepsu"], ["dplbtwiqweagdz"], ["kjrblffzlakwpz"], ["hzdeezpqcoxwcwsyyl"], ["wcxtvtdgeymblafldwgq"], ["ujgibazfslkfyfu"], ["oqrngzmyfxddlwpbv"], ["vtmdwyiilv"], ["vghazccwxyibefx"], ["jzyhtisowtzheniomrvr"], ["eksylebplf"], ["jxevtanxqvhwb"], ["joqwqljwckpb"], ["dkghzktgig"], ["ajbtmlaqsegfktujz"], ["xeggrighqjvgjpt"], ["fgkpcfreaypwkstc"], ["ucfyampthmhoh"], ["pcyzbxlzmud"], ["hualgpgmtpv"], ["dofgkmknkdhimryg"], ["btvvhktzpvkuekialfq"], ["hbvgnvmuxckcqjvx"], ["qhwrawfsmuevokszgfqy"], ["uakqzvnihhfcwz"], ["rlnvwwhoxlwkyibhnjg"], ["cmprarjwtqovlcizhgpu"], ["rbfrlfpxzfm"], ["lutbkxocedmbfctzmuy"], ["oajodvoerl"], ["bvmxponldendphf"], ["jdliznkftyvzwdqty"], ["hkbaihpjquf"], ["hhneeogusm"], ["qvnehikoshpzahmfkep"], ["urrclsjxeosc"], ["ghfmyzjawzulrop"], ["ycqtsqaatceckf"], ["ipybztxdkypoxjuhf"], ["ozjthdoukvrqjb"], ["ipfbolvlrwwtznrdbta"], ["xzhjnclgnihoinfs"], ["pfkwcebjnkoudgosogtj"], ["aqbojzzuehqwirlx"], ["mulyzumnbuzr"], ["nzdtnhuxogdzdguy"], ["juvowhyjstne"], ["ybzdvuvvwyeyxepv"], ["dyunpcsjbdozu"], ["hfbhubqoykkyrwjx"], ["bkkjxpyfzrtcqpqna"], ["hpncxsmjpus"]], "atol": 0, "plus_input": [["abcdefghijk"], ["abcdefghijklmnopqrstuvwxyz"], ["1234567890"], ["The quick brown fox jumps over the lazy dog."], ["Testing 123, testing 123."], ["abc"], ["ab"], ["a"], [""], ["foo bar"], ["5670"], ["Testing 123, testi3ng 123."], ["aaTesting 123, testi3ng 123.b"], ["Testing5670 123, testingabc 123."], ["DQVw"], ["bc"], ["aTesting 123, testi3ng 123.ab"], ["Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123."], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123."], ["Testing 123, testi3ng 123.."], ["aTesting 123, tTesting 123, testi3ng 123..esti3ng 123.ab"], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123."], ["aTesteing 123, tTesting 123, testi3ng 123..esti3ng 123.ab"], ["Testing 123, tessting 123."], ["Testing 123, testi3ng 12a3.."], ["Testing 123t, testi3ng 123.."], ["Testing 123, tsessting 123."], ["Tabcdefghijklmnopqrstuvwxyzesting 123t, testi3ng 123.."], ["aabc"], ["aaTesbting 123, testi3ng 123.b"], ["Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123."], ["Testing 123, tes1ting 123.."], ["Testin,g5670 123, testingabc 123."], ["cEEXtcV"], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890"], ["bbc"], ["Testing,g5670 123, testing3abc 123."], ["acaabc"], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123.0 123,Testing 123, testing 123. testingabc 123."], ["Testing 123Testing 123, tsessting 123., testi3ng 12a3.."], ["Testing567The quick Testing567The quick brown fox jumps over tn fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890"], ["abcdefgghijk"], ["The quicox jumps over the lazy dog."], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the l1234567890azy dog.0 123,Testing 123, testing 123. testingabc 123."], ["Testing 123, tesstinng 123."], ["Testing Tabcdefghijklmnopqrstuvwxyzesting 123t, testi3ng 123..123, tes1ting 123.."], ["Testing567Tohe quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123."], ["aTesting 123, tTesti3ng 123..estii3ng 123.ab"], ["aing 123, testi3ng 123.b"], ["TestiTesting567The quick Testing567The quick browThe quick brown fox jumps over the lazy dog.n fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.ng 123t, testi3ng 123.."], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, 123,Testing 123, testing 123. testingabc 123."], ["Testing 123, ttetsti3ng 123."], ["Testing567The quick Testing567The quick brown fox jumps over tn fox jumps ovrer the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890"], ["aaTesbting 123, testi3ng 123.babc"], ["The quick brown fox jumps over the la"], ["aaTesbting a123, testi3ng 123.bTesting 123, tessting 123.abc"], ["Testing567Tohe quick brown fock brown fox jumps over the lazy dog.0 123,Testing 123, teaing 123, testi3ng 123.bsting 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123."], ["Te1sting 123, tes1ting 123.."], ["The quick brows over the lazy dog."], ["The quick brown fTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abqcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.ox jumps over the la"], ["The quick brown fox jumTesting567The quick Testing567The quick brown fox jumps over tn fox jumps ovrer the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890 lazy dog."], ["Testing 123, ttetst123."], ["Testing 123Testing 123, tsessting 123., testi3nTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.2a3.."], ["Testing 123, ti3ng 123."], ["Testing 123, testi3ng 12"], ["Testing5670 123, testingbabc 123."], ["aTesting 123, tTesting 123, testi3ng 1Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123.0 123,Testing 123, testing 123. testingabc 123.23.ab"], ["Testing 123, ttetst123.V"], ["aTesting 123, tTesti3ng 123.Te1sting 123, tes1ting 123.."], ["The quick brown fox jumTesting567The quick Testing567The quick brown fox jumps over tn fox jumps ovrer the lazy dog.0 123,Testing 1Testing 123,aTesting 123, tTesti3ng 123..estii3ng 123.ab ti3ng 123.23, testing 123. testingabc 123.1234567890 lazy dog."], ["Te1stingTesting 123, testi3ng 12a3.. 123, tes1ting 123.."], ["aTesting 123, testi3ng 123..caabc"], ["c"], ["Te2sting 123, ttetstTesting 123, ttetst123.V123.V"], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abcdefgTesting,g5670 123, testing3abc 123.hijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890"], ["cc"], ["The quick brown fTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abqzcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.ox jumps over the la"], ["The quick brown fTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123abqzcdefghijklmnopqrstuvwxyz,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.ox jumps over the laabcdefgghijk"], ["TeaTesting 123, tTesti3ng 123..estii3ng 123.absting567The quick brownn fox jump"], ["Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.TestingaTesteing 123, tTesting 123, testi3ng 123..esti3ng 123.ab567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123.0 123,Testing 123, testing 123. testingabc 123."], ["Testing 1Testing567The quick Testing567The quick brown fox jumps over tn fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.123456789023, tsessting 123."], ["Testing,g56123456789070 123, testing3abc 123."], ["2Testing567Tohe quick brown fock brown fox jumps over the lazy dog.0 123,Testing 123, teaing 123, testi3ng 123.bsting 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123.bc"], ["aTesting 1Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.esti3ng 123..caabc"], ["Testisng 123, tes1ting 123.."], ["Tabcdefghijklmnopqrstyzesting 123t, testi3ng 123.."], ["Te1stingTesting 123, testTesting567The quick Testing567The quick bro1wn fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.i3ng 12a3.. 123, tes1ting 123.."], ["Te1sting 123, tesng 123.."], ["abcdefghfijk"], ["aing 123, 2gtesti3ng 123.b"], ["aTesteinbg 123, tTesting 123, testi3ng 123..esti3ng 123.ab"], ["Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 12cc3, testing 123. testingabc 123."], ["Testing 123, aaTesbting 123, testi3ng 123.babctesti3ng 12a3.."], ["aTesting 123,aTesting 123, tTesting 123, testi3ng 1Testing567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testinTesting567The quick Testing567The quick brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.g 123. testingabc 123.0 123,Testing 123, testing 123. testingabc 123.23.ab3.."], ["Testing567The quick brownz fox jumps over the lazy dog.0 123,Testing 123, testing 1203. testingabc 123."], ["Testing567The quick Testing567The qujick brown fox jumps over tn fox jumps ovrer the lazy dog.0 123,Testing 123, testing 123. testingabc 123.1234567890"], ["Tesbting 123, aaTesbtin3g 123, testi3ng 123.babctesti3ng 12a3.."], ["aTeststi3ng g123.ab"], ["aTesting 123, tTesti3ng 123..estii3ng 123.Te2sting 123, ttetstTesting 123, ttetst123.V123.V"], ["Te1stingTesting 123, testTesting567The quick Testing567The quick bro1wn fox jumps over the lazy dog.0 123,Testing 123, testing 123. testingabc 123.brown fox jumps over the lazy dog.0 123,Testing 123, testincg 123. testingabc 123.i3ng 12a3.. 123, tes1ting 123.."], ["thisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectly"], ["hjghgicuegtfbawqwemumeuifsunakjqskjpskabdh"], ["4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abcd"], ["abcdefghijklmno"], ["abcdefghijklmnop"], ["123456"], ["ababccdd"], ["ababccdababccdd"], ["abcdefghijklmnopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxyzabc"], ["aabcdefghijklmnopqrstuvwxyzbcd"], ["abcdefghijklmnopqrstuvwxy"], ["abcdefghijklmnopqrstuvwxyzbabc"], ["ababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccdd"], ["abcdefghjijklnopqrstuvwxyzabc"], ["thisisaverylongstringbutitshouldstillbabcdefghijklmnopeencodedanddecodedcorrecly"], ["abcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabc"], ["ababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccdd"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklmnopzbabc"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmnopqrstuvbc"], ["hjghgicuegtfbawqwemeuifsunakjqskjpskabdh"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabc"], ["abcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmno"], ["abcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugc"], ["abcdefghijklmnopqrstuvwxyabcdefghjklmnopzbabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugc"], ["abcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddf%*^&yttcccbnjukfugc"], ["hhjghabcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgicuegtfbawqwemumeuifsunakjqskjpskabdh"], ["4%^&*876tylrmlskoukfug"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abccdd"], ["abcdefghijklmunopqrstuvbc"], ["abcdefghijklmnopmqrstuvwxyzbabc"], ["abcc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghijklmunopqrstnuvbc"], ["abcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmno"], ["abcdefghjijklnopqlsbnjukfuguvwxyzabc"], ["abcdefghijklmnopqrstabccdduvwxyabcdefghjklmnopzbalbc"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodedcorrectly"], ["SVmyrpYEn"], ["abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["thisisaverylongstringbueencodedanddecodedcorrecly"], ["abcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["aabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabc"], ["thisisaverylongstringbllbeencodedanddecodedcorrectly"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["aabcdefghijdklmnopqrzbd"], ["SVmyrSpYEn"], ["abcdefghjdijklnopqrstuvwxyzabc"], ["abcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabc"], ["adabcdefghijklmnopqrstuvwxyzbcd"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefgheijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["4%^&*8%*^&yttcccbnj123456kfug"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfugc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfugcugc"], ["ababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["aabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabc"], ["thisisaverylongstringbllbieencodedanddecodedcorrectly"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["aabcdefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcabcdefghijklmnopdefghijklmunopqrstuvbc"], ["abcdefghijklmunopqrstuvbcaabcdefghijklmnopqrstuvwxyzbcd"], ["ababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["acbcc"], ["abcdefghijklmnopxqrstuvwxyabcdefghijklmnopzbabc"], ["abkcdefghijklmno"], ["abcddefghijklmnop"], ["abcdefghjdijklnopqrstuvwxyzeabc"], ["abcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugc"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabc"], ["aabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklm123456nopqrstuvwxyzabc"], ["xabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abkcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmno"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["4%^&*876tyylrmtlskooifnmwddabcdefghijklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefgheijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqwxyzabc"], ["abababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["aabcdabcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abfcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugc"], ["awxyabcdefghijklmnopzbazbc"], ["hhjghabcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdh"], ["aabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababcmnobc"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectly"], ["abcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopgeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcabcdefghijklmnopmqrstuvwxyzbabccdd"], ["thisisaverylcongstringbutitshouldstillbeencodedanddelcodedcorrectly"], ["thisisaverylongstrinababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbijklmnopzbabclmnvwxyzabccddbabcdanddelcod4%^&*876tyylrmtlskooifnmwddabcdefghijklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfugrectly"], ["abcdefghjijklmncopqrstuvwxyzabc"], ["thiedanddecodedcorrectly"], ["thisisaverylongstringbllbeencodeabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZdanddecodedcorrectly"], ["abcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcopzbabclmnvwxyzabccddbabc"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabcabkcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmno"], ["cabcdefghijklmnopqrstuvwxyabcdefghjklmnopzbabc"], ["thisisaverylongstringbllbeencodedanddecyodedcorrectly"], ["abcdefghijklmnhhjghabcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgicuegtfbawqwemumeuifsunakjqskjpskabdhbcdefghijklmopzbabc"], ["abcdefghjdiabcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjkln"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclabccddbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnoplmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^fghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfugcugc"], ["abcdefghijklmnopqrstabccdduvwxyabcdefighjklmnopzbalbc"], ["aabcdefghiujklmnopqhrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["aabcdefghiujklmnopqhrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefmnopzbabc"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouabcdefghjdijklnopqrstuvwxyzabcldstillbaabcdefghijbcdefghijklmn"], ["abfcdefghjijklmnopqrstuvwxythisisaverylongstringbllbeencodedanddecyodedcorrectlyzab4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugc"], ["aabcdabcdefghijpklmnopqrstuvwxyabcdefghijklmnopzbabcefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcdefghijkabcdefghjdiabcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjklnlmunopqrstuvbc"], ["hhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdh"], ["adabcdefghijklmnopqrstuvwxyzbcSVmyrSpYEnd"], ["bcdefghijklmnopzbazc"], ["abcdefghijklmnopqrsctuvwxyabcdefghjklmnopzbabc"], ["abababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abcdnopqvrstuvwxyzabc"], ["JFkV"], ["abcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopstuvwxyzabc"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodedcorrectlybcSVmyrSpYEnd"], ["12341556"], ["abcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabc"], ["xXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abcdef4%^&*876tyylrmtlskooifnmwddabcdefghijklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfugghjijklnopqrstuvwxyzaxbc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubc"], ["abcdefghijklmnopqrstuvwxyabcdefghibc"], ["abcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabcifnmwdddf%*^&yttcccabcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcbnjukfugc"], ["abfcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwddtdf%*^^&yttcccbnjukabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcfugc"], ["thisisaverylongstringbutitdshouldstillbabcdefghijklmnopeencodedanddecodedcorrecly"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["4%^&*876tylrmlskothisisaverylongstringbllbeencodedanddecyodedcorrectlykug"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodedcorrectlybSVmyrpYEncSVmyrSpYEnd"], ["abcdefhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhghijklmnopqrstuvwxyzabc"], ["abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodedanddecodedcorrecl"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbalbc"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["aabcdefghijdklomnopqrzbd"], ["bpcdefghijklmnopzbazc"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["acbccabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttcccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["abcdefghijkabcdefghijkzabccddbabc"], ["4%^&*876tyylrmtlskifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmunopqabcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcrstnuevbc"], ["thisisaverylongstringbutitshouldabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectly"], ["abcdefghuijklmtxyzabc"], ["ababccdabcdefghijkabcdefghijklmnopqrstuvwxyababaobccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["abababcdefghuijklmthisisaveryelongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["SVmyrSpYEnhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdh"], ["abcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabcjklnlmunopqrstuvbc"], ["abcdelmno"], ["SVmyabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencdecodedcorreclynopqrstuvwxyzabcYEn"], ["abccabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdd"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopabccabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopawxyabcdefghijklmnopzbazbcencodedanddecodedcorreclynopqrstuvwxyzaubcddeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["4%^&*876tylrmlskooifnmwddffrrehfyj^%*^&yttcccbnjukfug"], ["adabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVmyrSpYEnd"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZ"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbc"], ["ahbcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabcghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabc"], ["ababdccdababccdd"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbc"], ["abcdefghiabcdjklmnopqrstuvwxybc"], ["bcdefghijklmnopzbaabcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabcreclynopqrstuvawxyzabcc"], ["123414556"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["1243456"], ["abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodeddanddecodedcorreclynopqrstuvwxyzabc"], ["abkcdefghijeklmno"], ["thisisaverylcongstringbutitshouldstillbeencodedadelcodedcorrectly"], ["thisisaverylongstringblglbeencodedanddecodedcorrectly"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabc"], ["abcdefghijklmnopqrstuvxwxyabcdefghibc"], ["aabcdefababccdthisisaverylongstringbutitshouldstillbabccddghijklm123456nopqrstuvwxyzabc"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIKLMNOPQRSTUVWXYZ"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&ytqtcccbnjukfugc"], ["abcdefghjijklmnopjqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugc"], ["ababdccdaabccdd"], ["abcdefghuijklmthisisavewrylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubc"], ["abcabcdefghuijklmthisisavewrylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdefghjijklmncopqrstuvwxyzabc"], ["abcdefghijklaabcdefghjijklnohpqrsmtuvwxyzababcdefghijklmnopqrscabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcghjklmnopzbabccmno"], ["abcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["gabcdefghijklmnopqrstuvwxy"], ["abcdefghijklmnopmqrrstuvwxyzbabcadabcdefghijklmnopqrstuvwxyzbcSVmyrSpYEnd"], ["4%^&*876tyylrmtlskifnmwdddffrrehfyj^%*^xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZ&yttcccbnjukfug"], ["abccc"], ["thissisaverylongstringbllbieencodedanddecodedcorrectly"], ["abcdefghjdijklnyopqrstuvwxyzabc"], ["abcdefghuijklmthisisaverylongsxXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZtringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopgeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvtwxyzabc"], ["12556"], ["abcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxabfcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwddtdf%*^^&yttcccbnjukabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcfugcyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabcjklnlmunopqrstuvbc"], ["abcdefghjijklmnopqrtsthisisaverylongstringbutitshouldabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectlyuvwxyzabc"], ["thiedandabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcdecodedcorrectly"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abaxabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZbccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccdd"], ["aoabcdefghijklmnopqrstuvwxyzbcd"], ["abcdefghuijklmthisisaverylongstringbutitshiouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstcuvwxyzabc"], ["abkcdefghijeknlmnabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbco"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["ivGgx"], ["thisisavlerylongstringbutitdshouldstillbabcdefghijklmnopeencodedanddecodedcorrecly"], ["ababccdabcdefghijkabcdefghijklmnopqrstuvwxyababaobccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbadbc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcadefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["ababccdababcthisisaverylongstringbllbeencodedanddecyodedcorrectlycdd"], ["thiedandorrectly"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["abcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabYcjklnlmunopqrstuvbc"], ["abcdefghijklmumnopqrstnuvbc"], ["bcdefgabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabcghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabchijklmnopzbazc"], ["4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%abc*^&yttcccbnjukfug"], ["abcdefghijklmnopqrstuvwxyababcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabccdefghibc"], ["4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjbpcdefghijklmnopzbazcukfug"], ["ahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstuvwxyzbabctcccbnjukfugc"], ["abcdefghuijklmthisisaverylongstringbutitshouabcdefghjdiabcdefghijklmnopqrstabccdduvwxyabcdefghjklmnopzbalbcjklnopqrstuvwxyzabcldstillbaabcdefghijbcdefghijklmn"], ["ahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstctcccbnjukfugc"], ["abcabcdefghijklmnopddefghijklmunopqrstuvbc"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzthisisaverylcongstringbutitshouldstillbeencodedanddelcodedcorrectlystuvwxyabcdefghijklmopzbabc"], ["abcdefghijklmnorabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttgc"], ["xXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabcyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abcdefghjijkdlnopqrstuvwxyzabc"], ["abcdefghjdiabcdefabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjkln"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclba4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjbpcdefghijklmnopzbazcukfuglmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghijkabcdefghabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["abcdecfababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["thisisaverylongstringbutitshouldabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklm123456nopqrstuvwxyzabcedcorreclynopqrstuvwxyzabcstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectly"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzthisisaverylcongstringbutitshouldstillbeencodedabcabcdefghijklmnopddefghijklmunopqrstuvbcanddelcodedcorrectlystuvwxyabcdefghijklmopzbabc"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrmstuvwxabcdefghjdijklnopqrstuvwxyzabcyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdeabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbcfghijklmnopbcdefghijklmnopgeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abocdefijklmnop"], ["almno"], ["abababcdefghuijklmthisisaveryelongstringbutitshouldstillbaabcdefghijklmnopbabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["X"], ["abcdefghijklmnopqababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabc"], ["abcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcouvwxyzabcyzabc"], ["abcdefghjijklmnopqrtsthisisaverylongstringbutitshouldabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectlyuvwxyzabc"], ["ababdccdaabcdefghjijklmncopqrstuvwxyzabcbabcdd"], ["aobcabcdefghijklmnopddefghijklmunopqrstuvbc"], ["awxyabcdefabcdefghijklmnopqrstabccdduvwxyabcdefighjklmnopzbalbcghijklmnopzbazbc"], ["aboacdefijklmno"], ["abcdefababccdthisisaverylongstringbutitshouldstillebeencodedarabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabc"], ["abcdefghijklmnopqrstabccdduvwxyabcdefighjklmnopSVmyrSpYEnzbalbc"], ["abcdefghijklmnopqrabcdefghijklmnofpqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcccdd"], ["aabcdefghijdkaabcdabcdefghijpklmnopqrstuvwxyabcdefghijklmnopzbabcefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcpqrzbd"], ["abccddabcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyj^%*^&ytqtcccbnjukfugc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclba4%^&*876tylrmlskooifnmwdddffrrehfyjabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabc^%*^&yttcccbnjbpcdefghijklmnopzbazcukfuglmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopfeencodedanddecodedcorreclynopqrstuvtwxyzabc"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaveryaobcabcdefghijklmnopddefghijklmunopqrstuvbclongstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["4%^&*8%*^&yttcccbnj123456kfugg"], ["abcdefghijklmunopqrstuvbthisisaverylongstringbueencodedanddecodedcorreclycaabcdefghijklmnopqrstuvwxyzbcd"], ["aabcabcdefghijklmnopddeadabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEndfghijklmunopqrsuvbc"], ["abcdefghjijklmnopqrtsthisisaverylongstringbutitshouldabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUnVWXYZabcstillbeencodedanddelcodedcoaabcdefghijdklmnopqrzbdrrectlyuvwxyzabc"], ["acbccabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzqbabc"], ["acbccabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzqbc"], ["abcabcdefijklmnopddefghijklmunopqrstuvbc"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodedcorrectlabcdefghijklmnopabcdefghuijklmthiabcbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabcy"], ["4%^&*8%*^&y&ttcccbnj123456kfug"], ["abkcdefghijeeklmn"], ["abababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongstringbutitshouldstillbaaabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbalbcbcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongstringbutitshouldstillbdcorreclynopqrstuvwxyzabcccddbc"], ["thisisaverylongstringbutitshoabcdefghijklmnopqrstuvwxyababcdefghuiabcdjklmthisdisaverylongstringbutitshouldstiaabcdefghijdklmnopqrzbdlabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabccdefghibceencodedanddecodedcorrectly"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorrebc"], ["124345abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc6"], ["abcdefhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIKLMNOPQRSTUVWXYZopqrstuvwxyzabc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmabcdefghjijklmnopjqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugct^%*^&yttcccbnjukfugc"], ["bPRUlgbabkcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmnoluX"], ["abfcdefghjijklmnopqrstuvwxythisisaverylodcorrectlyzabb4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugc"], ["abcdefghjdiabcdefghuijklmthisisaeveSVmyabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencdecodedcorreclynopqrstuvwxyzabcYEneclynopqrstuvyzabcjkln"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCcDEFGHIJKLNOPQRSTUVWXYZ"], ["abababcdefghuijklmthisisaveryelongstringbutitshouldstilthisisaverylongstringbllbeencodedanddecodedcorrectlylbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["aabcmnopqrzbd"], ["SVmyrrpYEn"], ["ivxGgx"], ["1lmnopeencodedanddecodedcoorreclynopqrstuvwxyzabc6"], ["abcdefghuijklmthisisaverylongstringbutitshouabcdefghjdiabcdeefghijklmnopqrstabccdduvwxyabcdefghjklmnopzbalbcjklnopqrstuvwxyzabcldstillbaabcdefghijbcdefghijklmn"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyabaabcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabYcjklnlmunopqrstuvbcijklmnopzbabc"], ["aabthisisaverylongstringbllbeencodeabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZdanddecodedcorrectlycdefghijklmnopqrstuvwxyzbcd"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstab123456ccdduvwxyabcdefighjklmnopzbalbc"], ["abcdefgxXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorresctly23456789ABCcDEFGHIJKLNOPQRSTUVWXYZhijklmnopxqrstuvwxyabcdefghijklmnopzbabc"], ["abcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabc"], ["abcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijaklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvabcdefghuijklmthisisaverylongstringbutitshouabcdefghjdijklnopqrstuvwxyzabcldstillbaabcdefghijbcdefghijklmnyzabc"], ["abcdefghjijklnonpqrstuvwxyzabc"], ["abcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrsabc"], ["abcdefghijklmnopmqrstuvabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijaklmnopbcdefghijklmnopeenynopqrstuvwxyzabcwxyzbabc"], ["abcdefgkhjijklnopqrstuvwxyzabc"], ["hjghhgicuegtfbawqwemeuifsunakjqskjpskh"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghimnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghijkabababcdefghuijklmthisisaverylongsabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabctringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstab123456ccdduvwxyabcdefighjklmnopzbalbc"], ["4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttccabcdefghijklmnopqababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabccbnjukfug"], ["abcdefghuijklmtxabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzababcdefghijklmnopqrscabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcghjklmnopzbabccmnobc"], ["ababccdabcdefghijkabcdefgabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&yttcccbnjukfugcugchijklmnopqrstuvwxyababaobccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabc"], ["abcdefghijklmnopqrabcdefghijklmbnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencabcccdecodedcorrectly23456789ABCcDEFGHIJKLNOPQRSTUVWXYZ"], ["abcdefghijklmnopqrstuvwxyzabcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclabccddbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcdefghijklmnopeenynopqrstuvwxyzabcbabc"], ["ababdccdaabcdefghjijklmncopqrstuvwxyzabcdbabcdd"], ["thissisaverylongstringbllbieencodedanddecoddcorrectly"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopyeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbc"], ["4%^&*8%*^&y&ttcccbnjabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddklmopzbabc123456kfug"], ["abcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcabcdefghuijklmthisisavewrylongstringbutitshouldstillbaasbcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdefghjijklmncopqrstuvwxyzabc"], ["nalmno"], ["abcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvywxyabcdefghijklmnopzbabc"], ["ivabcdefghijklmnopqrabcdefghijklmnofpqrstuvwxyzstuvwxyabcdefghijklmnopzbabcGgx"], ["abcdefghjijkabcdefghijklmnopqrabcdefghijklmbnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabclnonpqrstuvwxyzabc"], ["abcabcdecfababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabcd"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopstuvwxyzabcecodedcorreclynopqrstuvwxyzabcccdd"], ["adabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVabcdefghjdiabcdefabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjklnmyrSpYEnd"], ["abcdefghijklmnopqrabcdefghiaabcdabcdefghijpklmnopqrstuvwxyabcdefghijklmnopzbabcefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcjklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabc"], ["abcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz01abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodedanddecodedcorrecl23456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabYcjklnlmunopqrstuvbc"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqvrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghifjklmnopqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencodabcdefghijklmnopqrstuvwxyabcdefghibcrrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZ"], ["4%^&*8%*^&y&ttcccabcdefghijklmnopqrstuvwxyabcdefghjklmnopzbabcbnj123456kfug"], ["4%^&*876tyylrmtlskifnmwdabcccddffrrehfyj^%*^xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZ&yttcccbnjukfug"], ["abcdefcghijklmnopqrstuvwxy"], ["1labfcdefghjijklmnopqrstuvwxythisisaverylongstringbllbeencodedanddecyodedcorrectlyzab4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugcmnopeencodedanddecodedcoorreclynopqrstuvwxyzabc6"], ["abcdefghijklmunopqrstuvbthisisaverylongstringbueencodedajnddecodedcorreclycaabcdefghijklmnopqrstuvwxyzbcd"], ["abkcdefghijklabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopyeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbcmno"], ["bPRUlgbabkcabcdefghuijklmthisisavewrylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmnoluX"], ["aijklmnopddefghijklmuvbc"], ["XX"], ["xXabcdefghijklmaabcdthisisaverylongstringbllbieencodOPQRSTUVWXYZ"], ["abcabcdefghijklmnopdefghijklmmunopqrstuvbc"], ["abcdefghijklaabcdefabcdefnghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcghjijklnohpqrsmtuvwxyzabcmno"], ["abcdefghijkabababcdefghuijklmthisisaverylongstrinabcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcdefghijklmnopeenynopqrstuvwxyzabcgbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstab123456ccdduvwxyabcdefighjklmnopzbalbc"], ["SVmabababcdefghuijklmthisisaveryelongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddyrSpYEn"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstrinqrstuvyzabYcjklnlmunopqrstuvbcijklmnopzbabc"], ["abababcdefghuijklmthisisaveryelongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklodedcorreclynopqrstuvwxyzabcccdd"], ["ababdccdaabcdefghjijklmnbcopqrstuvwxyzabcdbabcdd"], ["ababcabcdefghijklmnopdefghijklmmunopqrstuvbcababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abcdefghuijklmtxabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzababcdefghijklmnopqrscabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&ytabcdefghijklmnotcccbnjukfugcghjklmnopzbabccmnobc"], ["thisisaverylongstringbutitdshoiuldstillbabcdefgly"], ["bcdefgabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcabccabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcddorreclynopqrstuvwxyzabcyzbabcghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabchijklmnopzbazc"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmabkcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxyzabcmnowdddffrrehfyj^%*^&yttcccbnjukfugc"], ["abcdefghijklmnopqrstabccdefghjklmnopzbalbc"], ["abcdefghuijklmthisisaverylongstringbutitsbhouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyabaabcdefghijkabcddefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZreclynopqrstuvyzabYcjklnlmunopqrstuvbcijklmnopzbabc"], ["abcabcdefghijklmnopdekfghijklmunopqrstuvbc"], ["1labfcdefghjijklmnopqrstuvwxythisisaverylongstringbllbeencodedanddecyodedcorrectlyzab4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugcmnopeencodedbabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopstuvwxyzabcecodedcorreclynopqrstuvwxyzabcccddqrstuvwxyzabc6"], ["abcdefghuijklmthisisaverylongsxXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZtringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopgeencodedanddecodedcorreclynopqrstuvwxyahbcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugczabc"], ["4%^&*8d%*^&y&ttcccbnjabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddklmopzbabc123456kfug"], ["4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcd"], ["1lmnopeencodedanddecodeudcoorreclynopqrstuvwxyzabc6"], ["bcdefgabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefathisisaverylongstringbutitshoabcdefghijklmnopqrstuvwxyababcdefghuiabcdjklmthisdisaverylongstringbutitshouldstiaabcdefghijdklmnopqrzbdlabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabccdefghibceencodedanddecodedcorrectlybcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabcghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabchijklmnopzbazc"], ["hhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&abcdefghijklmnopjpskabdh"], ["abcdefghijklmnopqrstuvwxyabcdefabccabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcddghijklmnopzbabc"], ["hjghgicuegtfbawqwemeuifsunakjqskjabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmabcdefghjijklmnopjqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugct^%*^&yttcccbnjukfugcpskabdh"], ["dabkcdefghijeeklmn"], ["ieencodedanddecoddcorrectly"], ["abcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopyeencodedanddecodedcorreclynopqrstuvwxyzabcccdabcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugcdlmnopqcrstabccdduvabcdefghijkabababcdefghuijklmthisisaverylongsabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabctringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstab123456ccdduvwxyabcdefighjklmnopzbalbcwxyabcdefighjklmnopzbalbc"], ["1456"], ["abkcdefghijeklmhjghgicuegtfbawqwemeuifsunakjqskjabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmabcdefghjijklmnopjqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugct^%*^&yttcccbnjukfugcpskabdhno"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyabcdefghijklmnopqrstuvwxyzzab4%^&*876tyylrmt^%*^&ydttcccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddcdefghijklomnopzbabc"], ["abcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreb"], ["anbcdefghjijklnonxpqrstuvwxyzabc"], ["abccabcdefghuijklmthisefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdd"], ["abcdefghuijklmthisisaverylongstringbutitsbhouldstillbaabcdefghijklmnopbcdefghijklmnopeencocorreclynopqrstuvwxyzabc"], ["abcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutiytshouldstillbeencodedanabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcopzbabclmnvwxyzabccddbabc"], ["abcabcdefghijklmnopddefghijklmunopqrabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorrebcstuvbc"], ["abacbccdababdccdd"], ["babcdefghijklmnop"], ["uabcdefghjijklnonpqrstuvwxjyzabc"], ["thietyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcdecodedcorrectly"], ["ababdccdaabaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabccdefghjijklmncopqrstuvwxyzabcbabcdd"], ["abcdefghjijklnonpqrstuvwxyzabcabocdp"], ["abaxabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZbccdthisisaabccdd"], ["babababcdefghijklmahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstuvwxyzbabctcccbnjukfugcfghijklmnopeeancodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["abcdefghabcdefgkhjijklnopqrstuvwxyzabcjijkdlnopqrstuvwxyzabc"], ["abcdefghijkabcdefghjdiabcdefghuijklmthisgisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjklnlmunopqrstuvbc"], ["thisisaverylongstringbutitdshoiuldstillbabcdgly"], ["4%^&*8%*^&ytcbnj123456kfug"], ["ivabcdefghijklmnopqrabcdeabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvtwxyzabcfghijklmnofpqrstuvwxyzstuvwxyabcdefghijklmnopzbabcGgx"], ["abcdefghijklmnopqrstabccdduvwxyabcdefighjklmnoabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcpzbalbc"], ["abcdefghjijklmnopqrstuvwxhyzghijklaabcdefghjijklnohpqrsmtuvwxyzabcmnowdddffrrehfyj^%*^adabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVmyrSpYEnd&yttcccbnjukfugc"], ["abcdefghijkabababcdefghadabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqvrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghifjklmnopqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEndopzbalbc"], ["rthiedabcdefhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIKLMNOPQRSTUVWXYZopqrstuvwxyzabcandorrectlyababccdd"], ["awxyabcdefghijklmnopzbazc"], ["abkcdefghijeknlmnabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstctcccbnjukfugcnopzbalbco"], ["abcdefghijkabababcdefghuijklmthisisavnerylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["thisisaverylongstringbutbitdshoiuldstillbabcdefgly"], ["xXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarabcdefghijklmnopqraabcdefghijklmnobcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabcyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodbabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylonglstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopstuvwxyzabcecodedcorreclynopqrstuvwxyzabcccddedcoaabcdefghijdklmnopqrzbdrrectly"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongnlstringbutitshouldstillbaabcdefghijddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdd"], ["thisisasverylongstringbutitdshoiuldstillbabcdgly"], ["abcdefghijklmnopqrstuvwxyabcdefghijkabcdefghuijklmthisisaverylongsxXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZtringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopgeencodedanddecodedcorreclynopqrstuvwxyzabclmnopzbabc"], ["abkcdefghjklmnoabcdefghijklaabcdefghjijklnohpqrsmtuvwxthisisaveabcdefghijkabcdefghjdiabcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjklnlmunopqrstuvbcyyzabcmnabcdo"], ["abcdefghjijklmnopqrtsthisisaverylongstringbutitshouldabcdefghuijabcdefgkhjijklnopqrstuvwxyzabcwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcstillbeababdccdababccddrrectlyuvwxyzabc"], ["abcdefghijkabababcitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["abcdefgefghibc"], ["abkcabcdefghijklmnodefghijeeklmn"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcadefghjijklmnopqrstuvwxyzabclbaabcdefghijklmrreclynopqrstuvwxyzabc"], ["abcdefghuiabcdjklmthisiesaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["ababdccdaabcabcabcdefghijklmnopdefghijklmunopqrstuvbccdd"], ["abcdefghjijklmnopqrstuvwx%^&*876tyylrmt^%*^&yttcccbnjukfugc"], ["abcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddabcyzbabc"], ["4%^&*876tyylrmtlskooifnmwddabcdefghijacbccklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijkldmnthiedandabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcdecodedcorrectlyopqrabcdefghijklmnofpqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnoabcdefghijklmunopqrstuvbcaabxXabcdefghijklmaabcdthisisaverylongstringbllbieencodabcdefghijklmnopqrstuvwxyabcdefghibcrrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZcdefghijklmnopqrstuvwxyzbcd"], ["babababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabddefghijklmunopqrstuvbclongstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwadabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVabcdefghjdiabcdefabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjklnmyrSpYEndxyzabcccdd"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodbabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijkbabababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongnlstringbutitshouldstillbaabcdefghijddpbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmthisisaverylonglstringbutitshouldstillbaabcdefghijklmnoabcabcdefghijklmnopmqrstuvwxyzbabccddpbcdefghijklmnopeencodedanddabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopstuvwxyzabcecodedcorreclynopqrstuvwxyzabcccddedcoaabcdefghijdklmnopqrzbdrrectjly"], ["abcdefghjdiabcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnabcdefghjijkdlnopqrstuvwxyzabcostillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvyzabcjkln"], ["ababdccdaabcabcabcdefghijklmnopdefghijklmunopqrstuvbccddabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdefghuijklmthisisavewrylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrsabcdefghijklmunopqabcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcrstnuevbctuvwxyzaubc"], ["XabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabcX"], ["abcdefghijklmnopqrstuvwxyzbaabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabcbc"], ["ababdccdaabaabcdefababccdthisisaverylongostringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrstuvwxyzabccdefghjijklmncopqrstuvwxyzabcbabcdd"], ["VPchkSpKkj"], ["abcdefghijklaaabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnoabcdefghijklmunopqrstuvbcaabxXabcdefghijklmaabcdthisisaverylongstringbllbieencodabcdefghijklmnopqrstuvwxyabcdefghibcrrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZcdefghijklmnopqrstuvwxyzbcdbcdefghjijklnohpqrstuvwxyzabcmno"], ["abcdefghijkabcdefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZrecabaabcdefghiujklmnopqhrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefmnopzbabccdefghijklmnopqrstuvwxyzabcpqrstuvbc"], ["abcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodawxyabcdefghijklmnopzbazcedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabc"], ["4%^&*8%*^&yttcccbnj123456kfababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabcug"], ["abcdefghijklmnopqrstabccdduvwxyabcdefighjklmnoabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdeqfghjijyklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcpzbalbc"], ["abcdefpqrstuvwxyabcdefghibc"], ["abfcdefghjijklmnopqrababccdababccddstuvwxyzab4%^&*876tyylrmtlskooifnmwdddf%*^^&yttcccbnjukfugc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcadefghjynopqrstuvwxyzabc"], ["abcdefghuiagbcdjklmthisdisaverylongstrinbcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["thisisaverylongstringbutitshouldstillbeencodedanddelcodedcorrabcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcadefghjijklmnopqrstuvwxyzabclbaabcdefghijklmrreclynopqrstuvwxyzabcopabcdefghuijklmthiabcbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabcy"], ["4%^&*876tyylrmtlskifnmw4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugdddffrrehfyj^%*^&yttcccbnjukfug"], ["thisisaverylongstringbllbieencodedanddecodrrectl"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedagabcdefghijklmnopqrstuvwxynddecodabcdefghjijklmnopqrstuvwxhyabcdefghijklmnopqrstuvwxyzzab4%^&*876tyylrmt^%*^&ydttcccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["abcdefghuijklmthisisaveryloklmnopbcdefghijklmnopeencodedanddecodedcorrabcdefgefghibceclynopqrstuvwxyzabc"], ["aabcdefghijklmnopqrstuvwxyabcdefghjklmnopzbuabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcdefababccdthisisavertringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghijklmnopqrmstuvwxabcdefghjdijklnopqrstuthissisaverylongstringbllbieencodedanddecoddcorrectlyvwxyzabcyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdmefghijklmnopaabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzthisisaverylcongstringbutitshouldstillbeencodedanddelcodedcorrectlystuvwxyabcdefghijklmopzbabcbccabcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijbcdefghijklmnopawxyabcdefghijklmnopzbazbcencodedanddecodedcorreclynopqrstuvwxyz4%^&*8%*^&yttcccbnj123456kfuggdedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghjiaboacdefijklmnojklmnopqrsbtuvwx%^&*876tyylrmthisisaverylongstringbueencodedanddecodedcorreclyt^%*^&yttcccbnjukfugc"], ["abcdefghijklmnopqrstuvwxyabcdefghijklmnabcdefghjijklnopqrstuvwxyzabcopzbabc"], ["abcdefghjdijklnyopqrstuvfwxyzabc"], ["4%^&*8%*^&yttcccbnjxXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarabcdefghijklmnopqraabcdefghijklmnobcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjijklnopqrstuvwxyzabcyzabcyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abababcdefghijklmnopqrstuvwxyabcdefghijklmnopzbabcabcdefghuijklmthisisaverylongstringbutitshouldstillbaaabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabmcdefighjklmnopzbalbabkcdefghijklabcdefghijkabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbc123456defghijklmnopyeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqcrstabccdduvwxyabcdefighjklmnopzbalbcmnoabcccdd"], ["abcdefghuiabcdjklmthisiesaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcuvwxyzabc"], ["adabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEnd"], ["abfcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooiabcdef4%^&*876tyylrmtlskooifnmwddabcdefghijklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfugghjijklnopqrstuvwxyzaxbcfnmwddtdf%*^^&yttcccbnjukabcdpqrstuvwxyzabcfugc"], ["abcabcdefghijklmnSVmyabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencdecodedcorreclynopqrstuvwxyzabcYEn"], ["abcdefabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmopzbabchjijklmncopqrstuvwxyzabc"], ["abacbccdababdccdabcdefghjdijklnopqrstuvwxyzeabcd"], ["abcdefghuijklmthisisaverylongstringbutiabcdefghijkabcdefghijkzabccddbabctshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutiytshouldstillbeencodedanabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcopzbabclmnvwxyzabccddbabcjijklnopqrstuvwxyzabc"], ["abcdefghijklmunopqrstuvbthisisaverylongstringbueababccddencodedanddecodedcorreclycaabcdefghijklmnopqrstuvwxyzbcd"], ["thisisaverylongstrinababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthiseisaverylongstringbutitshouldstillbijklmnopzbabclmnvwxyzabccddbabcdanddelcod4%^&*876tyylrmtlskooifnmwddabcdefghijklmnopqrstuvwxyzbabcdffrrehfyj^%*^&yttcccbnjukfugrectly"], ["hhjghabcdefghjiijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&abcdefghijklmnopjpskabdh"], ["abcdefghjijklrmtlskooifnmwdddf%*^&yttcccbnjukfugc"], ["abcdefghijklmnopqababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyababccddrabcdefghijklmnopqrstuvwxyzstutvwxyabcdefghijklmopzbabc"], ["aabc4%^&*8%*^&y&ttcccbnjabcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddklmopzbabc123456kfugklmnopqrstuvwxyabcdefghjklmnopzbuabcbcdefghijklmnopqrabcdefgpqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcdefghuijklmthisisaverylongstringbutitsabcdefghijklmnohouldstillbaabdcdefgheijklmnopbcdefghijklmnopeencodedanddecodedcorrecrthiedabcdefhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIKLMNOPQRSTUVWXYZopqrstuvwxyzabcandorrectlyababccddlynopqrstuvwxyzabc"], ["thisisavlerylongstringbutitdshouldstillbabcdefghijklmnopeencoahbcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugcdednanddecodedcorrecly"], ["abcdefghijklmnopqrstabccdduvwxyabcdefighabcdefghijkabababcdefghadabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodabcdefghjijklmnopqvrstuvwxhyzab4%^&*876tyylrmt^%*^&ydttccabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddghifjklmnopqrstuvwxyzabccbnjukfugcedcorrectlybcSVmyrSpYEndopzbalbcjklmnopSVmyrSpYEnzbalbc"], ["acbcabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&ytqtcccbnjukfugc"], ["abcdabcdefghuiabcdjklmthisiesaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcuvwxyzabcefghijklmnopqrstuvwxy"], ["abcdefghuiabcdjklmthisilsaverylongstringbutitshouldstilabcadefghjijklmnopqrstuvwxyzabclbaabcdefghijklmrreclynopqrstuvwxyzabc"], ["abcdefghjijkabcdefghijklmnopqrabcdefghijklmbnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodawxyabcdefghijklmnopzbazcedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabcabclnonpqrstuvwxyzabc"], ["thiedandabcdefghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttncccbnjukfugcdecodedcorrectly"], ["abcdefghijkabababcdefghuijklmthisadabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodedcorrectlybSVmyrpYEncSVmyrSpYEndnopbcdefghijklmmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["abcdefghijklmualmnonopqrstnuvbc"], ["aabcdefababccdthisisaverylolngstringbutitshouldstillbabccddghijklm123456nopqrstuvwxyzabc"], ["abcdefghijklmnopqrstuvwxyababcdefghuiabcdjklmthisdisaverylongstringabcdefghuijklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccdefghibc"], ["abcdefghijklmnopqrstabccdduvwxyabcabababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopzbalbc"], ["tarbAuy"], ["abcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnoabcdefghijklmunopqrstuvbcaabxXabcdefghijklmaabcdthisisaverylongstriIngbllbieencodabcdefghijklmnopqrstuvwxyabcdefghibcrrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZcdefghijklmnopqrstuvwxyzbcd"], ["abcdefghijklmnopqrstuvwxyababcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefgihjijklmnopqrstuvwxyzabclbaabcdefghijklmadabcdefghijklmnopqthisisaverylongstringbllbieencodedanddecodedcorrectlybSVmyrpYEncSVmyrSpYEndnopbcdefghijklmnopeenynopqrstuvwxyzabccdefghibc"], ["abcdefghuijklmthisisaveryylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopfeencodedanddecodedcorreclynopqrstuvtwxyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshouldstilabcdefghjijnklmnoplmnopbcdefghijklmnopeenynopqrstuvwxyzabc"], ["abcdabcdefghuiabcdjklmthisiesaverylongstringbutitshouldstilabawxyabcdefghijklmnopzbazccdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzaabcdefghijklmnopabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabcbclbaabcdefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcuvwxyzabcefghijklmnopqrstuvwxy"], ["abababcdefghuijklmthisisaverylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxhhjghabcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhyzabcccdd"], ["4%^&*8%*^&yttcccbnjxXabcdefghijklmaabcdefababccdthisisaverylongstringbutitshouldstillbeencodedardnddecodedcorrectlabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarabcdefghijklmnopqraabcdefghijklmnobcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcnddecodedcorrectlyababccddmnopqrmstuvwxabcdefghjiivGgxjklnopqrstuvwxyzabcyzabcyababccddghijklmnopqrstuvwxyzabcxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["abcdefghuijklmthisisaverylongstringbutitshouabcdefghjdijklnopqrstuvwxyzabclghijbcdefghijklmn"], ["abcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutiytshouldstillbeencodedanabcdefghuijklmthisisaverylongstringbutitshouldstilabcderfghjijklmnopqrstuvwxyzabclbaabcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcopzbabclmnvwxyzabccddbabc"], ["abcdefghijklaaabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnoabcdefghijklmunopqrstuvbcaabxXabcdefghijklmaabcdthWXYZcdefghijklmnopqrstuvwxyzbcdbcdefghjijklnohpqrstuvwxyzabcmno"], ["abcdefghuiabcdjklmthisiesaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghijkabcdefghijklaabcdefghjijklnohpqrstuvwxyzabcmnolmnopbcabcdefghuiabcdjklmthisdisaverylongstringbutitshouldstilabcdefghjijyklmnopqrstuvwxyzabclbaabgcdahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstctcccbnjukfugcefghijklmnopbcdefghijklmnopeenynopqrstuvwxyzabcuvwxyzabc"], ["abcdefghuiabcdjklmthisisaverylongstringbutitshoculdstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghimnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcdefghijklmunopqrgsabcdefghuijklmthisisaverylongstringbutitshouabcdefghjdiabcdeefghijklmnopqrstabccdduvwxyabcdefghjklmnopzbalbcjklnopqrstuvwxvyzabcldstillbaabcdefghijbcdefghijklmntnuvbc"], ["abcdefghijklmnopqrstuvwxyabcdefghijklmnabcdefghjijklnopqrstuvwxyzabcopzjbabc"], ["aabcdefabab4%^&*8%*^&yttcccbnj123456kfababccdabcdefghijkabcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecod4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugedcorrectlyababccddcdefghijklmnopzbabclmnvwxyzabccddbabcugccdthisisaverylolngstringbutitshouldstillbabccddghijklm123456nopqrstuvwxyzabc"], ["abfcdefghjijklmnopqrstuvwxyzab4%^&*876tyylrmtlskooifnmwddtdf%*^^&yttcccbnjbukabcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcfugc"], ["abcdryylongstringbutitshouldstillbaabdcdefghijklmnopbcdefghijklmnopfeencoalmnodedanddecolynopqrstuvtwxyzabc"], ["abcdefghjijklmnopqrstuvwxhyzghijklaabcdefghjijklnohpqrsmtuvwgxyzabcmnowdddffrrehfyj^%*^adabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVmyrSpYEnd&yttcccbnjukfugc"], ["abcdefghijklaabcdefabcdefnghjijklmnopqrstuvwxhyzab4%^&*876tyylrmtlskooifnmwdddffrrehfyj^%*gcghjijklnohpqrsmtuvwxyzabcmno"], ["abcdefghijklmnthisisaverylongstringbutitshouldstillbeencodedanddelcodedcorrectlybcdefghuijklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabcyzbabc"], ["4%^&*876tyylrmtlskifnmwdabcccddffrrehfyj^%*^xXabcdefghijklmaabcdthisisaverylongstringbllbieencodedanddecodedcorrectly23456789ABCDEFGHIJKLNOPQRSTUVWXYZ&Vyttcccbnjukkfug"], ["abcdefghjijkabcdefghijklmnopqrabcdefghijklmbnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabcdefghijklmnopabcdefghuijahbcdefghlrmtlskooifnmbwdddf%*^&ytabcdefghijklmnopmqrstctcccbnjukfugcklmthisisaverylongstringbutitshouldstillbaabdcdefghijklmnopabcdefghijklmnopqrstuvwxyzbabcbcdefghijklmnopeencodedanddecodawxyabcdefghijklmnopzbazcedcoabcdefghuiabcdjklmthisisaverylongstringbutitshoul12341556wxyzabcrreclynopqrstuvwxyzabcyzbabcabclnonpqrstuvwxyzabc"], ["abcdefghuiatbcdjklmthisisaverylongstringbutitshouldstilabcdefghjijklmnopqrstuvwxyzabclbaabcdefghimnopbcdmefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzabc"], ["abcabcdefghuijklmthisisavewrylongstringbwutitshouldstillbaabcdefghijbcdefghijklmnopeencodedanddecodedcorreclynopqrstuvwxyzaubcdefghjijklmncopqrstquvwxyzabc"], ["abcdefghijkabababcdefghuijklmthisisavnerylongstringbutitshouldstillbaabcdefghijklmnopbcdefghijklabcdefghjijklmnopqrstuvwxhyzghijklaabcdefghjijklnohpqrsmtuvwgxyzabcmnowdddffrrehfyj^%*^adabcdefghijklmabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZqrstuvwxyzbcSVmyrSpYEnd&yttcccbnjukfugcmmnopeencodedanddecodedcorreclynopqrstuvwxyzabcccddlmnopqrstabccdduvwxyabcdefighjklmnopzbal123414556"], ["abcdefghjijklmnopqrstuvwxhyzab4%^&**876tyj^%*^&ytqtcccbnjukfugc"], ["abcdefghijkabcdefghjdiabcdefghuijklmthisisaeverylongstringbutitshouldabcdefghijklmnostillbaabcdefghijbcdefghijklmnopeencoababdccdaabcdefghjijklmnbcopqrstuvwxyzabcdbabcddqrstuvbc"], ["aabcdabcdefghijpklmnopqrstuvwxyabcdefghijklmnopzbabcefahbcdefghlrmtlskooifnmwdddf%*^&yttcccbnjukfugcghijklmnopqrstuvwxyabcdefghjklmnopzbabcbcdefghijklmnopqrabcdefghijklmnopqrstuvwxyzstuvwxyabcdefghijklmnopzbabc"], ["abcdefghijklmnopqrstuvwxyabababccdthisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyabaabcdefghijkabcddefghjdiabcdefghuijkabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWSVmyrrpYEnXYZreclynopqrstuvyzabYcjklnlmunopqrstuvbcijklmnopzbabc"], ["thisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlyabcdefghijklmnopqrstabccdduvwxyabcdefghjklmnopzbalbc"], ["XabcdefababccdthisisaverylongstringbutitshouldstillbeencodedarnddecodedcorrectlyababccddmnxopqrmstuvwxabcdefghjiuvwxyzabcyzabcX"], ["abcdefhhjghabcdefghjijklmnopqrstuvwzxyzab4%^&*8uabcdefghjijklnonpqrstuvwxjyzabc76tyylrmtlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcgabcdefghijklmnopqrstuvwxyzicuegtfbawqwemumeuifsunakjqskjpskabdhghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIKLMNOPQRSTUVWXYZopqrstuvwxyzabc"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["4%^&*876tylrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["hjghgicuegtfbawqwemumeuifsunaikjqskjpskabdh"], ["abcdefghijklmnoabcd"], ["4%^&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmgnopqrstuvwxyz"], ["habcdefghijklmgnopqrstuvwxyzbawqwemumeuifsunaikjqskjpskabdh"], ["ad"], ["abcdefghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["121234563456"], ["abbcd"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcd"], ["abccd"], ["athisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumeuifsunaikjqskjpskabdh"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abcdefghijkabccdpqrstuvwxyz"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoabcd"], ["adabcdefghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNQOPQRSTUVZ"], ["abcdefghijklmnopqrstuvwxyzs0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["addhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdh"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["acbcd"], ["1211234563456"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["abcdefabcdghijklmnabcdefghijklmnop7qrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abLcdefghijklmnopqrstuvwxyz0123456789ABvCDEFGHIJKLMNOPQRSTUVZ"], ["1212314563456"], ["abLcdefghijklmnopqrstuvwxyz012b3456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["abcbcd"], ["4%^&r*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ"], ["abLcdefghijklmnopqrstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["athisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["13233456"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["acbcdhabcdefghijklmgnopqrstuvwxyzbathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcd"], ["abcdefghijklmnopqrstuvwxyzs0123456789ABCDEUVZ"], ["abcdefghijklmn123456o"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcd"], ["abLcdefghijklmnopqrstuvwxabcdefghijklmnoyz0123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUV"], ["abcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abLcd3efghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["abLcdefghijklmnopqrsz0123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUV"], ["abcabcdefghijklmgnopqrstuvwxyzbcd"], ["athisisaverylongstabcdringbutitshouldstillbeencodedecodedcorrectlybcdefghijklmnohabcd"], ["dabccd"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnop7qrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcd"], ["addhjghgicuegtfbawqwemumeuifsunaikjqskjpskabedh"], ["1234656"], ["1212313456"], ["abbacbcdcd"], ["hjgathisisaverylongstabcdringbutitshouldstillbeencodedecodedcorrectlybcdefghijklmnohabcdhgicuegtfbawqwemumeuifsunaikjqskjpskabdh"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["4%^&u*876t*ylfrmlskyooifnmwdadabcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["addhjghgicuegtfbawqwemumeuinaikjqskjpskabedh"], ["abcdefghijklmn12athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd6o"], ["thisisaverylongstringbutitshabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwemumeuifsunaiskjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["4%^&*876tylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfug"], ["abbbcd"], ["51212313456"], ["addhjghgicuegtfbawqwemumeuinaikjqskjpaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhskabedh"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcd"], ["abcdefg23456o"], ["abcbdefghbijklmnop"], ["51habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwemumeuifsunaiskjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh212313456"], ["4%^&*876ehfyj^%*^&yttcccbnjukfug"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["abcdefabcdghijklmnabcdefBghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["4%^&&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["4%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZHrpX"], ["abcdefghadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcdijklmn123456o"], ["athisisaverylongstrinathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["512313456"], ["athisisaverylongstabcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodeditshouldstillbeencodedeanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnju*kfug"], ["121231456abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcd"], ["Mveen"], ["abLcdefghijklmnopqrstuvwxyz012b3456789ABVZ"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCabcdefghijklmn12athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd6oDEFGHIJKLMNOPQRSTUVZodabcd"], ["addhjghgicuegtabcdefghijklmnopqrstuvwxyzifsunaikjqskjpskabdh"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcd"], ["abcdefghijklmno1212313456p"], ["addhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedh"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeeqncodedanddecodedcorrectly"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodeditsheouldstillbeencodedeanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["abbc"], ["athisisaverylongstabcdrdingbutitshouldstillboeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["athisisaverylongstrinathisisaverylongstabcdrddefghijklmnoabcd"], ["YcX"], ["abcdefabcdghijklmnabcdefBghijklmnopqrstuvwxyz012m3456789ABCFGHIJKLMNOPQRSTUVZoabcd"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumeathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdskjpskabdh"], ["4%ttcccbnjukfug"], ["121231345"], ["athisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoabc1212314563456"], ["121231abbacbcdcd4563456"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o2345678athisisaverylongstrinathisisaverylongstabcdrddefghijklmnoabcd9ABCDEFGHIJKLMNOPQRSTUVZ"], ["4%^&*876tyrlrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abbacabLcdefghijklmnopqrstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMNOPQRSTUVZbcdcd"], ["13233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ456"], ["abcdefabcdghijklmnabcdefghijklmhjghgicuegtfbawqweabccdmumeuifsunakjqskjpskabdhdabcd"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcd"], ["thisisaverylongstringbutitsehabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["abcdefghijklmnopqrstuvwxyzs0123456789AkBCDEUVZ"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeeqncodedanddecodedcor4%^&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugrectly"], ["4%^&*876tylrmlskooifabcbdefghbijklmnopnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["4%^&*876tylfrmlskyooifn13233456mwdddffrre3hfy^j^%*^&yttcccbnjukfug"], ["adabcdefghijabcdefghijklmnopc1212314563456"], ["abcbdefghbiaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhjklmnop"], ["112346356"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz012345678B9ABCDEFGHNOPQRSTUVZklmnoabcd"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMabcdefghijklmgnopqrstuvwxyzNOPQRSTUVZ"], ["4%ttcabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfug"], ["YcYX"], ["9abLcd3efghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["athisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmncoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["4%^&*876tyrlrmlskooifnmwdddffrrehfyj^%*^&yabcdefabcdghijklmnabcdefghijklmnop7qrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUUVZoabcdukfug"], ["abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQcRSTUVZ"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumeathisisaverylongstabcdrdingbutitshouldstillbectlybcdefghijklmnoabcdskjpskabdh"], ["abLcdefghijklmnopqrstuvwxyz01abckdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["abbcabcdefabcdghijklmnabcdefBghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abcdeathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdfghijklmno"], ["YcXabbacbcdcd"], ["Ycabcdefg23456oX"], ["HbLl"], ["123athisisaverylongstrinathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd456"], ["abcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789AhBCDEFGHIJKLMNOPQRSTUVZoabcd"], ["4112346356%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yttcccbnjukfug"], ["123athisisaverylongstrinathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdgefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd456"], ["4%^&&*87r6tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcbc"], ["abcdefghijklmgnpopqrstuvwxyz"], ["ddabccd"], ["abcdefghij"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldsathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncodedanddecodedcorrectly"], ["abcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijklmnopqrstuvkwxyz0123456789AhBCDEFGHIJKLMNOPQRSTUVZoabcd"], ["13233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdVZ456"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGzHIJKLMNOPQRSTbUVZklmnoabcd"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZkplmnoabcd"], ["abLcdefghijklmnopsqrstuvwxyz0123456789ABCDEFQGHIJKLMNOPQcRSTUVZ"], ["athisiisaverylongstrinathisisaverylongstabcdrddefghijklmnoabcd"], ["4%^&*&yttcccbnjukfug"], ["13233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodcorrectlybcdefghijklmnoabcdVZ456"], ["abLcdefghijklmnopsqrstuvwxyz0123addhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedh456789ABCDEFQGHIJKLMNOPQcRSTUVZ"], ["addhjghgicuegtfbawqwemumeuifsunaiiikjqskjpskabedh"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectl51212313456ybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcd"], ["acbcdhabcadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZkplmnoabcddefghijklmgnopqrstuvwxyzbathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["adabcdefghijabcd123145663456"], ["4%^&*876tylrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfthisisaverylongstringbutitsehabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyug"], ["abcdefghijklmnabLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ123456o"], ["addhjghgicuegtfbawqwemumeuifsunaiiikjqskjpshjghgicuegtfbawqwemumeuifsunakjqskjpskabdhabedh"], ["4%^&*&ytttcccbnjukfug"], ["4%^&*876adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfug"], ["adabcdefghijabcdefghijklmnopqrstuvwx"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpsikabdh"], ["abcdefghijkabccdpqkrstuvxyz"], ["abcdefghijklmnabLcdefghijklmnopqrstuvwxyz0124%^&&*87r6tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcbc3456789ABCDEFGHIJKLMNOPQRSTUVZ123456o"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumenaikjqskjpskabdh"], ["16"], ["thisisaverylongabbcdstringbutitshabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["Hbl"], ["12123145634"], ["abcdefg234c56o"], ["abcdefghijklmnaebcdefabcdghijklmnabcdefghijklmhjghgicuegtfbawqweabccdmumeuifsunakjqskjpskabdhdabcd12athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd6o"], ["47r6tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcbc"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoaabcd"], ["adthisisaverylongstringbutitsehabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectly"], ["12313456"], ["abbacbcdc"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybabcdefghijklmnabcdefghijklmnopqrstuvwxyz0123456789Aoabcdjklmnoabcbd"], ["acbcdhabcdefghijklmgnongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["athisislaverylongstabcdmnoabcdjklmnoabcbd"], ["habcdefgaddhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedhhijklmgnopqrstuvwxyzbsawqwemumenaikjqskjpskabdh"], ["abbacbcdbcd"], ["123athisisaverylongstrinathisisaverabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcdylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdgefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd456"], ["4%^&&*876tylfrmlskyooifnmwdabLcdefghijklmnopsqrstuvwxyz0123addhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedh456789ABCDEFQGHIJKLMNOPQcRSTUVZdodffrrehfyj^%*^&yttcccbnjukfthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyug"], ["abbaddhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedhacbcdc"], ["AfhJawayHw"], ["abLcdefghiHjklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQcRSTUVZ"], ["thisisaverylongabbcdstringbutitshabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorhrectly"], ["abLcdefadabcdefghijabcdefghijklmnopqrstuvwxyz012345678B9ABCDEFGHNOPQRSTUVZklmnoabcdghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["abcdefghijklmnop4%^&*&ytttcccbnjukfugqrstuvwxyz"], ["abcd6efg234c56o"], ["habcdefghijklmgnopqrstuvwxyzbawqwemumeuh"], ["abcdefabcdghijklmnabcdefBghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMoabcd"], ["abcdefghijklmnabLcdefghijklmnopqrstuvwxyz0124%^&&*87r6tylfrmlskyooifnmw5dddffrrehfyj^%*^&yttcccbnjukfugabcbc3456789ABCDEFGHIJKLMNOPQRSTUVZ123456o"], ["51214%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yt3456"], ["abcdefghijklmnabLcdefghijklmnopqrstuvwxyzabLcdefghijklmnopqrstuavwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcd6o"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZkathisislaverylongstabcdmnoabcdjklmnoabcbdlmnoabcd"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["abcdefghijklmn12athisisav112346356erylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd6o"], ["121123456313233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdVZ456456"], ["addhjghgicuegtfbawqwemumeuiabcdefghijklmno1212313456pfsunaikjqskjpskabedh"], ["4%ttcccbnjabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdukfug"], ["abLcdefghiHjklmnopqrstuvwxyz0123456789ABCDEFadabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdGHIJKLMNOPQcRSTUVZ"], ["abLcdefghijklmnopqrsz0I123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUV"], ["athisisaverylongstabcdreingbutitshouldstillbeencodedanddecodeditsheouldstillbeencodedeanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["adabcdefjghijabc"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["4%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^g"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodeadcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789abLcdefghijklmnopqrsz0I123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVZabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcd"], ["abbaddhjghgicuegtf1212313456bawqwemujmeuinaikjqskjpskqabedhacbcdc"], ["athisisaverylongstabcdringbutitshouldstillbeencabcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijkdlabccdnddecodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtjklmnoabcbd"], ["abcdefghijklmnopqrstabcdefghijklmgnuvwxyzZ"], ["121231456ababcdefghijklmnabLcdefghijklmnopqrstuvwxyz0124%^&&*87r6tylfrmlskyooifnmw5dddffrrehfyj^%*^&yttcccbnjukfugabcbc3456789ABCDEFGHIJKLMNOPQRSTUVZ123456oDEFGHIJKLMNOPQRSTUVZodabcd"], ["habcdefghijklmgnopqrstuvwxyzbsabdh"], ["abcdefghthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyijklmnopqrstuvwxyzs012356789AkBCDEUVZ"], ["athisiisaverylongstrinathisisaverylongstabcaddhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedhdrddefghijklmnoabcd"], ["4%^&*876tylrmlskyooifnmwdddffrrehfyjj^%*^&yttcccbnjukfug"], ["H"], ["adabcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoHbLld"], ["abcdefghijklmnopqrstabcdefgh4%^&&*87r6tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcbcijklmgnuvwxyzZ"], ["4%^&u*876t*ylfrmlskyooifnmwdadabcdefghijabcdefghijklmopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug"], ["abLcdefghijklmnopqrstuvwxyz0123456789ABCDAEFGHIJKLMNOPQRSTUVZ"], ["4%ttcabLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugad"], ["5kyooifnmwddodffrrehfyj^%*^&yt3456"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtf4%^&*876tylrmlskooifabcbdefghbijklmnopnmwdddffrrehfyj^%*^&yttcccbnjukfugbawqhabcdefghijklmgnopqrstuvwxyzbsawqwemumenaikjqskjpskabdhwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoadwdhjghgicuegtfbawqwemumeuifsunaiiikjqskjpshjghgicuegtfbawqwemumeuifsunakjqskjpskabdhabedhabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["thisisaverylongstringbutitshabtcdefghijkabccdpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["4%^&*&ytttcccbnadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectl51212313456ybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcdjukfug"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldsathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncoabbacbcdbcddcorrectly"], ["4%ttcccbnug"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOcd"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGwHIJKLMNOPQRSTUVZcoabcd"], ["abLcdefghijklmnopqrshabcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhKLMNOPQRSTUVZ"], ["adabcdefghijabcdefghijkadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcdlkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcd"], ["abcdefa3bcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcd"], ["121123456313233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnoprqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillbeenicodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdVZ456456"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstjuvwxyz0123456789ABCthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldsathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncoabbacbcdbcddcorrectlyDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskdjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["4%ttcabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEiFGHIJKLMNOPQRSTUVZoabcdccbnjukfug"], ["abcdefghijklmnopqrstuvwxyzs0123456789ABCDEFGHIJKLMNOPQRSTUHbLlVZ"], ["dLK"], ["4u%^&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["abcdefghijklmnabLcdefghijklmnopqrstuvwxyzabLcdefghijklmnopqrstuavwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIxJKLMNOPQRSTUVZcoabcd6o"], ["adabcdefghijabcdefgddabccdhijkadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcdlkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcd"], ["adabcdefghijabcdefghwijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcd"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHI51214%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yt3456JKLMNOPQRSTUVZ"], ["abcdefghijkabcabcdefghijklmnop4%^&*&ytttcccbnjukfugqrstuvwxyzcdpqkrstuvxyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcdz"], ["addhjghgicuegtfbawqwemumeuifs4%^&*876adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfugunaiiikjqskjpskabedh"], ["abbacabLcdefUghijklmnopqrstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMNOPQRSTUVZbcdcd"], ["abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVaddhjghgicuegtfbawqwemumeuinaikjqskjpskabedhZ"], ["121231abbacbdcd4563456"], ["athisislaveryabbaddhjghgicuegtf1212313456bawqwemujmeuinaikjqskjpskqabedhacbcdclongstabcdmnoabcdjklmnoabcbd"], ["abcdefghijklmgstuvwxyz"], ["thisisaverythisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeeqncodedanddecodedcor4%^&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugrectlylongstringbutababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["123456thisisaverylongstringbutitshabtcdefghijkabccdpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghiwjklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["hjghgicuegtfbawqwemumeuif4%ttcabLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugadabdh"], ["abbacbcdhabcadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZkplmnoabcddefghijklmgnopqrstuvwxyzbathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhdcd"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtf4%^&*876tylrmlskooifabcbdefghbijklmnopnmwdddffrrehfyj^%*^&yttcccbnjukfugbawqhabcdefghijklmgnopqrstuvwxyzbsawqwemumenaikjqskjpskabdhwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoadwdhjghgicuegtfbawqwemumeuifsunaiiikjqskjpshjghgicuegtfbawqwemumeuifsunakjqskjpskabdhabedhabcdemumeuifsunaikjqsabcdefghijklmnabLcdefghijklmnopqrstuvwxyz0124%^&&*87r6tylfrmlskyooifnmw5dddffrrehfyj^%*^&yttcccbnjukfugabcbc3456789ABCDEFGHIJKLMNOPQRSTUVZ123456odh"], ["4%^&u*876t*ylfrmlskyooifnmwdadabdcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug"], ["adabzcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOcd"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldsathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncoabbacbcdbcddcoradrectly"], ["abLcdefghijklmnoMpsqrstuvwxyzA0123456789ABCDEFQGHIJKLMNOPQcRSTUVZ"], ["adabcdefghijabcdefgddabccdhijkadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZklmnoabcdlkmnopqrstuvwxyz0123456789Zklmnoabcd"], ["121231abba4%^&*876tylrmlskooifnmwdddffrrehfyj^%*^&yttcccbnjukfugcbcdcd4563456"], ["4%ttcabLcdefghijklmacbcdhabcdefghijklmgnongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh56789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugad"], ["121123456313233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUathisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnoprqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitshouldstillhbeenicodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdVZ456456"], ["abbbacbcdcd"], ["abcdefghijklmnopqrstuvwxyzs012345678i9AkBCDEUVZ"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyzw0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcd"], ["thisisaverythisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeeqnc4%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^gbbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["abLcdefghijklmnopsqrstuvwxyz0123456789ABCDEFQGHIJKLMNOPQcRSTUVZabbacabLcdefUghijklmnopqrstuvwxabcdefghijklmnoyz0abcdefghijklmnoabcd123456789ABCDEFGHIJKLMNOPQRSTUVZbcdcd"], ["athiathisisaverylongstabcdringbutitshouldstillbeencodedanddecodeditshouldstillbeencodedeanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbdsisaverylongstabcdringbutitshouldstillbeencodedanddecodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["athisisaverylongstababcbdefghbijklmnopcdringbutitshoadabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylonlgstringbutitwshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcduldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd"], ["adabc"], ["HHH"], ["abcdefghijklmnopqrstuvAwxyzs012345678i9AkBCDEUVZ"], ["pa"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789abLcdefghijklmnopqrsz0I123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVZabtcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDjEFGHIJKLMNOPQRSTUVZcoabcd"], ["4abbacbcdcbcbdefghbijklmnopnmwdHbLlddffrrehfyj^%*^&yttcccbnjukfug"], ["abbacbcdhabcadabcdefghijabrcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZkplmnoabcddefghijklmgnopqrstuvwxyzbathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhdcd"], ["thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnop7qrstuvwxyz0123456789ABCDEFGHIJathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdKLMNOPQRSTUVZoabcd"], ["athisisaverylongstabcdringbutitshouldstillbexencabcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijkdlabccdnddecodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtjklmnoabcbd"], ["4%ttcabLcdefghijklmacbcdhabcdefghijklmgnongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeadabcdefghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcduifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh56789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugad"], ["hjghgicuegtfbawqwemumeuif4%ttcabLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGIHIJKLMNOPQRSTUVZoabcdccbnjukfugadabdh"], ["abcdefghijklmn123a456o"], ["1215kyooifnmwddodffrrehfyj^%*^&yt34562313456"], ["abcdefghijklmniopqrstabcdefghijklmgnuvwxyzZ"], ["abcdefabcdghijklmnab7cdefBghijklmnopqrstuvwxyz012m3456789ABCFGHIJKLMNOPQRSTUVZoabcd"], ["4%^&*876tylfrmlskyooifn13233456mwdddf4%ttcccbnuge3hfy^j^%*^&yttcccbnjukfug"], ["abcdefghijkllmnopqrstuvwxyzs012345678i9AkBCDEUVZ"], ["addhjghgicuegtfbawqwemumeuifs4%^&*876adabcdefghijabcdefghijklkmnopqrabbbacbcdcdstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfugunaiiikjqskjpskabedh"], ["abcdefghijklmnopqrstuvwxyzs0123456789ABCoDEFGHIJKLMNOPQRSTUVZ"], ["412345"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789abLcdefghijklmnopqrsz0I123abcdefghijklmnopqrstabcdefghijklmgnopqrstuvwxyzZ456789ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVZabtcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDIjEFGHIJKLMNOPQRSTUVZcoabcd"], ["athisisaverylongstabcdringbutitshouldstillbexencabcdefghijklmnabcdefghijklmnopqrstabcdefgh4%^&&*87r6tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugabcbcijklmgnuvwxyzZopqrstuvwxyabcdefabcdghijklmnabcdefghijkdlabccdnddecodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtjklmnoabcbd"], ["adabcdefghijabcdefgh4%^&*876adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfugijklmnopqrstuvwx"], ["4%^&*876tylabcdefghijklmnop4%^&*&ytttcccbnjukfugqrstuvwxyzrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukftabcdefghijklmnabLcdefghijklmnopqrstuvwxyz0124%^&&*87r6tylfrmlskyooifnmw5dddffrrehfyj^%*^&yttcccbnjukfugabcbc3456789ABCDEFGHIJKLMNOPQRSTUVZ123456ohisisaverylongstringbutitsehabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyug"], ["admabcdefghijabcdefghwijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcd"], ["abcdefghthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyijklmnopqrstDEUVZ"], ["4%^&*876ehfyj^%*addhjghgicuegtabcdefghijkabcdefghijklmnopqrstuvwxyzs0123456789ABCDEFGHIJKLMNOPQRSTUVZlmnopqrstuvwxyzifsunaikjqskjpskabdh^&yttcccbnjukfug"], ["habcdefghijklmgnopqrstuvwx"], ["adabcdefghijabcdefghijklmnopqrstuvwxyaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabedhz01OPQRSTUVZklmnoabc1212314563456"], ["XuDTtLIY"], ["abcdefghijklmn12athisisaathisisaverylongstrinathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdv112346356erylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd6o"], ["hjghgicuegtfbawqwemumeuifsunadhabcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijklmnopqrstuvkwxyz0123456789AhBCDEFGHIJKLMNOPQRSTUVZoabcd"], ["athisisaverylongstabcdringbuteanddecodedcorrectlybcdefghijklmnoabcdjklmnoabcbd"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstjuvwxyz0123456789ABCthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwadabcdefghijabcdefgh4%^&*876adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfugijklmnopqrstuvwxxyzouldsathisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncoabbacbcdbcddcorrectlyDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskdjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["15abLcdefadabcdefghijabcdefghijklmnopqrstuvwxyz012345678B9ABCDEFGHNOPQRSTUVZklmnoabcdghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHIJKLMNOPQRSTUVZ3233456"], ["thisisaverylongstringabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZodabcdedanddecodedcorrectly"], ["Ycabcdefg23456o"], ["12124%^&u*876t*adabdcdefghijabcdefghijklmnopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug34563456"], ["abbacabLcdefUghijklmnopqrstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMCNOPQRSTUVZbcdcd"], ["addhjghgicuegtfbawqwemumeuif12123145634sunaikjqskjpskabdh"], ["addhjghgicuegtfbawqwemumeuin4%^&*876tylrmlskyooifnmwdddffrrehfyjj^%*^&yttcccbnjukfugqskjpskabedh"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoaVbcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh"], ["Mvee"], ["abcdefghijklmnopqrstuvwxyz0123456789AB4%ttcccbnjabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdukfugCDEFGHIJKLMNOPQRSTUVaddhjghgicuegtfbawqwemumeuinaikjqskjpskabedhZ"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz012345678adabcdefghijabcdefghijklmnopqrstuvwxVZkathisislaverylongstabcdmnoabcdjklmnoabcbdlmnoabcd"], ["adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZkathisislaverytlongstabcdmnoabcdjklmnoabcbdlmn"], ["abcdefabcdghijklmna6789ABCFGHIJKLMNOPQRSTUVZoabcd"], ["athisisaverylongstrinabbacbcdbcdathisisaverylongstabcdrddefghijklmnoabcd"], ["9abLcd3efghijklmnopqrstuvwxyz0123456789ABMCDEFGHIJKLMNOPQRSTUVZ"], ["4%^&u*876t*ylfrmlskyoabcdefg23456ojklmopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug"], ["adbbacbcdc"], ["4%^&&*876tylfrmlskyooifnmwdabLcdefghijklmnopsqrstuvwxyz0123addhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedh456789ABCDEFQGHIJKLMNOPQcRSTUVZdodffrrehfyj^%*^&yttcccjbnjukfthisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectlyug"], ["thisisaverylongstringbutitshabtcdefpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["HbLadabcdefghijabcdefghijklmnopqrstuvwxl"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumeathisisaverylongstabcdrdingbuabcdefghijklmn123a456otitsho13233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ456uldstillbectlybcdefghijklmnoabcdskjpskabdh"], ["habcdefghijklmgnopqrstuvwuxyzbawqwemumeuh"], ["1212314563"], ["adabcdefj51214%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yt3456ghijabc"], ["athisisaverylongstababcbdefghbijkldcorrectlybcdefghijklmnoabcd"], ["a4u%^&*876tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfugbcdefghijklmgnopqrstuvwxyz"], ["ANHbWTTWvF"], ["4%^&&*876tylfrmlskyooifnmwddodffrrelhfyj^%*^&yttcccbnjukfug"], ["4%^&&*8y76tylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["athisiisaverylongstrinathisisaverylongstabcaddhjghgibcuegtf1212313456bawqwemumeuinaikjqskjpskqabedhdrddefghijklmnoabcd"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789thisisaverylongstringbutitshabcdefghijkabccdpqrstuvwxyzouldstillbeencod1212314563edanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnop7qrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdABCDEFGHIJKLMNOPQRSTUVZodabcd"], ["athisisaverylongstabcdringbutitshouldstillbeencabcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijkdlabccdnddecodeditshouldstillbeencodedanddecodedcorrectlybcdefgabcdefghijklmnopqrstabcdefghijklmgnuvwxyzZhijklmnoabcdtjklmnoabcbd"], ["4%^&&*876t8ylfrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["12512314563"], ["habcdefgaddhjghgicuegtf1212313456bawqwemumeu12123145634inaikjqskjpskqabedhhijklmgnopqrstuvwpxyzbsawqwemumenaikjqskjpskabdh"], ["abLcdefghijklmnopqrstuvABCDEFGHIJKLMNOPQRSTUV"], ["abbacbcdhabcadabcdefghijabrcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZkplmnoabcddefghijklmgnopqrstuvwxyzbathisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdsaddhjghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhdcd1212314563"], ["YGsOGZacb"], ["thisisaverylongstringbutitshabcdefghijkabccdpqitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtillbeeqncodedanddecodedcorrectly"], ["thisisaverylongstringbutitsehabcjkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcorrectly"], ["4%^&*876tyrlrmlskooitcccbnjukfug"], ["addhjghgicuegtf1212313456bawq1wemumeuinaikjqsk4%^&*876tylrmlskyooifnmwdddffrrehfyj^%*^&yttcccbnjukfthisisaverylongstringbutitsehabcdefghijkababbacbcdcdccdpqrstuvwxyzouldstillbeencodedanddecodedcororectlyugjpskqabedh"], ["123athisisaverylongstrinathisisaverabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZcoabcdylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdgefghiijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd456"], ["4u%^&*876tylfrmlsky^ooifnmwdddffrrehfyj^%*^&yttcccbnjukfug"], ["14%^&u*876t*ylfrmlskyoabcdefg23456ojklmopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug211234563456"], ["habcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskHbLadabcdefghijabcdefghijklmnopqrstuvwxldh"], ["thisisaverylongstringbutitshabtcdefpqrxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["abLcdefghijklmnopqr4%ttcabLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugadstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ"], ["abcdehabcdefghijklmgnopqrstuvwxyzbawqwemumeuhhijklmn123456o"], ["athisiisaveryladabcdefghijabcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectl51212313456ybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcdongstrinathisisaverylongstabcdrddefghijklmnoabcd"], ["abLcdefghiHjklmnopqrstuvwxyz0123456789ABCDEFadabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnotabcdGHIJKLMNOPQcRSTUVZ"], ["abLcdefghijklmnopqrstuvwxyz01abcdefghijklmn123456o23456789ABCDEFGHI51214%^&&123456thisisaverylongstringbutitshabtcdefghijkabccdpqrstuvwxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcd*876tylfrmlskyooifnmwddodffrrehfyj^%*^&yt3456JKLMNOPQRSTUVZ"], ["4%^&*876adabcdefghijabcdefghijklkmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRhjghgicuegtfbawqwemumeuifsunakjqskjpskabdhSTUVZklmnoabcdtylfthisisaverylongstringbutitshabtcdefpqrxyzouldstilylbeeqncodedanddecodedcorrectlyabcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m3456789ABCDEFGHIJKLMNOPQRSTUVZoabcdrmlskyooifnmwdddffrrehfy^j^%*^&yttcccbnjukfug"], ["abcdhabcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhefghijYcYXklmno"], ["habcdefghijklmgnopqrstuvwxyzbsawqwemumeath4abbacbcdcbcbdefghbijklmnopnmwdHbLlddffrrehfyj^%*^&yttcccbnjukfugisisaverylongstabcdrdingbutitshouldstillbectlybcdefghijklmnoabcdskjpskabdh"], ["abLcdefghiaddhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedhjkl"], ["addhjqghgicuegtfbawqwemumeuifsunaiakjqskjpskabedh"], ["abcdefghijklmgnpopqrstuvwx4%^&*876tylrmlskooifabcbdefghbijklmnopnmwdddffrrehfyj^%*^&yttcccbnjukfugyz"], ["abcdefghi4%^&u*876t*ylfrmlskyoabcdefg23456ojklmopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfugj"], ["abLcdefghijklmvnopsqrstuvwxyz0123456789ABCDEFQGHIJKLMNOPQcRSTUVZ"], ["abLcdefghijklmnopqrstuvwxyz012b3456789ABCDEFGHIJKLMNOP3QRSTUVZ"], ["abcdhabcdefghijklmgnopqrstuvwxyzbsaddhjghgicuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhefghijYcYXklgmno"], ["athisisaverylongstabcdringbutitshouldstillbeencodedanddecodedcorrectlybcdefghiathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrecabLcdefghijklmnopqrstuvwxyz012b3456789ABVZtlybcdefghijklmnoabcdjklmnoabcbd"], ["sO"], ["habcdefghijdklmgnopqrstu"], ["4%^lmnopqrstuvwxyz01OPQRSTUVZklmnoabcdcbnjukfug"], ["athisisaverylongstabcdringbutitshoulpdstillbeencodedanddecodedcorrectlybabcdefghijklmnabcdefghijklmnopqrstuvwxyz0123456789Aoabcdjklmnoabcbd"], ["athisisaverylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlabcdefabcdghijklmnabcdefghijklmhjghgicuegtfbawqweabccdmumeuifsunakjqskjpskabdhdabcdoabcd"], ["abcgdefghijklimnop"], ["abLcdefghijklmnoTUVZ"], ["habathisislaverylongstabcdmnoabcdjklmnoabcbdcdefghijklmgnopqnrstuvwxyzabcdefghijklmnojghgicuegtfbawqwemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpsikabdh"], ["1231456"], ["123athisisaverylongstrinathisisa13233456verylongstabcdrdingbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdgbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcd456"], ["1HbLadabcdefghijabcdefghijklmnopqrstuvwxl2512314563"], ["abLcdefabLcdefghiHjklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQcRSTUVZyz0123456789ABCDEFQGHIJKLMNOPQcRSTUVZ"], ["thisisaverylongstringbutitshouldadmabcdefghijabcdefghwijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcdddecodedcorrectly"], ["athisisaverylongstabcdringbabbacabLcdefUghijklmnopqrstuvwxabcdefghijklmnoyz0123456789ABCDEFGHIJKLMCNOPQRSTUVZbcdcdodeditshouldstillbeencodedanddecodedcorrectlybcdefghijklmnoabcdtjklmnoabcbd"], ["abcdhabcdefghijklmgnopqrstuvwxyzbsaddhjghgicyuegtfbawqwabcdefatbcdghijklmnabcdefghijklmnopqrstuvwxyz0123456a789ABCDEFGHIJKLMNOPQRSTUVZoabcdemumeuifsunaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdhefghijYcYXklmno"], ["4%4%^&&*876tylfrmlskyooifnmwddodffrrehfyj^%*^g^&*&ytttcccbnjukfug"], ["athisisaverylongstabcdringbutitshouldstillbeencabcdefghijklmnopqrstuvwxyabcdefabcdghijklmnabcdefghijkdlabccdnddecodeditshouldstillbeencodedanddecodedcorrectlybcdefgabcdefghijklmnopqrstabcdefghijkllmgnuvwxyzZhijklmnoabcdtjklmnoabcbd"], ["abcdefabcdghijklmnabcdefghijklmnopqrstuvwxyz012m34567habcdefgaddhjghgicuegtf1212313456bawqwemumeuinaikjqskjpskqabedhhijklmgnopqrstuvwxyzbsawqwemumenaikjqskjpskabdh89ABCDEFGHIJKLMNOPQRSTUVZoabcd"], ["adabcdefghijabcdefghwijklmnopqrstuvwxyz0123456789ABCDEFGHathisisaverylongstringbutitshouldstillbeencodedaqnddecodedcorrectlybcdefghijklmnoabcdIJKLMNOPQRSTUVZklmnoabcd"], ["4%ttcabLcdefghijklmacbcdhabcdefghijklmgnongstabcdringaikjqskjpskabdhawqwemumeuifsunaikjqskjpskabdh56789ABCDEFGHIJKLMNQOPQRSTUVZqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZoabcdccbnjukfugad"], ["addhjghgicuegtfbawqwemumeuifsunaikjqskjpskabhabcdefghijklmgnopqrstuvwxyzbsawqwemumeathisisaverylongstabcdrdingbuabcdefghijklmn123a456otitsho13233abLcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVZ456uldstillbectlybcdefghijklmnoabcdskjpskabdhdh"]], "completion": "\nimport numpy as np\n\ndef encode_cyclic(s: str):\n \"\"\"\n returns encoded string by cycling groups of three characters.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n\ndef decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[-1] + group[:-1]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n", "raw_completion": "```python\nimport numpy as np\n\ndef encode_cyclic(s: str):\n \"\"\"\n returns encoded string by cycling groups of three characters.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n\ndef decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[-1] + group[:-1]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n``` \n\nThe `decode_cyclic` function takes as input a string encoded with `encode_cyclic` function and returns the decoded string. It splits the given input string into groups of three characters and then reverses the cyclic shift performed by the `encode_cyclic` function.", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef encode_cyclic(s: str):\n \"\"\"\n returns encoded string by cycling groups of three characters.\n \"\"\"\n # split string to groups. Each of length 3.\n groups = [s[(3 * i):min((3 * i + 3), len(s))] for i in range((len(s) + 2) // 3)]\n # cycle elements in each group. Unless group has fewer elements than 3.\n groups = [(group[1:] + group[0]) if len(group) == 3 else group for group in groups]\n return \"\".join(groups)\n\n\ndef decode_cyclic(s: str):\n \"\"\"\n takes as input string encoded with encode_cyclic function. Returns decoded string.\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/39", "prompt": "\n\ndef prime_fib(n: int):\n \"\"\"\n prime_fib returns n-th number that is a Fibonacci number and it's also prime.\n >>> prime_fib(1)\n 2\n >>> prime_fib(2)\n 3\n >>> prime_fib(3)\n 5\n >>> prime_fib(4)\n 13\n >>> prime_fib(5)\n 89\n \"\"\"\n", "entry_point": "prime_fib", "canonical_solution": "\n\n import random\n def miller_rabin(n, k=10):\n \"\"\"Test if n is prime using the Miller-Rabin primality test.\"\"\"\n if n < 2:\n return False\n if n == 2 or n == 3:\n return True\n if n % 2 == 0:\n return False\n\n r = 0\n d = n - 1\n while d % 2 == 0:\n r += 1\n d //= 2\n\n for _ in range(k):\n a = random.randint(2, n - 2)\n x = pow(a, d, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n\n return True\n\n c_prime = 0\n a, b = 0, 1\n while c_prime < n:\n a, b = b, a + b\n if miller_rabin(b):\n c_prime += 1\n return b\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(1) == 2\n assert candidate(2) == 3\n assert candidate(3) == 5\n assert candidate(4) == 13\n assert candidate(5) == 89\n assert candidate(6) == 233\n assert candidate(7) == 1597\n assert candidate(8) == 28657\n assert candidate(9) == 514229\n assert candidate(10) == 433494437\n\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert 1 <= n <= 12, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[1], [2], [3], [4], [5], [6], [7], [8], [9], [10]], "atol": 0, "plus_input": [[11], [12]], "completion": "\n\ndef prime_fib(n: int):\n def is_prime(num):\n if num <= 1:\n return False\n for i in range(2, int(num**0.5)+1):\n if num % i == 0:\n return False\n return True\n \n def is_fib(num):\n a, b = 0, 1\n while b < num:\n a, b = b, a+b\n return b == num\n \n count = 0\n num = 2\n while count < n:\n if is_fib(num) and is_prime(num):\n count += 1\n num += 1\n return num-1\n\n", "raw_completion": "```python\n\ndef prime_fib(n: int):\n def is_prime(num):\n if num <= 1:\n return False\n for i in range(2, int(num**0.5)+1):\n if num % i == 0:\n return False\n return True\n \n def is_fib(num):\n a, b = 0, 1\n while b < num:\n a, b = b, a+b\n return b == num\n \n count = 0\n num = 2\n while count < n:\n if is_fib(num) and is_prime(num):\n count += 1\n num += 1\n return num-1\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef prime_fib(n: int):\n \"\"\"\n prime_fib returns n-th number that is a Fibonacci number and it's also prime.\n >>> prime_fib(1)\n 2\n >>> prime_fib(2)\n 3\n >>> prime_fib(3)\n 5\n >>> prime_fib(4)\n 13\n >>> prime_fib(5)\n 89\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/40", "prompt": "\n\ndef triples_sum_to_zero(l: list):\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n\n >>> triples_sum_to_zero([1, 3, 5, 0])\n False\n >>> triples_sum_to_zero([1, 3, -2, 1])\n True\n >>> triples_sum_to_zero([1, 2, 3, 7])\n False\n >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])\n True\n >>> triples_sum_to_zero([1])\n False\n \"\"\"\n", "entry_point": "triples_sum_to_zero", "canonical_solution": "\n for i in range(len(l)):\n for j in range(len(l)):\n for k in range(len(l)):\n if i != j and i != k and j != k and l[i] + l[j] + l[k] == 0:\n return True\n return False\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 3, 5, 0]) == False\n assert candidate([1, 3, 5, -1]) == False\n assert candidate([1, 3, -2, 1]) == True\n assert candidate([1, 2, 3, 7]) == False\n assert candidate([1, 2, 5, 7]) == False\n assert candidate([2, 4, -5, 3, 9, 7]) == True\n assert candidate([1]) == False\n assert candidate([1, 3, 5, -100]) == False\n assert candidate([100, 3, 5, -100]) == False\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 3, 5, 0]], [[1, 3, 5, -1]], [[1, 3, -2, 1]], [[1, 2, 3, 7]], [[1, 2, 5, 7]], [[2, 4, -5, 3, 9, 7]], [[1]], [[1, 3, 5, -100]], [[100, 3, 5, -100]]], "atol": 0, "plus_input": [[[0, 0, 0]], [[1, 1, -2, -2]], [[2, 3, -5, 0, 1, -1]], [[5, -5, 10, 0, -10]], [[1, 2, -3, -4, 5, 6]], [[1, 1, 1, -2, -2, -2]], [[1, 2, 3, -6, 7, 0, -1]], [[1, -1, 0, 0, 2, -2]], [[10, -20, 30, -40, 50, -60]], [[1, 2, 3, 4, 5, -9]], [[0, 1, 0, 0]], [[1, 2, 3, -6, 7, -1]], [[-2, -2]], [[5, -5, -60, 0, -10]], [[-2, -1]], [[2, 3, -5, 0, 4, 1, -1]], [[1, -2, -4]], [[-2]], [[10, -20, 30, -40, 50, 30, -60]], [[1, 3, -5, 1, -1, 2]], [[1, 2, 3, -6, 7, 0, -6, -1]], [[1, -2, -2, 1]], [[2, 3, -10, -5, 0, 4, 1, -1]], [[-1, -2, 1]], [[1, 2, 3, 4, 5, 2, 4]], [[1, 1, 2, 3, 4, 5, -9, 1]], [[1, 1, 2, 3, 4, 5, -9, 1, 1]], [[1, 2, 3, 7, -1]], [[1, 2, 3, -6, 7, 0, -1, 2]], [[1, 2, 3, 4, 5, 4]], [[5]], [[2, 3, 7, 1]], [[1, 1, 2, 3, 4, 5, -9, 1, 1, 1]], [[1, 2, 3, -6, 4, 7, 0, -1, 2]], [[1, 2, 4, 5, -9, 3]], [[2, 3, -10, -5, 1, 4, 1, -1]], [[7, -2, -4]], [[-2, -10, 0, -2]], [[5, 5, 5]], [[1, 1, 3, 4, 5, -9, 1, 1]], [[1, 1, -2, 0, -2]], [[10, -20, 30, -20, 6, -40, 50, -60, -60, 10]], [[-2, 30, 0, -2]], [[1, 2, 3, -6, 7, 0, -6, -1, 7]], [[1, 2, 3, -6, 7, 0, -6, -1, 7, 1]], [[1, 1, 2, 3, 4, 4, -9, 1]], [[2, 3, -10, -5, 1, 4, 1, -1, 3]], [[1, 2, 3, 4, 5, 2, 4, 5, 5]], [[1, 1, -1, 1, -2]], [[1, 2, 3, -6, 7, 0, 6, -1, 2]], [[10, -20, 30, -20, 6, -40, 50, -60, 10, -40]], [[1, 1, -2, -3]], [[1, 2, 3, 4, -9, 4, 2]], [[1, 1, 1, -2, -2, -2, 1]], [[1, 2, 3, -6, 7, 0, -6, -1, 7, 1, -1, -6]], [[-2, 1, 2, 3, 4, 5, -9, 1]], [[1, 2, 3, -6, 0, -1]], [[-1, -2, 1, 1]], [[1, 2, -3, -4, 6, 6]], [[2, 3, 7, 7, 1]], [[10, -20, 30, -40, 50, -60, 30]], [[1, 2, 3, -6, 7, 0, -1, 2, 1]], [[2, 3, -6, 0, 0]], [[1, 2, -3, 2, 6, 6]], [[1, 2, 3, 7, -1, 3]], [[1, 1, -3]], [[10, -20, 30, -40, 50, 30, -60, 30]], [[1, 2, 3, -6, 7, 0, -6, 2, -1, 7, 1, -1, -6]], [[2, 3, -5, 0, 4, 0, 1, 2, -1]], [[1, 4, 2, 3, -1, 4, 5, 2, 4]], [[1, 2, 3, -6, 7, 5, -1]], [[1, 6, 3, -6, 7, 0, -6, -1, 7, 1, -1, -6]], [[10, -20, 30, -39, 31, 50, 30, -60]], [[2, 3, -5, 0, 3, 0, 1, 2, -1]], [[1, 2, 31, -6, 7, 0, -1, 2, 1, 3]], [[0, 2, 3, -6, -10, 0, -1, 2, 1, 1]], [[1, 2, 3, -6, 7, 0, -6, -1, 7, -6]], [[10, -20, 29, -20, 6, -40, 50, -60, 10, -40]], [[2, 3, 50, 0, 3, 0, 4, 2, -1, 2]], [[1, 2, 3, -6, -6, 7, -6, -1]], [[2, 5, 3, -10, -5, 0, 4, 1, -1]], [[-10, 1, 1, 2, 3, 4, 5, 5, -9, 1]], [[0, 1, -2, -3]], [[1, 2, 3, -6, 7, 5, -1, 5]], [[1, 2, 3, -6, 7, 5, -1, 5, 1]], [[1, 2, 3, 2, 5, 4]], [[2, 3, -5, 0, -3, 4, 1, -1]], [[-3, -2]], [[10, -19, 30, -40, 50, 30, -60]], [[1, 1, -1, 6, 1, -1]], [[0, 2, 3, -6, -10, 0, -1, 2, 1, 1, -1]], [[1, 1, -1, 6, 1, -1, 1]], [[1, 1, -6, 6, 1, -1, 1]], [[10, -20, 30, -20, 6, -40, 50, -60, -60]], [[1, 2, 3, -6, 7, 0, -6, -1, 7, -1]], [[1, 2, -3, -4, 5, 6, -4]], [[-1]], [[0, 0, 0, 0, 0, 0, 0, 0, 0]], [[1, 2, 3, 4, -5, -6, -10, 7]], [[11, 12, 13, 14, -2, -3, -4, -8]], [[100, -200, 300, -400, -1, 2, -3, 4]], [[25, -20, 8, 7, -5, 33, -6, 14, 9]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, -11, -12]], [[100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15, -11]], [[-401, 100, -200, 300, -400, -1, 2, -3, 4]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7, -10]], [[1, 2, 3, 4, 5, 6, 7, -15, 8, 9, 10, -11, -12, -13, -14, -15]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 7, 7, 14]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 10, -11, -12, -13, -14, -15, 7]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 10, -11, -12, -13, -14, -15, 7, 2]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -3, 1000, -50, 75]], [[1, 2, 3, 4, -5, -6, 7]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, -12]], [[1, 3, 4, -11, 5, 6, 7, -15, 14, 9, 10, -11, -12, -13, -14, -15, 7, 2, 14]], [[25, 8, 7, -5, 33, -6, 14, 9, 14, 7]], [[1, 2, 3, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15]], [[1, 3, 4, 12, -11, 5, 6, 7, -15, 14, 9, 10, -11, -12, -13, -14, -15, 7, 2, 14]], [[25, -20, 8, 7, -5, 33, -6, 14, -4, 9, 14, 7]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75]], [[25, 8, -5, 33, -6, 14, 9, 14, 7, -5]], [[25, -20, 8, 7, 33, -6, 14, 9, 7, 7]], [[-401, 100, -200, 300, -400, 11, -199, -3, 4]], [[1, 2, 3, -800, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[-20, 8, 7, 33, -6, 14, 9, 7, 7]], [[25, 8, 7, -5, 33, -6, 14, 9, 14, 7, 14]], [[25, -14, -5, 33, -6, 14, 14, 7, -5]], [[-5, 8, 7, -5, 33, -6, 14, 9, 14, -90, 14]], [[1, 2, 3, 4, -5, -6, -15, -10, 7]], [[1, 2, 8, 3, 4, 5, 6, 8, 9, 10, -12, -13, -14, -15]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 8]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 8, 14]], [[1, 2, 3, 4, 5, 6, 7, 8, -12, 10, -12, -11, -12, -13, -14, -15, 7]], [[1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[25, 33, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 8]], [[-20, 8, 7, 33, -7, -6, 14, 9, 7, 7]], [[-20, 8, -20, 7, 33, -6, 14, 8, 7, 7]], [[1, 1, 3, 4, 5, 6, 7, 8, 9, 11, -11, -12, -13, -14, -15]], [[7, 25, -5, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7, -10]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -70, -800, -900, -3, 1000, -50, 75, 700]], [[1, 2, -3, -8, -4, 5, 6, -7, -8, 9, -12, -8]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 7, 33]], [[1, 2, -3, 5, 6, -7, -8, 9, 10, -11, -12]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -70, -800, -900, -3, 1000, -50, 75, 700, -60]], [[1, 2, -3, 5, 6, -8, 9, 10, -11, -12]], [[25, -20, 8, 7, -5, 33, -6, 14, -4, 9, 14, 7, 25, 7]], [[-20, 8, -21, 7, 33, -6, 14, 14, 7, 7]], [[10, 20, 30, -40, -50, -60, -20, -70, -80, 100, 200, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75]], [[1, 2, 3, 4, -5, -6, 3, -15, -10, 7]], [[1, 2, 3, 4, -5, -6, 3, -15, 7]], [[-401, 100, -200, 300, -400, 11, -199, -3, 3]], [[25, -20, 7, -5, 33, 33, -6, 14, 9, 14, 7, 8]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 7, 9]], [[2, -3, -4, 5, 6, -7, -8, 9, 10, -12]], [[1, 2, 8, 3, 4, 5, -2, 6, 8, 9, 10, -12, -13, -14, -15]], [[12, 13, 14, -2, -3, -4, -8]], [[-600, -20, 8, -20, 7, 33, -6, 14, 9, 7, 7]], [[2, -3, -4, 5, 6, -7, -8, 9, 10, -12, 5]], [[25, 32, -20, 7, -5, 33, 33, -6, 14, 9, 14, 7, 8]], [[2, -2, -4, 5, 6, -7, -8, -6, 9, 10, -12, -3]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, -12, -13, -14, -15, 3]], [[25, 33, 7, -5, 33, -6, 14, 9, 14, 7, 8, -6]], [[10, 20, 30, 32, -40, -50, -60, -20, -70, -80, 100, 200, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75]], [[11, 6, 12, 13, 14, -2, -3, -4, 0, -8]], [[25, 8, 8, -5, 33, -6, 14, 9, 7, -5]], [[2, 3, 4, -5, -6, -15, -10, 7, -5]], [[1, 2, -3, 5, -50, 6, -8, 9, 10, -11, -12]], [[-20, 8, -20, -200, 33, -6, 14, 8, 7, 7, -20]], [[25, 33, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 33, 8]], [[25, -20, 8, 8, 7, -5, 33, -6, 14, -4, 9, 14, 7]], [[11, 12, 13, 14, -3, -9, -4, -8, -4]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 10, 3, -11, -12, -13, -14, -15, 7, 2]], [[10, 20, 30, -40, -50, -60, -70, -80, -91, 100, 200, 1000, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75]], [[0, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, 5]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 200, 20]], [[10, 20, 30, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75]], [[1, 2, -3, -4, 5, -7, -8, 9, 10, -11, -12, 2]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 700]], [[1, 2, 3, 3, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15]], [[25, -20, 8, 8, 7, -5, 33, -4, 9, 14, 7]], [[-21, -20, 8, 7, 33, -7, -6, 13, 9, 7, 7, 9]], [[10, 20, 30, -40, 75, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -800, 1000]], [[1, 2, 3, 4, 5, 6, 7, 8, -12, 10, -12, -4, -11, -12, -13, -14, -15, 7]], [[25, 8, 8, -5, 33, -6, 14, 7, -5]], [[1, 2, -3, -4, 5, -7, -8, 9, 10, -11, -12]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, 7, -12, 2]], [[25, 8, -5, 5, 14, 9, 7, -5]], [[-20, 8, -20, 7, 33, -6, 14, 8, 200, 7]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -600, 700, -800, -900, 1000, -50, 75, -70]], [[1, 2, -3, -4, 5, -8, -8, 9, 10, -11, -12, 2, -8]], [[1, 2, -3, -4, 5, 6, 1000, -8, 9, 10, 7, -12, 2]], [[1, 2, -3, -4, 5, 6, -8, 9, 10, -11, -11, 6]], [[1, -3, -4, 5, 6, 1000, -8, 9, 10, 7, -12, 2, 10, 6]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 8, 9, 10, -11, -12, -91, -14, -15, 7]], [[100, -200, 300, -400, -1, 2, -3, 4, 4]], [[100, -200, 300, -400, -1, 2, -3, 4, -200]], [[-600, -21, 8, -20, 7, 33, -6, 14, 9, 7, 7]], [[-401, -5, 100, -200, -400, -1, 2, -3, 4]], [[12, -11, 13, 14, -2, -3, -4, -8]], [[1, 2, 3, 4, -5, -6, -60, 3, -15, 7, 3]], [[25, -20, 7, -5, 33, 33, -6, 14, 9, 14, 6, 8]], [[1, 2, 8, 10, 3, 4, 5, 6, 9, 10, -12, -13, -14, -15]], [[1, 2, 3, 1, 4, 5, 6, 7, 8, -12, 10, -12, -11, -12, -13, -14, -15, 7]], [[25, -20, 8, 8, 33, -6, 14, 9, 7, 26, 7]], [[-20, 8, -20, -200, 33, -6, 4, 14, 8, 7, 7, -20]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 999, 100, 200, 300, -400, -500, -600, 700, -70, -800, -900, -3, 1000, -50, 75, 700]], [[10, 20, 30, -40, -50, -60, -70, -80, -91, 100, 200, 1000, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 30, -91]], [[25, -20, 8, -5, 33, -6, 14, 9, 7, 7, 14]], [[25, -20, 8, 7, 33, -6, 14, -7, 7, 7]], [[1, 2, 3, 4, -5, -6, 7, -5]], [[25, 8, 7, -5, 33, -6, 14, 9, 14, 3]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -500, -600, 700, -800, -900, -7, 0, -50, 75, 200, 20]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, 10, -12, -3, 6]], [[12, 13, 14, -2, -3, -4, -8, 12]], [[25, -20, 8, 8, 33, -6, 14, 10, 7, 26, 7]], [[1, 2, -3, -4, 5, -7, -8, 9, 10, -11, -12, -12]], [[0, 0, 100, 0, 0, 12, 0, 0, 0, 0, 0, 100]], [[25, 8, 700, -5, 33, -6, 14, 10, 14, 7]], [[25, 32, 7, -5, 33, 33, -6, 14, 9, 14, 7, 8]], [[-401, 100, -199, 300, -400, -1, 2, -3, 4]], [[-5, 8, 7, -5, 33, -7, 14, 9, 14, -90, 14]], [[1, 2, 3, 4, -5, -6, 3, -15, 7, -5]], [[25, -20, 8, 6, -5, 33, -6, 14, 9, 14, 7]], [[1, 2, 3, -15, 4, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[-20, 8, -20, -200, 33, -6, 4, 14, 8, 7, 7, -20, 33]], [[1, 2, 3, 4, -5, -5, -6, 7]], [[0, 2, 3, 4, -800, -20, -30, 10, 20, 30, 5]], [[25, -20, 7, -5, 11, 33, -6, 32, 14, 7, 8, 11, 14, 32]], [[1, 2, 3, 4, -5, -6, -60, 3, -15, 7, 3, -60]], [[10, 20, 30, -40, 75, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -8, 1000]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7, -10, -10]], [[25, -20, 8, 7, -5, 33, -6, 8, 14, 9, 14, 7, -10]], [[1, 2, 3, 4, -5, -6, -15, 7]], [[1, 2, 3, 4, -11, 6, 7, -15, 2, 14, 8, 9, 10, -11, -12, -14, -15, 7]], [[1, 1, 3, 4, 5, 6, 7, 8, 30, 11, -11, -12, -13, -14, -15]], [[25, -20, 8, 8, 7, -5, 33, -4, 9, 14, 7, 14]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 7, 9, 9]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, -900]], [[25, 8, 8, -5, 33, -6, 14, 25, 9, 7, -5]], [[1, 2, -13, 3, -800, -15, 4, 5, 6, 7, -15, -14, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[11, 12, 13, 14, -3, -9, -4, -8]], [[1, 2, 3, 4, -6, -14, 7]], [[11, 6, 12, 13, 14, -2, -3, -4, 0, -8, 6]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, 6, -11]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 8, 8]], [[1, 3, -3, -4, 5, 6, -8, -15, 9, 10, -11, -11, 6]], [[1, 2, 3, 4, -5, -16, -6, -60, 3, -15, 7, 3, -60]], [[1, 3, 4, 12, -11, 5, 6, 7, -15, 14, 9, 10, -11, -12, -13, -15, 7, 2, 14]], [[25, -20, 7, -5, 33, 33, -6, 14, 9, 14, 7, 8, 14]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 9]], [[11, 12, 13, -30, -3, -9, -4]], [[25, 8, 8, -5, 33, -6, 14, 9, 7, -5, -5]], [[1, -3, 4, 5, 6, 9, 10, -11, -11, 3, 6]], [[1, 2, 8, 3, 4, 5, -2, 6, 8, 9, 10, -12, -13, -14, 5, -15, 8]], [[0, 1, 2, 3, 4, 5, -10, -6, -20, -30, 10, 20, 30]], [[1, 2, -3, -4, 5, -6, 75, -7, -8, 9, 10, -13, -11, -12, 2]], [[1, 2, 3, 4, 5, 6, 8, 10, -12, -13, -14, -15, 3]], [[1, 2, -3, 5, -50, 6, -8, 9, 10, -11]], [[-20, 8, -20, 7, 33, -6, 14, 8, 1000, 7]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, 10, -12, 6]], [[1, 2, 3, 3, 5, 6, -15, 9, 11, -11, -12, -13, -14, -15]], [[25, -20, 8, 7, -5, 33, -6, 32, 14, 9, 14]], [[0, 12, 1, 2, 3, 4, 5, -5, -10, -6, -20, -30, 10, 20, 30]], [[25, -40, 8, 7, -5, 33, -6, 32, 14, 14, -20]], [[2, -2, -4, 5, 6, -199, -7, -8, -6, 9, 10, -12, -3]], [[-20, 8, -20, 7, 33, -6, 14, 8, 200, 0, 7]], [[-20, 8, -20, 7, 33, -6, 14, -9, 200, 7]], [[1, 2, 3, -800, 4, 5, 6, 7, -15, 9, 9, 11, -11, -12, -13, -14, -15, -11]], [[1, 2, -3, 5, 6, -8, 9, 10, -11, -12, 1]], [[8, -20, 7, 33, -6, 14, -9, 200, 7]], [[1, 2, 3, 3, 5, 6, -15, 9, 11, -11, -12, -13, -14]], [[1, 2, 3, 4, -200, -600, -5, -6, 3, -15, 7]], [[10, 20, 30, -40, -50, -60, -70, -80, -91, 200, 1000, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 30, -91]], [[1, 2, -3, -8, 5, 6, -7, -8, 9, -12, -8]], [[-5, 8, 7, -5, 33, -7, 14, 9, 14, -90, 14, 14]], [[2, -2, -4, 5, 6, -7, -8, -6, 9, 10, -12, -3, 6]], [[-21, -20, 7, 33, -7, -6, 13, 9, 7, 7, -3]], [[25, 8, -5, 33, -6, 14, 7, -5, 25]], [[1, 2, -7, -3, -8, -4, 5, -7, -8, 9, -12, -8]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 8, 11]], [[25, 8, -5, 14, 9, 7, -5]], [[25, -20, -19, 8, 7, -5, 33, -6, 32, 14, 9, 14]], [[25, -20, 12, 8, 8, 33, -6, 14, 10, 7, 26, 7]], [[25, 8, -5, 5, 14, 9, 7, -5, -5]], [[-60, 0, 12, 1, 2, 3, 4, 5, -5, -10, -6, -20, -30, 10, 20, 30]], [[20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, -900]], [[-5, 8, 7, -5, -8, 33, -7, 14, 9, 14, -19, 14, -7]], [[10, 20, -40, -50, -60, -20, -70, -80, 100, 200, 2, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75, 10]], [[11, 12, 13, -30, 12, -9, 10, -4, -3]], [[10, 20, -40, -50, -60, -20, -70, -80, 100, 200, 2, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75, -7, 75]], [[10, 20, 30, -50, -60, -70, -80, -90, 100, 200, 300, 5, -500, 2, -600, 700, -800, -900, -7, 0, -50, 75]], [[2, -2, -4, -400, 6, -7, -8, -6, 9, 10, -12, -3]], [[1, 2, -3, 5, 6, -8, 9, 10, -11, -12, -3, 2, -8]], [[-8, 1, 2, 3, 4, 5, -10, -6, -20, -30, 10, 20, 30]], [[10, 20, 30, -40, -50, -60, -70, -80, 100, 200, 300, -500, -600, 700, -800, -900, -7, 0, -50, 75, 200, 20]], [[1, 2, -3, -4, 5, -7, -8, 9, -6, 10, -11, -12, -12]], [[25, -20, 13, 8, 8, 33, -6, 14, 10, 7, 26, 7]], [[25, 8, -4, 33, -6, 14, 7, -5, 33]], [[1, 2, 3, -5, -6, -15, -10, 7]], [[1, 2, 3, -800, 4, 5, 6, 7, -15, 9, 9, 11, -11, -12, -13, -40, -14, -15, -11]], [[1, 2, 3, 4, -5, -6, 3, -15, 3, 7, -5]], [[-21, -20, 7, 33, 7, -6, 13, 9, 7, 7, -3]], [[1, 2, -8, 5, 6, -8, 9, 26, 10, -11, -12, -3, 2, -8]], [[2, -2, -4, 6, -7, -8, 9, 10, -12, -3]], [[10, 20, 30, -40, 75, -50, -60, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75, -8, 1000]], [[10, 20, 30, -60, -70, -80, -90, 100, 200, 300, 5, -500, 2, -600, 700, -800, -900, -7, 0, -50, 75]], [[-21, -20, 7, 33, 7, 8, -6, 13, 9, 7, 7, -3, -6]], [[-20, 8, -20, 7, 33, -6, 14, 8, 7, 7, 8]], [[-2, -4, 6, -7, -8, 9, 10, -12, -3]], [[-20, 8, -20, 7, 33, -6, 14, -9, 7]], [[1, 2, 3, 3, 5, 6, -15, 9, 11, -11, -12, -13, -14, -15, -12]], [[11, 12, 13, -30, -9, 10, -4, -3]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 7]], [[10, 20, 30, -60, -70, -80, -90, 100, 200, 300, 5, -500, 2, -600, 700, -800, -900, -7, 0, -50, 75, -900]], [[25, 8, 7, -5, 33, -6, 14, 9, 14, 7, -6]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, 10, -12, -3, 6, 6]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, -12, 9, -3]], [[25, 33, 7, -5, 33, -6, 14, 14, 7, 8, 25]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 9, 13]], [[1, 2, 3, -15, 4, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 9]], [[6, 7, 25, -5, -20, 8, 7, -5, 33, -6, 14, -4, 9, 14, 7, -10]], [[2, -3, 5, -50, 6, -8, 9, 10, -11, -12, 9]], [[-600, -20, 8, -20, 7, 33, -6, 14, 7, 8]], [[1, 1, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 1]], [[2, -3, 5, -50, 6, -8, 9, 10, -11, -6, 9]], [[1, 2, 3, -800, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -13, -15, -11]], [[10, 20, 30, -40, -50, -60, -70, -80, -91, 9, 200, 1000, 300, -400, -500, 700, -800, -900, -7, 0, -50, 75, 30, -91]], [[25, 8, 33, -6, 14, 7, -5]], [[1, 700, 2, -3, -4, 5, -8, -8, 9, 10, -11, -12, 2, -8]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 700, 300]], [[-21, -20, 7, 33, 1000, -7, -6, 13, 9, 7, 7, -3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -11]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 10, -11, -12, -13, -14, -15, 7, 7]], [[-30, 10, 20, 30, -40, -50, -61, -70, -80, -90, 100, 100, 300, -500, -600, -14, -800, -900, -7, 0, -50, 75, 200, 20]], [[25, 8, 8, -5, 33, -6, 14, 9, 7, -5, 8]], [[2, -2, -4, 5, 6, -8, -12, -6, 9, 10, -12, -3]], [[1, 2, 3, 4, 6, 7, 3, 2, 14, 8, 9, 10, -11, -12, -14, -15, 7]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 8, 9, -11, -12, -91, -14, -15, 7]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, -11, 7, -12, 2]], [[32, 25, 8, 7, -5, -6, 5, 9, 14, 3]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 11, 11, -5]], [[1, 1, -3, 5, -50, 6, -8, 9, 1000, -11, -12]], [[0, 0, 100, 0, 0, 12, 0, 0, 0, 0, -1, 0, 100]], [[25, -20, 8, 7, 33, -6, 14, 9, -21, 14, 7, -10, -10]], [[1, 5, 2, 3, 4, 5, 6, 7, 9, 9, 10, -11, -12, -13, -14, -11]], [[24, -20, 8, 8, 7, -5, 33, -4, 9, 14, 7]], [[2, -3, -3, 5, 6, -7, -8, 9, 10, -12]], [[32, 25, 8, 7, -5, -6, 5, 9, 14, 3, 32]], [[-20, 8, -20, 7, 33, 14, -6, 14, 8, 7, 7, -20]], [[12, 13, 14, -2, -10, -4, 8]], [[12, 13, 14, -2, -3, -4, 12]], [[2, 2, 3, -15, 4, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 7]], [[2, -2, -4, 6, -7, -8, 9, 10, -3, 6]], [[25, -20, 7, -5, 11, 33, -6, 32, 14, 7, 8, 11, 14, 32, 11]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, 700, -14, -800, -900, -7, 0, -50, 75, 700, 300, -50]], [[1, 2, -8, 5, 6, -8, 9, 26, 10, -11, -12, 2, -8]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, -12, -3, 6]], [[24, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7, -10, -10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -13, -14, -11, -13]], [[-600, -20, 8, -20, 7, 33, -6, 14, 9, 7, 7, 9]], [[2, -2, -4, 5, 6, -199, -7, -8, -6, 9, 10, -12, -3, -8]], [[25, -20, 8, 7, -5, 33, -6, 14, -4, 9, 14, -800, 25]], [[0, 0, 100, 0, 0, 12, 12, 0, 0, 0, 0, -1, 0, 100]], [[-500, 2, -2, -4, 6, -7, -8, 9, 10, -3, 6]], [[1, 2, 3, -800, 4, 5, 6, 7, 9, 9, 11, -11, -12, -13, -40, -14, -15, -11]], [[1, 2, 8, 3, 4, 5, -2, 6, 8, 9, 10, -12, -13, -14, -15, -2]], [[1, 2, -3, 5, 6, -8, 9, 10, -61, -12]], [[-20, 8, 7, 33, -7, 13, 9, 7, 9]], [[-21, -20, 7, 33, -7, -6, 999, 13, 9, 7, 7, -3, 7]], [[1, 5, 2, 3, 4, 5, 6, 7, 9, 9, 10, -11, -12, -13, -11]], [[20, 25, -20, 8, -5, 33, -6, 14, 9, 7, 7, 14]], [[-2, -4, 6, -7, -8, 9, 6, -12, -3]], [[2, -2, -4, -400, -7, -8, 9, 10, -3, 6, 6]], [[1, 2, 3, 5, 6, 7, 8, -12, -12, -6, -12, -13, -14, -15, 7]], [[11, 6, 13, 9, 14, -3, -4, 0, -8]], [[1, 2, -3, 5, 6, -8, 9, -12, -11, -12]], [[32, 25, 8, 7, -5, -6, 5, 9, 14, 3, 3]], [[-60, 0, 12, 1, 2, 3, 5, -10, -6, -20, -30, 10, 20, 30]], [[1, 2, -3, -4, 5, 6, -8, 9, 10, -11, -12]], [[1, 2, -3, 5, 6, -8, 9, 10, -11, -12, -8]], [[1, 2, -8, 5, 6, -8, 26, 10, -11, -12, 2, -8]], [[1, 2, 3, 4, 5, 6, 7, 8, -12, 10, -12, -4, -11, -12, -13, -14, -15, 7, -12]], [[1, 2, 8, 3, 4, 4, -2, 6, 8, 9, 10, -12, -13, -14, -15, -14]], [[1, 2, 3, 4, 7, 3, 14, 8, 9, 10, 2, -12, -14, -15, 7, -12]], [[10, 20, 30, -40, -50, -60, -20, -70, -80, 100, 200, 300, -400, -500, -600, 3, -800, -900, -501, 1000, -50, 75]], [[25, 33, 7, 33, -7, 14, 9, 14, 7, 8, -6]], [[25, -20, 14, 8, 8, 33, -6, 14, 10, 7, 26, 7]], [[1, 2, 3, 1, 4, 5, 6, 7, 8, 10, -12, -11, -12, -13, -14, -15, 7, -13]], [[1, 2, -4, 3, 4, -5, -6, -15, 7]], [[10, 20, 30, -50, -60, -70, -61, -90, 100, 200, 300, -400, -500, 700, -800, -900, -7, 0, -50, 75, 700]], [[1, 2, 3, 4, 5, 6, 7, 8, -12, 10, -500, -12, -4, -11, -12, -13, -14, -15, 7]], [[25, -20, 8, 7, -5, 33, -6, 32, 14, 9, 14, 25, 33]], [[1, 25, -3, -4, 5, 6, 1000, -91, -8, 9, 10, 7, -12, 2]], [[25, 9, 8, 7, -5, 33, -6, 14, 9, 14, 7]], [[1, 2, -3, 5, -50, 6, -8, 9, 10, -12]], [[-401, -5, 100, -200, -400, -1, 2, -3, 4, 100]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75]], [[25, -20, 8, 7, 33, -6, 14, 7, 7]], [[2, -7, -3, -8, -4, 5, -8, 9, -12, -8]], [[-401, 100, -400, -200, 300, -400, 11, -199, 4]], [[25, 7, -14, -5, 33, 8, 14, 14, 7, -5]], [[25, -20, 8, -5, 33, -6, 15, 9, 7, 7, 14]], [[6, 7, 25, -5, -20, 8, -5, 33, -6, 14, -4, 9, 14, 7, -10]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 200, 20, 700]], [[2, -2, -4, 5, -7, -8, -6, 9, 10, -12, -3]], [[-401, -5, 100, -200, -1, 2, -3, 4, -401]], [[1, 2, 3, -800, 4, 5, 6, 7, -15, 9, 9, 11, -11, -12, -13, -40, -41, -14, -15, -11]], [[25, -20, 8, 8, 33, -6, 14, 9, 7, 26, 7, 26]], [[-800, 1, 2, 3, -800, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -11, -11]], [[25, 33, -20, 7, -10, -5, 11, 33, -6, 14, 9, 14, 7, 33, 8]], [[-800, 1, 2, 3, 1, 4, 5, 6, 7, 8, -12, 10, -13, -11, -12, -13, -14, -15, 7]], [[2, -2, -80, 6, -7, -8, -6, 9, -12, -3, 6]], [[1, 2, -3, 5, 4, 6, -8, 9, 10, -61, -12]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, -400, -500, -600, 700, -800, -900, -7, 0, -15, 75]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 1]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -900, -7, 0, -50, 75, 700]], [[25, -20, 8, 7, -5, 33, -6, 14, -4, -7, 9, 14, 7, 25, 7, -4]], [[25, -20, -401, 7, -5, 11, 33, 300, -6, 14, 9, 14, 7, 8]], [[1, 2, 3, -5, -6, -15, 7]], [[1, 33, 3, 4, -5, -6, -10, 7]], [[1, 2, -13, -11, -800, -70, -15, 4, 5, 6, 7, -15, -14, 8, 9, 11, -11, -12, -13, -14, -15, -11]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 1, -11]], [[2, -2, -4, 5, 6, -7, -8, -6, 9, 10, -12, -600, -3]], [[26, 32, 7, -5, 33, 33, 13, -6, 14, 9, 14, 7, 8]], [[-20, -20, -200, 33, 4, -20, 14, 8, 7, 7, -20, 33]], [[10, 20, 30, -40, -50, -8, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 200, 20, 700, -90]], [[20, 25, -20, -14, 8, -5, 33, -6, 14, 9, 7, 7, 14, 7]], [[1, 3, -5, -6, -15, -10, 7]], [[25, 8, 8, -5, -50, 33, -6, 14, 9, 200, 7, -5, 7]], [[1, 2, 3, -6, -6, -15, -10, 7, -15]], [[2, 8, 10, 3, 4, 5, 6, 9, 10, -12, -13, -14, -15, 8]], [[1, 2, 3, -6, -6, -15, -7, -10, 7, -15]], [[-20, 8, -20, -200, 33, 33, -6, 14, 8, 7, 7, -20]], [[25, -20, 7, -5, 33, 33, -6, 14, 9, 14, 8, 7, 8, 14, 9]], [[2, 3, 4, -5, -6, -60, 3, -15, 7, 3]], [[25, -14, -5, 33, -6, 14, 14, -41, 7, -5]], [[1, 34, 3, 4, -5, -6, -10, -21, 7]], [[1, 2, 5, 6, -8, 9, -12, -11, -12]], [[1, 2, -3, -4, 5, 6, -20, -8, 9, 10, -12]], [[25, -20, 8, 7, -5, 33, -6, 32, 14, 9, 14, 25, 33, 25, 7]], [[1, 2, 3, 4, 5, 6, 7, -15, -80, 9, 11, -11, -12, -13, -14, -15, -11]], [[10, 20, 30, -40, -50, -60, -70, -80, -91, 200, 1000, 300, -400, -500, -600, 700, -800, -7, 0, -50, 75, 30, -91, -7]], [[-20, 8, 7, 33, -7, -6, 13, 7, 9]], [[8, -5, 5, 14, 9, 7, -5, -5]], [[25, -20, 8, -5, 8, -6, 8, 14, 14, 7, -10]], [[1, 2, -13, -11, -800, -70, -15, 4, 5, 6, 7, -15, -14, 8, 9, 11, -11, -12, -13, -14, -15, -11, 4, -15]], [[2, -3, -51, 5, -50, 6, -8, 9, 32, 10, -12]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 10, -11, -12, -13, -14, -15, 7, 9]], [[2, -2, -4, 5, 6, -7, -8, 9, 10, -12, -3, 6]], [[10, 20, 30, 32, -40, -50, -60, -20, -70, 100, 200, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75]], [[2, 8, 10, 3, 4, 5, 6, 9, 10, -12, -13, -14, -15, 8, 8]], [[2, -3, 5, -50, 6, -8, 9, 10, -11, -6, 9, 9]], [[1, 3, 4, -6, -14, 7, 2, 2]], [[2, -4, 6, -7, -8, 9, 10, -12, -3, -8]], [[10, 20, 30, -40, -50, -60, -70, -80, 100, 200, 1000, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, 30, -91]], [[1, 2, 8, 3, 4, 5, -2, 6, 8, 9, 10, -12, -13, -14, -15, -2, 4]], [[0, 0, 0, 0, 0, 0, 0, -9, 0, 0]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, 10, -12, -600, -3, 6]], [[10, 20, 30, 32, 75, -40, -50, -60, -20, -70, -80, 100, 200, 300, -400, -500, -600, 3, -800, -900, 1000, -50, 75]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 1, 2]], [[2, -2, -4, 5, -7, -8, 9, 10, -12, -3, 6]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, -7, 0, -50, 75, -900, -70]], [[1, 2, -3, 5, 6, -8, 9, 10, -11]], [[7, 25, -5, -20, 8, 7, -5, 33, -6, 14, 9, 14, 7, -20]], [[-60, 0, 12, 1, 2, 3, 5, -10, 10, -6, -20, -30, 10, 20, 30]], [[10, 30, -40, -50, -60, -70, -80, -90, 999, 100, 200, 300, -400, -500, -600, 700, -70, -800, -900, -3, 1000, -50, 75, 700]], [[2, -4, 6, -7, -8, 9, 10, -12, -500, -8]], [[1, -3, -4, 5, -7, -8, 9, 10, -12, -12]], [[-199, 2, 3, 1, 4, 5, 6, 7, 8, 10, -12, -11, -12, -13, -14, -15, 8, 7, -13, 7]], [[-5, 8, 7, -5, 33, 33, -7, 14, 9, 14, -90, 15]], [[-20, 8, 7, 33, -7, -6, 13, 7, 7, 33]], [[11, 6, 12, 13, 14, -2, -3, -4, 0, -8, 14]], [[4, 0, 2, 3, 4, -800, -20, -30, 20, 30, 5]], [[25, 32, -20, 7, -5, 33, 33, -6, 14, 9, 14, 7, 8, 33]], [[11, 6, 12, 13, 14, -3, -4, 0, -8, -8]], [[2, -3, -8, -4, 5, -8, 9, 3, -12, -8]], [[100, -200, 300, -400, -1, 2, -3, 4, 5, 100, -200]], [[25, -20, 7, -5, 11, 33, -6, 14, 9, 14, 7, 11, 11, -5, 11]], [[10, 20, 30, -40, 75, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1001, -50, 75, -8, 1000]], [[-199, 2, 3, 1, 4, 5, 6, 7, 8, 10, -14, -11, -12, -13, -14, -15, 8, 7, -13, 7]], [[2, -2, -4, -80, 6, -7, -8, -401, 9, 10, -12, -3, 6, 6]], [[1, 2, -3, -4, 4, 6, -8, 9, 10, -11, -12]], [[-20, 8, -20, 7, 33, 14, 15, -6, 14, 8, 7, 7, -21, -20, -20]], [[25, 8, -5, 5, 14, 7, -5]], [[1, 2, -3, -4, 5, -7, -8, 9, -6, 10, -11, -12, -6]], [[8, -20, 7, 33, -6, 14, -9, 7, -6]], [[1, 2, -3, -4, 5, -6, 75, -7, -8, 9, 9, -13, -11, -12, 2]], [[1, 5, 2, 3, 4, 5, 6, -2, 9, 9, 10, -11, -12, -13, -14, -11]], [[-20, 8, -20, -200, 33, -6, 4, 14, 8, 7, 32, 7, -20, 33, -6]], [[2, -2, -4, 6, -7, -8, 9, 10, -12, -3, -8]], [[25, -40, 8, 7, -5, 33, -6, 32, 14, 14, -20, 8]], [[-21, -20, 7, 33, 7, 8, -6, 13, 9, 7, 7, -3, -6, 33]], [[1, 2, 3, -2, -5, -6, -15, 7, -15]], [[-20, 8, -20, 7, 33, -6, 14, -9, 7, 33]], [[2, 8, 10, 3, 4, 5, 6, -70, 9, 10, -13, -14, -15, 8]], [[1, 2, 3, 4, 5, 6, 7, -15, -80, 9, 11, -11, -12, -13, -15, -11]], [[25, -20, -5, 11, 33, -6, 14, 9, 14, 7, 8, 11]], [[2, -2, -80, 6, -7, -8, 9, 10, -12, -3, 6, -12]], [[100, -400, -1, 2, -400, 4, -9, 100, -200]], [[25, -20, 7, -61, 11, 33, -6, 14, 9, 14, 7, 8, 11]], [[-20, 8, 7, 33, -7, -6, 13, 9, 7, 7, 33, 7, -6]], [[0, 0, 100, 10, 0, 12, 0, 0, 0, 0, 0, 100]], [[1, 2, 3, -5, -6, -15, -10, 7, 7]], [[12, 13, 14, -2, -3, -4, -8, 12, 12]], [[2, -3, -4, 5, -13, -7, -8, 9, 10, -12]], [[1, 3, 4, 5, 6, 7, -15, 14, 9, 10, -11, -12, -13, 14, -15, 7, 2, 14, 1]], [[1, 1, 3, -800, -15, 4, 5, 6, 7, -15, 9, 11, -11, -12, -13, -14, -15, -11, 9, 1]], [[25, 9, 8, 7, -5, 33, -6, 14, -21, 14, 7, 14]], [[2, -2, -4, 5, 6, -199, -7, -8, -6, 9, 10, -3, -6]], [[1, 2, -13, -200, 3, -800, -15, 4, 5, 6, 7, -15, -14, 8, 9, 11, -11, -12, -13, -14, -15, -11, -14]], [[-21, -20, 7, 33, -4, -6, 13, 9, 7, 7, -3]], [[1, 2, 9, 3, 3, 5, 6, -15, 9, 11, -11, -12, -13, -14, -15, -12]], [[-20, -20, -200, 33, 4, -20, 14, 32, 7, 7, -20, 33]], [[1, 2, -7, -3, -8, -4, -6, 5, -7, -8, 9, -12, -8]], [[1, -3, -4, 5, 9, -7, -8, 9, 10, -11, 7, -12, 2]], [[25, 8, -5, -10, -6, 14, 7, -5, 25]], [[12, 13, 14, 12, -2, -3, -4, -8]], [[25, 12, -20, 8, -5, 33, -6, 14, 9, 7, 7]], [[1, -90, 2, -3, 5, 6, -8, 9, 10, -11, -12]], [[25, 33, -6, 14, 7, -5]], [[25, -20, 7, -5, 11, 33, -7, 14, 9, 14, 7, 11, 11, -5, 11]], [[-20, 8, -20, 7, 33, -5, 14, -9, 7, 33]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -600, 700, -800, -51, -900, 1000, -50, 75, -70, -80]], [[25, -20, 8, -5, 33, -6, 9, 7, 7, 14]], [[2, -4, 6, -7, -8, 9, 10, -12, -3, -8, -8]], [[0, -1, 0, 100, 0, 0, 12, 0, 0, 0, 0, -1, 0, 100, 0]], [[13, 14, -2, -4, 12]], [[1, 2, 3, -800, 4, 5, 6, 7, 9, 9, 12, -11, -12, -13, -40, -14, -15, -11]], [[1, 2, -12, 3, 4, 5, 6, 7, 8, -12, 10, -12, -11, -12, -13, -14, -15, 7]], [[1, 2, 3, 4, -5, 4, -6, 3, -15, 3, 7, -5]], [[25, 7, -5, 11, 33, -6, 14, 9, 7, 11, 33, 11, -200, 11]], [[1, 2, 3, 4, -11, 5, 6, 7, -15, 14, 8, 9, 5, 10, 3, -11, -12, -13, -14, -15, -20, 2]], [[13, 7, 25, -5, 75, -20, 8, 7, -5, 33, -6, 14, -4, 9, 14, 7, -10]], [[-600, -20, 8, -20, 7, 33, -7, 14, 9, 7, 9, 9]], [[25, -20, 7, -5, 11, 33, -6, -21, 14, 9, 14, 7, 11, 11, -5, 11]], [[1, 2, -13, -200, 3, -800, -15, 4, 5, 6, 7, -15, -14, 8, 9, -11, -12, -13, -14, -15, -11, -14]], [[-21, -20, 7, 33, 7, -6, 13, 7, -3]], [[0, 12, 1, 2, 3, 3, 4, 5, -5, -10, -6, -20, -30, 10, 20, 30]], [[25, -20, 999, 8, 7, -5, 33, -6, 14, 9, 7, 7, 14]], [[10, 20, 30, 32, 75, -40, -50, -20, -70, 100, 200, 300, -400, -500, -600, -80, 3, -800, -900, 1000, -50, 75, -80]], [[25, -20, 8, 7, -5, 33, -6, 32, 14, 9, 14, 25, 33, 25, 7, 14]], [[1, 2, 3, 4, -5, 7]], [[1, 2, 3, 4, -11, 6, 7, -15, 2, 14, 8, 9, 10, -11, -12, -14, -15, 7, 3]], [[2, 8, 10, 3, 4, 5, 6, 9, 10, 9, -14, -12, -13, -14, -15, 8]], [[25, 9, 8, 7, -5, 33, -60, 14, -21, 14, 7, 14]], [[25, -14, -5, 33, -6, 14, 14, -41, 7, -5, 33]], [[1, 2, 3, -800, -15, 4, 5, -16, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -16, -11]], [[-20, 8, -20, -200, 33, 33, -6, 6, 14, 8, 7, 7, 10]], [[2, -2, -4, -80, 6, -7, -8, 9, 10, -12, -3, 6, 6]], [[1, 2, -3, 13, 6, -8, 9, -12, -11, -12]], [[11, 6, 13, 14, -2, -3, -4, 0, -8, 6]], [[8, 10, 3, 4, 5, 6, 9, 10, -12, -13, -14, -15, 8, 8]], [[1, -90, 2, -3, 5, -8, 9, 10, -11, -12, -8]], [[-20, 8, -20, 7, 33, -6, 14, 8, 7, 7, 8, -6]], [[10, 20, 30, -40, 75, -50, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -8, 1000]], [[-20, 8, -20, -21, 7, 33, -6, 14, 8, 7, 7]], [[99, 0, 0, 100, 0, 0, 12, 12, 0, 0, 0, -1, 0, 100]], [[1, 2, -3, -4, 5, 6, -20, -8, 9, -12]], [[1, 2, 2, -10, 5, 6, -8, 9, 10, -11, -12, 1]], [[10, 20, 30, -40, -50, -60, -70, -80, 100, 200, 1000, 300, -400, -500, -600, 700, -800, -501, -7, 0, -50, 75, 30, -91, 300]], [[1, 33, 3, 4, -5, -500, -10, 7]], [[1, 2, -3, -20, 5, 6, -8, 9, 10, -11, -12]], [[25, 8, -5, -10, -6, 14, 7, 25]], [[25, -20, 8, 7, -20, -5, 33, -6, 14, 9, 7, 7, 14]], [[-900, 1, 2, 3, 4, -11, 6, 7, -15, 2, 14, 8, 9, 10, -11, -12, -14, -15, 7]], [[11, 12, 13, -9, 10, -4, -3]], [[6, 7, 25, -5, -20, 8, -5, 33, -6, 14, -4, 9, 15, 7, -10]], [[2, -3, -3, 5, -11, 6, -7, -800, -8, 9, 10, -12]], [[-800, 1, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 9, 11, -11, -12, -13, -14, -15, -11, 9]], [[2, -2, -4, -80, 6, -7, -8, -6, 9, 10, -12, -600, -90, -3, 6]], [[1, 2, 8, 3, 4, 5, -2, 6, 8, 9, 10, -12, -14, -15, -2, 4]], [[1, 2, 3, 3, 5, 6, 7, -15, 8, 9, 11, -11, -12, -80, -14, -15]], [[1, -500, 2, -3, 5, 4, 6, -8, 9, 10, -61, -12]], [[25, 33, 7, 33, -7, 14, 9, 14, 7, 8, -6, -6, -5, -6, -6]], [[1, 2, 3, -800, 4, -9, 5, 6, 7, -15, 9, 9, 11, -11, -12, -13, -40, -41, -14, -15, -11, -11]], [[-600, 1, 2, 3, 4, 7, -5, -6, 7, -5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -11, -11, 9]], [[1, 700, 2, -3, -4, 5, -8, -8, 9, 10, -11, -2, 2, -8, -11]], [[1, 2, 3, 1, -2, -5, -15, 7, -15]], [[32, 7, 8, 7, -5, -6, -91, 5, 9, 14, 3]], [[-800, 1, -30, 2, 3, -800, -15, 4, 5, 6, 7, -15, 8, 24, 9, 11, -11, -12, -14, -15, -11, 1]], [[-401, -5, -199, 100, -200, -400, -1, 2, -3, -14, 100]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[25, -20, 7, -5, 11, 33, -7, 14, 9, 14, 7, 11, 11, -5, 11, -5]], [[25, 8, 7, -5, 33, -6, 14, 9, 14, 7, -6, -6]], [[24, -20, 8, 8, 7, -5, -91, 33, -4, 9, 14, 7, 7]], [[1, 2, 3, 5, 4, 7, 3, 14, 8, 9, 10, 2, -12, -14, -15, 7, -12]], [[-20, 8, 7, 33, -6, 14, 8, 7, 7, 8, -6]], [[1, 2, 1000, 4, 5, 6, 7, -15, -80, 9, 11, -11, -12, -13, -15, -11, 2]], [[10, 20, 30, -40, -50, -60, -20, -70, -80, 100, 20, 200, 300, -400, -500, -599, 3, -800, -900, -501, 1000, -50, 75]], [[-6, 25, 7, -5, 33, -6, 14, 7, 25]], [[]], [[1, -1]], [[2, 2, 2]], [[-1, 0, 1, 2, -2, -1]], [[1, 2]], [[1, 2, 3]], [[-1, 0, 1]], [[1, 2, 3, 4, 5]], [[-1, -2, -3, -4, -5]], [[0, 0, 0, -20, 0, 0, -7, 0, 0]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, -10]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 14]], [[25, -20, 8, -5, 33, -6, 14, 9, 14]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -15, 1]], [[25, -20, 8, 0, 7, -5, 33, -6, 14, 9, 14]], [[100, 200, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75]], [[0, 0, -20, 0, 0, -14, 0, 0]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, 2, -15, 1, -12, 2]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 100]], [[100, -200, 300, -400, -1, 2, 0, -3, 4, -1]], [[25, -20, 8, 0, 7, -5, 33, -6, 14, 9, 14, 14]], [[1, 2, -3, -4, 6, -7, -8, 9, 10, -11, -12]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20]], [[100, 300, -400, -1, 2, -3, 4]], [[11, 12, 13, 14, -2, -3, 14, -4, 11, 11]], [[25, -20, 8, 7, -5, 33, 14, 9]], [[25, 7, -5, 33, -6, 14, 9, 14]], [[100, 200, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 300]], [[7, -20, 8, 7, -5, 33, -6, 14, 9, 14]], [[100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75, 75]], [[-12, -200, 300, -400, -1, 2, 0, -3, 4, -1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -90, 1, -13, 2, -15, 1]], [[0, 0, 0, -20, 0, 0, -40, -7, 0, 0]], [[10, 12, 13, 14, -2, -3, -4, 11]], [[0, 0, -20, 0, 0, -14, 0, -11]], [[25, -20, 8, 0, 7, -5, 33, -6, 14, 9, 14, 14, 25]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 2]], [[10, 200, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 7, 100]], [[100, -200, 300, -1, 2, -3, 300, 4]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, 9]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 10, -11, -12, -8]], [[10, 200, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 100]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 2]], [[0, 0, 0, 0, 0, -12, 0, 0, 0, 0]], [[0, 0, 0, 0, 0, -7, 0, 0, 0]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, 2, -15, 1, -12, 2, -12]], [[0, 1, 25, 3, 4, 5, -10, -20, -30, 10, 20, 30]], [[1, 2, 2, -4, 6, -7, -8, 9, 10, -11, -12]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 2, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -10, -12, -13, -2, 2, -15, 1]], [[100, -200, 300, -1, 2, -3, 300, -10]], [[25, -20, 8, 7, -5, 33, -6, 14, 4, 9, 14]], [[100, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75, 1000]], [[25, -20, 8, 0, 7, -5, 33, -6, 14, 9, 14, 8]], [[10, 12, 13, 14, -2, -3, -4, 11, 75]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, 9, 9]], [[10, 100, 199, 300, -400, -500, 300, 14, 700, -800, 1000, 75]], [[25, -20, 8, 0, 1, 7, 33, -6, 14]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 100, -11, -12, -8]], [[25, -20, 8, 7, -5, 33, -6, 9, -5]], [[0, 0, 0, -20, 0, -40, -7, 0, 0, 0]], [[100, -200, 300, -1, -3, 300, -10]], [[100, -40, -400, -1, 2, -3, 4, 4]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20]], [[100, -40, -400, -1, 2, -3, -13, 4]], [[100, 200, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500]], [[0, 0, 0, 0, 0, -1, -12, 0, 0, 0, 0]], [[1, 2, 3, 4, 0, -5, -6, -10, 7]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2]], [[100, 300, -400, -1, 4]], [[-20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20]], [[10, 200, 20, 30, -40, -41, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 100]], [[200, 300, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -13, -12, -13, 2, -15, 1, -12, 2, 3]], [[0, -1, 0, -20, 0, 0, -14, 0, 0]], [[1, 2, 3, 4, 0, -5, -6, -10, -40, 7, 3]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20, -20]], [[-12, -200, 300, -400, -1, 2, 0, -3, 4, -1, 300]], [[25, -20, 8, 7, 33, -6, 9]], [[100, 200, 299, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 300]], [[0, 1, 2, 3, 4, 5, -41, -20, -30, 10, 20, 30]], [[0, -1, 0, 0, -20, 0, 0, -14, 0, 0]], [[25, -20, -12, 9, 7, -5, 33, -6, 9, -5, 2, 9]], [[100, 200, -400, -500, -600, 700, -800, -900, 1000, -50, 75]], [[100, 200, 300, -400, 74, -500, -600, 700, -800, 1000, -50, 75, 75]], [[25, -20, 8, 0, -12, 7, -5, 33, -6, 14, 9, 14, 14, 25]], [[0, 0, 0, 0, 0, -1, -12, 0, 0, 1, 0]], [[200, 300, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 1000]], [[10, 200, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -41, -500, -600, 700, -800, -900, 1000, -50, 7, 100]], [[100, 200, 300, -400, -500, 300, 10, 700, -800, -900, 1000, 75, -500, 300]], [[25, -20, 8, 7, 3, 33, -6, 9, -5]], [[-12, -200, 300, -400, -1, 0, -3, 4, -1, 300]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 700]], [[100, -199, 300, -199, -400, -1, 2, -3, 4]], [[10, 12, 13, 14, -2, -3, 12, -4, 11]], [[100, 200, 300, -400, -500, -601, 700, -800, 1000, -50, 75, 75]], [[25, -20, -12, 9, 7, -5, 33, -6, 9, -5, 2, 9, -20]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 6]], [[200, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500]], [[100, 200, 299, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 300, 700]], [[11, 13, 14, -2, -3, -4, -8]], [[25, -20, 8, -5, 33, -6, 14, 9, 34, 14, -50, -20, 9, -50]], [[0, 1, 2, 3, 4, 5, -41, -20, -30, 10, 20, 29]], [[-70, -200, 300, -400, -1, 2, 0, -3, 4, -1]], [[25, 8, -5, 33, -6, 14, 9, 14, -50, -20]], [[100, 200, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 300, -500]], [[0, 1, 1000, 25, 4, 5, 0, -20, -30, 20, 30, 0]], [[25, -20, 8, 0, -12, 7, -5, 33, -6, 9, 14, 14, 25]], [[25, 8, -5, 33, -6, 14, 9, 14, -50, -20, 8]], [[0, 1, 1000, 25, 4, 5, 0, -20, -30, 20, 30, -199, 0]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -51, -20, 9, 33, -20]], [[10, 20, 30, -40, -50, -60, -80, -90, 100, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 700]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15, 2]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 700, -900, -70]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -10, -12, -13, -2, 2, -15, 1, -10]], [[-20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15, 2, -11]], [[0, 0, 0, 0, -12, 0, 0, 0, 0]], [[1, 2, 3, 4, 5, 6, -13, 8, 9, 10, -11, -12, -13, 2, 1, 2, 4]], [[100, 300, -400, -1, -400, 4]], [[100, 300, -400, -400, 4, 100]], [[10, 20, 30, -40, -50, -60, -80, -90, 100, 200, 700, 300, -400, -500, -600, -800, -900, 1000, -50, 75, 700]], [[1, 2, -3, -4, 6, -7, -8, 9, 10, -11, -12, -7]], [[25, -20, 8, -5, 1, 33, -6, 14, 9, 14, -50, -20]], [[200, 300, -399, -500, 300, 14, 700, 299, -900, 1000, 75, -500, 1000]], [[100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75]], [[-12, -200, 300, -1, 0, -3, 4, -1, 300]], [[26, 32, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20]], [[25, -12, -200, 300, -400, -1, 2, 0, -3, 4, -1]], [[10, 12, 13, 14, -2, -3, 12, -4, 11, -2]], [[100, 300, -400, 2, -3, 4]], [[200, 300, -399, -500, 300, 14, 700, 301, -800, -900, 1000, 75, -500, 300]], [[100, 300, -400, -3, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -7, -14, -15, 2, -11]], [[25, -20, 8, 7, -5, 33, -6, 14, 9, 33]], [[100, 200, 300, 74, -500, -600, 700, -800, 1000, -50, 75, 75, -800]], [[-12, -200, 300, -400, -1, 0, -3, -1, 300]], [[0, 0, 0, -20, 0, -7, 0, 0]], [[100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75, 75, -800]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -10, -12, -13, -2, 2, -14, 1]], [[0, 0, -20, 0, -40, -7, 0, 0, 0]], [[201, 300, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 1000]], [[200, 300, -400, -500, 300, 14, 700, -800, -900, 1000, 75]], [[201, 300, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500, 1000, -500]], [[10, 12, 13, 14, -2, -3, -4, -2]], [[1, 2, 3, 4, 5, 7, 8, 9, 10, -11, -12, -13, -14, -15, 2]], [[0, 1, 1000, 25, 4, 5, 0, -20, -30, 20, 30, -12, -199, 0, 0]], [[0, 1, 2, 3, 4, 5, -41, -20, -2, -30, 10, 20, 29]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, 2, -15, 1, -12, -11, 2, -12]], [[-2, 11, 12, 13, 14, -2, -3, 14, -4, 11, 11]], [[25, -20, 8, 7, -5, 33, -6, 14, -60, 9]], [[100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, 2, -11, -12, -13, 2, -14, 1, 2]], [[200, 300, 74, -500, -600, 700, -800, 1000, -50, 75, 75, -800]], [[200, 300, -399, -500, 14, 700, 299, -900, 1000, 75, -500, 1000]], [[10, 200, 20, 30, -40, -50, -60, -70, -600, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 7, 100]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, -10, -30, 10, 4]], [[10, 12, 13, 14, -2, -3, 11, 12, -4, 11, -3]], [[0, 0, 0, 0, 0, -1, -12, 0, -1, 0, 0, 0]], [[10, 12, 13, 14, -2, -3, -4, 3, 11, 75]], [[10, -14, 12, 13, 14, -2, -3, 12, -4, 11, 13]], [[100, -200, 300, -1, -3, 300, -10, -1]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, -10, -30, 10, 4, 20]], [[100, 200, 300, -400, -600, -400, 700, -800, -900, 1000, -50, 75]], [[1, 2, 3, 199, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, -14, 2]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 20, 30, -10, -30, 10, 4]], [[25, -20, 8, -5, 33, -6, 14, 2, 34, 14, -50, -20, 9, -50]], [[0, 1, 2, 3, 4, 5, -41, -20, -2, -30, 10, 20, 29, 29]], [[-2, 11, 12, 13, 14, -2, -3, 14, -4, 11]], [[25, -20, 8, 8, -5, 33, -6, 14, 9, 14]], [[10, 12, 13, 14, -2, -4, 11, 75]], [[0, 1, 2, 2, 4, 5, -10, -20, -30, 10, 20, 30]], [[200, -399, -500, 300, -50, 700, -800, 199, -900, 1000, 75, -500]], [[25, -20, 0, -12, 7, -5, 33, -6, 9, 14, 14, 25, 25]], [[0, 0, 0, -20, 0, 0, -40, -7, 0, 0, 0, 0]], [[-12, -200, 301, -400, -1, 0, -3, 4, -1, 300]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -20, 9, 33, -20, 25]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 2, 10, 20, 30, -10, -30, 10, 4, 20]], [[100, -200, 300, -1, 2, -3, 300, 4, 100]], [[25, -20, 8, -6, 0, -4, 7, -5, 200, -6, 14, 9, 14]], [[10, 12, 13, 14, -2, -3, 12, -4, 11, -8, 13]], [[100, 300, -400, 14, -3, 4]], [[1, 2, 3, 4, 0, -5, -6, -10, -40, 8, 3, -40]], [[25, -20, 8, -5, 1, 33, 7, 14, 9, 14, -50, -20]], [[-12, -200, 300, -400, -1, 0, -200, -3, 4, -1, 300]], [[25, -20, 8, 13, -5, 33, -6, 14, 9, 14, -50, -20, 9]], [[100, 200, 74, -500, -600, 700, -800, 6, 1000, -50, 99, 75, 75, -800, 200]], [[0, -1, 0, -20, 0, 0, -15, 0, 0]], [[25, -20, 9, 74, -5, 33, -6, 14, 4, 9, 14]], [[25, 8, 0, -12, 7, -5, 33, -6, 14, 14, 25]], [[10, 100, 199, 20, -400, -500, 300, 14, 700, 9, -800, 1000, 75]], [[1, 2, 3, 4, -5, -6, 34, -10, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -39, -15, 1]], [[100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75, -800]], [[0, 0, 0, -20, 0, 0, -40, -7, 1, 0, 0]], [[10, 11, 13, 14, -2, -3, 12, -4, 11, -2, 12]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, 76, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 700, -40]], [[-600, -20, -30, 8, 7, 34, -6, 9, 8]], [[0, 13, 2, 3, 4, 5, -10, -20, -30, 20, 30, -10, -30, 10, 4]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, -500, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -500]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2, 6]], [[1, 2, 3, 4, -5, -6, 34, -10, 7, -6]], [[25, 8, 7, -5, 33, 14, 9]], [[100, 200, 300, 74, -500, -600, 700, -800, 1000, 75, 75, -800]], [[10, 20, 30, -40, -50, -60, -69, -80, -90, 100, 200, 700, 300, 76, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 700, -40]], [[0, 1, 2, 3, 4, -10, -20, -31, 9, 20, 2, 30]], [[0, -1, 0, 0, -20, 0, -14, 0, -14, 0, 0]], [[25, -20, 8, 8, -5, 33, -6, 14, 9, 14, -5]], [[100, 300, -400, -1, 2, -3, -400, 4]], [[100, 200, 300, -400, -500, -600, 700, -800, 1000, -50, 75, 75, -800, -50]], [[200, 300, -400, -500, 300, 14, -800, -900, 1000, 75]], [[-70, -200, 300, -400, -1, 2, 0, -3, 4]], [[-600, -20, -30, 8, 7, 34, -6, 9, 8, 8]], [[25, 5, -20, 8, 7, -5, 33, -6, 14, -60, 9]], [[0, 1, 2, 3, 4, -10, -20, -31, 9, 20, 2]], [[100, 200, 300, -400, -500, -600, 700, 4, 1000, -50, 25, -800, 100]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -600, 700, -800, -900, 999, -50, 75, 700, -900, -70]], [[10, 200, 20, 30, -40, -41, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, 10, -900, 1000, -50, 100]], [[25, 5, -20, 8, 7, -5, 33, -6, -10, -60, 9]], [[25, -20, 8, -5, 33, -6, 14, 9, 14, -20, 9, 33, 25, 14]], [[200, 299, -399, -500, 300, -10, 301, -800, -900, 1000, 75, -500, 300]], [[1, 2, 3, 4, -5, -6, 34, -10, -6, -6]], [[1, -30, 3, 4, 5, 6, -13, 8, 9, 10, -11, -12, -13, 2, 1, 2, 4]], [[100, -200, 300, -1, -3, -10, -11, -1]], [[200, 300, -399, -500, 300, 14, 700, 301, -800, -900, 1000, 75, -500, 300, -800]], [[26, -6, 32, -20, 8, -5, 33, -6, 14, 9, 14, -50, -20, -20]], [[-2, 11, -11, 13, 14, -2, -3, 14, -4, 11, 11, 14]], [[1, 2, -3, -4, 5, -7, -8, 9, 10, -11, -12, -8]], [[100, -40, -400, -1, 2, 2, -3, 4, 4]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, -10, -30, 10, 7, 75]], [[25, -20, 8, -5, 100, 33, -6, 14, 9, 13, -50, 9, -20, 14]], [[25, -20, 8, 7, 33, -2, -7]], [[0, 0, 0, -20, 0, -7, 0, 0, 0]], [[0, 1, 2, 3, 1, 4, 5, -41, -20, -2, -30, 20, 29, 29]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -60]], [[0, 1, 25, 3, 4, 5, -1, -10, -20, 20, -30, 10, 20, 30]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -90, 1, -13, 1, -15, 1, -40]], [[-20, -5, 33, -6, 14, 9, 14, -20, -20, 9]], [[0, -1, 0, 0, -20, 0, 0, 1, -14, 0, 0]], [[1, 2, 3, 4, -800, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2, 6]], [[-12, -200, 300, -1, -1, -3, 4, -1]], [[100, 200, 300, -400, -500, -600, 700, -800, -900, 999, -50, 75, 75]], [[1, 2, 3, 5, -5, -6, 34, -10, 7]], [[0, 1, 25, 3, 4, 5, -9, -20, -30, 10, 20, 30, 4]], [[0, 0, 0, -20, 0, 0, 0, 0]], [[25, 8, 0, -12, 7, -5, -6, 14, 14, 25, 7]], [[100, 300, 5, -400, 0, -1, 4]], [[10, 200, 20, 30, -40, -399, -50, -60, -70, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 100]], [[25, -20, 8, -5, 9, 33, -6, 14, 9, 34, 14, -50, -20, 9, -50]], [[200, 300, -399, -500, 300, 14, 700, 301, -800, -900, 1000, -500, 300, -800, -900]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 3, -12, -13, 2, -15, 1, -12, 2, 3]], [[-12, -200, 300, -1, -3, 4, -1, 300, -12]], [[25, -20, 8, 7, -5, 33, 14, 9, 8]], [[100, -200, 300, -400, -1, 2, 0, 4, -1]], [[25, -20, 8, 0, 7, -5, 33, -6, 14, 9, 14, 8, -5]], [[100, -200, 300, -3, -1, 201, 2, -3, 300, 4, 100]], [[100, -200, 300, 2, -3, 300, -10]], [[10, 12, 13, -2, -3, 12, -4, 11, 12]], [[10, 100, 199, 20, -400, -500, 300, 14, 700, 9, -800, 1000, 75, 20]], [[200, 300, -399, -500, 300, 14, 700, -800, -900, 1000, 75, -500, -501, -800, 14]], [[25, 5, -20, 7, -5, 33, -6, 14, -60, 9]], [[0, 0, 0, -6, 0, 0, 0, -12, 0, 0, 0, 0]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 200]], [[-600, -20, -30, 8, 7, 34, -6, 9, 8, 34]], [[0, -1, 0, 0, -20, 100, 0, 0, -14, 0, 0]], [[100, 200, 300, -400, -500, -601, 700, -800, 1000, -50, 75, -49, 75]], [[-70, -200, 300, -400, -1, -69, 0, -3, 4, 300, -1]], [[1, -800, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 2]], [[-399, 7, -5, 33, -6, 14, 9, 14]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -90, 1, -13, 1, 1, -40]], [[0, 0, 0, 0, 0, -1, -12, -1, 0, 0, 0]], [[1, 2, 2, -4, 6, -7, -9, 9, 10, -11, -12]], [[25, -20, 7, -5, 33, -6, 14, 2, 34, 14, -50, -20, 9, -50]], [[-20, -5, 33, -6, 14, 9, 14, -20, -20, 9, -20]], [[-20, 8, 7, -5, 33, 14, 9]], [[10, 200, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, -400, -41, -500, -600, 700, -800, -900, 1000, -50, 7, 100]], [[25, -20, 7, -5, 33, -6, -10, -60, 9, -60]], [[1, -10, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -16, 2]], [[-20, 8, 7, -5, 33, 14, 9, 33]], [[0, 76, 25, 3, 4, 5, -1, -10, -20, 20, -30, 10, 20, 30]], [[-399, -5, 33, -6, 14, 9, 14]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -600, 700, -800, -900, 999, -50, 75, 700, -900, -70, 700]], [[10, -14, 12, 13, -69, 14, -2, -3, 12, -4, 11, 13]], [[0, 0, 0, -19, 0, -7, 0, 0, 0]], [[7, -20, 8, 7, 200, -5, -6, 14, 9, 14]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 10, 20, 30, -10, -30, 10, 4, 1]], [[25, -20, 8, -5, 33, 14, 9, 26, 14, -20, 9, 33, -20, 25]], [[10, 200, 20, 30, -40, -50, -60, -70, -600, -80, -90, 100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 7, 100, -50]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1001, -50, 75, 700, -900, 13, -70]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 9, 10, -10, -12, -13, -2, 2, -15, 1, -10]], [[0, 0, 0, 0, 0, 0, 0, 0]], [[25, 5, -20, 8, 7, -5, 33, -6, -60, 9]], [[10, 12, 13, -2, -3, 12, -4, 11, 11, -2]], [[-2, 11, 15, 12, 13, 14, -2, -3, 14, -4, 11]], [[100, 200, 300, 74, -500, -600, 700, -800, 1000, -50, 75, 75, -800, 300]], [[25, -20, 26, 13, -5, 33, -6, 14, 9, 14, -50, -20, 9]], [[1, -10, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -16, -13]], [[1, 2, -3, -4, 5, 6, -7, -8, 9, 100, -11, -8]], [[1, 2, 3, 4, -5, -6, 34, -15, -10, 7, -6]], [[1, 2, 3, 4, 5, 7, 8, 9, -40, 10, -11, -12, -90, 1, -13, 2, -15, 1]], [[200, 300, -399, -500, 14, 700, 299, -900, 1000, 75, -500, 1000, -500]], [[100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, 100]], [[-70, -200, 300, -400, -2, -1, 2, 0, -3, 4, -1]], [[24, -20, 8, 7, -5, 33, -6, 14, 9]], [[100, 300, -400, -400, 4, 100, 100]], [[25, -20, 8, 7, 3, 33, -6, 9, -5, -20, 3]], [[25, -20, 8, -5, 33, -6, 14, 2, 34, 14, -50, -20, -19, 9, -50]], [[1, 2, 3, 4, 5, 6, 8, 8, 9, -40, 10, -11, -12, -90, 1, -13, 1, 1, -40]], [[25, -20, 7, 33, -2, -7]], [[1, 2, -13, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -6, 3, 1, 2]], [[100, 300, -400, -400, 4, 100, 300]], [[1, -4, 2, 3, 5, -5, -6, 34, 7, -10, 7, -10]], [[100, 200, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -50]], [[100, 200, 299, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500, -30, 300, 700]], [[300, -400, -500, 300, 14, 700, -800, -900, 1000, 75, 1000]], [[100, 200, 300, 201, -400, -500, -600, 700, -800, 1000, -50, 75, 75, 200]], [[0, -1, 0, 0, -20, 0, 0, 1, -14, 0, 0, -14]], [[25, 5, -20, 7, -5, 75, 33, -6, 14, -60, 9]], [[25, -20, 8, 7, -5, -50, 14, 9]], [[100, 200, 300, -400, -500, -601, 700, -800, 1000, -50, 75, 75, -800]], [[100, 300, -400, -500, -600, 700, 4, 1000, -50, 25, -800, 100]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, 2, -14, 1, 2, 9]], [[-12, -200, 301, -400, -1, 0, 4, -1, 300]], [[false]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2, 6, 8]], [[0, 1, 2, 3, 4, 5, -41, -20, -2, -30, 10, 20, 29, 29, 3]], [[0, 1, 2, 3, 4, 5, -10, -20, -30, 2, -2, 20, 30, -10, -30, 10, 4, 20]], [[10, 12, 13, 199, -2, 12, -3, 12, -4, 11, 12]], [[1, 2, 3, 5, 6, 7, 8, 9, -40, 9, 10, -10, -12, -13, -2, 2, -15, 1, -10]], [[0, 1, 2, 3, 4, 5, -10, -30, 10, 20, 30, -10]], [[-12, 25, -20, -12, 9, 7, -5, 33, -6, 9, -5, 2, 10, -20]], [[1, 2, 2, -4, 6, -7, -8, 9, -14, -11, -12, -7]], [[10, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1001, -50, 75, 700, -900, 13, -70, -900]], [[0, 0, 0, 0, -1, -12, 0, -1, 0, 0, 0]], [[10, 11, 13, 10, 14, -2, -3, 12, -4, 11, -2, 12]], [[0, -1, 1, 0, 0, -20, 0, 0, 1, -14, 0, 0]], [[0, 1, 2, 3, 4, 5, -10, -30, 10, 20, 31, 30, -10]], [[10, -601, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -600, 700, -900, 999, -50, 75, 700, -900, -70, 700, -70]], [[2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2, 6]], [[25, -20, 8, 7, -5, 33, -6, -1, 4, 9, 14, 33]], [[1, 2, 3, 5, -3, 6, 7, 8, 9, -40, 9, 10, -10, -12, -12, -2, 2, -15, 1, -10]], [[100, 200, 300, -400, -500, -600, 700, -800, -900, 1000, 75, 100]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -90, 1, -13, 1, 1, -40]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 1, 2]], [[-12, -200, 300, -400, -1, 0, -3, 4, -1]], [[25, -20, 8, 7, -5, 33, 14, 10, 9]], [[0, 0, -20, 0, 0, -40, -7, 1, 0, 0]], [[100, 199, 20, -400, -500, 300, 14, 700, 9, -800, 1000, 75, 20]], [[25, 12, -20, 8, 7, -5, 33, -6, 14, 9]], [[1001, 1, 2, 3, 4, 5, -41, -20, -30, 10, 20, 29]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15, 2]], [[-200, 300, -1, 2, -3, 300, -10]], [[0, 1, 1001, 1000, 25, 4, 5, 0, -20, -30, 20, 30, -12, -199, 0, 0]], [[100, 300, -400, -400, 4, 100, 100, -400, -400]], [[10, 20, 30, -40, -50, -60, -80, -90, 200, 700, 300, -400, -500, -600, 700, -800, -900, 1000, -50, 75, -50]], [[0, -1, 0, -20, 0, 0, 1, -14, 0, 0]], [[25, 8, 0, 1, 7, 33, -6, 14]], [[-12, 25, -20, -12, 7, -5, 33, -6, 9, -5, 2, 10, -20]], [[10, -601, 20, 30, -40, -50, -60, -70, -80, -90, 100, 200, 700, 300, -400, -600, 700, -900, 999, -50, 75, 700, -900, -70, 700, -70, 300]], [[1, 2, 3, 4, 5, 7, 8, 9, -40, 10, -10, -12, -600, -2, 2, -15, 1, -10, -600]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -40, 10, -10, -12, -13, -2, 2, -15, 1, -10, -13]], [[200, -400, -500, 300, 14, 700, -800, -900, 1000, 75, -500]], [[-80, -199, 300, -199, -400, -1, 2, 7, -3, 4]], [[0, 0, 0, -20, 0, 0, -15, 0, 0]], [[25, 12, -20, 8, 7, -5, 33, 0, -6, 14, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, 2, -15, 4, 1, -12, 2, -12]], [[-60, 100, -40, -400, 5, 3, -1, 2, -3, -13, 4]], [[25, -20, 8, 7, -5, 33, -6, 14, -60, 9, 7]], [[0, 0, -20, 0, 0, -14, 0, -11, -11]], [[-2, 11, -11, 13, 14, -2, -3, 14, -4, 11, 11, 14, 11]], [[2, 3, 4, 5, 6, 6, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 2, 6]], [[7, 14, -20, 8, 7, 199, -5, -6, 31, 14, 9, 14]], [[25, -12, -200, 300, -400, -1, 2, 0, 11, 4, -1]], [[1, 2, -13, 3, 4, 5, 6, 7, 8, 9, -40, 10, -11, -12, -13, 2, -6, 4, 1, 2, 1]], [[1, -10, 2, 3, 5, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -16, -13, 9]], [[100, -40, -400, -1, 2, 2, -3, 4, 4, 2]], [[1, 2, 3, 4, -13, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, -14, 1, 2]], [[1, 2, 3, 4, -5, -6, 34, -10, 7, -6, 7]], [[200, 300, 74, -500, -600, 700, -800, 1000, -50, 75, -801, 75, -800]], [[25, -20, 8, -5, 1, 33, -6, 14, 9, -8, 14, -50, -20]], [[1, 2, 3, 4, 5, 6, 7, -13, 8, 9, -40, 10, -11, -12, -13, 2, 1, 6]], [[25, -20, 8, 14, -5, 33, -6, 14, 9, 14, -50, -20, -20]]], "completion": "\nfrom typing import List\n\ndef triples_sum_to_zero(l: List[int]) -> bool:\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n \"\"\"\n from itertools import combinations\n return any(sum(combo) == 0 for combo in combinations(set(l), 3))\n", "raw_completion": "```python\nfrom typing import List\n\ndef triples_sum_to_zero(l: List[int]) -> bool:\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n \"\"\"\n from itertools import combinations\n return any(sum(combo) == 0 for combo in combinations(set(l), 3))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef triples_sum_to_zero(l: list):\n \"\"\"\n triples_sum_to_zero takes a list of integers as an input.\n it returns True if there are three distinct elements in the list that\n sum to zero, and False otherwise.\n\n >>> triples_sum_to_zero([1, 3, 5, 0])\n False\n >>> triples_sum_to_zero([1, 3, -2, 1])\n True\n >>> triples_sum_to_zero([1, 2, 3, 7])\n False\n >>> triples_sum_to_zero([2, 4, -5, 3, 9, 7])\n True\n >>> triples_sum_to_zero([1])\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/41", "prompt": "\n\ndef car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"\n", "entry_point": "car_race_collision", "canonical_solution": "\n\n return n ** 2\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(2) == 4\n assert candidate(3) == 9\n assert candidate(4) == 16\n assert candidate(8) == 64\n assert candidate(10) == 100\n\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n >= 1, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[2], [3], [4], [8], [10]], "atol": 0, "plus_input": [[5], [6], [12], [15], [20], [1], [25], [7], [100], [500], [24], [101], [14], [99], [4], [8], [3], [23], [19], [47], [48], [46], [26], [499], [27], [98], [28], [18], [45], [498], [13], [102], [11], [17], [501], [68], [21], [30], [10000], [987654], [1000], [1002], [97], [9999], [987653], [22], [29], [10001], [16], [31], [9998], [89], [44], [9997], [1003], [83], [43], [84], [100000], [1000000000], [59], [58], [999], [987652], [998], [57], [997], [996], [56], [9], [55], [92], [50], [42], [54], [10], [53], [87]], "completion": "\nimport numpy as np\n\ndef car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"\n left_cars = np.random.uniform(0, 1, size=n)\n right_cars = np.random.uniform(0, 1, size=n)\n left_cars.sort()\n right_cars.sort()\n collided_cars = np.searchsorted(left_cars, right_cars)\n return np.sum(collided_cars)\n", "raw_completion": "```python\nimport numpy as np\n\ndef car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"\n left_cars = np.random.uniform(0, 1, size=n)\n right_cars = np.random.uniform(0, 1, size=n)\n left_cars.sort()\n right_cars.sort()\n collided_cars = np.searchsorted(left_cars, right_cars)\n return np.sum(collided_cars)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef car_race_collision(n: int):\n \"\"\"\n Imagine a road that's a perfectly straight infinitely long line.\n n cars are driving left to right; simultaneously, a different set of n cars\n are driving right to left. The two sets of cars start out being very far from\n each other. All cars move in the same speed. Two cars are said to collide\n when a car that's moving left to right hits a car that's moving right to left.\n However, the cars are infinitely sturdy and strong; as a result, they continue moving\n in their trajectory as if they did not collide.\n\n This function outputs the number of such collisions.\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/42", "prompt": "\n\ndef incr_list(l: list):\n \"\"\"Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"\n", "entry_point": "incr_list", "canonical_solution": "\n return [x + 1 for x in l]\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([]) == []\n assert candidate([3, 2, 1]) == [4, 3, 2]\n assert candidate([5, 2, 5, 2, 3, 3, 9, 0, 123]) == [6, 3, 6, 3, 4, 4, 10, 1, 124]\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[]], [[3, 2, 1]], [[5, 2, 5, 2, 3, 3, 9, 0, 123]]], "atol": 0, "plus_input": [[[100, 200, 300, 400, 500]], [[-1, -2, -3, -4, -5]], [[0, 0, 0, 0]], [[2.5, 3.7, 8.9, 1.2, 0.5]], [[1, 2, 3, 4, 5, 6]], [[10, 100, 1000, 10000]], [[0.1, 0.2, 0.3]], [[-10, 0, 10]], [[2, 2, 2, 2]], [[1, 1, 1, 1, 1, 1, 1, 1]], [[4, -2, -3, -4]], [[1, 1, 1, 1, 1, 1, 1]], [[-1, -5, -3, -5]], [[-1, -5, -3, -5, -3]], [[0.1, 0.2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 200, 2, 2]], [[0.1, 0.3]], [[100, 300, 400, 500]], [[-1, -3, -4, -5, -1]], [[10, 100, 1000, 10]], [[-10, 0, 10, 0]], [[0, 0, 0, 0, 0]], [[2, 2, 500, 3]], [[0, 0, 0, 6, 0, 0, 0]], [[-1, -3, -5, -5]], [[2, 200, 3, 2]], [[0, 0, 0, 6, 0, 0]], [[-10, 0, 10, 0, 0]], [[1, 1, 1, 1, 10, 1, 1]], [[2, -1, 500, 3]], [[-1, -5, -3, -5, -3, -3]], [[-5, 10, 100, 1000, 10000]], [[2, 2, 2, 2, 2]], [[0.14907947235135702, 0.1]], [[-10, 0, 10, 10]], [[2, 200, 2, 2, 2]], [[2, 200, 300]], [[2, -1, 500]], [[-1, -2, -3, -4, -5, -4]], [[2, 200, 2, 2, 10000, 2]], [[-10, 200, 10]], [[0.1, 0.5, 0.3]], [[3.7, 0.1, 1.2]], [[-0.6821906440453559, 0.3, -0.6821906440453559]], [[2.5]], [[6, 200, 10]], [[1, 10000, 1, 1, 1, 1, 1, 1, 100, 1, 1]], [[2, 2, 500, 3, 2]], [[200, 10, 200]], [[-1, -2, 100, -4, -5]], [[2, 2, 2, 200]], [[1, 2, 3, 4, 5, 6, 5]], [[3, 2, 500, 3]], [[]], [[0, 0, 0, 100, 0]], [[3.5652526206208957, 3.7, 8.9, 1.2, 0.5]], [[-0.6821906440453559, -0.7691785226568567, -0.6821906440453559, -0.6821906440453559]], [[0, 400, 0, -1, 0, 0, 0]], [[-0.7691785226568567, 0.1, 1.2, -0.7691785226568567]], [[1, 0, 0, 0]], [[-0.6821906440453559, 0.3, -0.6821906440453559, -0.6821906440453559]], [[-10, 200, 10, -10]], [[1, 1, 0, 0]], [[200, 1, 1, 1, 1, 1]], [[0.1, 1.2, 1.2, 0.1]], [[-1, -2, -4, -4, -5, -4, -4]], [[2, 2, 1, 2, 2, 2]], [[1, 2, 3, 4, 6]], [[0, 0, 400, 0, -1, 0, -2]], [[3.5652526206208957, 3.7, 8.9, 0.5, 8.9]], [[4, -2, -3, 1000, 1000]], [[0.1, 0.3, 0.1]], [[-0.6821906440453559, 0.3, -0.6752788781109065, -0.6821906440453559]], [[-1, -2, -3, -4, -5, -4, -4]], [[-0.7691785226568567, 0.1, 1.2, -0.7691785226568567, -0.7691785226568567, -0.7691785226568567]], [[0.5, 88.08080880531568, -21.596861567647125, 0.14907947235135702, -59.15962684129501, -0.6821906440453559, -0.6752788781109065, -4.166307314246723, 0.14907947235135702]], [[1, 1, 1, 1, 10, 1, 1, 10]], [[3.5652526206208957, 3.7, 8.9, 8.9]], [[-1, -5, -5]], [[0, 400, 0, 0, 0, 0]], [[200, 9, 2]], [[-1, -2, 3, -3, -4, -5, -4, -4]], [[-1, -5, -3, -4, -3, -3]], [[-1, 0, -4, -4, -5, -4, -4]], [[3.5747542777313726, 3.7, 8.9, 0.5, 8.9]], [[0.5355425697452281]], [[1, 1, 1, 1, 1, 1]], [[-10, 1, 10, 1]], [[-1, -3, -4, -5, -1, -5]], [[2, 501, 0, -1, 500]], [[1, 10000, 1, 1, 1, 1, 1, 1, 100, 1, 1, 100]], [[10, 1000, 100, 1000, 10000]], [[-0.6821906440453559, -0.7691785226568567, -0.6821906440453559, 2.5]], [[-3, -4, -5, -1, -5]], [[1, 0, 0, -1]], [[2, 2, 1, 500, 2, 2, 2, 1]], [[1, 1, 1, 1, 1, -1]], [[8.9, -0.6821906440453559, -0.7691785226568567, -0.6821906440453559, 2.5]], [[-1, -2, -4, -4, -5, -4, -4, -5]], [[3, -1, 6, 0, 10, -5, 9, 0, -2, -7]], [[1.5, 3.8, -2.1, 6.4, 7.9]], [[false, true, false, true, false]], [[-8, 5, 9, -2, 6, 5, 0, -1, -8, 3]], [[7]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 20]], [[-3.4, -2, -0.5, 1, 3.2, 5.9, 8.6]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, -10]], [[-5, -4, -3, -2, -1]], [[1, -2, 3, -4, 5, 7, 40000, 9, -10]], [[false, false, false, true, false]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 20]], [[2, 1, 4, 6, 8, 10, 12, 14, 16, 18, 0, 20]], [[1, 4, 6, 8, 10, 12, 14, 16, 18, 20]], [[7, 7]], [[1, 4, 6, 8, 10, 14, 16, 18, 20]], [[-5, -4, -3, -2, 0, -2, -1]], [[1, 4, 6, 8, 10, 16, 18, 20]], [[1, 4, 6, 8, 10, 20, 16, 18, 20]], [[7, 6]], [[1, 4, 6, 8, 10, 16, 18]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 20, 20]], [[false, false, true, false]], [[5, 9, -2, 6, 5, 0, -1, -8, 3]], [[10000, 20000, 30000, 40000, 50000, -3, 60000, 70000, 80000, 90000, 100000]], [[1, 6, 8, 10, 12, 14, 16, 18, 20]], [[90000, 4, 6, 8, 10, 12, 14, 18, 20]], [[false, true, false, true, false, true]], [[-5, 20000, -3, -2, -2, -1]], [[2, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16]], [[-3.4, -2, -0.5, 0, 3.2, 5.9, 8.6, 5.9]], [[1, 4, 6, 8, 10, 20, 16, 14, 20]], [[1.5, 3.8, -2.1, 6.4, 7.9, 6.4]], [[false, true, false, false, true]], [[-0.5, 3.0555994730975744, 0, 3.2, 5.9, 8.6, 5.9]], [[false, true, true, false, true]], [[5, 9, 6, 5, 0, -1, -8, 3]], [[10000, 20000, 30000, 40000, 20000, 50000, 60000, 70000, 80000, 90000, 100000]], [[1, 4, 6, 8, 10, 16, 9, 18, 9]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20]], [[false, true, true, false]], [[1, 4, 6, 8, 10, 20, 16, 14, 20, 4]], [[false, true, false, false, true, false, true]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 19, 20]], [[1, 4, 6, 8, 10, 14, 16, 20, 20]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20, 7]], [[false, true, false, false, true, false]], [[3, -1, 0, 10, -5, 9, 0, -2, -7]], [[3, -1, 0, 10, -5, 9, 0, -2, -7, -5]], [[1, 4, 6, 10, 20, 16, 18, 20, 20]], [[false, true, false, true]], [[1, 4, 6, 8, 10, 14, 9, 16, 20, 20]], [[-5, -4, 12, -3, -2, 0, -2, 90000, -1]], [[5, 10, 6, 5, 0, -1, -8, 3]], [[1, -2, 3, -4, 7, 40000, 9, -10]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 20, 16]], [[1, 4, 6, 8, 17, 14, 9, 16, 20]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20]], [[1, 4, 6, 8, 10, 20, 16, 15, 20, 4]], [[1, 5, 6, 8, 10, 12, 14, 16, 18, 20]], [[-4, 1, -2, 3, -4, 5, 7, 40000, 9, 6, 1]], [[-5, 9, 20000, -2, -1]], [[1, -2, 3, -4, 40000, 9, -10]], [[1, 4, 20, 6, 8, 10, 20, 16, 15, 20, 4]], [[1, 4, 6, 8, 10, 20, 16, 15, 20, 4, 15]], [[10000, 20000, 30000, 60000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20, 20]], [[10000, 20000, 30000, 40000, 50000, -3, 60000, 70000, 80000, 90000, 20, -3]], [[1, 4, 6, 8, 10, 20, 16, 14, 20, 20]], [[4, 6, 8, 10, 20, 16, 15, 20, 4]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20, 20, 20, 10]], [[-1, 0, 10, -5, 9, -2, -7]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 70000]], [[false, false, true]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20, 7, 6]], [[1, 4, 6, 8, 14, 16, 20, 20]], [[1, 4, 6, 8, 10, 20, 20, 16, 15, 20, 4]], [[-8, 5, 9, -2, true, 6, 5, 0, -1, -8, 3, true]], [[1, 6, 8, 10, 20, 16, 14, 20]], [[16, 4, 6, 8, 10, 12, 14, 16, 18, 20]], [[1, 4, 6, 15, 8, 10, 20, 16, 14, 20]], [[3, -1, 0, 10, 11, -5, 9, 0, -2, -7]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 17, 16, 18, 20, 16, 20]], [[1, 4, 6, 10, 16, 18, 5, 20, 1]], [[1, 4, 6, 8, 10, 12, 16, 18, 20]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 90000]], [[1, 4, 6, 8, 10, 10, 16, 18, 18, 20]], [[2, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20]], [[1, -2, 3, -4, 5, 40000, 9, -10]], [[-0.5, 3.0555994730975744, 0, 3.8745762456886825, 5.9, 8.6, 5.9, 5.9, 5.9]], [[1, -2, 3, true, -4, 5, 40000, 9, -10]], [[1.5, 3.8, -2.1, 6.4, 7.9, -2.1]], [[2, 4, 6, 8, 12, 12, 14, 16, 18, 20]], [[1, -2, 3, true, -4, 5, 40000, 9, 1, -10]], [[3, -1, 0, 10, 11, -5, 9, 0, -2, -2, -7]], [[-5, 9, 20000, -1, 9]], [[1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10]], [[1, -2, 3, true, -4, 5, 40000, 9, -10, true]], [[-1, 0, 10, -5, -2, -7]], [[5, 9, -2, 6, 5, 0, -1, -8, 3, 5]], [[-5, 18, 9, 20000, 14, -1, 9, -5]], [[3, -2, 0, 10, 11, -5, 9, -2, -7]], [[10000, 20000, 30000, 40000, 50000, -3, 60000, 70000, 80000, 90000, 20, -3, 20]], [[1, 6, 10, 16, 18, 5, 20, 1]], [[false, false]], [[20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 90000, 60000]], [[false, true, false, false, true, false, true, true]], [[-5, 20000, -3, -2, -2, -2]], [[5, 10, 5, 0, -1, -8, 3, 10]], [[1, 4, 6, 8, 20, 12, 14, 4, 20, 7, 20]], [[1, 4, 6, 8, 10, 20, 16, 14, 20, 4, 4, 14]], [[false, true, false, false, true, false, true, true, true]], [[60000, 4, 6, 8, 10, 16, 9, 18, 9]], [[10, 1, 4, 6, 8, 17, 14, 9, 16, 20]], [[1, 4, 6, 8, 10, 16, 20, 10]], [[false, true, true, true]], [[1, 4, 6, 8, 4, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1]], [[1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10, -1]], [[5, 10, 6, 5, 0, -1, -8, 3, -1]], [[2, -7, 4, 6, 8, 80000, 12, 14, 16, 18, 0, 20, 2]], [[-3.4, -0.5, 0, 3.2, -0.5, 5.9, 8.6, 5.9, 5.9]], [[-5, -4, -3, -2, -1, -3]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20, 17]], [[1, 6, 8, 10, 20, 16, 4, 10000, 20, 7]], [[5, 11, 6, 5, 0, -1, -8, 3]], [[-5, -4, -3, 8, -2, -1, -3, -3]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 70000, 90000, 100000, 90000]], [[1, 4, 6, 8, 10, 20, 16, 16, 20, 4, 6]], [[1, 4, 6, 100000, 8, 10, 20, 16, 14]], [[false, false, false, true, false, false]], [[-5, 8, 9, 20000, -1, 9]], [[1, 4, 6, 10, 16, 18, 20]], [[true, false, true, false, false, true, false]], [[1, 4, 6, 8, 20, 50000, 14, 4, 7, 20]], [[1, 10000, 4, 6, 8, 9999, 20, 50000, 14, 4, 7, 20]], [[1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10, 1]], [[1, -2, 80000, 3, -4, 7, 40000, 9, -10, 7]], [[false, true, false, true, false, true, true]], [[-2, 3, true, -4, -1, 5, 40000, 9, 1, -10]], [[-5, 20000, -3, -10, -2, -2, -1]], [[1, 4, 6, 8, 10, 20, 16, 15, 4, 15]], [[1, 4, 6, 15, 8, 10, 20, 6, 20]], [[1, 6, 8, 10, 20, 16, 14, 20, 8]], [[90000, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20, 17]], [[-5, -4, 12, -3, -2, 0, -2, 90000, -1, -3]], [[1, 5, 6, 8, 10, 12, 14, 16, 18, 20, 14]], [[1, -2, 3, -4, 5, 7, 40000, 9, -10, 1]], [[1, 4, 6, 8, 4, 20, 16, 14, 4, 20, 20, 20, 10, 1]], [[5, 6, 8, 10, 12, 14, 16, 18, 20]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 90000]], [[1, 5, 6, 8, -1, 20, 16, 14, 4, 20, 7, 6]], [[1, 4, 6, 70000, 10, 20, 16, 14, 20, 20, 5]], [[10000, 20000, 30000, 40000, 50000, -3, -2, 70000, 80000, 90000, 20, -3]], [[10000, 20000, 30000, 60000, 40000, 50000, 60000, 70000, 90000, 100000]], [[false, true, false, false, false]], [[1, 4, 6, 8, 12, 16, 18, 20, 16]], [[5, 70000, 5, 0, -1, -8, 3, 10]], [[-5, 20000, -3, -3]], [[1, 4, 6, 8, -4, 20, 16, 15, 20, 4, 15]], [[1, 4, 6, 8, 10, 12, 16, 18, 19]], [[7, -5, 8, 9, 20000, -1, 9]], [[1, 4, 6, 8, 20, 12, 16, 18]], [[1, 4, 12, 8, 17, 14, 9, 16, -10]], [[1, -2, 3, true, -3, -1, 5, 40000, 9, 1, 9999, -10]], [[-3, 1, 4, 6, 8, 10, 14, 9, 16, 20, 20]], [[90000, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20, 17, 20]], [[4, 6, 8, 10, 20, 16, 15, 20, 4, 15]], [[10, 1, 4, 6, 8, 17, 14, 9, 20]], [[1, 4, 6, 8, 10, 12, 16, 18, 20, 1]], [[1, 6, 8, 10, 20, 4, 10000, 18, 7, 1]], [[-2, 3, true, -1, 5, 40000, 9, 1, -10]], [[1, 4, 6, 20, 10, 20, 16, 14, 20, 4, 4, 14]], [[7, -5, 8, 9, 20000, -1, 9, 20000]], [[false, true, false, true, true]], [[9, 1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10, 1]], [[5, 9, 6, 5, 0, 30000, 3, -8, 3]], [[10, 1, -7, 4, 6, 8, 17, 14, 9, 20]], [[1, 4, 6, 8, 10, 20, 50000, 14, 4, 20, 20]], [[1, 4, 6, 8, 10, 3, 16, 14, 4, 20, 20]], [[1.5, 3.8, 8.6, 6.4]], [[1, 4, 6, 8, 10, 20, 50000, 14, 21, 4, 20, 20]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 70000, 100000]], [[-5, -4, -3, 8, -2, -1, -3]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 90000, 70000]], [[-1, 0, 10, -5, 9, -2, 9]], [[90000, 2, 17, 4, -7, 6, 8, 10, 12, 17, 13, 14, 16, 18, 20, 16, 20, 2]], [[1, 4, 20, 6, 8, 16, 14, 9, 21, 16, 20]], [[-2, -5, -4, -3, -2, -1, -3]], [[false, false, true, false, false]], [[1, 4, 6, 8, 4, 6, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1]], [[-3, 4, 6, 8, 10, 20, 16, 14, 4, 20, 20, 20]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 16, 14, 16, 18, 20, 16, 20, 17, 90000]], [[1.5, 8.6, 3.8, -2.1, 6.4, 1.5, 7.9, -2.1]], [[0.5090263789060623, -2.1, 6.4, 7.9]], [[-0.5, 3.0555994730975744, 0, 3.8745762456886825, 5.9, 8.6, 5.9, 7.9, 5.9]], [[1, 4, 6, 8, 14, 16, 20, 20, 14]], [[1, 4, 6, 8, 10, 10, 20, 16, 14, 20]], [[1, 5, 6, 8, 10, 12, 14, 16, 18, 20, 14, 5]], [[1, 4, 6, 8, 10, 12, 16, 18, 20, 6, 10]], [[6, 8, 10, 11, 14, 16, 18, 20, 12]], [[7, 6, 6]], [[1, 4, 6, -1, 16, 18, 5, 20, 12]], [[90000, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 16, 20, 17, 20]], [[-5, -3, 20000, -3, -2, -2]], [[1, -2, 80000, 3, -4, 7, 40000, 9, -10, 7, 7]], [[-3, 1, 4, 6, 8, 2, 10, 14, 9, 16, 20, 20]], [[100000, 20000, -3, -2, -2, -2, -2, -2]], [[5, 10, 5, 12, 0, -1, -8, 20000, 10]], [[1, 6, 8, 20, 17, 18]], [[1, 4, 13, 6, 8, 10, 20, 50000, 14, 4, 20, 20]], [[3, -2, 0, 10, 11, -5, 11, 9, -2, -7]], [[1, 5, 6, 8, 5, -1, 20, 16, 14, 4, 20, 7, 6]], [[1, -2, 3, true, -4, 5, 40000, 9, -10, 8, true]], [[-5, -4, 12, -3, -2, 0, -2, 90000, -1, -3, 0]], [[-3.4, -2, -0.5, 0, 5.9, 8.6, 3.8]], [[1, 21, 4, 6, 8, 10, 16, 20, 10]], [[-3.4, -2, -0.5, 0, 5.9, 8.6, 3.8, 5.9]], [[1, 4, 6, 8, 18, 10, 19, 16, 14, 20, 20]], [[19999, 30000, 40000, 50000, 60000, 70001, 80000, 70000, 90000, 100000, 90000, 60000]], [[9999, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[false, true, false, false, false, true, false, true, true, true]], [[4, 6, 8, 10, 20, 16, 15, 10, 20, 4]], [[2, 5, 6, 10, 12, 14, 16, 18, 0, 20, 16]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 19, 20, 20]], [[10000, 20000, -10, 40000, 60000, 70000, 80000, 90000, 100000]], [[10000, -3, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 90000, 100000]], [[4, 6, 8, 10, 12, 14, 16, 18, 0, 20]], [[20000, 30000, 40000, 50000, 60000, 70000, 80000, 100000, 90000, 60000]], [[7, 8, 7]], [[7, 5, 6, 8, 10, 12, 14, -8, 18, 20]], [[1, -2, 3, -4, 5, 7, 40000, 9, -10, 1, 3, 3, -2]], [[false, true, true]], [[-0.5, 3.0555994730975744, 0, 5.9, 8.6, 5.9, 7.041313375938212, 5.9, 5.9]], [[-8, 5, 9, -2, true, 6, 5, 0, -1, -7, 3, false]], [[90000, 2, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 19, 16, 20, 17]], [[1, 4, 6, 8, -4, 10, 12, 16, 18, 20]], [[-5, 8, 9, 20000, -1, 9, 9]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 19, 20, 20, 20]], [[1, 4, 6, 8, 10, 20, 50000, 15, 4, 20, 10, 20]], [[1, 4, 6, 8, 10, 16, 20, 10, 10]], [[-8, 5, 9, -2, true, 5, 0, -1, -8, 4, true]], [[1, 6, 8, 10, 20, -5, 14, 20]], [[1, 4, 6, 8, 19, 4, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1, 3]], [[-5, -4, -3, 8, -2, 9999, -1, -3, 30000, -3]], [[1, 4, 6, 20, 10, 20, 16, 14, 20, 4, 4, -7, 14]], [[60000, 10, 4, 6, 8, 10, 16, 9, 18, 9]], [[1, 4, 6, 19, 10, 20, 16, 14, 20, 20, 6]], [[false, false, false, false, true, false, true]], [[20, 1, 4, 6, 8, 10, 16, 14, 20, 4]], [[1, 4, 6, 8, 10, 20, 16, 16, 15, 20, 4]], [[1, 4, 5, 6, 8, 17, 14, 9, 16, 20]], [[7, 6, 6, 7]], [[7, 5, 6, 8, 10, 12, -8, 18, 20]], [[3, -2, 0, 10, 11, -5, 11, 9, -2, 0, -7]], [[1, -2, 3, -4, 40000, 12, 9, -10]], [[2, 4, 6, 6, 8, 9, 12, 17, 9, 14, 16, 18, 20]], [[-5, -4, 12, -3, -2, 0, -2, -1, -2]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 8]], [[4, 6, 8, 10, 20, 16, 15, 10, 20, 4, 4]], [[5, 1, 4, 6, 8, 10, 20, 16, 14, 16]], [[1, 4, 6, 8, 4, 20, 16, 14, 4, 20, 20, 3, 10, 1]], [[2, 1, 4, 6, 8, 10, 12, 14, 16, 18, 0, 19]], [[-5, 8, 21, 20000, -1, 9, -5]], [[1.5, 8.6, 3.8, -2.1, 6.4, 2.443642398169077, 1.5, 7.9, -2.1]], [[1, 4, 8, -4, 20, 16, 15, 20, 4, 15]], [[80000, -2, 3, -4, 40000, 12, 9, -10]], [[1, 4, 6, 8, 10, 20, 16, 20, 4, 15, 4]], [[1, 4, 6, 8, 10, 14, 8, 16, 20, 20]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 20, 9999, 20]], [[-2, 80000, 3, -4, 7, 40000, 9, -10, 7, 7]], [[1, 4, 6, 8, 10, 9, 16, 20, 20]], [[1, 4, 6, 8, -4, 20, 16, 15, 20, 16, 4, 15, 20]], [[6, 8, 10, 11, 14, 16, 18, 20, 12, 20]], [[80000, -2, 3, -4, 40000, 12, 9, -10, -1]], [[-5, -4, 12, -3, -2, 0, -2, 90000, -1, -3, -3, 0]], [[0, 6, 8, 17, 20, 17]], [[1, 4, 6, 8, 4, 6, 20, 16, 14, 4, 20, 20, 20, 3, 10]], [[-2, 3, true, -5, -1, 5, 40000, 9, 1, -10]], [[1, 4, 6, 8, 4, 20, 16, 14, 4, 20, 3, 10, 1]], [[1, 4, 6, 8, 10, 10, 2, 20, 16, 14, 20]], [[-2, 3, 3, true, -6, -4, -1, 5, 40000, 9, 1, -10, 5]], [[1, 4, 6, 8, 10, 12, 16, 18, 20, 6, 10, 10]], [[1, 4, 6, 8, 10, 20, 16, 7, 15, 4, 15]], [[-5, 20000, -3, -2, -2, -2, -2]], [[1, 4, 5, 6, 8, 17, 40000, 9, 16, 20]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 16, 20]], [[1, 4, 6, 8, 4, 60000, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1, 3]], [[1.5, 8.6, 3.8, -2.707945416165158, 6.4, 2.443642398169077, 7.9, -2.1]], [[1, 4, 6, 8, 10, 20, 50000, 14, 4, 20000, 20]], [[-6, -5, 8, 21, 20000, -1, 9, -5]], [[-8, 5, 9, -2, true, 6, 5, 0, -7, 3, false]], [[false, true, false, true, false, false, false]], [[3, -1, 6, 0, 10, -5, 9, 0, -7]], [[false, false, false]], [[0, 4, 6, 8, 10, 12, 14, 16, 18, 20]], [[1, 4, 6, 15, 8, 10, 20, 6, 20, 20]], [[-0.5, 3.0555994730975744, 0, 8.6, 5.9, 7.041313375938212, 5.9, 5.9]], [[-40, 80000, 90000, 21, -3, 14, 18, -2, 87]], [[-5, -4, -3, -2]], [[false, true, true, true, true]], [[4, 6, 8, 10, 20, 16, 15, 20, 4, 15, 15]], [[1.5, 8.6, 3.8, -2.707945416165158, 6.6038246269482945, 2.443642398169077, 7.9, -2.1]], [[1, -2, -4, 40000, 12, 9, -10]], [[6, 8, 10, 11, 14, 10, 16, 18, 20, 12, 20]], [[20000, -3, -3]], [[false, false, false, false, false]], [[1, 4, 6, 8, 10, 20, 16, 14, 4, 20, 8, 6]], [[6, 8, 10, -4, 14, 10, 16, 18, 20, 12, 20]], [[20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 70000]], [[1, 4, 6, 8, 10, 20, 16, 7, 15, 4, 15, 8]], [[80000, -2, 3, -4, 40000, 12, 9, -10, 40000]], [[5, 70000, 0, -1, -8, 3, 10]], [[-8, 5, 9, -2, true, 6, 5, false, 0, -7, 3, false]], [[-5, 18, 9, 14, -1, 9, -5]], [[1, 8, 10, 20, -5, 14, 20, 20]], [[1, 4, 6, 87, 8, 10, 20, 50000, 15, 4, 20, 10, 19]], [[1, 4, 6, 8, 4, 6, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1, 3]], [[1, -2, 3, -4, 5, -6, 7, -8, 9, -10, 1]], [[1, 4, 6, 2, 10, 20, 16, 5, 15, 4, 20]], [[1, 4, 6, 8, 10, 20, 16, 14, 20, 4, 14]], [[1, 4, 6, 8, 4, 60000, 20, 16, 14, 4, 20, 20, 20, 3, 10, 1, 3, 20]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 9999, 100000]], [[2, 4, 6, 6, 8, 10, 12, 17, 14, 16, 20]], [[10000, 20000, 30000, 7, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[2, -7, 4, 6, 8, 80000, 5, 12, 14, 16, 18, 0, 20, 2]], [[-5, -4, 12, -3, -2, 0, -2, 90000]], [[1.5, 3.8, -2.1, 6.4, 3.8, 3.8]], [[-0.5, 1.5, 3.8, -2.1, 6.4, 7.9, 6.4]], [[2, 1, 4, 6, 8, 12, 14, 16, 18, 0, 19]], [[5, 9, -9, 14, 6, 5, 0, -1, -8, 3]], [[1, -2, 3, -4, 9, -10]], [[-3, 4, 6, 8, 10, 20, 16, 14, 4, 20, 11, 20]], [[6, 8, 10, 20, 16, 15, 10, 20, 4, 4]], [[1, 4, 6, 8, 10, 11, 6, 12, 17, 18, 20, 6, 10]], [[7, -5, 8, 9, 20001, -1, 9, -1]], [[9, 1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10, 1, 9]], [[false, false, true, true, false, false, true, false, true, true, true]], [[10000, 20000, 30000, 7, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 70000]], [[-29, 67, 13, 11]], [[-5, 18, -6, 9, 14, -1, 9, -5]], [[false, true, false, true, false, false, true, false, false]], [[1, 4, 6, 8, 10, 19, 20, 16, 18, 20, 19, 20, 20, 20]], [[2, 2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 20]], [[1, 4, 6, 8, -40, 14, 16, 20, 20, 14]], [[6, 6, 7, 7]], [[90000, 2, 17, 4, 6, 6, 8, 12, 17, 16, 18, 20, 16, 20]], [[17, 1, 4, 6, 8, 10, 16, 18]], [[1, -2, 3, true, -4, 40000, 9, -10, 8, true]], [[2, 4, 6, 6, 8, 10, 80000, 17, 14, 16, 18, 20, 16, 20]], [[1, 30000, 6, 10, 20, 16, 18, 20, 2]], [[-5, -4, 12, -2, 0, -2, 90000, -1]], [[-5, -4, 12, -3, -2, 0, -2, -1, -2, -1]], [[-0.5, 3.0555994730975744, 0, 5.9, 8.6, 5.9, 7.041313375938212, 5.9, 1.5, 5.9, 8.6]], [[-0.5, 0, 4.228643506945893, 8.6, 5.9, 7.041313375938212, 5.9, 5.9]], [[90000, 4, 6, 8, 10, 16, 20, 10]], [[10000, 20000, -9, 60000, 70000, 80000, 90000, 100000]], [[1, 6, 8, 10, 16, 20, 10]], [[20, -5, 18, 9, 20000, -1, 9, -5]], [[1.5, 8.6, 3.8, -2.707945416165158, 2.443642398169077, 7.9, -2.1]], [[1, 4, 6, 8, 10, 17, 20, 17, 18, 20, 20, 9999, 20]], [[1, 4, 6, 8, -2, 20, 16, 15, 20, 4, 4]], [[1, 4, 6, 8, 12, 16, 18, 19, 16]], [[1, 5, 6, 8, -1, 20, 16, 14, 4, 67, 20, 7, 6]], [[false, true, false, true, true, false, true]], [[1, -9, 4, 6, 18, 8, 10, 16, 20, 10, 10]], [[5, 11, 6, 5, 0, -1, -8, 3, -8]], [[-2, 3, true, -4, -1, 5, 40000, 9, -10, 5]], [[9, 1, -29, -2, 3, true, -4, -1, 5, 0, 40000, 9, 1, -10, 1, 9]], [[-29, 13, 11, -29]], [[1, 19, 4, 6, 8, 10, 20, 16, 14, 4, 20, 20]], [[1, 5, 6, 13, 8, -1, 20, 16, 14, 4, 67, true, 7, 6]], [[2.443642398169077, -3.4, -2, -0.5, 0, 5.9, 8.6, 3.8]], [[2, 1, 4, 6, 8, 10, 12, 14, 16, 18, 16, 19]], [[1, 4, 6, 8, 10, 20, 16, 100000, 15, 4, 15, 8]], [[-5, -3, 20000, -3, -2, -3]], [[1, 4, 6, 8, 10, 20, 16, 4, true, 20, 7, 6]], [[90000, 2, 17, 4, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20]], [[5, 10, 5, 0, -1, -8, 3, -1]], [[1, -9, 4, 6, 18, 8, 10, 9]], [[90000, 2, 17, 4, 6, 8, 10, 12, 17, 14, 40000, 16, 18, 20, 16, 20]], [[49999, 1, 4, 13, 6, 8, -1, 10, 20, 50000, 14, 4, 20, 20, 4]], [[20000, 30000, 40000, 50000, 19999, 60000, 70000, 100000, 90000, 60000]], [[-5, -4, -3, 8, -2, -1, -3, -3, -4]], [[-4, 1, -2, 3, -4, 5, -3, 7, 40000, 9, 6, 1]], [[60000, 4, 6, 8, 10, 7, 9, 18, 9, 8]], [[-0.5, 3.0555994730975744, 0, 5.9, 8.6, 5.9, 5.9, 5.9]], [[1, 4, 12, 8, 17, 14, 9, 16, -10, 8]], [[1, -2, 3, true, -3, -1, 5, 40000, 9999, -10, 1]], [[2, 4, 6, 8, 9, 12, 17, 9, 14, 16, 18, 20]], [[-8, 5, 8, -2, 6, 5, 0, -1, 70001, -8, 3]], [[1, 2, 1, 4, 6, 8, 10, 12, 14, 16, 18, 0, 20, 10000]], [[10000, 20000, 30000, 40000, 49999, -3, 60000, -7, 70000, 80000, 90000, 100000]], [[-5, 20000, -3, -7, -3, -5]], [[1.5, 8.6, 3.8, -2.1, 2.443642398169077, 1.5, 7.9, -2.1, 8.6, 7.9]], [[1, 4, 6, 8, 4, 6, 20, 16, 14, 5, 4, 20, 20, 20, 3, 10]], [[1, 4, 14, 15, 8, 10, 20, 16, 14, 20]], [[1, 4, 6, 8, 10, 10, 20, 16, 14, 49999, 20]], [[2, 4, 6, 8, 10, 14, 16, 18, 0, 20, 16]], [[-8, 5, 8, 6, 5, 0, -1, 70001, -8, 3]], [[0, 4, 6, 8, 10, 20, 16, 14, 20, 4]], [[false, true, false, false, false, true, false, true, true, false]], [[-6, -5, 8, 21, 20000, -1, 9]], [[4, 6, 8, 10, 12, 14, 16, 20000, 0, 20]], [[-3.4, 0, 3.2, -0.5, 5.9, 7.780292177637895, 5.9, 5.9, 3.2]], [[4, 6, 8, 10, 20, 16, 70001, 20, 4, 15]], [[1, -2, 3, 10, true, -4, -1, 5, 40000, 9, -10]], [[1, 6, 8, 10, 16, 20, 10, 20, 16]], [[90000, 2, 17, 4, 6, 8, 10, 12, 16, 15, 16, 18, 20, 16, 20, 16]], [[-29, 13, 11, -29, -29]], [[9, 1, -29, -2, 3, true, -4, -1, -29, 5, 0, 40000, 9, 1, -10, 9, -4]], [[-5, -4, -3, 8, -2, -1, -3, -3, -3]], [[-5, -4, -3, 8, -2, -1, -3, -3, -3, -3]], [[80000, -2, 3, -4, 40000, 12, 9, 3]], [[4, 6, 8, 20, 12, 20, 14, 4, 20, 20]], [[10000, 20000, -10, 40000, 15, 70000, 79999, 90000, 100000]], [[1, 6, 8, 10, 20, 16, 1, 14, 20]], [[10000, 4, 6, 8, 10, 14, 16, 18]], [[-0.5, 1.5, 3.8, 6.4, 7.9, 6.4]], [[6, 1, 3, -4, 5, 40000, 9, -10]], [[1, 21, 4, 6, 8, 9, 10, 16, -40, 10]], [[-5, -4, 12, -3, -2, 0, -2, 20001, -1, -3]], [[2.443642398169077, 5.9, -40, -0.5, 0, 5.9, 8.6, 3.8]], [[-6, -5, 8, 21, 20000, -1, 10, -5]], [[80000, 7]], [[1, 21, 6, 8, 9, 10, 16, -40, 10]], [[-5, 20000, -3, -7, -3, 21, -5, -5, -5]], [[1, 4, 6, 16, 18, 5, 20, 1]], [[0, 6, 5, 9999, 17, 20, 17]], [[1, 4, 6, 87, 8, 10, 20, 50000, 15, 4, 21, 10, 19]], [[17, 1, 6, 8, 10, 16, 18]], [[2, 5, 6, 11, 12, 14, 16, 18, 0, 20, 2]], [[-5, -4, 12, -3, -2, 0, -2, -2, -2]], [[90000, 17, 4, 6, 6, 8, 10, 12, 17, 14, 16, 18, 20, 17]], [[-5, 9, 20000, 9]], [[7, -5, 8, 9, -1, 9]], [[2.443642398169077, 5.870022616692514, -40, 0.5090263789060623, 0, 5.9, 8.6, 3.8]], [[-5, 14, -3, -7, -3, -5]], [[1, 4, 6, 18, 19, 16, 14, 60000, 20, 20]], [[1, -2, 3, true, -4, -1, 5, 40000, 9, 1, -10, -10, 1]], [[0.5071788072948802, 8.6, 3.8, -2.707945416165158, 2.443642398169077, 7.9, -2.1]], [[-5, -4, -3, -2, -4, -1]], [[-5, -1, 12, -3, -2, 0, -2, 90000]], [[1, 4, 8, 17, 14, 9, 16, 20]], [[1, 4, 6, 8, 10, 20, 16, 14, 20, 4, 4, -3]], [[1, -2, 3, true, -4, 5, 40000, 9, 1, -10, -4]], [[1, 4, 6, 8, 87, 10, 12, 16, 18, 20, 1]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 16]], [[6, 8, 10, 10, 14, 16, 18, 20, 12]], [[1, 4, 6, 8, 18, 10, 19, 16, 14, 20, 20, 1]], [[false, true, true, true, false, true]], [[-0.5, 1.5, 3.8, -2.1, 6.4, 7.9, -2.707945416165158]], [[1, 4, 6, 8, 18, 10, 19, -2, 14, 20, 20, 1]], [[3, -2, 0, 10, 11, -5, 11, 9, -2, 0, -7, 0, 11]], [[10000, -10, 40000, 60000, 70000, 80000, 90000, 100000]], [[2, 4, 8, 10, 12, 14, 100000, 16, 18, 0, 16, 20]], [[16, 10, 4, 6, 8, 7, 10, 12, 14, 16, 18]], [[1, 4, 6, 8, 10, 20, 20, 16, 15, 4, 6]], [[4, 6, 8, 14, 10, 12, 14, 16, 20000, 0, 20]], [[3, -2, 6, 0, 10, -5, -6, 0, -2, -7, 10]], [[3, -1, 0, 11, -5, 0, -2, -7]], [[1, 2, -2, 3, -4, 9, -10]], [[-5, -4, 12, -3, -2, 0, 90000, -1, -3, 0]], [[1, 4, 6, 8, 19, 4, 20, 16, 14, 4, 20, 20, 20, 3, 10, 20, -9, 3]], [[3.0555994730975744, 0, 3.8745762456886825, 5.9, 8.6, 5.9, 7.9, 5.9]], [[90000, 2, 17, 4, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20, 17]], [[-4, -5, -4, -3, -2, 0, -2, -1, -4]], [[-5, 20000, -3, -7, -3, -29, 21, -5, -5, -5]], [[1, 4, 6, 15, 8, 10, 20, 6, 20, 20, 20]], [[3, -1, 6, -1, 10, 19, -5, 9, 0, -2, -7]], [[3, -2, 0, 10, 11, -5, 11, 9, -2, 0, -7, -5]], [[1, 4, 6, 8, 10, 3, 16, 14, 4, 20]], [[5, 10, 6, 5, -29, 0, -1, -8, 3]], [[10, 5, 0, -1, -8, 3, 10]], [[1, -2, 3, 5, true, -11, -4, 5, 40000, 9, 1, -10]], [[1, 6, 8, 10, 11, 20, 16, -6, 20]], [[-5, -4, -3, -2, -4, -1, -5]], [[1, 4, 6, 8, 10, 20, 16, 18, 20, 20, 9999, 20, 20]], [[-5, 18, -6, -7, 14, -1, 9, -1]], [[1, 4, 6, 8, 14, 16, 20, 14]], [[-5, 9, 20000, 7, 8]], [[1.5, 3.4008996588420715, 1.8239643704054163, -2.1, 6.4, 7.9]], [[1, 4, 6, 8, 10, 20, 20, 16, 15, 4, 80000]], [[90000, 4, 8, -29, 79999, 16, 20, 10, 79999]], [[1.5, 0.5071788072948802, 3.8, -2.707945416165158, 7.9, -2.8003143062363973]], [[2, -7, 4, 6, 80000, 5, 100000, 12, 14, 16, 18, 0, 20, 2]], [[-0.5, 3.0555994730975744, 0, 5.9, 8.500534435887722, 8.6, 5.9, 7.041313375938212, 5.9, 5.9]], [[1, 10000, 4, 20001, 8, 9999, 20, 50000, 14, 4, 7, 20, 9999]], [[-3.4, 10.746488790862529, 0, 3.2, -0.5, 5.9, 7.780292177637895, 5.9, 5.9, 3.2]], [[-5, -4, 12, -3, -2, 0, -2, 90000, 90000, 12]], [[20001, 2, 17, 4, 6, 6, 8, 10, 12, 16, 14, 16, 18, 20, 16, 20, 17, 90000, 17, 16]], [[5, 10, 6, 5, 0, -1, -8, 3, -1, 5]], [[1, 5, 6, 8, 10, 12, 14, 16, true, 20, 14, 5, 10]], [[1, 4, 6, 8, 17, 10, 20, 18, 20, 19, 20, 4]], [[1, -2, 3, true, -3, -1, 5, 40000, 9, 1, -10, -1]], [[-5, -4, 12, -3, -2, 0, -2, 90000, -1, -3, -3, 0, -1]], [[1, -2, -4, 5, 7, 40000, 9, -10, 1, 3, 3, -2]], [[1, 6, 15, 8, 10, 20, 6, 20, 6]], [[1, 4, 6, 10, 16, 18, 12, 20]], [[-2, 6, 0, 10, -5, -6, 0, -2, -1, -7, 10]], [[4, 6, 8, 10, 12, 16, 18, 4, 0, 20]], [[90000, 2, 7, 17, 4, 6, 8, 10, 12, 17, 14, 16, 18, 20, 16, 20, 14]], [[1, 4, 6, 8, 11, 20, 16, 100000, 15, 4, 15, 8]], [[-0.5, 1.5, 3.711610788062952, -2.1, 6.4, 7.9, 6.4]], [[1, 4, 6, 8, 10, 20, 16, 100000, 15, 15, 8]], [[-3, 1, 4, 6, 8, 2, 10, 21, 14, 9, 16, 20, 20]], [[2, -7, 4, 6, 80000, 5, 100000, 12, 14, 16, 18, 0, 2]], [[-5]], [[-3, -2, -1]], [[-5, 0, 5, -10, 20, -30]], [[2.5, 3.7, 1.1, 0.5]], [[0]], [[2, 3.5, -4, 0, 5000000000]], [[0.0, 0.0, 0.0]], [[1.5, -1.5, 0.0, 2.3, -2.3]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000]], [[20000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[100000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000]], [[true, false, true, false]], [[6, 20000, 20000, 49999, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 14, 100000]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 99999]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100000, 10000]], [[-5, 70000, -3, -3, -1]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, 3]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, 3, -1, 9]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000]], [[true, false, true, false, false]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 60001, 100000, 60000, 60000]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 5, 90000, 100000]], [[10000, 20000, 90000, 40000, 60000, 70000, 80000, 2, 100000, 60000]], [[1, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -4]], [[20000, 30000, 90000, 40000, 60000, 70000, 80000, 2, 40000]], [[20000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 3, 40000]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100001, 10000]], [[3, -1, 6, 0, 10, -5, 9, 0, -2, -7, 3]], [[-0.5, 3.8, -2.1, 6.4, 7.9]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 10000, 60000]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60000]], [[6, 20000, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 90000, 100000]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 10]], [[10000, 20000, 40000, 60000, 70000, 80000, 2]], [[false, false, true, true, false]], [[-2, 3, -1, 6, 0, 10, -5, 9, 0, -2, -7, 3, 10, 10]], [[1, -2, 0, -4, 5, -6, 7, -8, 9, -10, -6]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 8, 8]], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 8, 8, 4]], [[-5, -4, -2, -1]], [[-5, 70000, -3, -2, -1]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, -6, 60000]], [[20000, 30000, 90000, 40000, 60000, 70000, 80000, 2, 40000, 2]], [[100000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000]], [[2, 11, 4, 6, 8, 10, 12, 14, -5, 16, 18, 8, 8, 4]], [[20000, 20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000]], [[-2, 3, -1, 6, 0, 10, -5, 1, -2, -7, 3, 10, 10]], [[-8, 40000, 5, 9, -2, 6, 5, 0, 1, -1, -8, 3, 0]], [[40001, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 100000]], [[-5, -3, -4, -2, -1]], [[-0.5, 3.8, -2.1, 3.2, 7.9]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 90000, 100000]], [[2, 4, 6, 8, 10, 20000, 12, 16, 18, 8, 8, 4]], [[-10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 10000, 60000]], [[2, 4, 6, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 18]], [[3, -1, 6, 0, 10, 9, 6, -2, -7]], [[-8, 40000, 5, 9, -2, 5, 0, -1, -8, 3, 3]], [[-10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 10000, 60000, 70000]], [[-3.4, -2, -0.5, 1, 3.2, 5.9]], [[3.8, -2.1, 6.4, 8.002455154762643]], [[10000, 20000, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60000]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, 3, 2, 9]], [[true, false, true, false, false, false]], [[true, false, false, true, true, false]], [[2, 11, 4, 6, 8, 10, 12, 14, -5, 16, 8, 8, 4, 11]], [[2, 4, 6, 10, 12, 14, 16, 18, 7]], [[10000, 20000, 10000, 40000, 70000, 29999, 2, 60001, 100000, 60000, -6, 60000]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 100000, 60000, -6, 60000, 10000, 70000]], [[60001, 1, -2, 0, -4, 5, -6, 7, -8, 9, -10, -6]], [[1, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -4, -10, 5]], [[6, 2, 20000, 49999, 30000, 90001, 40000, 50000, -6, 60000, 70000, 80000, 90000, 100000]], [[-5, -4, -2, -1, -4]], [[-3.4, -0.5, 1, 6.4, 5.9]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 8, 8]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8]], [[20000, 30000, 90000, 50000, 40000, 60000, 70000, 80000, 2, 40000]], [[1, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10]], [[6, 2, 20000, 49999, 30000, 12, 50000, -8, 60000, 70000, 80000, 90000, 100000]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60001, 60001]], [[-3.4, -2, -0.5, 1, -0.5135530221691029, 3.2, 5.9, 8.6]], [[2, 4, 6, 8, 10, 14, 16, 18, 8, 8, 6]], [[2, -2, 3, -4, 5, -6, 7, -8, 9, -10]], [[10000, 20000, 30000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000]], [[20000, 20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000, 70000, 50000]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 100000]], [[6, 2, 20000, 49999, 30000, 12, 50000, 50001, -8, 60000, 70000, 80000, 90000, 100000]], [[6, 2, 20000, 49999, 30001, 40000, 50000, -6, 60000, 70000, 80000, 90000, 49998, 100000, 60000]], [[60001, 1, -2, 0, -4, 5, -6, 7, -8, 9, -10, -6, -2]], [[20000, 20000, 7, 18, 30000, 40000, 50000, 70000, 80000, 90000, 100000]], [[-3.4, -2, -0.5, 1, 3.2, 5.9, 7.9]], [[60001, 1, -2, 0, -4, 5, -6, 7, 60002, -8, 9, -10, -6]], [[2, 4, 6, 10, 12, 14, 16, 18, 30000, 7, 14]], [[-0.5, 3.8, -2.1, 3.2, 7.9, -0.5]], [[false, true, true, true, false, false]], [[-0.5, 3.8, -2.1, -2.1, 3.2, 7.9]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 40000]], [[true, false, false, true, true, false, false]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 100000, 49999]], [[0, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -4, -6]], [[10000, 20000, 40000, 60000, 70000, 80000, 90000, 99999]], [[20000, -1, 90000, 40000, 60000, 70000, 80000, 2, 40000]], [[10000, 20000, 30000, 2, 40000, 60000, 80000, 2, 100001, -1]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -1, -8, 3, -1, 3]], [[true, false, false, false, false]], [[10000, 20000, 30000, 2, 40000, 60000, 80000, 2, 100001, -1, 2]], [[-10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000]], [[false, true, true, false, false]], [[100000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 30000, 60000]], [[-0.5, 3.8, -2.1, 3.2, 9.406367499891232, 3.2]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 100000, 60000, -6, 60000, 10000, 7]], [[true, false, false, true]], [[true, true, false, false, false]], [[1, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -10, 5]], [[10000, 20000, 10000, 70000, 29999, 2, 60001, 100000, 60000, -6, 60000]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 30000]], [[10000, 20000, 30000, 2, 40000, 80000, 2, 100001, -1, -1]], [[-5, 40001, -4, -2, -1]], [[10000, 20000, 40000, 60000, 70000, 29999, 2, 100000, 60000, 60000]], [[3.8, -2.1, 9.406367499891232, 3.2, 7.9]], [[10000, 20000, 60000, 70000, 2]], [[1, -2, -8, 3, -4, 5, -6, 6, 7, -8, 9, -10]], [[20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000, 70000, 50000]], [[8, 7]], [[3, -1, 6, 0, 10, -5, 9, -2, -7, 3]], [[10000, 20000, 40000, 60000, 70000, 29999, 2, 100000, 9999, 60000, 60000]], [[-8, 40000, 5, 9, -2, 6, 5, 0, 1, -1, -8, 3, 0, 0, -1]], [[-8, 5, 9, -2, 6, 5, 0, -1, -8]], [[true, false, true, false, false, false, false]], [[10000, 20000, 30000, 2, 60000, -2, 9, 70000, 80000, 2, 40000]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 40000, 20, 80000]], [[6, 2, 20000, 10000, 30000, 40000, 50000, -6, 60000, 70000, 80000, 90000, 100000]], [[1, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10, 7]], [[-5, -2, -1, -2]], [[20000, 20000, 7, 30000, 40000, 70000, 70000, 80000, 90000, 100000, 70000, 50000, 80001]], [[-5, 70000, -3, -3, -1, -3]], [[10000, 20000, 30000, 40000, 90000, 60000, 70000, 12, 90000]], [[-0.5, 3.8, -2.1, 7.9, -0.5]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 60001, 60000, 60000]], [[2, 18, 6, 8, 10, 20000, 12, 16, 18, 8, 8, 4]], [[10000, 20000, 30000, 2, 40000, 80000, 2, 100001, -1]], [[-0.5, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5]], [[100000, 20000, 40000, 60000, 70000, 80000, 2, 100000, 30000, 60000]], [[3, -1, 6, 0, 0, -5, 9, 0, -2, -7, 3]], [[6, 20000, 49999, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[2, 4, 6, 8, 10, 20000, 16, 18, 8, 4, 18]], [[-3.4, -2, -0.5, 7.9, 7, 5.9, 7.9]], [[2, 30000, 4, 6, 8, 10, 30001, 14, -5, 16, 8, 8, 4, 11, 8]], [[20000, 20000, 30000, 40000, 60000, 70000, 80000, 90000, 100000]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12, 4]], [[10000, 20000, 30000, 2, 40000, 60000, 80000, 2, 100001, -1, 2, 2]], [[-2, 3, -1, 6, 0, 10, 20, -5, 1, -2, -7, 3, 10, 10]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, 3.2, 7.9]], [[true, -3, -1, -3, -1]], [[-5, 70000, -3, -3, -4, 0]], [[10000, 20000, 30000, 40000, 50000, 60000, 2, 80000, 90000, 100000, 80000]], [[10000, 20000, 30000, 40000, 50000, 60000, 2, 80000, 90000, 100000, 80000, 90000]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100001, 10000, 60000]], [[true, true, false]], [[true, false, false, true, true, false, false, true, true]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 7, 4, 90001, 8, 8, 12, 4]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 7, 8, 12, 4]], [[20000, 10000, 40000, 70000, 9999, 2, 60001, 100000, 60000, -6, 20000, 60000]], [[20000, 20000, 7, 18, 30000, 40000, 50000, 11, 80000, 90000, 100000]], [[14, 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[100000, 20000, 100000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 30000, 60000]], [[10000, 40000, 70000, 9999, 2, 60001, 100000, 60000, -6, 20000, 60000]], [[10000, 20000, 30000, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, -6]], [[-10, 10000, 20000, 30000, 40000, 50001, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000]], [[14, 10000, 30000, 40000, 50000, -10, 60000, 70000, 80000, 90000, 100000]], [[true, true]], [[20000, 20000, 30000, 40000, 60000, 70000, 80000, 90000, 3, 40000]], [[1, -2, -8, 3, -4, 5, -6, -5, 6, 7, -8, 9, -10]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 70000, 14, 100001, 10000]], [[8.6, -0.5, 3.8, -2.1, 3.2, 7.9, -0.5, 3.2, 8.6]], [[100000, 20000, 100000, 30000, 40000, 60000, 70000, 14, 2, 100000, 30000, 60000]], [[10000, 20000, 30000, 2, 40000, 60000, 80000, 2, 100002, -1, 2, 2, 2]], [[1.5, 3.8, -2.1, 7.9, 3.8]], [[2, 4, 30000, 4, 6, 8, 10, 30001, 14, -5, 16, 8, 8, 4, 11, 8]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 90000, 49998, 100000, 60000]], [[true, false, false]], [[40000, 70000, 9999, 2, 60001, -10, 60000, 7, 20000, 60000]], [[-3.4, -2, 8.6, 1, 3.2, 5.9, 8.6]], [[1, -2, 0, -4, 5, -6, 7, -8, 9, -10, -6, -6]], [[10000, 30000, 40000, 60000, 70000, 80000, 2, 40000]], [[-10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000, 6]], [[20000, 20000, 30000, 50000, 60000, 70000, 80000, 90000, 100000]], [[20000, 20000, 7, 18, 30000, 40000, 50000, 40000, 70000, 80000, 90000, 100000]], [[4, 2, 4, 6, 8, 10, 12, 14, 16, 18, -6, 8, 8, 4, 4]], [[6, 2, 20000, 10000, 30000, 40000, 50000, -6, 60000, 2, 80000, 90000, 100000]], [[-3.4, -0.5, 3.8, 3.2, 7.9, -0.5]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, 3.2, 7.9, -0.694286281155515]], [[-5, 70000, -3, -2, -1, -1]], [[10000, true, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60000, 60001]], [[3.8, -2.1, 9.406367499891232, 3.2, 7.9, -2.1]], [[true, false, true, false, true, true, false]], [[3, -10, 10000, 20000, 30000, 40000, 50001, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000]], [[-4, -2, -1]], [[3, -1, 0, 10, -5, -2, -7, 3, 0]], [[20000, 70000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100001, 10000, 59999]], [[10000, 20000, 30000, 40000, 50000, 70000, 80000, 90000, 100000, 20000]], [[1, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -4, 1]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, 3.2, -0.7414188614596702, 7.9, -0.694286281155515]], [[20000, 30000, 40000, 50000, 60000, 2, 80000, 90000, 100000, 80000]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 10000, 60000, 60000]], [[20000, 20000, 30000, 50000, 59999, 60000, 70000, 80000, 60000, 100000]], [[10000, 20000, 30000, 40000, 70000, 29999, 2, 100000, 60000, -6, 60000, 10000, 70000]], [[100000, 6, 30000, 40000, 60000, 70000, 80000, 2, 100000]], [[false, false, true, true, true, false, false]], [[10000, 40000, 69999, 9999, 2, 60001, 100000, 60000, -6, 20000, 60000, 60000]], [[2, -2, 3, -4, 5, -6, 7, -8, 9, -10, 9]], [[20000, 20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 50000, 80001]], [[10000, 20000, 30000, 40000, 50000, 60000, 2, 80000, 90000, 100000, 80000, 90000, 20000]], [[50001, 6, 2, 20000, 49999, 30000, 12, 50000, 50001, -8, 60000, 70000, 80000, 90000, 100000]], [[-4, -2, -1, -4]], [[-4, true, -1, -1]], [[20000, 20000, 30000, 14, 50000, 60000, 70000, 80000, 90000, 100000, 80000]], [[true, false, false, true, false, false]], [[4, 6, 8, 10, 10, 20000, 16, 18, 8, 4, 18, 10]], [[-0.5, 6.4, 5.9]], [[10000, 20000, 40000, 60000, 70000, 29999, 2, 30001, 100000, 60000, 60000]], [[-5, -4, -3, -1]], [[false, true, true, true, false]], [[-10, 10000, 20000, 30000, 40000, 50001, 60000, 70000, 79999, 2, 100000, 60000, 6, 60000]], [[true, true, true]], [[20000, 20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000, 70000, 50000, 100000]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, -1, 9, -8, -8]], [[7, 7, 7, 7]], [[-2.1, 3.2, 7.9, -2.1]], [[-5, 12, 70000, -3, -3, -4, 0, 70000]], [[10000, 20000, 30000, 40000, 60000, 70000, 80000, 50000, 100000, 60000, 10000, 60000]], [[true, false, true, false, false, false, true, false]], [[60001, 1, -2, 0, -4, 5, -6, 7, 60002, -8, 49999, -10, -6, -4]], [[10000, 30000, 60000, 70000, 80000, 2, 40000]], [[2, 4, 100001, 8, 10, 20000, 12, 16, 18, 8, 7, 4, 90001, 8, 8, 12, 4, 18]], [[3, 7]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, -0.5, -0.7414188614596702, 7.9, -0.694286281155515]], [[40000, 70000, 9999, 2, 60001, -10, 60000, -5, 7, 20000, 60000]], [[10000, 20000, 40000, 59999, 60000, 70000, 30000, 2, 100000, 9999, 60000, 60000]], [[-2.417196937882896, -2, -0.5, 1, 3.2, 5.9, 7.9]], [[7, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000]], [[false]], [[-0.5, 3.8, -2.1, 3.2, 7.9, -0.5, 3.8]], [[1, -2, 3, -4, -1, -1, -6, 7, -8, 9, -10, -4]], [[2, 4, 100001, 8, 9999, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100002, 10000]], [[2, -4, -1, -5]], [[2, -2, 3, -4, 5, -6, -6, 7, -8, 9, -10]], [[2, 4, 100001, 8, 9, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12]], [[10000, 20000, 40000, 70000, 2, 100000, 9999, 60000, 60000]], [[14, 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90001, 100000]], [[-10, 10000, 20000, -8, 40000, 60000, 70000, 80000, 2, 100000, 60000, 10000, 60000]], [[100000, 20000, 100000, 30000, 40000, 60000, 70000, 60001, 2, 100000, 30000, 60000]], [[2, -2, 3, -4, 5, -6, -6, 7, -8, 9, -10, -8]], [[10000, 49999, 10001, 20000, 30000, 40000, 60000, 70000, 14, 100001, 10000, 60000]], [[50001, 6, 2, 20000, 49999, 30000, 12, 50000, 50001, -9, 60000, 80000, 90000, 100000]], [[3, -10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000, 30000]], [[20000, 20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 50000, 80001, 70000]], [[6, 20000, 20000, 49999, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 30000]], [[6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 90000, 49998, 40000, 100000, 60000]], [[10000, true, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60000, 60001]], [[1, -2, 3, -4, -1, -4, 5, 2, 7, -2, -8, 9, -10, -4, 1]], [[50001, -3, 6, 2, 20000, 49999, 30000, 12, 50000, 50001, -8, 60000, 70000, 80000, 90000, 100000]], [[-4, true, true, -1]], [[1, 49998, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10, 7, 7]], [[1, -2, 3, -4, -1, 5, -6, 7, -8, 9, -10, -10, 5, -10]], [[5, 10000, 40000, 70000, 29999, 2, 60001, 100000, 60000, -6, 60000, 40000, 10000]], [[4, 4, 60001, 8, 3, 10, 12, 14, 16, 18, -6, 8, 8, 4, 4]], [[10000, 20000, 30000, 2, 60000, -2, 9, 80000, 2, 40000]], [[20000, 20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000, 70000, 50001, 100000, 20000]], [[10000, 20000, 30000, 40000, 90000, 60000, 70000, 12, 90000, 90000]], [[false, true, false, false, true, false, false]], [[-8, 40000, 5, 9, -2, 6, 6, 0, -1, -8, 3, -1, 9, 0]], [[10000, 20000, 30000, 60000, 70000, 80000, 2]], [[2.5111971756682676, -0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, 3.2, 7.9]], [[false, false, true, true, true, true, false]], [[14, 10000, 20000, 30001, 40000, 50000, 60000, 70000, 80000, 90000, 100000]], [[true, true, true, true]], [[2, 4, 8, 9, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12]], [[9999, 7]], [[1, 90001, -2, 0, -4, 5, -6, 7, -8, 9, -10, -6, 9]], [[2, 4, 100001, 8, 9999, 10, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 9, 8, 12, 8, 8]], [[10000, 20000, 30000, 7, 2, 40000, 60000, 80000, 2, 100002, -1, 2, 2]], [[3, -1, 6, 0, 10, 9, 6, -2, -7, 6]], [[10000, 20000, 40000, 70000, 2, 1, 100000, 9999, 60000, 60000]], [[2, 4, 100001, 8, 9999, 11, 20000, 12, 16, 18, 8, 8, 4, 90001, 8, 8, 12]], [[40000, 70000, 60001, -10, 60000, -5, 7, 20000, 60000, 60001]], [[20000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000]], [[1, 40001, 49998, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10, 7, 7]], [[-3.4, -2, -0.5, 1, 3.2, 5.9, -3.4]], [[60001, 1, -2, 0, -4, 5, -6, 7, -8, 49999, -6, -4, 60000]], [[2, -2, 3, -4, 5, -6, -6, 7, -8, 9, -10, -10, 2]], [[40000, 70000, 60001, -10, 60000, -5, 7, 20, 20000, 60000, 60001]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, -0.7414188614596702, 7.9, -0.694286281155515]], [[-0.694286281155515, 3.8, -2.1, 3.2, 7.9, -0.5, -0.5, -0.7414188614596702, 7.9, -0.694286281155515, 7.9, -0.5]], [[-0.5, 3.8, -2.1, 1.5, 3.2, 7.34483500474661, -0.7414188614596702, 3.8, 1.5]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, -1, 9, -8, -8, 40000]], [[1, -2, -3, 3, -4, -1, -1, -6, 7, -8, 9, -10, -4, 3, -4]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 100000]], [[-3.4, -2, -0.5, 1, 3.2, -1, 5.9]], [[-5, 100001, 70000, -3, -2, -1]], [[-10, 10000, 20000, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000, 7, 6, 10000]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 100000, 60000, 10000, 60000, 60000, 40000]], [[10000, 20000, 40000, 6, 70000, 59999, 2, 100000, 9999, 60000, 60000]], [[1.5, 3.8, -2.1, 7.9, 3.8, 3.8]], [[10000, 20000, 30000, 40000, 50000, 60000, 70000, 5, 90000, 90000, 100000]], [[6, 6]], [[7, 3, -1, 6, 0, 10, -5, 9, 60002, 0, -2, -7]], [[2, 4, 30000, 4, 6, 10, 30001, 14, -5, 16, 8, 8, 4, 11, 8]], [[-10, 70000, 7, 30000, 40000, 50000, 70000, 80000, 90000, 100000]], [[-78, -17, 90, 16, -35, -6, -8, 4, 49, 40001]], [[69999, -5, 70000, -3, -2, -1]], [[false, true, true, true, false, false, false]], [[-5, -4, -3, -2, -1, -2, -4]], [[-4, -3, -2]], [[-3.4, -2, -0.5, 7.9, 7, 5.9, 6.4, 7.9]], [[20000, 20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 80001, 70000]], [[-2, 3, -1, 90001, 0, 10, 20, -5, 1, -2, -7, 10, 3, 10, 10]], [[2, 4, 30000, 4, 6, 8, 30001, 14, -5, 16, 8, 8, 4, 11, 8]], [[20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 50000, 80001]], [[10000, 20000, 10001, 30000, 40000, 60000, 70000, 29999, 2, 100000, -78, 60000, -6, 60000, 10000, 70000]], [[-10, 10000, 20000, 30000, 40000, 50001, 60000, 70000, 79999, 2, 100000, 60000, 6, 60000, 20000, 20000]], [[10000, 20000, 30000, 40000, 60000, 70000, 2, 60001, 60000]], [[3, -10, 10000, 20000, 30000, 40000, 50001, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000, 60000]], [[10000, true, 60000, 29999, 2, 60001, 100000, 60000, 60000, 60001]], [[20000, 20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 49999, 80001, 70000]], [[1, -2, 3, -4, 5, -6, 7, -8, 8, 9]], [[-5, -2, -1]], [[3, -6, -1, 6, 0, 10, -5, 9, 0, -2, -7, 3, 6]], [[-2, -1]], [[10000, 30000, 20000, 30000, 40000, 90000, 60000, 70000, 12, 90000]], [[true, false, false, false, true]], [[19999, 6, 2, 20000, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 100000]], [[false, false, true, true, false, false, false]], [[7, 30000, 40000, 60000, 70000, 80000, 2, 100000, -8, 60000]], [[10000, 20000, 30001, 40000, 60000, 70000, 29999, 2, 60001, 100000, 60000, 60001, 60001]], [[4, 2, 4, 6, 8, 10, 12, 14, 16, 18, -6, 8, 8, 30000]], [[10000, 40000, 20000, 40000, 60000, 70000, 80000, 90000, 99999]], [[2, 4, 6, 8, 10, 20000, 16, 18, 8, 4, 18, 2]], [[1, -2, 3, -4, 5, -6, 7, -9, -8, 8, 9, -10, 7]], [[10000, 20000, 40000, 60000, 70000, 80000, 2, 60000, 20000]], [[-10, 10000, -5, 30000, 40000, 60000, 70000, 80000, 2, 100000, 60000, 6, 60000, 6]], [[20000, 20000, 7, 30000, 40000, 50000, 70000, 14, 90000, 100000, 70000, 50000, 80000]], [[5, 10000, 40000, 70000, 29999, 2, 60001, 100000, 60000, -5, 60000, 40000, 10000]], [[20000, 20000, 7, 30000, 40000, 70000, 49999, 80000, 90000, 6, 100000, 70000, 80001, 7, 20000]], [[1, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10, 7, 3]], [[100000, 20000, 100000, 30000, 40000, 60000, 29999, 70000, 60001, 2, 100000, 30000, 60000]], [[-0.694286281155515, 4.488801273710582, -2.1, 3.2, 7.9, -0.5, -0.5, 3.2, -0.7414188614596702, 7.9, -0.694286281155515]], [[10000, 49999, 20000, 30000, 40000, 60000, 70000, 14, 100001, 59999]], [[40001, 10000, 20000, 30000, 40000, 60000, 70000, 99999, 2, 100000, 100000]], [[100000, 20000, 100000, 30000, 40000, 60000, 29999, 70000, 60001, 2, 100000, 60000, 60000]], [[100000, 6, 30000, 40000, 60000, 69999, 80000, 2, 100000]], [[0, 6]], [[-2, 3, -1, 6, 14, 0, 10, 20, -5, 1, -2, -7, 3, 10, 10]], [[10000, 1, 3, -4, 5, -6, 7, -8, 9, -10]], [[10000, 20000, 29999, 40000, 60000, 70000, 2, 100000, 60000, 10000, 60000, 60000, 40000]], [[1, -2, 3, -4, 5, -6, 7, -9, 8, 9, -10, -2, 8]], [[20000, 20000, 30000, 40000, -3, 70000, 80000, 90000, 3, 40000]], [[-8, 40000, 5, 9, -2, 6, 5, 0, -1, -8, -78, 2, 9, -8]], [[7, 3, -1, 6, 0, 10, -5, 9, 60002, 0, -2, -7, 0, -5]], [[true, true, false, false, false, false]], [[6, 20000, 20000, 49999, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000, 60000, 100000]], [[-2, -0.5, 1, 3.2, -0.5, -3.4]], [[1, 90001, 3, -4, -1, 5, -6, 7, -8, 9, -10, 19999, -10, 5]], [[10000, 20000, 10001, 30000, 40000, 60000, 70000, 29999, 2, 100000, -78, 60000, -6, 60000, 10000, 70000, 10000]], [[2, 4, 20001, 100001, 8, 10, 20000, 12, 16, 18, 8, 8, 4, 8, 8, 8]], [[100000, 20000, 40000, 60000, 80000, 80000, 2, 100000, 30000, 60000]], [[2, 4, 30000, 4, 6, 8, 30001, 14, -5, 16, 8, 8, 4, 11, 8, -5]], [[2, 4, 7, 8, 10, 20000, 16, 18, 8, 4, 18]], [[10000, 20000, 59999, 40000, 70000, 2, 1, 100001, 9999, 60000, 100000]], [[2, -2, 3, 3, -4, 5, 6, -6, -8, 9, -10, 9]], [[50001, -3, 6, 2, 20000, 49999, 30000, 12, 50000, 50001, -8, 60000, 70000, 80000, 100000]], [[true, true, true, false, false, true]], [[6, 2, 19999, 49999, 30000, 40000, 50000, -6, 60000, 70000, 80000, 100000, 49999]], [[-5, -4, -3, true, -2]], [[100000, 20000, 30000, 40000, 60000, 80000, 2, 100000]], [[10000, 20000, 30000, 40000, 50000, 60000, 80000, 2, 80000, 90000, 100000, 80000]], [[-2, -0.5, 1, -0.5135530221691029, 3.2, 5.9, 8.6]], [[-0.5, 8.6, 5.9]], [[2, -1, 3, -4, 5, -6, 90001, -8, 9, -10, -8]], [[1, -2, 3, -4, 5, -6, 7, -8, 8, 9, 90000, 7, -2]], [[-0.694286281155515, -0.5, 8.6]], [[-4, true, false, -1, -1, -1]], [[20000, 20000, 7, -10, 40000, 70000, 49999, 80000, 90000, 100000, 70000, 50000, 80001, 70000]], [[2, 4, 30000, 4, 6, 8, 10, 30001, 14, -5, 16, 8, 9, 4, 11, 8]], [[1, 40001, 49998, -2, 3, -4, 5, -6, 7, -8, 8, 9, -10, 7, 7, 8]], [[-3.4, -2, -0.5, 1, 3.2, 5.9, 7.9, 7.9]], [[20000, 30000, 90000, 50000, 40000, 70000, 80000, 2, 40000]]], "completion": "\ndef incr_list(l: list):\n \"\"\"\n Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"\n return [i+1 for i in l]\n", "raw_completion": "```python\ndef incr_list(l: list):\n \"\"\"\n Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"\n return [i+1 for i in l]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef incr_list(l: list):\n \"\"\"Return list with elements incremented by 1.\n >>> incr_list([1, 2, 3])\n [2, 3, 4]\n >>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])\n [6, 4, 6, 3, 4, 4, 10, 1, 124]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/43", "prompt": "\n\ndef pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"\n", "entry_point": "pairs_sum_to_zero", "canonical_solution": "\n for i in range(len(l)):\n for j in range(len(l)):\n if i != j and l[i] + l[j] == 0:\n return True\n return False\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 3, 5, 0]) == False\n assert candidate([1, 3, -2, 1]) == False\n assert candidate([1, 2, 3, 7]) == False\n assert candidate([2, 4, -5, 3, 5, 7]) == True\n assert candidate([1]) == False\n\n assert candidate([-3, 9, -1, 3, 2, 30]) == True\n assert candidate([-3, 9, -1, 3, 2, 31]) == True\n assert candidate([-3, 9, -1, 4, 2, 30]) == False\n assert candidate([-3, 9, -1, 4, 2, 31]) == False\n\n", "contract": "\n assert all([isinstance(v, int) for v in l]), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 3, 5, 0]], [[1, 3, -2, 1]], [[1, 2, 3, 7]], [[2, 4, -5, 3, 5, 7]], [[1]], [[-3, 9, -1, 3, 2, 30]], [[-3, 9, -1, 3, 2, 31]], [[-3, 9, -1, 4, 2, 30]], [[-3, 9, -1, 4, 2, 31]]], "atol": 0, "plus_input": [[[0, 0]], [[0, 1, -1]], [[1, -1]], [[1, -1, 0]], [[2, 4, -2, -4]], [[2, 4, -2, -4, 0]], [[2, 4, -2, -4, 6, -6]], [[-2, 2, -4, 4]], [[]], [[2, 3, 4, 5, -9]], [[2, -4, 4, -2]], [[2, 4, -2, -4, -2]], [[2, -4, 5, 4, -2, -4, 6, -6, 2]], [[0]], [[2, 4, -4, 6, -6]], [[2, 4, -2, -4, 1, -2]], [[2, 4, 5, -4, 5]], [[2, 4, -4, 6, -9]], [[2, -4, 4]], [[2, 5, 4, -2, -4, 6, -6, 2]], [[2, 4, -2, -4, 1, -2, -2]], [[-2, 2, -4]], [[-1, 75, -2, -6, -1, 26, -54]], [[0, 0, 0]], [[-2, 2, -4, 75, 4, 4]], [[2, 3, -2, -4, 0]], [[0, 1]], [[2, 3, 0, 0]], [[5, 2, -4, 4]], [[2, 4, 5, -4, 5, 4]], [[-2, -1, 6, 75, 4, 4]], [[-2, -4, 2, -4]], [[2, 3, 4, 5, -9, 3]], [[true, true, true, true, false, false]], [[-2, -4]], [[-2, 75, -2]], [[2, 2, 4, 5, -4, 5]], [[-54, 5, 4, -2, -4, 6, -6, 2]], [[-54, 5, 5, 4, -2, -4, 6, -6, 2, 2]], [[-4, 5]], [[2, 5, 4, -4, 6, -6, 2, 2]], [[2, 4, -2, -4, 1, -2, 1]], [[2, 3, 0]], [[2, 3, 4, 5, -9, 3, -9]], [[true, true, true, true, false, false, true]], [[2, -4, 5, 4, -2, 6, 75, 2]], [[2, 3, -4]], [[-4, 5, -4]], [[5]], [[2, 4, 5, -9, 3]], [[-6, -54, 5, 4, -2, -4, 6, -6, 2]], [[-2, 2, 1, -4, 4]], [[2, 4, -4, 0]], [[2, 3, -2, 0]], [[2, 4, 5, -9, 3, 4]], [[-2, -1, 6, 75, 4, 4, 75]], [[2, -4]], [[2, 4, -2, -4, -3]], [[-4, 5, -3, -4, -4]], [[0, 0, -1]], [[-1]], [[-2]], [[2, 6, 4, -2, -4, 6, -6, 2]], [[2, 4, -4, -5, 0, 2]], [[0, 0, -1, 0]], [[-4, 5, -4, -4]], [[false, true, false, true, true, true, false, false, true]], [[-2, 75, 75]], [[2, 6, 4, -2, -4, 6, -6, 2, -4]], [[5, 5, 2, -4, 4]], [[2, -2, -6, 0, 2]], [[-2, 75, 75, -2]], [[-2, 2, 1, 1, -4, 4]], [[2, 2, 4, -4, 5]], [[2, 6, 4, -2, -4, 6, -6, 2, -4, 6]], [[2, 4, 5, -9]], [[5, 2, 4, -4, 5, 4]], [[true, true, true, false, false, false, true]], [[1, -54, -1]], [[2]], [[-1, 75, -2, -6, -1, 26, -54, 75]], [[2, 3, 4, -9, 3]], [[2, 3, -8, 4, 2, -9, 3]], [[-2, -2, 26]], [[-1, 5]], [[5, 5]], [[26, -2, 2, -4]], [[-2, 2, 1, -4, -4, 4]], [[2, 4, 6, -4, 5, 4, 4]], [[-4, 5, -2, -3, -4, -4]], [[-2, 0, -4]], [[2, 6, 4, -2, 6, -6, 2, -4, 6]], [[4, -2, -4]], [[-4, 5, -3, -4, -4, 5]], [[-4]], [[2, 6, 4, 3, -4, 6, -6, 2, -4, -4]], [[0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -5]], [[1, 2, 3, -1, -2, -3, -4, -5, 6, 7, 8, 9, -6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[10, -10, 5, -5, 3, -3, 1, -1]], [[0, 0, 0, 0, 0, 0, 0, 0]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10]], [[1, 2, 3, 4, 5, 6, -7, -8, -9, -10, -11, -12]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 2, 14]], [[1, 2, 3, -70, 5, 6, -7, -8, -9, -10, -11, -12, 5]], [[10, 5, -5, 3, -3, 2, -1]], [[10, -2, -10, 5, -5, 3, -3, 1, -1]], [[1, 2, 3, -70, 5, 6, -7, -8, 6000, -10, -11, -12, 5]], [[10, 5, 3, 5000, -3, 2, -1, 2]], [[3, 10, 5, -5, 3, -3, 2, -1, 3]], [[1, 2, 3, -70, 5, 6, -5000, -7, -8, 6000, -10, -11, -12, 5, -8]], [[0, 0, 0, 0, 0, 0, -1, 0, 0]], [[1, 2, 3, -70, 5, 6, -7, -8, 6000, -10, -11, 5000, 5]], [[10, -2, 5, 5, -5, 3, -3, 1, -4]], [[0, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0]], [[1, 1, 50, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1]], [[10, -5, 7, 3, -4, -1, 0, -9, 2, 14]], [[0, 1, 0, 0, 0, 100, 0, 0, 0, -1, 0, 0, -1]], [[10, -2, 5, 5, -5, 3, -3, 1, -4, -2]], [[3, 10, 5, -5, 3, -3, 2, -6, -1, 3, 5]], [[3, 10, 5, -5, -3, -6, -1, 3, 5]], [[3, 10, 5, -5, 3, -3, 2, -6, -1, 3, 5, 3]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -11, -12, 5]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, -8, 6000, -10, -11, -12, 5, -8]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -4, -3, -2, -1]], [[3, 10, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3]], [[1, -2, 1, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 9000, 0]], [[3, 10, 5, -5, 3, -3, 2, 7000, -1, 3, 6]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -11, -12]], [[0, 5, 1, -1, -2, 3, -3, 4, -4, 5, -5, -2]], [[10, 5, -5, 2, -3, 2, -1]], [[10, 3, 5000, -3, 2, -1, 2]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, 0, -1]], [[1, 2, 3, -70, 5, -9, -13, 10, -7, -8, 6000, -10, -12, 5]], [[3, -6000, 5, -5, 3, -3, 2, -1, 3]], [[1, 2, 3, -70, 5, -9, -13, 10, -7, -8, 6000, -10, -12, 5, -9]], [[10, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[10, -2, -10, 5, -5, 3, -3, 1, 30, -1, -1]], [[10, -5, 7, 3, -4, -1, -9, 2, 14]], [[0, 0, 0, 0, 0, 1, 0, 0, 9000, 0, 0]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[3, -6000, 5, 3, -3, 2, 2, -1, 3]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, -1, 80, -1, -2, -1, -1, -2]], [[10, -2, 5, 5, -5, 3, -3, 1, -4, -2, 10]], [[1, -2, 1, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1, -1]], [[1, 2, 3, -70, 5, 6, -7, -8, 6000, -10, -12, 5000, 5, 5]], [[10, 5, 3, 5000, -3, -30, 2, -1, 2, -3]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, -1, 80, -1, -2, -2, -1, -1, -2]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3]], [[11, 90, 3, 5000, -3, 2, -1, 2]], [[1, 1, 6, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[1, 1, 1, 1, 1, 5, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[1, 2, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8]], [[10, 4, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3]], [[0, 1, 0, 0, 0, 0, 0, 1, 0, 0]], [[1, -2, 1, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -2, -1, -1]], [[1, 2, 3, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -70]], [[1, 1, 50, 1, 1, 80, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1]], [[0, 1, 7000, -1, 0, 0, 100, 0, 0, 0, -90, -1, 0, 0, -1]], [[1, -10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8]], [[1, 2, 3, 5, 10, -7, -8, 6000, -10, -11, -12]], [[10, 4, 5, -5, 3, -3, -12, -7, -1, 3, 5, 3]], [[0, 1, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, -1]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[0, 1, -1, -2, 3, -3, 4, -4, 5, -5]], [[1, 2, 3, -69, 5, 10, -7, -8, 6000, -10, -11, -12]], [[1, -2, 1, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1, -1, -1]], [[0, 1, 0, 0, 0, 0, 1, 0, 0]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, -5]], [[1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 80, -1, -2, -2, -1, -1, -2]], [[1, 3, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -10]], [[3, 10, -5, 3, 4, -3, 2, -1, 3, 3]], [[9, 5, -5, 3, -3, -6, 3, 5, 3, -5]], [[1, -2, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 1]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, 0, -1, 0]], [[1, 3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1000]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2, 10]], [[1, -2, 1, 1, 1, 10000, -5, 2, 1, -1, 80, -1, 9000, -1, -1, -1, -1]], [[10, 10, -2, -10, 5, -5, 3, -3, 1, -1]], [[2, 2, 3, -70, 6, -8, -9, -10, -11, -12, 5]], [[9, 5, 3, -3, -12, -6, 3, 5, 3]], [[0, 1, 0, 0, 100, 0, 0, 0, -1, 0, -1, -1, 0, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, -6, -4, -3, -2, -1]], [[1, 2, 3, -70, 5, -9, 9, -7, -6000, 6000, -10, -12, 5, -9, -70]], [[10, -2, 5, 4, -5, 3, -3, 4000, 1, -2, 10]], [[3, 10, -5, 3, 4, -3, 2, 10, 3, -1, 3, -1000, 3]], [[1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 80, 1]], [[1, 3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1000, -9, 5]], [[9, 5, 3, -9, -3, -12, -1, 3, 5, 3, -5]], [[10, -2, 5, -5, 3, -3, -3, 1, -4, -2]], [[10, -2, 5, 4, -5, 3, -3, 4000, 1, -2, 10, 5]], [[4, 1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 80, 1]], [[1, 2, 3, -70, 5, -9, -100, -7, -8, 6000, -10, 2000, 5, -9, -70]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 10000, 80, -1, -2, -2, -1, -1, -2]], [[3, 10, 4, 5, -5, 3, -3, 2, -6, -1, 2, 5]], [[3, 5, -5, 3, -3, 2, 7000, -1, 3, 6]], [[1, -10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8, 3]], [[10, -2, 5, -5, 3, -3, -3, 1, -4, -2, -2, -2, -5]], [[3, 10, 5, -5, -3, -1, 3, 5]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 0]], [[9, 5, 3, -9, -3, -12, -1, -10, 5, 3, -5]], [[9, 5, 3, -3, -12, -6, 5, 3]], [[3, -6000, 5, 3, -3, 2, -1, 2]], [[1, 2, 3, -70, 5, -12, -9, -100, -7, -8, 6000, -10, 2000, 5, -9, -70]], [[-8, 1, 2, 3, -70, 5, -7, -8, 6000, -10, -11, 5000, 5]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 80, -1, -2, -1, -1, -2]], [[11, 90, 3, 5000, -3, 1, 2, -1, 2]], [[4, 1, -2, 1, -3, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 80, 1]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 0, 1]], [[1, 1, 6, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[9000, 1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -11, -12, 5]], [[3, 10, 5, -70, -5, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[3, 10, 5, -5, 3, -3, 2, -6, -1, 3, 5, 3, -1]], [[81, 1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 80, 1]], [[9, 5, 3, -9, -3, -12, -1, 3, 5, 3, -9]], [[4, 1, -1, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, 80, 1]], [[10, -2, 5, 4, -5, 3, 11, -3, 4000, 30, 10]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[1000, -1000, 2000, -2000, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[1, 2, 3, 4, 5, 6, -7, -8, -10, -10, -3, -11, -12]], [[7, 1, 1, 6, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[1, 2, 3, 3, 5, -7, -8, -9, -10, -11, -12]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, -7, -4, -3, -2, -1]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, -8, 6000, -10, -11, -12, 5, -8, -12]], [[1, -2, -50, 1, 80, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1, -1]], [[1, -2, 1, 1, 1, 10000, -10000, 2, 1, 1, 8, -1, 80, -1, -2, -2, -1, -1, -2]], [[1, 1, 50, 1, 2, 2, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1]], [[0, 1, 7000, -1, 0, 0, 100, 0, 0, 0, -90, -1, 0, -1]], [[0, 1, 7000, 0, -1, 0, 100, 0, 0, 0, -1, 0, 0, -1, 0]], [[99, 0, 1, 0, 0, 100, 0, 0, 0, -1, 0, -1, -1, 0, 1, -1, 1]], [[10, 5, -5, -3, -12, -1, 3, 5]], [[1, 3, 99, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -10]], [[-8, 1, 2, 3, -70, 5, -7, -8, 6000, -10, -11, 5]], [[3, 10, 5, -5, 3, -3, -6, -1, 3, 5, 3]], [[9, 5, 3, -9, -12, -12, -1, 3, 5, 3, -9]], [[1, 3, 99, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -10, 99]], [[50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[1, -10, 3, -70, 6, -5000, -7, -8, 6000, -11, -12, -8, 3]], [[10, -2, 5, 3, -3, 1, -2, 10]], [[10, 5, -5, -12, -3, 2, -1, 5]], [[1001, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[1000, -1000, 2000, -2000, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -4, 8000, -8000, 9000, -9000, 10000, -10000, -1000]], [[11, 3, 5000, -3, 2, -1, 2]], [[1, 2, 3, -70, 5, -9, 9, -6000, 6000, -10, -12, 5, -9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 9]], [[-10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8]], [[10, -10, 5, -5, 3, 1, -1]], [[0, 0, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 0, 1]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, -5, -12]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, 2001, -9000, 10000, -10000]], [[4, 1, -2, 1, 1, 1, 10000, -5, 2, 1, -1, 80, -1, -1, -1, -1, -1, 1, -2]], [[3, 10, 5, -5, 4, 3, -3, 2, -1, 3, 5, 3]], [[5, 10, 4, 5, -5, 3, -3, -12, -7, -1, 3, 5, 3]], [[1, -10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8, 3, 1]], [[3, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -10, -9]], [[1, 2, 4, 5, 6, -7, -8, -9, -10, -11, -12]], [[0, 0, 0, 0, 0, 0, -1, 0]], [[0, 1, 7000, -1, 0, 0, 100, 0, 0, 0, -90, -1, 0, 0, -1, -1]], [[10, 5, -5, -3, -12, -1, 3, 5, -3]], [[10, -2, 5, -2, -5, 3, -3, -3, -4, -2]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 9, 7]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 9000, 0, 0]], [[10, 4, 5, -5, 3, -3, -12, -1, 3, 5, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -5]], [[1, 3, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1000, -9, 5]], [[5, -5, -3, -12, -1, 50, 3, 5, -3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, 81, -4, -3, -2, -1]], [[0, 0, 0, 0, 0, 1, 0, 0, 9000, 0]], [[10, 5, 3, 5000, 5000, -3, 2, -1, 2, 5000]], [[3, 10, 5, -5, 3, -4, -6, -1, 3, 5, 3, 5]], [[10, 4, 5, 8000, -5, 3, -3, -12, -6, -1, 3, 5, 3, 10, -12]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, -7, -4, -4, -3, -2, -1]], [[1, 2, 3, 4, 5, 6, -7, -8, -10, -10, -3, -11, -12, 4]], [[10, -50, -3, 3, 1, -2, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -5, -1]], [[3, 10, 5, -5, 4, 3, -3, 2, -1, 3, 6, 3]], [[9, 5, 3, 5, -9, -3, -12, -1, 3, 5, 3, -5]], [[1001, -1000, 2000, -2000, 3000, 81, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[0, 1, 7000, -1, 0, 0, 0, 0, 0, -90, -1, 0, 0, -1, -1]], [[1, 3, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1000, -9, 5, -9]], [[10, -2, 5, 3, -2, 10]], [[1, 2, 3, 5, -12, -9, -100, -2000, 6000, -4, 2000, 5, -9, -70]], [[1, 3, -70, 5, 10, -7, -8, 6000, -10, -11, -12, 5, 1]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8000, -9000, 10000, -10000]], [[0, 0, 0, 0, 0, 1, 0, 0]], [[1, 1, 50, 1, 1, 80, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1]], [[10, 4, 5, 8000, -5, 3, -3, -12, -6, -1, 3, 2001, 5, -6000, 10, -12]], [[1, 1, 3000, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 2, -1, -1]], [[2, 2, 3, -70, 5, -9, -13, 10, -7, -8, 6000, -10, -12, 5, -10]], [[-4, 10, 5, 3, 5000, -3, -30, 2, -1, 2, 0, -6, -3]], [[9, 5, 3, -9, -3, -12, -1, 3, 5, 3, -9, -3]], [[1, -10, 3, -70, 6, -5000, -7, -8, 1, 6000, -10, -11, -12, -8, 3, 1, -5000]], [[3, 10, 5, -70, 10, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[0, 1, -1, 2, -2, 3, -3, 4, -4, -5]], [[-11, 50, 1, 1, 80, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1]], [[4, 1, -2, 1, -3, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, -2, 81, 1]], [[10, 5, -5, 2, -3, 2, 0]], [[1, 2, 3, -70, 5, 6, -7, -8, 6000, -10, -11, 5000, 5, -11]], [[81, 1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, -1, -1, -1, -1, -1, 80, 1, 1]], [[3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1000]], [[-8, 1, 2, 3, 3000, -70, 5, -7, -8, 6000, -10, -11, 5000]], [[11, 3, 5000, -3, 4999, 2, -1, 2, 4999]], [[1, 1, 3000, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 2, -1, -1, 1]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2, 10, -3]], [[3, 10, 5, -70, 10, 3, 7, -3, -12, -6, -1, 3, 5, 3, 3, -6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, -5, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -5]], [[1000, 1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, 3000]], [[1, -10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -1, -8, 3, 1]], [[3, 10, 5, -5, 4, 3, -3, 2, -1, 3, 5, 3, 5]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2, 4, 10]], [[-11, 50, 1, 1, 80, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1]], [[9, 5, 3, 2001, -12, -1, 3, 5, 4, -9]], [[1, 2, 3, 5, -12, -9, -100, -2000, 6000, 2000, -4, 2000, 5, -9, -70, -9]], [[-3, 10, 5, -5, -3, -6, -1, 3, 5, -5]], [[9, 1001, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, -5]], [[9000, 1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -12, -12, 5]], [[1, 1, 50, 1, 2, 2, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[10, -2, 5, 3, -2, 10, 10]], [[10, -2, 5, 4, -6, 3, -3, 4000, 1, -2, 10, 5, 3]], [[3, 10, 5, 10, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[3, 10, 5, -5, -3, -6, -1, 4, 5]], [[0, 1, 7000, -1, 0, 5, 0, 100, 0, 0, 0, -90, -1, 0, -1]], [[-9, 0, 1, 0, 0, -10, 0, 1, 0, 0]], [[4, 5, -5, 3, -3, -12, -7, -1, -1, 3, 5, 3]], [[-11, 50, 1, 1, 80, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1]], [[9, 5, 3, -9, -3, -12, 4, -1, 3, 5, 3, -5]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, -1, 0, -1, 0, 1]], [[3, -5, 3, 4, -3, 2, -1, 3, 3]], [[0, 1, -1, 10, -2, 3, -3, -4, 5, -5]], [[3, 10, 5, -80, 2, -3, 2, 0]], [[10, -2, 5, -5, 3, -3, -3, -2, -2]], [[0, 0, 0, 0, 0, 1, 7, 0, 0, 9000, 0, 0]], [[0, 1, -1000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 1, 1]], [[10, 5, -5, 2, -3, 2, 0, -3]], [[2, 3, -70, 5, -9, -14, 10, -7, -8, 6000, -10, -12, 5, -9, 2]], [[10, -2, 5, 3, -2, 10, 3]], [[-70, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 3000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, 2001, -9000, 10000, -10000, -3000]], [[10, 5000, -10, 5, -5, 3, -3, 1, -1]], [[11, 3, 5000, -3, 2, -3000, -1, 2]], [[0, 0, 0, 0, 0, 0, 1, 0, 0]], [[9, 5, 3, -9, -3, -12, -5, -1, 3, 5, 3, -5, 5]], [[1, 2, 3, -70, 4, 5, 6, -7, -8, 6000, -10, 5000]], [[9, 5, 50, -5, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[3, -6000, 5, -5, 3, -3, 2, 3]], [[10, -2, 5, -5, 3, -2, -3, -2, -2]], [[-10000, 3, 10, 5, -70, 10, 3, 7, -3, -12, -6, -1, 3, 5, 3, 3, -6, 5]], [[0, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0]], [[9, 5, 3, -9, -3, 80, -12, -5, -1, 3, 5, 3, -5, 5]], [[11, 3, 5000, -3, 2, -3000, -1, 2, -1]], [[10, 5, -14, 3, -3, 2, -1, 5]], [[1, 2, 4, 5, 6, -7, -8, -9, -10, -11, -12, 2]], [[0, 1, 0, 0, 0, 0, 0, -1, 0, 0]], [[2, 1, 2, 3, -70, 5, 6, -9, 9, -6000, 6000, -10, -12, 5, -9]], [[1, -2, 81, 1, 1, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[10, 5, -5, -3, -12, 10000, 10, 3, 5, 3]], [[0, 0, 0, 0, 0, -1, 0, -1]], [[1, -10, 3, -70, -5000, -7, -8, 6000, -10, 6000, -11, -12, -8]], [[10, 5, 3, 5000, 5000, -3, 2, -1, 2, 5000, 10]], [[1, 3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, 1000, 5]], [[1, -10, 3, -70, 6, -5000, -7, -8, 5999, -10, -11, -12, -8, 3, 1]], [[1, 2, 3, -70, 6, -5000, -8, -7, -8, 6000, -10, -11, -12, -8, 2]], [[9, 5, -5, 3, -2, -5, 3, 5, 3, -5]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -5]], [[1, 2, -11, -70, 5, -9, -13, 10, -7, -8, 6000, -10, -12, 5]], [[10, 5, -5, -3, -12, -1, 3, 5, 5]], [[3, 10, 4, 5, -5, 3, -3, -6, -1, 2, 4, 5]], [[1, -2, 1, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1, 1]], [[1, 1, 50, 1, 2, 2, 1, -12, -1, -1, -1, -1, -1, -1, 1, -1, -100]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, 2000, -3, -2, -1]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, -5, -12, 3]], [[1, -6000, 3, 4, 5, 6, -7, -8, -9, -10, -11, -12]], [[-1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[1, -10, 3, -70, 6, -5000, -7, -8, 5999, -10, -11, 5, -12, -8, 3, 1, 1]], [[1, 3000, 0, 2001, 1, 1, 1, 1, -1, -1, -1, -1, -1, 2, -1, -1]], [[0, 0, 0, 0, -1, -1, -1]], [[3, 10, 5, -70, 10, 3, 7, -3, -12, -6, -1, 4, 3, 5, 3, 3, -6, 4000]], [[1, 2, 3, 5, 10, -7, -8, 6000, -10, -12, -12]], [[7, 1, 1, 6, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, 6000, -1, -1, 1]], [[1, 2, 3, 4999, -70, 5, 6, -7, -8, 6000, -10, -12, 5000, 5, 5]], [[10, -2, 5, 4, -5, 3, -3, 4000, 1, -2, 9, 10, 5]], [[1001, -1000, 2000, -2000, 3000, 81, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, -9000, 10000, -10000]], [[10, 10, -2, -10, 5, -5, 3, -3, -11, -1]], [[1000, 1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, 2000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, 3000, 8000]], [[10, 10, -2, -10, 5, -5, 3, -3, -11, -1, -10, -10]], [[1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[10, -2, 5, 3, -2, 10, 3, 3]], [[1, 2, 3, -70, 6, -5000, -8, -7, -8, 6000, -10, -11, -12, -8, 2, -8, -8]], [[3, 10, 5, -5, 3, -4, -6, -1, 3, 3, 5]], [[-8, 2, 3, 3000, -70, 5, -7, -8, 6000, -10, -11, 5000]], [[4, 1, -2, 1, 2, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, -2, 81, 1]], [[1, 1, 1, 1, 1, 5, 1, 1, -1, -1, -1, -1, -1, 1]], [[0, 1, 7000, 0, -1, 0, 100, 0, -12, 0, -1, 0, 0, -1, 0]], [[3, -6000, 5, -5, 3, -3, 2, -1, 3, 3]], [[1, 3, 6, -9, 10, -7, -13, 6000, -10, -12, 5, 1000, -9, -10, 1000, -9, 5, -9]], [[1, 2, 3, -70, 6, -5000, -8, -7, 6000, -10, -11, -12, -11, 2]], [[0, 1, 0, 0, 0, 1, 0, 0]], [[2, 1, 2, 3, -70, 5, -9, -4000, -6000, 6000, -10, -12, 5, -9]], [[9, 5, -5, 3, -3, -6, -1, 3, 5, 3, -5, -12]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 80, -1, -2, -1, -2]], [[1, 2, 4, 5, 6, -7, -8, -9, -10, -11, -12, -12]], [[1, 1, 50, 51, 1, 2, 2, 1, -12, -1, -1, -1, -1, -1, -1, 1, -1, -100]], [[10, -2, 5, 5, -5, 3, -3, 1, -4, 1]], [[10, 4, -2, 5, -5, -12, -1, 3, 5, 3, 3]], [[9, 5, -5, 3, -3, -6, -1, 4, 5, 3, -5, -12]], [[9, 5, -5, 3, -3, -12, -6, -1, 3, 5, 3, 5, -12, 3]], [[9, 5, -5, 3, -3, -3000, -1, 4, 5, 3, -5, -12]], [[9, -2000, 5, -5, 3, -3, -3000, -1, 4, 5, 3, -5, -12]], [[1, 2, 3, 5, -12, -9, -100, -2000, 6000, 2000, -4, 2000, 5, -9, -9]], [[1, 3, -70, 6, -9, 3000, -7, -8, 6000, -10, 5, 1000, -9, 1000, 5]], [[3, -70, 5, -9, 10, -7, 99, 6000, -10, -12, 5, -9, -10, -9]], [[0, 0, 0, 0, 0, 0, 0, 0, 0]], [[3, 10, 5, -5, 3, -4, -6, -1, 3, 5, 3, 5, -4]], [[11, 90, -11, 3, 4999, 5000, -3, 2, -1, 2]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1000, -1, -1]], [[-10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8, 3]], [[1, 1, 1, 1, 1, 5, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 80, -1, -2, -1, -1, 4999]], [[0, 0, 0, 0, 0, -1, 0, 0]], [[3, 10, 5, -5, 4, 3, -3, 2, -1, 3, 5, 3, 5, 3]], [[0, 2, 3, 2, -70, 10, 6, -5000, -7, 6000, -10, -11, -12, 5, -8]], [[1, 3, -70, 5, -9, 10, -7, -8, 6000, -10, -12, 5, -9, 10, -10]], [[0, 1, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 1, 0, 0]], [[11, 3, 5000, 2, -1, 2]], [[5, -5, -3, -12, -1, 50, 3, 5, -3, 5]], [[1, 3, -70, 90, -9, 10, -7, -8, 6000, -10, -12, 5, 1001, -9, -10, 1000]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, -7, -4, -3, -2, -1, -1]], [[9000, 1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -11, -12, 5, -70]], [[1, 2, 3, -70, 4, -9, 9, -6000, 6000, -10, -12, 5, -9]], [[3, 9, 5, -5, 3, -3, 2, -1, -10000]], [[0, 1, 0, 0, 10000, 100, 0, 0, 0, -1, 0, -1, -1]], [[10, -2, 5, 5, 3, -3, -3, 1, -4, -2]], [[1001, -1000, 2000, -2000, 81, -3000, -4000, 5000, -5000, 6000, -6000, -4000, -7000, -9000, 8000, -8000, 9000, -9000, 10000, -10000]], [[1, 2, 3, 5, -12, -9, -100, -2000, 6000, 2000, -4, 2000, 5, -9, -9, 5]], [[10, -2, 5, 4, -5, 3, -3, 4000, 1, 9, 10, 5]], [[1000, -1000, 2000, 99, -3000, 5000, -5000, 6000, -6000, -4000, -4, 8000, -8000, 9000, -9000, 10000, -10000, -1000, -1000]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2, 10, -3, 5]], [[0, 1, 7000, 0, 0, 100, 0, 0, 0, -1, 0, 0]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, 6000, -10, -11, -12, 5, -8, -12]], [[5, 3, -9, -3, -12, -1, 1, 3, 5, 4, -5]], [[10, -2, 5, 3, -2, 10, 3, 5]], [[1, 1, 1, 1, 1, 1, -1, 0, -1, -1, -1, 0, -1, -1, 1]], [[1, 3000, 0, 2001, 1, 1, 1, 1, -1, -1, -1, -1, -1, 2, -1, 2]], [[10, -2, 5, 4, -5, 3, 11, -3, 4000, 30, 10, 5]], [[0, 1, 7000, 0, 0, 0, 100, 1, 0, -1, 0, -2, 1, 0, 0, 7000]], [[10, 5, -5, -6000, 3, -3, 2, -1]], [[10, -2, 5, -5, 3, -3, -3, 1, 2000, -2, -2, -2, -5]], [[3, 10, 5, -70, 1, 10, 3, -3, -12, -6, -1, 3, 5, 3, 3]], [[3, 5, -5, 3, -3, 2, 7000, -1, 3, -5000, 6]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1, -1]], [[11, 3, 5000, -3, 2, -3000, -1, 2, -2]], [[3, -6000, 5, -5, 3, -3, 3, 2, -1, 3]], [[-1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8000, 9000, -9000, 6, -10000]], [[-3, 10, 5, -5, -3, -6, -1, 3, 5, -5, -1, -5]], [[50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10, 50]], [[0, 1, 6999, 0, 0, 0, 100, 0, 0, -1, 0, -1, 0, 1]], [[3, -70, -9, 10, -7, -8, 6000, -10, -12, 5, -9, -10, -6000, -6000, -6000]], [[10, 5, -5, 3, -3, -3, -2, -2]], [[1, 2, 3, 4999, -70, 5, 80, 6, -7, -8, 6000, -10, -12, 5000, 5, 5]], [[10, -2, 5, -5, 3, -1, -3, -2, -2, -2]], [[4, 1, -1, 1, 1, 1, 10000, -5, 2, 1, 1, -1, 80, 50, -1, -1, -1, -1, 80, 1, 80]], [[9, -5, 3, -3, -6, -1, 3, 5, 3, -5, -12]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, -70, -9, -8, -7, -6, -5, -4, -2, -1, -5]], [[-3, 10, 5, 10000, -5, -3, -6, -1, 3, 5, -1, -5]], [[1, 3, -70, 5, 6, -7, -8, -9, -10, -11, -12, 5]], [[1, 3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1001, -9, 5]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1, -1]], [[0, 0, 0, 0, 0, 0, -1, 0, 0, 0]], [[1, 3000, 0, 2001, 1, 1, 1, 1, -1, -1, 2, -1, -1, -1, 2, -1, 2, 2]], [[1, 2, 3, 3, -70, 5, 6, -5000, -7, -10, -11, -12, 5, -8, -12]], [[0, 1, 7000, 0, 0, 0, 0, 100, 1, 0, -11, 0, -2, 1, 0, 0, 7000]], [[0, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 0, 1]], [[3, 10, 4, 5, -5, 3, -3, 2, -6, -1, 2, 5, 3]], [[1, -2, 1, 1, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[3, 10, 5, -4, 4, 3, 2, -1, 3, 5, 3]], [[1, 2, 3, 5, -12, -9, -100, 6000, 2000, -4, 2000, 5, -9, -9]], [[1, 1, -2, 1, 1, 1, 10000, -10000, 2, 1, 1, 8, -1, 80, -1, -2, -2, -1, -1, -2, -2]], [[0, 1, -3000, 0, 0, 0, 1, 0, 0]], [[1, 1, 50, 1, 1, 2, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1, -1, 1]], [[1, 2, 3, 4, 5, 6, -7, -9, -10, -11, -12, 6]], [[1, 2, 3, 5, -12, -9, -100, -2000, 6000, 2000, -4, 2000, 2001, 5, -9, -9, 5]], [[10, 4, 5, 3, -3, -12, -7, -1, 3, 5, 3]], [[1, 2, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -2, 6000]], [[10, -2, 5, 5, -5, 2, -3, 1, -4, -2, 10, -3]], [[10, -2, 5, -5, 3, -3, 1, -4, 1]], [[1, 2, 3, 4999, -70, 5, 80, 6, -7, -8, 6000, -10, -12, 5000, 5, 5, 5]], [[-6000, 5, 3, 2, 2, -2000, 3]], [[1, 3, 6, -9, 11, -7, -8, 6000, -7, -12, 5, 1000, -9, -10, 1000, -9, 5, -9]], [[4000, -17, 59, 6000, 0, -6, -5]], [[9, 7, 3, -9, -3, -12, -5, -1, 3, 5, 3, -5, 5]], [[5, 10, 4, 5, -5, 3, -3, -12, -7, -1, 3, 5, 3, 5]], [[4, 5, -5, 3, -3, -12, -7, -1, -1, 7, 3, 5, 3]], [[10, -2, 5, 4, -5, 3, -3, 4000, 1, -2, 10, 1, 1]], [[1, -2, 1, 1, 1, 2, 1, 1, -1, 80, -1, -2, -2, -1, -1, -2, 1, 80]], [[10, 10, -2, -10, 5, 0, 3, -3, -11, -1, -11]], [[1, 2, 3, -1, 8, -2, -3, -4, -5, 6, 7, 8, 9, -6]], [[0, 1, 7000, -1, 0, 0, 0, 0, 0, -90, -1, 0, 0, -1, -1, -1]], [[1, -4, 50, 1, 2, 50, 2, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[5, 3, -9, -3, -12, -1, 1, 3, 5, 4, -5, -5]], [[1, 2, 3, 5, 10, -7, -8, 6000, -10, -11]], [[99, 2, 3, 2, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, 5, -8, -12]], [[-70, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 3000, -5000, 6000, -6000, -4000, -7000, 8000, -8000, 9000, 2001, -9000, 10000, 81, -10000, -3000]], [[1, 2, 3, 4, 5, 6, -7, -8, -10, -10, -3, -11]], [[3, 10, 5, 99, -5, 90, 3, -3, 2, -1, 3, 5, 3, 5, 3, 5]], [[1000, 1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, 2000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, 3000, 8000]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, 6000, -10, -12, -12, 5, -8, -12]], [[10, 4, -5, 3, -3, -12, -7, -1, 3, -11, 5, 3]], [[0, -2, 1, 0, 0, 0, 0, 1, 0]], [[7, 1, 1, 6, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1]], [[-4, -3, 2, -1, 2]], [[1, 2, 3, -12, -9, -100, -2000, 6000, -4, 2000, 5, -9, -70]], [[1, -2, -50, 1, 80, 10000, 1, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[3, 4, 10, -5, 3, 4, -3, 2, 2, 10, 3, -1, 3, -1000, 3]], [[0, 0, 1, 1, 0, 0, 1, 0, 4]], [[4, 5, -5, 3, -3, -12, -7, 4, -1, 3, 5, 3, 5]], [[3, 10, 5, -5, 3, -3, 2, 3, 3]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -9000, -1, 1]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1, -1]], [[1, 3, -70, 6, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, -9, 5]], [[-13, 0, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0]], [[0, 7000, 0, 0, 0, 100, 0, 0, 0, -1, 0, -1, 1, 0, 0]], [[9000, 1, 2, 3, -70, 5, 10, -7, -8, 6000, -10, -12, -12, 5, -12]], [[3, 10, 11, -13, -5, -5, 3, -3, 2, 3, 3]], [[-8, 1, 2, 3, 3000, -71, 5, -7, -8, 6000, -10, -11, 5000]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, -9, -8, -7, -7, -4, -3, -2, -1, -1, 9]], [[10, -1, 5, -5, -3, -12, -1, 3, 5]], [[-7000, 1, 2, -11, -70, 5, -9, -13, 10, -7, -8, 6000, -10, -12, 5]], [[1, 2, 3, -70, 5, -9, -100, -7, -8, 6000, -10, 2000, 5, -9, 5, -70, 1, 1]], [[10, 5, -5, -12, -3, 2, -1, 5, 5, -3]], [[1, 2, 3, 4, 6, 6, -7, -8, -10, -10, -3, -11, 6]], [[1, 2, 3, 4, 5, 6, -7, -8, -10, -3, -11, -13, 4]], [[4, 1, -10, 3, -70, 6, -5000, -7, -8, 6000, -10, -11, -12, -8]], [[10, -2, 5, 5, -5, 3, -3, 1, -4, -2, 6, 10]], [[1, 1, 1, 1, 1, 5, 1, 1, -1, -1, -1, -1, -1, -1, -1, -7, 1]], [[11, 90, 3, 5000, 59, 2, -1, 2]], [[3, 10, -5, 3, 4, -3, 2, -1, 3, 2, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -10, -9, -7, -6, -5, -4, -3, -2, -1]], [[10, -2, 5, 5, -5, -100, 3, -3, 1, -4, -2]], [[2, 2, 3, 5, 10, -7, -8, 6000, -10, -11, -12]], [[1, 1, 6, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[3, 10, 5, -5, 3, -4, -6, 14, -1, 3, 5, 3, 5]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -9000, -1, 1, 1]], [[0, 2, 3, 2000, 2, -70, 10, 6, -5000, -7, 6000, -10, -11, -12, 5, -8]], [[10, -2, 5, 5, -5, -100, 3, -3, 1, -4, -2, 1]], [[-10000, 3, 90, 10, 5, -70, 10, 3, 7, -3, -12, -6, -1, 3, 5, 3, 3, -6, 5]], [[9, 5, -5, 3, -3, -6, -4, -1, 3, 5, 3, -5]], [[1, 1, 50, 59, 1, 1, 2, 1, 1, -1, -1, -1, -1, -1, -1, -2, 1]], [[0, 0, 0, 0, 0, 0, -1, 0, 99, 0, 0]], [[1, 2, 3, -70, 5, -9, -100, -7, -8, 6000, -10, 2000, 5, -9, 5, -5000, 1]], [[10, -5, -3, -12, -1, 5]], [[0, 1, -3000, 0, 0, 0, 1, 0, 1]], [[1, 3, -70, 5, -9, 10, -7, -8, -10, -12, 5, -9, -10]], [[1, 2, 3, -70, 5, 6, -7, -8, 6000, -10, -11, -12, 5, 1]], [[3, -6000, -5, 3, -3, 3, 2, -1, 3, 2]], [[10, -5, 7, 3, -4, -1, -9, 2, 14, 7]], [[3, 10, 5, -5, 3, -4, 3, 5, 3, 5]], [[1, -2, 1, 1, 1, 10000, 2, 1, 1, 8, -1, 10000, 80, -1, -2, -2, -1, -1, -2, 1, 1]], [[10, 5, -5, -3, 2, 0, -3]], [[9000, -10, 3, -71, 6, -5000, -7, -8, 6000, -10, -11, -1, -8, 3, 1]], [[3, 10, 3, 5, -5, 3, -3, -12, -7, -1, 3, 5, 3, 5]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, 6000, -10, -5, -12, 5, -8, -12]], [[10, 5, 14, 5000, -3, -30, 2, -2, -1, 2, -3, -3]], [[1, 2, 3, 5, -12, -9, -100, 6000, 2000, -4, 2000, 5, -9, -9, -9]], [[10, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2, -3]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -11, -1]], [[1, 2, 3, 2, -70, 5, 6, -5000, -7, 6000, -10, -12, 5, -8, -12]], [[4, 1, -2, 1, 1, 1, 10000, -5, 2, 1, 1, -1, -1, -1, -1, -1, -1, 80, 1]], [[10, 5, 14, 5000, -3, -30, 2, -2, -1, 2, -3, -3, 5]], [[0, 1, 7000, 0, 0, 0, 0, 100, 1, 0, -11, 0, -2, 1, 2, 0, 0, 7000]], [[1, -2, 80, 1, 1, 30, 10000, -5, 2, 1, 1, -1, 80, -1, -1, -1, -1, -1]], [[3, 10, 5, -5, 3, -4, -6, 14, -1, 3, 5, 3, 5, 5]], [[1, 2, 3, 4999, -70, 6, 80, 6, -7, -8, 6000, -10, -12, 5000, -13, 5]], [[9, 5, -5, 3, -3, -6, 3, 5, 3, -5, 3]], [[1, 2, 3, -70, 5, -9, 10, -7, -8, 6000, -12, 5, -9, -12, -70]], [[10, -2, 5, 5, -5, -100, 3, -3, 1, -4, -2, 1, 10]], [[5, -2, 5, 5, -5, 3, -3, -3, 1, -4, -2]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 1]], [[1, 2, 3, -70, 5, -9, -7, -8, 5999, -10, 2000, 5, -9, 5, -5000, 1]], [[0, 0, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0]], [[-4, 10, 5, 3, 5000, -3, -30, 2, -1, 0, -6, -3]], [[1, 3, -70, -1, -9, 10, -7, -8, 6000, -10, -12, 5, 1000, -9, -10, 1001, -9, 5]], [[1, 2, 3, -70, 5, -7, -8, 6000, -10, -11, 5, 2]], [[1, 2, 3, 4, 5]], [[-1, -2, -3, -4, -5]], [[1, 2, -2, 3, -3, 4, -4]], [[2147483647, -2147483647]], [[-1, 0, 1]], [[2147483647]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, 14]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -10000, -1, -1, -3, -1]], [[0, 0, 0, 0, 0, 100, 0, 0]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3]], [[0, 0, 0, 0, 0, 0, 0, 1, 0]], [[1, 2, -5, -1, -2, -3, -4, -5, 6, 7, 8, 9, -6]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, 14, -1]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, 14, 3]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, 14, 3]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, 10000]], [[10, -5, 7, 3, -2, -1, 0, -6, -9, 3, 14]], [[10, 90, -4, 7, -8, -4, -1, 0, -6, -9, 3, 14, -1]], [[1, 2, 3, 4, 5, 7, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -3, -2, -1]], [[10, -5, 7, 3, -4, -1, 0, -9, 3, 14]], [[1000, 6000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, -8000]], [[10, -5, 7, 3, -4, -1, 0, -9, 3]], [[0, -1, 2, -2, 3, -3, 4, -4, 5, -5, 0]], [[0, 0, 0, 1, 0, 100, 0, 0, 0]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1]], [[1, 1, 2, 1, 1, 1, 1, -1, -1, -10000, -1, -1, -3]], [[-2, 0, -1, 2, -2, 3, -3, 4, -4, 5, -5, 0]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10, -80]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10000, 10, -80]], [[0, 0, 100, 0, 0, 0]], [[90, -4, 7, -8, -4, -1, 0, -6, 3, 14, -1, -1]], [[0, 0, 0, -1, 0, 0, 0, 0]], [[10, -5, 7, 4, -4, -1, 0, -6, -9, 3, 14, 0, 3]], [[0, -1, 2, -2, 3, -3, 4, -4, 5, 5, -5, 0]], [[3, 0, 0, 1, 0, 100, 0, 0, 0]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10, -80, 90]], [[0, -1, 2, -2, 3, -50, -3, -2, 4, -4, 5, 5, -5, 0]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 2, 14, -1]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3, -1]], [[1, 2, -5, -1, -2, -3, -4, 7, -5, 6, 7, 8, 9, -6]], [[1000, -1000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -9000, 10000, -10000]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, -5000]], [[10, -10, 5, 3, -3, 1, -1]], [[0, 100, 0, 0, 0]], [[0, -1, 2, -2, 3, -3, 4, -4, 5, -5, 0, -2]], [[0, 0, 0, 1, 0, 0, 100, 0, 0, 0]], [[-2, 0, -1, -2, 3, -3, 4, -4, 5, -5, 0]], [[10, -5, 7, 2, -2, 3000, -6, -9, 3, 14]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0, 0]], [[0, -1, 2, 3, -3, 4, -4, 5, -5, 0, -2]], [[10, -5, 7, 3, -4, -1, 1000, -5, -9, 3, 14, 3]], [[11, -5, 7, 3, -4, 0, -9, 3]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 7, -1]], [[1, 2, 3, 4, 5, 6, -7, -8, -9, -10, -12]], [[-100, 50, 70, -80, 90, -50, 100, 30, -80, -70, 80, -30, -10, 10000, 10, -80]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]], [[1, 2, 3, 5, 5, 6, -7, -8, -9, -10, -11, -12]], [[0, 0, 0, 0, 100, 0, 0]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 80, -30, -10, 10, -80, 90]], [[1000, 6000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, -10000, -8000]], [[1, 2, -5, -1, -2, -3, -4, -5, 6, 7, 8, 9, -6, -4]], [[0, 0, 1, 0, 0, 100, 0, 0, 0]], [[1, 1, 1, 1, 1, 1, -1, 50, -1, -1, -1, -1, -1, -1]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, 14, -1, -9]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 14, 3000, -1]], [[-100, 50, 70, -80, 90, -50, 100, -90, -70, 80, -30, -10, 10, -80, 90]], [[0, -1, 2, -2, 3, -1000, 4, -10000, -4, 4, -5, 0, -2]], [[0, 1, -1, 2, 3, -3, 4, -4, 5, -5]], [[0, 1, -1, 2, -2, 3, -3, 6, -4, 5, -5]], [[1, 2, 3, 5, 7, 7, 8, 9, 10, -10, -9, -8, -7, -6, -4, -3, -2, -1]], [[-2, 0, -1, 4, -3, 4, -4, 5, -5, 0]], [[0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1]], [[0, 0, 0, 0, 0, 0, 0, 2, 1, 0]], [[0, 0, 0, 0, 0, 1, 0, -80, 1, 0, 0, 1]], [[0, 0, 0, 0, 0, 0, 0, 2, 0]], [[1, 1, 1, 1, 1, 1, 1, 7, -1, -1, -1, -1, -1, -1]], [[0, 0, 1, 0, 100, 0, 0, 0]], [[-12, -5, 7, 3, -4, 0, -9, 3]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 3]], [[-100, 50, -50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10, -80, 90]], [[1, 1, 2, 1, 1, 1, 1, -1, -1, -10000, -1, -1, -3, -3]], [[-100, 50, 5, -50, 70, -80, 90, -50, 8000, 30, -90, -70, 80, -30, 10, -80, 90]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 4]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0, 0, -1]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3, 0]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -10000, -1, -1, -3, -1, -1]], [[1000, -1000, -2000, 3000, -3000, 4000, 5000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -9000, 10000, -10000, 4000]], [[10, -4, 7, 3, -4, -1, 0, -9, 3]], [[1000, 6000, 6001, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, -10000, -8000]], [[1, 2, 3, 5, 5, 6, -7, -8, -9, -10, -11, 9000]], [[7, 3, -4, -1, 0, -9, 3, 14]], [[90, -4, 7, -8, -4, -1, 0, -6, 3, 14, -1, -1, -8]], [[10, -5, 14, 7, 3, -4, -1, 0, -6, -9, 3, 14]], [[10, -5, 8, 3, -4, -1, 0, -6, -9, 3, -50, 3]], [[1, 2, 3, 5, 7, 7, 8, 9, 10, -9, -8, -7, -6, -4, -3, -2, -1, 8, 9, 7]], [[1000, -1000, -2000, -3000, 4000, 5000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -9000, 10000, -10000, 4000]], [[0, 0, 0, 0, 0, 0, 1, 0]], [[0, 0, 0, 0, 0, 0, 0, 2, 1, 1]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, 10000, 10, -80, -80]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 3, -4]], [[-100, 50, 70, -80, 90, -50, 100, 30, -81, -90, -70, 80, -30, -10, 10, -80]], [[10, -4, 7, 2, -2, 3000, -6, -9, 3, 14]], [[-1, 1, 0, 0, -1, 0, 0, 0, 0]], [[0, -1, 2, -2, 3, 80, -3, -2, 4, -4, 5, 5, -5, 0]], [[11, 7, 3, 100, 0, -9, 3, 3]], [[1, 2, 3, 5, 7, 7, 8, 9, 10, -9, -8, -7, -6, -4, -3, -2, -1, -4, 9, 7]], [[1, 2, 3, 4, 5, 6, -7, -8, -9, -10, -11, -12, 5]], [[1, 2, 3, 4, 5, 7, 7, 8, 9, 10, -10, -9, -8, -7, -6, -5, -4, -2, -2, -1, -4, 1]], [[0, 6001, 0, 0, 0, 0, 0, 0, 2, 1, 1, 0]], [[10, -5, 7, -4, -1, 0, -6, -9, 2, 14, -1, 14]], [[-6000, -30, 0, 100, 0, 0, 0]], [[0, 0, 0, 0, 0, 1, -80, 1, 0, 0, 1]], [[1, 2, 3, 5, 5, -8, 6, -7, -8, -9, -10, -11, -12, 6]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3, -4]], [[1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1]], [[-1, 0, 1, 0, -1, 0, 0, 0, 0]], [[0, -1, 2, -2, 3, -1000, 4, -10000, -4, 1, 4, -5, 14, 0, -2]], [[10, -4, 7, 3, -4, -1, 0, -9, 3, 3]], [[-100, 50, 70, -80, 90, -50, 100, 30, -81, -90, -70, 80, -30, -10, 10, -91, -80, 80]], [[0, 0, 0, 0, 0, 100, 0, 0, 2]], [[0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -3, -5]], [[0, 100, 0, 0]], [[1, 2, -5, -1, -2, -4, -5, 6, 7, 8, 9, -6, -4]], [[10, -5, -4, -1, 0, -6, -9, 2, 14, -1, 14]], [[1, 1, 2, 1, 1, 1, 1, -1, -10000, -1, -1, -3, -3]], [[0, 0, 0, 1, 0, 100, 0, 0]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1]], [[1, -2000, 2, 3, 4, 5, 6, -7, -8, -9, -10, -1, -11, -12, 5]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 80, -10, 10, -80, 90]], [[-4, -10, 5, -3, 1, -1]], [[10, 90, -4, 70, -8, -4, 5, 0, -6, -9, 3, 14, 0]], [[0, 1, -1, 2, -2, 3, -12, -3, 4, -4, 5, -5, 1]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0, 5000]], [[-100, 50, 70, -80, 90, -50, 100, 30, -81, -90, -70, 80, -30, 8, 10, -80]], [[0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0]], [[-1, 0, 0, -1, 0, 0, 0, 0]], [[1, 2, -5, -1, -2, -3, -4, -5, 6, 7, 9, -6]], [[0, -1, 2, -2, 3, -50, -4, -3, -2, 4, -4, 5, 5, -5, 0]], [[10, -5, 7, 3, -4, -1, 0, 7, -9, 3, 14, 3, -1]], [[10, -5, 7, 3, -4, 8, -1, 0, -9, -10, 3, 14, 3, -1]], [[1, 1, 2, 1, 4000, 1, 1, 1, -1, -10000, -1, 11, -3, -3]], [[10, 90, -4, 7, -8, -4, -1, 0, -6, -9, 3, 14, -1, -1, -4]], [[1000, 6000, -1000, 2000, -2000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, -10000, -8000]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, 14, -30, 3]], [[-1, 1, 0, 1, -1, 0, 0, 0, 0, 1]], [[1, 2, 80, 3, 5, 5, -8, 6, -7, -9, -10, -11, -12, 6]], [[-11, 10, 3, -3, 1, -1]], [[1, -1000, 2, 80, 3, 5, 5, -8, 6, -7, -9, -10, -11, -12, 6]], [[7, 3, -4, -1, 0, -9, 3, 14, 7]], [[100, -5, -1, 3, -4, -1, 0, -6, -9, 3, 14, 3]], [[0, 0, 0, 0, -1, 0, 1, 0, 0, 0, 2, 0]], [[1000, -1000, -2000, 3000, -3000, 4000, 5000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -3000, -8000, -9000, 10000, -10000, 4000, -3000]], [[-100, 50, 70, -80, 90, -50, 100, 30, -2000, 80, -30, 10000, 2, 10, -80, -80]], [[0, -1, 2, -2, 4, 80, -3, -2, 4, -4, 5, 5, -5, 3, 0]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, -9, 14]], [[10, -5, 7, 4, -4, -1, 0, -9, 3]], [[-1, 0, -6000, 1, 0, -1, 0, 1, 0, 0, 0, 1, 0]], [[-100, 50, -50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10, -100, 10, -80, 90]], [[0, 0, 0, 1, 0, 100, 0, 14, 0]], [[10, -5, 7, 3, -4, -1, 0, 7, -9, 3, 14, 3, -1, -1]], [[8, 0, 1, -1, 2, -2, 3, -3, 6, -4, 5, -5]], [[3, 0, -7000, 1, 0, 100, 0, 0, 0]], [[0, -1, 2, -2, 3, -50, -4, -3, -2, 4, 10000, 5, 5, -5, 0]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 3, -1]], [[1000, 2999, -1000, -2000, 3000, -3000, 4000, 5000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -9000, 10000, -10000, 4000]], [[1000, 6000, -1000, 2000, -2000, 3000, -3000, 4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, -8000]], [[1, 1, 2, -5, -1, -2, -4, -5, 6, 7, 8, 9, -6, -4]], [[10, -5, 3, -4, -1, -1, 0, -6, -9, 3, -50, 4]], [[1, 1, 1, 1, 1, 1, 1, 7, -9000, -1, -1, -1, -1, -1, 1]], [[-2, 0, -1, -2, 3, -3, 4, -4, 5, -5, 0, 0]], [[1, 1, 1, 1, 1, 1, 7, -1, -1, -1, -1, -1, -1]], [[-2, 0, -1, -2, 3, -3, 4, -4, 5, 0, 0]], [[1, 1, 2, 1, 4000, 1, 1, 1, -1, -10000, -1, 11, -3, -3, 1]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0, 0, -1, 0]], [[0, 11, 0, 0, 0]], [[10, -5, 7, 3, -4, -1, 0, 14, -5, -9, 3, 14, 3, -1, 0]], [[10, -5, 7, -4, -1, 0, -5, -9, 3, 14, 3, 0]], [[10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 3, 0]], [[100, -6000, -30, 0, 100, 0, 0, 0]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0]], [[-100, 50, 70, -80, 90, -50, 100, -90, -70, 71, 80, -30, -10, 10, -80, 90]], [[1, 1, 2, -1, -2, -4, -5, 6, 7, 8, 9, -6, -4, 8, 8]], [[0, 1, -1, -3, 3, -3, 4, -4, 5, -5]], [[-1, 0, 0, 0, -1, 0, 0, 0, 0, 0]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10]], [[0, 0, 0, 30, 0, 100, 0, 0]], [[0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -3, -5, 3]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 80, -30, 10, -80, 90]], [[1000, -3001, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -7, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[10, 90, -4, 70, -8, -4, 5, 0, -6, -9, 3, 7000, 14, 0]], [[1, 1, 1, 1, 1, 1, -1, -5000, -1, -1, -1, -1, -1, -1]], [[10, -5, 3, -4, -1, 0, -6, -9, -3, 3, -50, 3, -1, 0]], [[10, -5, 7, 4, -4, -1, 0, 3]], [[0, 0, 0, 0, 0, 0, 0]], [[10, -5, 7, 3, -4, -1, -5, -9, 3, 14, 3]], [[10, -5, 7, 3, -4, -1, 0, -6, -9, 3, 14, -1, -9, -9]], [[-1, 0, 0, -1, 0, 0, 0, 0, 0]], [[8, 0, 1, -1, 2, -2, 3, -3, 5, -4, 5, -5]], [[-100, 50, 70, -7, -80, 90, -50, 100, -90, -70, 71, 80, -30, -10, 10, -80, 90]], [[90, -4, 7, -8, -4, -1, 0, 2, -6, 3, 14, -1, -1]], [[1000, 6000, 6001, -999, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, -10000, -8000]], [[10, -5, -4, -1, 0, -6, -9, 2, 14, -1, 14, -6, -6, 0]], [[-100, 50, 70, -80, 90, 30, -50, 100, -90, -70, 80, -30, -10, 10, -80, 90]], [[-5, 7, 3, -4, -1, 0, -5, -9, 3, 3, -4, 14]], [[0, 0, 100, 0, 0, -7, 0]], [[0, -1, 2, -2, 3, -3, 4, -4, 5, 4, -6, 0]], [[1, 1, 1, -9000, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, 1]], [[-100, 50, 70, -80, 90, -50, 100, 30, -81, -90, -70, 80, -30, -10, -7, 10, -80]], [[10, -5, 3, -4, -1, -1, 0, -91, -9, 3, -50, 4]], [[-1, 0, 1, 0, 0, -1, 0, 0, 0]], [[0, 0, 0, 0, 0, 0, 0, 2]], [[-100, 50, 70, -80, 90, -50, 100, 30, -80, -70, 80, -30, 10000, 10, -80]], [[-100, 50, 70, -80, 90, -50, 100, -90, -70, 71, 80, -30, -10, 10, 90]], [[0, 1, -1, 2, -2, 3, -3, 6, -4, 5, -5, 5]], [[1, 1, 1, -9000, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, 1, 1]], [[10, 90, -4, 7, 2, -8, -4, -1, 0, -6, -9, 3, 14, -1, -1, -4]], [[-1, 2, -2, 3, -1000, 4, -10000, -4, 1, 4, -5, 14, 0, -2]], [[10, -5, 3, -10, -1, 0, -6, -9, 3, -50, 3]], [[10, -5, -4, -1, 0, -6, -9, 2, 14, -1, 14, -6, -6, 0, 14]], [[1, 2, 3, 4, 5, 6, -8, -9, -10, -11, -12]], [[0, 0, -30, 1, 0, 100, 0, 14, 0]], [[0, 0, 0, 30, 0, 100, 0, 0, 100]], [[1, 1, 1, 2, 1, 1, 1, 1, 7, -9000, -1, -1, -1, -1, -1, 3]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, -5000, -2000]], [[-100, 50, 5, -50, 70, -80, 90, -50, 8000, 30, -90, 51, -70, 80, -30, 10, -80, 90]], [[0, 0, 0, 30, 0, 4000, 7000, 0, 0]], [[1, 1, -9000, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, 1]], [[1, 6, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1]], [[11, -5, 7, 3, 0, -9, 3]], [[10, -5, 4, -4, -1, 0, -9, 3]], [[-1, 2, -2, 3, -1000, 4, -10000, -4, 1, 4, -2, -5, 14, 0, -2, 3]], [[1, 1, 1, -1, 1, 1, 1, -1, -5000, -1, -1, -1, -1, -1, -1]], [""], [[-3, -10, 5, -3, 1, -1, -1]], [[0, 1, -1, 2, -2, 3, -3, 4, 5, -3, -5, 3]], [[11, -5, 12, 7, 3, -4, 0, -9, 3]], [[-100, 50, 30, 5, -50, 70, -80, 90, -50, 12, 8000, 30, -90, 51, -70, 80, -30, 7, 10, -80, 90]], [[10, -10, 5, -5, 3, -3, 1, -1, -1]], [[-100, 50, -50, 51, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10]], [[10, -5, 1, 4, -4, -1, -81, 0, -9, 3]], [[0, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0]], [[10, -5, 3, -4, 0, -6, -9, 3, -50, 3, -4]], [[10, -5, 3, -4, -1, -1, 0, -6, -9, 3, -50, 4, 3]], [[10, -5, -4, -1, 0, -6, -9, 2, 2, 14, -1, 14, -6, -6, 0]], [[0, -1, 2, -3, 3, -3, 4, -4, 5, 5, -5, 0]], [[10, -5, 3, -5, -1, -1, 0, -6, -9, 3, -50, 4, 3]], [[0, -1, 2, -2, 4, 80, -3, -2, -81, -4, 5, 4, 5, -5, 3, 0]], [[-100, -79, 50, 70, -80, 90, -50, 100, 30, -91, -70, 80, -30, -10, 10000, 10, -80]], [[1000, -1000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, -10000, 6000, -6000, 7000, -7000, 8000, -8000, -9000, 10000, -10000]], [[1000, -3001, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -7, -7000, 8000, -8001, 9000, -9000, 10000, -10000]], [[7, 3, -4, -1, 0, -9, 3]], [[0, 0, 0, -4, 0, -9000, 1, 0, 0, 0, 1, 0]], [[2, 100, 0, 0, 0]], [[1, 3, 5, 7, 7, 8, 9, 10, -9, -8, -7, -6, -4, -3, -2, -1, -4, 9, 7]], [[10, -5, 3, -4, -1, 0, -6, -9, -3, 3, -50, 3, -1, -2000, 0]], [[0, 0, 0, 1, 0, 100, 3000, 0, 14, 0]], [[0, -1, 2, -2, 3, -50, -3, -2, -4, 5, 5, -5, 0]], [[0, 0, 0, 0, -1, 0, 1, -4000, 0, 0, 0, 2, 0]], [[0, 0, 51, 0, 8000, 0, 100, 0, 0]], [[10, -5, 7, 2, 3000, -6, -9, 3, 14]], [[10, 5, -5, 3, -3, 1, -1]], [[10, -5, 7, 3, -4, -1, 0, 14, -5, -9, 3, 14, -1, 0]], [[-6, 10, -5, 3, -4, -1, 0, -6, -9, 3, -50, 3, -1]], [[0, 0, 0, 1, 0, -50, 100, 0, 0]], [[1000, 5, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, -10000, -8000]], [[1, 6001, 1, 2, 1, 1, 1, 1, 7, -9000, -1, -10000, -1, -1, -1, -1, 3]], [[0, 0, -30, 14, 1, 0, 100, 0, 14, 0]], [[-100, 50, -6, -80, 90, -50, 100, 30, -80, -70, 80, -30, -10, 10000, 10, -80, 90]], [[1, 3, 3, 4, 5, 6, -7, -8, -9, -10, -12, -12]], [[10, -5, 7, 3, -4, 0, -5, -9, 3, 14, 3, -1]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 5, 0, 2, 0, 0, 0]], [[0, 1, -1, 2, -3, -91, 3, -3, 6, -4, 5, -5]], [[10, -5, -4, -1, 0, -6, -9, 2, 14, -1, 14, -1]], [[10, 90, -4, 7, -8, -4, -1, 0, -6, -9, 3, 2, 14, -1]], [[0, 1, -5, -1, 2, -2, 14, 3, -3, 4, -4, 5, -5]], [[10, -5, 3, -4, -1, 0, -9, 3, 14]], [[1000, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, 3000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, 10000]], [[10, -5, 7, 4, -4, -1, 0, 3, 10]], [[-3, 11, -5, 12, 7, 3, -4, 0, -9, 3]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -81, -1, -1, -1]], [[1, 1, 1, 1, -9, 1, 1, 1, 7, -9000, -1, -1, -1, -1, -1, 1]], [[10, -5, -4, -1, 0, -6, -9, 3, -50, 3, 0]], [[-100, 50, 70, -80, 90, 30, -90, -70, 80, 10, -80, 90, -70]], [[0, 0, -4, 0, -9000, 1, 0, 0, 0, 1, 0]], [[10, -5, 7, 4, -4, -1, -3, 3]], [[10, -5, 7, 3, -4, -1, 0, -9, 3, 0]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, -5000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, -10000, -5000, -6000, -6000]], [[10, -5, 3, -4, -1, 0, -6, 51, 3, 14, -30, 3, -4]], [[-100, 50, -50, 70, -80, 90, -50, 8000, 30, -90, -70, 80, -30, 10, -80, 90, 70]], [[3, 0, 0, 1, 0, 100, 0, 0, 0, 1]], [[0, -1, 2, -2, 3, -3, 4, -4, 5, -5, 0, -2, 0]], [[1000, -1000, 2000, -1999, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 9000, -9000, 10000, -10000]], [[0, 0, 0, 1, 5, 0, -50, 100, 0, 0, 0]], [[-5000, 0, -1, 2, -2, 3, -3, 4, -4, 5, 5, -5, 0]], [[10, -5, 3, -4, -1, 0, -6, 51, 3, 14, -30, -4, -6]], [[10, -5, 3, -4, 6001, 0, -6, -9, 3, 14, -30, 3, -6]], [[10, -5, 3, -4, -1, 0, -6, -9, -90, -50, 4]], [[-1, 0, 1, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0]], [[1000, 6000, -1000, 2000, -2000, -8000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8000, 9000, -9000, 10000, -10000, -8000]], [[0, -9, 0, 30, 0, 100, 0, 0, 100]], [[1000, 6000, -1000, 2000, -2000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, -11, -9000, 10000, 80, -10000, -8000]], [[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0]], [[3, 0, 0, 1, 0, 100, 0, 0, 0, 0, 0]], [[0, 0, 0, 0, 0, 1, 0]], [[11, -1, 0, 0, -1, 0, 0, 0, 0, 0]], [[10, 90, -4, 7, -8, -4, -1, 0, -6, -9, 3, 2, 14, -1, -4]], [[10, -5, 4, -4, -1, 0, -9]], [[0, 0, 100, 0, 101, 0, 0, 0]], [[10, -5, 7, 4, 3, 9, -1, 0, 3]], [[-100, 50, 70, -80, 9000, -50, 100, 30, -82, -90, -70, 80, -30, -10, -7, -7, 10, -80, -70]], [[1, 2, -5, -1, -2, -3, -4, 7, 8, -5, 6, 7, 8, 9, -6]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 7, -10, -80, 90]], [[0, 0, 1, 0, 100, 0, 0, 0, 0]], [[-5, 10, -5, 3, -10, -1, 0, -6, -9, 3, -50, 3, -5]], [[1, 1, 2, 1, 4000, 3, 1, 1, 1, -1, -10000, -1, 11, -3, -3]], [[0, -9000, -1, 2, -3, 3, -3, 4, -4, 5, 5, -5, 0]], [[1, 5, 1, 2, 1, 1, 1, 1, -1, -1, -1, 0, -81, -1, -1, -1]], [[1, 1, 1, 1, 1, 1, 1, 7, 80, -9000, -1, -1, -1, -1, -1, 1]], [[1, 2, -5, -1, -2, -3, -4, -5, 6, 7, 8, 9, -6, 2, 6]], [[1, 6001, -3000, -30, 1, 1, 1, 1, 7, -9000, -1, -10000, -1, -1, -1, -1, 3]], [[1, 3, 5, 7, 7, 8, 9, 10, -9, -8, -7, -6, -4, -3, -2, -1, 9000, 9, 7, -1]], [[-3001, 2, -2, 3, -1000, 4, -10000, -4, 1, 4, -5, 14, 0, -2]], [[0, 1, -5, -1, 2, -2, 14, 3, -3, 4, -5, 5, -5]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 80, -30, 10, -80, 90, 30]], [[3, 0, 0, 1, 0, 100, 0, 0, 0, 0, 1]], [[-100, 50, 70, -80, 90, -50, 30, -90, 7, -10, -80, 90]], [[1000, 5, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -6000, 7000, -7000, 8000, -8000, 30, -11, -9000, 10000, -10000, -8000]], [[1, 0, 0, 0, 1, 0, 100, 0, 0, 0]], [[-3, 11, -5, 12, 7, 3, -4, 0, -9, 3, 11, 3]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3, -4, 3]], [[1, 6001, -3000, -30, 1, 1, 1, 7, -9000, -1, -10000, -1, -1, -1, -1, 3]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8001, 9000, -9000, 10000, -10000, -5000, -2000, -4000]], [[1000, -3001, -1000, 2000, -2000, 3000, -3000, 4000, -4000, 5000, -5000, 6000, -9, -6000, -7, -7000, 8000, -8001, 9000, -9000, 10000, -10000]], [[-100, 50, 70, -80, 90, -50, 100, 30, -90, 80, -30, -10, -80, 90]], [[1, 1, 2, 1, 1, -8001, 1, 1, -1, -1, -10000, -1, -1, -3]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, -7000, 8000, -8001, 9000, -9000, 10000, -10000, -5000, -2000, -4000, 2000]], [[1, 2, 3, 5, 5, 6, -7, -8, -9, -10, 9000, -7]], [[10, -5, -4, -1, 0, -6, -9, 2, 2999, 14, -1, 14, -6, -6, 0]], [[10, -5, 7, 1000, -4, -1, 0, -5, -9, 3, 14, 3, 3]], [[-1, 0, 1, 0, -1, 0, 0, 0, 0, 0]], [[3, 0, 0, 1, 0, 100, 0, 0, 0, 0, 0, 0]], [[-5, -4, -1, 0, -6, -9, 2, 14, 8000, 14, -6, -6, 0, -6]], [[1, 1, -79, 1, -9000, 1, 1, 1, 1, -1, -1, -1, -1, 0, -1, -1, -1, 1]], [[-100, 50, 70, -80, 90, -50, 30, -90, -70, 7, -10, -80, 90, -80]], [[7, -8, -4, -1, 0, -6, 3, 14, 2, -1, -8]], [[0, -3001, 0, 100, 0, 101, 0, 0, 0]], [[7, 3, -4, -2, 0, -9, 3, 14, 7]], [[-100, 50, 5, -50, 70, -80, 90, -50, 8000, 30, -90, -70, 80, 101, 10, -80, 90]], [[1, 2, 3, 4, 5, -6000, -7, -8, -9, -10, -11, -12]], [[1, 6001, 1, 2, 1, 1, 1, 1, 7, -9000, -1, -10000, -1, -1, -1, -1, 3, -10000]], [[-100, -81, 50, -50, 51, -80, 90, -50, 100, 30, -90, -70, 80, -30, -10]], [[0, 0, 0, 0, 0, 0, 0, 2, -1, -1]], [[1, 3, 3, 4, 5, 6, -7, -8, -9, -10, -12, -12, 5]], [[1000, -1000, 2000, -2000, 3000, -3000, -4000, 5000, -5000, 6000, -6000, 8001, -6001, 7000, -7000, 8000, -8000, 9000, -9000, 11, -10000, -5000]], [[10, -5, 7, 3, -4, -1, 0, -5, -9, 3, 14, 3, -1, 10]], [[-12, -5, 7, 3, -4, -9, 3]], [[-100, 50, 70, -80, 90, -50, 100, -90, -70, 71, -91, -30, -10, 10, -80, 90]], [[1, 1, -82, 1, 1, 1, 1, -1, -5000, -1, -1, -1, -1, -1, -1, -1, 1]], [[0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -3, -5, -2]], [[10, -5, -80, 3, -4, -1, 0, -5, -9, 3, 14, 3, -4]], [[3, -4, 0, 0, -9, 3]], [[1, 1, 1, 1, 1, 1, 1, -1, 70, -1, -1, -1, -1, -1, -1, 1, -1]], [[0, 0, 0, 0, 4000, 7000, 0, 0]], [[7, 3, -4, -1, 7, 0, 14]], [[-100, 50, 70, -80, 90, -50, -7, -90, -70, 80, -10, 10, -80, 90]], [[0, 0, 0, 1, 0, -2, 3000, 0, 14, 0]], [[0, 0, 1, 0, 100, 0, 0, 0, 0, 0]], [[1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, 0, -81, -1, -1, -1, 1]], [[10, -5, -4, -1, 0, -6, -9, 3, -50, 3, 0, 3, 3]], [[10, 90, -4, 70, -8, -4, 5, 0, -6, -9, 3, 7000, 14, 0, 0]], [[-2, -2, 0, -1, 2, -2, 3, -3, 4, -4, 5, -5, -2, 0]], [[10, -5, 3, -4, 0, 51, 3, -30, -4, -30, -6]], [[10, -5, -4, -1, 0, -6, -9, 2, 2, 14, -1, -6, -6, 0]], [[1, 1, 2, 1, 1, 1, 1, -1, -12, -1, -10000, -1, -1, -3, -3]], [[-100, 50, 70, -80, 90, -80, -50, 30, -90, -70, 80, -30, 10, -80, 90]], [[1, 5, 1, 2, 1, 1, 1, 1, -1, -1, -1, 0, -81, -1, -1, -1, -1]], [[1, 1, 2, -5, -1, -2, -4, -5, 6, 7, 8, 9, -6, -4, -1]], [[8, 0, 1, -1, 2, -2, 3, -3, 5, -4, 5, -5, 1]], [[-100, 50, 70, -80, 91, 30, -50, 100, -90, -70, 80, -30, -10, 10, -80, 90]], [[10, 90, -4, 7, -8, -4, -1, 0, -6, -9, 3, 2, 14, -1, -4, -4]]], "completion": "\n\n\ndef pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"\n return any(-x in l for x in l if x != 0)\n \n", "raw_completion": "```python\n\n\ndef pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"\n return any(-x in l for x in l if x != 0)\n \n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef pairs_sum_to_zero(l):\n \"\"\"\n pairs_sum_to_zero takes a list of integers as an input.\n it returns True if there are two distinct elements in the list that\n sum to zero, and False otherwise.\n >>> pairs_sum_to_zero([1, 3, 5, 0])\n False\n >>> pairs_sum_to_zero([1, 3, -2, 1])\n False\n >>> pairs_sum_to_zero([1, 2, 3, 7])\n False\n >>> pairs_sum_to_zero([2, 4, -5, 3, 5, 7])\n True\n >>> pairs_sum_to_zero([1])\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/44", "prompt": "\n\ndef change_base(x: int, base: int):\n \"\"\"Change numerical base of input number x to base.\n return string representation after the conversion.\n base numbers are less than 10.\n >>> change_base(8, 3)\n '22'\n >>> change_base(8, 2)\n '1000'\n >>> change_base(7, 2)\n '111'\n \"\"\"\n", "entry_point": "change_base", "canonical_solution": "\n\n if x == 0: return \"0\"\n ret = \"\"\n while x != 0:\n ret = str(x % base) + ret\n x //= base\n return ret\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(8, 3) == \"22\"\n assert candidate(9, 3) == \"100\"\n assert candidate(234, 2) == \"11101010\"\n assert candidate(16, 2) == \"10000\"\n assert candidate(8, 2) == \"1000\"\n assert candidate(7, 2) == \"111\"\n for x in range(2, 8):\n assert candidate(x, x + 1) == str(x)\n\n", "contract": "\n assert type(x) == int and type(base) == int, \"invalid inputs\" # $_CONTRACT_$\n assert x >= 0, \"invalid inputs\" # $_CONTRACT_$\n assert 2 <= base <= 9, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[8, 3], [9, 3], [234, 2], [16, 2], [8, 2], [7, 2], [2, 3], [3, 4], [4, 5], [5, 6], [6, 7], [7, 8]], "atol": 0, "plus_input": [[10, 5], [15, 4], [25, 6], [33, 7], [45, 8], [50, 9], [13, 5], [17, 3], [42, 8], [15, 2], [8, 4], [2, 3], [17, 8], [7, 8], [9, 5], [7, 6], [5, 8], [45, 7], [4, 9], [3, 3], [8, 8], [2, 8], [15, 7], [50, 5], [8, 7], [25, 5], [17, 9], [5, 9], [2, 6], [9, 9], [4, 4], [7, 7], [5, 4], [3, 7], [13, 7], [15, 3], [2, 2], [17, 7], [7, 5], [10, 8], [3, 6], [16, 8], [18, 2], [15, 5], [6, 6], [46, 8], [7, 9], [5, 6], [16, 2], [50, 2], [41, 8], [16, 4], [46, 5], [17, 2], [3, 2], [3, 9], [13, 8], [9, 6], [42, 7], [10, 4], [45, 6], [15, 8], [43, 7], [5, 5], [3, 5], [4, 3], [13, 9], [9, 8], [33, 9], [6, 3], [10, 7], [8, 9], [18, 7], [19, 7], [43, 5], [46, 7], [8, 5], [16, 7], [34, 3], [16, 6], [6, 4], [4, 6], [5, 7], [4, 5], [15, 6], [3, 4], [14, 5], [14, 6], [10, 9], [46, 6], [5, 2], [18, 9], [18, 8], [7, 4], [35, 9], [4, 8], [6, 5], [50, 7], [50, 8], [13, 4], [256, 5], [2019, 3], [34567, 9], [27, 3], [987654321, 8], [9999999, 9], [123456789, 3], [2669, 7], [48298461, 8], [245678, 7], [9999999, 8], [2019, 4], [987654321, 9], [245678, 8], [123456789, 8], [2019, 9], [6, 9], [2018, 9], [123456789, 4], [2, 4], [34567, 4], [9, 4], [256, 9], [48298461, 4], [245678, 3], [48298462, 9], [2669, 4], [1, 3], [2, 9], [48298462, 4], [2020, 3], [27, 2], [2669, 8], [4, 2], [2, 5], [245678, 9], [9, 7], [48298461, 2], [9999999, 6], [9999999, 5], [245678, 4], [26, 2], [7, 2], [2020, 4], [987654321, 3], [2018, 8], [34568, 9], [10, 2], [10, 3], [27, 8], [256, 4], [257, 4], [34568, 2], [9, 2], [34569, 2], [1, 2], [245678, 5], [2670, 7], [2, 7], [27, 9], [5, 3], [34567, 2], [34568, 4], [2669, 2], [26, 4], [123456789, 2], [2019, 8], [34569, 9], [6, 7], [34567, 3], [0, 3], [257, 8], [2669, 3], [26, 7], [2019, 5], [28, 3], [123456790, 8], [34567, 8], [257, 7], [48298461, 6], [256, 8], [2669, 6], [26, 6], [34568, 3], [27, 5], [26, 5], [9999999, 4], [48298460, 2], [2019, 6], [48298460, 9], [48298463, 6], [48298460, 7], [123456790, 9], [48298463, 9], [27, 6], [34569, 4], [27, 4], [34570, 9], [256, 3], [245679, 4], [245679, 8], [257, 9], [26, 3], [9999999, 2], [1, 6], [8, 3], [48298463, 8], [2669, 5], [123456791, 9], [257, 6], [0, 8], [123456790, 7], [257, 3], [245679, 9], [34570, 7], [1, 5], [123456790, 4], [48298462, 2], [9999999, 7], [34569, 3], [123456791, 4], [255, 5], [123456788, 4], [123456792, 4], [255, 6], [10000000, 8], [255, 9], [8, 6], [123456791, 3], [255, 2], [1, 8], [34568, 8], [10000000, 5], [255, 3], [48298461, 3], [48298461, 9], [123456790, 3], [34569, 7], [34570, 3], [123456789, 6], [123456788, 3], [257, 5], [987654321, 5], [2020, 9], [2018, 6], [1, 7], [48298461, 5], [6, 8], [48298462, 8], [34571, 7], [0, 7], [34571, 2], [28, 7], [34571, 4], [257, 2], [34569, 5], [11, 9], [48298461, 7], [48298462, 6], [245680, 4], [11, 6], [34568, 5], [10000000, 6], [48298462, 3], [2018, 3], [34569, 8], [245679, 5], [245680, 3], [10000000, 4], [10000000, 7], [9999999, 3], [34571, 6], [28, 9], [1, 4], [11, 7], [2670, 4], [0, 5], [123456791, 8], [123456788, 2], [9999998, 5], [34571, 8], [245679, 3], [123456792, 7], [34568, 7], [123456792, 5], [34568, 6], [123456788, 5], [2020, 2], [2670, 6], [48298460, 8], [245678, 6], [9999998, 3], [34570, 5], [48298460, 5], [10000000, 2], [123456792, 3], [2020, 8], [34571, 3], [245680, 8], [123456791, 7], [6, 2], [123456788, 8], [255, 8], [9, 3], [123456792, 2], [258, 5], [258, 9], [48298463, 3], [2671, 2], [245677, 4], [10000001, 2], [10000001, 8], [48298463, 4], [34570, 8], [34571, 9], [48298462, 7], [48298460, 4], [0, 9], [9999998, 2], [11, 3], [9999998, 6], [2671, 4], [2018, 2], [245676, 5], [123456791, 2], [9999998, 7], [28, 2], [28, 5], [10000001, 6], [34570, 2], [245676, 2], [11, 5], [2672, 5], [8, 2], [48298460, 6], [34570, 4], [256, 6], [123456790, 5], [48298464, 4], [2669, 9], [123456790, 2], [0, 2], [123456790, 6], [245677, 5], [2020, 7], [255, 4], [2019, 2], [28, 4], [10000001, 7], [48298464, 6], [30, 2], [25, 2], [123456788, 6], [258, 2], [26, 8], [245679, 6], [2018, 4], [0, 4], [34567, 7], [2018, 5], [27, 7], [10000000, 9], [987654320, 8], [245679, 7], [3, 8], [245677, 9], [34567, 6], [987654320, 6], [245677, 7], [245677, 6], [987654321, 6], [28, 8], [987654320, 9], [245677, 8], [987654320, 7], [987654320, 5], [4, 7], [245677, 3], [256, 2], [245678, 2], [26, 9], [245679, 2], [2670, 5], [2670, 8], [987654322, 6], [987654322, 2], [2017, 3], [2020, 5], [10000001, 4], [0, 6], [987654321, 2], [123456789, 9], [10000002, 6], [987654323, 2], [10000002, 7], [123456788, 9], [28, 6], [2017, 7], [25, 7], [2670, 9], [987654322, 8], [10000001, 9], [987654323, 4], [25, 3], [29, 2], [10, 6], [987654323, 7], [987654321, 4], [29, 3], [2020, 6], [987654320, 2], [245676, 3], [9999998, 9], [245676, 4], [245676, 9], [2016, 7], [987654319, 6], [987654319, 8], [10000002, 5], [2671, 6], [7, 3], [987654319, 4], [2017, 2], [987654319, 5], [2670, 3], [2018, 7], [25, 4], [987654319, 7], [10000001, 3], [256, 7], [2016, 5], [245677, 2], [34567, 5], [2017, 6], [29, 4], [10000001, 5], [29, 9], [48298462, 5], [987654320, 3], [9999998, 8], [48298463, 7], [987654323, 3], [2671, 8], [48298459, 2], [10000002, 2], [987654322, 4], [987654323, 6], [25, 9], [2016, 4], [245680, 7], [123456789, 7], [2668, 8], [123456789, 5], [987654322, 3], [245675, 4], [2017, 8], [987654321, 7], [48298463, 5], [48298459, 4], [987654322, 7], [48298459, 3], [12, 9], [2021, 2], [987654323, 8], [12, 8], [987654319, 9]], "completion": "\ndef change_base(x: int, base: int) -> str:\n return '' if x == 0 else change_base(x // base, base) + str(x % base)\n", "raw_completion": "```python\ndef change_base(x: int, base: int) -> str:\n return '' if x == 0 else change_base(x // base, base) + str(x % base)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef change_base(x: int, base: int):\n \"\"\"Change numerical base of input number x to base.\n return string representation after the conversion.\n base numbers are less than 10.\n >>> change_base(8, 3)\n '22'\n >>> change_base(8, 2)\n '1000'\n >>> change_base(7, 2)\n '111'\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/45", "prompt": "\n\ndef triangle_area(a, h):\n \"\"\"Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"\n", "entry_point": "triangle_area", "canonical_solution": "\n\n return a * h / 2\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(5, 3) == 7.5\n assert candidate(2, 2) == 2.0\n assert candidate(10, 8) == 40.0\n\n", "contract": "\n assert isinstance(a, (int, float)) and isinstance(h, (int, float)), \"invalid inputs\" # $_CONTRACT_$\n assert a > 0 and h > 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[5, 3], [2, 2], [10, 8]], "atol": 0, "plus_input": [[4, 6], [7, 2], [12, 5], [3, 4], [6, 10], [9, 12], [15, 20], [25, 30], [1, 1], [10, 7], [30, 30], [12, 4], [26, 25], [1, 4], [4, 7], [19, 20], [6, 6], [10, 1], [20, 20], [12, 12], [6, 5], [7, 7], [4, 12], [10, 10], [19, 12], [26, 11], [2, 11], [11, 7], [5, 19], [6, 2], [26, 12], [1, 25], [16, 15], [4, 3], [9, 9], [12, 13], [6, 11], [15, 21], [6, 16], [29, 30], [29, 29], [4, 4], [6, 15], [21, 30], [26, 26], [5, 7], [13, 12], [19, 19], [11, 11], [6, 21], [1, 16], [8, 7], [20, 19], [5, 20], [15, 15], [4, 10], [9, 10], [29, 10], [2, 2], [27, 26], [15, 8], [14, 15], [3, 2], [13, 13], [4, 9], [25, 25], [14, 6], [6, 7], [29, 15], [15, 13], [13, 20], [11, 26], [11, 8], [26, 15], [20, 22], [3, 3], [3, 14], [11, 10], [5, 11], [26, 13], [20, 16], [29, 13], [5, 6], [3, 12], [5, 21], [16, 20], [8, 21], [21, 14], [8, 10], [14, 14], [7, 3], [5, 4], [29, 26], [2, 3], [12, 28], [2, 14], [21, 20], [27, 4], [30, 29], [25, 21], [10.5, 3.5], [1000, 0.001], [2.5, 4], [true, 10], [1000000000000, 0.1], [5.5, 5.5], [1000.234, 550.123], [1e-06, 500000000], [1e-50, 1e+50], [1e+50, 1e-50], [1e-06, 1e-06], [2.5171570275185937, 4], [2.5, 1000000000000], [2.5, 5], [10.5, 3.7763622848915785], [10.5, 10.5], [0.09250267285921429, 1000], [3.0140143224731513, 5], [3.0140143224731513, 3.7763622848915785], [500000000, 500000000], [2.5, true], [1e-50, 1e-50], [3.0140143224731513, 3.0140143224731513], [1e+50, 1e+50], [5.5, 5.933203128831868], [4, 10.5], [304.11337213124403, 304.11337213124403], [6.351228473089266e-51, 1e+50], [2.5171570275185937, 2.5171570275185937], [2.5, 999999999999], [11.32261214198862, 10.5], [3.7763622848915785, 550.123], [4, 5], [14.768668237973262, 14.768668237973262], [500000001, 1000000000000], [6.351228473089266e-51, 1000000000000], [true, true], [1000000000000, 999999999999], [1000000000000, 500000000], [2.5, 2.5], [550.123, 550.123], [5.594645686633063, 5.933203128831868], [10.860558211363623, 3.7763622848915785], [2.5, 10.5], [1000000000001, 0.1], [10.5, 2.944801050034961], [304.7017291578964, 1e+50], [2.944801050034961, 1e-50], [1000000000000, 1000000000000], [2.944801050034961, 1000000000000], [2.5171570275185937, 500000001], [3.7763622848915785, 400.0476921945371], [6.351228473089266e-51, 6.351228473089266e-51], [5.933203128831868, 1000000000000], [1000, 0.0008819244812954113], [2.5171570275185937, 3.5], [2.5171570275185937, 2.654434753799174], [3.9008879248837105, 550.123], [2.5, 1.912103537027174], [3.0140143224731513, 1000000000001], [0.9697216977517569, 6.351228473089266e-51], [5.933203128831868, 5.594645686633063], [3.4652809018704174, 2.5], [3.7763622848915785, 3.7763622848915785], [1001, 0.0008819244812954113], [3.7763622848915785, 550.9464604050861], [500000001, 1.9656455435118383], [1001, 0.0010065362974608783], [3.6046772448926214, 3.6046772448926214], [10.5, 3.0140143224731513], [1000000000000, 999999999998], [3.280012252143434, 999999999998], [1000000000000, 0.0008819244812954113], [3.9008879248837105, 3.9008879248837105], [11.32261214198862, 0.0008819244812954113], [999999999998, 5], [2.944801050034961, 6.140317150374408e-51], [2.702723670662734, 999999999998], [0.6146614673790448, 1e-06], [2.968862381334059, 999999999999], [3.4652809018704174, 3.7763622848915785], [2.5, 2.7863944083610077], [5.933203128831868, 1000.234], [2.5, 10.96884213871541], [0.4033919011136194, 0.4033919011136194], [3.3276207140237215, 3.0140143224731513], [5.371412117716168, 5.933203128831868], [3.875523280977146, 3.0140143224731513], [6.351228473089266e-51, 2.944801050034961], [999999999998, 1000000000000], [1e-50, 7.812178926069052e+49], [1e-50, 5.594645686633063], [13.480958308989692, 0.0008819244812954113], [5.933203128831868, 1e+50], [0.6146614673790448, 1e+50], [3.4652809018704174, 1e+50], [1000000000001, 0.0008819244812954113], [500000000, 1000000000000], [3.7763622848915785, 399.4602512887493], [3.5, 6.351228473089266e-51], [1.0673642213468528e-50, 9.84945648409047e-51], [2.944801050034961, 304.11337213124403], [3.7454685188344277, 500000000], [6.351228473089266e-51, 3.0140143224731513], [2.944801050034961, 4], [0.4936953752559635, 0.9517175397135795], [7.969905813228654e+49, 399.4602512887493], [1.637374596492362, 1e+50], [304.7017291578964, 5.594645686633063], [3.5, 3.7763622848915785], [3.5, 1e-50], [420.7690765020686, 3.280012252143434], [0.1, 0.1], [589.979065005584, 550.9464604050861], [true, 9], [550.9464604050861, 2.944801050034961], [999999999998, 999999999999], [999999999999, 999999999998], [1000000000001, 500000001], [304.11337213124403, 0.9697216977517569], [3.875523280977146, 3.9008879248837105], [3.7454685188344277, 3.7454685188344277], [500000001, 9], [3.0140143224731513, 550.123], [3.4652809018704174, 4.283908123603071], [2.5, 2.0296538480668818], [3.3276207140237215, 3.3276207140237215], [5.933203128831868, 5.933203128831868], [1.9656455435118383, 1.9656455435118383], [6.351228473089266e-51, 0.001], [1.1490554776938622e+50, 2.702723670662734], [5.933203128831868, 1e-06], [9, 999999999999], [2.654434753799174, 2.5171570275185937], [2.5, 0.09250267285921429], [5, true], [3, 5], [0.7817326614876008, 9.84945648409047e-51], [2.5, 1000000000001], [999999999999, 500000001], [9.994131567452262, 3.2184036971992116], [2.968862381334059, 1000000000001], [0.000892498679469718, 0.3939374001878353], [2.5, 0.18106944719981674], [14.438338770643817, 0.0008819244812954113], [3.7763622848915785, 2.654434753799174], [1001, 1001], [3.6046772448926214, 2.5171570275185937], [1001, 999999999998], [1000, 0.6146614673790448], [13.480958308989692, 15.841514130026637], [0.09171547982908979, 0.001], [3.0140143224731513, 3.280012252143434], [2.968862381334059, 1000000000000], [8.7345680037675, 1.4378969913777674e-06], [6.60477221802488, 5.933203128831868], [1.0673642213468528e-50, 1.097798385610294e+50], [2.944801050034961, 500000001], [304.11337213124403, 277.92691648636287], [2.944801050034961, 2.944801050034961], [1001, 3.2184036971992116], [8.436986216437411, 1e+50], [6.140317150374408e-51, 5], [2.441907709963407, 10.96884213871541], [3.0140143224731513, 14.768668237973262], [3.033319650274528, 3.4652809018704174], [2.607199296199486, 10.5], [1.1516831895873947, 0.7697217147886755], [1000000000001, 10], [7.812178926069052e+49, 10.5], [3.0140143224731513, 4.644005626042233], [3.0140143224731513, 7.671717478682375e-51], [9.994131567452262, 7.969905813228654e+49], [0.20898316984005957, 0.20898316984005957], [1.1516831895873947, 1001], [3.6621164999522327, 3.7454685188344277], [1e+50, 2.7863944083610077], [0.6026770947089608, 1.5515192066475425], [1e-06, 1000000000001], [0.1, 1000000000000], [3.0140143224731513, 3.2582396789187547], [0.0718661171503449, 2.944801050034961], [1.1490554776938622e+50, 8.7345680037675], [1001, 2.03121563844987], [5, 5], [0.0008819244812954113, 0.0008819244812954113], [1000, 1000], [3.862761898750768, 1000000000000], [3, 999999999999], [1.1516831895873947, 1.1516831895873947], [2.8981476266724497, 2.7863944083610077], [0.4033919011136194, 3.0140143224731513], [10.5, 10.04973171300669], [0.6146614673790448, 0.6146614673790448], [1.955633115846987, 2.5171570275185937], [7.969905813228654e+49, 0.000892498679469718], [11.111073757664684, 399.4602512887493], [304.7017291578964, 1.9656455435118383], [549.6669048346089, 3.9008879248837105], [4.794518953850641, 4.794518953850641], [5.734287213931633, 5.933203128831868], [3.7454685188344277, 11.111073757664684], [7.969905813228654e+49, 3.0140143224731513], [3.280012252143434, 3.280012252143434], [3.037956426981518, 2.7863944083610077], [1.725006778745118, 1.1516831895873947], [1001, 1000000000000], [7.812178926069052e+49, 11.279588112345333], [999999999998, 999999999998], [14.768668237973262, 2.702723670662734], [1e+50, 0.42877480808894286], [0.6026770947089608, 2.998900970971135], [1.1516831895873947, 14.438338770643817], [1.4378969913777674e-06, 1.4378969913777674e-06], [2.654434753799174, 550.123], [0.6251271674999125, 0.6251271674999125], [3.7454685188344277, 9], [2.5171570275185937, 2.702723670662734], [2.8981476266724497, 2.8981476266724497], [3.280012252143434, 5.933203128831868], [14.438338770643817, 1.9656455435118383], [4.665398666653302, 5.5], [5.235248373941634, 2.5171570275185937], [999999999999, 999999999999], [3.4652809018704174, 3.4652809018704174], [1.3916697224644832e+50, 13.480958308989692], [2.2789244163895868, 1000.234], [0.09171547982908979, 3.5], [8.7345680037675, 5.594645686633063], [333.51227550642744, 5.734287213931633], [5.235248373941634, 2.998900970971135], [5.594645686633063, 2.7863944083610077], [11.15441836003326, true], [500000001, 1000000000001], [9.84945648409047e-51, 4.283908123603071], [304.7017291578964, 304.01008824251437], [2.851524593655582, 3.7763622848915785], [3.066985889062573, 999999999998], [9.33264056665255, 8.7345680037675], [589.979065005584, 1000000000000], [304.01008824251437, 5], [999999999997, 2.03121563844987], [1e-06, 0.09250267285921429], [2.0296538480668818, 4.644005626042233], [1.9129099568914203, 2.8053940598661615], [1000000000001, 1000000000002], [6.827786770016711e-51, 6.351228473089266e-51], [7.671717478682375e-51, 2.8981476266724497], [3.687208350682112, 3.049326487166235], [589.979065005584, 589.979065005584], [3.5, 13.480958308989692], [7.812178926069052e+49, 7.812178926069052e+49], [0.5969764171560052, 1.097798385610294e+50], [3.2582396789187547, 304.7017291578964], [2.856544549823999, 1001], [9.560154963854028, 2.301688592769729], [1.7837741983252546, 5], [3.6046772448926214, 1e+50], [9.84945648409047e-51, 3.3511589168364306], [550.9464604050861, 550.9464604050861], [1.9656455435118383, 2.5171570275185937], [11.279588112345333, 11.279588112345333], [2.441907709963407, 14.779981384753318], [0.18106944719981674, 0.0008819244812954113], [3.7763622848915785, 2.312809121647276], [1.4378969913777674e-06, 6.351228473089266e-51], [3.6338864535323308, 3.0140143224731513], [3, 1000], [8, 999999999997], [3.9008879248837105, 0.20898316984005957], [1.725006778745118, 2.654434753799174], [500000002, 0.1], [2.5, 1.9656455435118383], [3.037956426981518, 0.4033919011136194], [0.22415785893309084, 0.20898316984005957], [6.60477221802488, 5.5], [6.60477221802488, 2.1246067258982233], [549.6669048346089, 6.351228473089266e-51], [8, 8], [1.514708903074948, 1.1516831895873947], [304.11337213124403, 4.283908123603071], [999, 500000000], [6, 0.0011763529060220604], [304.01008824251437, 0.000892498679469718], [8.436986216437411, 8.436986216437411], [3.6338864535323308, 1e-06], [0.11289334265091495, 0.13099553205389838], [4, 13.11648252834381], [0.000892498679469718, 0.000892498679469718], [0.4033919011136194, 0.001], [0.6237210212535688, 0.001], [7.969905813228654e+49, 1.282144501068545e-50], [5.5, 1.1490554776938622e+50], [2.234984698888863, 333.51227550642744], [0.0011763529060220604, 6.351228473089266e-51], [1.0673642213468528e-50, 10.04973171300669], [9.560154963854028, 4.27091147693402], [7.812178926069052e+49, 1.4378969913777674e-06], [999999999997, 999999999998], [1.2556785207164284e+50, 1.097798385610294e+50], [2.5171570275185937, 304.11337213124403], [0.8887622085921509, 4.283908123603071], [999999999998, 500000000], [0.001, 0.001], [1.545815336874533, 304.11337213124403], [8, true], [1.1516831895873947, 0.1], [10, 4], [5.594645686633063, 0.0718661171503449], [2.998900970971135, 2.998900970971135], [4, 6.140317150374408e-51], [11.15441836003326, 3.2184036971992116], [1.813583165985591, 2.998900970971135], [1.9656455435118383, 550.9464604050861], [589.979065005584, 6.60477221802488], [1000000000000, 4], [14.05568828938279, 1e-50], [1000, 1001], [8.7345680037675, 304.7017291578964], [3.7763622848915785, 9.560154963854028], [2.905964252318878, 1.955633115846987], [13.604205114667401, 14.779981384753318], [true, 500000001], [7.8458823990267295, 9.560154963854028], [1001, 0.001], [2.702723670662734, 10], [14.779981384753318, 14.779981384753318], [0.09171547982908979, 0.0005869312950948745], [0.6237210212535688, 400.0476921945371], [4.879498151942725, 4.794518953850641], [5.734287213931633, 1001], [2.5171570275185937, 999999999999], [4.27091147693402, 0.001], [333.51227550642744, 1.097798385610294e+50], [8, 4], [3.875523280977146, 2.944801050034961], [0.6026770947089608, 3.174698774390269], [0.6026770947089608, 2.490929195847712], [4, 2.5171570275185937], [333.51227550642744, 0.42686056688899165], [6.351228473089266e-51, 6.827786770016711e-51], [10.04973171300669, 10.04973171300669], [500000002, 500000001], [3.259484252759964, 3.7838976206198947], [500000002, 500000000], [1e-50, 2.1246067258982233], [3.3197661199970594, 304.7017291578964], [333.51227550642744, 11.111073757664684], [18.950769019824136, 1.9656455435118383], [12.240281538434914, 12.240281538434914], [13.319692463483465, 10.04973171300669], [10.5, 1.955633115846987], [13.604205114667401, 1001], [2.851524593655582, 2.851524593655582], [5.5, 3.0429731122338364], [0.42686056688899165, 10.04973171300669], [14.779981384753318, 1e+50], [2.510668457454576, 7.812178926069052e+49], [9.84945648409047e-51, 2.654434753799174], [5.933203128831868, 999999999999], [6.098851344083411, 5.5], [2.510668457454576, 2.510668457454576], [1.2271875063959215e-50, 2.1246067258982233], [9.994131567452262, 9.994131567452262], [1.9656455435118383, 54.72828094135602], [400.0476921945371, 8.436986216437411], [2.0870142809524648, 3.7454685188344277], [0.15679708927114747, 3.0525124431290185], [true, 13.604205114667401], [9.560154963854028, 9.560154963854028], [2.2789244163895868, 2.968862381334059], [0.0005869312950948745, 9.84945648409047e-51], [2.702723670662734, 9], [8.7345680037675, 8.7345680037675], [1.9197013252602397, 2.441907709963407], [1.514708903074948, 1.4693169600875302], [8.020029419215433, 8.7345680037675], [0.6026770947089608, 0.6026770947089608], [10, 1000000000001], [1.0673642213468528e-50, 11.121686262046902], [10.220255434568307, 3.4652809018704174], [54.72828094135602, 14.866896817750803], [0.9036234950966294, 1.4378969913777674e-06], [303.4087129268291, 0.5969764171560052], [0.6251271674999125, 1e-50], [2.312809121647276, 2.5171570275185937], [2.3175034167817614, 1.9656455435118383], [8.7345680037675, 3.875523280977146], [1.8626364849141614, 3.174698774390269], [0.8887622085921509, 6.827786770016711e-51], [1.2769285921500888, 999999999999], [3.0905822402815604, 6.354357897088894], [15.918799001546322, 15.918799001546322], [3.4652809018704174, 999999999998], [13.11648252834381, 2.654434753799174], [11.111073757664684, 3.0905822402815604], [11.716851810187464, 12.240281538434914], [14.768668237973262, 3.0140143224731513], [3.0429731122338364, 4.402642372417788], [13.11648252834381, 0.000892498679469718], [0.22415785893309084, 0.22415785893309084], [14.768668237973262, 3.862761898750768], [11.32261214198862, 2.5171570275185937], [3.7454685188344277, true], [2.8053940598661615, 304.7017291578964], [0.0005869312950948745, 0.3939374001878353], [590.4954617610108, 589.979065005584], [2.5, 2.0427652504617875], [2.905964252318878, 3.037956426981518], [1.1516831895873947, 0.8655397197246333], [5.734287213931633, 999], [500000002, 9], [7.671717478682375e-51, 3.3813368428220913], [0.23363542862130937, 1e-50], [1000000000001, 1000000000001], [3.0429731122338364, 5.734287213931633], [333.51227550642744, 3.2582396789187547], [303.4087129268291, 2.312809121647276], [12.240281538434914, 1.6547629986987604], [2.998900970971135, 13.303574826111191], [9.387886646384953, 9.560154963854028], [2.8851910418849274, 2.0276571353113435], [0.562579842154142, 4.0666300912371804], [11.15441836003326, 3.6046772448926214], [0.000892498679469718, 0.5866217721476052], [9, 6], [3.7454685188344277, 5.683494585385186e+49], [0.43727468144641113, 11.111073757664684], [0.0010065362974608783, 0.7697217147886755], [13.11648252834381, 13.11648252834381], [0.13099553205389838, 3.862761898750768], [3.033319650274528, 7.812178926069052e+49], [1000, 3.3813368428220913], [5.235248373941634, 188.0942895677646], [15.513891130838266, 2.0296538480668818], [1001, 999999999999], [0.562579842154142, 1.955633115846987], [4.866060163973655, 550.123], [3.6621164999522327, 3.6621164999522327], [3.144025426925843, 3.9008879248837105], [1.2271875063959215e-50, 3.0640156914299244], [2.0870142809524648, 6.351228473089266e-51], [11.111073757664684, true], [2.5, 5.292469980695496], [2.3175034167817614, 0.000892498679469718], [3.3813368428220913, 6.354357897088894], [13.604205114667401, 1000], [0.0005869312950948745, 0.8655397197246333], [8.436986216437411, 3.9008879248837105], [3.8815947842262033, 0.562579842154142], [9, 999999999997], [3.7763622848915785, 10.702461747984978], [1.6547629986987604, 1.4378969913777674e-06], [999999999999, 1000000000000], [2.5, 6.909600955216463], [1000000000002, 499999999], [2.5, 2.407256478248396], [1000, 0.4936953752559635], [15.918799001546322, 11.279588112345333], [499999999, 500000000], [15.841514130026637, 15.513891130838266], [7.151031704481794e+49, 999999999999], [0.6026770947089608, 3.3276207140237215], [1.7837741983252546, 1.710390000212614e-50], [9.586130448338354, 10.860558211363623], [500000000, 499999999], [0.6146614673790448, 1.2819212511615293e+50], [5.594645686633063, 5.594645686633063], [1.6859502932503763, 1.1516831895873947], [304.3562548680278, 5.594645686633063], [6.909600955216463, 1000000000001], [6.60477221802488, 3.5], [500000001, 499999999], [0.4936953752559635, 0.4936953752559635], [4.794518953850641, 11.32261214198862], [5.5, 5.150384751173319], [15.691840496308831, 7.812178926069052e+49], [3.441306763932948, 1.955633115846987], [5.4705078542636985, 6.140317150374408e-51], [2.312809121647276, 2.312809121647276], [5.594645686633063, 3.8700323087876214], [8, 999999999998], [54.72828094135602, 413.092534152517], [0.6026770947089608, 2.8596777431094558], [0.4033919011136194, 8.436986216437411], [11.75986472241807, 14.779981384753318], [0.18106944719981674, 3.0429731122338364], [2.7863944083610077, 6.60477221802488], [10, 3], [5.933203128831868, 2.905964252318878], [9.560154963854028, 3.9008879248837105], [295.64175607593984, 0.000892498679469718], [5.784457831984944, 4.665398666653302], [10, 999], [8.7345680037675, 2.8053940598661615], [1.1490554776938622e+50, 249.75027757548597], [550.9464604050861, 304.8895804612961], [2.441907709963407, 10.04973171300669], [0.1485905046419096, 0.1485905046419096], [2.441907709963407, 2.441907709963407], [0.6146614673790448, 1.514708903074948], [499999999, 499999999], [3.033319650274528, 0.0008819244812954113], [1000, 0.0006140392383884579], [1000.234, 1.3630788305486801e+50], [4, 500000000], [1.3630788305486801e+50, 1.3630788305486801e+50], [5.974924402089755, 5.5], [1e+50, 3.5], [1.2548915767220992e-06, 500000000], [1000.234, 1.2548915767220992e-06], [5.5, 3.5], [0.001, 1.3630788305486801e+50], [1000.234, 1e-06], [550.0032433265208, 1.3630788305486801e+50], [8.069041860932906e+49, 1.0598538918942554e+50], [0.001, 1001], [550.0032433265208, 550.0032433265208], [550.123, 549.9027289880141], [485.63510270157553, 0.001], [3.5, 1e-06], [1.2548915767220992e-06, 1.2548915767220992e-06], [6, 500000000], [1.1500693869738566e-06, 1.2548915767220992e-06], [0.001, 1000], [1.3630788305486801e+50, 8.907222302866668e+49], [8.069041860932906e+49, 1.0580805187525374e+50], [6, 500000001], [8.114184754387546e+49, 1.0598538918942554e+50], [1001, 0.0005508636405061713], [2.797297289894419, 3.5], [5.974924402089755, 550.0032433265208], [0.000804346648273894, 1001], [6.92924132889435, 5.5], [549.3492377394188, 550.123], [4.772674948554135, 5.5], [1000.1834270152505, 1000.234], [8.015043666335268e+49, 8.069041860932906e+49], [500000001, 500000001], [5.7817609749760175, 5.5], [1000.234, 294.02079955093836], [1e-06, 1e+50], [1000.234, 1000.234], [767.3290355151506, 0.4542507960587521], [500000001, 1001], [0.0010316265792822956, 0.0010316265792822956], [499999999, 1000], [6.146820248386406, 5.974924402089755], [6.172984176264254, 4.312744584715087], [8.069041860932906e+49, 6.270108721907589e+49], [0.13932135029960732, 8.114184754387546e+49], [1e-50, 0.0006140392383884579], [1000.234, 1000], [294.02079955093836, 1e+50], [1000.234, 0.000804346648273894], [1001.0743515844817, 1000], [594.6585361139911, 1.3630788305486801e+50], [1459.3869630288782, 1001.0743515844817], [3.5, 3.5], [1000, 0.0006647983494232811], [1000.234, 639.7025803616297], [5.5, 767.3290355151506], [0.13932135029960732, 0.11937813506723759], [0.001, 4], [1e-50, 5.5], [5.7817609749760175, 1e-06], [9.983327741112275, 3.5142315083049835], [499999999, 5], [1000.234, 916.7189142883354], [1001.0743515844817, 500000000], [6.172984176264254, 4.3000771926188825], [5.974924402089755, 0.4542507960587521], [5.974924402089755, 8.907222302866668e+49], [1e-06, 0.1], [5.903881784005102, 5.974924402089755], [0.0006140392383884579, 1e+50], [0.0006647983494232811, 2.9883899064023636], [500000001, 0.24470918674655573], [0.5520481891140395, 0.1], [500000001, 0.19124041832697045], [5.5, 7.603869644900625], [0.0006140392383884579, 0.0006140392383884579], [1.1500693869738566e-06, 8.907222302866668e+49], [8.907222302866668e+49, 0.001], [1000.234, 600.8571902460975], [0.0006140392383884579, 5.5], [9.29913366383325e+49, 5.903881784005102], [5.7817609749760175, 4.837574582905011], [1002, 1001], [0.0005508636405061713, 1e+50], [594.6585361139911, 1.5911495641287068e+50], [1.4121078546231256e+50, 1.4121078546231256e+50], [500000001, 1002], [8.720589016261991e+49, 1.0598538918942554e+50], [500000001, 499999998], [6, 1000], [6.193315905177731e+49, 1e+50], [6.911842232100844, 1e-50], [1e-50, 0.0006647983494232811], [1001, 1.2548915767220992e-06], [5.974924402089755, 5.386215851000227], [6.92924132889435, 1.0580805187525374e+50], [8.015043666335268e+49, 639.7025803616297], [9.29913366383325e+49, 5.974924402089755], [1.3630788305486801e+50, 0.0010316265792822956], [0.0010154651915701967, 0.0010316265792822956], [767.3290355151506, 767.3290355151506], [1e+50, 8.015043666335268e+49], [1.2609505278442564e+50, 8.907222302866668e+49], [294.02079955093836, 1.4121078546231256e+50], [5.267448154730178, 6.172984176264254], [6.526686994059155, 5.5], [822.2055060209535, 767.3290355151506], [500000000, 1001], [1e-50, 0.2517146114391781], [5.5, 8.015043666335268e+49], [4.9260977190598565, 5.5], [499999999, 10], [3.5, 1.0598538918942554e+50], [10.5, 10.490447249302113], [1001.0743515844817, 999], [500000001, 0.202258074315077], [9.29913366383325e+49, 8.114184754387546e+49], [549.9027289880141, 803.43737854765], [5.903881784005102, 9.29913366383325e+49], [5.974924402089755, 5.974924402089755], [0.9280621984315783, 1001], [294.02079955093836, 294.02079955093836], [0.202258074315077, 1e-06], [594.6585361139911, 594.6585361139911], [8.015043666335268e+49, 0.000804346648273894], [6.193315905177731e+49, 6.193315905177731e+49], [1.3343133651227918e+50, 8.907222302866668e+49], [1.1500693869738566e-06, 0.7032009952181469], [1000.234, 1.5911495641287068e+50], [8.069041860932906e+49, 8.069041860932906e+49], [8.015043666335268e+49, 0.0006140392383884579], [2.5, 8.907222302866668e+49], [10.404351965432616, 10.5], [803.43737854765, 1.0580805187525374e+50], [0.0010154651915701967, 1001], [4.312744584715087, 6.146820248386406], [0.7868446941255465, 1e-50], [5.5, 822.2055060209535], [9.361837597510845e+49, 8.069041860932906e+49], [594.6585361139911, 595.5863196317731], [550.123, 3.5], [6.270108721907589e+49, 0.5520481891140395], [1.0598538918942554e+50, 1.0598538918942554e+50], [0.8037417021210681, 0.7032009952181469], [500000001, 0.22507983497707104], [0.2517146114391781, 916.7189142883354], [3.518685967627258, 594.6585361139911], [10.5, 0.1], [1.4121078546231256e+50, 485.63510270157553], [0.4542507960587521, 8.720589016261991e+49], [3.5142315083049835, 8.069041860932906e+49], [1.2548915767220992e-06, 8.114184754387546e+49], [1e-06, 3.5], [999, 499999998], [4.962880154636738, 8.907222302866668e+49], [1000.1834270152505, 1e+50], [500000003, 500000002], [0.9280621984315783, 549.3492377394188], [1e-06, 916.7189142883354], [1000.2394268990636, 550.123], [7.6737498519983935, 7.6737498519983935], [2.5, 1.276203748094594e+50], [0.8037417021210681, 548.8276535424473], [0.4542507960587521, 4.837574582905011], [999, 499999999], [7.105759464034772, 767.3290355151506], [695.8091600969792, 1000.234], [1.3630788305486801e+50, 9.992176917724965e+49], [3.5, 7.105759464034772], [500000003, 1.3630788305486801e+50], [6.061930287127616, 4.312744584715087], [485.63510270157553, 1.3128947147670992e+50], [6.061930287127616, 548.8276535424473], [1000.234, 0.07797070380124412], [0.9280621984315783, 499999998], [3.5, 10.5], [639.7025803616297, 0.1], [9.88396784199347, 9.88396784199347], [8.907222302866668e+49, 8.907222302866668e+49], [1e-06, 0.5520481891140395], [549.3492377394188, 803.43737854765], [0.000804346648273894, 0.000804346648273894], [5.5, 7.6737498519983935], [4.312744584715087, 4.312744584715087], [549.9727652573737, 3.5], [500000003, 499999998], [0.0008410540816875681, 0.000804346648273894], [0.2517146114391781, 0.000804346648273894], [4.772674948554135, 4.772674948554135], [0.001, 3], [1000.1960098031524, 9.992176917724965e+49], [550.123, 600.8571902460975], [0.19124041832697045, 0.19124041832697045], [6, 1000000000001], [1001, 10], [8.160241711251553e+49, 9.29913366383325e+49], [6.739083222128726, 0.1], [639.0733523762065, 0.1], [294.10124115248755, 295.00098750371177], [8.069041860932906e+49, 8.907222302866668e+49], [0.9247881751012205, 0.24470918674655573], [5.267448154730178, 8.015043666335268e+49], [822.2055060209535, 0.1], [456.1578303814912, 0.38843387915427663], [6.172984176264254, 0.22507983497707104], [1.2334585447714025e+50, 5.267448154730178], [485.63510270157553, 2.5], [999.6965952529107, 550.123], [10.490447249302113, 1e+50], [594.6585361139911, 550.123], [522.7942554783411, 550.123], [0.22507983497707104, 0.13932135029960732], [916.7189142883354, 1.3128947147670992e+50], [1.2478458236610548, 1e-50], [0.38843387915427663, 1e-50], [0.0010154651915701967, 0.000804346648273894], [9.361837597510845e+49, 1e-06], [456.1578303814912, 1e+50], [3.71357594772759, 9.29913366383325e+49], [5.974924402089755, 803.43737854765], [10.5, 6.193315905177731e+49], [1e-06, 0.0008410540816875681], [0.11937813506723759, 1000.234], [4.837574582905011, 916.7189142883354], [414.7107377757936, 0.1], [500000001, 500000000], [4, 500000001], [true, 0.001], [499999999, 999], [499999997, 499999997], [0.001, 0.0009276711988323191], [455.7970383157958, 1e+50], [3.9404843496046933, 0.0010154651915701967], [10.422002958791852, 10.422002958791852], [999.6965952529107, 0.001], [2.5128675755458665, 7.105759464034772], [9.29913366383325e+49, 822.2055060209535], [8.160241711251553e+49, 7.6737498519983935], [549.3492377394188, 10.490447249302113], [5.5, 549.3492377394188], [7.30990076118675e+49, 1.4121078546231256e+50], [550.123, 1.0580805187525374e+50], [6.526686994059155, 455.7970383157958], [0.0006140392383884579, 8.015043666335268e+49], [577.5592552891643, 695.8091600969792], [1.2609505278442564e+50, 0.0010316265792822956], [1.2334585447714025e+50, 7.526549464352233], [549.3492377394188, 5.5], [500000003, 6.146820248386406], [4.312744584715087, 6.92924132889435], [9.29913366383325e+49, 9.29913366383325e+49], [8.114184754387546e+49, 550.123], [455.7970383157958, 550.123], [1000, 10], [7.974496839187692, 5.5], [0.0014082326823942387, 0.001], [6.061930287127616, 6.061930287127616], [5.267448154730178, 4.791542019359697], [549.9092533811172, 8.015043666335268e+49], [500000001, 3], [549.9727652573737, 5.7817609749760175], [7.769321291285576, 1.2334585447714025e+50], [5.147431849021719e+49, 8.114184754387546e+49], [0.11937813506723759, 0.2517146114391781], [1001.3872384163295, 1001.0743515844817], [4.327812772387224, 4.658083846954506], [484.7742452591313, 1.3128947147670992e+50], [4.312744584715087, 9.939539320939666], [456.1578303814912, 456.1578303814912], [0.0010366218326548584, 0.0010366218326548584], [1000.234, 499999997], [548.8276535424473, 548.8276535424473], [696.3053462592248, 485.63510270157553], [5.267448154730178, 9.939539320939666], [10, 0.001], [999.6965952529107, 999.6965952529107], [4.9260977190598565, 0.0009276711988323191], [0.7087647107963838, 0.8735022534214422], [0.5520481891140395, 8.720589016261991e+49], [5, 499999999], [6.193315905177731e+49, 8.625076751984068], [3.2405719205775565, 7.658048480320529], [1.0598538918942554e+50, 8.069041860932906e+49], [0.15523794245751846, 0.7032009952181469], [1000, 0.1], [6.92924132889435, 6.92924132889435], [1001.3872384163295, 600.8571902460975], [0.2872373907775382, 0.38843387915427663], [6, 1002], [549.9027289880141, 2.5], [1.2609505278442564e+50, 0.000804346648273894], [7.769321291285576, 0.13932135029960732], [499999998, 499999999], [6.92924132889435, 5.903881784005102], [549.9727652573737, 0.0006647983494232811], [7.056912549536895, 0.13932135029960732], [2.5, 1.0186449354129719e+50], [4.837574582905011, 4.837574582905011], [0.0008410540816875681, 1e+50], [171.65942130687165, 1.4121078546231256e+50], [499999997, 0.0006140392383884579], [1000.1960098031524, 1e-06], [1.4121078546231256e+50, 3.5], [5.147431849021719e+49, 548.8276535424473], [true, 499999999], [1000.234, 499999998], [4.3000771926188825, 7.6737498519983935], [549.9727652573737, 1459.3869630288782], [4.3000771926188825, 0.202258074315077], [522.7942554783411, 550.1316336478457], [5.147431849021719e+49, 5.147431849021719e+49], [7.056912549536895, 595.5863196317731], [7.603869644900625, 0.202258074315077], [5.5379365114689865, 639.7025803616297], [0.11937813506723759, 550.123], [0.22507983497707104, 6.172984176264254], [3.905142554837278, 3.905142554837278], [484.7742452591313, 0.19124041832697045], [500000001, 599.4476511090689], [10.329830569369943, 0.1], [1001, 3], [0.9280621984315783, 5.386215851000227], [600.8571902460975, 0.0010366218326548584], [999, 999], [10.329830569369943, 1.3630788305486801e+50], [1001, 6.229947285377706], [1.9634064227234154, 550.123], [0.13932135029960732, 11.178404308824208], [639.7025803616297, 639.7025803616297], [1.2691522215004502e+50, 1.2691522215004502e+50], [500000003, 1000], [594.6585361139911, 1000.234], [550.123, 11.178404308824208], [10.5, 10.14613224857702], [6.911842232100844, 5.998834559163835], [696.3053462592248, 696.3053462592248], [1e-50, 8.015043666335268e+49], [1e-50, 4.772674948554135], [500000001, true], [5, 500000001], [1.2609505278442564e+50, 1.2609505278442564e+50], [171.65942130687165, 639.7025803616297], [695.4045369598745, 696.3053462592248], [6.92924132889435, 1.409139478012455e+50], [549.9027289880141, 171.65942130687165], [7.603869644900625, 7.603869644900625], [0.2517146114391781, 0.2517146114391781], [1.3343133651227918e+50, 0.0014082326823942387], [500000001, 1000], [7.582770372047262, 1.0580805187525374e+50], [3.8487886624206227, 3.8487886624206227], [9.88396784199347, 696.3053462592248], [999, 10], [0.7032009952181469, 0.38843387915427663], [6.739083222128726, 295.00098750371177], [500000000, 500000001], [639.7025803616297, 171.65942130687165], [1000.1960098031524, 1000.1960098031524], [8.720589016261991e+49, 4.837574582905011], [1001.3872384163295, 803.899039609307], [0.11937813506723759, 2.9142916394548886], [4.091243020011593, 9.29913366383325e+49], [6, 599.4476511090689], [334.99192343571764, 550.123], [1.2334585447714025e+50, 1.2334585447714025e+50], [6.992183551199873, 7.231551081385231], [7.658048480320529, 1e+50], [8.19868343255902e+49, 8.907222302866668e+49], [1000, 999], [4.772674948554135, 10.5], [true, 5], [500000001, 5], [0.7883243761745513, 0.8037417021210681], [1001, 2.797297289894419], [6.92924132889435, 7.512522727184062], [1000.234, 163.36233559394003], [5.974924402089755, 0.38600856735515987], [8.015043666335268e+49, 639.9920782277771], [0.8978611439326938, 0.8037417021210681], [485.63510270157553, 485.63510270157553], [0.0009276711988323191, 0.1442589155457731], [519.8238114362156, 549.9027289880141], [7.853555205001856, 5.398908191906165], [1.2609505278442564e+50, 0.13932135029960732], [1001, 1000], [639.7025803616297, 4.837574582905011], [0.11937813506723759, 1000.5238317055768], [1.2609505278442564e+50, 6.92924132889435], [500000001, 4.358967740434391], [6.229947285377706, 7.769321291285576], [6.739083222128726, 600.8571902460975], [3.71357594772759, 3.5], [8.160241711251553e+49, 0.000804346648273894], [0.8978611439326938, 8.069041860932906e+49]], "completion": "\nimport numpy as np\n\ndef triangle_area(a, h):\n \"\"\"\n Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"\n return 0.5 * np.multiply(a, h)\n", "raw_completion": "```python\nimport numpy as np\n\ndef triangle_area(a, h):\n \"\"\"\n Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"\n return 0.5 * np.multiply(a, h)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef triangle_area(a, h):\n \"\"\"Given length of a side and high return area for a triangle.\n >>> triangle_area(5, 3)\n 7.5\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/46", "prompt": "\n\ndef fib4(n: int):\n \"\"\"The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fib4(0) -> 0\n fib4(1) -> 0\n fib4(2) -> 2\n fib4(3) -> 0\n fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use recursion.\n >>> fib4(5)\n 4\n >>> fib4(6)\n 8\n >>> fib4(7)\n 14\n \"\"\"\n", "entry_point": "fib4", "canonical_solution": "\n \n if n == 0:\n return 0\n elif n == 1:\n return 0\n elif n == 2:\n return 2\n elif n == 3:\n return 0\n else:\n a, b, c, d = 0, 0, 2, 0\n for i in range(4, n + 1):\n a, b, c, d = b, c, d, a + b + c + d\n return d\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(5) == 4\n assert candidate(8) == 28\n assert candidate(10) == 104\n assert candidate(12) == 386\n\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n >= 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[5], [8], [10], [12]], "atol": 0, "plus_input": [[1], [2], [3], [4], [6], [7], [9], [11], [15], [20], [5], [19], [21], [16], [17], [14], [18], [22], [10], [8], [0], [12], [13], [23], [24], [41], [25], [98], [26], [27], [82], [81], [80], [40], [99], [83], [84], [39], [100], [28], [29], [97], [85], [86], [30], [95], [87], [31], [32], [33], [34], [42], [43], [101], [79], [88], [96], [38], [94], [93], [89], [92], [37], [44], [35], [45], [102], [103], [36], [91], [105], [104], [106], [90], [50], [46], [49], [51], [47], [78], [77], [52], [48], [53], [76], [107], [54], [108], [109], [72], [73], [71], [74], [68], [67], [110], [70], [55], [500], [1000], [999], [998], [997], [1001], [1003], [498], [499], [1004], [1002], [1005], [996], [497], [75], [61], [62], [63], [64], [496], [501], [995], [502], [503], [66], [65], [504], [505], [495], [494], [493], [492], [1006], [491]], "completion": "\nimport numpy as np\n\ndef fib4(n: int):\n if n == 0 or n == 1:\n return 0\n arr = np.zeros(n+1, dtype=int)\n arr[2] = 2\n for i in range(3, n+1):\n arr[i] = arr[i-1] + arr[i-2] + arr[i-3] + arr[i-4]\n return arr[n]\n", "raw_completion": "```python\nimport numpy as np\n\ndef fib4(n: int):\n if n == 0 or n == 1:\n return 0\n arr = np.zeros(n+1, dtype=int)\n arr[2] = 2\n for i in range(3, n+1):\n arr[i] = arr[i-1] + arr[i-2] + arr[i-3] + arr[i-4]\n return arr[n]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef fib4(n: int):\n \"\"\"The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fib4(0) -> 0\n fib4(1) -> 0\n fib4(2) -> 2\n fib4(3) -> 0\n fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use recursion.\n >>> fib4(5)\n 4\n >>> fib4(6)\n 8\n >>> fib4(7)\n 14\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/47", "prompt": "\n\ndef median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"\n", "entry_point": "median", "canonical_solution": "\n\n sorted_l = sorted(l)\n if len(l) % 2 == 1:\n return sorted_l[len(l) // 2]\n else:\n return (sorted_l[len(l) // 2 - 1] + sorted_l[len(l) // 2]) / 2\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([3, 1, 2, 4, 5]) == 3\n assert candidate([-10, 4, 6, 1000, 10, 20]) == 8.0\n assert candidate([5]) == 5\n assert candidate([6, 5]) == 5.5\n assert candidate([8, 1, 3, 9, 9, 2, 7]) == 7 \n\n", "contract": "\n assert len(l) > 0, \"invalid inputs\" # $_CONTRACT_$\n assert all([isinstance(v, (int, float)) for v in l]), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[3, 1, 2, 4, 5]], [[-10, 4, 6, 1000, 10, 20]], [[5]], [[6, 5]], [[8, 1, 3, 9, 9, 2, 7]]], "atol": 0, "plus_input": [[[10, 20, 30, 40, 50]], [[-5, -3, 0, 3, 5]], [[1, 3, 7, 8, 10, 10]], [[2, 2, 2, 2, 2, 2]], [[2, 5, 8, 11, 14]], [[1, 1, 1, 2, 3, 4]], [[-1, 0, 1]], [[100]], [[7, 9, 3, 5]], [[0, 0, 0, 0, 0, 0, 1]], [[1, 11, 3, 7, 8, 10, 10]], [[1, 1, 1, 3, 4]], [[0, 0, 0, 0, 1]], [[1, 1, 2, 2, 3, 4, 1]], [[100, 100]], [[1, 3, -1, 7, 8, 8, 10, 10, 8, 8]], [[1, 1, 1, 2, 2, 3, 4, 1, 1]], [[1, 3, 8, 10, 10]], [[1, 1, 2, 2, 3, 4, 1, 4]], [[1, 3, -1, 7, 8, 8, 10, 10, 8]], [[0, 0, 0, 0, 0, 0, 1, 0]], [[1, 11, 1, 3, 7, 8, 10, 10, 7]], [[1, 3, -1, 7, 8, 0, 10, 10, 8]], [[1, 1, 1, 2, 2, 3, 4, 1, 1, 1]], [[0, 0, 0, 1]], [[0, 0, 0, 11, 0, -1, 0, 1, 0]], [[0, 0, 10, 9, 0]], [[14, 100]], [[13, 15, 100]], [[10, 20, 4, 30, 40, 50]], [[1, 11, 4, 7, 8, 10, 7, 10]], [[7, 5, 9, 3, 5]], [[10, 20, -1, 30, 40, 50]], [[13, 0, 0, 1, 1, 0]], [[0, 0, 100, 1]], [[-5, -3, 0, 3, 5, 0]], [[1, 1, 1, 3, 4, 1]], [[14, 1, 3, 7, 8, 10, 10]], [[10, 20, 4, 30, 13, 2, 40, 50]], [[1, 1, 1, 4, 9, 1]], [[10, 20, 4, 30, 13, 2, 40, 50, 30]], [[14, 15, 100]], [[1, 11, 4, 7, 8, 10, 7, 10, 8]], [[100, 99, 100]], [[1, 1, 1, 2, 3, 4, 4]], [[10, 4, 30, 40, 51]], [[1, 1, 1, 3, 1, 1, 4]], [[0, 0, 2, 0, 0, 0, 0, 1, 0]], [[0, 2, 2, 2, 2, 2, 2]], [[7, 9, 3, 3, 5, 3]], [[-5, -3, 0, 3, 6]], [[1, 1, 2, 2, 3, 4, 1, 4, 4]], [[7, 10, 3, 3, 5, 3, 3]], [[7, 5]], [[7, 10, 3, 3, 3, 5, 3, 3, 3]], [[1, 1, 1, 2, 3, 4, 1, 4, 4]], [[1, 1, 1, 0, 9, 1]], [[1, 1, 8, 2, 8, 3, 5, 1]], [[1, 1, 2, 2, 3, 4, 1, 3, 4]], [[1, 1, 1, 2, 3, 6, 99, 4, 4]], [[1, 1, 4, 8, 8, 3, 5, 1]], [[1, 30, 2, 3, 4, 1, 3, 4, 4]], [[1, 3, 7, 8, 8, 10, 8]], [[6, 1, 3, -1, 7, 8, 8, 10, 10, 8, 8]], [[0, 0, 40, 2]], [[2, 5, 40, 8, 11, 14]], [[-5, -3, 0, 3, 5, -5]], [[-5, -3, 0, 4, 5]], [[0, 0, 0, 11, 0, -1, 0, 1, 6, 0]], [[0, 0, 14, -1, 0, 1]], [[-5, -3, 0, 4, 5, 0]], [[10, 1, 1, 1, 3, 4]], [[-5, 50, 0, 3, 6]], [[1, 3, -1, 9, 7, 8, 0, 10, 10, 8]], [[1, 4, 1, 8, 2, 8, 3, 5, 1]], [[1, 1, 20, 2, 3, 6, 99, 4, 4, 1, 2]], [[1, 1, 1, 3, 1, 4]], [[1, 3, 7, 8, 3, 10]], [[1, 1, 1, 2, 2, 3, 4, 1, 1, 3]], [[-1, -3, 0, 3, 5, -6, 0, 0]], [[1, 1, 2, 3, 4, 4]], [[1, 51, 1, 1, 4, 9, 1]], [[10, 20, 30, 40, 50, 50]], [[1, 4, 30, 8, 2, 8, 3, 5, 1]], [[-5, -3, 0, 3, -5]], [[7, 8, 5]], [[1, 1, 1, 14, 2, 2, 3, 4, 1, 4]], [[0, 0, 9, 0, 0, 0]], [[19, 7, 9, 3, 5]], [[1, 1, 2, 5, 2, 3, 4, 1, 3, 4]], [[7, 5, 9, 3, 5, 5]], [[1, 3, -1, 7, 8, 8, 10, 10, -3]], [[10, 20, -1, 40, 50, -1]], [[9, 3, 5]], [[0, 2, 2, 1, 2, 2, 2, 2]], [[7, 5, 9, 3, 5, 4]], [[-5, 51, 50, 0, 3, 6]], [[2, 5, 8, 11, 14, 14]], [[-5, 51, 50, 0, 6]], [[9, 11, 1, 2, 6, 8, 3, 15, 15]], [[10, 9, 8, 7, 6, 5, 4, 3]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 19.7]], [[2.7, 3.8, 7, 13, 74, 108.3]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 8]], [[10, 9, 8, 6, 5, 4, 3, 4]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 8, 2]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 6.1]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 2, 9, 8, 7, 6, 4, 3, 2, 1]], [[10, 8, 6, 5, 4, 3]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, 77, 12, 13, 14, 15, 16, 17, 18, 19, 20, 2]], [[2, 3, 5, 6, 8, 10, 12, 14, 20, 22]], [[2, 5, 6, 8, 10, 12, 14, 19, 22, 8, 2]], [[10, 8, 6, 5, 4, 3, 4]], [[2, 4, 5, 99, 8, 10, 12, 14, 20, 22, 8, 6]], [[3.5, 5.7, 6.1, 7.2, 13.0, 14.5, 19.7, 6.1]], [[3, 4, 5, 8, 12, 14, 20, 22, 8, 2, 4]], [[2, 4, 65, 5, 6, 8, 12, 14, 20, 22, 8, 2]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2]], [[10, 9, 8, 7, 4, 6, 5, 4, 3]], [[2, 4, 6, 8, 10, 12, 14, 20, 22]], [[10, 9, 8, 6, 5, 4, 11, 3, 4, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 55, 20]], [[49, 2, 6, 5, 6, 8, 10, 12, 14, 20, 22, 8, 2, 14, 14]], [[49, 2, 6, 5, 6, 10, 12, 14, 20, 22, 8, 2, 14, 14]], [[2, 5, 6, 8, 10, 12, 14, 19, 22, 8, 2, 12]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 6]], [[3.5, 5.7, 108.3, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 6.1]], [[2, 4, 6, 10, 12, 47, 20, 22]], [[10, 9, 8, 7, 4, 6, 6, 4, 3]], [[10, 9, 8, 8, 4, 6, 5, 4, 3]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 10]], [[6, 5, 4, 3]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 59, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81]], [[2, 4, 5, 65, 5, 6, 8, 12, 14, 20, 22, 8, 66, 2]], [[10, 9, 8, 6, 5, 63, 4, 3, 4]], [[2, 4, 5, 6, 8, 25, 12, 14, 20, 22]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 13, 10, 2, 9, 8, 7, 6, 4, 3, 2, 1]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[6, 5, 4, 2, 77, 77]], [[2, 4, 5, 6, 8, 10, 12, 14, 21, 21, 22, 8, 2, 21, 8]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 3, 0, 2, 1]], [[10, 3, 8, 17, 6, 5, 63, 4, 3, 4]], [[3.5, 5.7, 6.1, 7.2, 13.0, 14.5, 19.7, 20.313196843325887, 6.1]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 6, 10]], [[2, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 5]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 6, 4]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 16.8, 19.7]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[2, 5, 6, 8, 10, 12, 14, 19, 22, 8, 12]], [[10, 9, 8, 6, 5, 4, 3]], [[2, 4, 5, 6, 11, 8, 10, 12, 14, 20, 22, 8, 2]], [[6, 5, 4, 2, 77, 7, 77, 7]], [[10, 9, 8, 7, 6, 5, 4, 3, 5]], [[10, 9, 74, 8, 6, 5, 63, 4, 3, 4]], [[2, 4, 5, 8, 10, 14, 11, 20, 22, 8, 2, 6, 4]], [[11, 10, 9, 8, 6, 4, 3, 6]], [[2, 5, 6, 8, 10, 12, 13, 19, 22, 8, 2, 8]], [[20, 19, 33, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 3, 0, 2, 1]], [[10, 3, 8, 17, 6, 5, 63, 4, 4]], [[2, 3, 5, 6, 8, 10, 12, 14, 20, 22, 8]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 17]], [[10, 9, 2, 74, 8, 6, 5, 63, 4, 3, 4]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17]], [[3.5, 5.7, 6.1, 21.08302178845001, 7.2, 13.0, 14.5, 19.7, 20.313196843325887, 6.1]], [[49, 2, 6, 5, 69, 6, 10, 12, 14, 20, 22, 8, 2, 14, 14, 6]], [[2, 5, 6, 8, 25, 12, 14, 20, 22]], [[10, 9, 2, 35, 74, 8, 6, 5, 63, 3, 3, 4]], [[4, 5, 6, 8, 10, 14, 21, 20, 22, 8, 2]], [[10, 9, 7, 8, 7, 4, 6, 5, 4, 3]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5]], [[2, 4, 6, 8, 12, 14, 20, 22, 10]], [[2, 5, 8, 10, 14, 11, 20, 22, 8, 2, 6, 4]], [[49, 2, 6, 5, 6, 10, 12, 14, 20, 22, 8, 33, 2, 14, 14]], [[2, 4, 5, 65, 5, 6, 12, 14, 20, 22, 8, 66, 2, 14]], [[2, 4, 65, 8, 5, 6, 8, 12, 14, 20, 22, 8, 2]], [[10, 9, 74, 6, 5, 63, 4, 3, 4]], [[10, 9, 8, 7, 6, 5, 83, 4, 3]], [[2, 4, 65, 5, 6, 8, 12, 14, 20, 22, 8, 2, 14]], [[2, 5, 6, 8, 10, 12, 13, 19, 22, 8, 8]], [[2, 4, 6, 8, 10, 13, 14, 20, 22, 8]], [[10, 9, 7, 6, 5, 45, 83, 4, 3]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 79, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2, 31, 5, 65, 5, 6, 12, 14, 73, 22, 8, 66, 2, 14]], [[10, 9, 8, 6, 5, 4, 3, 6]], [[7, 2, 5, 6, 8, 10, 12, 13, 19, 22, 8, 8]], [[3.5, 8.444288359340977, 6.1, 7.2, 10.0, 12.209142157602413, 13.0, 16.8, 19.7]], [[9, 8, 8, 4, 6, 5, 4, 3]], [[7, 8, 7, 55, 4, 6, 5, 4, 3]], [[2, 13, 4, 65, 8, 5, 6, 8, 12, 14, 20, 4, 22, 8, 2]], [[2, 4, 6, 8, 12, 14, 91, 20, 22, 10]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 14]], [[20, 19, 33, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 3, 0, 2, 1, 0, 10]], [[2, 4, 5, 6, 11, 8, 10, 12, 14, 20, 8, 12, 2]], [[10, 9, 7, 7, 7, 4, 6, 5, 4, 3]], [[2, 4, 6, 8, 10, 13, 14, 20, 22, 8, 10]], [[10, 9, 74, 6, 5, 63, 5, 3, 4, 3]], [[10, 9, 8, 0, 6, 5, 4, 3, 9]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 16, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81]], [[19, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[2, 4, 6, 8, 12, 14, 20, 22, 10, 2]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 6]], [[2, 4, 6, 8, 10, 14, 20, 22, 8, 10, 2]], [[4, 5, 6, 8, 10, 14, 21, 20, 8, 2]], [[10, 3, 8, 17, 6, 5, 4, 4]], [[2, 4, 5, 6, 8, 10, 14, 20, 8, 2, 6]], [[14, 5, 6, 8, 10, 14, 20, 22, 8, 5, 8, 6]], [[6, 5, 4, 2, 77, 7, 53, 7]], [[10, 3, 8, 17, 6, 5, 4, 4, 3, 4]], [[3.5, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1]], [[10, 3, 8, 17, 6, 5, 18, 4, 4]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 6, 10, 14]], [[10, 9, 8, 7, 5, 83, 4, 3]], [[10, 9, 8, 7, 4, 6, 6, 4, 3, 9]], [[2, 4, 5, 6, 8, 3, 12, 14, 20, 22, 8, 5, 3]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 10, 2, 9, 8, 7, 6, 4, 3, 2, 1]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 22, 8, 2, 8]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 5]], [[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]], [[3.5, 4.972052479951237, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1]], [[2, 4, 5, 11, 8, 10, 12, 14, 20, 22, 8, 2]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 31, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 8, 2, 15, 8]], [[2, 4, 6, 8, 87, 13, 14, 20, 22, 8, 8]], [[1, 2, 3, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[9, 8, 8, 4, 6, 5, 4, 67, 3]], [[2, 5, 6, 8, 10, 12, 14, 19, 22, 67, 2, 12, 2]], [[63, 9, 8, 7, 6, 5, 4, 3, 5]], [[3.5, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 14.5]], [[2, 4, 5, 11, 8, 10, 12, 14, 22, 8, 2]], [[1, 2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 79, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 4]], [[10.12356677785131, 3.5, 5.128879860111899, 108.3, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 3.660183044477323, 6.1]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 10, 14]], [[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 14]], [[10, 9, 8, 8, 4, 6, 5, 4, 3, 6]], [[2, 4, 6, 8, 10, 13, 14, 20, 22, 8, 20]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 14, 12]], [[1, 2, 3, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7]], [[10, 9, 8, 7, 6, 5, 4, 3, 9]], [[4, 6, 8, 10, 12, 14, 20, 22, 22]], [[2, 4, 6, 11, 8, 10, 12, 14, 20, 8, 12, 2]], [[2, 31, 5, 65, 5, 6, 12, 14, 73, 22, 8, 66, 2]], [[2, 5, 4, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5]], [[10, 9, 8, 7, 6, 5, 83, 9, 4, 3]], [[2, 4, 5, 6, 11, 8, 10, 12, 20, 8, 12, 2]], [[2, 4, 5, 6, 8, 10, 12, 14, 15, 22]], [[6, 4, 2, 77, 77]], [[8, 4, 5, 7, 8, 57, 12, 14, 15, 22]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 6, 1]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 10, 2, 9, 8, 7, 6, 4, 3, 2]], [[9, 8, 7, 6, 5, 4, 3, 5, 5]], [[3, 8, 17, 6, 5, 4, 4, 3, 4]], [[2, 77, 3, 5, 6, 8, 10, 12, 14, 20, 22, 8]], [[2, 31, 5, 65, 5, 6, 12, 14, 73, 22, 8, 66, 2, 12]], [[2, 5, 6, 8, 25, 12, 14, 20, 22, 5]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 83, 4]], [[3.5, 5.7, 108.3, 6.1, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1]], [[7, 5, 4, 2, 77, 7, 53, 7]], [[4, 5, 6, 9, 8, 10, 14, 21, 20, 22, 8, 2]], [[2, 9, 4, 5, 8, 10, 14, 20, 22, 8, 2, 8]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 10]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 2, 5, 8]], [[3.5, 5.7, 6.1, 13.0, 13.0, 14.5, 16.8, 19.7, 6.1]], [[10, 9, 8, 7, 4, 6, 6, 4, 3, 9, 6, 6]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 41, 87, 89, 91, 93, 95, 97, 99]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 59, 8, 2, 14]], [[2, 4, 5, 6, 11, 8, 10, 12, 20, 5, 12, 2]], [[39, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 49, 13, 14, 15, 17, 18, 19, 20]], [[20, 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17, 18]], [[10, 9, 7, 7, 7, 4, 5, 4, 3]], [[10, 3, 8, 6, 5, 4, 5, 3, 4]], [[10, 9, 8, 6, 5, 4, 3, 17, 5]], [[1, 2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5]], [[2, 71, 5, 6, 8, 10, 12, 13, 19, 8, 2, 8]], [[2, 5, 8, 10, 14, 11, 20, 22, 8, 2, 6, 4, 5]], [[5, 6, 5, 4, 2, 77, 7, 53, 7, 5]], [[2, 4, 65, 6, 8, 12, 14, 20, 22, 8, 2, 14]], [[10, 9, 63, 8, 7, 4, 6, 35, 6, 4, 3]], [[3.5, 8.444288359340977, 6.1, 7.2, 10.0, 12.209142157602413, 13.0, 16.8, 19.7, 19.7]], [[2.7, 3.8, 7, 13, 74, 108.3, 108.3]], [[2, 5, 6, 2, 8, 10, 12, 14, 19, 23, 8, 2, 5]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 59, 8, 99, 14]], [[9, 12, 1, 79, 12, 6, 8, 3, 15, 15]], [[2, 4, 5, 65, 11, 8, 10, 12, 14, 20, 8, 12, 2]], [[10, 9, 2, 35, 74, 8, 6, 51, 63, 3, 3, 4]], [[63, 19, 18, 17, 16, 15, 14, 13, 12, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 18]], [[2, 8, 6, 8, 10, 12, 14, 19, 23, 8, 2]], [[2, 5, 4, 6, 8, 13, 12, 14, 19, 53, 8, 2, 5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 59, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 51, 75, 77, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81, 19]], [[7, 2, 5, 6, 8, 10, 12, 13, 19, 8, 8]], [[4, 6, 10, 79, 12, 14, 55, 20, 22, 22]], [[10, 9, 2, 74, 8, 6, 5, 63, 4, 3, 5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81, 71]], [[2, 5, 6, 8, 12, 13, 19, 22, 8, 2, 8]], [[10, 9, 7, 7, 7, 4, 5, 4]], [[2, 4, 6, 6, 8, 10, 14, 20, 22, 8, 2, 8]], [[3, 8, 6, 5, 4, 5, 3, 4, 5]], [[10, 9, 8, 6, 5, 3, 3, 17, 5, 8]], [[3, 4, 5, 8, 12, 14, 20, 22, 8, 2]], [[2, 4, 4, 21, 5, 11, 8, 10, 12, 14, 22, 8, 2]], [[2, 4, 6, 8, 10, 13, 6, 14, 20, 22, 8, 20]], [[2, 4, 5, 99, 8, 10, 12, 14, 20, 22, 8, 6, 2]], [[2, 4, 5, 6, 8, 12, 14, 20, 22, 20]], [[39, 3, 8, 17, 6, 5, 4, 4, 17]], [[10, 19, 2, 74, 8, 6, 63, 4, 3, 4]], [[3.5, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 14.5, 6.1]], [[9, 12, 1, 79, 29, 12, 6, 8, 15, 15, 6]], [[2, 4, 65, 5, 6, 8, 12, 6, 14, 20, 22, 8, 2, 4, 6]], [[2, 4, 99, 6, 8, 10, 14, 20, 22, 8, 2, 8, 6, 4]], [[2, 9, 4, 8, 10, 3, 14, 20, 22, 8, 2, 8]], [[21, 2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 8]], [[1, 2, 5, 6, 8, 10, 53, 12, 14, 19, 53, 2, 21]], [[49, 2, 6, 5, 6, 51, 12, 14, 20, 22, 8, 2, 14, 14]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 12]], [[3.5, 5.7, 4.111430745195583, 108.3, 6.1, 7.2, 13.0, 14.5, 16.8, 19.7, 6.1]], [[2, 3, 5, 11, 6, 8, 10, 12, 14, 20, 22]], [[7, 8, 7, 55, 4, 6, 5, 7, 4, 3]], [[9, 8, 8, 4, 12, 6, 5, 4, 3]], [[2, 4, 6, 8, 10, 13, 14, 20, 22, 2, 8, 20]], [[2, 4, 7, 10, 12, 47, 20, 22]], [[6, 53, 5, 4, 3]], [[49, 2, 6, 5, 6, 10, 12, 14, 20, 22, 8, 33, 2, 14, 13, 49]], [[52, 1, 2, 5, 6, 8, 10, 53, 14, 19, 53, 2, 21]], [[19, 18, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 6, 1]], [[19, 18, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 95, 2, 6, 1, 15]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10]], [[10, 9, 8, 6, 5, 63, 4, 3, 20, 8]], [[2, 5, 6, 8, 10, 12, 14, 19, 81, 22, 8, 12]], [[3, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 10, 5]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 83, 4, 22]], [[2, 5, 6, 8, 1, 10, 12, 14, 19, 22, 8, 2, 12]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 17, 17]], [[2, 4, 6, 6, 8, 5, 10, 14, 20, 22, 8, 2, 8]], [[2, 4, 6, 8, 10, 13, 14, 20, 81, 8, 20]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 9, 19, 20]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 22, 8, 2, 8, 8]], [[0, 0, 0, 0, 6, 11, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 5, 6, 8, 10, 12, 13, 19, 8, 8]], [[3.5, 4.972052479951237, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 3.8, 19.7, 6.1, 5.94681395028438]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 75, 8, 6, 10]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[5, 6, 4, 2, 77, 7, 53, 7, 5]], [[3.5, 5.7, 108.3, 6.1, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 16.8]], [[5, 6, 8, 10, 13, 14, 19, 53, 2, 5, 14]], [[10, 9, 2, 35, 74, 8, 6, 37, 51, 63, 3, 3, 4]], [[2, 4, 5, 99, 8, 10, 12, 14, 95, 20, 22, 8, 6, 1, 4]], [[2.7, 3.8, 13, 74, 108.3]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 10]], [[4, 5, 6, 11, 8, 10, 12, 20, 5, 12, 2]], [[49, 2, 6, 5, 6, 8, 10, 12, 20, 8, 2, 14, 14, 14]], [[10, 9, 8, 6, 8, 63, 4, 3, 20, 8]], [[2, 4, 6, 6, 8, 5, 10, 14, 20, 22, 22, 8, 2, 8]], [[45, 5, 4, 2, 77, 77]], [[6, 5, 4, 69, 77]], [[0, 0, 0, 0, 6, 11, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 11]], [[2, 3, 5, 6, 10, 12, 14, 20, 22, 8, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 3]], [[2, 11, 4, 6, 8, 10, 12, 14, 20, 22, 14]], [[3.5, 5.7, 6.1, 13.0, 13.0, 14.5, 16.8, 19.7, 6.1, 5.7]], [[2, 4, 6, 8, 87, 13, 14, 19, 22, 8, 8]], [[10, 3, 8, 17, 6, 5, 4, 4, 3, 4, 10]], [[3.5, 5.7, 6.1, 7.2, 13.0, 14.5, 19.126359711810302, 6.1]], [[10, 9, 8, 7, 4, 6, 6, 4, 3, 9, 4]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 5, 6, 20]], [[10, 9, 7, 6, 4, 45, 83, 4, 3]], [[2, 4, 5, 63, 11, 8, 10, 12, 14, 20, 8, 12, 2]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 2, 8, 4, 2]], [[10, 8, 6, 5, 4, 3, 35]], [[10, 9, 8, 7, 4, 6, 5, 79, 3]], [[49, 6, 5, 6, 8, 10, 12, 20, 8, 2, 14, 14, 14]], [[10, 8, 4, 6, 5, 4, 3, 4, 4]], [[10, 9, 8, 7, 4, 6, 6, 3]], [[45, 5, 4, 2, 77, 77, 45]], [[1, 2, 3, 2, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7, 1]], [[2.7, 3.8, 7, 5, 74, 108.3, 2.7]], [[10, 19, 2, 74, 8, 6, 9, 63, 4, 3, 4]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 14, 5, 8]], [[1, 3, 8, 17, 6, 5, 63, 4, 3, 4]], [[10, 9, 7, 6, 5, 45, 83, 4]], [[1, 2, 3, 2, 5, 57, 6, 7, 91, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7]], [[39, 2, 3, 5, 6, 7, 8, 9, 11, 12, 49, 13, 14, 15, 17, 18, 19, 20]], [[2, 4, 5, 6, 11, 8, 10, 12, 13, 20, 8, 12, 2, 8]], [[10, 9, 7, 8, 7, 4, 6, 5, 4, 4]], [[2, 5, 6, 9, 8, 10, 12, 14, 19, 22, 8, 2, 6]], [[10, 9, 8, 6, 8, 63, 4, 4, 3, 20, 8]], [[10, 9, 8, 6, 5, 3, 17, 5]], [[10, 9, 11, 7, 7, 7, 4, 5]], [[10, 9, 51, 8, 4, 6, 5, 4, 3, 6, 8]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 22, 6, 4]], [[19, 18, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 95, 2, 6, 3, 1, 15]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 17, 4, 3, 2, 17]], [[19, 18, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 95, 2, 7, 6, 1, 15]], [[1, 2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2]], [[2, 4, 5, 87, 8, 6, 8, 10, 14, 20, 8, 2, 15, 8, 8]], [[10, 9, 83, 2, 74, 8, 6, 5, 63, 3, 3, 5]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 13, 10, 2, 9, 8, 7, 6, 4, 3, 2, 1, 1]], [[3.5, 4.972052479951237, 5.7, 5.94681395028438, 7.2, 14.5, 3.8, 19.7, 6.1, 5.94681395028438]], [[4, 10, 9, 8, 7, 6, 5, 4, 3]], [[2, 91, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 12]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 10, 2, 9, 7, 6, 69, 4, 3, 2, 1, 1]], [[3.5, 5.7, 21.08302178845001, 108.3, 6.1, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 16.8]], [[3.5, 8.444288359340977, 6.1, 7.2, 10.0, 12.209142157602413, 13.0, 16.8, 19.7, 3.5, 3.5]], [[3.5, 5.7, 5.94681395028438, 7.2, 14.5, 16.8, 19.7, 6.1, 14.5, 16.8]], [[2, 5, 10, 14, 11, 20, 22, 8, 2, 6, 4]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 14, 8]], [[9, 11, 0, 1, 2, 6, 8, 3, 15, 15, 11]], [[9, 8, 6, 8, 63, 4, 3, 20, 8]], [[3.5, 5.7, 7.2, 10.0, 10.0, 3.5, 14.5, 16.8, 19.7, 12.5, 14.5, 6.1]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 4, 4, 3, 2, 1, 10]], [[2, 5, 4, 7, 8, 13, 12, 14, 19, 53, 8, 2, 5]], [[3.5, 4.972052479951237, 5.7, 4.656314960148508, 5.94681395028438, 14.5, 19.7, 6.1, 5.94681395028438]], [[10, 9, 8, 41, 4, 6, 3]], [[9, 8, 8, 4, 5, 5, 4, 67, 3, 8]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 22, 8, 8, 8]], [[3.5, 4.972052479951237, 5.7, 7.2, 14.5, 3.8, 19.7, 6.1, 5.94681395028438]], [[2, 5, 6, 8, 25, 43, 12, 14, 20, 22, 5]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 23, 5, 79, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 4]], [[2, 77, 51, 3, 5, 6, 6, 8, 10, 12, 14, 20, 22, 8, 20]], [[10, 3, 8, 7, 17, 6, 5, 63, 4, 4, 8, 5]], [[10, 8, 6, 4, 5, 4, 3, 3]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 59, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81, 53]], [[3.5, 5.7, 6.1, 7.2, 13.0, 14.5, 19.7, 6.1, 6.1]], [[2, 3, 5, 6, 8, 9, 11, 12, 49, 13, 15, 17, 18, 19, 20]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 6]], [[4, 6, 8, 12, 14, 20, 22]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[2, 4, 5, 6, 23, 10, 14, 20, 22, 8, 2, 8, 6, 4]], [[2, 8, 5, 6, 8, 10, 14, 19, 23, 8, 2, 14]], [[10, 3, 8, 17, 6, 37, 18, 4, 4]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 6]], [[53, 5, 4, 3]], [[3.5, 5.7, 5.94681395028438, 7.2, 14.5, 3.8, 19.7, 6.1, 5.94681395028438]], [[66, 9, 74, 8, 6, 5, 63, 4, 3, 4]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 6, 4, 4, 3, 2, 1, 10, 4, 17]], [[2, 4, 5, 6, 8, 3, 12, 14, 20, 22, 9, 5, 3, 3]], [[2, 4, 8, 5, 6, 8, 10, 14, 20, 22, 8, 75, 8, 6, 10]], [[20, 19, 33, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 6, 4, 3, 0, 2, 1]], [[3.5, 5.7, 21.08302178845001, 108.3, 6.1, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 16.8, 16.8]], [[6, 6, 5, 4, 69, 77]], [[2, 4, 5, 65, 5, 6, 12, 14, 20, 22, 8, 66, 77, 14]], [[27, 6, 5, 4, 2, 77, 7, 53, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 11, 12, 13, 14, 15, 16, 17, 18, 55, 20]], [[2, 4, 5, 8, 6, 8, 10, 14, 22, 8, 8, 8, 2]], [[54, 7, 5, 4, 2, 77, 7, 53, 7]], [[2, 4, 5, 6, 11, 8, 12, 13, 20, 8, 12, 2, 8, 11]], [[3.5, 5.7, 6.1, 7.2, 13.0, 14.5, 19.7, 6.1, 6.1, 6.1]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 6, 6, 5, 4, 3, 2, 1, 17, 15]], [[10, 3, 8, 6, 18, 4, 4]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 6]], [[6, 75, 5, 4, 2, 77, 7, 54, 7]], [[0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 4, 5, 6, 8, 10, 12, 14, 20, 20, 22, 6, 4]], [[10, 9, 8, 7, 6, 5, 4, 3, 5, 7]], [[2, 4, 5, 6, 11, 8, 10, 12, 8, 99, 12, 2]], [[3.5, 5.7, 5.94681395028438, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1, 14.5, 5.686907690298172]], [[7, 8, 7, 55, 5, 6, 5, 7, 4]], [[11, 10, 9, 6, 4, 3, 6]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 10, 2, 9, 7, 6, 69, 3, 2, 1, 1]], [[3.5, 4.972052479951237, 5.7, 4.656314960148508, 5.94681395028438, 14.5, 5.686907690298172, 19.7, 6.1, 5.94681395028438]], [[5, 6, 8, 10, 13, 14, 19, 53, 2, 5, 14, 5]], [[2, 4, 5, 6, 8, 10, 14, 20, 8, 2, 8, 6, 10, 14, 4]], [[6, 5, 21, 4, 2, 77, 77]], [[2, 4, 5, 6, 8, 5, 10, 12, 14, 15, 22]], [[10, 9, 8, 7, 4, 6, 5, 71, 4, 3, 6]], [[5, 5, 21, 85, 4, 2, 77, 77, 4]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 29, 8, 2, 8, 8]], [[10, 9, 74, 6, 5, 63, 5, 29, 3, 4, 74, 3]], [[19, 18, 15, 14, 13, 12, 11, 9, 8, 7, 6, 5, 4, 95, 2, 7, 6, 1, 15, 10]], [[19, 18, 16, 15, 14, 13, 12, 11, 39, 10, 9, 8, 7, 6, 4, 10, 2, 6, 1, 15, 11]], [[1, 2, 19, 3, 4, 5, 6, 8, 23, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 6]], [[20, 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17, 18, 12]], [[2.7, 3.8, 7, 5, 74, 108.3]], [[9, 8, 6, 0, 8, 63, 4, 3, 20, 8]], [[10.12356677785131, 3.5, 10.0, 5.128879860111899, 108.3, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 3.660183044477323, 6.1]], [[10, 3, 8, 17, 1, 5, 4, 4, 5]], [[9, 20, 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17, 18, 12]], [[10, 9, 6, 7, 7, 7, 4, 5, 4, 7]], [[2, 4, 5, 6, 11, 8, 12, 13, 20, 8, 12, 2, 8, 11, 2]], [[10, 3, 8, 17, 6, 5, 63, 4, 25]], [[83, 2, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 5]], [[6, 5, 4]], [[2, 4, 5, 65, 6, 12, 14, 20, 22, 8, 66, 77, 14]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 13]], [[2, 4, 5, 8, 87, 8, 6, 8, 10, 14, 20, 8, 2, 15, 8, 8]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 6.1]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 8, 2, 15, 8, 4]], [[2, 4, 5, 99, 8, 10, 5, 12, 14, 20, 22, 64, 6]], [[10, 9, 7, 9, 6, 4, 45, 83, 4, 3]], [[29, 10, 9, 8, 6, 5, 4, 3, 6, 4]], [[6, 4, 2, 8, 77]], [[2, 4, 5, 6, 7, 11, 8, 12, 13, 20, 8, 12, 2, 8, 11, 2]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 83, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2, 4, 5, 11, 8, 10, 12, 14, 20, 22, 8, 2, 8, 22]], [[10, 8, 7, 4, 6, 5, 71, 4, 3, 6, 6]], [[2, 4, 5, 99, 8, 10, 12, 14, 20, 22, 8, 6, 2, 20, 10]], [[2, 57, 5, 8, 6, 8, 10, 14, 20, 29, 8, 2, 8, 8]], [[2, 5, 6, 8, 21, 10, 11, 20, 13, 19, 22, 8, 2, 8]], [[2, 5, 6, 2, 10, 12, 14, 19, 23, 8, 2, 5]], [[65, 4, 5, 6, 8, 10, 12, 14, 20, 22, 6]], [[10, 9, 7, 6, 4, 45, 83, 4, 3, 3]], [[2, 4, 6, 6, 8, 5, 10, 14, 20, 22, 8, 2, 8, 4]], [[4, 5, 18, 11, 8, 10, 12, 20, 5, 2]], [[10, 3, 8, 6, 5, 4, 5, 3, 4, 5]], [[10, 3, 8, 17, 6, 37, 18, 4, 4, 6]], [[2, 5, 65, 6, 2, 8, 10, 12, 20, 14, 19, 23, 8, 2, 5]], [[9, 11, 0, 1, 2, 6, 8, 3, 15, 15, 11, 0]], [[7, 8, 7, 55, 6, 5, 7, 4]], [[2, 53, 5, 4, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5]], [[2, 5, 6, 8, 10, 12, 13, 19, 22, 8, 8, 8]], [[10, 65, 8, 6, 5, 3, 6]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17, 12]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 18]], [[20, 19, 18, 17, 15, 14, 13, 12, 13, 10, 2, 9, 8, 7, 6, 4, 3, 2, 1, 1]], [[10, 9, 7, 7, 7, 4, 6, 5, 4, 3, 8, 7]], [[12, 1, 79, 12, 6, 8, 3, 15, 15]], [[2, 53, 5, 4, 6, 8, 10, 12, 19, 53, 8, 2]], [[39, 2, 3, 5, 6, 7, 8, 9, 11, 12, 49, 13, 14, 15, 17, 18, 19, 20, 3]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 17, 20]], [[19, 18, 15, 14, 13, 12, 11, 9, 8, 7, 6, 5, 4, 95, 2, 6, 17, 6, 1, 15, 10]], [[3, 4, 5, 8, 14, 20, 22, 8, 2]], [[10, 8, 7, 4, 6, 5, 71, 4, 3, 6, 6, 71]], [[6, 5, 2, 77, 7, 53, 49, 49]], [[65, 4, 5, 6, 8, 10, 14, 20, 22, 6]], [[9, 20, 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 17, 18, 12]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 2, 15, 8, 4]], [[2, 4, 6, 8, 10, 12, 14, 5, 20, 22]], [[2, 5, 6, 16, 10, 12, 14, 19, 53, 8, 2, 5, 10]], [[2, 4, 65, 6, 8, 12, 14, 22, 8, 2, 14, 14]], [[10, 9, 8, 6, 5, 63, 5, 4, 3, 20, 8]], [[2.7, 3.8, 7, 13, 74]], [[13.0, 5.7, 108.3, 108.0001842492734, 6.1, 7.2, 10.0, 14.5, 16.8, 19.7, 6.1]], [[10, 3, 8, 69, 18, 4, 69]], [[2, 4, 6, 8, 12, 13, 14, 91, 20, 22, 10]], [[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 63, 13, 14, 15, 16, 17, 18, 19, 20]], [[10, 9, 7, 7, 7, 5, 4, 3]], [[1, 2, 3, 2, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20]], [[10, 3, 8, 17, 6, 47, 4, 4, 3, 4, 10]], [[10, 8, 6, 5, 4, 11, 4, 8, 5]], [[2, 4, 99, 6, 8, 10, 14, 20, 22, 8, 2, 8, 63, 4]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 23, 2, 14]], [[15, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[2, 3, 5, 6, 59, 9, 11, 12, 49, 13, 15, 17, 18, 19, 20, 11]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 4, 10, 10, 6]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 17, 20]], [[10, 9, 2, 35, 74, 8, 5, 5, 63, 3, 3, 4]], [[4, 5, 6, 9, 20, 8, 10, 14, 21, 20, 22, 8, 2]], [[2, 4, 5, 11, 8, 10, 12, 14, 20, 22, 8, 2, 2, 8, 22]], [[2, 5, 6, 8, 10, 12, 13, 19, 79, 8, 8]], [[2, 53, 5, 4, 6, 73, 8, 10, 12, 14, 19, 53, 8, 2, 5]], [[2, 8, 5, 6, 8, 10, 12, 14, 19, 22, 14, 5, 8]], [[9.209631610320102, 3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 16.8, 19.7]], [[1, 3, 5, 7, 9, 11, 20, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 81, 71]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19, 20, 13]], [[52, 1, 2, 5, 6, 8, 10, 53, 14, 19, 53, 2]], [[2, 5, 6, 8, 10, 12, 14, 19, 81, 22, 8, 12, 12]], [[3.5, 5.7, 6.1, 21.08302178845001, 7.2, 13.0, 14.5, 20.751071616864014, 19.7, 20.313196843325887, 6.1]], [[3.5, 4.972052479951237, 5.7, 4.656314960148508, 5.94681395028438, 14.5, 19.7, 7.2, 5.94681395028438]], [[2, 5, 6, 8, 10, 12, 9, 14, 31, 19, 22, 8, 12, 6]], [[2, 5, 21, 6, 8, 10, 12, 14, 19, 81, 22, 8, 12]], [[2, 4, 65, 5, 6, 8, 12, 6, 14, 20, 22, 8, 2, 4, 6, 6]], [[2, 8, 5, 59, 6, 8, 10, 12, 13, 19, 22, 8, 8, 8, 13]], [[9, 20, 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 7, 95, 6, 5, 4, 3, 17, 18, 12]], [[2, 5, 6, 33, 25, 12, 14, 20, 22, 5]], [[2, 4, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 20]], [[2, 5, 6, 8, 10, 12, 14, 19, 53, 8, 2, 5, 10, 53, 19]], [[10, 8, 4, 6, 5, 4, 3, 4, 4, 8]], [[2, 4, 5, 8, 6, 8, 10, 14, 20, 29, 8, 2, 8, 8, 2, 4]], [[2, 12, 6, 9, 8, 10, 12, 14, 19, 22, 8, 2, 6]], [[2, 4, 5, 6, 8, 10, 14, 20, 22, 8, 8, 83, 4]], [[2, 8, 5, 6, 8, 10, 12, 14, 23, 2, 14, 12]], [[10, 10, 9, 8, 7, 4, 6, 2, 6, 4, 3]], [[3.5, 5.7, 6.1, 13.0, 13.0, 14.5, 3.660183044477323, 19.7, 6.1, 5.7, 5.7]], [[10, 3, 8, 7, 17, 6, 5, 62, 4, 4, 8, 5, 5]], [[2, 5, 6, 33, 25, 12, 14, 20, 22, 5, 25]], [[10, 9, 7, 6, 4, 0, 45, 83, 3]], [[2, 77, 3, 5, 6, 8, 10, 12, 54, 14, 20, 22, 8, 3]], [[2, 5, 6, 8, 25, 43, 12, 14, 22, 5]], [[2, 5, 65, 35, 12, 14, 20, 22, 15, 8, 66, 77, 14]], [[2, 5, 6, 8, 10, 12, 14, 19, 23, 8, 2, 5, 8, 10]], [[10, 9, 8, 8, 4, 6, 5, 4, 3, 4]], [[3.5, 5.7, 6.1, 7.2, 10.0, 2.7, 13.0, 14.5, 16.8, 19.7]], [[10.12356677785131, 3.5, 10.0, 5.128879860111899, 108.3, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 3.660183044477323, 6.1, 10.0]], [[2, 4, 5, 6, 8, 9, 11, 12, 13, 12, 14, 15, 16, 17, 20]], [[4, 6, 12, 14, 20, 20, 22]], [[1, 2, 3, 2, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 1, 2]], [[6, 4, 2, 17, 77]], [[20, 19, 18, 17, 16, 15, 14, 13, 11, 10, 9, 8, 7, 95, 6, 5, 4, 3, 2, 17]], [[2, 5, 6, 8, 25, 12, 14, 20, 22, 5, 6]], [[10, 9, 2, 74, 8, 6, 5, 63, 4, 33, 4]], [[10]], [[3, 3, 3, 3, 3, 3]], [[10, 20, 30, 40]], [[-10, -5, 0, 5, 10]], [[1.5, 2.75, -3.25, 4.0, 0.5]], [[10, 10]], [[10, 10, 10, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]], [[3.14, -3.14]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 2, 15]], [[9, 11, 1, 2, 6, 8, 3, 15, 2, 25]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 2, 1, 7]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 3]], [[9, 11, 1, 2, 5, 6, 8, 3, 15, 15, 2, 15]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[9, 11, 1, 2, 5, 6, 8, 3, 15, 15]], [[9, 11, 1, 2, 5, 17, 8, 3, 15, 15]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4]], [[9, 11, 1, 2, 6, 73, 8, 3, 15, 2, 25]], [[20, 19, 51, 18, 17, 74, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[2.7, 7, 74, 108.3]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 7]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[3.5, 6.1, 7.2, 10.0, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7]], [[10, 9, 8, 7, 6, 4, 4, 3]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 1, 15]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 19.7, 7.2]], [[9, 11, 1, 2, 6, 8, 3, 4, 15, 15]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 1, 6, 5, 4, 3, 2, 1, 7]], [[0, 0, 55, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2.7, 13.0, 7, 13, 74, 3.8]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27]], [[2.7, 7, 13, 74, 3.8]], [[20, 19, 18, 61, 16, 15, 14, 13, 12, 11, 10, 9, 8, 23, 6, 16, 4, 3, 2, 1, 7]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[11, 1, 2, 6, 8, 3, 4, 15, 15]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1, 16]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[2, 3, 4, 5, 6, 65, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 4, 19, 20]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99]], [[2, 4, 5, 6, 8, 83, 12, 14, 20, 22]], [[3, 5, 7, 9, 11, 13, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 49, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27]], [[0, 0, 55, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2, 4, 6, 6, 8, 83, 12, 20, 22]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 16.8]], [[3.5, 6.1, 7.2, 10.0, 7.2, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7]], [[3.5, 5.7, 6.1, 7.2, 9.002985377555673, 12.5, 13.0, 14.5, 16.8, 19.7, 7.2]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 81, 9, 9, 9, 9, 9, 10, 10, 10, 10, 9]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 19.7, 10.0]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 1, 15, 15]], [[2.7, 3.8, 7, 69, 74]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 8]], [[20, 19, 95, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 17]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 1]], [[0, 0, 55, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[20, 19, 18, 17, 16, 15, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 23, 18, 14]], [[11, 1, 2, 6, 8, 4, 73, 15]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 1]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 2, 37, 7]], [[2.7, 13.0, 7, 51, 3.8]], [[3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27, 57]], [[3.5, 6.1, 5.7, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8]], [[10, 9, 8, 7, 6, 5, 4, 3, 3]], [[10, 2, 7, 6, 4, 4, 3]], [[20, 19, 18, 17, 16, 15, 89, 13, 12, 11, 10, 9, 7, 6, 16, 4, 3, 2, 1, 89]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 14.42427393794269]], [[2.7, 13.0, 7, 8, 13, 74, 3.8]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[11, 5, 1, 2, 7, 8, 3, 4, 15, 15]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55]], [[3.5, 6.1, 7.2, 13.0, 10.0, 4.136783373043628, 7.2, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7]], [[2.7, 7, 13, 75, 3.8]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 0]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 0, 7]], [[9, 11, 1, 2, 8, 3, 15, 15, 1, 15]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 89]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 4]], [[20, 19, 18, 17, 16, 15, 14, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 14]], [[9, 11, 1, 2, 17, 8, 3, 83, 16]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 6.1]], [[2, 3, 4, 5, 6, 8, 65, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 4]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1, 16, 67, 4]], [[3.5, 5.7, 6.1, 7.2, 9.002985377555673, 4.837062573049252, 12.5, 13.0, 14.5, 16.8, 19.7, 7.2]], [[2.7, 13.0, 7, 77, 8, 13, 74]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 16.8, 12.5]], [[20, 19, 67, 18, 74, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1, 16]], [[10, 9, 8, 7, 5, 4, 3, 3, 9]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 91, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55, 51]], [[11, 5, 1, 2, 7, 8, 3, 4, 15, 6, 15]], [[9, 11, 2, 6, 8, 3, 15, 15, 1, 15, 15, 8]], [[19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4]], [[2, 4, 75, 6, 6, 8, 83, 12, 20, 22]], [[6, 13.0, 7, 13, 74, 3.8, 13]], [[3.5, 6.1, 10.0, 7.2, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 16.8]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1, 17]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 77, 8, 7, 6, 4, 3, 2, 1, 16]], [[3.5, 5.7, 8.697319710424937, 7.2, 10.0, 12.5, 11.133332587842302, 13.0, 16.8, 12.5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 2, 37, 7, 37]], [[0, 0, 55, 0, 23, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[10, 9, 14, 7, 6, 5, 4, 3, 7]], [[20, 19, 95, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 6, 16, 4, 3, 2, 1, 4, 17]], [[2, 4, 75, 6, 61, 6, 8, 83, 12, 20, 22]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 14.42427393794269, 3.5]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10]], [[2.945266333073926, 2.7, 13.0, 7, 8, 13, 74, 3.8]], [[2, 4, 75, 6, 61, 6, 8, 83, 20, 22]], [[1, 3, 5, 7, 9, 13, 15, 17, 20, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55, 51, 3]], [[19, 18, 17, 16, 15, 14, 51, 12, 11, 73, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 3]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 13, 11, 10, 9, 8, 7, 6, 17, 3, 2, 1, 16, 67, 4]], [[95, 20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 8]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 25, 97]], [[9, 11, 1, 2, 91, 6, 8, 3, 15, 2, 15]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2.7, 3.8, 7, 69, 8, 74]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 6.1, 12.5]], [[9, 11, 1, 2, 5, 17, 3, 15]], [[20, 51, 18, 17, 74, 16, 16, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[20, 19, 18, 17, 16, 15, 8, 27, 83, 11, 10, 9, 6, 4, 3, 2, 1]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 8, 7, 7, 4, 3, 2, 0, 7]], [[9, 11, 1, 39, 6, 8, 3, 15, 15, 1, 15, 15]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 14.213498962327462, 19.7, 14.42427393794269, 3.5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 97, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 67, 87, 89, 91, 93, 95, 97, 99, 25, 97]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 19, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99]], [[20, 19, 9, 18, 17, 16, 15, 14, 0, 27, 11, 10, 9, 8, 7, 7, 4, 3, 0, 7]], [[9, 11, 1, 2, 3, 15, 16, 1, 15]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0, 13.0]], [[3.5, 6.1, 10.0, 12.5, 14.412035246301148, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 16.8]], [[3.5, 5.7, 6.1, 7.2, 7.606098776477131, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 14.213498962327462, 19.7, 13.0, 14.42427393794269, 3.5]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 16, 3, 17]], [[6, 13.0, 7, 13, 74, 4.490577919390011, 13]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 6.1, 7.2]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 8, 7, 6, 4, 3, 2, 1, 18]], [[9, 1, 2, 6, 8, 3, 4, 15, 15]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[6, 13.0, 7, 13, 74, 3.8, 13, 6]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 89, 10, 9, 8, 6, 6, 4, 3, 2, 1]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 81, 9, 9, 9, 9, 51, 10, 10, 10, 10, 9]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 12.326952067299308, 14.5, 16.8, 14.213498962327462, 19.7, 14.42427393794269]], [[9, 11, 1, 2, 17, 8, 3, 15]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 97, 99, 27]], [[3.5, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 14.47378456555137, 14.42427393794269]], [[9, 11, 1, 2, 5, 6, 8, 3, 15, 15, 2, 15, 9]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55, 51, 47]], [[2, 2.7, 3.8, 7, 69, 8, 74]], [[20, 19, 18, 17, 16, 15, 25, 13, 12, 11, 10, 9, 8, 10, 7, 6, 5, 4, 3, 2, 1]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 97, 7, 6, 16, 4, 3, 2, 1, 4]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 80, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[3, 5, 9, 11, 13, 15, 17, 19, 21, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27, 57]], [[20, 19, 55, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 8]], [[2, 7, 6, 4, 4, 0]], [[3, 5, 7, 9, 11, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 74, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]], [[11, 1, 2, 17, 8, 3, 15, 15]], [[20, 19, 18, 17, 16, 15, 14, 0, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 0, 7]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 7, 14]], [[20, 19, 18, 17, 16, 95, 25, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 2, 15, 15]], [[0, 0, 0, 0, 0, 1, 1, 11, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 2, 8]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.326952067299308, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0, 13.0, 13.0]], [[3.5, 5.7, 6.1, 7.2, 10.0, 7.2, 12.5, 13.0, 16.8, 12.5]], [[3.5, 5.7, 6.1, 7.2, 7.606098776477131, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 14.213498962327462, 19.7, 10.475285847069623, 14.42427393794269, 3.5]], [[20, 19, 18, 17, 16, 15, 14, 0, 12, 11, 11, 9, 8, 7, 7, 4, 13, 3, 2, 0, 7, 18]], [[2, 21, 3, 4, 5, 6, 65, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 4, 19, 20]], [[2, 4, 75, 6, 6, 8, 83, 12, 20, 22, 20]], [[3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 80, 83, 85, 87, 89, 91, 93, 95, 97, 27, 27]], [[2.7, 13.0, 7, 74, 3.8, 3.8, 2.7]], [[20, 18, 16, 15, 14, 51, 12, 11, 10, 9, 8, 97, 7, 6, 16, 4, 3, 1, 4]], [[3.5, 5.7, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0]], [[0, 0, 55, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 8]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10, 18]], [[6.1, 7.2, 10.0, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 6.1]], [[3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 75, 77, 79, 80, 83, 85, 87, 89, 91, 93, 95, 97, 27, 27, 73]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10, 16]], [[20, 19, 18, 17, 16, 15, 25, 13, 12, 11, 9, 8, 10, 7, 6, 5, 4, 3, 2, 1]], [[9, 11, 1, 2, 5, 6, 8, 3, 15, 15, 3]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 8, 6, 4, 3, 2, 1, 19]], [[11, 29, 5, 1, 2, 7, 8, 3, 4, 15, 6, 15]], [[20, 19, 18, 17, 16, 15, 13, 12, 11, 10, 9, 8, 6, 5, 4, 3, 2, 1, 7]], [[20, 19, 18, 17, 16, 15, 14, 27, 12, 11, 10, 8, 8, 6, 4, 3, 2, 1, 18]], [[5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 7.56717548263694, 4.136783373043628, 7.2]], [[3.5, 5.7, 6.1, 7.2, 7.606098776477131, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 14.213498962327462, 19.7, 13.0, 14.42427393794269, 4.329525464598056]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 79, 18]], [[0, 0, 55, 0, 0, 1, 1, 5, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[2.7, 13.0, 97, 51, 3.8, 2.7]], [[19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 2, 7, 6, 16, 4, 3, 2, 1, 4, 18, 12]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[1, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 10, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97]], [[3.5, 5.7, 6.1, 7.56717548263694, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 14.42427393794269]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 15]], [[20, 19, 18, 17, 16, 15, 8, 27, 83, 11, 10, 9, 6, 4, 3, 2, 1, 16]], [[19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 0, 7]], [[20, 19, 18, 17, 16, 15, 13, 12, 11, 9, 19, 8, 7, 6, 5, 4, 2, 1, 7]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 4, 3, 2, 1, 16]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10, 16]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14]], [[20, 19, 18, 16, 15, 14, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[9, 11, 1, 2, 5, 6, 3, 15, 15]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27]], [[0, 0, 55, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 9, 10, 10, 10, 8]], [[2.7, 13.0, 97, 51, 3.8, 2.7, 3.8, 51]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 14, 15, 16, 17, 18, 19, 20, 16]], [[9, 11, 1, 2, 5, 17, 8, 3, 15, 99]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 77, 7, 6, 10, 4, 3, 2, 1, 16]], [[20, 19, 16, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 89, 11]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 1]], [[3.5, 5.7, 5.027102188026641, 7.2, 9.922115344671733, 12.5, 13.0, 14.5, 16.8, 19.7, 7.2]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 1, 6, 5, 4, 3, 2, 1, 7, 9]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0]], [[3.5, 5.7, 5.027102188026641, 7.2, 9.922115344671733, 12.5, 13.0, 14.5, 16.8, 19.7, 7.2, 3.5]], [[9, 11, 33, 1, 2, 6, 73, 9, 3, 15, 2, 25]], [[10, 9, 8, 8, 7, 9, 6, 5, 4, 3]], [[3, 5, 7, 9, 11, 13, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 73, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 49, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 13.0, 16.8, 14.213498962327462, 14.42427393794269, 6.1]], [[1, 9, 11, 1, 2, 6, 73, 8, 3, 15, 2, 25]], [[3.5, 6.1, 7.2, 10.0, 12.5, 13.0, 14.47378456555137, 108.3, 14.213498962327462, 19.7]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[3.5, 6.1, 5.7, 7.2, 10.0, 12.5, 13.0, 9.803592607783843, 16.8]], [[10, 9, 8, 7, 6, 4, 4, 3, 7, 4]], [[9, 11, 1, 2, 6, 37, 71, 8, 3, 4, 15, 15]], [[2.7, 3.8, 1.9760728076587453, 7, 13, 74]], [[11, 1, 2, 6, 8, 3, 4, 15]], [[2.7, 3.8, 7, 69, 8, 74, 8, 2.7]], [[9, 11, 2, 6, 8, 3, 15, 15, 1, 15, 15, 17, 5, 8, 8]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 25, 97, 91]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[2, 87, 4, 5, 6, 8, 65, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 4, 20]], [[2, 4, 75, 6, 61, 6, 8, 83, 12, 20, 22, 2]], [[20, 19, 18, 17, 16, 14, 0, 12, 11, 10, 9, 8, 7, 4, 3, 2, 0, 7]], [[20, 19, 16, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 89, 11, 17]], [[2, 4, 75, 6, 61, 6, 8, 83, 12, 20, 22, 2, 12]], [[3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 31, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27, 57]], [[10, 9, 14, 7, 6, 5, 4, 47, 3, 7]], [[20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 13.0, 13.881537995629861, 16.8, 14.213498962327462, 14.42427393794269, 6.1]], [[20, 19, 18, 61, 16, 15, 13, 13, 12, 12, 9, 9, 8, 23, 6, 16, 4, 3, 2, 1, 7, 4]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 13, 11, 10, 9, 8, 7, 6, 17, 3, 2, 1, 16, 4]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14, 1, 1, 2, 9]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 0]], [[2.7, 7, 13, 75]], [[20, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 89]], [[3.5, 5.7, 14.412035246301148, 7.2, 10.0, 12.5, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 14.42427393794269, 3.5]], [[20, 19, 18, 16, 15, 14, 27, 11, 10, 8, 7, 6, 4, 3, 2, 1]], [[3.5, 5.7, 6.1, 7.2, 7.606098776477131, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 14.213498962327462, 19.7, 13.0, 14.42427393794269, 13.0]], [[3.5, 5.7, 6.1, 7.2, 10.0, 6.620175473617561, 7.2, 12.5, 13.0, 16.8, 12.5, 6.1]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 55, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]], [[20, 19, 18, 17, 16, 15, 13, 14, 13, 13, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[2.7, 13.0, 7, 13, 74, 3.8, 7]], [[3.5, 5.7, 5.027102188026641, 7.2, 9.922115344671733, 12.5, 13.0, 4.3210540137065365, 14.5, 16.8, 19.7, 7.2, 3.5]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 89, 15, 16, 17, 18, 19, 20, 16, 35, 79, 18]], [[20, 19, 18, 17, 16, 15, 14, 0, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 0, 7, 11]], [[20, 18, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 8]], [[2, 3, 4, 5, 6, 8, 65, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 3, 4]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 97, 57, 7, 6, 16, 4, 3, 2, 1, 4]], [[3.5, 5.7, 7.575286371007363, 7.2, 10.0, 12.5, 13.0, 16.8, 6.1, 6.1]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55, 51, 47, 35]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 18, 39, 41, 43, 45, 47, 48, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 27, 63]], [[19, 18, 17, 16, 15, 14, 13, 12, 11, 9, 8, 7, 6, 16, 4, 3, 2, 1, 12]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 37, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[20, 19, 18, 17, 16, 15, 25, 13, 12, 11, 10, 9, 8, 10, 7, 6, 5, 4, 3, 25, 2, 1, 7]], [[20, 19, 18, 16, 15, 14, 27, 12, 11, 10, 9, 8, 7, 4, 3, 2, 1, 12]], [[10, 9, 8, 6, 4, 4, 3, 7, 4, 4]], [[2.7, 3.8, 7, 69, 8, 81, 74, 69]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 6, 16, 4, 3, 2, 1, 7, 14]], [[20, 19, 18, 17, 16, 15, 13, 14, 13, 13, 11, 10, 9, 8, 6, 5, 4, 3, 2, 1]], [[9, 11, 1, 2, 6, 8, 3, 4, 15, 15, 6]], [[20, 19, 18, 17, 16, 15, 14, 0, 17, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[3.5, 6.1, 7.2, 13.0, 10.0, 4.136783373043628, 7.2, 12.4139453493653, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 1, 18]], [[20, 19, 18, 17, 16, 15, 8, 3, 27, 83, 11, 10, 9, 6, 4, 3, 2, 1]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 35, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55]], [[10, 9, 14, 7, 8, 5, 47, 3, 7]], [[3.5, 6.1, 10.0, 12.5, 14.412035246301148, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 16.8, 6.1]], [[9, 11, 33, 1, 2, 6, 73, 9, 3, 15, 35, 2, 25]], [[2, 3, 4, 5, 6, 7, 65, 9, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10, 16]], [[20, 19, 51, 18, 17, 74, 16, 15, 14, 16, 51, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[11, 1, 2, 6, 8, 73, 15]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 2, 15, 15, 2]], [[2.7, 13.0, 7, 9, 74, 3.8]], [[11, 7, 20, 1, 1, 6, 8, 3, 4, 15]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 66, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 25, 97, 91]], [[2.7, 7, 74, 108.3, 74]], [[2, 3, 77, 5, 7, 65, 9, 65, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 16, 35, 10]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 15, 16, 17, 18, 19, 20, 16, 35, 10, 16]], [[2.7, 7, 13, 74]], [[20, 19, 67, 18, 17, 15, 14, 0, 27, 12, 11, 10, 77, 8, 12, 6, 4, 3, 2, 1, 16]], [[9, 11, 2, 5, 10, 6, 3, 15, 15]], [[3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 31, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 97, 99, 27, 57]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 7, 4, 3, 2, 1, 17]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0, 7.2]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.93277368716042, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0, 13.0]], [[11, 1, 2, 6, 73, 15]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 77, 8, 7, 6, 4, 3, 2, 1, -1, 16, 27]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 37, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 37, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 11, 9, 8, 7, 6, 6, 16, 4, 3, 2, 1, 7, 14]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 11, 9, 8, 7, 6, 6, 16, 4, 3, 2, 1, 7, 14, 7, 12]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14, 1, 1, 9, 2, 9, 2]], [[3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 45, 25, 27, 16, 29, 31, 33, 35, 37, 39, 91, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 65, 93, 95, 97, 99, 27, 45]], [[20, 19, 18, 17, 16, 15, 14, 97, 27, 12, 11, 10, 8, 7, 6, 4, 3, 2, 1, 18]], [[0, 0, 55, 0, 0, 1, 2, 5, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[3.5, 5.7, 6.1, 7.2, 10.0, 12.5, 13.0, 16.8, 10.0]], [[11, 7, 20, 1, 1, 53, 8, 3, 4, 15]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 15]], [[20, 8, 51, 18, 17, 74, 16, 16, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1]], [[20, 19, 67, 18, 17, 16, 8, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 1, 16, 67, 4]], [[9, 11, 1, 2, 3, 15, 16, 1, 15, 1]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 7, 9, 9, 9, 9, 9, 74, 10, 10, 10, 10]], [[9, 1, 2, 6, 37, -1, 71, 8, 3, 4, 15, 15]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14, 1, 1, 2, 9, 1]], [[3.8, 1.9760728076587453, 7, 13, 74, 13]], [[20, 19, 18, 17, 16, 15, 14, 11, 27, 12, 11, 10, 9, 8, 7, 7, 4, 3, 2, 0, 7]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 7, 27, 12, 11, 10, 77, 8, 7, 6, 1, 4, 3, 2, 1, 66, 16, 27]], [[20, 19, 18, 17, 16, 14, 27, 12, 11, 10, 8, 7, 6, 4, 3, 2, 1, 18]], [[9, 11, 2, 6, 37, 71, 8, 3, 4, 15, 15]], [[2.7, -1, 74, 108.3, 74]], [[20, 19, 18, 17, 16, 15, 8, 14, 51, 12, 11, 10, 9, 8, 7, 6, 17, 4, 3, 2, 1, 4]], [[3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 31, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 16, 93, 97, 99, 27, 57]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 11, 10, 9, 8, 7, 6, 16, 4, 3, 2, 1, 4, 8, 16]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 81, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 66, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 25, 97, 91]], [[3.5, 6.906137655178807, 6.1, 7.2, 10.0, 3.1081725885917266, 7.2, 12.5, 13.0, 16.8, 12.5]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 25, 97, 91, 49]], [[3.6937336190229844, 6.1, 7.2, 10.0, 13.0, 14.47378456555137, 108.3, 14.213498962327462, 19.7, 108.3]], [[3.5, 6.1, 7.2, 13.0, 10.0, 4.136783373043628, 7.2, 12.5, 13.0, 16.8, 14.213498962327462, 19.7]], [[20, 19, 18, 17, 14, 16, 15, 14, 27, 12, 11, 10, 9, 7, 6, 4, 3, 2, 1]], [[20, 19, 16, 18, 17, 16, 15, 14, 27, 12, 11, 10, 9, 7, 47, 6, 4, 3, 2, 89, 11]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 13.0, 5.657718598667383, 13.881537995629861, 16.8, 14.213498962327462, 14.42427393794269, 6.1]], [[2, 4, 75, 6, 61, 6, 83, 20, 22]], [[20, 19, 18, 17, 16, 15, 14, 51, 12, 81, 11, 10, 9, 8, 97, 57, 7, 6, 16, 4, 3, 2, 1, 4, 16, 12]], [[0, 0, 55, 0, 0, 1, 2, 5, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 4, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 6]], [[2.945266333073926, 3.9717541945283297, 13.0, 7, 8, 74, 3.8]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10]], [[9, 11, 1, 2, 6, 8, 3, 18, 15, 15, 1, 15, 15]], [[3.5, 6.1, 7.2, 9.803592607783843, 10.0, 12.5, 5.657718598667383, 13.881537995629861, 16.8, 14.213498962327462, 14.42427393794269, 6.1, 9.803592607783843, 3.5]], [[2.7, 13.0, 8, 74, 3.8]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 14.213498962327462, 19.7, 13.0, 7.2, 16.8]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 16, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 41, 89, 91, 93, 95, 97, 99, 27]], [[3.5, 5.7, 6.1, 7.2, 10.0, 14.42427393794269, 12.5, 13.0, 16.8, 12.5]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10]], [[20, 19, 18, 17, 16, 15, 14, 13, 13, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 1, 18, 3, 9]], [[2.7, 13.0, 7, 77, 8, 13, 74, 13]], [[2, 3, 4, 5, 6, 7, 65, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 16, 2]], [[3.5, 5.7, 5.027102188026641, 7.2, 9.922115344671733, 12.5, 14.5, 16.8, 19.7, 7.2, 3.5]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14, 1, 1, 9, 1]], [[20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 11, 9, 8, 7, 6, 6, 16, 4, 3, 2, 1, 7, 14, 7, 12, 16]], [[0, 0, 11, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 75, 3, 3, 5, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9]], [[9, 11, 1, 2, 92, 6, 8, 4, 15, 2, 15, 6]], [[3.5, 6.1, 7.2, 13.0, 10.0, 4.136783373043628, 12.4139453493653, 12.5, 13.0, 14.47378456555137, 16.8, 14.213498962327462, 19.7]], [[20, 19, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 9, 8, 7, 6, 4, 3, 2, 3]], [[9, 11, 1, 2, 5, 3, 47, 15, 15, 5]], [[3.5, 5.7, 8.697319710424937, 7.2, 5.913667772046774, 10.0, 12.5, 11.133332587842302, 13.0, 16.8, 12.5]], [[2, 4, 75, 19, 6, 61, 6, 8, 83, 20, 22]], [[20, 19, 18, 17, 16, 15, 13, 14, 13, 3, 13, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 15]], [[3.5, 5.7, 6.1, 7.2, 9.002985377555673, 4.837062573049252, 12.5, 13.0, 14.5, 16.8, 19.7, 19.7, 7.2]], [[13.407092269148752, 3.5, 5.7, 6.1, 7.2, 7.606098776477131, 10.0, 12.5, 13.0, 14.5, 16.8, 7.575286371007363, 7.083773361754937, 14.213498962327462, 19.7, 13.0, 14.42427393794269, 13.0]], [[2.7, 15, 74, 108.3, 74]], [[3.5, 6.1, 16.68010840495699, 7.2, 10.0, 12.5, 13.0, 16.8, 12.5]], [[9, 11, 1, 2, 6, 8, 3, 15, 15, 2, 15, 2]], [[20, 19, 18, 17, 16, 15, 8, 14, 51, 12, 11, 10, 9, 8, 7, 6, 17, 4, 4, 3, 2, 1, 4]], [[20, 19, 18, 16, 15, 14, 27, 11, 10, 8, 7, 6, 4, 3, 2, 1, 6, 7]], [[83, 20, 31, 19, 18, 17, 16, 15, 13, 14, 13, 13, 11, 10, 9, 8, 6, 5, 4, 3, 2, 1]], [[20, 19, 67, 18, 17, 16, 15, 14, 0, 27, 12, 11, 10, 77, 5, 8, 3, 7, 6, 4, 3, 2, 1, 16]], [[10, 9, 8, 7, 6, 3, 4, 4, 3]], [[20, 20, 18, 17, 16, 15, 8, 27, 83, 11, 10, 9, 6, 4, 3, 2, 1, 16]], [[9, 11, 1, 2, 91, 6, 8, 4, 15, 2, 14, 1, 1, 9, 2, 65, 9, 2]], [[2.7, 3.8, 7, 8, 81, 75, 69]], [[2, 4, 75, 6, 6, 8, 83, 12, 20, 22, 22]], [[10, 2, 7, 3, 6, 4, 4, 3, 7]], [[9, 11, 0, 2, 6, 8, 3, 15, 15, 0]], [[12.4139453493653, 3.5, 6.1, 10.0, 12.5, 14.412035246301148, 14.47378456555137, 16.8, 14.213498962327462, 19.7, 16.8]], [[20, 19, 18, 77, 16, 15, 14, 27, 12, 11, 10, 8, 8, 6, 4, 3, 71, 1, 18, 8]], [[20, 8, 51, 18, 17, 74, 16, 16, 14, 51, 12, 11, 10, 9, 8, 7, 16, 4, 3, 2, 1]], [[9, 9, 8, 8, 7, 9, 18, 6, 5, 4, 3, 6]], [[1, 3, 5, 7, 9, 13, 15, 17, 19, 21, 23, 25, 91, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 87, 89, 91, 93, 95, 97, 99, 55, 51]], [[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 87, 89, 91, 93, 95, 97, 99]], [[3.5, 5.7, 6.1, 7.2, 10.0, 13.0, 14.5, 16.8, 19.7, 13.0, 7.2]]], "completion": "\nimport numpy as np\n\ndef median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"\n sorted_list = sorted(l)\n list_len = len(sorted_list)\n mid = list_len // 2\n if list_len % 2 == 0:\n return np.mean([sorted_list[mid-1], sorted_list[mid]])\n else:\n return sorted_list[mid]\n", "raw_completion": "```python\nimport numpy as np\n\ndef median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"\n sorted_list = sorted(l)\n list_len = len(sorted_list)\n mid = list_len // 2\n if list_len % 2 == 0:\n return np.mean([sorted_list[mid-1], sorted_list[mid]])\n else:\n return sorted_list[mid]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef median(l: list):\n \"\"\"Return median of elements in the list l.\n >>> median([3, 1, 2, 4, 5])\n 3\n >>> median([-10, 4, 6, 1000, 10, 20])\n 15.0\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/48", "prompt": "\n\ndef is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"\n", "entry_point": "is_palindrome", "canonical_solution": "\n return text == text[::-1]\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate('') == True\n assert candidate('aba') == True\n assert candidate('aaaaa') == True\n assert candidate('zbcd') == False\n assert candidate('xywyx') == True\n assert candidate('xywyz') == False\n assert candidate('xywzx') == False\n\n", "contract": "\n assert isinstance(text, str), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["aba"], ["aaaaa"], ["zbcd"], ["xywyx"], ["xywyz"], ["xywzx"]], "atol": 0, "plus_input": [["a"], ["ab"], ["abc"], ["abca"], ["racecar"], ["never odd or even"], ["step on no pets"], ["Was it a car or a cat I saw?"], ["radar"], ["refer"], ["bab"], ["aabc"], ["Was it a car or a cat I saw?refer"], ["Was it a car or a sacat I saw?"], ["aabca"], ["Was it a car ostep on no petsr a ca t I saw?"], ["Was ait a car or a sacat I saw?"], ["Was it a car orWas it a car or a cat I saw?refer a sacat I saw?"], ["reacecar"], ["aWas ait a car or a sacat I saw?b"], ["reWas it a car or a cat I saw?fer"], ["frefer"], ["aaWas it a car or a cat I saw?bWas it a car ostep on no petsr a ca t I saw?ca"], ["abbcc"], ["aaWas it a car or a cat I rbWas it a car ostep on no petsr a ca t I saw?ca"], ["abbc"], ["aaWas it a car or a cat I rbWas it a car ostep on no petsr a cafrefer t I saw?ca"], ["abcaabca"], ["areferaWas it a car or a cat I rbWas it a car ostep on no petsr a ca t I saw?ca"], ["rar"], ["Was it a car or I rbWas it a car ostep on no petsr a ca t I saw?cat I saw?refer"], ["babb"], ["never odd or even"], ["abbbc"], ["never odd or e ven"], [""], ["aa"], ["nXHRf"], ["Was it a car or a cat I saw?rr"], ["ranever oddWas it a car or a sacat I saw? venr"], ["babbabcca"], ["baabbcbbabcca"], ["aaWas it a car or a cat I saw?bWas it a car osteaabcp on no petsrr a ca t I saw?ca"], ["rereWas it a car or a cat I saw?feracecar"], ["aaacaracecar"], ["aWas ait never odd or evena car or a sacat I saw?b"], ["Waas it a car or a cat I saw?abc"], ["areferaWas it a car or a cat I rbWas it aa car ostep on no petsr a ca t I saw?ca"], ["rr"], ["baabbcbbbcca"], ["Was it a car orWas it a car or a cat I saw?r a sacat I saw?"], ["abbbWas it a car or I rbWas it a car ostep on no petsr a ca t I saw?cat I saw?referc"], ["bWas it a car ostep on no petsr a ca t I saw?abbabcca"], ["reWas it a car or a catw Ir saw?fer"], ["abb"], ["Was it a car or a cat I saw?referranever oddWas it a car or a sacat I saw? venr"], ["abbccc"], ["aaaabca"], ["Waas it a car Was it a car or a cat I saw?or a cat I saw?abc"], ["reWas it a car or a ccat I saw?fer"], ["reefer"], ["bWas it ?aa car ostw?abbabcca"], ["reWas it a car rereWas it a car or a cat I saw?feracecaror a ccat I saw?fer"], ["ba"], ["aaacar"], ["babbccaabbcbbabcca"], ["aaWas it a car or na cat I saw?bWas it a car ostep on no petsr a ca t I saw?ca"], ["reefrer"], ["areferaWas it a car or a cat I rbWas it a car ostep onareferaWas it a car or a cat I rbWas it a car ostep on no petsr a ca t I saw?ca no petsr a ca t I saw?ca"], ["racecrar"], ["racecreWas it a car or a ccat I saw?fer"], ["breWaes it a car rereWas it a car or a cat I saw?feracecaror a ccat I sawreefrer?fera"], ["Was it a car orWas it a car aor a cat I saw?r a sacat I saw?"], ["abbbWas it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?cat I saw?referc"], ["abbbWas it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?cat aI saw?referc"], ["abbbbc"], ["raneaver oddWas itrefer a car or a sacat I saw? venr"], ["reWas it a car or a catw Ir sraw?fer"], ["baabbcbbabcbabbabccaca"], ["baabbcbbabcbabbcabccaca"], ["babbbbc"], ["Was it a cara orWas it a car aor a cat I saw?r a sacat I saw?"], ["abcaabcbreWaes it a car rereWas it a car or a cat I saw?feracecaror a ccat I sawreefrer?feraa"], ["bWas it a car ostep on no a t I saw?abbabcca"], ["raaefer"], ["Was it aWas it a car orWas it a car or a cat I saw?r a sacat I saw? car or a cat I saw?"], ["abbbWas it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?caI saw?referc"], ["raneveer oddWas it a car or a swacat I saw? venr"], ["reWas it a car or a catw Ir saw?ffer"], ["aaWas it a car or na cat I saw?bWas it a car ostep on no peabbbWas it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?cat I saw?referca ca t I saw?ca"], ["rWas it a car ostep on no petsr a ca t I saw?eefer"], ["babcabccaca"], ["Was it a caraaWas it a car or a cat I rbWas it a car ostep on no petsr a ca t I saw?ca orWas it a car or a cat I saw?r a sacat I saw?"], ["baracecrarbbccaabbcbbabcca"], ["abbWaas it a car oabbbWasradar it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?caI saw?refercbccc"], ["abaWas ait a car or a sacat I saw?bbcc"], ["abaaWas it a car or na cat I saw?bWas it a car ostep on no peabbbWas it a car oaaaabcar I rbWas it a car ostep on no petsr a ca t I saw?cat I saw?referca ca t I saw?cac"], ["racecWa ca t I saw?cat I saw?referrar"], ["raneveer oddWas step on no petsit a car or a swacat I sWas ait a car or a sacat I saw?aw? venr"], ["reaaefer"], ["12zZ2@@@@!3j d3!@@@2Zz21"], ["A man, a plan, a canal: Panama"], ["Do geese see God?"], ["A man, a plan, a canal, Panama."], ["Able was I ere I saw Elba."], ["Taco cat"], ["Rats live on no evil star"], ["Step on no pets"], ["Evil is a name of a foeman, as I live."], ["A man, a plan, a canal, Panama."], ["foeman,"], ["Taco cEvil is a name of a foeman, as I live.at"], ["Panama"], ["EvTaco cEvil is a name of a foeman, as I live.atil is a name of a foeman, as I live."], ["Taco"], ["Evil"], ["A man, a plan, geesea canal: Panama"], ["or"], ["is"], ["Taco not"], ["f12zZ2@@@@!3j d3!@@@2Zz21oeman,"], ["Step osawn no pets"], ["A man, plan, a canal: PanamTacoa"], ["Was it a c ar or a cat I saw?"], ["Taco cEvil is a name of a foeman, as I live.a"], ["Step"], ["12zZ2@@@@!3Taco notj d3!@@@2Zz21"], ["12zZ2@@@@!@3Taco notj d3!@@@2Zz21"], ["canal:"], ["12zZ2@@@@!3j d3!@@@2name1"], ["A 12zZ2@@@@!3Tacoman, a plan, geesea canal: PanamaTaco not"], ["12zZ2@@@@!@3Taco notj d3!@@@2DoZz21"], ["12zZ2@@@@!@3Taco"], ["notj"], ["A man, a plan, a erecaisnral, Panama."], ["A 12zZaTaco not"], ["Was it a car o r a cat I petssaw?"], ["Taco cEvil ies a name of a foeman, as I live.a"], ["lilve.at"], ["see"], ["God?"], ["li.lve.a.t"], ["d3!@@@2name1"], ["Tacogeese cEvil is a name of a foeman, as I live.a"], ["Able"], ["Evistarl"], ["A man,Taco cEvil is a name of a foeman, as I live.at a plan, geesea canal: Panama"], ["Able was I ere I wsaw Elba."], ["ord3!@@@2Zz21oeman,"], ["StepElba. on no pets"], ["d3!@@@2Zz21oeman,"], ["12zZ2 @@@@!33j d3!@@@2Zz21"], ["Stetp osawn no pets"], ["ere"], ["A 12zZ2@@@@!3Tacoman, a plan, geeseaa canal: PanamaTaconot"], ["Was it ap car o r a cat I petssaw?"], ["lEvil"], ["Was it a car or a ca?t I saw?"], ["geesea"], ["o not"], ["parssaw?"], ["o cEvilnot"], ["A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama."], ["al:"], ["f12zZ2@@@@!3j d3!@@@2Zeman,"], ["eere"], ["cEvilnot"], ["12zZ2"], ["Was it a car or a cat Ia saw?"], ["geeseaea"], ["nWA man, a plan, a erecaisnral, Panama.sLmxhink"], ["satar"], ["A 12zZaTaco notfoeman,"], ["on"], ["Evisttarl"], ["f12zZ2@@@@!3j d3!@@@2eZeman,"], ["man,Taco"], ["12zZWas it a car or a cat Ia saw?"], ["oo not"], ["nWA man, a pmlan, a erecaisnral, Panama.sLmxhink"], ["A man, a plan, a canali.lve.a.tl, Panama."], ["A 12zZ2geeseaea@@@@!3Tacoman, a plan, geesea canal: PanamaTaco not"], ["Stetp awn no pets"], ["A 1zZaTaco notfoeman,"], ["Tacco"], ["Was it sawa car o r a cat I petssaw?"], ["vil"], ["f12zZ2@@@@!3j d3!@@@2Zzeman,"], [" Able wliveas I ere I saw Elba."], ["man,A man, plan, a canal: PanamTacoaTaco"], ["lWas it ap car o r a cat I petssaw?i.lve.a.t"], ["TTacco"], ["12zZ2 @@@@!33j d3!@@@z21"], ["PanamaTaco"], ["f12zZ2@@@@!3j d3!@@@@2Zz21oeman,"], ["d3!@@@2Zz21nama."], ["f12zZ2@@@@!3"], ["pssawd3!@@@@2Zz21oeman,?"], ["no"], ["Tlive.Tacco"], ["A man, a plan, a erecaisnral, Panama.."], ["lWas"], ["f,12zZ2@@@@!3j d3!@@@2eZeman,"], ["d3!@@@2 Able wliveas I ere I saw Elba.name1"], ["sawa"], ["A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Z.z21nama."], ["oooA 1zZaTaco notefoeman, not"], ["A man,Taco cEvil is a name of a foeman, as Ii live.at a plan, geesea canal: Panama"], ["TTPanamTacoaTacoacco"], ["f12zZ2@@@@!3j d3of!@@@2Zzeman,"], ["Taco nott"], ["12zZ2@@@@!3Taco noca?ttj d3!parssaw?@@@2Zz21"], ["12zZaTaco"], ["geese"], ["Panama."], ["A a12zZ2geeseaea@@@@!3Tacoman, a plan, geesea canal: PanamaTaco not"], ["PanamTacoaTac"], ["Was it a car or a cat I saw?"], ["d3!@@@2 ord3!@@@2Zz21oeman,Able wliveas I ere I saw Elba.name1"], ["@@@@!33j"], ["f12zZ2@@@man,A man, plan, a canal: PanamTacoaTaco@!3"], ["d3!@@@@2Zz21oeman,"], ["Rats live on no evil starvil"], ["12zZaTcaco"], ["dd3!@@@2DoZz213!@@@2Zz21nama."], ["Taocco"], ["12zZ2@@@@!@3Taco notj d3!@@@2DoZz212Zz21oeman,"], ["Taco cEvil is a name of a foeman, as I elive.at"], ["geeseaa"], ["gese"], ["nottj"], ["A man, a plan, a cananWA man, a plan, a erecaisnral, Panama.sLmxhinkma"], ["12zZWas"], ["Tac"], ["1oeman,"], ["d3!@@@2Zz21"], ["12zZ2 @@@@!33j d3!@@@zz21"], ["A a12zZ2geeseaea@@@@!3Tacoman,a plan, geesea canal: PanamaTaco not"], ["S"], ["SS"], ["nWA man, a plan, a erStep osawn no petsecaisnral, Panama.sLmxahink"], ["ee"], ["SS12zZ2@@@@!@3Taco"], ["not"], [" canal:Able wliveas I ere I saw Elba."], ["A man, a plaWas it sawa car o r a cat I petssaw?n, a erecaisnral, Panama."], ["of"], ["SSS"], ["seeoo not"], ["Was"], ["A man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plan, geesea canal: Panama"], ["on12zZ2@@@@!3j d3!@@@2Zz21"], ["sis"], ["f,12zZ2@@@@!3j d3!@@e@2eZeman,"], ["A man, a plaWas it sawa car o r a cat I petssaw?n, a erecaisnral, Panama.Panama"], ["EvTaco cEvil is a name of a foeman, as I live.atil is a name ofoeman, as I live."], ["m1oeman,"], ["sYvzbv"], ["geesd3!@@@@2Zz21oeman,aa"], ["saw?"], ["d3!@@@z21"], ["lW"], ["live.at"], ["12zZ2 @@@@!33j d3!@ @@zz21"], ["A man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plannWA man, a pmlan, a erecaisnral, Panama.sLmxhink, geesea canal: Panama"], ["Panaama"], ["f12zZ2@@@man,A"], ["Taococo"], ["A man,Taco cEvil is a ooname of a foeman, as I live.at a plan, geesea canal: Panama"], ["A man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plaStep on no pets, geesea canal: Panama"], ["cEvilcnot"], ["12zZ2co"], ["canal:Able"], ["12zZ2 @@@@!33jPanama..@@@z21"], ["12zZ2@@@@!3j"], ["EvElba.name1il"], ["EvisttcananWAarl"], ["12zZ2@@@@!@3Taco notj Z d3!@@@2Zz21"], ["Was it sawa car o r a cat I petssaStep on no petsw?"], ["nootj"], ["Elba."], ["Wasc it a car or a cat I saw?"], ["PanamTacoaTaco"], ["@@@@!3j"], ["m112zZWasoeman,"], ["A man, a plan, a cananWA man, a plan, a erecaisnral, Panama.sLmxhinkmaor"], ["wsaw"], ["d3!@@@2me1"], ["Tacogeese cEvil is a namf12zZ2@@@man,Ae of a foeman, as I live.a"], ["12zZ2@@@@!@3Taco notj d3!@@@2DoZz2112zZ2@@@@!@3Taco notj d3!@@@2DoZz212Zz21oeman,"], ["eenWA man, a plan, a erStep osawn no petsecaisnral, Panama.sLmxahink"], ["d3!@@@2Zzeman,"], ["1Ws"], ["live.a"], ["nWA man, a plan, a erecaisnral, Panama.shink"], ["Was it at I petssaw?"], ["Panama.Was it a car or a cat I saw?"], ["Taco cEvil is a name of a foeman, as IcananWA live.at"], ["f12zZ2@"], ["live"], ["d3!@@@@2Zz213oeman,"], ["12zZ2@@@@A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama.!@3Taco 2notj d3!@@@2DoZz21"], ["A man, a pl@@@@!33jan, geesea canala: Panama"], ["livee.a"], ["12zZ2@@@@!@3TacoTacogeese cEvil is a namf12zZ2@@@man,Ae of a foeman, as I live.a no@tj Z d3!@@@2Zz21"], ["1zZaTaco"], ["Dd3!@@@2DoZz21o"], ["PanamTaacoaTaco"], ["Tacogeesea cEvil is a namf12zZ2@@@man,Ae of a foemplaWasan, as I live.a"], ["l.a"], ["erecaisnral,Dd3!@@@2DoZz21o"], ["A 12zZ2@@@@!3Tacoman, a plan, geesea canal: PanamaTac@o"], ["d3!@@@2Was it sawa car o r a cat I petssaStep on no petsw?DoZz21"], ["n12zZ2@@@@!3Taco notj d3!@@@2Zz21o"], ["ooA man, a plan, a canali.lve.a.tl, Panama."], ["cEviilnot"], ["d3!@@@2Zeman,"], ["12zZ2@@@@!3orTaco noca?ttj d3!parssaw?@@@2Zz21"], ["Wassatar it at I petssawAble was I ere I saw Elba.?"], ["12zZ2 @@@@!33j!@@@z21"], ["EvTaco cEvil is a name of a foeman, aPanamaTacos I live.atil is a name ofoeman, as I live."], ["ord3!@@@2Zz21oeman,Able"], ["A man, plan, a canal: Panaawn,moa"], ["Tacooo"], ["A man, a plan, a ereacaisnral, Panama."], ["manf12zZ2@@@man,A,Taco"], ["d3!@@@Taco cEvil is a name of a foeman, as I live.aZz21oeman,"], ["d3!@@@@2Zz213dd3!@@@2DoZz213!@@@2Zz21nama.oeman,"], ["1WeenWA man, a plan, a erStep osawn no petsecaisnral, Panama.sLmxahinks"], ["Tacot ct"], ["A man, a plan, geesea canal: Panamaco"], ["plan,"], ["A man, a plaA a12zZ2geeseaea@@@@!3Tacoman,a plan, geesea canal: PanamaTaco notWas it sawa car o r a cat I petssaw?n, a erecaisnral, Panama."], ["f12zZ2@@@@!3j d3,"], ["A a12acoman, a splasn, geesea canal: PanamaTaco not"], ["A man, a plan, a cananWA mn, a plan, a erecaisnral, Panama.sLmxhinkmaor"], ["c"], ["d3!@@@Taco cEvil is a name of a foemord3!@@@2Zz21oeman,Ablean, as I live.aZz21oeman,"], ["Tca?taco cEvil is a name of a foeman, as I live.at"], ["cl:"], ["1WeenWPanama..A man, a plan, a erStep osawn no petsecaisnral, Panam a.sLmxahinks"], ["12zZf12zZ2@@@man,A2@@@@!3Taco noca?ttj d3!parssaw?@@@2Zz21"], ["Tacaot"], ["Ia"], ["Panama.sLmxhinkamaor"], ["a12zZ2g@eeseaea@@@@!31Tacoman,"], ["Ta co noat"], ["A man, a plaWas it sawa car o r a cgeeseaeaat I petssaw?n, a erecaisnral, Panama.Taco cEvil ies a name of a foeman, as I live.aPanama"], ["ges"], ["on12zZ2@@@@!3j Z d3!@@@2Zz21"], ["o cEvilnlEvilot"], ["Able was I ere I wsaw Elba."], ["12zZ2@@@@A man, a d3!@@@2DoZz21"], ["manf12zZ2@@@manTaco cEvil is a name of a foeman, as IcananWA live.at"], ["12zZ2 @@@@!33j d3!@@@SSzz21"], ["pmlan,,"], ["notefoeman,"], ["noc"], ["EvTaco cEvil is a name of a foeman, as I live.atil is a name ofoeman,as I live."], ["StetA man, plan, a canal: PanamTacoap osawn no pets"], ["live.aZz21oeman,"], ["SSSoo notS"], ["geseeseaea"], ["12zZ2geeseaea@@@@!3Tacoman,"], ["Elba.?"], ["erecainWAsnral,Dd3!@@@2DoZz21o"], ["d3!@@@nWA man, a plan, a erStep osawn no petsecaisnral, Panama.sLmxahink2Zeman,"], ["Panama.sLmf12zZ2@@@@!3j d3!@@@2Zzeman,or"], ["12zZ2@@@@!3Taco"], ["12zZ2@@@@A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama.!@3Tacoman,Taco d3!@@@2DoZz21"], ["Was a c ar or a cat I saw?"], ["wliveas"], ["ll.a"], [" Able wliveas I ere I saw Elba."], ["eenWA man, a plan, a erStep osawn no pets12zZWas it a car or a cat Ia saw?ecaisnral, Panama.sLmxahink"], ["12zZ2@@@@!@3TacPanamTacoaTacan,"], ["pets,f12zZ2@@@man,A man, plan, a canal: PanamT!3"], ["iis"], ["oTaococo"], ["f12zZ2@@@@!3j d3!@@an,"], ["12zZ2@@@@!@3TacZz2112zZ2@@@@!@3Taco notj d3!@@@2DoZz212Zz21oeman,"], ["Taco cEvil is a name of a foeman, as I live12zZ2@@@@!3orTaco.a"], ["erecaisn@ral,Dd3!@@@2DoZ,z21o"], ["geese12zZ2@@@@!3j d3!@@@2Zz21a"], ["Tacogeese cEvil is a name od3!@@@zz21f a foeman, ass I live.a"], ["man,ATacogeesea cEvil is a namf12zZ2@@@man,Ae of a foemplaWasan, as I live.a man, plan, a canal: PanamTacoaTaco"], ["ll.aGod?"], ["A man, a plaWas it sawa car o r a cat I petssaw?n, a erecaisnral, Panama"], ["was"], ["Tacog live.a"], ["f12zZ!3"], ["d3!@@@@2Zz21oemnamean,"], ["Stetp awnA man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama. no pets"], ["foemplaWasan,"], ["Evil SSis a name of a foeman, as I live."], ["122zZ2"], ["petssaw?n,"], ["12ozZ2@@@@A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama.!@3Taco 2notj d3!@@@2DoZz21"], ["d3!@@@TTacco2 Able wliv I ere I saw Elba.name1"], ["f12zZf12zZ2@@@man,A2@@@@!3Taco noca?ttj d3!parssaw?@@@2Zz21"], ["Panama.d3!@@@2Zz21nama.a!@3Taco"], ["man,A man, plan, a d3!@@@2Was it sawa car o r a cat I petssaStep on no petsw?DoZz21amTacoaTaco"], ["1WeenWPanama..A"], ["saw?petsecaisnral,"], ["Tacogeese cEvA a12acoman, a splasn, geesea canal: PanamaTaco notil is a name od3!@@@zz21f a foeman, ass I live.a"], ["1WeeenWA man, a plans, a erStep osawn no hpetsecaisnral, Panama.sLmxahinks"], ["awa"], ["Aea seecanal: Panama"], ["orTTacco"], ["cEcvilcnot"], ["EvisttcananWAaarl"], ["plannWA"], ["Panama.."], ["Panama.sLmxhinkmaor"], ["si"], ["Dd3!1o"], ["12zZ2@@@@!@3Taco notj d3!@@@2Zzparssaw?21"], ["canacEvilnlEvilotl:Able"], ["saw?petseA man, a plan, a ereacaisnral, Panama.caisnral,"], ["A 12zZaTaco noTacoooman,"], ["A man, a plan, a cananWA man, a plan, a erecaisnral, Panamar.sLmxhinkmaor"], ["12zZ2@@@@!@3Taco notj d3!@@@2DoZz2"], ["Evil is a name of a foeman, as I d3!@@@SSzz21live."], ["A man, plan, aTacot ct canal: Panaawn,moa"], ["n"], ["orrTaTacco"], ["eEvisttcananWAarlere"], ["Dd3!@@@212ozZ2@@@@A man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama.!@3Taco 2notj d3!@@@2DoZz21DoZz21o"], ["Panama.d3!@@@z21"], ["Was it sawa car o r a cat I petssaStep on no pets w?"], ["nnn"], ["12zZ2@@@@!@3Taco notj d3!@@@@2Zz21"], ["d3!@@@@2Zz213oemaan,"], ["Tacoged3!@@@@2Zz213oemaan,ese cEvil is a name of a foeman, as I live.a"], ["manf12zZ2@@@amanTaco"], ["A man, a plan, a canaanWA mn, a plan, a erecaisnral, Panamar.sLmxhinkmaor"], ["man,ATacogeesea"], ["Tacogeeseman,A cEvil is a namf12zZ2@@@man,Ae of a foeman, as I live.a"], ["Panama.sLmxhinkma"], ["Tace od3!@@@zz21f a foeman, ass I live.a"], ["Tacogeese cEvil is ca namf12zZ2@@@man,Ae of a foeman, as I live.a"], ["A man, plan,, a canal: PanamTacoa"], ["A man, a plan,, geesea canal: Panama"], ["llW"], ["A man, a plan, a erec2notjaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama."], ["man,A man, plan, a canalA a12zZ2geeseaea@@@@!3Tacoman,a plan, geesea canal: PanamaTaco not: PanamTacoaTaco"], ["EvTaco cEvil is a name of a foeman, as I live.atil is a nam12zZ2@@@@!3Taco noca?ttj d3!parssaw?@@@2Zz21e ofoeman, as I live."], ["A man, a plaWas it sawa car o r a d3!@@@Tacocat I petssaw?n, a erecaisnral, Panama.Panama"], ["geesd3!@@@noc@2Zz21oeman,aa"], ["TTca?taco cEvil is a name of a foeman, as I live.ata"], ["a12zZ2geeTaco cEvil is a name of a foeman, as IcananWA live.atn,a"], ["Evil is a name of Was it ap car o r a cat I petssaw?1l."], ["Ta tco noat"], ["A 12zZ2geeseaea@@@@!3Tacoman,a a plan, geesea canal: PanamaTaco not"], ["Rats live on no rvil"], ["A man,nWA man, a plan, a erecaisnral, Panama.shink plan, a canal: Panaawn,moa"], ["1WeAanama..A"], ["it"], ["Was it sawa car o r a cat I petrssaSStep on no petsw?"], ["no@tj"], ["12zZaA man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plannWA man, a pmlan, a erecaisnral, Panama.sLmxhink, geesea canal: PanamaTcaco"], ["livea"], ["Panama.sLmxahink2Zeman,"], ["1zZczaTaco"], ["Was it a car or a cat "], ["geesd3!@@@noc@2Zz21oea"], ["A mf12zZ2@@@@!3j d3!@@@2Zeman,an, a plan, a cananWA man, a plan, a d3!@@e@2eZeman,erecaisnral, Panamar.sLmxhinkmaor"], ["lWas it ap car ol r a cat I petssaw?i.lve.a.t"], ["geesd3!@@@noc@2Zz21oemaaa"], ["man,ATacoeesea"], ["eEvisattcanarlere"], ["12zZ2@d3!@@@Tacocat@@@A man, a d3!@d3!@@@2DoZz2112zZ2@@@@!@3Taco1"], ["EvTaco cEvil is a name of a foeman, aPanamaTacos I live.atil is a namofoeman, as I live."], ["pml,an,,"], ["A man, a plan, a erec2notjaisnral, Pa12zZ2@@@@!a@3Evil is a name of a foeman, as I d3!@@@SSzz21live.Taco notj d3!@@@2Zz21nama."], ["canalA"], ["pannWA"], ["Panama.sLmxad3!@@@Tacocathink2Zeman,"], ["erecainA man, a plan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Z.z21nama.WAsnral,Dd3!@@@2DoZz21o"], ["A man,nWA man, a plan, a erecaisnral, Panama.shink plan, a canal: Panaawwn,moa"], ["ofoeman,as"], ["Panama.sLmxhink,"], ["EvTaco cA man, a plan, a canaanWA mn, a plan, a erecaisnral, Panamar.sLmxhinkmaorEvil is a name of a foeman, as I li ve.atil is a name ofoeman, as I live."], ["A man, a plaA a12zZ2geeseaea@@@@z!3Tacoman,a plan, geesea canal: PanamaTaco notWas it sawa car o r a caat I petssaw?n, a erecaisnral, Panama."], ["cEviiA man, a plaWas it sawa car o r a d3!@@@Tacocat I petssaw?n, a erecaisnral, Panama.Panamalnot"], ["f12zZ2@@@man,A man, plan, a canal: PcoaTaco@!3"], ["I"], ["A man, plan, a cl: PanamTacoa"], ["A man, a plan,. a canal, Panama."], ["12zZZ2@@@@!@3Taco notj d3!@@@@2Zz21"], ["on12zZ2@@@@!3j d3!@@@ooname2Zz21"], ["Panama.Was"], ["man,ATacogeesea cEvil is a namf12zZ2@A man, a plaWas it sawa car o r a cat I petssaw?n, a erecaisnral, Panama@@man,Ae of a foemplaWasan, as I live.a man, plan, a canal: PanamTacoaTaco"], ["iStepis"], ["Panama.asLmxhinkma"], ["wssaw"], ["LWzOuT"], ["1ereacaisnral,zZczaTaco"], ["planl,"], ["TacaotA man,nWA man, a plan, a erecaisnral, Panama.shink plan, a canal: Panaawn,moa"], ["A 12zZ2geeseaea@@@@!f12zZ2@@@@!3j d3!@@@2eZeman,3Tacoman, a plan, geesea canal: PanamaTaco not"], ["Panaaama"], ["ggese"], ["Tacogeesea"], ["12zZaTacco"], ["petsesaw?n,"], ["Panaf12zZ2@@@@!3j d3!@@@2Zzeman,ma.Panamalnot"], ["PanPama"], ["d3!@@@Taco cEvvil is a name of a foeman, as I live.aZz21oeman,"], ["nnWA man, a plan, a erecaisanral, Panama.sLmxhink"], ["EvisWas it sawa car o r a cat I petssaw?nWAarl"], ["d3!@@@2@DoZz2"], ["erre"], ["Panama.sLmxhhink,"], ["live.ata"], ["A man, a p12zZ2@d3!@@@Tacocat@@@A man, a d3!@d3!@@@2DoZz2112zZ2@@@@!@3Taco1lan, a canal, Panama."], ["parssawa?"], ["sapw?petsecaisnral,"], ["@@@@EvTaco!33j"], ["Evivl"], ["lvEvil"], ["petrssaSStep"], ["lofoeman,W"], ["dd3!@@@2DoZz213!@@@2Zz21naPanama.sLmxhinkma."], ["ld3!@@@2Zz21nama.l.a"], ["live.atil"], ["d3!@@@Taco cEvvil is a name of aPanama.sLmf12zZ2@@@@!3j d3!@@@2Zzeman,or foeman, as I live.aZz21oeman,"], ["12zZZ2 @@@@!@33j d3!@@@zz21"], ["no1WeeenWA man, a plans, a erStep 1zZczaTacoosawn no hpetsecaisnral, Panama.orrTaTaccoks"], ["cEivil"], ["Able was I Iiere I saw Elba."], ["gaQLMzyB"], ["p12zZ2@d3!@@@Tacocat@@@@A"], ["Iiere"], ["Dd3!@@@212ozZ2@@@@A man, a plZan, a erecaisnral, Pa12zZ2@@@@!@3Taco notj d3!@@@2Zz21nama.!@3Taco 12zZ2@@@@!@3Taco2notj d3!@@@2DoZz21DoZz21o"], ["leivee.a"], ["Taco cEvil ies a namman,ATacogeesea cEvil is a namf12zZ2@@@man,Ae of a foemplaWasan, as I live.a man, plan, a canal: PanamTacoaTacoe of a foeman, as I live.a"], ["live.atn,a"], ["d3!@@@2Z.z21nama.WAsnral,Dd3!f12zZ2@@@@!3j d3!@@@2Zz21oeman,@@@2DoZz21o"], ["man,nWA"], ["on12zZ2@@@@!3j Z d3!@@@@2Zz21"], ["r"], ["Panama.caisnral,"], ["SSS starviloo notS"], ["A man,Taco cEvil is a name of a foeman, as I live.at a plan, geesea canal: Panamalive.at"], ["12zZf12zZ2@@@man,A2@@@@!3Taco noca?ttj d3!paA man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plannWA man, a pmlan, a erecaisnral, Panama.sLmxhink, geesea canal: Panamarssaw?@@@2Zz21"], ["EvisWas"], ["12zZZ2"], ["cEcvilccnot"], ["e.a"], ["A man, a plan, geesea canal:a Panamaco"], ["EDBeGUgzCE"], ["PanamaTaconotS"], ["erPanama.Panamalnotre"], ["12zZ12"], ["hpetsecaisnral,122zZ2"], ["Dere"], ["WRiQwNNUK"], ["man,ATacoge12zZ2geeseaea@@@@!3Tacoman,efoemord3!@@@2Zz21oeman,AAblean,sea"], ["12zZaTaccliveo"], ["Panama.d3!@@@2Zzeman,ma.PanamalnotsLmxhink,"], ["Able was I ere I saws Elba."], ["d3!@@@Ta"], ["A 12zZs2geeseaea@@@@!f12zZ2@@@@!3j, geescanal: PanamaTaco not"], ["12zZ2@@@@!@3TacoTacogeese cEvil is a na12zZ2@@@man,Ae of a foeman, as I live.a no@tj Z d3!@@@2Zz21"], ["Step osawn no pePanPamats"], ["A man, plan, a canal: PanamTacA man,Taco cEvil i12zZ2@@@@!@3Tacos a name of a foeman, as I live.at a plan, geesea canal: Panamaa"], ["awaa"], ["2notjWassattar"], ["n12zZ2@@@@!3Tacto notj d3!@@@2Zz12zZ2@d3!@@@Tacocat@@@A man, a d3!@d3!@@@2DoZz2112zZ2@@@@!@3Taco121o"], ["pets,f12zZ2@@@man,A"], ["a12zZ2geeseaea@@@@!3Tacoman,"], ["lofWoeman,W"], ["ma12zZ2geeseaea@@@@!3Tacoman,"], ["12zZ2@@@@!@3TacZz2112zZ2@@@@!@3Taco"], ["d3!@@@2 ord3!a@@@2Zz21oeman,Able wliveas I ere I saw Elba.name1"], ["Tacogeeseman,A cEvil is a namf12zZ2@@@man,Ae of a foeman, asa I live.a"], ["Tacno@tjo"], ["canalpetssawAbleA"], ["star"], ["A 12zZ2geeseaea@@@@!3Tacoman,d3!@@@2name1a a plan, geesea canal: PanamaDoTaco not"], ["TlivA man, a plan, geesea canal:a Panamacoe.Tacco"], ["1212zZ2@@@@!@3Taco notj d3!@@@2DoZz21zZ2@@@@!3Taco"], ["ca?t"], ["a12zZ2geeseaea@@@@z!3Tacoman,aLL"], ["ca"], ["man,ATacogeesea cEvil is a namf12zZ2@@@man,Ae of a foemplaWasan, as I live.a man, plan, a canal: PanamTacoageesd3!@@@noc@2Zz21oeaToaco"], ["12zZ2@@@@!@3TacZz2112zZ2@@@@!@3Taco notj d3!@@@2DoZzo212Zz21oeman,"], ["f,12zZ2@d3!@@@2eZeman,"], ["d3!@@@2DoZz2112zZ2@@@@!@3Taco"], ["d3!parssaw?@@@2Zz21e"], ["cEcvilcd3!@@@2 ord3!a@@@2Zz21oeman,Able wliveas I ere I saw Elba.name1"], ["f12zZ2@@@@!live12zZ2@@@@!3orTaco.a3j d3!@@@2eZeman,"], ["seeoo ntot"], ["ld3!Z@@@2Zz21nama.l.a"], ["a12zZ2geStepElba.eTaco cEvil is a name 1WeenWPanama..A man, a plan, a erStep osawn no petsecaisnral, Panam a.sLmxahinksf a foeman, as IcananWA live.atn,a"], ["taco"], ["Stetp osawn no peerStepts"], ["1zZczaTa1WeenWPanama..A man, a plan, a erStep osawn no petsecaisnral, Panam a.sLmxahinksco"], ["md3!@@@2Zeman,Tacoe2notjWassattaresea"], ["lEvilf12zZ2@@@man,A"], ["manf12zZ2@@@manTaco"], ["leiv12zZaTaccoee.a"], ["EvTaco cEvil is a name of a foeman, as I live.atil is a nam12zZ2@@@@!3Taco noca?ttj d3!parssaw?@@@2Zz21e ofoeman, as I live.Tacat"], ["saw?p,etsecaisnriisal,"], [" "], ["!"], [" "], ["\t"], ["\n"], ["\r"], [" "], ["z"], ["Able was I erel I saw Elba."], ["Taco catgeese"], ["12zZ2@@@@!j3j"], ["A man, a plan, Pa canal, Panama."], ["12zZ2@@3@@!j3j"], ["12zZ2@@3@@!jfoeman,3j"], ["12zZ2@@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21"], ["A"], ["A man, a plan, Pa canal, Pana.ma."], ["12zZ2@@@evilj"], ["Do geese see Go"], ["cat"], ["12@zZ2@@@@!3j 12zZ2Panama21"], ["live."], ["Rats"], ["lieve."], ["Evil is a name of a fIoeman, as I live."], ["A man, a plan, a canal: ,Panama"], ["foem,an,"], ["Panama.Was it a car or a cat I saw?"], ["12zZ2pets@@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21"], ["A man, a plan, PA man, a plan, Pa canal, Panamano canal, Pana.ma."], ["Aorcatgees,Panamae"], ["A man, a pl,an, a canal: ,Panama"], ["wsaww"], ["Step12zZ2pets@@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21"], ["lieveA man, a plan, Pa canal, Pana.ma.."], ["erel"], ["12zZ2@@@@!3j 12zZ21"], ["12zZerel"], ["lieveA man, a plan, PaA man, a plan, a canal: Panama canal, Pana.ma.."], ["foeman,Step on no pets"], ["foemaIn,Step"], ["s?aw?"], ["AeNO"], ["A man,A a plan, a canal: ,Panama"], ["Evil is a name of a fIoeman,s as I live."], ["foem,acatn,"], ["12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz21"], ["Evil isor a name of a fIoeman, as I live."], ["A man., a plan, Pa canal, Pana.ma."], ["saw?12@zZ2@@@@!3j 12zZ2Panama21"], ["12zZ2@@3@@!j33Able was I erel I saw Elba.j"], ["wsawww"], ["foeem,an,"], ["A man, a plan, Pa canal, Panasee.ma."], ["T12zZ2Panama21aco cat"], ["foeem,noan,"], ["wswawww"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa canal, Pana.ma.Zz21"], ["foeem,,an,"], ["as"], ["12zZ@@@!j3"], ["PaaPanama"], ["Rtats"], ["12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21"], ["saw?12@zZ2@@@@!3j"], ["Pana.ma.."], ["aas"], ["saw?12@zZ2@@@@!3j nama21"], ["TaTco catgeese"], ["12zPaaPanamaZ2@@@evilj"], ["12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2a21"], ["12@zZ12zZ2@@@@!23j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21"], ["A maPa canal, Pana,mano canal, Pana.ma."], ["saw??"], ["lieveA man, a plan, Pa cacnal, Pana.ma.."], ["Doe see 12zZ2@@j@@!j3jd3!@@@2Zz21Go"], ["A man, anama."], ["car"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21"], ["12zZ2@@@@!2j3jd3!@@@2Zz21"], ["A man, a plan, Pa canal, Panasee.ma.ts"], ["Do"], ["12zZ21"], ["lieveA man, a plan,Elba. Pa cacnal, Pana.ma.."], ["AeNA man, a plan, Pa ncanal, Panasee.mma."], ["Do ge12zZ2@@j@@!j3jd3!@@@2Z1Goese see Go"], ["1@2zZ2@@@evilj"], ["Panam.a."], ["ncanal,"], ["PA"], ["HijEVmHx"], ["Able was I ere Iba."], ["joOnfO"], ["RtatRs"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa caA man,A a plan, a canal: ,Panamanal, Pana.ma.Zz21"], ["ncanalfoem,an,,"], ["A man, a pnl,an, a canal: ,aPanama"], ["12@zZ2@@@@!3j 12zZ2lieveA man, a plan, PaA man, a plan, a canal: Panama canal, Pana.ma..Panama21"], ["12zZ2it@@2A"], ["Panamano"], ["maPa"], ["12@zZ2@@@@!3j ! 12zZ2Panama21"], ["Step12zZ2petssaw@@@@!3j 12zZ2@@@@!Able was I ere I saw Elba.j3jd3!@@@2Zz21"], ["T12zZ2Panama21acoDoe see 12zZ2@@j@@!j3jd3!@@@2Zz21Go"], ["saw?12@zZ2@@@@!3j nama321"], ["PanPana,manoamano"], ["Panama.Was it a car or a cat I 12zZ2@@@@!3j d3!@@@2Zz21saw?"], ["122zPaaPanamael"], ["12zZ2a21"], ["T12zZ2Panama21acoDoe see 12zZ2@@j@@!j3jd3!@z@@2Zz2lieveA man, a plan,Elba. Pa cacnal, Pana.ma..1Go"], ["Iba."], ["egeese"], ["joOngeesefO"], ["Evil is a name of a foeman, live."], ["foemaIn,SPanasee.ma.p"], ["foeIem,noan,"], ["Ablba."], ["Step1etssaw@@@@!3j 12zZ2@@@@!Able was I ere I saw Elba.j3jd3!@@@2Zz21"], ["Panasee.ma."], ["12zsaw?12@zZ2@@@@!3j nama21"], ["Evil isor a name of a fIoeman,I as I live."], ["Evil isor a name of a fIoemalieveAn, as I live."], ["staTaco"], ["wwas"], ["Evil is a name of a fIoeman, s as I live."], ["Pana.ma..."], ["Steman,p12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21"], ["Aorcatgees,Steep on no petsPanamae"], ["Ky"], ["T12zZ2Panama21acoDoe seWas it a car or a cat I saw?e 12zZ2@@j@@!j3jd3!@@@2Zz21Go"], ["Pana.ma..PaA."], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21, Pa Pana.ma.Zz21"], ["lieveA man, a plan, Pa cacnal,i Pana.ma.."], ["wswawwA man, a plan, Pa canal, Panasee.ma.w"], ["12zZ2@@j@@!j3jd3!@@@2Zz212@@@@lieveA man, a plan, Pa cacnal, Pana.ma..!3j"], ["Step12zZ2petssaw@@@@!3j"], ["A maPa canal, Pana,mano canal12zZ2@@Aorcatgees,Panamae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["T12zZ2PanamaPana.ma.21aco cat"], ["A maPa canal, Pana,mano canal12zZ2@@Aorcatgees,PanPana.ma..1Goamae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["KyDo geese see Go"], ["Evil is a name of a fIoeman,l as I live."], ["Pana,mano"], ["Pana.ma."], ["f,oe!em,noaan,"], ["Step12zZ2petssaw@@@@!3j Zz21"], ["Was12zZ2@@@@!j3j"], ["A man, a pnl,an, a canal: ,aPanA man, a plan, Pa canal, Pana.ma.a"], ["wsaAeNA"], ["12zZ2@@j@@!j3jd3!@@@2Zz21"], ["T12zZ2Panama21aco"], ["A maPa canal, Pana,mano canal12zZ2@@Aorcatgees,Panplan,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["A maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,Panplan,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["foeman,Step"], ["ncanalfoem,an,a,"], ["Steman,p12zZ2pets@@@@@!3j"], ["foemaaIn,SPanasee.ma.p"], ["12zZ2@@@@!@3j d3!@@@2Zz21"], ["PanPana,Pao"], ["s?a"], ["Ablba.PA"], ["joOngeesecacnal,ifO"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., wsaAeNAa plan, Pa Pana.ma.Zz21"], ["12zZ2@it@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21"], ["12zZ2a21erel"], ["fofoemaIn,StepeIaem,noan,"], ["staTaTco"], ["lieveA maa.ma.."], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21wsaAeNAa plan, Pa Pana.ma.Zz21"], ["A maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["12zZ2@@@@!Able"], ["lieeve."], ["foeem,nor"], ["foeman,Smtep"], ["lieveA man, a plan,Elba. Pa cacnal,A man., a plan, Pa canal, Pana.ma. Pana.ma.."], ["Go"], ["Evil isor a name of a fIA maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma.oeman, as I live."], ["Aorcatgees,wsaAeNAaSteep on no petsPanamae"], ["A maPa canal, Pana,mano canal12zZ2@@Aorcatgees,Panplan,Elba.ama12zZ2it@@2Az21, Pana.ma."], ["ncanoalfoem,an,,"], ["KyDo geeGse see Go"], ["Pa.na.ma.."], ["T12zZ2Panama21acoDoe"], ["12zZ2Panama21"], ["sa??"], ["Twwasaco catgeese"], ["A man, a plan, a canal: ,PanaPanasee.ma.tsma"], ["lieeve12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2a21."], ["Pana.ma.oeman,"], ["sa???"], ["A maPa canal, aPana,mano canal12zZ2@@Aorcatgees,Panplan,Elbaa.ama12zZ2it@@2Az21, Pana.ma."], ["Pana.ma.a"], ["liaa.ma.."], ["A man, a pnl,an, a canal: ,aPanA Aorcatgees,Panamaeman, a plan, Pa canal, Pana.ma.a"], [",PanaPanasee.ma.tsma"], ["egeeese"], ["o"], ["lieveA ma.n, a plan,Elba. Pa cacnal,A man., a plan, Pa canal, Pana.ma. Pana.ma.."], ["Evil is a name of a fvIoeman,s as I live."], ["12zZas2@@j@@!j3jd3!@@@2Zz21"], ["12zZ2a21ereel"], ["R"], ["Evil is a name of a fI oeman,l as I live."], ["stTco"], ["fofoeSmaIn,StepeIaem,noan,"], ["12zZ2@@j@@!j3jd3!@z@@2Zz2lieveA"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21wsaAeNAa plan, Pa Pana.ma.ZEvil is a name of a fvIoeman,s as I live.z21"], ["Step12zZ2psaw?12@zZ2@@@@!3j nama21ets@@@@!3j 12zZ2it@@2A man., wsaAeNAa plan, Pa Pana.ma.Zz21"], ["12zZ@2@@3@@!j3j"], ["eNO"], ["12a3"], ["PanamanPaAo"], ["manm.,"], ["12zZ2@@@@!@3j"], ["ssa???"], ["nm.,"], ["A man., a plan, Pa canal, aPana.ma."], ["Step1etssaw@@@@!3j 12zZ2@@@@!AblT12zZ2Panama21aco cate was I ere I saw Elba.j3jd3!@@@2Zz21"], ["hLSbYVmk"], ["Evil iDo geese see God?s a name of a foeman, as I live."], ["Kyy"], ["122zPaaaPana2mael"], ["wswaww"], ["fIoem,an,I"], ["A man, a plan, PA man, a plan, T12zZ2PanamaPana.ma.21aco catPa canal, Panamano canal, Pana.ma."], ["A man., a plan, Pa canal, Pana.ma.canal12zZ2@@Aorcatgees,Panplan,Elba.amae@@!2j3jd3!@@@2Zz21,"], ["Ablbba."], ["KyDo"], ["Aorcatgees,Step12zZ2pets@@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21Steep on no petsPa12zZ2a21erelnamae"], ["12zZas2@@j@@!j3jd3z21"], ["A maPa canal, aPana,mZ2@@Aorcatgees,Panplan,Elbaa.ama12zZ2it@@2Az21, Pana.ma."], ["foeem,saw?12@zZ2@@@@!3j nama321,an,"], ["geeeGse"], ["Evil isor a name of a fIA maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz2Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21, Pa Pana.ma.Zz211, Pana.ma.oeman, as I live."], ["scatPaa???"], ["Pana.mPa."], ["12zsaw?12@zZ2@@@@!3j na21"], ["12zzZ2@@j@@!j3jd3!@@@2Zz21"], ["aPana,mZ2@@Aorcatgees,Panplan,Elbaa.ama12zZ2it@@2Az21,"], ["PAno"], ["A man,fvIoeman,s a plan, Pa canal, Panama."], ["T12zZ2Panama2T12zZ2Panama21acoDoe see 12zZ2@@j@@!j3jd3!@@@2Zz21Go1aco"], ["A man,ma."], ["canal12zZ2@"], ["T12zZ2PanamaPana.co cat"], ["T12zZ2Panama21aco ccat"], ["Able zw12zzZ2@@j@@!j3jd3!@@@2Zz21re Iba."], ["manm.,wwas"], ["pnl,an,"], ["Pana.maa.a"], ["Step12zZ2pets@@@@!3j 12zZ2@@@@3jd3!@@@2Zz21"], ["canal12zZ2@@Aor2catgees,Panplan,Elbaa.ama12zZ2it@@2Az21,Kyy"], ["lieveA man, a plan,Elba. Pa cacn12zZ2@@j@@!j3jd3!@@@2Zz212@@@@lieveAal, Pana.ma.."], ["foem,anm,"], ["12zZ2@@3@@!j33Able wras I erel I saw Elba.j"], ["A maPa canalo, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma."], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21wsaAeNAa plan, Pa Pana.ma.ZEvil is a A maPa canalo, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma.name of a fvIoeman,s as I live.z21"], ["lieveA"], ["12zZ12@zZ2@@@@!3j 12zZ2Panama212@@@@!@3j"], ["d3d!@@@2Zz2!1"], ["S2tep12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21, Pa Pana.ma.Zz21"], [",aPanA"], ["Panaanama.ma."], ["canal,"], ["Able was I ere I sncanalfoem,an,,aw Elba."], ["Step12zZ2psaw?12@zZ2@@@@!3j nama21ets@@@@!3j 12zZ2it@@2A man., wsaAeNT12zZ2Panama2T12zZ2Panama21acoDoe see 12zZ2@@j@@!j3jd3!@@@2Zz21Go1acoAa plan, Pa Pana.ma.Zz21"], ["A mand3!@@@2Zz21saw?,aPanA man, a plan, Pa canal, Pana.ma.a"], ["nama21ets@@@@!3j"], ["T1w2zZ2Panama21acoDoe seWas it a car or a cat I saw?e 12zZ2@@j@@!j3jd3!@@@2Zz21Go"], ["Elbaa.j"], ["Step12zZ2psaw?12@zZ2@@@@!3j nama21ets@@@@!3j 12zZ2it@@2A manZ., wsaAeNAa plan, Pa Pana.ma.Zz21"], ["foemaIn,SjoOngeesefOPanasee.ma.p"], ["manmcacnal,i.,wwas"], ["Do geese see sGo"], ["A."], ["12zZ2a211"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., Step12zZ2pets@@@@!3j 12zZ2it@@2A mAorcatgees,Steep on no petsPanamaean., a plan, Pa Pana.ma.Zz21wsaAeNAa plan, Pa Pana.ma.ZEvil is a A maPa canalo, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz21, Pana.ma.name of a fvIoeman,s as I live.z21"], ["saw?1on2@zZ2@@@@!3jj"], ["Step12zZ2pets@@@@!3j 12zZ2@@@@3jd3!@@@22Zz21"], ["Aogrcatgees,Panamae"], ["Evil isor a name of a fIoeman,Step12zZ2pets@@@@!3jI live."], ["Evil isor a namof a fIoemalieveAn, as I live."], ["man,"], ["pets"], ["ws12zZ2@@j@@!j3jd3!@@@2Zz21waww"], ["KyDo12zZ2@@@@!2j3jd3!@@@2Zz21"], ["foemaPanPana,manoamanon,"], ["Evil iss a name of a foeman, live."], ["S2tep12z12zPaaPanamaZ2@@@2eviljZ3j"], ["Do geese see Geod?"], ["Aorcatgees,PafoemaIn,SjoOngeesefOPanasee.ma.pnamae"], ["12@zZ12zZ2@@@@!23j"], ["wswawwere"], ["saw?e"], ["A man, a pnl,an, a canal:a ,aPanama"], ["12zZas2@@j@@!j3jd3!@@@2fIoem,an,I"], ["sa????"], ["f,oe122zPaaPanamael!em,naoaan,"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., Step12zZ2pets@@@@!3j 12zZ2iseWasAeNAa plan, Pa Pana.ma.ZEvil is a name of a fvIoeman,s as I live.z21"], ["HijEVmHHx"], ["A maPa canal, Pana,mano canal12zZ2@@Aorcatgees,PanPana.ma..1Goamae@@!2j3jd3!A@@@2Zz21, Pana.ma."], ["fem,an,"], ["12zZ12@zZ2@@@@!3j 12zZ2Pa"], ["foetm,acaton,"], ["12zZ12@@zZ2@@@@!3j 12zZ2Panama212@@@@!@3j"], ["fIoemalieveAn,"], ["EYk"], ["PanamaA man, a plan, Pa canal, Panasee.ma.ts"], ["12zZ2@@j@@!j312zZas2@@j@@!j3jd3!@@@2Zz21jd3!@z@@2Zz2lieveA"], ["122zPaaaPannwswawwAa2mael"], ["fofoeSmaIn,SteIaem,noan,"], ["RR"], ["Pana.mao.oeman,"], ["12zPaa12zZ2@@@@!3j 12zZ2@@@@!j3jd3!@@@2Zz21PanamaZ2@@@evilj"], ["12zZ2Panama212@@@@!@3j"], ["12zZ2Pzanama212@@@@!@3j"], ["Step12zZ2pets@@@@!3j 12zZ2it@@2A man., S@tep12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21wsaAeNAa plan, Pa Pana.ma.Zz21"], [",PanaPanasee.ma.ts"], ["A man, a panama"], ["wsawwww"], ["HjiEjEHVmHHx"], ["Evil isor a name of a fIA maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2Pana.mao.oeman,j3jd3!@@@2Zz21, Pana.ma.oeman, as I live."], ["egrykPqA"], ["Pana.ma.on,"], ["fIoeman,s"], ["w?e12zZ2@@j@@!j3jd3!@@@2Zz21Go1aco"], ["Steman,p12zZ2pets@@@@!3jAble zw12zzZ2@@j@@!j3jd3!@@@2Zz21re Iba. 12zZ2it@@2A man., a plan, Pa Pana.ma.Zz21"], ["Elba.j"], ["pnnl,an,"], ["A man, a pnl,an, a canal: ,Step1etssaw@@@@!3j 12zZ2@@@@!Able was I ere I saw Elba.j3jd3!@@@2Zz21aPanama"], ["Step12zZ2pets@@@@!3j 12zZ2@@@@3jd3!@3@@22Zz21"], ["wswawwerecar"], ["KyDoDoe"], ["aas12zZ2@@3@@!jfoeman,3j"], ["Panasee.ma.ts"], ["12zZ2@@3@@!j33Able"], ["T12zZ2Panama21aco cccat"], ["wsaAeNT12zZ2Panama2T12zZ2Panama21acoDoe"], ["PanPan,Pao"], ["foaem,an,"], ["wwswaww"], ["scatPaa??"], ["Tacot cat"], ["liaa.ma..fIoeman,2Step12zZ2pjets@@@@!3jI"], ["O"], ["foeIemwsaAeNA,noan,"], ["OQdpFdbUIt"], ["f,oe!em,"], ["catPa"], ["foeIemwsaAmanm.,wwaseNA,fIoeman,I"], ["A man, aa plan, Pa canal, Panasee.ma.ts"], ["Evil isor a namZ2pets@@@@!3jI live."], ["wsaAeNAa"], ["Tacot c at"], ["12zZ2@@3@@!j3312zZ2@@j@@!j3jd3!@@@2Zz212@@@@lieveAAble"], ["Step12zZ2petssaw@@@@!3j 12zZ2@@@@!Able was I ereman,A I saw Elba.j3jd3!@@@2Zz21"], ["cccat"], [",aPa,nA"], ["lliKyyeveA"], ["Panaccat.ma.."], ["lieveATaco catgeese man, a plan, Pa cacnal,i Pana.ma.."], ["AeNA man,e a plan, Pa ncanal, Panasee.mma."], ["T12zZ2PaDoe"], ["canal12zZ2@@Aorcatgees,PanPana.ma..1Goamae@@!2j3jd3!A@@@2Zz21,"], ["namZ2pets@@@@!3jI"], ["A man, a pnl,an, a can plan, Pa ca.a"], ["KyD"], ["foeIemwsaStep12zZ2petssaw@@@@!3j 12zZ2@@@@!Able was I ere I saw Elba.j3jd3!@@@2Zz21AeNA,noan,"], ["petsPanamaean.,"], ["A man., a plan, Pa canal, Pana.ma.canal12zZ2@@Aorcatgees,PanplaPn,Elba.amae@@!2j3jds?aw?3!@@@2Zz21,"], ["A maPag canal, Pana,mano canal12zZ2@@Aorcatgees,PanPana.ma..1Goamae@@!2j3jd3!A@@@2Zz21, Pana.ma."], ["feofoeSmaIn,StepeIaem,noan,"], ["S2tep12@zZ12zZ2@@@@!23j12z12zPaaPanamaZ2@@@2eviljZ3j"], ["?sa???"], ["12zZ2@@3@@!j33Able wrasOQdpFdbUIt I erel I saw Elba.j"], ["Aorcatgees,wsaAeNAaStpeep on no petsPanamae"], ["g"], ["12zPaaPanamaZ2@P@@evilj"], ["12zsaw?12@zZ@@@@!3j na21"], ["12zsaw?12@zZ2@j@@@!3j na21"], [",Pannasee.ma.tsma"], ["Evil isor a name of a fIA maPa canal, Pana,mano @canal12zZ2@@Aorcatgees,PanplanfofoemaIn,StepeIaem,noan,,Elba.amae@@!2j3jd3!@@@2Zz2Step12zZ2pets@@@@!3j 12zZ2it@@2A man., a plan12@zZ12zZ2@@@@!3j 12zZ2@@j@@!j3jd3!@@@2Zz212@@@@!3j 12zZ2Panama21, Pa Pana.ma.Zz211, Pana.ma.oeman, as I live.s?a"], ["foemaIn,SPanaseme.ma.p"], ["pnl,an,canal12zZ2@@Aorcatgees,PanPana.ma..1Goamae@@!2j3jd3!A@@@2Zz21,"], ["Aorcatgees,PafoemaIn,S12zZ@2@@3@@!j3jjoOngeesefOPanasee.ma.pnamae"]], "completion": "\n\ndef is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"\n return text == text[::-1]\n\n", "raw_completion": "```python\n\ndef is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"\n return text == text[::-1]\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef is_palindrome(text: str):\n \"\"\"\n Checks if given string is a palindrome\n >>> is_palindrome('')\n True\n >>> is_palindrome('aba')\n True\n >>> is_palindrome('aaaaa')\n True\n >>> is_palindrome('zbcd')\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/49", "prompt": "\n\ndef modp(n: int, p: int):\n \"\"\"Return 2^n modulo p (be aware of numerics).\n >>> modp(3, 5)\n 3\n >>> modp(1101, 101)\n 2\n >>> modp(0, 101)\n 1\n >>> modp(3, 11)\n 8\n >>> modp(100, 101)\n 1\n \"\"\"\n", "entry_point": "modp", "canonical_solution": "\n\n res, x = 1, 2\n while n != 0:\n if n % 2 == 1:\n res = res * x % p\n x = x * x % p\n n //= 2\n return res % p\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(3, 5) == 3\n assert candidate(1101, 101) == 2\n assert candidate(0, 101) == 1\n assert candidate(3, 11) == 8\n assert candidate(100, 101) == 1\n assert candidate(30, 5) == 4\n assert candidate(31, 5) == 3\n\n", "contract": "\n assert type(n) == int and type(p) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n >= 0 and p >= 1, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[3, 5], [1101, 101], [0, 101], [3, 11], [100, 101], [30, 5], [31, 5]], "atol": 0, "plus_input": [[5, 17], [10, 23], [20, 37], [50, 79], [100, 89], [200, 113], [7, 3], [12, 7], [50, 23], [101, 103], [20, 20], [37, 37], [200, 112], [19, 19], [3, 3], [200, 200], [79, 79], [17, 20], [100, 20], [100, 3], [6, 6], [23, 200], [78, 79], [6, 78], [5, 5], [6, 19], [5, 6], [7, 78], [113, 112], [3, 20], [6, 20], [7, 101], [101, 101], [7, 6], [5, 200], [17, 21], [21, 5], [10, 10], [20, 21], [20, 17], [17, 100], [19, 2], [99, 20], [17, 17], [7, 7], [79, 3], [6, 10], [99, 98], [78, 100], [79, 112], [112, 101], [112, 20], [19, 6], [8, 78], [79, 200], [112, 113], [10, 88], [112, 112], [12, 101], [8, 200], [80, 50], [113, 113], [20, 19], [50, 20], [12, 4], [202, 200], [19, 200], [98, 4], [19, 50], [113, 100], [8, 100], [200, 8], [17, 78], [37, 80], [88, 21], [202, 202], [10, 17], [19, 5], [19, 4], [36, 200], [101, 200], [112, 114], [88, 97], [17, 5], [200, 37], [100, 18], [88, 20], [20, 103], [6, 21], [7, 20], [19, 18], [21, 103], [80, 37], [21, 102], [36, 7], [100, 100], [20, 99], [36, 101], [80, 5], [36, 78], [234, 101], [50, 17], [4321, 1009], [100000, 7], [9876, 54321], [1000000, 999983], [999999, 100019], [172870, 530123], [1048576, 523], [523, 1048576], [233, 101], [172870, 9876], [9875, 54321], [172871, 523], [1009, 17], [172871, 172871], [999983, 999983], [233, 233], [101, 54321], [999984, 999984], [1000002, 1000000], [50, 9875], [172870, 101], [232, 101], [523, 523], [172871, 172870], [7, 999999], [4321, 4321], [54321, 17], [172872, 172871], [54321, 54321], [233, 530123], [4321, 999999], [235, 234], [1000002, 1000001], [233, 234], [172870, 172871], [17, 1009], [1000003, 1000003], [1000003, 17], [999999, 172871], [172870, 172870], [999984, 172871], [523, 100000], [100019, 172872], [9877, 54321], [16, 16], [7, 233], [18, 235], [1000002, 1000002], [101, 530123], [999984, 101], [172871, 235], [101, 50], [1000002, 18], [999984, 999983], [172869, 172869], [524, 523], [233, 172871], [1000000, 172871], [999984, 235], [999999, 999999], [101, 1000000], [232, 232], [172871, 172869], [9877, 9877], [1000000, 524], [1000001, 7], [1048576, 524], [51, 50], [530123, 530123], [9877, 9875], [522, 524], [7, 9877], [9876, 9876], [999984, 999999], [530123, 9877], [999984, 999985], [1000003, 523], [172869, 172871], [999984, 999998], [4321, 233], [9877, 9876], [999999, 18], [1000000, 1000000], [172871, 530123], [9874, 9875], [523, 99999], [1000003, 54321], [9, 1000001], [172872, 1009], [54323, 523], [235, 1009], [522, 999983], [233, 9877], [1000000, 999999], [9875, 530123], [9877, 54322], [231, 231], [18, 9875], [172869, 18], [1000000, 172870], [522, 100000], [524, 1009], [530124, 530123], [234, 16], [102, 1000000], [51, 1009], [18, 172869], [51, 51], [9875, 172871], [1000003, 1000002], [523, 524], [17, 172872], [523, 1048577], [522, 17], [99999, 99999], [530122, 231], [234, 999984], [8, 9877], [999983, 999984], [9, 101], [7, 999984], [232, 530122], [523, 172869], [999999, 19], [9875, 99999], [54320, 54321], [233, 999985], [522, 9876], [4322, 172869], [16, 9875], [17, 9877], [522, 9877], [232, 999984], [172870, 9875], [9875, 9875], [54322, 7], [172870, 172869], [4320, 1009], [1000001, 524], [530122, 19], [54322, 4321], [19, 17], [54323, 530124], [233, 9878], [54323, 232], [172869, 4322], [4320, 999984], [9878, 9875], [52, 51], [1000001, 1000000], [1048577, 1000001], [54322, 1000000], [530122, 530123], [8, 530122], [7, 1000001], [100019, 172871], [9876, 523], [1048576, 1009], [4322, 530123], [6, 100000], [172871, 18], [100, 101], [232, 522], [1000000, 18], [9877, 9878], [524, 51], [1009, 233], [172872, 1010], [6, 530123], [1009, 234], [523, 172870], [18, 524], [530123, 1009], [100019, 100019], [9875, 524], [1048576, 4322], [9874, 999983], [530124, 9875], [54320, 101], [172870, 1048577], [1048577, 54322], [1000001, 999984], [19, 9], [233, 100], [1000001, 1000001], [9878, 9877], [234, 235], [1048576, 100019], [19, 1000001], [9874, 9874], [19, 10], [54320, 1010], [1000000, 9877], [234, 1000001], [1000000, 999984], [232, 172872], [1000000, 4320], [19, 524], [172871, 1009], [1000002, 1000003], [235, 100000], [4320, 4320], [8, 232], [523, 999985], [100019, 530122], [19, 235], [1009, 1009], [101, 1009], [54321, 100], [236, 236], [1000001, 530123], [172871, 6], [4322, 1010], [172872, 172872], [9876, 18], [235, 236], [50, 523], [9876, 999983], [172873, 172872], [234, 233], [19, 100], [18, 18], [172870, 172868], [172873, 1009], [1048577, 4322], [19, 9875], [522, 522], [999983, 530123], [530123, 524], [999998, 999999], [523, 17], [18, 1000001], [172868, 235], [1000002, 530122], [172869, 232], [4320, 233], [7, 999983], [172869, 9875], [18, 523], [101, 999999], [8, 54321], [9875, 1048577], [172869, 172870], [9877, 233], [10, 999983], [525, 9877], [9878, 9874], [99999, 9877], [4321, 999985], [52, 172872], [17, 172873], [999984, 530122], [1009, 4320], [999985, 999983], [530122, 100019], [999998, 18], [172872, 530122], [522, 9875], [1000000, 54322], [172871, 172872], [1009, 235], [99999, 523], [99999, 1048576], [19, 4322], [1000000, 525], [4319, 4320], [525, 17], [530124, 999997], [522, 54322], [54323, 9877], [522, 530124], [9875, 530124], [523, 18], [172868, 172868], [54323, 231], [100000, 100000], [999984, 7], [172873, 19], [9876, 9877], [172871, 999983], [18, 19], [233, 236], [4320, 50], [234, 9878], [999985, 172871], [1048576, 1048576], [102, 54322], [999997, 100019], [4318, 4320], [238, 236], [101, 52], [4322, 1009], [999997, 18], [999985, 8], [1048577, 49], [19, 102], [4323, 999985], [1011, 1010], [999984, 18], [1048576, 1048575], [231, 530122], [172868, 172869], [4323, 4320], [8, 999999], [999998, 999998], [9877, 4320], [54322, 54322], [525, 525], [525, 524], [100019, 232], [102, 9876], [233, 102], [9877, 999998], [4321, 1000001], [9877, 999983], [522, 100001], [525, 54323], [16, 20], [10, 236], [4318, 19], [7, 232], [999984, 232], [9875, 9877], [100000, 236], [100018, 100019], [1000002, 54322], [172869, 172868], [100018, 172873], [999985, 52], [99, 54321], [9878, 17], [20, 18], [233, 172872], [1048577, 1048577], [236, 102], [16, 6], [1000002, 999984], [1000002, 100000], [999983, 172870], [9878, 9878], [232, 17], [1011, 1009], [234, 530124], [238, 99], [530122, 530122], [100000, 172871], [999997, 16], [999985, 172872], [100018, 100018], [530124, 530124], [9, 4322], [999997, 17], [231, 523], [16, 999997], [9875, 52], [1011, 9878], [172870, 100000], [102, 4321], [100019, 530123], [999983, 9875], [530123, 521], [18, 20], [1008, 1009], [1000002, 525], [530123, 530124], [172870, 9878], [100000, 6], [524, 524], [52, 1000001], [172873, 236], [10, 234], [236, 172874], [10, 1000001], [9875, 9876], [1009, 18], [19, 1048577], [999984, 1009], [9875, 9874], [18, 231], [172873, 1048576], [999983, 172871], [4322, 1048576], [99999, 9878], [233, 232], [4322, 172870], [19, 1000002], [54319, 54320], [7, 8], [999985, 999986], [100000, 9], [50, 50], [530121, 530122], [1010, 100018], [238, 238], [999984, 100001], [172871, 1010], [100000, 524], [1008, 18], [524, 18], [9, 530122], [16, 82], [1009, 16], [52, 522], [100001, 172871], [54323, 530123], [172873, 172873], [100018, 233], [530122, 7], [4321, 4319], [52, 17], [1000001, 999998], [100001, 100001], [231, 1000003], [100, 1011], [100000, 999985], [524, 999999], [54321, 172871], [18, 999984], [9, 9], [54322, 172873], [172869, 100001], [235, 9878], [237, 236], [999986, 9875], [77, 1010], [172871, 999999], [232, 4322], [17, 4320], [18, 1009], [172873, 172874], [172871, 524], [100001, 1048576], [100, 16], [19, 999986], [525, 523], [54318, 172873], [1000003, 530122], [1009, 9], [77, 172871], [1008, 234], [9, 521], [9874, 530124], [52, 1000002], [9875, 54319], [234, 54320], [54323, 522], [100, 999984], [9877, 530124], [100, 999997], [231, 8], [524, 17], [54320, 54322], [4320, 523], [1000000, 999986], [51, 1011], [4322, 100019], [18, 9874], [522, 521], [1000002, 4323], [54323, 54322], [52, 52], [172870, 1000004], [16, 1009], [82, 82], [999998, 524], [9874, 54321], [231, 54322], [4318, 54321], [100018, 999986], [4322, 232], [1000002, 172872], [4322, 4322], [999986, 1048576], [54318, 231], [234, 524], [54318, 4319], [8, 8], [530122, 9877], [521, 233], [172869, 54321], [1000004, 1000001], [999983, 530122], [54322, 54319], [8, 172869], [530121, 530121], [51, 54319], [1011, 1048576], [4319, 9875], [172870, 4323], [17, 530124], [1048576, 1048577], [1048578, 1048577], [172872, 18], [172873, 999997], [100001, 4322], [100018, 1008], [0, 1], [1, 1], [0, 2], [1, 2], [2, 2], [99, 2], [100, 2], [2, 1], [0, 100], [50, 1000000], [99999, 100000], [234, 523], [999999, 1048576], [530123, 234], [99997, 100000], [99997, 9877], [99997, 9878], [99997, 99997], [999999, 999983], [1048577, 172870], [99999, 100019], [234, 100], [101, 523], [99998, 99997], [7, 100], [17, 234], [54321, 172870], [999983, 99997], [17, 999984], [9876, 54322], [530124, 234], [50, 100019], [99997, 523], [17, 99997], [99999, 100020], [999982, 999982], [100, 7], [100000, 9876], [54322, 100], [16, 999984], [1000000, 1000001], [99, 7], [999998, 100019], [530124, 235], [234, 234], [9878, 1048576], [530124, 9878], [7, 234], [98, 99], [530123, 54321], [100, 99], [1000000, 234], [16, 523], [4321, 99997], [1048576, 530123], [999985, 999984], [172870, 999998], [101, 530122], [999982, 524], [999983, 524], [99, 101], [999998, 9878], [530123, 235], [1048576, 999982], [530123, 99997], [8, 7], [54322, 530125], [999982, 4321], [76, 100000], [7, 523], [99999, 16], [54322, 234], [999982, 999983], [101, 100], [530122, 524], [1048575, 46], [99999, 15], [999998, 76], [99, 100], [9876, 1010], [99998, 100000], [101, 99998], [999981, 4321], [1000000, 233], [9877, 1048576], [100020, 9878], [17, 1000000], [523, 522], [100, 9876], [54322, 99997], [999981, 1048577], [54322, 54321], [100000, 233], [4321, 999983], [1048575, 99], [98, 101], [530123, 99996], [98, 98], [999981, 4320], [523, 99997], [1048579, 1048577], [99996, 99997], [522, 523], [15, 54321], [98, 1048577], [17, 999999], [522, 1000000], [54321, 1000000], [999999, 100020], [99, 999981], [233, 54322], [530124, 99997], [9876, 522], [999998, 530122], [100019, 4321], [99996, 9877], [999985, 999985], [100020, 54322], [16, 9878], [1048576, 234], [235, 999998], [530123, 100], [234, 999999], [9876, 1048577], [235, 46], [15, 9878], [15, 523], [999999, 100018], [523, 99], [100020, 99], [97, 172870], [235, 999999], [101, 234], [8, 99], [1048575, 1048575], [530122, 99996], [999999, 4321], [100, 999981], [76, 76], [99997, 98], [1048576, 9876], [521, 1000000], [999999, 234], [530124, 530125], [54321, 4320], [1048574, 172870], [1048578, 1048576], [530124, 1048575], [1048576, 7], [1048576, 9877], [9879, 9878], [99998, 530122], [9876, 524], [524, 172870], [4320, 99997], [233, 1000000], [16, 1048576], [54322, 1048576], [98, 97], [9878, 530123], [523, 54321], [7, 172870], [99998, 1048576], [4320, 99999], [1011, 99997], [46, 235], [999983, 99999], [999998, 172870], [1000000, 999982], [100020, 50], [100020, 1048576], [101, 99997], [530125, 999982], [1048575, 100001], [4321, 1011], [9878, 521], [1011, 1011], [54322, 99998], [1010, 1010], [1048576, 522], [530122, 99995], [1000000, 100020], [97, 98], [172871, 9878], [101, 9878], [9876, 1048575], [9876, 530125], [54321, 100001], [999999, 530122], [234, 999998], [99997, 530125], [235, 99997], [234, 530125], [15, 101], [530122, 522], [1000001, 172872], [54322, 999984], [530125, 54321], [530122, 100], [88, 88], [99999, 999983], [1048577, 9878], [530124, 99999], [16, 1048577], [172870, 100019], [1048576, 99995], [1000001, 234], [17, 999985], [99999, 4321], [233, 99996], [1048577, 9877], [100021, 100021], [97, 9878], [100021, 54322], [100021, 99996], [7, 54321], [530122, 9878], [521, 17], [100019, 1048578], [1048574, 1048574], [235, 1000000], [521, 521], [1010, 8], [530122, 172871], [1000000, 15], [1048581, 1048580], [235, 8], [97, 76], [99998, 172872], [4319, 99999], [9878, 54321], [46, 1048575], [98, 999981], [98, 100018], [99996, 100000], [235, 521], [100020, 100020], [17, 1048578], [99998, 99998], [530124, 100000], [523, 1048575], [522, 999985], [14, 15], [999986, 999983], [99997, 97], [233, 523], [999985, 1048574], [99995, 99998], [100000, 100001], [1048578, 1048578], [99999, 1048578], [1048574, 100020], [99997, 1048576], [1048576, 100001], [4321, 99999], [99996, 99996], [17, 99998], [234, 530123], [530122, 1048576], [1048577, 1048576], [97, 99996], [522, 54321], [9879, 1048580], [4320, 100000], [999983, 100000], [9876, 77], [101, 99], [98, 4321], [98, 9876], [1048574, 999998], [235, 99999], [16, 9879], [99998, 234], [100018, 100000], [17, 99999], [15, 50], [99999, 99998], [530122, 530121], [172872, 4321], [100019, 100020], [235, 235], [49, 50], [100000, 14], [99996, 16], [999984, 100019], [233, 524], [76, 523], [100021, 530122], [99, 99997], [100020, 100021], [1048580, 99995], [523, 999983], [54321, 233], [1010, 101], [234, 232], [100018, 232], [100, 98], [100, 99998], [100020, 9879], [100020, 1048577], [76, 9878], [77, 9876], [76, 99999], [50, 49], [99996, 999999], [100020, 1048578], [1048576, 999983], [99999, 102], [4321, 530123], [1048577, 1048578], [46, 530122], [1048574, 100019], [530125, 99], [999999, 1000000], [1010, 999986], [235, 530123], [999981, 54322], [9879, 9880], [88, 89], [1000000, 54321], [999981, 999981], [4319, 999982], [76, 530125], [1048575, 1048576], [47, 47], [101, 102], [1048579, 100], [530122, 101], [100002, 100001], [9876, 4319], [1011, 521], [54321, 54322], [7, 100017], [4320, 9876], [99999, 9876], [97, 97], [99999, 1048579], [9880, 100000], [999985, 522], [54320, 54320], [234, 97], [76, 234], [89, 89], [7, 97], [99996, 172870], [9879, 999999], [1048575, 999985], [999984, 99999], [15, 1000001], [530122, 100021], [17, 523], [9876, 999981], [530122, 523], [999985, 98], [98, 530124], [999986, 999982], [46, 46], [1048580, 1048580], [16, 524], [101, 7], [530125, 47], [999999, 999984], [100, 100018], [1048574, 88], [54320, 1048578], [1012, 1011], [9878, 7], [14, 54321], [172871, 100019], [96, 172870], [4318, 1048576], [89, 100000], [530122, 999983], [1048575, 99997], [235, 530125], [8, 236], [999981, 172870], [89, 54322], [530125, 530124], [47, 89], [100002, 999998], [1048581, 46], [76, 530123], [1048576, 521], [7, 9880]], "completion": "\ndef modp(n: int, p: int) -> int:\n \"\"\"\n Return 2^n modulo p (be aware of numerics).\n \"\"\"\n return pow(2, n, p)\n", "raw_completion": "```python\ndef modp(n: int, p: int) -> int:\n \"\"\"\n Return 2^n modulo p (be aware of numerics).\n \"\"\"\n return pow(2, n, p)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef modp(n: int, p: int):\n \"\"\"Return 2^n modulo p (be aware of numerics).\n >>> modp(3, 5)\n 3\n >>> modp(1101, 101)\n 2\n >>> modp(0, 101)\n 1\n >>> modp(3, 11)\n 8\n >>> modp(100, 101)\n 1\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/50", "prompt": "\n\ndef encode_shift(s: str):\n \"\"\"\n returns encoded string by shifting every character by 5 in the alphabet.\n \"\"\"\n return \"\".join([chr(((ord(ch) + 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n\n\ndef decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"\n", "entry_point": "decode_shift", "canonical_solution": "\n\n return \"\".join([chr((ord(ch) - ord(\"a\") - 5 + 26) % 26 + ord(\"a\")) for ch in s])\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n from random import randint, choice\n import copy\n import string\n\n letters = string.ascii_lowercase\n for _ in range(100):\n str = ''.join(choice(letters) for i in range(randint(10, 20)))\n encoded_str = encode_shift(str)\n assert candidate(copy.deepcopy(encoded_str)) == str\n\n", "contract": "\n assert s == \"\" or s.islower(), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["tantywccpjkimslotpzs"], ["clknfxdnox"], ["dtzqyosaovdbafbg"], ["dffjvztknohzf"], ["brhkdngfwd"], ["amlcrporykmgbhzctpnh"], ["ondbgojmipwoofzeyrh"], ["atobiwyiitrvhuctz"], ["kyrzjawonglfbsedmhmk"], ["esusgpgnaelf"], ["jbocbcqiuggvenbq"], ["zmmcumljlx"], ["ibrcruwukgetv"], ["ncbelcfjqcgxshtdiz"], ["xgcckzjdfp"], ["gzlnmjjytxhydvy"], ["zxlxfflljav"], ["kfeabaemohxvodorv"], ["kdfcevzlswkkmkwdrcrg"], ["oxtrmhyjjbm"], ["bvhfetbvrspmepdqu"], ["lycqknawupoydpve"], ["vmbjsfxvtgjkxgvazub"], ["ffkskhcrjnixkkdivamc"], ["zszowxcyfksyaiov"], ["mcqqnjopwar"], ["dkglzmaccvjlrjuhgmp"], ["hudnjifakmaknaiwjjoz"], ["ppineedncm"], ["nhnnpeyazv"], ["hfgrlomgpnzomltm"], ["opejcxrnkfi"], ["caocjafernbzwkerkjul"], ["uenrgscamkc"], ["ntphbmfuyhgxxekrh"], ["lullbgnzzlpsf"], ["nfzgyzvqkkkhqwoc"], ["rseeagndpy"], ["jzfmflvqsujn"], ["zhemzjdbgmzhlojon"], ["bejmmyaivqmztwx"], ["dkrixwritnwanp"], ["phbenxhnsrceqgo"], ["lkwatqvqox"], ["sodavpratfhciez"], ["rdbebqamnqnrojlyc"], ["qpcjvbttxkfoarmbgaj"], ["buoybjwmnkca"], ["zhsxvqgydfzom"], ["ebqzwqwgczokyqlleqv"], ["zkblrdvzwzfcucl"], ["qhyokykhohqmbg"], ["ppivcuwwha"], ["tojlipluqsrqxmkl"], ["pmtxclojrsx"], ["ankmnlxytriytxuycfar"], ["vbxyasxabsgmm"], ["nvscnydxnomkbhzo"], ["qnfhjywwxbewrtwqz"], ["qcopkrvocdnbvok"], ["vmiimkfgpijybehf"], ["umivhawwroqbi"], ["ngtcnxdbfem"], ["rceydgerfqlcdjwqufp"], ["xiwqysuzxhrok"], ["pbiutcflmhcatu"], ["eigoipkfsygpkzdbfba"], ["pksrbhoobdcxuzztpry"], ["ufpgxygqut"], ["ruysajspjftawat"], ["htltipbsjyeyd"], ["nbdcbfdwridowau"], ["tmppfczqbbymxz"], ["uozrdjywqt"], ["hntgkfcaqplmvwigugcn"], ["fjvtaauddtbfxyx"], ["oueajaaouchg"], ["xjnoxinpwjxfkdhypha"], ["ydkfspcqqgoy"], ["zkhvcaficnsrpftfyacc"], ["uhvwguwpwp"], ["caqjqcvjknjpxvsh"], ["jgartypykutysuu"], ["kcjkljbqqqllnvvn"], ["cyhmtsgqyz"], ["kfznlgufze"], ["evvyotysuo"], ["bszxdxfofeuqowuul"], ["fxrorccues"], ["fjbitcryrirgche"], ["esmaafzdoathkfbr"], ["nyglikurdgsrxppfaaaq"], ["tbnxtryklhivaozovo"], ["ysapkxzhoyt"], ["szmyeptvbecdu"], ["aehjjihebqyikhgbfdv"], ["blxkxtkcpajpuyghrj"], ["yfctlzlvmg"], ["ltlczacgtm"], ["kenorgfepxvymu"]], "atol": 0, "plus_input": [["abcdefghijklmnopqrstuvwxyz"], ["encoded message with shift"], ["abcde"], ["vwxyz"], ["hello world"], ["the quick brown fox jumps over the lazy dog"], ["\u00e9\u00ee\u00f8\u00fc\u00f1"], [""], ["hello"], ["world"], ["the quick brown fox jumps over the abcdefghijklmnopqrstuvwxyzlazy dog"], ["\u00e9\u00ee\u00f8\u00fchello world\u00f1"], ["worlencoded message with shiftd"], ["abcdefghijklmnopqrsttuvwxyz"], ["worhello worldld"], ["worlencoded messagevwxyz with shift"], ["worlencoded messagevtwxyz with shift"], ["helleo"], ["abcdefghijklmnopqrsttupvwxyz"], ["the quick brown fox jumps olazy dog"], ["worello worl dld"], ["abcdefghijklmnopqrsttuvwxhello wo\u00e9\u00ee\u00f8\u00fchello world\u00f1rldyz"], ["hoello world"], ["\u00e9vwxyz\u00ee\u00f8\u00fc\u00f1"], ["worldd"], ["worlencoded messagetwxyz with shift"], ["abcdefghijklmnopqrsattupvwxyz"], ["abcworld\u00f1rldyz"], ["worello abcdew orl dld"], ["abcdefghijklmnopqrstuvwxyzhelleo"], ["abcwlorldabcdefghijklmnopqrsattupvwxyz\u00f1rldyz"], ["the quick brpown fox jumps olazy dog"], ["worello wor"], ["v"], ["worlencoded messagetwxyzt"], ["bdce"], ["worellco abcdew orl dld"], ["helllo"], ["worhello worrldld"], ["worello worl ldld"], ["abcdefghijklworlencoded messagetwxyz with shiftmnopqrsttuvwxyz"], ["abcwlorworello worl ldldghijkltmnopqrsattupvwxyz\u00f1rldyz"], ["worencoded message with shifworello worl ldldtld"], ["encoded message wsith sft"], ["abcwlorldabcdenfghijklmnopqrsattupvwxyz\u00f1rldyz"], ["vwxyhello woroldz"], ["worellrl dld"], ["hellllo"], ["worlencoded messagevwxyz with shivft"], ["abcdetfghijklworlencoded messagetwxyz with shiftmnopqrsttuvwxyz"], ["worellco abcdew orv dld"], ["wworlencoded messagevwxyz with shiftorldd"], ["abcdefghijklmnopqrstuworlencoded messagetwxyz with shiftvwxyzhelleo"], ["worlvwxyzcoded messagevtwxyz with shift"], ["\u00e9\u00ee\u00f8\u00fchello \u00f1world\u00f1"], ["encoded mwsith sft"], ["wworlenccoded messagevwxyz with shiftorldd"], ["vwxyyz"], ["encoded mwsith ssft"], ["worlthe quick brpown fox jumps olazy dogvwxyzcoded messagevtwxyz with shift"], ["worebcdew orl dld"], ["abcdefghijklmworlencoded messagevwxyz with shivftnopqrstuworlencoded messagetwxyz with shiftvwxyzhelleo"], ["worebcdew orl dworlencoded messagevwxyz with shivftld"], ["abc\u00f1world\u00f1rldyz"], ["vwxyzwxz"], ["abcwlorldabcdefghijklmnopqrsazttupvwxyz\u00f1rldyz"], ["worlencoded messagevwxyz wishifft"], ["worlddd"], ["worlthe quick brpown fox jumps olazy dogvwxyzcworlencoded messagevwxyz with shivftoded messagevtwxyz with shift"], ["worhdld"], ["worelllrl dld"], ["abcddefthe quick brpown fox jumps olazy dogghijklmnopqrsttuv\u00ee\u00f8\u00fchello world\u00f1rldyz"], ["abcdetfghijklworlencoded messagetwxyz with shiftmnopqrmsttuvwxyz"], ["abcdde"], ["worello worl lldldhelllo"], ["worellrdld"], ["encoded messagwworlencoded messagevwxyz wishifftsith sft"], ["abcede"], ["wworlencoded messagevwxgyz with shrldd"], ["worhello wold"], ["abcdefghijmnopqrstuvwxyz"], ["helabcwlorldabcdefghijklmnopqrsazttupvwxyz\u00f1rldyzlllo"], ["\u00e9\u00ee\u00f8\u00fchelwlo world\u00f1"], ["t fox jumps olazy dog"], ["abcddefthe quick brpown fox jumps olazy dogghijklm\u00e9\u00ee\u00f8\u00fchello \u00f1world\u00f1nopqrsttuv\u00ee\u00f8\u00fchello world\u00f1rldyz"], ["the quick brown fox jumps oulazy do\u00e9\u00ee\u00f8\u00fchello \u00f1world\u00f1g"], ["\u00e9\u00eeworhello worldld\u00f8\u00fc\u00f1"], ["abc\u00f1world\u00f1rldoyz"], ["the quick brown fox jumps over the abcdefghijklmnopqg"], ["the quick brown fox jumps overabcdefghijklmnopqrsattupvwxyz the abcdefghijklmnopqg"], ["abcwlorworlthe quick brpown fox jumps olazy dogvwxyzcworlencoded messagevwxyz with shivftoded messagevtwxyz with shiftldabcdefghijklmnopqrsazttupvwxyz\u00f1rldyz"], ["worlencoded message with shiftwd"], ["abcworhdldddefthe quick brpown fox jumps orlazy dogghijklmnopqrsttuv\u00ee\u00f8\u00fchello world\u00f1rldyz"], ["worlencoded messagetwxyz with worlencoded message with shiftwdshift"], ["habworlencoded messagetwxyz with worlencoded message with shiftwdshiftcdeellllo"], ["\u00e9\u00eeld\u00f1"], ["encoded message wsith worlencoded messagetwxyz with worlencoded message with shiftwdshiftsft"], ["worlencoded messagetwxyz witsh worlencoded message with shiftwdshift"], ["t fos olazy dog"], ["worleabcdefghijklmnopqrsttuvwxyzncoded message with shiftd"], ["thequickbrownfoxjumpsoverthelazydog"], ["1a2d3g4j5m6p9s8v7y0z"], ["thequickbrownfoxjumpsoverthelazydog123"], ["a"], ["xyz"], ["vwxyzabcdefghijklmnopqrstuvwxyz"], ["this is a test"], ["test input with spaces"], ["is"], ["abcdefghijklmnopqrstuvwxywithz"], ["xyzxyz"], ["vwxyzabcdefghijklmnopqrstuyvwqxyz"], ["thequickxyzbrownfoxjumpsoverthelazydog"], ["jumpsoverthelazydog123"], ["xyxyzxyz"], ["this"], ["itthis"], ["tihis"], ["tihisis"], ["with"], ["abcdefghijklmnopqrstuvwx"], ["1a28d3g4j5m6p9s8v7y0z"], ["input"], ["xyxzyzxyz"], ["1a28d3itthis6p9s8v7y0z"], ["itthis is a test"], ["thequickbrownfoxjumpsoverthelazydoeg"], ["xyxthequickbrownfoxjumpsoverthelazydoegyzxyz"], ["iput"], ["abcdefghijklmnopqrstuvwhx"], ["thequickxyzbrownfoxjumpsoverthitthiselaznydog"], ["wihth"], ["iputabcdefghijklmnopqrstuvwx"], ["wit"], ["abcdewithfghijklwithmnopqrsinputtuvwiputx"], ["spaces"], ["thequickxyzbwihthrownfoxjumpsoverthdog"], ["xyxzzxyz"], ["thequickxyzbrownfoxjumpsoverthelazthis is a testydog"], ["athequickbrownfoxjumpsoverthelazydoeg"], ["1a28d3ihtthis6p9s8v7y0z"], ["abcdefghiabcdefghijklmnopqrstuvwxyzjklmhx"], ["tiabcdefghijklmnopqrstuvwxywithzlshis"], ["vwxyzabcydefghijklmnopqrstuvwxyz"], ["iathequibrhownfoxjumpsoverthelazhydoeg"], ["abcdefghiabcdefbghijklmnopqrstuvwxyzjklmhx"], ["spvwxyzabcdefghijklmnopqrstuyvwqxyzaces"], ["thequickxyzbrownfoxjumpsoverthelazthis"], ["awhx"], ["abcdefghijklmnopqrinputstuvwx"], ["abcdefghiabcdefghijklmnobpqrstuvwxyzjklmhx"], ["thequickbrspvwxyzabcdefghijklmnopqrstuyvwqxyzacesownfoxjumpsoverthelazydoeg"], ["xyxzyyzxyz"], ["thequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthis"], ["thequickxyzbrownfoxjumpsoverthelazyddog"], ["tiabcdespacesfghijklmnopqrstuvwxywithzlshis"], ["abcdewithfghivjklwithmnopqrsinputtuvpwiputx"], ["athequickbrolwnfoxjumpsoverthelazydoeg"], ["thequickxyzbrownfoexjumpsoverthelazthis"], ["iputabcdefghijklmnopqspvwxyzabcdefghijklmnopqrstuyvwqxyzacesrstuvwx"], ["awhwx"], ["abcdewithfghivjqrsinputtuvpwiputx"], ["t"], ["1a28d3itthis6p9s8z"], ["jumpsoazspacesydog123"], ["athezydoeg"], ["wihtjumpsoazspacesydog123h"], ["iathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoeg"], ["witth"], ["aabcdefghiabcdefbghijklmnopqr"], ["tiabcdefghijklmnopqrstuvwthequickxyzbrownfoxjumpsoverthelazyddogxywithzlshis"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsois"], ["athequickbrownfoxjumpsoverthelapzydoeg"], ["abcdefghixjklmnopqrstuvwx"], ["sxyzaces"], ["abcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwx"], ["sxthis is a testyzaces"], ["wihhth"], ["spacces"], ["tiabcdespaicesfghijklmnopqrstuvwxywithhzlshis"], ["tiasbcdespacesfghijklmnopqrstuvwxywithzlshis"], ["thequickxyzbrownfoxjumpsoverthelazthis is stydog"], ["test"], ["xthequickxyzbrownfoxjumpsoverthitthiselaznydogyz"], ["tiabcdefgihijklmnopqrstuvwxywithzlshis"], ["thxyxzyzxxyzyzequickbrownfoxjumpsoverthelazydoeg"], ["athezydoegt"], ["xvwxyzabcdefghijklmnopqrstuvwxyz"], ["thequickxyzbrownfoxjumpsoverthelazsthis is sabcdefghijklmnopqrstuvwxyzog"], ["abcdewithfghivjklwithmnopqrsinnputtuvpwiputx"], ["sabcdefghijklmnopqrstuvwxyzog"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["abcdewithtestfghijklwithmnopqrsituvwiputx"], ["spvwxyzabcdefghijklmnopqthequickbrownfoxjumpsoverthelazydog123rstuyvwqxyzaces"], ["iwitthtthis is a test"], ["spvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzaces"], ["jumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123"], ["abjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrstuvwx"], ["thequickxyzbrownfoxjumpsoverthelazsthis"], ["wiiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegtth"], ["tthequickbrownfoxjumpsoverthelazydog123"], ["xvwcxyzabcdefghijklmnopqrstuvwxyz"], ["athequickbrownbfoxjumpsoverthelazydoeg"], ["athequictkbrownbfoxjumpsoverthelazydoeg"], ["itwitthtthis is a testspaces"], ["abcdefghijkathequickbrolwnfoxjumpsoverthelazydoeglmnopqrstuvwxyz"], ["thequickxyzbrownfoexjumpsoverthelazitthis is a testthis"], ["itthis tiabcdefghijklmnopqrstuvwxywithzlshisis a test"], ["jumpsoverthelazydo23"], ["wihtjumpsoazspacesydawhwxog123h"], ["asbcdefghijklmnopqrstuvwhx"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["vwxyzabcdefghijklmnopqrstuyvwqxyisz"], ["abcdefghijklmqnopqrinputstuvwx"], ["doegyzxzyz"], ["wiiathequibrhownfogxjumpsoverthexlaxyxzyzxyzzhydoegtth"], ["vwxyzabcydefghijklmnoprs"], ["wihtjumpsoazspacesydawhwxo23h"], ["itwitthtthis"], ["testthis"], ["xythequickxyzbrownfoxjumpsoverthelazsthisxz"], ["xyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyz"], ["aethezydoegt"], ["watmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["sxthis"], ["itestydognpwihtjumpsoazspacesydog1z23hut"], ["thequickxyzbrownfoexyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzxjumpsoverthelazthis"], ["iathequibrhownfoxjumpsuoverthelazhydoeg"], ["thequickbrownfoxjumpsoverthelazydo3"], ["thequickxyzbrownfoxjuiathequthequickxyzbrownfoexyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthis"], ["thequickbrspvwxyzabctthequickbrownfoxjumpsoverthelazydog123defghijklmnopqrstuyvwqxyzacesownfoxjumpsoverthelazydoeg"], ["aeethezydspaccesoegt"], ["iwitthtthis"], ["abcdefghijkathequickbrolwnfoxjumpscoverthelazydoeglmnopqrstuvwxyz"], ["uiput"], ["tewatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["athequickbrolwnfoxjumpswihtjumpsoazspacesydog123hoverthelazydoeg"], ["abcdefghiabcdefbghisjklmnopqrstuvwxyzjklmhx"], ["vwxyzabcydefgohijklmnopqrstuvwxyz"], ["hwihhthh"], ["thxyxzyzxxyzyzequickbrownfoxjumpsothequickxyzbrownfoxjumpsoverthitthiselaznydogverthelazydoeg"], ["sxyzacethequickxyzbrownfoxjumpsoverthelazsthiss"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitathhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["testyzaces"], ["1a28d3itthis36p9s8z"], ["abcdefghijkavwxyzabcydefghijklmnoprsjumpsoverthelazydoeglmnopqrstuvwxyz"], ["tiabcdefghijklspvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesmnopqrstuvwxywithzlshis"], ["thequickxyzbrownfoxjumpsovertheslazthis is a testydog"], ["wt"], ["test input with spacews"], ["testxthequickxyzbrownfoxjumpsoverthitthiselaznydogyzthis"], ["hwihhthhh"], ["thequickxyzbrthisownfoexjumpsoverthelazthis"], ["thequickxyzbrownfoxojumpsoveiputabcdefghijklmnopqspvwxyzabcdefghijklmnopqrstuyvwqxyzacesrstuvwxog"], ["aeetheezydspaccesoeitestydognpwithequickxyzbrownfoxjumpsoverthelazthishtjumpsoazspacesydog1z23hutgt"], ["vwyzabcdefghijklmnopqrstuyvwfqxyz"], ["spaccces"], ["vwxyzabcde"], ["splvwxyzabcdefghijklmnopqrstuycvwqxyzaces"], ["tihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrstuvwx"], ["abcdewithfghivjklwithmnxvwcxyzabcdefghijklmnopqrstuvwxyzwiputx"], ["wihytjumpsoazspacesydawhwxo23h"], ["abcdefghiabcdefghijklmnopqrstuvwxcyzjklmhx"], ["xyxthequickvbrownfoxjumpsoverthelazydoegyzxyz"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitattihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrsptuvwxhhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["abcdefghijkavwxyzabcydefghijkvwxyz"], ["abcdefghithequickxyzbrownfoexjumpsoverthelazitthisvwxyz"], ["itithis is a test"], ["ttiabcdefgihijklmnopqrstuvwxywithzlshishis is a test"], ["ttimabcdefgihijklmnopqrstuvwxywithzlshishis is a test"], ["tabcdewithfghivjklwithmnopqrsinnputtuvpwiputx"], ["abcdefghiabcdefbghisjklmnopqrstu1a28d3ihtthis6p9s8v7y0zvwxyzjklathequickhwihhthhbrolwnfoxjumpsoverthelazydoegmhx"], ["tiabcdespacesfghijklmnopqrstulshis"], ["iputabcdefghijklmnopqrs1a28d3g4j5m6p9s8v7y0ztuvwx"], ["vwxyzabcdefghtestthisijklmnopqrstuyvwqxyisz"], ["xvxyz"], ["iputabcdefghijklmnopqrstuvx"], ["abcdefghiabcdefbghijklmnopqrstuvwxygzjklmhx"], ["abcttimabcdefgihijklmnopqrstuvwxywithzlshishis is a testdefghithequickxyzbrownfoexjumpsoverthelazitthisvwxyz"], ["ititsabcdefghijklmnopqrstuvwxyzoghis"], ["abcduthxyxzyzxxyzyzequickbrownfoxjumpsoverthelazydoegiputefghijkathequickbrolwnfoxjumpscoverthelazydoeglmnopqrstuvwxyz"], ["vwxyzabcdefghijkplmnopqrstuvwxyz"], ["thequickxyzbrownfoxojumpsoveiputabcdefghijklmnopqspvwxyzabcdefghijtihisklmnopqrstuyvwqxyzacesrstuvwxog"], ["abcdefghijkatlazydoeglmnopqrstuvwxyz"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["ititsabcdefghijklmnopyqrstuvwxyzoghis"], ["abcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutx"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["ththequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisis a test"], ["athequickbrownfoxjumpsoverthelazydoe"], ["abcdefghijklmqnopqrinathequickbrownfoxjumpsoverthelapzydoegputstuvwx"], ["tiabcdefghijklmnopqrstuvwxywithzlshisis"], ["iathelazhydoeg"], ["vwxyzabcdefghtestthisijklmnopqxrstuyvwqxyisz"], ["1a28da3itthis6p9s8v7yawhwxz"], ["1a28d3itthistestthis36p9s8z"], ["iwitthtthiwihtjumpsoazspacesydawhwxog12"], ["vwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyz"], ["abcdspacewsewithtestfghijklwithmnopqrsituvwiputx"], ["hwihh"], ["xyxthequickbrownfoxjumpsovevwxyzabcydefghijklmnoprsthelazydoegyzxyz"], ["iathelazzhydoeg"], ["jumlazydo23"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoexjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["xvwthequickxyzbrownfoxjumpsoverthitthiselaznydogcxyzabcdefghijklmnopqrstuvwxyz"], ["tje"], ["jumpsoazspacesyzdog123"], ["aeetheezydspaccesoeitestydognpwithequickxyzbrownfoxjumpsoverthelazthishtjumpsoaszspacesydog1z23hutgt"], ["tabcdewithfghivjklwithmnopqrsinnputuvpwiputox"], ["jumpsoverthelazyedo23"], ["wiiathequibrhownfogxjumpsovaeethezydspaccesoegterthelaxyxzyzxyzzhydoegtth"], ["tiabcdespacesfdghijklmnopqrstulshis"], ["tiabcdefghijklmnopqrstuvwxywithzlshisttimabcdefgihijklmnopqrstuvwxywithzlshishis is a test"], ["iathequuibrhownfoxjumpsuoverthelazhydoeg"], ["xititsabcdefghijklmnopyqrstuvwxyzoghisyabcdewithfghivjklwithmnopqrabcdefghiabcdefghijklmnobpqrstuvwxyzjklmhxyyzxyz"], ["abcdefghijklmnopqrinputstuvvwx"], ["tiabcdespacesfghijklmnopqrstnuvwxywithzlshis"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoexjumpsozverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["tihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijkitestydognpwihtjumpsoazspacesydog1z23hutlmnopqrstuvwx"], ["thequickbrownifoxjumpsoverthelazydog123"], ["hwihhwitthhhh"], ["iwitthtthiwihtjumpxyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzsoazspacesydawhwxog12"], ["tiabcdespaceshfghijklmnopqrstulshis"], ["wihtjumpsoazspacesydog23h"], ["thequickbrownifoxjumpsoaverthelazydog123"], ["abcdefthequickxyzbrownfoxjuiathequthequickxyzbrownfoexyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisghijklmnopqrinputtuvwx"], ["abcdspacewsewithtestfghijklwithmnopqrsituvwi1a28da3itthis6p9s8v7yawhwxzputx"], ["watmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibbrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["sabcdefghijklmnopqrstuvwxytestyzaceszog"], ["aththequickbrownfoxjumpsoverthelazydog123equickbrownfoxjumpsoverthelazydoeg"], ["theqzuicktxyzbrownfoxjumpsovertheslazthis is a testydog"], ["athezyddoegt"], ["abcttimabcdefgihijklmnopqrstuvwxywithzlshishis is a testdefghithequickxyzbrownfoexjumpsotthisvwxyz"], ["thequickbrownfoxjumpsovertheilazydog123"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverlthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["vtuyvwqxyisz"], ["abcdefghijkathequiiathelazhydoeglwnfoxjumpscoverthelazydoeglmnopqrstuvwxyz"], ["thequtjeickxyzbrthisowsoverthelazthis"], ["thequicsabcdefghijklmnopqrstuvwxyzogkxyzbrownfoxjumpsovertheslazthis"], ["itithis"], ["abcdewithfghivjklwithiwitthtthismnopqrsinnputtuvpwiputx"], ["sxthtewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spacesis"], ["tst"], ["thequictestthiskbrspvwxyzabcdefghijeklmnopqrstuyvwqxyzacesownfoxjumpsoverthelazydoeg"], ["thequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg123"], ["vwxjklmnoprs"], ["uiputt"], ["iwitthtthiwihtjumpsoazspacesaydawhwxog12"], ["twt"], ["vwxyzabcdevwqxyisz"], ["vwxyzathequickxyzbrownfoexjumpsoverthelazitthisbcdefghtestthisijklmnopqxrstuyvwqxyisz"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifborhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["testspaces"], ["itititsabcdefghijklmnopyqabcdewithfghivjklwithmnopqrsinnputtuvpwiputxrstuvwxyzoghiswitthis"], ["thequickbgrownifoxjumpsoverthelazydog123"], ["1a28abcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8v7y0z"], ["xyxthequickbrownfoxjumpsovevathequickbrolwnfoxjumpswihtjumpsoazspacesydog123hoverthelazydoegwxyzabcydefghijklmnoprsthelazydoegyzxyz"], ["spac1a28abcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8v7y0z"], ["thequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydog"], ["abcdefghijkathequththequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisiszydoeglmnopqrstuvwxyz"], ["vwxyzabcydefghijklmnop1a28d3itthis6p9s8zrs"], ["vwx"], ["splvwxyzabvcdefghijklmnopqrstuycvwqxyzaces"], ["abcdefghiabthequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhx"], ["1a28d3gs4j58m6p9s8v7y0z"], ["jumpsoaxyxthesquickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123"], ["tytewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoexjumpsoverthelazhydoegxyxzyyzxyzmpsoisstestspaces"], ["wittth"], ["1a28d3ihtthis6p9s8v7yiwitthtthiwihtjumpsoazspacesydawhwxog120z"], ["tthequickbrownfoxjumpsovert1helazydog123"], ["abcdexyxzyyzxyzfghijklmnopqrinputstuvvwx"], ["bxvwxyzabcdefghijklmnopqrstuvwxyz"], ["tthequick1a28d3gs4j58m6p9s8v7y0zbrownfoxjumpsovert1helazydog123"], ["thequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg12v3"], ["ttheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitathhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg123"], ["spac1a28abcdefghiabcdefbghijklmnopqrsgtuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8v7y0z"], ["itthis eis a test"], ["vwxyzabcdefghtestthisijklmnoqxrstuyvwqxyisz"], ["abcdefghiabcdefbghisjklmnopqrstu1a28d3ihtthis6p9s8v7y0zvwxyzjklathequickhwihhthhbrolwnfoxjumpsoverthelazydoegmhxthxyxzyzxxyzyzequickbrownfoxjumpsoverthelazydoeg"], ["y1a28d3g4j5m6p9s8vv7y0z"], ["tewatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequisst input with spaces"], ["xyxzyyzxtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitathhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisyz"], ["xyxthefquickvbrownfoxjumthequickxyzbwihthrownfoxjumpsoverthdogzydoegyzxyz"], ["abcdefghidjklmnopqrstuvwx"], ["abjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxititsabcdefghijklmnopqrstuvwxyzoghisuvwx"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverlthelazhydoegxyxzyyzxyzmpsoisst"], ["abcdewithfghivjklwithmpnopqrsinnputtuvpwiputx"], ["abcdefghiabthequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthisthequickxyzbrownfoxjumpsoverthitthiselaznydogelaznydogcdefbghijklmnopqrstuvwxygzjklmhx"], ["abcdefghiabthequickxyzbroywwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhx"], ["w"], ["atheabcdefghijklmnopqrstuvwxzyddoegt"], ["tiabcdespacesfdnopqrstulshis"], ["thequickxyzbrownfoabcdefghijkathequiiathelazhydoeglwnfoxjumpscoverthelazydoeglmnopqrstuvwxyzxjumpsoverthitstthiselaznydog"], ["atheabcdefghijklmnopqrstuvwxzzyddoegt"], ["spvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuhyvwqxyzaces"], ["testydog"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifborhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with hspaces"], ["1a28d3vwxyzabcdevwqxyiszg4j5m6p9s8v7y0z"], ["abcdefghijklmqnopqrinathequickbwx"], ["hspaces"], ["hsabcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxpaces"], ["wiiaxthequibrhownfogxjumpsoverthexlaxyxzyzxyzzhydoegtth"], ["wihhh"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst"], ["owatmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibbrhownfoxjumpsoverthelazhydoegxyxzyyzxfyzmpsois"], ["watmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzskxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["lthequickbrooxjumsoaverthelazydog12spacces3"], ["thequidoegbcdefghijklmnopqrstuyvwqxyzacesg12v3"], ["athzezyddoegt"], ["ttimabcdefgihijklmnopqrstuvwxywithzlshishis"], ["cdefghijklmnopqrrstuyvwqxyzaces"], ["jumpsovj58m6p9s8v7y0zbmpsovert1helazydog123thelazydog123"], ["abcdefghijkatlazydoeglm"], ["hwihhthhvwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyz"], ["tewatmheozydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoexjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["ihtthis is a ttest"], ["tiasbcdespacesfghijklmnopqrstuvwxycwithzlshis"], ["thequickbrownifoxjumpsoverthelazydog1hwihh23"], ["txyxyzxyzestthis"], ["abcdefgxyxthequickbrownfoxjumpsovevathequickbrolwnfoxjumpswihtjumpsoazspacesydog123hoverthelazydoegwxyzabcydefghijklmnoprsthelazydoegyzxyzhixjklmnopqrstuvwx"], ["wiiathequibirhownfogxjumpsoverthexlaxyxzyzxyzzhydoegtth"], ["sxyzacethequrickxyzbrownfoxjumpmsoverthelazsthiss"], ["vtuyvwqxyiysplvwxyzabvcdefghijklmnopqrstuycvwqxyzacessz"], ["abcdefghiabcdefbghisjklmnopqrstu1a28d3ihtthis6p9s8v7y0zvwxyzjklathequickhwihhthhbrolwnfoxjumpsovazydoegmhx"], ["tj"], ["tthequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisj"], ["wiiatheqyuibirhownfogxjumpsoverthexlaxyxzyzxyzzhydoegtth"], ["abcdewixvwthequickxyzbrownfoxjumpsoverthitthiselaznydogcxyzabcdefghijklmnopqrstuvwxyzthfghivjqrsinputtuvpwiputx"], ["test with spacews"], ["xtewatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequisstvxyz"], ["wihthequickxyzbrownfoxojumpsoveiputabcdefghijklmnopqspvwxyzabcdefgttestnopqrstuyvwqxyzacesrstuvwxogtjumpsoazspacesydawhwxo23h"], ["itabcdewithfghivjklwithmnopqrsinnputtuvjpwiputx"], ["thequickxyzbrownselaznydog"], ["witttth"], ["tthequickbrownfoxjumppsovert1helazydog123"], ["abcdewithfghivjklwithiwitthtthismnopqrsinnputtuvpwicputx"], ["owatmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxjumpsoverthelazydoelgyzxyzkxyzbrownfoxjuiathequibbrhownfoxjumpsoverthelazhydoegxyxzyyzxfyzmpsois"], ["aeetheezydspaccesoeitestydognpwitiabcdespacesfdghijklmnopqrstulshisthequickxyzbrownfoxjumpsoverthelazthishtjumpsoaszspacesydog1z23hutgt"], ["vtuyvwqxyiysplvwxyzabvcdefghijklmnopqrstuycvwq1a28d3ihtthis6p9s8v7y0zxyzacessz"], ["tabcdewithfghivjklwithmnopqrsinnputuvwpwiputox"], ["wihtjumpsoazsopacesydog23h"], ["abcdefghiabthequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrsotuvwxygzjklmhx"], ["ttiabcdefghijkownfoxjumpsoverthelazyddogxywithzlshis"], ["hwihhhh"], ["jumpsoazspacesyzdog123uiput"], ["testyxyxthequickvbrownfoxjumpsoverthelazgydoegyzxyzzacejumpsoaxyxthesquickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123s"], ["vwxyzabcdefghijklmnopqrstuyvabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxititsabcdefghijklmnopqrstuvwxyzoghisuvwxwqxyisz"], ["1a28da3itthis6p9s8v"], ["iputabcdefghijklmnopqspvwxyzabcdefghijklmnopqrstuyvwqxyzitithis is a testacesrstuvwx"], ["vwxyzabcdefghijkplmnoathequictkbrownbfoxjumpsoverthelazydoegtuvwxyz"], ["1a28d3vwxyzabcdevwqxyiszg4j5m6p9s8vtewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverlthelazhydoegxyxzyyzxyzmpsoisst7y0z"], ["thequickbrspvwxyzabctthequicsplvwxyzabcdefghijklmnopqrstuycvwqxyzaceskbrownfoxjumpsoverthelazydog123defghijklmnopqrstuyvwqxyzacesownfoxjumpsoverthelazydoeg"], ["tthequickxyzbelazhydoegmpsoverthelazthisj"], ["tiabcdespaces1a28da3itthis6p9s8vnopqrstulsrhis"], ["atheabcdefghijklmnopqrstuvvwxyzathequickxyzbrownfoexjumpsoverthelazitthisbcdefghtestthisijklmnopqxrstuyvwqxyiszyddoegt"], ["vwxyzabcydefghijklmnoprwatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoiss"], ["abcdefghijkathequickbrtuvwxyz"], ["abcdevwxyzabcdefghijkplmnoathequictkbrownbfoxjumpsoverthelazydoegtuvwxyzfghijklmnopqrstuvwhx"], ["tewatmhezydoegtheqxyxthequickbrowwnzfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverlthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["itiititsabcdefghijklmnopyqabcdewithfghivjklwithmnopqrsinnputtuvpwiputxrjumpsoverthelazydo23stuvwxyzoghiswitthis"], ["abcdewithfghijklwithmnopqrsinputtuvpwiputx"], ["sixthis"], ["tthequickbrownfoxjumpsoverthelazydog12"], ["thxyxzwiiathequibrhownfogxjumpsovaeethezydspaccesoegterthelaxyxzyzxyzzhydoegtthickxyzbrownfoxjumpsoverthitthiselaznydogverthelazydoeg"], ["theqzuicktxyzbrownfoxjumpsovedog"], ["abcdefghithequickxyzbrownfoexjumpsovexyxyzxyzrthelazitthisvwxyz"], ["tiabcdefghijklmnopqrstuvwxywithzlshisttimabcdefgihijklmnopqrstuvwxywithzlshishis"], ["tliabcdespaicesfghijklmnopqrstuvwxywithhzlshis"], ["tewatmhezydoexgtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaces"], ["tiabcdespaicesfghijklmnopqrstuvwxyxvwxyzabcdefghijklmnopqrstuvwxyzwithhzlshis"], ["vwxyzabcydefghijklmnoprwatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoizss"], ["abcdefghijklmnopqrstuvwsixthisz"], ["abcdefghijkathequickbrolwnfoxjumepsoverthelazydoeglmnopqrstuvwxyz"], ["abcdefghithequickxyzbrownfoexjumpsovexyxyzxyzrthelazitthiosvwxyz"], ["testjumpsoazspacesyzdog123uiputyzaces"], ["iathequihbrhownfoxjumpsoverthelazhydoeg"], ["thequickbgrownifoxjumpshelazydog123"], ["xvxyabcdewithfghivjklwithiwitthtthismnopqrsinnputtuvpwiputxz"], ["lw"], ["thequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzvwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg12v3"], ["sxyzacethequrickxyzbrownfoxjvwxyzumpmsoverthelazsthiss"], ["vwxythequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzvwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg12v3thelazydoegyzxyzzspthequickxititsabcdefghijklmnopqrstuvwxyzoghisuvwxwqxyisz"], ["hvwxythequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzvwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg12v3thelazydoegyzxyzzspthequickxititsabcdefghijklmnopqrstuvwxyzoghisuvwxwqxyiszwihh"], ["athequickbrotewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifborhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with hspacesuwnfoxjumpsoverthelazydoeg"], ["thequickxyzbrownfoexjumpsoverthelathis"], ["tewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifbrhownfoexjumpsozverthelazhydoegxyxzyyzxyzmpsoisst"], ["spvwxyzaiathequibrhownfogxjumpsoverthelaxytihisxzyzxyzzhyjdoegbcdefghijklmnopqrstuyvwqxyzaces"], ["iathequibrhownfoxjumpsuovertheliazhydoeg"], ["sxthies is a testyzaces"], ["owatmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxjumpsoverthelazydoelgyzxyzkxyzbrownfhoxjuiathequibbrhownfoxjumpsoverthelazhydoegxyxzyyzxfyzmpsois"], ["thequickxyzbrownfoxjuiathequthequickxyzbrownfoexyatewatmhezydoexgtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spacesbcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthis"], ["d"], ["thdequickbrownfoxjumpsoverthelazydog123"], ["itthis eis a "], ["owatmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxjumpsoverthelazydoelgyzxyzkxyzbsxyzacethequickxyzbrownfoxjumpsoverthelazsthissrhownfoxjumpsoverthelazhydoeis"], ["iathequibrhownfoxjumpsuoveortheliazhydoeg"], ["owatmhezyxyxzyzxyzdoegtheqxyxthequickbrownfoxsxthtewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spacesisjumpsoverthelazydoelgyzxyzkxyzbrownfhoxjuiathequibbrhownfoxjumpsoverthelazhydoegxyxzyyzxfyzmpsois"], ["hwiihhwitthhhh"], ["tthequick1a28d3gs4j58m6p9s8v7ry0zbrownfoxjumpsovert1helazydog123"], ["wihtjumpsoazspacesydawhwxo23"], ["aththequickbrownfoxjumpsove23equickbrownfoxjumpsoverthelazydoeg"], ["xythequickxryzbrownfoxjumpsoverthelazsthisxz"], ["athezydspac1a28abcdefghiabcdefbghijklmnopqrsgtuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8v7y0zoegt"], ["wihytjumpsoaspacesydawhwxo23h"], ["nvwxyzabcdefghijkpmnopqrstuvwxyz"], ["hwihthequickxyzbrownfoxjuiathequthequickxyzbrownfoexyatewatmhezydoexgtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spacesbcdewithfghivjklwithmnopqrsinnputtuvpwiputxyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthishthhh"], ["itwitthtthhsabcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxpacesis"], ["ithwitthtthis is a testspaces"], ["theqzuicktxyzbrownfoxjumpsovertheslazthis"], ["vwxyzabcydefgohijklmnopqrstuvathezydoegyz"], ["jumpsoverthelaabcdefghijkavwxyzabcydefghijkvwxyz23"], ["xyxthequickbrownfoxjuiputtumpsovevwxyzabcydefghijklmnoprsthelazydoegyzxyz"], ["tewatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitattihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrsptuvwxhhownfoxjumpsoverths"], ["abcdspacewsewithtestfghijklwithmnopqrsituvwabcdewixvwthequickxyzbrownfoxjumpsoverthitthiselaznydogcxyzabcdefghijklmnopqrstuvwxyzthfghivjqrsinputtuvpwiputxiputx"], ["theqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitattihisabjumpsoaxyxthequickquickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrsptuvwxhhownfoxjumpsoverths"], ["xyxzyzxtiabcdespacesfghijklmnabcdefghiabthequickxyzbroywwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxqrstulshisyz"], ["1a28d3ihtthis6py0z"], ["xvxyabcdewithfghivjklwithiwitthtthismnopqrsinnputttuvpwiputxz"], ["aeetheabcdspacewsewithtestfghijklwithmnopqrsituvwi1a28da3itthis6p9s8v7yawhwxzputxezydspaccesoeitestydognpwithequickxyzbrownfoxjumpsoverthelazthishtjumpsoazspacesydog1z23hutgt"], ["thequickxyzbrownfottestxjuiathequthequickxyzbrownfoexyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxxyxzyzxtiabcdespacesfghijklmnabcdefghiabthequickxyzbroywwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxqrstulshisyzyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthis"], ["tthequickbrovwxyzabcdefghtestthisijklmnopqxrstuyvwqxyiszwnfoxjumppsovert1helazydog123"], ["vwxyzabcdefghtestthisijklmnoqxrstuyvwqxyis"], ["swihthequickxyzbrownfoxojumpsoveiputabcdefghijklmnopqspvwxyzabcdefgttestnopqrstuyvwqxyzacesrstuvwxogtjumpsoazspacesydawhwxo23hxyzaces"], ["hwtiabcdespaceshfghijklmnopqrstulshishhthhh"], ["hhwihhthh"], ["athequickbrownfoxjumpsoverthelapzydjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydogabcdefghijklmnopqrstuvwxyz123oeg"], ["abcdewithfghivjsxthisklwithmnopqrsinputtuvpwiputx"], ["witttthequickbrownifoxjumpsoaverthelazydog123h"], ["hvwxythequickbrownfoxjumpsoverthelazydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzvwabcdewithtestfghijklwithmnopqrsituvwipasbcdefghijklmnopqrstuvwhxutxzabcydefgohijklmnopqrstuvwxyvzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg12v3thelazydoegyzxyzzspthequickxititsabcdefghijklmnopqrstuvwxyzoghisuvwxwqxyiszwihh"], ["1a28ththequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisis a test3itthistestthis36p9s8z"], ["sxyezaces"], ["sxthies is a testyz"], ["xxyxyzxyz"], ["ithwittthtthis is a testspaces"], ["1a28abcdefghiabgcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8v7y0z"], ["ttiabcdefgihijklmnopqrstuvwxywithzlshishis is a testvwxyzabcydefgwhijklmnopprs"], ["spvwxyzaiathequibrhowntuhyvwqxyzaces"], ["ititsabcdefghiqjklmnopqrstuvwxyzoghis"], ["abwithcdewithfghivjklwithiwitthtthismnopqrsinnputtuvpwiputx"], ["vwxyzabcydefghijklbmnop1ais6p9s8zrs"], ["iathequibrhownfoxjumpsuoownfoxjhumpszoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with spaceseg"], ["abcdathequickbrotewatmhezydoegtheqxyxthequickbrowwnfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequifborhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisst input with hspacesuwnfoxjumpsoverthelazydoegefghijkatlazydoeglm"], ["itthxyzxyzis eis a "], ["sxyzacethequickxyziputabcdefghijklmnopqrstuvxthiss"], ["spacesis"], ["txthequickbrownfoxjumpsoverthelazydog12"], ["cesis"], ["wihtjumpsoavtuyvwqxyiysplvwxyzabvcdefghijklmnopqrstuycvwq1a28d3ihthequickxyzbrownfottestxjuiathequthequickxyzbrownfoexyabcdewithfghivjklwithmnopqrsinnputtuvpwiputxxyxzyzxtiabcdespacesfghijklmnabcdefghiabthequickxyzbroywwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxqrstulshisyzyyzxyzxjumpsoverthelazthisibrhownfoxjumpsoverthelazhydoegmpsoverthelazthiscesydawhwxog123h"], ["tiasbcdespacesfghijklmnopqthequickxyzbrownfoexjumpsoverthelazitthisrstuvwxycwithzlshis"], ["theqxyxthequickubrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitattihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjumpsoverthelazsthisacesydog123cdefghijklmnopqrsptuvwxhhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], [" itithis is a test"], ["sabcdefghijklmnopqrstuvwxytesceszog"], ["ttest"], ["abcdefghijkulmnopqrinputstuvwx"], ["abcdspacewsaewithtestfghijklwdithmnopqrsituvwiputx"], ["abcdewithfghivjklwithmpnoitthis tiabcdefghijklmnopqrstuvwxywithzlshisis a testpqrsinnputtuvpwiputx"], ["itwitthtthtis"], ["xyxzyzxtiabcdespacesfghijklmnabcdefghiabthequickxyzbroywwihtjumpsoazspacoesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxqrstulshisyz"], ["tiabcdefgirstuvwxywithzlshis"], ["tiabcdespaceshvwxyzabcydefghijklmnoprwatmhezydoegtheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoissfghijklmnopqrstulshis"], ["thequickbrownifozydog123"], ["abcdefghijkdlmnopqrstuvwsixthisz"], ["vabcdewithfghivjklwithmpnoitthis tiabcdefghijklmnopqrstuvwxywithzlshisis a testpqrsinnputtuvpwiputxwxyzabcydefghijklmnoprs"], ["aabcdefghvwxyzabcdefghijklmnopqrstuyvwqxyziabcdefbghijklmnopqbr"], ["thequickxyzbrowwihtjumpsoazspacesydog123hnfoxjitabcdewithfghivjklwithmnopqrsinnputtuvjpwiputxumpsoverthitthiselaznydog"], ["itths"], ["abcdefghijkdlmnopqirstuvwsixthisz"], ["wiiatheqyuibirhownfogxjumpsoverthexlaxyxzyzxypzzhydoegtth"], ["abcduthxyxzyzxxyzyzzequickbrownfoxjumpsoverthelazydoegiputefghijkathequickbrolwnfoxjumpscoverthelazydoeglmnopqrstuvwxyz"], ["iathequibrhownfogxjumpsoverthaelaxyxzyzxyzzhydoeg"], ["vwxyzabcydefgghijklmnopqrstuvwxyz"], ["tiasbcdespacesfghijklmnopqthequickxyzbhzlshis"], ["tiabcdespacesfdghijklmnopqrsttestydogulshis"], ["iwitthtthiwihtjumpsoazspacesaydawhabcdefghiabcdefbghijklmnopqrstuvwxygzjklmhxwxog12"], ["aeettiabcdespaicesfghijklmnopqrstuvwxyxvwxyzabcdefghijklmnopqrstuvwxyzwithhzlshisheezydspaccesoeitestydognpwithequickxyzbrownfoxjumpsoverthelazthishtjumpsoazspacesydog1z23hutgt"], ["wlw"], ["theqzuicktxyzbrownwihthequickxyzbrownfoxojumpsoveiputabcdefghijklmnopqspvwxyzabcdefgttestnopqrstuyvwqxyzacesrstuvwxogtjumpsoazspacesydawhwxo23hfoxjumpsovertheslazthis"], ["hwtiabcdespaceshfghijklmnopqrstuatheabcdefghijklmnopqrstuvwxzzyddoegtlshishhthhh"], ["theqyxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuitathhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsois"], ["1a28ththequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisis a test3itthis9testthis36p9s8z"], ["hwihhhthh"], ["abcdiefghijklmnopqrstuvwxabcdewithfghivjsxthisklwithmhnopqrsinputtuvpwiputxywithz"], ["iabcdspacewsewithtestfghijklwithmnopqrsituvwiputx"], ["abcdewithfghivjklwithmpnoitthis tiabcdefghijklmnopqrstuvxyxthequickbrownfoxjumpsovevwxyzabcydefghijklmnoprsthelazydoegyzxyzsis a testpqrsinnputtuvpwiputx"], ["xyxzyyzxthspvwxyzabcdefghijklmnopqrstuyvwqxyzaceseqxyxthequickbrownfoxjumhhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisyz"], ["tthequickbrownfoxjumpsovert1helazydo3"], ["thequickbrownfoxjumpabcdefghijkathequiiathelazhydoeglwnfoxjumpscoverthelazydoeglmnopqrstuvwxyzsovertheilazydog123"], ["tihisabjumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspacesydog1z23hutlmnopqrstuvwx"], ["tcdefghijklmnopqrrstuyvwqxyzacesestyzaces"], ["1a28abcdefghiabgcdefb1a28ththequickxyzbrownfoxjuiathequibrhownfoxjumpsoverthelazhydoegmpsoverthelazthisisghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsoverthdoghwxd3g4j5m6p9s8tihisisv7y0z"], ["xyxzyzxtiabcdespacesfghijklmnabcdefghiabthequickxyzbroywwihtjumpsoazspacoesydog123hnfoxjumpsoverthitthiselaznydogacdefbghijklmnopqrstuvwxygzjklmhxqrstulshisyz"], ["iwitthtthiwihtjumpsoaabcdefghiabthequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxzspacesaydawhwxog12"], ["tabcdefghijkathequickbrolwnfoxjumpsoverthelazydoeglmnopqrstuvwxyziabcdefgirstuvwxywithzlshis"], ["ttheqxyxthequickbrownfoxjumpsoverthelazydoegyzxyzkxyzbrownfoxjuityathhownfoxjumpsoverthelazhydoegxyxzyyzxyzmpsoisydospvwxyzaiathequibrhownfogxjumpsoverthelaxyxzyzxyzzhydoegbcdefghijklmnopqrstuyvwqxyzacesg123"], ["witttthequickbrownifoxjumpsodavterthelazydog123h"], ["abcdefghiabcdefbghijklmnopqrstuvwxyzjklmawthequickxyzbwihthrownfoxjumpsovertsabcdefghijklmnopqrstuvwxyzogoghwx"], ["itthis etthequickbrownfoxjumpsoverthelazydog12is a "], ["iputabcdefghijklmnopqrs1a28d3g4j5m6p9s8vxthequickxyzbrownfoxjumpsoverthitthiselaznydogyz7y0ztuvwx"], ["iitititsabcdefghijklmnopyqabcdewithfghivjklwithmnopqrsinnputtuvpwiputxrstuvwxyzoghiswitthiswitthtthiwihtjumpsoaabcdefghiabthequickxyzbrowwihtjumpsoazspacesydog123hnfoxjumpsoverthitthiselaznydogcdefbghijklmnopqrstuvwxygzjklmhxzspacesaydawhwxog12"], ["itestyddognpwihtjumpsoazspacesydog1z23hut"], ["athezydaeetheezydspaccesoeitestydognpwitiabcdespacesfdghijklmnopqrstulshisthequickxyzbrownfoxjumpsoverthelazthishtjumpsoaszspacesydog1z23hutgtoeg"], ["testyxyxthequickvbrownfoxjumpsoverthelazgydoegyzxyzzacejumpsoaxyxthesquickbrownfoxjumpsoveequickxyzbrownfoxjumpsoverthelazsthisacesydog123s"], ["jumpsoaxyxthequickbrownfoxjumpsoverthelazydoegyzxyzzspthequickxyzbrownfoxjuampsoverthelazsthisacesydog123"], ["abcdefghiijklmnopqrinputstuvwx"], ["sxyzacethequickxyzbrownfoxjumpsoverthelazsiputabcdefghijklmnopqspvwxyzabcdefghijklmnopqrstuyvwqxyzitithis is a testacesrstuvwxthiss"], ["abcdewithtestfghijklwithmnopqrsituvrwiputx"], ["tt"], ["thequickbrownfoxjumpsovverthelazydog"], ["1a2d3g4j"], ["aa"], ["ttt"], ["1a2d3g41a2d3g4jj"], ["testwith"], ["iis"], ["iis1a2d3g41a2d3g4jj"], ["stestwith"], ["2iis1a2d3g41a2d3g4jj"], ["tttt"], ["thazydog"], ["etehstwith"], ["sis"], ["thedquickbrownfoxjumpsoverthelazydog123"], ["thequickbrownfoxjumpsovverthelazydogiis"], ["1a2d3g41a2d3gj4jj"], ["testwith2iis1a2d3g41a2d3g4jj"], ["testwhith2iis1a2d3g41a2d3g4jj"], ["iis1iis1a2d3g41a2d3g4jja2d3g41a2d3g4iis"], ["siis"], ["testthequickbrownfoxjumpsoverthelazydog123with2iis1a2d3g41a2d3g4jj"], ["testth"], ["testt input with spaces"], ["thequickbrownfoxjumpsoverwith"], ["testwjhith2iis1a2d3g41a2d3g4jj"], ["iss"], ["txyzhequickbrownfoxjumpsoverwith"], ["iis1iis1a2d3g41a2d3g4jja2d3g41a2dj3g4iis"], ["speaces"], ["aiispeacs"], ["iis1iis1a2d3g41a2d3g4jja2d3g4tt1a2d3g4iis"], ["abcdefghijklmpqrstuvwxyz"], ["aaa"], ["testaath"], ["withthequickbrownfoxjumpsoverthelazydog123"], ["1a2d3g43j"], ["1a2d3g41a2d3ga4jj"], ["1a2d3gthequickbrownfoxjumpsovverthelazydogiis4j5m6p9s8yv7y0z"], ["ttestwithhazydog"], ["abcdefghijklmnopzqrstuvwxyz"], ["s2iis1da2d3g41a2id3g4jjis"], ["s2iis1da2d3g41a2i"], ["thequickbrownfoxojumpsovverthelazydog"], ["testwiththequickbrownfoxjuthis is a testmpsoverwith"], ["ttteswtwithhazydog"], ["vwxyzabcdefghijklmnopisqrstuvwxyz"], ["withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123"], ["agbcdefghijklmpqrstuvwxyz"], ["tth"], ["tttestwitaiispeacshhazydogttt"], ["thequickbrownfabcdefghijklmnop2iis1a2d3g41a2d3g4jjqrstuvwxyzoxojumpsovverthelazydog"], ["ttttt"], ["thequickbrownfoxjuelazydog"], ["aaaa"], ["thazydspacesog"], ["s2iis1dga2d3g41a2i"], ["testvwxyzabcdefghijklmnopisqrstuvwxyzwhith2iis1a2d3g41a2d3g4jj"], ["thtitths"], ["aitestwiththequickbrownfoxjuthisispeacs"], ["testwithhthequickbrownfoxjuthais"], ["iis1a2d3gttteswtwithhazydog41a2daiispeacsjj"], ["vwxyzabcdefghijkl mntest input with spacesopisqrstuvwxyz"], ["spacesopisqrstuvwxyz"], ["testmpsoverwith"], ["thattteswtwithhazydogzydog"], ["vwxyzabcdefghijvklmnopqrstuvwxyz"], ["thazydspacesoog"], ["iis1a2sd3gttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is a testmpsoverwithaiispeacsjj"], ["tttteswtwithhazydog"], ["iis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is ia testmpsoverwithaiispeacsjj"], ["withthequickbrownfoxjumpsoverthewlazydog123"], ["xy"], ["testmpsoverttth"], ["withthequickbrownfoxjumpsovertehelthequickbrownfoxojumpsovverthelazydogdog123"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxyzfghijklmnopisqrstuvwxyz"], ["vwxyzabcdefghijklmnopisqrstitthsuvwxyz"], ["1a2d3g41a2d3gtestmpsoverwithj4jj"], ["theq1a2d3g4juickbrownfoxjumpsoverthelazydog"], ["yxy"], ["testwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3g41a2d3gf4jj"], ["1a2d3gthewiththequickbrownfoxjumpsoverthewlazydog123quickbrownfoxjumpsovverthelazydogiis4j5m6p9s8yv7y0z"], ["withthequickbrownfoxjumpsovertehtestwithelthequickbrownfoxojumpsovverthelazydogdog123"], ["etehtstwith"], ["iisjj"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownfoxjumpsoverthelazydog123"], ["aitestwiththewquickbrownfoxjuthisispeacs"], ["abcdefghijklmsnopzqrstuvwxyz"], ["etehyxysswith"], ["sii"], ["iis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is ia testmpsoverwiispeacsjj"], ["abcdefghijklmsnopzqrstuvwxyz1a2d3g4j"], ["vwxhyzabcdefghijklmnopisqrstitthsuvwxyz"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownfoxjumpsoverthelazydokg123"], ["testthequickbrownfoxjumpsoverthelazydoog123with2iis1a2d3g41a2d3g4jj"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownfoxjumpsoverthelazydokg123iiss"], ["si"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwithj4jj"], ["tttiis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["ttttts2iis1dga2d3g411a2i"], ["1a2d3g"], ["thedquickbrownfoxjumpsoverthvwxyzabcdefghijkl"], ["iis1a2sttttd3gttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is a testmpsoverwithaiispeacsjj"], ["ttttvwxyzabcdefghijkl mntest input with spacesopisqrstuvwxyzt"], ["ttteswtwiaitestwitvwxhyzabcdefghijklmnopisqrstitthsuvwxyzhthewquickbrownfoxjuthisispeacsydog"], ["s2diis1dga2d3g41a2i"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwtheq1a2d3g4juickbrownfoxjumpsoverthelazydogithj4jj"], ["1a2dd3g41a2d3g4jj"], ["testvwxitthsyzabcdefghijklmnopisqrstuvwxyzwhith2iis1a2d3g41a2d3g4jj"], ["thequtestwjhith2iis1a2d3g41a2d3g4jjickbrownfoxjuelazydsog"], ["etethattteswtwithhazydogzydoghyxysswith"], ["wirththequickbrownfoxjumpsoverthelazydog123"], ["iiss"], ["s2diis1dg3a2d3g41a2i"], ["tttts2diis1dg3a2d3g41at2i"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrgownfroxjumpsoverthelazydog123"], ["testthequickbrownfoxjumpsoverthelazydoog123with2iis1a2d3g41da2d3g4jjaa"], ["aitestwiththewquickbrownfoxjutttacss"], ["t1a2d3gthequickbrownfoxjumpsovverthelazydogiis4j5m6p9s8yv7y0z"], ["abcdefghijklmnoptestmpsoverwithaiispeacsjjqrstuvwxyz"], ["abcdefgpzqrstuvwxyz"], ["ttteswtwithzhazydog"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownsiisfoxjumpsoverthelazydog123"], ["spacesopisqrstuvwxetehtstwithyzt"], ["iisvwxhyzabcdefghijklmnopisqrstitthsuvwxyzs"], ["stestwittestwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3g41a2d3gf4jjh"], ["iistestwiththequickbrownfoxjuthis is a testmpsoverwith"], ["siisiistestwiththequickbrownfoxjuthis"], ["testwjhs1a2d3g41a2d3g4jjtestth"], ["testwithhthequickbrvwxyzabcdefghijvklmnopqrstuvwxyzownfoxjuthais"], ["htth"], ["i"], ["1ad3g43j"], ["2iis1a2d3ga41a2d3g4jj"], ["vwxyzabcdefghijksl mntest input with spacesopisqrstuvwxyz"], ["iis1iis1a2d3g4etehtstwith1a2d3g4jja2d3g4tt1a2dt3g4iis"], ["etethattteswtitthswithhazydogzydoghyxysswith"], ["1ad3g43ttttvwxyzabcdefghijkl mntest input with spacesopisqrstuvwxyztj"], ["vwxyzabcdevwxyzabcndefghijklmnopqrstuvwxyzfghijklmnopisqrstuvwxyz"], ["iisvwxhyzabcdefghijklmnopisqrstitthsuvwxwiththequickbrownfoxjumpsoverthelazydog123yzs"], ["iis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["iis1a2sd3gwttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is a testmpsoverwithaiispeacsjj"], ["thazydmntestspacesoog"], ["ssii"], ["1a22d3g4j"], ["tiistestwiththequickbrownfoxjuthistest"], ["iis1a2d3gttteswtwithhazydoge41a2daiispeacsjj"], ["1a2d3g41a2d3g4j3j"], ["tttiis1a2tteswtawithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["abcdefghijkwxyz"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwtheq1a2d3g4jvwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuwvwxyzthedquickbrgownfroxjumpsoverthelazydog123uickbrownfoxjumpsoverthelazydogithj4jj"], ["iistestwiththequickbrownfoxjuthis"], ["thequickbrownfoxjumpsovverthelag"], ["iis1iis1a2d3g41a2d3g4jja2d3g41a2d3gg4iis"], ["teest"], ["testwjhith2iis1a2d3g41thequickbrownfoxjumpsovverthelazydogiisjj"], ["iisvwxhyzabcdefghijklmnopisqrstitthsuvwxwiththequickbrownfoxjumpsoverthelazydmog123yzs"], ["thequickbrownfoxjumpsovverthelazydogiiis"], ["ittvwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownfoxjumpsovertheldazydog123hs"], ["ttteswtwithvwxyzabcdefghijkl mntest input with spacesopisqrstuvwxyzzhazydog"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedqitthsuickbrgownfroxjumpsoveazydog123"], ["etethattteswtwithhazydogzydoghythequickbrownfoxojumpsovverthelazydogysswith"], ["iisvwxhyzabcdefthisghijklmnopisqrstitthsuvwxyzs"], ["etehtstwtith"], ["1a2d3"], ["abcdefghijkwxyzz"], ["thazydmnt1a2d3estspacesoog"], ["thequickbrownfoxjuelazydgog"], ["aiistestwjhs1a2d3g41a2d3g4jjtestthpeacs"], ["ii"], ["testwiththequickbrownfoxjuthis"], ["txyzhequickbrownfoxjumpspoverwith"], ["1a2d3etethattteswtwithhazydogzydoghyxysswith"], ["testwhith2iis1a2d3g41a2d3g4j1j"], ["1a2dttttvwxyzabcdefghijkl mntest input with spacesopisqrstuvwxyzt3"], ["iitestt input with spacessjwj"], ["1a2dd3"], ["iis1a2d3g41a2dg3g4jj"], ["iiisjj"], ["aisispeacs"], ["eteshtstwtith"], ["testthequiiistestwiththequickbrownfoxjuthis is a testmpsoverwithckbrownfoa2d3g4jj"], ["ttttts2iis1dga2d3g411a2ixy"], ["ttttts2iis1idga2d3g411a2i"], ["ttestthequickbrownfoxjumpsoverthelazydoog123with2iis1a2d3g41da2d3g4jjaatt"], ["testwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog1g41a2d3gf4jj"], ["testwithhthequickbrvwxyzabcdefghijvklmnopqrstuvwxoxjuthais"], ["withthequickbrownfoxjumpsoverthewlazydog1iisvwxhyzabcdeftesttthisghijklmnopisqrstitthsuvwxyzs23"], ["vwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxownfoxjumpsoverthelazydokg123iiss"], ["abcdefghijklmnopestmpsoverwithaiispeacsjjqrstuvwxyz"], ["1a2d3g41thequickbrowniis1a2sd3gttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is a testmpsoverwithaiispeacsjjfoxojumpsovverthelazydoga2d3gtestmpsoverwithj4jj"], ["etethattteswtitthswithhazydogzydwith"], ["thequickbrownvwxyzabcdefghijvklmnopqrstuvwxyzfoxjumxpsiistestwiththequickbrownfoxjuthisovverthelag"], ["iis1a2sd3gwttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["vwxyzabcdefghietehyxysswithntest input with spacesopisqrstuvwxyz"], ["testwjhs1a2td3g41a2d3g4jjth"], ["testwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3getethattteswtitthswithhazydogzydoghyxysswith41a2d3gf4jj"], ["thedquickbrownfoxjumpsovexrthvwxyzabcdefghijkl"], ["tttiis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjis"], ["iisvwxhyzabcdefghijklmnopisqrstitthsuvwxyzzs"], ["thequickbrownvwxyzabcdefghijvklmnopqrstuvwxyzfoxjumxpsiistestwiththequickbrownfoxjuthisovverthelarg"], ["etethatttes1a2d3gthewiththequickbrownfoxjumpsoverthewlazydog123quickbrownfoxjumpsovverthelazydogiis4j5m6p9s8yv7y0zoghyxysswith"], ["tttttest"], ["spacesopisqrstuvwxetehtstwithyzt1a2d3g4j"], ["aitestwiththewquickiabrownfoxjuthisispeacs"], ["speacses"], ["abcdefegpzqrstuvwxyz"], ["1a2dttttvwxyzabcdefghijkl"], ["yxyy"], ["iiis"], ["thazytdmntestspacesoog"], ["wirthvwxyzabcdefghijksl mntest input with spacesopisqrstuvwxyzthequickbrownfoxjumpsoverthelaezydog123"], ["tvwxyzabcdefghabcdefghijklmpqrstuvwxyzijkl"], ["tttttt"], ["testwjhs1a2d3gt41a2d3g4jjtestth"], ["spacesopisqrstuvwxyzthequickbrownfoxjumpsoverthelaezydog123"], ["abcdefghijktletethattteswtwithhazydogzydoghyxysswithmsnopzqrstuvwxyz"], ["yetethattteswtitthswithhazydogzydoghyxysswithxxyy"], ["spacesopisqrstuvwxyzthequickbrownfoxejumpsoverthelaezydog123"], ["testwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3getethattteswtitth1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwithj4jjogzydoghyxysswith41a2d3gf4jj"], ["tethazydmntestspacesoogst"], ["aitewirthvwxyzabcdefghijksl mntest input with spacesopisqrstuvwxyzthequickbrownfoxjumpsoverthelaezydog123stwiththequickbrownfoxjuthnisispeacs"], ["1a2d3g41a2dvwxyzabcdevwxyzabcdefghijklmnopqrstuvrwxyzfghijklmnopisqrstuvwxyzg4j3j"], ["tttts2diis1dg3a2d3g41ayxyyt2i"], ["vwyxyzabcdefghijklmnopisqrstitthsuvwxyz"], ["1a2d3g433j"], ["thtitthstestwhith2iis1a2d3g41a2d34g4j1j"], ["withthequickbrownfoxjumpswiththequickbrownfoxjumpsoverthewlazydog123overthelazydog123"], ["speacstestes"], ["aiiiaspeacs"], ["tettttttstwjhs1a2tdth"], ["ttteswtzhazydog"], ["thtitthstestwhhith2iis1a2d3g41a2d34g4j1j"], ["theequickbrownfoxjumpsovvertthelag"], ["iisvwxttteswtwithzhazydoghyzabcdefghijklmnopisqrstitthsuvwxyzs"], ["thequickbrownfoxjumpvverthelaazydog"], ["abcdefghijklmnoptestmpsoverwithaiispemacsjjqrstuvwxyz"], ["etethattteswtitthswithhazydogzydogetehstwithhyxysswith"], ["iisvwxttteswtwithzhazydoghyzabcdefghijklmnopisqrstwitthsuvwxyzs"], ["thequickbrownvwxyzabcdefghijvklmnopqrstuvwxyzfoxjumxpsiistettttvwxyzabcdefghijklthisovverthelag"], ["aisithedquickbrownfoxjumpsovexrthvwxyzabcdefghijklspeacs"], ["etehyxyss1ad3g43ttttvwxyzabcdefghijklh"], ["iisvwxhyzabcdefth1a2dd3isghijklmnopisqrstitthsuvwxyzs"], ["iis1a2sd3gttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis is a testmpsoverwithaiispeacsjj3g43j"], ["tttteswtwithdog"], ["iis1iis1a2d3g41a2d3g4jja2d3vwxyzabcdefghijklmnopisqrstitthsuvwxyzg41a2d3g4iis"], ["1a2dttttestwhith2iis1a2d3g41a2d3g4j1jtvwxyzabcdefghijkl mntest itestmpsoverwiispeacsjjnput with spacesopisqrstuvwxyzt3"], ["aisithedquickbrownfoxjumpsovexrththequickbrownfoxjumpvverthelaazydogvwxyzabcdefghijklspeacs"], ["vwxyzabcdefghijksl mmntest input with spacesopisqrstuvwxyz"], ["hkijklh"], ["thequickbrownfosxjumpsovverthelazydogiiis"], ["theq1a2d3g4juickbrownfoxvjumpsoverthelazydog"], ["vwxyzaabcdefgttteswtwithvwxyzabcdefghijklhijkwxyzzitthsuickbrgownfroxjumpsoveazydog123"], ["s2iis1da2d23g41a2i"], ["tttestmpsovertttht"], ["etethattteswtwithhazydogzydoghyxyssgwith"], ["iistestwiththequickbrownfoxjuthis is a testmpsosverwith"], ["abcdefghiejkwxyzz"], ["tthequickbrownfoxjumpsovverthelazydogiis"], ["testwhith2testiis1a2d3g41a2d3g4jj"], ["abcdefghijklmnoptestmpsoverwithaiispeaecsjjqrstuvwxyz"], ["iis1a2tteswtwithhaacsjj"], ["tttiis1a2tteswtwithhazydog41a2dtestwiththequickbrownfoxjistest"], ["thequickbrownfoxjumpsovertheladog"], ["vvwxhyzabcdefghijklmnopisqrstitthsuvwxyz"], ["aaaaa"], ["htttestmpsoverttthth"], ["abcdefghijklmsnttttvwxyzabcdefghijklopzqrstuvwxyz1a2d3g4j"], ["tttestt"], ["testwhith2testiis1a2d3g41stestwitha2d3g4jj"], ["this its a test"], ["ttttvwxyzabcdefghijkl"], ["spacesopisabcdefghijklmnoptestmpsoverwithaiispeacsjjqrstuvwxyzqrstuvwxyz"], ["spacesopisabcdefghijklmnoptestmpsoverwqithaiispeacsjjqrstuvwxyzqrstuvwxyz"], ["theq1a2d3g4jcuickbrownfoxjumpsoverthelazydog"], ["1a2d3gthewiththequickbrownfoxjumpsoverthewlazydog123quickbrownfoxjumpsovverthelazydo1a22d3g4jgiis4j5m6p9s8yv7y0z"], ["thequickbrownfabcdefghijklmnop2iis1a2d3g41a2od3g4jjqrstuvwxyzoxojumpsovverthelazydog"], ["aisispitthseacs"], ["aisithedquickbrownfoxjumpsovexrthvvwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrownsiisfoxjumpsoverthelazydog123wxyzabcdefghijklspeacs"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwtheq1a2d3g4jvwxyzabcdevwxyzabcdefghijklmnopqrstuvwumpsoverthelazydogithj4jj"], ["withthequickbrownfoxjumpsovertehtestwithelthequickbrownfoxojumpsovve1a2d3g41a2d3ga4jjrthelazydogdog123"], ["1iis1a2sttttd3gttteswttwithhazydogaitestwiththewquickiabrownfoxjuthisispeacssd3g43j"], ["tttttettttst"], ["thestwhhith2iis1a2d3g41a2d34g4j1j"], ["1ad3g433j"], ["1a3j"], ["spacesaopisqrstuvwxyzthequickbrownfoxejumpsoverthelaezydogsii123"], ["abcdefghijktletethattteswtwithhazydogzydoghyxyssithmsnopzqrstuvwxyz"], ["withthequickbrwnfoxjumpsovertehelthequickbrownfoxojumpsovverthelazydogdog123"], ["iisvwxhypzabcdefth1a2dd3isghijklmnopisqrstitthsuvwxyzs"], ["itestmpsoverwiispeacsjjnput"], ["1a2d3ttestthequickbrownfoxjumpsoverthelazydoog123with2iis1a2d3g41da2d3g4jjaattg41a2d3g4j3j"], ["ttteswtwithzha"], ["itttiis1a2tteswtawithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["etethatttes1a2d3gthewiththequickbrownfoxjaumpsoverthewlazydog123quickbrownfoxjumpsovverthelazyd1ogiis4j5m6p9s8yv7y0zoghyxysswith"], ["etethattteswtitthswithhazydogzydoghyxysswithazytdmntestspacesoogth"], ["spacesaopisqrstuvwxyzthequickbrownfoxejumteestpsoverthelaezydogsii123"], ["iisvwxhyzabcdefghijklmnopisqrstitthsuvwxyziis"], ["aisithedquickbrownfoxjumpsovexrththequickbrownfoxjumpvverthabcdefghithequickbrownfabcdefghijklmnop2iis1a2d3g41a2d3g4jjqrstuvwxyzoxojumpsovverthelazydogjklspeacs"], ["iis1a2d3g41a2dg4jj"], ["1a2d3etethattteswtwithhazydabcdefghijkwxyz"], ["vwxyzabtestwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3getethattteswtitthswithhazydogzydoghyxysswith41a2d3gf4jjxownfoxjumpsoverthelazydokg123iiss"], ["abcdmefghijklmpqrstuvwxyz"], ["1a2d34g4j"], ["1a2d3etethattteswtwithhazdogzydoghyxysswith"], ["agbcdefgvwxyzabcdefghijksl mntest input with spacesopisqrstuvwxyzhijklmpqrstuvwxyz"], ["yetethattteswtitthswithhazydogizydoghyxysswithxxyy"], ["spacesopisqrstuvwxyzzhazydog"], ["iis1a2sd3gttteswtwithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["xxy"], ["s2diis1dga2d3g4testwhith2iis1a2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog123dr3g41a2d3gf4jj11ad3g43ja2i"], ["testwithtttttettttst"], ["y"], ["spa1cesaopisqrstuvwxyzthequickbrownfoxejumteestpsoverthelaezydogsii123"], ["iis1a2sttttd3gttteswtwithhazydog41a2dtestwiththequickbrownfuoxjuthis is a testmpsover"], ["withthequickbrownfoxjumpswiththequickbrownfoxjumpsoverthetttteswtwithdogwlazydog123overthelazydog123"], ["iijklmnos"], ["1a2d3g41a2dvwxyzabcdevwxyzaqbcdefghijklmnopqrstuvrwxyzfghijklmnopisqrstuvwxyzg4j3j"], ["thvwxyzabcdevwxyzabcdefghijklmnopqrstuvwxytuvwxyzthedquickbrgownfroxjumpsoverthelazydog123equickbrownfoxjumpsovverthelazydog"], ["steistwith"], ["s2iis1da2d3g41a2ixy"], ["abcdefghijklmsnopzqrstuvwxmyzttt"], ["thequickbriisvwxhyzabcdefghijklmnopisqrstitthsuvwxyzzsverthelag"], ["withthequickbrownfoxjumpswiththequickbrvwxyzabcdefghijkl ymntest input with spacesopisqrstuvwxyzownfoxjumpsoverthetttteswtwithdogwlazydog123overthelazydog123"], ["iisvwxhyzabcdefthisughijklmnopisqrstitthsuvwxyzs"], ["thestwhhi1a2d3g4jth2iia2d3g41a2d34g4j1j"], ["tetestt input with spacest"], ["1a"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwtheq1a2d3g4juickbrtttownfoxjumpsoverthelazydogithj4jj"], ["ttsi1a2d3ttestthequickbrownfoxjumpsoverthelazydoog123with2iis1a1a2d3etethattteswtwithhazydogzydoghyxysswith3jistteswtwithhazydog"], ["spacesopisqrstuvwxetehtzstwithyzt1a2d3g4j"], ["withthequickbrownfoxjumpswiththequickbrvwxyzabcdefghijkl"], ["yxytttttsswith"], ["withthequickbrownfoxjumpsoverthelazydoqg123"], ["testwhith2iis1etehtstwitha2withthequickbrownfoxjumpsoverthelthequickbrownfoxojumpsovverthelazydogdog1g41a2d3gf4jj"], ["xxx"], ["ttttvwxyzaiissbcdefghijkl"], ["spaes"], ["iisitestmpsoverwiispeacsjjnput1iis1a2d3g41a2d3g4jja2d3g41a2d3gg4iis"], ["iisvwsxhyzabcdefthisughijthequickmpsovverthelagklmnopisqrstitthsuvwxyzs"], ["iissvwxhyzabcdefth1a2dd3isghijklmnopisqrstitthsuvwxyzs"], ["abcdefghijklmpqrstus2iis1dga2d3g41a2i"], ["etethattteswtwithhazydogzydoghythequicownfoxojumpsovverthelazydogysswith"], ["itttiis1a2tteswtawithhazydog41a2dtestwiththequickbrowfoxjuthis"], ["aiiiaspiisvwxhyzabcdefth1a2dd3isghijklmnopisqrstitthsuvwxyzseacs"], ["withthequickbrownfoxjumtettttttstwjhs1a2tdthequickbrownfoxjumpsoverthettttteswtwithdogwlazydog123overthelazydog123"], ["theq1a2d3g4jcuickbrownfoxjumepsoverthelazydo1a2d3g433jg"], ["iistttteswtwithdogs"], ["vwxyzabcdefghijksl mntest input with sxyz"], ["aetethattteswtwithwithhazydogzydoghythequicownfoxojumpsovverthelazydogysswithbcdefghijklmpqrstuvwxyz"], ["aisithedquickbrownfoxjuvwxyzabcdefghijklmnopisqrstitthsuvwxyzmpsovexrthvwxyzabcdefghijklspeacs"], ["spacesopisqrstuvwxyzth1equickbrownfoxjumpsoverthelaezydog123stwiththequickbrownfoxjuthnisispeacs"], ["spacesopisqabcdefghijklmnoptestmpsoverwithaiispeyzqrstuvwxyz"], ["etethattteswtwithhazydogzydoghyxyssgwitth"], ["theequickbrowrnfoxjumpsovvertthelag"], ["spacesopisqrstuvwxyzth1equickbrownfoxjumpsoverthelaezydog123stwiththequickbrownfoxjuthhnisispeacs"], ["abcdefghijvwxyzabcdefghietehyxysswithntest input with spacesopisqrstuvwxyzklmpqrstuvwxyz"], ["1a2d3g41thequickbrownfoxojumpsovverthelazydoga2d3gtestmpsoverwtheq1a2d3g4jvwxyzabcdevwxyzabcdefghijklmnopqrstuvtttttestwumpsoverthelazydogithj4jj"], ["htttestmpsoverttthtttttts2iis1idga2d3g411a2ih"], ["ttttts2itis1dga2d3g411a2ixy"], ["spacesopisqrstuvwxyzt"], ["ittttiis1a2tteswtawithhazydog41a2dtestwiththequickbrownfoxjuthis"], ["thestwhhi1a2d3g4jth2iia2d3g41a2d34g14j1j"], ["s2iis1da2d3g41a22id3g4jjis"], ["vwxyzabcdevwxyzabcdefghijklmnopqrsetuvwxytuvwxyzthedqitthsuickbrgownfroxjumpsoveazydog123"], ["1a2d3g41thequickbrowniis1a2sd3gttteswtwithhazydog4stmpsoverwithaiispeacsjjfoxojumpsovverthelazydoga2d3gtestmpsoverwithj4jj"], ["tvwxpyzabcdefghabcdefghijklmpqrstuvwxyzijkl"], ["iis1a2sd3gwttteswtazydog41a2dtestwiththequickbrownfoxjuthis"], ["etethattteswtwithhazydogzydoghyxysswiththequickbrownvwxyzabcdefghijvklmnopqrstuvwxyzfoxjuelazydog"], ["tvwxyzabcdefghabcdefghijklmpqrstuvwxyzijklspeacsses"], ["iis1iiyetethattteswtitthswithhazydogzydoghyxysswithxxyys1a2d3g4etehtstwith1a2d3jg4jja2d3g4tt1a2dt3g4iis"], ["sithequickbrownfabcdefghijklmnop2iis1a2d3g41a2d3g4jjqrstuvwxyzoxojumpsovverthelazydogs"], ["vwxyzabcdefghijkl mntest input with spacetttsopisqrstuvwxyz"], ["theq1a2d3g4jcuickbrownfoxjumepsov1a2d3g43jerthelazydo1a2d3g433jg"], ["iistestwiththequickbroewnfoxjuthis is a testmpsosverwith"], ["etethattteswtwithhazyddoghyxyssgwitth"], ["vwxyzabcdevwxyzabcdeftheq1a2d3g4jcuickbrownfoxjumepsov1a2d3g43jerthelazydo1a2d3g433jgqrstuvwxytuvwxownfoxjumpsoverthelaiiss"], ["etethattteswtwithhazydogzydxxyoghyxyssgwitth"], ["iits1a2tteswtwithhaacsjj"], ["testmpsosverwith"], ["iis1iis1a2d3g41a2d3g4jja2disqrstitthsuvwxyzg41a2d3g4iis"], ["ia"], ["vwxyzabcdefghijkl s2iis1da2d3g41a2ixymntest input with spacesopisqrstuvwxyz"], ["1a2d3gthequickbabcdefghijklmnopqrstuvwxyzrownfoxjumpsovverthelazydogiis4j5m6p9s8yv7y0z"], ["1a2d3gthequickbabcdefghijklmnopqrstuvwxyzrownfoxjumpsovverthelazydogiis4j5m6paisithedquickbrownfoxjuvwxyzabcdefghijklmnopisqrstitthsuvwxyzmpsovexrthvwxyzabcdefghijklspeacsaisithedquickbrownfoxjumpsovexrthvwxyzabcdefghijklspeacs9s8yv7y0z"], ["1a2d3g41a2dvwxyzabcdevwxyzabcdefghijklmnopqrstuvrwxyzfghijklmn4j3j"], ["1a3jj"], ["tethazydmntesiisjjtspacesoogst"], ["etethattteswtitthsswithhazydogzydoghyxysswithazytdmntestspacesoogth"], ["iistestwiththequickbrownfoxspeacstestesjuthis is a testmpsosverwith"], ["vwxyzabcdefghijklmnopisqqrstitthsuvwxyz"], ["qthequiis1iis1a2d3g41a2d3g4jja2disqrstitthsuvwxyzg41a2d3g4iisag"]], "completion": "\ndef decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"\n return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n", "raw_completion": "```python\ndef decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"\n return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef encode_shift(s: str):\n \"\"\"\n returns encoded string by shifting every character by 5 in the alphabet.\n \"\"\"\n return \"\".join([chr(((ord(ch) + 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n\n\ndef decode_shift(s: str):\n \"\"\"\n takes as input string encoded with encode_shift function. Returns decoded string.\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/51", "prompt": "\n\ndef remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n >>> remove_vowels('')\n ''\n >>> remove_vowels(\"abcdef\\nghijklm\")\n 'bcdf\\nghjklm'\n >>> remove_vowels('abcdef')\n 'bcdf'\n >>> remove_vowels('aaaaa')\n ''\n >>> remove_vowels('aaBAA')\n 'B'\n >>> remove_vowels('zbcd')\n 'zbcd'\n \"\"\"\n", "entry_point": "remove_vowels", "canonical_solution": "\n return \"\".join(list(filter(lambda ch: ch not in \"aeiouAEIOU\", text)))\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate('') == ''\n assert candidate(\"abcdef\\nghijklm\") == 'bcdf\\nghjklm'\n assert candidate('fedcba') == 'fdcb'\n assert candidate('eeeee') == ''\n assert candidate('acBAA') == 'cB'\n assert candidate('EcBOO') == 'cB'\n assert candidate('ybcd') == 'ybcd'\n\n", "contract": "\n assert type(text) == str, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["abcdef\nghijklm"], ["fedcba"], ["eeeee"], ["acBAA"], ["EcBOO"], ["ybcd"]], "atol": 0, "plus_input": [["hello"], ["This is a Test!"], ["i am using python"], ["The quick brown fox jumps over the lazy dog."], ["This sentence has vowels: aeiou"], ["strawberries and cream"], ["Programming is fun"], ["1234567890"], ["Python is awesome!"], ["How are you today?"], ["This is ai am using python Test!"], ["1234561207890"], ["1234561207890This is ai am using python Test!"], ["Thise sentence haaei:ou"], ["The quick over the This sentence has vowels: aeioulazy dog."], ["1234567890This sentence has vowels: aeiou"], ["st1234567890m"], ["123456789The quick over the This sentence has vowels: aeioulazy dog.0"], ["Pyt hon is awesome!"], ["1234567890This sesntence has vowels: aeiou"], ["hel"], ["hellhelloo"], ["hel12344567890This sesntence has vowels: aeiou"], ["strawberries and creaPyt hon is awesome!m"], ["This is ahellhellooi am using python Test!"], ["This is a T1234561207890This is ai am using python Test!est!"], ["This sentence has vowels: a"], ["How are youy today?"], ["12345687890"], ["123456789The quick over the This sentence has vowels: aeioulazy dogThis is ai am using python Test!.0"], ["hel1234567890l"], ["12345629890"], ["This sentt!: a"], ["123465687890"], ["123456789The quicThis sentence has vowels: areiouk over t he This sentence has vowels: aeioulazy dog.0"], ["Pyt hon is awmesome!"], ["hel12344567890This sesntehellhelloonce has vowels: aeiou"], ["helloThis is ai am using python Test!"], ["i am using pyt12345687890hon"], ["1234Python is awesome!5629890"], ["Thhel12344567890This sesntehellhelloonce has vowels: aeioue quick brown fox jumps over azy dog."], ["How are youyHow are you today? today?"], ["hel12344567890This sesntehellhelloonce has vowels: aei123465687890ou"], ["123445691207890"], ["This sent t!: a"], ["Thise ence haaei:ou"], ["This sentence has vowels: aeHow are you today?iou"], ["Progmming is fun"], ["i am usinng python"], ["12314561207890"], ["This senheltence has vowels: aeiou"], ["hel12344567890This sesntehellhelloonce has vowels: iou"], ["This is a T1234561207890This is ai am using pythomn Test!est!"], ["123456789The quick the This sentence has vowels: aeioulazy dog.0"], ["172345678890"], ["The quick over the This senntence has vowels: aeioulazy dog."], ["1234456912807890"], ["123456789The quick sthe This sentence has vowels: aeioulazThis is a T1234561207890This is ai am using python Test!est!y dog.0"], ["This is a Testi!"], ["ProgThise ence haaei:oumming is fun1234567890This sentence has vowels: aeiou"], ["The quick over the This sentence has vowels: aeiouy dog."], ["1234Python This is a Test!is awesome!5629890"], ["strawberries an12345687890d cream"], ["Ths sent t!: a"], ["Thstrawberriehs an12345687890d c a"], ["Thisa is a Testi!"], ["This is ahellhellooi am This sentence has vowels: ausing python Test!"], ["123140"], ["This is ahellst1234567890mg python Test!"], ["12734567890"], ["How are you t oday?"], ["123445691280789This sentence has vowels: aeHow are you today?iou0"], ["CX"], ["This senheltence has v1234568789s: aeiou"], ["1234656helloThis is ai am using python Test!0"], ["CCX"], ["Progmminig is fun"], ["121234Python This is a Test!is awesome!56298903445691207890"], ["123456121234Python This is a Test!is awesome!562989034456912078901207890"], ["Thisa This is a T1234561207890This is ai am using pythomn Test!est!is a Testi!"], ["1234This sentence has vowels: a561207890This is ai am using python Test!"], ["hel12344567890This sesntehThise sentence haaei:ouellhelloonce has vowels: waei123465687890ou"], ["This is ahhellhellooellhellooi am using python Test!"], ["This sentence has vowels: aeiouC"], ["1232140"], ["1234Python is awesome!123456789The quicThis sentence has vowels: areiouk over t he This sentence has vowels: aeioulazy dog.0"], ["1234562989012344569Programming is fun1207890"], ["123456789The quick e the This sentence has 3vowels: aeioulazy dog.0"], ["1236912807890"], ["This is ahhellhellooelThis sentt!: alhellooi am using python Test!"], ["This sentence has vowelss: aeHow are you today?iou"], ["This senThis is a Test!t t!: a"], ["This is ahhellhellooelThis sentt!helloThis is ai am using python Test!: alhellooi am using python Test!"], ["This 123445691280789This sentence has vowels: aeHow are you today?iou0ssentence has vowels: a"], ["i am 123140using python"], ["Thais sentence has vowels: aeHow are you today?iou"], ["This sentence has vowels: aeHowThais sentence has vowels: aeHow are you today?iou are you today?iou"], ["This sentence hsas vowelss: aeHow are you today?iou"], ["Thisa iProgThise ence haaei:oumming is fun1234567890This sentence has vowels: aeious a Testi!"], ["How ahelloThis is ai am using python Test!re you today?"], ["AEIOUaeiouq"], ["abcd\n\n\n\nefghijklmnopqrstuvwxyz"], ["Hello, how are you today?"], ["aaaaAAAABBBCCCdddDEEEE!"], ["xXyYzZ"], ["Hello world!"], ["1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzzzzzz"], ["example@example.com"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and var!ous caps."], ["Th!s"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps."], ["1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!"], ["Hello worlld!"], ["w!th"], ["AE"], ["AxXyYzZE"], ["abcd"], ["Acaps.xXyYzZE"], ["AxZXyYzZE"], ["the"], ["CaaaaAAAABBBCCCdddDEEEE!"], ["are"], ["ATh!s 1s @ str!ng w!th numb3rs, punctuat!on, and var!ous caps.xXyYzZE"], ["caps."], ["worlld!"], ["Hello"], ["puuat!on,"], ["abquickcd"], ["The"], ["The quitoday?ck brown fo x jumps over the l azy dog."], ["xXyYZzZ"], ["you"], ["w!twh"], ["aaaaAAAABBBCCCdddDaEEEE!"], ["AEIOUaeioiuq"], ["var!ous"], ["x"], ["AxZX"], ["vvar!ousar!ous"], ["1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!"], ["dog.Hello"], ["w!wtwh"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!"], ["over"], ["fo"], ["Hello worldThe!"], ["aaaaAAAABBBCCCfoxdddDaEEEE!"], ["world!"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyYzZE"], ["doelloo"], ["ww!wtwh"], ["Hello worlAcaps.xXyYzZEhe!!"], ["vvar!world!ousar!ous"], ["vvar!ousar!aaaaAAAABBBCCCdddDaEEEE!"], ["oveHello worlAcaps.xXyYzZEhe!!"], ["numb3rs,"], ["1a2b3c4d5e6f7g8h9i10jklmnopqrstworldThe!zzzzzzz"], ["Hello worllquitoday?ck!"], ["how"], ["aAEIOUaeiouqndd"], ["example@example.colm"], ["efghijklmnopqrstuvwxyz"], ["Helww!wtwhlo"], ["doelo"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqrstuvwxyzzzzzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzz"], ["anopqrstuvwxyxXyYZzZz"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusarxXyYZzZ!ous caps.AYxXyYzZE"], ["anazyl"], ["thhe"], ["l"], ["abcd\n\n\n\nefghlijklmnopqrstuvwxyz"], ["worllquitoday?ck!"], ["lAxZX"], ["tworlAcaps.xXyYzZEhe!!hhhe"], ["caps.AYxXyYzZE"], ["brownAEIOUaeioiuq"], ["anorstuvwxyxXyYZzZz"], ["ATh!s 1s @ strHello,!ng w!th numb3rs, punctuat!on, and var!ous caps.xXyYzZE"], ["caps.AEAYxXyYzZE"], ["exampletworlAcaps.xXyYzZEhe!!hhhe@example.colm"], ["Hello worhe!"], ["lftoSCkoD"], ["vvar!worcaps.AYxXyYzZEld!ousar!ous"], ["and"], ["ll"], ["Hello wor"], ["str!ng"], ["Hello,"], ["oveHello wstrHello,!ngorlAcaps.xXyYzZEhe!!"], ["Hello worllquy?ck!"], ["quick"], ["strHello,!ng"], ["@"], ["punctuat!on,"], ["sSsS"], ["pp"], ["AxXyYwzZEworllquitoday?ck!"], ["dog."], ["aaaaAAAABBBCCCfovvar!world!ousar!ousxdddDaEEEE!"], ["punctuat!oHello worlld!n,"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, AxZXand vvar!ouusarxXyYZzZ!ous caps.AYxXyYzZE"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AzZE"], ["Th!s 1s @ str!ng wt!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AzZE"], ["CaaaaAAAABBBCCCdddDEEEEE!"], ["vvar!ousar!ABBBCCCdddDaEEEE!"], ["HTh!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyYzZEello world!"], ["over1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzzzzzz"], ["Th!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZE"], ["doeloIZdDL"], ["AxZXyYzZbrownE"], ["Hello wd!"], ["1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!"], ["lazy"], ["xXyYzdoeloIZdDLZ"], ["lftoSCkotD"], ["quitoday?ck"], ["Hello theworllquitoday?ck!"], ["wor"], ["brown"], ["caps.xXyYzZE"], ["abqabcd\n\n\n\nefghijklmnopqrstuvwxyzuickvcd"], ["1s"], ["thvvayYZzZ!ouse"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8kh9i10jklmnopqrstuvwxyzzzzzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["ATh!s 1s @ straHello,!ng w!th numb3rs, punctuat!on, and var!ous caps.xXyYzZE"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i"], ["Hlo wor"], ["wd!"], ["The quick brown fox jumps over the lazdog."], ["AxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownE"], ["Hello worlld!"], ["AxZXyYzEZE"], ["1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!"], ["vvar!ouusarxXyYZzZ!ous"], ["aaaaAAAABBBCCCfEoxdddDaEEEE!"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE"], ["w!h"], ["howoveHello worlAcaps.xXyYzZEhe!!"], ["worlAcaps.xXyYzZEhe!!"], ["AEIOHlo woroiuq"], ["ww!wtwth"], ["aaaaACCCdddDaEEEE!"], ["w!thHello wd!"], ["oveello worlAcaps.xXyYzZEhe!!"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvnar!ousar!ous caps."], ["wdoeloIZdDL"], ["over1a2b3c4d5anopqrstuvwxyxXyYZzZzvwxyzzzzzzz"], ["mFjXdJWPBt"], ["The quick brown fox jumps ovelftoSCkoDr the lazdog."], ["HTh!s 1s @ str!ng w!th numb3rs, punctuat!on,brown and vvar!ousar!ous caps.AYxXyYzZEello world!"], ["bHTh!s 1s @ str!ng w!th numb3rs, punctuat!on,brown and vvar!ousar!ous caps.AYxXyYzZEello world!rownw!thHello wd!"], ["anazylyou"], ["anopqrstuvwTh!sxyxXyYZzZz"], ["Hello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE! worldThe!"], ["bHTh!s 1s @ str!ng w!world!, punctuat!on,brown and vvar!ousar!ous caps.AYxXyYzZEello world!rownw!thHello wd!"], ["tworlAcaps.xXyyYzZEhe!!hhhe"], ["Helww!wtwhloAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownE"], ["worlld!n,"], ["braaaaAAAABBBCCCfEoxdddDaEEEEn"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousarr!ous caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE"], ["anazaaaaAAAABBBCCCdddDEEEE!yl"], ["caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE"], ["wd!aAAAAAxZXyYzEZEBBBCCCdddDEEEE!"], ["1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaHello"], ["AEIOlHlo woroiuq"], ["eHello worllquy?ck!wdoeloIZdDL"], ["worllquy?ck!wdoeloIZdDL"], ["mFjoveHello wstrHello,!ngorlAcaps.xXyYzYZEhe!!JWPBt"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousabqabcd\n\n\n\nefghijklmnopqrstuvwxyzuickvcdarr!ous caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE"], ["1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!"], ["AEE"], ["doeCaaaaAAAABBBCCCdddDEEEE!lloo"], ["caps.AYxXyYzZEAxZXyYzZE"], ["lAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownEftoSCkoD"], ["worll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!"], ["AEIOlHlo"], ["AAxZX"], ["vousar!ous"], ["vvar!ousar!ABBBCCCdddDaEEBEE!"], ["1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLxyzzzzzzzaaaHello"], ["AEIOlareHlo"], ["doworoiuqelo"], ["Hello theworllquitodacaps.AzZEy?ck!"], ["anorstuvwxyxXyYZzZzdoeloIZdDL"], ["worlAcaps.xsXyYzZEheAxZXyYzZE!!"], ["lazyy"], ["oveHello worlAcHello worllquy?ck!aps.xXyYzZEhe!!"], ["over1awt!th2b3c4d5anopqrstuvwxyxXyYZzZzvwxyzzzzzzz"], ["HelAxZXyYzZbrownElo worldThe!"], ["over1a2b3c4d5e6f7g8h9i10jklmnopqrstuvCaaaaAAAABBBCCCdddDEEEEE!wxyzzzzzzz"], ["tIZdDLhvvayYZzZ!ouse"], ["oveHello worlAcHello worllquy?ck!aps.xXyYzZEhe!caps.xXyYzZE!"], ["1a2b3c4dmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!"], ["Hlo wolAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownEftoSCkoDr"], ["Hello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello"], ["vvar!ous!ar!ous"], ["yYzZbraaaaAAAABBBCCCdddDaEEEE!ownE"], [""], ["ww!wtwefghijklmnopqrstuvwxyzuickvcdarr!oush"], ["wwor"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqrstuvwxyzzzazzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["punctuat!on,brown"], ["Helww!wtwhloAxZXyYworllquitoday?ck!zZbraaaaAAAABBBCCCdddDaEEEE!ownE"], ["AxXyworlAxcaps.xXyYzZEhe!!YzZE"], ["mFjXdJWPBmt"], ["1a2b3c4d5e6f7g8h9i10jklmnopstworldThe!zzzzzzz"], ["1a2b3c4dmnopqrstuvwxyzzzzzzzaaaHello"], ["ww!wtwtwh"], ["1a2b3c4dmnopqrstuvwxyzzzzzzzaabrownaHello"], ["Hestsr!ngllo worlld!"], ["eT"], ["ov"], ["ofo"], ["thanopqrstuvwTh!sxyxXyYZzZz"], ["AEIOHlo woroiuql"], ["efghijklmnopqrstuvwxyzuickvcdarr!ous"], ["oveHeleHellolo worlAcaps.xXyYzZEhe!!"], ["oveHeleHellolo"], ["var!xXyYZzZous"], ["vvar!ouosar!ous"], ["1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaaAA1AABBBCCCdddDEEEE!"], ["oveello"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusarxXZE"], ["oveHello wstrHello,!ngorlAcaps.xXyYzZEhe!!lazy"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousabqabcd\n\n\n\nefghijklmnopqrsaaaaAAAABBBCCCfEoxdddDaEEEE!tuvwxyzuickvcdarr!ous caps.AYxXyYzZEAxZXyYEzZEcaps.xXyYzZE"], ["Hellcaps.o,"], ["over1a2b3c4dt5anopqrstuvwxyxXyYZzZzvwxyzzzzzzz"], ["lftoSCkoDl"], ["HellHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE! wdoeloIZdDLworldThe!yYzZEhe!!"], ["over1a2b3c4d5e6f7rstuvwxyzzzzzzz"], ["anzazylyou"], ["caps.AYxXyYzZEworllquy?ck!AxZXyYzZE"], ["AEIOlHlEo"], ["AxXyYwzZEworllquitoday?ck!AxXyworlAxcaps.xXyYzZEhe!!YzZE"], ["@anazyl"], ["c1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!apZE"], ["quitoday?cworll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!"], ["AxZXyYzZbrotIZdDLhvvayYZzZ!ousewnE"], ["aHello,nazylyou"], ["Helww!wtwhloAxZXyYy?ck!zZbraaaaAAAABBBCCCdddDaEEEE!ownE"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punworllquy?ck!wdoeloIZdDLctuat!on, and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE"], ["vvar!ouusarxXZE"], ["Hello worl!"], ["efghistuvwxyz"], ["hthe"], ["1a2b3cvvar!ouusarxXyYZuzZ!ous4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello"], ["1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvBCCCdddDEEEtE!"], ["IZdDL"], ["tworlAcaps.xyyYzZEhe!!hhhe"], ["dog.HelllftoSCkoDlo"], ["efghijklmnopqrsttuvwxyz"], ["Hello theworllquritoday?ck!"], ["Hlo"], ["worlld!ln,"], ["andbrown"], ["Hl"], ["anorstuvwxyxXyYZzZzzdoeloIZdDL"], ["abquicckcd"], ["Helww!wtwhloAxZXyYzZbraaaaAAAABBBCCCdpuuat!on,ddDaEEEE!ownE"], ["Helww!wtwhloAxZXyYzZbraaaaworll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!AAAABBBCCCdddDaEEEE!ownE"], ["howoveHello worl!!"], ["mFjoveHello"], ["AAxcaps.AYxXyYzZEAxZXyYzZEZX"], ["abqabcd\n\n\n\nefghijnklmnopqrstuvwxyzuickvcd"], ["ae"], ["HelllAxZXo worlAcaps.xXyYzZEhe!!"], ["AxZXand"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, a nd vvar!ousar!ous caps.AYxXyYzZE"], ["1a2b3cz4d5e6f7g8h9i10jklmnopqrstuvwxyzzzzzzz"], ["ATh!s 1s @ str!ng w!th anazylyounumb3rs, punctuat!on, and var!ous caps.xXyYzZE"], ["exaemple@exaHelAxZXyYzZbrownElomple.com"], ["ATh!s 1s @ straHello,!ng w!tATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousabqabcd\n\n\n\nefghijklmnopqrstuvwxyzuickvcdarr!ous caps.AYxXyYzZEAxZXyYzZEcaps.xXyYzZE caps.xXyYzZE"], ["abcd\n\nww!wtwh\n\nefghlijklmnopqrstuvwxyz"], ["vousarr!sous"], ["oHelww!wtwhloAxZXyYzZbraaaaAAAABBBCCCdpuuat!on,ddDaEEEE!ownEveelvlo"], ["ppAcaps.xXyYzZE"], ["oveello worlAcaps.xXyYzZEhhe!!"], ["strHo,!ng"], ["stsr!ng"], ["efghijklmnopqrstuvwxyzhow"], ["Th!s 1s @ str!ng w1!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AzZE"], ["numb3randsAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownE,"], ["ofoo"], ["1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuv8wxyzzzzzzz"], ["tworlAcaps.xXyyYzZEhe!h!hhhe"], ["AxZXyYzAcaps.xXyYzZEZE"], ["efghistvuvwxyz"], ["Th!s 1s @ str!ng w1!th nuHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE! worldThe!mb3rs, punctuat!on, and vvar!ousar!ous caps.AzZE"], ["The quick brown fox jumps overppAcaps.xXyYzZE lthe lazdog."], ["lAxazyZX"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvnar!ousar!ous ca."], ["Th!s 1s @ str!ng w!th nuoveello worlAcaps.xXyYzZEhe!!mb3rs, punctuat!on, and vvar!ouusarxXyYZzZ!ousand caps.AYxXyYzZE"], ["worll1a2b3c4d5e6f7g8h9iworlld!ln,10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!"], ["twhabcd\n\n\n\nefghijklmnopqrstuvwxyz"], ["wdd!"], ["aefghistvuvwxyzbcd"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8kh9i10jklmnopqrstuvwxyzzzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["HbHTh!s 1s @ str!ng w!th numb3rs, punctuat!on,brown and vv"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusavrxXZE"], ["UVzMKnT"], ["w!thh"], ["Th!s 1s @ stsr!ngworlld! w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZE"], ["dodeloIZdDL"], ["1a2b3c4d5e6fzAxXyYzZE7gcap5s.8h9i"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, "], ["vanorstuvwxyxXyYZzZzzdoeloIZdDLousarr!sous"], ["capaov."], ["AEIOlHlo uq"], ["Thn!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusavrxXZE"], ["efgijklmnopqrstuvwxyzhow"], ["quitodayd?ck"], ["YFx"], ["dodeloIZd"], ["wwworlld!or"], ["anoorstuvwxyxXyYZzZz"], ["apuncabqabcd\n\n\n\nefghijklmnopqrstuvwxyzuickvcdtuat!on,brown"], ["Thn!s 1s @ ouusavrxXZE"], ["AEIOlHlo wo"], ["w!thHello"], ["wt!th"], ["tworlAcaps.xXyyYzZEhe!!hdog.Hellohhe"], ["efghijnklmnopqrstuvwxyzuickvcd"], ["HepllHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE! wdoeloIZdDLworldThe!yYzZEhe!!"], ["vvar!ouusavrxXZE"], ["Thn!s 1ss @ ouunsavrxXZE"], ["theworllquitodacapwdd!s.AzZEy?ck!"], ["eww!wtwhT"], ["efghijklmnopqtIZdDLhvvayYZzZ!ouserstuvwxyz"], ["braaaaAAAABBBCCCHello worldThe!fEoxdddDaEEEEn"], ["1a2b3c4dmwnopqrstuvwxyzzzzzzzaabrownaHello"], ["1a2b3c4d5e6fworldThe!pstworldThe!zzzzzzz"], ["AxHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABthheBBCCCdddDEEEE! worldThe!ZXyYzZDE"], ["bHTh!s 1s @ str!ng w!th numb3vvar!ouusarxXZErs, punctuat!on,brown and vvar!ousar!ous caps.AYxXyYzZEello world!rownw!thHello wd!"], ["Thn!s 1s @ ouussavrxXZE"], ["ATh!s 1s @ straHello,!ng w!th numb3rs, punctuat!.on, and var!ous caps.xXyYzZE"], ["vousar!o"], ["eHello worllquy?ck!wdouunsavrxXZEloIZdDL"], ["Th!s 1s @ str!ng w1!th numb3rs, puzZE"], ["AxXyYwzZEworllquitoday?ck!xcaps.xXyYzZEhe!!YzZE"], ["vv"], ["twporlAcaps.xXyyYzefgijklmnopqrstuvwxyzhowhe"], ["dog.Hellworhe!o"], ["twhawbcd"], ["ouunsavrxXZE"], ["f1a2b3c4d5e6fz7g8h9i10jklmnopqrTh!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusarxXZEstuvBCCCdddDEEEtE!"], ["ndoveHello worlAcaps.xXyYzZEhe!!d"], ["Hello1a2b3c4d5e6fz7g8h9i10jklHelww!wtwhloAxZXyYworllquitoday?ck!zZbraaaaAAAABBBCCCdddDaEEEE!ownEdoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello"], ["exampletworlAycaps.xXyYzZEhe!!hhhe@example.colm"], ["anorstuvwxyxXHello theworllquitodacaps.AzZEy?ck!L"], ["ooveello"], ["HbHTh!s 1s @ str!ng w!th numb3rs, punctuat!on,brown and vvl"], ["mpYworld!rownw!thHelloSq"], ["wwwstrHello,!ngorlAcaps.xXyYzZEhe!!lazy!wtwth"], ["efghijklmnopqtIZdDLhvvayYZzZ!ouserstuvwxyzAE"], ["anorstuvwxyxXHello theexample@example.comworllquitodacaps.AzZEy?ck!L"], ["mFjoeHello"], ["oworlAcaps.xsXyYzZEheAxZXyYzZE!!fo"], ["ww!wtwefghijklmnopqrstuvwxyzuickanzazylyouvcdarr!oush"], ["Th!s 1s @ str!ng w!th num.b3rs, punctuat!on, and vvnar!ousar!ous caps."], ["vvnar!ousar!ous"], ["vstsr!ngar!xXyYZzZous"], ["oveHelworlAcaps.xXyYzZEhe!!"], ["ppAcquitoday?cworll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!aps.xXyYzZE"], ["dw!thHello wd!"], ["evvar!ouusarxXyYZzZ!ousandfghijnklmnopqrstuvwxyzuickvd"], ["efghijklmnwopqrstuvwxyz"], ["1amnopqrstuvwxyzzzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["efghijklmnopqtaaaaACCCdddDaEEEE!ouserstuvwxyz"], ["AAx1a2b3c4d5e6f7g8h9i10jklmnopstworldThe!zzzzzzzZX"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ousar!ous caps.AYxXyY zZE"], ["Ththeworllquritoday?ck!n!s 1ssThn!s 1s @ str!ng w!th numb3rs, punctuat!onHello worldThe!, and vvar!ouusavrxXZE @ ouunsavrxXZE"], ["AxZXyYzZbraaaaAAAABBBCCCdAEIOHlo woroiuqddDaEEEE!ownE"], ["mFjX1a2b3c4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!dJWPBmmt"], ["Hellwo world!"], ["w!wwtwh"], ["AxZXyYzZbraaaaAAAABBBCCCdAEIoOHlo woroiuqddDaEEEE!ownE"], ["The quick brown fox juumpos ovelftoSCkoDr the lazdog."], ["xXCaaaaAEEEE!yYzdoeloIZdDLZ"], ["Hellcaabcdps.o,"], ["oHlabquickcdo"], ["Th!s 1s @ stsr!ngworlld! w!and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZE"], ["worl!"], ["He!llwo world!"], ["punctuat!oHello"], ["1a2b3c4d5e6f7g8h9i130jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!"], ["1a2b3c4d5e6fz7g8hC9i10jklmnopqrstuvBCCCdddDEEEtE!"], ["a"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvnar!owusar!ous ca."], ["oo"], ["aaaaACCCquitoday?cworll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!dddDaEEEEC!"], ["world!rownw!thHello"], ["anoorstuvwxyxXYZzZz"], ["anopqrstvvar!ZouusavrxXZEXyYZzZz"], ["The quick brown fox jumpos overppAcaps.xXyYzZE lthe lazdog."], ["anazzylyou"], ["JmFjXdJWPBt"], ["yYzATh!s 1s @ stsr!ng AxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownEw!th numb3rs, punctuat!on, ZbraaaaAAAABBBCCCdddDaEEEE!ownE"], ["worll1a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqr!stuvwxyzzzzzzuitoday?ck!"], ["The quick brown fox jumpos overptworlAcaps.xXyyYzZEhe!!hhheaps.xXyYzZE lthe lazdog."], ["aapuncabqabcd"], ["wdorld!"], ["eeT"], ["punctuwat!oHello worlld!n,"], ["exww!wtwthampletwortlAycaps.xXyYzZEhee!!hhhe@example.colm"], ["HbHTh!s 1s @ stur!ng w!th numb3rs, punctuat!on,brown and vvl"], ["aaaaAAAABBBCCCfoxdddDaEEEEoveHello wstrHello,!ngorlAcaps.xXyYzZEhe!!"], ["caps.AYxXTRzFAAxyYzZEAxZXyYzZEcaps.xXyYzZE"], ["anorstuvwxyxXyYZzZzdoelTh!s 1s @ str!ng w!th numb3rs, punctuat!on, and vvar!ouusavrxXZEoIZdDL"], ["vxXyYZzZvar!ousar!ABBBCCCdddDaEEBEE!"], ["AxXyYwzZEworllquitoday?ck!AxXyworlAxcaps.xXyYzZEohe!!YzZE"], ["1a2b3c4d5e6f7g8h9i110jklmnopqrstworldThe!zzzzzzz"], ["andbrow1a2b3c4d5e6f7g8h9i110jklmnotworlAcaps.xXyyYzZEhe!h!hhhepqrstworldThe!zzzzzzz"], ["worll!quy?ck!wdoeloIZdDL"], ["He!llwo"], ["over1awt!th2b3c4d5anopqrstuvwxyxXyYyZzZzvwxyzzzzzzz"], ["f1a2b3c4d5e6fz7g8h9i10jklm6nopqrTh!s"], ["doeloIIIZdDL"], ["ATh!s 1s @ stsr!ng w!th numb3rs, punctuat!on, and vvar!ousarr!ous caps.AxZXyYzZEcaps.xXyYzZE"], ["HHelww!wtwhloAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownEellwo world!"], ["AEIq"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqrstuvwx0yzzzazzzzaaaquickaAAAABBBCCCdddDEEEE!"], ["mFjX1wd!aAAAABBBCCCdddDEEEE!dJWPBmmta2b3cd4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABBBCCCdddDEEEE!dJWPBmmt"], ["ATh!s 1s @ straHello,!ng w!th nwumb3rs, punctuat!.on, and var!ous caps.xXyYzZE"], ["wdooelo"], ["worldThe!fEoxdddDaEEEEn"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!on, anhd vvar!ouusarxXyYZzZ!ous caps.AYxXyYzZE"], ["efghijklmnopqrsaaaaAAAABBBCCCfEoxdddDaEEEE!tuvwxyzuickvcdarr!ous"], ["AxZXyYzZbraaaaAAAABBBCCCdAEIoOHlompYworld!rownw!thHelloSq"], ["oHelww!wtwhloAxZXover1a2b3c4dt5anopqrstuvwxyxXyYZzZzvwxyzzzzzzzyYzZbraaaaAAAABBBCCCdpuuat!on,ddDaEEEE!ownEveelvlo"], ["Hell"], ["abqabcd\n\n\n\nefghvijnklmnopqrstuvwxyzuickvcd"], ["AEIOHlo"], ["wolAxZXyYzZbraaaaAAAABBBCCCdddDaEEEE!ownEftoSCkoDr"], ["AxZXyYzZbraaaaAAAABBBCCCdAEIoOHlo"], ["theworllquitoday?ck!"], ["wAxZXyYzAcaps.xXyYzZEZE!thHello wd!"], ["azy"], ["dFymXw"], ["ATh!s 1s @ stsr!ng w!th numbcaps.AYxXTRzFAAxyYzZEAxZXyYzZEcaps.xXyYzZE, "], ["Hello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqr1a2b3c4d5e6f7g8h9i130jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!stuvwxyzzzzzzzaaaHello"], ["He!llxXyYZzZwo"], ["1a2b3c4d5zz"], ["braaaaAAAABBBCCCHello"], ["ww!wtwefghijklmnopqrstuvwxyzuickanzazylyouvcdsarr!oush"], ["mFjX1a2b31a2b3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuv8wxyzzzzzzzc4d5e6fz7g8h9i10jklmnopqrstuvwxyzzzzzzzaaaHello wdw!aAAAABBBCCCdddDEEEE!dJWPBmmt"], ["ATh!s"], ["w!aaaaAAAABBBCCCdddDaEEEE!hHello"], ["AxZXyYzZbraaaaHe!llwoAAAABBBCCCdAEIoOHlo woroiuqddDaEEEE!ownE"], ["abquiccUVzMKnTvvar!ousar!ouscd"], ["HelllAxZXo wHellwooexampletworlAcaps.xXyYzZEhe!!hhhe@example.colms.xXyYzZEhe!!"], ["cpaps."], ["theworllqouitoday!"], ["quitoday?cworll1a2btheworllqouitoday!3c4d5e6f7g8h9i10jklmnopHelww!wtwhloqrstuvwxyzzzzzzzquitoday?ck!"], ["Th!s 1s @ str!ng w!th nuoveello worlAcaps.xXyYzZEhrxXyYZzZ!ousand caps.AYxXyYzZE"], ["AEIOUaeoHlabquickcdoioiuq"], ["AAxcaps.AYxXyYzZEAxZZEZX"], ["1a2b3cz4d5e6f7g8h910jklmnopqrstuvwxyzzzzzzz"], ["oveHelleHellolo worlAcaps.worlAcaps.xXyYzZEhXyYzZEhe!!"], ["doHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqr1a2b3c4d5e6f7g8h9i130jklmnopqrstuvwxyzzzzzzzaaaaAAAABBBCCCdddDEEEE!stuvwxyzzzzzzzaaaHelloeCaaaaAAAABBBCCCdddDEEEE!lloo"], ["vvar!ouar!ous"], ["1seuvwxyz"], ["bHTh!s"], ["Th!s 1s @ stsr!ng w!th numb3rs, punctuatThe!on, and vvar!ousar!ous caps.AYxXyYzZEAxZXyYzZE"], ["Helww!wtwhloAxZXyYworllquitoday?ck!zZbraaaaAAAABBBCIZdDLCCdddDaEEEE!ownE"], ["aHlnd"], ["HelAxZXyYzZbrownElo wrorldThe!"], ["vopunctuwat!!oHellousar!ous"], ["w!wvar!xXyYZzZouswtwh"], ["worllquy?ck!"], ["numbcaps.AYxXTRzFAAxyYzZEAxZXyYzZEcaps.xXyYzZE,"], ["theworllquitodacaps.AzZEy?ck!L"], ["vvar!ouarr!ous"], ["f1a2b3c4d5e6fzrTh!s"], ["vvar!oAxHello1a2b3c4d5e6fz7g8h9i10jkldoeloIZdDLmnopqrstuvwxyzzzzzzzaaaHello wd!aAAAABthheBBCCCdddDEEEE! worldThe!ZXyYzZDEuusarxXyYZzZ!ous"], ["aHlbHTh!s 1s @ str!ng w!world!, punctuat!on,brown and vvar!ousar!ous caps.AYxXyYzZEello world!rownw!thHello wd!nd"], ["dogg."], ["@@"], ["varos"], ["abqabcd"], ["qquick"], ["wworhow"], ["punctluwat!oHello worlld!jumposp,"], ["aefghistvuvwxyz"], ["1a2b3c4d5e6fzAxXyYzZE7gcaps.8h9i10jklmnopqBBBCCCddidDEEEE!"], ["ATh!s 1s @ straHello,!ng w!th numb3ros, punctuatThe!on,punctuat!.on, and var!ous caps.xXyYzZE"], ["AlftoSCkoDEIOlHlo wo"], ["xx"], ["mFjoemHello"], ["Hlo wolAxZXyYzZbraaaaAAAABBBCCCdddDaEEoveHelworlAcaps.xXyYzZEhe!!EE!ownEftoSCkoDr"], ["Thn!s 1worlAcaps.xXyYzZEhrxXyYZzZ!ousands @ ouusavrxXZE"], ["dog.Hellwor"], ["xXCaaaaAEEEE!yYzdoeloIZdDLZvar!ous"], ["theworllquitodacaps.AzZEy?ack!L"], ["puzZE"], ["fLDZzeBh"], ["fox"], ["apuncabqabcd"], ["efghijklmnopqtIZdDLoveHello worlAcHello worllquy?ck!aps.xXyYzZEhe!!hvvayYZzZ!ouserstuvwxyz"], ["worllquy?ck!aps.xXyYzZEhe!!hvvayYZzZ!ouserstuvwxyz"], ["wt!thvvar!ousar!ABBBCCCdddDaEEEE!"], ["wdw!aAAAABBBCCCddDEEEE!dJWPBmmt"], ["AAxXyzZE"], ["EjGkZwKvO"], ["anazylyounumb3rs,"], ["oveello worlAcaps.xXyYzZEhhe!!lftoSCkoDl"], ["AEIOUaeiou"], ["."], ["0123456789"], ["AbCdeFGHiJklmnOPqRsTuVwXYz"], ["AAaaBBbbCCccDDddEEeeFFff"], ["akdj nsoirewqabfj nal kjaks kdas"], ["\n"], [" "], ["\t"], ["\r"], ["Hello worldd!"], ["AEIOUaeHello worldd!iouq"], ["The quick brown fox jaaaaAAAABBBCCCdddDEEEE!oveHello,dog."], ["AEIOUeiouq"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps."], ["examplle@example.com"], ["Hello, how tare you today?"], ["example@example.comThe quick brown fox jumps over the lazy dog."], ["aaaaAAdDEEEE!"], ["Hello, h tare you today?"], ["str!ngand"], ["The quick brown fox jumps over the lazy dog."], ["punctuat!oHellolazyn,"], ["Th!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, and var!ous caps."], ["aaaaaAAdDEEEE!"], ["aaaaAAdDEEaaaaAAdDEEEE!EEE!"], ["The quick brown foxy dog."], ["examplle@example.copm"], ["The quick brown foxy g."], ["AEIOUeoiouq"], ["1a2b3c4d5e6f7g8h9i10Hello, h tare you today?jklmnoprstuvwxyzzzzzzz"], ["worl"], ["str!!ng"], ["aaexample@example.comTheaaAAAABBBCCCdddDEEEE!"], ["The quick brown fox jumps over the lazyog."], ["str!ngandlazy"], ["punctuat!oHellon,"], ["tokday?jklmnoprstuvwxyzzzzzzzz"], ["Hello, how efghijklmnopqrstuvwxyztare you totokday?jklmnoprstuvwxyzzzzzzzzday?"], ["The quick brown fox jumps over the lazy dog.h"], ["str!ngl"], ["The quiver the lazy dog.h"], ["today?jklmnoprstuvwxyzzzzzzz"], ["Hello, how efghijklmnopqrstuvwxyztare you totokday?jklmnoprstuvwxyzzzzzzzzThe quick brown fox jumps over the lazy dog.hday?"], ["Hello, how tare youexample@example.comThe today?"], ["lazyog."], ["eHello,"], ["AEIOUaeHello worlaaaaAAdDEEEE!dd!iouq"], ["jyJiBLGfRP"], ["The quick brown fox jumps odver the lazy dog.h"], ["efghijklmnopqrstuvwxyztare"], ["The quick brown fox jumps ovner the lazy dog."], ["abcd\n\n\n\nefghijklmnopquickyz"], ["efghijklmnopqrstuvwxyzytaredog.hday?"], ["aaaaAAAABBBCCdDEEEE!"], ["aaaaAAdEexample@example.comTheDEEaaaaAAdDEEEE!EEE!"], ["The qThe quick brown fox jumps over the lazy dog.uick brown foxy g."], ["foxy"], ["Hello, h tare you today?"], ["lazzyog."], ["Th!s 1s @ str!ng w!th numb3rs, punctuat,!oHellon, and var!ous caps."], ["Hellay?"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps."], ["Hellobrown world!"], ["Hello, hh tare you today?"], ["g."], ["aaaAEIOUeiouqquiveraAAdDEEaaaaAAdDEEDEE!EEE!"], ["aaaaaAAAABBBCCdDEEEE!"], ["woyourl"], ["MBSXebBdc"], ["efghijklmnogpqrstuvwxyztare"], ["1a2b3c4d5e6f7g8h9i10Hello,"], ["1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxkyzzzzzzz"], ["Th!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand var!ous caps."], ["ayoubcd\n\n\n\nefghijklmnopqrstuvwxyz"], ["HelThe qThe quick brown fox jumps over the lazy dog.howuick brown foxy g.lay?"], ["abcdHello, how tare youexample@example.comThe today?"], ["worlefghijklmnopqrstuvwxyztare"], ["dog.hday?"], ["lazzyaoog."], ["s1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzzzzzztr!ngl"], ["1a2b34c4d5e6f7g8h9i10Hello,"], ["xkfHeZTld"], ["foy"], ["str!gngnandlazy"], ["str!n"], ["g.lay?"], ["efghredog.hday?"], ["jumps"], ["Helleo wtoday?jklmnoprstuvwxyzzzzzzzorld!"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat,!hoHellon, and var!ous caps."], ["Helleo"], ["andd"], ["anThe quick brown fox jumps over the lazyog.dd"], ["tare"], ["xkfHeZTldAEIOUaeHello worldd!iouq"], ["str!ngandlaTh!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps.zy"], ["ayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand var!ous caps."], ["w!!h"], ["aaaaAAAABBBnumb3rs,CCCdddDEEEE!"], ["wayoubcdorl"], ["abcd\n\n\nc\nefghijklmnopquickyz"], ["aaaaAAAABBBnumb3rs,CCCdddDEw!!hEEE!"], ["AEIOUThe quick brown fox jumps over the lazy dog."], ["Hello wefghijklmnopqrstuvwxyztareorldd!"], ["AEIcaps.zyOUaeiouq"], ["lo,"], ["ovner"], ["str!caps.zyngcand"], ["jaaaaAAAABBBCCCdddDEEEE!oveHello,dog."], ["worol"], ["xkfHeZTldAEIOUaeHello worpunctuat,!hoHellon,ldd!iouq"], ["The quick brown fox jaaaaAAAAeBBBCCCg."], ["strTh!s"], ["example@example.comThe"], ["The qThe quick brown fox jumpsexample@example.comThe over the lazy dog.uick brown foxy g."], ["Th!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aanvar!ous caps."], ["wtoday?jklmnoprstuvwxyzzzzzzzorld!"], ["dHello, hh tare you today?og.h"], ["abcd\np\n\nc\nefghijklmnopquickyz"], ["ayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps."], ["MBSXebnumb3rs,Bdc"], ["oHello, hh h tare you today?"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat!uoHellon, and var!ous caps."], ["wlo,!h"], ["AEIOUaeiojyJiBLRGfRP"], ["hHello, how are you today?"], ["The quick brown fox jaaaaAAAAeBBBCCtoday?og.hCg."], ["abcd\np\n\nc\nefghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzz"], ["worldd!"], ["aaaaAAdDEEaaaaAHello wefghijklmnopqrstuvwxyztareorldd!AdDEEEE!EEE!"], ["The qThe quick brown fox jumpseThe qThe quick brown fox jumpsexample@example.comThe over the lazy dog.uick brown foxy g.xample@example.comThe over the lazy dog.uick brown foxy g."], ["AEEIOUaeHelHlo"], ["abcd\n\n\njc\nefghijklmnopquickyz"], ["The quiTh!s 1s @ str!ng w!th numb3rs, punctuat,!hoHellon, and var!ous caps.ck brown fox jumps odverlazy dog.h"], ["Helle"], ["efghijklmnTh!s 1s @ str!ng w!th numb3rs, punctuat!uoHellon, and var!ous caps.opqrstuvwxyztare"], ["gh."], ["c"], ["xkfHeZld"], ["jaaaaAAAAeBBBCCCg."], ["1a2b3c4d5e6f7g8h9i10Hejcllocaps.ck,"], ["xkfHld"], ["worlefghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzzdd!"], ["abcd\np\n\nc\nefghijlazzyog.klmnopquickyz"], ["caps.zy"], ["aaexamDEEEE!"], ["punctuat!uoHellon,"], ["Hexample@example.comello, how efghijklmnopqrstuvwxyztare you totokday?jklmnoprstuvwxyzzzzzzzzday?"], ["lThe quick brown fox jaaaaAAAABBBCCCdddDEEEE!oveHello,dog."], ["dog.hoday?"], ["examplle@example..copm"], ["Th!s 1s @ str!ng w!th numb3rs, punctuat,!oHellnumb3rs,on, and var!ous caps."], ["The quick brown AEEIOUaeHelHlofox jumps over the lazyog."], ["lazyog.dd"], ["example@example.comThe quick brown fvawr!ousox jumps over the lazy dog."], ["dog.howuick"], ["quiefghijklmnopquickyzck"], ["AEIcaps.zyOUpaeiouq"], ["abcdHelloanThe, how tare youexample@example.comThe today?"], ["1a2b3c4d5e6fTh!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps.7g8h9i10jklmnopqrstuvwxyzzzzzzz"], ["Hello, hTh!sare you today?"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous caps."], ["Hstr!caps.zyngcandllo, how are you today?"], ["The quick kbrown fox jumps overt the lazyog."], ["punctuat!ocn,"], ["efgxkfHeZTldAEIOUaeHellohijklmnopqrstuvwxyz"], ["aaaEaAAdDEEEEE!"], ["AEIOUe"], ["The quick brown fosx jumps over the lazyog."], ["eThe quickare brown fe"], ["examplxHello,le@example.com"], ["xkfHeZTldAEIOUaeHello worpunctuat,!hoiHellon,ldd!iouq"], ["youexample@examcaps.ckple.comThe"], ["xkfHeZTldAEIOUaeH worlddd!iouq"], ["1a2b3c4d5e6f7g8h9i1ja0jklmnopqrstuvwxyzzzzzzz"], ["The qThe quick brown fox jumpsexample@example.comThe overfosx the lazy dog.uick brown foxy g."], ["MBSXaaaaAAAABBBnumb3rs,CCCdddDEEEE!ebBdc"], ["The quick brown fox jumps over the lazy dog.h"], ["sexamplxHello,le@example.comtr!!ng"], ["lazzyaooog."], ["examplle@examle.com"], ["Helllay?"], ["puncotuat!oHellon,"], ["eample.com"], ["worlaaaaAAdDEEEE!dd!iouq"], ["MBSXaaaaAAAABBdc"], ["laovnerzyog."], ["fe"], ["The quick kbrown fox jumpThe quick brown fox jumqTheps over the lazyog.s overt the lazyog."], ["examplle@examexamplle@example.copm.com"], ["xkfHeZTldAEIOUaeHello worpunctua t,!hoiHellon,ldd!iouq"], ["He"], ["yoo"], ["The quick brown fox jumps odver the l azy dog.h"], ["caps.ck"], ["laovnerzyog.jyJiBLGfRP"], ["laovnerzhyoHelTheg.jyJiBLGfRP"], ["punctuaTh!s 1s @ str!ng w!th numb3rs, punctuat,!oHellnumb3rs,on, and var!ous caps.t!on,"], ["t,!hoiHellon,ldd!iouq"], ["aaexample@example.comTheaaAAAABabcd\np\n\nc\nefghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzz!"], ["worrol"], ["xkfHeZTldAEIOUaeHello wdd!iouq"], ["Th!s 1s @ str!ngctuat,!oHellon, and var!ous caps."], ["aaaaAAdEexample@example.comTheaDEEaaaaAAdDEEEaE!EEE!"], ["Hellodog. world!"], ["The quick brown fox jumps over the lazy do."], ["aaexample@example.comTheaaAAAABabcd"], ["aaaaAAdDEEaaaaHexample@example.comello,DEEEE!EEE!"], ["ww!h"], ["Hello, how tare youexamplefghijlazzyog.klmnopquickexample@example.comTheyze@example.comThe today?"], ["strTh!hpunctuat!oHellon,s"], ["The quick brown AEEIOUaeHdo.elHlofox jumps over the lazyog."], ["aaaaAAdEexample@aexample.comTheaDEEaaaaAAdDEEEaE!EEE!"], ["totokday?jklmnoprstuvwxyzzzzzzzzThe"], ["wtoday?jklmnoprstuvwxHstr!caps.zyngcandllo,yzzzzzzzorld!"], ["wefghijklmnogpqrstuvwxyztare"], ["HelThe qThe quick brown strTh!hpunctuat!oHellon,ss over the lazy dog.howuick brown foxy g.?"], ["caps.t!on,"], ["!h"], ["Th!s 1s @"], ["XbFTQMiAwt"], ["MBSXaaaaBAAAABBdc"], ["eThe quicykare blazzyaoog.rown fe"], ["Hello,worldd!iouq hh tare you today?"], ["Hello, h tarAEIOUaeHello worlaaaaAAdDEEEE!dd!iouqe you today?"], ["today?og.h"], ["aaaaaAAAABBBCCdDEEEE!Th!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, and var!ous caps."], ["laovnerzyog.jyJiBLGfRsngandP"], ["The quick brown AEEIayoubcd\n\n\n\nefghijklmnopqrstuvwxyzOUaeHdo.elHlofox jumps over the lazyog."], ["tokday?jklmnoprstuvwxyzzztzzzzz"], ["xkfHeZTldAHexample@example.comello,EIOUaepHello wdd!iouq"], ["xkfHeZTldAEIOUaeH"], ["punt!on,"], ["MBSXadHello, hh tare you today?og.hEEEE!ebBdc"], ["eHellHellodog. world!o,"], ["The quiHellobrownck brown AEEIOUaeHelHlofox jumps over the lazyog."], ["xkfHeZTldAHexample@examllo,EIOUaepHello wdd!iouq"], ["Hexample@example.comello, how efge you totokdayzzzzzday?"], ["CpCOvCPPy"], ["wefghijklmnopqrstuvwxyztareorldd!"], ["1a2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzzczzz"], ["The quick brown fox juamps odver aaaaAAdDEEaaaaHexample@example.comello,DEEEE!EEE!the lazy dog.h"], ["tokday?jklumnoprstuvwxyzzztzzzzz"], ["abcdHelloanThe,"], ["AEEIOUaeHdo.elHlofox"], ["aaaaAAAABBBCCCdddDElazzyaoog.EE!"], ["aaaaAAdDEEaaaaAHello wefghijklmnopqrstuvwxyztareorldd!AdDEEEstr!ngandlazyE!EEE!"], ["str!!ngstr!!ng"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps.ps."], ["AThe quiver the lazy dog.heiou"], ["lago."], ["Th!s 1s @ str!ngl w!th numb3jaaaaAAAABBBCCCdddDEEEE!oveHello,dog.Hellon, and var!ous caps."], ["worlefghijklmnopqrstuvwxyztareyoo"], ["watoday?jklmnoprstuvwxyzzzzzzzyoubcdorl"], ["Hello, how e you totokday?jklmnoprstuvwxyzzzzzzzzday?"], ["quiver"], ["t,!hoiHellon,ldd!liouq"], ["txkfHeZTldAEIOUaeHare"], ["xXyjcYzZ"], ["taree"], ["caayoubd"], ["Hello, how tare youexamplefghijlazzyog.klmnople.comTheyze@example.comThe today?"], ["Th!s 1s @ str!ngl w!thg.? numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps.ps."], ["Th!s 1s @ str!ngl w!th numb3jaaaaAAAABBBCCCdddDEEEE!oveHello,dog.Hellon, and vaaaaAAdDEEaaaaHexample@example.comello,DEEEE!EEE!r!ous caps."], ["HelloanThe worldd!"], ["aa@example.comTheaDEEaaaaAAdDEEEaE!EEE!"], ["abcd\n\n\nc\novertfghijklmnopquickyz"], ["watodayhow?jklmnoprstuvwxyzzzzzzzyoubcdorl"], ["pun!t!on,"], ["Th!s 1s @ str!ngl w!th numb3jaaaaAAAABBBCCCdddDEEEE!oveHello,dog.Hellon, and vaaaaAAdDEEaaaaHexample@example.comello,DEEEE!EEE!r!ous ."], ["AEIxkfHeZldOUThe quick brown fox jumps over the lazy dog."], ["cpunctuaTh!s 1s @ str!ng w!th numb3rs, punctuat,!oHellnumb3rs,on, and var!ous caps.t!on,aayoubd"], ["The quick brown fox juamps odver a.comello,DEEEE!EEE!the lazy dog.h"], ["Heayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand var!ous caps.xample@example.comello, how efge you totokdayzzzzzday?"], ["The quick brown AEEIOUaeHdo.elHlofoxHelloanThe jumps over the lazyog."], ["abcd\np\n\nc\nefghijklmnopquickytoworld!day?jklmnoprstuvwxyzzzzzzzz"], ["efghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzz"], ["tkokday?jklmnoprstuvwxyzzztzzzzz"], ["worlefghijklmnopquickytoday?jklmnoprstuvwxzzzzdd!"], ["jumqTheps"], ["worlaaaaAAd!dd!iouqe"], ["Th!s 1s @ str!ngl w!.th numb3rs, punctuat!oHellon, aand var!ous caps."], ["punt!Hello wefghijklmnopqrstuvwxyztareorldd!,"], ["aand"], ["The quick brocaayoubcdwn foxr jumps ovner the lazy dog."], ["xkfHeZTldAHexample@XbFTQMiAwtexample.comello,EIOUaepHello"], ["lazzy"], ["odverlazy"], ["wMdE"], ["Hellobrowntare"], ["Th!s 1s @ str!ngl w!.th numb3rs, punctuat!oHellon, aand var!ous caexample@example.comTheps."], ["trstuvwxyzzztzzzzz"], ["examplle@Th!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand var!ous caps.exameamplle@example.copm.com"], ["The quiHellobrownck brown AEEIOUaeHelHlofox jumps over the lazyAEIOUe"], ["strTh!hpunctuat!oHel"], ["eTheaaaaAAAABBBnumb3rs,CCCdddDEw!!hEEE! quicykare blazzyaoog.rown fe"], ["Heayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand quivervar!ous caps.xample@example.comello, how efge you totokdayzzzzzday?"], ["jyJJiBLGfRP"], ["The quick br ocaayoubcdwn foxr jumps ovner the lazy dog."], ["aa@example.comTheaaDEEaaaaAThe quick brown fox juamps odver a.comello,DEEEE!EEE!the lazy dog.hAdDEEEaE!EEE!"], ["Hellodog. worstr!nld!"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @Th!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps. str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps.ps."], ["dHello,"], ["aa@exampwlo,!hle.comTheaDEEaaaaAAdDEEEaE!EEE!"], ["jumpsexamplecaps.xample@example.comello,@example.comThe"], ["p,unc,"], ["AEIOUThefghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzz!e quick brown hfox jumps over the lazy dog."], ["lagoTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aanvar!ous caps."], ["br"], ["Hellodog. worstr!nltoday?og.hd!"], ["AEEIayoubc"], ["caaydoubd"], ["dog.howuoverfosxick"], ["aaaaAAdDEEaaaaAHello wefghijklmnopqrstuvwxyztareorldd!AdDEEEstr!ngstr!ngandlaTh!s 1s @ str!ng w!th numb3rs, punctuat!oHellon, and var!ous caps.zyandlazyE!EEE!"], ["AEIOUaThe quick brown fox juamps odver aaaaAAdDEEaaaaHexample@example.comello,DEEEE!EEE!the lazy dog.heiou"], ["!!anThehwayoubcdorl"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxy!zTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps.ps."], ["lazHellod1a2b3c4d5e6f7g8h9i10Hello,og.zcaexample@example.comTheps."], ["Th!s 1s @ str!ng w!th numb3rs, punctuat,!oHellon, an d var!ous caps."], ["wdThe quick brown fox jumps over the lazy dog.hd!iouq"], ["thHello, how efghijklmnopqrstuvwxyztare you totokday?jklmnoprstuvwxyzzzzzzzzThe quick brown fox jumps over the lazy dog.hday?wefghijklmnopqrstuvwxyztareorldd!AdDEEEstr!ngstr!ngandlaTh!se"], ["hHellodog.ow"], ["caps.exameamplle@example.copm.com"], ["AEIxkfHeZldOUThe quick bzy dog."], ["wlazzyayoubcdorl"], ["The quick brown foHello, how tare you today?x jumps over txXyYzZhe lazy dog.h"], ["caps.zyandlazyE!EEE!"], ["efgxkfHeZTldAEIOUaeHellohijklmnopqrustuvwxyz"], ["jyJHellobrown world!iBLGfRP"], ["Tver the lazy dog.h"], ["AEIOUThefghijklmnopquickytoday?jklmnoprstuvwxyzzzzzzzz!e"], ["foxx"], ["The quick br ocaayoubcdwn foxr jukmps ovner the lazy dog."], ["AThe"], ["AEIOUae"], ["quiefghijklmnopquick"], ["caps.exameamplAEIOUaele@example.copm.com"], ["jumpseThe"], ["lagoTh!s 1s @ str!ngl w!th numb3rs,wdd!iouq"], ["xkflazyog.ddHld"], ["quiefghijkulmnopquick"], ["dHello, hh taare you today?og.h"], ["examplle@examexamplle@exampaa@exampwlo,!hle.comTheaDEEaaaaAAdDEEEaE!EEE!le.copm.com"], ["dog.hAdDEEEaE!EEE!"], ["Th!s 1s @ str!ngl w!th numb3jaaaaAAAABBBCCCdddDEEEE!oveHello,dog.Hellon, and var!ojyJHellobrown world!iBLGfRPus caps."], ["aaaaAAAxkfHeZTldAHexample@example.comello,EIOUaepHelloABBBCCdDEEEE!"], ["HellTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aanvar!ous.o,"], ["worlefghijklmnopqrstuvwxyzt"], ["jummps"], ["quiefghijkulmnAEIOUaeiojyJiBLRGfRPopqpuick"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxy!zTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aar!ous caps.ps."], ["pun!t!onworld!iBLGfRPus,"], ["youexamplefghijlazzyog.klmnopquickexample@example.comTheyze@example.comThe"], ["HHe"], ["caps.ps."], ["aaexamDEEE!"], ["aaaaAAAABBBnumb3t,!hoiHellon,ldd!liouqrs,CCCdddDEEEE!"], ["foHello,worlaaaaAAdDEEEE!dd!iouq"], ["Th!s 1s @ str!ngl w!thg.? numb3rs, puncotuat!oHellon, and var!ous caayoubcd\n\n\n\nefghijklmnopqrstuvwxyzTh!s 1s @ str!ngl w!th numb3rs, punctuat!oHellon, aand vawr!ous caps.ps.1a2b34c4d5e6f7g8h9i10Hello,"], ["lworldd!azzyog."], ["Hello, how tare youexamplefghijlazzyog.klmnopquickexamplle@example.comTheyze@example.comThe today?"], ["!!anThcehwayoubcdorl"], ["todTh!s 1s @ str!ng at,!jyJJiBLGfRPoHellon, and var!ous caps.ay?og.h"], ["Hello, how tare youexamplefghijlazzyog.klmnopayoubcd\n\n\n\nefghijklmnopqrstuvwxyzle.comTheyze@example.comThe today?"], ["1xkfHeZTldAEIOUaeHelloa2b3c4d5e6f7g8h9i10jklmnopqrstuvwxyzzz"], ["w"], ["aaaaAAdDEEaaaaHEexample@example.comello,DEEEE!EEE!"], ["cpunctuaTh!s"], ["strtokday?jklmnoprstuvwxyzzztzzzzz!ng"], ["Th!s 1s @ str!ngl w!th numb3rs, puncotuat!oHellon, and var!ous cappun!t!onworld!iBLGfRPus,s."], ["caps.worlefghijklmnopqrstuvwxyztareyoot!on,"], ["The quick tbrown AEEIayoubcd\n\n\n\nefghijklmnopqrstuvwxyzOUaeHdo.elHlofox jumps over the lazyog."], ["hHello,"], ["jaaaaAAAAeBBBCCtoday?og.hCg."], ["Th!s 1s @ str!ng w!th numb3Hello, how e you totokday?jklmnoprstuvwxyzzzzzzzzday?rs, punctuat,!oHellnumb3rs,on, and var!ous caps."], ["The quick brown ox jumps over the lazy dog.h"], ["tokday?jkxkfHeZTldAEIOUaeHlmnoprstuvxwxyzzzzzzzz"], ["gefghredog.hday?"], ["aaaaAAAAABBBCCCdddDElazzyaoog.EE!"], ["Hello, hh tare you tod?"], ["dog.hoAEIOUaeHello worlaaaaAAdDEEEE!dd!iouqwuick"], ["str!ngctuat,!oHellon,"], ["xXyjcYzZwntare"], ["The qexamplle@example.comuick brown foxw!!hy g"], ["eThe"], ["caps.efghijklmnTh!szy"], ["aaexamDEE!"], ["trstuvwxHello world!yzzztzzzzz"], ["w!hthAEEIOUaeHelHlo"], ["qexamplle@example.comuick"]], "completion": "\ndef remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n \"\"\"\n vowels = ['a', 'e', 'i', 'o', 'u']\n return ''.join([char for char in text if char.lower() not in vowels])\n", "raw_completion": "```python\ndef remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n \"\"\"\n vowels = ['a', 'e', 'i', 'o', 'u']\n return ''.join([char for char in text if char.lower() not in vowels])\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef remove_vowels(text):\n \"\"\"\n remove_vowels is a function that takes string and returns string without vowels.\n >>> remove_vowels('')\n ''\n >>> remove_vowels(\"abcdef\\nghijklm\")\n 'bcdf\\nghjklm'\n >>> remove_vowels('abcdef')\n 'bcdf'\n >>> remove_vowels('aaaaa')\n ''\n >>> remove_vowels('aaBAA')\n 'B'\n >>> remove_vowels('zbcd')\n 'zbcd'\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/52", "prompt": "\n\ndef below_threshold(l: list, t: int):\n \"\"\"Return True if all numbers in the list l are below threshold t.\n >>> below_threshold([1, 2, 4, 10], 100)\n True\n >>> below_threshold([1, 20, 4, 10], 5)\n False\n \"\"\"\n", "entry_point": "below_threshold", "canonical_solution": "\n return all(x < t for x in l)\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 4, 10], 100)\n assert not candidate([1, 20, 4, 10], 5)\n assert candidate([1, 20, 4, 10], 21)\n assert candidate([1, 20, 4, 10], 22)\n assert candidate([1, 8, 4, 10], 11)\n assert not candidate([1, 8, 4, 10], 10)\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n assert type(t) == int, \"invalid inputs\" # $_CONTRACT_$\n assert all(isinstance(x, (int, float, bool)) for x in l), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 4, 10], 100], [[1, 20, 4, 10], 5], [[1, 20, 4, 10], 21], [[1, 20, 4, 10], 22], [[1, 8, 4, 10], 11], [[1, 8, 4, 10], 10]], "atol": 0, "plus_input": [[[0, 0, 0, 0], 1], [[1, 3, 5, 7], 10], [[-1, -2, -3, -4], 0], [[2, 4, 6, 8], 7], [[], 5], [[1, 2, 3, 4], 4], [[-4, -3, -2, -1], -5], [[1, 2, 4, 10], 0], [[1, 4, 7, 10], 6], [[3.5, 2.2, 1.1], 5], [[1, 3, 4], 4], [[1, 4, 7, 10], -2], [[1, 4, -4, 7, 10], 6], [[1, 2, 3, -1, 4], 4], [[1, 3, 5, 7, 5], 10], [[4, -4, 7, 10], 6], [[-4, -3, -2, -1], -1], [[1, 4, 7, 10, 7], 6], [[-4, -3, -2, 4, -4], -1], [[1, 2, 3, -1, 4], 5], [[1, 3, 5, 7], 11], [[0, -1, 0, 0, 0], 0], [[1, 4, 7, 9], 10], [[1, 2, -4, 4], 4], [[true, false], 5], [[-1, -2, -4], 0], [[true, false], 4], [[1, 3, 7, 5], 10], [[1, 2, 3, -1, 4, 4], 4], [[1, 3, 10, 4], 5], [[3, 1, 4, 7, 10, 7], 6], [[1.1, 3.5, 2.2, 1.1], 5], [[-4, -3, 4, -4], -1], [[1, 4, 7, 9, 1], 10], [[1, 4, 7, 10, 7], 5], [[3.5, 2.6445924145352944, 2.2, 1.1], 3], [[0, -1, -2, -4], 0], [[1, 3, 7, 5], -3], [[0, 0, 2, 0, 0], 1], [[-1, -2, -4], -4], [[true, false, false], 3], [[1, 3, 7, 5], -1], [[4, -4, 7, 10], -2], [[1, 4, 7, 9], 6], [[7, -2, -3, -3, -4], 0], [[true, false, false], -4], [[3.5, 2.2, 1.1], -4], [[-4, -3, -2, 4], -1], [[1, 2, 3, 4], 1], [[4, -4, 7, 10], 7], [[0, -1, 0, 0, 0], 8], [[1, 2, 5, 3, 4], 4], [[-1, 8, -2, -4, 8], -2], [[1, 3, 7, 5], 8], [[-1, -2, -4], -5], [[2, 4, 6, 8], 6], [[-3, -2, 4], -1], [[1, 4, 7, 9, 1], 11], [[1, 4, 7, 9, 9], 10], [[-2, -4], -4], [[1, 5, 7], 10], [[4, -4, 7, 10, -4], 7], [[1, 3, 4], 2], [[1, -3, 2, 3, 4], 1], [[6, 4, -4, 7, 10], 7], [[3.5, 2.2, 3.5], 5], [[1, 2, -5, -4, 4], 4], [[1, 3, 7, 5], 9], [[-2, -4], -5], [[1, 4, 7, 10, 7], 4], [[true, false, false], 5], [[1, 3, 7, 11], -3], [[-1, 8, -2, 8], -2], [[1, 0, 2, 0, 0], 2], [[-3, -3, -2, 4], -1], [[3.5, 3.5, 2.2, 3.5, 3.5], 5], [[4, -4, -2, 7, 10], 6], [[1, 0, 2, 0, 0], 3], [[1, 2, 3, -1, 4, 4], 5], [[1, 3, 7, 5, 3], 9], [[1, 8, 7, 5], -3], [[-2, -3, -3, -4], 0], [[-3, -2, 4, 4, -2], 0], [[-1, 1, 2, 3, -1, 4, 4], 4], [[3, 5, 7], 11], [[-4, -3, -2, 4], 0], [[-3, -2, 4], 8], [[false, true, false], 4], [[1, 2, -5, -4, 4], 11], [[-4, -3, -2, 4, -2], 1], [[3, 1, 1, 4, 7, 10, 7], 6], [[true, true, true], 4], [[5.5, 6.2, 7.9, 8.1], 9], [[10, 20, -30, 40, -50], 15], [[100, -200, 300, -400, 500, -600], 100], [[1000, 500, 250, 125, 62.5, 31.25], 2000], [[10000000, 9000000, 8000000, 7000000, 6000000, 2000000], 10000001], [[100, 200, 300, 0.1, 0.2, 0.3], 0], [[], 0], [[10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 10000001], [[2000000, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 10000001], [[], -1], [[10000000, 9000000, 8000001, 8000000, 7000000, 6000000, 2000000], 10000001], [[], 1], [[10, 20, -30, 40, -50], 20], [[1000, 500, 250, 125, 62.5, 31.25], 125], [[100, -200, 300, -400, 500, -600], 1], [[5.5, 6.2, 7.9, 8.1], 500], [[100, 2000000, 300, -400, 500, -600], 100], [[10000000, 9000000, 8000000, 7000000, 6000000, -200, 10000000], 10000001], [[10, 20, -30, 40, -50], 14], [[100, -200, -400, 500, -600], 8000001], [[5.5, 6.2, 7.9, 8.1], 501], [[2000000, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000, 7000000], 10000001], [[5.5, 6.2, 7.9, 8.1], 10], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000000, 8000000], 10000001], [[], 7000000], [[5.5, 6.2, 7.9, 8.1, 6.2], 10], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000], 10000001], [[5.5, 6.2, 7.9, 8.1, 6.2, 6.2], 10], [[62.5, 16.953176162073675, 2.9851560365316985], 1], [[2000000, 8000001, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 10000001], [[100, 2000000, 300, -400, 500, -600], -1], [[10000000, 9000000, 8000000, 7000000, 6000000, -200, 10000000], 10000002], [[0.1, 5.5, 6.2, 7.9, 8.1], 500], [[5.5, 6.2, 7.9, 8.1], 100], [[10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 10000002], [[10000000, 9000000, 8000001, 8000000, 7000000, 6000000, 2000000, 7000000], 125], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000000, 8000000], 10000002], [[100, -200, -400, 500, -600], 8000002], [[5.5, 6.2, 7.9, 8.565673083320917], 10], [[10, 20, -30, 40, -50], 499], [[10, 20, 21, -30, 40, -50], 15], [[100, 2000000, 300, 500, -600], 8000000], [[2000000, 10000000, 9000000, 10, 200, 7000000, 6000000, 2000000], 10000000], [[1000, 500, 250, 125, 62.5, 31.25], 1999], [[5.5, 6.2, 8.565673083320917], 10], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000], 10], [[100, 250, 2000000, 300, -400, 500, -600], 100], [[5.5, 6.2, 7.9, 8.1, 5.6573184258702085, 6.2], 10], [[5.5, 6.2, 7.9, 6.287047990560678, 8.1], 10000000], [[62.5, 16.953176162073675, 2.9851560365316985, 16.953176162073675], 1], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000000, 8000000], 10000003], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000], 10000001], [[10, 20, 1, 40, -50], 15], [[2000000, 8000001, 10000000, 9000000, 10, 8000000, 7000000, 2000000, 6000000, 2000000], 10000001], [[2000000, 8000001, 10000000, 9000000, 10, 8000000, 7000000, 2000000, 6000000, 2000000, 2000000], 10000001], [[], 1000], [[2000000, 8000001, 1000, 10000000, 9000000, 10, 8000000, 2000000, 6000000, 2000000, 2000000], 499], [[10, 20, -30, 40, 499], 14], [[5.5, 7.9, 8.1], 9], [[], -2], [[10, 20, -30, 40, -50], 19], [[100, 250, 2000000, 300, -400, 500, -600], 1999], [[1000, 500, 126, 250, 125, 62.5, 31.25, 31.25, 500], 2000], [[7.468707181862638, 5.5, 6.2, 7.9, 8.565673083320917], 10], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000], -50], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000, 10000001], 10], [[10, 20, -30, 40, -50], 13], [[100, -200, 300, -400, 500], 1], [[5.5, 6.2, 8.565673083320917, 6.2], 10], [[], 1001], [[10000000, 9000000, 8000000, 7000000, 6000000, 2000000], 8000002], [[10, 20, 21, -30, 40, -50], 14], [[100, 200, 300, 0.1, 0.2], 0], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000, 10000001], 0], [[100, 200, 300, 0.1, 0.2], 9000000], [[-200, 10, 20, -30, 40, -50], 8000000], [[10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 100], [[5.5, 6.2, 7.9], 11], [[16.953176162073675, 2.9851560365316985], 1], [[100, -200, 300, -400, 500, 300], 1], [[-200, 300, -400, 500, -600], 100], [[10, 20, -30, 40, -50, 20], 499], [[10, 20, -30, 40, 20, -50], 19], [[5.5, 2.8, 6.2, 8.1], 9], [[0.1, 5.5, 7.9, 8.1], 500], [[100, -200, 300, -400, 500, 499, -600], 1], [[10, 20, 1, 40, 9, -50, -50], 499], [[100, -200, 300, 0, 500, 300], 9], [[2000000, 9000000, 8000000, 6000000, 2000000, 8000000], -51], [[-200, 300, -400, -600, 300], 100], [[5.5, 6.2, 7.9, 8.1, 6.2, 6.2], 8000001], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000, 10000001], 8000001], [[5.5, 2.8, 6.2, 8.1], 7000001], [[-200, 300, 8000000, -400, -600, 300], 100], [[5.5, 6.2, 7.9], 13], [[1000, 500, 250, 125, 6.635714530100879, 62.5, 31.25], 2000000], [[100, 250, 2000000, 300, -400, 500, -600], 1998], [[10000000, 9000000, 1998, 8000000, 7000000, 6000000, 2000000], 100], [[100, 2000000, 300, -400, 500, -600], -2], [[5.5, 6.2, 7.9, 8.1, 5.6573184258702085, 6.2, 7.9], 10], [[1.5, 1000, 500, 250, 125, 6.635714530100879, 62.5, 31.25], 2000000], [[2000000, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 1001, 2000000, 7000000], 10000000], [[10000000, 8000002, 9000000, 8000001, 8000000, 7000000, 6000000, 2000000, 7000000], 125], [[10, 20, 1, 40, 9, -50, -50], 500], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000, 8000000], -199], [[-200, 300, 8000000, -400, -600, 300], 1001], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000, 8000000], 10000001], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000], 200], [[100, -200, 300, -400, 500, 499, -600], 10000001], [[10, 20, 21, 300, -30, 40, -50, 10], 10], [[100, -200, -400, 500, -600], 10], [[9.263975784000001, 5.5, 6.2, 8.565673083320917, 6.2], 10], [[5.5, 2.8, 6.2, 8.1], 10000001], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000], 9999999], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000000, 8000000, 2000000], 10000001], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2], -1], [[5.5, 6.2, 3.18463343128131, 7.9, 8.1, 5.6573184258702085, 6.2], 10], [[100, -400, 499, -600], 8000001], [[8000001, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000], 10000001], [[2000000, 10000000, 9000000, 10, 8000000, 6000000, 2000, 8000000], 7000001], [[10, -400, 20, -30, 40, 499], 40], [[8000001, 9999998, 10000000, 9000000, 10, 9999999, 8000000, 7000000, 6000000, 2000000], 10000001], [[5.5, 2.1549458848411773, 6.2, 7.9], 10], [[5.5, 2.1549458848411773, 6.2, 7.9], 9], [[10000000, 9000000, 8000000, 6000000, -200, 10000000], 10000001], [[10, 20, -30, 40, -50], 12], [[10000000, 9000000, 8000001, 8000000, 7000000, 6000000, 2000000], -200], [[10000000, 9000000, 1998, 8000000, 7000000, 6000000, 2000000, 6000000], 100], [[100, 300, 0.1, 0.2], 9000000], [[5.5, 6.2, 7.9, 5.5], 11], [[1000, 500, 250, 125, 6.635714530100879, 62.5, 31.25], 2000001], [[9, 20, 2000, 40, -50], 499], [[10, 20, 21, -30, 40, -50], 7000001], [[-200, 10, 20, -30, 40, 8000000, -50], 8000000], [[2000000, 8000001, 10000000, 9000000, 10, 8000000, 7000000, 2000000, 6000000, 2000000, 2000000], 10000002], [[100, -200, 0, 500, 300], 9], [[100, -200, 300, -400, 500, -600, 500], 19], [[100, 2000000, 10000002, 500, 8000002], 8000000], [[2000000, 10000000, 9000000, 10, 8000000, 7000000, 6000000, 2000000, 7000000], 10000000], [[5.5, 2.8, 8.1], 7000001], [[], 999], [[-200, 300, 8000000, -400, -600, 300, 300], 125], [[5.5, 6.2, 8.462009039856612, 8.565673083320917], 10], [[2000000, 8000001, 1000, 10000000, 8000001, 10, 8000000, 2000000, 6000000, 2000000, 2000000], 9999998], [[5.5, 6.2, 7.9, 8.1, 8.855464118192813, 5.6573184258702085, 6.2], 10], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000], 10000000], [[8000001, 9999998, 10000000, 9000000, 10, 9999999, 8000000, 7000000, 6000000, 2000000, 9999998], 20], [[10000000, 9000000, 8000001, 8000000, 7000000, 6000001, 2000000, 7000000], 125], [[10, 20, 1000, -30, 40, -50], 15], [[10, 20, -30, 0, 40, -50], 13], [[2000000, 10000000, 9000000, 8000000, 6000001, 2000000, 8000000], -50], [[2000000, 10000000, 10, 200, 7000000, 6000000, 2000000], 10000000], [[100, -200, 300, 9999998, -400, 500, 499, -600], 10000002], [[2000000, 10000000, 9000000, -30, 10, 8000000, 6000000, 2000000, 8000000], -2], [[100, -200, -400, 500], 6000000], [[2000000, 8000001, 10000000, 9000000, 10, 8000000, 7000000, 2000000, 6000000, 10, 2000000, 2000000], 10000001], [[100, -200, -400, 500, -600], 40], [[5.5, 6.2, 7.9, 6.287047990560678, 7.938381848412779, 8.1, 7.9], 10000000], [[10, 6000001, -30, 40, -50], 13], [[5.5, 6.2, 7.9, 8.1], 9999999], [[10, 20, -30, 40, -50, 20], 126], [[10000000, 9000000, 8000001, 8000000, 7000000, 6000000, 2000001], 10000001], [[5.5, 6.2, 7.9, 8.1, 8.855464118192813, 5.6573184258702085, 11.869088428731756, 6.2], 10000001], [[100, 9999999, -400, 19], 8000001], [[8000001, 1000, 9999998, 10000000, 9000000, 10, 9999999, 8000000, 7000000, 6000000, 2000000, 9999998], 20], [[], 2000], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 7999999], 125], [[-200, 10, 20, -30, 40, -50], 9000000], [[-200, 10, -200, 11, -30, 40, -50], 8000000], [[5.5, 2.1549458848411773, 6.2, 7.9], 9999999], [[10, 20, -30, 40, 500, 20], 126], [[10000000, 9000000, 8000000, 7000000, 6000000, 2000000, 6000000], 99], [[2.194922883433771, 6.2, 7.9, 8.1], 9999999], [[true, false, true, false, false, false, true, false, true, false], -1], [[1000, 500, 250, 125, 6.635714530100879, 62.5, 31.25, 31.25], 499], [[2000000, 501, 10000000, 9000000, 8000000, 6000000, 2000000, 8000000, 8000000], 10000001], [[10, 20, 14, 40, -50], 12], [[10, 20, -30, 40, -50, -50], 12], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000, 10000001], 8000002], [[5.5, 6.2, 7.9, 8.1, 6.2, 6.2], 1], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 7999999], 200], [[100, -200, 300, -400, 500], 12], [[0.1], 1001], [[100, -200, 300, -400, 500, 499, -600], 9000000], [[1000, 500, 250, 125, 6.635714530100879, 62.5, 31.25, 31.25, 100], 499], [[2000000, 10000001, 9000000, 8000000, 6000000, 2000000, 8000000], 10000001], [[2000000, 10000002, 8000002], 2000], [[5.5, 6.2, 7.934953681964755, 8.1, 5.6573184258702085, 6.2], 10], [[10, 20, -30, 40, -50, -50], -61], [[2000000, 10000000, 9000000, 8000000, 6000000, 8000000], 9999999], [[100, 2000000, 300, -400, 500], -1], [[10, 20, -30, 40, 499, -30], 14], [[5.5, 2.8, 6.2, 8.1], 2000001], [[100, 2000, -200, 0, 500, 300], 13], [[2000000, 9000000, 8000000, 6000000, 2000001, 8000000], -51], [[100, 9999999, -400], 8000001], [[8000001, 9999998, 9000000, 10, 9999999, 8000000, 7000000, 6000000, 2000000], 10000001], [[100, -200, 300, -400, 500, -600, 300], 1], [[2000000, 9000000, 8000000, 6000000, 2000001, 8000000], -52], [[2000000, 10000000, 200, 7000000, -30, 6000000, 2000000], 10000000], [[5.5, 6.2, 7.9, 8.565673083320917], 13], [[6.2, 7.9, 8.1, 6.2, 6.2], 8000001], [[10000000, 9000000, 10000001, 10, 8000000, 6000000, 2000000, 10000001, 10000000], 10], [[2000000, 10000000, 9000000, 8000000, 6000000, 2000000, 7999999, 2000000], 200], [[10000000, 9000000, 10000001, 9, 8000000, 6000000, 10000001], -400], [[10, 20, 21, 300, -30, 40, 11, 10], 10], [[10, 20, -30, -50, 40], 13], [[5.5, 2.1549458848411773, 6.2, 7.9], -30], [[-200, 300, 8000000, -400, -600, 300, -200], 100], [[10000000, 9000000, 10000001, 2000001, 10, 8000000, 6000000, 2000000], 10], [[5.5, 6.2, 7.9], -1], [[9, 20, 40, -50], 499], [[-200, 300, 8000000, -600, 300], 100], [[100, 9999999, -400, 19], 8000000], [[2.194922883433771, 6.2, 7.9, 8.1], 9999998], [[5.5, 2.194922883433771, 6.2, 8.1], 125], [[100, 1999999, 2000000, 300, 500, -600], 8000000], [[10, 20, -30, 40, -50], 16], [[5], 5], [[10], 5], [[4], 5], [[5, 5, 5], 5], [[1, 2, 3, 4], 5], [[10, 20, 30], 5], [[-5, 10, -3, 1], 0], [[0, 0, 0, 0], 5], [[-5, -4, -3], -6], [[10000000, 9000000, 8000000, 7000000, 6000000, 2000000], 2000], [[10, 20, -30, 40, -50], 6000000], [[100, 200, 300, 0.1, 0.2, 0.3], 6000000], [[10, 20, -30, 40, -50, 20], 6000000], [[10000000, 9000000, 8000000, 2000, 6000000, 2000000], 2000], [[5.5, 6.2, 7.9, 8.1], 300], [[6.2, 7.9, 8.1], 300], [[100, 200, 300, 0.1, 0.2, 0.3], 40], [[5.5, 6.2, 7.9], -200], [[5.5, 6.2, 7.9], 8000000], [[5.5, 6.2, 7.9], 300], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2], 0], [[5.5, 6.2, 7.9, 7.9], 300], [[6.2, 7.9, 7.9], 300], [[10000000, 9000000, 8000000, 2000, 6000000, 2000000], 10000001], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2, 100], 0], [[100, -200, 300, -400, 500, -600], 2000], [[6.2, 7.9], -201], [[1000, 500, 250, 125, 62.5, 30.807804019985152], 2000], [[1000, 0.7, 500, 250, 125, 62.5, 31.25], 2000], [[6.4133956835438735, 7.9], -200], [[10, 20, 15, 40, -50, 20], 6000000], [[7.9, 7.9, 7.9], 1000], [[10, 20, -30, 40, -50, 20], 9], [[100, 200, 300, 0.06967522411157957, 0.2, 0.3, 0.2, 100], 0], [[1000, 500, 250, 125, 62.5, 30.807804019985152], 8000000], [[10, 20, -30, -51, 40, -50, 20], 6000000], [[5.766499924540022, 7.9, 7.9], 300], [[5.5, 6.2, 7.9, 6.2], 300], [[10, 20, -51, 40, -50, 20], 6000000], [[5.5, 6.2, 7.9, 6.2], 301], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2], 40], [[10000000, 9000000, 8000000, 2000, 6000000, 500, 2000000], 2000], [[10, 20, -51, 40, -50, 200, 20], 6000000], [[5.5, 6.2212876393256, 6.2, 7.9, 6.2], 302], [[1000, 500, 250, 125, 62.5, 30.807804019985152, 500], 2001], [[1000, 500, 250, 62.5, 30.807804019985152], 2000], [[5.5, 5.50048632089892, 7.9, 7.9], 300], [[1000, 500, 250, 62.5, 30.807804019985152, 62.5], 2000], [[5.5, 6.2, 8.8519061638015], 300], [[5.5, 5.50048632089892, 7.9], 300], [[5.5, 7.9], -200], [[10000000, 9000000, 8000000, 2000, 6000000, 100, 8000000], 2000], [[5.5, 7.9], -199], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2, 100], 9], [[1000, 500, 250, 62.5, 30.807804019985152], -200], [[500, 250, 62.5, 30.807804019985152], 2000], [[6.576799211228067, 5.5, 5.50048632089892, 6.2212876393256, 7.9, 7.9], 300], [[100, 200, 300, 0.1, 0.2, 0.3], 302], [[6.2, 7.9], 250], [[6.576799211228067, 5.5, 5.50048632089892, 6.2212876393256, 7.9], 300], [[10, 20, -30, 39, 40, -50], 6000000], [[5.5, 7.9], 2001], [[5.871122108907659, 6.2, 7.9, 6.2], 301], [[5.5, 6.2212876393256, 6.2, 7.9, 6.2], -200], [[10, 20, -30, 39, 40, -50], 302], [[1000, 500, 250, 6000000, 62.5, 31.25], 2000], [[10000000, 9000000, 8000000, 2000, 6000000, 2000000], 10000000], [[5.5, 5.50048632089892, 0.5, 7.9, 7.9], 300], [[6.2, 7.9], 299], [[1000, 500, 250, 125, 30.807804019985152, 500], 2001], [[10, 20, -30, -51, 40, -50, 20], -399], [[10000000, 9000000, 8000000, 2000, 6000000, 500, 2000000], 15], [[5.5, 6.6284378542197375, 5.50048632089892, 7.9, 7.9], 300], [[6.990844960737688, 5.5, 6.2, 7.9, 8.1], 300], [[6.2], -201], [[100, 200, 0.1, 0.2, 0.3, 0.2], 0], [[5.5, 6.38359489632532, 8.8519061638015], 300], [[6.2, 7.9, 7.9], 299], [[1.430414675639685, 6.2, 7.9, 0.32055210364227493], 300], [[100, 200, 300, 0.2, 0.3], 1], [[7.9, 7.9, 7.9, 7.9], 1000], [[5.5, 6.878384299672373, 7.9], 15], [[30, 97, 90, -200, 59], 0], [[30, 97, 90, 59], 0], [[5.5, 6.6284378542197375, 5.50048632089892, 7.9, 7.9], 299], [[1000, 500, 250, 125, 62.5, 30.807804019985152], 7999999], [[6.2, 7.9, 6.2], -201], [[1000, 500, 250, 62.5, 62.534685136963134, 30.807804019985152, 62.5], 2000], [[10000000, 9000000, 8000000, 2000, 6000000, 100, 8000000], -50], [[6.110733640513043, 5.5, 6.2], 8000000], [[10, 20, -51, 40, -50, 20, 40], 6000000], [[10, 20, -51, 40, -50, 20, -51], 6000001], [[100, 200, 300, 0.1, 0.2, 0.3, 0.2, 100], 8], [[2.5, 7.9, 7.9, 7.9], 1000], [[1000, 500, 250, 62.5, 30.807804019985152, 62.5], 200], [[-400, 100, -200, 300, -400, 500, -600, -600], 302], [[100, 200, 300, 0.06967522411157957, 0.2, 0.3, 0.2, 100, 0.2], 0], [[10000000, 9000000, 8000000, 2000, 6000000, 100, 8000000], 10000001], [[5.871122108907659, 6.2, 7.9], 301], [[7.9, 7.9, 7.9, 7.9, 7.9], 1000], [[6.576799211228067, 5.5, 1.5311576847949309, 5.50048632089892, 6.2212876393256, 7.9, 7.9], -199], [[3.284373826304595, 1000, 500, 250, 62.5, 30.807804019985152, 500], 2000], [[7.9, 7.9, 7.9, 7.9, -0.28791951724548404, -0.28791951724548404], 1000], [[0.2, 62.5, -63.579573934400166, 0.5, 98.82739614126038, -0.28791951724548404, -50.78504214587984, 58.062454697705476, 55.110190228263775, 10.520189946545017], 0], [[10, 20, -30, 40, -50], 59], [[1000, 500, 250, 62.5, 30.807804019985152, -50.78504214587984, 62.5], 2000], [[10000001, -200, 300, -400, 500, -600], 1999], [[5.5, 6.2], 300], [[10000000, 9000000, 7999999, 2000, 6000000, 2000000], 10000001]], "completion": "\ndef below_threshold(l: list, t: int) -> bool:\n \"\"\"Return True if all numbers in the list l are below threshold t.\"\"\"\n return all(num < t for num in l)\n", "raw_completion": "```python\ndef below_threshold(l: list, t: int) -> bool:\n \"\"\"Return True if all numbers in the list l are below threshold t.\"\"\"\n return all(num < t for num in l)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef below_threshold(l: list, t: int):\n \"\"\"Return True if all numbers in the list l are below threshold t.\n >>> below_threshold([1, 2, 4, 10], 100)\n True\n >>> below_threshold([1, 20, 4, 10], 5)\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/53", "prompt": "\n\ndef add(x: int, y: int):\n \"\"\"Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"\n", "entry_point": "add", "canonical_solution": "\n return x + y\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n import random\n\n assert candidate(0, 1) == 1\n assert candidate(1, 0) == 1\n assert candidate(2, 3) == 5\n assert candidate(5, 7) == 12\n assert candidate(7, 5) == 12\n\n for i in range(100):\n x, y = random.randint(0, 1000), random.randint(0, 1000)\n assert candidate(x, y) == x + y\n\n", "contract": "\n assert isinstance(x, int), \"invalid inputs\" # $_CONTRACT_$\n assert isinstance(y, int), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[0, 1], [1, 0], [2, 3], [5, 7], [7, 5], [480, 593], [139, 579], [300, 77], [569, 756], [911, 703], [197, 326], [123, 102], [671, 705], [101, 721], [735, 413], [923, 369], [938, 221], [59, 772], [540, 790], [244, 6], [705, 148], [890, 180], [342, 129], [946, 559], [623, 593], [825, 294], [124, 732], [333, 987], [269, 347], [826, 822], [157, 479], [534, 184], [418, 549], [855, 765], [666, 55], [428, 315], [704, 645], [183, 272], [966, 528], [571, 697], [610, 541], [249, 665], [452, 186], [421, 529], [860, 376], [172, 601], [30, 177], [35, 753], [818, 902], [618, 175], [165, 302], [405, 836], [574, 555], [152, 343], [882, 225], [670, 359], [480, 476], [265, 822], [390, 904], [570, 503], [660, 18], [457, 319], [724, 18], [469, 235], [91, 322], [91, 789], [361, 945], [272, 952], [567, 768], [264, 478], [57, 615], [301, 553], [191, 93], [125, 119], [528, 936], [314, 7], [270, 420], [25, 435], [876, 389], [502, 653], [519, 807], [345, 523], [473, 231], [746, 105], [18, 434], [659, 191], [855, 65], [843, 872], [997, 59], [420, 134], [950, 85], [223, 50], [473, 244], [994, 169], [287, 494], [528, 830], [492, 739], [483, 198], [228, 863], [345, 405], [878, 86], [841, 854], [950, 134], [550, 501], [371, 167]], "atol": 0, "plus_input": [[-2, 3], [0, 0], [-5, -7], [10, -15], [999, 1], [-10, 10], [10000, -1000], [1, -1], [-5, 10], [-100, -250], [-250, -1], [-1, -2], [-6, -5], [-5, -8], [-15, -15], [-15, -250], [-10, -5], [-10, 1], [-1, -1], [-2, -2], [10000, -15], [10, 10], [-15, -2], [-6, -6], [-6, -8], [10000, -16], [-1000, 10], [-3, -2], [-1000, -251], [0, -1], [-3, -3], [-15, -249], [0, -2], [3, 3], [-5, -5], [10000, 1], [-5, 1], [999, -2], [-10, -250], [3, -251], [-16, -249], [-7, -7], [9, -15], [10000, 10000], [1, -3], [-2, -250], [-1, 9], [1, -999], [0, -15], [-7, -15], [-5, -6], [-1, -250], [10000, 999], [-10, -10], [-1, -249], [-16, -16], [0, -250], [1, -251], [-3, -100], [-10, -249], [-101, -251], [10000, -7], [0, 10000], [-998, 10], [-3, -1000], [-101, -15], [-4, -100], [10001, 10000], [8, -998], [-1000, -249], [-4, 0], [-100, -100], [-101, -8], [-250, -250], [-249, -249], [-15, 1], [-249, -5], [-100, 3], [-5, 3], [-101, 3], [-4, -5], [10, -13], [-1000, 8], [-4, -4], [8, 10000], [-2, 10001], [9, -13], [-4, -2], [-249, -10], [0, 10002], [9, -10], [2, -999], [10001, 10001], [8, -15], [10, 1], [-3, 0], [-13, -15], [-1001, -1000], [-100, -101], [8, -249], [-1000000000000000000000, 1000000000000000000000], [1000000000000000000, 999999999999999999999], [123456789098765432101234567890, 98765432101234567890123456789], [-98765432101234567890123456789, -123456789098765432101234567890], [-10, 5], [-99, -99], [10000, -9999], [-100, 1000], [1000000, -999999], [10000, -10000], [98765432101234567890123456789, 999999999999999999999], [123456789098765432101234567891, 98765432101234567890123456789], [1000000000000000000000, 98765432101234567890123456789], [999998, 999999], [999998, 999998], [-10000, 123456789098765432101234567891], [999998, 1000000000000000000], [1000000000000000000, 999998], [1000000000000000000000, 1000000000000000000000], [98765432101234567890123456789, 999999], [1000000000000000000, -123456789098765432101234567890], [999999999999999999999, 999999999999999999999], [-9999, -9999], [0, 999998], [-9999, -99], [98765432101234567890123456789, 5], [999999999999999999999, -123456789098765432101234567890], [-99, 98765432101234567890123456789], [999999999999999999999, 5], [123456789098765432101234567891, 999999], [1000, 1000], [0, 123456789098765432101234567891], [999999999999999999999, 1000000000000000000000], [1000000000000000000000, 98765432101234567890123456790], [98765432101234567890123456789, -10000], [9999, 123456789098765432101234567891], [-10000, -99], [98765432101234567890123456789, -99], [10000, -123456789098765432101234567890], [999999, 999999], [98765432101234567890123456788, 999999999999999999998], [1000000000000000000, 1000000000000000000], [999999, 1000000000000000000], [98765432101234567890123456790, -10000], [999998, 999997], [999997, 999998], [98765432101234567890123456790, 98765432101234567890123456790], [123456789098765432101234567891, 123456789098765432101234567891], [999999999999999999999, -10000], [98765432101234567890123456788, 1000000000000000000], [0, -99], [1001, 1002], [123456789098765432101234567890, -999998], [1000000000000000000, 1000], [-1000000000000000000000, 1000000], [-123456789098765432101234567890, -123456789098765432101234567890], [1000000, 1000000], [98765432101234567890123456790, 999999999999999999998], [1000000000000000000000, 10000], [999999, 999998], [98765432101234567890123456788, -123456789098765432101234567890], [98765432101234567890123456788, 98765432101234567890123456787], [0, -100], [98765432101234567890123456787, -123456789098765432101234567890], [123456789098765432101234567890, 999998], [123456789098765432101234567890, -999997], [1000000000000000000000, 123456789098765432101234567891], [98765432101234567890123456787, 98765432101234567890123456788], [98765432101234567890123456789, 98765432101234567890123456789], [999999999999999999998, 98765432101234567890123456789], [999998, -9999], [1000000, -1000000], [98765432101234567890123456787, 98765432101234567890123456787], [123456789098765432101234567891, -999998], [1000000000000000000, 999997], [-999999, -98765432101234567890123456789], [-123456789098765432101234567890, -98], [9999, 123456789098765432101234567889], [9998, 98765432101234567890123456787], [9998, -10000], [-9999, -999997], [1000000, -999998], [999997, 999997], [999999, 123456789098765432101234567891], [-999999999999999999999, 1000000000000000000000], [true, true], [999997, 999999], [98765432101234567890123456789, 10000], [98765432101234567890123456790, -9999], [9998, 9998], [-10000, -10000], [5, 5], [-98765432101234567890123456788, 999998], [999998, 98765432101234567890123456789], [10002, 10001], [-10000, 1000000000000000000000], [-999997, 98765432101234567890123456789], [1000, -999997], [98765432101234567890123456791, -9999], [-9999, 10001], [-9999, -10001], [999999999999999999999, 98765432101234567890123456788], [-9999, -98765432101234567890123456789], [-999998, -98], [999997, -9999], [98765432101234567890123456788, 6], [123456789098765432101234567891, -10000], [false, false], [98765432101234567890123456787, 10001], [5, 98765432101234567890123456787], [-999999999999999999998, 1000000000000000000000], [999999999999999999999, 9997], [1000000000000000000001, 1000000000000000000000], [98765432101234567890123456789, -1000000], [1000000000000000000, 999996], [-10000, -123456789098765432101234567890], [-1000000000000000000000, 98765432101234567890123456787], [true, 6], [999999, 98765432101234567890123456787], [-10000, -999998], [98765432101234567890123456788, -999998], [-1000000000000000000000, -1000000000000000000000], [10002, 5], [-98, 123456789098765432101234567891], [10001, 999998], [999997, 1000000], [999999999999999999998, -10001], [-98, 98765432101234567890123456790], [-999999999999999999998, 1000000000000000000001], [1000000, 10001], [1000000000000000000002, 1000000000000000000000], [-1000000000000000000000, 98765432101234567890123456786], [10002, 123456789098765432101234567889], [10003, 123456789098765432101234567889], [7, -999997], [5, 1000], [-98765432101234567890123456788, -98765432101234567890123456788], [98765432101234567890123456789, -999998], [-98, -999999], [-9, -10], [999998, 999996], [-999998, 9999], [-999998, -999999], [-1000000000000000000000, 10002], [-98765432101234567890123456788, -123456789098765432101234567891], [999999999999999999998, -999997], [-9999, -10000], [98765432101234567890123456788, -999999999999999999999], [-98765432101234567890123456789, -99], [-999996, -999996], [999998, -999996], [-9999, -98765432101234567890123456788], [123456789098765432101234567889, 123456789098765432101234567889], [999998, 1002], [-999997, -10000], [-999996, 1000000000000000000], [true, false], [-100, 10000], [98765432101234567890123456786, 98765432101234567890123456789], [123456789098765432101234567890, 999999], [9999, 98765432101234567890123456788], [98765432101234567890123456786, 98765432101234567890123456787], [123456789098765432101234567891, 999997], [98765432101234567890123456788, 98765432101234567890123456789], [999999999999999999998, 0], [98765432101234567890123456790, 123456789098765432101234567891], [98765432101234567890123456786, 98765432101234567890123456788], [123456789098765432101234567891, 123456789098765432101234567890], [123456789098765432101234567892, 123456789098765432101234567891], [123456789098765432101234567890, -100], [-9999, 999999999999999999999], [10001, 9997], [-10000, -999999], [false, true], [1002, 1002], [10002, 98765432101234567890123456787], [-100, -99], [-99, 1000], [1000000000000000000, 5], [-123456789098765432101234567891, 10001], [4, 4], [5, 999999999999999999998], [10002, 10002], [1000001, -10001], [-999998, -999998], [10002, 1000000000000000000], [9998, 1000000000000000000000], [999999999999999999998, 98765432101234567890123456788], [-100, 6], [9999, 9999], [999999999999999999997, 0], [1001, 999998], [98765432101234567890123456790, -98765432101234567890123456788], [-9999, 1000000000000000000001], [98765432101234567890123456787, 10000], [98765432101234567890123456788, 5], [-9999, 999999999999999999998], [98765432101234567890123456787, 4], [-10001, -999999], [123456789098765432101234567891, 98765432101234567890123456788], [98765432101234567890123456786, 98765432101234567890123456786], [98765432101234567890123456788, 98765432101234567890123456788], [10000, 98765432101234567890123456788], [999999999999999999996, 999999999999999999997], [-1000000, 98765432101234567890123456788], [-999997, -1000000], [-10000, 98765432101234567890123456789], [999999999999999999, 1000000000000000000], [-1000000000000000000000, 0], [1000000, 5], [999999999999999999997, 98765432101234567890123456788], [999999999999999999, 999999999999999999], [999999999999999999999, 999999999999999999], [98765432101234567890123456791, 98765432101234567890123456790], [-98765432101234567890123456788, 999999999999999999999], [98765432101234567890123456791, 999999999999999999999], [123456789098765432101234567892, 123456789098765432101234567890], [-999999999999999999998, -123456789098765432101234567891], [-9999, 999999999999999999997], [-999999999999999999999, 98765432101234567890123456788], [98765432101234567890123456790, -100], [-999998, -9999], [1000000000000000000, -10], [98765432101234567890123456790, 5], [1000, 98765432101234567890123456788], [-98765432101234567890123456788, 98765432101234567890123456791], [-123456789098765432101234567891, 9999], [-123456789098765432101234567891, 10003], [123456789098765432101234567890, 1000000], [999998, 1001], [1, 0], [1000000000000000000, -98765432101234567890123456788], [10003, 10001], [0, -999999999999999999999], [999999999999999999, 123456789098765432101234567892], [98765432101234567890123456789, -999999999999999999998], [98765432101234567890123456789, 98765432101234567890123456788], [999999999999999999998, 999999999999999999998], [-1000000000000000000000, 10003], [-123456789098765432101234567891, 98765432101234567890123456790], [123456789098765432101234567890, 98765432101234567890123456788], [-99, -98], [4, 98765432101234567890123456787], [-1000000, -999999], [999997, 1000000000000000000001], [9998, 123456789098765432101234567893], [10003, 5], [9999, 98765432101234567890123456787], [123456789098765432101234567890, 123456789098765432101234567891], [999999999999999999999, 98765432101234567890123456790], [-98765432101234567890123456788, -9], [true, 7], [-97, -98], [98765432101234567890123456786, 98765432101234567890123456785], [98765432101234567890123456789, 1000000000000000000001], [98765432101234567890123456790, -98765432101234567890123456789], [1001, -999996], [-99, -10], [-999999, -999999], [98765432101234567890123456787, -999997], [999997, -999999999999999999999], [98765432101234567890123456791, 4], [123456789098765432101234567891, 98765432101234567890123456786], [3, 4], [-123456789098765432101234567891, -123456789098765432101234567891], [98765432101234567890123456790, -1000000], [-97, 10001], [1000000000000000000, -10000], [6, 1000000000000000000], [999999999999999999998, -98765432101234567890123456788], [123456789098765432101234567893, 123456789098765432101234567893], [-999997, -999996], [999999999999999999999, 999999999999999999998], [98765432101234567890123456790, -999999], [999997, 1001], [123456789098765432101234567891, 4], [-1000001, -999998], [999999999999999999999, -999999999999999999998], [-10001, -9999], [1000001, 1000001], [10001, 10002], [98765432101234567890123456790, 1000000000000000000002], [98765432101234567890123456790, 123456789098765432101234567892], [-999997, 98765432101234567890123456788], [1000001, 123456789098765432101234567893], [1002, -9999], [999996, 999997], [98765432101234567890123456791, 123456789098765432101234567891], [98765432101234567890123456790, 98765432101234567890123456785], [98765432101234567890123456791, -1000000], [9997, -999999], [-98765432101234567890123456789, 10001], [-999996, 98765432101234567890123456789], [-123456789098765432101234567891, 98765432101234567890123456791], [0, 999999999999999999997], [98765432101234567890123456787, 999999999999999999999], [-999999999999999999997, -999999999999999999998], [123456789098765432101234567891, 98765432101234567890123456787], [-1000002, -999999], [-123456789098765432101234567892, 98765432101234567890123456791], [1000000000000000000002, 999999999999999999998], [-999999999999999999999, -999999999999999999999], [-98, 1000000000000000000], [98765432101234567890123456791, -1000001], [-98, 1000001], [999999999999999999998, -999999], [98765432101234567890123456788, 999998], [1000000, 1000000000000000000002], [1000, 123456789098765432101234567891], [1000, 1001], [-999997, 98765432101234567890123456785], [-10001, -1000002], [999999999999999999998, 1000001], [-9, 10000], [-999999, -1000002], [0, 999999999999999999999], [98765432101234567890123456788, 98765432101234567890123456791], [1000000000000000000003, 999999], [9998, 98765432101234567890123456786], [123456789098765432101234567892, 1000000000000000000003], [-123456789098765432101234567890, 98765432101234567890123456785], [-97, -99], [-99, -100], [-1000000000000000000000, -999999999999999999999], [123456789098765432101234567890, 1], [10002, 123456789098765432101234567890], [10002, 10003], [999999999999999999996, 999998], [999999999999999999998, 999999999999999999999], [9997, 9997], [999995, 999996], [1000001, 98765432101234567890123456789], [-1000001, -1000002], [-1000000000000000000000, 10001], [-98, -999998], [-10000, 999999999999999999999], [999999, -999999999999999999999], [-999999999999999999997, 1000000000000000000000], [-9999, 98765432101234567890123456787], [1000002, 1000001], [3, 1000000000000000000002], [123456789098765432101234567889, 98765432101234567890123456789], [1000000000000000000003, -999999], [123456789098765432101234567891, 1000000000000000000002], [10003, 10003], [1000000000000000000003, 1000000000000000000000], [999999999999999999998, -1], [-98765432101234567890123456789, 123456789098765432101234567890], [1000, -100], [-999999, 1000000000000000000], [98765432101234567890123456792, -9999], [123456789098765432101234567892, -10001], [-1000000, 98765432101234567890123456789], [123456789098765432101234567893, -97], [1000000000000000000002, -99], [1000000000000000000002, 98765432101234567890123456791], [1000000000000000000002, 1000000000000000000002], [-10000, -9999], [7, -999999999999999999997], [123456789098765432101234567893, 10000], [5, -999999999999999999998], [98765432101234567890123456789, 98765432101234567890123456790], [1000002, -999999999999999999999], [999999999999999999999, -999996], [1000000, 1001], [-999999999999999999998, -999999999999999999997], [true, -999998], [-10, 1000000000000000000002], [999996, 1000000000000000000000], [123456789098765432101234567894, -97], [-999999999999999999997, -999999999999999999997], [-9999, -97], [-98765432101234567890123456789, 10000], [98765432101234567890123456785, 98765432101234567890123456786], [10003, 10002], [10001, 999999], [98765432101234567890123456788, -1000000000000000000000], [1002, 0], [-1000000000000000000000, -1000002], [1000001, 1000000], [-98, -99], [-1, 1], [2147483647, 1], [-2147483648, -1], [-5, 7], [-68, -577], [0, -10], [-1000000, 0], [-9, -999999], [1000000000000000000, -999999], [98765432101234567890123456791, -999999], [-98765432101234567890123456789, 0], [123456789098765432101234567890, 5], [-123456789098765432101234567890, 9999], [999999999999999999999, -999998], [1, 1], [98765432101234567890123456791, 98765432101234567890123456791], [-999999, 1000000000000000000000], [-2, 0], [-10, -9], [123456789098765432101234567890, -999999], [-1000000000000000000000, -1000000000000000000001], [-8, -10], [-999998, -97], [-999999, -9999], [-999999, -9], [-97, -999998], [-9998, -9999], [-9, 1000000000000000000], [-8, -8], [-1000000000000000000000, 98765432101234567890123456790], [1000000000000000000000, -1000000000000000000000], [-999998, 1000000000000000000000], [-2, -1000000000000000000000], [123456789098765432101234567890, 99], [-1000000000000000000001, -1000000000000000000000], [99, 2], [0, 1], [-9999, -2], [-97, -1000000], [-98, -97], [5, 0], [1, -9999], [-999998, -9], [10000, -1000000000000000000001], [-98765432101234567890123456789, -100], [98765432101234567890123456791, -1], [0, -123456789098765432101234567890], [10000, -1000000], [-9, 9999], [-9998, 1000], [-99, -1], [10000, -999999], [-9, -9], [1000000000000000000000, 5], [-97, -97], [-1000000000000000000000, -9], [-123456789098765432101234567890, 10000], [-2, -1000000], [-123456789098765432101234567890, -100], [-99, -2], [-999998, 999999999999999999999], [1000000000000000000000, -9999], [-1000000, 98765432101234567890123456791], [-9999, -9998], [-2, -999999], [9999, -1000000000000000000000], [5, -1000000], [-9998, -999999999999999999999], [1000, 9999], [-999999, 999999999999999999999], [0, -999999999999999999998], [-999999, -1000000000000000000000], [98765432101234567890123456789, -8], [2, -8], [99, -98765432101234567890123456788], [99, -1000000], [98765432101234567890123456790, 1000000000000000000000], [1000000, -100], [-999998, -10], [999999999999999999999, -999997], [1000001, -97], [1, -99], [98765432101234567890123456790, -97], [66, -1000000000000000000000], [-99, 1000000], [-10, 9999], [2, 1], [-2, -10], [-8, -9999], [-1000000, -1000000], [-999999999999999999999, 1], [1000001, -999998], [5, -100], [66, 98765432101234567890123456790], [98765432101234567890123456789, 4], [4, 5], [-101, 1000], [-11, -10], [5, 1000000], [1000000000000000000000, 1000000000000000000], [9999, 999999999999999999998], [-9999, -8], [-98, -98], [-98765432101234567890123456789, 2], [-1000000, -9999], [-99, 0], [-9, -11], [1000000000000000000000, 1000000000000000001], [4, -1000000000000000000000], [9998, 9999], [-98765432101234567890123456789, 66], [-10, -97], [99, 99], [0, 9998], [-99, -123456789098765432101234567890], [-103, 1000], [9999, 1000000000000000000001], [-9999, -123456789098765432101234567890], [-999999999999999999999, -99], [-8, -123456789098765432101234567889], [-2, 1], [-123456789098765432101234567890, -99], [-1000000000000000000001, -98765432101234567890123456789], [-999999, -11], [-101, -9], [-10, -98765432101234567890123456788], [-100, -1], [1000000000000000000, -9], [1000001, -2], [-11, -999999999999999999998], [1000000000000000000000, 4], [-999996, -999995], [-98, -9], [9999, -10], [-1, 0], [-98765432101234567890123456789, -98765432101234567890123456789], [99, -99], [-999997, -10], [-10, -999999999999999999999], [1000000000000000001, -11], [1000000000000000000, -999997], [2, 98765432101234567890123456789], [-999999, -10000], [-999997, 1000001], [-2, -102], [1000001, -98], [-99, 1], [66, 2], [-98, -1000000], [-97, -999997], [-1000000, -10000], [1000000000000000001, -99], [-8, 1000000000000000001], [2, 2], [1000001, -11], [-99, 1000000000000000001], [-1000000000000000000001, -1000000000000000000001], [-9997, 1000], [69, 70], [98765432101234567890123456791, -100], [98765432101234567890123456790, -9], [-97, -999999999999999999999], [999999999999999999998, 2], [-9, -98765432101234567890123456788], [-999999, 999999999999999999], [-2, -103], [-1000000, 1000000000000000000000], [1000000000000000000, -999996], [4, -98], [67, 98765432101234567890123456790], [-999999999999999999999, -1000000000000000000001], [10000, 9999], [999999999999999999998, -100], [98765432101234567890123456790, 9998], [71, 71], [99, -9999], [-999999, -10], [-98765432101234567890123456790, -123456789098765432101234567890], [-10, 98765432101234567890123456791], [-1000000, 999999999999999999999], [1, -999999], [98765432101234567890123456791, 6], [-100, 999999999999999999998], [2, 4], [-96, -97], [-999997, -98], [-100, -123456789098765432101234567890], [99, 98], [70, -999999], [999999, -100], [-123456789098765432101234567891, 999999999999999999998], [-123456789098765432101234567890, -101], [-11, -2], [-98, -96], [-1, -101], [-9997, -1000000], [99, -10000], [1000000000000000000, -1000000000000000000000], [-999999, -1000000], [-123456789098765432101234567889, -2], [69, 1000000000000000000000], [-101, -101], [-98765432101234567890123456789, -97], [999999999999999999, 98765432101234567890123456789], [10000, 999999999999999999], [-103, -103], [-101, -999999999999999999999], [98765432101234567890123456790, -1000000000000000000000], [1000000, -999997], [66, 66], [-123456789098765432101234567890, 1000000000000000000], [98765432101234567890123456790, 0], [-1000000000000000000001, -999999], [-999998, -8], [6, -123456789098765432101234567891], [1000000000000000000000, 69], [67, 98765432101234567890123456789], [67, -99], [999999999999999999998, -123456789098765432101234567891], [-98765432101234567890123456790, 1000000000000000000], [-2, 4], [1, 98765432101234567890123456790], [-99, 9999], [-98765432101234567890123456790, -9999], [123456789098765432101234567890, -1000000000000000000000], [-999999999999999999998, -999999999999999999999], [-102, 1000000000000000000000], [-98765432101234567890123456788, -999998], [66, 1000000000000000000], [99, 10000], [-100, 9998], [1000000000000000000000, -1000000000000000000001], [1000000, 999999999999999999999], [100, -999999], [-9998, 999], [-9996, -10], [6, 1], [999999999999999999998, -8], [-98765432101234567890123456789, 98765432101234567890123456789], [9998, 999999999999999999998], [5, -9996], [4, 999999999999999999], [-8, -999998], [-11, -999996], [-10, -2], [-999999999999999999998, -10], [5, -3], [-10, -100], [-999999999999999999997, -999999999999999999999], [1000, -9], [-9997, -9998], [-10001, 70], [0, -98765432101234567890123456789], [-2, -1], [-999999999999999999998, -9999], [69, 69], [69, 99], [98765432101234567890123456789, -999999], [6, -1000000000000000000001], [2, -2], [-8, -3], [-99, -9999], [1, -2], [-98765432101234567890123456790, -98765432101234567890123456790], [9999, -11], [70, 70], [70, 999], [1000000, 0], [-98765432101234567890123456790, 1000001], [-1000000, -999998], [-100, 66], [1000000000000000000, -12], [-9998, -9997], [98, 98], [-999998, 99], [-99, -1000000000000000000000], [99, 10001], [4, 1000], [-999999, -999999999999999999999], [999999999999999999999, -1], [97, 1], [-98765432101234567890123456791, 5], [-10002, 5], [-1000000000000000000001, -97], [1000, 5], [-123456789098765432101234567891, -123456789098765432101234567890], [-9999, 1000000000000000000000], [999999999999999999998, 3], [-9998, -9998], [-1000000000000000000001, 1], [-10000, -9], [97, 96], [-98765432101234567890123456788, 2], [2, 97], [98765432101234567890123456791, 1000000], [1000000000000000000000, 1000001], [1000001, -123456789098765432101234567889], [6, 6], [-1000000000000000000000, -101], [-999995, -999995], [-1000000, 999999999999999999], [-123456789098765432101234567891, -999999999999999999999], [-1000000, 123456789098765432101234567890], [-98765432101234567890123456790, -9], [-100, 1], [-96, 70], [-999995, -98765432101234567890123456790], [1000000000000000001, 1000000000000000001], [-999997, -8], [1, -999999999999999999999], [1, -9], [67, 67], [-3, 1000001], [69, 98], [1000000000000000001, -98765432101234567890123456788], [-98765432101234567890123456790, 0], [-999998, 1000], [-96, -999998], [-1000000000000000000002, -1000000000000000000002], [-1000000000000000000001, -9999], [-999999999999999999999, 97], [-999999999999999999999, -9997], [-1000000, -1000001], [-100, 96], [66, -9996], [-999997, 9999], [-9, -123456789098765432101234567890], [99, -10001], [-123456789098765432101234567889, -100], [5, -123456789098765432101234567890], [-8, -98765432101234567890123456788], [-11, -9], [-123456789098765432101234567891, -98765432101234567890123456789], [-9, -98], [-10001, 1000], [-999998, -1000000000000000000002], [999999999999999999998, -10], [-999999, -1], [-123456789098765432101234567891, 96], [-2, 98765432101234567890123456790], [-12, -12], [-8, 1000000000000000000000], [-100, -9999], [97, -10], [66, 98765432101234567890123456789], [-100, -9997], [-2, -98765432101234567890123456788], [9998, -98], [-999999999999999999999, 100], [-1000000, -1000000000000000000000], [2, -999997], [98765432101234567890123456791, -1000000000000000000001], [-9996, -1000001], [3, -101], [-123456789098765432101234567890, 1000], [123456789098765432101234567890, 98765432101234567890123456790], [-11, 2], [-10001, -10000], [-999999999999999999999, -999995], [-1000000, -101], [99, -9998], [-11, -11], [-103, -123456789098765432101234567890], [999999999999999999998, -1000000], [-9997, -98765432101234567890123456791], [98765432101234567890123456789, -98], [-98765432101234567890123456791, 69], [4, -999996], [-99, 999999999999999999998], [-123456789098765432101234567890, 5], [99, 100], [-99, -9996], [998, -10002], [-123456789098765432101234567889, 999999999999999999999], [98765432101234567890123456791, 1000000000000000000000], [98765432101234567890123456790, 98765432101234567890123456791], [-999999, 98765432101234567890123456791], [9998, -100], [4, 2], [-98765432101234567890123456791, -98765432101234567890123456791], [97, -999999], [999999999999999998, 999999999999999998], [999, -1000000], [999999, -999999999999999999998], [98765432101234567890123456791, -98765432101234567890123456788]], "completion": "\ndef add(x: int, y: int) -> int:\n \"\"\"\n Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"\n return x + y\n", "raw_completion": "```python\ndef add(x: int, y: int) -> int:\n \"\"\"\n Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"\n return x + y\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef add(x: int, y: int):\n \"\"\"Add two numbers x and y\n >>> add(2, 3)\n 5\n >>> add(5, 7)\n 12\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/54", "prompt": "\n\ndef same_chars(s0: str, s1: str):\n \"\"\"\n Check if two words have the same characters.\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')\n True\n >>> same_chars('abcd', 'dddddddabc')\n True\n >>> same_chars('dddddddabc', 'abcd')\n True\n >>> same_chars('eabcd', 'dddddddabc')\n False\n >>> same_chars('abcd', 'dddddddabce')\n False\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')\n False\n \"\"\"\n", "entry_point": "same_chars", "canonical_solution": "\n return set(s0) == set(s1)\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate('eabcdzzzz', 'dddzzzzzzzddeddabc') == True\n assert candidate('abcd', 'dddddddabc') == True\n assert candidate('dddddddabc', 'abcd') == True\n assert candidate('eabcd', 'dddddddabc') == False\n assert candidate('abcd', 'dddddddabcf') == False\n assert candidate('eabcdzzzz', 'dddzzzzzzzddddabc') == False\n assert candidate('aabb', 'aaccc') == False\n\n", "contract": "\n assert type(s0) == type(s1) == str, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["eabcdzzzz", "dddzzzzzzzddeddabc"], ["abcd", "dddddddabc"], ["dddddddabc", "abcd"], ["eabcd", "dddddddabc"], ["abcd", "dddddddabcf"], ["eabcdzzzz", "dddzzzzzzzddddabc"], ["aabb", "aaccc"]], "atol": 0, "plus_input": [["ab", "cd"], ["abcd", "cbad"], ["aaa", "aaa"], ["abc", "def"], ["aaabbbccc", "abbabcbc"], ["abcdefg", "gfedcba"], ["abbcccddddeeeee", "abcde"], ["12345", "54321"], ["hello", "world"], ["", ""], ["524321", "5432"], ["cdcd", ""], ["aaabbbccc", "abbbabcbc"], ["abbabcbc", "abc"], ["123445", "54321"], ["hoelldefo", "helldefo"], ["aaabbbccc", "world"], ["adbbcccddddeeeeehelldefo", "abcde"], ["abcde", "abcde"], ["abecde", "abecde"], ["5432cababecdead", "cababecdead"], ["5432cababecdead", "5432cababecdead"], ["5432caaaababecdead", "5432cababecdead"], ["ab54321fg", "gfedcba"], ["aaa1234a5bbbccc", "aaa1234a5bbbccc"], ["123445", "514321"], ["5432caaaabacababecdeadbecdead", "5432cababecdead"], ["ab", "cbad"], ["abcdegfedcba", "abcdegfedcba"], ["5432", "cdcd5432"], ["543543221", "abcdeadbbcccddddeeeeehelldefogfedcba"], ["5432caaaabacaabcd", "abcd"], ["abbcccddddeeeee", ""], ["123445", "5143241"], ["5432caaaabacaababbcccddddeeeeecd", "abcd"], ["llo", "helleo"], ["123445", ""], ["abcdcb5143241a514321de", "abcdcbadcbade"], ["abcd", "aabcdbcd"], ["abcdegfedcba", "aabcdegfedcba"], ["abcdeadbbcccddddeeeeehelldefogfedcba", "54321"], ["abcdeadbbcccddddeeeeehelabdcba", "54321"], ["cdcd", "ccd5143241cd"], ["aab", "cd"], ["aabcdefgb", "12345"], ["abbbabcbc", "1234545"], ["5432", "abcdegfedcba"], ["aabcdefgb", "aaa"], ["abcc", "def"], ["54342", "5432"], ["5432caaaabacababecdeadbecdead", "5432cababecdaabcdefgbead"], ["llohelldefo", "llo"], ["abcdcb5143241a514321db", "cd"], ["5432caaaabacaababbcccddddeeeeecd", "abcabcdcb5143241a514321db"], ["5432", "cababecdead"], ["abbhelleoc", "abbhelleoc"], ["cdcd", "cdcd"], ["aab", "123"], ["5432caaaabacaababbcccddddeeeeecd", "cabcd"], ["abcdcbadcbade", "aabcdefgb"], ["5432caaaababecdead", "aabcdbcd"], ["aaa", "aaaa"], ["abcdegfedcba", "5432"], ["5432caaaabacaababbcccddddeeeeecd", "abbabcbc"], ["abcdeadbbcccabcdeadbbcccddddeeeeehelabdcbaa", "abcdeadbbcccddddeeeeehelldefogfedcba"], ["aabcdcbadcbade", "aabcdefgb"], ["llaaa1234a5bbbccco", "llo"], ["aaabbbccc", "a5432caaaabacababecdeadbecdeadbabcbc"], ["abcdcb5143241a514321de", "abcdeadbbcccddddeeeeehelabdcbabecde"], ["abde", "abcde"], ["54321", "helldefo"], ["5432caaaababecdead", "5432c3ababecdead"], ["abcdcb5143241a514321de", "54321"], ["123454", "1234545"], ["cabbhelleoc", "ableoc"], ["aabcdefgbcdeadbbcccabcdeadbbcccddddee5432caaaabacaabcdehelabdcbaa", "abcdeadbbcccabcdeadbbcccddddeeeeehelabdcbaa"], ["abbbcabcbc", "1234545"], ["abc", "abc"], ["54321", "abcdeadbbcccddddeeeeehefogfedcba"], ["5432caaaabacaabcd", "cabcd"], ["cabeoc", "cabbhelldefeoc"], ["5432caaaabacaababbcccddddeeeeecd", "cabc"], ["abaabde", "a5432caaaabacababecdeadbecdeadbabcbc"], ["hlello", "hlello"], ["5432caaaabacababecdeaadbecdead", "5432cababecdead"], ["abbbabcbc54321", "abbbabcbc"], ["5432cabecdead", "5432cababecdead"], ["123abde45", "54321"], ["5c432cababecdea", "5c4aabcdcbadcbade32cababecdead"], ["abcabcdcb514324aaa1a514321db", "abcabcdcb5143241a514321db"], ["5432caaaabacaababhoelldefobcccddddeeeeecd", "abbaabbbabcbcbcbc"], ["544cbaaaa1234a5bbbcccd32", "544cbad32"], ["abcdcbadcbade", "abbc"], ["aaabbbccdcd5432cc", "abbabcbc"], ["aabcdbcd", "hlello"], ["cd", "abcd"], ["abbbabcbc", "1234123445545"], ["abcdeadbbcccddddeeeeehelldefogfedcba", "abbhelleoc"], ["babbabcbc", "5432"], ["abcdeadbbcccaebcdeadbbcccddddeeeeehelabdcbaaa", "aabcdefgbcdeadbbcccabcdeadbbcccddddee5432caaaabacaabcdehelabdcbaa"], ["aaaaaeeeiou", "iaueoaiueiiaaa"], ["abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "ezzzezezezezezezeeeezezezezezezezeeee"], ["Hello, World!", "lohedrWl!o ,"], ["The quick brown fox jumps over the lazy dog", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["1234567890", "0987654321"], ["tacocat", "cattaco"], ["may the force be with you", "The Force Is Strong With You"], ["abcdefghijklmnopqrstuvwxyz", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["gazelle!", "The Force Is Strong With You"], ["beabcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["tacocspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat", "tacocspecterat"], ["gazelle!", "The Force Is Sthrong With You"], ["Amaze", "The hquick brown fox jumps over the lazy dog"], ["0987654321", "0987654321"], ["you", "cattaco"], ["1234567890", "abcdefghijklmnopqrstuvwxyz"], ["foStrongrce", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["may", "0987654321"], ["The quick brown fox jumps over the lazy dog", "Tbrown fox jumps over the lazy dog"], ["gaz!elle!", "gazelle!"], ["may", "of"], ["Sthrong", "0987654321"], ["12345lohedrWl!o ,67890", "abcdefghijklmnopqrstuvwxyz"], ["0987654321", "foStrongrce"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!", "abcdefghijklmnopqrstuvwxyz"], ["abcdefghijknopqrstuvwxyz", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["tacocat", "cattlohedrWl!oco"], ["12345lohedrWl!o ,67890", "12345lohedrWl!o ,67890"], ["12345lohedrWl!o", "The Force Is Strong With You"], ["tacocspeGod!e", "tacocspeGod!e"], ["specter", "habcddogefghijklmnopqrstuvwxyz"], ["specterSthrong", "0987654The quick brown fox jumps over the lazy dog21"], ["The quick brown fox jumps over the lazy dog", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "cattaco"], ["you", "abcdefghijklmnopqrstuvwxyz"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["wSthrongith", "cat"], ["may the force be wiaueoaiueiiaaaith you", "The Force Is Strong With You"], ["gaze!", "gaze!"], ["The quick brown fox jumps over the lazy dog", "Tbrown fox jumps ovenr the lazy dog"], ["gaze!", "tacocspecteThe Force Is Sthrong With Yourat"], ["may the force be with", "The Force Is Strong With You"], ["caattacco", "caattaco"], ["mayy", "jumps"], ["1234567890", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["tacocspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat", "tacocspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat"], ["mayy", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["dazzling", "abcdefghijklmnopqrstuvwxyz"], ["0987654321", "ovenr098765432gazelle!"], ["Amaze", "Amaze"], ["with", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["cattlohedrWl!gaze!oco", "cattlohedrWl!oco"], ["abcdefghijknopqrstuv0987654321wxyz", "abcgorgeous,defghijknopqrstuv0987654321wxyz"], ["abcdefghijklmnoprqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["12345678gorgeous,90", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["The Force Is Sttrong With You", "The Force Is Strong With You"], ["1234567890", "abcdefghijklmnopqrstuvyz"], ["1234567890", "1234567890"], ["ovenr098765432gazelle!", "ovenr098765432gazelle!"], ["09876543221", "0987654321"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["tacocspecterat", "tacocspecterat"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeeZeZeZeZeZeZeZeZeZeZe", "cattaco"], ["force", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["Amaze", "0987654The quick brown fox jumps over the lazy dog21"], ["m", "of"], ["foStrongrce", "you"], ["Tbrown fox jumps ovenr the lazy dog", "abcdefghijklmnopqrstuvwxyz"], ["cattlohedrWl!gaze!oco", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaaa"], ["12345lohedrWl!o ,678090", "12345lohedrWl!o ,67890"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdefghijklmnopqrrstuvwxyz"], ["Hello,", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["abcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "gaze!"], ["The Force Is Sttrong With You", "The Force Is Sttrong With You"], ["mayy", "jpumps"], ["12345lohedr!Wl!o ,678090", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["12345lohedrWl!o", "The Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz"], ["sltunning,", "sltunning,"], ["ZYXWVUTSMRQPONMLKJIHGFEDCBA", "abcdefghijknopqrstuvwxyz"], ["with", "The Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["sltunning,", "sltnning,"], ["abcdefghuijknopqrstuvwxyz", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["aaaaaeeeiou", "aaaaaeeeiou"], ["taocat", "tacocat"], ["iaueoaiueiiaaa", "The quick brown fox jumps ove the lazy dog"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!", "God! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!"], ["122345678990", "12345678990"], ["bewitching,", "0987654321"], ["Tbrown fox jumps ovenr the lazy dog", "dog21"], ["throng", "0987654321"], ["catttaco", "The Forceabcgorgeous,defghijknopqrstuv0987654321wxyz Is Strongabcdefghijknoxyz With You"], ["tacocat", "tacocat"], ["12345cat678990", "12345678990"], ["dog21", "dog21"], ["catttaco", "tacocspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat"], ["ZYXWVUTSMRQPONMLKJIGHGFEDCBA", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["caattaco", "12345lostunning,hedrWl!o ,67890"], ["Tbrown fox jumps over the lazy dog", "Tbrown fox jumps over the lazy dog"], ["dog", "abcdefghijklmnopqrstuvwxyz"], ["", "the"], ["ZYXWVUTSMRQPONMLKJIHGFEDCBA", "ZYXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxyzCBA"], ["12o345lohedrWl!o", "The Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["mayyy", "jumps"], ["ttolohedrWl!oco", "ttlohedrWl!oco"], ["taoocat", "tacocat"], ["m", "0987654The quick brown fox jumps over the lazy dog21"], ["abcdefghijklmnoprqrstuvwxyz", "tacocspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat"], ["Sttrong", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["The quick brown fox jumps over the lazy dog", "Tbrown fox jumps over the lazyx dog"], ["sltnning,", "sltunni"], ["foxdazzling", "abcdefghijklmnouvwxyz"], ["tacocspecterat", "tacocspeabcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz"], ["gazelle!", "gazellze!"], ["12345You678990", "122345678990"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["cat", "ezzzezezezezezezeeeezezezezezezezeeee"], ["mayy", "God! Amaze a stunning, g orgeous, bewitching, and dazzling specter of my gtdear gazelle!"], ["Tbrown fox jumgps over the lazy dogcattlohedrWl!oco", "tacocat"], ["The hquick brown fox jumps over the lazy dog", "The hquick brown fox jumps over the lazy dog"], ["12345lohedrWl!o ,67890", "abcdefghijklmnuvwxyz"], ["forrce", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["God!", "God!"], ["ZYXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxytacocatA", "ZYXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxyzCBA"], ["cattlohedrWl!gaze!oco", "Sttrong"], ["e quick brown fox jum0987654321azy dog", "The quick brown fox jumps over the lazy dog"], ["mayy", "mayy"], ["tacocspecterat", "The Force Is Strong With You"], ["The quick brown fox jumps ovve the lazy dog", "The quick brown fox jumps ove the lazy dog"], ["may the force hbe with you", "The Force Is Strong Wth You"], ["The Force Is Stronfoxg With You", "The Force Is Strong With You"], ["foStrongrce", "theyou"], ["of", "The"], ["thrtong", "abcdefghijklmnopqrrstuvwxyz"], ["dog121", "dog21"], ["cattlohedrWl!gaze!oco", "cattlohedrWl!oo"], ["abcdefghijknopqrstuv0987654321wxyz", "dog121"], ["foStrGod! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!ongrce", "theyou"], ["caattaco", "123o45lostunning9,hedrWl!o ,67890"], ["1234r5Hello,lohedrWl!o ,678090", "1234r5lohedrWl!o ,678090"], ["aaaaaeeeiou", "Sthrong"], ["may", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["The quick brown fox jumps ovve the lazy dog", "The quick brown fox jumps ovve the lazy dog"], ["abcdefghiGod! Amaze a stunning, abcdefghijklmnoprqrstuvwxyzgorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz"], ["tacocspecteratabcdefghijklmnoprqrstuvwxyz4321", "0987654321"], ["Ztacocspecteratabcdefghijklmnoprqrstuvwxyz4321YXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxyzCBA", "God!"], ["foStron1234r5Hello,lohedrW12345lohedr!Wl!o ,678090l!ogrce", "foStrongrce"], ["gorgeous,!", "oStrongre"], ["orgeous,", "The quick brown fox jumps over the lazy dog"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["09876543221", "tacocspecterat"], ["0987654The quick brown fox jumps over the lazy dog21", "of"], ["cat", "abcdefghijklmnopqrstuvwxyz"], ["gazelle!", "abcdefghijklmnopqrstuvwxyz"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!", "abcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz"], ["mayyy", "12o345lohedrWl!o"], ["abcdfefghiGod!", "abcdfefghiGod!"], ["specter", "force"], ["The hqudazThebStrongabcdefghijknoxyzrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do"], ["12345567890", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["cattlohedrWl!oco", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["The quick brown fox jumps ovve the lazy dog", "cat"], ["habcddogefghijklmnopqrstuvwxyz", "Hello, World!"], ["ZYXWVUTSMRQPONMLKjumpsCBA", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["specterSthrong", "Strongabcdefghijknopqrstuvwxyz"], ["ovenr", "12345lohedrWl!o ,67890"], ["tacocspecteThe Force Is Sthrong With Yourat", "tacocspecteThe Force Is Sthrong With Yourat"], ["123645567890", "12345567890"], ["foxdazzling", "The Force Is Strong With Yuou"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["taoocafoStron1234r5Hello,lohedrW12345lohedr!Wl!o ,678090l!ogrcet", "tacocat"], ["abofcdefghijklmnopqrstuvwxyz", "World!"], ["12345lohedr!Wl!forceo", "The Force Is Strong With You"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZe"], ["123456789", "1234567890"], ["Sthrobewitching,ng", "Sthrong"], ["God! Amaze a stunning, gorgeous, dbewitching, and dazzling ar gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzling ar gazelle!"], ["Sttrong", "Sttrong"], ["12345lohedrWl!o ,678090", "12345lohedrWl!o ,678090"], ["mm", "of"], ["habcddogecfghijklmnopqrstuvwxyz", "habcddogefghijklmnopqrstuvwxyz"], ["The hquick brown fox juer thelazy dog", "The hquick brown fox jumps over the lazy dog"], ["12o345lohedrWl!o", "The Force Is Strongabcdefvwxyz Wityh You"], ["ZYXWVUTSMRQPONMLKjumpsCStrongabcdefvwxyzBA", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["abcdefghijklmnopqrstuvwxyz", "Sttrong"], ["12345lohedr3Wl!o", "12345lohedrWl!o"], ["12345You678990", "12345You678990"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "of"], ["The hquick bro", "The hquick brown foxdog"], ["may the force be wiaueoaiueiiaaaith you", "e"], ["caattaco", "caattaco"], ["Strongabcdefghijknoxyz", "tacocspeabcdefghiGod!"], ["The Force Iofs Sttrong forrceWith You", "The Force Is Sttrong With You"], ["you", "you"], ["The", "The Force Is Strong Wth You"], ["juer", "Sttro"], ["afbcdefghijfklmnopqrstuvwxyz", "dog"], ["the", "The quick brown fox jumps over the lazy dog"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "The quick brown fox jumps over the lazy dog"], ["God! Amaze a stunning, gorgeous, dbewitching, and dazzling ar Strongabcdefghijknoxyzgazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzling ar gazelle!"], ["09876543221", "09876543221"], ["gazel!le!", "gazellze!"], ["may the force be with you", "The Force Is Strong W ith You"], ["Yuou", "taco122345678990cspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat"], ["mayy", "God! Amaze a stunning, g orgeous, bewitchabcdefghijklmnopqrstuvyzing, and dazzling specter of myThe hquick brown fox jumps over the lazy dog gtdear gazelle!"], ["Tbrown fox jumgps over the lazy dogcattlohedrWl!oco", "The quick brown fox jumps overStrongabcdefghijknoxyzgazelle!he lazy dog"], ["12o345loheWthdrWl!o", "The Force Is Strongabcdefghijknopqrstsuvwxyz With You"], ["tacoforrceWithcspectet", "tacocspectet"], ["The Force Is Strongabcdefvwxyz Wityh You", "Tbrown fox jumps over the lazyx dog"], ["klmnopThe Force Is Sthrong With You", "abcdefghijklmnopThe Force Is Sthrong With You"], ["dog21", "mayy"], ["gazgcattaco", "gazcattaco"], ["gggaze!", "ggaze!"], ["gazelle!", "juer"], ["Hello,", "tacocspecteThe Force Is Sthrong With Yourat"], ["The Forceabcgorgeous,defghijknopqrstuv0987654321wxyz Is Strongabcdefghijknoxyz With You", "The Forceabcgorgeous,defghijknopqrstuv0987654321wxyz Is Strongabcdefghijknoxyz With You"], ["The Force Is oStrong W ith You", "The Force Is oStrong W ith You"], ["0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do1", "098765423221"], ["Strongabcdefghijknoxyz", "tacocspecteThe Force Is Sthrong With Yourat"], ["madbewitching,y", "may"], ["Tbrown fox jumps over the lazy dog", "mm"], ["ZYXWVMLKJIHGFEDCBA", "abcdefghijknopqrstuvwxyz"], ["ZYXWVUTSMRQPONMLZYXWVMLKJIHGFEDCBA", "tacocspecteThe Force Is Sthrong With Yourat"], ["caatbewitchabcdefghijklmnopqrstuvyzing,taco", "123o45lostunning9,hedrWl!o ,67890"], ["speceter", "specter"], ["122345678990", "122345678990"], ["God! Amaze a stunning, gorgeous, bewi tching, and dazzling specter of my gdear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazStrongabcdefvwxyzer of my gdear gazelle!"], ["gazelle!", "gazellae!"], ["abcdefghijklmnThe Force Is Strong Wth Youopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "tacoforrceWithcspectet"], ["0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter ofr my gdear gazelle!own fox jumps over the lazy do1", "098765423221"], ["abcdefghijknopqrstuvwxyz", "tacocspectet"], ["Sttro", "Sttro"], ["aaaaiou", "Sthrong"], ["may theThe Force Is Strong Wth You force be with you", "Yourat"], ["foStron1234r5Hello,lohedrW12345lohedr!Wl!o ,678090l!ogrce", "0987654The quick brown fox jumps 12345lohedrWl!oover the lazy dog21"], ["foStrGod! Amaze agazellae! stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!ongrce", "theyou"], ["m", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["gazbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaelle!nopqrstuvwxyz", "abcdefghuijknopqrstuvwxyz"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZe", "klmnopThe Force Is Sthrong With You"], ["gazgcattaco", "The qugazelle!ownickZYXWVUTSMRQPONMLKjumpsCStrongabcdefvwxyzBA brown fox jumps over the lazy dog"], ["e quick brown fox jum0987654321azy dog", "abcdefghijklmnopqrstuvyz"], ["dog121", "dog121"], ["throng", "rthrong"], ["0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1", "0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1"], ["0987654The quick brown fox jumps over the lazy dog21", "0987654The quick brown fox jumps over the lazy dog21"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling speZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZecter of my gdear gazelle!own fox jumps over the lazy do", "The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do"], ["0987654The quick brown fox jumps 182345lohedrWl!oover the lazy dog21", "0987654The quick brown fox jumps 182345lohedrWl!oover the lazy dog21"], ["gazelle!", "hqudazThebrGod!"], ["Sttorong", "Sttrong"], ["The hquick browwn fox jumps over the lazy dog", "The hquick brown fox jumps over the lazy dog"], ["abcdefghuijknopqrstuvwxyz", "The quick brown fox jumps ovve the lazy dog"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling spttolohedrWl!ocoecter of my gdear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["lazyx", "juer"], ["tacoovenrcspecterat", "tacocspecterat"], ["of", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["123456789", "123456790"], ["mayy", "hbe"], ["tacocspectera1234r5Hello,lohedrWl!ot", "gtdeThe Force Is Sthrong With Your"], ["of", "of"], ["God! Amaze a stunn,678090l!ogrce", "God! Amazar gazelle!"], ["tacocspecteroat", "tacocspecterat"], ["mmay", "madbewitching,y"], ["0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1", "0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitchille!own fox jumps over the lazy do1"], ["mm", "God!"], ["gzgaze!", "Strongabcdefghijknoxyz"], ["StrongabcddeitThe Force Is Strong Wth Youz", "StrongabcdeitThe Force Is Strong Wth Youz"], ["taoocafoStron1234r5Hello,lohrW12345lohedr!Wl!o", "The quick brown fox jumps overStrongabcdefghijknoxyzgazelle!he lazy dog"], ["gmay", "0987654The quick brown fox jumps over the lazy dog21"], ["gazcattaco", "abcdefghuijknopqrstuvwxyz"], ["cattlohedrWl!gaze!oco", "cattlohedrWl!gaze!oco"], ["1The Force Is Sttrong With You2345You6789960", "122345678990"], ["Strongabcdefghijknopqrstuvwxyz", "0987654322The hqudazThebrGod! Amaze a stunning,678090l!ogrce, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1"], ["m", "m"], ["foStrongrce", "gazelle!own"], ["0987Yourat654321", "0987Yourat654321"], ["cattlohedrWl!oco", "gazelle!own"], ["The Force Is Strong With You", "The Force Is Sttrong With You"], ["Sttoong", "cat"], ["tacocspecteThe Fo With Yourat", "tacocspecteratabcdefghijklmnoprqrstuvwxyz4321"], ["Tbrown fox jumps over the lazy dog", "Tbrown fox abcdefghijklmnopThejumps over the lazy dog"], ["12o345lohmedrWl!o", "Thcaattaccoe Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["The hquick brown fox jumps over the lazy dog", "The quick brown fox jumps ove the lazy dog"], ["The quick brown fox jumps over thle lazy dog", "The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do"], ["0987Yourat654321", "0912o345loheWthdrWl!o87Yourat654321"], ["gagazelle!cteratze!", "gaze!"], ["Strongabcdefg12345lohedrWl!o ,67890hijknopqrstuvwxyz", "forrceWith"], ["The quick brown fox jumps over the lazy dog", "ovenr"], ["dazzling", "tacocspectergtdeart"], ["The quick brown fox jumps over the lThe hquick brown fox jumps over the lazy dog dog", "Tbrown fox jumps ovenr the lazy dog"], ["orgoverStrongabcdefghijknoxyzgazelle!heeous,", "The quick brown fox jumps over the lazy dog"], ["catmayy", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["gazel!le!", "cattaco"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZe", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["Sthrobewitching,ng", "Sthrobewitching,ng"], ["lazyx", "gazgcattaco"], ["The Force Is Strongabcdefvwxyz Wityh You", "The Force Is Strongabcdefvwxyz Wityh You"], ["God! Amaze a stunning, gorgeous, bewi tching, and dazzling specter of my gdear gazelle!", "gaze!"], ["may the force be with you", "may the force be with you"], ["Sthrobewitching,ng", "The Force Is Strong W ith You"], ["foStron1234r5Hello,lohedrW12345lohedr!Wl!o ,678090l!ogrce", "foStrongrcThe hquick brown fox jumps over the lazy doge"], ["Tbrown fox jumps over the lazyx dog", "Tbrown fox jumps over the lazyx dog"], ["beabcdefghijklmnopqrstuvwxyz", "1234567890"], ["tacoabcdefghijklmnoprqrstuvwxyzcat", "tacoabcdefghijklmnoprqrstuvwxyzcat"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazzlilng specter of my dear gazelle!"], ["Tbrown fox abcdefghijklmnopThejumps over the lazy dog", "Tbrown fox jumps over the lazy dog"], ["f", "f"], ["foxdog", "mayyy"], ["tacocspectera1234r5Hello,lohedrWl!ot", "tacocspecteThe Force Is Sthrong With Yourat"], ["habcddogefghijklmnopqrstuvwxyz", "morgeous,ayy"], ["gzgaze!", "12345You678990"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!", "The Force Is Strong Wth You"], ["Sttoong", "Sttoong"], ["StStro", "Sttro"], ["abcgorgeous,defghijknopqrstuv0987654321wxyz", "abcgorgeous,defghi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz"], ["ezzzezezezezezezeeeezezezezezezezeeee", "0987654321"], ["The quick brown fox jumps ovve the lazy dog", "The quick brown fox jumps ovve the lazy dog"], ["mamyy", "mayy"], ["12345lohedr!Wl!o ,678090", "12345lohedr!Wl!o ,678090"], ["12345lohedrWl!o", "Hello, World!"], ["Hello, World!", "gggaze!"], ["09876543221", "Sthrong"], ["Iofs", "cattlohedrWl!oco"], ["iaueoaiueiiaaa", "iaueoaiueiiaaa"], ["y", "you"], ["Yuou", "Yuou"], ["The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "tacocspectet"], ["habcddogefghijklmnopqrstuvwxyz", "The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do"], ["juer", "juer"], ["12345lohedrWl!o", "The Force IsYourat Strong With You"], ["theyou", "theyou"], ["ZYXWVUTSMRQPONMLKJIGHGFEDTbrown fox jumps over the lazy dogCBA", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["0987654322The hqudazThebrGod! Amaze a stunning,678090l!ogrce, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["ZYXWVUTSMRQPONMLKjumpsCBA", "ZYXWVUTSMRQPONMLKJI12345lohedr!Wl!forceoGHGFEDCBA"], ["Stabcdefghijklmnopqrrstuvwxyz", "Sttro"], ["mmay", "of"], ["wtith", "habcddogecfghijklmnopqrstuvwxyz"], ["e quick brown fox jum0987654321azy dog", "The hquick brown fox jumps over the lazy dog"], ["Tbrown fox jumps over the lazyx ddazTheog", "Tbrown fox jumps over the laszyx dog"], ["ZYXWVVUTSRQPONMLKJIHGFEDCBA", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["abcdefghijklmnuvwxyz", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["yuou", "yuou"], ["gazelle!own", "Sthrobewitching,ng"], ["force", "force"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of ,678090l!ogrcemy gdear gazelle!", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["SttrZYXWVVUTSRQPONMLKJIHGFEDCBAong", "Sttrong"], ["abcdefghijklabcdefghijklmnouvwxyzmnopqrstuvyz", "abcdefghijklmnopqrstuvyz"], [",67890hijknopqrstuvwxyz", "gaze!"], ["tacocspectera1234r5Hello,lohedrWl!ot", "tacocspectera1234r5Hello,lohedrWl!ot"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "abcdghijklmnopqrstuvwxyz"], ["Tbrown fox jumps over the lastaoo", "Tbrown fox jumps over the lastaoo"], ["Sttro", "tacocspeGodof!e Amaze a stunning, gorgetacoabcdefghijklmnoprqrstuvwxyzcatous, bewitching, and dazzling specter of my dear gazelle!cterat"], ["madbewitching,,y", "madbewitching,y"], ["tacocspecteThe Force Is Sthrong With Yourat", "gggaze!"], ["The Force Is Strongabcdefghijknopqrstuvwxyz With You", "iwith"], ["iwforrceith", "juer"], ["God! Amaze a stunning, gorgeous, bewi tching, and dazzling specter of my gdear gazelle!", "God! Amaze a stunning, gorgeous, bewi tching, and dazzling specter of my gdear gazelle!"], ["The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gadear gazelle!own fox jumps over the lazy do", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["Tbrown fox jumps over the lazyx dog", "may theThe Force Is Strong Wth You force be with you"], ["1234abcdefghijklmnopqrrstuvwxyz0", "12345lohedrWl!o,678090"], ["GoGd!", "God!"], [",6708090l!ogrcemy", "forrce"], ["12345lohedrWl!o ,67890", ","], ["tacocspeGodof!e", "Sttrng"], ["gagazelle!cteratze!", "cattlohedrWl!oco"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling speZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZecter of my gdear gazelle!own fox jumps over the lazy do", "cattaco"], ["sgazelle!tunning,", "mayy"], ["ZYXWVMLKJIHGFEDCBA", "the"], ["The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gadear gazelle!own fox jumps over the lazy do", "maay"], ["12345cat678990catacoovenrcspecteratttaco", "catacoovenrcspecteratttaco"], ["gazelle!", "gllae!"], ["The Force Is Strongabcdefghijknopqrstsuvwxyz With You", "12o345loheWthdrWl!o"], ["12345lostunning,hedrWl!o", "iaueoaiueiiaaa"], ["StttrSo", "Sttro"], ["f1The Force Is Sttrong With You2345You6789960", "force"], ["dog", "Tbrown fox abcdefghijklmnopThejumps over the lazy dog"], ["may the force be wiaueoaiueiiaaaith you", "The quick brown fox jumps over the lThe hquick brown fox jumps over the lazy dog dog"], ["mm", "bro"], ["ZYXWVUTSMRQPOsltunning,NMLKjumpsCBA", "ZYXWVUTSMRQPOsltunning,NMLKjumpsCBA"], ["1234567890", "f"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!", "God! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!"], ["bro", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["specter", "fforce"], ["StrongabcdefghijklohedrWl!onopqrstuvwxyz", "0987654322The hqudazThebrGod! Amaze a stunning,678090l!ogrce, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox ejumps over the lazy do1"], ["laszyx", "iwith"], ["tacoabcdefghijklmnoprqrstuvwxyzcat", "tacoabcdefghijklmn,67890oprqrstuvwxyzcat"], ["Tbrown fox jumps over the lazyx dog", "Tbrown foxgggaze! jumps over the lazyx dog"], ["caattacco", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["taco122345678990cspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat", "lastaoo"], ["abcdefghiGod! Amaze a stunning, abcdefghijklmnoprqrstuvwxyzgorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "God! Amaze a stunning, gorgeous, bewitching, and dazzling ar gazelle!"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jtacocspecteTheumps over the lazy dog specter of my gdear gazelle!", "The Force Is Strong Wth You"], ["abcdefgbrohijknopqrstuv0987654321wxyz", "abcdefghijknopqrstuv0987654321wxyz"], ["e quick brownc fox jum0987654321azy dog", "abcdefghijklmnopqrstuvyz"], ["ith", "throng"], ["abcdefghijklmnuvwxyz", "The"], [",67890hijknopqrstuvwxyz", "foStron1234r5Hello,lohedrW12345lohedr!Wl!o ,678090l!ogrce"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jtacocspecteTheumps over the lThe Force Is Strongabcdefghijknopqrstsuvwxyz With Youazy dog specter of my gdear gazelle!", "The Force Is Strong Wth You"], [",678090", "12345lohedrWl!o ,67890"], ["foStrGod! Amaze agazellae! stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!ongrce", "Thcaattaccoe Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["abcgorgeous,defghi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv09T87654321wxyz", "abcgorgeous,defghi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz"], ["theyou", "gzaze!"], ["abcdefghiGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "forrceWith"], ["gaaze!", "gaze!"], ["Strongabcdefghijknopqrstuvwxyz", "0987654322The hqudazThebrGod! Amaze a stunning,678090l!ogrce, gorgeoustunn,678090l!ogrces, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1"], ["maay", "tacocat"], ["gazel!le!", "12345You6"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "0987654The quick brown fox jumps 12345lohedrWl!oover the lazy dog21"], ["12345lohedrWl!o ,67890", "iaueoaiueiiaaa"], ["tacoovenrcspecterat", "caatbewitchabcdefghijklmnopqrstuvyzing,taco"], ["theyou", "g182345lohedrWl!ooverzaze!"], ["0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1", "0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gmay the force hbe with youazelle!own fox jumps over the lazy do1"], ["foStrGod! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!oengrce", "foStrGod! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!ongrce"], ["12345lohedr!Wl!forceo", "wSthrongith"], ["cattlohedrWl!oco", "God! Amaze a stunning, gorgeous, beabcdefghuijknopqrstuvwxyzwitching, and dazzling specter of my dear gazelle!"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "12345lohedrWl!o,678090"], ["The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!own fox jumps over the lazy do", "1234r5Hello,lohedrWl!o"], ["098765423221", "The quick brown fox jumps ovve the lazy dog"], ["hbe", "mayy"], ["bbbbbbbbaaaaaaaaaaaaaabcdefghijklmnThe Force Is Strong Wth Youopqrstuvwxyzaaaaaaaa", "bbbbbbbbaaaaaaaaaaaaaabcdefghijklmnThe Force Is Strong Wth Youopqrstuvwxyzaaaaaaaa"], ["12345678gorgeous,90", "God! nAmaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["The quick browlazyn fox jumr the lazy dog", "The quick brown fox jumr the lazy dog"], ["jtacocspecteTheumps", "The quick brown fox jumps over the lazy dog"], ["abcgorgeous,defguhi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz", "abcgorgeous,defghi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz"], ["12345cat678990catacoovenrcspecteratttaco", "12345cat678990catacoovenrcspecteratttaco"], ["gazcattaco", "gazcattaco"], ["lastaoto", "lastaoto"], ["StrongabcdeitThe Force Is Strong Wth YfoStrGod! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!oengrceouz", "StrongabcdeitThe Force Is Strong Wth Youz"], ["iwhith", "iwith"], ["abcdefghijklmnopqrrstuvwxyz", "abcdefghijklmnopqrrstuvwxyz"], ["gzaze!", "gzaze!"], ["Tbrown jumps ovenr the lazy dog", "Tbrown jumps ovenr the lazy dog"], ["of", "0987h654The quick brown fox jumps over the lazy dog21"], ["oSthrong", "Sthrong"], ["e quick brown Strongabcdefghijknoxyzgazelle!fox jum098765432y1azy dog", "abcdefghijklmnopqrstuvyz"], ["God! nAmaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!", "orgeous,"], ["over", "oIofsver"], ["The Force Is Strongabcdefghijknopqrstuvwxyz With You", "The Force Is Strongabcdefghijknopqrstuvwxyz With You"], ["The hquick brown foxdog", "0987654321"], ["The Force Is Strongabcdefghijknopqrstsuvwxyz With You", "The hquick brown fox jumps over the lazy dog"], ["God! Amaze a stunning, gorgeoyuouus,! bewitching, and dazThe hquick brown fox jumps over the lazy dog spoecter of my gdear gazelle!", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["The hqudazThebrGod! Amaze a sgazelle!tunning, gorgeous, bewitching, and dazzling s peZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZWitheZeZeZeZeZeZeZeZeZeZeZecter of my gdear gazelle!own fox jumps over the lazy do", "hquick"], ["lastaoto", "lastathrongo"], ["Yourat", "throng"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jtacocspecteTheumps over the lazy dog specter of my gdear gazelle!", "mayyy"], ["12345lostunning,hedrWl!o", "you"], ["Amaze", "The quick brown fox jumps over the lazy dog"], ["Strongabcdefghijknoxyz", "Yuou"], ["GGd!", "God!"], ["Tbrown fox jumps ovenr the lazy dog", "abcdefghijklmnopqrstuvwxmorgeous,ayyyz"], ["The quick brown fox jumps ovve the lazy dcattacoog", "cat"], ["foStron1234r5Hello,lohedrW12345lohedr!Wl!o", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!"], ["specterSthrng", "StrongabcdeitThe"], ["dog2123o45lostunning9,hedrWl!o ,678901", "dog21"], ["ZYXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxyzCBA", "f1The"], ["foStrGod! Amaze a stunning, gorgeous,! bewitching, and dazzling specter of my gdear gazelle!ongrce", "tu"], ["tacocat", "tacoFocat"], ["Strongabcdefghijknoxyz", "Yu"], ["9,6708090l!ogrcemy", "forrce"], ["abcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "12345lostunning,hedrWl!o"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["ZYXWVUTSMRQPONMLKJIHGFStrongabcdefghijknopqrstuvwxyzCBA", "1234567890"], ["GGd!m", "God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jumps over the lazy dog specter of my gdear gazelle!"], ["tacoabcdefghijklmnoprqrstugazcattacovwxyzcat", "tacoabcdefghijklmnoprqrstuvwxyzcat"], ["ce", "force"], ["God! Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jtacocspecteTheumps over the lazy dog spectlohedrWl!oer of my gdear gazelle!", "God!o Amaze a stunning, gorgeous,! bewitching, and dazThe hquick brown fox jtacocspecteTheumps over the lazy dog spectlohedrWl!oer of my gdear gazelle!"], ["cattlohedrWl!gaze!oco", "ZYXWVUTSMRQPONMLKJIGHGFEDCBA"], ["The Force Is Strongabcdefghijknopqrstsuvwxyz With You", "12o345lohWl!o"], ["abcgorgeous,defguhi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz", "abcgorgeous,defguhi0987654322The hqudazThebrGod! Amaze a stunning, gorgeous, bewitching, and gdear gazelle!own fox jumps over the lazy do1jknopqrstuv0987654321wxyz"], ["ZYXWVUTSMRQPONMLKjumpsCStrongabcdefvwxyzBA", "ZYXWVUTSMRQPONMLKjumpsCStrmay the force be wiaueoaiueiiaaaith youongabcdefvwxyzBA"], ["With", "0987654The quick brown fox jumps over the lazy dog21"], ["overStrongaabcdfefghiGod!bcdefghijknoxyzgazelle!he", ",67890hijknopqrstuvwxyz"], ["gagazellel!cterate!", "gaze!"], ["aStttrSoaaaaeeeiou", "aaaaiou"], ["12345lohedr!Wl!o ,678090", "iwith"], ["gtdeThe", "Tbrown fox jumps over the laszyx dog"], ["lastathrongo", "lastatthrongso"], ["wtith", "SttrSong"], ["caattacco", "rthrong"], ["gaz!elle!", "12345lohedrWrl!o ,678090"], ["dog", "odog"], ["abcdefghaijknopqrstuvwxyz", "tacocspectet"], ["ezzzezezezezezezeeeezezezezezezezeeee", "tacoabcdefghijklmnoprqrstuvwxyzcat"], ["Forceabcgorgeous,defghijknopqrstuv0987654321wxyz", "Forceabcgorgeous,defghijknopqrstuv0987654321wxyz"], ["wittheTheh", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["Amaze", "0987654The quick brown fox jumps over the lazy dog2o1"], ["Sttrong", "ZYXWVUTSMRQPONMLAmazarKJIGHGFEDCBA"], ["12345cat678990catacoovenrcspecteratttaco", "Tbrown fox jumps over the lazy dog"], ["bbbbbbbbaaaaaaaaaaaaaaaaaaaaaaa", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaaaa"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!", "abcgorgeous,defghijknopqrstuv0987654321wxyz"], ["127890", "127890"], ["God! Amaze a stunning, gorgeous, bewitchTbrown fox jumps over the laszyx doging, and dazStrongabcdefvwxyzer of my gdear gazelle!", "God! Amaze a stunning, gorgeous, bewitching, and dazStrongabcdefvwxyzer of my gdear gazelle!"], ["foSgtdeThe Force Is Sthrong With Yourtrongrce", "foStrongrce"], ["abcdefghiGod! Amaze a stunning, abcdefghijklmnoprqrstuvwxyzgorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyz", "taco122345678990cspeGod!e Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!cterat"], [",678090", ",678sltunning,90"], ["God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!", "cattlohedrWl!oco"], ["mabcdefghijklmnopThe Force Is Sthrong With Youayy", "God! Amaze a stunning, g orgeous, bewitching, and dazzling specter of my gtdear gazelle!"], ["speceter", "speceter"], ["aaabbbbbbbbaaaaaaaaaaaaaabcdefghijklmnThe Force Is Strong Wth Youopqrstuvwxyzaaaaaaaaaaeeeiou", "aaaaaeeeiou"], ["gazgcattaco", "yuou"], ["abcdefghijklmnoprqrstuvwxyz", "may the force be with"], ["0987Yourat654321", "0912o345l1234r5lohedrWl!o ,678090urat654321"], ["12345locattlohedrWl!ocohedr3Wl!o", "12345lohedr3Wl!o"], ["oagazellae!venr", "oagazellae!venr"], ["12345cat678990catacoovenrtacocspeabcdefghiGod! Amaze a sltunning, gorgeous, bewitching, and dazzling specter of my gdear gazelle!nopqrstuvwxyzcspecteratttaco", "12345cat678990catacoovenrcspecteratttaco"], ["", "abcd"], ["abcd", ""], [" ", " "], ["abcdefghijklmnopqrstuvwxyz", ""], ["", "abcdefghijklmnopqrstuvwxyz"], ["a", "a"], ["\n\t", "\n\t"], ["!$%^&*", "*&^%$!"], ["aaeaaaeeedogiou", "aaaaaeeedogiou"], ["abcdefghijklmnopqrstuvwxyz", "may"], ["12345607890", "0987654321"], ["aaeaaaeeedogiou", "may"], ["The quick brown fox jumps over the lazy dog", "The quick brown fox jumps over the lazy dog"], ["may", "09876541321"], ["aaaastunning,aaaaaaaaaaaaaaaaaaaaaaabbbb", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["The quick brown fobrownx jumps over the lazy dog", "The quick brown fox jumps over the lazy dog"], ["my", "The quick brown fox jumps over the lazy dog"], ["force", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["1234567890", "may"], ["brown", "brown"], ["abcdefghijklmnopqrstutvwxyz", "abcdefghijklmnopqrstuvwxyz"], ["dear", "abcdefghijklmnopqrstuvwxyz"], ["abcdefghijklmnopqrhstuvwxyz", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["abcdefghijklmnopqrstmayuvwxyz", "abcdefghijklmnopqrstmayuvwxyz"], ["12034567890", "may"], ["a", "The quick brown fox jumps over the lazy dog"], ["The quicky brown fox jumps over the lazy dog", "gazelle!"], ["maay", "may the force be with you"], ["and", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["may", "stunning,"], ["JAut", "JAut"], ["aaaaa", "aaaaaeeeiou"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "ezzzezezezezezezeeeezezezezezezezeeee"], ["aaeaaaeeedogiou", "aaaaaeeedHello,"], ["aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbdogiou", "aaaaaeeedHello,"], ["With", "lohedrWl!o ,"], ["The quick brown fox jumps over the lazy dog", "God! Amaze a stunning, gorggeous, bewitching, and dazzling specter of my dear gazelle!"], ["you", "aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["may the forcfe be with you", "may the forcfe be with you"], ["JAuAt", "JAut"], ["ezzzezezemay the forcfe be with youzezezezeeeezezezezezezezeeee", "ezzzezezezezezezeeeezezezezezezezeeee"], ["lohedrWl!o ,", "Hello, World!"], ["nbrown", "you"], ["may", "may"], ["abcdefghijklmnopqrstutvwxyz", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["abcdefghijklmnopqrstutvwxyz", "aaaaa"], ["ZeZeZeZeZeZeZeZeZeZeZeZeStrongZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["may the forcfe be with you", "ezzzezezezezezezeeeezezezezezezezeeee"], ["ezzmay the force be with youemay the foreee", "ezzzezezemay the foreee"], ["dear", "dear"], ["over", "quick"], ["maay", "aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou"], ["The quick brown fobHello, World!rownx jumps over the lazy dog", "fobrownx"], ["youemay", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["brown", "brandwn"], ["aaaastunning,aaaaaaaaaaaaaaaaaaaaaaaabbbb", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["Hello, World!", "aaaaa"], ["nbrown", "my"], ["abcdefghijklmnopqrstutvwxyz", "oabcdefghijklmnopqrstutvwxyz"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "Amaze"], ["youzezezezeeeezezezezezezezeeee", "aaaaaeeedHello,"], ["JATheuAt", "JAut"], ["fox", "abcdTheefghijklmnopqrstuvwxyz"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "The quick brown fobrownx jumps over the lazy dog"], ["quick", "aaaaaeeedogiou"], ["JAuAt", "JuAut"], ["dWorld!rownxog", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["nbrown", "JAut"], ["aaeeaaaee", "aaeaaaeeedogiou"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "aaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["may the force be with you", "e Is Strong With You"], ["may the forcfe be with you", "may the forcfe be wit"], ["ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze", "ezzzezezemay the foreee"], ["the", "aaaastunning,aaaaaaaaaaaaaa"], ["With", "abcdefghijklmnopqrstuvwxyz"], [",", "aaaaaeeedogiou"], ["ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze", "The Force Is Strong With"], ["ezzmay the force be with youemay the foreee", "aaaastunning,aaaaaaaaaaaaaa"], ["aaeaaaeeeGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!aaaaaaaaaaaaaaaaaabbbbdogiou", "aaeaaaeeeGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!aaaaaaaaaaaaaaaaaabbbbdogiou"], ["may the forcfe be with you", "may the forcfe be with yoThe quick brown fobrownx jumps over the lazy dogu"], ["abcdefghijklmnopqrtvwxyz", "oabcdefghijklmnopqrstutvwxyz"], ["aaaaaeeeiou", "iaueoaiquickyueiiaaa"], ["and", "bbbbbbbbaaaaaaaaafobHello,aaaaaa"], ["abcdefghijklmnopqrstuvwxWorld!rownxyz", "abcdefghijklmnopqrstuvwxyz"], ["yobewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "forcfe"], ["abcdefghijklmnopqrtvwxyz", "may the forcfe be with yoThe quick brown fobrownx jumps over the lazy dogu"], ["my", "may"], ["bewitching,", "may the forcfe be wit,"], ["bewitching,aaaaaaaaaaaaaaaaaaaaabbbb", "bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["abcxdefghijklmnopqrtvwxyz", "abcdefghijklmnopqrtvwxyz"], ["maay", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["tacocat", "The quicky brown fox jumps over the lazy dog"], ["aaaastunning,aaaaaaaaaaaaaaaaaaaaaaaabbbb", "aaaastunning,aaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["bewitching,", "God!"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZ,eZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["yoThe", "ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze"], ["ezzzezezThe Force Is Strong may the force be with youWithezezezezeeeezezezezezezezeeee", "Strong"], ["The quicky brown fox jumps over the lazy dog", "brandwn"], ["brandwn", "and"], ["ZeZeZeZeZeZeZeZeZeZeZeZeStrongZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["the", "the"], ["aaaaaa", "aaaaa"], ["iaueoaiueiabcxdefghijklmnopqrtvwxyziaaa", "iaueoaiueiiaaa"], ["abcdefghijklmnopqrstutvwxyz", "oabcdefghijklmnoThe Force Is Strong Witphpqrstutvwxyz"], ["aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou", "abcdefghijklmnopqrtvwxyz"], ["gorgeous,", "aaaaaeeedogiou"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaiaueoaiueiabcxdefghijklmnopqrtvwxyziaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "ezzzezezezezezezeeeezezezezezezezeeee"], ["ZYXWVUTSRQSPONMLKJIHGFEDCBA", "ZYXWVUTSRQSPONMLKJIHGFEDCBA"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZ,eZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "my"], ["JJAut", "JJAut"], ["ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvwxyze", "ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvqwxyze"], ["abcdefghijklmnopqrstuvwxWorld!rownxyz", "abcdefghijklmnopqrstuvwxWorld!rownxyz"], ["nbn", "JAut"], ["The Force Is Strong With You", "abcdefghijklmnopqrstuvwxWorld!rownxyz"], ["bewitchcattacoing,", "bewitchhing,"], ["", "aaaquickaaeeedogiou"], ["JuAlohedrWl!out", "bewitching,aaaaaaaaaaaaiaueoaiueiabcxdefghijklmnopqrtvwxyziaaaaaaaaaaaaaaaaaabbbb"], ["aaeeiou", "aaaaaeeeiou"], ["aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou", "ezzzezezezezezezeeeezezezezezezezeeee"], ["abcdefghijklmnopqrstuvwxWoprld!rownxyz", "abcdefghijklmnopqrstuvwxWorld!rownxyz"], ["mygorgeous,", "my"], ["ezzzezezezezezezeeeezezezezezezezeeee", "dWorld!rownxog"], ["ezzmay the force be withh youemay the foreeee", "aaaastuanning,aaaaaaaaaaaaaa"], ["aaaastunning,aaaaaaaaaaaaaa", "aaaastunning,aaaaaaaaaaaaaa"], ["brown", "1234567890"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZ,eZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "foreetheee"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZemay the forcfe be with youZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["dear", "ayouemaybcdefghijklmnopqrstuvwxyz"], ["my", "ymay"], ["eIs", "e"], ["gorgeous,", "aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou"], ["aaeaaaee12345607890edogiou", "aaaaaeeedHello,"], ["e Is Strong With You", "the"], ["ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze", "yoThe"], ["abcdefghijklmnopqrhstuvwxyz", "JAut"], ["abccdefghijklmnopqrstuvwxyz", "abcdpefghijklyourstuvwxyz"], ["bewitbewitchcattacoing,ching,", "God!"], ["aaeeiou", "aeaaaaeeeiou"], ["abcd!rownxyz", "abcdefghijklmnopqrstuvwxyz"], ["youzezezezeeeezezezezezezezeeee", "abcdefghijklmnopqrtvwxyz"], ["JuAut", "JAut"], ["force", "ZYXWVUTSRQPOUNMLKJIHGFEDCBA"], ["nand", "bbbbbbbbaaaaaaaaafobHello,aaaaaa"], ["wiaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbh", "with"], ["ezzzezezezezezezeeeezezezezezezezeeeZYXWVUTSRQSPONMLKJIHGFEDCBAe", "may"], ["ezzzezezThe", "may"], ["yoThe", "yoThe"], ["ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeou s, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze", "ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze"], ["aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou", "abcdefghijklmnopqrtvwxyyz"], ["the", "aaaastuandnning,aaaaaaaaaaaaaa"], ["The quicky brown fox jumps over the lazy do", "The quicky brown fox jumps over the lazy do"], ["ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze", "ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze"], ["abcdefghijklmnopqrstmayuvwxyz", "abcdefghijklmnopzqrstmayuvwxyz"], ["JAuAt", "brown"], ["ezzzezezemay the foreoabcdoefghijklmZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZenopqrstutvwxyze", "specter"], ["my", "y"], ["The quick brown fox jumps over the lazy dog", "Witphpqrstutvwxyz"], ["abcdefghijklmnopqrstuvwxWoprld!rownxyz", "dogu"], ["With", "you"], ["aaeaaaee12345607890edogiou", "ezzezezezezezezezeeeezezezezezezezeeee"], ["abcdefghijklmnopqrstuvwxWorld!rownxyznfox", "abcdefghijklmnopqrstuvwxWorld!rownxyzfox"], ["bewitchcattacoing,", "iaueoaiueiiaaaaalohedrWl!oa"], ["youZeZeZeZe", "youZeZeZeZe"], ["ezzmayabcdefghijklmnopqrstuvwxWorld!rownxyzfox the force be with youemay the foreee", "ezzmay the force be with youemay the foreee"], ["Hello, Wodrld!", "aThe Force Is Strong Withaaaa"], ["The quick brown fox jumpps over the lazy dog", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["ezzmay the force be withh youemay the foreeee", "God! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!"], ["ZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZemay the forcfe be with youZeZeZeZe"], ["ezzmay the forc e be with youemay the foreee", "ezzmay the force be with youemay the foreee"], ["abcxdefghijklmnopqrtvwxyz", "abcxdefghijklmnopqrtvwxyz"], ["tacocat", "brown"], ["withWithaaaa", "with"], ["ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvqwxyze", "ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvqwxyze"], ["aaeaaaee123ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bbewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee45607890edogiou", "aaeaaaee12345607890edogiou"], ["JuAut", "foreoabcdoefghijklmZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZenopqrstutvwxyze"], ["The Force Is Strong Withu", "you"], ["stunniabcd!rownxyzng,", "stunning,"], ["The Force Is Strong Withu", "gazelle!ou"], ["ZYXWVUTSRQPOUNMLKJIHGFEDCBA", "ZYXWVUTSRQPOUNMLKJIHGFEDCBA"], ["nbwithWithaaaan", "nbn"], ["the", "ZYXWVUTSRQSPONMLKJIHGFEDCBA"], ["JuAut", "ezzzezezemay the foreee"], ["bewitching,", "may the fwit,"], ["may the fwit,", "12345678390"], ["may the fwit,", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["nbrown", "aaeaaaeeoeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou"], ["dWorld!rownxog", "ZYJuAutXWVUTSRQPONMLKJIHGFEDCBA"], ["and", "and"], ["abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopstuvwxyz"], ["yobewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "yobewitching,aaaaaaaaaaaaaaaaabbbb"], ["aaaaa", "aaaaa"], ["stunning,", "The quick brown fox jumps over the lazy dog"], ["ezzfwift,he foreeee", "ezzfwift,he foreeee"], ["ezzzezezemay tehe foreoabcdefghijklWorvwxyze", "ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvqwxyze"], ["The quicky brown fox jumps over the lazy do", "JuAut"], ["JAuAt", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["abhijklmnopqrtvwxyz", ","], ["may the forcfe be with you", "may theZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZe forcfe be wit"], ["bewitchcattacwithhg,", "bewitchhing,"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeiaueoaiquickyueiiaaaZZeZeZeZeZeZemay the forcfe be with youZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["fox", "abcdTheefghijklmnopqrstuvwyxyz"], ["abchdTheefghijklmnopqrstuvwxyz", "abcdTheefghijklmnopqrstuvwxyz"], ["abcdefghijklmnopqrhstuvwxyz", "ZYXWVUTSRQPONMLwitKJIHGFEDCBA"], ["abcdTheefghijklmnopqrstuvwxyz", "ezzzezezezezezezeeeezezezezezezezeeee"], ["youzezezezeeeeezezezezezezezeeee", "abcdefghijklmnopqrtvwxyz"], ["aaaastuforeoabcdefgGod!a", "bewitchhing,"], ["12345607890", "01"], ["aaaaaaeeeiou", "aaaaaeeeiou"], ["ZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZe", "ZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZe"], ["over", "ezzzezezezezezezeeeezezezezezezezeeee"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "aaaaaeeeedHello,"], ["ayouemaybcdefghijklmnopqrsftuvwxyz", "ayouemaybcdefghijklmnopqrstuvwxyz"], ["Force", "ezzzezezemay the foreee"], ["aaaeaaaee12345607890edogiou", "aaeaaaee12345607890eThe quicky brown fox jumps over the lazy dodogiou"], ["aaeaaaee123ezzzezezezezezezeeGod!", "The Force Is Strong With"], ["angazelle!hijklmnopqrstutvwxyzed", "and"], ["ayouemaybwithWithaaaacdefghijklmnopqrstuvwxyz", "ayouemaybwithWithaaaacdefghijklmnopqrstuvwxyz"], ["aafobrownxaaaeeeiou", "aafobrownxaaaeeeiou"], ["aaaaaeeeedHello,", "aaaaaeeedHello,"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeiaueoaiquickyueiiaaaZZeZeZeZeZeZemay", "ZYXWVUTSRQPONMLKJIHGFEDCBA"], ["Hello, World!", "aaaastunning,aaaaaaaaaaaaaa"], ["wit,", "wit,"], ["bewitching,aaaaaaaaaaaaaaaaaaaaabbbb", "bewitching,aaaaaaaaaaaaaaaaaaaaabbbb"], ["stunniabncd!rownxyzng,", "The Force Is Strong Withu"], ["maay", "maay"], ["iaueoaiueiaiaaa", "iaueoaiueiiaaa"], ["brandwn", "brandwn"], ["abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownxyznfoxvwxyz", "abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownxyznfoxvwxyz"], ["Jt", "JWithaaaaAut"], ["gorgeous,", "ezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze"], ["gorgeous,", "JAuA"], ["Amaze", "abcxdefghijklmnopqrtvwxyz"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "foreee"], ["ZYXWVUTSRQPONMLwitKJIHGFEDCBA", "0987654321"], ["may the forcfe be with yoThe quicvk brown fobrownx jumps over the lazy dogu", "abcdefghijkwithhlmnopqrtvwxyz"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "aaaaaaaaaaaaaaaaaaaaaabbbb"], ["ezzzezezezezezezeeeezezThe quick brown fox jumps over the lazy dogezezezezezeeee", "ezzzezezezezezezeeeezezezezezezezeeee"], ["ezzzezezezezezezeeeezezezezezezezeeeZYXWVUTSRQSPONMLKJIHGFEDCBAe", "mmay"], ["JuAut", "JuAut"], ["abcdefghijklmnopqrstutvwxyz", "ZeZeZeZeZeZeZeZeJAuAZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["oabcdefghijklmnoThe", "ezzzezezemay the foreohabcdefghijklmnopqrstutvwxyze"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaabb", "you"], ["abcdetuvwxWoprld!rownxyz", "abcdefghijklmnopqrstuvwxWorld!rownxyz"], ["ablcdefghijklmnopqrstuvwxWoprld!rownxyz", "dogoabcdefghijklmnoTheu"], ["Witphpqrstutvwxyz", "ZYXWVUTSRQSPONMLKJIHGFEDCBA"], ["nbwithWithaaan", "nbn"], ["aaaeaaaee12345607890edogiou", "aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou"], ["gorggeous,", "iaueoaiueiiaaa"], ["Jt", "wit,"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "mygorgeous,"], ["aaaeaaaee12345607890edogiou", "oabcdefghijklmnopqrstutvwxyz"], ["eIs", "ezzmay the force be with youemay the foreee"], ["aThe", "1234567890"], ["Hello,", "abcdefghijkwithhlmnGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!opqrtvwxyz"], ["lohedrWl!o ,", "Amaze"], ["gazelle!eezezezezezezezeeee", "aafobrownxaaaeeeiou"], ["youaaeaaaee12345607890eThe", "annd"], ["iaiquickyueiiaaa", "iaueoaiquickyueiiaaa"], ["Hello,", "Helolo,"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "with"], ["abcdefghijklmnopqrtvwxyz", "abcdefghijklmnopqrtvwxyz"], ["ZYXWVUTSRQSPONMFEDCBA", "ZYXWVUTSRQSPONMFEDCBA"], ["tacocat", "iaueoaiueiabcxdefghijklmnopqrtvwxyziaaa"], ["over", "bewitching,"], ["abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownxyzZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZenfoxvwxyz", "abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownnxyznfoxvwxyz"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["bewitching,aaaaaaaaaabewitching,aaaaaaaaaaabbbb", "bewitching,aaaaaaaaaaaaaaaaaaaaabbbb"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "ZjumpsYXWVUTSRQPONMLKJIHGFEDCBA"], ["aaaee", "aaeeaaaee"], ["You", "abcdefghijklmnopqrstmayuvwxyz"], ["aaaaaeeeiou", "aaaaaeeieiou"], ["aaeaaaeeeGod! Amazmay the forcfe be with yoThe quick brown fobrownx jumps over the lazy dogue a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!aaaaaaaaaaaaabaaaaabbbbdogiou", "aaeaaaeeeGod! Amazmay the forcfe be with yoThe quick brown fobrownx jumps over the lazy dogue a stunning, gorgeous, bewitching, aand dazzling specter of my dear gazelle!aaaaaaaaaaaaabaaaaabbbbdogiou"], ["fox", "aaaaaaeeeiou"], ["uJAut", "JAut"], ["bewitching,", "Godnand!"], ["may the force be with y", "The Force Is Strong With You"], ["a", "ado"], ["aaaquickaeeedogi", "aaaquickaaeeedogi"], ["quiaaaastuandnning,aaaaaaaaaaaaaack", "quick"], ["iaueoaiueiaiaaa", "abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownnxyznfoxvwxyz"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeforeohabcdefghijklmnopqrstutvwxyzeeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeStrongZeZeZeZeZeZeZeZeZeZe"], ["The quicky brown fox jumps over the lazy dog", "quicky"], ["gorgeous,", "JJAuA"], ["ezzfwift,he fore", "ezzfwift,he foreeee"], ["gaaaaaaaaaaaaaaaaaaaaaaaaaaaabbzelle!eezezezezezezezeeee", "aafobrownxaaaeeeiou"], ["The quick brown fox jumps over the lazy dog", "bewitchcattacoing,"], ["gazelle!", "abcdefghijklmnopqrstmayuabcdefghijklmnopqrstuvwxWorld!rownnxyznfoxvwxyz"], ["abccdefghijklmnopqrstuvwxyz", "abcd!rownxyz"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "aaaaaeeeedHell,"], ["aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou", "aaaeaaaeea12345607890edogiou"], ["ZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZe", "nbn"], ["aaaastunning,aaaaaaaaaaaaaaaaaaaaaaabbbb", "oabcdefghijklmnopqrstutvwxyz"], ["The Force Is Strong Withu", "aaaaaeeeedHello,"], ["JAuAt", "0987654321"], ["stunning,", "aaaquickaeeedogi"], ["quiaaaasuaWorld!ndnning,aaaaaaaaaaaaaack", "quWithu,aaaaaaaaaaaaaack"], ["nbrownoabfcdefghijklmnoeIsThe", "The Force Is Strong With You"], ["lohedrWl!o ,", "lohedrWl!o ,"], ["gaaaaaaaaaaaaaaaaaaaaaaaaaaaabbzelle!eezezezezezezezymayeeee", "JuAut"], ["ZeZeZeZeZeZeZeZeJAuAZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZequicvkZeZeZeZeZeZeZeZeZeZeZeZe", "abcdefghijklmnopqrstutvwxyz"], ["ayouemaybcdefghijklmnopqrsftuvwxyz", "with"], ["ayouemaybwithWithaaaacdefghijklmnopqrstuvwxyz", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["aaaeaaaee12345607890edogiou", "JuAlohedrWl!out"], ["abcdetuvwxWoprld!rownxyz", "abcdetuovwxWoprld!rownxyz"], ["aaaastunning,aaaaaaaaaaaaaa", "the"], ["ZeZeZeZeZeZeZeZeZeZeZeZeZeZ,eZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZ,eZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["tezzzezezemay the foreoabcdefghijklmnopqrstutvwxyze", "the"], ["bewitbewforehcattacoing,ching,", "God!"], ["Jt", "The Force Is Strong With You"], ["bewitching,", "Amazmay"], ["ezzzezezemay the foreoabcdoefghijklmZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZenopqrstutvwxyze", "ezzzezezemay the foreoabcdoefghijklmZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZenopqrstutvwxyze"], ["aaaastunning,aaaaaaaaaaaaaaaaaaaaaaabbbb", "abcdetuvwxWoprld!rownxyz"], ["aaeaaaee12345607890edogiou", "aaeaaaee12345607890edogiou"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "aaaaaeeeiou"], ["ezzmayabcdefghijklmnopqrstuvwxWorld!rownxyzfox the force be with youemay the foreee", "ezzmay the force be with youemay tthe foreee"], ["World!you", "you"], ["Witphpqrstutvwxyz", "ZYXWVUTSRQSPONMLKJIHGFEDCBBA"], ["nbrown", "aaeaaaeeeaaaaaaaaaaaaaaaaaaaaaaaaaaabbbabdogiou"], ["fore", "fore"], ["do", "abcdefghijkwithhlmnGod!"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "ZeZeZeZeZeZeZeZeJAuAZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["stunniabcZYJuAutXWVUTSRQPONMLKJIHGFEDCBAd!rownxyzng,", "stunniabcd!rownxyzng,"], ["tacocat", "bewitbewitchcattacoing,ching,"], ["brarndwn", "brandwn"], ["123456foreoabcdefgGod!890", "1234567890"], ["aaaeaaaee12345607890edogiou", "oabcdefghijeklmnopqrstutvwxyz"], ["fobrowyouZeZeZeZenx", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaa"], ["ZYXWVUTSRQPONMLKJIHGFEDCBA", "brown"], ["aaeaaaee12345607890edogiou", "aaeaaaee123ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bbewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee45607890edogiou"], ["fabcdefghijklmnopqrhstuvwxyzoreohabcdefghijklmnopqrstutvwxyze", "aaaaaeeedogiou"], ["ablcdefghijklmnopqrstuvwxWoprld!rownxyz", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["ZYXWVUTSRQPONMLKJIHGFEDFCBA", "yobewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["abcdetuovwxWoprld!rownxmyyz", "abcdetuovwxWoprld!rownxyz"], ["ZYXWVUTSRQPOUForceNMLKJIHGFEDCBA", "brandw"], ["aaaastunning,aaaaaaaaaaaaaa", "aaaastuquicvknning,aaaaaaaaaaaaaa"], ["nbwithWithaaan", "nabcdefghijklmnopqrstmayuvwxyzbn"], ["specter", "specter"], ["witheZeZeZZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZeth", "witheZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZeth"], ["nbrownoabfcdefghijklmnoeIsThe", "yobewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["foreetheee", "catctaco"], ["aaaastuforeoabcdefgGod!a", "my"], ["bewitchingwitheZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZZeZeZeZZeZeZeZeZeZeZZeZeZeZeth,", "bewitchezzfwift,heing,"], ["mmay the fwit,ay", "stunning,"], ["eIsZYXWVUTSRQSPONMFEDCBA", "ezzzezezemay tehe foreoabcdefghijklWorvwxyze"], ["withWThe quick brown fox jumps over the lazy dogithaa", "ezzmay"], ["abcdefghigazelle!eezezezezezezezeeeejklmnopqrtvwxyz", "abcdefghigazelle!eezezezezezezezeeeejklmnopqrtvwxyz"], ["aaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"], ["ee12345607890edogiou", "aaaeaaaee12345"], ["The Force Is Strong Witrh", "The Force Is Strong With"], ["youzezezezeeeeezezezezezezezeeee0987654321", "God! Amaze a stunning, gorggeous, bewitching, and dazzling specter of my dear gazelle!"], ["ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze", "e Is Strong With You"], ["ZeZeZeZeZeZeZeZeJAuAZeZeZeZeZZeZe", "ZeZeZeZeZeZeZeZeJAuAZeZeZeZeZZeZe"], ["ZYXWVUTSRQSPONMLKJIHGFEDCBBA", "ZYXWVUTSRQSPONMLKJIHGFEDCBBA"], ["12345607890", "12345607890"], ["AmaJJAuAze", "aaeaaaee123ezzzezezezezezezeeGod!"], ["abcdefghijkwithhlmnopqrtvwxyz", "stunniabcd!rownxyzng,"], ["youZeZeZeZe", "aaeaaaeeeGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!aaaaaaaaaaaaaaaaaabbbbdogiou"], ["lohedrWl!o", "ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze"], ["iaiquickyueiiaaa", "12345678390"], ["bewitcZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZe", "lohedrWl!o ,"], ["dWorld!Forcerownxog", "dWorld!rownxog"], ["stunniabcd!rownxyzng,", "stunniabcd!rownxyzng,"], ["abcdefghijklmnopqrstuvwxWorld!rownxyz", "abcdefghijjklmnopqrstuvwxyz"], ["ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze", "ezzzezezemay the foreoabcdefgGod! Amaze a stunning, gorgeou s, bewitching, and dazzling specter of my dear gazelle!hijklmnopqrstutvwxyze"], ["bewidogezezezezezeeeehing,", "Amazmay"], ["foxran", "bran"], ["e Is Strong With You", "e Is Strong With You"], ["abcdefghijklmnopqrstutvwx", "aaaaa"], ["ezzzezezezezezezeeeezeezezezezezezeeee", "ezzzeHello, Wodrld!zezezezezezeeewithhezezezezezezezeeee"], ["abcdefghijkwithhlmnGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!opqrtvwxyz", "abcdefghijklmnotacocatpqrstmayuabcdefghijklmnopqrstuvwxWorld!rownxyznfoxvwxyz"], ["ZeZZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZemay the forcfe be with youZeZeZeZe", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZZeZeZeZZeZeZeZeZeZeZeZeZeZe"], ["aaaaa", "aaa"], ["ezzzezezemay tehe foreorvwxyze", "ezzzezezemay tehe foreoabcdefghijklWorld!rownxmnopqrstutvqwxyze"], ["ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee", "ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee"], ["He!", "Hello, Wodrld!"], ["abcdefghijklmnopqrstutvwbxyz", "abcdefghijklmnopqrstutvwbxyz"], ["aaeaaaee123ezzzezezezezezezeeGod! Amaze a sGtunning, gorgeous, bbewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee45607890edogiou", "aaeaaaee123ezzzezezezezezezeeGod! Amaze a stunning, gorgeous, bbewitching,aaaaaaaaaaaaaaaaaaaaaaaaaaabbbb and dazzling specter of my dear gazelle!eezezezezezezezeeee45607890edogiou"], ["dWorld!rownxog", "dWorld!rownxog"], ["iaueoaiueiiaaaaalohedrWl!oa", "thhe"], ["abcxdefghijkklmnopqrtvwxyz", "JJAuA"], ["aaeaaaeeeGod! Amaze a stunning, gorgeous, bewitching, andaaaaaaaaaaaaaaabbbbdogiou", "aaeaaaeeeGod! Amaze a stunning, gorgeous, bewitching, and dazzling specter of my dear gazelle!aaaaaaaaaaaaaaaaaabbbbdogiou"], ["quickghijklyourstuvwxyz", "abcdpefghijklyourstuvwxyz"], ["AmaabcdefghijklmnopqrstmayuabcdefgohijklmnopqrstuvwxWorld!rownnxyznfoxvwxyzze", "ezzezezezezezezezeeeezezezezezezezeeee"], ["dear", "ayouremaybcdefghijklmnopqrstuvwxyz"], ["Hello, World!", "ZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeZeforeohabcdefghijklmnopqrstutvwxyzeZeZeZeZeZeZeZeZZeZeZeZeZeZeZeZeZeZeZeZeZe"], ["09876541321", "aaaaaeeieJAuAtu"], ["ezzmay the force be with youemay the foreee", "ezzzezezfemay the foreee"], ["eaaeeiou", "may the forcfe bhe wit"]], "completion": "\ndef same_chars(s0: str, s1: str) -> bool:\n return set(s0) == set(s1) and all(s0.count(char) == s1.count(char) for char in set(s0))\n", "raw_completion": "```python\ndef same_chars(s0: str, s1: str) -> bool:\n return set(s0) == set(s1) and all(s0.count(char) == s1.count(char) for char in set(s0))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef same_chars(s0: str, s1: str):\n \"\"\"\n Check if two words have the same characters.\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')\n True\n >>> same_chars('abcd', 'dddddddabc')\n True\n >>> same_chars('dddddddabc', 'abcd')\n True\n >>> same_chars('eabcd', 'dddddddabc')\n False\n >>> same_chars('abcd', 'dddddddabce')\n False\n >>> same_chars('eabcdzzzz', 'dddzzzzzzzddddabc')\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/55", "prompt": "\n\ndef fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"\n", "entry_point": "fib", "canonical_solution": "\n\n if n == 0: return 0\n if n <= 2: return 1\n a, b = 1, 1\n for _ in range(3, n + 1):\n a, b, = b, a + b\n return b\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(10) == 55\n assert candidate(1) == 1\n assert candidate(8) == 21\n assert candidate(11) == 89\n assert candidate(12) == 144\n\n", "contract": "\n assert n >= 0, \"invalid inputs\" # $_CONTRACT_$\n assert isinstance(n, int), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[10], [1], [8], [11], [12]], "atol": 0, "plus_input": [[0], [1], [false], [true], [16], [2], [17], [15], [14], [63], [64], [13], [3], [71], [72], [70], [35], [62], [69], [12], [36], [34], [61], [67], [4], [5], [11], [66], [10], [65], [74], [73], [75], [44], [28], [18], [6], [45], [68], [8], [29], [7], [27], [86], [60]], "completion": "\ndef fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"\n if n <= 1:\n return n\n else:\n return fib(n-1) + fib(n-2)\n", "raw_completion": "```python\ndef fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"\n if n <= 1:\n return n\n else:\n return fib(n-1) + fib(n-2)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef fib(n: int):\n \"\"\"Return n-th Fibonacci number.\n >>> fib(10)\n 55\n >>> fib(1)\n 1\n >>> fib(8)\n 21\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/56", "prompt": "\n\ndef correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"<\" and \">\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"<\")\n False\n >>> correct_bracketing(\"<>\")\n True\n >>> correct_bracketing(\"<<><>>\")\n True\n >>> correct_bracketing(\"><<>\")\n False\n \"\"\"\n", "entry_point": "correct_bracketing", "canonical_solution": "\n\n cnt = 0\n for x in brackets:\n if x == \"<\": cnt += 1\n if x == \">\": cnt -= 1\n if cnt < 0: return False\n return cnt == 0\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(\"<>\")\n assert candidate(\"<<><>>\")\n assert candidate(\"<><><<><>><>\")\n assert candidate(\"<><><<<><><>><>><<><><<>>>\")\n assert not candidate(\"<<<><>>>>\")\n assert not candidate(\"><<>\")\n assert not candidate(\"<\")\n assert not candidate(\"<<<<\")\n assert not candidate(\">\")\n assert not candidate(\"<<>\")\n assert not candidate(\"<><><<><>><>><<>\")\n assert not candidate(\"<><><<><>><>>><>\")\n\n", "contract": "\n assert type(brackets) == str, \"invalid inputs\" # $_CONTRACT_$\n assert all(x in \"<>\" for x in brackets) # $_CONTRACT_$\n", "base_input": [["<>"], ["<<><>>"], ["<><><<><>><>"], ["<><><<<><><>><>><<><><<>>>"], ["<<<><>>>>"], ["><<>"], ["<"], ["<<<<"], [">"], ["<<>"], ["<><><<><>><>><<>"], ["<><><<><>><>>><>"]], "atol": 0, "plus_input": [["><"], ["<<<>>>"], ["><<<>>"], ["<<>>><><><><>>>><"], ["<<><><><>>>><>"], ["<<<"], [">><<"], ["<><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>>>><"], [">>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<"], ["<<>><>"], ["<<<<>><>>><>"], ["<<>>><><><>>>>><"], ["><<><><><>>>><><"], [""], ["<<><<"], ["<<<<"], ["<<<<<>>><><><>>>>><"], ["<<<<<<<>>><><><>>>>><<"], ["<><>>>><<<<><>>><<>><>>>><<<<><<<<<<<<>>><><><>>>>><<>>>><<<<><>>>><<<<><>>>><"], ["<<<>>>><<><><><>>>>><><"], ["<"], ["<<<<><<"], ["<>><<<><><><>>>><>"], ["><<<><<><><><>>>><><>>"], ["<<<>"], ["<<>><><<<<><<<"], ["<<>>><><<><><>>>><"], ["<>><><><>>>><>"], ["<<><><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>>>><<><><>>>><>"], [">>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<"], ["><<<<>>"], [">>><<"], ["><<<<<>>"], ["<<><><><>>>>><>"], ["><<><<><><><>>>><><<>>"], ["><<<<<<<><><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>>>><<><><>>>><>>>"], ["><<<><>"], ["><<<>>>"], ["<><>>>><<<<><>>><<>><>>>><<<<><<<<<<<<>>><><><>>>>><<>><>><<<<><>>>><<<<><>>>><"], ["<<><<<>>><><><><>>>><<"], ["<<><<<"], ["<<><<<>>><><><><>>>>><<"], ["<<><>>>><<<<><>>><<>><>>>><<<<><<<<<<<<>>><><><>>>>>><<>><>><<<<><>>>><<<<><>>>><<<>>><><><>>>>><<"], ["<<<<<<<>>><><><>>>>><<><<><<><><><>>>><><<>>"], ["><<<>><><<<>>"], ["<<<<<<>><>"], ["><<><><><>>>><"], ["<<<>>>><<<><><><>>>>><><"], ["<<<<<<>>><><><>>>>><"], ["><<<><<><><><>>>><><>><<><<"], ["<<<<<>>><><><>>>>>><"], [">>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<><<<<<<<<<<<"], ["<><<<<><<"], ["><<><<><><>>>><><<>>"], ["<<><><><>>><>"], ["><<><<>><><><>>>><><<>>"], ["<<<<<<<>>><>><><>>>>><<><<><<><><><>>>><><<>>"], ["><<"], ["<<<>>>>><<<><><><>>>>><><"], ["<<<>>>><<<><>><><>>>>><><"], ["<>><><><>>>><<<><><><>>>>><>>"], ["<<<>><<<<<"], ["<<><<><>>>><<<<<>><><><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><><<><><><>>>>><>>>><<><><><>>><><<<"], ["<<<<><<<<><<<<>>><><><>>>>>><"], ["<<>><<<<<><<<<><<<<>>><><><>>>>>><<<<<<<><><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>>>><<><><>>>><>>>><>"], ["<<><"], ["<<<>>><>>><<<><><><<>>>>><><<"], ["<<><<<<"], ["<<>>><><><><>>><"], ["<<<><"], ["<<><<<<<"], ["<<>>><><>><><>>><"], [">>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<"], ["<<<><<<>><"], ["<<>><><><>>>><><<"], ["<<<>>>>>><<<><><><>>>>><><"], ["<<<>>>><<<><><><>>>>>><><"], [">>><<<<"], ["<<<>>>>>><<<><><><>>>>><><<<>>><><><>>>>><"], ["<><>>>><<<<><>>><<>><>>>><<<<><<<<<<<<>>><><><>>>>><<>><>><<<<><>><"], ["<<>>>><<><>>>><"], ["><<><<>><><><>>>>><><<>>"], ["<<>>><><><>>><<<><<><><><>>>><><>><<><<>>><"], ["<<>><<<<<><<<<><<<<>>><><><>>>>>><<<<<<<><><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>>>><<<>><><<<>><>>>><>"], ["<<><<<<<>>><><><>>>>><><><><>>>><><<"], ["<<>><<<<<><<<<><<<<><<<>>><>>><<<><><><<>>>>><><<>><><><>>>>>><<<<<<<><><>>>><<<<><>>><<>><>>>><<<<><>>>><<<<><>>>><<<<><>><>><<><><>>>><>>>><>"], ["<<<<>>>><<><><><>>>>><><<<>>>><<<><>><><>>>>><><"], ["<<<><><><>>>><><><<<"], ["><<><><><>>>><><<<<<>>"], ["<<<>>>>"], ["<<<>>><>>><<<><><><<>>>>><<><<>><><><>>>>><><<>>><><<"], ["<<>>><><>><><>><"], ["<<>>>><><<>><<>>><><>><><>><<><>>><"], ["<<<>><>><<<><><><>>>>>><><"], ["><<<<>>><>>><<<><><><<>>>>><<><<>><><><>>>>><><<>>><><<<<<>>"], ["><<><<><><><>>>><<>>"], ["<><><<><<>><><><>>>>><><<>>><<<"], ["<>><<<>><><><<<>>><><<><><>>>><>><>"], ["><<<><<><>><><>>>><>><>><<><<"], ["<<<<<<>><><><><<><<>><><><>>>>><><<>>><<<"], [">>><<<"], ["<<<>>>><<<<>>>>>>><<<<<<<"], [">>>><<<<<"], ["><><><><><><><><><"], [">>>>><<<<<<<<<<>>>>>>>>"], ["<>><<<>>>>><<<<>>>>>><<>>"], ["><>><<<<>>>>"], ["<<<<<>>>><<<<<<<>>>><<<<<>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>"], ["><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><"], [">><>>>>>><<<<<<<<<<>>>>>>>><><><><><><><><"], ["><>><<<><>><<<<>>>><>>>>>"], [">>>>><<<<<<<<<<<>>>>>>>>"], [">><"], ["<<<>>>><<<<>>>>>>><<<<>><<<<"], ["><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>>>>>>"], [">>>><<<<><"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><><"], ["><><><><><><><><>><"], ["><><><><><><><><><><><>><><><><><><>><"], ["><>><><><><><><><><"], ["<<<<<>>>><<<<<<<>>>>><<<<<>>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><"], ["><><><><><><>><><><"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<"], ["><><><><<<<<>>>>><<<<<<<>>>><<><><><"], ["><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><"], [">>>><<<<>>>>>><<>>"], [">>>>><<<<<<<<<<>>><>>>>>"], [">>>>><<<<<<<<<<>>>>><>><><><><><><><><>>>>"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><>><<<<<<<<<<<>>>>>>>>><>>>>"], ["><>>>>><<<><<<<<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<"], ["<>><<>>><<<>>>><<>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<<>>>>><><><><"], ["><>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>><<<<<"], ["<<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<"], ["<<<>>>>>>><><><><<<<<<<<"], [">>>>><<<<><>><<<><>><<<<>>>><>>>>>>>>"], ["><>><<<>>>>><<<<<<<<<<>>>>>>>>><>>>>"], [">>>>"], ["><>><<<>>>>><<<<<<<<<<>>>>>><><><><><><><><>><<>>>>"], ["<<<<<<<<>>>><<<<<>>>>"], [">>>>><<<<>>>>>><<>>"], ["><><><><<"], ["<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<"], ["><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<"], [">>>"], [">>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><"], ["<<<<<<<<>><>><<<<<>>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<>>>><<<<<><><><><><><><><><>>>><<<<<<<<<<>>>>>>>>><"], ["><>><<<<<<<<<<>>>>>>>>><>>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><>"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<<>>>>>>>><<"], ["><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<"], ["<<<<<>>>><<<<<<>>>>><<<<<>>>>"], ["<<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>"], ["><>><<>>>>"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["<<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>"], ["<<<<<>>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><><><><<<<<>>>>><<<<<<<>>>><<<<<<>>>>><><><><"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<>>>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>>>>"], ["><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><>>>>>><<><<>>>>>><<>><<<<<<<<<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<"], [">>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><"], ["><>><<<<<<<<<<<<>>>>>>>>><>>>>"], ["<<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>"], ["<<<<>>>><<<<>>>>>>><<<<<<<"], ["><><<><><><><>><><><"], ["<<<<<<<<<<>>>>><<<<<>>>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><><>>>"], [">><>>>>>><<<<<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<<<<<<>>>>>>>>><><><><><><><><"], ["><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>>"], ["><><><><<<<<>>>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<<<<>>>><<<<<>>>>><><><>"], ["><>>>>><<><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><<<<<"], ["><><><><><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><"], ["><><><><<<><<>>>>><<<<<<<>>>>><<><><><"], ["<<<<<>>>><<<<<<<>><>><<<<<>>>>>>>"], ["<<<>>>><<<<>>>>>>><<<<>><<<<<"], ["><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], ["><>><<<><>><<<<>>>><>>><>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>><<<<<>>>"], ["<<<<<>>>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>>>><><<<><<<<<"], [">>>>><<<<<<<<<<<>>><>>>"], ["<<><<<>>>><<<<<<<>><>><<<<<>>>>>>>"], ["<<<>><><<<<<<<<"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>>><>>>><<<<>>>>>><<>><<<>>>>>>>>"], ["<<<<>>>><<<<>>>>>>><<<<<<<<<<<<>>>><<<<<>>>><<<"], ["><>><><<<<>>>>><>>>>><<<<<<<>>>>>><<<>>>><<<<<"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<"], ["<<<>>>><<<<>>>>>>><<<<<>><<<<"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<"], ["><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>><><><><><>><<<<<>>>>>><>>>>"], ["><><><><><><><>><><><><<<><<>>>>><<<<<<<>>>>><<><><><>>>>><<<<<<<<<<>>>>>>>>><"], [">>><<<<<"], ["><>><><<<<>>>>>>>>><<<>>>><<<<<"], [">>>>><<<<<<<<<<>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], [">>>>><<<<<<<<<<<<>>><>>>"], ["><>>>>><<<>><><<<<>>>>><<<<<<>>>><<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>>>>>><<<<<>>>>>"], ["<<<><>><><><><><><><><>>>><<<<>>>>>>><<<<><><><><><><><><><><><>><><><><><>>>><>><<>><<<<"], ["<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>>>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<>>>>><><><>>>>>><<><<>>>>>><<>><<<<<<<<<"], ["><>><><>>>><<<>>>><<<<<"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<>><"], ["<<<>>>><<<<>>><<>><<<<<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>>><><><><<<<<<<<<"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<><<<<"], [">>>>><<<<<<<<<<<<>>>>>>>>"], ["<<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>"], ["><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><>><><><><><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><"], [">>><><<"], ["<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>"], ["><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>"], [">>>>>"], ["><<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>><><<<<>>>>><>>>>><<<<<<>>>><>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], ["><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><<<<>>>>>><<<<<<<>>>><<<<<>>>>>>>"], ["<<<<>>>><<<<>>>>>>><<<<<<<<<<<<>>><><<<<<>>>><<<"], [">>>>><<<<><>><<<><>><<>>><<<<<>>>><>>>>>>>>"], ["><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>"], ["<<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>"], ["><>><><>>><<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>><<<>>>><<<<<"], [">>>>><<<<<<<<<<<<>>>><>>>"], ["><>><<<><>><<<<>>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><<><><><><>><<<<<>>>>>>"], ["><><>>>><>>><><<<<>><><<<<>>>>><<<<<<>>>><<<<<"], [">>>><<<<><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>><<<<<<<>>>><<<<<>>>><"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<>>>>>"], ["><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><><><><><<<<<>>>>><<><<<<<>>>><<>><><><"], ["><><><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><>>>>>>><<<<<<<<<<<<>>><>>><<<<<"], [">>>><<<><>>>><><<<><<<<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><"], [">>>>><<>>"], ["><<<<>>>><<<<>>>>>><<>>"], ["><<>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><><><><<<<<>>>>><<<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><"], ["<<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>><><><><><><><><>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>><><><><<<<<>>>><<<<>>>><<<<<<<<>>>><<<<<>>>><><><><><><>>>"], [">>>>>>>>>><<><>><<<><>><<>>><<<<<>>>><>>>>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<>>><><><><><><><><><<<<<<<>>>>"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<"], ["<<<<<>><<<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><<>"], [">>>>>><<<<<<<<<<<>>><>>>"], ["<<<<<>><><><><><><>><><>>>><<<>>>><<<<>>>>>>><<<<<>><<<<><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>><><><><><><><><>>"], ["<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], [">>>>><<<<<<<>>><>>>>>"], ["><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<"], ["<<<<<>>>>><<<<<<<>>>>>>"], [">><>>>><><<<><<<<<"], ["><><><><<<<<<>><><<<<<<<<>><><><><"], ["><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<>>>>>><<<<>>>>>>><<<<>><<<<"], ["><<><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>><><><><><>><<<<<>>>>>><>>>><<>>>><<<<>>>>>><<>>"], ["<><<<<><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<>>>>><<<<<>>>><<<><>><><><><><><><><>>>><<<<>>>>>>><<<<><><><><><><><><><><><>><><><><><>>>><>><<>><<<<>"], ["<>><<<>>>>><<<<>>>>>><<>><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>>"], [">><>>>>>>>>>><><><><><><><><"], ["><><>>>><>>>><><<<<>><><<<<>>>>><<<<<<>>>><<<><><><><>><><>><>><<<><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><<"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>"], ["><><><><<<<<>>>><>>>>><<<<<<<<<<<<<>>><>>><<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><"], ["><><<<<>>>>><<>>>>><<<<<<<>>>>>>><<<<<<>>>>"], ["><>>>>>>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><>>>>>><<<<<<<<<<<<>>>>>>>><><><><><><>><<<<<>>>>>"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><<<>>>>><><><>>>>>>><<<<<<<<<<<<>>><>>><<<<<"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<><><><>><<<<<>>>>>><>>>><><>><"], ["<<<<<<>>>><<<<<<<>>>><>>>>"], ["><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<"], [">>>>>>"], [">>><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<<<><<<"], ["><><>>>><>>>><><<<<>><><<<<>>>>><<<<<<>>>><<<><><><><>><><>><>><<<><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><>><><>>><<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>><<<>>>><<<<<><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><<"], ["<<<>><><<>><<>>><<<>>>><<>><<<<<<<"], [">>>>><<<<<<<>>>><>>>>>"], ["><>>>>>>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><>>>>>><<<<<<<<<<<<>>>>>>>><><><><><><>>><<<<<>>>>>"], ["><>><<<>>>>>><<<<<<<<<<>>>>>>>>><>>>>"], [">><>>>>>>>><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><>>><><><><><><><><"], [">>>><>><<<<<<<<<<<>>>>"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>><>>><<"], ["<<<<<<<<<>>>><<<<<>>>>"], [">>>>><<<<<<<<<<>>><>>>"], ["<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<>>>>><><><>>>>>><<><<>>>>>>><<>><<<<<<<<<"], ["<><<>>><><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>>><><><>>>><>><<<<<<<<<<<>>>>><<<<<<<<<"], ["><>><<<>>>>>><<<<<<<<<<>>>>>>><>><>>>>><<<><<<<<>>>"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<><><>><<<<<>>>>>><>>>><><>><"], [">><>>>>>>>><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<><><><><><><><"], ["><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><>><><"], ["><>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<>>>><<<<<<<<<<<<>>>>>>>>"], ["><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><>><<<<<>>>>>><>>><><><>><"], ["><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], ["><><><><><><<>>>>><>><"], ["><<<<<>>>><<><<<<<<<<>>>><<<<<>>>><><><><><><>>>"], ["><>><<<><>><<<<<>>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["<<<>><><<>><<>>><<<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>><>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<>>>><<>><<<<<<<"], ["<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<"], ["><><><><<<<<>>>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<<<<>>>>><<<<<>>>>><><><>"], [">>>>>><<<<<<<<<<<<>>><>>>"], ["><>><<<<<<<<<<<<><>>>>>>>><>>>>"], [">>>><><><><><<<<<>>>><>>>>><<<<<<<<<<<<<>>><>>><<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><<<<<"], ["<<<<<<><<>><>><<<<<>>>>"], [">>>>>><<<<<<<>>><>>>>>"], ["<<<><>><><><><><><><><>>>><<<<>>>>>>><<<<><><><><>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<>>>><<<<<<<<<<<<>>>>>>>>><><><><><><><><>><><><><><>>>><>><<>><<<<"], ["><>>><<<>>>>><<<<<<<<<<>>>>>>>>><>>>>"], ["><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>>>><<<><>><<<<<<<<<<>>>>>>>>><>>>><<<<<>>>><<<<<>>>>><><><><<>>>>>>"], [">>>>>>>"], ["><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><><><><"], ["><>>>>>>>><<<><>><<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><>>>>>><<<<<<<<<<<<>>>>>>>><><><><><><>><<<<<>>>>>"], ["><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><>><<<<<>>>>>"], ["<>><<<><>>>><<<<>>>>>><<>><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>>>>><>><><><><<<<<>>>><<<<<<<>>>><<<<>>><<<<>>>><><><><><><>>>"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>>>>>"], ["><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>><<<>>>><<<<>>>>>>>><><><><<<><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], ["><>>>>><<<>><><<<<>>>>><>>>>><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>><<<<<<<>>>>>>><<<<<<>>>><<<<<"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>>>>><>><><><><<<<<>>>><<<<<<<<<<<>>>><<<<<<<>><>><<<<<>>>>>>><>>>"], ["><><><><<<<<<>>><><><"], ["<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<<>>>><<<<>>>>>>><<<<<<<>>>>>><<<<<<<>>>><<<<<>>>>>>>"], ["><><><><<<<<>>>><<<><><>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>><<<<<><>><"], ["<<<<<>>>>><<<<<<<>>>>><<<<<>>>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>>>>><>><><<><><<<<<>>>><<<<<<<<<<<>>>><<<<<<<>><>><<<<<>>>>>>><>>>"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>><>>><<<><>><<<>><<<<>>><<<<>>>><><><><><><>>>"], [">>>>><"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><><><><><><><><>>>>><<>>>>>>><<>>>>>>><<<<<>>>>>"], ["<<<<>>>><<<<>>>>>>><<<<><>>>><><<<><<<<<<<<<"], ["><>><<<<<<<<<<>>>>>>>>><>>>><<<>>>><<<<>>>>>>><<<<>><<<<"], ["<<<>>>><<<<>>>>>>><<<<<><><<<<"], ["<<<>>>><<<<>>><<><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><>><<<<<"], ["<<<<>><>>>>>><<<<<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><>><><<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<<<<<<>>>>>>>>><><><><><><><><<<<<<>>>><>>>>"], ["><>><<<><>><<<<>>><><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<>>>>><><><><"], ["><><><><><><<>>>>><>><<>>><<<>>>>><<<<<<<<<<>>>>>>>>><>>>>"], ["><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><>>>>>><<<<<<<<<<<<>>>><>>>><><"], ["><><><><><><>><><><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>>>>>>><"], ["><><><><<<<<>>>><<<<<<<>>>><<<>><<>>>><><><><><><"], ["<<<<>><><<<<<<<<<"], ["><><><><<<><<>>>>><<<<<<<>>>>><<><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<"], ["><<<<<<<<>>><<<>>>><><><><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<><<<<<>>>>>>>><<<<>>>>>><<>>"], ["><><><><<<<<>>>><<<<<<<>>>>><<<<<<>>>><><><><"], ["><><><><<<<<>>>><>>>>><<<<<<<<<<<<<>>><>>><<<<<<<<<<<>>>><<<<<<>>>><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><>><<<<<>>>><>>>><<<<<<>>>>><><><><"], ["<<<<>><>>>>>><<<<<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<><>>>><><<<>><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><>><><<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<<<<<<>>>>>>>>><><><><><><><><<<<<<>>>><>>>>"], [">>>>><><<<<<<>>>><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>><>>>>>"], ["<<><<<>>>><<<<<<<>><>><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<<<<>>>>>>>"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>><>>><<<<<>>>>><<<<>>>>><<<<<<<<<<>>><>>><<<<<<<>>>>><>>><<"], ["<<><<<>>>><<<<<<<>>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<<<>>>>>><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>><<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<<<><<<>>>>"], ["><>><<<><>><<<<>>>><>>><>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>><<<<<>>>"], [">><>>>>>><<<<<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><><<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<<<<<<>>>>>>>>><><><><><><><><"], ["><><>>>><>>><><<<<>><><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<><<<<>>>>><<<<<<>>>><<<<<"], [">>>>><<<<<<<>>>><>><<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>><><><><><><>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<><><>><<<<<>>>>>><>>>><><>><"], [">>>>>>><<<<<<<>>><>>>>>"], ["><>>>>><<<<<<<>>><><><><<<<<<<<<<<>>>><<<<<>>>>><>>>>>"], ["><>><<<><>><<<<>>><><<><>>>>><<<<><>><<<><>><<>>><<<<<>>>><>>>>>>>><<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><><><><><><>><><>>>>><><<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<"], ["><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><>><<<<<>>>>>>><>>><><><>><"], ["><><><><><><<<<>>>><<<<<>>>><><><>>>>>><<<<>>>>>><<>><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], ["<><<<<>>>><<<<<<<>>>><<<>>>>>>"], [">><<<<<<<<<<>>><>>>>>"], ["><>><<><<<<>>>>>>>>><<<>>>><<<<<"], ["<<<<<>>>><<<<<<<>>>><<><<<>>>>>>>"], ["><>><<<>>>>><<<<<<<<<<>>>>>><><><><><><><><>><<>>>>><<"], ["<<<><><>>>><>>><><<<<>><><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<><<<<>>>>><<<<<<>>>><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><<<>>>>><><><>>>>>>><<<<<<<<<<<<>>><>>><<<<<"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><>><><><><><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<>>>>><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>><><<<<>>>>><>>>>><<<<<<>>>><>>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], ["><><><><<<><<>>>>><<<<<<<>>>>><<><><>>>>><<<<<><><><><><><><><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><>>><<"], ["<><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], ["><>><<<>>>>>><<<<<<<<<<>>>>>>><>><>>>>><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><>>>>>><<<><<<<<>>>"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<"], ["<<<>><>><<<>>>>><<<<<<<<<>>>><<<<<<<>>>>><<<<<>>>><<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><><><<<<<>>>>>><<<<><>><<<><>><<>>><<<<<>>>><>>>>>>>>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<"], ["<><<<<>>>>><<<<<<<<>>>>>>><<<<<>>>>>"], ["><>><>><><><><><><><"], [">>><<><<<"], ["><>><<<<<<<<<<<<><>>>>>>>><>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><><"], ["<<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>><>><><><><><><><<><><><>>"], ["<><<<<>>>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>><<<<>>>><<<<>>>>>>><<<<<<<<<<<<>>>><<<<<>>>><<<>>"], ["<<<<<>><><><><><><>><><>>>><<><>><><<<<>>>>>>>>><<<>>>><<<<<<>>>><<<<>>>>>>><<<<<>><<<<><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>><><><><><><><><>>"], [">>>>><<><>><<><<<<>>>>>>>>><<<>>>><<<<<<<<<<>>><>>>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><<<<<<>>>><<<<<<<>>>><<><<<>>>>>>>><<<<<<<<<<"], ["<<<<<<><<><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><><><><>><>><<<<<>>>>"], [">><>>>>>>>><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<><><><><><><><"], ["><><><><<<<<>>>>>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><<><><><"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<>><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><<<<<"], ["><><<><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><"], [">>>>><<<><><><><><><<>>>>><>><<>>>>>><<>>"], ["><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<<<>>><>>>>>><>><<<<<<>>>>>>><>>><><><>><"], ["><><><><><><>><<><><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>>>>>>><"], ["><><><><<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><><>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><<<>>>>>><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<<><><>>>>>>><<<<<<<<<<<<>>><>>><<<<<"], ["<<><<<>>>><<<<<<<>><>><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<<<<>>><>>>>"], ["><>><<<><>><<<<>>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><<<<<<<>><><><><<<<<>>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><><><><><><<<<>>>><<<<<>>>><><><>>>>>><<<<>>>>>><<>><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><<<<>><<<<><><><"], ["><>>>>><<<>><><<<<>>>>><<<<<<<>>>><<<<<"], ["><<<<>>>><<<<>>>>>><<>><><<<<>>>>><<<<<<<>>>><<<<<>>>>>>>"], [">>>><<<<<><><><><><><><><>>>>><<<<<<<<>>>>>>>>><<"], ["><>><<<>>>>><<<<<<<><<<>><><><><><><>><<>>>>"], ["<<<<<<>>>>><<<<<<<>>>>>>"], [">>>>><<<><><><><><><<>>>>><<>>"], ["><<<<<<<<>>><<<>>>><><><><><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><><><><><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<><<<<<>>>>>>>><<<<>>>>>><<>>"], ["<<<<<>>>>><<<<<<<>>>><<<<<<<<>>>><<<<>>>>>>><<<<>><<<<>>>>>>>"], ["><<<<<>>>><<<<>>>>>><<>>"], ["><><><><><><><<><><><><>><><><><><><>><"], ["><><><><<<<<>>>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<<>>>>><<<<<>>>>><><><>"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><>><<<<>>>>"], ["><><><><<<<<><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><<><><><"], [">>>>>><<<<<<<<<<>>><>>>"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<>>>>>>>>>"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><>><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>"], ["<<<>>>><<<<<>>>><><><<<<<>>>>>>>>><>>>>><><<<<<>>><<<<>><<<<"], [">>>>><<<<<<<<<>>>>>"], ["<<<>>>>>>><><><><<<<<<<<>><<<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>><<<<<"], ["><><><><<<<<>>>><<<<>>>>><><><><"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>>>>>><>>>><><>><"], ["<<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>>><><>>>><>>>><><<<<>><><<<<>>>>><<<<<<>>>><<<><><><><>><><>><>><<<><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><>><><>>><<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>><<<>>>><<<<<><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><<<<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>"], ["><>>>><><<<<><<<<<"], ["><><<<><><><><>><><><<><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>><><><><><><"], ["><>><><><<<<>>>><<<<>>>>>>><<>>><><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><"], [">>>>><<<<<<<<<<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<>>>>>>>>"], ["><>><<<><>><<<<>>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>>><<<<<>>>>><><><><<>>>>>>"], ["<<<<<<>>>>>>>>"], [">>>>><<<<><>>>>><>>>>>>>>"], [">><>><<<<><"], ["><><><><><><><>><><><><<<><<>>>>>><<<<<<<>>>>><<><><><>>>>><<<<<<<<<<>>>>>>>>><"], [">>>>><<<<>>>>><<<<><>>>>><>>>>>>>><<<<<<<<>>>><>>>"], ["><><<<<>>>>><>>>>><<<<<<<>><>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], [">><>>>>>>>><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>><>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<><><><><><><><"], ["><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<<>>>><<<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<"], ["><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<><<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], ["><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>>>><>>>>"], ["<<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<><<<<<<<<<<<<>>>><<<<<>>>><><><><><><>>><>>>><<><<<<>>>><<<<<<<><>><>><><><><><><><<><><><>>"], ["><><>>>><>>>><><<<<>><><<<<>>>>><<<<<<>>>><<<><><><><>><><>><>><<<><>><<<>><>><<<><>><<<<>>>><<><><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>><>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><<<>>>><<<<<<<>><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><>><<<<>>>><<><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<<<>>>>><><><>>>>>><<><<>>>>>>><<>><<<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><<"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><<<<<<>>>><<<<<<<>>>><<><<<>>>>>>>>><<<<<<<<<<"], [">>>>><<<<<<<<<<><>>><><<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<<<<>>>>>>>>"], ["><><><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><"], ["<><><><><<<<<>>>>><<><<<<<>>>><<>><><><"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>><>>><<<><>><<<<>>>><<><<<<>>>><<<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>>>>><>><><><><<<<<>>>><<<<<<<<<<<>>>><<<<<<<>><>><<<<>><>>>"], ["><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><<<<>>>>>>>>>>><><"], ["><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>><><><><><<>><<<<<>>>>>><>>>>><<<<<<<<<<>>>>>>>>>>>>"], ["><><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>><><><<<<<>>>><<<<<<<>>>><<>>>>><><><><"], ["<><<<>>>><<<<>>>>>>><<<<><>>>><><<<><<<<<<<<<"], ["<<<<<>>>>>><<<<<<<>>>>>>>"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><<><<<>>>><<<<<<<>><>><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<<<<>>>>>>><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><>><<<<>>>>"], ["<><><><><<<<<>>>>><<><<<<<<>>>><<>><><><"], ["><>>>><><<<<><<<<><"], ["><<<<<>>><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>>>>>><<<<<<<<<<<<>>><>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<>><<><<<<<<<<>>>><<<<<>>>><><><><><><>>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<><<<<>>>><<<<>>>>>>><<<<>><<<<<"], ["><>>>><><<<><<<<<<<>>>><<<>><<><>><><"], [">>>>><<<<<<<>>>><>><<<<<>><><><><><><>><<<>>>><<<<<>>>><><><><>><<<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<<><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>>>>>"], ["><>><<<><>><<<<>>><<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>>>>><<<<<<>>>><<<<<>>>"], ["><>><<<><>><<<<>>><><<><>>>>><<<<><>><<<><>><<>>><<<<<>>>><>>>>>>>><<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>><><><><><><><><>><<<<<>>>>>>"], ["><><<<<>>>>><<>>>>><<<<<<<>>>>>>><<<<<<>>>>>"], [">>>>>><<<<<<<<>>>>>>>>><<"], ["><><><><<<<<>><>>><<<<<<<<>>>><<><><><"], ["><<<<<>><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<><>>>>><<<><<<<<<<<>>>>>>>>><<>>><<<<<<<>>>><<<<<>>>><><<<<>>>>><>>>>><<<<<<>>>><>>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>"], ["<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><<<>>>>><><><>>><<<<<<<<<<>>><><<<<>>>>><<<<<<<>>>><<<<<>>>>>>>>>><<<<<"], ["<><<<<>>>><<<<<>>>><<<>>>>>>"], ["><><<<<>>><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>>>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><>><>"], ["<>>>>>>>><<<<>>>>>><<>>"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<><><><>><<<<<>>>><<<>>>><<<<>>><<>><<<<<>><>>>><><>><"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>><>>>>>><<<<<<<<<<>>>>>>>><><><><><><><><>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><><><><><<<<<>>>>><<><<<<<>>>><<>><><><<<<<<<<>>>>>"], ["><><><><><><><><><><><>><><><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<><><><>><"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><<><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><>><<<<>>>>"], ["><>><<<><>><<<<>>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>>><<<<<<<>><><<>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><><><<><><><><>><><><><<<><<>>>>>><<<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>>>>><<<<<<<>>>><<<<<>>>>>>><<<<<>>>>><<><><><>>>>><<<><<<<<<<>>>>>>>>><"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><>><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><<><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<"], ["><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>><><><><<<<<>>>><<<<>>>><<<<<<<<>>>><<<<<>>>><><><><><><>>><<<<<<<>>>><<>>>>><><><><"], ["<<<<<>>>><<<>>>>>>"], ["><><><><<<<<>>>><<<>><>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<>>>><<<<<<<<<<<<>>>>>>>><><>"], ["><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><>><<<<<>>>>>>"], ["><>><><>>><<<<<>><><><><><><>><><>><>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>>><<<>>>><<<<<"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>>><<<<<<>>>>"], [">><<<<<<<<<<>"], ["<><<<<>>>>><<<<<<<<>>>>>>><<<<<>>>>"], ["><>><<<>>>>><<<<<<<<<<>>>>>><><><><><><><><<>><<>>>>><<"], ["><><><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<><><"], ["<<<>><><<>><<>>><<><>>>><<>><<<<<<<"], ["><>><<<><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>><<<<<<<>>>>>>>>><>>>>"], [">>>>><><><><>><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><>><<<<<>>>>>>><>>><><><>><><<<<><>>>>><>>>>>>>>"], ["<><>><><<"], ["><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<"], [">>>>><><><><><><><>>>>><<<<<<<<>>>>>>>>><<"], ["<<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><><><<><><><>>"], ["><><><><><><><<><><><><>><><><><><>><><><><><><>><<><><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>>>>>>><<>><"], ["<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>><>>><<<<<>>>>><<<<>>>>><<<<<<<<<<>>><>>><<<<<<<>>>>><<<>>>><<<<>>><<>><<<<<<<"], ["<<<<<<>>>><<<<<<<>>>><><>>"], ["<<<<<>>>><<<<<<<>>><><<<<<>>>>>>>"], ["<<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><<><<<>>>><<<<<<<>><>><<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<<<<>>>>>>><><><><>><<<<<>>>>>><>>>><><>><><<><<<<<>>>><<<<<>>>>>>><>><<<<>>>>"], ["<<<<>>>>><<<<>>>>>>><<<<<<<"], ["<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>><><"], [">><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<<><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>><<<<>>>>>><<>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<>>>"], ["><><>>>>><><><><><><<<<>>>><<<<<>>>><><><><><<<<<>>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><<>>>><><<<<>><><<<<>>>>><<<<<<>>>><<<><><><><>><><>><>><<<><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<>>>>>><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>><><><>><<"], ["><><><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<><><><><><<<"], ["<><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>>>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><<<<>>>>>>>>>>><><"], [">>>>>>>>>>>><<"], [">>>><<<><>>>><><<<><<<<<<<><><><>><><><><><>>>>><<<<<<<<<<>>>>>>>>><"], [">><<<<<<<<>>"], ["><><><><<<<<>>>><<<<<<><>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["<<<<<<>>>><<<<<<<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><><><><><><><><>>>>><<>>>>>>><<>>>>>>><<<<<>>>>><><>>"], ["><>>>>>>>>"], ["><>>>>>>>><<<><>><<<<>>>><<><<<<>>>><<<<<><<<<>>>>><<<<<<<<>>>>>>><<<<<>>>><<<>>>><<>>><>>>>>><><>>>>>><<<<<<<<<<<<>>>>>>>><><><><><><>><<<<<>>>>>"], ["<<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>><>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<"], ["><><<><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><><"], [">><>>><<<<<<<<<<>>>>>>>>"], ["><><<<<>>><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>>><>>>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>"], ["><><><><><><><><><><><>><><><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>><<<<<>>>>><<<<<<<>>>><<<<<<<<>>>><<<<>>>>>>><<<<>><<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<><><><>><"], ["><><<><><><><>><><>><"], ["<<<>>>><<><><<><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<><>>>><><<<><<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<<<<<>>>>><><><><<<>>>>><><><>>><<<<<<<<<<>>><><<<<>>>>><<<<<<<>>>><<<<<>>>>>>>>>><<<<<"], ["<<<<<>>>>><<<><<<<>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<>>>>>>>"], ["><><><><<<<<>>>><>>>>>><<<<<<<<<<<<<>>><>>><<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>>>><><><><"], ["<<<<<<<><<>><>><<<<<>>>>"], ["<<<<<<<><>><>><<<<<>>>>"], ["><><><><><><><><><><><>><><><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<><><><>><"], ["<<<>>>><><<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><>>>>>>><<<<<<<<<<<<>>><>>><<<<<"], [">>>>>><<<<<<<<<<<>>><>>>><>><<<><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>><<<<<<<>>>>>>>>><>>>>"], ["><><><><<<><<>>>>><<<<<<<>>>>><<><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<<<>>>><<><<<>>>>>>>>><<<<<><><><><><><><><><><><>><><><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<><><><>><<<<<<<<>>>>>>>>><<"], ["><<<<<>>>><<><><><><>><<<<<>>>>>>>>>><>><><><><<<<<>>>><<<<<<<<<<<>>>><<<<<<<>><>><<<<<>>>>>>><>>>"], [">>>>><><><><><><><><<<<<<<<>>>>>>>>><<"], ["><>><<<<<<<<<<<>>>>>>>>>><>>>>"], ["><><>>>><>>><><<<<>>><><<<<>>>>><<<<<<>>>><><><><><>><><>><>><<<>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>><<<><>><><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><<<<<"], ["><><><<><><><><>><><><><<<><<>>>>>><<<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<<<<<>>>>>><<<<<<<>>>><<<<<>>>>>>>><<<<<>>>>><<><><><>>>>><<<><<<<<<<>>>>>>>>><"], ["<><<<<>>>"], ["<<<>>>><<<<>>>>>>><<<<<<><"], ["<<<<>>>><<<<>><>>>>><<<<<<<<<<<<>>>><<<<<>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><<<<<>>>><<<<<>>>>><><><><><><><><<<<<>>>>><<><<<<<>>>><<>><><><<<<<<<<>>>>>"], ["><><><><<<<<>>>><>>>>>><<<<<<<<<<<<<>>><>>><<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<><><<<><><><><><>><<<>>>>><<<<<<<<<<>>>>>><><><><><><><><>><<>>>>><<>><><><<><><<<<<>>>><<<<<<<<<<<<>>>><<<<<<>>>>><<<<<>>>><>>>><<<<<<>>><><><><><><<<>>>>><><><><"], ["><><><><><><<>>>>><>><<<<<>>>>>>>>><>>>>"], ["><><><><<<><<>>>>><<<<<<<>>>>><<><><>>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<"], ["<><<<>>>><<<<>>>>>>><<<<><>>>><><<<><><<<<<<<<"], ["><>>>>><>>>><<<<<<<<<>>>><<<<<<<>>>>><<<<<>>>>><<<<<"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>><<<<<<<<><<<>>>><<<<<<<>><>><<<<<>>>>>>><<>>>><<<<<>><<<<<>><><><><><><>><><>>>>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><>>>><><>><><<<<<<<>>>><<<<<>>>>>>><>><<<<>>>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["<<<<<<>>>>><>>>>>>"], ["<>><<<><>>>><<<<<>>>>>><<>><<<<<<<<>>>><<<<<>>>>>>>><<<<>>>>>><<>>"], ["><>><<<<<<<<<<<<>>>>>>>>><>>>>>"], ["><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>><>>>>"], ["><<<<<<<<>>><<<>>>><><><><><><><<<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><><><><><><<<<<>>>><<<<<<<<>>><>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<><<<<<>>>>>>>><<<<>>>>>><<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><><<<<<>"], ["><><><><<<<<>>>>><<<<<<<>>>>><<><><><"], ["><><<<<>>>>><<>>>>><<<<<<<>>>>>>><<<<<<>>>><><<><><><><>><><>><>>"], ["<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>>><<<><<<<>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<>>>>>>><<<<<>>>><<<<<>>>><><><><><><"], [">>><>>><<<<<<<<<<<>>><>>>"], [">>>>>>>>>>><<>>"], ["><<<<<<<<>>>><<<<<>>>>>>>>><<<<>>>>>>"], [">>>>><<<<<<<<<<<<<>>>><>>>"], ["><><><><<<<<>>>><<<<<<<>>>><<<<<>>>><><><><><>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>><<<<<<><>><"], ["<>><>><><<"], ["<<<>>>><><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<"], ["><>><<<>>>>><<<<<<<<<<>>>>>><<><><><><><><><>><<>>>>"], ["<>>>><>>>>>><<<<<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<<<<<<<>>>>>>>>><><><><><><><><<<>>><<<>>>><<>>>"], ["<><<<<>>>>>>><<<<<>>>>>"], ["<<><<<>>>><<<<<<<>><>><<<<<>>>><<<<>>>>>>>><><>>>>><<<<<<<<<<<>>><>>>><><<<<<>>>><<<<<<<>>>><><><><><><><><><><><><>><><><><><><>><<<<<>>>>><><><><<<<<<<<<<<<>>><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>>"], ["><><><><<<<<<>><><<<<<<<<>>><><><><><><<>>>>><>><<>>><<<>>>>><<<<<<<<<<>>>>>>>>><>>>>><><><"], ["<<<>><>><<<>>>>><<<<<<<<<>>>><<<<<<<>>>>><<<<<>>>><<<<<<>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>>>>>>><>>>>>>><<<<>>>>>>>><><><><<<<<>>>>>><<<<><>><<<><>><<>>><<<<<>>>><>>>>>>>>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<"], ["><><><><<<<<><>>><<<<>>>><><><><"], ["><>><<><<<<>>>><>>>>><<<<<<<<<<>>><>>>>>>><><><><><><>><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><><><><<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><><><>>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<"], ["><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><<<<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<><<<<>>>><<<<>>>>>>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>>>><<<<>>>>>>>>>>><><"], ["<<<<<>>>><<<<<<<>>>>><<<<<>><>>"], ["><>><<<>>>>><<<<<<><<<>><><><><><><>><<>>>>"], ["<<<>>>><<<<<>>>><><><><>><<><<<<<<<<>>>>>>>>><>>>>><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<><<<<"], ["<<<<<<><<>><>><<<<<<<<>>>><<<<>>>>>>><<<<<><><<<<>>>>"], ["><><><><><><><>><><>>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<<>>>><><><><<><><"], ["><><><><<<<<>>>><<<<>>>>>>><<<<<<<><><<<<>>>><<<<<>>>><><><><><<<<<>>>><<<<<<<<>>>><>><<<<<<<<<<<>>>>>>>>><>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>>>>><<<<>>>>>>><<<<>><<<<><><><"], [">><<<<<<<<<<>>>><>>>>>"], ["><>><<<<<<<<<<<<><>>>>>>>><>>>>><><><><<<<<>>>><<<<<<<>><<<<<>>>><><><><><><"], ["><>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>>><<<<<>>>><><><><><><>><>>>><><<><<<<<>>>><<<<<<<<<<<<>>>>>>>>"], [">>>>><<<<<<<<<<>>><>>>><<<<<>>>><<<<<<<>>>><<<<<>>>>>>><<<<>>>>>>>>><>>>>>>"], ["><><><><<<<<>>>><<<<<<<>><>><<<>>>>><<<<<<<<<<>>>>>>>><>>>>>>><<<<>>>>>>>><><>><><><><><><><<<<<<<><<>><>><<<<<>>>><<<<<>>>><<<<<<<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], [">><<<<<<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><>><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><>><><><><<<<<>>>>><<><<<<<>>>><<>><><><<<<<<<<>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<><<<>>>><<<<>>><<<<<>><><><><><><>><><>>>>><>><<<<<><><><<<<<<<<<<>>>>>>>>><<>>><><><><><><>><>><<<><>><<<><>><<<<>>>><<<<>>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<<<>>>><<<<>>>>>>><<<<>><<<<<<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>><><><><><><><><>>>>>>><><><><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<<<<<>>><><><><><><><><><<<<<<<>>>>"], [">>><<<>>>><<<<<>>>><><><><>><<<<<<<<<<>>>>>>>>><>>>>><><<<<<<>>>><<<<<<<<>>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<>>>>>>>>>>>>><<<<<<<<<<<>>>>>>>>><<<<>>>>>>><<><<<<<<><<<"], ["><<<<<<<<>>>><<<<<>>>>>>>><<<<><<<<>>>>><<<<<<<>>>><<<<<>>>>>>>>>>>"], ["<>>><>>>>>>>>>>><><><><><><><><"], ["><><><><><><>><>><<<><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><><><>>>><>>><<<>>>>><<<<<<<<<<>>>>>>>>><>>>>>>><>>>><><>><"], [">>>>><<><>><<><<<<>>>>>>>>><<<>>>><<<<<<<<<<>>><>><<<>>>><><><><><<<<<>>>><<<<<<<<>>>><<<<<>>>>><><><><<<<>>>>>>><<<<<>>>>><<<<<<<<<<<>>>>><>>><<>>>"], ["<<<>>>><<<<>>>>>>>>><><><><><><>><<<><<>>>>><<<<<<<>>>>><<><><><>>>>>>>>><"], ["><>><<<><>><<<<>>>><<><<<<>>>><<<<<<<>><><><><<<<<>>>><<<><>><<<<<<<<<<>>>>>>>><>>>>><<<>><><<<<>>>>><<<<<<<>>>><<<<<>><>>>><<<<<>>>><<<<<>>>>><><><><<>>>>>>"], ["><>><<<><>><<<<>>>><<>><<<<>>>><<<<<<<><>>>>><<<><<<<<>>>><<>>><>>>>>><><><><><><><><>><<<<<>>>><<<<>>>><<<<>>>>>>><<><><><><<<<<>>>><<<<<><><><><><><><><>>>>><<<<<<<<<<>>>>>>>>><<>><><<<<<<<<>><><><><<<<<<<<<<<>>>><<<<<>>>><<<>>"], ["<>>>>><<<<<>>>>><>><<><<<<<>>>><<<<<<<>>>><<<<<>>>>><><><><<<<<>>>>><<<><<<<>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<>>>>>>><<<>>>>>>><><><><<<<<<<<<<<<<<<<<<<>>>><<<<<>>>><><><><><><"], ["><><><><>"], ["<<<<><>>>><<><>>>><<<>>>>"], ["<<<>>><<>>>>><<<<<>>>>><<>>>><<<>><>><<<<<<>>>>>>"], ["<><><><>"], ["<<<><>>><>>><>>><<><<<>"], ["<<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>><<<><>>"], ["<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<"], [">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>"], ["<>><<<>>>>><<<<<<<<<<>>>>>>>>>>>>><<<<>>>>>><<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>"], ["<><><><><>><><><><><"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<>><<<>>>>><<<<<>>>>>><<>>"], ["<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<<<>>>>>><<<<<>><>>>"], ["<>><<<>>>>><<<<<>>>>>><<>"], ["><>><<<>>>>><<<<<>>>>>><<>>"], ["><<>><<<>>>>><<<<<>>>>>><<>>"], ["><<>><<<>>>>><<<<<>>>>>><<>>>>><<<"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["><>><<<><<>>>>"], ["<<<<<>>>><<<<<<<>>>><<<<<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["<<<>>>><<<<>>>>>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>><<<<<>><<>>>"], ["<<<>>>><<<<>>>>>>>><<<<<<<"], ["<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>"], ["<>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>>"], ["<<<<<>>>><<<<<<>>>><<<<<>>"], ["<><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>"], ["<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["><>><<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<>>>>>><<<<<>><>>>"], ["<>><<<>>>>><<<<>>>>><<>>"], ["<<<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>"], ["><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>"], ["<>><<<>>>>><<<<<>>>>>><<<>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["><>><<<><><>>>>"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<"], ["><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>"], ["<><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>>"], ["<<<<<>>>><<<<<<<><>>><<<<<>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>><<<<<>><<>>>>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<"], ["><<>><<<>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>>"], [">>>><<<<<>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><"], ["><>><<<><<>><>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>>"], ["<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<"], ["<><<<<>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>><<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<<>><>>>"], ["><><<><><><><><><><"], ["<>><<<>>>>><<<<<>>>>><><<>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><><><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>><>><<<<>>>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>>"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>>"], ["<<<<>><><<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>><>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>>>><<>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<>><<<>>>>><<<<<>>>>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>"], ["><>><<<>><>>><<<<<>>>>>><<>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<>>><>"], ["<><<<<>><>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<>>>><<<<<>>>>>>><<<<<<<"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<<<<<>>>><<<<<<<><>>><<<<>>"], ["<><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>>><<<<>>>>"], ["><<>><<<>>>>><<<<<<>>>>>><<>>>>><<<"], ["<><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>><<<<<<<<<<<>>>>>>><<<<>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<>>>>>"], ["<<<>>>><<<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<"], [">>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>"], ["<>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<"], ["><><<><>><<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>>"], ["<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<"], ["><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>>>"], ["><>><<<><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>>>>>><<<<<<>>>>"], ["<><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>><<<>>>>><<<<<>>>>>><<><>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<<<>>>><<<<<<<>>>><<>><><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<>><<><<>>"], ["><<>><<<>>>>><<<<<>><<>><<<>>>>><<<<<>>>>>><<>>>>>>><<>>>>><<<"], ["<<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<><><><><>><><><><><<><<>><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<>>>><<>>><>>>><<<<<<<<<<<>>>>>>><<<<>>"], ["<<<>>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["><<<<<>>>><<<<<<<><>>><<<<<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>"], ["<><<<<>>>><<<<><<<<>>><<>><<<>>>>><<<<<>><<>><<<>>>>><<<<<>>>>>><<>>>>>>><<>>>>><<<>>>"], ["<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<>>>>>"], ["><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>>"], ["><><<><>><<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><><><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>><>><<<<>>>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>"], ["<>><<<>>>>><<<<><<<<<<>>>>>>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>>><<<<>>>>>><<>>"], ["><><<<<>>>>><>>>><<<<<>>>>"], ["<>><<<>>>>><><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>>>>>>>>><<>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<<<>>>>>><<<<<>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>><><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<<<>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>"], ["<><<<<>>>><<<<<<<>>>>><<>><<<>>>>><<<<<>>>>>><<>>>>><<<<<>>><>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<><>><<<<>>>>"], ["<><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<<>><<<>>>>><<<<>>>>>><<>>>>><>>>><<<<<<<<<<<>>>>>>><<<<>>"], ["><><<<<><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>>>"], ["<><<<<>><>><<<<<<<>>>><<>>><>>>>>>><<<<>>>>>"], ["<>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>"], ["><><><><><<>><<<>>>>><<<<<<<<<<>>>>>>>>>>>>><<<<>>>>>><<>>><><><><"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>><><<<<<>><>>>"], ["<><<<<>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>><<<<>>>><<>>><>>>>>><<<<<<<>>>><<<>><>>>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>><><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<<<>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>><<<>>>>><<<<>>>>>><<>><<<<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>>><<<<<>><>>>>>>>><<>>>>>><<<<<<<<"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<<<>>>>"], ["<<><<<<>><>><<<<<<<>>>><<>>><>>>>>><<<<>>>>>"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<<>>>>>>>>><<<<<<<<"], ["<<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<>>>>>"], ["<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>"], ["><><<<<>>>>><>>>>><<<><><<<<>>>>>>><<<<<<>>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><>>>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<<<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<>>><>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>><><<<<<>><>>><"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<><>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><><><<<><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>><>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<<<>>>>"], ["<><<<<>>>><<><<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>>>><<<<>><>>>"], ["<><<<<<>>>><<<<<<<>>>><><>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<<<>>>><<<<<<<<>><<<>>>>><><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>><>><<<>>>>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><<<<<>><>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>>><<<<<>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<><>><<<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<>><>>><<<>>>>>>>>>>>>><<<<>>>>>><<>>"], ["<><<<<><<<<<>>>>>>>><<<<>><>>>"], ["<>><<<>>>>><<<<<<<<<<>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>"], ["><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>><>><<<><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>><<<<<<>>>>"], ["<><<<<>>>><<<<<<<>>>><<><<<<<<<<>>>>>"], ["<><><><><>><<><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>>><<<<<<<<<<<>>>>>>><<<<>>"], ["<><<<<>>>><<<<<<<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>"], ["<><<<<>><>><<<<<<<>>>><<>><><>>>>>>><<<<>>>>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<<><<><<>>>><<<<<<<>>>><<>>><>>>>>><<<<>>>>>"], ["><>><<<><<>>>><>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>><>><<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>>"], ["<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>><<<<<>><<>>>>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<><<<<<<<>>>>>>><<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>>><<<<<<<>>><><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["<><<<<>>>><<><<<<<>>>>><<>>><>>>>>><<<<<<<>>>>><><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<>><>>>"], ["<>><<<>>>>><<<<<<<<<<>>>>>>><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>"], ["<><<<<>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>><<<<>>>><<>>><>>>>>><<<<<<<>>>><<<>><>>>"], ["<>><<<>>><<>><<<>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<><<>><>>>>>>><<>>>>><<<>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>>>>>>>><<<<>><>>>"], ["<><<<<>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>><<<<>>>><<>>><>>><>>>><<<>><>>>"], ["<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<><><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>><<<<<<<<<<<>>>>>>><<<<>>>>>>"], ["<><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<><<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>><<<<<>>>>>"], ["<<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>><<<<>>>><<<<<<<><>>><<<<>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<>>>><<<<>>>>>>><<<><<<<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<<<<><>>>>><<>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<><>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>><><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>"], ["<><><<<>>>>><<<<>>>>><<>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<"], ["<><<<<>>>><<><<<>>>><<>>><>>>>>><<<<<<<>><>>>>>><<<<<>><>>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><>>>>><<<<<<<><>><<<<>>>>"], ["><<<<<>>>><<<<<<<><<>><<<>>><<>><<<>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<><<>><>>>>>>><<>>>>><<<>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>><<<<<>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>><>><<<><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], [">><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<><<<<>><>><<<<<<<>>>><<>>><>>>>>><<<<>>>>><<<<<<<>>>><<<<<<>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>>><<<<<<<>>><><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<<>><><<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>><>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>><<"], ["<><<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>><<<<<<<>>>><><>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<><>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>><<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>><>>>"], ["<><<<<>>>><<<<<<<<<<<<<<>>>>>"], [">><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<><>>>><<<<<>>>>>>><<<<<<<"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<>>>><<<<>>>><>>>>>>><<<>><<<>>>>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<><<<<<<<<>>>>>>>>><<<<<<<"], [">><><<<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["><>><<<><>><>>>"], ["<<<>>>>><<<<>><<<>>>><<<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<"], ["<>><<<>>>>><><<<<>>>><<<<<><>><<<>><>>><<<<<>>>>>><<>><<>>>>>><<>"], ["<><<<<>>><><<<<<<<>>>><<>>><>>>>>><<<<>>>>>"], [">><><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["><><<<<>>>>><>>>>>><<<<><<<<>>>>>>><<<<<<>>>>"], ["<><<<<<>>>><<><<<>>>><<>>><>>>>>><<<<<<<>><>>>>>><<<<<>><>>"], ["<<<>>>>><<<<>>>>>>>><<<<<<<"], ["<>><<<>>>>><<>><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<>>>><<<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<>>>>>>><<<<<>>>>>><<<<<<>>>>>>"], ["<><<<<>><<>><<<>>>>><<<<<>>>>>><<>>>>><<<>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>"], ["<<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<<<<<<"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>><<<<<<>>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>><>><<<>>>>><><<<<>>>><<<<<<<>>>>>><<>>>><<<<<>><>>><<<<>>>>>><<>>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>><<>><<<>>>>><<<<<>>>>>><<>>>>><<<>>><<<<<<<>>><><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<<<<<<>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>>"], ["<><<<<>>>><<<<<<<>>><><<>>><>>>>>><<<<<<<>>>>>><>><<<<<>><>>>"], ["<><<<<>>>><<><<<>>>><<>>><>>>>>><<<<<<<>><>>>>>><<<<<<>><>>"], ["><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>><>><<<>><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>><<<<<<>>>>"], ["<><<<<>><>><<<<<<<><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>><<>><><>>>>>>><<<<>>>>>"], ["<><><<<<>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>><<<<>>>><<>>><>>>>>><<<<<<<>>>><><<>><>>>><<<>>>>><<<<>>>>><<>>"], [">><><<<<>>>>>>>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<<>>>>>><<>>"], ["<><<<<>>>><<<<<<<>>>><<<<<>>>><<<<>>>>><><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>><>><<<><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<<<>>><>"], ["><><<<<><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><>>>><><<<<><<<<>>>>>>><<<<<<>>>>"], ["<<><<<<>>>><<<<<<<>>>><<>>>><>>>>>>><<<<>>>>>"], ["><><<><>><<<<>>>>>><><<<<>>>>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>>>>>><<<<<<>>>><>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>"], ["<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>"], ["><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<><>><<<><<<>>>><>>>>"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<<>>>><<<<>>>>>>><<<<<<<><<<>>>>>><<<<<<<<<<>>>>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>><>>>>><<<<<<<<<<<<>>>>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<><>><<<<>>>><<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<><<<<>>>><<><<<<<>>>>><<>>>><>>>>>><<<<<<<>>>>>>>>><<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<>>><><<<<>>>>><>>>>><<<<<<<>>>>>>><>>>>><<<<<<<><>><<<<>>>>"], ["<<><<<<>><>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<>>>><<<<>>>>>>><<<><<<<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>>><<>>><>>>>>><<<<<<<>>>><>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<>>>>>>><<<<<<<<<<<<<<<>>>><<<<<<>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<<<>>>><<<<<<<><>>><<<<<>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["><><<<<>>>>><<<<>>>>>><<>>><<<<<<>>>>"], [">><><<<<>>><><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<><<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>>><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>><<>>><<<<>>>><<<<>>>>>>><<<><<<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><><<<<>>><><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<><<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<><<>><<<>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>>>><<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>>>>>>>><<<<>><>>>"], ["<><<<<>>>><<<<><<<<>>>><<<><<<<>>>><<>>><>>>>>><<<<<<<<<<<<><>>>><<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<<>>>>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><>><<<>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>>"], ["<><<<<><<<<<>>>>>>>><<<<>>"], ["<><><><><>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><>>>>><<<<<<<><>><<<<>>>>><><><><<><<<<>>>><<<<<<<>>>><<<>><<<>>>>><<<<>>>>>><<>>>>><>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><>>>>>><<<>>>>>><<<<>>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><>><<<>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>><<<>>>>><<<<<>>>>>><<>><>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>><>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<>>>>><<<<<>>>>>"], ["<><<<<>>>><<><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>>><<<<<>><>>>"], ["<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><>><<<>>>>><<<<<>>>>>><<>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<<>><>>><<<<>>>>>><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>><><<<<<>><>>><>>><<<<>>>><<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>><<<<<<><>>><<<<>>"], ["><><<<<>>>>><>>><<<<><<<<>>>>>>><<<<<<>>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<><><><<<>>>>><<<<>>>>><<>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<>><><<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>><>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<><<<<<<>>>>>><<<<<>>>>"], ["<>><<<>>>>><<><<<<>>><><<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>>><<<<>>>>>><<>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>>><<><>><<<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<>><>>><<<>>>>>>>>>>>>><<<<>>>>>><<>>"], ["<><<<<>>><>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>>"], ["<>><<<>>>>><<>><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<>>>><<<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><>><<<><<>><>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>><<<<<<<<<<<>>>>>>><<<<<>>>>>><<<<<<>>>>>>"], ["<><<<<>>>><<><<<<<>>>>><<>>><>>>>>><<<><<<<>>>>>>>>><<<<>><>>>>"], ["<>><<<>>>>><><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>><>>>>>>><<>>"], ["><>><<<><<>>>><><<<<>>>><>>>>>><<<<<><<<<<>><>>>"], ["<>><<<>>>>><<<<><<<<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>>>>>>>><<<<>>>>>><<>>"], ["<><<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>><<<<<<<>>>><><>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<>>>>><<<<<<<<<<<<>>>>>"], ["<<><<<<>>>><<<<<<<><>><<<>>>>><><<<<>>>><<<<<<<><><><<<>>>>><<<<>>>>><<>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>><<>>>><>>>>>>><<<<>>>>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<>><<<>>>>><><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>>><>>>>>>><<>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<<>>><>>>>>><<<<<<<>>>>>><>><<<<<>><>>>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<><<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<><<<<>><>><<<<<<<>>>><<>><><>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>>>>>>><<<<>>>>>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>><><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>><<<<<<>>>>"], [">>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>><><<<<<>><>>><>>>"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<"], ["><><<><<<<>>>><<<<<<<>>>><<>>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>><>><<<>><<>>>><><<<<>>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>>><<<<<<>>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<<<>>>><<<<<<<<>><<<>>>>><><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>><>><<<>>>>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><<<<<>><>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>>><<<<<>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<><><<><>><<<<>>>>>><><<<<>>>>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>>>>>><<<<<<>>>><>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>"], ["<<<<<>>>><><<<<>>>><<<<<<<<<<<<<<>>>>>><>>><<<<<>>"], ["<><<<<>>>><<<<<<<>>>><<>>><<<<>><>><<<<>>>>>>><<<><<<<>>><><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>>><>>>>>><<<<<<<>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<<<>>>><<<<<<<><>>><<<<<>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<<>><><>><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>><>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>"], ["><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><><>><<<>>>>><>>>>><<<<<<<<>>>>>>><<<<<<>>>>"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<<>>><>>>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<<>>>>>>><<<<<>><>>>"], ["<<<>><><<<<>>>>><>>>>><<<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>><>>>>><<<<<<<><>><<<<>>>>"], ["<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<><>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><><><<<><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>><>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<<<>>>><<>>"], ["<<<>>>><<<<<>>>><>>>>><>><<<<<<<<<<>>>>>>>>><<<<<<<"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>>"], [">><><<<<<>>>><<<<<<<>>>><<>>><<<<<<<>>>><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>><<<<<>>>>>><<<"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<><><<><>><<<<>>>>>><><<<<>>>>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>><>>><<<<<<<<>>>>>>><<<<<<>>>><>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>"], ["<><<<<>>>><<><<<<<>>>><<<>>><>>>>>><<<<<<<>>>>>>>><<<<>><>>>"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<>>>>><<<<<>>>>>"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>"], ["<><<<<>>>><<<<>>>><<<>>><>>>>>><<<<<<<>>>>>><>><<<<<>><>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>><>>>><<<<<>>>>>><<<>><<<<<><>>>>><<>"], ["<<<>>>>>><<<<>><<<>>>><<<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<<<>>>>><<<<>><<<>>>><<<<<<<<<>>>><<<<>>>>>>><<<<<<<<<<"], ["<<<>>>><<<<>>>><>>>>>>><<<>><<<>>>>><><<<<>>>><<<<<<<>>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<><<<<<<<<>>>>>>>>><<<<<<<"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>><<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<><<<<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>>"], ["<><<<><>><>><<<<<<<>>>><<>><><>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>>>>>>><<<<>>>>>"], ["<<<>>>><<<<>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<"], ["<<<>>>><<<<>>>>>>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<"], ["<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<<<<<<<<<<>>>>>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<><>><<<<>>>><<<<<>>>>>>>><<<<<>><>>><<<<>><>>>><<>>>>><<<"], [">><><<<<>>>><<<<><<<>>>>><><<<<<>>><>><<<>>>>><><><<<<>>>>><>>>>><<<<><<<<>>>>>>><<<<<<>>>><>>>>>>><<>>>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], [">><><<<<>>>>>>>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<><><><><>><><><><><<><><>><<<><>><>>><<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<<<<<<>>>>>>><<<<>>>>"], ["<<<<<>>>><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<<<><>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><><><<<><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>><>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<><<<<<>>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>><><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<><<<>>>><<<<>>>>>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>><<<<<<>>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>><>>>><<<<<>>>>>><<<><<<<><>>>>><<>"], ["<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><<<>>>><<<<<<>>"], [">><><<<<>>>><<<<<<<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<<>>>>>><<>>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<"], ["<<<>>><><<<<><><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>><<<<<>>>>>>>>><>>>>>>><>>>>><<<<<<<><>><<<<>>>>"], ["<<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<><<>><<<>>>>><<<<<>>>>>><<>>>>><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<<>><>>><<<<>>>>>><<<><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<><>>>>>><><<<<<>><>>><>>><<<<>>>><<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>><<<<<<><>>><<<<>>"], ["<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<><>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<<>>>>>>><<<<<<<<<<"], ["<<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<>><><<<<>>>><<<<<<<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<<"], ["<><<<<>>>><<><<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>>>><<<<>><<>>>"], ["<<<<>>>>>><<<<>><<<>>>><<<<<<<<<<>>>>>>><<<<<<<<<<"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<><><<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>><<<<<<<>>>><><>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<<>>>>>>>>><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<>>>>><<<<<<<<<<<<>>>>>>>><<<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>><<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<<<>>>><<<<<<<<>><<<>>>>><><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>><><><<<>>>>><><<<<>>>><<<<<<<>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><<<<<>><>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>>>><<<<<>>"], ["<>><<<>>>>><><<<<<>>>><<<<<<<<>>>>>><<>"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><>><<<>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>><>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>>"], ["<>><<<>>>>><><<<<>>>><<<<<><>><<<>><>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<><><<><>><<<<>>>>>><><<<<>>>>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><<<>>>>><>>>>><<<<<<<<>>>>>>><<<<<<>>>><>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>><>>>>>><<>><<>>>>>><<>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<><>><<<<>>>><<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><>><<<>>>>><<<<<>>>>>><<>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<<<>>>><<<<<<><>>>><<<<<>>"], ["><<>><<<>>>>><><>><<<><>><<<>>>>><<<<><<<<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>>>>>>>><<<<>>>>>><<>><<>>>><><<<<>>>><<<<><<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["><><<<<>>>>><>>>>><<<<<<<<>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><>><<<>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>><<<<<>><<>>><<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>>>>>>>>>>>><><><><><><><><><<<<<>>>>>><<>>>"], ["<><<<<>>>><<<<<<<><><<<<>>>>><>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>"], ["><><<><>><<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>>><><<<<>>>>><<<<>>>>>><<>>><<<<<<>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>"], ["><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<>>>>"], ["<><<<<>>>><<><<<<<<<>><>>>"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>>><<>>>><>><<<>>>>><><<<<>>>><<<<<<<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<<<>>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>><<<"], ["<<>><<<>>>>><<<<>>>>>>><<>><<<>>>>><<<<<<>>>>>><<>>>>><<<<>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><><<<>>>><<<<<<>>"], ["><><<<<>>>>><>>>>><<<<<<<>>>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>>>>>><<<<<>><>>>>><<<<<<>>>>>>>><<>>>>>><>>>>><<<<>>>>>><<>>><<<<<<>>>>"], ["><><<<<>>>>><>>>>><<<><><<<<>>><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><<<<<<>>>>"], ["><<><><<<>>>>><<<<<>>>>>><<>>>>><<<"], ["><><<><<<<>>>><<<<<<<>>>><<>>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>><><<<<>>>>><<<<>>>>>><<>>><<<<<<>>>><<<>>>>>>>><<<<<>><>>>>>>>><<<<<<>>>>"], ["<><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>><<<<<<<<<<<>>>>>>><<><<>>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><><>>>>><<<"], ["><<>><<<>>>>><><>><<<><<>>>><><<<><>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], [">><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<>>><>><<<>>>>>>><<<<>>>>>><<>><<><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>><>><<<>>>>><>><<<>>>>><><<<<<>>>><<<<<<<>>>>>><<>><<<>>>>><<><<<<>>>><<<<<<<<>>><>><<<>>><<>><<<>>>>><<<<<>><><<<<>>>><<><<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<><<>><>>>>>>><<>>>>><<<>>><<><<<<>>>><<<<<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<<<>>>><<<<<<<><>>><<<<<>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["<>><<<>>>>><<><<<<>>>><<<<<<>><><<<<>>>>><>>>>><<<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>><>>>>><<<<<<<><>><<<<>>>><<<<<>>>><<>>>>>>><<<<<>><>>><<<<>>>>>><<>"], [">><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>><>><<<>>>>><<<<><<<<<<>>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>><<<<<>><>>>>>>>>>><<<<>>>>>><<>><<>>>>>><<<"], ["<><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>><<<<<<<<<<<<>>>"], ["<><<<<<>>>>><><<>"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<><<<<>>>><<<<<<<<>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>><<<<>><><>><><<<<>>>><<<<<<<>>><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>><<<>>><>><<<>>>>>>><<<<>>>>>><<>><><>><<<>>>>><>><<<>>>><><<<<>>>><<<<><<<>>>>><><<<<<>>>><<<<<<<>>>>><><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>>><><<<<<>>>><<<<<<<>>>>>><<><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<<<>>>><<<<<<<>>>><<>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><><>>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>><<<<>><><<<<>>>><<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>><>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>>><<<<<<<<<<<"], ["<<><<<<>>>><<<<<<<>>>><<>>><>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<><>>><<<>>>>><<<<<>>>>>><<<><<<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><><<<<>>>>>>><<<<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>><<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<>>>>>><<<<<<<<<<<<>>>>>>>"], ["<<><<<<>>>><<<<<<<><>><<<>>>>><><<<<>>>><<<<<<<><><><<<>>>>><<<<>>>>><<>>>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><<<<<>>>>>>>>><<<<>>>>>"], ["><>><<<><<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<><<<<>>>><<<<<<<><>><<<><<>><<<>>>><<<<<>>>>>>><<<<<<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><<<<<>>>>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>"], ["<>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>><>>><<<<<>>>>>><<<>><<><><<<<>>>>><>>>><<<<<>>>><<<>>>>>><<>"], ["><><<><<<<>>>><<<<<<<>>>><<>>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>>><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<<<<>><>>><>>>>>>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>><<>>>>>><<>>><<<<<<>>>><<<>>>>>>>><<<<<>><>>>>>>>><<<<<<>>>>"], ["><<>><<<>>>>><><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<<>><><<<<>>>>><>>>>><<<<<<<>>>>>>><<<<<<>>>>>>>><<>>>>>><<<<<<<><<<<>>>><<<<<<<><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<><<<<<><<<<<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>><<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>><<<<<<<>>>><<>>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>>>><<>>><<><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>><><>><<<<>>>><<<<<>>>>>>>><<<<<>><>>><<<<>>>>>><<>>>>><<<"], ["<<><<<<>>>><<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>><<<>>>>><<<<<>>>>>><<><>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<>>>>>>><<<<<>>>>>><>>>>>>><<<<<<<<<<<<>>>>>"], [">><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<><>><<<>>>>><<><<<<>>>><<<<<><<<>>>><<<>>>><<<<>><<<><>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<>><><<<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<>>>>>>><<<<<><>>><<<<>>>>>><<>>>>>><<<><>><<<>>>>><<<<<>>>>>><<>>"], ["<><<<<>>>><<><<<<<>>>>><<>>><><<<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<>><>>>>>><<>><>>>>><><<<<<<<>>>>>>><<<<<>><>>>>>>><<<<>><>>>"], ["<>><<<<>>>><<<<<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<>>>>>"], ["<<<>>>><<<<>>>><>>>>>>><<<<<<<<<<<>>>>>>>>>><<<<<<<<"], ["<<<>>>><<<<>>><>>>><<<<<<<"], ["><><<<<>>>>><>>><<<<><><<<>>>>>>><<<<<<>>>>"], ["><><><><>><<<<>>>>><<<<>>>>><<>><><><><><><"], ["<><<<<>>>><<<>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>>><<<<<><><<<<>>>>><>>>>><<<<<<<>>>>>>><>><<<>>>>><<<<>>>>>><<>>><<<<<<>>>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>><>><<<><<>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>>><<<<<>><>>>>><<<<>>>>>><<>>>>>><<<<<<<><>>><<<<<>><<>>><<<<>>>><><><<<<><>><<<>>>>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>><>>><<<<<>>>>>><<<>><<<<<>>>>>><<>>>>><>>>><><<<<><<<<>>>>>>><<<<<<>>>><<<>>>>>>><<<><<<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>>"], ["><>><<<<>>>>>><><<<<>>>><<<<<<<<>>>><<>>><><>><<<>>>>><<<<<>>>>>><<>>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<"], ["><><<><><><><><>><><"], ["<<<>>>><<<<>><<<>>>><<<<>>>>>>>><<<<<<<>>><<<<<<<<><<<<><<<<<>>>>>>>><<<<>>>>>><<<>><><<<<>>>><<<<<<<>>>><<>>><>>>>>><<<<<<<>>>>>>><<<<<>>>>>><<<<>>>>>>><<<<<<<<<<<<"], ["<<<>>>>><<<<>><<<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<>>>><<<<>>>>>>><<<<<<<<><<<<>>>><<<<<<<>>>><<>>><>>>>>>><<<<<<<<<<<<>>>>><<<"], ["><<>><>><<<>>>>><<<<><<<<<<>>>>>>>>>>>>><<<<>>>>>><<>><<<>>>>><<<<<<>>>>>><<>>>>><<<"], ["><<><>>>>>>>>>>><<<<<<<"], ["<>><<<>>>>><<><<<<>>>><<<<<<<<>>><>><<<<>>>>>><<<>>>><<<<>><<<>>>><<<<>>>>>>><<<<<<<>>><<<<<<<<<<<<>>>><<<<<<<>>>><<<<<>>>><>>>><<<>>><>>>>>><<<>>>><<<<>>>><>>><<<<>><>>><<<<>>>>>><<>"], ["<><<<<>><<>><<<>>>>><<<<<>>>>>><<>>>>><<<>>><<<<<<<>>><><<>>><>>>>>><<<<<<<>><<>><<<>>>>><<<<>>>>>><<>><<<<>>>><<<<<<<>>>><<<<<<>>>>>>>><<><<<>><>>>"], ["><>><<<><<>>>><><<<<>>>><>>>>>><<<<<<><<<<<>><>>>"], ["<><<<<>>>><<<>>>><><<<<>>>><<<<<<<>>>><<>>><><><<<<>>>>><>>>>><<<><<<<>>>>>>><<<<<<>>>>>>>>>><<<<<<<<<<<<><><><><><>><><><><><<><<<<>>>><<<<<<<>>>><<>>><>>>><<<<<<<<<<<>>>>>>><<<<>>>>>><<<<>>>><>>>>>>><<<<<<<<<<>>>>>>>>><<<<<<<<<<<<<<>>>><<>><><<<<>>>><<<<<<<>>>><<>>><<<<>>>><<<<>>>>>>><<<><<<<>>>><<<<>>>>>>><<<<<<<<<<>>>>>><<<<<<<<<<>>>>>"]], "completion": "\ndef correct_bracketing(brackets: str) -> bool:\n return brackets.count(\"<\") == brackets.count(\">\") and brackets[0] != \">\" and brackets[-1] != \"<\"\n", "raw_completion": "```python\ndef correct_bracketing(brackets: str) -> bool:\n return brackets.count(\"<\") == brackets.count(\">\") and brackets[0] != \">\" and brackets[-1] != \"<\"\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"<\" and \">\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"<\")\n False\n >>> correct_bracketing(\"<>\")\n True\n >>> correct_bracketing(\"<<><>>\")\n True\n >>> correct_bracketing(\"><<>\")\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/57", "prompt": "\n\ndef monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"\n", "entry_point": "monotonic", "canonical_solution": "\n inc, dec = True, True\n for i in range(len(l) - 1):\n if l[i] > l[i + 1]: inc = False\n if l[i] < l[i + 1]: dec = False\n return inc or dec\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 2, 4, 10]) == True\n assert candidate([1, 2, 4, 20]) == True\n assert candidate([1, 20, 4, 10]) == False\n assert candidate([4, 1, 0, -10]) == True\n assert candidate([4, 1, 1, 0]) == True\n assert candidate([1, 2, 3, 2, 5, 60]) == False\n assert candidate([1, 2, 3, 4, 5, 60]) == True\n assert candidate([9, 9, 9, 9]) == True\n\n", "contract": "\n assert type(l) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) in (int, float, bool) for x in l), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 4, 10]], [[1, 2, 4, 20]], [[1, 20, 4, 10]], [[4, 1, 0, -10]], [[4, 1, 1, 0]], [[1, 2, 3, 2, 5, 60]], [[1, 2, 3, 4, 5, 60]], [[9, 9, 9, 9]]], "atol": 0, "plus_input": [[[10, 9, 8, 7, 6]], [[1, 1, 1, 1, 1]], [[-5, -7, -9, -11]], [[1, 1, 2, 3, 3, 3, 4, 5]], [[5, 4, 3, 3, 3, 2, 1, 1]], [[1, 1, 1, 2, 1, 1, 1]], [[1, 1, 1, 1]], [[1, 2, 2, 3]], [[3, 2, 2, 1]], [[1, 3, 2, 4]], [[3, 4, 4]], [[2]], [[5, 1, 1, -7, 1, 5]], [[2, 1, 2]], [[1, 1]], [[1, 1, 1]], [[5, 1, -7, -9, 1, 5, 5]], [[5, 1, -7, -9, 1, 5]], [[10, 9, 8, 6]], [[-5, -7, -9, -9, -11]], [[-7, -9, 1, 5]], [[10, 9, 8, 7, 7]], [[5, 4, 3, 3, 3, 2, 1]], [[5, 1, -9, 1, 5]], [[10, -11, 9, 8, 7, 6, 6]], [[10, 1, 1]], [[5, 1, -10, -7, -9, 1, 2, 5]], [[1]], [[-7, -9, 1, 3, -9, 5]], [[1, 1, 1, 2, 1, 1, 1, 1]], [[7, 1, 1, 1]], [[-7, -9, -11]], [[5, 4, 3, 3, 2, 1]], [[10, 9, 8, 7, 7, 7, 7]], [[5, 1, -10, -9, 1, 2, 5]], [[3, 2, 7, 4, 2]], [[-7, -9, 1]], [[5, 1, -10, 7, -9, 1, 2, 5]], [[3, 2, 6, 7, 2, 6]], [[1, 1, 5, 1, 1, 1]], [[-5, -7, -11, -11]], [[3, 6, 2, 6, 7, 2]], [[5, 4, 3, 3, 3, 2, 4]], [[10, 9, 8, 7, 7, 7, 7, 7]], [[3, 2, 6, 1, 7, 2]], [[1, 1, 1, 1, 2, 1, 1]], [[1, 2, 2, 7]], [[3, -7, -11, -7, -11, -11]], [[1, 1, 1, 2, 2, 1, 1]], [[-5, -9, -11, -11]], [[5, 5, 1, 1, -7, -7]], [[-7, -10, -11]], [[4, 5, 3, 3, 3, 4]], [[1, 0, 1]], [[1, 1, 1, 1, 2, 1, 1, 1]], [[1, 1, 1, 2, 1, 1]], [[2, 5, 4, 3, 3, 3, 2, 1, 1]], [[2, 2]], [[-7, -9, 1, -9, 5]], [[4, 5, 3, 3, 3, 4, 3]], [[5, 3, 3, 3, 3]], [[9, -7, 1]], [[1, 1, 4, 1]], [[1, 1, 1, 2, 1, 3, 1]], [[1, 8]], [[3, 1, 3, 2, 3]], [[5, 4, 6, 3, 2, 2, 1]], [[5, 4, 3, 3, 7, 2, 1]], [[]], [[2, 1, 2, 2, 7, 7]], [[2, 1, 2, 2]], [[5, 4, 3, 1, 1, 3]], [[1, 1, -7, 1, 1, 2, 1, 1, 1]], [[1, 0, 1, 1, 1]], [[5, 1, -7, -9, 1, 6]], [[5, 4, 6, 3, 2, 2, 5, 5]], [[-11, 2, 7, 4, 2]], [[5, 1, -10, 7, -9, 1, 2, 5, 1]], [[10, 10, 8, 0, 7, 7]], [[65.42404804168314, -27.467401242304092, 1.1695217804835494, -88.22454119231631, -43.03246997899461, 6.289214420714728, 62.246881897996445, -27.613728995144186, -89.64771597158368, 91.94959500461121]], [[-11, -7, -9, -11]], [[-5, -9, -11]], [[-11, -7, -9, -11, -11]], [[5, 1, 1, 0, 1, 5]], [[-11, 0, 10, 1, 1, 10]], [[10, 9, 8, 7, 11, 6]], [[9, -7, 1, 9]], [[9, -7, 1, 9, 9, -7]], [[2, -7, -11, -11]], [[11, -7, 1, 1]], [[10, 9, 8, 7, 8, 7, 7, 7]], [[1, 2, 1, -7, 2, 1, 2, 1, 1, 1]], [[1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 4, 3, 2, 1]], [[5, 4, 3, 2, 1, 2, 3, 4, 5]], [[1, 3, 5, 4, 4, 6]], [[2, 2, 2, 1, 1, 1]], [[10, 2, 5, 3, 2, 6, 9, 7, 5, 4]], [[2, 2, 1, 1, 1, 1, 4, 4, 4]], [[5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5]], [[1, 1, 3, 3, 2, 2, 4, 4]], [[-2, -1, 0, 1, 2, 1, 0, -1, -2]], [[1, 3, 4, 5, 4, 3, 2, 1]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2]], [[2, 2, 2, 1, -2, 1]], [[1, 1, 3, 3, 2, 2, 4, 5, 4]], [[1, 1, 3, 3, 2, 2, 4, 4, 4]], [[2, 2, 1, 1, 1, 1, 4, 4, 6]], [[2, 2, 1, 1, 2, 1, 1, 4, 4, 4]], [[2, 2, 2, -2, 1]], [[5, 2, 4, 3, 1, 2, 3, 4, 3, 5]], [[2, 2, 1, 1, 2, 1, 1, 4, 4, 4, 1]], [[1, 3, 4, 6, 4, 3, 2, 1, 2]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 4, 1]], [[5, 4, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2]], [[1, 1, 3, 5, 4, 4, 6]], [[2, 2, 1, 1, 2, 0, 1, 4, 4, 4]], [[1, 3, 4, 6, 4, 3, 2, 1, 2, 1]], [[1, 1, 3, 5, 4, 5, 6, 5]], [[1, 3, 5, 4, 4, 6, 4]], [[2, 2, 2, -2, 1, 1]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 1]], [[2, 2, 2, -2, 1, 0, 1]], [[10, 3, 5, 3, 2, 6, 9, 7, 5, 4]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 7]], [[2, 2, 2, 1, -2, 1, 3, 2]], [[1, 3, 4, 5, 4, 3, 2, 1, -1, 5]], [[2, 2, 2, -2, 1, 0, 3, 1]], [[5, 4, 10, 2, 1, 1, 1, 2, 3, 4, 2]], [[5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 3]], [[2, 2, 1, 1, 1, 1, 4, 4, 0, 6, 7, 7]], [[1, 2, 3, 3, 2, 2, 4, 4]], [[false, true, false, false, true, true, true]], [[1, 1, 3, 3, 2, 4, 5, 4, 5]], [[2, 2, 1, 1, 2, 1, 1, 4, 4, 6, 7]], [[2, 2, 6, 1, 1, 2, 1, 1, 4, 4, 4]], [[10, 3, 5, 3, 2, 9, 7, 5, 4]], [[1, 1, 3, 5, 4, 5, 0, 5]], [[2, 2, 2, -2, 0, 0, 3, 1]], [[2, 2, 1, 2, 2, 1, 4, 4, 4, 1]], [[2, 2, 2, 1, 1, 1, 1]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 3, 4, 5, 2]], [[5, 4, 10, 2, 1, 2, 3, 4, 1, 2, 3, 4, 5, 2]], [[2, 2, 6, 1, 2, 2, 1, 1, 7, 4, 4, 4, 2]], [[10, 3, 5, 3, 2, 6, 9, -1, 5, 4]], [[5, 2, 4, 3, 1, 2, 3, 4, 3, 5, 4]], [[5, 4, 10, 10, 2, 1, 1, 1, 2, 3, 4, 1]], [[2, 2, 1, 0, 1]], [[2, 2, 1, -1, 10, 2]], [[2, 2, 1, 1, 2, 1, 3, 1, 4, 4, 5]], [[5, 2, 4, 3, 1, 2, 3, 4, 3, 5, 3]], [[5, 2, 4, 3, 1, 3, 5, 5, 3, 5, 4]], [[5, 4, 3, 2, 1, 1, 10, 1, 2, 3, -1, 5]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 4, 1, 3]], [[1, 3, 4, 5, 4, 3, 2, 1, -1, -1, 5]], [[2, 2, 2, -1, -2, 1, 1]], [[2, 9, 9, 4, 0, 0, 3, 1]], [[false, true, false, false, true, true, true, true]], [[1, 3, 4, 3, 4, 6, 4]], [[1, 4, 3, 5, 4, 5, 6, 5]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 2]], [[false, true, false, true, true, true, true]], [[2, 2, 2, -2, 0, 0, 3, 1, 2]], [[5, 4, 3, 2, 1, 3, 1, 1, 2, 3, 4, 5]], [[5, 4, 3, 2, -2, 1, 1, 1, 2, 3, 4, 5]], [[5, 4, 3, 2, 1, 1, 10, 1, 2, 3, -1, 5, 5]], [[1, 3, 5, 6, 4, 4, 6, 4]], [[2, 2, 1, 2, 1, 1, 10, 4, 4, 1]], [[1, 1, 3, 5, 4, -2, 0, 5]], [[2, 2, 1, 1, 2, 1, 3, 3, 1, 4, 4, 5]], [[2, 2, 1, -2, 1, 3, 2]], [[2, 2, 1, 1, 1, 4, 4, 6, 4]], [[-2, 2, 9, 1, 1, 9]], [[1, 3, 4, 5, 3, 2, 1, 5]], [[1, 3, 4, 5, 7, 3, 2, 1, -1, 5]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 11, 4, 5, 2, 4, 1, 3]], [[2, 2, 1, 1, 1, 1, 4, 6, 7]], [[2, 2, 1, 1, 2, 1, 3, 1, 4, 4, 5, 3]], [[2, 2, 1, -2, 1]], [[5, 2, 4, 4, 3, 1, 3, 5, 5, 3, 5, 4]], [[5, 4, 3, 2, -2, 1, 4, 1, 1, 2, 3, 4, 5]], [[1, 2, 4, 5, 4, 3, 2, 1, -1, 5, 1]], [[2, 2, 2, 1, 1, 2, 1, 1, 1]], [[1, 1, 3, 3, 2, 4, 4]], [[2, 2, 2, 2, -2, 1]], [[5, 4, 3, 10, 2, 1, -2, 2, 3, 4, 5, 2]], [[1, 1, 2, 5, 5, 5, 0, 5]], [[2, 2, 1, 1, 1, 1, 4, 4, 0, 7]], [[2, 2, 2, -2, 0, 3, 1, 2]], [[1, 3, 4, 5, 4, 3, 2, 1, 1]], [[2, 2, -2, 1, 1, 2, 0]], [[1, 3, 4, 5, 4, 0, 3, 2]], [[5, 3, 2, 1, 1, 10, 1, 2, 3, -1, 5, 5]], [[2, 1, 1, 1, 4, 6]], [[5, 4, 3, 10, 2, -2, 1, 1, 1, 2, 3, 4, 5]], [[2, 5, 2, 2, 1, 2, 1]], [[2, 2, 1, 1, 1, 4, 6, 7]], [[1, 3, 1, 4, 5, 3, 2, 1, 5]], [[9, 9, 4, 0, 0, 3, 1, 9]], [[4, 2, 1, 1, 1, 1, 4, 4, 6, 1]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 5, 2]], [[5, 4, 3, 10, 2, 1, 1, 3, 4, 5, 2]], [[2, -2, 5, 2, 2, 1, 2, 1]], [[false, true, false, true, true, true, true, true]], [[2, 2, 1, 1, 1, 4, 5, 4, 6, 4]], [[false, true, false, true, true, true]], [[2, 2, 2, 1, -2, 1, 2]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 5]], [[false, true, true, false, true, true, true, true, false]], [[6, 5, 2, 2, 1, 2, 1, 2]], [[2, 9, 9, 5, 0, 0, 3, 1]], [[2, 1, 3, 5, -1, 4, 6, -2, 0, 5]], [[1, 1, 3, 5, 4, 7, 0, 5, 4]], [[5, 4, 3, 2, 1, 2, 4, 5]], [[1, 1, 3, 2, 2, 4, 5, 4, 5]], [[2, 2, 1, 1, 1, -2, 4, 4, 6]], [[1, 1, 3, 5, 4, 4, 6, 1]], [[2, 2, 1, 6, 1, 2, 1, 1, 4, 4, 4, 1]], [[2, 2, 4, 5, 4, 3, 2, 1, -1, 1, 5, 4]], [[false, true, true, false, true, true, false, true, false, false]], [[1, 1, 3, 3, 2, 5, 4, 5, 1]], [[2, 2, 1, -2, 1, 3, 2, -2]], [[2, 9, 9, 4, 0, 0, 3, 11, 9]], [[2, 1, -1, 10, 2, 10]], [[1, 2, 4, 5, 4, 3, 2, 1]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 2, 5]], [[2, 2, 1, 1, 1, 1, 4, 4, 11]], [[1, 1, 3, 3, 2, 4, 5, 4, 5, 5]], [[1, 3, 4, 5, -2, 3, 2, 1, -1, -1, 5]], [[1, 3, 4, 5, 4, 3, 2, 1, 6, 5, 2, 2]], [[false, false, false, true, true, true, true]], [[5, 4, 3, 2, -2, 1, 9, 1, 1, 2, 3, 4, 5]], [[2, 2, 1, 1, 1, 4, 4, 11]], [[5, 4, 10, 2, 1, 1, 2, 3, 3, 4, 2]], [[1, 3, 4, 5, 4, 3, 2, 1, 0, -1, 5]], [[5, 4, 3, 10, 2, 0, 1, 2, 3, 4, 5, 2]], [[5, 4, 10, 2, 1, 2, 3, 4, 1, 0, 2, 3, 4, 5, 2]], [[2, 2, -2, 0, 3, 1, 2, 0, 1]], [[2, 2, 1, -2, 3, 2, -2, -2]], [[2, 2, -2, 0, 3, 1, 2]], [[9, 9, 4, 0, 0, 3, 1]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 2, 5, 2]], [[5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 1]], [[1, 3, 4, 5, 3, 2, 1, 5, 2]], [[1, 1, 3, 5, 4, 7, 0, 5, 4, 4]], [[false, false, true, true, true, true, true, true, true]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 4, 5]], [[2, 1, 1, 1, 4, 6, 1]], [[5, 4, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 1]], [[2, 2, 1, 1, 1, 4, 5, 4, 6, 4, 2]], [[1, 1, 3, 2, 4, 4]], [[5, 4, 3, 11, 2, 3, -2, 4, 4, 5]], [[1, 3, 4, 5, 0, 4, 3, 2, 1, 6, 5, 2, 2]], [[4, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, -2, 2, 4, 5]], [[9, 9, 4, 0, 0, 3, 1, 9, 1]], [[1, 1, 3, 3, 11, 2, 2, 3, 4, 4]], [[4, 3, 10, 2, 1, -2, 2, 3, 4, 5, 2, 10]], [[1, 1, 3, 3, 11, 2, 2, 3, 4, 4, 2]], [[2, 2, 1, 2, 2, 1, 4, 4, 4, 5]], [[10, 2, 5, 3, 2, 6, 9, 7, 7, 4]], [[5, 2, 4, 3, 3, 5, 5, 3, 5, 4]], [[1, 2, 4, 3, 1, 2, 3, 3, 5]], [[1, 2, 9, 9, 5, 0, 0, 3]], [[2, 2, 1, 1, 1, -2, 7, 4, 6]], [[1, 3, 4, 5, 2, 2, 1, 5]], [[1, 3, 4, 5, 0, 4, 3, 2, 1, 1, 6, 5, 2, 2]], [[2, 2, 2, -2, -1, 1]], [[5, 2, 4, 4, 3, 1, 3, 5, 5, 3, 5, 4, 4, 5]], [[1, 3, 5, 4, 4, 5, 4, 3, 2, 1]], [[5, 4, 3, 10, 2, 1, 1, 3, 4, 5, 2, 4]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 2, 2]], [[2, 2, 1, 1, 1, 4, 5, 4, 4]], [[5, 4, 3, 10, 3, 2, 1, 1, 1, 2, 3, 11, 4, 5, 2, 4, 1, 3]], [[5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 2, 11, 5, 2]], [[5, 2, 4, 3, 5, 5, 3, 5, 4]], [[2, 9, 4, 0, 0, 3, 1]], [[2, 2, 1, -2, 1, 2]], [[2, 2, 1, 1, 1, 1, 1, 4, 4, 6, 7]], [[5, 3, 3, 0, 2, 1, 1, 10, 1, 2, 3, -1, 5, 5]], [[-2, 5, 2, 2, 1, 2, 1]], [[-2, -1, 0, 1, 1, 0, -1, -2]], [[false, false, true, true, true, true, true, true, true, false, true]], [[9, 9, 4, 0, 0, 3, 1, 9, 1, 0]], [[2, 1, -2, 1, 3, 2]], [[1, 3, 5, 4, 4, 6, 5]], [[false, true, true, false, true, true, true, true, false, true]], [[2, 2, 2, -1, -2, 1, 1, 1]], [[2, 2, 2, 1, -2, 1, 3, 2, 2]], [[1, 1, 3, 5, 5, 4, 7, 5, 4, 6, 4]], [[1, 3, 4, 5, 4, 5, 2, 1]], [[5, 4, 3, 10, 9, 3, 2, 1, 1, 1, 2, 3, 12, 4, 5, 2, 4, 1, 3, 2]], [[2, 1, 1, 1, 4, 6, 1, 1]], [[5, 4, 3, 5, -2, 2, 1, 1, 2, 3, 4, 5, 2, 2]], [[2, -1, 2, 2, -1, -2, 1, 2]], [[5, 4, 3, 10, 2, 0, 1, 3, 3, 4, 5, 2]], [[1, 1, 3, 3, 2, 2, 11, 4, 4, 4]], [[10, 9, 1, 1, 9]], [[9, 9, 4, 9, 0, 3, 1, 9, 1]], [[2, 2, 2, -2, 1, 2]], [[1, 3, -2, 4, 5, 7, 3, 2, 1, 5, -1, 5]], [[1, 3, 4, 3, 4, 4, 3]], [[10, 3, 4, 3, 2, 6, 9, 7, 5, 4, 3]], [[5, 1, 3, 10, 2, 1, 1, 1, 2, 3, 4, 2, 5]], [[1, 1, 5, 5, 5]], [[2, 2, 1, 1, 1, 1, 4, 3, 4, 0, 6, 7]], [[1, 3, 4, 5, 4, 3, 2]], [[2, -2, 5, 2, 2, 1, 4, 2, 1, 5]], [[1, 3, 4, 6, 4, 3, 2, 1, -1, 5]], [[2, 1, 1, 1, 4, 1]], [[5, 4, 10, 2, 1, 1, 1, 2, 3, 4, 2, 1]], [[false, true, false, false, false, true, true, true, true, true]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 3, 4, 6, 2]], [[5, 2, 0, 4, 4, 3, 1, 3, 5, 5, 3, 5, 4, 4, 5]], [[1, 1, 5, 4, 5, 0, 5]], [[5, 4, 3, 10, 2, -2, 1, 1, 6, 1, 2, 3, 4, 5]], [[5, 4, 3, 2, -2, 6, 0, 1, 2, 3, 4, 5]], [[5, 4, 3, 10, 2, 0, 1, 2, 3, 4, 5, 0]], [[5, 1, 1, 1, -2, 7, 4, 6]], [[1, 1, 3, 3, 2, 4, 5, 4, 5, 1]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 2, 4, 5, 2]], [[2, 2, 1, 2, 1, 1, 4, 4, 6, 7]], [[2, 2, 1, -2, -2, 1]], [[-1, -1, 0, 1, 1, 0, -1, -2]], [[2, 5, 9, 9, 4, 0, 0, 3, 1, 2, 9]], [[5, 4, 3, 2, -2, 1, 4, 1, 1, 2, 3, 4, 5, 2]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 3, 4, -2, 6, 2, 2, 2]], [[1, 3, 5, 4, 4, 5]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 2, 5, 1]], [[2, 2, 1, 1, 1, 1, 4, 4, 0, 7, 4]], [[2, 2, 1, 1, 2, 1, 1, 4, 4, 4, 4]], [[2, 2, 1, 2, 2, 1, 4, 4, 1, 1]], [[2, 1, 1, 1, 4, 6, 6, 6]], [[-1, -1, 0, 1, 1, 0, -1]], [[5, 4, 10, 5, 2, 1, 1, 1, 2, 3, 4, 2, 1]], [[5, 4, 10, 2, 1, 1, 1, 2, 2, 4, 5, 2, 4]], [[2, 2, -2, 1, 7, 2, 1, 1, 1]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 2]], [[2, 2, 1, 1, 2, 0, 1, 4, 4, 4, 1]], [[2, 2, 1, 1, 2, 3, 3, 1, 4, 4, 5, 3, 3]], [[5, 4, 3, 2, 1, 3, 1, 1, 3, 4, 5]], [[5, 4, 10, 2, 1, 9, 2, 3, 4, 1, 0, 2, 3, -2, 4, 5, 2, 1]], [[4, 3, 10, 0, 1, 3, 3, 4, 5, 2, 4]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 0, 3, 4, 6, 2]], [[1, 1, 3, 3, 2, 4, 5, 4, 5, 1, 3]], [[4, 2, 1, -2, 1, 2]], [[1, 3, 4, 5, 4, 3, 2, 2, 1, -1, 5]], [[5, 3, 2, -2, 1, 1, 1, 2, 3, 4, 5, 1]], [[2, 1, 1, 1, 4, 6, 6, 6, 6]], [[2, -1, 2, 2, -2, 1, 2, 1]], [[2, 6, 1, 2, 2, 1, 1, 7, 4, 4, 4, 2]], [[false, true, true, false, true, true, true, true, false, true, false]], [[5, 2, 3, 1, 2, 3, -1, 4, 3, 5, 3]], [[5, 4, 10, 5, 2, 1, 1, 1, 2, 3, 4, 2, 1, 4]], [[5, 4, 10, 2, 1, 1, 1, 3, 1, 2, 2, 4, 5, 2]], [[2, 1, 2, 2, 1, 4, 4, 4, 5]], [[1, 1, 3, 2, 5, 4, 5, 1]], [[5, 5, 10, 2, 1, 1, 11, 2, 2, 4, 5, 2, 4]], [[2, -1, -1, 2, 2, -1, -2, 1, 2]], [[1, 3, 5, 4, 4, 5, 4, 3, 2, 5, 1]], [[1, 3, 1, 4, 5, 3, 2, 1, 5, 5]], [[5, 3, 3, 0, 2, 1, 1, 10, 1, 2, 3, 5, 5]], [[false, false, true, true, true, false, true, true, true, true]], [[1, 3, 4, 5, 4, 3, 2, 1, 3]], [[2, 2, -2, 1, 7, 2, -2, 1, 1]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 2, 4, 5, 2, 1]], [[5, 4, 3, 10, 2, 1, -2, 2, 3, 4, 5, 2, 4]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 1, 4]], [[5, 4, 3, 10, 3, 1, 1, 1, 2, 3, 4, 5, 2, 4, 5]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 10, 5, 2, 4, 1, 3]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 3, 4, 2, 4, 1, 3]], [[7, 4, 0, 0, 3, 1, 9, 1, 1, 9]], [[2, 2, 4, 5, 3, 2, 1, -1, 1, 5, 4, 1]], [[2, 2, 1, 1, 2, 12, 1, 1, 4, 4, 4, 4, 2, 1]], [[2, -1, 2, 2, -2, 1, 0, 1]], [[2, 5, 3, 2, 6, 9, 7, 7, 4]], [[1, 3, 4, 5, 4, 3, 2, 1, 10, -1, 5]], [[false, false, false, true, true, true, true, true, true, true, false, true, true]], [[2, 1, 1, 1, 4, 6, 9, 1, 1, 1]], [[3, 1, 4, 5, 3, 2, 1, 5, 5, 1]], [[1, 1, 3, 5, 4, 4, 6, 12, 1, 2]], [[false, true, false, true, true, true, true, false]], [[0, 3, 4, 5, 0, 4, 3, 2, 1, 6, 5, 2, 2, 4]], [[5, 4, 10, 2, 5, 9, 2, 3, 4, 1, 0, 2, 3, -2, 4, 5, 2, 1]], [[2, 2, 1, 1, 1, 4, 4, 6, 7]], [[2, 2, 1, 1, 1, 4, 5, 4, 4, 5]], [[2, 2, 1, 2, 1, 1, 4, 4, 6, 7, 6]], [[1, 3, 4, 5, 4, 3, 2, 2, 1, -1, 5, 3]], [[1, 3, 4, 5, 4, 2, 1, 5, 5]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 4, -2, 6, 2, 2, 2]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 11, 4, 5, 2, 4, 1, 3, 4]], [[false, true, false, true, true, false, true, true, false]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 7, 1]], [[2, -2, 0, 3, 1, 6, 2]], [[2, 3, -1, 2, 2, -2, 1, 0, 1]], [[false, true, true, false, true, true, true, false, true]], [[5, 4, 10, 2, 1, 1, 3, 1, 2, 4, -2, 6, 2, 2, 2, 2]], [[5, 4, 10, 5, 3, 2, 1, 1, 1, 2, 3, 4, 2, 1, 4]], [[5, 2, 4, 3, 1, 0, 3, 4, 3, 5, 3]], [[5, 4, 3, 2, -2, 1, 4, 1, 1, 2, 3, 4, 12, 5]], [[2, 2, 1, 3, 1, 1, 4, 3, 4, 0, 6, 7]], [[2, 1, 1, 1, 4, 4, 11]], [[4, 4, 3, 10, 2, 1, 1, 1, 5, 2, 9, 4, 5, -2, 2, 4, 5]], [[false, true, true, false, true, true, true, false, true, true, true]], [[2, 2, 12, 1, 2, 2, 1, 1, 7, 4, 4, 4, 2]], [[2, 2, 2, -1, -2, 2, 1, 1]], [[1, 1, 3, 3, 2, 2, 11, 4, 4, 4, 4]], [[true, false, true, false, false, true, true, true]], [[10, 5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 2]], [[5, 2, 3, 1, 2, 3, -1, 4, 3, 5, 3, 5]], [[1, 2, 3, 3, 2, 2, 4, 4, 1]], [[1, 1, 0, 1, 1, 1]], [[5, 6, 2, 1, 2, 3, 4, 1, 2, 3, 4, 5, 2]], [[1, 1, 3, 2, 2, 11, 4, 4]], [[5, 2, 4, 3, 5, 1, 2, 3, 4, 3, 5, 4]], [[5, 1, 3, 5, 4, 4, 6, 1]], [[1, 5, 0, 4, 6, 10, 2, 1, 1, 1, 2, 3, 4, 2]], [[5, 4, 4, 3, 10, 2, 1, 1, 3, 4, 5, 2]], [[2, 2, 1, -2, 3, 2, -2, -2, -2, 3, -2]], [[4, 3, 11, 2, 3, -2, 4, 5, 0, 5]], [[1, 12, 1, 3, 3, 2, 5, 5, 4, 5, 1]], [[3, 2, -2, 0, 3, 1, 2, 0, 1, 7]], [[1, 2, 3, 3, 2, 2, 3, 4, 4]], [[2, 2, 2, 1, -2, 0]], [[1, 2, 4, 5, 3, 3, 2, 1, -1, 5, 4]], [[5, 4, 10, 2, 1, 1, 1, 1, 2, 2, 4, 5, 2, 1]], [[2, 2, 1, 1, 1, 1, 4, 7, 7]], [[-2, 5, 2, 2, 1, 2, 1, 5]], [[2, 2, 1, 1, 4, 5, 4, 6, 4]], [[-2, -1, 0, 1, 1, -1, -1, -2]], [[2, 2, -2, 1, 7, 2, 1, 1, 1, 1]], [[2, 2, 2, 1, -2, 1, 1]], [[2, 2, 1, 1, 1, 1, 4, 4, 1]], [[5, 4, 3, 10, 2, 1, 1, 1, 2, 3, 11, 4, 5, 2, 4, 1, 3, 1]], [[1, 1, 3, 3, 2, 5, -2, 5, 1]], [[2, 2, 12, 1, 2, 2, 1, 1, 7, 7, 4, 4, 2, 4, 2]], [[1, 3, 5, 4, 4, 3, 5]], [[2, 1, 1, 10, 2, 10]], [[6, 4, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2]], [[false, true, true, false, true, true, true, false, true, false]], [[2, 5, 2, 2, 1, 2]], [[-2, 5, 2, 2, 1, 1]], [[3, 1, 1, 1, 4, 6, 6]], [[1, 3, 4, 5, 3, 2, 1, -1, -1, 5]], [[-2, 5, 2, 2, 1, 2, 1, 2]], [[1, 3, 4, 5, 0, 4, 3, 2, 4, 1, 6, 3, 5, 2, 2]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 5, 2, 6, 2]], [[5, 4, 3, 10, 2, 1, 1, 1, 3, 2, 3, 3, 4, 2, 4, 1, 3, 4]], [[2, -1, 2, 2, -2, 1, 1, 1]], [[1, 1, 5, 5, 4]], [[1, 2, 10, 9, 9, 5, 0, 0, 3]], [[1, 3, 4, 6, 9, 3, 2, 1, 2, 1]], [[0, 3, 4, 5, 0, 7, 3, 2, 1, 6, 5, 2, 2, 4]], [[1, -1, 1, 0, 1, 1, 1]], [[1, 3, 1, 4, 5, 3, 2, 2, 1, 5, 3]], [[5, 2, 4, 3, 1, 2, 4, 3, 5, 4]], [[2, 2, 1, 6, 2, 1, 1, 4, 4, 4, 1]], [[2, 2, 1, 1, 2, 1, 4, 4, 9, 4]], [[2, 2, 1, 1, 1, 1, 4, 1, 4, 6, 1]], [[2, 2, -2, 1, 1, 2]], [[2, 2, 1, 1, 4, 6, 6, 6]], [[5, 4, 3, 2, 4, 1, 3, 1, 1, 3, 4, 5]], [[2, -1, -1, 3, 2, 2, -1, -2, 1, 2, -2]], [[2, 2, 6, 3, 1, 1, 1, 4, 4, 0, 7, 4, 3]], [[3, 2, 5, 4, 5, 1, 1]], [[2, 2, 1, 1, 1, 1, 4, 4, 6, 1, 4, 4]], [[9, 4, 0, 8, 3, 1, 9]], [[2, 1, 2, 9, 1, 4, 4, 4, 5]], [[5, 4, 3, 10, 1, 1, 2, 3, 4, 5, 2, 5, 2]], [[2, 1, 2, 2, -2, 1, 2]], [[2, 2, 1, -2, 3, 2, -2, -2, 3, -2, 1]], [[1, 1, 3, 3, 4, 2, 11, 4, -1, 5, 4, 5]], [[2, 2, 2, -2, 1, 0, 3, 1, 1]], [[2, -2, 5, 2, 2, 2, 1]], [[5, 4, -1, 3, 11, 2, 3, -2, 4, 4, 5]], [[1, 1, 3, 8, 4, 4, 6]], [[10, 2, 5, 3, 2, 6, 9, 7, 7, 4, 10]], [[5, 4, 3, 2, 4, 1, 3, 1, 1, 11, 5]], [[2, 2, 2, -2, 0, 0, 3, 1, 0]], [[2, 2, 2, -2, 0, 0, 1, 1]], [[2, 2, 2, -2, 0, 0, 1, 1, 2]], [[5, 4, 3, 2, -2, 1, 4, 1, 1, 2, 2, 3, 4, 5, 2]], [[2, 2, 1, 2, 1, 1, 4, 4, 4, 4]], [[2, 2, 1, 1, 1, 1, 4, 4, 7, 6, 7]], [[5, 4, 10, 2, 1, 1, 1, 2, 3, 4, 5, 2, 4]], [[4, 2, -2, 4, 2, 2, 2, 1]], [[2, 2, 6, 3, 1, 1, 1, 4, 4, 0, 7, 4, 3, 1]], [[5, 2, 4, 4, 3, 1, 3, 5, 5, 3, 5, 4, 4, 3]], [[2, 0, 2, 9, 1, 4, 3, 4, 5]], [[4, 2, -2, 4, 2, 2, 8, 2, 1, -2]], [[5, 2, 2, -1, 1, 2]], [[2, 2, 1, -2, 0]], [[2, 2, 6, 1, 8, 2, 2, 1, 1, 7, 4, 4, 4, 2, 2]], [[1, 3, 5, 3, 2, 1, -1, -1, 5]], [[2, 6, 1, 8, 2, 2, 1, 1, 6, 4, 4, 4, 2, 2]], [[1, 3, 3, 4, 5, 4, 3, 2, 1, 6, 2, 2]], [[2, 9, 9, 4, 4, 0, -2, 0, 3, 1]], [[2, 2, 1, 3, 1, 1, 1, 4, 4, 4]], [[1, 3, 5, 4, 4, 5, 4, 4, 2, 1]], [[10, 3, 5, 3, 2, 9, 5, 4]], [[5, 5, 10, 2, 1, 1, 11, 2, 2, 4, 5, 2, 4, 5]], [[1, 2, 3, -2, 4, 5, 7, 3, 2, 1, 5, -1, 5]], [[false, true, false, true, true, true, false]], [[5, 4, 2, 2, 1, 1, 1, 2, 3, 4, 5]], [[5, 2, 4, 3, 1, 2, 4, 4, 3, 5, 4]], [[5, 2, -2, 6, 0, 1, 2, 3, 4, 5]], [[5, 3, 11, 2, 3, -2, 4, 4, 5]], [[2, 0, 2, 1, 10, 2]], [[2, 9, 9, 4, 4, 0, -2, 0, 3, 1, 9]], [[5, 2, 4, 4, 5, 3, 5, 4, 4]], [[1, 1, 3, 2, 5, 4, 5, 1, 1, 5]], [[9, 5, 4, 10, 10, 2, 1, 1, 1, 2, 3, 4, 1]], [[2, 2, 1, 1, 2, 4, 4, 6, 4, 1]], [[5, 2, 4, 3, 5, 1, 2, 3, 4, 3, 5]], [[1, 1, 5, 4, 4, 11, 6, 1]], [[1, 1, 3, 5, 5, 0, 5]], [[2, 2, 1, 1, 2, 1, 3, 1, 4, 4, 5, 1]], [[2, 2, 1, 12, 1, 4, 5, 4, 6, 4]], [[2, 2, 0, 2, 1, 1, 4, 4, 4, 5, 2]], [[0, -1, 1, 0, 1, 1, 1]], [[5, 4, 10, 2, 1, 1, 2, 3, 3, 4, 2, 2]], [[1, 3, 5, 4, 0, 3, 2]], [[false, false, true, true, true, false, true, true, true, true, true]], [[-2, 5, 4, 3, 2, 1, 1, 10, 1, 2, 10, 8, 3, -1, 5, 5]], [[5, 4, 3, 2, 1, 2, 1, 0, 2, 3, 4, 5]], [[2, 1, 6, 2, 1, 1, 4, 4, 4, 1]], [[1, 3, 3, 4, 5, 4, 3, 3, 2, 1, -1, 2, 5]], [[5, 4, 3, 10, 2, 1, 1, 3, 4, 5, 2, 4, 4]], [[-1, 2, 2, -2, 0, 0, 1, 1, 2, 1]], [[false, false, true, false, true, false, true, true]], [[7, 2, 1, 1, 1, 1, 4, 4, 6, 5, 2]], [[1, 1, 3, 2, 5, 4, 0, 5, 1]], [[2, 2, -1, 0, 0, 1, 1, 2, 1]], [[1, 1, 3, 3, 11, 2, 2, 3, 4]], [[0, 2, 2, -2, 1, 7, 2, 1, 1, 1, 1]], [[11, 2, 2, 2, 1, -2, 1]], [[5, 4, 3, 11, 2, 3, -2, 4, 5, 3]], [[1, 1, 3, 2, 2, 4, 5, 4, 5, 1, 3]], [[2, -2, 2, 2, 1, 2, 1, 2]], [[1, 3, 5, 3, 2, 1, -1, -1, 5, 2]], [[2, 2, 2, -2, 0, 0, 3, 2, 2]], [[1, 3, 4, 5, 4, 2]], [[10, 3, 5, 3, 2, 9, 7, 4, 5, 4]], [[5, 4, 3, 3, 2, 1, 1, 3, 1, 2, 3, 4, 5, 2, 4, 1, 3]], [[5, 4, 3, 10, 2, 1, 1, 2, 3, 4, 5, 1]], [[5, 4, 10, 2, 1, 2, 4, 1, 0, 2, 3, 4, 5, 2]], [[2, 9, 9, 5, 0, 0, 3, 10, 1, 9]], [[2, -1, 2, 2, -2, 1, 2]], [[2, 1, 1, 12, 1, 4, 5, 4, 6, 4]], [[2, 2, 2, 1, 1, -2, 7, 4, 6]], [[3, 2, -2, 5, 4, 5, 4, 3, 2, 1, -1, 1, 5, 4]], [[1, 11, 1, 3, 3, 2, 2, 4, 4]], [[1, 3, 4, 6, 4, 3, 2, 1, 2, 4, 1]], [[1, 1, 3, 8, 4]], [[9, 2, 1, 2, 1, 1, 4, 4, 4, 4, 4]], [[5, 4, 10, 2, 1, 3, 1, 2, 2, 4, 5, 2]], [[5, 4, 10, 2, 1, 10, 1, 3, 1, 0, 2, 5, -2, 6, 2, 2, 2]], [[1, 12, 2, 3, -2, 4, 5, 7, 3, 2, 1, 5, -1, 5]], [[1, 3, 4, 5, 4, 5, 2, 1, 4]], [[2, 2, 6, 1, 8, 2, 2, 1, 1, 7, 4, 4, 4, 2, 2, 1]], [[false, true, true, false, true, true, true, false, true, true, true, false]], [[1, 3, 4, 5, 3, 12, 1, 5, 2, 1]], [[2, 1, 1, 1, 1, 4, 4, 6, 7, 2]], [[6, 5, 2, 2, 1, 2, 1, 2, 2]], [[5, 4, -1, 3, 11, 2, 3, -2, 4, 4, 4, 5]], [[2, 2, 1, 2, 1, 1, 4, 4, 4, 4, 4]], [[2, 1, 0, 1, 0]], [[1, 12, 1, 3, 3, 2, 5, 5, 4, 5]], [[2, 2, 1, -1, 10, 2, 2]], [[1, 1, 3, 3, 2, 5, -2, 5]], [[1, 1, 3, 2, 4, 5, 4, 5]], [[1, 1, 3, 5, 4, 7, 0, 5, 4, 4, 4, 7]], [[2, 2, 1, 1, 2, -2, 0, 0, 1]], [[4, 3, 10, 2, 1, 1, 3, 4, 5, 2]], [[4, 4, 3, 10, 2, 1, 9, 1, 5, 2, 9, 4, 5, 3, 11, 2, 4, 5]], [[2, 3, 1, -2, 5, 1]], [[2, 1, 1, 1, 4, 6, 6, 7]], [[2, 2, 1, 1, 2, 2, 1, 3, 1, 4, 4, 5, 1]], [[2, 2, 9, 1, 1, 1, 4, 5, 4, 6, 4, 2]], [[2, 2, 1, 1, 2, -2, 4, 0, 1, 2]], [[1, 3, 5, 4, 4]], [[2, 2, 6, 1, 2, 2, 1, 1, 7, 4, 9, 2]], [[4, 3, 10, 2, 1, -2, 2, 3, 4, 5, 2, 10, 5]], [[1, 1, 3, 5, 4, 5, 6, 5, 5]], [[1, 0, 3, 4, 5, 2, 5, 5]], [[false, true, false, true, true, true, true, true, true, true, false, true, true]], [[1, 3, 4, 4, 3, 4, 6, 4, 6, 6]], [[2, -2, 5, 2, 2, 2, 1, 3, 4, 2, 1, 5]], [[2, 2, 1, 1, 7, 1, -2, 9, 4, 6]], [[5, 4, 3, 10, 2, 8, 2, 3, 4, 5, 2, 4, 1]], [[false, true, false, true, true, true, true, true, true, true, false, true, false, true, true]], [[2, -1, 2, -2, 1, 2]], [[4, 3, 10, 2, 1, -2, 2, 3, 4, 5, 2, 10, 5, 3]], [[2, 2, 6, -1, 1, 2, 1, 1, 4, 4, 4]], [[0]], [[1, 2, 3, 3]], [[3, 3, 2, 1]], [[1, 10, 7, 9, 8]], [[10, 9, 10, 9]], [[5]], [[1, 2, 2, 2, 3]], [[5, 5, 5, 5]], [[2, 2, 1, 0, 1, 1, 4, 4, 4]], [[1, 2, 3, -2, 4, 5, 4, 3, 2, 1]], [[5, 4, 2, 1, 2, 3, 4, 5, 5, 3]], [[2, 2, 1, 1, 1, 4, 4, 4, 4]], [[2, 2, 1, 1, 1, 4, 4, 5, 4]], [[5, 4, 5, 2, 1, 1, 1, 2, 3, 4, 5]], [[2, 2, 1, 1, 1, 4, 4, 5]], [[-2, -1, 0, 1, 2, 2, 0, -1, -2]], [[4, 2, 1, 2, 3, 4, 5, 5, 3]], [[2, 2, 1, 1, 1, 1, 4, 4, 4, 4]], [[5, 4, 3, 3, 1, 2, 3, 4, 5]], [[2, 2, 1, 1, 1, 1, 4, -2, 4, 4]], [[1, 2, 3, 4, 5, 4, 3, 2, 1, 4]], [[1, 2, 3, 4, 4, 4, 3, 2, 1, 4]], [[2, 2, 1, 1, 0, 1, 4, 5, 5]], [[3, 1, 2, 1, 1, 0, 1, 4, 5, 5]], [[2, 2, 1, 1, 1, 4, 4, 5, 4, 1]], [[1, 2, 3, 4, 4, 4, 3, 2, 1, 4, 4]], [[1, 2, 1, 1, 1, 4, 4, -1, 4, 4]], [[1, 2, 3, 4, 5, 4, 3, 2, 1, 4, 4]], [[2, 2, 1, 1, 1, -1, 4, -2, 4]], [[2, 2, 2, 1, 1, 0, 1, 4, 5, 5]], [[1, 2, 3, 4, 5, 4, 3, 2, 1, 4, 4, 1]], [[2, 2, 0, 1, 1, 4, 4, 5]], [[5, 4, 3, -1, 1, 1, 1, 2, 3, 5]], [[2, 2, 1, 0, 2, 1, 4, 4, 4]], [[1, 2, 3, 4, 5, 3, 4, 2, 1]], [[5, 4, 1, 3, 2, 1, 1, 1, 2, 3, 4, 5, 3]], [[-2, -1, 1, 2, 1, 0, -1, 2]], [[-2, -1, 0, 1, 2, 1, 0, -1, -2, 1]], [[5, 3, 3, 1, 2, 4, 5]], [[-2, 2, -1, 1, 2, 1, 0, -1, 0, 2]], [[-2, -1, 0, 1, 2, 2, 0, -1, -2, -1, -2]], [[1, 1, 3, 1, 1, 1]], [[1, 2, 3, 4, 4, 4, 3, -1, 2, 1, 4]], [[2, -2, 1, 1, 1, 4, 0, 4, 4, 4]], [[1, 3, -2, 4, 5, 4, 3, 3, 1]], [[1, 2, 3, 4, 5, 4, 3, 2, 4]], [[1, 3, 3, 2, 2, 4, 4]], [[2, 2, 1, 1, 1, 4, 4, 5, 1]], [[4, 2, 1, 1, 1, 4, 4, 4, 4]], [[2, 2, 2, 1, 1, 1, 2]], [[2, 2, 1, 0, 1, 4, 4, 5, 1]], [[2, 2, 1, 1, 1, -1, 4, 5, 5]], [[1, 3, -2, 4, 5, 4, 4, 3, 3, 1]], [[5, 4, 1, 4, 1, 1, 1, 2, 3, 4, 5, 3, 1]], [[2, 2, 1, 1, 1, 4, 4, 5, 4, 1, 4]], [[2, 2, 2, 1, 1, 0, 1, 2]], [[2, 2, 1, 1, 1, 0, 4, 4, 4]], [[2, 2, 1, 1, 0, 1, 5, 5, 5]], [[1, 2, 3, -2, 4, 0, 4, 3, 2, 1]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 2, 2, 1]], [[2, 1, 1, 1, 1, 4, 4, 4, 4, 1]], [[1, 2, 3, 4, 10, 4, 3, 2, 2, 1, 4]], [[1, 5, 3, 4, 5, 4, 3, 2, 1, 4, 4, 1]], [[1, 2, 3, -2, 4, 5, 4, 2, 1, 3]], [[2, 1, 1, 1, 0, 4, 4, 4]], [[2, 1, 1, 1, 1, 4, 4, 5, 1]], [[2, 2, -1, 1, 1, 2, 1, 4, 4, 5, 4, 1, 4, 4]], [[2, 2, 1, 1, 0, 1, 4, 5, 5, 2, 5]], [[1, 2, 3, -2, 4, 5, 4, 3, 2, 4, 2]], [[3, 2, 2, 1, 1, 1, 4, 4, 4]], [[1, 2, 3, 4, 4, 4, 10, 2, 1, 4]], [[-2, -1, 0, 1, 2, 2, 0, -2]], [[1, 2, 3, 4, 5, 3, 4, 0, 2, 1, 3]], [[1, 1, 1, 1, 1, 1, 1]], [[2, 2, 1, 1, 1, 4, 4, 1]], [[-2, -1, -1, 0, 1, 2, 1, 0, -1, -2, 1]], [[2, 2, 1, 1, 0, 4, 5, 5]], [[1, 2, 5, 3, 4, 4, 4, 3, -1, 2, 1, 6, 4]], [[2, 2, 1, 1, 1, 9, 4, 5, 4]], [[5, 4, 6, 2, 1, 2, 3, 4, 5, 5, 3]], [[2, 1, 1, 1, 1, 1, 4, 4, 4, 4]], [[1, 2, 1, 1, 0, 1, 5]], [[5, 5, 3, 2, 1, 1, 1, 2, 3, 4, -2, 3, 1]], [[5, 2, 4, 1, 4, 1, 1, 5, 1, 1, 2, 3, 4, 5, 3, 1]], [[1, 3, -2, 4, 5, 4, 3, 3, 2, 1]], [[2, 2, 3, 0, 1, 1, 4, 4, 5]], [[2, 2, -2, 2, 1, 1, 1]], [[1, 2, 1, 0, 0, 1, 5]], [[1, 2, 3, 4, 5, 4, 3, 2, 1, 3]], [[1, 1, 1, 1, 0, 1]], [[2, 2, 1, 1, 2, 1, 4, 4, 4]], [[1, 2, 3, 4, 5, 3, 4, 2, 1, 3]], [[5, 5, 3, 2, 1, 1, 2, 3, 4, -2, 3, 1]], [[2, 2, 1, 1, 2, 1, 4, 4, 4, 4]], [[2, 2, 1, 1, 2, 1, 4, 4, 5, 4, 1, 4, 4]], [[2, 2, 1, 1, 4, 4, 4]], [[1, 2, 3, 3, 5, 4, 3, 2, 4]], [[1, 1, 1, 10, 1]], [[2, 2, 1, 1, 0, 4, 6, 5]], [[-2, -1, 1, 2, 1, 1, 0, -1, 2, -2]], [[2, 2, 1, 1, -1, 1, 5, 5, 5]], [[2, 2, 1, 1, -1, 1, 5, 6, 5]], [[1, 1, 0, 1]], [[2, 2, 1, 1, 2, 1, 4, 4, 4, 4, 2]], [[1, 3, 3, 1, 2, 2, 4, 4]], [[2, 2, 1, 1, -1, 1, 5, 6]], [[1, 2, 2, 1, 1, 1, 4, 4, 5, 1]], [[2, 2, 2, 1, 1, 1, 4, -2, 4, 4]], [[2, 2, 0, -2, 1, 1, 4, 4, 5]], [[3, 2, 2, 1, 1, 4, 4, 4]], [[3, 2, 2, 1, 1, 1, 4, 3, 4, 4]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 4, 2, 1, 2]], [[-2, -1, 1, 2, 1, 0, -1, 2, 2]], [[1, 2, 1, 1, 3, 0, 1, 5]], [[2, 3, 4, 5, 6, 3, 2, 1, 9]], [[5, 4, 1, 4, 1, 1, 0, 1, 2, 3, 4, 5, 3, 1]], [[10, 2, 5, 3, 2, 6, 9, 7, 5, 4, 4, 3]], [[3, 2, 1, 1, 1, 4, 4, 1]], [[1, 1, 0, 1, 0]], [[2, 2, -1, 1, 1, 1, 4, 4, 5, 4, 1, 4, 4]], [[2, 2, 1, 1, 0, 4, 5, 5, 2, 5]], [[2, 2, 1, 1, 1, 4, 4, 4, 4, 4]], [[-2, -1, 0, 1, 2, 1, 3, 0, -1, -2, 1, 0]], [[2, 2, 1, 2, 1, 3, 4, 1]], [[2, 7, 3, 4, 5, 6, 3, 2, 1, 9]], [[-2, -1, 0, 0, 2, 2, 0, -1, -2]], [[5, 4, 1, 4, 1, 0, 1, 2, 3, 4, 5, 3, 1]], [[3, 2, 0, 2, 1, 1, 4, 4, 4]], [[3, 2, 2, 1, 1, 4, 4, 4, 4]], [[5, 4, 6, 4, 2, 1, 2, 3, 4, 4, 5, 3]], [[0, 1, 2, 3, 4, 5, 3, 4, 0, 2, 1, 3, 1, 5]], [[2, 2, 1, 1, -1, 4, 5, 5, 1]], [[1, 2, 3, 4, 10, 4, 3, 2, 2, 1, 4, 1]], [[1, 2, 3, 4, 3, 3, 4, 3, -1, 2, 1, 4]], [[2, 2, 2, 1, 1, 0, 7, 5, 5]], [[1, 7, 2, 2, 1, 1, 1, 4, 4, 1, 1]], [[2, 2, 0, 5, 1, 1, 4, 4, 5]], [[2, 1, 1, 2, 1, 4, 4, 4, 4, 1, 1]], [[2, 1, 1, 0, 4, 6, 5]], [[2, 2, 7, 2, 1, 1, 1, 4, -2, 4, 4]], [[3, 0, 2, 1, 1, 4, 4, 4]], [[1, 2, 3, 4, 5, 3, 4, 2, 6, 1]], [[1, 1, 1, 1, 9, 1]], [[2, 1, 1, 1, 4, 4, 5]], [[-2, -1, 1, 2, 2, 1, 0, -1, 2, 2, 1]], [[5, 2, 4, 1, 4, 1, 1, 5, 1, 2, 3, 4, 5, 3, 1]], [[2, 2, 3, 0, 1, 1, 1, 4, 5]], [[2, 2, 1, 1, 1, 4, 4, 5, 5, 1, 4]], [[2, 1, 1, 1, 4, 4, 5, 0]], [[2, 1, 1, 1, 1, 10, 1, 4, 4, 4, 4]], [[1, 5, 3, 5, 4, 4, 6]], [[5, 1, 1, 10, 1]], [[1, 2, 3, 5, 4, 3, 2, 1, 4]], [[-2, -1, 0, 1, 2, 1, 0, -1]], [[5, 5, 3, 1, 1, 3, 4, -2, 3, 1]], [[-2, -2, 0, 1, 2, 1, 0, -1, -2]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 4, 2, 1, 2, -2]], [[1, 2, 1, -1, 0, 1, 5]], [[-2, -1, 0, 0, 2, 2, 5, 0, 1, -2]], [[-2, -2, 0, 0, 2, 2, 5, 0, 1, -3, -2]], [[2, 1, 1, 4, 4, 5]], [[2, 2, 1, 1, 1, 10, 4, 5, 4, 4]], [[2, 1, 1, 0, 1, 1, 4, 4, 4]], [[5, 5, 3, 2, 1, 1, 1, 2, 3, 4, -2, 3, 1, -2]], [[1, 2, 3, 4, 10, 4, 3, 2, 1, 3]], [[2, 2, 1, 0, 1, 4, 4, 1]], [[2, 7, 2, 1, 1, 1, 4, -2, 4]], [[-1, 1, 2, 3, 4, 5, 3, 4, 0, 2, 1, 3, 1, 5]], [[1, 3, 4, 5, 3, 4, 2, 1, 3]], [[2, 2, 1, 1, 1, 4, 4, 5, 4, 1, 4, 2]], [[2, 2, 2, 1, 1, 0, 1, 0, 2]], [[4, 1, 1, 1, 0, 4, 5, 5]], [[1, 2, 3, 3, 5, 2, 3, 2, 4]], [[1, 2, 3, 4, 4, 3, 2, 1, 3, 3]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 4, 1, 2, -2]], [[2, 7, 3, 4, 5, 6, 3, 2, 0, 1, 9]], [[1, 2, 1, 1, 3, 0, 1]], [[2, 2, 1, 1, -1, 1, 5, 5, 5, 5]], [[1, 2, 3, -2, 4, 5, 4, 3, 2, 4, 2, 2, 2]], [[4, 1, 1, 1, 0, 10, 4, 5, 5]], [[1, 7, 2, 2, 2, 1, 1, 1, 4, 4, 1, 1]], [[1, 3, 4, 4, 4, 2, 1, 4]], [[5, 5, 4, 3, 2, 1, 2, 3, 4, 5, 3]], [[1, 2, 7, 5, 3, 4, 4, 4, 3, -1, 2, 1, 6, 4]], [[2, 2, 1, 1, 2, 1, 4, 4, 4, 2]], [[2, 2, 1, 1, 1, 2, 1, 4, 4, 5, 4, 1, 4, 4]], [[4, 2, 1, 1, 1, 4, 4, 1]], [[4, 1, 1, 1, 0, 4, 5, 5, 5]], [[2, 1, 1, 1, 1, 1, 4, 1, 4, 4, 4]], [[2, 2, -1, 2, 1, 1, 1, 4, 4, 5, 4, 1, 4, 4]], [[-3, 2, 1, 1, 1, 0, 4, 0, 5, 4]], [[2, 3, 4, 5, 6, 3, 2, 1, 9, 3]], [[1, 9, 2, 3, 4, 4, 4, 3, 2, 1, 4]], [[4, 1, 1, 1, 0, 4, 5, 5, 1]], [[3, 1, 1, 0, 1, 1, 4, 4, 4]], [[5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 2]], [[2, 2, 0, 2, 1, 1, 1, 4, 4, 5, 4, 4, 4]], [[1, 2, 3, 4, 5, 3, 4, 2, 1, -1, 3]], [[2, 2, 0, 2, 1, 1, 4, 4, 5, 4, 4, 4]], [[2, 2, 0, 1, 1, 4, 5, 5, 2]], [[1, 2, 3, 4, 1, 4, 3, 2, 1, 4, 3]], [[5, 5, 3, 2, 1, 1, 2, 3, 4, -2, 3, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 3, 3, 4, 3, -1, 2, 1, 4, 4]], [[2, 2, 2, 1, -1, 1, 0, 1, 2]], [[2, 2, 1, 1, 1, 4, 4, 4, 4, 1]], [[4, 2, 1, 2, 3, 4, 5, 5, 3, 4, 2, 4]], [[1, 2, 3, 4, 4, 3, 1, 3]], [[2, 2, 1, 1, -1, 4, 1, 5, 5, 1]], [[2, 0, -2, 1, 1, 4, 4, 5]], [[2, 2, 1, 1, -1, 1, 5, 5, 5, -1]], [[1, 1, 0, 1, 1, 0, 1]], [[10, 2, 5, 3, 2, 2, 6, 9, 7, 5, 4, 4, 3]], [[1, 3, 1, 2, 2, 4, 4]], [[4, 1, 1, 1, 4, 5, 5]], [[2, 2, 1, 1, 1, 0, 4, 4, 4, 4]], [[2, 1, 1, 1, 1, 4, 4, 4, 1]], [[2, 2, 1, 2, 1, 4, 4, 4]], [[2, 1, 1, 1, 1, 4, 4, 4, 4]], [[2, 0, -2, 1, 1, 4, 4, 5, 0]], [[-2, -1, 0, 1, 2, 1, 0, -1, 1]], [[2, 1, 0, 2, 1, 4, 4, 4, 4]], [[2, 1, 1, 1, 1, 4, 4, 4, 4, 1, 2]], [[1, 2, 5, 3, 4, 4, 4, 3, -1, 2, 1, 6, 4, 5]], [[5, 4, 1, 4, 2, 1, 1, 1, 2, 3, 4, 5, 3, 1]], [[5, 1, 10, 10, 1]], [[4, 2, 1, 1, 1, 4, 5, 1]], [[1, 2, 1, 4, 1, 3, 0, 1, 5, 1]], [[2, 2, -3, 1, -3, 1, 4, 4, 4, 4, 1]], [[-2, -2, 0, 1, 2, 1, 0, -1, -2, 0]], [[1, 2, 1, 1, 0, 1, 5, 1]], [[-2, -1, 0, 0, 2, 2, 0, -1, -2, 2]], [[1, 2, 3, 4, 5, 3, 1, 3]], [[10, 9, 2, 3, 4, 4, 4, 3, 2, 1, 4]], [[10, 9, 2, 5, 3, 2, 6, 9, 7, 5, 4]], [[2, 4, 2, 1, 1, -1, 0, 5, 5, 5, 5]], [[2, 1, 1, 1, 4, 4, 5, 1]], [[2, 2, 2, 1, 1, 1, 4, -2, 4, 4, 2]], [[2, 2, 1, 1, 1, 4, 4, 4]], [[1, 2, 3, 3, 5, 2, 3, 2, 4, 3]], [[5, 5, 3, -3, 2, 1, 1, 1, 2, 3, 4, -2, 3, 1, -2, -2]], [[2, 2, 1, 0, 1, 4, 1]], [[1, 2, 3, 0, 5, 4, 3, 2, 4]], [[2, 1, 9, 0, 1, 4, 1]], [[-2, -1, 0, 1, 2, 1, 0, -1, 1, 2]], [[2, 2, 0, 1, 4, 4, 5, 1]], [[1, 2, 7, 3, 4, 10, 4, 3, 3, 2, 1, 4]], [[2, 2, 1, 0, 2, 1, 4, 4, 4, 4]], [[6, 2, 2, 1, 10, 1, 4, 4, 5, 5, 1, 4]], [[10, 9, 2, 3, 4, 4, -3, 4, 1, 3, 6, 2, 1, 4]], [[5, 4, 5, 2, 1, 1, 1, 2, 3, 4, 5, 1, 1]], [[2, 2, 1, 1, 1, 0]], [[2, 1, 1, 1, 1, 1, 4, 4, 4]], [[5, -1, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 3]], [[1, 10, 1, 1, 3, 0, 1, 5]], [[4, 1, 1, 1, 0, 4, 5, 5, 5, 1]], [[-2, -1, 0, 0, 2, 2, 5, 0, 2, -2]], [[1, 2, 3, 4, 5, 4, 3, 2, 1, 3, 3]], [[3, 1, 2, 2, 4, 4, 2, 2]], [[1, 2, 3, 3, 5, 2, 2, 3, 2, 4]], [[1, 1, 0, 1, 5]], [[-2, 2, -1, 2, 1, 0, -1, 0, 2]], [[1, 2, 2, 3, 5, 3, 4, 2, 1, 1, 3]], [[1, 2, 3, 4, 9, 4, 3, 2, 4]], [[4, 2, 1, 1, 1, 4, 4, 1, 10, 4]], [[1, 5, 3, 4, 5, 4, 6, 2, 1, 4, 4, 1]], [[2, 1, -1, 1, 5, 5, 5, -1]], [[2, 1, 0, 2, 1, 4, 4, 5, 4, 4]], [[2, 1, 1, 1, 10, 1, 4, 4, 4, 4]], [[4, 2, 1, 1, 1, 1]], [[-2, -1, 0, 1, 2, 1, 3, 0, -2, 1, 0]], [[1, 2, 3, 3, 5, 2, 3, 2, 4, 3, 4, 3, 3]], [[0, 1, 3, 3, 2, 2, 4, 4]], [[-2, 0, 0, 0, 2, 2, 0, -1, -2]], [[5, 4, 5, 2, 1, 1, 1, 2, -2, 3, 4, 5, 1, 1]], [[5, 1, 1, 10, 5, 10, 1]], [[1, 2, 2, 1, 1, 1, 4, 4, 5, 4, 1, 4, 4]], [[2, 2, 3, 0, 1, 1, 4, 4]], [[1, 2, 1, 1, 1, 4, 4, -1, 4, 2, -1]], [[4, 2, 1, 1, 1, 4, 3, 4, 1, 10, 4]], [[1, 2, 1, 4, 1, 2, 3, 0, 1, 5, 1]], [[1, 1, 0, 1, 5, 1, 1]], [[1, 2, 3, 4, 5, 3, 2, 1, 3, 3]], [[2, 2, 1, 1, -1, 1, 5, 5, 5, -1, 2]], [[1, 3, 0, 4, 3, 4, 3, 3, 2, 1, 5, 4]], [[3, 1, 2, 2, 0, 4, 4, 2, -1, 1]], [[2, 2, 1, 2, 1, 3, 4, 4]], [[1, 2, -2, 3, 3, 5, 2, 3, 2, 4, 3]], [[2, 2, 1, 1, 1, 1, 4, -2, 4, -3, 4, 2]], [[5, 5, 3, 2, 1, 1, 1, 1, 2, 3, 4, -2, 3, 1]], [[5, 1, 1, 0, 4, 5, 4, 5]], [[4, 5, 3, 2, 1, 1, 2, 3, 4, -2, 3, 1, 3]], [[2, 0, -2, 1, 1, 4, 4, 5, 4]], [[2, 2, 2, 1, 1, 0, 1, 2, 0]], [[2, 3, 4, 5, 6, 3, 1, 9, 3]], [[1, 2, 1, 1, 0, 1, 4, 5]], [[1, 1, 1, 2, 1, 9, 1]], [[1, 1, 1, 10, 1, 10]], [[5, 3, 2, 1, 1, 2, 3, 4, -2, 3, 1, 3]], [[0, 1, 2, 3, 4, 5, 3, 4, 2, 6, 1]], [[4, 1, 1, 1, 0, 10, 3, 5, 5]], [[-2, -1, 0, 1, 2, 2, 0, -1, -2, -1, -2, -1]], [[2, 1, 1, 0, 0, 4, 4, 4]], [[5, 1, 2, 3, 4, 10, 4, 3, 2, 1, 3]], [[1, 2, 3, 4, 5, 4, 3, 2, 3]], [[3, 2, 0, 2, 1, 1, 4, 4]], [[1, 7, 2, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 2]], [[5, 2, 4, 1, 4, -3, 1, 1, 5, 1, 2, 3, 4, 5, 3, 1]], [[5, 1, 10, 1, 10, 2, 1]], [[5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 3, 1, 1]], [[2, 2, 7, 2, 1, 1, 1, 4, -2, 4]], [[1, 1, 7, 1, 0, 1]], [[-2, -1, 0, 1, 2, 1, 0, -2, 1, -1]], [[-2, -1, 1, 2, 1, 0, -1, 2, 1]], [[5, 5, 3, 2, 1, 1, 10, 1, 1, 2, 3, 4, -2, 3, 1]], [[2, 2, 1, 6, 2, 1, 4, 3, 4, 6]], [[2, 1, 3, 6, 1, 1, 1, 4, 1, 4, 4, 4]], [[1, 2, 7, 5, 3, 4, 4, 4, 3, -1, 2, 1, 6, 4, 1]], [[5, 5, 3, 2, 1, 1, 2, 3, -2, 3, 1, 3, 2]], [[1, 2, 3, 4, 5, 3, 1]], [[2, 2, 1, 0, 2, 1, -2, 4, 4, 4, 4]], [[-3, 2, 2, 1, 1, 1, 4, 4, 5]], [[2, 1, 1, 1, 4, 5, 1, 1]], [[1, 2, 3, 4, 5, 1, 4, 3, 2, 1, 3, 3]], [[2, 2, 1, -1, 1, 0, 4, 5, 5, 2, 5]], [[3, 3, 2, 0, 2, 1, 1, 4, 4, 4]], [[10, 9, 2, -3, 3, 2, 6, 9, 7, 5, 4, 10]], [[10, 9, 2, 5, 2, 6, 9, 7, 5, 4]], [[2, 3, 1, 1, 1, 1, 1, 4, 4, 4, 4, 1]], [[1, 2, 3, 2, 10, 4, 3, 2, 2, 1, 4, 1]], [[1, 1, 1, 9, 1]], [[2, 2, 1, 1, 1, 2]], [[5, 1, 1, 0, 4, 5, 4, 5, 4]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 4, 1, 2, -2, 2]], [[1, 2, 3, 4, 4, 4, 4, 3, 2, 1, 4]], [[3, 2, 2, 1, 1, 1, 4, 4, 4, 2]], [[-2, -1, 0, 1, 2, 1, 0, -1, -2, 2]], [[2, 1, 0, 2, 1, 4, 4, 3, 4, 4]], [[1, 0, 2, 3, -2, 4, 5, 0, 4, 3, 4, 1, 10, -2]], [[1, 10, 1, 1, 3, 1, 5]], [[5, 4, 5, 2, 1, 1, 1, 2, 3, 4, 1, 1, 1]], [[4, 2, 1, 2, 3, 4, 5, 5, 5, 3, 4, 2, 4]], [[1, 2, 3, 4, 10, 4, 3, 2, 2, 1, 4, 1, 4]], [[2, 2, -1, 1, 1, 1, 4, 4, 5, 4, 1, 4, 4, 2]], [[3, 1, 2, 1, 1, 4, 4, 4]], [[1, 2, 3, 4, 4, 2, 1, 3, 3]], [[5, 4, 5, 2, 1, 1, 1, 2, 3, 4, 5, 1, 1, 5]], [[2, 7, 3, 4, 5, 6, 3, 2, 0, 6, 1, 1, 9]], [[4, 2, 1, 1, 1, 3, 5, 1]], [[2, 0, 2, 2, 1, 1, 1, 4, -2, 4, 4]], [[2, 3, 4, 5, 6, 3, 2, 3, 1, 9, 3, 1]], [[-3, 1, 2, 3, 4, 2, 10, 4, 3, 2, 2, 1, 4, 1, 4]], [[2, 1, 2, 4, 5]], [[4, 1, 1, 0, 4, 5, 5]], [[-2, -1, -1, 1, 2, 0, -2]], [[-2, 0, 0, 2, 2, 0, -1, -2]], [[1, 1, 1, 10, 1, 10, 1]], [[4, 2, 2, 1, 1, 3, 5, 1]], [[1, 10, 1, 1, 1, 1]], [[2, 2, 2, 1, 0, 2, 1, 3, 4, 4, 4, 4]], [[2, 7, 3, 3, 5, 6, 3, 2, 0, 1, 9]], [[5, 4, 3, 2, 1, 1, 2, 3, 4]], [[-2, -1, 2, 1, 0, -1]], [[0, 1, 2, 3, 4, 5, 3, 4, 0, 2, 1, 1, 5]], [[2, 2, 1, 1, 5, 0, 4, 5, 5]], [[2, 2, 1, 4, 1, -1, 1, 5, 5, 5, 5]], [[2, 1, 1, 1, 0, 4, 0, 5, 4, 2, 1]], [[2, 2, 1, 1, 0, 2]], [[1, 2, 3, 4, 4, 4, 11, 2, 1, 4]], [[2, 2, 1, 0, 2, 1, 9, 4, 4]], [[5, 3, 2, 1, 1, 2, 3, 4, -2, -1, 1, 3]], [[1, 2, 7, 5, 3, 4, 4, 4, 3, -1, 5, 2, 1, 6, 4]], [[2, 2, 1, 0, 1, 9, 4, 5, 1]], [[2, 4, 2, 1, 1, 1, 4, 4, 4, 4, 4]], [[3, 1, 2, 2, 0, 4, 10, 2, -1, 1]], [[2, 2, 1, 1, 2, 1, 4, 4]], [[1, 1, 1, 0, 1, 5]], [[1, 1, 3, 4, 5, 3, 4, 2, 1, 3, 1]]], "completion": "\n\ndef monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"\n return all(l[i] <= l[i+1] for i in range(len(l)-1)) or all(l[i] >= l[i+1] for i in range(len(l)-1))\n\n", "raw_completion": "```python\n\ndef monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"\n return all(l[i] <= l[i+1] for i in range(len(l)-1)) or all(l[i] >= l[i+1] for i in range(len(l)-1))\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef monotonic(l: list):\n \"\"\"Return True is list elements are monotonically increasing or decreasing.\n >>> monotonic([1, 2, 4, 20])\n True\n >>> monotonic([1, 20, 4, 10])\n False\n >>> monotonic([4, 1, 0, -10])\n True\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/58", "prompt": "\n\ndef common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n\n \"\"\"\n", "entry_point": "common", "canonical_solution": "\n return sorted(list(set(l1).intersection(set(l2))))\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121]) == [1, 5, 653]\n assert candidate([5, 3, 2, 8], [3, 2]) == [2, 3]\n assert candidate([4, 3, 2, 8], [3, 2, 4]) == [2, 3, 4]\n assert candidate([4, 3, 2, 8], []) == []\n\n", "contract": "\n assert type(l1) == type(l2) == list, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121]], [[5, 3, 2, 8], [3, 2]], [[4, 3, 2, 8], [3, 2, 4]], [[4, 3, 2, 8], []]], "atol": 0, "plus_input": [[[1, 2, 3], [1, 2, 3]], [[], [1, 2, 3]], [[1, 2, 3], []], [[], []], [[1, 1, 2, 2, 3, 3], [2, 2, 3, 3, 4, 4]], [[1, 5, 10], [5, 7, 8]], [[1, 2, 3, 4, 5], [6, 7, 8, 9]], [[1, 1, 2, 3, 3, 3, 4], [1, 3, 5, 6]], [[1, 2, 3, 4], [1, 2, 3, 4]], [[1, 2, 3, 4], []], [["SgmW", "wdIIZAXJqx", "sRbO", "mqbFo", "", "vZmyAs", "dajGeqFZ", "Jr", "Hv"], [1, 2, 3, 1]], [[1, 2, 3], [1, 2, 3, 4]], [[1, 2], [1, 2]], [[1, 9, 2, 1, 2], [1, 9, 2, 1, 2]], [[1, 2, 3, 4, 4, 5], [6, 7, 8, 9]], [[1, 3], [1, 3]], [[1, 2, 3], [1, 5, 3, 4]], [[2, 2, 3, 3, 4, 4], [2, 2, 3, 3, 4, 4]], [[1, 2, 3], [false, true, false, false]], [[1, 2, 3, 4, 5], [6, 7, 8, 9, 9]], [[1, 5, 3], [5, 7, 8]], [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5]], [[-50, 59, -37, 5], [-50, 59, -37, 5]], [[1, 9, 2, 2, 1, 2], [1, 9, 2, 2, 1, 2]], [[72.37521383648374, 75.77463522981091, -68.50801238200772, -16.457158264907306, -14.710649879972792, -50.826346308865425, 94.08151854781187, 62.25940015569594], []], [[1, 3, 9, 5, 6], [1, 3, 9, 5, 6]], [[5, 1, 2, 3, 4], [5, 1, 2, 3, 4]], [[1, 2, 3], [1, 2, 3, 5]], [[-50, 59, 3, 5], [-50, 59, 3, 5]], [[1, 2, 2, 3, 5, 3, 1, 1], [1, 2, 2, 3, 5, 3, 1, 1]], [[9, 2, 2, 1, 2], [9, 2, 2, 1, 2]], [[1, 5, 3, 4], [1, 5, 3, 4]], [[1, 2, 2, 3, 5, 3, 1], [1, 2, 2, 3, 5, 3, 1]], [[6, 9, 8, 7, 8], [6, 9, 8, 7, 8]], [[1, 2, 59, 3, 4], [1, 2, 59, 3, 4]], [[1, 2, 3, 4, 4, 5, 4], [1, 2, 3, 4, 4, 5, 4]], [[1, 5, 10], [10, 5, 7, 8]], [[-50, 59, 3, 5, 3], [-50, 59, 3, 5, 3]], [[5, 1, 1, 2, 3, 4], [5, 1, 1, 2, 3, 4]], [[5, 1, 2, 3, 4, 4], [5, 1, 2, 3, 4, 4]], [[1, 1, 2, 3, 4, 2], [1, 1, 2, 3, 4, 2]], [[72.37521383648374, 75.77463522981091, -68.50801238200772, -16.457158264907306, -14.710649879972792, -50.826346308865425, 94.08151854781187, 62.25940015569594, -16.457158264907306], [72.37521383648374, 75.77463522981091, -68.50801238200772, -16.457158264907306, -14.710649879972792, -50.826346308865425, 94.08151854781187, 62.25940015569594, -16.457158264907306]], [[1, 4, 10, 10], [1, 4, 10, 10]], [[6, 8, 7, 8], [6, 8, 7, 8]], [[1, 9, 2, 1, 2, 2], [1, 9, 2, 1, 2, 2]], [[6, 9, 8, 7, 7, 3, 8, 9], [6, 9, 8, 7, 7, 3, 8, 9]], [[6, 9, 8, 7, 8, 8], [6, 9, 8, 7, 8, 8]], [[1, 4, 10, 1], [1, 4, 10, 1]], [[1, 59, 5, 4], [1, 59, 5, 4]], [[1, 4, 3, 10, 1], [1, 4, 3, 10, 1]], [[7, 4, 10], [7, 4, 10]], [[1, 3, 1], [1, 3, 1]], [[9, 2, 1, 2, 2], [9, 2, 1, 2, 2]], [[1, 10, 10], [1, 10, 10]], [[1, 5, 59, 3], [5, 7]], [[1, 11], [10, 5, 7, 8]], [[1, 2, 3], [1, 2, 3, 2, 4]], [[1, 59, 2, 3, 5, 3, 1], [1, 59, 2, 3, 5, 3, 1]], [[1, 5], [10, 5, 6, 7, 8]], [[0, 2, 3, 4, 3, 4], [0, 2, 3, 4, 3, 4]], [[1, 4, 10, 10, 4], [1, 4, 10, 10, 4]], [[false, true], [false, true]], [[0, 10, 10], [0, 10, 10]], [[1, 3, 2, 3, 4, 4, 5, 4, 3], [1, 3, 2, 3, 4, 4, 5, 4, 3]], [[1, 5, 2, 3], [1, 5, 2, 3]], [[1, 10, 9, 5, 6], [1, 10, 9, 5, 6]], [[7, 9], [7, 9]], [[1, 5, 2, 59, 3], []], [[true, false, false, false, true, false, false, true, false, true, false], [true, false, false, false, true, false, false, true, false, true, false]], [[1, 10, 5], [1, 10, 5]], [[1, 1, 2, 3, 4, 0, 3, 3, 4], [1, 3, 5, 6]], [[-66.80587176097761, 61.566275072399776, -74.68836438529377, -0.19883232278070295, -0.6234234911641607, -50.826346308865425, -58.86766032411499, 62.25940015569594, 95.27559980134242], []], [[true, false, false, false, true, false, false, true, false, true, false, false], [true, false, false, false, true, false, false, true, false, true, false, false]], [[], [1, 2, 3, 3]], [[-50, 59, -37, 5, 59], [-50, 59, -37, 5, 59]], [[3, 5, 1, 3, 2, 3, 8, 1, 4], [3, 5, 1, 3, 2, 3, 8, 1, 4]], [["SgmW", "wdIIZAXJqx", "sRbO", "mqbFo", "", "vZmyAs", "dajGeqFZ", "Jr", "Hv"], [1, 2, 3, 1, 2]], [[1, 2, 2, 3, 5, 3, 1, 2], [1, 2, 2, 3, 5, 3, 1, 2]], [[59, -37, 5, 59, 59], [59, -37, 5, 59, 59]], [[true, false, false, false, true, false, false, true, false, false, false], [true, false, false, false, true, false, false, true, false, false, false]], [[1], [1]], [[-51, 59, -52, 59, -37, 5], [-51, 59, -52, 59, -37, 5]], [[75.77463522981091, -68.50801238200772, -14.710649879972792, -50.826346308865425, 94.08151854781187, 62.25940015569594, -16.457158264907306], [75.77463522981091, -68.50801238200772, -14.710649879972792, -50.826346308865425, 94.08151854781187, 62.25940015569594, -16.457158264907306]], [[1, 2, 3, 4, 3, 4], [1, 2, 3, 4, 3, 4]], [[true, false, false, false, false, true, false, false, true, false, false, false], [true, false, false, false, false, true, false, false, true, false, false, false]], [[1, 2, 2, 3, 5, 3, 59, 3, 1, 2], [1, 2, 2, 3, 5, 3, 59, 3, 1, 2]], [[1, 10, 10, 10, 10], [1, 10, 10, 10, 10]], [[3, 1, 9, 2, 2, 1, 2, 2], [3, 1, 9, 2, 2, 1, 2, 2]], [[1, 5, false], [1, 5, false]], [[7, 3, 9, 5, 6, 5], [7, 3, 9, 5, 6, 5]], [[true, false, false, false, true, false, false, true, false, false, false, false], [true, false, false, false, true, false, false, true, false, false, false, false]], [[1, 2, 3], [1, 2, 3, 3]], [[1, 10, 5, 11, 6], [1, 10, 5, 11, 6]], [[1, 9, 6, 6], [1, 9, 6, 6]], [[2, 2, 1, 59, 3, 4], [2, 2, 1, 59, 3, 4]], [[1, 3, 4], [1, 3, 4]], [[1, 11], [1, 11]], [[0, -51, 10], [0, -51, 10]], [[1, 4, 9, 9], [1, 4, 9, 9]], [[10, 5, 11, 6], [10, 5, 11, 6]], [[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5], [5, 4, 3, 2, 1]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6, 5]], [[1, 1, 1, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[1, 2, 3], [3, 4, 5]], [[1, 2, 3, 4], [4, 5, 6, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9], [10, 11, 12]], [[], [1, 2, 3, 4]], [[6, 8, 8, 9, 10], [6, 8, 8, 9, 10]], [[6, 9, 8, 8, 9, 10], [6, 9, 8, 8, 9, 10]], [[6, 7, 8, 9, 10], [1, 1, 3, 4, 5]], [[1, 3, 1, 1, 2, 2, 2, 3, 3], [9, 8, 7, 6, 5]], [[1, 2, 3, 4], [4, 5, 6, 7, 7]], [[1, 2, 3, 4], [4, 5, 7, 6, 7, 7]], [[9, 8, 7, 6, 5], [1, 1, 1, 2, 2, 2, 3, 3, 3]], [[1, 2, 2, 4], [1, 2, 2, 4]], [[1, 2, 3], [4, 5, 6, 7]], [[10, 3], [3, 4, 5, 3]], [[4, 5], [4, 5]], [[1, 3, 1, 1, 2, 2, 2, 3, 3], [1, 3, 1, 1, 2, 2, 2, 3, 3]], [[1, 2, 3, 5, 6, 4, 8, 9], [1, 2, 3, 5, 6, 4, 8, 9]], [[1, 2, 3, 4, 5, 6, 7, 1, 8, 9], [1, 11, 5, 5]], [[9, 8, 7, 6, 5], [9, 8, 7, 6, 5]], [[1, 2, 4, 3], [1, 2, 4, 3]], [[1, 2, 3, 4, 5, 6, 5, 7, 8, 9], [10, 11, 12]], [[1, 1, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[9, 8, 9, 7, 6, 5], [9, 8, 9, 7, 6, 5]], [[1, 2, 3, 2, 4], [1, 2, 3, 2, 4]], [[1, 2, 3, 4, 2, 1], [1, 2, 3, 4, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 3, 4, 5, 6, 7, 8, 9]], [[2, 3, 9, 4, 5, 2], [2, 3, 9, 4, 5, 2]], [[8, 2, 3, 4, 4], [8, 2, 3, 4, 4]], [[6, 8, 9, 10], [1, 1, 3, 4, 5]], [[9, 6, 8, 9, 10], [9, 6, 8, 9, 10]], [[1, 11, 5, 5, 5], [1, 11, 5, 5, 5]], [[1, 2, 3, 2], [1, 2, 3, 2]], [[1, 1, 1, 1, 2, 2, 2], [1, 1, 1, 1, 2, 2, 2]], [[1, 5, 2, 3, 6, 8, 9], [1, 5, 2, 3, 6, 8, 9]], [[1, 2, 3, 6, 8, 9], [1, 2, 3, 6, 8, 9]], [[1, 2, 3, 4, 5, 6, 7, 1, 8, 9], [1, 11, 5]], [[2, 2, 3, 9, 4, 5, 4], [2, 2, 3, 9, 4, 5, 4]], [[1, 2, 3, 6, 9, 2], [1, 2, 3, 6, 9, 2]], [[9, 8, 7, 6, 5, 5], [9, 8, 7, 6, 5, 5]], [[7, 8, 9, 10], [1, 1, 3, 4, 5]], [[9, 9, 9, 7, 7, 10, 6], [9, 9, 9, 7, 7, 10, 6]], [[1, 2, 6, 3, 4, 5, 3], [1, 2, 6, 3, 4, 5, 3]], [[1, 11, 5, 5], [1, 11, 5, 5]], [[10, 10, 3], [3, 4, 5, 3]], [["SfYzsI", "CXAPmEz", "D", "SfYzsI"], []], [[2, 2, 4], [2, 2, 4]], [[1, 2, 3, 2], [4, 5, 6, 7, 4]], [[6, 7, 8, 9, 10, 7], [1, 1, 3, 4, 5]], [[8, 8, 9, 10], [8, 8, 9, 10]], [[1, 2, 4, 4, 5, 6, 5, 7, 8, 9], [10, 11, 12]], [[7, 7, 8, 9, 10], [7, 7, 8, 9, 10]], [[1, 1, 3, 2, 2], [1, 1, 3, 2, 2]], [[8, 2, 3, 4, 4, 3], [8, 2, 3, 4, 4, 3]], [[7, 8, 9, 10], [7, 8, 9, 10]], [[1, 1, 2, 4], [7, 8, 9, 10]], [[4], [4]], [[1, 1, 2, 1, 1, 2, 2, 2, 2], [1, 1, 2, 1, 1, 2, 2, 2, 2]], [[1, 1, 2, 2, 2], [1, 1, 2, 2, 2]], [[1, 2, 3, 4, 3], [1, 2, 3, 4, 3]], [[1, 1, 1, 2, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[1, 2, 3, 8, 4, 5, 4], [1, 2, 3, 8, 4, 5, 4]], [[10, 3, 12, 12], [10, 3, 12, 12]], [[1, 2, 3], [4, 5]], [[2, 10, 2, 6, 4, 4], [2, 10, 2, 6, 4, 4]], [[1, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[2, 2, 8], [2, 2, 8]], [[8, 9, 10], [8, 9, 10]], [[8, 7, 8, 9, 9, 10, 10], [8, 7, 8, 9, 9, 10, 10]], [[11, 1, 1, 1, 2], [11, 1, 1, 1, 2]], [[1, 7, 3, 2, 2], [1, 7, 3, 2, 2]], [[1, 11, 5, 6, 5, 5], [1, 11, 5, 6, 5, 5]], [[8, 9, 9, 10, 9], [8, 9, 9, 10, 9]], [[3, 1, 1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6]], [[6, 7, 8, 9, 10, 7], [1, 1, 3, 4, 5, 4]], [[4, 10, 11, 12], [4, 10, 11, 12]], [[1, 1, 2, 11, 4], [7, 8, 9, 10]], [[7, 8, 9, 10, 10], [7, 8, 9, 10, 10]], [[1, 1, 1, 2, 2], [1, 2, 2]], [[1, 2, 3, 4, 11, 5], [1, 2, 3, 4, 11, 5]], [[10, 3, 10], [3, 4, 5, 3]], [[10, 3, 10, 3], [3, 4, 5, 3]], [[8, 9, 1, 10, 10, 9, 10], [8, 9, 1, 10, 10, 9, 10]], [[7, 8, 9, 10, 10, 10], [7, 8, 9, 10, 10, 10]], [[9, 9, 8, 7, 7, 10, 6], [9, 9, 8, 7, 7, 10, 6]], [[6, 1, 2, 3, 4, 5, 8, 6, 5, 7, 8], [10, 11, 12, 12]], [[1, 1, 11, 4], [7, 8, 9, 10]], [[8, 9, 9, 10, 9, 10], [8, 9, 9, 10, 9, 10]], [[2, 2, 5], [2, 2, 5]], [[-45, 34], [35]], [[1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 2], [1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 2]], [[1, 2, 3, 6, 9, 2, 1], [1, 2, 3, 6, 9, 2, 1]], [[1, 2, 2, 2, 2], [1, 2, 2, 2, 2]], [[6, 7, 8, 9, 10, 7], [1, 1, 4, 5, 4]], [[10, 3], [3, 4, 5]], [[2, 9, 4, 4], [2, 9, 4, 4]], [[8, 9, 7, 6, 5, 7, 7], [8, 9, 7, 6, 5, 7, 7]], [[1, 12, 5, 3, 4, 3], [1, 12, 5, 3, 4, 3]], [[1, 2, 3, 4], [4, 5, 6]], [[4, 10, 12], [4, 10, 12]], [[12, 3], [3, 4, 5, 3, 5]], [[9, 9, 8, 7, 10, 6], [9, 9, 8, 7, 10, 6]], [[9, 7, 7, 6, 5, 5], [9, 7, 7, 6, 5, 5]], [[1, 2, 3, 4, 4, 2, 2], [1, 2, 3, 4, 4, 2, 2]], [[8, 9, 7, 6, 5, 3, 7], [8, 9, 7, 6, 5, 3, 7]], [[1, 1, 11, 4], [7, 8, 9]], [[1, 2, 3, 8, 4, 5], [1, 2, 3, 8, 4, 5]], [[7, 9, 9, 9, 7, 7, 10, 6], [7, 9, 9, 9, 7, 7, 10, 6]], [[8, 9, 10, 10, 9], [8, 9, 10, 10, 9]], [[], ["Mkhzhnbpu", "iAg", "EHNYs", "SfYzsI", "CXAPmEz", "VH", "Pqo", "vvtmNe"]], [[8, 9, 1, 10, 10, 9, 10, 9], [8, 9, 1, 10, 10, 9, 10, 9]], [[12, 3], [12, 3]], [[0, 35, 3], [0, 35, 3]], [[1, 1, 2, 1, 0, 4, 1, 2, 2, 2, 2, 1], [1, 1, 2, 1, 0, 4, 1, 2, 2, 2, 2, 1]], [["SfYzsI", "CXAPmEz", "D", "SfYzsI"], ["QoHVx", "Pqo", "Pqo", "D", "XNNCdHcXOu", "XC", "CXAPmEz", ""]], [[8, 9, 9], [8, 9, 9]], [[2, 2, 3, 6, 9, 2, 1], [2, 2, 3, 6, 9, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 1], [1, 2, 3, 4, 5, 6, 7, 8, 9, 1]], [[1, 2, 3, 9, 2], [1, 2, 3, 9, 2]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 1], [1, 1, 2, 1, 1, 2, 2, 2, 2, 1]], [[1, 1, 2, 2, 2], [1, 1, 1, 2, 2, 2, 1]], [[0, 36, 3], [0, 36, 3]], [[11, 1, 2, 3, 12, 10, 8, 9], [11, 1, 2, 3, 12, 10, 8, 9]], [[6, 9, 8, 8, 10], [6, 9, 8, 8, 10]], [[8, 8, 9, 3, 10], [8, 8, 9, 3, 10]], [[1, 1, 4], [7, 8, 9, 10]], [[3, 12, 12], [3, 12, 12]], [[1, 2, 4, 2, 1], [1, 2, 4, 2, 1]], [[35, 2, 6, 10, 4, 5, 3], [35, 2, 6, 10, 4, 5, 3]], [[1, 3, 2, 2, 2, 4], [1, 3, 2, 2, 2, 4]], [[1, 2, 3, 4, 2, 1, 1], [1, 2, 3, 4, 2, 1, 1]], [[7, 9, 10, 9, 7], [7, 9, 10, 9, 7]], [[7, 7, 8, 9, 10, 10], [7, 7, 8, 9, 10, 10]], [[8, 8, 8, 10], [8, 8, 8, 10]], [[1, 1, 1, 2, 2, 2, 3, 5, 3, 3], [9, 8, 7, 6, 5]], [[8, 2, 3, 4, 4, 9, 3], [8, 2, 3, 4, 4, 9, 3]], [[9, 9, 8, 7, 6, 10, 9], [9, 9, 8, 7, 6, 10, 9]], [[1, 1, 3, 2, 2, 2, 4], [1, 1, 3, 2, 2, 2, 4]], [[1, 2, 4, 5], [6, 7, 8, 9]], [[8, 7, 9, 9, 9, 7, 7, 9, 6], [8, 7, 9, 9, 9, 7, 7, 9, 6]], [[1, 2, 3, 6, 9, 2, 1, 1], [1, 2, 3, 6, 9, 2, 1, 1]], [[1, 1, 1, 2, 2, 2, 2], [1, 1, 1, 2, 2, 2, 2]], [[2], [2]], [[4, 12, 3, 4], [4, 12, 3, 4]], [[1, 2, 3, 2, 4, 4], [1, 2, 3, 2, 4, 4]], [[8, 7, 9, 9, 8, 9, 7, 7, 9, 6], [8, 7, 9, 9, 8, 9, 7, 7, 9, 6]], [[1, 1, 2, 1, 0, 1, 2, 2, 2, 2, 1, 2], [1, 1, 2, 1, 0, 1, 2, 2, 2, 2, 1, 2]], [[34, -45, 12, 34], [34, -45, 12, 34]], [[1, 2, 2], [1, 2, 2]], [[-1, 3], [-1, 3]], [[7, 8, 9, 10, 10, 10, 10], [7, 8, 9, 10, 10, 10, 10]], [[1, 2, 3, 2, 8, 12], [1, 2, 3, 2, 8, 12]], [[1, 3, 2, 2], [1, 1, 1, 2, 2, 2]], [[10, 10, -45, 3], [3, 4, 5, 3]], [[4, 12, 12], [4, 12, 12]], [[34, 1, 2, 2, 4], [34, 1, 2, 2, 4]], [[3, 4, 5], [3, 4, 5]], [[1, 4, 1, 2, 2, 2, 2], [1, 4, 1, 2, 2, 2, 2]], [[34, -45, 12, 34, 12], [34, -45, 12, 34, 12]], [[1, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 2], [1, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 2]], [[9, 7, 7, 7, 1, 5], [9, 7, 7, 7, 1, 5]], [[35], [35]], [[3, 2, 3, 12, 12], [3, 2, 3, 12, 12]], [[7, 8, 9, 10, 10, 10, 9], [7, 8, 9, 10, 10, 10, 9]], [[4, 10, 12, 10], [4, 10, 12, 10]], [[5, 4, 8, 11, 12, 10], [5, 4, 8, 11, 12, 10]], [[6, 12, 7, 8, 9, 10, 7], [6, 12, 7, 8, 9, 10, 7]], [[35, 1, 2, 4, 2, 1, 4], [35, 1, 2, 4, 2, 1, 4]], [[-49.59113788406315, -15.823575020711672, -50.75064768360904, 43.025195515136005, 87.01345659296072, -57.351923170295606], []], [[10, 12], [10, 12]], [[1, 1, 2, 2, 2, 0, 2], [1, 1, 2, 2, 2, 0, 2]], [[1, 1, 7, 2, 2, 0, 2, 2], [1, 1, 7, 2, 2, 0, 2, 2]], [[6, 7, 8, 9, 10, 7], [6, 7, 8, 9, 10, 7]], [[8, 9, 9, 9, 10], [8, 9, 9, 9, 10]], [[9, 6, 8, 9, 10, 6], [9, 6, 8, 9, 10, 6]], [[7, 8, 9, 10, 10, 9], [7, 8, 9, 10, 10, 9]], [[1, 2, 6, 3, 4, 34, 3], [1, 2, 6, 3, 4, 34, 3]], [[5, 2, 2, 4, 5], [6, 7, 8, 9]], [[6, 9, 8, 10, 8], [6, 9, 8, 10, 8]], [[2, 2, 5, 5], [2, 2, 5, 5]], [[9, 9, 9, 7, 7, 10, 6, 7], [9, 9, 9, 7, 7, 10, 6, 7]], [[1, 2, 0, 3, 4, 2, 1, 1], [1, 2, 0, 3, 4, 2, 1, 1]], [[9, 9, 9, 8, 7, 6, 10, 9], [9, 9, 9, 8, 7, 6, 10, 9]], [[4, 1, 2], [4, 1, 2]], [[1, 7, 3, 2, 2, 7], [1, 7, 3, 2, 2, 7]], [[9, 6, 9, 8, 10, 8], [9, 6, 9, 8, 10, 8]], [[9, 6, 8, 9, 10, 6, 10], [9, 6, 8, 9, 10, 6, 10]], [[9, 6, 9, 8, 8], [9, 6, 9, 8, 8]], [[9, 6, 8, 9, 10, 6, 9], [9, 6, 8, 9, 10, 6, 9]], [[1, 2, 3, 11, 3], [1, 2, 3, 11, 3]], [[1, 8, 2, 3, 4, 2, 1], [1, 8, 2, 3, 4, 2, 1]], [[1, 2, 36, 3, 6, 9, 2, 1, 1], [1, 2, 36, 3, 6, 9, 2, 1, 1]], [[7, 8, 9, 10, 8, 8], [7, 8, 9, 10, 8, 8]], [[1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 3, 4, 5, 6, 7, 8]], [[3, 2, 12, 3, 12, 12], [3, 2, 12, 3, 12, 12]], [[9, 6, 36, 9, 10, 6, 9, 9], [9, 6, 36, 9, 10, 6, 9, 9]], [[4, 3, 3, 1, 1, 1, 2, 2, 2, 3, 3, 3, 2], [4, 3, 3, 1, 1, 1, 2, 2, 2, 3, 3, 3, 2]], [[8, 7, 9, 9, 9, 7, 7, 10, 9, 6], [8, 7, 9, 9, 9, 7, 7, 10, 9, 6]], [[1, 1, 3, 4, 5, 4], [6, 7, 8, 9, 10, 7, 7, 7]], [[34, 1, 2, 2, 4, 4], [34, 1, 2, 2, 4, 4]], [[4, 12, 2, 4], [4, 12, 2, 4]], [[1, 2, 3], [5]], [[1, 1, 7, 2, 1, 2, 0, 2, 2, 0], [1, 1, 7, 2, 1, 2, 0, 2, 2, 0]], [[2, 2], [2, 2]], [[6, 1, 2, 3, 4, 5, 8, 6, 5, 7, 8, 8], [10, 11, 12, 12]], [[5, 4, 12, 2, 4], [5, 4, 12, 2, 4]], [[2, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 2, 2], [2, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 2, 2]], [[5, 4, 9, 8, 11, 12, 10], [5, 4, 9, 8, 11, 12, 10]], [[1, 1, 1, 2, 2, 2, 7, 1, 1], [1, 1, 1, 2, 2, 2, 7, 1, 1]], [[8, 8, 9, 0, 10], [8, 8, 9, 0, 10]], [[1, 3, 2, 2, 2], [1, 3, 2, 2, 2]], [[1, 2, 3, 36, 11, 5], [1, 2, 3, 36, 11, 5]], [[8, 7, 9, 9, 9, 7, 10, 9, 6, 10], [8, 7, 9, 9, 9, 7, 10, 9, 6, 10]], [[10, 7, -45, 7, 6, 1, 5], [10, 7, -45, 7, 6, 1, 5]], [[6, 9, 9, 9, 10, 8], [6, 9, 9, 9, 10, 8]], [[6, 7, 8, 9, 10, 7], [2, 1, 1, 4, 5, 4]], [[1, 2, 1], [1, 2, 1]], [[1, 1, 1, 2], [1, 1, 1, 2]], [[2, 1, 1, 2, 2, 2, 3, 3, 3, 3, 2, 2], [2, 1, 1, 2, 2, 2, 3, 3, 3, 3, 2, 2]], [[13, 12, 3], [13, 12, 3]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 1], [1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 1]], [[1, 2, 4, 4, 5, 6, 5, 7, 8, 9], [1, 2, 4, 4, 5, 6, 5, 7, 8, 9]], [["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "D", "XNNCdHcXOu", "XC", "CXAPmEz", ""], ["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "D", "XNNCdHcXOu", "XC", "CXAPmEz", ""]], [[-1, 2], [-1, 2]], [[9, 8, 6, 9, 8, 8], [9, 8, 6, 9, 8, 8]], [[7, 9, 10, 9, 6, 7], [7, 9, 10, 9, 6, 7]], [["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "XNNCdHcXOu", "XC", "CXAPmEz", ""], ["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "XNNCdHcXOu", "XC", "CXAPmEz", ""]], [[1, 1, 1, 2, 2], [1, 1, 1, 2, 2, 2]], [[1, 2, 3, 7, 2, 1, 1], [1, 2, 3, 7, 2, 1, 1]], [[1, 1, 2, 2, 2, 3, 3], [1, 1, 2, 2, 2, 3, 3]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 6, 5]], [[8, 2, 3, 4, 3], [8, 2, 3, 4, 3]], [[8, 9, 9, 9, 10, 10, 10], [8, 9, 9, 9, 10, 10, 10]], [[7, 6, 12, 7, 8, 9, 0, 7], [7, 6, 12, 7, 8, 9, 0, 7]], [[1, 1, 4], [7, 8, 9]], [[1, 5, 2, 3, 4, 5], [1, 5, 2, 3, 4, 5]], [[1, 2, 3, 34, 4, 5, 6, 7, 8, 9], [1, 2, 3, 34, 4, 5, 6, 7, 8, 9]], [[9, 8, 9, 10, 6, 9, 9, 9], [9, 8, 9, 10, 6, 9, 9, 9]], [[1, 1, 3, 4, 2, 5], [1, 1, 3, 4, 2, 5]], [[8, 8, 9, 7, 0, 10], [8, 8, 9, 7, 0, 10]], [[4, 1], [4, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 1, 1], [1, 2, 3, 4, 6, 7, 8, 9, 1, 1]], [[1, 12, 1], [1, 12, 1]], [[1, 8, 3, 2], [3, 5, 6, 7, 4]], [[1, 2, 3, 4, 5], [6, 2, 7, 8, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 11, 5]], [[1, 1, 1, 7, 2, 2, 0, 2, 2], [1, 1, 1, 7, 2, 2, 0, 2, 2]], [[1, 2, 3, 9, 2, 9], [1, 2, 3, 9, 2, 9]], [[6, 7, 8, 10, 7], [6, 7, 8, 10, 7]], [[4, 5, 6, 7, 4], [4, 5, 6, 7, 4]], [[69, 8, 35, 10, 36, 8, 1, 2], [69, 8, 35, 10, 36, 8, 1, 2]], [[1, 2, 3, 7, 4, 5, 3, 6, 7, 8, 3], [1, 2, 3, 7, 4, 5, 3, 6, 7, 8, 3]], [[8, 10], [8, 10]], [[1, 35, 12, 12], [1, 35, 12, 12]], [[13, 2, 5, 5, 5], [13, 2, 5, 5, 5]], [[1, 3, 4, 5, 6, 7, 8, 9], [1, 10, 5]], [[1, 8, 3, 2], [3, 5, 6, 7, 4, 3]], [[1, 1, 8, 2], [1, 1, 8, 2]], [[1, 6, 5, 3, 4, 3], [1, 6, 5, 3, 4, 3]], [[1, 2, 3, 4, 5], [6, 7, 8, 9, 8]], [[1, 7, 3, 2], [3, 6, 7, 5, 4]], [[1, 1, 3, 2, 9, 2, 2, 4], [1, 1, 3, 2, 9, 2, 2, 4]], [[9, 6, 9, 8, 8, 9], [9, 6, 9, 8, 8, 9]], [[1, 4], [7, 8, 9]], [[8, 3], [3, 5, 6, 7, 4]], [[1, 2, -1], [5, 5]], [[1, 2, -45, 4], [4, 5, 8, 6, 6]], [[1, 1, 2, 3, 2, 2], [1, 1, 1, 2, 2, 2]], [[8, 9, 8, 7, 6, 5], [8, 9, 8, 7, 6, 5]], [[1, 1, 10, 4], [8, 9, 10, 8]], [[1, 2, 3, 8, 4, 4], [1, 2, 3, 8, 4, 4]], [[1, 2, 6, -45, 4], [4, 5, 8, 6, 6, 5]], [[8, 7, 36, 9, 9, 7, 7, 9, 6], [8, 7, 36, 9, 9, 7, 7, 9, 6]], [[8, 1, 10, 10, 9, 10], [8, 1, 10, 10, 9, 10]], [[12, 3, 4], [12, 3, 4]], [[9, 9, 8, 8, 7, 6, 10, 9], [9, 9, 8, 8, 7, 6, 10, 9]], [[1, 12, 5, 5, 3, 5], [1, 12, 5, 5, 3, 5]], [[1, 2, -45, 4], [34, 4, 5, 8, 6, 6]], [[10, 3, 10, 3], [3, 4, 5]], [[7, 6, 12, 7, 9, 0, 7], [7, 6, 12, 7, 9, 0, 7]], [[1, 2, 4, 5, 6, 5, 7, 8, 9], [10, 11, 13]], [[8, 2, 2], [8, 2, 2]], [[8, 9, 9, 10, 10, 10, 10], [8, 9, 9, 10, 10, 10, 10]], [[1, 1, 2, 2, 2, 3, 3, 3], [1, 1, 2, 2, 2, 3, 3, 3]], [[1, 2, 3, 4], [12, 5, 6, 7, 5]], [[5, 8, 11, 12, 10], [5, 8, 11, 12, 10]], [[7, 9, 7, 7, 6, 1, 5], [7, 9, 7, 7, 6, 1, 5]], [[2, 3, 11, 9, 4, 5, 2], [2, 3, 11, 9, 4, 5, 2]], [[5, 7, 7, 6, 6, 8], [5, 7, 7, 6, 6, 8]], [[2, 3, 34, 4, 5, 6, 7, 9, 9, 7], [2, 3, 34, 4, 5, 6, 7, 9, 9, 7]], [[1, 3, 2, 2], [1, 1, 1, 2, 1, 2]], [[8, 9, 10, 7, 8], [8, 9, 10, 7, 8]], [[1, 1, 2, 2], [1, 1, 2, 2]], [[1, 7, 2, 2, 0, 2, 2], [1, 7, 2, 2, 0, 2, 2]], [[9, 1, 3, 2, 4, 2], [9, 1, 3, 2, 4, 2]], [[4, 1, 4], [4, 1, 4]], [[34, 1, 2, 3, 4, 4], [34, 1, 2, 3, 4, 4]], [[2, 2, 3, 4], [2, 2, 3, 4]], [[6, 9, 8, 11, 10, 8], [6, 9, 8, 11, 10, 8]], [[9, 6, 8, 10, 9, 10], [9, 6, 8, 10, 9, 10]], [[6, 8, 8, 9], [6, 8, 8, 9]], [[3, 5, 6, 7, 4], [3, 5, 6, 7, 4]], [[10, 10, 3, 10], [3, 4, 5, 3]], [[1, 3, 2, 2, 2, 2], [1, 3, 2, 2, 2, 2]], [[9, 6, 8, 10, 10, 6, 10], [9, 6, 8, 10, 10, 6, 10]], [[5, 4, 12, 4, 4], [5, 4, 12, 4, 4]], [[1, 2, 3, 8, 4], [1, 2, 3, 8, 4]], [[1, 1, 11, 4], [7, 8, 9, 7, 10]], [[6, 9, 9, 34, 9, 10, 8, 9, 9], [6, 9, 9, 34, 9, 10, 8, 9, 9]], [[8, 9, 7, 6, 5, 7, 7, 6], [8, 9, 7, 6, 5, 7, 7, 6]], [[4, 3, 3, 1, 1, 1, 2, 2, 3, 3, 3, 2], [4, 3, 3, 1, 1, 1, 2, 2, 3, 3, 3, 2]], [[], [1, 2, 3, 13, 4, 1]], [[8, 9, 10, 6, 10, 9, 9], [8, 9, 10, 6, 10, 9, 9]], [["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "XNNCdHcXOu", "XC", "CXAPmEz", "EHNYsAg"], ["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "XNNCdHcXOu", "XC", "CXAPmEz", "EHNYsAg"]], [[1, 1, 3, 4, 5, 4], [6, 7, 8, 9, 10, 7, 7, 7, 8]], [[9, 9, 7, 7, 10, 6, 7], [9, 9, 7, 7, 10, 6, 7]], [[6, 7, 8, 9], [6, 7, 8, 9]], [[0, 3, 2, 2, 5], [0, 3, 2, 2, 5]], [[8, 8, 9], [8, 8, 9]], [[1, 2, 3, 2, 4, 4, 2], [1, 2, 3, 2, 4, 4, 2]], [[1, 8, 2], [1, 8, 2]], [[7, 6, 6, 12, 7, 8, 9, 0, 7], [7, 6, 6, 12, 7, 8, 9, 0, 7]], [[9, 3, 9, 2, 9, 9], [9, 3, 9, 2, 9, 9]], [[1, 4, 1, 2, 2, 2, 2, 1], [1, 4, 1, 2, 2, 2, 2, 1]], [[36], [36]], [[4, 2, 3, 3, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1], [4, 2, 3, 3, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1]], [[8, 9, 7, 6, 8, 5, 7, 7], [8, 9, 7, 6, 8, 5, 7, 7]], [[1, 1, 11, 4, 1], [7, 8, 9]], [[10, 3, 3], [10, 3, 3]], [[8, 6, 8, 9, 10, 6, 9], [8, 6, 8, 9, 10, 6, 9]], [[6, 4, 5, 5], [6, 4, 5, 5]], [[6, 7, 8, 9, 10, 7], [2, 1, 1, 4, 2, 5, 4]], [[4, 7, 11, 12, 10, 8], [4, 7, 11, 12, 10, 8]], [[1, 70, 2, 3, 2, 4, 4, 2], [1, 70, 2, 3, 2, 4, 4, 2]], [[8, 6, 7, 8, 9, 10, 7], [2, 1, 1, 4, 5, 4]], [[1, 2, 3, 5, 6, 8, 9, 2], [1, 2, 3, 5, 6, 8, 9, 2]], [[1, 3, 4, 2], [1, 3, 4, 2]], [[1, 3, 2, 4], [1, 3, 2, 4]], [[8, 69, 10, 7, 8], [8, 69, 10, 7, 8]], [[8, 2, 3, 2], [8, 2, 3, 2]], [["QoHVx", "Pqo", "Pqo", "D", "XNNCdHcXOu", "CXAPmEz", ""], ["QoHVx", "Pqo", "Pqo", "D", "XNNCdHcXOu", "CXAPmEz", ""]], [[1, 1, 2, 2, 2, 3], [1, 1, 2, 2, 2, 3]], [[1, 6, 2, 3, 8, 4, 4], [1, 6, 2, 3, 8, 4, 4]], [[8, 8, 9, 2, 10], [8, 8, 9, 2, 10]], [[1, 2, 3], [3, 4, 35, 5]], [[1, 1, 1, 2, 7, 2, 2], [1, 1, 1, 2, 7, 2, 2]], [[6, -1, 7, 8, 9], [6, -1, 7, 8, 9]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 7, 6, 5]], [[3, 4, 5, 3, 3], [3, 4, 5, 3, 3]], [[1, 3, 3, 36, 11, 5], [1, 3, 3, 36, 11, 5]], [[4, 12, 12, 12], [4, 12, 12, 12]], [[34, 4, 1, 4], [34, 4, 1, 4]], [[1, 1, 2, 9, 2, 2, 4], [1, 1, 2, 9, 2, 2, 4]], [[10, 3], [4, 5, 3, 5]], [[1, 3, 2, 2, 2, 2, 1], [1, 3, 2, 2, 2, 2, 1]], [[1, 2, 4, 4, 1, 6, 5, 13, 13, 7, 8, 9, 4], [1, 2, 4, 4, 1, 6, 5, 13, 13, 7, 8, 9, 4]], [[34, 12], [34, 12]], [[1, 6, 2, 3, 8, 4, 4, 4], [1, 6, 2, 3, 8, 4, 4, 4]], [[1, 2, 3, 34, 4, 6, 6, 8, 9], [1, 2, 3, 34, 4, 6, 6, 8, 9]], [[36, 2, 3, 3, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1], [36, 2, 3, 3, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1]], [[1, 3, 4, 9, 6, 7, 8, 9, 4], [1, 3, 4, 9, 6, 7, 8, 9, 4]], [[3, 1, 1, 1, 2, 2, 2, 3, 4, 3], [9, 8, 7, 6]], [[9, 8, 9, 7, 7, 10, 6], [9, 8, 9, 7, 7, 10, 6]], [[6, 7, 8, 10, 35], [6, 7, 8, 10, 35]], [["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "D", "XNNCdHcXOu", "XC", "CXAPmEz", "", "Pqo"], ["QoHVx", "Pqo", "PqvvtmNe", "Pqo", "D", "XNNCdHcXOu", "XC", "CXAPmEz", "", "Pqo"]], [[6, 7, 8, 9, 10, 7, 9], [2, 1, 1, 4, 5, 4]], [[11, 1, 1, 2], [11, 1, 1, 2]], [[3, 4, 5, 3, 3, 4], [3, 4, 5, 3, 3, 4]], [[2, 3, 2, 3], [2, 3, 2, 3]], [[3, 2, 12, 3, 12], [3, 2, 12, 3, 12]], [[35, 5, 7, 8, 7, 6, 6, 8], [35, 5, 7, 8, 7, 6, 6, 8]], [[12, 12, 3], [12, 12, 3]], [[1, 2, 4], [1, 2, 4]], [[3, 4, 5, 3], [3, 4, 5, 3]], [[8, 9, -45, 10, 9], [8, 9, -45, 10, 9]], [[5, 4, 8, 8, 8, 11, 12, 10, 12], [5, 4, 8, 8, 8, 11, 12, 10, 12]], [[11, 8, 1, 10, 10, 9, 10], [11, 8, 1, 10, 10, 9, 10]], [[1, 2, 1, 1], [1, 2, 1, 1]], [[3, 5, 5, 3], [3, 5, 5, 3]], [[7, 9, 9], [7, 9, 9]], [[1, 1, 10, 4, 10], [8, 9, 10, 8]], [[8, 9, 10, 8, 9], [8, 9, 10, 8, 9]], [[9, 8, 9, 10, 6, 9, 9, 9, 6], [9, 8, 9, 10, 6, 9, 9, 9, 6]], [[6, 4, 1, 4], [6, 4, 1, 4]], [[6, 6, 1, 2, 3, 4, 5, 8, 6, 5, 7, 8], [6, 6, 1, 2, 3, 4, 5, 8, 6, 5, 7, 8]], [[8, 9, 8, 3, 6, 5, 3], [8, 9, 8, 3, 6, 5, 3]], [[1, 1, 3, 4, 5, 1], [1, 1, 3, 4, 5, 1]], [[10, 2, 3], [3, 4, 5, 3]], [[3, 1, 4], [7, 8, 9]], [[2, 10, 2, 6, 4, 4, 6], [2, 10, 2, 6, 4, 4, 6]], [[9, 8, 9, 9, 9], [9, 8, 9, 9, 9]], [[8, 9, 7, 6, 8, 5, 7, 7, 5, 6], [8, 9, 7, 6, 8, 5, 7, 7, 5, 6]], [[34, 1, 4, 1, 4], [34, 1, 4, 1, 4]], [[1, 2, 3, 7, 2, 1, 1, 2], [1, 2, 3, 7, 2, 1, 1, 2]], [[10, 3, 1, 3, 10], [10, 3, 1, 3, 10]], [[8, 2, 3, 4, 9, 3], [8, 2, 3, 4, 9, 3]], [[1, 2, 3, 4], [4, 6, 7, 7]], [[9, 6, 8, 9, 10, 6, 10, 6], [9, 6, 8, 9, 10, 6, 10, 6]], [[9, 9, 8, 7, 7, 11, 6], [9, 9, 8, 7, 7, 11, 6]], [[9, 6, 36, 9, 9, 10, 6, 9, 9], [9, 6, 36, 9, 9, 10, 6, 9, 9]], [[70, 6, 7, 36, 9, 10], [70, 6, 7, 36, 9, 10]], [[8, 8, 9, 9, 7, 10, 10], [8, 8, 9, 9, 7, 10, 10]], [[4, 0], [4, 0]], [[1, 2, 6, 3, 4, 5, 3, 2], [1, 2, 6, 3, 4, 5, 3, 2]], [[1, 2, -45, 4], [1, 2, -45, 4]], [[1, 4, 1, 2, 2, 2, 2, 2], [1, 4, 1, 2, 2, 2, 2, 2]], [[8, 9, 9, 35, 9, 10], [8, 9, 9, 35, 9, 10]], [[5, 6, 7, 4], [5, 6, 7, 4]], [[7, 10, 8, 6, 7, 6], [7, 10, 8, 6, 7, 6]], [[1, 4, 1, 5, 2, 1, 2], [1, 4, 1, 5, 2, 1, 2]], [[6, 7, 8, 9, 7, 10, 7, 9, 8], [6, 7, 8, 9, 7, 10, 7, 9, 8]], [[2, 3, 4, 5], [2, 3, 4, 5]], [[8, 9, 7, 5, 7, 9], [8, 9, 7, 5, 7, 9]], [[43.025195515136005], []], [[1, 2, 3, 2, 4, 1], [1, 2, 3, 2, 4, 1]], [[1, 7, 3, 2], [3, 6, 7, 69, 5, 4, 6]], [[9, 6, 9, 8, 9], [9, 6, 9, 8, 9]], [[2, 1, 1, 4, 2, 5, 4], [2, 1, 1, 4, 2, 5, 4]], [[1, 2, 3, -45, 4, 5, 6, 7, 8, 8], [10, 11, 10, 12]], [[1, 2, 1, 7, 2, 2, 0, 2, 2, 2], [1, 2, 1, 7, 2, 2, 0, 2, 2, 2]], [[9, 8, 9, 10, 10], [9, 8, 9, 10, 10]], [[1, 70, 2, 3, 2, 4, 4, 1], [1, 70, 2, 3, 2, 4, 4, 1]], [[9, 6, 8, 9, 8, 10, 8, 9, 9], [9, 6, 8, 9, 8, 10, 8, 9, 9]], [[2, 1, 1, 4, 2, 5, 4, 4], [2, 1, 1, 4, 2, 5, 4, 4]], [[10, 10, 3, 10], [3, 35, 5, 3]], [[8, 4, 5, 3], [8, 4, 5, 3]], [[1, 1, 8, 2, 8], [1, 1, 8, 2, 8]], [[34, 1, 2], [34, 1, 2]], [[1, 12, 5, 1, 1, 2], [1, 12, 5, 1, 1, 2]], [[false, null], []], [[7, 6, 6, 12, 7, 8, 9, 0, 0, 7], [7, 6, 6, 12, 7, 8, 9, 0, 0, 7]], [[7, 9, 9, 10], [1, 1, 3, 4, 5]], [[1, 7, 3, 2, 2, 7, 1], [1, 7, 3, 2, 2, 7, 1]], [[1, 1, 11, 4, 2, 5], [1, 1, 11, 4, 2, 5]], [[12, 1, 1, 2], [12, 1, 1, 2]], [[1, 3, 2, 2, 2, 2, 1, 3], [1, 3, 2, 2, 2, 2, 1, 3]], [[1, 1, 2, 35, 0, 11, 9, 4, 1, 2, 2, 2, 2, 1], [1, 1, 2, 35, 0, 11, 9, 4, 1, 2, 2, 2, 2, 1]], [[9, 9, 9, 7, 7, 10, 6, 9], [9, 9, 9, 7, 7, 10, 6, 9]], [[2, 10, 3, 6, 4, 4], [2, 10, 3, 6, 4, 4]], [[1, 36, 2, 11, 5, 5], [1, 36, 2, 11, 5, 5]], [[6, 1, 2, 3, 4, 5, 8, 6, 5, 7, 8, 8], [10, 11, 12]], [["QoHVx", "Pqo", "Pqo", "D", "XNNCdHcXOu", "CXAPmEz"], ["QoHVx", "Pqo", "Pqo", "D", "XNNCdHcXOu", "CXAPmEz"]], [[1, 1, 1, 2, 2, 2, 2, 1], [1, 1, 1, 2, 2, 2, 2, 1]], [[3, 5, 6], [3, 5, 6]], [[1, 1, 3, 35, 5, 1], [1, 1, 3, 35, 5, 1]], [[1, 1, 11, 4, 4], [7, 8, 9, 7, 10]], [[10, 8, 9, 10, 9], [10, 8, 9, 10, 9]], [[8, 10, 35, 6], [8, 10, 35, 6]], [[8, 7, 9, 3, 9, 8, 9, 7, 7, 9, 6], [8, 7, 9, 3, 9, 8, 9, 7, 7, 9, 6]], [[3, 4, 7, 5], [3, 4, 7, 5]], [[2, 7, 6, 6, 12, 7, 8, 9, 0, 7], [2, 7, 6, 6, 12, 7, 8, 9, 0, 7]], [[8, 9, 9, 9, 10, 10], [8, 9, 9, 9, 10, 10]], [[3, 5, 6, 5], [3, 5, 6, 5]], [[7, 7, 7, 6, 1, 5], [7, 7, 7, 6, 1, 5]], [[7, 8, 9, 10, 7, 7], [7, 8, 9, 10, 7, 7]], [[1, 2, 6, 4, 3], [1, 2, 6, 4, 3]], [[8, 9, 10, 9], [8, 9, 10, 9]], [[2, 1, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 1], [2, 1, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 1]], [[1, 4, 1, 5, 2, 1, 2, 1], [1, 4, 1, 5, 2, 1, 2, 1]], [[2, 1, 1, 4, 2, 6, 5, 4, 4], [2, 1, 1, 4, 2, 6, 5, 4, 4]], [[1, 2, 3, 2, 4, 5, 4], [1, 2, 3, 2, 4, 5, 4]], [[8, 2, 8, 2], [8, 2, 8, 2]], [[1, 2, 0, 3, 4], [1, 2, 0, 3, 4]], [[9, 2, 3, 6, 9, 9, 2, 1], [9, 2, 3, 6, 9, 9, 2, 1]], [[36, 2, 3, 3, 2, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1], [36, 2, 3, 3, 2, 1, 1, 2, 2, 2, 3, 3, 3, 2, 1]], [[1, 3, 1, 1, 2, 2, 2, 3, 3, 3, 3], [1, 3, 1, 1, 2, 2, 2, 3, 3, 3, 3]], [[8, 1, 2, -45, 4], [8, 1, 2, -45, 4]], [[8, 12, 8, 8, 4], [8, 12, 8, 8, 4]], [[1, 5, 2, 10, 3, 10, 6, 8, 9], [1, 5, 2, 10, 3, 10, 6, 8, 9]], [[1, 2, 4, 4, 4], [1, 2, 4, 4, 4]], [[8, 9, 1, 10, 69, 10, 9, 10], [8, 9, 1, 10, 69, 10, 9, 10]], [[11, 8, 8, 9, 10], [11, 8, 8, 9, 10]], [[10, 10, -45, 3], [10, 10, -45, 3]], [[1, 2, 3, 4, 5, 6, 7, 1, 8, 9], [11, 5, 5]], [[1, 35], [1, 35]], [[1, 2, 3, 4, 5, 6, 7, 1, 8, 9], [11, 5, 5, 5]], [[6, 9, 8, 8, 3, 9], [6, 9, 8, 8, 3, 9]], [[2, 3], [3, 4]], [[69, 8, 3, 10, 36, 8, 1, 2], [69, 8, 3, 10, 36, 8, 1, 2]], [[7, 7, 6, 7, 6, 1, 35, 5, 6], [7, 7, 6, 7, 6, 1, 35, 5, 6]], [[6, 7, 8, 9, 10, 7, 9], [1, 1, 3, 4, 5]], [[1, 2, 3, 5, 8, 9, 2], [1, 2, 3, 5, 8, 9, 2]], [[1, 2, 5, 4, 11], [1, 2, 5, 4, 11]], [[8, 2, 3, 4, 4, 9, 8], [8, 2, 3, 4, 4, 9, 8]], [[1, 2, 3], [3, 2, 1]], [[1, 2, 3, 4], [5, 6, 7, 8]], [[1], []], [[], [1]], [[1, 2, 3], [4, 5, 6]], [[1, 2, 3, 3, 3], [2, 2, 3, 3, 4]], [[1, 2, 1, 4, 5, 5], [6, 7, 8, 9, 10, 10]], [[1, 2, 3, 4, 4, 2], [1, 2, 3, 4, 4, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 5], [10, 11, 12]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [1, 1, 1, 2, 2, 2, 3, 3, 3]], [["Ub", "AxY", "aPqcq", "jJgIbabV", "IQfz", "iNL", "oYmsXBI", "uLVei", ""], [45.96597872747401, 41.109062991924844, -60.67086433231981, -35.672903633043234, 70.66502376502925]], [[1, 10, 3, 4, 5], [6, 7, 8, 9, 9]], [[1, 1, 1, 2, 2, 1], [1, 1, 1, 2, 2, 2]], [[9, 99], [1, 2, 3, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6, 10, 5]], [[9, 8, 7, 4, 6, 5], [9, 8, 7, 4, 6, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 6, 10, 5]], [[9, 8, 7, 6, 10, 5], [9, 8, 7, 6, 10, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 6, 10, 12]], [[1, 1, 1, 2, 2, 2, 3, 3, 1], [1, 1, 1, 2, 2, 2, 3, 3, 1]], [[4, 5, 6, 7], [4, 5, 6, 7]], [[5, 4, 3, 2, 3], [5, 4, 3, 2, 3]], [[1, 2, 3, 4, 5], [6, 7, 5, 8, 9, 10]], [[1, 4, 4, 5], [1, 4, 4, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6, 5, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9], [10, 12]], [[], [-46]], [[1, 2, 3, 4, 5], [6, 5, 8, 9, 10, 8]], [[1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5], [1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5]], [[1, 2, 5, 3, 5], [1, 2, 5, 3, 5]], [[1, 2, 5, 3, 8], [1, 2, 5, 3, 8]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [8, 7, 6, 10, 5]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 1], [8, 7, 6, 11, 5]], [["Ub", "AxY", "aPqcq", "jJgIbabV", "IQfz", "iNL", "oYmsXBI", "uLVei", ""], [45.96597872747401, 41.109062991924844, -60.67086433231981, -35.672903633043234, 70.66502376502925, 45.96597872747401]], [[1, 1, 2, 1, 2, 2, 1], [1, 1, 1, 2, 2, 2]], [[1, 2, 5, 3, 4, 5], [1, 2, 5, 3, 4, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 5], [10, 11, 12, 12]], [[1, 2, 3, 4, 5, 6, 11, 7, 8, 9], [1, 2, 3, 4, 5, 6, 11, 7, 8, 9]], [[1, 2, 3, 5], [1, 2, 3, 5]], [[5, 4, 3, 2, 1], [1, 2, 3, 4, 5]], [[1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5, 5], [1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5, 5]], [[8, 1, 1, 1, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5, 3, 7], [1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 5, 3, 7]], [[1, 1, 4, 5, 5], [6, 7, 8, 9, 10, 10]], [[5, 1, 2, 3, 12, 3], [5, 1, 2, 3, 12, 3]], [[1, 2, 2, 3, 4, 5], [6, 7, 8, 9, 10]], [[8, 7, 2, 5, 10, 5], [8, 7, 2, 5, 10, 5]], [[true], [true]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12]], [[1, 1, 1, 1, 2, 2, 3, 3, 3], [1, 1, 1, 1, 2, 2, 3, 3, 3]], [[1, 10, 2, 3, 4, 4, 2], [1, 10, 2, 3, 4, 4, 2]], [[1, 5], [-46]], [[6, 7, 7, 9, 8, 12, 9, 10], [6, 7, 7, 9, 8, 12, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 0, 8, 9, 3, 5], [10, 12, 12]], [[1, 12, 3, 6], [1, 12, 3, 6]], [[1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 6, 10, 5]], [[1, 2, 1, 4, 5, 5], [6, 7, 8, 10, 10]], [[1, 2, 99, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 99, 2, 3, 4, 5, 6, 7, 8, 9]], [[1, 2, 3, 1], [1, 2, 3, 1]], [[3, 4], [3, 4]], [[1, 6, 2, 3, 4, 5, 5], [1, 6, 2, 3, 4, 5, 5]], [[1, 2, 2, 3, 4, 5, 1], [6, 7, 8, 9, 10]], [[6, 7, 5, 10, 8, 9, 10], [6, 7, 5, 10, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 9, 3, 7], [1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 9, 3, 7]], [[5, 4, 3, 0, 2, 3], [5, 4, 3, 0, 2, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 3, 5, 4], [10, 12, 12]], [[45.96597872747401, 41.109062991924844, -60.67086433231981, -35.672903633043234, 70.66502376502925], [45.96597872747401, 41.109062991924844, -60.67086433231981, -35.672903633043234, 70.66502376502925]], [[1, 2, 4, 4], [1, 2, 4, 4]], [[6, 7, 5, 10, 8, 9, 8, 6], [6, 7, 5, 10, 8, 9, 8, 6]], [[1, 2, 6, 3, 4, 5], [6, 5, 8, 9, 10, 8]], [[1, 2, 3, 4, 5, 4], [6, 7, 8, 9]], [[6, 7, 8, 9, 6], [6, 7, 8, 9, 6]], [[1, 2, 1, 3, 5, 5, 5, 5], [7, 8, 10]], [[1, 2, 1, 3, 5, 5, 5, 5], [7, 8, 10, 8]], [[1, 2, 5, 3, 2, 5], [1, 2, 5, 3, 2, 5]], [[1, 2, 3, 5, 6, 7, 8, 9, 3, 5, 4], [1, 2, 3, 5, 6, 7, 8, 9, 3, 5, 4]], [[8, 7, 2, 5, 10, 5, 10], [8, 7, 2, 5, 10, 5, 10]], [[3, 1, 2, 3, 4, 3, 5], [5, 4, 3, 2, 1]], [[1, 2, 3, 3, 4, 5], [5, 7, 8, 9, 9]], [[1, 4, 4, 12, 5], [1, 4, 4, 12, 5]], [[1, 2, 6, 3, 4, 5], [1, 2, 6, 3, 4, 5]], [[6, 7, 8, 9, 10, 10], [6, 7, 8, 9, 10, 10]], [[6, 7, 8, 9, 9, 9, 10, 10], [6, 7, 8, 9, 9, 9, 10, 10]], [[1, 2, 1, 4, 5, 5], [6, 7, 8, 9, 10, 10, 9]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [11, 8, 7, 6, 5, 8]], [[5, 4, 3, 0, 2, 2], [5, 4, 3, 0, 2, 2]], [[1, 1, 1, 2, 1, 2, 2, 3, 3, 3, 1, 2], [1, 1, 1, 2, 1, 2, 2, 3, 3, 3, 1, 2]], [[9, 8, 0, 6, 10, 12], [1, 1, 1, 2, 2, 2, 3, 3, 3, 1]], [[8, 7, 2, 10, 5, 10, 10, 11], [8, 7, 2, 10, 5, 10, 10, 11]], [[1, 1, 1, 2, 2, 2, 3, 3, 3], [8, 7, 6, 10, 5]], [[5, 4, 3, 2, 3, 2, 3], [5, 4, 3, 2, 3, 2, 3]], [[1, 1, 3, 5, 5, 5, 5], [12, 7, 8, 10]], [[5, 6, 4, 3, 0, 2, 3], [5, 6, 4, 3, 0, 2, 3]], [[1, 2, 2, 3, 4, 5, 1, 2], [6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12, 12]], [[4, 4], [4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12, 12, 10]], [[6, 7, 8, 9, 9, 9, 10, 10, 10], [6, 7, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 11, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12, 12, 10]], [[4, 5, 6, 8, 7], [4, 5, 6, 8, 7]], [[1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7], [1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7]], [[6, 8, 11, 9, 10], [6, 8, 11, 9, 10]], [[3, 5, 6, 7], [3, 5, 6, 7]], [[0, 2, 3, 4, 5], [5, 4, 3, 2, 1]], [[6, 7, 8, 6, -46, 9, 9, 10, 10], [6, 7, 8, 6, -46, 9, 9, 10, 10]], [[1, 2, 4, 5, 6, 7, 7, 8, 9, 5, 3, 7], [1, 2, 4, 5, 6, 7, 7, 8, 9, 5, 3, 7]], [[1, 2, 3], [3, 4]], [[8, 7, 2, 5, 5, 10], [8, 7, 2, 5, 5, 10]], [[5, 1, 12, 3, 6], [5, 1, 12, 3, 6]], [[6, 2, 1, 4, 5, 5], [6, 2, 1, 4, 5, 5]], [[1, 1, 4, 5, 6, 7, 7, 8, 5, 3, 7], [1, 1, 4, 5, 6, 7, 7, 8, 5, 3, 7]], [[6, 2, 1, 4, 5], [6, 2, 1, 4, 5]], [[1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 7, 10, 5]], [[5, 4, 3, 2, 1], [4, 1, 2, 3, 9, 7]], [[4, 3, 2, 1], [4, 3, 2, 1]], [[4, 3, 2], [4, 3, 2]], [[1, 1, 2, 1, 2, 2, 1], [1, 1, 2, 2, 2]], [[1, 3, 5, 3], [4, 5, 6, 7, 6]], [[1, 1, 4, 5, 5], [6, 10, 8, 9, 10, 10, 6]], [[1, 2, 3, 4], [0, 5, 6, 7]], [[7, 1, 2, 1, 3, 5, 5, 5, 5], [7, 8, 10, 11]], [[6, 7, 5, 10, 8, 10], [6, 7, 5, 10, 8, 10]], [[-46, 9, 8, 7, 6, 10, 5], [-46, 9, 8, 7, 6, 10, 5]], [[], [-46, -46]], [[9, 8, 7, 6, 6, 10, 5, 9], [9, 8, 7, 6, 6, 10, 5, 9]], [[1, 10, 3, 4, 4, 5], [6, 7, 8, 9, 9]], [[1, 1, 2, 1, 2, 8, 2, 1, 2], [1, 1, 1, 2, 2, 2]], [[1, 1, 2, 2, 2, 3, 3, 3, 1, 2], [9, 8, 7, 10, 5]], [[1, 4, 4, 5, 4], [1, 4, 4, 5, 4]], [[1, 1, 1, 2, 2, 3, 2, 3, 3, 3], [1, 1, 1, 2, 2, 3, 2, 3, 3, 3]], [[1, 1, 2, 1, 3, 3, 3, 1], [1, 1, 2, 1, 3, 3, 3, 1]], [[1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6, 10, 5]], [[1, 2, 5, 3, 8, 5], [1, 2, 5, 3, 8, 5]], [[1, 1, 1, 2, 1], [1, 1, 1, 2, 1]], [[4, 3, 5, 3, 6, 8, 10], [4, 3, 5, 3, 6, 8, 10]], [[1, 2, 3, 4, 5, 5], [5, 4, 3, 2, 1]], [[1, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9], [1, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9]], [[3, 1, 4, 4, 12, 5], [3, 1, 4, 4, 12, 5]], [[1, 2, 1, 3, 0, 5, 5, 5, 5, 1], [1, 2, 1, 3, 0, 5, 5, 5, 5, 1]], [[6, 7, 10, 8, 9, 10, 10], [6, 7, 10, 8, 9, 10, 10]], [[1, 1, 1, 5, 5], [10, 8, 9, 10, 10, 6]], [[1, 2, 3, 5, 6, 7, 0, 8, 9, 3, 5], [10, 12, 12]], [[2, 5, 3, 5], [2, 5, 3, 5]], [[1, 8, 5, 12, 5, 8], [1, 8, 5, 12, 5, 8]], [[7, 10, 8, 9, 9], [7, 10, 8, 9, 9]], [[0, 8, 7, 4, 6, 5], [0, 8, 7, 4, 6, 5]], [[5, 4, 3, 2, 1, 2], [5, 4, 3, 2, 1, 2]], [[1, 2, 3, 4, 5, 6, 8, 7, 8, 9, 9, 3, 5, 4], [10, 12, 12]], [[10, 8, 9, 10, 10, 6], [10, 8, 9, 10, 10, 6]], [[1, 10, 3, 4, 5, 3], [1, 10, 3, 4, 5, 3]], [[1, 2, 3, 1, 3, 5], [6, 7, 5, 8, 9, 10]], [[1, 0, 2, 2, 2, 2], [1, 0, 2, 2, 2, 2]], [[-46, 4, 0, 4], [-46, 4, 0, 4]], [[1, 4, 4, 5, 5], [1, 4, 4, 5, 5]], [[1, 2, 1, 3, 5, 5, 5, 5], [8, 10]], [[5, 4, 5, 5], [5, 4, 5, 5]], [[1, 2, 3], [3, 4, 3]], [[1, 2, 5, 3, 6, 5], [1, 2, 5, 3, 6, 5]], [[1, 1, 2, 1], [1, 1, 2, 1]], [[1, 10, 3, 4, 4, 5], [5, 7, 8, 9, 9]], [[10, 12, 12, 12, 10], [10, 12, 12, 12, 10]], [[1, 1, 1, -46, 2, 2, 2], [1, 1, 1, 2, 2, 2]], [[8, 1, 12, 2, 4, 4], [8, 1, 12, 2, 4, 4]], [[1, 12, 3, 9], [1, 12, 3, 9]], [[9, 7, 6, 5], [9, 7, 6, 5]], [[1, 2, 1, 3, 3, 5, 5, 5], [1, 2, 1, 3, 3, 5, 5, 5]], [[5, 1, 12, 3], [5, 1, 12, 3]], [[1, 1, 1, 2, 2, 3, 3, 3, 1], [9, 8, 7, 6, 10, 5]], [[1, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9, 6], [1, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9, 6]], [[1, 2, 5, 3, 7, 5, 6], [1, 2, 5, 3, 7, 5, 6]], [[9, 8, 7, 6, 10, 12], [9, 8, 7, 6, 10, 12]], [[1, 2, 6, 3, 4, 99], [6, 5, 8, 9, 10, 8]], [[1, 1, 1, 2, 2, 2, 3, 4, 6], [1, 1, 1, 2, 2, 2, 3, 4, 6]], [[-46, 1, 4, 4, 5, 5], [-46, 1, 4, 4, 5, 5]], [[1, 2, 3, 5, 6, 7, 0, 8, 9, 3, 5], [10, 12, 12, 12]], [[1, 2, 1, 2, 4, 5, 5], [6, 7, 8, -46, 10, 10, 9]], [[5, 6, 4, 3, -46, 0, 2, 3, -46], [5, 6, 4, 3, -46, 0, 2, 3, -46]], [[9, 8, 0, 6, 6, 10, 5, 9], [9, 8, 0, 6, 6, 10, 5, 9]], [[5, 1, 12, 6, 3], [5, 1, 12, 6, 3]], [["aPqcq", "", "ZtGld", "aPqcq", "", "UnvvegYF", "THNX", "THNTX", "QSHgDh"], ["aPqcq", "", "ZtGld", "aPqcq", "", "UnvvegYF", "THNX", "THNTX", "QSHgDh"]], [["aPqcqUnvvegYF", "Ub", "AxY", "aPqcq", "jJgIbabV", "IQfz", "iNL", "oYmsXBI", "uLVei", ""], [45.96597872747401, 41.109062991924844, 45.91709144297328, -60.67086433231981, -60.67086433231981, -35.672903633043234, 70.66502376502925]], [[9, 8, 7, 10, 6], [9, 8, 7, 10, 6]], [[7, 7, 2, 5, 5, 10], [7, 7, 2, 5, 5, 10]], [[12, 12], [12, 12]], [[7, 1, 2, 1, 3, 5, 5, 5, 5], [8, 99, 7, 8, 10, 9, 11, 9]], [[1, 2, 3, 5, 6, 7, 0, 8, 9, 3, 5, 9], [1, 2, 3, 5, 6, 7, 0, 8, 9, 3, 5, 9]], [[1, 2, 1, -46, 4, 3, 5, 5], [1, 2, 1, -46, 4, 3, 5, 5]], [[9, 8, 7, 10, 12], [1, 1, 2, 2, 2, 3, 3, 3, 1]], [[5, 6, 4, 3, -46, 0, 2, 3, 2], [5, 6, 4, 3, -46, 0, 2, 3, 2]], [[12, 12, 12, 12], [12, 12, 12, 12]], [[1, 2, 5, 3, 7, 5, 6, 2], [1, 2, 5, 3, 7, 5, 6, 2]], [[12, 3, 6], [12, 3, 6]], [[5, -46, 3, 2, 3, 2, 3], [5, -46, 3, 2, 3, 2, 3]], [[7, 7, 2, 5, 5, 10, 2], [7, 7, 2, 5, 5, 10, 2]], [[1, 10, 3, 4, 4, 5, 3, 1], [6, 7, 8, 9, 9]], [[9, -46, 7, 6, 10, 12], [9, -46, 7, 6, 10, 12]], [[6, 7, 10, 9, 10, 10, 10], [6, 7, 10, 9, 10, 10, 10]], [[1, 4, 4, 5, 1], [1, 4, 4, 5, 1]], [[8, 7, 2, 10, 5, 10], [8, 7, 2, 10, 5, 10]], [[5, 4, 5, 5, 5], [5, 4, 5, 5, 5]], [[1, 1, 2, 2, 2, 3, 3, 3], [9, 8, 7, 6, 6, 10, 5]], [[1, 2, 9, 4, 4, 4], [1, 2, 9, 4, 4, 4]], [[1, 3, 5, 3], [4, 1, 5, 6, 7, 6]], [[1, 11, 5], [1, 11, 5]], [[6, 7, 9, 8, 12, 9, 10], [6, 7, 9, 8, 12, 9, 10]], [[6, 6, 4, 3, 0, 2], [6, 6, 4, 3, 0, 2]], [[1, 1, 2, 7, 2, 3, 3, 3, 1, 2], [1, 1, 2, 7, 2, 3, 3, 3, 1, 2]], [[3, 4, 5, 3, 5], [3, 4, 5, 3, 5]], [[1, 1, 2, 1, 8, 2, 2, 1, 2], [1, 1, 2, 1, 8, 2, 2, 1, 2]], [[1, 1, 1, 2, 1, 2, 2, 3, 3, 3, 2, 2], [1, 1, 1, 2, 1, 2, 2, 3, 3, 3, 2, 2]], [[0, 2, 3, 4, 5], [5, 4, 3, 2, 1, 1]], [[9, 0, 6, 4, 6, 10, 5, 9, 0], [9, 0, 6, 4, 6, 10, 5, 9, 0]], [[1, 3, 3, 4, 5, 6, 7, 8, 9], [10, 11, 12, 10]], [[9, 8, 5, 12, 5, 8], [9, 8, 5, 12, 5, 8]], [[1, 10, 2, 3, 4, 4, 1, 3], [1, 10, 2, 3, 4, 4, 1, 3]], [[0, 2, 4, 5], [5, 4, 3, 2, 1]], [[1, 2, 1, 5, 5], [6, 7, 8, 10, 10]], [[1, 1, 2, 2, 2, 3, 3, 3, 1, 2], [1, 1, 2, 2, 2, 3, 3, 3, 1, 2]], [[3, 1, 4, 4, 12, 5, 12], [3, 1, 4, 4, 12, 5, 12]], [[1, 2, 3, 5, 6, 7, 7, 8, 9, 5], [1, 2, 3, 5, 6, 7, 7, 8, 9, 5]], [[9, 0, 7, 6, 4, 6, 10, 5, 0], [9, 0, 7, 6, 4, 6, 10, 5, 0]], [[-47, -46, -46], []], [[8, 1, 4, 4, 12, 5], [8, 1, 4, 4, 12, 5]], [[1, 2, 1, 4, 5, 5], [1, 2, 1, 4, 5, 5]], [[1, 1, 1, 2, 1, 3, 2, 2, 3, 3, 3, 2, 99, 2], [1, 1, 1, 2, 1, 3, 2, 2, 3, 3, 3, 2, 99, 2]], [[7, 7, 2, 5, 5, 10, 4, 2], [7, 7, 2, 5, 5, 10, 4, 2]], [[12, 7, 8, 8, 9, 9], [12, 7, 8, 8, 9, 9]], [[45.96597872747401, 41.109062991924844, -60.67086433231981, -35.672903633043234, 41.109062991924844], ["Ub", "AxY", "aPqcq", "jJgIbabV", "IQfz", "iNL", "oYmsXBI", "uLVei", ""]], [[6, 2, 1, 4, 5, 5, 5], [6, 2, 1, 4, 5, 5, 5]], [[12, 13, 3, 6], [12, 13, 3, 6]], [[12, 7, 8, 8, 9], [12, 7, 8, 8, 9]], [[1, 2, 3, 4, 5, 6, 2, 7, 8, 9], [1, 2, 3, 4, 5, 6, 2, 7, 8, 9]], [[2, 2, 5, 3, 2, 5], [2, 2, 5, 3, 2, 5]], [[3, 1, 4, 4, 12, 5, 4], [3, 1, 4, 4, 12, 5, 4]], [[6, 7, 9, 8, 12, 9, 10, 8, 9], [6, 7, 9, 8, 12, 9, 10, 8, 9]], [[8, 0, 6, 10, 12], [1, 1, 1, 2, 2, 3, 3, 3, 1]], [[1, 4], [1, 4]], [[1, 2, 6, 1, 3, 4, 99], [1, 2, 6, 1, 3, 4, 99]], [[1, 1, 1, -46, 2, 2, 2], [1, 1, 1, -46, 2, 2, 2]], [[1, 2, 99, 2, 4, 5, 6, 7, 8, 9], [1, 2, 99, 2, 4, 5, 6, 7, 8, 9]], [[6, 6, 4, 3, 2, 0, 2], [6, 6, 4, 3, 2, 0, 2]], [[true, true, false, true, true, false, false, false], []], [[9, -46, 7, 6, 1, 12, 6], [9, -46, 7, 6, 1, 12, 6]], [[6, 7, 8, 13, 8, 9, 10, 10], [6, 7, 8, 13, 8, 9, 10, 10]], [[1, 1, 2, 2, 2, 3, 3, 3, 1], [9, 8, 2, 6, 10, 5]], [[5, 4, 3, 13, 2, 5, 1], [5, 4, 3, 13, 2, 5, 1]], [[1, 2, 5, 3, 2, 5, 3, 3], [1, 2, 5, 3, 2, 5, 3, 3]], [[9, 8, 7, 4, 6, 5, 8], [9, 8, 7, 4, 6, 5, 8]], [[1, 2, 3, 2, 2], [3, 4, 5]], [[5, 4, 3, 2, 3, 2, 3, 2, 3], [5, 4, 3, 2, 3, 2, 3, 2, 3]], [[1, 1, 1, 2, 2, 2, 3, 3, 1, 1], [1, 1, 1, 2, 2, 2, 3, 3, 1, 1]], [[5, 4, 5, 6, 5, 5], [5, 4, 5, 6, 5, 5]], [[1, 2, 6, 3, 4, 9], [1, 2, 6, 3, 4, 9]], [[1, 2, 3, 4, 5, 12, 6, 7, 8, 9], [1, 2, 3, 4, 5, 12, 6, 7, 8, 9]], [[8, 1, 3, 4, 12, 5], [8, 1, 3, 4, 12, 5]], [[5, 4, 3, 2, 1], [1, 2, 4, 4, 5]], [[1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7, 1, 6], [1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7, 1, 6]], [[7, 8, 10, 11], [7, 8, 10, 11]], [[1, 1, 1, 2, 1, 3, 2, 2, 3, 3, 2, 99, 2, 1, 2], [1, 1, 1, 2, 1, 3, 2, 2, 3, 3, 2, 99, 2, 1, 2]], [[6, 4, 7, 8, 9, 9, 9, 10, 10, 10], [6, 4, 7, 8, 9, 9, 9, 10, 10, 10]], [[-46, 4, -1, 0, 4], [-46, 4, -1, 0, 4]], [[-47, 8, 7, 10, 12], [1, 1, 2, 2, 2, 3, 3, 3, 1]], [[5, 5, 5, 5], [5, 5, 5, 5]], [[7, 7, 2, 5, 10, 5], [7, 7, 2, 5, 10, 5]], [[1, 4, 4, 5, 11, 5], [1, 4, 4, 5, 11, 5]], [[1, 1, 2, 2, 2, 2], [1, 1, 2, 2, 2, 2]], [[6, 12], [6, 12]], [[6, 5, 8, 9, 10, 10], [6, 5, 8, 9, 10, 10]], [[0, 5, 6, 7, 7, 7, 7], [1, 2, 3, 4]], [[6, 8, 9, 8, 12, 9, 10], [6, 8, 9, 8, 12, 9, 10]], [[8, 7, 2, 5, 10, 5, 10, 8], [8, 7, 2, 5, 10, 5, 10, 8]], [[3, -1], [3, -1]], [[1, 2, 3, 4, 10, 5, 12, 6, 7, 8, 9], [1, 2, 3, 4, 10, 5, 12, 6, 7, 8, 9]], [[8, 7, 2, 9, 5, 10], [8, 7, 2, 9, 5, 10]], [[7, -1, 7, 2, 5, 5, 10, 2], [7, -1, 7, 2, 5, 5, 10, 2]], [[1, 2, 3, 4, 6, 7, 8, 9, 3, 5, 4], [1, 2, 3, 4, 6, 7, 8, 9, 3, 5, 4]], [[10, 12, 12, 12], [10, 12, 12, 12]], [[5, 4, 3, 2, 1], [1, 2, 4, 5]], [[1, 1, 1, 2, 2, 2, 2], [1, 1, 1, -46, 2, 2, 2]], [[99, 1, 4, 4, 5, 4], [99, 1, 4, 4, 5, 4]], [[1, 2, 6, 3, 4, 99], [6, 5, 6, 9, 10, 8]], [[8, 1, 1, 1, 2, 2, 2, 2], [1, 1, 6, 1, 2, 2, 2]], [[1, 2, 3, 4, 5, 6, 7, 7, 8, 9], [10, 12]], [[1, 2, 3, 3, 5, 6, 7, 0, 8, 9, 3, 5, 6], [1, 2, 3, 3, 5, 6, 7, 0, 8, 9, 3, 5, 6]], [[10, 11, 12, 11], [10, 11, 12, 11]], [[5, 4, 5, 6, 5, 5, 5], [5, 4, 5, 6, 5, 5, 5]], [[5, 4, 3, 13, 2, 5, 1, 13], [5, 4, 3, 13, 2, 5, 1, 13]], [[1, -46, 12, 3, -46], [1, -46, 12, 3, -46]], [[1, 1, 4, 5, 6, 7, 7, 5, 3, 7], [1, 1, 4, 5, 6, 7, 7, 5, 3, 7]], [[1, 10, 3, 4, 4, 2], [1, 10, 3, 4, 4, 2]], [[1, 2, 3, 11, 5, 6, 7, 8, 9, 3, 5, 2], [10, 12, 12, 12, 10]], [[1, 2, 9, 9, 4, 4, 4, 9], [1, 2, 9, 9, 4, 4, 4, 9]], [[1, 2, 2, 3, 4, 5, 1, 2], [1, 2, 2, 3, 4, 5, 1, 2]], [[12, 99, 7, 8, 8, 0, 9], [12, 99, 7, 8, 8, 0, 9]], [[45.96597872747401, 53.3656861633342, -35.672903633043234, 70.66502376502925], [45.96597872747401, 53.3656861633342, -35.672903633043234, 70.66502376502925]], [[9, 0, 7, 6, 4, 6, 5, 0, 6], [9, 0, 7, 6, 4, 6, 5, 0, 6]], [[1, 3, 3, 4, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12]], [[1, 2, 1, 5, 5], [11, 6, 7, 8, 10, 10]], [[1, 10, 3, 4, 4, 2, 4], [1, 10, 3, 4, 4, 2, 4]], [[5, 13, 1, 6, 12, 3], [5, 13, 1, 6, 12, 3]], [[1, 1, 2, 2, 2, 3, 3, 3, 1, 2, 3], [1, 1, 2, 2, 2, 3, 3, 3, 1, 2, 3]], [[1, 2, 6, 3, 4, 5], [3, 6, 5, 8, 9, 10, 8]], [[7, 8, 0, 6, 6, 10, 5, 9], [7, 8, 0, 6, 6, 10, 5, 9]], [[12, 5, 4, 5, 5], [12, 5, 4, 5, 5]], [[-46, 1, 4, 4, 5, 5, 1, 1], [-46, 1, 4, 4, 5, 5, 1, 1]], [[9, 0, 6, 4, 6, 10, 5, 9, 0, 10], [9, 0, 6, 4, 6, 10, 5, 9, 0, 10]], [[1, 2, 3, 5, 6, 7, 1, 8, 9, 3, 5, 9], [1, 2, 3, 5, 6, 7, 1, 8, 9, 3, 5, 9]], [["AxY", "IQfz", "QTNcIWAEM", "aPqcq", "aPqcq", "", "xkxmC"], []], [[0, 2, 3, 4, 5, 5], [5, 4, 3, 2, 1]], [[45.96597872747401, 53.3656861633342, -35.672903633043234], [45.96597872747401, 53.3656861633342, -35.672903633043234]], [[1, 1, 1, 2, 1, 3, 8, 2, 3, 3, 3, 2, 99, 2], [1, 1, 1, 2, 1, 3, 8, 2, 3, 3, 3, 2, 99, 2]], [[1, 12, 2, 3, 4, 5], [6, 7, 8, 9]], [[1, 1, 2, 2, 2, 4, 3, 3, 1], [9, 8, 7, 6, 10, 5]], [[2, 5, 3, 2, 11, 5], [2, 5, 3, 2, 11, 5]], [[8, 2, 9, 5, 10], [8, 2, 9, 5, 10]], [[6, 6, 5, 5], [6, 6, 5, 5]], [[0, 3, 4], [0, 3, 4]], [[10, 8, 5, 10, 10, 6], [10, 8, 5, 10, 10, 6]], [[5, 6, 8, 6, 4, 4, 2, 0, 2], [5, 6, 8, 6, 4, 4, 2, 0, 2]], [[6, 10, 8, 9, 10, 10, 6], [6, 10, 8, 9, 10, 10, 6]], [[26, -2], []], [[1, 1, 3, 5, 5, 5, 5, 1, 1], [1, 1, 3, 5, 5, 5, 5, 1, 1]], [[1, 1, 1, 2, 2, 2, 3, 3], [1, 1, 1, 2, 2, 2, 3, 3]], [[1, 1, 1, 2, 2, 2], [1, 1, 1, 2, 2, 2, 2]], [[9, 8, 7, 6, 10, 11, 12], [9, 8, 7, 6, 10, 11, 12]], [[4, -1, 3, 9, 7, 4], [4, -1, 3, 9, 7, 4]], [[1, 1, 5, 5], [6, 8, 8, 10, 10]], [[9, 0, 6, 4, 6, 5, 10, 5, 9, 0, 10], [9, 0, 6, 4, 6, 5, 10, 5, 9, 0, 10]], [[8, 7, 2, 10, 7, 5, 10], [8, 7, 2, 10, 7, 5, 10]], [[8, -46, 7, 6, 10, 12], [8, -46, 7, 6, 10, 12]], [[1, 1, -46, 2, 2, 2], [1, 1, -46, 2, 2, 2]], [[9, 8, 7, 10, 5], [9, 8, 7, 10, 5]], [[0, 4, 0], [0, 4, 0]], [[4, 4, 5], [4, 4, 5]], [[8, 1, 1, 1, 2, 2, 2, 2], [1, 1, 7, 1, 2, 2, 2]], [[1, 1, -3, 2, 2, 2, 3, 3, 1, 2], [1, 1, -3, 2, 2, 2, 3, 3, 1, 2]], [[1, 13, 2, 5, 3, 8], [1, 13, 2, 5, 3, 8]], [[7, 2, 5, 3, 2, 5], [7, 2, 5, 3, 2, 5]], [[1, 2, 2, 4, 5], [1, 2, 2, 4, 5]], [[1, 2, 5, 7, 5, -1], [1, 2, 5, 7, 5, -1]], [[9, 5, 8, 7, 6, 10, 5], [1, 1, 1, 2, 2, 3, 3, 3, -2]], [[0, 2, 3, 4, 4, 2], [0, 2, 3, 4, 4, 2]], [[1, 2, 6, 3, 4, 5, 2], [3, 5, 8, 9, 10, 8]], [[5, 4, 3, 4, 2, 1], [5, 4, 3, 4, 2, 1]], [[1, 1, 2, 2, 2, 3, 3, 3, 1], [1, 1, 2, 2, 2, 3, 3, 3, 1]], [[10, 8, 9, 2, 10, 6], [10, 8, 9, 2, 10, 6]], [[1, 12, 3, 1], [1, 12, 3, 1]], [[1, 2, 99, 2, 4, 5, 1, 6, 7, 8], [1, 2, 99, 2, 4, 5, 1, 6, 7, 8]], [[7, 8, 10, 8], [7, 8, 10, 8]], [[1, 1, 2, 2, 2, 3, -2, 3, 3, 1, 2, 3], [1, 1, 2, 2, 2, 3, -2, 3, 3, 1, 2, 3]], [[-47, 4, 4, 5, 4, 4], [-47, 4, 4, 5, 4, 4]], [[1, 3, 3, 4, 5, 6, 7, 8, 9, 3, 5], [10, 12, 12, 12]], [[7, 10, 8, 10, 11], [7, 10, 8, 10, 11]], [[1, 1, 2, 2, 2, 2], [1, 1, 1, 2, 2, 2, 2]], [[1, 13, 7, 2, 5, 8, 5], [1, 13, 7, 2, 5, 8, 5]], [[9, 0, 6, 4, 6, 10, 5, 9, 0, 6], [9, 0, 6, 4, 6, 10, 5, 9, 0, 6]], [[1, -3, 3, 4, 5, 6, 7, 7, 8, 9], [10, 12]], [[1, 3, 4, 5, 4], [1, 3, 4, 5, 4]], [[5, 4, 3, 4, 2, 1, 4], [5, 4, 3, 4, 2, 1, 4]], [[], [1, 2, 3, 4, 1]], [[1, 4, 4, 5, 4, 1], [1, 4, 4, 5, 4, 1]], [[12, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9], [12, 2, 99, 2, 3, 5, 4, 5, 6, 7, 8, 9]], [[5, 4, 5, 6, 8, 7], [5, 4, 5, 6, 8, 7]], [[1, 2, 99, 2, 4, 5, 6, 8, 7, 8, 9, 6], [1, 2, 99, 2, 4, 5, 6, 8, 7, 8, 9, 6]], [[1, 2, 3, 1], [3, 4]], [[1, 2, 3, 11, 5, 7, 8, 9, 3, 5, 2, 2], [1, 2, 3, 11, 5, 7, 8, 9, 3, 5, 2, 2]], [[8, 7, 2, 5, 10, 5, 10, 10], [8, 7, 2, 5, 10, 5, 10, 10]], [[-3, 6], [-3, 6]], [[0, 4, 3, 13, 2, 5, 1, 13, 13], [0, 4, 3, 13, 2, 5, 1, 13, 13]], [[2, 3, 7], [2, 3, 7]], [[6, 4, 7, 8, 10, 9, 9, 10, 10, 10], [6, 4, 7, 8, 10, 9, 9, 10, 10, 10]], [[0, 6, 4, 6, 10, 9, 0, 6], [0, 6, 4, 6, 10, 9, 0, 6]], [[3, 4, 1], [3, 4, 1]], [["TAxn", "T", "tCxd", "aPqcq", "", ""], []], [[1, 2, 13, 4, 5, 6, 1], [1, 2, 13, 4, 5, 6, 1]], [[1, 1, 2, 1, 2, 8, 2, 1, 2, 1], [1, 1, 1, 2, 2, 2]], [[1, 1, 2, 2, 2, 3, 2, 3, 3, 1], [1, 1, 2, 2, 2, 3, 2, 3, 3, 1]], [[1, 11, 5, 11, 5, 11], [1, 11, 5, 11, 5, 11]], [[-87, -50, 26, -83, -1], [-46]], [[3, 2, 3, 2, 5], [3, 2, 3, 2, 5]], [[1, 2, 1, 4, -83, 5], [6, 7, 8, 10, 10]], [[2, 1, 2, 1, 1], [2, 1, 2, 1, 1]], [[1, 10, 3, 4, 4, 11, 2, 4], [1, 10, 3, 4, 4, 11, 2, 4]], [[3, 4, 6, 5, 5], [3, 4, 6, 5, 5]], [[9, 8, 9, 7, 6, 10, 12], [9, 8, 9, 7, 6, 10, 12]], [[1, 2, 1, 4, -83, 5], [1, 2, 1, 4, -83, 5]], [[1, 2, 3, 1, 3, 5, 5, 5, 5], [8, 12, 10]], [[11, 1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7, 6], [11, 1, 2, 3, 4, 5, 6, 11, 4, 7, 8, 6, 8, 3, 7, 6]], [[6, 5, 8, -87, 9, 10, 8], [6, 5, 8, -87, 9, 10, 8]], [[10, 8, 10, 11, 11, 8], [10, 8, 10, 11, 11, 8]], [[1, 3, 3, 5, 6, 7, 8, 9], [10, 11, 10]], [[], [true, true, false, true, true, false, false, false]], [[2, 3, 4, 5], [6, 7, 8, 9]], [[1, 3, 9, 9, 4, 4, 4, 9], [1, 3, 9, 9, 4, 4, 4, 9]], [[99, 2, 3, -50, 1], [99, 2, 3, -50, 1]], [[1, 1, 2, 1, 2, 2, 1], [1, 1, 1, -1, 2, 2, 2]], [[1, 1, 1, 2, 2, 3, 3, 3, 1, 2, 3], [1, 1, 1, 2, 2, 3, 3, 3, 1, 2, 3]], [[5, 5, 9, 6, 8, 8], [5, 5, 9, 6, 8, 8]]], "completion": "\ndef common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n \"\"\"\n return sorted(list(set(l1) & set(l2)))\n", "raw_completion": "```python\ndef common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n \"\"\"\n return sorted(list(set(l1) & set(l2)))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef common(l1: list, l2: list):\n \"\"\"Return sorted unique common elements for two lists.\n >>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])\n [1, 5, 653]\n >>> common([5, 3, 2, 8], [3, 2])\n [2, 3]\n\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/59", "prompt": "\n\ndef largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"\n", "entry_point": "largest_prime_factor", "canonical_solution": "\n\n isprime = [True] * (n + 1)\n for i in range(2, n + 1):\n if isprime[i]:\n for j in range(i + i, n, i):\n isprime[j] = False\n for i in range(n - 1, 0, -1):\n if isprime[i] and n % i == 0:\n return i\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(15) == 5\n assert candidate(27) == 3\n assert candidate(63) == 7\n assert candidate(330) == 11\n assert candidate(13195) == 29\n\n", "contract": "\n assert isinstance(n, int), \"invalid inputs\" # $_CONTRACT_$\n def is_prime(a): # $_CONTRACT_$\n return not (a < 2 or any(a % x == 0 for x in range(2, int(a ** 0.5) + 1))) # $_CONTRACT_$\n assert n > 1 and not is_prime(n), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[15], [27], [63], [330], [13195]], "atol": 0, "plus_input": [[100], [256], [500], [873], [9999], [121], [1764], [4096], [243], [1024], [4097], [1765], [120], [501], [4095], [10000], [255], [1025], [4094], [242], [1763], [254], [9998], [872], [9997], [502], [119], [9996], [874], [253], [252], [1762], [122], [4098], [871], [1023], [9995], [870], [99], [98], [118], [1761], [117], [123], [10001], [87], [92], [869], [1766], [93], [875], [244], [9994], [1767], [1760], [124], [245], [116], [9], [88], [10], [86], [246], [85], [115], [247], [1022], [91], [248], [125], [94], [10002], [249], [1768], [876], [38], [868], [1020], [8], [1026], [90], [866], [39], [867], [9993], [1027], [9992], [1029], [1028], [40], [18], [60], [49], [95], [48], [114], [96], [72], [1030], [9991], [13433], [456745], [568623], [32767], [4], [6], [12], [21], [13432], [13434], [22], [32766], [13435], [20], [456744], [568622], [81], [456743], [456742], [13431], [32765], [80], [456741], [456746], [32764], [32763], [568621], [82], [568624], [32768], [13430], [456740], [13429], [456739], [32762], [32769], [456747], [14], [32761], [32770], [568620], [24], [52], [568625], [51], [456738], [30], [15], [50], [32760], [13428], [13427], [1000000], [16], [25], [13436], [456749], [13437], [26], [456748], [568626], [13438], [27], [13439], [456750], [456751], [456752], [28], [32759], [84], [456753], [65], [63], [64]], "completion": "\nimport numpy as np\n\ndef largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"\n while n % 2 == 0:\n n //= 2\n for i in range(3, int(np.sqrt(n))+1, 2):\n while n % i == 0:\n n //= i\n return n\n", "raw_completion": "Here is the complete function definition for `largest_prime_factor`:\n\n```python\nimport numpy as np\n\ndef largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"\n while n % 2 == 0:\n n //= 2\n for i in range(3, int(np.sqrt(n))+1, 2):\n while n % i == 0:\n n //= i\n return n\n```\n\nThis function takes an integer `n` as input and returns the largest prime factor of `n`. It uses a while loop to divide `n` by 2 until it is no longer divisible by 2, then uses a for loop to check all odd numbers up to the square root of `n` for prime factors. It divides `n` by each prime factor it finds until `n` is no longer divisible by that factor, then moves on to the next factor. Finally, it returns the largest prime factor of `n`.", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef largest_prime_factor(n: int):\n \"\"\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\n >>> largest_prime_factor(13195)\n 29\n >>> largest_prime_factor(2048)\n 2\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/60", "prompt": "\n\ndef sum_to_n(n: int):\n \"\"\"sum_to_n is a function that sums numbers from 1 to n.\n >>> sum_to_n(30)\n 465\n >>> sum_to_n(100)\n 5050\n >>> sum_to_n(5)\n 15\n >>> sum_to_n(10)\n 55\n >>> sum_to_n(1)\n 1\n \"\"\"\n", "entry_point": "sum_to_n", "canonical_solution": "\n\n return (n + 1) * n // 2\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(1) == 1\n assert candidate(6) == 21\n assert candidate(11) == 66\n assert candidate(30) == 465\n assert candidate(100) == 5050\n\n", "contract": "\n assert type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n assert n >= 1, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[1], [6], [11], [30], [100]], "atol": 0, "plus_input": [[2], [3], [4], [7], [15], [20], [25], [50], [75], [1000], [14], [5], [16], [6], [26], [92], [19], [93], [94], [999], [51], [17], [21], [22], [8], [74], [52], [23], [91], [76], [24], [90], [18], [13], [27], [998], [55], [65], [1], [66], [73], [89], [56], [57], [997], [996], [77], [28], [87], [88], [72], [54], [53], [86], [85], [78], [67], [29], [58], [79], [995], [49], [71], [994], [59], [37], [80], [48], [47], [38], [64], [60], [992], [40], [993], [81], [12], [84], [39], [9], [63], [10], [83], [62], [991], [11], [61], [36], [45], [35], [68], [990], [1001], [69], [95], [34], [70], [30], [96], [1000000], [500000], [532178], [215], [217], [214], [216], [499998], [532179], [499995], [213], [499997], [499999], [43], [212], [532177], [499996], [999999], [500001], [499994], [1000001], [532180], [999998], [44], [532181], [500002], [42], [1000002], [999997], [218], [532182], [1000003], [46], [1000004], [41], [211], [999996], [532176], [219], [220], [500003], [532183], [499993], [532184], [532175], [500004], [1002], [532174], [210], [209], [499992], [532173], [1003], [532185], [221], [82], [1000005], [1000006], [1004], [1005]], "completion": "\ndef sum_to_n(n: int) -> int:\n \"\"\"Return the sum of numbers from 1 to n.\"\"\"\n return sum(range(1, n+1))\n", "raw_completion": "```python\ndef sum_to_n(n: int) -> int:\n \"\"\"Return the sum of numbers from 1 to n.\"\"\"\n return sum(range(1, n+1))\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef sum_to_n(n: int):\n \"\"\"sum_to_n is a function that sums numbers from 1 to n.\n >>> sum_to_n(30)\n 465\n >>> sum_to_n(100)\n 5050\n >>> sum_to_n(5)\n 15\n >>> sum_to_n(10)\n 55\n >>> sum_to_n(1)\n 1\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/61", "prompt": "\n\ndef correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"(\" and \")\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"(\")\n False\n >>> correct_bracketing(\"()\")\n True\n >>> correct_bracketing(\"(()())\")\n True\n >>> correct_bracketing(\")(()\")\n False\n \"\"\"\n", "entry_point": "correct_bracketing", "canonical_solution": "\n\n cnt = 0\n for x in brackets:\n if x == \"(\": cnt += 1\n if x == \")\": cnt -= 1\n if cnt < 0: return False\n return cnt == 0\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(\"()\")\n assert candidate(\"(()())\")\n assert candidate(\"()()(()())()\")\n assert candidate(\"()()((()()())())(()()(()))\")\n assert not candidate(\"((()())))\")\n assert not candidate(\")(()\")\n assert not candidate(\"(\")\n assert not candidate(\"((((\")\n assert not candidate(\")\")\n assert not candidate(\"(()\")\n assert not candidate(\"()()(()())())(()\")\n assert not candidate(\"()()(()())()))()\")\n\n", "contract": "\n assert type(brackets) == str, \"invalid inputs\" # $_CONTRACT_$\n assert all(x in \"()\" for x in brackets) # $_CONTRACT_$\n", "base_input": [["()"], ["(()())"], ["()()(()())()"], ["()()((()()())())(()()(()))"], ["((()())))"], [")(()"], ["("], ["(((("], [")"], ["(()"], ["()()(()())())(()"], ["()()(()())()))()"]], "atol": 0, "plus_input": [["()()()()()"], ["((((()))))"], ["((())))("], [")()()))("], ["((())"], ["(()))()"], ["((()))"], [")()()()"], [")("], [")))))))"], ["((())((())"], [")()()))()()()()()"], ["))("], ["(())))()"], [")()()))()()()())(()"], ["()(()))"], ["((()))()()))()()()())(()"], ["((())))()"], ["(("], ["((()))()(())))"], ["()(((())))()))((())))"], [")()()))()()()())(()((((())((())))())))"], [")()()()()))()()()())(())()"], [")(("], ["(())"], [")(((())"], ["((()(())))"], ["((()))())(())))"], [")()()))()()()())(()((((())((()))))())))"], ["((()(()((())))())))"], [")))("], [")()())()()))()()()()()()"], ["((()))))("], ["))))((((())))()))"], ["((()))))(())))"], [")()()))()()()())(()((((())((())))()()))"], ["()(((()))))"], [")()()))()()(()())()"], [")((()))()()))()()()())(())("], [""], ["((()))((()))))((())))"], [")()()()()"], [")((((()((()))()(()))))"], [")()())()()))()(()()()()()"], ["((()))))(()()()()()))()()()())(())()))))"], ["((())))"], ["()(((())))))"], [")()())()()))()()(((()))()(())))()"], ["())(((()))))"], ["(((())(((()))()())"], [")()()))()()()())((()"], ["((()(())((((())))))"], [")()())))()()()()()"], ["(((()))()("], [")()()))()()()((()))()))(()((((())((())))()()))"], [")((()))()()()))()()(()())()))()())(())("], ["((()()())()()))()()(((()))()(())))())))())(())))"], [")((())))(()()))()()()())(()((((())((())))())()))"], [")()()()((()))((()))))((())))()"], [")((())((())))())))"], ["))))(("], [")()()((())((())))()))))()"], [")(((()))"], [")()()))()()()()()(())))()"], ["((()()())()()()))()()()())(()((((())((())))()))))()))()()(((()))()(())))())))())(())))"], ["(((()))()()(())))"], ["((()))((()())))((())))"], [")()())()()))()(()()()())()"], ["(((()(())((((())))))"], [")()((()))()(())))()()()"], ["((()))((()))))((()))))"], [")((())))(()()))()()(())))(())(()((((())(((((()(())((((())))))))))())()))"], [")()()((())((())))())()"], [")()()))()()()(((()))()))(()((((())((())))()()))"], ["()(())()"], [")())((())))()()))"], [")((())))(()()))()()(())))(())(()((((())(((((()(())(((()))))))())))))))))())()))"], ["((()()()))()()()))()()()())(()((((())((())))()))))()))()()(((()((()))()()))()()()())(()))()(())))())))())((((())))))))"], [")()())())()()()())(()((((())((())))()()))"], ["((()()())()()()))()()()())(()((((())()))))()))()()(((()))()(())))())))())(())))"], ["(((()(())((((()))())))))"], [")()()))()()()((()))())))(()((((())((())))()()))"], ["())()()()()"], ["((())(()())"], ["((()()()))()()()))()()()())(()((((())((()))))()))))()))()()(((()((()))()()))()()()())(()))()(())))())))())((((())))))))"], ["((()))))(()()((()()()))()()()))()()()())(()((((())((())))()))))()))()()(((()((()))()()))()()()())(()))()(())))())))())((((())))))))()()()))()()()())(())()))))"], ["((()))()()))()()()())(()(((()(()((())))())))"], ["()(())))"], ["((()()())()()()))()()()())((()((((())()))))()))()()(((()))()(())))())))())(())))"], [")()()))()()()())(()()())()()))()(()()()())())((((())((())))()()))"], [")()))))))(())((())))())))"], ["))()()))()()(()())()(("], ["((()(()))()"], ["(((())))(()())(())))"], ["))"], ["())()()"], ["()((()()()"], ["((()()()))()()()))()()()())(()((((())((())))()))))()))()()(((()((())))()(())))())))())((((())))))))"], ["()(())()())()()))()()()()()()))"], ["())()()()())()()))()(()()()())())"], [")()()"], ["(()(()(())())()"], ["(((()))())("], ["())(())())(()))()"], ["((())()(()(())))"], ["((())))))))"], ["((((((())()()))))))"], ["()(())(()()(((())))())(()))()(()())"], ["()(())(()()(((())))())(()))()(())(())())(()))()()())"], ["()(())(()()(((())))())(()))()(()"], ["((((())))))))())()(()((()(()(())())()())))"], ["(((()))()))(("], ["())(())())((((()))))))))))()"], ["(()(()))()))(("], ["((())()(()(()))))"], ["(()(()(())())())("], ["(((()))()))(((())()(()(()))))("], ["(()(())(()()(((())))())(()))()(())(("], ["()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))())(()))()(((((()))()))(("], ["((((((())()())))))))"], ["((((())))))))())()(()((()(()(())()))()())))"], ["())(())())(()))()())()"], ["(())(())())((((()))))))))))()()(()(()(()(())())())(("], ["((((()))()))(("], ["()(())(()()()((())))())(()(()(())(()()(((())))())(()))()(())(())()(()())"], ["())(())())((())(())())((((()))))))))))()()(()(()(()(())())())(((((()))))))))))()"], ["(()(("], ["(()(())(()()(((())))())(()))())(())(("], ["(())(())())((((()))))))))))()()(()(()(()(())())())(((((()))())("], ["()(())"], ["())(())())(()))()())(()(()(())())())(()"], ["()(())((()()(((())))())(()))()(()())"], ["(((((((())()()))))))"], ["(((((((((()))()))(((())()()))))))"], ["(()(()(((()(())())()"], ["()(())(())()(((())))())(()))()())(())())(()))()(())(())())(()))()()())"], ["())(())())(())(())())((((()))))))))))()()(()(()(()(())())())(()"], ["((((((())()())))(()(()))()))(()))"], ["())(())())()()())()"], ["()(((()(()(())())())"], ["()(())(()()(((())))())(()))()((()())"], ["()(())(()()()((())))((((((((())()()))))))))(()(()(())(()()(((())))())(()))()(())(())()(()())"], ["()()())(()()(((())))())(()))()(()())"], ["(()(()(((()(()))()"], ["()((((()(()(())())())"], ["()(()(()(((()(()(())())())())())())"], ["())(())((()(())(()()(((())))())(()))())(())(())(()))()())()"], ["((("], ["()((()())"], ["(()(())(()()(((())))())((()))()(())(("], ["(())(())())(((((())()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["())(())())())()"], ["(())(())()((((((())()())))))))(((((())()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["((((())))()())(())())(()))()())(()(()(())())())(()(("], ["())(())())((((())))))))))))()"], ["(()(()(())())()("], ["((((()))())))(("], ["((((((())()())))(()(((()(()))()))(()))()))(()))"], ["()(())((()(()(()(((()(())())()()(((())))())(()))()(()())"], ["((((())))()())(())())(()))()())(()())(())())())()(()(())())())(()(("], ["(((("], ["((((()))))()())(())())(()))()())(()())(())())())()(()(())())())(()(("], ["((((((())()())))(()(((()(()))()))(()"], ["(()(()))()))(()(())(()()(((())))())((()))()(())((("], ["((((("], ["())(())(((((()))()))(())(()))()())(()(()(())())())(()"], ["((()(()(((()(())())()())())())("], ["()(())(())()(((())))())(()))()())(())())(()))((()(()(())())())())(()))()()())"], ["()(())((()()(((()()())"], ["((((((())()())(()(()))()))(()))))"], ["()((((()(()(())())()(()(()(())())())"], ["(()(()))()))(()(())(()()(((())))()()((()))()(())((("], ["((((()))))()())((())(())())((((()))))))))))()))())(()))()())(()())(())())())()(()(())())())(()(("], ["())(())())((((()))))))))))))()"], ["(((((((())(((((((((())()())(()(()))()))(()))))))))))))()()))))))"], ["((((((())()()((()(()(((()(())())()())())())()))(()(()))()))(()))"], ["()(((()(()(())())()()(()))"], ["())(())())(()))()())"], ["())(())())(()))()())(()(()(()())(())())(()))()())(()(()(())())())(())())())(()"], ["(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(("], ["(()"], ["((((()((((()))()))(((())()())))))(((((((())()())))))))"], ["((()()(((()(()(())())()))()(()(()))))"], ["(())(())())((((()))))))))))()()(()(()(()())())())(("], ["(())(())()((((((())()())))))(("], ["()(())(()()(((())))())(()))())(())())(()))()())()(()"], ["((((((()(((()(()(())())()()(()))())()())))))))"], ["()(())(()()(((())))())(((()))()))(((()))()(())(())())(()))()()())"], ["()(())(()()()((())))())(()(()(())(()()(((())))())(()))()(())(())()(()()))"], ["(((()()))())))(("], ["(((((((((((())()())))(()(()))()))(()))"], ["()()())(()()(((())))())(())))()(()())"], ["())())))))))()()(()(()(()(())())())(()"], ["(())(())())()((((()(()(())())()(()(()(())())())(((((())()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["(((()))())((())()(()(())))("], ["((((((((())()())))))))(()))())("], ["(((()(((((((()(((()(()(())())()()(()))())()())))))))"], ["()((((()(()(())())()(()(()(())())())((((("], ["((((()((((()))()))(((())(((((((())()())()(())(()()(((())))())(()))()(()())))))))"], ["(())((()(()(((()(())())()())())())((())()((((((())()())))))(("], ["(((((((())()())))))))"], ["((()()())(()(((((((((()))()))(((())()()))))))))))"], [")(((()()))())))(("], ["((()()(((()(()(())((()(()(())())()))()))()(()(()))))"], ["((((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(("], ["((((()((((()))()))(((())()()))))(())()())))))))"], ["(()(()())())()"], ["(((((("], ["()(()((()(((()(()(())())())())())())"], ["()(((((()(())((()(()(()(((()(())())()()(((())))())(()))()(()()))(()(())())()(()(()(())())())"], ["((()(()((()(())())()())())())("], ["((()))))))))"], ["()(())(()()()((())))((((((((())()()))))))))(()(()(())(()()(((())))())(()))()(())(())()((()())"], ["(()((((()(()(())())()(()(()(())())())"], ["(()(())((()()(((()()())(((((())()())(()(()))()))(()))))"], ["())()(()())"], ["(((((((())()()))))))))"], [")()((((()))()))(()"], ["(((()))))))))"], ["(((((((())(())())((((()))))))))))()()(()(()(()())())())(((())()())))))))"], ["(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())(()(()))()))(()))))"], ["())(())())((((()))))))))))"], ["(()(()"], ["((((((((((())()()))))))))((((())()()))))))))"], ["())(())())(()))()())(()()()())(()()(((())))())(())))()(()())(()(())())())(()"], ["(((((())()())))))))"], ["((((((())()())))(()(()))()))(()((((((())()()((()(()(((()(())())()())())())())())(())())((((())))))))))))(()(()))()))(())))"], ["(()(((()()(((()(()(())())()))()(()(()))))(())(())())((((())()))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(("], ["((((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(((((((())()())))(()(()))()))(()((((((())()()((()(()(((()(())())()())())())())())(())())((((())))))))))))(()(()))()))(())))("], ["())(())(((((()))()))(()())(())())((((())))))))))))()(()))()())(()(()(())())())(()"], ["(()(())(())())()"], ["((())()(()(())))()((((()(()(())())())"], ["(((()))())"], ["())(()))))()()(()(()(()(())())())((()"], ["((((()((((()))()))(((())()())))))((((((((())(())())((((()))))))))))()()(()(()(()())())())(((())()())))))))((((((())()())))))))"], ["(())(())())()((((()(()(())((()()(((())))())(()))()(()())(()(())())())(((((())()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["()())(()))()"], ["()())(())(((((()))()))(()())(())())((((())))))))))))()(()))()())(()(()(())())())(())(((((()))()))(()())(())())((((())))))))))))()(()))()())(()(()(())())())(()"], ["(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()())()(())(()()(((())))())(()))()(()()))))))))(()(()))()))(()))))"], ["()(())((()()(((())))(())(()))()(()())"], ["(((())((()(()(((()(())())()())())())()(("], ["())()))))))()(()(())())())(()"], ["())(())())(())(())())((((())))))))((())()(()(())))()((((()(()(())())()))))()()(()(()(()(())())())(()"], ["((())()(()(())))()((((()(()((()(()(((()(())())()())())())"], ["(()(())(()()(((())))())(())()()(())(("], ["(((((())()()))))))))"], ["(()(()(())())()((((()()))())))(("], ["((((()(((((((())()()))))))))()))(("], ["(()((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(((((((())()())))(()(()))()))(()((((((())()()((()(()(((()(())())()())())())())())(())())((((())))))))))))(()(()))()))(())))("], ["(((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(("], [")(()(()"], ["((((((())()()))))()))(()))"], ["(()((())()(()(())))()((((()(()(())())())(()())())()"], ["((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(()()(((())))())(()))()(())(())())(()))()()())"], ["()((((()(()(())())()(()(()))()))(()(())(()()(((())))())((()))()(())((((()(()(())())())((((("], ["(()(()))()))(()(())(()()(((()))))())((()))()(())((("], ["((((()((((()))()))(((())(((((((())()())()(())(()()(((())))())(()))()(()))))))"], ["()((((()(()(())())()(()(()(()))()(())((((()(()(())())())((((())))))))))))()"], ["())(())())((())(())())((((()))))))))))()()(()(()(()(())())())((((()))))))))()"], ["()(())(())()(((())))((()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())(()(()))()))(())))))(()))()()())"], ["(()((((()((((((()))()))(()(())())()(()(()(())())())"], ["(((()))())(((()(()))()))(()(())(()()(((())))()()((()))()(())(((((((())()())))))))(((())()(()(()))))("], ["((((((())()()(()(())(()()(((())))())(()))()(())(())())((()))()(()())(()(()((((()(())())()())())())()))(()(()))()))(()))"], ["(((()))())(((()(()))()))(()(())(()()(((())))()()((())()(()(())))()((((()(()((()(()(((()(())())()())())())((()))()(())(((((((())()())))))))(((())()(()(()))))("], ["()(((()(()(())())()()(())))"], ["(())(())())((((()))))))))))()()(()(()(()(())())())(((((()))())"], [")()((((()))(((((()))))()())((())(())())((((()))))))))))()))())(()))()())(()())(())())())()(()(())())())(()(()))(()"], ["((((())))()())(())())(()))()())(()()()(())())())(()(("], ["((((((((((())()())))((()(()))()))(()(())(()()(((())))()()((()))()(())(((()(((()(()))()))(()))()))(()))()))())))(("], ["(((()))())((())())(()(())))("], ["((())()(()(())))()((((()(()((()(()(((()(())())()())())()()(())((()()(((())))(())(()))()(()()))"], ["(()((((()(()(())())()(()())(())())(()))()())(()()()())(()()(((())))())(())))()(()())(()(())())())(()(()(())())())"], ["((()(()((()(())()("], ["(()((("], ["((((((())()()))))(()(((()(()))()))(()))()))(()))"], ["((((())))()())(())())(()))()())(()()())(())())())(()(("], ["())(())())(()))()())(()(()(()())(())())(()))()())(()(()(())(())())(())())())(()"], ["())(())())(()))()(())(()(()(()())(())())(()))()())(()(()(())())())(())())())(()"], ["((((((((((())()()))))))))((((())()())))))))()"], [")"], ["(((()(("], ["(((()))())(((()(()))()))(()(())(()()(((())))()()((())()(()(())))()((((()(()((()(()(((()(())())()())())())((()))()()())(((((((())()())))))))(((()))()(()(()))))("], [")((((((())()())))))))("], ["()(())(()()(((())))())(())))()(())(())())(()))()()())"], ["(())(())())(((((())()(()(())))((())))))))))))()()(()(()(()(())())())(("], ["())(())())((()(((()(()(())())()()(())))))))()()()"], ["(()(((()()(((()(()(())())()))()(()(()))))(())(())())((((())()))))))))()()(()(()(()(())())())(()(((())))())((()))()(())(("], ["((((())))()())(())())(()))()())(()(()(())())((()(("], ["(())(())())()((((()(()(())())()(()(()(())())())(((((()))()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["((((((())()())))(()(((()(()))()))(()))()))(())()"], ["(((()"], ["((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(()))()(())(())())(()))()()())(())())()())())())("], ["((((())))()())(())())(()))()())(()())(())())()()()(()(())())())(()(("], ["())(())()))()()())()"], ["()(())(()()()((())))((((((((())()()))))))))(())(()(())(()()(((())))())(()))()(())(())()((()())"], ["((((((())()()))))()))()()))"], ["((())()(()(()))())"], ["((((())))))))())()(()((()(()(())()))()())((((())))()())(())())(()))()())(()(()(())())())(()(())"], ["()(())((()()(((()))()(()))(())(()))()(()())"], ["((((((())()())))(()(((()(())(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(()"], ["(((((((((())()()))))()))(())))()())(()(((((((((()))()))(((())()()))))))))))"], ["((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(())("], ["(()(()(())())()((((()())))())))(("], ["())(())())(()))()())(()(()(((((((())()())))))))))())(())())(()))()())(()(()(())(())())(())())())(()"], ["()(()(()((((((((((())()())))))))(()))())((()(()(())())())())())())"], ["((((()((((()))()))(((())()()))))(())()(())))))))"], ["(()(((()(()(())())()()(()))"], ["()(())((()(()()())(()(((()(())())()()(((())))())(()))()(()())"], ["((())()(()(()))()))"], ["())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()())()"], ["()()())(()()(()(())((()(()()())(()(((()(())())()()(((())))())(()))()(()())((())))())(()))()(()())"], ["(())(())())((((()))))))))))()()(()(()(()(())())())(((((()))()))("], ["((((((())()())))(()(((()(()))(((((())))()())(())((((((())()())))(()(((()(())(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(()())(()))()())(()(()(())())((()(()))(()))()))(())()"], ["((((()))))))))((((())()()))))()))()()))"], ["()(((((()(())((()(()(()(((()(())())()()((()(()()))(()(())())()(()(()(())())())"], ["((((((())()())))(()(((()(()))()))(()(((())()())(()(()((()(()((()(())()())()))(()))))"], ["((((((()()(()())))))()))()()))"], ["()(()(()((((((((((())()())))))))()()))())((()(()(())())())())())())"], ["(())(())())()((((()(()(())())()(()(()(())())())(((((())()(()(())))(())))))))))))()()(()(()(()()())())())(("], ["())(())())(()))()())(()(()(((((((())()())))))))))())(())())(()))()()))(()(()(())(())())(())())())(()"], ["(((((((())()())))))))(((((())()())))))))"], ["((((((())(()())))(()(((()(()))()))(()"], ["(()((((()(()(())())()(()())(())())(()))()())(()()(()())(()()(((())))())(())))()(()())(()(())())())(()(()(())())())"], ["((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(())))))))"], ["()(())((()(()()())(()(((()(())())()()((((())))())(()))()(()())"], ["(()(()))()))(()(())(()()(((())())(())())((((()))))))))))))()))())((()))()(())((("], ["(((()(())(()()(((())))())(()))()(())(()"], ["()(((()(())(()()(((())))())((()))()(())((()())"], ["(())(())())()((((()(()(())())()(()(()(()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))())(()))()(((((()))()))((())())())(((((()))()(()(())))(())))))))))))()()(()(()(()(())())())(("], [")(()((()"], ["(((((((())(())())((((()))))))))))()()(()(()(()())())())(((())()()((())()(()(())))()((((()(()((()(()(((()(())())()())())()()(())((()()(((())))(())(()))()(()())))))))))"], ["(()(())()))(((((()))))()())(())())(()(())(()()(((())))())(()))()(())(((()))()())(()())(())())())()(()(())())())(()(())()"], ["())(())())((()(((()(()((())())()()(())))))))()()()"], ["(((((((())()()))((((((())()())))(()(((()(()))()))(()))()))(())())))))"], ["())(())())(()))()())(()(()(((((((()))()())))))))))())(())())(()))((((((((())(((((((((())()())(()(()))()))(()))))))))))))()())))))))())(()(()(())(())())(())())())(()"], ["()(()(()((((((((((())()())))())(())((()(())(()()(((())))((()((((()(()(())(()))()(()(()(())())()))(())(()))()())()))))()()))())((()(()(())())())())())())"], ["(((())))))))(((())"], ["((((()((((()))()))(((())((()(())())))))(((((((())()())))))))"], ["()(()(()(((()((((((())()())))))))()()))())((()(()(())())())())())())"], ["(((()))(()(())))("], ["(())(())())((((()))))))))))()()(()(()(()(())())())(()(())(()()(((())))())(()))()(())(((((((()))())"], ["(()(())(()()(((())))())((()))()(())((((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(())))))))"], ["((()())(())())(()))()())(()(()(((((((()))()())))))))))())(())())(()))((((((((())(((((((((())()())(()(()))()))(()))))))))))))()())))))))())(()(()(())(())())(())())())(()(()(((()(())())()())())())("], ["((()(()((()()(())()(())(()()(((())))())(())))()(())(())())(()))()()()))(())()(((())))())(()(((()))))))))))()())(())())(())("], ["(())(())())()((((()(()(())())()(()(()(())())())(("], ["(())(())())((((())))(()(())))))))()()(()(()(()(())())())(((((()))())"], ["(((()))())((()(())((()()(((())))())(()))()(()())())()(()(())))("], ["((((((())()()))))(()(((()(()))()))(()))())))(()))"], ["(((()))()))("], ["())(())())(()))()(())(()(()(()())(())()())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()())())(()))()())(()(()(())())())(())())())(()"], ["(()(())()))((((()()))))()())(())())(()(())(()()(((())))())(()))()(())(((()))()())(()())(())())())()(()(())())())(()(())()"], ["((()"], ["((((())))()())(())())((((((((((((())()()))))))))((((())()())))))))))))()())(()()()(())())())(()(("], ["((()(((()(()(())()))(((((())()())))(()(((()(()))(())(())())((((()))))))))))))())))(()"], ["(())((())())((((()))))))))))()()(()(()(()())())())(("], ["(()(())(())(())())()()())()(()()(((()()())(((((())()())(()(()))()))(()))))"], ["((((((())()()))))(()((()())))(()))"], ["(((()((((()(()(())())()(()(()))()))(()(())(()()(((())))())((()))()(())((((()(()(())())())((((())()(()(())))"], ["((((((())()())))(()(((()((()))()))(()"], ["((()(((()(()(())()))((()"], ["(((((((((((())()())))))))(((((())()())))))))((())()())))(()(((()((()))()))(()"], ["())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))))()(()))()())(()(()(())())())(()"], ["())(())())(())()()())()"], ["())(())())(()))((((((())()())))(()(((()((()))()))(()()())(()(()(())())())(()"], ["((())((())())((((()))))))))))()()(()(()(()())())())((((())()((((((())()())))))(("], ["((((((())()())))(()(((()(())))()))(()))()))(())()"], ["()(())(()()(((()))))))()(()())"], ["(((((((())()()))((((((())()()((((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(((()(()(())())()()))(()(((()(()))()))(()))()))(())())))))"], ["((((())))))))())()(()((()(()(())()))()())((((())))()())(((()(()(((()(()))()))())(()))()())(()(()(())())())(()(())"], ["(())((()(()(((()(())())()())())())((())()((((((())(()())))))(("], ["(()(())(()()((((())))())(()))())(())(("], ["((((((())()())(()))))"], ["(((()))())))(("], ["())(())((()(())(()()(((()))))())(()))())(())(())(()))()())()"], ["(())((())(())((()(())(()()(((()))))())(()))())(())(())(()))()())()))())((((())))))))))())(("], ["())(())())(()))()()())())(()"], ["((()((())(())())(()))()())"], ["((((((((((())()())))((()(()))())(())(())()((((((())()())))))))(((((())()(()((())(())())((())(())())((((()))))))))))()()(()(()(()(())())())(((((()))))))))))()))))(())))))))))))()()(()(()(()(())())())(()(()(())(()()(((())))()()((()))()(())(((()(((()(()))()))(()))()))(()))()))())))(("], ["(()(())(()()(((())))())((()))()(())((((((()((((()))()))(((())((((((((((())))())((()))()(())))))))"], ["(((()))())((()(())(())(())())(()))()())(()(()(()())(())())(()))()())(()(()(())())())(())())())(())))()(()())())()(()(())))("], ["(((()))())((()(())((()()(((())))())(())))()(()())())()(()(())))("], ["()()"], ["((((())))))))())()(()((()(()(()))"], ["()(((()(()((((((((())()()))))(()((()())))(()))))()))))"], ["(((((()))())((())()(()(())))(()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(()))()(())(())())(()))()()())(())())()())())())("], ["(((()(())(()()(((())))())(()))()(())))(()))"], ["((((((())()())))(()(()))()))((()))"], ["((()(()(((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(())))))))(()(())())()())())())("], ["(((()))())(())((()(())(()()(((()))))())(()))())(()()(())(()))()())()())"], ["(())((())(())((()(())(()()(((()))))())(()))())(())(())(()))())())()))())((((())))))))))())(("], ["()(())(())()(((())))())(()))()())(())())(())())()(())(())())(()))()()())"], ["((((())))))))())()(()((()(()(())()))()())((((())))()())(())())(()))()())(()(()(())())(())(()(())"], ["(()(()))())"], ["(())(())())((((()())))))))))()()(()(()(()(())())())(((((()))()))("], ["(((((((()(((())()())))))))"], ["()(())))(()()(((()))))))()(()())"], ["(())((()(()(((()(())())()())())())((())()((((((())(()()))()))(("], ["((())()())"], ["((((()))))))))((((())()()))))()))()())))("], [")(()(())(()()(((())))())(())))()(())(())())(()))()()())((()()))())))(("], ["((()())(())())(()))()())(()(()(((((((()))()())))))((())()(()(())))()((((()(()((()(()(((()(())())()())())()()(())((()()(((())))(())(()))()(()()))))))())(())())(()))((((((((())(((((((((())()())(()(()))()))(()))))))))))))()())))))))())(()(()(())(())())(())())())(()(()(((()(())())()())())())("], ["((((()((((()))()))(((())(((((((())()())()(())(((()((())(())())())()))(()()(((())))())((()))()(())))))))"], ["((((((()())(()())))))()))()()))"], ["(((((((())()(()((()())))))))))(((((())()())))))))"], ["((()(()(((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(())))))))(()(())())(((((((())()()))((((((())()())))(()(((()(()))()))(()))()))(())()))))))("], ["((())((())())((((())))()()(()(()(()())())())((((())()((((((())()())))))(("], ["())(())((()(())(()()(((())))((()((((()(()(())()))()(()(((())())()))(())(()))()())()"], ["()(())(()()(((())))())(())))()(())(())(())(()))()()())"], ["(()(())(()()(((())))())(()))()(())((("], ["((((()))()))()("], [")(())(()"], ["(()()()))()))(()(()((((()(()(())())()(()(()(())())())(())(()()(((())())(())())((((()))))))))))))()))())((()))()(())((("], ["())(())())(()))((((((())()())))(()(((()((()))(()(()(())())()(()))(()()())(()(()(())())())(()(())(())())((((()))))))))))()()(()(()(()(())())())(((((()))())("], ["(((((((())(())())((((()))))))))))()()(()(()(()())())())(((())())()))))))))"], ["(()((((()(()(())())()(()(())(())((()(())(()()(((())))())(()))())(())(())(()))()())()()(())())())"], ["(())(((()(()(())())()))())((((()))))))))))()()(()(()(()(())())())(("], ["()(())(()()(((())))())(())))()((()())"], ["(())(())())((((())))(()(()))))))))()()(()(()(()(())())())(((((()))())"], ["(((((((())(())())((((()))))))))))()()(()(()(()())())())(((())())()))))))))((((((())()())))()))((())"], ["()(()(()((((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))((()((((((())()())))))))()()))())((()(()(())())())())())())"], ["(()(())(()()((((())))())(())))())(())(("], ["()(())(()()(((()))))))()((()())"], ["(()(()))()))(()(())(()()(((())())(())())((((()))))))))))))()))())((()))()(())(((((((((())(()())))(()()))(()"], ["(()()(())())((((()))))))))))()()(()(()(()(())())())(()))())"], ["(()(())(()()(((())))())((()))()(())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))))()(()))()())(()(()(())())())(()())(("], ["())(())())((((())))))((((((()()(()())))))()))()()))))))))()"], [")(()(()()(())"], ["((((())))))((((())))))))())()(()((()(()(())()))()())((((())))()())(())())(()))()())(()(()(())())(())(()(())))())()(()((()(()(())()))()())((((())))()())(((()(()(((()(()))()))())(()))()())(()(()(())())())(()(())"], ["(())(())())((())(())())((((()))))))))))()()(()(()(()(())())())((((()))))))))()"], ["(((((())())())))))))"], ["(())(())())(((()))())"], ["(()(())(()()(((())))())((()))()(())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))))()(()))()())(()(()(())()(()())(("], ["(())(())())()((((()(()(())())()(()(()(())())())(((((()))()(()(())))(())))))))))))()()(()(()()())(()(())())())(("], ["(()(()))()))(()(())(()()(((())())(())())((((()))))))))))))()))())((()))(((()()))())))(()()(())((((())(())())()((((()(()(())())()(()(()(())())())(((((()))()(()(())))(())))))))))))()()(()(()()())(()(())())())(("], ["())(())())(())"], ["((()()))()))(("], ["(())(())())(((((())()(()(())))(())))))))))))()()((()(()(()(())())())(("], ["(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()())()(())()()()(((())))())(()))()(()()))))))))(()(()))()))(()))))"], ["(()(())(()()((((())))())((()))()(())(("], ["()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))())(()))()(((((()))()))((((("], ["(()((((((((())()())))(()(((()(()))()))(()))()))((()))()))())))(((((((())()())))(()(()))()))(()((((((())()()((()(()(((()(()("], ["()(((()(()((((((((())()()))))(()((())())))(()))))()))))"], [")(((((())()())))))))("], ["())(())()(()))))))))))()"], ["(((((((())(((((((((())()())((())((())())((((()))))))))))()()(()(()(()())())())((()(()))()))(()))))))))))))()())))))))"], ["((()()()((()(()(())())()))()(()((())(())())(())(())())((((())))))))((())()(()(())))()((((()(()(())())()))))()()(()(()(()(())())())(())))))"], ["())(())())(()))()())(()(()(((((((())()())))))))))())(())())(()))()()))(()(()(())((())())(()"], ["((((((()))))()())((())(())())((((()))))))))))()))())(()))()())(()())(())())())()(()(())())())(()((((((())()())))(()(((()(()))()))(()))()))(()))"], ["())(()(((((((())()()))))()(()))))(((((())()()))))))))())((((()))))))))))()"], ["()(())((()(()()())(()((((()(())())()()(((())))())(()))(())"], ["(())()"], ["(()(())(()()(((())))())((()))()(())((((((()((((()))()))(((())((((((((((())))())(((()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()())()(())()()()(((())))())(()))()(()()))))))))(()(()))()))(()))))()))()(())))))))"], ["())(())((()(((()(()(())())())()(()()(((())))())(()))())(())(())(()))()())()"], ["(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()(((())))())(()))()(()()))))))))(()(()))()))(()))))"], ["())(())())((((()))))))))))))()((((()))()))()("], ["(())(())()((((((())((()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()())))))(("], ["((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(())()()(())(())())(()))()()())(())())()())())())("], ["())(())((()(())(()()(((()))))())(()))())(())(()()((((()))(((((()))))()())((())(())())((((()))))))))))()))())(()))()())(()())(())())())()(()(())())())(()(()))(()))(()))()())()"], ["(((()))()())("], [")((((((())()())))(()(((()(()((((()((((()))()))(((())()()))))(())()(()))))))))(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(()"], ["())(())((()(((()(()(())())((())(())())(((((())()(()(())))((())))))))))))()()(()(()(()(())())())(())()(()()(((())))())(()))())(())(())(()))()())()"], ["((())((())())((((()))))))())))()()(()(()(()())())())(((()())()((((((())()())))))(("], ["((()()(((()(()(())())()))()(()(())))"], ["(((((((())()())))))))(((((())()())))))))(((((())()()))))))))"], ["())(())((()(())(()()(((()))))())(()))())(())(()()((((()))(((((()))))()())((()((((((())()())))(()(((()(()))()))(()(((())()())(()(()((()(()((()(())()())()))(())))))())()))())(()))()())(()())(())())())()(()(())())())(()(()))(()))(()))()())()"], ["())())))))))()()(()(()(()(())())()))(()"], ["((((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(((((((())()())))(()(()))()))(()((((((())()()((()(()(((()(())())()())())())())())(((()(()(())())()))())((((())))))))))))(()(()))()))(())))("], ["())(()()())(()))()())(()(()(()())(())())(()))()())(()(()(())())())(())())())(()"], ["()(())(()()((((((((()))()))()())))())(((()))()))(((()))()(())(())())(()))()()())"], [")(()((("], ["(())((()(()(((()(())())()())())())((())()((((((())((((((((()(((()(()(())())()()(()))())()()))))))))()))()))(("], ["(((((((((()))()))))))"], ["((())()(()(()))())))"], ["((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(()()(((())())())(()))()(())(())())(()))()()())"], ["(((()()(()(()((((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))((()((((((())()())))))))()()))())((()(()(())())())())())())()()()"], [")()("], ["(((((())(()))))()()(()(()(()(())())())((())((((()))()))(((())()())))))(((((((())()())))))))"], [")((((((())()())))(()(((()(()((((()((((()))()))(((())()()))))(())()(()))))))))(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((()))))())((()))()(()(()(())())()((((()())))())))(((())(()()))(()"], ["()(()((()(((()(()(())())())())())()()"], ["()(()))))))))"], ["(((()((((()(()(())())()(()(()))()))(()(())(()()(((())))())((()))()(())((((()(()(())())())((((())()(()()())))"], ["(((()))()))(((())()((()))))("], ["())(())())(()))(()"], ["((()(()((()(())()"], ["())(())())(())()"], ["((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(())()()(())(())())(()))()()())(())())()())())())()())("], ["(((((((())(())())((((()))))))))))()()(()(()(()(((()(()))()(()(()())())())(((())())()))))))))((((((())()())))()))((())"], ["())(((((())))()())(())())(()))()())(()()()(())())())(()((())())((((()))))()))))))()"], ["()((((()(()((())())()(()(()))()))(()(())(()()(((())))())((()))()(())((((()(()(())())())((((("], ["()(())(()()(()(()))))))()(()())"], ["())(())((()(())(()()(((())))((()((((()(()(())()))())(())()())()"], ["((()(()((()()(()))(())()(((())()(())))())(()(((()))))))))))()())(())())(())()()(())(())())(()))()()())(())())()())())())("], ["((()()((())()(()(()))())(((()(()(())())()))()(()(())))"], ["((((())(())())((())(())())((((()))))))))))()()(()(()(()(())())())((((()))))))))()("], ["(())(())())(((((())()(()(())))(())))))))))))()()((()(()(())(())())())(("], ["((())(())())(((((())()(()(())))(())))))))))))()()((()(()(()(())())())(("], ["(((()(())(()()(((())))()((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(()))))))))))()(())((()"], ["())())()()(((()(()(())())()()(())))(())((()()(((()))()(()))(())(()))()(()()))))))()(()(())(())(())()(()))))))))))()))())(()"], ["((((())()(()(()((((((((((())()())))))))(()))())((()(()(())())())())())())))()())((())())(()))()())(()(()(())())((()(("], ["((())((())())((((()))))))()))()()()(()(()(()())())())(((()())()((((((())()())))))(("], ["(())(())())((((()))))))))))()()(()(())(()(())())())(()(())(()()(((())))())(()))()((((()))())))(((())(((((((()))())"], ["()())(())(())())(())()()))()"], ["(())(())())((((()))))))))))()()(()(()(()(())()((((())))))))())()(()((()(()(())()))()())((((())))()())(())())(()))()())(()(()(())())(())(()(()))())(((((()))())"], ["((()(((()(()(())()))(((((())()())))(()(())(())())(()))()())()()(()(()))(())(())())((((()))))))))))))())))(()"], ["())(())(()()(((()))))))()((()())"], ["()(())((()(()(()(((()(())())()()((((())))())(()))()(()())"], ["(((()(())(()()(((())))()((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())(((()))()(()))))))))))()(())((()"], ["((((())))))))())()(()((()(()(())()))()()))"], ["(((((((())()()))))(((((())()()))))))))))"], ["(()(((()()(((()(()(())())()))()(()(()))))(())(())())(((((())()))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(("], ["(()(())(()()(((())))())(()))(((()()(((()(()(())())()))()(()(())))))(())(("], ["(())((()(()(((()(())())()())())())((())()((((((())((((((((()(((()(()(())())()()(()))())()()))))))))())))))(("], ["(((()))())(((()(()))()))(()(())(()()(((())))()()((()))()(())(((((((())()()))))))))(((())()(()(()))))("], ["(((((((()((((((())()())))(()(((()(()((((()((((()))()))(((())()()))))(())()(()))))))))(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(()))()()))))))))"], ["()(((()(())(()()(()(())())()(()(()(())())())"], ["())(())((()(((()(()(())())())()(()()(((())))())(()))())(())(())(()))()()))"], ["((((((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(((((((())()())))(()(()))()))((()((((((())()()((()(()(((()(())())()())())())())())(())())((((())))))))))))(()(()))()))(())))("], ["()(())()())"], ["((()(()(((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(())))))))(()(())())(((((((())()()))((((((())()())))(()(((()(()))()))(()))()))(())())(())(())())((((()))))))))))()()(()(()(()(())()((((())))))))())()(()((()(()(())()))()())((((())))()())(())())(()))()())(()(()(())())(())(()(()))())(((((()))())("], ["()(()(()((((((()((((((())()())))(()((()((()(()(())())())())())())"], ["((()(()((()()(()))(()()()(((())))())(()(((()))))))))))()())(())())(())("], ["(()(()())())()(((()))(()(())))("], ["(((((((((())()()))))()))(())))()())(()((((((((((()))()))(((())()()))))))))))"], ["())(())())(())))"], ["(((())(((()(())(()()(((())))())(())))()(())(())(())(()))()()())())())()())())())()(("], ["())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))())()(()))()())(()(()(())())())(()"], ["())(()))())((((()))))))))))"], ["()(((((()(())((()(()(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()(((())))())(()))()(()()))))))))(()(()))()))(()))))(()(((()(())())()()(((())))())(()))()(()()))(()(())())()(()(()(())())())"], ["()(())(()()()(((())))())(()))()(()())"], ["(()(())(()()((((())))())(())))()(("], ["(()((())(())())((((()))))))))))()()(()(()(()(())(())((()))()(())(("], ["()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))())(()))()(((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(())()()(())(())())(()))()()())(())())()())())())(((((()))()))(("], ["())())))))))()()(()(()(()(())(()(())(()()(((())))())((()))()(())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))))()(()))()())(()(()(())())())(()())((())())(()"], ["())(())())(()(((((((())(((((((((())()())((())((())())((((()))))))))))()()(()(()(()())())())((()(()))()))(()))))))))))))()()))))))))()"], ["(()(())(()()(((())))())(()))(((()()(((()(()(())())()))()(()(())))))()())(("], ["()(())(()()(((())))())(()(()(())(()()(((())))())((()))()(())((((((()((((()))()))(((())(((((((())()())()(())(((()(())(()()(((())))())((()))()(()))))))))())()(()"], ["(((()))())(((())()((()))))("], ["())(())())(()))()())(()(()(((((((()))()())))))))))())(())())(()((()))((((((((())(((((((((())()())(()(()))()))(()))))))))))))()())))))))())(()(()(())(())())(())())())(()"], ["(())((()(()(((()(())())()())())())((())()((((((())((((((((()(((()(()(())()))()()(()))())()()))))))))()))()))(("], ["())(())((()(())(()()(((())))((()((((()(()(((()(()(())())()()()())()"], ["(((((()))())(((()(()))()))(()(())(()()(((())))()()((()))()(())(((((((())()())))))))(((())()(()(()))))()(()(())())())("], ["())(())((()(())(()()(((())))((()((((()(()(((()(()(())())(((())((())())((((()))))))())))()()(()(()(()())())())(((()())()((((((())()())))))(()()()())()"], ["(((((((())()()))))(())(())(((((()))()))(()())(())())())(())((()(())(()()(((())))((()((((()(()(())()))()(()(()(())())()))(())(()))()(())()((((())))))))))())()(()))()())(()(()(())())())(()((((())()()))))))))))"], ["())(())())((()(())((()(()(()(((()(())())()()(((())))())(())(())(())())()((((()(()(())())()(()(()(())())())(((((())()(()(())))(())))))))))))()()(()(()(()()())())())(()()(()())))"], ["()(()((()(((()(()(())())())())()())(())())((((()))))))))))()"], ["(((()((((()(()((()(())()))(()()(((())))())(()))()(())(()"], ["()(())(()()()(()(()(()((((((((((())()())))))))(()))())((()(()(())())())())())())(())))())(()(()(())(()()(((())))())(()))()(())(())()(()())"], ["()(()(()(((()(()(())())())())())()(((()(()((((((((())()()))))(()((())())))(()))))()))))())"], ["(((((((())(((((((((())()())(()((((()(())(()()(((())))())(()))()(())(()()))()))(()()()))))))"], ["((((()((((()))()))(((())()())))())(((((((())()())))))))"], ["())()((((()))())((()(())((()()(((())))())(())))()(()())())()(()(())))(()())"], ["(())(())())((((())))))))))))(()(()())())())(((((()))()))"], ["((((((((((((())()())))(()(()))()))(()(()))()))(()(())(()()(((())())(())())((((()))))))))))))()))())((()))(((()()))())))(()()(())((((())(())())()((((()(()(())())()(()(()(())())())(((((()))()(()(())))(())))))))))))()()(()(()()())(()(())())())(((()))"], ["(((())(())())((())(())())((((()))))))))))()()(()(()(()(()))())())((((()))))))))()))))))))"], ["()()())(()()(((())))())()(()())"], ["()())(())(()(((()))()))(()())(())())((((())))))))))))()(()))()())(()(()(())())())(())(((((()))()))(()())(())())((((())))))))))))()(()))()())(()(()(())())())(()"], ["(())(())())()((((()(()(())())()(()(()(()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))())(()))()(((((()))()))(((())())())(((((()))()(()(())))(())))))))))))()()(()(()(()(())())())(("], ["((((())()(()(()((((((((((())()())))))))(()))())((()(()(())())())())())())))()())((())())(()))((((())())(()(()(())())((()(("], ["()(())((()(()(()(((()((((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))(()()(((())))())(()))()(())(())())(()))()()())))())()()((((())))())(()))()(()())"], ["(())(())())()((((()(()(())())()(()(()(())())())(((((()))()(()(())))(())))))))))))()()(()(()(()())()))))))()(()(())())())(()))())())(("], [")(((()(()))())))(("], ["())(()()())(()))()())(()(()(()())(())())(()))()())(()(()(())())())(())"], ["(((((())(()))))()()(()(()(())(())())())((())((((()))()))(((())()())())))(((((((())()())))))))"], ["())(())((()(((()(()(())())((())(())())(((((())()(()(())))((())))))))))))()()(()(()(()(())())())(())()(()()(((())))())()((((()(()(())())()(()(()(())())())((((((()))())(())(())(()))()())()"], ["())(())())((())(())())((((())))))))))))()()(()(()(()(())())())((((()))))))))()"], ["(((((((())(((()))())(((()(()))()))(()(())(()()(((())))()()((()))()(())(((((((())()())))))))(((())()(()(()))))(()()))))))))"], ["()((()((((()(()(())())()(()())(())())(()))()())(()()((()())(()()(((())))())(())))()(()())(()(())())())(()(()(())())())(()(())"], ["((((()))))))(()((())(())())((((()))))))))))()()(()(()(()(())(())((()))()(())(()())()(()((()(()(()))"], ["((((()((((()))()))(((())(((((((()())(())())(())(())())((((()))))))))))()()(()(()(()(())())())(())()(((())))())((()))()(())))))))"], ["((()(()((()()(()))(())()(((())))())(()(((()))))))))))()())(())())(())()()(())(())())()())())("], ["()(())((())(())())()(())(()()(((())))())(()))()(()()))))())(()))()(((((()))()))(("], ["((()(()((()()(())()(())(()()(((())))())(())))()(())((((((((((()))()))(((())()()))))))())())(()))()()()))(())()(((())))())(()(((()))))))))))()())(())())(())("], ["(()(()(())())()((((()())())(())()(()))))))))))())())))(("], ["((()()))())))(("], ["((((()(())()())))(()(((()(())(()((())(())())((((())())))))))()()(()(()(()(())())())(()()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(()"], ["()(())(()()(((())))())(())))()(())(()()())"], ["(()(())((()()(((()()((((((()(((()(()(())())()()(()))())()())))))))())(((((((())()())))(()(()))()))(()))((((())()())((((()((((()))()))(((())(((((((())()())()(())(()()(((())))())(()))()(()()))))))))(()(()))()))(()))))"], ["((()(()((()()(()))(())()(((())()(())))())(()(((()))))))))))()())(())())(())()()(())(())())(()))()()())(())())("], ["()(())((())(())())(()))()((()()(())(()()(((())))())(()))()(()()))))()()(((((()))()))((((("], ["((()()))())(())())()()())())())))(("], ["((((((())))))))())()(()((()(()(()))((())))()())(())())(()))()())(()())(())())())()(()(())())())(()(("], ["((((()((((()))()))(((())((()(()(()(((()(()(())())())())())()(((()(()((((((((())()()))))(()((())())))(()))))()))))())(((((()())(())())(())(())())((((()))))))))))()()(()(()(()(())())())(())()(((())))())((()))()(())))))))"], ["(()(())((()()(((()()((((((()(((()(()((())())()()(()))())()())))))))())(((((())()())((((()((((()))()))(((())(((((((())()())()(())(()()(((())))())(()))()(()()))))))))(()(()))()))(()))))"], ["(()(()))())(("], ["(((((((()((((((())()())))(()(((()(()((((()((((()))()))(((())()()))))(())()(()))))))))(()((())(())())((((()))))))))))()()(()(()(()(())())())((())(()()(((())))())((()))()(())(()()))(())))()()))))))))"], ["(((()))())(((()((()()())(()(((((((((()))()))(((())()())))))))))))))))))))(((())()(()(()))))("], ["(((((((()(()(())()())))))))"], [")(()()))())))(("], ["()(())((())(())())(()))()((()()(())(()()(((())()))()))((((("], ["(((((()(((())()()))))((((())))))))())()(()((()(()(()))()))(())))()())(()(((((((((()))()))(((())()()))))))))))"], ["())(())((()(())(()()(((()))))())(()))())(())(()()((((()))(((((()))))()())((())(()()())((((()))))))))))()))())(()))()())(()())(())())())()(()(())())())(()(()))(()))(()))()())()"], ["((()(()(())(())())()())())("], ["(()(())(())(())())()()())()(()()(((((())(())())(((((())()(()(())))((())))))))))))()()(()(()(()(())())())(((()))))"], ["(((((((((((())()()()(())((())(())())(()))()((()()(())(()()(((())()))()))((((()))(()(()))()))(()))"], ["((((((())()())))(()(((()(())(()((())(())())((((())))))))))))()()(()(()(()(())())())((())(()()(((())))())((())))()(())(()()))(()"], ["(()(())(()()(((())))())((()))()(())((((((()((((()))()))(((())((((((((((())))())((()))()(())))))((((())))()())(())())(()))()())(()())(())())())()(()(())())())(()(())"], ["((((((())()()(()(())(()))(())())((()))()(()())(()(()((((()(())())()())())())()))(()(()))()))(()))"], ["((((((())()((((()((((()))()))(((())((()(())())))))(((((((())()())))))))()))))()))(()))"], ["(()(()))()))(()(())(()()(((())())(())())((((()))))))))))))()))())((()))(((()()))())))(()()(())((()(((((()))()(()(())))(())))))))))))()()(()(()()())(()(())())())(("], ["(((()()(()(()((((((()((((((())()())))(()(((()(()))()))(()))()))(()))()))())))((()((((((())()())))))))()()))())((()(()(())()))())())()()()"], ["(((()((()(()(()(())())()(()(()))()))(()(())(()()(((())))())(())(())())(((((())()(()(()))()(())))))))))))()()(()(()(()(())())())((((()))()(())((((()(()(())())())((((())()(()()())))"], ["((()(()((()()(()))(())()(((())()(())))())(()(((()))))))))))()())(())())(())()))(())())(()))()()())(())())("], ["((()()((())()(()(()))())(((()((((((()((((()))()))(((())((()(())())))))(((((((())()())))))))()))()(()(())))"], ["((((())))))))())()(()((()(()(())()))()())((((())))()())(((()(()(((()(()))()))())(()))()())(()((())(())((()(())(()()(((())))())(()))())(())(())(()))()())())(())())())(()(())"], [")()()(()())())()("], ["())("], [")()"], ["())"], ["(((((()((()(()(())())()))))"], ["(((((()((()(()(())())((((((()((()(()(())())())))))))))"], ["(((((()((()(()(())())((((((()((()(()(()((())()(()(()))))())))))))))"], ["(((((()((()(()(())())(((((((()((()(()(()((())()(()(()))))())))))))))"], ["((((((()((()(()(())())((((((()((()(()(())())())))))))))((()))())("], ["()(())()()()(((())))())(()))()(()()))"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())("], ["((((((()((()(()(())("], ["(())(())())(()))()"], ["())()(())(())))"], ["(((((((((()((()(()(())())()(()(())))"], ["((())()(((()(()(())())())(())))"], ["()(())(()()((()(()(())())()((())))())(()))()(()())"], ["((((((()((()(()(())())(((((((()((()(()(())())()))))))))))((()))())("], ["(((())(())())(()))()()(()(())))"], ["())()(())(())))))("], ["())()(()))(())))"], ["((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())("], ["((((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())("], ["((((((())()("], ["(((((((((((()((()(()(())())((((((()((()(()(()((())()(()(()))))())))))))))()((()((())("], ["((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((()))())("], ["((((((()((()(()(())())((((((()((()(()(())())())))))))))((()("], ["((((())()(()(()))))(())())(()))()"], ["((((((())())()))))))"], ["((((((()((()(()(())())((((((()(()()()()(()(())())())))))))))(()()))())("], ["((((((()(()()(()(())("], ["()(())(()()((()(()(())())()((())))())(())))()(()())"], ["())()(()(())()()()(((())))())(()))()(()()))())(())))))("], ["())()(()(())()()()(((())()())))())(())))()(()()))())(())))))("], ["((())()(((()(()(()))()()())())(())))"], ["((())(((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()(((()(()(()))()()())())(())))"], ["(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()())()(()(())))"], ["(())()(())(())))"], ["(()(())(())())())"], ["(((((()((()(()(())())((((((()((()())())(()(())()()()(((())))())(()))()(()()))())(())))))((()(()((())()(()(()))))())))))))))"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())((())(((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()(((()(()(()))()()())())(())))("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())())"], ["((((((())()))()))))))"], ["(()))(())())(()))()"], ["((((((()((()(()(())())((((((()((()(()(())())())))()))())("], ["(()(())(())((())()(())(())))))()"], ["())()(()(())(())()(())(()))))()()(((())()())))())(())))()(()()))()))(())))())("], ["((((((()((((((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())()()(()(())("], ["(((((())(())())(()))()((()(()()(()(())("], ["((((((())())())))))))"], ["(())()(())())))"], ["()(())(()()((()(()(())())()((())))((()))(())())(()))()))(())))()(()())"], ["(((((()((()(()(())())((((((()((()())())(()(())()()()(((())))())((()))()(()()))())(()))))))((()(()((())()(()(()))))())))))))))"], ["(((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())((())(((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()(((()(()(()))()()())())(())))(()(()(())())()"], ["(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())()(()(())))"], ["(())((((((()((()(()(())())(((((((()((()(()(()((())()(()(()))))()))))))))))"], ["((((((())()))(()))))))"], ["(()))(()((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())()())(()))()"], ["(((())(())())(()))()(()(())))"], ["((((((()((()(()(())())((((((()((()(()(())())())))()))(())("], ["((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())("], ["(())())))"], ["((((((()((()(()(()))())((((((()((()(()(())())())))()))())("], ["(((((()((()(()(())()()()))))"], ["())(())())((()))()"], ["(((((((((((()((()(()(())())((((((()((()(()(()((())()(()(())((((((()((()(()(()))())((((((()((()(()(())())())))()))())()))())))))))))()(()((())("], ["(((((()((()(()()(())()()()))))"], ["(((())(())())(()))((((((())())())))))))()()(()(())))"], [")()()((())))))))"], ["(((((())(())())(()))((((((())())())))))))()()(()(())))(((()((()(()(())())((((((()((()(()(()((())()(()(()))))())))))))))"], ["(()(())(())((())()())()"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()("], [")(((((((()((()(()(())())((((((()((()())())(()(())()()()(((())))())(()))()(()()))())(())))))((()(()((())()(()(()))))())))))))))"], ["((((())()(()(())))))(())())(()))()"], ["))()()"], ["(((())(())()))(()))()(()(())))"], ["((((((((((())()())(())()))(()))()(()(())))"], ["(())(())())((()))()())()(())"], ["(((())(())())(()))(((((()())())())))))))()()(()(())))"], ["())()(()))(((((((())()(())))"], ["(((((()((()(()(())())((((((())()(((((((()((()(()(()((())()(()(()))))())))))))))"], ["((((((()(((()(()(())())((((((()((()(()(())())())))))))))(((((()((()(()(())())((((((()((()(()(()((())()(()(()))))()))))))))))((()))())("], [")(((())()(())()))))"], ["((((((())())())))))((((((())())())))))))"], ["((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()(())())()))))))))))((()))())())(())))"], ["((((((()((())(()(())()()()))))"], ["(())(())())(()))((())((((((()((()(()(())())(((((((()((()(()(()((())()(()(()))))())))))))))))"], ["((((())()(()(()))))(())())(()))((())))()"], ["(())()))))"], ["((((()()"], ["((((((()(()())(()(())("], ["((((((()((()((()(())(()()(((())))())(()))()(()())())(())((())(()(())(())())())()())())(())("], ["((()((()((()))))))))"], ["((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((()))())())))("], ["))((())()(((()(()(()))()()())())(())))()()"], ["()(())(()()((()(()(())())()((())))((()))(())(()(())(())())()())(()))()))(())))()(()())"], ["())()(()(())()()()(((())))())(()))()(()(((((((()((()(()(())())((((((()((()(()(())())())))()))(())()))())(())))))("], ["((((((()((()(()(())())((((((((()((()(()(())())()))))))))))((()))())("], ["((()((()((())))))()))"], ["()(())))))))"], ["(())())))())()(()(())()()()(((())))())(()))()(()()))())(())))))()"], ["(((((((((((()((()(()(())())((((((()(((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()(())())()))))))))))((()))())())(())))(()(()(()((())()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())((()(()))))())))))))))()((()((())("], ["((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()()())())()))))))))))((()))())())(())))"], ["((((((()(((()(()(())())((((((()((()(()(())())())))))))))(((((()((()(()(())())((((((()((()(()(()((())()(())(()))))()))))))))))(((()))())("], ["(((())(())())((((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())()))()(()(())))"], ["))(()((((((()((())(()(())()()()))))"], ["(((((()((()(()(())())((((((())()()()()((((((()((()(()(()((())()(()(()))))())))))))))"], ["())()(()(())()()()(((())))())(()))()(()((())()(())(()))))))(())(())))))("], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()(())())())))()))())((()(()(())())()(()(())))"], ["(((((()((()(()((())())((((((()((()(()(())())))))))))))"], ["((()()))))"], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())"], ["((()((()((())))))))))"], ["((((((()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())("], ["(((((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())((((())()()))))))"], ["((((((((())()()))))))))()))"], ["((((((()((((((((()((()(()(())()))))))))(()()))())()()(()(())("], ["((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((()(()()())())()))))))))))((()))()))())(())))"], ["(((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()(())())())))()))(())("], ["(((((())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))())))))))))"], ["((((())()(()(()))))(())())(())()((())))()"], ["((())()(((()())(())))"], ["((((((())()(()(())()()()(((())))())(()))()(()((())()(())(()))))))(())(())))))((((((()((()(()(())())((((((()((()(()(()((())()(()(()))))())))))))))()((()((())("], ["((()(((()(((())()(())()))))(())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))()))))))))))()(((()(()(())())())(())))"], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())"], ["((((((()((()(()(()))()(())(()()((()(()(())())()((())))((()))(())())(()))()))(())))()(()())((((((((()((()(()(())())())))))))))))((()))())("], ["((((((()((())(()(())()()()())))"], ["()(())(()()((()(()(())())()((())))())(())))()(((((()((()(()(())()()()))))(()((((((((((()((()((((((()((()(()(())())))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())"], ["(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))"], ["((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))()()))))))((()))())("], ["((((((()(())))(()()))())("], ["(((((()())(()((((((()((())(()(())()()()))))(()(()()(())()()()))))"], ["((((((()(()())(()((())("], ["((())()((((())))(()(()(())())())(())))"], ["((((((()((()((((()((()((()))))))))))(())())((((((()((()(()(())())()))))))))))((()("], ["(((((()((()(()(())()()())))(((())(())()))(()))()(()(()))))"], ["((((((()((()(()(())())((((((()((()(()(())())((((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())(())))))))))((()("], ["(()((((((())()(()(()))))(())())(()))((())))())(())())()"], ["(((()))())(()())("], ["((((((()(((()(()(())())(((((((()((()(()(())())())))))))))(((((()((()(()(())())((((((()((()(()(()((())()(())(()))))()))))))))))(((()))())("], ["((()(((((((()((()(()(())())((((((()((()()(())())())))))))))(((()((()((()))))))))"], ["(((((()((()(()(())()()())((((())()(()(()))))(())())(())()((())))())))"], ["((((((()((()(()(()))())())))()))())("], ["((((())()(()((((()))())(()())(()))))(())())(())()((())))()"], ["((((((()(((((())()(((()())(())))(((((()((()(()(())()))))))))(()()))())()()(()(())("], ["(((((((((()((()((((((()((()(()(())())((((((()((()(((()(())())())))))))))((()))())()())()(()(())))"], ["((((((()((()(()(((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))()()))))))(((())(())())(()))()()))())("], ["((((((())()))(()))))"], ["((((((()((()(()(()))())(((())("], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()((())())())))()))())((()(()(())())()(()(())))"], ["(((((()((()(()(())())((((((())()()()()((((((()((()(()(()((())()(()(()))))()))))))))))((())()(((()(()(()))()()())())(())))()())"], ["()(())(()()((()(()(())(((((((()((()(()(())())))((()))(())())(()))()))(())))()(()())"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))((())()(())(()()((()(()(())())()((())))())(())))()(()()))())("], ["(((((((((((()((()(()(())())((((((()(((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()(())())()))))))))))())())((()(()))))())))))))))()((()((())("], ["((((((()((()(()((((((()(()()(()(())((()())())())))()))())("], ["(((((())()(()(()))))(())())(()))()"], ["(((())((((((((()((())(()(())()()()())))))())(()))(((((()())())())))))))()()(()(())))"], ["((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))())(((())()((()((()))))))))"], ["((((((()(((((((()(()())(()((())((()((()(()((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()((((()(((()(((())()(())()))))(())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))()))))))))))()(((()(()(())())())(())))))))()()))))))((()))())()(()()(((())))())(()))()(()())())(())((())(()(())(())())())()())())(())("], [")())()(()))(())))"], ["()()(())(()()((()(()(())())()((())))())(())))()(()())(())))"], ["(((((())))"], ["(((()))((((((())()()))))))"], ["(((((()((()(()(())(((((((()((()(()((((((()(()()(()(())((()())())())))()))())())(())))"], ["((((((()(()())(((((())(())())(()))()()(()(()))))(())("], ["(((((()(()()(()((())())(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())()(()(())))())))))))))))"], ["((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((()))))))))"], ["((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(()))))()()))))))((()))())("], ["(())(((((()))())())())(()))()"], ["(()(())()(())(())))(())(())((())()())()"], ["()(())(()()((()(()(())())()((())))())(())))()(()())()(())(())))))()((((((()((())(()(())()()()())))()(((()(()(()))()()())()((())()(((()())(()))))(())))()()()()))())())"], ["()))(())())(()))(()"], ["((((((()(()())((()(())("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))()(((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())())"], ["(((((())(())())(()))(((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))"], ["(())(())())(()))((())((((((()((()(()(())())(((((((()(((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))"], ["(()(())))))))"], ["((((((()((()(()(()))()(())(()()((()(()(())())()((())))((()))(())())(()))()))(())))()(()())((((((((()(((()(()(())())())))))))))))((()))())("], ["(((((()((()(()()(())()()()))())"], ["((((((()(((()(()(())())(((((((()((()(()(())())())))))))))(((((()((()(()(())()())()(()))(()))))((((((()((()(()(()((())()(())(()))))()))))))))))(((()))())("], ["(((((()((()(()(())()()())(((((((((((((()(((((((()((()(()(()))())((((((()((()(()((())())())))()))())((()(()(())())()(()(())))())()(()(()))))(())())(())()((())))())))"], ["((((())((((((()((())(((((()))((((((())()())))))))(())()()()())))()(()(()))))(())())(()))()"], ["((()((()((()())()(()(())()()()(((())))())(()))()(()(((((((()((()(()(())())((((((()((()(()(())())())))()))(())()))())(())))))()))))()))"], ["(((((((((((()((()(()(())())((((((()((()((()(()((())()(()(()))))())))))))))()((()((())("], ["((((((()((()(()(())())((((((()(()()()()(()(())())(()()))())("], [")())()(())))(())))"], ["((((((())())())))))())"], ["(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())((((((()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())()))))(()()))())())"], ["(((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()()())())())))()))(())("], ["(((())(())())(()))()()(()(())))((((((()((()(()(()())((((((()((()(()()())())())))()))(())("], ["()(()))(()(())(())())())))))))"], ["))((())()(((()(()(()))()()())())(())))((((())(())())(()))()()(()(()))))()"], ["((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((())))(((())()(())()))))())("], ["((((((())()))(())))()(())(()()((()(()(())())()((())))((()))(())())(()))()))(())))()(()()))"], ["())()(((())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())()(())(())()(())(()))))()()(((())()())))())(())))()(()()))()))(())))())("], ["(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()(((((((((()((((((((()((()(()(())()))))))))(()()))())()()(()(())()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())("], ["((((((()())()()()((((((()((()(()(())())((((((()((()())())(()(())()()()(((())))())((()))()(()()))())(()))))))((()(()((())()(()(()))))())))))))))))))"], ["(((((()((()(()(())())(()))"], ["(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())(())))"], ["((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((()(((((((()((()(()(())(()()())())()))))))))))((()))()))())(())))"], ["((())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()(((((((((()((((((((()((()(()(())()))))))))(()()))())()()(()(())()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())((((((()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())("], ["(((((((((((()((()(()(())())((()(())(()()((()(()(())())()((())))())(())))()(()(((((((())((((((()((()((()(())())())))))))))((()))())()())()(()(())))()(((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())())((((()(((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()(())())()))))))))))((()))())())(())))(()(()(()((())()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())((()(()))))())))))))))()((()((())("], ["((((((()(((()((((((((((()(((((((()((()(()(()))())((((((()((()(()((())())())))()))())((()(()(())())()(()(())))()((((((((())()))(()))))))((((((()((()(()(()((())()(()(()))))()))))))))))((()))())("], ["(())(())())(()))(()())((((((()((()(()(())())(((((((()(((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))"], ["((((((()((()(()((((((()(()()(()(())((()())())())))()))("], ["(()(()))(())())()"], ["(((((((())())())))))((((((())())())))))))"], ["((())()(((()(()(((())(())())((((((((()((()((((()((()((()))))))))))(())())((((((()((()(()(())())()))))))))))((()()))((((((())())())))))))()()(()(()))))((()(()()())())()))))))))))((()))()))())(())))"], ["(())(((((((()((()(()(())())((((((()((()(()(())())())))()))(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())("], ["((((((()((()(()((((((()(()()(()(())((()()()())())))()))("], ["((((((()(()))(()((((((())()(()(()))))(())())(()))((())))())(())())())(()()))()))("], ["(((((())(())())(()))(((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(())))((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((())))))))))"], ["()(())(()()((()(()(())())()((()))(((((()((()(()(())())((((((()((()(()(())())()))))))))))())(())))()(()((()(((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))()(((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())())"], ["((((((()(((()(()(())())((((((()((()(()(())())))))))))((()))())())))("], ["((((((((())()(()((()((())))))()))"], ["))(()((((((()((())(()()()()))))"], ["()(()))(()(())((())())())))))))"], ["((((((()((()())(()(((())("], ["((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()((()))())(((())()((()((()))))))))"], ["(((((()((()(()(())())((((((())((()())())(()(())()()()(((())))())((()))()(()()))())(()))))))((()(()((())()(()(()))))())))))))))"], ["((((((()((()(()(())())(((((((()((()(()(())(((((((()((()(()(((((((()(()()(()(())((()())())())))()))())()))))))))))((()))())("], ["((((((()(((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()()())())())))()))(())()()))()))))))"], ["((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()()())())())))(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())()(()(()))))))))))((()))())())(())))"], ["(((((())(())())(()))()((()(()(()(()(())("], ["(((((((()(()(()(())(((((()((()(()(())())(()))"], ["((((((())()"], ["(((((()((()(()(())((((((((()((()(()(())())((((((()((()(()(())())((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((())))(((())()(())()))))())(((()())()()())))()))())())(())))"], ["(((((((()((()(()(())())(((((((()((()(()(())())()))))))))))((()))())()(()))(()(())(())())())))))))"], ["((()(((()(()(())("], ["((((((()(((()(()(())())(((((((()((()(()(())())())))))))))(((((()((()(()(())())((((((()((()(())(()))))()))))))))))(((()))())("], ["((((((()((()(()(())())((((((()(((()(()(())())())))))))))((()("], ["()(()))(()(()()((())())())))))))"], ["))((())()(((()(()((((())()(((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()(()))))()"], ["(()((()))((((((()((()(()(())()()())((((())()(()(()))))(())())(())()((())))())))())())()"], ["(()(())()(())(())))(())(())((())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()(((((((((()((((((((()((()(()(())()))))))))(()()))())()()(()(())()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())((())()())()"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))(((())()(())(()()((()(()(())())()((())))())(())))()(()()))())("], ["(((((((()(()(()(())(((((()((()(()(())((((((()((()(()(())())(((((((()((()(()(())(((((((()((()(()(((((((()(()()(()(())((()())())())))()))())()))))))))))((()())())(())(()))"], ["((((((((()((()(()(())())()))))))()))))"], ["(((((((((((()((()(()(())())((((((()((()()((())()(()(()))))())))))))))()((()((()(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))()))))))))))))("], ["()(()))(()(())()((())())())))))))"], ["((((((()((()((()(((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()(((()(()(())())()(()(())))()()))))))(((())(())())(()))()()))())("], ["())()(()))((((()((())()(())))"], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()((()))())())))()))())((()(()(())())()(()(())))"], ["))()(())()(((()(()((((())()(((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()()())())())))(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())()(()(()))))))))))((()))())())(())))((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()(()))))()"], ["(())(((((()))())())(())(()))()"], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()((())())())))()))())((())()(())()(((()(()((((())()(((())()(((()(()(())(((((((()((()(()()())())(((((((()((()(()()())())())))(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))(())()())()(()(()))))))))))((()))())())(())))((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()(()))))())(()(())())()(()(())))"], ["(()(())(())())()((((())()(()(()))))(())())(()))((())))()"], ["()(())))))))((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((()(()()())())()))))))))))((()))()))())(())))"], [")((((((())())())))))"], ["((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((((((())(())())(()))(((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))(()(()()())())()))))))))))((()))()))())(())))"], ["((((((()((()(()(()(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()())()(()(())))))())())))()))())("], ["()(())(()()((()(()(())())()((())))())(())))()(((((((()((()(()((((((()(()()(()(())((()()()())())))()))(()())"], ["((((((())((()(()(()(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()())()(()(())))))())())))()))())("], ["((())())(((()(()((()((()))()))())(())))"], ["((((((((())()))))((((()((()(()(())())((((((()((()(()(()((())()(()(())((((((()((()(()(()))())((((((()((()(()(())())())))()()))())))))))))()(()((())("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()())))())())"], ["()(())))(()(())(())())())))))))"], ["(((((((((()((()((((((()((()(()((())())((((((()((()((()(())())())))))))))((()))())()())()(()(())))"], ["())()(())(())()()()(((())))())(()))()(()()))())(())))))("], ["((((((())())())))()))"], ["(((((()())((((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()((()))())(((())()((()((())))))))))((((((()((())(()(())()()()))))(()(()()(())()()()))))"], ["((((((()(((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()(()())(()(())("], ["()(())(()()((()(()(())())()((()))()((()))(())(()(())(())())()())(()))()))(())))()(()())"], ["((((((((((((()((()(()(())())((((((())((()())())(()(())()()()(((())))())((()))()(()()))())(()))))))((()(()((())()(()(()))))()))))))))))(())))(()()))())("], ["(((())(())())((((((((()((()(()((((())()(()(())))))())(((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())()))()(()(())))"], ["(((())(())())((((((((()((()(()((((())()(()(())))))())((((((())((((((((()((()(()(())()()())))(((())(())()))(()))()(()(()))))()))))))(((((((((()((()(()(())())()(()(())))))))((()))())()))()(()(())))"], ["((())(((((((()((()(()(()))())((((((()((()(()(())())())))()))())()())(())))"], ["())()(())())))("], ["(()(())(())()"], ["(((((((((((()((()(()(())())((()(())(()()((()(()(())())()((())))())(())))()(()(((((((())((((((()((()((()(())())())))))))))((()))())()())()(()(())))()(((((()((()(()(())())((((((()((()(()(())())())))))))))(()()))())())((((()(((())()(((()(()(())(((((((()((()(()()())())(((((((()(((()(())())()))))))))())((()))())())(())))(()(()(()((())()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())((()(()))))()))))))))()((()((())("], ["((((((()((()(()(())())(((((((()((()(()(())())())))())("], ["((((((()((()("], ["((((((()((()(()(())(())())((()))()("], ["())()(())(())()()()(((()))(()((((((()((())(()(())()()())))))))())(()))()(()()))())(())))))("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())((((((()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())()))))(())()))())())"], ["(((((((()((()(()(())())(((((((()((()(()(())())()))))))))))((()))())()(()())(())())(()))()))())))))))"], ["()(()))(((((()())((((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()((()))())(((())()((()((())))))))))((((((()((())(()(())()()()))))(()(()()(())()()())))))))))((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((()(()()())())()))))))))))((()))()))())(())))"], ["()(())(()()((()(()(())())()((())))())(())))()(()(((((((((())()(((()(()(((())(()))())(()))((((((())())())))))))()()(()(()))))((()(()())())())()))))))))))((()))()))())(())))(((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())"], ["()(()))(()(())(())())()))))))))"], ["((((((()((((((((()((()(()(())())((()(())(())((())()())()(((((()((()(()(())())())))))))))(()()))())()()(()(())("], ["((((((((((()((()((()(())(()()(((())))())(()))()(()())())(())((())(()(())(())())())()())())(())(((()(()()(()(())("], [")(((((((()((()(()(())((((((((()((()(()(())())((((((()((()(()(())())((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((())))(((())()(())()))))())(((()())(((((((())())())))())))()())))()))())())(())))"], ["()(())()()()(((())))"], ["))())()(()))(())))"], ["((((((()(((())(())())(()))()()(()(())))((((((()((()(()(())())(((((((()()())())())))()))(())()()))()))))))"], ["((((((()((()(()(())())(((((((()((()(()(())(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))())()))))))))))((()))())("], ["((()(((((((()((()(()(())())((((((()((()()(())(())())))))))))((((((()(((()((()(()((()))())(((())()((()((()))))))))"], ["))())()()()((())))))))))(())))"], ["(((((((())"], ["()(()))(((((()())((((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()((()))())(((())()((()((())))))))))((((((()((())(()(())()()()))))(()(()()(())()()())))))))))((())()(((()(()(((())(())())(()))(((((()()())())()))))))))))((()))()))())(())))"], ["((((((())()))()))))))((((((())())()))))))"], ["((()(((()(((())()(())()))))(())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((()((((((()((())(()(())()()()))))())(())))"], ["((((((()(((()(()(())())(((((((((()((()(()(()((())()(())(()))))(((()))())("], ["()(())(()()((()(()(())(((((((()((()(()(())())))((()))))())(()))()))(()((())(((((((()((()(()(()))())((((((()((()(()(())())())))()))())()())(())))))()(()())"], ["())()(()))(()))))"], ["()(())(()()((()(()(())())()((())))())(()())()(()())"], ["()(()))("], ["((((())()(()(())))())()(()(())()()()(((())()())))())(())))()(()()))())(())))))()(())())(())()((())))()"], ["((((((())())(())(((((()))())())(())(()))())()))))))"], ["((()())))))"], ["(((((((()((()(()(())())((((((())()()()()((((((()((()(()(()((())()(()(()))))()))))))))))((())()(((()(()(()))()()())())(())))()())()((()((()))))))))"], ["())()(()))(())))))"], ["((((((()((()(()((((())()(()(())))))())(((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())("], ["())()(())(())()()()((((()))(()((((((()((())(()(())()()())))))))())(()))()(()()))())(())))))("], ["))((())()(((()(()((((())()(((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()((((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()(())())())))()))(())(()))))()"], ["))((())()(((()(()((((())()(((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()((((())(())())(()))()()(()(())))(())())))()))(())(()))))()"], ["((((((()((((((((()((()(()(()))()))))))))(()()))())()()(()(())("], ["()(()))(()(())((())())())))"], ["())()(()(())(())()(())((()))))()()(((())()())))())(())))()(()()))()))(())))())("], ["(((((((((((()((()(()(())())((((((()((()(()(()((())()(()((((((((((((()((()(()(())())((((((()((()(()(()((())()(()(()))))())))))))))()((()((())(()())()(()))(())))))))))())))((())("], ["())()(((())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())()(()(()))))())))))))))))((((((()((()(()((((((()(()()(()(())((()())())())))()))())()(())(())))())(())))()(()()))()))(())))())("], ["(((())(())())(()))()()(()(())))((((((()((()(()(())())(((((((()((()(()()())())())))()))(())("], ["((((((()((()(()((((((()(()()(()(())((()((((((((((())()())(())()))(()))()(()(())))()()())())))()))("], ["(())(())())(()))((())((((((()((())(()(())())(((((((()((()(()(()((())()(()(()))))())))))))))))"], ["((((((((((((()((((((((()((()(()(()))()))))))))(()()))())()()(()(())((()(()(()(())(((((()((()(()(())((((((()((()(()(())())(((((((()((()(()(())(((((((()((()(()(((((((()(()()(()(())((()(())())())))()))())()))))))))))((()())())(())(()))"], ["((((((()((()(()(()))())((((((())))()))())("], ["(((((((())()("], ["((((((()(((())()(((()(()(((())(())())(()))((((((())())())))))))()()(()(()))))((()(((((((()((()(()(())(()()())())()))))))))))((()))()))())(())))(()(()(())("], ["(()(())(())())()((((())())(()))((())))()"], ["((((((()((()(()((())())((((((()((()(()(())())()))))))((((((()((()(()((((())()(()(())))))())((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())()))((()))())("], ["(())())))())()(()(())()()()(((())))()))()(()()))())(())))))()"], ["((((())()(()(())))())()(()(((((())()(()(()))))(())())(())()((())))()())()()()(((())()())))())(())))()(()()))())(())))))()(())())(())()((())))()"], ["(((())(()))())((((((((()((()(()((((())()(()(())))))())(((((((())((()(()(())())()))))))(((((((((()((()(()(())())()(()(())))))))((()))())()))()(()(())))"], ["()(())(()()((())()(())(())()()()(((())))())(()))()(()()))())(())))))(()(()(())())()((())))())(())))()(()())"], ["((((((()(((()(()(())())(((((((((()((()(()(()((())()((((()))())("], ["((((((((((()((()((()(())(()()(((())))())(()))()(()())())(())(())(()(())(())())())()())()(((((((()(()(()(())(((((()((()(()(())((((((()((()(()(())())(((((((()((()(()(())(((((((()((()(()(((((((()(()()(()(())((()())())())))()))())()))))))))))((()())())(())(())))(())(((()(()()(()(())("], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()(())())())))()))())((()(((()(((()(((())()(())()))))(())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((()((((((()((())(()(())()()()))))())(())))()(())())()(()(())))"], ["(((((((((()(((((((()((()(()(()))())((((((()((()(()(())())())))()))())((()(()(())())()()()(())))"], ["(()(())(())())()((((())())(()))(((((())(())())(()))()()(()(())))((((((()((()(()(()()((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((()))())(())())))()))(())(())))()"], ["((((((()((()((()(())(()()(((())))())(()))()(()())()()())())(())("], ["(())(())())(()))((())((((((()((()(()(())())(((((((()((())(()(())()()()))))((((((()((()(()(()((())())(()(()))))())))))))))))"], ["()(())(()((((((())(())())(()))((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(()))))()))))))))))((()(()(())())()((())))())(())))()(()())"], ["(((((()((()(()(())())(((((((()((()(()(()((())()(()((((((((())()))(()))))))))))))"], ["(((())(())())(()))()()(()(())))((((((()((()(()(()())((((((()((()(((((((((((()((()((()(())(()()(((())))())(()))()(()())())(())(())(()(())(())())())()())()(((((((()(()(()(())(((((()((()(()(())((((((()((()(()(())())(((((((()((()(()(())(((((((()((()(()(((((((()(()()(()(())((()())())())))()))())()))))))))))((()())())(())(())))(())(((()(()()(()(())(()()())())())))()))(())("], ["(()(())()"], ["((((((()((()(()(())())((((((()((()(()(())()))("], ["()))()(())(())))"], ["((((()))()(()(())))))(())())(()))()"], ["(()(())(())(()"], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())(((((()(())(()()((()(()(())())()((())))())(())))()(((((()((()(()(())()()()))))(()((((((((((()((()((((((()((()(()(())())))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())(()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())()))))(())()))())())"], ["()(())(()()((()(()(())())()((())))(()(()))(()(())(())())()))))))))))(())))()(()())"], ["(((((()))))))((()))(())()())()(()(())))())))))))))))"], ["((((((()(()())((((((((()((()(()(())(((((((()((()(()((((((()(()()(()(())((()())())())))()))())())(())))((())(())())(()))()()(()(()))))(())("], ["(((((((()((()(()(())()()()))))"], ["(()((((((()(((((())()(((()())(())))(((((()((()(()(())()))))))))(()()))())()()(()(())((())(())())())"], ["((((((()((((((((()((()(()())()))))))))(()()))())()()(()(())("], ["((((((()((((((((()((()(()())()))))))))(()())))())()()(()(())("], ["(((((())(())())(()))(((((((())())())))))))()()(()(())))(((()(())(()((((((()((())(()()()()))))())(()(())())((((((()((()(()(()((())()(()(())))((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((())))))))))"], ["(((((()))))))())()(())(())))))))))))))))"], ["(((((()((()(()())))(((())(())()))(()))()(()(()))))"], ["(((((()()"], ["((((((()(((()(()(())())((((((()()(()(()(())())())))))))))(((((()((()(()(())())((((((()((()(()(()((())()(())(()))))()))))))))))(((()))())("], ["(()()())(())())()((((())())(()))((())))()"], ["((((((()(((()(()(())())(((((((()))()(())(()))))((()(()(())())())))))))))(((((()((()(()(())())((((((()((()(()(()((())()(())(()))))()))))))))))(((()))())("], ["()(())(()()((()(())(())())()((())))(()(()))(()(())(())())()))))))))))(())))()(()())"], ["()(())(()()((()((((()))))))))(())())()((())))())(())))()(()(((()((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())"], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((())((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())(((((()(())(()()((()(()(())())()((())))())(())))()(((((()((()(()(())()()()))))(()((((((((((()((()((((((()((()(()(())())))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())(()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())()))))(())()))())())"], ["((((((()((()(()(())())((((((()((()(()(())())()))))))))))((())()((((()(()(())())()((())))())(())))()((())()(())(())))))()()))())("], ["((((((())())())))))(()(())(()))(())"], [")(((((((()((()(()(())((((((((()((()(()(())())((((((()((()(()(())())((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((())))(((())()(())()))))())(((()())(((((((())())())))())))()())))()))())())())"], ["(((((()((()(()(())())((((((())((()((()((((((())()(()(()))))(())())(()))((())))())(())())()))())(()(())()()()(((())))())((()))()(()()))())(()))))))((()(()((())()(()(()))))())))))))))"], ["((((((())))"], ["()(())(()()((()(()(())())()((()))))())(()))()(()())"], ["()(())(()()((()(()(())()()()((())))((()))(())(()(())(())())()())(()))()))(())))()(()())"], ["((((((()(((())(())())(()))()()((()()())())())))()))(())()()))()))))))"], ["(((((((((()((()(()(())())((((((()((()(()(())())()))))))))))((()))())((((())()())))))))"], ["))((())()(((()(()((((())()(((()(()(())())())(()))))))()()())())(())))((((((((((()((()(()(()))())((((((((()((()(()(())())())))))))))))((()))())(())(())())(()))()()(()((((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()(())())())))()))(())(()))))()"], ["((((())())(()(())))))(())())(()))()"], ["(((())(())())(()))()()(()(())))((((((()((()(()(())()))(((((((()((()(()()())())())))()))(())("], ["((((((()((()(()(())())((((((()((()((()(())())())))())))())("], ["((((((()((()(()(())())((((((()((()(()(())())()(((((())(())())(()))(((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(())))((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((()))))))))))))))))((()))())("], ["())()(()(())()()()(((())())())(()))()(()(((((((()()())(())))))("], ["())()(()(())()()()(((())))())(()))()(()(((((((()((()((((((((()((()((()(())())(()))())(())))))("], ["((((((()((()(()(())())((((((()((()((()(())())())))))))((())()(((()(()((((())()(((()(()(())())())(()))))))()()())())(())))((((())(())())(()))()()(()((((())(())())(()))()()(()(())))((((((()((()(()(())())((((((()((()(()(())())())))()))(())(()))))()))))((()))())("], ["((((((()((()((()(())(()()(((())))())(()))()(()())()())())())(())("], ["((((((()((()(()(()))()(())(()(()((()(()(())())()((())))((()))(())())(()))()))(())))()(()())((((((((()((()(()()())())())))))))))))((()))())("], ["(((((()((()(()(())())((((((())((()((()((((((())()(()(()))))(())())(()))((())))())(())())()))())(()(())()()()(((())))())((()))()((()()))())(()))))))((()(()((())()(()(()))))())))))))))"], ["((((((()((((((((()((()(()())()))))))())(()))())()()(()(())("], ["(((((((()((()(()(())())(((((((()((()(()(())())()))))))))))((()))(())()(()))(()(())(())())())))))))"], [")((()))))))))"], ["((((((()((()(()(())())((((((()((()(()(())())())))))))))((()))(((((((((()(((((((()((()(()(()))())((((((()((()(()(())())()))))((()(()(())())()()()(())))("], ["((((((((()((()(()(())())(((((((()((()(()(())())())))())(((((())()("], ["((())(((((((()((()(()(()))())((((((()((()(()(())())())))()))())()())((())))"], ["(((())(())())(()))()()(()(())))((((((()((()(()(()())(((()))()))())()))))))))))((()(((((((())())())(())(())))(())(((()(()()(()(())(()()())())())))()))(())("], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())(((((()(())(()()((()(()(())())()((())))())(())))()(((((()((()(()(())()()()))))(()((((((((((()((()((((((()((()(()(())())))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()(()))()()())())(())))()()()()))())())(()((()(()(()))())((((((((()((()(()(())())())))))))))))((())))())()))))(())()))())())"], ["()(())(()()((()(()(())())()((())))())(())))()(()((((((((((()((()((((((()((()(()(())()))((((((()((()((()(())())())))))))))((()))())()())()(()(())))((((())()(())())))(((()((()(()(())())((((((()((()))((())()(((()(()((((((()(((()(()(())())((((((()((()(()(())())()))))))))))((()))())())))((()))()()())())(())))()()()()))())())"], ["(((((()((()(()(())((((((((()((()(()(())())((((((()((()(()(())())()(((((()(((()(()(())())((((((()((()(()(())())()))))))))))((())))(((())()(())()))))())(((()())()()())))()))())())(())))"], ["(()))(((((((()((()((()(())(()()(((())))())(()))()(()())()()())())(())(())())(()))()"], ["((()(((())()())())))))))()()(()(()))))((()(((((((()((()(()(())(()()())())()))))))))))((()))()))())(())))(()(()(())())"], ["(((((())(())())(()((())()(()(())))((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((())))))))))"], ["((()(((((((()((()(()(())())((((((()((()(()()())())()(((((())(())())(()))(((((((())())())))))))()()(()(())))(((()((())(()(())())((((((()((()(()(()((())()(()(())))((()(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((((((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((()))))))))))))))))((()))())(((((((()((()(()(())())((((((()((()()(())())())))))))))((((((()(((()((()(()(()))(((())(())())(()))((((((())())())))))))()()(()(())))())(((())()((()((()))))))))"], ["((((((()((()(()(())())((((((()((()(()(())())()(((((((((()((()((((((()((()(()(())())((((((()((()((()(())())())))))))))((()))())()())()(()(()))))))))))))((()("], ["((((((()((((((()((()(()(())())((((((()((()(()(())())())))))))))((()())()(()(()))))(())())(()))((())))())(())())())(()()))()))("], ["())()(()())))"]], "completion": "\ndef correct_bracketing(brackets: str):\n \"\"\"Return True if every opening bracket has a corresponding closing bracket.\"\"\"\n stack = []\n for bracket in brackets:\n if bracket == '(':\n stack.append(bracket)\n elif not stack or stack[-1] != '(':\n return False\n else:\n stack.pop()\n return not stack\n", "raw_completion": "```python\ndef correct_bracketing(brackets: str):\n \"\"\"Return True if every opening bracket has a corresponding closing bracket.\"\"\"\n stack = []\n for bracket in brackets:\n if bracket == '(':\n stack.append(bracket)\n elif not stack or stack[-1] != '(':\n return False\n else:\n stack.pop()\n return not stack\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef correct_bracketing(brackets: str):\n \"\"\" brackets is a string of \"(\" and \")\".\n return True if every opening bracket has a corresponding closing bracket.\n\n >>> correct_bracketing(\"(\")\n False\n >>> correct_bracketing(\"()\")\n True\n >>> correct_bracketing(\"(()())\")\n True\n >>> correct_bracketing(\")(()\")\n False\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/62", "prompt": "\n\ndef derivative(xs: list):\n \"\"\" xs represent coefficients of a polynomial.\n xs[0] + xs[1] * x + xs[2] * x^2 + ....\n Return derivative of this polynomial in the same form.\n >>> derivative([3, 1, 2, 4, 5])\n [1, 4, 12, 20]\n >>> derivative([1, 2, 3])\n [2, 6]\n \"\"\"\n", "entry_point": "derivative", "canonical_solution": "\n\n return [xs[i] * i for i in range(1, len(xs))]\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate([3, 1, 2, 4, 5]) == [1, 4, 12, 20]\n assert candidate([1, 2, 3]) == [2, 6]\n assert candidate([3, 2, 1]) == [2, 2]\n assert candidate([3, 2, 1, 0, 4]) == [2, 2, 0, 16]\n assert candidate([1]) == []\n\n", "contract": "\n assert len(xs) > 0, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) in (int, float) for x in xs), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[3, 1, 2, 4, 5]], [[1, 2, 3]], [[3, 2, 1]], [[3, 2, 1, 0, 4]], [[1]]], "atol": 0, "plus_input": [[[0, 0, 0, 0, 0, 5]], [[1, 0, 0, 0, 0, 0, 0]], [[0, 2, 0, 3, 0, 4, 0, 5]], [[0, 0, 0, 6, 0, 0, 0, 7, 0, 0, 0, 8, 0]], [[0, 0, 0, 0, 0]], [[1, 0, -2, 0, 5, 0, 0, 10]], [[2, 0, 3, 0, 1, 0, 0, -2, 0, 6]], [[1, -1, 1, -1, 1, -1, 1]], [[4, 0, 1, 0, 4]], [[6, 2, 0, 7]], [[0, 0, 0, 0, 0, 0]], [[0, 2, 0, 0, 4, 0, 5]], [[2, 0, 3, 0, 1, 0, 0, -2, 0, 6, 0]], [[0, 0, -1, 0, 0, 0, 0]], [[2, 0, 3, 0, 1, 1, 0, -2, 0, 6, 0]], [[0, 1, 0, 0, 0, 0, 0, 0]], [[4, 0, 1, 0, 4, 0]], [[0, 0, 0, 6, 0, 0, 0, 1, 7, 0, 0, 0, 8, 0]], [[1, 0, -2, 5, 0, 0, 1]], [[0, 0, 0, 6, 0, 0, 0, 0, 1, 7, 0, 0, 0, 8, 0]], [[0, 0, 6, 0, 0, 0, 0, 0, 1, 7, 0, 0, 0, 8, 0]], [[4, 0, 0, 1, 0, 4]], [[0, 0, 0, 0, 0, 0, 5]], [[-1, 4, 0, 0, 1, 0, 4]], [[0, 0, 0, 6, 0, 0, 0, 0, 7, 0, 0, 1, 8, 0]], [[0, 0, 0, -1, 6, 0, 0, 0, 7, 0, 0, 8, 0]], [[2, 0, 0, 0, 5]], [[2, 0, 3, 0, 1, 1, 0, -2, 0, 0]], [[0, 7, -1, 0, 0, 0, 0]], [[6, 2, 7]], [[7, -1, 0, -1, 0]], [[0, 0, 0, -1, 0, 0, 5]], [[7, 0, 7]], [[0, 1, -2, 0, 0, 0, 5, 0]], [[2, -2, 0, 0, 0, 5]], [[0, 0, 0, 6, 0, 0, 0, 0, 7, 0, 0, 1, 8, 0, 0]], [[0, 1, 0, 0, 0, 0]], [[2, 0, 3, 0, 1, 0, 0, -2, 0, 6, 0, 0]], [[1, 0, 1, 0]], [[1, 0, 1, 0, 1]], [[0, 3, 0, 1, 1, -2, 0, 6, 0]], [[4, 0, 1, 8, 0, 4, 0]], [[0, 0, 0, 0, 0, 0, 5, 0]], [[6, 2]], [[7, -1, 8, -1, 0]], [[6, 0, 0, 0, 6, 0, 0, 0, 0, 1, 7, 0, 0, 0, 8, 0]], [[2, 0, 4, 3, -2, 0, 1, 1, 0, -2, 0, 6, 2, 0]], [[8, 4, 0, 0, 1, 0, 4]], [[0, 0, 0, 0, 0, 5, 0, 0]], [[0, 2, 0, 3, 0, 4, 5]], [[2, 0, 3, 0, 1, 1, 1, 0, -2, 0, 6, 0]], [[0, 7, -1, 0, 0, 0]], [[0, 0, 0, 0, 0, 10]], [[2, 0, 3, 0, 1, 1, 1, 0, -2, 0, 6, 0, 0]], [[0, 2, 0, 8, 3, 0, 4, 0, 5]], [[0, -1, 0, 0, 6, 0, 0, 0, 0, 7, 0, 0, 1, 8, 0, 0]], [[0, -1, 0, 0, 6, 0, 0, 0, 0, 7, 0, 1, 8, 6, 0, 0]], [[7, -1, 4, -1, 0]], [[0, 0, 0, 6, 0, 0, 0, 0, 1, 7, 0, 0, 0, 8]], [[7, 4, -1, 0, -1, 0]], [[2, 0, 3, 0, 1, 1, 0, -2, 0, 0, -2]], [[0, 0, 0, 0, 0, 11]], [[7, -1, 0, 6, -1, 0]], [[2, -1, 3, 0, 1, 0, 0, -2, 0, 6, 0, 0]], [[0, 1, 0, 0, 0, 0, 0]], [[1, 0, -2, 0, 5, 0, 10]], [[-1, 0, 1, -1, 1, -1, 1, 1]], [[6, 2, 7, 6]], [[0, 0, 6, 0, 0, 0, 0, 1, 7, 0, 0, 5, 8, 0, 0]], [[2, 0, 3, 0, 1, 1, 6, -2, 0, 0, -2]], [[0, 0, 0, 6, 0, 0, 6, 0, 0, 1, 7, 0, 0, 0, 8]], [[0, 0, 1, 0, 4]], [[0, 0, 6, 0, 0, 0, 0, 1, 7, 0, 0, 5, 8, 0]], [[1, -1, 1, -1, 1, -1, 1, -1]], [[0, 3, 0, 1, 1, 0, 6, 0]], [[0, 1, 6, 4, 0]], [[0, 1, 0, 4]], [[7, 3, -1, 0, 6, -1, 0]], [[0, 1, 6, 4, 0, 0]], [[-2, 0, 1, 0]], [[0, 2, 0, 0, 4, -1, 5]], [[0, 0, -1, 0, 0, 0, 0, 0]], [[7, 11, -1, -1, 0, -1, 0]], [[7, 2]], [[-1, 4, 0, 0, 1, 0, 4, 0]], [[0, 0, 6, 0, 0, 0, 0, 7, 0, 0, 1, 8, 0, 0]], [[-1, 4, 0, 1, 0, 4, 0]], [[8, 0, 0, 0, 6, 0, 0, 6, 7, 0, 0, 1, 7, 0, 0, 0, 8, 7]], [[7, -2, 8, -1, 0]], [[0, 0, 0, 6, 0, 0, 0, 0, 7, 0, 0, 0, 8, 0, 7]], [[0, 3, 3, 0, 5, 1, 1, 0, 6, 0]], [[2, 0, 3, 0, 1, 1, 1, 0, -2, 5, 6, 0, 0]], [[0, 0, 0, 1, 0, 4]], [[8, 0, 0, 0, 6, 0, 0, 6, 7, 0, 0, 1, 7, 0, 0, 0, 8, 7, 0, 8]], [[4, 0, 1, 8, 0, 4, 0, 0]], [[2, 0, 0, 3, 0, 1, 0, 0, -2, 0, 6]], [[3.5, -2.8, 1.1, -4.4, 0]], [[1, -4, 0, 2.5, 6.8, 9, 10.2]], [[0, 0, 0, 0, 0, 0, 1]], [[-1, -2, -3, -4]], [[5, 3, 1, 0, -1, -3, -5, -7, -9]], [[2, 0, 3, 0, 3, 0, 2, 0, 1]], [[1.5, -2, 0, 3.14, -5, 0, 1.2, 0, -4.5, 0, 2]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[10, -25, 0, 63, -40, 0, 10, 0, 5]], [[0, 1, 0, 1, 0, 1, 0, 1, 0, 1]], [[2, 0, 3, 0, 3, 0, 2, 0]], [[0, 0, 0, 0, 0, 0, 1, 1]], [[0, 0, 0, 0, 0, 0, 0, 1]], [[-7, 3, 1, 0, -1, -3, -5, -7, -9, 3]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[10, -25, -1, 63, -40, 0, 10, 0, 5]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1]], [[9, -25, 0, -40, 0, 10, -2, 5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[-3, -25, -1, 63, -40, 0, 10, 0, 5, -1]], [[10, -25, -1, 63, -40, 0, 10, -3, 5]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, -4, -4]], [[-1, 0, -4, 0, 0, 0, 0, 0, 0, 0, 1]], [[1, -4, 0, -4.5, 6.8, 9, 10.2]], [[0, 1, 0, 1, 0, 9, 0, 1, 0]], [[0, 0, 0, 0, 0, 0, 0, 0, 1]], [[-1, 0, 0, 63, 0, 0, 0, 0, 0, 0, 1]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[-1, 0, 63, 0, 0, 0, 0, 0, 0, 1]], [[-1, 0, -4, 0, 0, -25, 0, 0, 0, 0, 1, 0]], [[1, -4, 0, -4.5, 6.8, 9]], [[0, 1, 0, 0, 1, 0, 9, 0, 1, 0]], [[1, -4, 0, -4.5, 6.135053916071352, 9]], [[1, -5, -4, 0, 2.5, 6.8, 9, 3.5]], [[3.5, -2.8, 1.1, -4.4, 0, 1.1]], [[0, 0, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1]], [[10, -1, -2, -3, -5]], [[-1, 0, -4, 0, 0, 0, 0, 0, 0, 1]], [[3.5, -2.8, 1.1, -4.4, 0, 3.5]], [[-5, 0, 0, 0, 0, 0, 0, 1, 1]], [[-1, 0, -4, 0, 0, -25, 0, 0, 0, 1, 0]], [[0, 0, 0, 0, 0, 0, -40, 0, 0, 0, 0, -25]], [[1, -4, 0, -4.5, 6.8, 9, 6.8]], [[3.5, -2.8, 1.1, -4.4, -5, 3.5, 0]], [[1, -4, 0, 63, -4.5, -4.4, 6.8]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, -7, 0, 0, 1]], [[1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[3.5, -2.8, -4.4, 0, 3.5]], [[9, -25, 0, -40, 0, 10, -40, -2, 5, 10]], [[1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0, -5, 1.1]], [[1, -4, 0, 2.5, 3.5, 9, 10.2]], [[0, 1, 0, 0, 1, 0, 9, 0, 1, 0, 0]], [[-1, -2, 1, 0, -4]], [[-7, 3, 1, 0, -1, -3, -5, -7, -8, -9, 3, -5]], [[10, -25, 0, 63, -40, -8, 10, 0, 5]], [[0, 1, 0, 1, 0, 9, 0, 1]], [[10, -25, 63, -40, 0, 10, 0, 5]], [[3.6845190419876506, 6.8, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[10, -25, -1, 63, -40, 10, -2, 5]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 2.5]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]], [[1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -7, 0, 10, 0, 1]], [[-1, 0, -4, 0, -1, 0, 0, 0, 0, 0, 1]], [[-1, 0, 63, 0, 0, 9, 0, 0, 0, 0, -1, 1]], [[63, -1, 0, 0, 63, 0, 0, 0, 63, 0, 0, 0, 1]], [[0, 0, 1, 0, 9, 1, 0]], [[-5, 0, 0, 0, -4, 0, 0, 0, 1, 1, -5]], [[1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -7, 0, 10, 0, 1, 0]], [[63, -1, 0, 0, 63, 0, 0, 0, 63, 0, 0, -8, 1]], [[1.5, 1, -2, 0, 3.4009590491925366, -5, 0, 1.2, 0, -4.5, 0, 2]], [[1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -7, 0, 10, 0, 0, 1, 0]], [[10, -25, -1, 63, -40, -5, 0, -3, 5]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2, 1.5]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, 1]], [[10, -25, 0, 63, -40, 0, 10, 0, 5, 63]], [[10, -25, -1, 63, -40, 0, 10, 0]], [[10, -25, 0, 63, -40, -8, 10, 0, 5, 5]], [[0, 1, 1, 1, 0, 9, 0, 1]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0]], [[1, -5, -4, 0, -4.5, 6.135053916071352, 9]], [[9, -5, -25, -40, 10, -2, 5]], [[0, 0, 0, 0, 0, 0, 0, 0, 1, 1]], [[10, 1, -4, 0, 63, -4.5, -4.4, 6.8]], [[-4, -25, 0, -40, 0, 10, 0, 5, -1]], [[-1, 0, -4, -1, 0, 0, 0, 0, 0, 1]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, 0]], [[-5, 0, 0, 0, 0, 0, 0, 1, 1, 0]], [[1, 0, 1, -1, 1, 0, 9, 0, 1]], [[0, -1, 0, -4, 0, -1, 0, 0, 0, 1, 0]], [[-25, 0, 63, -40, 1, 0, 10, 0, 5, 63]], [[9, -5, -25, -40, 10, -2, 0, 5]], [[-1, 0, -4, -1, 0, 0, 0, 0, 0, 0, 0, 1]], [[0, 1, 1, 1, 0, 9, 0, 1, 0]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0, 10]], [[-7, 3, 1, 0, -1, -3, -5, -7, -9, 3, 3, -5]], [[10, 1, 63, -40, 0, 10, 0, 5]], [[-1, 0, 0, 63, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, -25, 0, 63, -40, -8, 10, 0, -25]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, -5, 0, 0, 0, -4, 0, 0, 0, 1, -40, -5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, -7, 0, 0, 1, 0]], [[10, -25, -1, 63, -40, 0, 10, 0, 0]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, -5, 0, 0, 0, -4, 0, 0, 1, -5]], [[1, -4, 0, 3.5, 6.8, 9, 6.8]], [[10, -1, 63, -40, 0, 10, 0]], [[-1, 0, 0, 0, 9, 0, 0, 0, -1, 1]], [[-8, 5, -25, -1, 63, -40, 0, 10, 0]], [[1, -4, 0, 6.8, 9, 10.2]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, 10, 1]], [[-4, 10, 10, -1, 63, -40, 0, 10, 0, 63]], [[9, -5, -25, -2, -40, -40, 10, -2, 4]], [[10, -1, 63, 0, 0]], [[10, -25, 0, 0, 10, -40, -2, 5, 10, -40]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 1, 0, 0]], [[-1, 0, -4, -1, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[0, 0, 1, 0, 9, 1, 0, 1]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 63, 0, -7, 1, 0, 10, 0, 1, 0, 0]], [[3, 0, 3, 0, 3, 0, 2, 0, 3]], [[1, -5, -4, 0, -4, 2.5, 6.8, 9, 3.5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[-1, 0, 0, 63, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[9, -5, -25, 2, -40, 10, -2, 4]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2, 1.5, 10.2]], [[0, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, -25, 0, 63, -40, 5, 0, 10, 0, 5]], [[0, 1, 0, 0, 1, 0, 9, 0, 1, 0, 0, 0]], [[1, -1, 0, 0, 0, 0, 0, -7, 0, 1, 0]], [[0, 1, 0, -25, 1, 0, -5, -2, 9, 0, 1, 0, 0, 0]], [[-25, 0, 63, 1, 0, 10, 0, 5, 63]], [[1, 0, -4, 0, 0, 0, 0, 0, 0, 1, 0]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, 10, 0, 1]], [[2, 0, 3, 0, 3, 0, 2, 4, 0, 0]], [[9, -4, 0, 3.14, 6.8, 9, 10.2]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], [[10, -25, -1, 63, -40, 0, -3, 5, -25]], [[0, 1, 0, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 0]], [[3.6845190419876506, 6.8, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[10, -25, 0, 63, -2, -40, -8, 10, 0, -25]], [[1, -4, 0, 0, -4.5, 6.8, 9, 10.2]], [[64, -1, 0, 0, 63, 0, 0, 0, -25, 0, 0, 0, 1]], [[10, -26, -1, 63, -40, -1, 10, -3, 5]], [[-7, 3, 0, -1, -3, -5, -7, -5, -9, 3, 3]], [[0, 1, 0, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 0, 1]], [[0, 0, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1, 0]], [[10, -25, 0, 63, 6, -40, 0, 10, 0, 5, 63]], [[0, 1, 0, 0, 1, 0, 9, 0, 1, 1, 0, 0]], [[-3, -25, -1, 63, -40, 0, 10, 0, -26, -1, -40]], [[1, -4, 0, 2.5, 6.8, 9, 6.269394727218306]], [[9, 5, -5, -25, -40, 10, -2, 0, 5]], [[-1, 0, -2, 0, 0, 9, 0, 0, 0, -1, 0, -1, 1]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 1, -7, 0, 0, 1, 0]], [[9, -25, 0, -40, 0, 10, -40, -2, 5, 10, 0]], [[1, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, 1, 0]], [[2, 0, 3, 0, 3, 0, 2]], [[-4, -25, 0, -40, 0, 0, 5, -1]], [[-5, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0]], [[0, 0, 0, 0, 0, 4, 0, 1]], [[1, 0, 0, -1, 0, 0, 5, 0, 63, 0, 0, 63, 0, -7, 0, 63, 0, 1]], [[3.5, -2.8, 1.1, -4.4, 0, 3.5, 0]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 6, 0, -7, 1, 0, 10, 0, 1, 0, 0]], [[-5, 0, 0, 0, 0, 0, 0, 1]], [[-5, 0, 0, -8, 0, 0, 0, 1, 1, 0, 0]], [[3.5, -2.8, 1.1, -4.4, 0, 3.5, 3.5]], [[0, 0, 0, 0, 0, 0, 0, 0, -5, 0, 1]], [[3.6845190419876506, 6.8, -2.413995463147514, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[0, 1, 0, 0, 1, 0, 9, 0, 1, 1, 0, 0, 1]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, 4, -25, 0, 63, -40, -8, 10, 0, -25]], [[10, -24, -40, -1, 10, 63, -40, 0, 10, -3, 5]], [[3.5, -2.8, 1.1, -4.4, 0, 3.0619344202870824, 3.5, 3.5, -2.8]], [[1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, -5, 1.1]], [[10, -25, 0, 63, -40, 5, 0, 10, 0, 1, 5]], [[1, -4, 0, 2, -4.5, 6.8, 9, 10.2]], [[0, 1, 1, 1, 0, 9, 0, 1, -1]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, -7, 0, 10, 0, 1]], [[1, 0, 0, 1, -1, 1, 0, 9, 0, 1]], [[9, -4, -4, 3.14, 6.8, 9, 10.2]], [[1, -4, 0, 3.5, 6.8, 9, 6.8, 6.8]], [[9, 5, -5, -25, 10, -2, 0, 5]], [[-5, 0, 0, 0, 0, 0, 0, -24]], [[0, -24, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1]], [[3.5, -2.8, 1.1, -4.4, 0, -4.4]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2, 1.5, 6, 10.2]], [[0, 1, 0, -2, 1, 0, 9, 0, 1, 0, 1, 1]], [[-9, 0, -4, 0, 0, -25, 0, 0, 0, 1, 0]], [[-39, -8, 5, -25, -1, 63, -40, 0, 10, 0]], [[1, -5, -4, 0, 2.5, 6.8, 9, 3.5, 3.5, 3.5]], [[9, 5, -5, -25, 10, -2, 0, 5, -5]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 63, 0, -7, 2, 0, 10, 0, 1, 0, 0, 0]], [[1, 0, 0, -1, 0, 10, 0, 0, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0]], [[3.6845190419876506, 6.8, 6.8, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[9, 5, -5, -25, -40, -2, 0, 5]], [[-7, 3, 1, 0, -3, -5, -7, -9, 3, 3, -5]], [[1, -4, 0, 63, -4.5, -2.413995463147514, 6.8]], [[10, -25, -1, 63, -40, 0, 11, 0]], [[0, -8, 0, 0, 1, 0, 9, 0, 1, 0, 0, 0]], [[0, 0, 0, 63, 0, 0, 0, 0, 0, 1]], [[-4, 10, 10, 0, 63, -40, 0, 10, 63]], [[-3, -26, -1, 63, -40, 0, 10, -8, -26, -1, -40]], [[-1, -2, -3, -4, -3, -3]], [[-1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]], [[5, -2, 1, 0, -1, -3, -5, -7, -9]], [[1, -4, 0, 63, -4.5, -2.413995463147514, 3.4009590491925366]], [[0, 1, 0, 1, 0, 9, 0, 1, 1, 1, 0]], [[0, -39, 0, 0, 0, 0, 1]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]], [[-1, 0, 0, 0, 9, 0, 3, 0, 0, -1, 1]], [[3.5, -2.8, 1.1, -4.4, 0, 3.0619344202870824, 3.5, 1.8861584708109862, -2.8]], [[-4, -25, 0, -40, 0, 5]], [[9, 0, -40, 0, 10, -2, 5]], [[10, -25, 0, 63, -40, 0, 10, 0, 64, 5, 10, 10]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, -39, 1, 10, 1]], [[0, 1, 0, 0, 9, 0, 1, 1, 1, 0]], [[10, 4, -25, 0, 63, -40, 2, 10, 0, -25]], [[-1, -2, -3, -4, -1]], [[-1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 1, 0]], [[9, 5, -5, -25, 10, -2, 0, 5, -5, 5]], [[0, 1, 0, 1, 0, 0, 1, 1, 1]], [[-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[3.5, -2.8, 1.1, -4.4, 0, -4.4, 3.5]], [[-25, 0, -40, 1, 0, 64, 0, 5, 63, 0]], [[0, 1, -3, 0, 1, 0, 1, 1, 1, 0]], [[0, 1, 1, 1, 0, 0, 1]], [[0, 0, 0, 0, 9, 1, 0]], [[1, 0, 0, -1, 0, 0, 5, 0, 63, 63, 0, 0, 63, 0, -7, 0, 63, 0, 1]], [[0, 1, 0, 1, -1, 9, 0, 1, 0, 1, 10, -1, 1]], [[10, -25, 0, 63, -40, -8, 10, 0, 5, 5, 10]], [[-1, 0, -2, 0, 0, 9, 0, 0, 0, 0, 0, -1, 1]], [[9, -5, -25, -40, 10, 5]], [[3.5, -2.8, 1.1, -4.4, 1.1]], [[-2.8, 1.1, -4.4, 0, -4.4]], [[1, -5, -4, 0, 2.5, 6.8, 9, 3.5, 2.5]], [[9, -25, 0, -40, 0, 10, -40, -2, 10]], [[1, -4, 2, 2.5, 6.8, 9, 10.2, 1.5, -4, 11.093256507253008, 10.2, 1.5]], [[-1, 0, -4, 0, 0, 0, 0, 0, 0, 0, 0, 1]], [[1, -5, -4, 0, -4.5, 6.135053916071352]], [[-39, -8, 5, -1, -25, -1, 63, -40, 0, 10]], [[-5, 4, 0, 0, 0, 0, 0, 0, 1]], [[-2.8, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, -5, 1.1, -5]], [[1, 0, -4, 0, 0, 0, 0, 0, 0, 1, 0, 0]], [[-1, 0, -2, 0, 9, 0, 0, 0, -1, 0, -1, -4]], [[-1, 0, -4, 0, 0, 0, 0, 0, 1, -4]], [[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1]], [[-2.8, 1, -4, 0, 3.5, 6.8, 6.8]], [[-4, 0, 3.5, 6.8, 9, 6.8, 6.8]], [[-1, 0, -4, 0, 11, -25, 0, 0, 0, 1, 0]], [[-1, 0, -4, 0, -1, 0, 0, 0, 0, 0, 1, 1]], [[0, 1, 63, 0, 0, 0, 0, 0, 1]], [[5, 3, 0, -1, -3, -25, -5, 10, -7, -9]], [[-1, 0, -4, -1, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1]], [[-26, -5, -25, -40, 10, 5]], [[1, -1, 0, 0, 0, 0, 0, 0, 1, -7, 0, 0, 1, 0]], [[0, 6, 0, 0, 0, 0, 0, -40, 0, 0, 0, 0, 0, 1, 0]], [[0, 1, 0, 1, 0, 9, 0, 1, 0, 1, -7, 1]], [[-3, -25, -1, 63, -40, 0, 10, 0, 5, -1, 63]], [[10, 4, -25, 63, -40, -8, 10, -25, 1, -25]], [[1, 0, 63, -4.5, -4.4, 6.8]], [[-4, -25, 0, -40, 0, 0, -1, 5, -1]], [[10, -25, -1, 63, -40, 0, 9, 10, 0, 5]], [[1, -1, 0, 0, 1, 0, 0, 0, -3, -7, 0, 0, 1, 0]], [[0, 0, -1, 0, 0, 0, -40, 0, 3, 0, 0, 0, -25]], [[-3, -26, -1, 63, -40, 0, 10, -8, -26, -1, -40, 63, -1]], [[0, 0, 0, 0, 0, 0, 0, -5, 0, 1]], [[-1, 0, -4, 0, 0, 0, 0, 0, 1]], [[10, -25, -1, 63, -40, -5, 0, -3, 4]], [[10, -25, 0, 63, -40, 0, 10, 62, 0, 5]], [[10, 1, 63, 0, 9, 0, 5, -40]], [[-1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 1, 3, 0]], [[0, 2, 1, 1, 0, 9, 0, 1, 0]], [[-3, -25, -1, 63, -40, 0, 10, 0, -26, -1, -40, 63]], [[10, -25, 0, 63, -40, 0, 10, 0, 5, 10, 10]], [[0, 1, 1, 1, 0, 9, 0, 1, 11, -1]], [[-1, 0, 63, 0, 0, 9, 0, 1, 0, 0, 0, -1, 1]], [[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]], [[5, 3, 1, 0, -1, -3, -5, 62, -9]], [[0, 1, 0, -2, 1, 0, 9, -4, 0, 1, 0, 1, 1]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1]], [[0, 1, 0, 0, 9, 0, 1, 1, 1, 0, 0]], [[3.5, -2.8, 1.1, 0, 3.5]], [[10, -25, 62, -2, -40, 0, 10, 0, 5]], [[-5, 0, 0, -8, 1, 0, 0, 1, 1, 0, 0]], [[10, -25, -1, 63, -40, 0, 10, 0, 0, 10, 10]], [[1, -4, -4.5, 6.8, 9, 6.8, -4.5]], [[3.6845190419876506, 6.8, 6.8, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0, 3.5]], [[10, -24, -40, -1, 10, 63, -24, -40, 0, 10, -3, 6]], [[1, -1, 0, 0, 0, 0, -24, 0, 0, -7, 0, 0, 1]], [[-1, -5, 4, 0, 0, 0, 0, 0, 0, 1]], [[64, 9, -25, 1, -1, 63, 0, -3, 5, -25]], [[1, -1, -40, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[1, 0, -1, 0, 0, 0, 0, 0, 0, -7, 0, 10, 0, 1, 0]], [[-1, 0, -4, 3, 0, 0, 0, 0, 1, -4]], [[0, 1, -3, 0, 1, -1, 1, 1, 1, 0, 1]], [[-1, 0, 63, 0, -1, 0, 0, 0, 0, 1, 0]], [[-1, 0, 63, 0, 0, 0, 0, 0, 1, 1]], [[63, -1, -1, 0, 63, 0, 0, 0, 63, 0, 0, -8, 1]], [[9, -5, -25, 2, -40, 10, -2, 4, 9]], [[1, -1, -1, -40, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[3, -4, -25, 0, -40, 0, 0, 5, -1]], [[10, -25, 0, 10, -40, -2, 5, 10, -40]], [[-5, 1, 0, 0, 0, 5, 0, 1, 0, 0]], [[1, 0, 0, -1, 4, 0, 0, 5, 0, 63, 63, 0, 0, 63, 0, -7, 0, 63, 0, 1, 1]], [[0, 0, 0, 0, 0, 1, 1]], [[0, 1, 0, 1, 0, 9, 0, -3, 0, 1, 1, 0]], [[3.5, -2.8, 1.1, 0, -4.4, 0, 3.5, 0]], [[3.6845190419876506, 1, -5, -4, -4.5, 6.135053916071352]], [[2, 3, 0, 3, 0, -9, 2, 0]], [[5, 10, -25, 0, 63, -40, 0, 10, 0, 5, 10, 10, 63]], [[10, -24, -40, -1, 10, 63, 2, -40, 0, 10, -3, 6]], [[9, -25, 0, -40, 0, 10, -40, -2, -24, 10]], [[10, -25, -1, 63, -40, 0, 4, 5, -25, -1]], [[10, -25, 0, 63, -40, 10, 62, 0, 5]], [[1, -39, 3, 0, 3, 0, 2, 4, 0, 0]], [[-1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 1, 3, 1]], [[0, 3, -5, 1, 0, 0, 9, 0, 1, 1, 1, 0]], [[-5, -1, 0, -4, 0, 0, 0, 0, 0, 1, -4]], [[3.5, -2.8, 1.1, 0, -4.4, 0, 3.5, 0, 1.1]], [[0, 1, 0, 1, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 0, 1, -5]], [[-1, 0, 0, -1, 0, -1, 0, -1, 0, 0, 1, 3, 1, 1]], [[-25, 0, 63, -40, 1, 0, 0, 5, 63]], [[9, -39, -25, 0, -40, 0, 10, -2, 5]], [[1, 0, 0, -1, 0, 10, 0, 0, 0, 0, 63, -1, -7, 0, 10, 0, 1, 0]], [[5, 3, 0, -1, -3, -25, -25, -7, -9]], [[9, 5, -5, -25, 10, -2, 0, 11, 5, -5]], [[10, -25, 5, 63, -40, 0, 10, 0, 5]], [[0, 11, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1, 0]], [[10, -2, -25, 0, 63, -40, 0, 10, 0, 5, 63]], [[1, -1, -40, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[1, -4, 0, 6.8, 9, 10.2, -4]], [[2, 4, 0, 3, 0, 3, 0, 2, 0, 1]], [[0, 0, 0, 0, 4, 0, 1]], [[5, 10, -25, 0, 63, -40, 0, 10, 0, 5, 10, 10, 63, 10]], [[10, 5, -1, 63, -5, 0, -3, 5]], [[10, -25, 0, 63, -40, 5, 0, 10, 0, 1, 5, 1]], [[0, 2, 1, -9, 1, 0, 9, 0, 1, 0]], [[10, -25, -1, 63, -40, 0, 10, -3, 5, -3]], [[63, -1, 0, 0, 63, 0, 0, 0, 63, 0, 0, 64, -8, 1]], [[-1, 2, 0, 63, 0, 0, 0, 0, 0, 1, 1]], [[10, -25, -1, 63, -40, -5, 0, -3, 4, -25]], [[0, 0, 1, 0, 0, 0, 1, 1, 0]], [[10, -26, -1, 63, -40, -1, 10, -3, 5, -26]], [[9, -39, -25, 0, -40, 0, 10, -2, 5, -2]], [[10, -25, 63, -40, 0, 10, -1, 5]], [[-7, 3, 1, 0, -1, -3, -5, -8, -9, 3, -5]], [[10, 1, 63, -40, 0, 10, 0, 5, 0]], [[0, 64, 1, -3, 0, 1, -1, 1, 1, 1, 0, 1]], [[0, 1, 0, 9, 1, 0, 1]], [[0, 1, 0, 0, 9, 0, 1, 1, 1, 0, 0, 0]], [[9, -5, -25, -40, 10, 5, -25]], [[-1, 0, 0, 0, -25, 0, 0, 1, 0]], [[5, 3, 1, 0, -1, -3, -5, -7, -9, 5]], [[1, 0, 0, -1, 0, 0, 1, 0, 0, -5, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0]], [[1, -4, 0, 62, -4.5, -2.413995463147514, 3.4009590491925366]], [[-1, 0, 0, 0, 0, 0, 1, 1]], [[-1, 1, 0, -4, 0, 0, 10, 0, 0, 0, 1, 0]], [[0, 0, 0, 1, 0, 9, 0, 1, 0, 1, 10, 0, 1]], [[0, 1, 0, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 1, 0]], [[2, 4, 0, 3, 0, 3, 0, 2, 0, 1, 2]], [[10, -26, -1, 63, -40, -1, -3, 5, -26]], [[3.5, -2.8, -4.4, 10.2, 3.5, 10.2]], [[0, -4, 0, 0, -25, 0, 0, 0, 0, 1, 0]], [[-1, 0, -4, -1, 0, 0, 0, -7, 0, 1, 0]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 1, -7, 0, 0, 1, 0, 0]], [[0, 4, 0, 0, 0, 1, 1]], [[3.6845190419876506, 6.8, -2.413995463147514, -39, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -5, 3.5, 0]], [[0, 0, -1, 4, 0, 0, 5, 0, 63, 63, 0, 0, 63, 0, -7, 0, 63, 0, 1, 1]], [[3.5, -2.8, 1.1, -4.4, 1, 1.1, -4.4]], [[0, 11, 0, 0, 0, 0, -40, 0, 0, 0, 0, 11, 1, 0]], [[0, 1, 0, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 0, 1, -25]], [[10, 1, 0, 1, 0, 9, 0, 1, 0, 1, 1, 1]], [[-1, 0, 63, 0, 0, 0, -4, 0, 0, 1]], [[10, 5, -1, 63, -5, -3, 5]], [[10, -24, -40, -1, 10, 63, -24, 64, -40, 0, 10, -3, 6]], [[-25, 6, -8, 0, 63, 1, 0, 10, 0, 5, 63]], [[-4, 0, 3.5, 6.8, 9, 6.8, 6.8, 6.8]], [[10, -25, -40, -1, 10, 63, -24, -40, 0, 10, -3, 6]], [[10, -25, 0, 63, -40, 5, 0, 10, 0]], [[1, -4, -4.5, 6.8, 9, -5, 6.8, -4.5]], [[0, 1, 0, 1, 0, 9, 2, 0, 1]], [[-1, 0, 0, 63, 9, 0, 0, 0, 0, 0, 1, 0]], [[-7, 3, 1, 0, -1, -3, -5, -8, -9, 3, -5, 0]], [[-25, 0, 63, -40, 0, 10, 0, 64, 5, 10, 10]], [[9, 5, -5, 10, -2, 0, 0, 11, 5, -5]], [[-1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 3, 0]], [[-25, 0, 63, -40, 1, 0, -26, 0, 5, 63]], [[0, 0, 0, 0, 4, 1]], [[10, -25, 0, 0, 10, -40, -2, 5, 10, -40, 10]], [[0, 0, 1, -1, 0, 0, 1, 1, 1, 0]], [[1, 0, 1, 0, 9, 0, 1, 0, 1, 10, 1]], [[-2.8, 3.5, 10.2, -2.8, 1.1, -4.4, -4.5, -5, 3.5, -5, 1.1, -5]], [[1, -4, 0, 62, -4.5, -2.413995463147514, 3.4009590491925366, 0]], [[1, -4, 0, 6.135053916071352, 2.5, 3.14, 9, 10.2, 2.5]], [[10, -25, 0, 63, -40, -8, 0, 5, 5, 10]], [[0, 2, 0, 0, 0, 1, 1, 0]], [[-5, 0, 0, 0, -4, 0, 0, -1, 1, 1, -5]], [[0, 0, 0, 0, 0, 0, 1, 0]], [[0, 1, 1, 0, 9, 0, 1]], [[0, 1, 0, 1, 0, 1, 1, 0, 1]], [[-1, 0, -4, 0, 0, 0, -1, 0, 0, 0, 1, 0]], [[-1, 0, 63, 0, 0, 0, 0, 1, 1]], [[-1, 0, 0, 0, -1, 0, 1, -39]], [[-1, 0, 0, -1, 0, 0, 0, 1, 0]], [[0, 1, 0, 9, 1, 0, 1, 1]], [[10, -25, 0, 63, -40, 0, 10, 0, 1, 5, 10, 10]], [[-3, 9, -25, 0, -40, 0, 10, -40, -24, -2, 10]], [[0, 1, -1, 0, 0, 0, 0, 0, 0, 0, -9, -7, 0, 1, 0, 0]], [[10, -24, -40, -1, -39, 10, 63, 2, -40, 0, 10, -3]], [[-1, 0, 0, 0, -25, 0, 0, -40, 0]], [[3, 3, 0, 3, 0, 2, 0, 3, 0]], [[5, 3, 1, 0, -1, -3, -5, 62, -26, 62]], [[5, 3, 4, 0, -1, -3, -5, -7, -9]], [[10, -25, 0, 63, -40, 0, 10, 0, 5, 63, 0]], [[10, -25, 0, 63, -40, 0, 10, 0, 5, 10]], [[63, -1, -1, 0, 0, 63, 0, 0, 0, 63, 0, 0, -8, 1, 0]], [[1.5, -2, 0, 3.14, -5, 0, 1.2, 0, -4.5, 0, 2, 2, 0]], [[0, 62, -24, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1]], [[10, -1, -1, 63, 0]], [[1, 2, 2.5, 6.8, 9, 10.6640235766586, 10.2, 1.5, -4, 11.093256507253008, 10.2, 1.5]], [[0, 1, 1, 4, 0, 0, 1]], [[1, -4, 0, 6.135053916071352, 2.5, 3.14, 9, 10.2, 2.5, -4]], [[0, 9, 0, 1, 0, 9, 0, 1, 1, 1, 0]], [[1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 1]], [[1, -1, 0, 0, 0, 0, 0, 0, 1, -7, 0, 1, 0]], [[-1, 1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 1, 0]], [[5, 10, 1, -1, -3, -5, 62, -26, 62]], [[0, 1, 0, -1, 0, 0, 0, -40, 0, 3, 0, 0, -25]], [[10, 4, -26, -25, 63, -40, -8, 10, -25, 1, -25, -25]], [[0, 62, -24, 0, 0, 0, -40, 0, 0, 0, 0, 1]], [[0, 1, -1, 1, 0, 9, 0, 1, 0, 1, 1, 0]], [[1, 3.14, -4, 0, 63, -4.5, -4.4, 6.8]], [[-5, 1, 3.14, -4, 63, -4.5, -4.4, 6.8]], [[-4, -25, 0, -40, 0, -26, 5]], [[0, 0, -1, 0, 0, 0, 0, -40, 0, 0, 0, 3, 0, -25, -40]], [[-5, 0, 0, -8, 1, 0, 0, 1, 1, 0, 2]], [[-1, 0, 63, 0, 0, 0, 0, 0, 1, 0]], [[-1, 0, 0, 63, 9, 0, 0, 0, 0, 0, 0, 1, 0]], [[3, 3, -1, 3, 0, 2, 0, 3, 0]], [[9, -25, 0, -40, 0, 10, -40, -2, 5, 10, 0, 10]], [[0, 0, 0, 0, 0, -40, 0, 0, 0, 0, 1, 0]], [[1, 1, 0, 1, 0, 9, 0, 1, 2, 0, 1, -7, 0, 10, 0, 1]], [[1, -1, 0, 0, 0, 0, -24, 1, 0, 0, -7, 0, 0, 1]], [[-3, 9, -25, 0, -40, 10, -40, -24, -2, 10]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2, -4]], [[3.5, -2.8, 1.1, 3.5]], [[3.6845190419876506, 6.8, -2.413995463147514, 3.5, -2.8, -4.4, -4.5, -5, 3.5, 0, 6.8]], [[1, 0, -1, 0, 0, 0, 0, 0, 1, 0, -7, 0, 10, 0, 1, 0, 0]], [[3.6845190419876506, 6.8, 3.4009590491925366, 1.8861584708109862, 3.5, -2.8, 1.1, -4.4, -4.5, -24, 3.5, 0]], [[0, 0, 0, 0, 0, 0, 1, 1, 0]], [[10, -25, -40, -1, 63, -40, -24, 0, -3, 5, -25, -25, -25]], [[10, -25, -1, 63, -40, 0, 9, 10, 0, 5, -40]], [[1, -4, 0, 63, -4.5, -4.4, -1, 6.8, 10]], [[10, -25, 0, 63, -40, -8, 10, -25]], [[1, 0, -1, 1, 0, 9, 0, 1, 0, 1, 10, 1, 1]], [[0, 1, 0, -7, 1, 0, 1, 1, 0]], [[-39, -8, 5, -1, -25, -1, 63, -40, -2, 0, 10, -1]], [[-2, -3, -4]], [[2, 0, 3, 0, 3, 0, 2, 0, 1, 3]], [[1, -5, -4, 0, 0, 2.5, 6.8, 9, 3.5, 2.5]], [[-1, 0, 0, 63, -2, 0, 0, 0, 0, 0, 0, 0, 1, 0]], [[0, 1, 0, 1, 0, 9, 2, 0, 1, 0, 1]], [[0, 0, 0, 0, 0, -40, 0, 0, 0, 0, -9, 0]], [[3.5, -4.4, 0, 1.1, 3.5, 0, 0]], [[3.5, 3.14, -2.8, 1.1, -4.4, 0, 3.5, 3.5]], [[10, -25, -2, -40, -40, 0, 10, 0, 5, -40]], [[1, -4, 0, 2.5, 4.179631331136455, 9, 10.2, 1.5, -4, 10.2, 10.2, 1.5]], [[0, 1, 1, 0, 9, 0, 4, 1, 11, -1]], [[1, -5, 0, 0, 0, 0, 0, 0, 1, 1, 0]], [[9, -25, 0, -40, 0, 9, -40, -2, 10]], [[0, 1, 0, 1, 0, 9, 0, 1, -1, 0, 1, 1, 0]], [[10, 9, -25, 0, 63, -40, -8, 10, -25]], [[10, -2, -25, 0, 63, -40, 0, 10, 0, 5, 63, -40]], [[-1, 0, 63, 0, -1, 11, 0, 0, 0, 0, 1, -9, 0]], [[5, 0, 1, 0, 1, -25, 1, 0, -5, -2, 9, 0, 1, -25, 0, 0, 1, -5]], [[1, -4, 0, -4.5, 6.8]], [[9, 5, -5, -25, -40, 0, 5]], [[10, -24, -40, -1, -25, 10, 63, 2, -40, 0, 10, -3]], [[0, 9, 0, -40, 1, 0, 9, 0, 1, 1, 1, 0]], [[3.5, 3.14, -3.2166840946843234, 1.1, -4.4, 0, 3.5, 3.5]], [[0, 0, 1, 0, 9, 0, 1, 0]], [[10, -25, -1, 63, 0, 4, -25]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, -5, 0, 1]], [[1, -4, 0, 2.5, 6.8, -4, 9, 10.61599760044726, 10.2, -4, -4]], [[1, 0, 0, -1, 0, 0, 0, 0, 0, 63, 0, -7, 0, 10, 0, 1, 0]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 1.5, -4, 10.2, 10.2, -4, -4]], [[-2.8, 1.1, -4.4, -4.4]], [[10, -24, -1, 63, -40, -5, 0, -3, 4, -25, -25]], [[1, -1, -1, -1, -40, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]], [[-1, -2, 1, 0, -4, -1, -1]], [[4, 10, -25, -1, 63, 11, 0, -3, 5, -25]], [[0]], [[1, 0, 0, 0, 0]], [[1, -1, 1, -1, 1, -1]], [[0, 0, 0, 0]], [[0, 0, 0, 1]], [[1, 1, 1, 1, 1, 1, 1]], [[1, 0, 0]], [[1, 1, 1, 1, 1, 1, 1, 0]], [[1, 0, 1, 0, 1, 0, 1, 0, 1]], [[0, 0, 0, 0, 0, 0, 0, 0, 0]], [[0, 2, 1, 1, 0, 1, 0, 1]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 0]], [[10, -25, 0, 5, 63, -40, 0, 10, 0, 5]], [[-40, -2, -3, -4]], [[-9, 3, 1, 0, -1, -3, -5, -7, -9]], [[3, 2, 1, 0, 1, 0, 1]], [[-40, -2, -25, -4]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1]], [[0, 2, 1, 1, 0, 1, 0, 1, 1]], [[-1, -2, -4]], [[0, 1, 0, -7, 1, 1, 0, 1, 0, 1]], [[11, -25, 0, 5, 63, -40, 0, 10, 0, 5]], [[11, -25, 0, 5, 63, 0, 10, 0, 5, 11]], [[-9, -9, 3, 1, 0, -1, -5, -7, -9]], [[10, -25, 0, 5, 63, -40, 0, 10, 0, 5, -40, -40]], [[1, -4, 0, 2.5, 7.7663698979753315, 9, 10.2]], [[11, -5, 0, 5, 63, 0, 10, 0, 5, 11, 0]], [[10, -25, 0, 63, -40, -1, 10, 0, 5, -40]], [[1, 2, 1, 1, 0, 1, 0, 1, 1]], [[1, -4, 0, 10.2, 6.8, 9, 10.2]], [[10, 3, 1, 0, -1, -3, -5, -7, -9]], [[5, 3, -10, 1, 0, -1, -3, -5, -7, -9]], [[3, 3, 1, 0, 1, 0, 1]], [[1, -4, 0, 2.5, 7.7663698979753315, 9]], [[3, 3, 2, 2, 0, 1, 0, 1]], [[-7, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1]], [[11, -5, 6, 0, 5, 63, 1, 10, 0, 5, 11, 0]], [[-7, 0, -1, 0, -4, 0, 0, 0, 0, 0, 1]], [[0, 1, 0, -7, 1, 1, 0, 0, 1]], [[3, 3, 1, 10, 2, 0, 1, 0, 1, 2]], [[0, -5, 1, 1, 0, 1, 0, 1, 1]], [[1, -4, 0, 0, 10.2, 6.8, 9, 10.2]], [[-1, -3, -2, -3, -4]], [[-40, -5, -2, -25, -4]], [[0, 1, 0, -7, 1, 1, 0, 1]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 6.8]], [[1, 5, -4, 0, 0, 10.2, 6.8, 9, 10.2]], [[0, 1, 0, 1, 0, 1, 0, 1, -1, -5, 1]], [[0, 2, 1, 1, 0, 1, 0, 1, 0]], [[1.5, -2, 4.398225143948116, 0, 3.14, -5, 0, 1.2, 0, -4.5, 0, 2]], [[9, 2, 0, 3, 0, 3, 0, 2, 0, 1, 3, 0]], [[2, 3, 0, 0, 2, 0, 1]], [[0, 2, 1, 1, 0, 1, 3, 1, 0]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0]], [[10, -1, -3, -2, -3, -4, -3]], [[0, 2, 1, 1, 0, 0, 1, 0]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -9]], [[1, 2, -4, 0, 2.5, 7.7663698979753315, 9]], [[0, 0, -1, 0, 0, 0, 0, -10, 0, 0, 1]], [[-1, 2, 1, 1, 3, 1, 0]], [[-3, 2, 1, 1, 3, 1, 0]], [[3, 3, 1, 0, -9, 1, 0, 1, 1]], [[1, 2, 1, 1, 0, 1, 0, 3, 1, 1, 1]], [[2, 1, 3, 0, 3, 0, 2, 0, 1, 3, 3]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -40]], [[3, -25, 0, 5, 63, 0, 10, 0, 11]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 0, 2.5]], [[0, 2, 1, 1, 0, 1, 0, 0]], [[1, 2, 1, 1, -1, 1, 0, 1, 0, 1, 1, 2]], [[10, 3, 1, 0, -1, -3, -5, -7, -9, -5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 1]], [[1, 2, 1, 1, 0, 1, 1, -40, 3, 1, 1, 1]], [[2, 0, 3, 0, 3, 0, 0, 1, 3]], [[2, -4, 0, 10.2, 6.8, 9, 10.2, 1]], [[-2, -2, -3, -4]], [[1, -4, 0, 0, 2.5, 6.8, 9, 10.2, 6.8]], [[1, -4, 2.5, 0, 2.5, 6.8, 9, 10.2]], [[11, -5, 0, 5, -1, 63, 0, 10, 0, 5, 11, 0]], [[-5, 1, 1, 0, 0, 1, 0, 1, 1]], [[-40, -2, -25, -4, -40]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -9, 0]], [[3.5, 1.1, -4.4, 0]], [[1, 2, 1, 0, 1, 0, 1, 1]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2]], [[9, 2, 0, 3, 0, 3, 0, 2, 0, 1, 4, 0]], [[1, -4, 0, 0, 2.5, 3, 6.8, 9, 10.2, 6.8]], [[1, 2, 1, 0, 1, 0, 1, 4, 1]], [[1, 2, 1, 1, -1, 1, 0, 2, 1, 0, 1, 1, 2]], [[10, 3, 1, 0, -1, -3, -5, -7, -9, -5, -3]], [[-9, 3, 1, 0, -1, 11, -5, -7, -9]], [[10, -1, -3, -2, -3, -3]], [[2, 0, 0, 3, 0, 2, 0, 1]], [[11, -40, -5, 0, 5, -1, 63, 0, 10, 0, 5, 11, 0]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -9, -9]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5]], [[-1, -3, -2, -5, -3, 3, -4]], [[0, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 1, 1]], [[1, 2, 1, 1, -1, 1, 0, 2, 1, 0, 1, 2, 2]], [[11, -40, -5, 0, -1, 63, 0, 10, 0, 5, 11, 0]], [[3, -25, -40, 0, 5, 63, 0, 10, 62, 0, 11]], [[-1, -2, -2, -3, -4]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5, 2]], [[3, 3, 2, 2, 0, 1, 0, 1, 2]], [[1, 2, 1, 0, 1, 0, 1, 1, 1]], [[0, 1, 0, -1, 0, 0, 0, 0, 0, 0, -1, -40, 0]], [[9, 2, 0, 3, 0, 3, 0, 6, 0, 1, 4, 0]], [[1.5, -2, 4.398225143948116, 0, 3.14, -5, 0, 1, 1.2, 0, -4.5, 0, 2]], [[-7, 0, -1, 0, 0, 0, 0, 9, 0, 1, 0, 1]], [[-1, -3, -2, -4, -1]], [[9, 2, 0, 3, 0, 3, 0, 2, 0, 1, 3]], [[10, 3, 1, 0, -1, -3, -5, -6, -9, -5]], [[-7, 0, -1, 0, 0, 0, 0, 9, 1, 0, 1]], [[0, 2, 1, 1, -1, 1, 0, 0]], [[1, -4, 0, 0, 10.2, -1, 6.8, 9, 10.2]], [[2, 1, 0, 1, 0, 1, 11, 4, 1, 0]], [[10, -25, 0, 63, -40, 0, 11, 0, 5, 5]], [[0, 0, -1, 0, 0, 0, 0, 0, 1, 0]], [[10, -25, 0, 5, 63, -40, 0, 10, 0, 5, -40, -40, 63]], [[-2, -2, -6, -4]], [[-1, -3, -2, -5, -4, -5]], [[2, -4, 0, 10.2, 9, 10.2, 1]], [[1.5, 4.398225143948116, 0, 3.14, -5, 0, 1, 1.2, 0, -4.5, 0, 2]], [[0, 1, 1, 1, 0, 1, 0, 1, 0]], [[3, 3, 2, 0, 1, 10, 0, 1, 2]], [[1, 0, -7, 1, 1, 0, 9, 0, 1]], [[-1, -3, -2, -3, -3, -4]], [[-40, -2, -25, 4, 4, -40]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5, -4.5]], [[1, 5, -4, 0, 10.2, 6.8, 9, 10.2, -4]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 9, -1, 0, 1]], [[11, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 11, 0]], [[10, 3, 1, 0, -3, -1, -3, -5, -7, -9, -5, -3]], [[11, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 11, 0, -1]], [[62, 0, 1, 0, -7, 1, 1, 0, 1, 0, 1]], [[11, 2, -5, 6, 0, 5, 63, 1, 10, 0, 5, 11, 0]], [[3, -25, 0, 5, 63, 10, 0, 11, 5]], [[-1, -6, -2, -5]], [[10, 3, 1, 0, -3, -5, -7, -9, -5, -3]], [[10, -25, 0, 5, 63, -40, 0, 10, 5, 5, -40, -40]], [[1, -4, 0, 2.5, -4, 7.7663698979753315, 9, 10.2, 2.5]], [[10, 5, 0, 5, 63, -40, 0, 10, 5, 5, -40, -40]], [[0, 2, 1, 1, 0, 1, 0, 1, 0, 1]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 6.8, 6.8]], [[-1, -6, -2]], [[-1, -6]], [[-40, -5, -1, -25, -4]], [[11, -5, 6, 0, 5, 63, 1, -1, 0, 5, 11, 0]], [[2.5, 1, -4, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5]], [[-1, -3, -2, -5, -3, 3, -1]], [[11, -40, -5, 0, -1, -1, 63, 0, 10, 0, 5, 11, 0]], [[-1, -2, -4, -2]], [[3, 1, 0, -1, -3, -5, -7, -9, -5, -3]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 0, 1]], [[0, 2, 1, 1, 0, 0, 0, 1, 1]], [[9, 2, 1, 0, 3, 0, 3, 0, 0, 2, 0, 1, 3]], [[-7, 0, 1, 0, -7, 1, 0, 1, 0, 1, 1]], [[5, 3, -10, 1, 0, -1, -5, -7, -9]], [[-40, -3, -2, -25, -4]], [[11, 2, -5, 5, 6, 0, 5, 63, 1, 10, 0, 5, 11, 0, 6, 6, 0]], [[2, 0, 0, 3, 0, 2, 0, 0]], [[0, 2, 1, -1, 0, 1, 0, 1, 2]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5, -4.5, -2]], [[-7, -25, 0, -1, 0, 0, 0, 0, 0, 0, 1]], [[11, -40, -5, 0, -5, -1, 0, 63, 0, 10, 0, 5, 11, 0, -1]], [[11, -5, 0, 5, -1, 63, 0, 10, 0, 10, 5, 11, 0]], [[0, 1, 1, 1, 11, 0, 1, 0, 1, 0]], [[11, -40, -5, 0, -1, -1, 11, 63, 0, 10, 0, 5, 11, 0, 11]], [[10, -25, 0, 63, -40, 11, 0, 5, 5]], [[-1, 5, -4, -2]], [[0, 2, 1, -1, 0, 1, 0, 1, -6, 2]], [[10, -25, 0, 5, 63, -40, 0, 10, 0, 5, -40, -40, 0]], [[9, 2, 0, 3, 0, 4, 0, 2, 0, 1, 4, 0]], [[11, -40, -5, 0, -1, -1, 11, 63, 0, 10, 0, 5, 11, 0, 11, 0, -1, -5]], [[2, -4, 10.2, -2.8, 9, 10.2, 1]], [[1, 2, 1, 1, -1, 1, 0, 2, -6, 1, 0, 1, 2]], [[0, 2, 1, 1, 0, 0, 1, 0, 1]], [[10, -25, -1, 5, 63, 9, -40, 0, 10, 0, 5, -40, -40, -5, 10]], [[0, 3, 0, 3, 0, 2, 0, 1]], [[11, -25, 0, 5, 63, -40, 0, 10, 0, 5, -40, -40, 0]], [[-1, 5, -3, -2, -4, -1]], [[10, -1, -3, -2, -3, -3, -1]], [[1, -4, 0, 2.5, 6.8, 9, 10.2, 0, 1, 1]], [[-3, -2, -5, -3, 3, -4]], [[0, 2, 9, 1, 1, 0, 1, 0, 1, 1]], [[1, 2, 1, 1, 0, 1, 3, 1, 1]], [[-2, -2, -3, -5]], [[1.5, -2, 4.398225143948116, 0, -5, 0, 1.2, 0, -4.5, 0, 2]], [[10, -25, 0, 5, 63, -40, 0, 10, 4, 0, 5, -40, -40, 0]], [[10, -25, -1, 6, 63, 9, -40, 0, 10, 0, 5, -40, -40, -5, 10]], [[2, 0, 3, 0, 3, 0, 2, -1, 1, 3]], [[1, -4, -3, 2.5, 1, 2.5, 6.8, 9, 10.2]], [[-3, -2, -4]], [[11, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 0, -1]], [[2.5, 1, -4, 0, 2.5, 9.23662120362992, 1, 6.8, 9, 10.2, 0, 2.5, 1]], [[3, 3, 0, -9, 1, 0, 1, 1]], [[0, 1, 0, -7, 1, 0, 0, 1]], [[-4, 0, 10.2, 6.8, -4, 9, 10.2]], [[1.5, -2, 4.398225143948116, 0, 3.14, -5, 0, 0, -4.5, 0, 2]], [[3, 3, 0, 1, 10, 0, 1, 2]], [[10, 4, -25, 0, 5, 63, -40, 0, 10, 5, 5, -40, -40]], [[10, 1, 0, -25, -3, -7, -9]], [[2, -4, 0, 2, 10.2, 6.8, 9, 10.2, 1, 0]], [[-40, 9, -1, -25, -4, -40, -25]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, -9, 0, -1]], [[-9, -9, 3, 1, 0, -1, 5, -5, -7, -9]], [[0, 0, -1, 0, 0, 0, 0, 0, 0, -40]], [[11, -5, 0, 5, -1, 63, 10, 0, 10, 5, 11, 0]], [[3.5, 1.1, -5.268416254258126, 0, 0.7751128836193217]], [[-5, 1, 1, 0, 0, 1, 0, 1, 1, 0]], [[2, 1, 0, 1, 0, 1, 2]], [[1, -4, -3, 2.5, 6.8, 9, 10.2]], [[2.5, 1, -4, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5, 6.8]], [[10, -25, 0, 64, -40, 0, 10, 0, 5]], [[0, -40, 0, 3, 0, 2, -9, -1, 1]], [[2, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 6, 0, -1]], [[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 1, 0]], [[-1, -5, -2]], [[2, 1, 0, 1, 2, 0, -3, 2]], [[11, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 11, 0, -1, 0]], [[11, -40, -5, 0, -1, -1, 11, 63, 0, 10, 5, 11, 0, 11]], [[-4, 0, 10.2, 6.8, -6, 9, 10.2]], [[2.5, 1, 11, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5]], [[11, -25, 0, 5, 63, -40, 0, 10, 0, 5, 63, 63]], [[1.5, -2, 4.398225143948116, 0, 3.14, -5, 0, 0, -4.5, 0, -25]], [[-1, -3, -2, -4, -3, 3, -1]], [[-1, -2, -3, -4, -2]], [[1, 3, 0, 2.5, 6.8, 9, 6.8]], [[0, 2, 1, 1, 0, 11, 1, 0, 1, 0, 1]], [[-1, -3, -2, -3, -4, -1]], [[1, 0, -1, -3, -5, -7, -9, -5, -3]], [[0, 3, 0, 3, 0, 0, 1, 3]], [[-1, 1, 1, 0, 3, 1, 0]], [[11, -40, -5, -2, 0, -5, -1, 0, 63, 0, 10, 0, 5, 11, 0, -1]], [[2, 3, 2, 2, 0, 1, -2, 0, 1]], [[-40, -5, 0, -1, -1, 11, 63, 0, 10, 0, 5, 11, 0, 11]], [[-5, 1, 1, 0, 0, 1, 0, 1, 0]], [[11, -5, 0, 5, 63, 0, 10, 0, 11, 0, 0]], [[1, 2, 1.2, -4, 0, 2.5, 7.7663698979753315, 9]], [[-4, 0, 0, 10.2, 6.8, -6, 9, 10.2]], [[0, 0, 0, 0, 0, 0, 0, 0, -40]], [[2, 2, 2, 0, 1, -2, 0, 1]], [[9, 2, 0, 3, -1, 0, 4, 0, 2, 0, 1, 4]], [[2, -4, 0, 2, 6.8, 9, 10.2, 1, 0]], [[1.5, -2, 4.398225143948116, 1, -5, 0, 1.2, 0, -4.5, 0, 2]], [[11, 10, -25, 0, 64, -40, 0, 10, -1, 5, 11]], [[0, -5, 11, 1, 1, 0, 1, 0, 1, 1, 11]], [[-4, 0, 2.5, -4, 7.7663698979753315, 9, 10.2, 2.5, 2.5]], [[0, -2, -6, -3, -4]], [[10, 3, 1, 0, -3, -1, -3, -2, -5, -7, -9, -5, -3]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, 1, -6, -4.5, 0, 2, -4.5, -4.5]], [[-5, 1, 1, 0, 0, 1, 0, 1, 0, 0]], [[11, -40, -5, 0, -5, -1, 0, 63, 0, 10, 0, 5, 11, 0, -1, 0]], [[1, -4, -3, 2.5, 1, 2.5, 9, 10.2]], [[1, -2, 0, -5, 0, 1.2, 0, 1, -6, -4.5, 0, 2, -4.5, -4.5]], [[-1, -3, 4, -3, -3, -4]], [[-1, -3, -2, -5, -4, -5, -3]], [[-40, -2, -25, -4, -25]], [[10, -25, -1, 6, 62, 63, 9, -40, 0, 10, 0, 5, -40, -40, -5, 10, -25]], [[0, 0, 0, 0, 0, -1, 0, 0, 0, 6, 0, 1, 0]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5, 0]], [[2.5, 1, -4, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5, 6.8, -4]], [[1, -4, 0, 0, 10.2, 6.8, 10.2]], [[0, 0, 0, 0, 0, -3, 0, 0, 0, 0, 9, 0, 1]], [[2.5, 1, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5]], [[10, -1, -3, -2, -3, -3, -3]], [[-1, 0, -2, -6, -3, -4]], [[3.5, 1.1, -4.4, 0, -4.4]], [[0, 3, 0, 3, 0, 2, 0, 1, 3, 3]], [[1, -2, 0, 3.14, -2.8, -5, 0, 1.2, 0, -6, -4.5, 0, -4.5]], [[-4, 10.2, 6.8, -6, 9, 10.2, 0]], [[-9, 3, 1, 0, -1, 1, -3, -5, -7, -9]], [[1, 0, 2, 1, 0, 1, 0, 1, 1]], [[0, 0, 0, 0, 0, 0, 0, 0, -9, 6, 0, 1, 0]], [[3, 3, 0, -9, 1, 1, 1]], [[2, 1, 0, 1, 0, 1, 11, 4, 0]], [[1.5, -2, 4.398225143948116, 0, 3.14, -5, 0, 1, 1.2, 0, -4.5, 0, 2, 0]], [[5, 3, -10, 1, 0, -1, -2, -5, -7, -9]], [[0, -1, -6]], [[2, 0, 3, 0, 0, 2, 0, 1]], [[11, -5, 6, 0, 0, 5, 63, 1, 10, 0, 5, 11, 0]], [[-1, -3, -2, -5, -4, -5, -3, -2, -4]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.880833885451199, 0, 1]], [[-25, 1, -4, 0, 6.8, 2.5, 6.8, 9, 9, 10.2]], [[0, 0, -1, 0, -2, -2, 0, 0, 0, 0, 0, 0, -9, 0]], [[11, -25, 0, 5, 63, 0, 10, 0, 5, 11, 5]], [[1, 5, -4, -1, 0, 10.2, 6.8, 9, 10.2]], [[11, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 0, 63]], [[10, 3, 1, -1, 0, -1, -3, -5, -7, -9, -5]], [[3, 3, 2, 2, 0, 1, 0, 1, 2, 0]], [[10, 3, 1, 6, -1, -3, -5, -7, -9]], [[3, -25, 0, 5, 63, 0, 10, 0, 11, 5]], [[3, 3, 0, -9, 0, 1, 1]], [[1, 1, 0, 1, 0, 1, 1]], [[1, -4, -3, 2.5, 1, 2.5, 9, 10.2, -4]], [[3, -25, -40, 0, 4, 63, 0, 62, 0, 11]], [[10, -1, -3, -2, -3, -4, -3, -3]], [[-3, 1, 0, -1, -3, -5, -7, -9, -5, -3]], [[-1, -3, -4, -2]], [[0, 1, 0, -1, 0, 1, 0, 0, 0, 0, -1, -40, 0]], [[10, -25, -1, 6, 63, 9, -40, 0, 10, 0, 5, -39, -40, -5, 10, 5]], [[0, 1, 64, 1, 1, 11, 0, 1, 0, 1, 0, 1]], [[11, -5, 6, 0, 5, 63, 1, -1, 0, -1, 11, 0]], [[1, -1, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -4.5, 0]], [[0, 0, 0, 0, 0, -1, 0, 0, 0, 6, 0, 1, 0, 0]], [[3, -25, 0, 5, 63, 2, 10, 0, 11]], [[10, -5, 6, 0, 5, 63, 1, -1, 0, -1, 11, 0]], [[0, 0, -1, 0, 0, 0, 0, -10, 0, 0, 1, 0]], [[2, -4, 0, 2.5, 6.8, 9, 10.2]], [[-1, -2, -2, -4]], [[0, 0, -1, 0, 0, 0, 0, -5, 0, 0, 1, 0]], [[1, 5, -4, 0, 0, 10.2, 6.8, 9, 10.2, -4]], [[2, -4, 0, 2, 6.8, 9, 10.2, 2, 1, 0, -4]], [[2, 0, 3, 3, 0, 2, 0, 1, 3]], [[1, 0, -1, -3, -5, -7, -5, -3]], [[1, 2, 1, 1, 0, 2, -1, 1, 0, 2, 1, 0, 1, 2, 2]], [[1, -4, 5, 2.5, -4, 7.7663698979753315, 9, 10.2, 2.5]], [[2, -4, 0, 10.2, 6.8, 9, -2.8, 10.2, 2]], [[2.5, 1, 11, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5, 10.2]], [[1, 0, -1, -3, -7, -3]], [[10, -25, 0, 64, -40, 11, 0, 5, 5]], [[0, 1, 0, -7, 1, 2, 1, 0, 1, 0, 1]], [[11, 10, -25, 6, 64, -40, -1, 10, -1, 5, 11]], [[2.5, 1, -4, 0, 2.7062803044406474, 9.23662120362992, 6.8, 9, 10.2, -1, 2.5]], [[2, 1, -9, 0, 0, 0, 1, 1]], [[-8, 10, 1, 0, -25, -3, -7, -9]], [[11, -40, -5, -1, -1, 63, 0, 10, 0, 5, 11, 0]], [[0, 2, 1, 1, 0, 1, 0, 1, 2, 1]], [[1, -4, 0, 0, 10.2, 6.8]], [[1, 0, -1, -3, -7, -3, -7, -3, 0]], [[3, -26, 0, 5, 63, 10, 0, 11, 5]], [[0, 0, 0, 0, 0, -1, 0, 0, 0, 6, 0, 1, -5, 0]], [[2, 0, 3, 0, 3, 0, 2, 0, 1, 3, 0]], [[1, -2, 0, 3.14, -5, 0, 63, 1.2, 0, 1, -6, -4.5, 0, 2, -4.5, -4.5]], [[2, -4, 0, 9, 10.2, 1]], [[9, 2, 0, 3, 0, 4, 1, 2, 0, 1, 4, 0]], [[11, -40, -5, -2, 0, -5, -1, 0, 63, 0, 10, 0, 5, 11, 0, -4, 0]], [[2, 0, 3, 0, 3, 0, 2, 0, 1, 0]], [[1, 2, 1.2, -4, 2.5, 7.7663698979753315, -5, -5]], [[1, 2, 1, 0, 0, 2, -1, 1, 0, 2, 1, 0, 1, 2, 3, 2]], [[10, 3, 1, 0, -1, -3, -5, -9]], [[11, -25, 5, 63, 0, 10, 0, 5, 10, 5, 5]], [[1, -2, 0, 3.14, -5, 0, 1.2, 0, -6, -4.5, 0, 2, -2]], [[10, 3, 1, 0, -3, -1, -3, -2, -5, -9, -5, -3]], [[1.5, -2, 4.398225143948116, 1, 3.14, -5, 0, 1, 1.2, 0, -4.5, 0, 2]], [[2, -2, -40, -5, 0, -5, -1, 63, 0, 10, 0, 5, 6, 0, -1]], [[11, -25, 0, 5, 63, 0, 10, 0, 5, 11, 5, -25]], [[0, 2, 1, 1, 0, 0, 1, 0, 1, 1]], [[2, 0, 3, 0, 3, 0, 2, -1, 1, -4, 3, 3]], [[-5, 1, 1, 0, 0, 1, 0, 1, 1, -5]], [[-1, -3, -2, -4, -1, -1]], [[12, -40, -5, 0, -5, -1, 63, 64, 0, 10, 0, 5, 0, -1]], [[-5, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1]], [[2.5, 1, 11, -4, 0, 2.5, 9.23662120362992, 6.8, 9, 10.2, 0, 2.5, 10.2, 2.5]], [[10, 3, 1, 0, -3, -1, -3, -2, -9, -5, -3]], [[1.5, -2, 4.398225143948116, 1, 3.14, 0, 1, 1.2, 0, -4.5, 0, 2]], [[10, 3, 1, 0, -1, -3, 4, -6, -9, -5]], [[1.5, -2, 4.398225143948116, 1, -5, 0, 1.2, 0, -4.5, -26, 0, 2]], [[-5, -40, -2, -3, -4]]], "completion": "\nimport numpy as np\n\ndef derivative(xs: list):\n return list(np.multiply(xs[1:], np.arange(1, len(xs))))\n\n", "raw_completion": "```python\nimport numpy as np\n\ndef derivative(xs: list):\n return list(np.multiply(xs[1:], np.arange(1, len(xs))))\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef derivative(xs: list):\n \"\"\" xs represent coefficients of a polynomial.\n xs[0] + xs[1] * x + xs[2] * x^2 + ....\n Return derivative of this polynomial in the same form.\n >>> derivative([3, 1, 2, 4, 5])\n [1, 4, 12, 20]\n >>> derivative([1, 2, 3])\n [2, 6]\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/63", "prompt": "\n\ndef fibfib(n: int):\n \"\"\"The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fibfib(0) == 0\n fibfib(1) == 0\n fibfib(2) == 1\n fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).\n Please write a function to efficiently compute the n-th element of the fibfib number sequence.\n >>> fibfib(1)\n 0\n >>> fibfib(5)\n 4\n >>> fibfib(8)\n 24\n \"\"\"\n", "entry_point": "fibfib", "canonical_solution": "\n\n if n == 0 or n == 1:\n return 0\n elif n == 2:\n return 1\n a, b, c = 0, 0, 1\n for _ in range(3, n + 1):\n a, b, c = b, c, a + b + c\n return c\n\n", "test": "\n\nMETADATA = {}\n\n\ndef check(candidate):\n assert candidate(2) == 1\n assert candidate(1) == 0\n assert candidate(5) == 4\n assert candidate(8) == 24\n assert candidate(10) == 81\n assert candidate(12) == 274\n assert candidate(14) == 927\n\n", "contract": "\n assert isinstance(n, int), \"invalid inputs\" # $_CONTRACT_$\n assert n >= 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[2], [1], [5], [8], [10], [12], [14]], "atol": 0, "plus_input": [[20], [0], [15], [23], [21], [25], [1], [14], [13], [19], [57], [22], [24], [56], [18], [false], [true], [58], [12], [11], [2], [26], [60], [4], [59], [16], [27], [28], [3], [17], [61], [10], [62], [29], [30], [31], [32], [48], [47], [46], [55], [49], [50], [51], [52], [53], [54], [33], [73], [34], [63], [45], [72], [98], [100], [97], [71], [43], [9], [35], [44], [99], [102]], "completion": "\ndef fibfib(n: int) -> int:\n if n == 0:\n return 0\n elif n == 1:\n return 0\n elif n == 2:\n return 1\n else:\n a, b, c = 0, 0, 1\n for i in range(2, n):\n a, b, c = b, c, a + b + c\n return c\n", "raw_completion": "```python\ndef fibfib(n: int) -> int:\n if n == 0:\n return 0\n elif n == 1:\n return 0\n elif n == 2:\n return 1\n else:\n a, b, c = 0, 0, 1\n for i in range(2, n):\n a, b, c = b, c, a + b + c\n return c\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\n\ndef fibfib(n: int):\n \"\"\"The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n fibfib(0) == 0\n fibfib(1) == 0\n fibfib(2) == 1\n fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).\n Please write a function to efficiently compute the n-th element of the fibfib number sequence.\n >>> fibfib(1)\n 0\n >>> fibfib(5)\n 4\n >>> fibfib(8)\n 24\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/64", "prompt": "\nFIX = \"\"\"\nAdd more test cases.\n\"\"\"\n\ndef vowels_count(s):\n \"\"\"Write a function vowels_count which takes a string representing\n a word as input and returns the number of vowels in the string.\n Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a\n vowel, but only when it is at the end of the given word.\n\n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \"\"\"\n", "entry_point": "vowels_count", "canonical_solution": "\n if s == \"\": return 0\n cnt = len(list(filter(lambda ch: ch in \"aeiouAEIOU\", s)))\n if s[-1] in \"yY\": cnt += 1\n return cnt\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"abcde\") == 2, \"Test 1\"\n assert candidate(\"Alone\") == 3, \"Test 2\"\n assert candidate(\"key\") == 2, \"Test 3\"\n assert candidate(\"bye\") == 1, \"Test 4\"\n assert candidate(\"keY\") == 2, \"Test 5\"\n assert candidate(\"bYe\") == 1, \"Test 6\"\n assert candidate(\"ACEDY\") == 3, \"Test 7\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n\n", "contract": "\n assert type(s) == str, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["abcde"], ["Alone"], ["key"], ["bye"], ["keY"], ["bYe"], ["ACEDY"]], "atol": 0, "plus_input": [["hello"], ["apple"], ["time"], ["glue"], ["candy"], ["parody"], ["monkey"], ["why"], ["bay"], ["aeiouy"], ["JBXFOFH"], ["c"], ["aeiouyaeiouy"], ["aeiouoy"], ["applebay"], ["eaeiouy"], ["applebaglue"], ["glumonkeye"], ["ndy"], ["ctieme"], ["wyhy"], ["parpody"], ["apndyple"], ["glumonglluekeye"], ["ctiparpodyecme"], ["aeicouyaeiouy"], ["pplebay"], ["glumonglluekewyhyye"], ["aeiooy"], ["applaebay"], ["bpplebay"], ["bayy"], ["hwhy"], ["aeioyoy"], ["aaappleeioauy"], ["candaeioyoyyndy"], ["candaeioyoyynad"], ["glumonappleglluekeye"], ["aeioowyhyy"], ["cthelloieme"], ["ctiieme"], ["glumonkeyee"], ["aeuyaeibayouy"], ["bcandaeioyoyynadpplebay"], ["eaeiy"], ["aeioappleuyaeiouy"], ["bcandaeioyoeyynadpplebay"], ["aeuyaeibayoyuy"], ["applebaglueaeiye"], ["aeictiemeoappleuyaeiouy"], ["ttimeime"], ["aeiouyaeglumonkeyeiouy"], ["aeioydndyoy"], ["aeioowyhyoy"], ["ahelloaappleeioauy"], ["glumone"], ["aeiyy"], ["gluemone"], ["bcandyndaeioapplebaglueyoyynadpplebay"], ["ctiparpodyaecme"], ["glumoaeioowyhyyne"], ["applebaglueaeiyectiieme"], ["ba"], ["nddy"], ["eaeeiouy"], ["pardy"], ["aba"], ["glumopnappleglluekeye"], ["applebagluyeaeiye"], ["aeicandaeioyoyynadooewyhyy"], ["glumlonkoeaeioowyhyoyyee"], ["aeuyaeeibayouy"], ["teglumonglluekeyeime"], ["cmonkeyandy"], ["candaeioyd"], ["canddaeyd"], ["aeiouwyhyyaeglumonkeyeiouy"], ["cthelloiecanddyndyme"], ["pzUzSiO"], ["aeyaeibayoyuy"], ["aeeyaeibayoyuy"], ["bcandyndaeioapplaebaglueyoyynadpplebay"], ["aeiyycandaeioyoyynad"], ["ctiemictiiemee"], ["aeicandaeioyoyynadooewyhyyaeiouyaeiouypzUzSiO"], ["hKaAyE"], ["canddy"], ["gluemglumlonkoeaeioowyhyoyyeaeiouoye"], ["applaebbaglumonglluekewyhyyey"], ["aeiyycandaeihwhyoyoyynad"], ["applebaglueaeiyectiieeme"], ["aeuyaeiyuy"], ["aeioappleuyaeiiouy"], ["y"], ["applebageluyeaeiye"], ["eapple"], ["ctipttimeimearpodyaeceme"], ["acanddyteglumonapplaebbaglumonglluekewyhyyeyglluekeyeimeeyaeibayoyuy"], ["ctmeimearpodyaeceme"], ["pctiparpodyecmearpody"], ["bcdfghjklmnpqrstvwxyz"], ["aAAaAaaAaaaaa"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["AEIOUYXW"], ["cryptography"], ["psychology"], ["dizziness"], ["abstemiousness"], ["facetiousness"], ["bcdfghjklmnpabstemiousnessqrstvwxyz"], ["bcdfghjklmnpabstemiousnessqrstvxyz"], ["aeiouyfacetiousness"], ["asbstemiousness"], ["psypsychology"], ["facetioubcdfghjklmnpqrstvwxyzsness"], ["ABCDEFGHIJKLMNOPQRSTUVWXZ"], ["AEIOUYYXW"], ["cpsychology"], ["cryptograpy"], ["aAEIOUYXWouy"], ["cryptographcy"], ["aeioaAAaAaaAaaaaauyfacetiousness"], ["psypsycfacetioubcdfghjklmnpqrstvwxyzsnesshology"], ["iaeaeiouyfacetiousnessioouy"], ["bcdfgjhjklmnpqrstvwxyz"], ["AEW"], ["cryptogracpy"], ["facetioubcdffghjklmnpqrstvwxyzsness"], ["aAAaAaaAaaa"], ["iaeaeiouyfacetiousnessioAEIOUYYXWouy"], ["aOAEIOUYXWouy"], ["cryptograpyy"], ["psyc"], ["cpsyccryptographyhology"], ["cryptograacpsychologyOAEIOUYXWouycpy"], ["aieiouy"], ["cryptbcdfgjhjklmnpqrstvwxyzograacpsychologyOAEIOUYXWouycpy"], ["aeioaAAaAaaAaaaaauyfacfacetiousnessetiousness"], ["aeioiaeaeiouyfacetiousnessioouyuy"], ["aeiouyfaceftiousness"], ["aeioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuy"], ["aAAaaAaaAaaaaa"], ["aoeiouyfaceaeiouyfacetiousnessss"], ["psypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhology"], ["aieioABCDEFGHIJKLMNOPQRSTUVWXZuy"], ["dizzinesds"], ["iaeaeiiouyfacetiousnessioouy"], ["aaaAaaa"], ["oaAEIOUYXWouy"], ["cpsbcdfghjklmnpabstemiousnessqrstvwxyzology"], ["bcdfgbhjklmnpabstemiousnessqrstvxyz"], ["aeiocryptographcyuyfacetiousness"], ["pssypsychology"], ["asbstemiousnessaeiouyfaceftiousness"], ["facetioubcdffghjklfmnpqrstvwxyzsness"], ["bcdfghjklgmnpabstemiousnessqrstvwxyz"], ["facetioubcdffbcdfghjklmnpabstemiousnessqrstvxyzghjklmnpqrstvwxyzsness"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaa"], ["iaeaeiiouyfacetioiusnessioouy"], ["bcdfgjhabstemiousnessjklmnpqrstvwxyz"], ["bcdfgjhabstemaeioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuynessjklmnpqrstvwxyz"], ["psiaeaeiiouyfacetioiusnessioouyyc"], ["aeioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyenns"], ["aeipsypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyholuyuy"], ["bcdfgjhabstemiousnessjklmnpqrstvvwxyz"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyz"], ["iaeaeiiouyfacetiocryptograacpsychologyOAEIOUYXWouycpyiusnessioouy"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyz"], ["cryptogracaAEIOUYXWouypy"], ["crypotography"], ["aieioABCDEFGHIJKCLMNOPQRSTUVWXZuy"], ["aeipsypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychsologyOAEIOUYXWouycpyholuyuy"], ["cryptogracfacetioubcdffghjklfmnpqrstvwxyzsnesspy"], ["afacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousness"], ["facetioubcdffghjklmnpqrswxyzsness"], ["pbcdfghjklgmnpabstemiousnessqrstvwxyzlogy"], ["facetioubcdffghjklmnpqraAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzstvwxyzsness"], ["bcdfgjhabstfecryptogracaAEIOUYXWouypymiousnessjklmnpqrstvvwxyz"], ["aieieouy"], ["aeioiaeaeiouyfacetiousnesasbstemiousnesssioouyuy"], ["bcdfghjklgmnpqrstvwxyz"], ["psycpbcdfghjklgmnpabstemiousnessqrstvwxyzlogy"], ["afacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiousness"], ["facetioubcdfghjwxyzsness"], ["bcdfgbhjklmnpabstemiousnessqrstvaOAEIOUYXWouyxyz"], ["aieiiouy"], ["aaaaaAaaaa"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyzy"], ["aipbcdfghjklgmnpabstemiousnessqrstvwxyzlogyeiiouy"], ["OAEIOUYXW"], ["cryptiaeaeiouyfacetiousnessioAEIOUYYXWouyogracpy"], ["psypsycfacetioubcdfghjklmnpqrstvwxyfzsnesshology"], ["facetioubcdffghjklmnpqraAAaaAaaAaaiaeaeiouyfacetiousnessioouss"], ["bcdfgjhabstemiousnessjklmnpqrstvvxwxyz"], ["crypttographcy"], ["aeiouyfaceftiousnesasbstemiousness"], ["aeioiaeaeiocpsyccryptographyhologyouyfacetiousssioouyuy"], ["aeiouyfaceftiousneness"], ["bcdfghjklmnpqrsaieioABCDEFGHIJKLMNOPQRSTUVWXZuyxyz"], ["psiaeaeiiobcdfghjcetioiusnessioouyyc"], ["aeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyenns"], ["bcdfghjklmnpqrstvyz"], ["aeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousness"], ["psypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhology"], ["afacetinessetiousness"], ["aeiouyfacetiousnessy"], ["aeiouyfacetiousnbcdfghjklmnpqrstvyzessy"], ["fazcetioubcdffghjklmnpqrstvwxyzsness"], ["psyypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxysouycpyhology"], ["facetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["facetioubcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["afacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiAousness"], ["aeioiaeaeiocpsyccryptographyhologyuyfacouyuy"], ["OAEaAAaaAaaAaaaaaUYXW"], ["aoeiouyfaceaeiouyfacetieousnessss"], ["facetioubcdffghstvwxyzsness"], ["ai"], ["aiei"], ["yy"], ["pcsypsycfacetioubcdfghjklmnpqrstvwxyzsnesshology"], ["facetioubcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslmnpqrstvwxyzsness"], ["aOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnessWouy"], ["aaaaaAapsychologyaaa"], ["aeiiociaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyenns"], ["abs"], ["psypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychyologyOAEIOUYXWouycpyhology"], ["aAAaaAaafacetioubcdffghjklmnpqrstvwxyzsnessAaaaaa"], ["facettioubcdffghstvwxyzsness"], ["iaeaeiouyfacetiousnessiioAEIOUYYXWouy"], ["aeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetiousnessy"], ["aAAaaAaacrypotographyAaaaaa"], ["aeioiaeaeiocpsyccryptographyhologyuyfacetiousnessiaoouyuyenns"], ["aAEIcryptograpyOUYXWouy"], ["facetioubcdaeiouyfacetiousnbcdfghjklmnpqrstvyzessyffghjklmnpqrstvwxyzsness"], ["cryptbcdfgjhjklmnpqrstvwxyzograacpsychologyOAEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["iaeaoeiiouyfacetiousnessioouy"], ["aeioiaeaeiocpsyccryptogaoeiouyfaceaaieieiouyfacetieousnessssraphyhologyouyfacetiousssioouyuy"], ["aAEIaAAaaAaaAaaaaaograpyOUYXWouy"], ["facetioubcdffghjpbcdfghjklgmnpabstemiousnessqrstvwaAEIOUYXWouyxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["cryptbcdfgjhjklmnaieioABCDEFGHIJKCLMNOPQRSTUVWXZuycdfgjhjklmnpqrstvwxyzcpy"], ["psypsycfacetioubcdfghjklmdizziycpyhology"], ["AEIYOUYYXW"], ["aipbcdfghjklgmnpabstemiousnessqrzlogyeiiouy"], ["bcdfgjhabqrstvwxyz"], ["aeiocryptographcyuyfacetpsycinousness"], ["afacetioubcdfghjklmnfacetioubcdfghjwxyzsnesspqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnesssiousness"], ["psypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessXWouycpyhology"], ["cpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennstographyhology"], ["crypytograpyy"], ["cpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennstograpahyhology"], ["aeiocryptographcyyuyfacetpsycinousness"], ["afacetioubcdfghjklmnpqrstvwaxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiAousness"], ["cryptogracaAEIOUYXWoucpsyccryptographyhologyypy"], ["cryptbaeiouycdfgjhjklmnpqrstvwxyzograacpsychologyOAUEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["iaeaoeiiouyfacetiioouy"], ["facettioubcdffghstvwxyzsnOAEaAAaaAaaAaaaaaUYXWess"], ["bcdfghjklmnpqrsaieioABCDEFGHIJKLMNOPQRSTUVWXZuyyz"], ["aaaaaaAapsychologyaaai"], ["aOAEIOUYXWaeiocryptographcyuyfacetiousnessouy"], ["asbstemioussnessaeiouyfaceftiousness"], ["asbstemiousnessaeioouyfaceftiousnesis"], ["kBhhbjyoPZ"], ["aeioiabsaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuy"], ["aeiocryAEWptographcyyuyfacetpsycinousness"], ["facetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzs"], ["aAAaaAaaAaaiacryptogracaAEIOUYXWoucpsyccryptographyhologyypyeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyz"], ["cpsycholaaaaaaAapsychologyaaaiogy"], ["aaeiouyfaceftiousnenessieiiouy"], ["afacetioubcdfghjklmnpqrstvwaxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqfacetioubcdffghstvwxyzsnesssiAousness"], ["facetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzsness"], ["aeipsypsycfacetoubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyholuyuy"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyzy"], ["aAAaaAaaAaaiacryptogracaAEIOUYXWoucpsyccryptographyhologyypyeaeiouyfaacetiousnessioouyaaabcdfghjklmnvwxyz"], ["iaeaeiiouyfacetiocryptograacpsychologyOAEIOUYXWoguycpyiusnessioouy"], ["aeioiaeaeiocpsyccryptographyholaogyuyfacetiousnessioouyuyenns"], ["bcdfgbhjklmnpabstemiousneABCDEFGHIJKLMNOPQRSTUVWXZssqrstvxyz"], ["bcdfghjklgmnpqrtvwxyz"], ["aeipbcdfghjklgmnpabstemiousnessqrzlogyeiiouy"], ["aeiiociaeaeiocpsyccryptographyhologyuyfacetiousnyenns"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstvwxyzologyxyz"], ["aAAaaAaaAaaiaeaeiouyfacetiaousnessioouyaaa"], ["aAAaAaaAaaaaaa"], ["bcdfgbhjklmnpabsbcdfgbhjklmnpabstemiousnessqrstvaOAEIOUYXWouyxyztemiousnseABCDEFGHIJKLMNOPQRSTUVWXZssqrstvxyz"], ["aOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouy"], ["facetioubcdffbcdmfghjklmnpabstemiousnessqrstvxyzghjklmnpqrstvwxyzsness"], ["OAEIOUYXOW"], ["bcdfgbhjklmnpabsteemiousnessqrstvxyz"], ["iaeaeiouyfacetiouaeioiaeaeiocpsyccryptographyhologyuyfacouyuysnessioAEIOUYYXWouy"], ["aipbcdfghjklgmnpabstemiousnpsypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhologyessqrzlogyeiiouy"], ["aeipbcdfghjklgmnpabstemiousnessqrzlogyyeiiouy"], ["pcsypsycfacebcdfghjklgmnpqrstvwxyzrstvwxyzsnesshology"], ["aeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetaAEIOUYXWouyiousnessy"], ["aeiouyfacetiousneses"], ["aipbcdfghjklgmnpabstepmiousnessqrzlogyeiiouy"], ["basbstemiousness"], ["ABCDEFGHIJKLMNOPQRSTUYZ"], ["facetioubcdffghjpbcdfghfacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["dizzifacettioubcdffghstvwxyzsnOAEaAAaaAaaAaaaaaUYXWessness"], ["bcdfgjhabstemaeioiaeaeiocpsyccryptographyhologyuyfacetiousinessioouyuynessjklmnpqrstvwxyz"], ["aieioABCDEFGHIJKLMNOPQRiaeaeiiouyfacetiousnessioouySTUVWXZuy"], ["aAAaaAaaAaaniaeaeiouyfacetiousnessioouyaaa"], ["iaeaoeiiouyfacetiiooaeioiabsaeaeiocpsyccryptographyhologyuyfacetiousnessioaAAaaAaafacetioubcdffghjklmnpqrstvwxyzsnessAaaaaaouyuyuy"], ["iaeaeiouyfacetiousnessioAEIYXWouy"], ["facetioubcdffghjklfmniaeaeiiouyfacetiouspsypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessXWouycpyhologynessioouypqrstvwxyzsness"], ["aOAEIOUYXfazcetioubcdffghjklAEIaeiocryptographcyuyfacetiousnessOUYXWmnpqrstvwxyzsnessWouy"], ["crypytograpaeioiaeaeiocpsyccryptogaoeiouyfaceaaieieiouyfacetieousnessssraphyhologyouyfacetiousssioouyuyyy"], ["bcdfgjhabstemiousnessjdklmnpqrstvwxyz"], ["asbstemiousnessaeioouyfaceftiousnesais"], ["cryptogracfacetioubcdffghjklfmnpqrstvwxyzsneaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzsspyaeiouyfacetiousnbcdfghjklmnpqrstvyzessy"], ["dizzinesdcryptbcdfgjhjklmnpqrstvwxyzograacpsychologyOAEIOUYXWouycpys"], ["facetioubcdffghjpbcdfghjklgmnpabstemiousneaeiouyfaceftiousnnesasbstemiousnessYXWouyxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["bcdfghjklmnpabstemiousnessqrsstvwxyz"], ["aeiouyfaceftiousneneuss"], ["aAAaaAaaAaaiacryptogrWacaAEIOUYXWoucpsyccryptographyhologyypyeaeiouyfaacetiousnessioouyaaabcdfghjklmnvwxyz"], ["bcdfcrypytograpyyghjklmnpabstemiousnessqrsstvwxyz"], ["aeioiaeaeiocpsyccryptogaoeiouyfaceaaieieoiouyfacetieousnessssraphyhologyouyfacetiousssioouyuy"], ["aeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnesspsyc"], ["cryptbcdfgjhjklmnpqrstvwxyzograacpsychologyOAEIOUYXWouaeiouyfacetiousnesesy"], ["bcdfghjklmnpabstemiousnesssqrsstvwxyz"], ["gAaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetaAEIOUYXWouyiousnessy"], ["aOAyEIOUYXWouy"], ["cryptogracaAEIOUYXWoucpsycocryptographyhologyypy"], ["aieiiaaaAaaaouy"], ["aeiouyfaceeftiousness"], ["asbstemiousnessaeiouyfac"], ["afacetineousness"], ["psypsycfacetioubcdfghjklmnpqqrstvwxyzsnesshology"], ["cpsyccrypaeiioiaeaeiocpsyccryptographyhoglogyuyfacetiousnessioouyuyennstograpahyhology"], ["iAEIOUYYXWaeaeiiouyfacetaaaaaAapsychologyaaaiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyzy"], ["asbstemiousnessaeiasbstemiousnessaeiouyfaceftiousnessouyfaceaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyfsness"], ["facetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrsdizzinesstvwxyzsiaeaeiouyfacetiousnessioouyness"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetioioouyaaabcdfghjklmnvwxyzy"], ["aoeiouyfaceaeiouyfacetiousnescsss"], ["bcdfghjklgmnpqrstvwxyzai"], ["aeioiaoeaeiocpsyccryptographyhologyouyfaceteiousssioouyuy"], ["cryptog"], ["rcrypotography"], ["ciaeaeiouyfacetiousnessioouy"], ["cryptogracpyaAEIOUYXWouy"], ["casbstemiousnessaeiasbstemiousnessaeiouyfaceftiousnessouyfaceaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyfsness"], ["asbstemioussnessaeioucryptogracfacetioubcdffghjklfmnpqrstvwxyzsnesspyyfaceftiousness"], ["psypsycfacetioubcdfghjklmdizziyycpyhology"], ["aipcbcdfghjklgmnpabstepmiousnessqrzlogyeiiouy"], ["aAAaaaAaaAaaaaa"], ["dizziaieABCDEFGHIJKLMNOPQRSTUYZiness"], ["afacetinessetiousnness"], ["aieieoyuy"], ["facetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouydffghjpbcdfghfacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["cpsycholog"], ["fazcryptogcetioubcdffghjklmnpqrstvwxyzsness"], ["aa"], ["facettioubcdffghstvwxyzsfnOAEaAAaaAaaAaaaaaUYXWess"], ["facetioubgcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aAAaAaaAaafacetioubgcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessa"], ["afacetioubcdfghjklmnpuyfacfacetiousnessetiousness"], ["facetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnesaisaaauyfacfacetiousnessetiousness"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxyz"], ["aAAaAaaAaafacetioubgcousnessioouypqrstvwxyzsnessa"], ["aeiocryptographccpsychologfacetpsyaicinousness"], ["asfacetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzbcdfghjklmnpabstemiousnessqrstvxyzsnessbstemioussnessaeiouyfaceftiousness"], ["cpsyccrypaeiioiaeaeiuocpsyccryptographyhologyuyfacetiousnessioouyuyennstograpahyhology"], ["f"], ["afacetineousnesss"], ["ABCDEFGHIJKLrcrypotographyMNOPQRSTUYZ"], ["facetioubcdffbcdmfghjklmnpabstaeioiaeaeiouyfacetiousnesasbstemiousnesssioouyuy"], ["iaeaoeiiouyfacetiouisnessioouy"], ["cryptbcdfgjhjklmnpqrstvwxyzograacpsychologyhOAEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["aieioABCDEFGHIJKLMNOPQRSTUVWXZpsiaeaeiiobcdfghjcecpsyccryptographyhologytioiusnessioouyycuy"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["bcdfgjhabstemaeioiaeaeiocpsyccryptographyhologyuyfacetafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiousnessessjklmnpqrstvwxyz"], ["facetioubcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslcryptogracaAEIOUYXWoucpsycocryptographyhologyypymnpqrstvwxyzsness"], ["OUYXW"], ["cpsaAEIcryptograpyOUYXWouyychology"], ["aeiouyffazcetioubcdcpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennstographyhologyffghjklmnpqrstvwxyzsnessacetaAEIOUYXWouyiousnessy"], ["aeiouyfaceftiousnesasbstemiousnuess"], ["aeiaeaoeiiouyfacetiouisnessioouyipsypsycfacetoubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyholuyuy"], ["bcdfghjklmnpabsteusnessqrstyyvxyz"], ["aAAaieioABCDEFGHIJKLMNOPQRSTUVaAAaaAaacrypotographyAaaaaaWXZuyaAaaAaafacetioubgcousnessioouypqrstvwxyzsnessa"], ["absaipbcdfghjklgmnpabstemiousnpsypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhologyessqrzlogyeiiouy"], ["aipbcdfghjklgmnpabstemiousnpsypsycfacetioubcdfafacetineousnessghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhologyessqrzlogyeiiouy"], ["aipbcdfghjklgmnpabstemiousnpsypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYdizzifacettioubcdffghstvwxyzsnOAEaAAaaAaaAaaaaaUYXWessnesscpyhologyessqrzlogyeiiouy"], ["eiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetaAEIOUYXWouyiousnessy"], ["facetioubgcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzlogynessioouypqrstvwxyzsness"], ["aeiouyfaceftiousnesfacetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzsness"], ["cpsyccrypaeiioiaeaeiuocpsyccryptographyhologyuyfacetiousnessioouyuyennscpsyccryptographyhologytograpahyhology"], ["bcdfgjhabstfecryptogracaAEIOUYXWouygpymiousnessjklmnpqrstvvwxyz"], ["aeiouyffazcetioubcsnessy"], ["hhZCavYLHr"], ["facetoiouabcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslcryptogracaaAEIOUYXWoucpsycocryptographyhologyypymnpqrstvwxyzsness"], ["asfacetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzbcdfghjklmnpabstemiousnessqrstvxyzsnessbstemioussneytiousness"], ["aoeiouyfaceaeiouyfaceetieousnessss"], ["psypsycfacetioubcdfghjklmnpqrstvwxyfzsnesshologyfazcetioubcdffghjklmnpqrstvwxyzsness"], ["AaeioiaeaeiocpsyccryptogaoeiouyfaceaaieieoiouyfacetieousnessssraphyhologyouyfacetiousssioouyuyIOUYXW"], ["facetioubcdffghjpbcdfghjklgmnpabstemiousnessqrstvwaAEIOUYXWoutyxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aeibcdfghjklmnpabstemiousnessqrsstvwxyzouyfacetiaousness"], ["aAAaaAaaAaaiaeaeiouyfacetiousneouyaaabcdfghjklmnpqrstvwbcdfghjklgmnpqrstvwxyzz"], ["aieioABCDEoFGHIJKCLMNOPaAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxyzQRSTUVWXZuy"], ["aaeiouyfaceftiousnenesouy"], ["facetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetaAEIOUYXWouyiousnessy"], ["aaeiouyefaceftiousnaenessieiiouy"], ["bcdfghjklpcsypsycfacetioubcdfghjklmnpqrstvwxyzsnesshologymnpabstemiousnessqrsstvwxyz"], ["cpsghjklmnpabstemiousnessqrstvwxyzology"], ["crcpy"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstvwxyzologyxyz"], ["facetioubgcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessiosness"], ["ioAEIYXWouy"], ["AYXsZdlSV"], ["cpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetioouyuyennstograpahyhology"], ["aeioaAAaAaaAaaaaauyfacfacetiousnessetiousnessABCDEFGHIJKLrcrypotographyMNOPQRSTUYZ"], ["aeioaAAdizziaieABCDEFGHIJKLMNOPQRSTUYZinessaAaaAaaaaauyfacetiousness"], ["aeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsonesaisaaauyfacfacetiousnessetiousness"], ["bcdfghjklmnpqrsaieioABCDEFGHIJKLMNOPRSTUVWXZuyxyz"], ["afacetioubcdfghjklmnpuyfacfacetiousnessetiosness"], ["absaipbcdfghjklgmnpabstemiousnpsypsycfacetiouaieiiouybcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYXWouycpyhologyessqrzlogyeiiouy"], ["aOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxaeiouyffazcetioubcsnessyeyuy"], ["facetifoubcdffghjklfmnpqrustvwxyzsness"], ["aaeiouyfaceftiofusnenesouy"], ["sGYls"], ["bcaAAaaAaaAaaaaadfgjhabstemiousnessjdklmnpqrstvwxyz"], ["facetoiouabcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessslcryptogracaaAEIOUYXWoucpsycocryptographyhologyypymnpqrstvwxyzsness"], ["facetiobcdfghjklmnpqrstvyzubcdffghjklmnpqrstvwxyzsness"], ["cryptbcdfgjhjklmnpqrstvwxyzograacpsychologyOAEIOUYXcpy"], ["abcdfgbhjklmnpabsteemiousnessfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessaAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxyzabcdfghjklmnpqrstvwxyzsqrstvxyzAAaAaaAaaaaaa"], ["facetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouydffghjpbcdfghfacetioubcdfghjwxyzsnessjklggmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["cpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennstographyafacetioubcdfghjklmnfacetioubcdfghjwxyzsnesspqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnesaieioABCDEFGHIJKLMNOPQRSTUVWXZuysetfacetioubcdffghjklfmnpqrstvwxyzsnesssiousnesshology"], ["aOAEIOUYXWouafacetioubcdfghjklmnpqrstvwaxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiAousnessy"], ["cpology"], ["psypsycfqacetioubcdfghjklmnpqrstvwxyzsnesshology"], ["aieioABCDEFologyypyZuy"], ["dizziaieABCDEFGHIJKLMNOPQRSTUYZinessyaaabcdfghjklmnvwxyz"], ["facetioubgcdffghjpbcdfghjklgmnpabstemiousnessqrstvwxyzldizziaieABCDEFGHIJKLMNOPQRSTUYZinessyaaabcdfghjklmnvwxyzogykaipbcdfghjklgmnpabstemiousnessqrstvwxyzlogyeiiouyessioouypqrsstvwxyzsness"], ["aieioABCDEFGHIJKLMNOPQRSTUVWXZpsiaeaeiiobcdfghjcecpsyccrypbtographyhologytioiusnessioouyycuy"], ["crypytograpaeioiaeaeiocpsyaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetiousnessyccryptogaoeiouyfaceaaieieiouyfacetieousnessssraphyhologyouyfacetiousssioouyuyyy"], ["cryptograIOUYXWouy"], ["asbsiousness"], ["facetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouydffghjpbcdfghfacetioubcdfghjwxyzsnessjklggmcryptogracaAEIOUYXWouypynpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouysness"], ["cpsycholaaaaaaAapsyafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnesschologyaaaiogy"], ["aAAaAaaAaafacetiaeibcdfghjklmnpabstemiousnessqrsstvwxyzouyfacetiaousnessoubgcousnessioouypqrstvwxyzsnessa"], ["AEIYXW"], ["ciaeaeiouyfacefacetioubcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslmnpqrstvwxyzsnessousnessioouy"], ["asbstemiousnessaeioouyfaceftiousnciaeaeiouyfacetiousnessioouyesais"], ["iaaAAaAaaAaaaaaeaoeiiouyfacetiiooaeioiabsaeaeiocpsyccryptographyhologyuyfacetiousnessioaAAaaAaafacetioubcdffghjklmnpqrstvwxyzsnessAaaaaaouyuyuy"], ["aipbcdfghjklgmnpabstemiousnpsypsycfacetioubcdfghjklmdizzinfacetioubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptograacpsychologyOAEIOUYdizzifacettioubcdffghstvwxyzsnOAEaAAaaAaaAaaabcdfgjhjklmnpqrstvwxyzyhologyessqrzlogyeiiouy"], ["psiaeaeiiobcdfghjcetioiusneasbstemiousnessaeiasbstemiousnessaeiouyfaceftiousnessouyfaceaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyfsnessssioouyyc"], ["psypsychologyOUYXW"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetioioouyaaabcdcryptogracpyaAEIOUYXWouyfghjklmnvwxyzy"], ["bcdfgbhjkllmnpabstee"], ["abcdfgbhjklmnpabstciaeaeiouyfacetiousnessioouyeemiousnessfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessaAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxyzabcdfghjklmnpqrstvwxyzsqrstvxyzAAaAaaAaaaaaa"], ["aeioiaeaeiocpsyccryptogaoeiouyfaceaaieieiouyfacetieousnessssraphyaOAyEIOUYXWouycetiousssioouyuy"], ["aipcbcdfghjklgmnpabstepmiousnenssqrzlogyeiiouy"], ["aeioiaeaeiocpsyccryptographyhologyoaAAaaAaaAaaiacryptogrWacaAEIOUYXWoucpsyccryptographyhologyypyeaeiouyfaacetiousnessioouyaaabcdfghjklmnvwxyzousssioouyuy"], ["aoeiouyfaceaeiouyfacetieousnessaeiiociaeaeiocpsyccryptographyhologyuyfacpsypsycfacetioubcdfghjklmdizziyycpyhologyetiousnyennsss"], ["bcdfgbhjklmnpabstemiousnessqrstvaOAEInOUYXWouyxyz"], ["aeioiaeabcdfghjklgmnpabstemiousnessqrstvwxyzs"], ["tcrypttographcy"], ["aipbcdsfghjklgmnpabstemiaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzousnessqrzlogyeiiouy"], ["asbstemiousnesfacetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aeiiouyfaceftiousneness"], ["icpsychologyAEIOUYYXWaeaeiiouyfacetaaaaaAapsychologyaaaiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyzy"], ["cpoloygyaeioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuy"], ["aeioiaeaeiocpsyccryptographyhcolaogyuyfacetiousnessioouyuyenns"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfcryptogracpymniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["facetioubcdffghjklfmniaeaeiiouyfsacetiousnessioouypqrstvwxyzsness"], ["facetioubcdffghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouydffghjpbcdfghfacetioubcdfghjwxyzsnessjklggmcrypbcdfgjhabstemiousnessjdklmnpqrstvwxyztogracaAEIOUYXWouypynpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouysnessjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["fazAEIYOUYYXWcetiofubcdffghjklmnpqrstvwxyzsness"], ["bcdfgjhabstemiosusnessjklmnpqrstvvwxyz"], ["faceatioubcffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzs"], ["dizznebcdfghjklmnpabstemiousnesssqrsstvwxyzss"], ["aOAyEIOUaeiouyfaceftiousnessYXWouy"], ["cryptbaeiouycdfgjhjklmnpqrstvwxyzogruaacpsychologyOAUEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["rcgrypotographoy"], ["cryptogracfacetioubcdffghjklfmnpqrstvwxyzsneaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrsbcdfghjklmnpqrsaieioABCDEFGHIJKLMNOPQRSTUVWXZuyxyztvwxyzsspyaeiouyfacetiousnbcdfghjklmnpqrstvyzessy"], ["aipbcdfghjklgmnpabstgepmiousnessqrzlogyeiiouy"], ["OOAEIOaeiouyfaceftiousneneussUYXW"], ["aoeiouyfaceaeifacetioubcdffghjklmnpqrstvwxyzsnessouyfacetieousnessss"], ["craeioiaeaeiocpsyfaceatioubcffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzsccryptogaoeiouyfaceaaieieoiouyfacetieousnessssraphyhologyouyfacetiousssioouyuyyptograacpsychologyOAEIOUYXWouycpy"], ["aeioiaeaeiocpsyccryptogaoeiouyfaceaaieaieiouyfacetieousnessssraphyaOAyEIOUYXWouycetiousssioouyuy"], ["aipbcdfghjklgmnpabstepmiousnessqrzlofacettioubcdffghstvwxyzsnOAEaAAaaAaaAaaaaaUYXWessgyeiiouy"], ["psiaeaeiiobcdfghjcetioiusneasbstemiousnessaeiasbstemiousnessaeivouyfaceftiousnessouyfaceaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyfsnessssioouyyc"], ["asybstemioussnessaeiouyfaceftiousness"], ["afacetneousnesss"], ["asbstemiousnessaeioouyfaceftiousnesiaeaeiiouyfacetiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetioioouyaaabcdcryptogracpyaAEIOUYXWouyfghjklmnvwxyzyis"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaaibcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstvwxyzologyxyz"], ["iaeaeiouyfaceftiousnesasbstemiousnuessaeiouyfacetiousnessioAEIYXWouy"], ["aipbcdfghjklgmnpabstemciousnessqrzlogyeiiouy"], ["psypsycholoogy"], ["cryptogracpOyaAEIOUYXWouy"], ["aeiiociaeaeiocpsyccusnyenns"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetidoubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfcryptogracpymniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["facetioubcdffbcdmfghjklmnpabstemiousnessqrstvxyzghjkflmnpqrstvwxyzsness"], ["aeioiaeaeiocpsyccryptographyholaogyuyfacetiousnessioouyuyennns"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaaibcdfghjklmnpqrstvwcpsbcdfghjklmnpabstogyxyz"], ["fghjklmnpabstemiousnessqrstvxyz"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetidoubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfcryptogracpymniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessf"], ["cryptogaoeiouyfaceaeifacetioubcdffghjklmnpqrstvwxyzsnessouyfacetieousnessss"], ["aAAaaAaaAaayniaeaeiouyfacetiousnessioouyaaa"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrsttvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfcryptogracpymniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aipcbcdfghjklgaieiouyenssqrzlogyeiiouy"], ["aieiaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyouy"], ["abss"], ["cryptbaeiouycdfgjhjklmnpqrstvwxyzogruaacypsychologyOAUEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["cpsyccrypaeiioiaeaeiuocpsyccryptographyholorgyuyfacetiousnessioouyuyennscpsyccryptographyhologytograpahyhology"], ["aeiocryptographcycinousness"], ["aeiouyfacetioucsness"], ["aeiocryAEWptographcyyuaAEIOUYXWouyess"], ["aeioaAAaAaaAaafacetioubcdffghjklmaOaeiouyfacetiousnessAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxaeiouyffazcetioubcsnessyeyuynpqrswxyzsnessaaauyfacfacetiousnessetiousness"], ["aAAaaAaafacetioufbcdffghjklmnpqrstvwxyzsnessAaaaaa"], ["facetioubcdffbcdmfghjklmnpabstemiousnessqrstvxyzghjkflmnpqrstvwxytcrypttographcyzsness"], ["facetioubcdffghjklmnpqrstvwxyzsnessAaaaaa"], ["fss"], ["fazcrypstogcetioubcdffghjklmnpqrstvwxyzsness"], ["aeiiouyfaceftiousnneness"], ["asbstemiousnessaeioouyfaceftiousnesiaeabcdfgbhjklmnpabstemiousnessqrstvxyzyfghjklmnvwxyzyis"], ["bcdfghaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousnesspsycjklmnpqrstvyz"], ["bcdfgjhabstemiousnesvsjdklmnpqrstvwxyz"], ["aipbcdsfghjklgmnpabstemiaAAaaAaaAaaiaeaeiouyfacetiousnessiiouy"], ["yyyy"], ["aAAaaAaaAaaiaieioABCDEFologyypyZuyaeaeiouyfacetiousnessioouyaaa"], ["aAAaAaaAaafacetiaeibcdfghjklmnpabfacetoiouabcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslcrypnessa"], ["aieiaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwuxyzsnnessWouyouy"], ["gAaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessaceaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyztaAEIOUYXWouyiousnessy"], ["nxPZx"], ["psypsychologyfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzs"], ["psypsycfacetioubcdfghjklmdizzinhology"], ["aAAaaAaacrypotographyAAaaaaa"], ["afacetinefssetiousness"], ["aeioiaeaeiocpsyccroyptographyhologyuyfacetiousnessioouyuy"], ["psypsycfacetioubcdfghjklmdbizzinhology"], ["aAAaaAaaAaaiaeaeiouyfacetiaaousnessiooaoeiouyfaceaeifacetioubcdffghjklmnpqrstvwxyzsnessouyfacetieousnessssuyaaa"], ["aeiouyfaceatiousneses"], ["hOUYXfacetioubcdfghjklmnpqrstvwxyzsnessWhZCavYLHr"], ["facetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaatabcdfghjklmnpqrstvwxyzs"], ["psypsycfsacetioubcdfghjklmnpqrstvwxyzssnesshology"], ["afacetioubcasfacetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzbcdfghjklmnpabstemiousnessqrstvxyzsnessbstemioussnessaeiouyfaceftiousnessdfghjklmnpqrstvwaxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiAousness"], ["bcdfgjhabstemaeioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuynessjklmcnpqrstvwxyz"], ["bcdfgjhabstfecryptogracaAmEIOUYXWouypymiousnessjklmnpqrstvvwxyz"], ["facetoiouabcdffghjkfacetaaeiouyfaceftiousnenesouyioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessslcryptogracaaAEIOUYXWoucpsycocryptographyhologyypymnpqrstvwxyzsness"], ["afacetioubcdfghjklmnfacetioubcdfghjwxyzsnesspqrstvwxyiaeaoeiiouyfacetiousnessioouyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnesssiousness"], ["biaeaeiiouyfacetiousaAAaaAaaAaaiaaieioABCDEFGHIJKLMNOPQRSTUVWXZuyeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyzycdfghjklmnpqrstvwxyz"], ["aeiocryptographcyuyfacs"], ["aeioiaeaeiocpsyccryptographyhcolaogyuyfacetiopsypsychologyfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrstvwxyzsusnessioouyuyenns"], ["facetoiouabcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessslcryptogracaaAEIOUYXWoucpsycocryptographoyhologyypymnpqrstvwxyzsness"], ["aeiiociaeaeiocpsyccusniyenns"], ["cryptbaeiouycdfgjhjklmnpqrstvwxyzogbcdfghjklmnpabstemiousnessqrstvwxyzruaacpsychologyOAUEIOUYXWouybcdfgjhjklmnpqrstvwxyzcpy"], ["dizziaieABCDEFGHIJKLMNOPQRSTUYZinessyaaabaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnessWouycdfghjklmnvwxyz"], ["aeioiaeaeiouyfacetiousniessioouyuy"], ["aeioiaeaeiouyfacetiousniuessioouyuy"], ["tcrycryptogracpyaphcy"], ["aeiouyffazcetioubcdcpsyccrypaeiioiaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennstographyhologyffghjklmnpqrstvwxyzsnessacetaAEIOAEIYXWUYXWouyiousnessy"], ["craeioiaeaeiocpsyfaceatioubcffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeioiouyfaceaaieieoiouyfacetieousnessssraphyhologyouyfacetiousssioouyuyyptograacpsychologyOAEIOUYXWouycpy"], ["cpy"], ["facetioubcdffghjpbcdfghaeiiociaeaeiocpsyccryptographyhologyuyfacetiousnessioouyuyennsjklgmnpabstemiousneaeiouyfaceftiousnnesasbstemiousnessYXWouyxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["abbss"], ["bcdfghjklmnpqrsaieioABCDEFGHaieioABCDEFGHIJKLMNOPQRiaeaeiiouyfacetiousnessioouySTUVWXZuyIJKLMNOPQRSTUVWXZuyxyz"], ["aipcbcdfghjklgmnpabstepmihousnessqrzlogyeiiouy"], ["aOAEIOUYXWouafacetioubcdfghjklmnpqrstvwaxyzsnesseioaAAaApsypsycfacetioubcdfghjklmdizzinessnpqrstvwxyscryptograacpsychologyOAEIOUYfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessXWouycpyhologyaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsnessiAousnessy"], ["psypsychologyfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaabcdwfghjklmnpqrstvwxyzs"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetioafacetinefssetiousnessusnessioouyaaaibcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstvwxyzologyxyz"], ["afactetinessetiousnness"], ["abstemiouaaeiouyfaceftiofusnenesouysnss"], ["facetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrsdizzinessafacetinessetiousnesstvwxyzsiaeaeiouyfacetiousnessioouyness"], ["psypsycfacetioubcdfghjklmdizzinfacetiAEIYXWoubcdffghjklmnpqrswxyzsnessessnpqrstvwxyscryptografacetioubcdffbcdmfghjklmnpabstaeioiaeaeiouyfacetiousnesasbstemiousnesssioouyuyacpsychologyOAEIOUYXWouycpyhoslogy"], ["facetioubcdffghjkfacetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnesslmnpqrstvwxycryptographyzsness"], ["ABCDEFGHIJKLrcrypotographyMNOZ"], ["bcdfpsypsycfacetioubcdfghjklmnpqqrstvwxyzsnesshologygjhabstfecryptogracaAmEIOUYXWouypymiousnessjklmnpqrstvvwxyz"], ["aAAaaAaaAaaiaeaeiouyfetiousnessioouyaaabcdfghjklmnpqrstvwxyz"], ["aieiaOAEIOUYXfaUYXWmnpqrstvwxyzsnnessWouyouy"], ["afacetioubcdfghjklmnpuyfacfacetiousnesseticrypotographyousness"], ["bcdfgjhabstfecryptogracaAEIOUYXWouypymiousnessjklcryptogracfacetioubcdffghjklfmnpqrstvwxyzsneaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnpqrsbcdfghjklmnpqrsaieioABCDEFGHIJKLMNOPQRSTUVWXZuyxyztvwxyzsspyaeiouyfacetiousnbcdfghjklmnpqrstvyzessymnpqrstvvwxyz"], ["asbstemiousnessaeioouyfis"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqsrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxy"], ["psypsycfacetioubcdfghjklmnpqrstvwxyxfzsnesshologyfazcetioubcdffghjklmnpqrstvwxyzsness"], ["facetifoubcudffghjklfmnpqqrustvwxyzsness"], ["craaeiouyfaceftiofusnenesouyypotography"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaabcdfghjklmnvwxyazy"], ["aeioiaeaeyccryptogaoeiouyfaceaaieieiouyfacetieousnessssraphyaOAyEIOUYXWouycetiousssioouyuy"], ["cpsyccrypcpsaAEIcryptograpyOUYXWouyychologyennscpsyccryptographyhologytograpahyhology"], ["cryptogracaAEIOUYXWoucpsyccryptographyhologyaeiiociaeaeiocpsyccusniyennsypy"], ["hOUYXfacetioubcdfghjklmnpqravYLHr"], ["afactetinessetious"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaaibcdfghjklmnpqrstvwcpsbcdfghjklmnpabscryptogracpOyaAEIOUYXWouytogyxyz"], ["crasbstemiousnessaeiasbstemiousnessaeiouyfaceftiousnessouyfaceaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouyfsnesstographyhologyypy"], ["aAAaaAaaAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqsrswxyzsnessaaauyfacfacetiousnessetiousnessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpvwxyzologyxy"], ["iaeaeiiouyfacetiousaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaAAaaAaaAaaiaeaeiouyfetiousnessioouyaaabcdfghjklmnpqrstvwxyzaabcdfghjklmnvwxyzy"], ["facetioubcdffghjaAAaaAaafacetioufbcdffghjklmnpqrstvwxyzsnessAaaaaaklmnpqraAAaaAaaAaaiaeaeiouyfacetiousnessioouss"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetidfacetioubcdfghjklmnpqrstvwxyzsnessfghjklmnpabstogyxyz"], ["rcgrypotograpaOAEIOUYXfazcetioubcdffghjklAEIaeiocryptographcyuyfacetiousnessOUYXWmnpqrstvwxyzsnessWouyhoabssy"], ["aAAaaAaafacetioufbcpsypsycfacetioubcdfghjklmdizziycpyhologydffghjklmnpqrstvwxyzsnessAaaaaa"], ["facetioubcdffghjxyzsnessAaaaaaklmnpqraAAaaAaaAaaiaeaeiouyfacetiousnessioouss"], ["fazcryptogcetioubcdffghjklmnpqrstvwxyaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetiousnessyzsness"], ["aOAEIOUYXWouafacetioubcdfghjklmnpqrstvwaxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetfacetioubcdffghjklfmnpqrstvwxyzsneasfacetioaAAaaAaacrypotographyAaaaaaubcdfghjklmnpqrstvwxyzbcdfghjklmnpabstemiousnessqrstvxyzsnessbstemioussneytiousnessssiAousnessy"], ["abcdfgbhjklmnpabsteemiousnessfacetioubcdffghjklmnpqrswxyzsnesaAAaaAaaAaaiaeaeiouyfacetiousnessaAAaaAaaaeiouyfaceftiousneneussAaaiaeaeiouyfacetiousnessioaeioaAAaAaaAaafacetioubcdffghjklmnpqrswxyzsnessaaauyfacfacetiousnessetiousniaeaeiiouyfacetiousnessioouyessouyaaabcdfghjklmnpqrstvwcpsbcdfghjklmnpabstemiousnessqrstevwxyzologyxyzabcdfghjklmnpqrstvwxyzsqrstvxyzAAaAaaAaaaaaa"], ["heBLBaAAaaAaaAaaiaeaeiouyfacetiousnessioouyaaaibcdfghjklmnpqrstvwcpsbcdfgbcaAAaaAaaAaaaaadfgjhabstemiousnessjdklmnpqrstvwxyzhjklmnpabstogyxyz"], ["aeioaAAaAaaAaaaaauyfacfacetiousnessetyiousness"], ["aAEuIOUYXWouy"], ["facetioubcdfaeiouyfacetiousnessyfghjpbcdfghfacetioubcdfghfacetioubcaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqrstvwxyzsnnessWouafacetioubcdfghjklmnpqrstvwxyzsnesseioaAAaAaaAaaaaauyfacfacetiousnessetiousnessydffghjpbcdfghfcacetioubcdfghjwxyzsnessjklgmnpabstemiousnessqrsttvwxyzlozgyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfcryptogracpymniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["aoeiouyfacouyfacetieousnessaeiiociaeaeiocpsyccryptographyhologyuyfacpsypsycfacetioubcdfghjklmdizziyycpyhologyetiousnyennsss"], ["bcdfghjklmnpaieiieouyabstemioussnesssqrsstvwxyz"], ["aeipbcdfghjklgmnpabstaeiocryptographcyuyfacetiousnessemiousnessqrzlogyeiiouy"], ["fazcryptogcaoeiouyfacouyfacetieousnessaeiiociaeaeiocpsyccryptographyhologyuyfacpsypsycfacetioubcdfghjklmdizziyycpyhologyetiousnyennsssetioubcdffghjklmnpqrstvwxyzsnesscpology"], ["facetioubcdffghjpbcdfghfacetioubcdbcdfghjklmnpabsteusnessqrstyyvxyzfghjwxyzsnessjklgmnpabstemiousnessqrstvwxyzlogyklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsness"], ["facetioubcdffghjklfmniaeaeiiouyfacetiousnessioouypqrstvwxyzsnessaeiouyffazcetioubcdffghjklmnpqrstvwxyzsnessacetauAEIOUYXWouyiousnessy"], ["aAAaaAaaAaaiaeaeiouyfacetibcdfgbhjklmnpabstemiousneABCDEFGHIJKLMNdOPQRSTUVWXZsisqrstvxyzaousnessioouyaaa"], ["aieiaOAEIOUYXfazcetioubcdffghjklAEIOUYXWmnpqaeiocryptographcyyuyfacetpsycinousnessrstvwxyzsnnessWouyouy"], ["aAAaaAaaAaaiaeaeiouyfacetiousneiaeaoeiiouyfacetiousnessioouyfghjklmnpqrstvwxyz"], ["bcdfgjhabaeioiaeaeiocpsyccryptographyhologyuyfacetiousnessiaoouyuyennsstemiousnessjklmnpqrstvwxyz"], ["Y"], ["Yy"], ["bb"], ["BCDFGHJKLMPQRSTVWXZ"], ["aeiou"], ["AEIOU"], ["AEIOUY"], ["Yaeiou"], ["AEIOUy"], ["tbcdfghjklmnpqrstvwxyz"], ["absetemiousneaeiouyss"], ["aeioaeiouyuy"], ["aedizzinessiouy"], ["cryptaedizzinessiouyography"], ["cryptaedizzinessiouyoegraphy"], ["asiouyAaaaaa"], ["aeio"], ["crypteaedizzinessiouyoegraphy"], ["aedizzinessiou"], ["cryptopgraphy"], ["AEIOUYaeioaeiouyuyXW"], ["absstemiousness"], ["faasiouyAaaaaacetiousness"], ["AEIOUYX"], ["tbcdfghjklmnpaeiotvwxyz"], ["abstem"], ["caeiouyryptopgraphy"], ["cryptofacetiousnesspgraphy"], ["absstemioussness"], ["cryptofacetieousnesspgraphy"], ["aeioaeiocryiptofacetiousnesspgyuy"], ["bckdfghjklmnpqrstvwxyz"], ["aeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphy"], ["EEcryptofacetiousnesspgraphyTfnuhVC"], ["UCuMNjTHX"], ["cryptographty"], ["yptograp"], ["cryptoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphy"], ["ABCDEIFGHIJKLSGTUVWXYZ"], ["ybcdfghjklmnpqrstvwxyztograp"], ["aAAaAaaAaaaaatbcdfghjklmnpqrstvwxyz"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrstvwxyz"], ["caeiouyryptopgriaphy"], ["yptograAEIOUYaeioaeiouyuyXWp"], ["aAAaAaaAaaaaatlbcdfghjklmnpqrstvwxyz"], ["bcdfghjklmnpqrdizzinessstvwx"], ["aAAcryptoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaa"], ["aeiiy"], ["aedizzinesaAAaAaaAaaaaa"], ["absbtem"], ["AEIOUYfaasiouyAaaaXaacetiousnessXW"], ["dizzizness"], ["aAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaa"], ["UCuMNjTCHX"], ["psychol"], ["tbcdfghdizzinessjklmnpqrstvwxyz"], ["bvwxaedizzinessiouyyz"], ["tbcdfghdizzinessjklmnpqrstvwxyzcryptofacetieousnesspgraphy"], ["abstaeiiyem"], ["bAGAJ"], ["aAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaa"], ["ypgtograp"], ["cryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphy"], ["aedizzinesaAAaAaaApsycholaaaaa"], ["aycrypteaedizzinessiouyoegraphy"], ["abstaieiiyem"], ["bcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphypqrstvwxyz"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaaaaa"], ["tbcdfghjklaeiiymnpqrstvwxyz"], ["absaedizzinessioubtem"], ["aoeioaeiouyeuy"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryptofacetiousnesspgraphyceaaAaaaaa"], ["aAAcryptoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphynaAaaAaaaaa"], ["dizziznesns"], ["cryptografacetiousnessphty"], ["tbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwxyz"], ["aeioaeiocrpyiptofacetiousnesspgyuy"], ["AAEYXW"], ["aAAaAaaAaaaaatbabstemvpqrstvwxyz"], ["AaAAaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXW"], ["aedizzineAsaAAaAaaAaaaaa"], ["aAAaAaaAaaaaatbtcdfghjklmnpqrstvwxyz"], ["tbcdfghdizzinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaaaaatofacetieousnesspgraphy"], ["bcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyz"], ["abssteminoussness"], ["ographty"], ["UCuMNujTHX"], ["aw"], ["aeicrypteaedizzinessiouyoegraphyoaeiouyuy"], ["absAAEYXWtemiousness"], ["tbcdfghdizzinessjklmnpqrstvxwxyz"], ["tbcdfghdizzitnessjmnpqrstvwxyz"], ["aAAaAaaAaaaaatbcdfghjklmnpqrstvwxybcdfghjklmnpqrstvwxyztograpyz"], ["aoeio"], ["aedizzinessioeuy"], ["AEIOUYfaasiouyAaaaXaacetiousnessXoW"], ["absaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtem"], ["oKyvC"], ["aeiifacetiousnessy"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaa"], ["UCuoaoeioaeiouyeuyMNujTHX"], ["caedizzinessiouyryptaedizzinessiouyography"], ["aedizzinesaAAaAaaApsycholaaacryptografacetiousnessphtyaa"], ["cryptoaphty"], ["aAAcrypcaeiouyryptopgriaphytoaeiypgtograpoaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaa"], ["fnacetiousness"], ["AaAAaAaaWAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXW"], ["tbcdfghjklmnvwxyz"], ["bcdfghjklmnpqrstvwxaAAaAaaAaaaaatbabstemvpqrstvwxyzyz"], ["UCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaa"], ["ooio"], ["iaeiiy"], ["crypteaedizzinessiouyoegraphaedizzinessiouy"], ["tbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyz"], ["bcdfghjsklmnpqrdizzinessstvwx"], ["UCuoaaedizzinessiouoeioaeiouyeuyMNujTHX"], ["UCuMNjaAAcrypcaeiabstaeiiyemeioaeiocryiptofaceaaAaaaaa"], ["AaAAaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaetbcdfghdizzinessioaeiouyuyXW"], ["UCuMNujTX"], ["caeiouyryptoaedizzinesaAAaAaaAaaaaapgraphy"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaa"], ["aAAcrypcaeioeiabstemiousnessopaeiocryiptofaceaaAaaaaa"], ["aAAcrypcaeiabsstemiousnessouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaa"], ["aAAcaaAaaaaa"], ["tbcdfghjlmnpaeiotvwxyz"], ["aoeiocaedizzinessiouyryptaedizzinessiouyography"], ["bcdfghjklcryptopgraphymnaeioaeiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyz"], ["bcdfghjklcryptopgraphymnaeioaeiocryiptohfacetiousnesspgypuycrypteaedizzinessiouyz"], ["tbcdfgdhjklmnpqrstvwxyz"], ["aAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAbckdfghjklmnpqrstvwxyzaaaaa"], ["tbcdfghjklmnpyptograAEIOUYaeioaeiouyurstvwtxyz"], ["UCuMNujX"], ["abstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaeiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzm"], ["AMQRI"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgrapshyceaaAaaaaa"], ["bcdfghjklcryptopgraphymnaeabsAAEYXWtemiousnessioaeiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyz"], ["phsogy"], ["UCuMphsogyNjTHX"], ["didzziness"], ["cryptaedizzaAAcrypbcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzcaeiouyryptopgriaphytoaeioaeiocryiptofahyaAaaAaaaaainessiouyoegraphy"], ["tbcdfghdizzinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaabsaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemaaaatofacetieousnesspgraphy"], ["fnacetiousnaedizzinesaAAaAaaApsycholaaaaaess"], ["abcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphy"], ["aoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaazinessiouyography"], ["diztbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdizness"], ["aAAaAaaAAaaaaa"], ["aeiao"], ["aedicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphyzzinessioeuy"], ["abssaeioaeiouyuytemiousness"], ["aeioaeiocryiyptofacetiousnesspgyuycrypteaedizzinessiouyoegraphy"], ["aAAcrypcaeiouyryptopgriaphytoaeioaeriocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaa"], ["aedicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspegraphyzzinessioeuy"], ["tbcdfghdizzpinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaabsaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemaaaatofacetieousnesspgraphy"], ["tbcdfghdizzinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyaedizzinessiouryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaaaaatofacetieousnesspgraphy"], ["abssteminoAAEYXWussness"], ["crytptoapcryptaedizzinessiouyographyhty"], ["bcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessioeuyz"], ["aAAcrypcaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaaaiaeiiyeioeiabstemiousnessopaeiocryiptofaceaaAaaaaa"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxyz"], ["s"], ["AaedizzinesaAAaAaaAaaaaaI"], ["AEIOUYaeioaeiouyaAAcrypcaeioeiabstemioousnessopaeiocryiptofaceaaAaaaaauyXW"], ["abssteminoAAuEYXWussness"], ["AaAAaAaaWAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnoaeiouyuyXW"], ["absaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemaaaatbcdfghjklmnpqrstvwxyz"], ["aAAaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaaaAaaAaaaaa"], ["UCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaa"], ["aAAaAAcrypcaecaeiouyryptopgraphyiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaaaAaaAaaaaa"], ["abstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzm"], ["psycholcaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyogy"], ["oKyvcrypteaedizzinessiouyoegraphyC"], ["aAAaAAcrypcaecaeiouyryptopgraphyiouyryptopgriaphytoaeioaeiocryiptofaceaAEIOUYXaAaaaaaaAaaAaaaaa"], [""], ["absaedizzicryptaedUCuMNujTHXegraphynessioubtemaaaatbcdfghjklmnpqrstvwxyz"], ["aAAaAaaAaaaaatlbcdfghjklmnpqrstvwxfyz"], ["abstaeiiypsycholcaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyogyem"], ["tbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuyXWpqrsyz"], ["aAAatbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwxyzAaaAaaaaatbcdfghjklmnpqrstvwxyz"], ["tbcdfghjklmnpyptograAEIOUYaeioaeiouyurstvwtxydz"], ["aeioaeiocryiyptofacetiousnesspgyuycrypteabstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzmaedizzinessiouyoegraphy"], ["caeiouyryptoaedizzinesaAAaAaabstemiousnessaAaaaaapgraphy"], ["AEIOUYaeioaeiouyiuyXW"], ["yptograAEIOUYaeioaeiotbcdfghjlmnpaeiotvwxyzyXWp"], ["AaAAaAaaAaaaaatlbcdfghjklmnpqrstvwaxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXW"], ["tbcdfghdizzinessjklmnpqrstvwxwxyz"], ["sss"], ["caeiouyryptoaedizzinesaAAaAaabstcryptofacetieousnesspgraphyemiousnessaAaaaaapgraphy"], ["iaaeiiy"], ["UCuoaaedizzinessiouoeiooaeiouyeuyMNujTHX"], ["tbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouz"], ["bcdfghjklmnpqrstvwxaAAaAaaaaaAaaAaaaaatbabstemvpqrstvwxyzyz"], ["aeiouuy"], ["bcdfghjkvlmnpqrstvwxyz"], ["tbcdfghdizzinessjklmnpqrstvwxzyz"], ["aoeiozcaediozzinessiouyryptaedizzinessiouyography"], ["tbcdsfghjklmnpyptograAEIOUYaeiobckdfghjklmnpqrstvwxyzaeiouyurstvwtxyz"], ["tbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiobAGAJuz"], ["crpyptography"], ["aediazzinesaAAaAaaApsychoaaaaa"], ["AEIOUYaeioaeiouyaAAcrypofaceaaAaaaaauyXWaAAaAaaAaaaaatbcdfghjklmnpqrstvwxyz"], ["caeiouyryptoaedizzinesaAAaAaabstetbcdfghdizzinessjklmnpqrstvwxzyzmiousnessaAaaaaapgraphy"], ["aAAaAaaAaaaaatlbcdfghjklmnpqrstvawxyz"], ["abssbcdfghjklmnaeioaeiocryiptofacetiousnesspggyuycrypteaedizzinessioeuyzteminoussness"], ["zoKyvcrypteaedizzinessiouyoegraphyC"], ["AEIOUYfaasiouyAaaatXaacetiousnessXoW"], ["aeioyaeiocryiptofacetiousnesspgyuy"], ["UCuAEIOUYaeioaeiouyiuyXWTX"], ["bcdfghjklmnpqrdizzinessstvtbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuyXWpqrsyzwx"], ["tbcdfghjkmnpqrstvwxyz"], ["aUCuMNjaAAcrypcaeiabstaeiiyemeioaeiocryiptofaceaaAaaaaaAAAEIOUYaeioaeiouyaAAcrypcaeioeiabstemioousnessopaeiocryiptofaceaaAaaaaauyXWaAaaAAaaaaa"], ["caeiouyryabsaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemhy"], ["AaAAaAaaAaaaaatlbcdfghjklmnpqrstvwaxyzEIOUyaeioaeiocrpyipAEIOUYXWtofacetiousnesspgyuyYaeioaeiouyuyXW"], ["aoeiAEIOUYaeioaeiouyaAAcrypcaeioeiabstemioousnessopaeiocryiptofaceaaAaaaaauyXW"], ["absasteminoAAuEYXWussness"], ["abstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzninessiouypzaaAaaaaatbabstemvpqrstvwxyzyzm"], ["absaedizzicryptaedUCuMNujTHXegraphynessioubtemaaaatbcdfghjklmnpqrstwvwxyz"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryptofacetiousnesspgrapaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaahyceaaAaaaaa"], ["fnacetiousnahedizzinesaAAaAaaApsycholaaaaaaess"], ["UCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptaycrypteaedizzinessiouyoegraphyofaceaaAaaaaa"], ["absaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaeiouyaAaaaaainessiouyoegraphynessioubtemaaaatbcdfghjklmnpqrstvwxyz"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnesssopaeiocryiptofaceaaAaaaaa"], ["psycohol"], ["tbcdfghdizzinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaabsaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemaaaatofacetieoussnesspgraphy"], ["cryptyoaphty"], ["cryptofacetieousnesspgraphyAaAAaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyipawuyYaetbcdfghdizzinessioaeiouyuyXW"], ["UCuAEIOUYaeuioaeiouyiuyXWTX"], ["ovCKyvvC"], ["dizness"], ["absas"], ["aeiifacetiousnessydiztbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdizness"], ["ypgtogryarp"], ["tbcdfghjklmnpyptograAEIOUYaeioaeioueyurstvwbtxydz"], ["absaedizzicryptaedUCuMNujTHXegraphynessioubtemaxyz"], ["tbcdfgdhjkylmnpqrstvwxyz"], ["caeiouyryptoaedizzinesaAAaAaabstetbcdfghdizzinessjklmnpqrstvwxmzyzmiousnessaAaaaaapgraphy"], ["psylchlol"], ["bcdfghjklmnaeioaeiaeiiyocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphypqrstvwxyz"], ["AaAAaycrypteaedizzinessiouyoegraphyaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXW"], ["ssss"], ["tbcdfghjklmnvwxyzcryptoaphty"], ["caedizzinessiodizziznessssiouyography"], ["dizzinesscaedizzinessiouyryptaedizzinessiouyography"], ["aeioaeiiouyuy"], ["fnfnacetiousnahedizzinesaAAaAaaApsycholaaaaaaessacetiousnahedizzinesaAAaAaaApsycholaaaaaaess"], ["bcdfghjklmnaeioaeiaeiiyocryiptofacetiespsylchlolspgyuycrypteaedizzinessiouyoegraphypqrstvwxyz"], ["aoefnfnacetiousnahedizzinesaAAaAaaApsycholaaaaaaessacetiousnahedizzinesaAAaAaaApsycholaaaaaaesso"], ["pslychol"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxycaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyz"], ["aedizzineAsaAAaaAaaAaaaaa"], ["UCuoaoeioaeiouyeuayMNujTHX"], ["AMQRaAAcrypcaeiabsstemiousnessouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaaI"], ["tbcdfghdizzitnessjmnpqrstvyptograAEIOUYaeioaeiotbcdfghjlmnpaeiotvwxyzyXWpyz"], ["aAAaAaaAaaaaapqrstvwxyz"], ["ABCDEIFGHIJKLSGTUVfnfnacetiousnahedizzinesaAAaAaaApsycholaaaaaaessacetiousnahedizzinesaAAaAaaApsycholaaaaaaessWXYZ"], ["absbtbem"], ["aAAaAAcrypcaecaeiouyryptopgyiouyryptopgriaphytoaaoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaazinessiouyographyeioaeiocryiptofaceaaAaaaaaaAaaAaaaaa"], ["aeioaeiocryiyptofacetiousnesspgyuycrypteabstaeiiyebcdfghjklmnpqrstvwxaAAaAbicdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzmaedizzinessiouyoegraphy"], ["bcdfghaaAaaaaatbabstemvpqrstvwxyzyz"], ["tbcdfghjklmoueyurstvwbtxyldz"], ["aooeioaouyeuy"], ["tbcdfghjklmnpyptograAEIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouz"], ["aAAaAaaAaaaaatlbcadfghjklmnpqrstvwxyz"], ["tbcdfgzhdizzinessjklmnpqrstvwxwxyz"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybdfghjklmnpqrstvwxyztograpxyz"], ["bcz"], ["absmtaieiiyem"], ["aediazzineAsaAAaAaaAaaaaa"], ["caeiouyryabsaediabstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaeiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzmzzicryptaedizzaAAcryphcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemhy"], ["bcdfghjklmnpqrdizzinesvwx"], ["absaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaeiouyaAaaaaphynessioubtemaaaatbcdfghjklmnpqrstvwxyz"], ["bcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegratvwxyz"], ["aeypgtogryarpiao"], ["aeiifacetiousnessydiztbcdfghjklmnpyaoeiozcaediozzinessiouyryptaedizzinessiouyographyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdizness"], ["tbcdfgdhjklmnpqrqstvwxyz"], ["aoefnfnacetiousnahedizzinesaAAaAaaApsycholaaaaaaessacetiousnahedizzinesaAAaAaaApsycholaaayaaaesso"], ["tbcdfghdizzinnessjklmnpqrstvwxzyz"], ["caeiouyryabsaedizzicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraeioaphynessioubtemhy"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocrytofacetiousnesspgraphyceaaAaaaaa"], ["tbcdfghjkmnpqraAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaatvwxyz"], ["AEIOUYYX"], ["abssteminoaAAaAaaAaaaaatbtcdfghjklmnpqrstvwxyzAAuEYXWussness"], ["AEIOUYaeioaeiouyaAAcrypcaeioeiabstemioousnessopaeiocryiptofaceaaAaaaAAaAaaAaaaaatbtcdfghjklmnpqrstvwxyzaaauyXW"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryptofacetiousnesspgUCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaraphyceaaAaaaaa"], ["aAAcryptoayptographynaAaaiaaeiiyAaaaaa"], ["pslychpsycohol"], ["tbcdfghjklmnpyptpsycholcaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyogyograAEIOUYaeioaeiouyurstvwtxyz"], ["bcdfjklmnpqrdizzinesvwx"], ["crroKyrvCyptopgraphy"], ["UCuMNjaAAcrypcaeiabstaeiiyemeioaeiocryiptofaceaaAaaaa"], ["tbcdfghjklmnpoKyvCyptograAEIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouz"], ["UCUuMNNujX"], ["atbcdfghdizzinessjklmnpqrstvwxwxyzoeio"], ["tbcdfgdhdjklmnpqrqstvwxyz"], ["aAAaAAcrypcaecaaeiouyryptopgraphyiouyryptopgriaphytoaeioaeiocryiptofaceaAEIOaeioaeiocryiaAAcryptoayptographynaAaaiaaeiiyAaaaaaptofacetiousnesspgyuyaaaaAaaAaaaaa"], ["UCuWlDVSrhNaoaoeioaeiouyeuayMNujTHX"], ["cryptograpabsaedizzicryptaedUCuMNujTHXegraphynessioubtemaxyzhty"], ["aeioaeiocryipntofacetiousnesspgyuy"], ["tbcdfghAaAAaycrypteaedizzinessiouyoegraphyaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXWjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuyXWpqrsyz"], ["aoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnhessopaaeiocryptoffacetiousnesspgraphyceaaAaaaaaaazinessiouyography"], ["absbtabsstemioussnessem"], ["abcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzeioaeiocryiptofacetiousUCuMNujXnesspgyuycryepteaedizzinessiouyoegraphy"], ["aedicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacbckdfghjklmnpqrstvwxyzetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphyzzinessioeuy"], ["bcdfghjsklmnpaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryptofacetiousnesspgUCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaraphyceaaAaaaaaqrdizzinessstvwx"], ["aAAaAaaAaaaaatbcdfghjklmnpqrstcdfghjkAlmnpqrstvwxyztograpyz"], ["ovCKyvvKC"], ["bcdfghjklncryptopgraphytbcdfghjkmnpqraAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaatvwxyzinessiouyz"], ["AEIOUYXXW"], ["tbcdfghAaAAaycrypteaedizzinessiouyoegraphyaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaeiouyuyXWjklmnpyptograAEIOUYaeioaeioouyaAAcrypauyXWuyuyXWpqrsyz"], ["abstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocmryiptohfacetiousnesspgyuycrypteaedizzninessiouypzaaAaaaaatbabstemvpqrstvwxyzyzm"], ["abssteminoAkBlAEYXWussness"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousneeaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaa"], ["crayptopgraphy"], ["abcdfghjklmnaoeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzeioaeiocryiptofacetiousUCuMNujXnesspgyuycryepteaedizzinessiouyoegraphy"], ["bvwxaedizzinessiocaeiouyryptoaedizzinesaAAaAaabstemiousnessaAaaaaapgraphyuyyz"], ["aeioaeiocryiyptofacetiousnesspaedizzinessiouyoegraphy"], ["AAEYX"], ["oKyvcrypteaeiifacetiousnessydiztbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdiznessaedizzinessiouyoegraphyC"], ["UCUuMcaedizzinessiouyryptaedizzinessiouyographyNNujX"], ["crypteaedizzinoessiouyoegratbcdfghjklmnpoKyvCyptograAEIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouzphy"], ["aAAaAaaAafnacetiousnessaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxycaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyz"], ["abvwxaedizzinessiouyyzediazzineAsaAAaAaaAaaaaa"], ["bcdfghjklcryptopgraphymnaeioaeiyocryiptohfacetiousnesspgypuycrypteaedizzinessiouyz"], ["py"], ["tbcgdfghjkhz"], ["aeioaeiocrytbcdsfghjklmnpyptograAEIOUYaeiobckdfghjklmnpqrstvwxyzaeiouyurstvwtxyziyptofacetiousnesspgyuycrypteabstaeiiyebcdfghjklmnpqrstvwxaAAaAbicdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzinessiouyzaaAaaaaatbabstemvpqrstvwxyzyzmaedizzinessiouyoegraphy"], ["ogrraphty"], ["atbctbcdfghjklmnpoKyvCyptograAEIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouzio"], ["bcdfghjklmnaeioaeiocryiptofacetiousnessAEIOUYYXpgyuycrypteaedizzinessiouyoegratvwxyz"], ["UCuMNjaAAcrypcaeiabstaeitbcdfghjklmnvwxyzcryptoaphtyiyemeioaeiocryiptofaceaaAaaaaa"], ["diztbcdfghjklmnpypztograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdizness"], ["AEIOUYfaasiouyAaIaaXaacetiousnessXoW"], ["oKyvcrypteaeiifacetiousnessydiztbcdfghjklmnpyptograAEIOUYaeioaeiouypsycholcaeiouyryptoaedizzinesaAAaAaaAaaaaapgraphyogyuyXWpqrstvwtxyzzdiznessaedizzinessiouyoegraphyC"], ["UCTX"], ["tbcdfghAaAAaycrypteaedizzinessiouyoegraphyaAaaAaaaaatlbcdfghjklmnpqrstvwxyzEIOUyaeioaeiocrpyiptofacetiousnesspgyuyYaeioaebcdfghjsklmnpaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryptofacetiousnesspgUCuMNjaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaraphyceaaAaaaaaqrdizzinessstvwxoaeiouyaAAcrypauyXWuyuyXWpqrsyz"], ["aeiouutbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuyXWpqrsyzy"], ["aooeio"], ["aoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeusnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaazinessiouyography"], ["diznabstaeiiyebcdfghjklmnpqrstvwxaAAaAbcdfghjklcryptopgraphymnaeioaecaeiouyryptopgriaphyiocryiptohfacetiousnesspgyuycrypteaedizzninessiouypzaaAaaaaatbabstemvpqrstvwxyzyzms"], ["caeiouyryptoaedizzinesaAAacryptopgraphyAaabstetbcdfghdizzinessjUCuoaoeioaeiouyeuyMNujTHXklmnpqrstvwxzyzmiousnessaAaaaaapgraphy"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxycaeiabssteminoAkBlAEYXWussnessouyryptoaedizzinesaAAaAaaAaaaaapgraphyz"], ["abcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiotbcdfghjklmnvwxyzcryptoaphtyuyoegraphy"], ["aeeio"], ["aoeiocaedizzinessiouyryptaedizaAAcrypuyography"], ["bcdfAMQRIghjklmnpqrstvwxyz"], ["bcdfghjkUCuoaaedizzinessiouoeioaeiouyeuyMNujaAAaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofaceaaAaaaaaaAaaAaaaaaTHXlmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphypqrstvwxyz"], ["caeiouyryptoaeedizzinesaAAaAaabstetbcdxzyzamiousnessaAaaaaapgraphy"], ["aAAatbcdfghjklmnvwxyzAaaAaaaaatlbcadfghjklmnpqrstvwxyz"], ["aoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyrycryptoaphtyptopgriaphytoaeiabstemiousnhessopaaeiocryptoffacetiousnesspgraphyceaaAaaaaaaazinessiouyography"], ["abbsas"], ["crypteaedizzinoessiouyoegratbcdfghjklmnpoKyvCyptograAEabsasIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouzphy"], ["caeioaedicryptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspeegraphyzzinessioeuyuyryptopgriaphy"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxycaeiouyryptoaeioaeiiouyuyaedizzinesaAAaAaaAaaaaapgraphyz"], ["aeiifacetiousnessydiztbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdidizzinesszness"], ["tbcdfghdizzinessjklmnpqrstvwxyzcrypaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaeiocryiptofaceaaAaabsaedizzicriyptaedizzaAAcrypcaeiouyryptopgriaphytoaeioaeiocryiptofacetiousnesspgyuyfacetieousnesspgraphyaAaaAaaaaainessiouyoegraphynessioubtemaaaatofacetieoussnesspgraphy"], ["absaedizzicryptaedUCuMNujTHXegraphynessioubtemaaaatbcdfghjklmnpqirstvwxyz"], ["tbcdfghajklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyz"], ["aAAcrypcaeiouyryptopgriaphytoaeiypgtogryarpabstemiousnessopaaeiocrytofacetiousnesspgraphyceaaAaaaaa"], ["caeiouyryptoaedizzinesaAAaAaabstetbcdfghdizzinessjklmnpqrstvwxzyzmiousnessUCuMNjaAAcrypcaeiabstaeiiyemeioaeiocryiptofaceaaAaaaaaAaaaaapgraphy"], ["aAAcrypcaeiouyryptopgriaphAMQRIytoaeiypgtogryarpabstemiousnessopaaeiocrytofacetiousnesspgraphyceaaAaaaaa"], ["aaw"], ["aAAaAaaAaaaaatbcdfghjkllmnpqrstvwxyz"], ["yuyYaeioaeiouyuyXW"], ["aAAaAaaAaaaaatbcdfghjklmnvpqrsybcdfghjklmnpqrstvwxyztograpxycaeioaAAaAaaAaaaaatbabstemvpqrstvwxyzuyryptoaeioaeiiouyuyaedizzinesaAAaAaaAaaaaapgraphyz"], ["aAAaAaaAaaaaatlbcadfghjklmnpqrstvwxtbcdfghdizzitnessjmnpqrstvyptograAEIOUYaeioaeiotbcdfghjlmnpaeiotvwxyzyXWpyzyz"], ["AaedizzinesaAAaAaAaaaaaI"], ["yptograAEIOUYaeioaeiottbEcdfyXWp"], ["aoeiocaedizzinessiouyryptaedizaAAcrypcaeiouyryptopgriaphytoaeiabstemiousinessopaaeaiocryptofacetiousnesspgraphyceaaAaaaaAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocryptofacetiousnesspgraphyceaaAaaaaaaazinessiouyography"], ["pslychpsyctbcdfghajklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyz"], ["oKCyvC"], ["UCuMNaeioaeiocryiptofacetiousnessapgyuy"], ["aedizzineAsaAAaaAaaAaaaaaUCuAEIOUYaeuioaeiouyiuyXWTX"], ["UCuMNjaAAcrypcaeiouyryptopaeiouutbcdfghjklmnpyptograAEIOUYaeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuyXWpqrsyzygriaphytoaeioaeiocryiptofaceaaAaaa"], ["abAAEYXWtems"], ["aeiifacetiousnessydiztbcdfghjklmnpyptograAEIOUYaeioaeiouyuyXWpqrstvwtxyzzdidizzinesszneabcdfghjklmnaeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyzeioaeiocryiptofacetiousnesspgyuycrypteaedizzinessiouyoegraphyss"], ["aAAcrypcaeiouyryptopgriaphytoaeiabstemiousnessopaaeiocrayptofacetiousnesspgraphyceaaAaaaaa"], ["UCuMNjaAAcrypcaeiouyryptopgriapphytoaeioaeiocryiptofaceacrayptopg"], ["clUaEPUIN"], ["aedizzineAsaAAaaabstemiousnessAaaAaaaaa"], ["apiao"], ["ABCDEIFGHIJKLSGTUVfnfnacetiousnahediinesaAAaAaaApsycholaaaaaaessWXYZ"], ["tbcdfghjklmoueybtxyldz"], ["absaeddizzinesscaedizzinessiouyryptaedizzinessiouyographyizzicryptaedUCuMNujaphynessioubtemaaaatbcdfghjklmnpqirstvwxyz"], ["crypteaedizziouyoegratbcdfghjklmnpoKyvCyptograAEIOUYaeeioaeioAEIOUYaeioaeiouyaAAcrypauyXWuyuaedizzinessiouzphy"], ["bvwxaedizzinessiocaeiouyryptoUCuWlDVSrhNaoaoeioaeiouyeuayMNujTHXaedizzinesaAAaAaabstemiousnessaAaaaaapgraphyuyyz"]], "completion": "\ndef vowels_count(s):\n \"\"\"Returns the number of vowels in the given string.\n \n Vowels in this case are 'a', 'e', 'i', 'o', 'u'.\n Here, 'y' is also a vowel, but only when it is at the end of the given word.\n \n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \n \"\"\"\n s = s.lower()\n vowels = ['a', 'e', 'i', 'o', 'u']\n count = 0\n for i in range(len(s)):\n if s[i] in vowels:\n count += 1\n elif s[i] == 'y' and i == len(s) - 1:\n count += 1\n return count\n", "raw_completion": "Here is the completed function definition:\n\n```python\ndef vowels_count(s):\n \"\"\"Returns the number of vowels in the given string.\n \n Vowels in this case are 'a', 'e', 'i', 'o', 'u'.\n Here, 'y' is also a vowel, but only when it is at the end of the given word.\n \n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \n \"\"\"\n s = s.lower()\n vowels = ['a', 'e', 'i', 'o', 'u']\n count = 0\n for i in range(len(s)):\n if s[i] in vowels:\n count += 1\n elif s[i] == 'y' and i == len(s) - 1:\n count += 1\n return count\n```\n\nThe function first converts the input string to lowercase to simplify the checking of vowels. Then, it initializes a list of vowels and a count variable to 0. It iterates through each character in the input string and checks if it is a vowel or a 'y' at the end of the word. If it is, it increments the count variable. Finally, it returns the count variable.", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\nFIX = \"\"\"\nAdd more test cases.\n\"\"\"\n\ndef vowels_count(s):\n \"\"\"Write a function vowels_count which takes a string representing\n a word as input and returns the number of vowels in the string.\n Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a\n vowel, but only when it is at the end of the given word.\n\n Example:\n >>> vowels_count(\"abcde\")\n 2\n >>> vowels_count(\"ACEDY\")\n 3\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/65", "prompt": "\ndef circular_shift(x, shift):\n \"\"\"Circular shift the digits of the integer x, shift the digits right by shift\n and return the result as a string.\n If shift > number of digits, return digits reversed.\n >>> circular_shift(12, 1)\n \"21\"\n >>> circular_shift(12, 2)\n \"12\"\n \"\"\"\n", "entry_point": "circular_shift", "canonical_solution": "\n\n s = str(x)\n if shift > len(s): return s[::-1]\n shift %= len(s)\n if shift == 0:\n return s\n else:\n return s[len(s) - shift:] + s[:len(s) - shift]\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(100, 2) == \"001\"\n assert candidate(12, 2) == \"12\"\n assert candidate(97, 8) == \"79\"\n assert candidate(12, 1) == \"21\", \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(11, 101) == \"11\", \"This prints if this assert fails 2 (also good for debugging!)\"\n\n", "contract": "\n assert type(x) == type(shift) == int, \"invalid inputs\" # $_CONTRACT_$\n assert x >= 0 and shift >= 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[100, 2], [12, 2], [97, 8], [12, 1], [11, 101]], "atol": 0, "plus_input": [[16, 3], [1234, 6], [341209, 4], [789456123, 10], [500, 4], [345, 1], [86314, 3], [22, 4], [987654321, 9], [777, 10], [23, 789456124], [341209, 3], [341209, 341209], [789456123, 23], [789456122, 789456123], [500, 3], [23, 16], [789456123, 777], [15, 2], [789456122, 789456122], [23, 22], [789456124, 789456124], [2, 3], [10, 6], [2, 345], [789456123, 789456123], [15, 6], [23, 10], [22, 777], [789456124, 3], [3, 3], [789456123, 11], [501, 3], [15, 23], [9, 777], [1, 777], [1235, 23], [15, 9], [341209, 5], [5, 789456123], [499, 3], [1, 776], [12, 4], [341209, 789456124], [776, 23], [10, 1], [2, 777], [3, 2], [14, 14], [341210, 5], [22, 8], [341208, 4], [777, 777], [12, 12], [4, 3], [987654321, 3], [15, 15], [500, 500], [987654321, 987654321], [501, 4], [12, 10], [5, 776], [2, 22], [341208, 345], [15, 1], [3, 341209], [789456124, 341209], [22, 23], [14, 10], [5, 341209], [1234, 10], [22, 5], [6, 776], [8, 8], [11, 10], [1234, 1235], [341208, 10], [789456124, 23], [3, 9], [5, 23], [5, 4], [789456122, 3], [14, 15], [9, 8], [777, 12], [501, 777], [499, 499], [3, 6], [2147483647, 11], [55672, 10], [9999999999, 15], [123456789, 100], [85858585858585858585858585, 26], [123456789987654321, 99], [1234567890, 1000], [0, 1000], [1234567890987654321, 158], [999999999999999999999999999999999999999, 200], [9999999998, 55671], [26, 85858585858585858585858585], [9999999998, 9999999998], [9999999999, 85858585858585858585858585], [1234567891, 1234567890], [85858585858585858585858585, 55671], [123456789, 85858585858585858585858585], [123456789, 123456789], [1000, 1000], [100, 55671], [85858585858585858585858585, 123456788], [158, 25], [27, 85858585858585858585858584], [9999999999, 123456789], [123456789, 123456790], [10000000000, 85858585858585858585858585], [1000, 123456788], [1234567891, 1000], [2147483647, 9999999998], [158, 999999999999999999999999999999999999999], [10000000000, 9999999999], [26, 85858585858585858585858584], [2147483646, 11], [123456789987654321, 1000], [55672, 1000], [10000000000, 10000000000], [99, 1000], [99, 99], [10000000000, 1000], [123456789, 99], [9999999999, 10000000000], [85858585858585858585858585, 85858585858585858585858585], [85858585858585858585858584, 123456789987654322], [999999999999999999999999999999999999999, 99], [1234567890987654321, 98], [1000, 98], [999999999999999999999999999999999999999, 999999999999999999999999999999999999999], [1234567891, 1234567891], [2147483647, 1001], [55672, 26], [1234567890, 123456789], [2147483647, 1234567890987654322], [10000000001, 9999999999], [123456788, 123456789], [99, 85858585858585858585858585], [123456789987654322, 123456789987654322], [9999999998, 1001], [9999999997, 9999999998], [55672, 85858585858585858585858584], [27, 11], [999, 1000], [25, 25], [55672, 25], [1234567890987654322, 1234567890987654322], [9999999999, 9999999998], [199, 200], [157, 25], [9999999999, 9999999999], [2147483648, 11], [159, 158], [100, 100], [1234567891, 85858585858585858585858585], [11, 12], [55674, 24], [1234567890987654321, 100], [26, 26], [2147483648, 1234567890], [123456789987654321, 123456789987654321], [123456789, 1000], [10000000000, 11], [158, 158], [98, 99], [85858585858585858585858585, 25], [98, 25], [1234567890987654321, 1234567890987654321], [100, 85858585858585858585858585], [1000, 28], [55675, 24], [28, 55671], [199, 1234567890987654322], [26, 11], [27, 2147483646], [55672, 1234567890], [24, 25], [55671, 10], [157, 85858585858585858585858584], [998, 123456789], [25, 26], [9999999997, 9999999997], [159, 1234567890987654321], [123456790, 123456790], [15, 99], [159, 123456790], [85858585858585858585858584, 27], [1234567890987654323, 1234567890987654322], [0, 1234567890987654321], [158, 1000], [27, 27], [9999999999, 123456789987654321], [55671, 85858585858585858585858583], [85858585858585858585858584, 85858585858585858585858584], [10000000001, 10000000002], [10000000000, 98], [1002, 123456789987654321], [2147483646, 1001], [55675, 2147483646], [13, 11], [28, 27], [1234567890987654321, 9999999999], [28, 1000], [159, 159], [98, 55672], [1000000000000000000000000000000000000000, 999999999999999999999999999999999999999], [10000000000, 123456790], [123456789, 1234567890987654322], [123456789987654322, 98], [2147483646, 100], [99, 98], [1234567890, 27], [1234567890987654323, 25], [200, 200], [85858585858585858585858585, 1234567890987654322], [98, 98], [123456789987654321, 9999999998], [85858585858585858585858583, 11], [27, 159], [123456789, 9999999999], [999, 2147483646], [2147483647, 200], [85858585858585858585858584, 11], [1001, 1234567890], [2147483646, 10000000002], [1234567890987654323, 1234567890987654323], [11, 11], [85858585858585858585858585, 55672], [55674, 9999999998], [1234567890987654321, 99], [11, 1000], [123456789, 10000000002], [12, 1234567890987654322], [98, 1001], [2147483647, 1234567891], [1234567891, 0], [123456789, 1234567890], [123456789987654322, 55671], [1002, 123456789987654320], [123456789987654320, 123456789987654320], [2147483648, 1234567891], [2147483647, 2147483647], [123456789987654319, 1002], [10000000000, 24], [27, 9999999997], [9999999996, 123456789987654319], [1234567890987654321, 999999999999999999999999999999999999999], [9999999999, 123456790], [123456789987654321, 1234567890987654323], [55674, 85858585858585858585858585], [156, 157], [1234567891, 98], [156, 99], [123456789987654320, 123456789987654321], [10, 11], [2147483647, 2147483648], [123456787, 11], [1001, 27], [25, 199], [25, 158], [9999999998, 9999999999], [123456789, 200], [1234567892, 1234567892], [99, 100], [27, 12], [55674, 15], [199, 9999999999], [1001, 1000], [998, 13], [2147483648, 2147483648], [2147483646, 26], [28, 1234567891], [85858585858585858585858586, 85858585858585858585858586], [1234567890987654324, 1234567890987654323], [123456789987654323, 98], [55672, 123456787], [55672, 0], [1234567890987654324, 26], [13, 1000], [26, 99], [55671, 200], [1234567891, 26], [85858585858585858585858585, 27], [2147483647, 1234567892], [1002, 85858585858585858585858585], [123456789987654320, 123456788], [55672, 55672], [55674, 10000000000], [157, 199], [2147483646, 85858585858585858585858583], [159, 2147483647], [123456787, 123456787], [2147483648, 12], [200, 11], [1234567890987654321, 123456789], [998, 11], [27, 85858585858585858585858583], [157, 123456789987654323], [2147483647, 99], [1234567890987654321, 85858585858585858585858583], [10000000000, 0], [1234567891, 25], [1234567890, 85858585858585858585858585], [999999999999999999999999999999999999998, 123456789987654321], [123456790, 123456789], [24, 100], [1234567891, 123456789987654319], [201, 199], [26, 25], [998, 123456787], [1234567890, 99], [100, 11], [10000000001, 1000], [1234567890987654322, 200], [999999999999999999999999999999999999998, 999999999999999999999999999999999999999], [1002, 1002], [1002, 85858585858585858585858583], [123456789987654319, 123456789], [1000, 1000000000000000000000000000000000000000], [55671, 99], [9999999998, 55674], [1002, 9999999999], [1001, 200], [1234567890987654322, 98], [2147483647, 85858585858585858585858583], [123456789, 999], [1234567891, 123456789987654321], [1234567890, 123456789987654321], [55671, 55671], [1234567890987654324, 55672], [55671, 123456789987654319], [55672, 1234567890987654324], [99, 85858585858585858585858586], [201, 11], [13, 123456789], [123456789, 2147483647], [100, 9999999998], [10000000000, 15], [98, 1234567890987654322], [55673, 25], [100, 55673], [123456790, 2147483647], [97, 97], [85858585858585858585858585, 55674], [156, 999999999999999999999999999999999999999], [27, 123456789987654323], [10000000003, 2147483646], [0, 85858585858585858585858586], [200, 201], [97, 2147483646], [199, 1000], [9999999996, 9999999996], [25, 200], [12, 1234567890987654321], [123456789987654319, 99], [85858585858585858585858585, 123456787], [9999999999, 98], [10000000003, 10000000003], [10000000000, 10000000001], [97, 123456789987654323], [1000000000000000000000000000000000000000, 1234567891], [123456787, 28], [123456789, 98], [9999999997, 2147483646], [1234567890, 2147483647], [55672, 55671], [1234567890, 1234567890], [158, 1234567890], [85858585858585858585858585, 1234567892], [100, 1000000000000000000000000000000000000000], [9999999997, 98], [123456789987654320, 11], [9999999997, 156], [85858585858585858585858584, 2147483647], [123456787, 1001], [123456789, 2147483646], [1234567890987654324, 0], [123456787, 98], [85858585858585858585858586, 27], [100, 99], [157, 1234567892], [1234567892, 1234567890], [55672, 9999999998], [55672, 9999999999], [0, 55672], [159, 0], [55673, 85858585858585858585858585], [2147483648, 998], [9999999997, 1234567890987654324], [2147483648, 997], [202, 11], [199, 2147483646], [15, 9999999997], [202, 55676], [997, 200], [9999999997, 1234567890], [27, 16], [1001, 1001], [123456789987654319, 123456789987654319], [1234567891, 12], [99, 1234567890], [85858585858585858585858584, 1234567890987654323], [10000000001, 10000000003], [1, 1234567892], [998, 55674], [25, 99], [16, 85858585858585858585858586], [1234567890987654321, 123456788], [201, 55676], [123456788, 2147483646], [1000, 1001], [1234567890987654325, 1234567890987654325], [9999999999, 55675], [9999999998, 27], [14, 9999999996], [10000000000, 2147483647], [998, 123456786], [10000000000, 9999999998], [9999999996, 2147483646], [12, 13], [1234567890987654323, 85858585858585858585858585], [123456789, 1234567889], [85858585858585858585858585, 2147483645], [1000, 157], [1234567890987654321, 1234567890], [100, 2147483647], [998, 998], [27, 1234567891], [158, 10000000002], [1234567890987654322, 1234567890987654323], [24, 99], [201, 201], [10000000001, 11], [1234567892, 0], [123456789987654319, 1234567890987654323], [1001, 0], [1234567892, 27], [1234567891, 1234567892], [97, 10], [123456787, 158], [123456788, 13], [55673, 123456789], [999, 9999999997], [11, 123456789], [123456788, 123456788], [159, 160], [9999999998, 1234567890], [1234567891, 13], [999, 100], [123456786, 10000000000], [1001, 14], [200, 1234567892], [1002, 999999999999999999999999999999999999999], [1000, 999], [158, 123456787], [26, 27], [55675, 55675], [55674, 1234567890], [202, 1234567890987654323], [1234567890987654322, 1234567890987654321], [12, 123456789], [999999999999999999999999999999999999999, 25], [85858585858585858585858583, 123456789987654320], [85858585858585858585858586, 85858585858585858585858584], [9999999999, 55671], [10000000003, 101], [123456789, 159], [12, 11], [1002, 1001], [160, 158], [159, 123456791], [100, 101], [55671, 9], [123456788, 1001], [1000, 27], [55676, 24], [201, 27], [199, 24], [1234567890987654321, 26], [25, 9999999996], [999, 1234567890987654323], [1234567890987654324, 1234567890987654324], [159, 1234567890], [24, 123456787], [157, 157], [157, 55671], [999999999999999999999999999999999999999, 85858585858585858585858583], [100, 1000], [9, 1234567890987654325], [199, 123456788], [13, 85858585858585858585858584], [9999999997, 123456788], [200, 9999999999], [85858585858585858585858584, 28], [11, 100], [123456787, 85858585858585858585858585], [10000000001, 10000000000], [85858585858585858585858586, 85858585858585858585858585], [10000000003, 10000000002], [1000, 200], [1234567890987654322, 9], [1234567890987654321, 9], [123456789987654323, 9999999997], [1234567890987654323, 0], [55671, 8], [26, 10000000000], [85858585858585858585858585, 85858585858585858585858584], [8, 1234567890987654323], [1234567891, 9], [1234567889, 1234567890], [99, 158], [85858585858585858585858585, 2147483646], [8, 1001], [10000000000, 123456788], [2147483646, 2147483646], [1234567889, 1234567888], [1234567891, 2147483647], [1234567890987654321, 1234567890987654322], [27, 85858585858585858585858585], [1234567892, 158], [26, 0], [123456789987654322, 0], [1234567890987654325, 85858585858585858585858584], [85858585858585858585858584, 26], [100, 0], [1234567891, 156], [1001, 1000000000000000000000000000000000000000], [2147483648, 98], [55675, 55674], [1234567891, 1003], [1234567890987654323, 997], [1003, 1003], [158, 2147483648], [55673, 9999999998], [1234567890987654321, 0], [13, 12], [1234567890987654324, 85858585858585858585858583], [123456789, 123456789987654320], [999999999999999999999999999999999999998, 100], [123456789987654322, 1003], [16, 2147483646], [9999999998, 10000000001], [9999999995, 9999999996], [1234567890987654324, 1234567890987654325], [15, 55674], [1000, 156], [15, 2147483646], [123456789987654323, 9], [1000000000000000000000000000000000000000, 1000000000000000000000000000000000000000], [9999999996, 2147483648], [55674, 9999999999], [199, 998], [85858585858585858585858586, 0], [123456790, 11], [11, 10000000001], [999, 159], [15, 13], [1234567891, 99], [1234567890987654322, 123456789987654320], [85858585858585858585858583, 199], [9999999996, 0], [9999999999, 99], [1234567889, 10000000002], [200, 55675], [25, 998], [98, 10], [1234567890987654320, 1234567890987654322], [999999999999999999999999999999999999998, 28], [10000000003, 160], [123456791, 27], [123456789987654321, 123456789], [123456789, 1234567892], [1000000000000000000000000000000000000000, 998], [999999999999999999999999999999999999999, 13], [8, 1234567890987654325], [123456791, 123456790], [158, 2147483647], [100, 102], [10000000003, 102], [123456789987654319, 2147483646], [202, 2147483648], [1002, 27], [2147483648, 999], [15, 200], [0, 5], [12, 0], [12, 3], [1, 0], [123456789, 10], [11, 201], [9, 9], [123456790, 99], [0, 9999999999], [10, 9], [10, 100], [123456789987654321, 85858585858585858585858584], [158, 9999999999], [11, 9999999999], [200, 123456789987654321], [15, 26], [11, 0], [123456789, 101], [9, 10], [25, 9], [28, 85858585858585858585858584], [123456788, 100], [158, 9999999998], [10, 101], [15, 1000], [8, 10], [55671, 0], [17, 17], [28, 158], [0, 0], [85858585858585858585858583, 85858585858585858585858584], [10, 12], [8, 11], [16, 18], [28, 999], [10, 10], [201, 15], [15, 25], [85858585858585858585858586, 100], [17, 85858585858585858585858584], [123456790, 8], [7, 11], [7, 123456790], [200, 12], [123456788, 123456787], [17, 16], [85858585858585858585858586, 2147483647], [123456786, 123456787], [55672, 1], [11, 2147483647], [55671, 16], [199, 999], [6, 2147483647], [158, 123456790], [123456789987654322, 123456789987654321], [199, 12], [1234567890987654321, 10000000000], [7, 158], [1000, 26], [55673, 55672], [16, 55671], [2147483647, 6], [8, 123456790], [10, 8], [201, 200], [29, 999], [123456790, 123456791], [29, 7], [123456789, 8], [85858585858585858585858587, 85858585858585858585858585], [55672, 11], [28, 28], [28, 99], [18, 55672], [85858585858585858585858583, 1234567890], [15, 999999999999999999999999999999999999999], [100, 85858585858585858585858584], [123456791, 55671], [29, 123456790], [7, 28], [1234567891, 11], [10, 2147483647], [123456791, 123456789987654323], [29, 55671], [123456789987654323, 123456789987654323], [0, 8], [100, 15], [12, 999], [85858585858585858585858583, 123456789], [26, 999999999999999999999999999999999999999], [999, 123456788], [85858585858585858585858584, 1234567891], [200, 199], [123456790, 17], [123456787, 123456786], [158, 123456789], [25, 9999999999], [1234567891, 28], [999999999999999999999999999999999999999, 999999999999999999999999999999999999998], [85858585858585858585858584, 55671], [16, 16], [11, 158], [123456790, 999], [7, 7], [123456789, 26], [6, 28], [999, 28], [9999999999, 103], [12, 19], [28, 998], [12, 123456789987654323], [998, 123456790], [200, 999], [1000, 17], [7, 85858585858585858585858587], [123456790, 26], [15, 2147483647], [9, 101], [85858585858585858585858587, 8], [123456788, 158], [16, 15], [10, 18], [998, 55671], [55674, 17], [98, 8], [123456790, 123456788], [123456791, 12], [101, 100], [17, 55671], [11, 999999999999999999999999999999999999999], [999, 999], [16, 17], [29, 9999999998], [101, 101], [123456791, 123456791], [999, 1234567889], [18, 123456791], [10, 55672], [55671, 55672], [1234567889, 158], [11, 10000000000], [1234567891, 8], [25, 123456790], [200, 85858585858585858585858584], [1234567890987654321, 123456791], [19, 19], [11, 19], [123456788, 9999999999], [99, 103], [9999999998, 123456788], [18, 27], [85858585858585858585858584, 85858585858585858585858583], [16, 55673], [85858585858585858585858586, 123456791], [25, 1234567890], [17, 1], [1234567890, 98], [11, 20], [123456789987654323, 26], [20, 998], [5, 5], [123456788, 999999999999999999999999999999999999998], [85858585858585858585858587, 85858585858585858585858587], [2147483647, 85858585858585858585858584], [12, 100], [123456789987654321, 123456787], [28, 85858585858585858585858583], [25, 8], [10, 1234567890987654321], [1000, 199], [1234567890, 8], [100, 123456789], [29, 100], [28, 100], [6, 7], [999, 998], [123456791, 123456789987654321], [85858585858585858585858587, 26], [1234567890, 100], [999, 199], [10, 123456787], [123456789987654323, 123456789987654321], [198, 199], [9999999999, 999999999999999999999999999999999999999], [15, 0], [123456789, 55671], [1234567890987654320, 1234567890987654321], [1234567889, 123456789], [123456790, 55674], [16, 55674], [99, 55671], [1234567891, 100], [123456789987654323, 123456789987654320], [85858585858585858585858584, 85858585858585858585858585], [123456789987654323, 123456789987654322], [999999999999999999999999999999999999999, 0], [29, 11], [10, 20], [20, 20], [1234567890987654322, 1234567890987654320], [103, 28], [25, 123456788], [19, 10], [85858585858585858585858585, 10000000000], [26, 100], [6, 2147483646], [1000, 85858585858585858585858585], [29, 158], [9, 1234567890987654321], [85858585858585858585858585, 123456791], [123456788, 1234567890987654322], [2147483647, 201], [11, 26], [123456788, 123456789987654321], [102, 198], [123456786, 15], [7, 8], [20, 27], [100, 1234567890], [85858585858585858585858585, 1234567889], [18, 17], [10000000000, 100], [17, 29], [8, 123456789987654321], [123456787, 123456790], [1234567888, 1234567888], [4, 5], [123456789987654323, 123456790], [999, 85858585858585858585858585], [29, 29], [10000000000, 123456787], [999999999999999999999999999999999999998, 15], [17, 198], [999, 123456790], [16, 10], [46, 45], [85858585858585858585858585, 999999999999999999999999999999999999998], [29, 201], [123456788, 85858585858585858585858584], [123456790, 15], [123456791, 101], [1234567890987654322, 29], [998, 2147483647], [10000000001, 10000000001], [123456790, 28], [46, 1234567890987654322], [123456790, 45], [1234567892, 11], [85858585858585858585858585, 199], [18, 4], [15, 100], [1234567890987654321, 2147483647], [123456786, 123456786], [1234567888, 45], [999999999999999999999999999999999999998, 20], [1000, 9], [1234567891, 5], [45, 1000], [85858585858585858585858585, 999], [2147483647, 15], [5, 99], [159, 123456789], [1, 123456789987654323], [12, 7], [85858585858585858585858584, 9], [45, 85858585858585858585858584], [99, 102], [85858585858585858585858585, 9999999999], [24, 9999999998], [20, 99], [101, 2147483647], [19, 11], [1234567890, 11], [1234567890, 999], [12, 123456787], [1234567888, 999], [30, 25], [1, 123456786], [17, 4], [11, 27], [103, 103], [24, 123456789987654321], [11, 25], [85858585858585858585858583, 85858585858585858585858583], [46, 2147483647], [103, 104], [123456791, 102], [25, 123456789987654323], [85858585858585858585858584, 2147483646], [85858585858585858585858585, 85858585858585858585858586], [46, 10000000000], [6, 6], [123456790, 0], [55671, 11], [8, 10000000001], [999999999999999999999999999999999999998, 999999999999999999999999999999999999998], [7, 25], [6, 85858585858585858585858585], [123456789987654323, 1234567888], [4, 4], [14, 13], [123456788, 85858585858585858585858586], [158, 157], [200, 100], [13, 14], [100, 1234567890987654320], [1234567890987654322, 26], [104, 28], [10, 99], [101, 102], [4, 123456789987654321], [1, 999999999999999999999999999999999999999], [13, 2147483647], [98, 158], [98, 85858585858585858585858585], [9999999998, 123456787], [1234567890987654320, 85858585858585858585858583], [101, 85858585858585858585858584], [17, 123456790], [20, 55675], [25, 85858585858585858585858587], [11, 123456789987654321], [200, 28], [1234567890987654321, 103], [999999999999999999999999999999999999999, 999999999999999999999999999999999999997], [55674, 11], [55673, 6], [1234567888, 13], [11, 999999999999999999999999999999999999998], [46, 46], [123456789, 12], [1234567889, 10000000000], [123456787, 123456788], [7, 55674], [198, 0], [1234567888, 40], [17, 999999999999999999999999999999999999998], [123456789987654322, 28], [98, 1234567890987654320], [19, 85858585858585858585858587], [1, 17], [123456789987654323, 8], [26, 1000], [55672, 17], [55676, 85858585858585858585858586], [12, 15], [104, 1000], [1234567890987654321, 11], [55673, 55674], [55675, 26], [12, 201], [1000000000000000000000000000000000000000, 123456789987654323], [103, 102], [98, 103], [8, 28], [55674, 2147483646], [0, 1], [123456790, 123456787], [123456790, 123456792], [55672, 55673], [16, 85858585858585858585858587], [123456791, 7], [158, 14], [10, 123456789], [27, 26], [24, 24], [55674, 55674], [28, 85858585858585858585858586], [998, 123456791], [17, 199], [1000000000000000000000000000000000000000, 1234567889], [1, 7], [1234567889, 999999999999999999999999999999999999999], [20, 201], [0, 12], [101, 15], [12, 55672], [12, 8], [123456792, 17], [123456789987654320, 85858585858585858585858583], [198, 15], [123456789987654321, 123456789987654323], [101, 8], [55676, 1234567890987654323], [104, 999], [1001, 2147483647], [11, 85858585858585858585858584], [20, 21], [198, 10000000001], [55671, 98], [199, 199], [18, 55671], [123456792, 123456791]], "completion": "\ndef circular_shift(x, shift):\n \"\"\"\n Circular shift the digits of the integer x, shift the digits right by shift and return the result as a string.\n If shift > number of digits, return digits reversed.\n \"\"\"\n str_x = str(x)\n if shift >= len(str_x):\n return str_x[::-1]\n else:\n return str_x[-shift:] + str_x[:-shift]\n", "raw_completion": "```python\ndef circular_shift(x, shift):\n \"\"\"\n Circular shift the digits of the integer x, shift the digits right by shift and return the result as a string.\n If shift > number of digits, return digits reversed.\n \"\"\"\n str_x = str(x)\n if shift >= len(str_x):\n return str_x[::-1]\n else:\n return str_x[-shift:] + str_x[:-shift]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef circular_shift(x, shift):\n \"\"\"Circular shift the digits of the integer x, shift the digits right by shift\n and return the result as a string.\n If shift > number of digits, return digits reversed.\n >>> circular_shift(12, 1)\n \"21\"\n >>> circular_shift(12, 2)\n \"12\"\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/66", "prompt": "\ndef digitSum(s):\n \"\"\"Task\n Write a function that takes a string as input and returns the sum of the upper characters only'\n ASCII codes.\n\n Examples:\n digitSum(\"\") => 0\n digitSum(\"abAB\") => 131\n digitSum(\"abcCd\") => 67\n digitSum(\"helloE\") => 69\n digitSum(\"woArBld\") => 131\n digitSum(\"aAaaaXa\") => 153\n \"\"\"\n", "entry_point": "digitSum", "canonical_solution": "\n return sum([ord(ch) for ch in s if ch.isupper()])\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(\"\") == 0, \"Error\"\n assert candidate(\"abAB\") == 131, \"Error\"\n assert candidate(\"abcCd\") == 67, \"Error\"\n assert candidate(\"helloE\") == 69, \"Error\"\n assert candidate(\"woArBld\") == 131, \"Error\"\n assert candidate(\"aAaaaXa\") == 153, \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(\" How are yOu?\") == 151, \"Error\"\n assert candidate(\"You arE Very Smart\") == 327, \"Error\"\n\n", "contract": "\n assert type(s) == str, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[""], ["abAB"], ["abcCd"], ["helloE"], ["woArBld"], ["aAaaaXa"], [" How are yOu?"], ["You arE Very Smart"]], "atol": 0, "plus_input": [["123"], ["ABCD"], ["abcd"], ["HELLOworld"], [":;<=>?@[\\]^_`{|}~"], ["ABC123def456GHI"], [" A B C D "], ["UPPER"], ["lowercase"], ["Ab56"], ["lowrcase"], ["ABC123def45l6GHlowrcaseI"], ["1123"], [":;<=>?@[\\]^_`{ABC123def456GHI"], ["HELLOworrld"], ["lowercalowercasese"], [" A B C D "], [" A B C D "], ["1Ab56cacbcd23"], ["HELrLOworrld"], ["1123ABCD"], ["12:;<=>?@[\\]^_`{|}~ABC123def456GHI3"], ["Ab556"], ["112lowercalowercasese3"], [":;<=>?@[\\]^_`{_|}~"], ["lowercase123"], [" A B C D 23"], [" A C D "], ["1Ab56caacbcd23"], [" A C D "], ["HELLOworld A B C D "], ["HELLrOworrld"], ["112lowercalowercasese31123"], ["abcd1123A12:;<=>?@[\\]^_`{|}~ABC123def456GHI3BCD"], [" A B C D "], ["abc1Ab56cacbcd23d"], ["HELrLOworrlHELLOworld"], ["UPPRER"], ["abcd1123A1C123def456GHI3BCD"], [" A B CC D "], [":;<=>?@[]\\]^_`{|}~"], ["lowercasese31123"], [" A B A C D C D "], [" A B C D "], [" AHELrLOworrld B C D "], [" A C D "], ["abc1Ab56cacd23d"], [" A B A C D C D 23"], [" A B A B C D A C 3"], ["DABCD"], [" A A B C D B CC D "], ["abcd1123A12:;<=>?@[\\]^_`3{|}~ABC123def456GHI3BCD"], ["lowercalowe1Ab56caacbcd23casese"], ["AB A C D C123def456GHHI"], ["lowrcacse"], [":;<=>?@[]\\]^_`{|"], [" AHELrLOwo A B C D d B C D "], [":;<=>?@[]\\]^_` A B C D {|}~"], [" :;<=>?@[\\]^_`{ABC123def456G A B A B C D A C 3HIA B C D "], ["abcd1123A12:;<=>?@[\\]^_`3{|}~ABC123def4lowercase56GHI3BCD"], ["ABC123deIf456GHI"], [" AHELr1123ABCDLO B C 1D "], [":;<=>?@[\\]^:_`{ABC123def=456GHI"], [" :;<=>?@lC 3HIA B C D "], ["112lowercaercasese31123"], ["UPR"], ["alowerwercasese"], [" AabcdHELr1123ABCDLO B C 1D "], ["abcd1123A12 A B C D :;<=>?@[\\]^_`{|}~ABC123def456GHI3BCD"], ["ABC123def:;<=>?@[\\]^_`{|}~456GHI"], [":;<:;<=>?@[\\]^:_`{ABC123def=456GHID {|}~"], [" HELLOworrld A B C D "], [" AabcdHELr1123ABCDLO BC 1D "], ["abc1HELLOworrldAb56cacbcd23d"], [":;<=>?@[]\\]^_`{ AabcdHELr1123ABCDLO BC 1D |}~"], ["1Ab56ca1cbcd23"], ["H:;<:;<=>?@[\\]^:_`{ABC123def=456GHID {|}~"], [" A B A C D C D 23"], ["abcd1123A12:;<=>?@[\\]^_ HELLOworrld A B C D `3{|}~ABC123def456GHI3BCD"], ["lowercasese23"], [" :;<=>?@[\\]^_`{ABC123def456G A B A A B C A B C D 23 D A C 3HIA B C D "], ["112lowercalow HELLOworrld A B C D ercasese3"], [" A abcd C D "], [":;<:=>?@AB A C D C123def456GHHI6GHI"], ["ABC123deabcd1123A12:;<=>?@[\\]^_`3{|}~ABC123def4lowercase56GHI3BCDIf456GHI"], [":;<:;<=>?@[\\]^:_`{ABC123def=456GHID UPPER{|}~"], [" A B A C D C D "], ["112lowercalrow HELLOworrld A B C D ercasese3"], ["URPPRER"], ["l :;<=>?@[\\]^_`>{ABC123def456G A B A B C D A C 3HIA B C D A B C D 23owercase"], [" A B C D"], ["12:;<=>?@[\\`]^_`{|}~ABC123def456GHI3"], [" :;<=>? AabcdHELr1123ABCDLO BC 1D lC 3HIA B C D "], ["lowercalowesle"], ["HELL A C D Oworld"], ["ABC123def1Ab56ca1cbcd23456GHI"], ["ABC123def1Ab56ca1cbcd AabcdHELr1123ABCDLO BC 1D 23456GHI"], [":;<=>?@[\\]^_`{;_|}~"], [" A B AHELr1123ABCDLO B C 1D AAb556"], ["HEL AHELrLOwo A B C D d B C D LOworld"], ["1A$Bc&Def3@F"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACES"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZ"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["HELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL."], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890"], ["tHisIsaCrazyMiXofUPPERandloWercaseLENTERS"], ["This\nis\ta\ttest\twith\nnewlines\tand\ttabs"], ["with"], ["tHisIeLENTERS"], ["and"], ["tabs"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPACES"], ["tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["witWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["is"], ["THISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACES"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["newlines"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines"], ["a"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACES"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["ttabs"], ["tHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPTHISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACESACES"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["This"], ["aHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.d"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Def3@FandloWeBrcaseLENTERS"], ["Thhis"], ["ABCDEtHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSFGQRSTUVWXYZnewlines"], ["witWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["12345ABCDEFGHJIJKLMNOPTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nQRSTUVWXYZ67890"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZnewlinesand"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["ABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNOnPQRSTUVWXYZnewlinesand"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYELETTERS.WercaseLENTERS"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNOnPQRSTUVWXYZnewlinesandY?IHopDeYOURdayISgoingWELL.d"], ["Thshisd"], ["tHisRIsaCrazyMiXofUPwitWOWTHIttabs.WercaseLENTERS"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["newlwines"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTHERSANDNOSPACESNDNOSPACES"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.JIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACES"], ["newlinThhis"], ["ThhiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTCODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["This\nis\ta\ttest\twith\nnewlines\tans"], ["aaaaaABCDEFGHIJKLMNOPQRWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.STUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRZ"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGST12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890RINGWITHMANYUPPERCASELETTERSANDNOSPACES"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Def3@FandloWeBrcaseLENTERRS"], ["iABCDEFGHIJKLMNOPQRSTUVWXYZs"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890"], ["ABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesand"], ["ABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQRSTUVWXYZnewlind"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZ"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5tABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesand4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thRy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sis5sn5t5M5t5n"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPACESWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["aaaaMaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["aaaaMaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSPACESNDNOSPACESTTTUUVVVVWWWXXXYYYZZZ"], ["tHisIsaCrazyMABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$Bc&Def3@FandloWeBrcaseLENTERRS"], ["tHisIsaCrazyMABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BLENTERRS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["JZApAM"], ["nWOWTHISISSUCHALONGSLTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESASELETTERS.ewlinThhis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinesandY?IHopDeYOURdayISgoingWELL.d"], ["newines"], ["ABCDEFGHIJKLMNOPMQRSTUVWXYZnewlines"], ["JZMApAM"], ["tHisIsaCrazyMiXofUPPERandloWercaseLENaTERS"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345AB0"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.PPER1A$Bc&Def3@FandloWeBrcaseLENTERRS"], ["tHisIsaCrazyMiXofUPPERandseLENTERS"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Decf3@FandloWeBrcaseLENTERS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n55t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["weeZIF"], ["This\nis\ta\ttest\twith\nnewlines\tasns"], ["12345UVWXYZ67890"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5n"], ["ABCDEFGHIJKPQRSTUVWXYZnewlines"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERS"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVEWRFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["bsSPbpM"], ["12345ABCDEFGHJIJThis\nis\ta\ttest\twith\nnewlines\tansKLMNOPQRSTUVWXYZ67890"], ["THISISALONGSTRINGWITHMANYUPTPERCASELETTisERSANDNOSPACESWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["isThis\nis\ta\ttest\twith\nnewlines\tand\ttabs"], ["12345UVWXYZ678W90"], ["newlinThhiTHISISALONGSTRINGWITHMANYUPTPERCASELETTisERSANDNOSPACESWLOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.s"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOS12345ABCDEFGHJIJKLMNOPTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nQRSTUVWXYZ67890PACESWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["WOWTHISIStHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["T12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONABCDEFGHIJKLMNOPQRSTUVWXYZnewlinesandOSPACES"], ["ansFGHIJKLMNOPQRSTUVWXYZnewlind"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPACESWOMWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["Thhihs"], ["tHisRIsaCraXzyMiXofUPPERandloWercaseLENTERS"], ["This\nis\ta\ttest\twith\nnewleines\tand\ttabs"], ["12345AB20"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Def3@FandloWeBrcaseLaENTERS"], ["TtHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYELETTERS.WercaseLENTERS"], ["witWOWTHISISSUCHALOOREVENALARGBUFFER.ITASJUSTSOMANYUPPERCASELETTERS."], ["THISISALONGSTRIN12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890GWITHMANYUPPERCASELETTisERSANDNOSPACES"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTUUVVVVWWWXXXYYYZZMZ"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.QQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["newiThhisnes"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGiABCDEFGHIJKLMNOPQRSTUVWWXYZsIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["tHisOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["rpaKTAnTG"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.d"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQVVVWWWXXXYYYZZZ"], ["ansFGHIJKLMNOPQRSTUVWXYZnewind"], ["bsPSPbp"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThis\nis\ta\ttest\twith\nnewlines\tasnsZ67890"], ["mPZHOE"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOTUUVVVVWWWXXXYYYZZZ"], ["ans"], ["isThis"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERItHisRIsaCrazyMiXofUPPERandloWercaseLENTERSFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5Nyn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["ABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQDRSTUVWXYZnewlind"], ["ansFGHIJKLMNOPQDRSTUVWXYZnewlind"], ["rpaKTAnTAG"], ["aaaaMaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSbsSPbpMPACESNDNOSPACESTTTUUVVVVWWWXXXYYYZZZ"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOv5t5sn5t5M5t5n"], ["ABCDEThis\nis\ta\ttest\twith\nnewliTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nSTUVWXYZnewlind"], ["rpaKKTAnTG"], ["This\nis\ta\ttest\twith\nnewleidnes\tand\ttabs"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThis"], ["tHisIsaCrazyMABCDEFGHIJKLEMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BLENTERRS"], ["new12345UVWXYZ678W90ines"], ["whitth"], ["1A$Bc&Dandef3@F"], ["aaaaMaABCDEIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSbsSPbpMPACESNDNOSPACESTTTUUVVVVWWWXXXYYYZZZ"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTOD5AY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALIONGSTRINGIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nThhis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERaTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACESseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGHIJKLMNOPQRSTUVWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["1XYZ67890"], ["newlinThhiTHISITh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nETTERS.s"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNJOTUUVVVVWWWXXXYYYZZZ"], ["12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["Thhhihs"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5yS5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaabbbbbbccccccddKdePQQQQVVVWWWXXXYYYZZZ"], ["tHisRIscaCrazyMiXofUPPERandloWercaseLENTERS"], ["ansFGHIJKLaHELLOthereWHATareYOUdoingTODAABCDtHisIsaCrazyMiXofUPPERandloWercaseLENaTERSEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.dYZnewlind"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPACESWOMWFTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5S5T5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinesandY?IHopDeYOURdayISgoingWELL.d"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWOaNDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["12345ABCDEFGHJIJThis\nis\ta\ttest\twith\nnewlines\tansK12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThisLMNOPQRSTUVWXYZ67890"], ["HELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELtL."], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFRUPPERCASELETTERS.Z697890"], ["ABCDMNOPMQRSTUVWXYZnewlines"], ["This\nis\ta\ttest\tw\tith\nnewlines\tans"], ["ad"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERItHisRIrpaKTAnTGsaCrazyMiXofUPPERandloWercaseLENTERSFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["newleidnes"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["Th!s!s$0nly4t3st!ng-1DERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIITh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5ahCrazyMiXofUtPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["whitth12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890"], ["12345ABCDEFGH12345ABCDEFGHJIJThisJIJKLMNOPQRSTUVWXYZ67890"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWtELL.d"], ["12345UVtHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.PPER1A$Bc&Def3@FandloWeBrcaseLENTERRS78W90"], ["newlinThhiTHISISALONThis\nis\ta\ttest\twith\nnewlines\tasnsSWLOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.s"], ["wh12345AB20itth"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPACESWOWTHISCISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThis"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnewindIJKLMNOPQRSTUVWXYZ67890"], ["whitth12345ABCDEThis\nis\ta\ttest\twith\nnewlines\tasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890"], ["ansFGHIJKLMNOPQTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESRSTUVWXYZnewind"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTOD5AY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5tERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnewindIJRKLMLNOPQRSTUVWXYZ67890"], ["tHisOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5bsSPbpM5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["12345UVWXYZaHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWtELL.dW90"], ["ABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlind"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5tH5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisIsaCrazyMABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BERRS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5tTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTHERSANDNOSPACESNDNOSPACES5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["1A$Bc&Dandef3"], ["12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5Nyn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["asnsZ67890"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Decf3@FandloWeBrcaisThis\nis\ta\ttest\twith\nnewlines\tand\ttabsLENTERS"], ["neewines"], ["neewinees"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercasWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.eLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKisKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZ"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWONDERIFITWILLOVERFLOWwh12345AB20itthMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["ZGxrhSo"], ["WOWLONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["12345B20aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["HELLOthereWHATareYOUdoingTODAY?IHYopeYOURdayISgoingWELtL."], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5bsSPbpM5ST5TS5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGSTRandINGWITHMANYUPPERCASELETTisERSANDNOSPACESWOWTHISCISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["ABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGHIJKLMNOPQRSTUVWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlind"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t55pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKisKKKLLLLMMMMNNNNOOOOPPPQTTUUVVVTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5bsSPbpM5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYYYZZMZ"], ["Thins\nis\ta\ttest\twith\nnewlines\tasns"], ["ansFGHIJKLaHELLOthereWHATareYOUdoingTODAABCDtHisIsaCrazyMiXofUPPERandloWercaseLENaTERSEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm55g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.dYZnewlind"], ["This\nTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESis\ta\ttest\twith\nnewleidnes\tdand\ttabss"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Decf3@FandloWeBrcaisThis"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATIareYOUdoingTODAY?IHoABCDEFGHIJKLMNOPQRSTUVWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["1234B20"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYTansFGHIJKLiMNOPQRSTUVWXYZnewlindhis\nis\ta\ttest\twith\nnewlines\tasnsZ67890"], ["newisThis\nis\ta\ttest\twith\nnewlines\tand\ttabsines"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPTHISISALONGCESACES"], ["nenewiThhisneswlwines"], ["THISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESis"], ["test"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t55v5ff5mm5g5yS5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercasWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANmPZHOEYUPPERCASELETTERS.eLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["ABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlind"], ["HELLOthereWHATareYOUdoingTODAY?IHopeYOURdaeyISgoingWELL."], ["tHisIsaCroazyMiXofUPPERandloWercaseLENTERS"], ["newlwineaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZs"], ["12345ABCDEFGHJIJKLMNOIPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890"], ["12345ABCDEFGHJIJKLMNOPQRSTUVTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5nsn5t5M5t5nTUVWWXYZsIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["newlinesTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5neewinesthytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["1X6YZ6789ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5n0"], ["aaaaabbbbbbccccccisKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZ"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisERSANDNOSPWOWLONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.ACESWOWTHISCISSUCHALONGSTRINGIWONDEABCDMNOPMQRSTUVWXYZnewlinesLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["THISISALONGSTRINGWITHMANYUPTPERCASELETTisERSANDNOSPACESWOWTHISISSUCHALONGSTRINGIWONDERIFaaaaabbbbbbccccccisKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["tHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS"], ["1A$Bc&Dand12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890f3@F"], ["HELLOthereWHATODAY?IHopeYOURdayISgoingWELtL."], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Tht5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.dans"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["tHisIsaCrazyMiXofUPPER1A$Bcef3@FandloWeBrcaseLENTERRS"], ["whitth12345ABCDEFGHJIJansFGHIJKLMNOPQRSTUVWXYZnewlindKLMNOPQRSTUVWXYZ67890"], ["12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5Nyn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbansK12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThisLMNOPQRSTUVWXYZ67890bbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["tHisRIscaCrazyMiXofUPPERandloWetHisRIsaCrazyMiXofUPPERandloWercaseLENTERSrcaseLENTERS"], ["ithwlwiwnes"], ["aaaaabbbbbbcccccbcdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5ncm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n55n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisIeLENTERTh!s!s$0nly4t3s12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5Nyn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbansK12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThisLMNOPQRSTUVWXYZ67890bbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890t!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["aaaaabbbbbtHisIsaCrazyMiXofUPPERandloWercaseLENaTERSVVVTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5bsSPbpM5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYYYZZMZ"], ["ABCDEFGHIJKLMisThiswlinesand"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2whitth12345ABCDEThis\nis\ta\ttest\twith\nnewlines\tasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQRSTUVWXYZnewlindTSJUSTSOMANYELETTERS.WercaseLENTERS"], ["tHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5mI5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIansFGHIJKLMNOPQTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESRSTUVWXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Tht5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.dansZGxrhSo"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t12345AB05Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["w"], ["dad"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5tTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTHERSANDNTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OSPACESNDNOSPACES5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n55n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5tS5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWtELL.d"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisILeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["ABCDEFGHIJKLMNOPQRSTUVWXYZnewlinesThis"], ["tHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5mI5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPEThinsRCATERS.WercaseLENTERS"], ["rpaKTAnnTAG"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5ahCrazyMiXofUtPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.JIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESt5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["ABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5Tn5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNOnPQRSTUVWXYZnewlinesand"], ["ww"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["ABCDEThis"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTOD5AY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS55t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsLENTERS"], ["neweines"], ["Th!s!HELLOthereWHATODAY?IHopeYOURdayISgoingWELtL.s$0nly42t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisIsaCrazyMABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITIWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BERRS"], ["newleidntHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSes"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCH12345ABCDEFGHJIJThis\nis\ta\ttest\twith\nnewlines\tansK12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThisLMNOPQRSTUVWXYZ67890ALONGSTRINGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWONDERIFITWILLOVERFLOWwh12345AB20itthMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["12345ABCDEFGHJIJKLMNOPQRSTUVJWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5S5T5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinesandY?IHopDeYOURdayISgoingWELL.d305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOv5t5sn5t5M5t5n"], ["ii"], ["THISISALONGST12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWO1NDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFETTERSANDNOSPACES"], ["JZAJpAM"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t12345AB05Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["tHisRIzyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPRERCASELETTERS.WercaseLENTERS"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETef3@FandloWeBrcaseLENTERRS"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJ2345ABCDEFGHJIJThisJIJKLMNOPQRSTUVWXYZ67890NNNNJOTUUVVVVWWWXXXYYYZZZ"], ["Tishhhihs"], ["tHisRIsaCrazyMiXofUPPERandABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlindloWercaseLENTERS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t123454ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHaaaaabbbbbbccccccdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["xP"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nv5t5sn5t5M5t5nS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["Thinsn\nis\ta\ttest\twith\nnewlines\tasns"], ["12345ABCDEFGHJ"], ["tHisRIsaCrazyMiXofLUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["whitth1s\tasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890"], ["ABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGHIJKLMNOPQRSTUVWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISNISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["newl12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIansFGHIJKLMNOPQTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESRSTUVWABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlindXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThisines"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisILeLENTERSercaseLENTERTS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggtHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["12345ABCDEFGHJIJThis"], ["212345AB20"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sns5t5M5t5nv5t5sn5t5M5t5nS"], ["THISISALONGSTRINGWITHMANYUPPERCASEL12345ARBCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACES"], ["Tishhhih1X6YZ6789ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5n0s"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZ12345ABCDEFGHJIJKLMNOIPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890ZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["12345ABCDEFGHJIJKLMNOPQRSTU12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThisVWXYWOWTHISISSUCHALIONGSTRINGIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["1678W90"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVEENALARGBUFFER.ETef3@FandloWeBrcaseLENTERRS"], ["123FGHJIJThis"], ["tHisIsaCraaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZThisERS"], ["btabs"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$tHisIsaCrazyMABCDEFGHIJKLMNWOWTHISISSUCHALONGSTRINGIWONDERIFITIWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BERRS0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.d"], ["ABCEDEThis"], ["tHisRIscaCrazyMiXofUPPERandloWercaseLENTERSd"], ["ABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisILeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5Tn5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNOnPQRSTUVWXYZnewlinesand"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn15t5M5t5nUVWXYThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TdadS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5n"], ["tHitWOWTHIttabs.WercaseLENTERS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t55v5ff5mm5g5yS5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m55t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["whitth1s\tasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$-0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENtHisRIscaCrazyMiXofUPPERandloWercaseLENTERSdeLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["ZGxrhS"], ["This\nistHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTE5RS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS\ta\ttest\twith\nnewlines\tans"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5newlinThhiTHISITh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nETTERS.sCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["Thshissd"], ["dmFWhHwdrnenewiThhisneswlwines"], ["aaaaMaABCDEIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSbsSPbpMPACESNDNOSPACESTTTUUVVVVWWWXXXTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nv5t5sn5t5M5t5nYYYZ"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnewindIJRKLMLNOPQRSTUVVWXYZ67890"], ["newasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5neidnes"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIansFGHIJKLMNOPQTHTHISISALONGSTRINGWITHMANYUPLPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESRSTUVWXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWCELLTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETef3@FandloWeBrcaseLENTERRS"], ["THISISALONGST12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890RINGWITHMANYUPPERCASELETTERSANDNOSPACES"], ["tHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYRUPPERCASELETTERS.WercaseLENTERS"], ["tHisRIsaCrazyMiXofUPPERandABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGWXYZTODAY?IHopDZGxrhSoeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES\nis\ta\ttest\twith\nnewlines\tansFGHIJKLiMNOPQRSTUVWXYZnewlindloWercaseLENTERS"], ["tHisRIzyMiXofUPHALONGSTRINTGIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPRERCASELETTERS.WercaseLENTERS"], ["112345UVWXYZ67890"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVEENALARGBUFFER.ETef3@FaLndloWeBrcaseLENTERRS"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFIT.ETTERTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nS."], ["tabsines"], ["wwaaaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZd"], ["ansK12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SithS5t5v5t5sn5t5M5t5n"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5nZGxrhS"], ["bPsSPbpM"], ["wwaaaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggXHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZd"], ["12345ABCDEFGHJIs"], ["Tishs"], ["rpaKTtHisRIscaCrazyMiXofUPPERandloWercaseLENTERSdAnTG"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5Ut5n"], ["ABCDEFGHIJKLMNOPQRSTUVWXYZn1A$Bc&Def3@Fewlinesand"], ["aHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_.c@5ES.4305t5nn5t5v5ff5mm5g55gn5t5Tht5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5YZnewlinURdayISgoingWELL.dansZGxrhSo"], ["12345B20"], ["aaaaabbbbbbcccccbcdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSSTTTTUUVTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5bsSPbpM5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nZZ"], ["ABCDMNOPMQRSTUVWXYZinewlines"], ["newleines"], ["dand"], ["12345Th!s!s$0nly4t3st!sng-1&2d%3*4@5_c@5ESnWOWTHISISSUCHALONGSLTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESASELETTERS.ewlinThhis.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nUVWXYThis"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTOD5AY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5WmaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS55t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n55n5t55Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISISALONGSTRINGneewinesWITHMThhiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdaoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETef3@eFandloWeBrcaseLENTERRS"], ["12345ABCDEFGHJIJKLMNOIGPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASErpaKTAnnTAGLETTERS.Z67890"], ["tHisRIscaCrazyMiXofUPPtHisIsaCraaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZThisERSloWercaseLENTERSrcaseLENTERS"], ["whitth12345ABCDEThis"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRIWOWTHISISSUCHALONGSTRINGIWONDERIFIT.ETTERTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nS.NGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWOaNDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL1ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SithS5t5v5t5sn5t5M5t5nVWXYZ67890ETTERSANDNOSPACESNDNOSPACES"], ["ABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES\nis\ta\ttest\twith\nnewlines\tanaaaaMaABCDEIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSbsSPbpMPACESNDNOSPACESTTTUUVVVVWWWXXXTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nv5t5sn5t5M5t5nYYYZsFGHIJKLiMNOPQRSTUVWXYZnewlind"], ["1A$Bc&Dandef3aaaaMaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHQHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["12345Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERaTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACESseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nB20"], ["aaaaaABCDEFGHIJKLMtHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWABCDEThisNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIITh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["aaaaaABCDEFGHIJKLMtHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWABCDEThisNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIITh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5S5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nIIJJJJKKKKLLLLMMMMNNNPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sTh!s!s$0nly4t3st!ng-1DERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLSSTTTTUUVVVVWWWXXXYYYZZZ"], ["ansFGHIJKLMNOPQRSTUVnWXYZnewind"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTOD5AY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5WmaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRITh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t55v5ff5mm5g5yS5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nzyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS55t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaabbbbbbcccccbcdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQQRRRbRSSSSTTTTUUVVZZ"], ["aaaaNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["HELLOthereWHATareYOUdoingTODAY?IHYopeYOURdayThinsgWELtL."], ["tHisIsaCrazyMiXofUPPER1A$Bc&Def3@FandlLoWeBrcaseLaENTERS"], ["Th!s!s$0nly4t3st!ng-1DERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn512345ABCDEFGHJIJKLMNOPTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nQRSTUVWXYZ67890t5M5t5n"], ["MSrP"], ["ansFGHIJKLMNOPQRSTUVWXYZnewliGnd"], ["newasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5tT5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5neidnes"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5a_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLtabsLENTERSMNOPQRSTUVWXYZ67890ETTHERSANDNOSPACESNDNOSPACES"], ["newasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPaHELLOthereWHATareYOUdoingTODAABCDEFGHIJKLMTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNOnPQRSTUVWXYZnewlinesandY?IHopDeYOURdayISgoingWELL.dPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5neidnes"], ["12345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISNISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMAABCDMNOPMQRSTUVWXYZinewlinesNYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890"], ["tHisIsaCrazyMiXofUPPER1A$Bc&Def3@FandloansFGHIJKLiMNOPQRSTUVWXYZnewlindXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThisinesWeBrcaseLaENTERS"], ["mw"], ["123O45Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nABCDMNOPMQRSTUVWXYZinewlinesOSPACESRSTUVWXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["This\nistHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4KtHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETef3@FandloWeBrcaseLENTERRS5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTE5RS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS\ta\ttest\twith\nnewlines\tans"], ["newTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M!5t5nlinThhis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOv5t5sn5t5M5t5nENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["Tihshhhi123FGHJIJThishs"], ["tabsLEasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890NTERS"], ["THISISALONGSTRINGWITHMANYUPaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJOPPPQQQQRRRbRSSSTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nSTTTTUUVVZZPERCASEL12345ARBCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACES"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLfENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["rpaKnKTAnTG"], ["This\nistHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTE5RS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTNERS\ta\ttest\twith\nnewlines\tans"], ["btab"], ["This\nis\ta\ttelst\twith\nnewlines\tand\ttabs"], ["tHisIsaCrazyMiXofUPPLER1A$Bc&Decf3@FandloWeBrcaisThis\nis\ta\ttest\twith\nnewlines\tand\ttabsLENTERS"], ["THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLtabsLENTERSMNOPQRSTUVWXYZ67890ETTHERSANDNOS"], ["rZGxrhS"], ["newlinThhiTHISITh!s!s$0nly4t3sHELLOthaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLYOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.QQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nETTERS.s"], ["12345BAB0"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yMn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TSt5SS5t5v5t5sn5t5M5t5n"], ["aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJJ2345ABCDEFGHJIJThisJIJKLMNOPQRSTUVWXYZ67890NNNNJOTUUVVVVWWWXXXYYYZZZ"], ["THISISALONGSTRINGWITHMANYweeZIFRSANDNOSPACES"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnewindIJKLMNOPQRSTUVWXYZ678"], ["rTpaKnKTAnTG"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALOtHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sns5t5M5t5nv5t5sn5t5M5t5nSNGSTRINGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWOaNDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["aHSgoingWELL.d"], ["asnsSWLOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS.s"], ["ansFrpaKTAnnTAGGHIJKLMNOPQRSTUVnWXYZne12345UVWXYZ678newleidntHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSes90wind"], ["tHisRIsaCrazyMiXofUPwitWOWTHIttabs.Wercas12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGiABCDEFGHIJKLMNOPQRSTUVWWXYZsIWONDERIFITWILLOVERFLOWMELETTERS.Z67890eLENTERS"], ["rnao"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5ahCrazyMiXofUtPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5THTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHHELLOthereWHATarteYOUdoingTODAY?IHopeYOURdayISgoingWELL.JIJKLMNOPQRSTUVWXYZ67890ETTERSANDNOSPACESNDNOSPACESt5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nRSANDNOSPACES"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t55n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaMaABCDEFGHIJKABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQRSTUVWXYZnewlindLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSPACESNDNOSPACESTTTUUVVVVWWWXXXYYYZZZ"], ["asnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890"], ["tabss"], ["tHisIsaCrazyMABCDEFGHIJKLMNWOWTROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.OPQRSTUVWXYZnwithewlinesandiXofUPPER1A$BLENTERRS"], ["rpAnTAG"], ["tHisRaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLSSTTTTUUVVVVWWWXXXYYYZZZIsaCrazyMiXofUPwitWOWTHIttabs.WercaseLENTERS"], ["12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTER7890ETTERSANDNOSPACESNDNOSPACESRSTUVWXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["tHisIsaCrazyMiXofUWOWTHISISSUaHELLOthereWHATarERRS"], ["witWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCERS."], ["T12345ABCDEFGHJIJKLMTHTHISISALONGSTRINGWITHMANYUPPERCASEL12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890ETTHERSANDNOSPACESNDNOSPACESNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONABCDEFGHIJKLMNOPQRSTUVWXYZnewlinesandOSPACES"], ["aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHaaaaabbbbbbccccccdddeeefffggggHHHHHIIIJIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVXYYYZZZ"], ["Thins\nis\ta\ttest\twith\nnewlisnesns"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFEMANYUPPERCASELETTERS.Z67890"], ["tHisRIzyMiXofUPHALONGSTRINTGIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFXER.ITSJUSTSOMANYUPPRER.WercaseLENTERS"], ["aaaaNNZGxrhSOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["rGTpaKnKTAnTG"], ["12345B20aaaaabbbbbbccccccddKdeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOWWXXXYYYZZZ"], ["aaaaMaABCDEFGHIJKABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQRSTThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5Ut5nUVWXYZnewlindLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaETTHERSANDNOSPACESNDNOSPACESTTTUUVVVVWWWXXXYYYZZJZ"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t55pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nWOWTHISISSUCHALONGSTRINGIWONDERIFIT.ETTERTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nS.S"], ["aaaaabbbbbbccccccdddeThis\nis\ta\ttest\twith\nnewleines\tand\ttabseefffggggHHHHHIIIIJJJOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["This\nistHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOW5THISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTE5RS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS\ta\ttest\twith\nnewlines\tans"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGABCDEtHisRIsaCrazyMiXofUPwitWOWTHISISSUCHALONGSTRINTGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSFGQRSTUVWXYZnewlinesSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFEMANYUPPERCASELETTERS.Z67890"], ["ABCDEThis\nis\ta\ttest\twith\nnewlines\tansFGHIJKLMNOPQDRSiTUVWXYZnewlind"], ["aaaaMaABCDEFGHIJKABCDEThis"], ["hTiishhhihs"], ["123O45Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nABCDMNOPMQRSTUVWXYZinesOSPACESRSTUVWXYZnewindsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThis"], ["tHisERIsaCrazyMiXofUPHALONGSTRINTGIWONDERItHisRIsaCrazyMiXofansFGHIJKLMNOPQDRSiTUVWXYZnewlindUPPERandloWercaseLENTERSFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERS"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWONDERIFITWILLOVERFLOWwh12345AB20itthMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITORORTHISISALONGSTRIN12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890GWITHMANYUPPERCASELETTisERSANDNOSPACESEVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890"], ["aaaaMaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNaaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNMNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5tThis\nistHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTE5RS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS\ta\ttest\twith\nnewlines\tans5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mmY5g55gn5t5Th5t5yn5thy5ht5t5S5t5aaaaaABCDEFGHIJKLMNOPQRSTUVWXYZbbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZt5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Thins"], ["aaaYaabbbWbbbccccccddKdePQQQQVVVWWWXXXYYYZZZ"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnThins\nis\ta\ttest\twith\nnewlisnesnsewindIJRKLMLNOPQRSTUVVWXYZ67890"], ["aaaaNNOOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n512345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONG5STRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFEMANYUPPERCASELETTERS.Z67890t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["ABCDEThisTHISISALONGSTRINGWITHMANYUPPERCASELETTisEThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHoABCDEFGHIJKLMNOPQRSTUVWXYZTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th05t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsahCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5ABCDEFGHIJKLMNOPQRSTUVWXYZn1A$Bc&Def3@Fewlinesandt5v5t5sn5t5M5t5nRSANDNOSPACES"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t25v5t5sn5t5M5t5n"], ["nRGf"], ["tHitWOWTHIttabs.WercaseLENTRS"], ["Th!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercasWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5n"], ["an"], ["ThhiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nv5t5sn5t5M5t5nv5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaOaNNOOOOPPPQQQQRRRbRSSSSTTTTUUVVZZ"], ["ansFrpaKTAnnTAGGHIJKLMNOPQRSTUVnWXYZne12345UVWXYZ678newleidntHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERIFITWILLPERCASELETTERS.WercaseLENTERSes90wind"], ["Th!s!s$0nly4t3sTt!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZMZn5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nwitWOWTHISISSUCHALONGSTRINTGIWONDERIFIaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZ12345ABCDEFGHJIJKLMNOIPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOVWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z67890ZZTWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["TrpaKnKTAnTG"], ["12345ABCDEFGHJansFGHIJKLMNOPQRSTUVWXYZnewindIJRKLMLNOPQRSTUVWXYZ67890mOPZHOE"], ["ThshissTd"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SSbtab5t5M5t5n"], ["ThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnewlines5shr5t5SS5t5v5t5sn5t5M5t5nZGxrhttabs"], ["12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHATh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g5yS5gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSs5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nLONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890"], ["hTiishhhiaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZhs"], ["LjZfMMKsDj"], ["aithand"], ["Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYO5URdayISgoingWELL.t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERThhiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th55t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t55pn5t5shr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nWOWTHISISSUCHALONGSTRINGIWONDERIFIT.ETTERTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNONOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nS.S"], ["tHisOVERFLOWMYTEXTEDITORORETh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5mI5t5nms5t4K5t5ms512345ABCDEFGHJIJKLMNOPQRSTUIVW12345ABCDEFGHJIJKLMNOPQRSTUVWXYWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSOMANYUPPERCASELETTERS.Z67890XYnewasnsFGHJIJKLMNOPQRSTUVWXTh!s!s$0nly4t3st!ng-1&2%3*4@5seLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nYZ67890%3*4@5_c@5ES.4305t5n5t5v5ff5maHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5neidnesWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFUPPERCASELETTERS.Z697890tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nVENALARGBUFFER.ITSJUSTSOMANYUPPERCATERS.WercaseLENTERS"], ["tHisIeLENTERTh!s!s$0nly4t3st!ng-1&*2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERS5t5m5t5sTh!s!s$0nly4t3st!ng-1DERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.Z678905S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nn5t5sThisTh!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.t!ng-1&2ABCDEFGHIJKLMNOPQRSTUVWXYZnIewlines5shr5t5SS5t5v5t5sn5t5M5t5nhr5t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5sn5t5M5t5nS"], ["12345ABCDEFGHJIJKLMNOPQRSTU12345Th!s!s$0nly4t3st!sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thytHisIeLENTERSercaseLENTERSL5t5m5t5sn5ST5TS5t5n5tHisRIsaCrazyMiXofUPHALONGSTRINTGIWONDERItHisRIrpaKTAnTGsaCrazyMiXofUPPERandloWercaseLENTERSFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.WercaseLENTERSt5n5t5Ar5t5pn5t5shr55t5SS5t5Th!s!s$0nly4t3sHELLOthereWHATareYOUdoingTODAY?IHope5t5sn5t5M5t5nv5t5tHisIsaCrazyMiXofUPPEPRandloWercaseLENaTERSWXYThisVWXYWOWTHISISSUCHALIONGSTRINGIWONDERIFITWILLOVERFLOWMELETTERS.Z67890"], ["Ths"], ["ABCDEwhitthXYZnewlinesThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t55S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar55t5M5t5n"], ["bans"], ["WOWTHISISSUaHELLOthereWHATareYOUdoingTODAY?IHopDeYOURdayISgoingWELL.dCHALONGSTRITh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUPPERandloWercaseLENTERS5tTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5tHisRIsaCrazyMiXofUaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZS5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5m5t5sn5ST5TS5t55n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nNGtHisIsaCrazyMiXofUPPERandloWercaseLENTERSIWOaNDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ETTERS."], [" "], [" aBcDeF12* "], ["ABCabc"], ["A"], ["hellothere"], ["abc"], ["ABC"], ["AThis\nis\ta\ttest\twith\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["THISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACESThis"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ"], ["THISISALONGSTRINGWITHMANYUPPERCASELERSANDNOSPACESThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSSALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["ABCDEFKLMNOPQRSTUVWXYZ"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\n1A$Bc&Def3@Fnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsWXYZ"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tHisIsaCrazyMiXofRUPPERandloWercaseLENTERS"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["witwh"], ["ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERS"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSSALONGSTRINGWITHMANYUPPERCASELETTTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThisERSNDNOSPACES"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["ttestsIsaCrazyMiXofRUzPPERandloWercaseLENTERS"], ["ABCDEFGHIJLMNOPQRSTUVWXYZ"], ["wittestsIsaCrazyMiXofRUPPERandloWercaseLENTERSth"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["witwhtabsBCDEFGHIJKLMNOPQRESTUVThis\nis\ta\ttabstest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["ttestsIsaCrazyMiXLENTERS"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["withWOWTHISISSUCHALONGSTRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["WOWTHISISSUFCHALtabsBCDEFGHIJKLMNOPQRSTUVThisONGSTRINGIWONDERIFFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["uidRKhwDoJ"], ["witaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZZZh"], ["THISISALONGSTRINEGWITHMANYUPPERCASELETTERSANDNOSPACES"], ["ABCDEFKLMONOPQRSTUVWXYZ"], ["tabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASESLETTERS."], ["12345ABCSTUVWXYZ67890"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\ttabsWDXYZ"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["tabsWXTHISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACESThisAThisZ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALAtabsWXYZRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["wiwth"], ["dgtm"], ["ittabsBCDEFGHIOJKLMNOPQRSTUVThish"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ"], ["THISISALONGSTRINGWITHMANYUPPERCASSELETTOERSANDNOSPACESThis"], ["tteWercaseLENTERS"], ["tHisIsaCrazyMiXofUPPERaTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nLENTERS"], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ"], ["12345ABCDEFGHJIJKLMN0OPQRSTUVWXYZ67890"], ["tabsWXYAThisZ"], ["ttestsIsaCrazyMiERS"], ["tabsttestsIsaCrazyMiERSBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["AThis"], [""], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["witwhtabsBCDEFGHIJKLMNOPQRESTUVThis"], ["tettestsIsaCrazyMiXLENTERSstestt"], ["ittabsBCDEFGHIOJKLMNOPQRSsh"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMTANYUPPERCASELETTERS."], ["ittabsBCDEFGHIOJKLMNOPQRSTUVtabsWDXYZThish"], ["iThis"], ["tabsbBCDEFs"], ["ittabsBCDEFGHIOJKLMNOPQRSTUVtabsWDXDYZThish"], ["VtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["tabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsiYWXYAThisZ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.tabsiYWXYAThisZ"], ["THISISALONGSTR12345ABCDEFGHJIJKLMNOPQRSTUVWXYZ67890NDNOSPACESThis"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSDNOSPACES"], ["tabsBCDEFGHIJKLMNOPQRS"], ["ittabsBCDEFGHIOQRSsh"], ["tabsBCDEtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t12345ABCSTUVWXYZ67890estt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabiThissBCDEFGHIJKLMNOPQRS\nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ"], ["VtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twitestth\nnewlines\tand\ttabsWXYAThisZ"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ntabsBCDEFGHIJKLMNOPQRSTUVThis"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUtabsttestsIsaCrazyMiERSBCDEFGHIJKLMNOPQRSTUVThisVVVVWWWXXXYYYZZZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ntabsBCDEFGHIJKLMNOPQRSTUVThis"], ["wittestsIsaCrazyrcaseLENTERSth"], ["antabsWXYABCDEFGHIJLMNOPQRSTUVWXYZZd"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELEcTTERSNDNOSPACES"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tstabsWXYAThisZa\ttest\ttabsWDXYZ"], ["tHisItabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERS"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["This\nis\ta\ttest\twith\nntestewlines\tand\ttabsWDXYZtabs"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabiThissBCDEFGHIJKLMNOPQRS\nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.tabsiYWXYAThisZ"], ["tHisItabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERS"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5Tt5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJGHIJKLMNOPQRSTUVThisVVVVWWWXXXYYYZZZ"], ["THISItHisIsaCrazyMiXofUPPERanAdloWerca12345ABCSTUVWXYZ67890seLENTERSStabsBCDEFGHIJKLMNOPQRSTUittabsBCDEFGHIOJKLMNOPQRSshVWXYZALONGSTRINGWITHMANYUPPERCASELEcTTERSNDNOSPACES"], ["stabsWXYAThisZa"], ["tabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThisLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSsWXYZ"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlineTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["stabsWXThisZ"], ["tabsWXTHICSISALONGSTRINGWITHMANYUPPERCASELETTERSANDNhOSPACESThisAThisZ"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.IJJJJGHIJKLMNOPQRSTUVThisVVVVWWWXXXYYYZZZ"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t1c&Def3@F5n"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5Tt5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5tt5sn5t5M5t1A$Bc&Def3@F5n"], ["tabsWDXYZsaCrazyMiXofRUPPEWRandloWercaseLENTERS"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttOesst\ttabsWDXYZ"], ["tabiThissBCDEFGHIJKLMNOPQRS"], ["tabsBCDEtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis"], ["ttestsIsaCrazyMiXofRUPPERPandloWercaseLENTERS"], ["tteWeTrcaseLENTERS"], ["VtabsBCDEFGHIJKLMNOPQRSTUVThis\niWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.s\ta\ttest\twitestth\nnewlines\tand\ttabsWXYAThisZ"], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis"], ["wiTh!s!s$0nly4t3s5t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["wiwtTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["1A$Bc&Def3@Fnewlines"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tettestsIsaCrtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tstabsWXYAThisZa\ttest\ttabsWDXYZazyMiXLENTERSstestt"], ["tabsBCDEFGHIJKLMNOPtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSQRS"], ["tteWeTrcaseLeENTERS"], ["stabsWXTisZ"], ["tabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twitTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nh\nnewlines\tand\ttabsWXYAThisZ"], ["witaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t12345ABCSTUVWXYZ67890estt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nRRRSSSSTTTTUUVVVVWWWXXXYYYZZZh"], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5ttabsWDXYZazyMiXLENTERSstestt5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5tn5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ntabsBCDEFGHIJKLMNOPQRSTUVThis"], ["witTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nh"], ["ttwitwhtabsBCDEFGHIJKLMNOPQRSTUVThiseWercaseLENTERS"], ["tHisItabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZsaCraMiXofRUPPERandloWercaseLENTERS"], ["ABCDEFKLMONOPQRSTUVWXYVtabsBCDEFGHIJKLMNOPQRSTUVThis\niWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.s\ta\ttest\twitestth\nnewlines\tand\ttabsWXYAThisZZ"], ["dgtmtteTrcaseLeENTERSm"], ["tabstest"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnetabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZwlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["ABCDEFGHIJKLMNOPQBRSTUVWXYZ"], ["ttestsIsaTHISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACESCrazyMiXofRUzPPERIandloWercaseLENTERS"], ["tettsestsIsaCrazyMiXLENTERSstestt"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5vn"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nt5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsWDXYZazyMiXLENTERSstestt"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["ttabsttestsIsaCrazyMiERSBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZbs"], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROROEVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["ttestsIsaCrazyMiXofRUPPERandloWercaseLENRS"], ["stabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZ"], ["CtabsBCDEtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis"], ["stabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5hwithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALAtabsWXYZRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.t5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5ts5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5tabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewl5ines\tand\ttabsTS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS."], ["tettsestsIsaCrazyMiXLENTERtt"], ["Th!s!s$0nly4t3st!ng-f55S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t1c&Def3@F5n"], ["tabsttestsIsaCrazyMiERSBCDEFGHIJKLMNOPQRSTUVThis"], ["tetHisIsaCrazyMiXofUPPERaTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nLENTERSt"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZtabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThisLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSsWXYZZZ"], ["12345ABCSTUVWCXYZ67890"], ["1A$eBc&Def3@Fnewlines"], ["ittabsBCDEFGHIOJKLMNOPQRSTUVThishittabsBCDEFGHIOQRSsh"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nthtabsWXYAThisZa\ttest\ttabsWDXYZ"], ["tabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["tabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSsWXYZ"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis"], ["withWOWTHISISSUCHALONGSTTh!s!s$0nly4t3st!ng-f55S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t1c&Def3@F5nRINGIWONDMERIFITWILLOVERFLOWMYCTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["tabsWDXYZsaCrazyMiXofRUPPEVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twitestth\nnewlines\tand\ttabsWXYAThisZWRandloWercaseLENTERS"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabAThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZDThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPEERCASELETTERS.THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVaWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["VtabsBCDEFGHIJKLMNOPQRSTUVTRhis\nis\ta\ttest\twitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.h\nnewlines\tand\ttabsWXYAThisZ"], ["s"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNOSPACES"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["THISItHisIsaCrazyMiXoIfUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["tabsWXTHICSISALONGSTRINGWITHMANYUPPERCASELETTERisAThisZ"], ["tHisItabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twiRth\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZsaCraMiXofRUPPERandloWercaseLENTERS"], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYZDThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["ABCQRSTUVWXYZ"], ["ttwitwhtabsBCDEFGHIJKLMNOPQRSTUVThiseWABCQRSTUVWXYZercaseLENTERS"], ["tabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["ntestewlines"], ["12345ABCDEFGHJIJKLMN0OPQRSTUVWXYZY67890"], ["THISItHisIsaCrazyMiXoIfUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWIITHMANYUPPERCASELETTERSNDNOSPACES"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testtwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.h5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["witabsiYWXYAThisZTh!s!s$0nly4t3s5t!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["tabsBCDEtHisIsaCraztabsiYWXYAThisZyMiXofRUPPERandloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis"], ["tabsWXYAThisZZ"], ["This\nis\ta\ttest\twith\nntestestabsWXThiAThiswlines\tand\ttabsWDXYZtabs"], ["12345AHBCDEFGHJIJKLMN0OPQRSTUVWXYZY67890"], ["Th!s!s$0tnly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["TATihiABCDEFKLMNOPQRSTUVWXYZstabsWXYAThisZa"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5mstabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsiYWXYAThisZ5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZtabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThisLMNOPQRSTUVThis"], ["THISItHisIsaCrazyMWiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["witwhtabsBCDEFGHIJKLMNOPQRESQTUVThis"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITtettestsIsaCrtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tstabsWXYAThisZa\ttest\ttabsWDXYZazyMiXLENTERSstesttSJUSTSOMANYUPPERCASELETTERS."], ["tetHTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t12345ABCSTUVWXYZ67890estt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nisIsaCrazyMiXofUPPERaTh!s!s$0nly4t3sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SSaaaaabbbbbbccccccdddeeefffggggHHHHHIIIHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.IJJJJGHIJKLMNOPQRSTUVThisVVVVWWWXXXYYYZZZ5t5v5t5sn5t5M5t5nLENTERSt"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\ttest\twithWOWTHISISSUCIHALONGXSTRFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZ"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNPACES"], ["THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twitestth\nnewlines\tand\ttabsWXYAThisZHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZ"], ["wiRth"], ["tabsTS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlintabstesteTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["tHisItabbsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERS"], ["AThis\nis\ta\ttest\twithtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTaERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSFTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["VtabsBCDEFGHIJKLMNOPQRSTUVTRhis\nis\ta\ttest\twitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVYERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.h\nnewlines\tand\ttabsWXYAThisZ"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQitAThis\nis\ta\ttest\twith\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tabsWXYAThisZHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVEaCrtabsBCDEFGHIJKLMNOPQRSTUVThis"], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5ttabsWDXYZazyMiXLENTERSstestt5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5ttest5SS5t5v5t5sn5t5M5t5nth"], ["tabsTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5hwithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALAtabsWXYZRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.t5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5ts5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsWDXYZsaCtetHisIsaCrazyMiXofUPPERaTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nLENTERStrazyMiXofRUPPERandloWercaseLENTERSsWXYZ"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5ttabsBCDEtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["tabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.twitwhtabsBCDEFGHIJKLMNOPQRSTUVThiseWABCQRSTUVWXYZercaseLENTERS"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCAtetHTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t12345ABCSTUVWXYZ67890estt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nisIsaCrazyMiXofUPPERaTh!s!s$0nly4t3sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SSaaaaabbbbbbccccccdddeeefffggggHHHHHIIIHELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWELL.IJJJJGHIJKLMNOPQRSTUVThisVVVVWWWXXXYYYZZZ5t5v5t5sn5t5M5t5nLENTERStSELETTERS."], ["tabsbBiThisEFs"], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabiThtabsbBCDEFsissBCDEFGHIJKLMNOPQRS\nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n\tWOWTHISISSUFCHALtabsBCDEFGHIJKLMNOPQRSTUVThisONGSTRINGIWONDERIFFFER.ITSJUSTSOMANYUPPERCASELETTERS.a\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttetHisItabbsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSst\ttabsWDXYZ"], ["ttabsttestsIsaCrTazsyMiERSBCDEFGHIJKLMNOPQRSTUVThiest\twith\nnewlines\tand\ttabsWXYAThisZbs"], ["itTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ntabsBCDEFGHIOQRSsh"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSFPTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.b5t5m5t5nm5t4KKLMNOPQRSTUVThis"], ["1A$Bc&Def3@FnewliDnes"], ["tabsiYWXYAThisZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5n5t5Ar5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsWDXYCZsaCraMiXofRUPPERandloWercaseLEwitwhtabsBCDEFGHIJKLMNOPQRESTUVThis\nis\ta\ttabstest\twith\nnewlines\tand\ttabsWXYAThisZNTERS"], ["tabsWXYATThisZHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["THISISALONGSTRINEGWITHMANYUPPERCAtabsBCDEFGHIJKLMNOPtHisIsaCrazyMiXofRUPPERandloWercaseLENTERSQRSERSANDNOSPACES"], ["ittabsBCDEFGHIOJKh"], ["wtabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZiwth"], ["atabsbBCDEFs"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5Th!s!s$0nly4t3sttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nthtabsWXYAThisZa\ttest\ttabsWDXYZ!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nt5yn5thy5ht5t5S5t5b5t5m5t5nm5tK5t5ms55t5m5t5n5t5r5testt55s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsWXYAThisZa"], ["wiTh!s!s$0nly4t3st!ng-1&2%tteWercaseLENTERS3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testtwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.h5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nn5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["Th!s!s$0tnly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5nff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabiThissBCDEFGHI"], ["THISItHisIsaCrazyMiXoTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5mstabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsiYWXYAThisZ5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nIfUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["tabsWXYAThisZwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVYERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.h"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFGER.ITSJUSTSOMANYUPPERCASELETTERS.tabsiYWXYAThisZ"], ["tabsWDXYZsaCrazyMiXofRUPPEVtabsBCDEFGHIJKLMNOPQRSTUVThis"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQitAThis"], ["HELLOthereOURdayISgoingWELL."], ["itTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["tabsBCDEFGHIJKLJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVwittestsIsaCrazyMiXofRUPPERandloWercaseLENTERSthThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms55v5t5sn5t5M5t1A$Bc&Def3@F5n"], ["tabsWDXYZsaCrazyMiXofRUPPEVtabsBCDEFLMNOPQRSTUVThis"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlintabstesteTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttTHISISALONGSTRINEGWITHMANYUPPERCASELETTERSANDNOSPACESestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["12345ABCDEFGHJIJKLMN0OPQRSTUVWtabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThisLMNOPQRSTUVThisXYZY67890"], ["tabsWXYAThisZwlines"], ["tabsBCDEFThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["ABCQRSTUVWwithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFGER.ITSJUSTSOMANYUPPERCASELETTERS.tabsiYWXYAThisZXYZ"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITtettestsIsaCrtabsBCDEFGHIJKLMNOPQRSTUVThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testtwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMASNYUPPERCASELETTERS.h5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["stabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["ABCDEFGHIJKLMNOPQBSTUVWXYZ"], ["tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZiwth"], ["CtabsBCDEtHisIsaCrazyMiXofRUPPERawitestthndloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis"], ["tHisItabbsBCDEFGHIJKLMNOPQRSTUVThis"], ["tabsttestsIsaCrazyMiERSBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\tteAThisZ"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILAThis\nis\ta\ttest\twith\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tabsBCDEFGsHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDIgTOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.b5t5m5t5nm5t4KKLMNOPQRSTUVThis"], ["ttestsIsaCrarzyMiXofRUPPERandloWercaseLENTERS"], ["tabsABCDEFThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabiThissBCDEFGHIJKLMNOPQRS\nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n\ta\ttest\twith\nnewlines\ta\ttest\ttabsWDXYZ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["WpMhOT"], ["tabsBCDEFGsHIJKLMwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZabsWXYAThisZa\ttest\ttabsWDXYZ"], ["WOWTHISISSUCHALONGSTRINGI12345ABCDEFGHJIJKLMN0OPQRSTUVWXYZY67890WONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROROEVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["tabswithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTEROS.WXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["yxGNyD"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEABCDEFKLMONOPQRSTUVWXYZFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALAtabsWXYZRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlineTh!s!s$0ttabsttestsIsaCrTazsyMiERSBCDEFGHIJKLMNOPQRSTUVThiestnly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGwitaaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t12345ABCSTUVWXYZ67890estt5s5tt5v5t5sn5t5M5t1A$Bc&Def3@F5nRRRSSSSTTTTUUVVVVWWWXXXYYYZZZhIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["stabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOTPQRSTUVWXYZsZ"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\tstabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZtest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZ"], ["witwhtabsBCDEFGHaIJKLMNOPQRESQTUVThis"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMtabsWXYAThisZaNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnetabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZwlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["antabsWXYABCDEFGHIJLMaNOPQRSTUVWXYZZd"], ["tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENtHisItabbsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSALARGBUFFER.ITSJUSTSOMANYUPPERCASELETtabsBCDEFGHIJKLMNOPQRSTUVWXYZDThisXTKTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS..sbsWDXYZiwth"], ["tabsWXYAThisZNTERS"], ["Thiwitestths"], ["witwhtabsBCDEFGHITHISISALONGSTRINEGWITHMANYUPPERCASELETTERSANDNOSPACESJKLMNOPQRESTUVThis"], ["tabsBCDEtHisIsaCraztabsiYWXYAThisZyMiXofRUPPERastabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\ttest\twithWOWTHISISSUCIHALONGXSTRFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZndloWercaseLENTERSFTGHIJKLMNOPQRSTUVThis"], ["atabstabsBCDEFGHIJKLMNOPQRSTUVThisbBCDEFs"], ["This\nis\ta\ttestnes\tand\ttabs"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttesiWOWTHISISSUCHALONGSTRINGIWONFDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZ"], ["witwhtabsBCDEFGHaIJKLMNOPQRESTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5vnQTUVThis"], ["tabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tstabsWXYAThisZa\ttest\ttabsWDX"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZCDEFGHIJKLNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["wiRith"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5Tt5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5testt5s5tt5v5t5sn5tteWercaseLENTERSDef3@F5n"], ["tabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDIgTOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.b5t5m5t5nm5t4KKLMNOPQRSTUVThisUVThisLMNOPQRSTUVThis"], ["ttestsIsaCrazyMiXofRUzPPERandloWercaseLENtettestsIsaCrazyMiXLENTERSstesttRS"], ["Th!s!s$0nly4t3switwhtabsBCDEFGHIJKLMNOPQRESTUVThis\nis\ta\ttabstest\twith\nnewlines\tand\ttabsWXYAThisZt!ng-f55S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5nt5t5r5t1c&Def3@F5n"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabAThis"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["witwhtabsBCDEFGHaIJKLMNOPQRESTh!s!s$0nly4t3st!nng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5mAThis5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5vnQTUVThis"], ["uidRKohwDoJ"], ["withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPEERCASELETTERS.THISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVaWXSPACES"], ["witwhtabsBCDEFGHaIJKLMNOPQRESTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TSn5t5n5t5Ar5t5pn5t5shr5t5SS5t5vnQTUVThis"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5Tt5Th5t5yn5thy5ht5t$Bc&Def3@F5n"], ["12345ABCSTUVWCXAThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnetabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZwlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZYZ67890"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["THISItHisIsaCrazyMiXoIfUPTHISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNOSPACESPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWIITHMANYUPPERCASELETTERSNDNOSPACES"], ["tabwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlintabstesteTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thytabsBCDEFGsHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZ5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t55M5t5ns\tand\ttabsWXYAThisZstest"], ["tettestsIsaCrazyMiXLENTERSsteestt"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["tabsiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbBiThisEFs"], ["tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENtHisItabbsBCDEFGHIJKLMNOPQRSTUVThis"], ["tabsiYWXYAThisZ5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nIfUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["tabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYZYZ67890"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mmV5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["stabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZtest"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\tt5est\twith\nnewlintabstesteTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["tettrazyMiXLENTERtt"], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYHZ"], ["witwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlintabstesteTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttTHISISALONGSTRINEGWITHMANYUPPERCASELETTERSANDNOSPACESestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5Mn5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZ"], ["withWOWTHISISSUCIHALONGXSTRFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["newl5ines"], ["Th!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5tTHISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONOGSTRINGWITHMANYUPPERCASELETTERSDNOSPACES5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5vn"], ["t5est"], ["wittestsIsaCrazyMiXofRUPPERandloWercaseLENTERSthwiwtTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["ttestsIsaCrazyMtabsBCDEFGsHIJKLMwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZabsWXYAThisZa\ttest\ttabsWDXYZiXofRUzPPERandloWercaseLENTERS"], ["stabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDtabiThissBCDEFGHIEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["tabstabsWXYAThisZiYWXYAThisZ"], ["i"], ["tabsWDXYZazyMiXLENTERstestt"], ["WOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.tabsWXTHISISALONGSTRINGWITHMANYUPPERCASELETTERSANDNOSPACESThisAThisZ"], ["witwhtabsBCDEFGHIJKLMNOPQRESTUVThistabsBCDEFGsHIJKLMwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttabstest\twith\nnewlines\tand\ttabsWXYAThisZ"], ["THISItHisIsaCrazyMWiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDAThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["aaaaabbbbbbccccccdddeeefffggggHHHHHIIIIJJJJKKKKLLLLMMMMNNNNOOOOPPPQQQQRRRRSSSSTTTTUUVVVVWWWXXXYYYZtabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBSTUVThis"], ["withWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTTEDITOROREVENtabsBCDEFGsHIJKLMwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZabsWXYAThisZa\ttest\ttabsWDXYZALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS."], ["tabsBCtabiThissBCDtAThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQittabsBCDEFGHIOJKLMNOPQRSshROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTtabsbBCDEFsERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZabiThissBCDEFGHIEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["tabstabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZWDXYZsaCrazyMiXofRUPPEVtabsBCDEFLMNOPQRSTUVThis"], ["VtabsBCDEFGHIJKLMNOPQRSTUVThis"], ["tabsBCDEFGHIJKLMNOPtesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENtHisItabbsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSALARGBUFFER.ITSJUSTSOMANYUPPERCASELETtabsBCDEFGHIJKLMNOPQRSTUVWXYZDThisXTKTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS..sbsWDXYZiwthQRSTUVThis"], ["tteststIsaCrazyMiERS"], ["tabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5withWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVSThisXTEDRIgTOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.b5t5m5t5nm5t4KKLMNOPQRSTUVThisUVThisLMNOPQRSTUVThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testtwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMASNYUPPERCASELETTERS.h5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5"], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYZabiThissBDCDEFGHIEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZ"], ["ThAThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnetabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZwlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZis"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIIWONDERIFITWILLOVERFLOWMYBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZ"], ["tHisItabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twiRNTERS"], ["THISISALONGSTRINGWITHMANYUPPERCTASELERSANDNOSPACESThis"], ["tabsbBCDEF"], ["tabstabsWXYAThisZiYWYXYAThisZ"], ["wiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5ttabsWDXYZarzyMiXLENTERSstestt5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nth"], ["ATHISISALONGSTRINGWITHMANYUPPERCTASELERSANDNOSPACESThis"], ["tabsWDXYZ5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5tn5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t55M5t5ns"], ["wittestsIsaCrazyMiXofRUPPERandloWercawitwhtabsBCDEFGHaIJKLMNOPQRESTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TSn5t5n5t5Ar5t5pn5t5shr5t5SS5t5vnQTUVThisseLENTERSth"], ["newlintabstesteTh!s!s$THISItHisIsaCrazyMiXoIfUPTHISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNOSPACESPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWIITHMANYUPPERCASELETTERSNDNOSPACES0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thytabsBCDEFGsHIJKLMNOPQRSTUVThis"], ["Th!s!s$0nly4t3st!Sng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mmV5g55gn5t5ThTh!s5!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["AThis\nis\ta\ttest\twithWOWTHISISSUCHALONGSTRINGIIWONDERIFITWILLOVERFLOWMYBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNTHISItHisIsaCrazyMiXofUPPEHRandloWercaseLENTERSStabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNOSPACESTUVWXYZ"], ["HELLOthereWHATareYOUdoingTODAY?IHopeYOURdayISgoingWEL."], ["tabsWXYAThisZwli"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5ThtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5ttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5Th!s!s$0nly4t3sttabsBCDEFGHIJKLMNOPQRSTUVThis"], ["tHisIstesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTaERS.aCrazyMiXofUPPERandloWercaseLENTERS"], ["ABCDEFGHIJNKLMNOPQBSTUVWXYZ"], ["tabsBCDEFTGHIJKLMNOPQRSTUVThis\nis\ttabiThissBCDEFGHIJKLMNOPQRS\nistabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5nt5v5t5sn5t5M5t5n\ta\ttwitwhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlineTh!s!s$0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5ttestsIsaCrazyMiXofRUPPERandloWercaseLENTERSt5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5ns\tand\ttabsWXYAThisZest\twiEth\nnewlines\ta\ttest\ttabsWDXYZ"], ["tabsBCDEFGHIJKLMttestsIsaCrazyMiXofRUPPERPandloWercaseLENTERSNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5tt5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nthtabsWXYAThisZa\ttest\ttabsWDXYZ"], ["tabsWDXYZWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.tabsiYWXYAThisZ"], ["ittabsBCDwithWOWTHISISSUCHALONGSETRINGIWONDMERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS.EFGHIOQRSsh"], ["Th!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testtwitWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMASNYUPPERCASELETTERS.h5s5t5n5n5M5t5s5t5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.sbsWDXYZiwthM5t5"], ["tabsBCDEFTGHIJKLMbsWDXYZ"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\tstabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZtest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALA\nRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZ"], ["WOWTHISISSUCHALONGSTRINisXTEDITOROROEVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["ttestsIsaCrazRS"], ["newlintabstesteTh!s!s$THISItHisIsaCrazyMiXoIfUPTHISItHisIsaCrazyMiXofUPPERandloWercaseLENTERSSttabtHisItabsBCDEFGHIJKwithWOWTHISISSUCHALONGSTRINGIWONDERIFITtabsBCDEFTGHIJKLMNOPQRSTUVThisLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERSsWXYZabsBCDEFGHIJKLMNOPQRSTUVWXYZALONGSTRILNGWITHMANYUPPERCASELEcTTERSNDNOSPACESPERandloWercaseLENTERSStabsBCDEFGHIJKLMNDOPQRSTUVWXYZALONGSTRINGWIITHMANYUPPERCASELETTERSNDNOSPACES0nly4t3st!ng-f5mm5g55gn5t5Th5t5yn5thytabsBCDEFGsHIJKLMNOPQRSTUVThis"], ["stabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\tstabsWXThiAThis\ni\ns\ta\ttest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZa\ttest\ttabsWDXYZEtabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYZsZRFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCtabiThissBCDEFGHIJKLMNOPQRSGHIJKLMNOPQRSTUVWXYZsZtest\twithWOWTHISISSUCIHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROREVENALA\nRGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZtabsWXYAThisZaZ"], ["WOWTHISISSUCHATLONGSTRINGI12345ABCDEFGHJIJKLMN0OPQRSTUVWXYZY67890WONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEDITOROROEVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS."], ["ittabsBCDEFGHIOJKLMNOPQRSTUVtabsWDXDDYZThish"], ["tabsBCDEFGHIJKLMNOPQRSTUVWXYZOPQRSTUVWXYZALONGSTRINGWITHMANYUPPERCASELETTERSNDNOSPACES"], ["iWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETTERS.s"], ["tesiWOWTHISISSUCHALONGSTRINGIWONDERIFITWILLOVERFLOWMYTEtabsBCDEFGHIJKLMNOPQRSTUVThisXTEFDITOROREVENtHisItabbsBCDEFGHIJKLMNOPQRSTUVThis\nis\ttabsBCDEFGHIJKLMNOPQRS\nis\ta\ttest\twith\nnewlines\tand\tAThistabsWXYAThisZa\ttest\ttabsWDXYZsaCrazyMiXofRUPPERandloWercaseLENTERStabsTS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5nthALARGBUFFER.ITSJUSTSOMANYUPPERCASELETtTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5Th!s!s$0nly4t3sttabsBCDEFGHIJKLMNOPQRSTUVThisabsBCDEFGHIJKLMNOPQRSTUVWXYZDThisXTKTEDITOROREVENALARGBUFFER.ITSJUSTSOMANYUPPERCASELETOTERS..sbsWDXYZiwth"], ["ttestsIsaCrazyMtabsBCDEFGsHIJKLMwitwhhtabsBCDEFGHIJKLMNOPQRSTUVThis\nis\ta\ttest\twith\nnewlines\tand\ttabsWXYAThisZabsWXYAThisZa\ttest\ttabsWDXYZiXofRUzPPERandloWercaseLENTERS"], ["tabsWXYZ5nm5t4K5t5ms5t5m5t5n5t5r5t5s5t5n5n5M5t5s5twiTh!s!s$0nly4t3st!ng-1&2%3*4@5_c@5ES.4305t5n5t5v5ff5mm5g55gn5t5Th5t5yn5thy5ht5t5S5t5b5t5m5t5nm5t4K5t5ms5t5m5t5n5t5r5testt5s5t5n5n5M5t55t5shr5t5SS5t5v5t5sn5t5M5t5nth5m5t5sn5ST5TS5t5n5t5n5t5Ar5t5pn5t5shr5t5SS5t5v5t5sn5t5M5t5n"], ["witwhtabsBCDEFGHIJKLMNOPQRESTUVTstabsWXThiAThis\ni\ns\ttteWercaseLENTERSa\ttest\twithWOWTHISISSUCIHALONGXSTRFFER.ITSJUSTSOMANYUPPERCASELETTERS.\nnewlines\tand\ttabsBCDEFGHIJKLMNOPQRSTUVWXYZsZhis"]], "completion": "\n\ndef digitSum(s):\n return sum(ord(c) for c in s if c.isupper())\n\n", "raw_completion": "```python\n\ndef digitSum(s):\n return sum(ord(c) for c in s if c.isupper())\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef digitSum(s):\n \"\"\"Task\n Write a function that takes a string as input and returns the sum of the upper characters only'\n ASCII codes.\n\n Examples:\n digitSum(\"\") => 0\n digitSum(\"abAB\") => 131\n digitSum(\"abcCd\") => 67\n digitSum(\"helloE\") => 69\n digitSum(\"woArBld\") => 131\n digitSum(\"aAaaaXa\") => 153\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/67", "prompt": "\ndef fruit_distribution(s,n):\n \"\"\"\n In this task, you will be given a string that represents a number of apples and oranges \n that are distributed in a basket of fruit this basket contains \n apples, oranges, and mango fruits. Given the string that represents the total number of \n the oranges and apples and an integer that represent the total number of the fruits \n in the basket return the number of the mango fruits in the basket.\n for examble:\n fruit_distribution(\"5 apples and 6 oranges\", 19) ->19 - 5 - 6 = 8\n fruit_distribution(\"0 apples and 1 oranges\",3) -> 3 - 0 - 1 = 2\n fruit_distribution(\"2 apples and 3 oranges\", 100) -> 100 - 2 - 3 = 95\n fruit_distribution(\"100 apples and 1 oranges\",120) -> 120 - 100 - 1 = 19\n \"\"\"\n", "entry_point": "fruit_distribution", "canonical_solution": "\n\n words = s.split(\" \")\n c1, c2 = int(words[0]), int(words[3])\n assert n - c1 - c2 >= 0, \"invalid inputs\" # $_CONTRACT_$\n \n return n - c1 - c2\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"5 apples and 6 oranges\",19) == 8\n assert candidate(\"5 apples and 6 oranges\",21) == 10\n assert candidate(\"0 apples and 1 oranges\",3) == 2\n assert candidate(\"1 apples and 0 oranges\",3) == 2\n assert candidate(\"2 apples and 3 oranges\",100) == 95\n assert candidate(\"2 apples and 3 oranges\",5) == 0\n assert candidate(\"1 apples and 100 oranges\",120) == 19\n", "contract": "\n assert type(s) == str and type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n words = s.split(\" \") # $_CONTRACT_$\n assert len(words) == 5, \"invalid inputs\" # $_CONTRACT_$\n assert words[1] == \"apples\" and words[2] == \"and\" and words[4] == \"oranges\", \"invalid inputs\" # $_CONTRACT_$\n assert words[0].isdigit() and words[3].isdigit(), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["5 apples and 6 oranges", 19], ["5 apples and 6 oranges", 21], ["0 apples and 1 oranges", 3], ["1 apples and 0 oranges", 3], ["2 apples and 3 oranges", 100], ["2 apples and 3 oranges", 5], ["1 apples and 100 oranges", 120]], "atol": 0, "plus_input": [["10 apples and 20 oranges", 50], ["3 apples and 4 oranges", 9], ["7 apples and 8 oranges", 30], ["2 apples and 0 oranges", 5], ["0 apples and 0 oranges", 10], ["0 apples and 1 oranges", 1], ["10 apples and 0 oranges", 15], ["3 apples and 5 oranges", 12], ["5 apples and 5 oranges", 12], ["8 apples and 2 oranges", 15], ["2 apples and 0 oranges", 12], ["2 apples and 0 oranges", 30], ["0 apples and 0 oranges", 9], ["0 apples and 1 oranges", 50], ["0 apples and 1 oranges", 15], ["0 apples and 1 oranges", 14], ["0 apples and 0 oranges", 30], ["0 apples and 1 oranges", 10], ["0 apples and 1 oranges", 12], ["10 apples and 20 oranges", 30], ["2 apples and 0 oranges", 13], ["3 apples and 4 oranges", 30], ["8 apples and 2 oranges", 10], ["0 apples and 1 oranges", 2], ["10 apples and 20 oranges", 51], ["3 apples and 5 oranges", 10], ["0 apples and 1 oranges", 3], ["5 apples and 5 oranges", 15], ["0 apples and 1 oranges", 9], ["0 apples and 1 oranges", 8], ["0 apples and 1 oranges", 13], ["0 apples and 0 oranges", 1], ["7 apples and 8 oranges", 15], ["3 apples and 5 oranges", 51], ["3 apples and 4 oranges", 8], ["3 apples and 5 oranges", 13], ["0 apples and 1 oranges", 51], ["2 apples and 0 oranges", 11], ["10 apples and 0 oranges", 30], ["2 apples and 0 oranges", 14], ["0 apples and 0 oranges", 29], ["10 apples and 20 oranges", 52], ["0 apples and 1 oranges", 4], ["2 apples and 0 oranges", 50], ["2 apples and 0 oranges", 51], ["0 apples and 1 oranges", 11], ["5 apples and 5 oranges", 11], ["2 apples and 0 oranges", 52], ["3 apples and 4 oranges", 12], ["3 apples and 4 oranges", 10], ["10 apples and 0 oranges", 29], ["2 apples and 0 oranges", 3], ["2 apples and 0 oranges", 6], ["3 apples and 5 oranges", 9], ["2 apples and 0 oranges", 29], ["2 apples and 0 oranges", 8], ["0 apples and 0 oranges", 12], ["2 apples and 0 oranges", 10], ["3 apples and 5 oranges", 14], ["2 apples and 0 oranges", 9], ["5 apples and 5 oranges", 13], ["0 apples and 0 oranges", 15], ["3 apples and 4 oranges", 13], ["0 apples and 0 oranges", 14], ["0 apples and 0 oranges", 0], ["3 apples and 4 oranges", 50], ["2 apples and 0 oranges", 15], ["10 apples and 5 oranges", 20], ["3 apples and 7 oranges", 15], ["15 apples and 8 oranges", 30], ["24 apples and 18 oranges", 50], ["50 apples and 50 oranges", 100], ["100 apples and 100 oranges", 200], ["1 apples and 99 oranges", 105], ["99 apples and 1 oranges", 105], ["20 apples and 0 oranges", 25], ["1 apples and 99 oranges", 100], ["99 apples and 1 oranges", 104], ["20 apples and 0 oranges", 199], ["50 apples and 50 oranges", 199], ["1 apples and 99 oranges", 199], ["50 apples and 50 oranges", 200], ["20 apples and 0 oranges", 198], ["24 apples and 18 oranges", 105], ["24 apples and 18 oranges", 100], ["99 apples and 1 oranges", 106], ["3 apples and 7 oranges", 20], ["3 apples and 7 oranges", 25], ["1 apples and 99 oranges", 104], ["97 apples and 1 oranges", 198], ["97 apples and 1 oranges", 105], ["20 apples and 0 oranges", 26], ["3 apples and 7 oranges", 198], ["50 apples and 50 oranges", 105], ["20 apples and 0 oranges", 197], ["50 apples and 50 oranges", 106], ["50 apples and 50 oranges", 104], ["15 apples and 8 oranges", 198], ["0 apples and 0 oranges", 11], ["24 apples and 18 oranges", 106], ["1 apples and 99 oranges", 103], ["99 apples and 1 oranges", 103], ["1 apples and 99 oranges", 197], ["99 apples and 1 oranges", 198], ["97 apples and 1 oranges", 200], ["50 apples and 50 oranges", 103], ["0 apples and 0 oranges", 199], ["15 apples and 8 oranges", 26], ["24 apples and 18 oranges", 49], ["15 apples and 8 oranges", 106], ["20 apples and 0 oranges", 99], ["99 apples and 1 oranges", 197], ["3 apples and 7 oranges", 21], ["3 apples and 7 oranges", 103], ["3 apples and 7 oranges", 101], ["24 apples and 18 oranges", 51], ["100 apples and 100 oranges", 201], ["20 apples and 0 oranges", 50], ["99 apples and 1 oranges", 199], ["20 apples and 0 oranges", 200], ["0 apples and 0 oranges", 106], ["97 apples and 1 oranges", 199], ["3 apples and 7 oranges", 16], ["20 apples and 0 oranges", 27], ["50 apples and 50 oranges", 101], ["97 apples and 1 oranges", 100], ["1 apples and 99 oranges", 106], ["0 apples and 0 oranges", 197], ["20 apples and 0 oranges", 107], ["10 apples and 5 oranges", 21], ["1 apples and 99 oranges", 196], ["24 apples and 18 oranges", 104], ["99 apples and 1 oranges", 102], ["20 apples and 0 oranges", 30], ["1 apples and 99 oranges", 101], ["97 apples and 1 oranges", 107], ["50 apples and 50 oranges", 102], ["24 apples and 18 oranges", 99], ["15 apples and 8 oranges", 197], ["97 apples and 1 oranges", 201], ["15 apples and 8 oranges", 105], ["15 apples and 8 oranges", 100], ["15 apples and 8 oranges", 28], ["0 apples and 0 oranges", 198], ["0 apples and 0 oranges", 50], ["24 apples and 118 oranges", 198], ["97 apples and 1 oranges", 103], ["10 apples and 5 oranges", 51], ["20 apples and 0 oranges", 104], ["24 apples and 118 oranges", 199], ["20 apples and 0 oranges", 31], ["15 apples and 8 oranges", 107], ["10 apples and 5 oranges", 30], ["3 apples and 7 oranges", 106], ["20 apples and 0 oranges", 106], ["24 apples and 18 oranges", 48], ["20 apples and 0 oranges", 48], ["1 apples and 99 oranges", 107], ["20 apples and 0 oranges", 101], ["0 apples and 0 oranges", 200], ["15 apples and 8 oranges", 49], ["1 apples and 99 oranges", 198], ["50 apples and 50 oranges", 197], ["10 apples and 5 oranges", 199], ["3 apples and 7 oranges", 197], ["20 apples and 0 oranges", 196], ["3 apples and 7 oranges", 12], ["3 apples and 7 oranges", 26], ["0 apples and 0 oranges", 25], ["3 apples and 7 oranges", 10], ["15 apples and 8 oranges", 199], ["99 apples and 1 oranges", 101], ["10 apples and 5 oranges", 15], ["15 apples and 8 oranges", 196], ["3 apples and 7 oranges", 22], ["97 apples and 1 oranges", 104], ["24 apples and 118 oranges", 196], ["1 apples and 99 oranges", 102], ["97 apples and 1 oranges", 196], ["24 apples and 18 oranges", 98], ["20 apples and 0 oranges", 105], ["20 apples and 0 oranges", 102], ["99 apples and 1 oranges", 200], ["24 apples and 11 oranges", 49], ["97 apples and 1 oranges", 197], ["24 apples and 118 oranges", 197], ["20 apples and 0 oranges", 28], ["0 apples and 0 oranges", 49], ["0 apples and 0 oranges", 99], ["20 apples and 0 oranges", 201], ["3 apples and 7 oranges", 105], ["10 apples and 5 oranges", 28], ["3 apples and 7 oranges", 27], ["3 apples and 7 oranges", 28], ["15 apples and 8 oranges", 104], ["24 apples and 18 oranges", 199], ["15 apples and 8 oranges", 48], ["0 apples and 0 oranges", 20], ["24 apples and 18 oranges", 196], ["24 apples and 18 oranges", 195], ["24 apples and 18 oranges", 103], ["15 apples and 8 oranges", 99], ["3 apples and 7 oranges", 104], ["10 apples and 5 oranges", 27], ["24 apples and 18 oranges", 97], ["99 apples and 1 oranges", 196], ["10 apples and 5 oranges", 101], ["15 apples and 8 oranges", 103], ["24 apples and 11 oranges", 107], ["15 apples and 8 oranges", 108], ["50 apples and 50 oranges", 201], ["10 apples and 5 oranges", 29], ["0 apples and 0 oranges", 105], ["0 apples and 0 oranges", 104], ["10 apples and 5 oranges", 105], ["3 apples and 7 oranges", 17], ["3 apples and 7 oranges", 14], ["10 apples and 5 oranges", 104], ["3 apples and 7 oranges", 29], ["1 apples and 9 oranges", 105], ["15 apples and 8 oranges", 31], ["1 apples and 9 oranges", 31], ["0 apples and 0 oranges", 100], ["3 apples and 7 oranges", 99], ["15 apples and 8 oranges", 32], ["1 apples and 9 oranges", 104], ["1 apples and 9 oranges", 28], ["1 apples and 9 oranges", 49], ["10 apples and 5 oranges", 106], ["3 apples and 7 oranges", 31], ["0 apples and 0 oranges", 31], ["1 apples and 9 oranges", 29], ["0 apples and 0 oranges", 28], ["10 apples and 5 oranges", 19], ["1 apples and 9 oranges", 50], ["99 apples and 1 oranges", 201], ["10 apples and 5 oranges", 22], ["3 apples and 7 oranges", 18], ["1 apples and 9 oranges", 27], ["20 apples and 0 oranges", 100], ["0 apples and 0 oranges", 17], ["0 apples and 0 oranges", 101], ["1 apples and 9 oranges", 14], ["1 apples and 9 oranges", 11], ["0 apples and 0 oranges", 22], ["1 apples and 9 oranges", 101], ["91 apples and 9 oranges", 105], ["10 apples and 5 oranges", 25], ["0 apples and 0 oranges", 16], ["1 apples and 9 oranges", 103], ["3 apples and 7 oranges", 19], ["03 apples and 7 oranges", 19], ["1 apples and 9 oranges", 20], ["10 apples and 5 oranges", 31], ["10 apples and 5 oranges", 16], ["3 apples and 7 oranges", 30], ["0 apples and 0 oranges", 18], ["1 apples and 9 oranges", 26], ["0 apples and 0 oranges", 103], ["1 apples and 9 oranges", 21], ["0 apples and 018 oranges", 103], ["50 apples and 50 oranges", 202], ["10 apples and 5 oranges", 48], ["1 apples and 9 oranges", 10], ["1 apples and 9 oranges", 22], ["10 apples and 5 oranges", 50], ["0 apples and 018 oranges", 105], ["0 apples and 0 oranges", 107], ["0 apples and 018 oranges", 201], ["1 apples and 9 oranges", 19], ["15 apples and 8 oranges", 27], ["1 apples and 9 oranges", 25], ["10 apples and 5 oranges", 18], ["03 apples and 7 oranges", 21], ["10 apples and 5 oranges", 202], ["0 apples and 0 oranges", 13], ["1 apples and 9 oranges", 15], ["0 apples and 0 oranges", 21], ["20 apples and 0 oranges", 29], ["0 apples and 018 oranges", 200], ["0 apples and 018 oranges", 49], ["1 apples and 9 oranges", 201], ["0 apples and 0 oranges", 102], ["0 apples and 018 oranges", 99], ["91 apples and 9 oranges", 103], ["0 apples and 018 oranges", 100], ["99 apples and 1 oranges", 107], ["03 apples and 7 oranges", 20], ["1 apples and 9 oranges", 32], ["0 apples and 018 oranges", 106], ["1 apples and 9 oranges", 13], ["3 apples and 7 oranges", 107], ["15 apples and 8 oranges", 29], ["0 apples and 0 oranges", 48], ["10 apples and 5 oranges", 99], ["03 apples and 7 oranges", 100], ["99 apples and 1 oranges", 108], ["10 apples and 5 oranges", 26], ["91 apples and 9 oranges", 106], ["3 apples and 7 oranges", 202], ["03 apples and 7 oranges", 51], ["0 apples and 018 oranges", 104], ["03 apples and 7 oranges", 18], ["50 apples and 50 oranges", 107], ["10 apples and 5 oranges", 200], ["1 apples and 9 oranges", 12], ["0 apples and 0 oranges", 19], ["1 apples and 9 oranges", 200], ["1 apples and 9 oranges", 18], ["03 apples and 7 oranges", 99], ["1 apples and 9 oranges", 100], ["1 apples and 9 oranges", 48], ["10 apples and 5 oranges", 100], ["91 apples and 9 oranges", 100], ["03 apples and 7 oranges", 98], ["3 apples and 78 oranges", 202], ["03 apples and 7 oranges", 28], ["03 apples and 7 oranges", 52], ["10 apples and 5 oranges", 49], ["03 apples and 7 oranges", 97], ["3 apples and 7 oranges", 51], ["99 apples and 1 oranges", 202], ["0 apples and 0 oranges", 52], ["3 apples and 78 oranges", 99], ["10 apples and 5 oranges", 103], ["15 apples and 8 oranges", 202], ["0 apples and 018 oranges", 20], ["1 apples and 9 oranges", 17], ["020 apples and 018 oranges", 49], ["1 apples and 9 oranges", 99], ["10 apples and 5 oranges", 52], ["03 apples and 7 oranges", 103], ["10 apples and 5 oranges", 17], ["3 apples and 7 oranges", 108], ["3 apples and 7 oranges", 49], ["1 apples and 9 oranges", 16], ["03 apples and 7 oranges", 201], ["1 apples and 9 oranges", 199], ["1 apples and 9 oranges", 30], ["1 apples and 9 oranges", 202], ["100 apples and 100 oranges", 202]], "completion": "\n\ndef fruit_distribution(s, n):\n \"\"\"\n Given a string that represents the total number of the oranges and apples and an integer that \n represent the total number of the fruits in the basket, return the number of the mango fruits in the basket.\n \"\"\"\n apple_count = int(s.split()[0])\n orange_count = int(s.split()[3])\n return n - apple_count - orange_count\n\n", "raw_completion": "```python\n\ndef fruit_distribution(s, n):\n \"\"\"\n Given a string that represents the total number of the oranges and apples and an integer that \n represent the total number of the fruits in the basket, return the number of the mango fruits in the basket.\n \"\"\"\n apple_count = int(s.split()[0])\n orange_count = int(s.split()[3])\n return n - apple_count - orange_count\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef fruit_distribution(s,n):\n \"\"\"\n In this task, you will be given a string that represents a number of apples and oranges \n that are distributed in a basket of fruit this basket contains \n apples, oranges, and mango fruits. Given the string that represents the total number of \n the oranges and apples and an integer that represent the total number of the fruits \n in the basket return the number of the mango fruits in the basket.\n for examble:\n fruit_distribution(\"5 apples and 6 oranges\", 19) ->19 - 5 - 6 = 8\n fruit_distribution(\"0 apples and 1 oranges\",3) -> 3 - 0 - 1 = 2\n fruit_distribution(\"2 apples and 3 oranges\", 100) -> 100 - 2 - 3 = 95\n fruit_distribution(\"100 apples and 1 oranges\",120) -> 120 - 100 - 1 = 19\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/68", "prompt": "\ndef pluck(arr):\n \"\"\"\n \"Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"\n", "entry_point": "pluck", "canonical_solution": "\n\n if all(val % 2 == 1 for val in arr): return []\n min_even = min(filter(lambda x: x % 2 == 0, arr))\n for i in range(len(arr)):\n if arr[i] == min_even:\n return [min_even, i]\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([4,2,3]) == [2, 1], \"Error\"\n assert candidate([1,2,3]) == [2, 1], \"Error\"\n assert candidate([]) == [], \"Error\"\n assert candidate([5, 0, 3, 0, 4, 2]) == [0, 1], \"Error\"\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([1, 2, 3, 0, 5, 3]) == [0, 3], \"Error\"\n assert candidate([5, 4, 8, 4 ,8]) == [4, 1], \"Error\"\n assert candidate([7, 6, 7, 1]) == [6, 1], \"Error\"\n assert candidate([7, 9, 7, 1]) == [], \"Error\"\n\n", "contract": "\n assert len(arr) <= 10000, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(val) == int and val >= 0 for val in arr), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[4, 2, 3]], [[1, 2, 3]], [[]], [[5, 0, 3, 0, 4, 2]], [[1, 2, 3, 0, 5, 3]], [[5, 4, 8, 4, 8]], [[7, 6, 7, 1]], [[7, 9, 7, 1]]], "atol": 0, "plus_input": [[[1, 3, 5, 7, 9]], [[2, 2, 2, 2, 2, 2]], [[7, 15, 12, 21, 8, 13]], [[2, 5, 7, 9, 11]], [[0, 0, 0, 0, 0]], [[6, 4, 2, 0, 8, 10]], [[101, 202, 303]], [[6, 4, 2, 0, 8, 10, 1, 3, 5, 7, 9, 11]], [[2, 4, 6, 8]], [[5, 10, 15, 20]], [[2, 2, 2, 2, 2]], [[2, 4, 7, 6, 8]], [[101, 202]], [[1, 3, 5, 9]], [[5, 10, 15, 20, 15]], [[2, 5, 7, 9, 20]], [[6, 5, 2, 0, 8, 11, 1, 101, 5, 7, 9, 11]], [[6, 4, 2, 0, 8, 10, 1, 3, 5, 7, 9, 11, 2]], [[6, 4, 2, 0, 8, 10, 10]], [[7, 15, 12, 21, 8, 14]], [[6, 4, 2, 21, 9, 10, 1, 3, 5, 7, 9, 11, 2]], [[5, 5, 10, 15]], [[1, 3, 5, 9, 1]], [[6, 5, 2, 0, 8, 11, 1, 101, 5, 7, 8, 11]], [[2, 4, 7, 6, 8, 8, 8, 8]], [[2, 5, 11, 7, 9, 11, 2]], [[2, 4, 4, 8]], [[101]], [[5, 10, 15, 20, 15, 10]], [[100, 101]], [[2, 4, 7, 6, 4]], [[2, 4, 7, 4]], [[2, 5, 7, 11]], [[1, 303, 5, 7, 9]], [[5, 10, 15, 9, 20, 15, 10]], [[7, 15, 12, 21, 8, 13, 7]], [[2, 4, 6, 4]], [[6, 6, 4, 2, 0, 8, 10]], [[2, 5, 11, 7, 9, 11, 2, 9]], [[5, 10, 15, 9, 20, 10]], [[202, 6, 4, 2, 9, 0, 8, 10]], [[7, 15, 12, 21, 13, 8, 13, 7]], [[7, 15, 21, 13, 8, 13, 7]], [[1, 303, 5, 7, 9, 5]], [[6, 4, 2, 0, 8, 10, 2, 3, 5, 7, 9, 11, 2]], [[2, 5, 11, 7, 9, 11, 2, 9, 9]], [[2, 3, 6, 8]], [[4, 6, 8, 8, 8, 8]], [[2, 5, 4, 11, 7, 9, 11, 2, 9, 9]], [[5, 10, 16, 9, 20, 10]], [[]], [[2, 2, 2, 2, 2, 2, 2]], [[7, 12, 15, 12, 21, 8, 13, 7]], [[7, 15, 12, 21, 8, 13, 7, 15]], [[1, 3, 20, 7, 9]], [[10, 15, 20]], [[21, 2, 5, 7, 9, 20, 5]], [[1, 303, 5, 9]], [[2, 4, 7, 5, 8, 8, 8, 8]], [[2, 5, 11, 7, 16, 11, 2, 9, 9, 11]], [[101, 20, 202]], [[7, 15, 12, 21, 15, 8, 14]], [[7, 12, 21, 13, 8, 13, 7]], [[1, 304, 5, 9]], [[5, 4, 11, 7, 9, 11, 2, 9, 9, 4]], [[5, 11, 7, 9, 11, 2, 9, 9]], [[4, 6, 8, 8, 8, 304, 8]], [[5, 11, 7, 9, 11, 2, 9, 9, 11]], [[5, 10, 9, 20, 10]], [[2, 4, 7, 11, 6, 4]], [[6, 2, 2, 21, 9, 10, 1, 3, 5, 7, 9, 11, 2]], [[1, 3, 5]], [[2, 20, 4, 8]], [[2, 4, 7, 6, 8, 6]], [[5, 10, 15, 9, 20, 21, 10]], [[12, 15, 12, 21, 8, 14]], [[10, 14, 20, 20]], [[5, 100, 10, 15]], [[2, 4, 6, 8, 4]], [[202, 7, 12, 21, 13, 8, 13, 7]], [[6, 6, 4, 0, 8, 10, 8]], [[2, 5, 11, 7, 9, 2, 9, 9, 5]], [[2, 5, 4, 7, 9, 11, 2, 9, 9]], [[2, 3, 6, 4, 2]], [[2, 5, 11, 7, 9, 2, 9, 3, 9, 5]], [[5, 10, 5, 10, 15]], [[6, 5, 2, 0, 8, 11, 1, 101, 5, 7, 8, 11, 8]], [[6, 4, 2, 0, 8, 10, 6]], [[6, 2, 0, 8, 10, 1, 3, 5, 7, 9, 11, 2]], [[12, 21, 13, 8, 13, 7]], [[6, 4, 2, 0, 8, 10, 4, 8]], [[21, 2, 5, 7, 20, 5]], [[2, 2, 5, 10, 7, 9, 11, 2, 9, 9]], [[7, 6, 15, 2, 0, 8, 10, 8]], [[202, 2, 5, 10, 7, 9, 11, 2, 9, 9]], [[7, 1, 21, 13, 8, 13, 7]], [[5, 10, 14, 9, 20, 15, 10]], [[1, 303, 5, 7, 8]], [[10, 15]], [[7, 15, 21, 7, 14]], [[2, 4, 6, 8, 10]], [[0, 1, 2, 5, 7, 9, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0]], [[3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2, 4, 6, 8, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 34, 37, 39, 4, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37]], [[1, 3, 5, 7, 9, 1]], [[31, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 6, 9, 9]], [[10, 9, 8, 8, 5, 4, 3, 2, 1, 8]], [[2, 6, 7, 10]], [[2, 4, 6, 8, 2, 3]], [[3, 3, 3, 3, 3, 3]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2]], [[0, 3, 3]], [[7, 2, 4, 6, 8, 10]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 10000, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 3, 4, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9]], [[1, 1, 1, 1, 1, 2, 2, 27, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[2, 4, 6, 8, 10, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 13, 29, 31, 33, 34, 37, 39, 4, 2]], [[2, 2, 4, 6, 8, 10, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 29]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 1]], [[2, 4, 6, 8, 2, 3, 2]], [[1, 5, 7, 9, 1]], [[2, 6, 15, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 6, 9, 6, 9]], [[0, 2, 4, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000]], [[1, 4, 7, 9, 1, 4]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[2, 2, 4, 6, 8, 7, 10, 2]], [[2, 4, 7, 6, 8, 2, 3]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 33, 7, 9]], [[0, 17, 2, 3, 6, 8, 10, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2, 6, 8, 2, 39, 2]], [[7, 9, 1, 5, 37, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[2, 2, 4, 5, 8, 10, 2, 2]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9]], [[6, 8, 2, 39, 2]], [[2, 6, 8, 10]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[31, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 39, 19, 21, 23, 11, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000]], [[1, 3, 5, 7, 9, 7]], [[2, 6, 10]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 4, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 30, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 13]], [[2, 4, 4, 8, 2, 3, 30, 2]], [[7, 2, 4, 6, 8, 11, 11]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7, 4]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39, 31]], [[0, 2, 4, 6, 8, 10, 1, 5, 6, 9, 9, 6]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 27, 29, 31, 9, 35, 39, 39]], [[31, 8, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[0, 7, 2, 4, 6, 8, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39, 7]], [[0, 7, 2, 4, 6, 8, 10, 2]], [[0, 7, 2, 4, 6, 8, 10, 2, 4]], [[2, 6, 8, 2, 39, 3, 2]], [""], [[2, 4, 7, 6, 8, 2, 3, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 39, 19, 21, 24, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 20, 21, 0, 25, 27, 29, 7, 9, 31, 35, 37, 39, 4, 2, 9]], [[7, 9, 1, 5, 10000, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[2, 6, 8, 2, 6]], [[1, 5, 7, 1]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 39, 4, 2]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7, 4, 7]], [[7, 9, 1, 25, 3, 11, 12, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 29]], [[0, 2, 4, 6, 8, 10, 1, 5, 8, 9, 9, 6, 6]], [[0, 2, 4, 6, 8, 2, 3, 2]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39, 9]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9]], [[2, 2, 34, 6, 8, 10, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 4, 2]], [[7, 9, 1, 25, 3, 11, 12, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 29, 25, 27, 4]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7, 4, 3]], [[2, 6, 8]], [[0, 2, 3, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37]], [[0, 7, 2, 4, 6, 4, 8, 10]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3]], [[7, 9, 1, 5, 3, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[2, 2, 4, 10, 8, 10, 2, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[0, 2, 4, 6, 8, 10, 1, 3, 34, 5, 6, 9, 9]], [[10, 9, 8, 6, 5, 4, 19, 3, 2, 1, 7]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[2, 2, 4, 8, 10, 2]], [[7, 9, 1, 5, 10000, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9, 1]], [[0, 3, 5, 8, 9, 7]], [[1, 5, 7, 1, 1]], [[1, 4, 7, 9, 1]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 27, 29, 31, 9, 35, 39, 34, 39]], [[7, 9, 1, 5, 3, 4, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 4]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[2, 4, 6, 7, 22, 2]], [[0]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 4, 2, 29]], [[2, 4, 6, 8, 10, 8]], [[1, 11, 5, 7, 9, 1]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 5, 9, 9]], [[2, 6, 8, 2, 39, 2, 2]], [[31, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2]], [[7, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[2, 2, 6, 8, 10, 2]], [[3, 3, 3, 3]], [[1, 5, 8, 1, 1, 1]], [[7, 9, 1, 3, 4, 13, 15, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 4, 7]], [[31, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 39, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[2, 6, 8, 10, 6]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 31, 33, 35, 37, 39, 4, 2, 9, 3, 5]], [[31, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2]], [[10, 8, 7, 6, 5, 4, 3, 2, 1]], [[2, 4, 6, 8, 10, 1, 3, 5, 7, 9]], [[0, 7, 2, 3, 4, 6, 8, 10]], [[0, 1, 2, 5, 3, 7, 9, 10, 7]], [[2, 4, 5, 10, 2, 2]], [[7, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 9]], [[1, 3, 8, 7, 6, 9]], [[7, 9, 1, 5, 3, 6, 13, 15, 30, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 24, 2, 13, 5]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39, 25]], [[9, 8, 7, 6, 2, 5, 4, 3, 2, 1]], [[0, 7, 2, 7, 20, 4, 8, 10]], [[2, 4, 6, 8, 10, 10, 2]], [[2, 4, 5, 8, 10, 2, 2]], [[31, 8, 1, 1, 1, 1, 39, 1, 2, 2, 2, 2]], [[0, 7, 2, 3, 6, 8, 10, 2]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 31, 33, 35, 37, 39, 4, 2, 9, 5]], [[0, 7, 2, 4, 4, 8, 10, 8]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 39, 31]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 25, 27, 29, 31, 9, 35, 34, 39]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 31]], [[0, 7, 2, 4, 8, 10, 10, 2, 10]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 25]], [[0, 17, 2, 3, 6, 8, 10, 38, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[7, 9, 1, 5, 3, 20, 13, 15, 17, 19, 21, 23, 25, 27, 21, 9, 31, 33, 10000, 35, 37, 39, 4, 2]], [[0, 1, 5, 7, 1, 1]], [[1, 3, 5, 7, 9, 5]], [[2, 1, 5, 7, 12, 9, 1]], [[0, 2, 4, 7, 6, 10, 1, 3, 34, 5, 6, 9, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37, 19]], [[1, 5, 7, 2, 0, 1]], [[7, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 4, 2, 3]], [[8, 7, 6, 5, 4, 3, 2, 1]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 34, 37, 39, 4, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 31, 31]], [[7, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 20, 37, 39, 4, 2, 9, 9, 23, 27]], [[0, 2, 3, 6, 8, 10, 31, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37, 33]], [[7, 9, 1, 5, 3, 4, 13, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 36, 39, 4, 2, 21]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 34, 37, 39, 4, 2, 1]], [[2, 22, 8, 25, 10]], [[0, 2, 4, 6, 8, 10, 3, 17, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 18, 27, 29, 31, 9, 35, 39, 34, 39, 17]], [[1, 37, 7, 9, 1]], [[2, 4, 1, 6, 8, 10, 8, 1]], [[1, 34, 1, 1, 1, 2, 2, 27, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 1, 5, 6, 9, 9, 6, 9]], [[10, 9, 8, 7, 7, 6, 5, 4, 3, 2, 1, 7, 4, 7]], [[0, 7, 2, 4, 6, 8, 10, 8]], [[7, 37, 9, 1, 5, 9, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 37, 39, 4, 2, 4]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 11, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 37, 39, 4, 2, 9, 3]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 25]], [[2, 6, 2, 39, 2, 8]], [[0, 17, 2, 3, 6, 8, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2, 2, 4, 6, 8, 10, 8, 3, 10]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9, 35]], [[2, 6, 3, 15, 10]], [[0, 1, 5, 1, 7, 1, 1]], [[0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 39, 31, 3, 33]], [[0, 3, 38]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 27, 31, 9, 34, 39, 34, 39]], [[10, 9, 8, 7, 6, 7, 6, 5, 4, 3, 2, 1, 7, 4, 7]], [[1, 5, 7, 2, 0, 1, 1]], [[31, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1]], [[1, 3, 5, 31, 7, 9]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 17]], [[0, 27, 2, 38, 6, 10, 1, 5, 6, 9, 9, 6, 9]], [[1, 3, 5, 7, 5, 9]], [[0, 7, 2, 10, 3, 4, 6, 8, 10]], [[0, 17, 2, 3, 6, 9, 8, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 36, 31, 33, 35, 37, 39]], [[0, 3, 8, 9, 7, 7]], [[7, 9, 1, 5, 3, 4, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 8, 37, 39, 4, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39, 21]], [[0, 2, 6, 8, 10, 1, 3, 5, 36, 5, 9, 9]], [[2, 4, 7, 6, 8, 15, 3]], [[0, 1, 2, 5, 3, 7, 9, 10, 7, 10]], [[7, 9, 1, 5, 10000, 3, 13, 15, 20, 20, 21, 0, 25, 27, 29, 9, 35, 37, 39, 4, 2, 9, 1]], [[4, 0, 7, 3, 2, 3, 6, 8, 10, 2]], [[2, 6, 8, 2, 39, 2, 5, 2]], [[0, 2, 4, 6, 8, 2, 3, 2, 8]], [[0, 2, 4, 6, 8, 2, 3, 2, 2, 6]], [[1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2]], [[0, 17, 2, 3, 6, 8, 10, 38, 1, 3, 13, 7, 9, 11, 38, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[7, 35, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7]], [[0, 3, 9, 9, 7, 7]], [[7, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 3, 31, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 38, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 4, 2]], [[1, 1, 1, 1, 1, 2, 17, 2, 2, 2, 2]], [[1, 3, 5, 7, 9, 1, 7]], [[7, 35, 9, 1, 5, 9, 10001, 3, 11, 13, 15, 17, 19, 21, 23, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[10, 9, 27, 8, 7, 6, 5, 3, 2, 10001]], [[7, 9, 1, 5, 11, 13, 15, 17, 19, 21, 23, 27, 29, 31, 31, 37, 39, 4, 2, 31, 31, 4]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 30, 19, 21, 24, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[9, 2, 6, 8, 10]], [[0, 34, 2, 4, 6, 8, 10, 1, 5, 6, 9, 9, 6, 9]], [[0, 1, 2, 23, 5, 7, 9, 12, 9]], [[10, 8, 7, 6, 5, 4, 3, 7, 2, 1]], [[17, 3, 3, 3, 3, 3, 3]], [[1, 3, 5, 7, 5]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 34, 37, 39, 4, 35, 1]], [[7, 9, 1, 5, 3, 4, 36, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 8, 37, 39, 4, 2]], [[0, 9, 2, 4, 6, 8, 2]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 31, 33, 35, 37, 39, 4, 2, 9, 3, 5, 10]], [[7, 25, 1, 5, 3, 4, 13, 15, 17, 19, 21, 23, 25, 27, 29, 1, 31, 33, 35, 37, 39, 4, 2]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 22, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39]], [[3, 3]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 17, 17]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 39, 19, 21, 24, 27, 29, 32, 31, 35, 37, 39, 4, 1]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 31, 33, 35, 37, 33, 39, 4, 2, 9, 3, 5, 17]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 30, 19, 21, 23, 25, 27, 29, 9, 31, 33, 37, 39, 4, 2, 9, 3]], [[2, 22, 8, 25, 10, 25]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21]], [[1, 0, 20, 3, 20]], [[7, 9, 19, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 4, 2, 4]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 18, 23, 25, 27, 29, 31, 33, 9, 35, 39, 39, 25]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 39, 19, 21, 24, 27, 29, 32, 31, 35, 37, 39, 4, 1, 21]], [[2, 4, 5, 10, 2, 2, 2]], [[7, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 9]], [[0, 7, 2, 3, 4, 6, 1, 8, 10]], [[0, 2, 4, 6, 8, 2, 3, 29, 2]], [[0, 2, 4, 6, 8, 19, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 13, 31, 33, 40, 35, 37, 39, 4, 2, 9, 3, 5]], [[10001, 22, 8, 25, 10]], [[10, 9, 8, 7, 24, 5, 4, 3, 2, 1, 7, 4]], [[1, 2, 5, 7, 2, 0, 1]], [[1, 3, 6, 5, 7, 9, 7]], [[0, 2, 4, 0, 6, 8, 10, 1, 3, 5, 33, 7, 9]], [[0, 2, 4, 5, 6, 8, 10, 1, 3, 5, 5, 9, 9]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 11, 34, 39, 39, 4, 2, 7, 21]], [[7, 9, 1, 5, 10000, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 20, 2, 9]], [[2, 2, 4, 10, 8, 10, 1, 2]], [[2, 2, 9, 4, 6, 8, 7, 10, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 6, 9, 9, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0]], [[2, 22, 8, 25, 22, 10]], [[0, 7, 2, 4, 6, 10, 4, 2]], [[7, 9, 1, 5, 3, 11, 8, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[2, 4, 7, 27, 6, 8, 2, 3, 2]], [[1, 3, 5, 7, 3, 5, 9]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 4]], [[2, 6, 15, 10, 6, 6]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 32, 31, 33, 9, 35, 9, 39, 39]], [[36, 8, 7, 6, 5, 4, 3, 7, 2, 1]], [[3, 3, 3]], [[2, 4, 6, 8, 10, 1, 4, 5, 7, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 9, 37, 19]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 1, 2]], [[7, 9, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 25, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3]], [[10, 9, 8, 6, 33, 4, 19, 3, 2, 1, 7]], [[7, 9, 1, 5, 3, 4, 13, 39, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2]], [[10, 2, 6, 8, 2, 39, 2, 2]], [[8, 7, 6, 5, 4, 3, 2, 1, 6]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9, 35, 2]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 10, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 17]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 9, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 4, 2, 23]], [[5, 3, 1, 5, 7, 2, 0, 1]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[0, 17, 2, 3, 6, 8, 10, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 19]], [[2, 37, 4, 10, 8, 10, 2, 2, 37]], [[0, 7, 2, 3, 4, 8, 10, 2]], [[8, 7, 6, 5, 4, 3, 2, 1, 6, 2, 1]], [[0, 1, 5, 25, 7, 1, 1]], [[7, 9, 0, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3]], [[7, 9, 1, 5, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9]], [[0, 7, 2, 3, 1, 6, 8, 10, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 2, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 24, 1, 10000, 1, 10000, 0, 1, 10000]], [[2, 22, 8, 23, 25, 10, 25]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 21]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 21, 21]], [[0, 2, 4, 5, 8, 10, 1, 3, 19, 5, 0, 9, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 10000, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39]], [[10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 7, 4, 3]], [[1, 4, 31, 7, 9]], [[17, 3, 3, 3, 3, 3, 3, 3]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 9, 9]], [[1, 5, 7, 23, 2, 0, 1, 5, 1]], [[2, 4, 4, 8, 2, 3, 2, 2]], [[0, 7, 2, 3, 4, 8, 10, 2, 8]], [[7, 9, 23, 5, 4, 11, 13, 15, 17, 14, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 23, 25, 25, 27, 9, 33, 35, 37, 39, 2, 9]], [[2, 2, 4, 8, 10, 3, 2]], [[7, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 20, 37, 39, 4, 2, 9, 9, 23, 27, 19]], [[0, 2, 4, 5, 6, 8, 10, 3, 5, 5, 9, 9]], [[7, 8, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[4, 0, 7, 3, 2, 3, 2, 6, 8, 10, 2]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 15, 17, 19, 18, 25, 27, 29, 31, 33, 9, 35, 39, 39, 25]], [[7, 9, 1, 5, 3, 4, 36, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 8, 37, 39, 4, 2, 29]], [[2, 6, 8, 2, 6, 6]], [[7, 1, 5, 3, 11, 37, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 3, 31, 35, 37, 39, 4, 2]], [[7, 1, 5, 3, 4, 13, 15, 17, 19, 21, 23, 27, 29, 1, 31, 33, 36, 37, 39, 4, 2, 5]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21]], [[31, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 34, 34, 39, 4, 2, 7, 21]], [[1, 7, 9, 1, 1]], [[2, 5, 8, 10]], [[1, 0, 20, 3, 20, 3]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 34, 34, 39, 4, 2, 7, 21, 39]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 5, 7, 11, 13, 15, 17, 39, 19, 21, 23, 25, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[7, 9, 1, 5, 10000, 3, 10, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 31, 33, 35, 37, 39, 4, 2, 9, 5]], [[1, 4, 7, 31, 1, 4]], [[3, 3, 3, 3, 3, 3, 3]], [[10, 9, 1, 8, 7, 6, 5, 4, 3, 2, 1, 7, 4, 3]], [[10, 9, 8, 7, 30, 7, 6, 5, 4, 3, 2, 1, 7, 4, 7]], [[0, 7, 2, 4, 6, 4, 8, 10, 2]], [[2, 4, 8, 32, 8]], [[0, 1, 5, 25, 7, 1, 1, 1]], [[7, 37, 9, 1, 5, 9, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 34, 5, 33, 35, 20, 37, 39, 4, 2, 9, 9, 23, 27]], [[7, 37, 9, 1, 5, 9, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 34, 5, 33, 35, 20, 37, 39, 4, 2, 9, 23, 27]], [[31, 0, 3, 8, 9, 7, 7]], [[10, 9, 8, 6, 33, 4, 19, 3, 1, 7]], [[2, 6, 8, 2, 6, 8]], [[7, 35, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23, 15]], [[9, 2, 4, 7, 6, 9, 8, 2, 3, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 23, 10000, 1, 10000, 1, 21, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 2, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 24, 1, 10000, 1, 10000, 0, 1, 10000]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 2, 9, 17, 17]], [[4, 0, 7, 3, 3, 2, 3, 6, 8, 10, 2]], [[2, 2, 4, 6, 15, 7, 10, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21, 2, 11]], [[7, 37, 9, 1, 5, 9, 9, 10000, 13, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[0, 2, 4, 6, 8, 10, 1, 3, 34, 5, 6, 9, 0, 9]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10001, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 10000, 25, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 2, 29]], [[31, 8, 1, 1, 1, 1, 1, 2, 2, 2]], [[3, 31, 3, 3]], [[31, 1, 1, 2, 1, 1, 1, 2, 10001, 2, 2, 1, 2]], [[31, 8, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2]], [[2, 22, 8, 25, 8, 10, 22, 10]], [[2, 2, 4, 10, 8, 10, 2, 2, 2]], [[0, 2, 6, 8, 10, 1, 5, 12, 5, 9, 9]], [[2, 33, 6, 1, 15, 21, 2]], [[0, 7, 2, 10, 3, 4, 8, 10]], [[7, 1, 5, 3, 11, 13, 15, 17, 19, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[7, 9, 1, 5, 3, 13, 4, 36, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 8, 37, 39, 4, 2, 29]], [[2, 8, 2]], [[1, 5, 7, 1, 5]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 5, 7, 11, 13, 15, 17, 39, 19, 21, 23, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[2, 6, 6, 1, 31, 21, 2]], [[7, 9, 1, 5, 3, 13, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 38, 39, 4, 2, 9]], [[1, 5, 7]], [[0, 2, 4, 6, 34, 8, 10, 1, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 37, 39, 39]], [[7, 9, 5, 10000, 3, 11, 13, 14, 19, 21, 23, 25, 27, 25, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 14]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 21, 37]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 39, 10000, 35, 37, 39, 4, 2, 31]], [[2, 6, 2, 39, 2, 8, 2]], [[7, 9, 19, 1, 5, 3, 11, 13, 15, 17, 19, 37, 23, 25, 27, 29, 31, 37, 39, 4, 2, 4]], [[1, 5, 8, 1, 1, 1, 1, 1]], [[0, 7, 2, 10, 3, 4, 6, 10001, 31, 8, 10]], [[34, 1, 11, 5, 7, 9, 1]], [[7, 37, 9, 1, 5, 9, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23, 2]], [[22, 38, 5, 7, 9, 1]], [[1, 11, 5, 9, 9, 1]], [[1, 1, 5, 7, 23, 2, 0, 1, 5, 1]], [[7, 35, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 40, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 35, 37, 39, 4, 2, 9, 9, 23, 15, 23]], [[0, 7, 2, 4, 29, 8, 10, 21, 8, 8]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 5, 7, 11, 11, 15, 17, 39, 19, 21, 23, 25, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 27, 31, 9, 34, 35, 34, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 34, 5, 9, 0, 9]], [[0, 17, 2, 3, 6, 8, 1, 3, 13, 7, 9, 11, 1, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 21, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 21]], [[0, 2, 4, 25, 6, 8, 10, 3, 5, 7, 9, 24, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 39, 31, 10]], [[0, 7, 2, 4, 6, 10, 2]], [[1, 7, 9, 7, 1]], [[1, 3, 4, 7, 9, 5, 3]], [[13, 2, 6, 8, 3, 2, 39, 2, 2]], [[7, 9, 1, 5, 10000, 3, 10, 13, 34, 15, 17, 19, 23, 25, 10, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 10]], [[7, 9, 1, 5, 3, 11, 13, 15, 6, 17, 19, 21, 23, 25, 27, 29, 31, 31, 34, 37, 39, 4, 2, 1]], [[2, 37, 4, 10, 8, 10, 2, 2, 37, 10]], [[2, 4, 6, 7, 22, 2, 4]], [[1, 5, 7, 0, 1]], [[0, 17, 2, 3, 6, 8, 1, 3, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 5, 29, 31, 33, 35, 37, 39]], [[17, 3, 2, 3, 3, 3, 3, 5]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7, 4, 6]], [[7, 37, 9, 1, 5, 9, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23, 7]], [[36, 8, 7, 6, 5, 4, 31, 7, 2, 1]], [[4, 0, 21, 7, 3, 2, 3, 2, 6, 32, 6, 8, 1, 10, 2]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 16, 3, 7, 11, 15, 17, 39, 19, 21, 23, 25, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19]], [[0, 2, 4, 6, 8, 10, 1, 5, 6, 10, 9, 6]], [[17, 3, 3, 3, 3, 3, 3, 3, 3]], [[7, 9, 1, 5, 3, 4, 36, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 8, 5, 37, 39, 4, 2, 29, 36]], [[2, 6, 8, 6]], [[0, 7, 2, 10, 3, 4, 6, 10001, 31, 8, 10, 4]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9, 35, 2, 35]], [[0, 4, 25, 6, 8, 10, 3, 5, 7, 9, 24, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 31, 10]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 10, 12, 31, 33, 35, 37, 39, 4, 2, 9, 3, 5]], [[0, 3, 3, 3]], [[7, 9, 1, 5, 10000, 3, 11, 13, 17, 19, 21, 23, 25, 27, 29, 9, 7, 10, 13, 31, 33, 40, 35, 37, 39, 4, 2, 2, 9, 3, 5]], [[1, 30, 19, 3, 8, 7, 6, 9]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 9, 35, 27, 39, 39]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 1, 2, 39, 31]], [[10, 9, 9, 8, 8, 5, 4, 3, 2, 1, 8]], [[2, 33, 6, 1, 15, 21, 2, 2]], [[7, 9, 1, 5, 10000, 4, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 9, 37, 39, 4, 2, 9]], [[1, 5, 6, 9, 1, 7]], [[7, 9, 1, 5, 10000, 3, 10001, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[10, 9, 8, 6, 33, 4, 19, 1, 7]], [[7, 37, 9, 1, 5, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23, 10000]], [[22, 8, 25, 10]], [[7, 2, 4, 6, 38, 14]], [[0, 3, 2, 4, 6, 8, 10, 3, 17, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 18, 27, 29, 31, 9, 35, 39, 34, 39, 17]], [[1, 4, 7, 31, 0, 4]], [[7, 9, 1, 5, 10000, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9, 10000]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21, 3]], [[7, 9, 1, 5, 3, 10001, 13, 14, 15, 17, 19, 21, 23, 11, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[2, 5, 33, 6, 1, 15, 21, 2, 2, 2]], [[7, 9, 1, 5, 10000, 3, 13, 15, 19, 20, 21, 0, 25, 27, 29, 21, 31, 35, 37, 39, 4, 2, 9]], [[7, 9, 1, 5, 10000, 3, 10, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 2, 9, 17]], [[7, 9, 23, 5, 3, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 21, 25]], [[7, 9, 1, 5, 10000, 3, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9]], [[0, 17, 2, 3, 6, 8, 1, 1, 3, 13, 7, 9, 11, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2, 6, 2, 39, 2, 2, 2]], [[10, 10000, 6, 8, 2, 39, 2, 2]], [[2, 3, 6, 8, 2, 3, 2]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10001, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 10000, 25, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[31, 0, 30, 3, 8, 9, 7, 7, 37]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2]], [[2, 4, 2, 7, 6, 8, 2, 3, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 9, 30, 33, 35, 37, 4, 4, 2]], [[10, 9, 8, 33, 4, 19, 1, 7]], [[0, 2, 6, 8, 10, 1, 5, 6, 10, 9, 6]], [[7, 3, 4, 6, 8]], [[10, 9, 8, 7, 6, 11, 5, 4, 3, 2, 1, 7, 4, 7]], [[7, 2, 3, 4, 10, 2]], [[0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 16, 3, 16, 7, 11, 15, 17, 39, 19, 21, 23, 25, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19]], [[0, 7, 2, 3, 4, 8, 10, 2, 2]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 27, 29, 31, 33, 34, 39, 4]], [[7, 9, 1, 5, 3, 4, 36, 13, 15, 17, 19, 16, 21, 25, 27, 29, 9, 31, 33, 35, 8, 37, 39, 4, 2]], [[7, 9, 1, 25, 3, 19, 11, 12, 15, 17, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 4, 2, 29]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 23, 25, 27, 29, 9, 31, 33, 37, 37, 39, 4, 2, 1]], [[2, 15, 10]], [[1, 5, 7, 1, 1, 5]], [[10, 9, 8, 6, 32, 33, 4, 19, 1, 7]], [[2, 6, 6, 1, 31, 5, 2]], [[8, 2, 8]], [[2, 4, 5, 1, 8, 10, 2, 2]], [[1, 7, 1, 8, 1, 1]], [[7, 9, 1, 5, 3, 11, 10, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 4, 2, 17]], [[37, 0, 20, 3, 20]], [[2, 4, 8, 7, 8, 10]], [[1, 21, 7, 0, 1, 0]], [[7, 9, 1, 5, 11, 13, 15, 17, 19, 21, 23, 26, 29, 31, 31, 37, 39, 4, 2, 31, 31, 4]], [[2, 22, 8, 25, 22, 10, 2]], [[1, 3, 5, 31, 7, 9, 1]], [[0, 2, 4, 6, 8, 10, 3, 40, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 39, 31]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 21, 23, 25, 27, 29, 9, 31, 33, 35, 37, 39, 4, 2, 9, 3, 21, 1, 2]], [[2, 27, 22, 9, 25, 8, 10, 22, 10]], [[2, 6, 2, 39, 2, 8, 2, 2]], [[10001, 0, 2, 4, 6, 8, 19, 15, 10, 1, 9, 5, 7, 11, 13, 15, 17, 39, 19, 21, 23, 27, 29, 33, 35, 37, 39, 9, 37, 19, 19, 19]], [[10, 29, 8, 7, 6, 11, 5, 4, 3, 2, 1, 7, 4, 7]], [[10, 9, 8, 7, 6, 11, 5, 4, 3, 2, 1, 7, 4, 7, 7]], [[10, 9, 8, 7, 6, 5, 3, 4, 4, 3, 2, 1, 7, 4, 3]], [[17, 3, 2, 3, 3, 3, 5]], [[10, 9, 8, 7, 4, 11, 5, 4, 3, 2, 7, 1, 7, 4, 7, 7]], [[7, 8, 9, 1, 5, 10000, 3, 13, 15, 16, 19, 20, 21, 0, 25, 27, 29, 9, 31, 35, 37, 39, 4, 2, 9]], [[1, 4, 7, 9, 1, 4, 4]], [[2, 4, 7, 6, 8, 2, 3, 7]], [[7, 37, 9, 1, 5, 9, 9, 10000, 3, 11, 13, 15, 17, 19, 21, 23, 25, 27, 9, 5, 33, 35, 37, 39, 4, 2, 9, 9, 23]], [[2, 4, 5, 8, 17, 2, 2]], [[7, 1, 5, 3, 6, 13, 15, 30, 19, 21, 23, 25, 27, 29, 31, 31, 35, 37, 39, 24, 2, 13, 5]], [[9, 8, 7, 6, 2, 5, 4, 3, 2, 35]], [[7, 9, 1, 5, 10000, 3, 11, 13, 15, 17, 19, 23, 25, 25, 27, 9, 31, 33, 35, 37, 39, 2, 9, 35]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 7, 4, 6]], [[1, 5, 7, 1, 1, 5, 1]], [[7, 9, 23, 5, 5, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 34, 34, 39, 4, 2, 7, 21, 39]], [[10000, 1, 1, 7, 1, 1]], [[7, 9, 1, 5, 3, 11, 13, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 39, 4, 2, 7, 3]], [[7, 9, 1, 5, 3, 11, 10, 15, 17, 19, 21, 22, 31, 25, 27, 29, 31, 33, 34, 37, 39, 4, 2, 17, 2]], [[0, 2, 3, 6, 11, 2, 3, 29, 2]], [[0, 7, 2, 3, 4, 8, 10, 2, 8, 0]], [[9, 8, 7, 6, 2, 5, 4, 3, 2, 35, 4]], [[0, 2, 4, 6, 8, 10, 3, 5, 9, 11, 13, 20, 15, 17, 19, 21, 23, 25, 27, 31, 9, 34, 35, 34, 39, 0]], [[2, 4, 6, 8, 10, 1, 4, 5, 7, 9, 4]], [[0, 2, 6, 8, 10, 1, 3, 5, 6, 9, 9]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 21, 10000, 27, 1, 10000, 1, 10001, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 10000, 25, 10000, 1, 10000, 1, 10000, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 1, 10000, 10000]], [[0, 17, 2, 3, 6, 8, 10, 38, 22, 1, 4, 13, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2]], [[3]], [[1]], [[0, 0, 0]], [[1, 1, 1]], [[2, 2, 2]], [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[3, 3, 3, 29, 3]], [[2, 6, 4, 6, 8, 10]], [[3, 3, 3, 3, 29]], [[0, 8, 4, 6, 8, 10, 1, 5, 7, 9, 0]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[6, 3, 5, 7, 9, 5, 7]], [[9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 6, 3, 5, 7, 9, 5]], [[1, 39, 3, 5, 7, 9]], [[7, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[3, 29, 3, 3, 3, 29, 29]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 37, 39, 21]], [[39, 3, 5, 7, 9]], [[39, 3, 5, 9]], [[0, 2, 11, 4, 6, 8, 10, 1, 3, 5, 7, 9]], [[7, 9, 1, 5, 2, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 4, 2]], [[3, 4, 3, 3, 3]], [[29, 3, 3, 29, 28]], [[0, 2, 4, 6, 8, 10, 1, 37, 3, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39]], [[1, 1, 1, 1, 1, 2, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 3, 39]], [[29, 3, 29, 28]], [[0, 8, 4, 6, 8, 10, 1, 5, 7, 9, 0, 0]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39]], [[17, 3, 3, 29, 28]], [[0, 1, 2, 5, 7, 4, 10]], [[2, 4, 8, 10]], [[0, 2, 5, 7, 9, 10]], [[0, 2, 4, 6, 8, 10, 1, 37, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39]], [[0, 1, 2, 5, 39, 4, 10]], [[1, 1, 1, 1, 1, 2, 2, 2]], [[3, 4, 3, 3]], [[39, 2, 5, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 39, 0]], [[0, 1, 2, 5, 7, 9, 27, 10, 2]], [[3, 29, 3, 3, 3, 29]], [[0, 2, 4, 6, 8, 10, 1, 37, 3, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 8, 27, 29, 31, 33, 35, 2, 37, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21]], [[0, 8, 4, 6, 8, 10, 1, 5, 7, 0]], [[2, 1, 3, 5, 7, 6]], [[1, 39, 3, 38, 5, 7, 9]], [[0, 8, 4, 8, 6, 8, 10, 1, 5, 7, 9, 0]], [[39, 2, 9]], [[0, 2, 4, 37, 8, 10, 1, 37, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39]], [[17, 3, 3, 29, 28, 3]], [[3, 3, 3, 29, 3, 3]], [[5, 6, 5, 7, 9, 5, 7]], [[1, 1, 1, 1, 1, 2, 2, 2, 0, 2, 2]], [[39, 3, 5, 7, 9, 7]], [[6, 0, 1, 5, 39, 4, 10]], [[1, 6, 8, 10]], [[3, 4, 5, 3, 3]], [[1, 39, 11, 5, 7, 9, 9]], [[5, 10, 5, 7, 9, 31, 5, 7, 7]], [[0, 2, 4, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 37, 21, 1]], [[0, 1, 1, 2, 5, 7, 9, 27, 10, 2, 5]], [[0, 1, 0, 5, 7, 4, 7, 10]], [[0, 2, 4, 6, 8, 10, 1, 37, 3, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 27, 29, 31, 33, 35, 2, 37, 39, 4]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 38, 21]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 33]], [[1, 6, 25, 10000]], [[1, 32, 1, 2, 5, 7, 9, 27, 10, 2, 5]], [[0, 2, 4, 7, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[3, 29, 3, 3, 3, 29, 29, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 35, 37, 39, 21]], [[1, 0, 3, 5, 7, 9]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[10, 22, 2, 4, 8]], [[2, 9, 7, 4, 6, 8, 10]], [[1, 32, 1, 2, 5, 7, 9, 27, 5]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 11, 25, 27, 29, 31, 33, 35, 37, 39, 2]], [[2, 1, 3, 5, 7, 2, 6]], [[29, 3, 28]], [[0, 1, 2, 7, 10]], [[0, 2, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21, 23]], [[31, 3, 28, 4, 28, 3]], [[30, 3, 29, 28, 30]], [[1, 2, 6, 5, 7, 5]], [[1, 32, 1, 2, 6, 5, 7, 27, 10, 2, 5]], [[33, 1, 1, 1, 1, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 1]], [[22, 31, 3, 28, 4, 28, 2]], [[0, 2, 4, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 37, 21, 1]], [[0, 1, 2, 5, 39, 4, 10, 10]], [[0, 2, 4, 7, 8, 10, 1, 3, 5, 7, 9, 7, 11, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 10000, 11, 13, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 38, 21]], [[28, 3, 28, 3, 28]], [[5, 29, 3, 3, 3, 29, 29]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 11, 25, 27, 29, 31, 28, 33, 35, 37, 39, 2]], [[1, 3, 5, 7, 9, 5, 7]], [[0, 2, 4, 6, 21, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 1, 2, 5, 7, 9, 27, 10, 2, 1]], [[33, 13, 1, 1, 1, 2, 2, 2]], [[1, 6, 25, 10000, 25]], [[0, 8, 4, 6, 8, 10, 1, 5, 0, 6]], [[0, 9, 2, 6, 7, 9, 10]], [[0, 1, 2, 39, 4, 10, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 4, 27, 29, 31, 32, 35, 37, 39]], [[1, 1, 1, 1, 2, 2, 2]], [[0, 2, 4, 6, 21, 8, 10, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 19, 21, 23, 25, 29, 2, 35, 37, 39, 21]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 21, 21]], [[0, 2, 4, 6, 21, 8, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 5, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 23]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 22, 37, 21, 21, 21]], [[3, 29, 3, 3, 3, 28, 29, 29, 3]], [[29, 3, 28, 29]], [[10, 39, 5, 9]], [[0, 1, 2, 29, 7, 4, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 37]], [[5, 10, 7, 9, 5, 7, 7]], [[1, 1, 1, 1, 1, 2, 2]], [[0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 11, 25, 27, 29, 31, 33, 35, 37, 39, 2]], [[1, 32, 1, 2, 6, 38, 5, 7, 27, 10, 2, 5, 27]], [[0, 1, 2, 39, 4, 10]], [[0, 2, 4, 6, 8, 10, 1, 37, 5, 25, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 29, 31, 33, 35, 2, 37, 39]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 19, 21, 23, 25, 27, 29, 2, 35, 37, 39, 21, 39]], [[1, 0, 3, 4, 5, 7, 9]], [[2, 3, 5, 7, 2, 37, 6]], [[0, 2, 4, 6, 21, 8, 10, 1, 3, 5, 7, 9, 11, 32, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[10, 5, 9]], [[28, 8, 28, 3, 6, 3]], [[1, 1, 1, 1, 1, 10000, 2, 2]], [[3, 31, 3, 4, 28, 4, 28, 2]], [[4, 3, 3]], [[0, 2, 4, 7, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 29, 25, 27, 29, 31, 33, 13, 35, 37, 39]], [[0, 2, 4, 6, 21, 7, 10, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29]], [[1, 1, 1, 1, 2, 2]], [[1, 25, 13, 10000, 25]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 21, 21, 37]], [[2, 6, 5, 7, 5]], [[1, 39, 3, 5, 4, 7, 38, 9, 3]], [[0, 2, 4, 6, 8, 10, 7, 1, 3, 5, 7, 10000, 11, 13, 11, 17, 19, 21, 23, 27, 29, 2, 33, 35, 22, 37, 38, 21]], [[17, 3, 32, 3, 29, 28]], [[29, 3, 3, 29]], [[2, 6, 4, 6, 8, 0]], [[3, 5, 3, 3]], [[1, 1, 1, 0, 2, 2]], [[9, 10, 39, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5]], [[2, 1, 3, 5, 8, 7, 6]], [[29, 3, 28, 29, 29]], [[29, 3, 29, 28, 28]], [[0, 2, 4, 6, 1, 10, 1, 3, 5, 7, 9]], [[0, 2, 6, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 2, 4, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 37, 21, 1, 35]], [[0, 2, 4, 3, 6, 8, 10, 3, 5, 7, 9, 11, 29, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 3, 39]], [[0, 4, 6, 21, 8, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 5, 21, 23, 25, 27, 28, 31, 33, 35, 37, 39, 23, 15]], [[1, 25, 26, 17, 25, 17]], [[0, 2, 4, 3, 6, 8, 10, 3, 5, 7, 9, 11, 29, 15, 18, 19, 21, 23, 27, 29, 31, 33, 35, 37, 15, 3, 39]], [[0, 1, 2, 19, 5, 7, 9, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 21, 21, 18, 37]], [[0, 9, 2, 6, 7, 18, 9, 10]], [[3, 29, 3, 3, 29, 29]], [[1, 25, 10000, 25]], [[0, 2, 4, 6, 8, 10, 1, 37, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39, 19]], [[0, 2, 4, 6, 8, 10, 1, 37, 3, 5, 7, 9, 11, 13, 10, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39]], [[0, 2, 5, 7, 9, 39, 10]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 1, 13]], [[2, 9, 7, 4, 6, 6, 8, 10, 6, 6]], [[6, 8, 10]], [[0, 6, 8, 10]], [[0, 2, 4, 7, 8, 10, 1, 3, 5, 7, 9, 7, 11, 11, 13, 15, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39]], [[29, 3, 29, 1, 2, 28]], [[2, 6, 4, 8, 0]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 4, 27, 29, 31, 32, 35, 37, 39, 5]], [[3, 29, 3, 3, 29]], [[0, 2, 4, 6, 21, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 26, 29, 31, 33, 35, 37, 9]], [[0, 2, 4, 6, 21, 7, 1, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21]], [[2, 7, 4, 6, 8, 10]], [[33, 1, 1, 0, 1, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 25, 27, 29, 31, 33, 35, 37, 39]], [[9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 2]], [[3, 29, 3, 3, 29, 3, 3]], [[1, 2, 6, 5, 7, 9, 5]], [[7, 9, 1, 5, 2, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 39, 2]], [[0, 2, 4, 7, 8, 10, 1, 3, 5, 7, 9, 7, 11, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0]], [[2, 1, 3, 3, 5, 8, 7, 6, 6]], [[28, 28, 3, 6, 3]], [[3, 29, 3, 3, 29, 29, 9]], [[39, 3, 5, 9, 5]], [[6, 1, 3, 5, 7, 9, 5]], [[33, 1, 1, 0, 11, 1, 2, 2, 2]], [[3, 29, 3, 3, 29, 29, 29]], [[30, 0, 9, 2, 6, 7, 9, 10, 9]], [[3, 29, 3, 29, 29, 9]], [[2, 1, 3, 5, 8, 7, 6, 3]], [[0, 6, 8, 9]], [[2, 7, 4, 6, 8, 19, 10]], [[0, 1, 2, 5, 7, 9]], [[1, 2, 6, 6, 7, 5, 6]], [[17, 3, 32, 3, 13, 28, 32]], [[10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 1, 10000, 0]], [[29, 3, 29]], [[1, 1, 1, 1, 1, 2, 1, 2, 2]], [[0, 8, 4, 8, 6, 8, 10, 1, 7, 5, 7, 9, 0, 7]], [[38, 35, 1, 31, 25, 10000]], [[1, 25, 13, 10, 25]], [[29, 3, 29, 1]], [[1, 1, 1, 1, 28, 1, 2, 2]], [[29, 2, 3, 29]], [[0, 1, 1, 2, 5, 7, 9, 27, 10, 2]], [[1, 1, 1, 1, 1, 2, 2, 2, 0, 2, 2, 2]], [[39, 8, 9]], [[0, 2, 4, 6, 8, 10, 5, 3, 36, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 33]], [[2, 4, 8, 10, 4, 4]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 23, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 38, 21]], [[28, 28, 3, 3, 6, 3]], [[3, 3, 3, 3, 29, 29]], [[11, 0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 25, 27, 29, 2, 33, 35, 22, 37, 21, 36, 18, 37, 1]], [[0, 2, 4, 6, 8, 10, 1, 16, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 21, 21]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 10000, 11, 13, 11, 17, 10000, 21, 23, 25, 27, 29, 2, 33, 1, 35, 22, 37, 38, 21]], [[1, 1, 1, 28, 1, 2, 2]], [[30, 0, 8, 2, 10, 6, 7, 9, 10, 9, 6]], [[0, 6, 8]], [[9, 7, 4, 6, 16, 10]], [[0, 6, 8, 9, 9, 9]], [[2, 8, 10, 4]], [[0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 11, 13, 29, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21]], [[0, 33, 2, 6, 7, 9, 10]], [[2, 3, 29, 3, 3, 3, 28, 29, 29, 3, 3]], [[1, 2, 7, 10, 2]], [[0, 33, 1, 1, 11, 1, 2, 2, 2, 11]], [[1, 3, 5, 7, 8]], [[3, 5, 3, 2, 3, 5]], [[2, 4, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 37, 21, 1]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 39, 0]], [[7, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 2, 19, 21, 23, 11, 25, 27, 29, 31, 33, 35, 37, 39, 2]], [[22, 31, 3, 28, 28, 2]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 1, 31]], [[3, 31, 0, 4, 28, 4, 28]], [[33, 13, 1, 1, 1, 2, 27, 2, 2]], [[38, 35, 0, 31, 25, 10000]], [[3, 29, 28]], [[38, 36, 1, 31, 25, 10000]], [[39, 9]], [[0, 1, 2, 19, 7, 10, 0]], [[0, 2, 5, 7, 9, 27, 10, 2, 1]], [[0, 6, 5, 8, 9]], [[28, 28, 3, 6, 5, 3]], [[0, 1, 5, 39, 4, 10, 10]], [[2, 1, 3, 5, 7, 2, 6, 2]], [[0, 2, 4, 6, 8, 10, 1, 37, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 15, 19]], [[22, 3, 29]], [[3, 3, 29, 3, 3, 29, 29, 29]], [[6, 8, 10, 8]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21, 35]], [[1, 3, 5, 3, 7, 9, 5]], [[29, 28]], [[0, 2, 4, 6, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 37]], [[0, 2, 4, 37, 8, 10, 1, 37, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39, 31]], [[0, 10, 1, 5, 39, 4, 10, 10]], [[0, 29, 1, 2, 5, 39, 4, 10]], [[23, 3, 28]], [[1, 6, 25, 35, 10000, 25]], [[17, 3, 3, 29, 27, 28, 16, 3]], [[2, 9, 7, 5, 6, 8, 10]], [[0, 2, 4, 6, 8, 10, 5, 3, 36, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 29, 31, 33, 35, 37, 39, 33]], [[1, 1, 1, 1, 1, 1, 2, 1, 2]], [[3, 28, 28, 3, 3, 6]], [[0, 33, 1, 1, 11, 1, 2, 2, 2, 0, 11]], [[1, 38, 1, 0, 2, 2]], [[1, 25, 14, 10, 25]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 2, 19, 21, 23, 11, 25, 27, 29, 31, 33, 35, 37, 39, 2, 3]], [[1, 1, 1, 1, 2, 28, 2]], [[2, 3, 8, 3, 4]], [[10, 9, 8, 16, 7, 6, 5, 4, 3, 2, 1]], [[0, 2, 3, 6, 8, 10, 1, 5, 7, 9, 11, 13, 15, 11, 17, 21, 37, 23, 25, 27, 29, 2, 33, 35, 37, 21, 1]], [[1, 29, 30, 6, 5, 7, 9, 5]], [[3, 3, 3, 29, 29, 29]], [[0, 2, 19, 4, 10, 0]], [[3, 3, 3, 4, 3, 29]], [[39, 39, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 21]], [[28, 25, 28, 6, 3, 3]], [[0, 2, 4, 6, 20, 8, 10, 1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 11, 25, 27, 29, 31, 28, 33, 35, 37, 39, 2]], [[33, 1, 1, 0, 11, 1, 2, 2]], [[8, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 21, 21, 8]], [[0, 23, 1, 1, 11, 1, 2, 2, 2, 0, 11]], [[0, 2, 4, 37, 19, 8, 10, 1, 37, 5, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39, 31]], [[2, 10, 9]], [[17, 4, 32, 3, 13, 32]], [[3, 28, 28, 3, 3, 6, 6]], [[11, 0, 14, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 25, 27, 29, 2, 33, 35, 22, 37, 21, 36, 18, 37, 1]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21]], [[29, 3, 29, 0, 1, 2, 28]], [[1, 2, 6, 3, 5, 7, 6, 5]], [[1, 39, 3, 5, 18, 7, 9]], [[10, 9, 8, 7, 1, 6, 5, 4, 3, 2, 1]], [[0, 25, 2, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21, 23]], [[2, 1, 3, 6, 7, 2, 6]], [[2, 4, 38, 6, 8, 10]], [[3, 29, 3, 3, 29, 9, 9]], [[0, 2, 38, 4, 6, 21, 7, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21, 11, 4]], [[2, 3, 8, 7, 6, 3]], [[0, 2, 5, 7, 9, 10, 7]], [[39, 2, 2, 5, 9]], [[39, 9, 39]], [[1, 1, 1, 1, 2, 1, 31, 2]], [[28, 3, 28, 15, 3]], [[0, 2, 4, 6, 20, 8, 10, 1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 11, 25, 27, 29, 31, 28, 33, 35, 37, 39]], [[10, 10, 9, 8, 7, 1, 6, 5, 4, 3, 2, 1]], [[0, 1, 2, 39, 10, 10]], [[0, 6, 31, 5, 8, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 9, 4, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21, 5]], [[1, 3, 3, 5, 7, 9]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 2, 19, 21, 23, 11, 25, 29, 31, 33, 35, 37, 39, 2, 3]], [[3, 4, 3, 3, 3, 3]], [[0, 2, 4, 6, 8, 10, 37, 3, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 8, 27, 29, 31, 33, 35, 2, 37, 39, 3]], [[3, 29, 3, 3, 29, 3, 29, 3]], [[1, 1, 1, 1, 2, 3, 2]], [[0, 2, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21, 9]], [[6, 2, 1, 3, 5, 7, 2, 6]], [[6, 5, 9, 8]], [[3, 2, 4, 3, 3, 3, 3]], [[7, 8, 10]], [[38, 1, 1, 1, 1, 2, 2, 2, 0, 2, 2]], [[1, 1, 1, 16, 1, 1, 10000, 2, 2]], [[1, 3, 1, 32, 1, 2, 6, 5, 7, 27, 2, 5]], [[1, 4, 39, 3, 5, 7, 9, 7]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 10, 11, 17, 19, 21, 23, 25, 27, 29, 2, 35, 37, 39, 21]], [[10, 9, 8, 16, 6, 5, 4, 3, 2, 1, 7]], [[1, 1, 1, 1, 2, 3, 2, 2]], [[1, 3, 5, 7, 7, 9, 5, 7]], [[1, 1, 1, 1, 1, 28, 1, 2, 2, 2]], [[0, 5, 5, 8, 9]], [[1, 1, 1, 1, 2, 3, 2, 1, 1]], [[0, 4, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[1, 3, 5, 3, 7, 2, 6, 2, 3]], [[3, 3, 3, 4, 3, 29, 29]], [[3, 39, 3]], [[1, 1, 1, 0, 1, 28, 1, 2, 2]], [[3, 4, 23, 3, 3]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 27]], [[2, 8, 16, 10, 4]], [[33, 1, 1, 4, 11, 1, 2, 1, 2]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 19, 21, 23, 25, 27, 29, 31, 35, 37, 39, 29, 21]], [[1, 6, 0, 25, 10000, 25]], [[0, 2, 6, 21, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[2, 6, 6, 7, 5, 7, 7]], [[0, 2, 4, 7, 10, 1, 3, 5, 7, 9, 7, 23, 11, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 3]], [[11, 0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 15, 11, 17, 21, 25, 27, 29, 2, 33, 35, 22, 12, 37, 21, 36, 18, 37, 1, 8]], [[0, 8, 4, 8, 6, 8, 10, 1, 5, 9, 0, 8, 8]], [[9, 10, 9, 8, 7, 6, 5, 4, 3, 1, 17, 1, 5]], [[3, 28, 28, 3, 3, 6, 3]], [[0, 1, 0, 5, 7, 4, 7, 10, 0]], [[33, 1, 1, 1, 1, 2, 2, 39, 2]], [[5, 29, 2, 3, 3, 29, 29]], [[0, 2, 5, 6, 8, 10, 0, 37, 3, 6, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 8, 27, 29, 31, 33, 35, 2, 37, 39]], [[5, 29, 2, 16, 3, 3, 3, 4, 29, 29]], [[10, 9, 8, 16, 6, 5, 3, 3, 2, 1, 7]], [[1, 1, 1, 1, 2, 3, 1, 2, 1, 1, 1]], [[3, 4, 23, 3, 3, 3]], [[0, 8, 4, 6, 10, 1, 5, 7, 9, 0, 0, 0]], [[0, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 11, 13, 1, 15, 11, 17, 19, 21, 23, 25, 27, 29, 2, 33, 35, 22, 37, 38, 21, 8]], [[1, 2, 6, 5, 7, 6]], [[7, 8, 10, 7]], [[33, 13, 1, 1, 1, 2, 2, 2, 2, 2]], [[0, 6, 5, 8, 9, 0, 6]], [[2, 3, 5, 7, 2, 37, 6, 3]], [[1, 1, 1, 1, 1, 2, 2, 2, 0, 2, 2, 0]], [[3, 37, 3, 3, 29, 3, 3]], [[0, 6, 8, 9, 0]], [[0, 2, 4, 8, 10, 1, 3, 5, 7, 9, 7, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39]], [[0, 2, 19, 19, 10, 0]], [[1, 2, 5, 3, 7, 9, 5, 1]], [[29, 6, 3, 29, 5, 7, 9, 5, 7]], [[0, 2, 4, 6, 20, 8, 10, 1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 11, 25, 27, 29, 31, 28, 33, 35, 37, 39, 23]], [[1, 6, 10001, 25, 10000, 25, 10000]], [[3, 29, 3, 8, 3, 29, 29, 29]], [[0, 9, 0, 4, 8, 6, 2, 1, 5, 9, 0, 8, 8]], [[8, 4, 6, 8, 10, 1, 5, 0, 6]], [[5, 29, 3, 3, 3, 30]], [[8, 4, 6, 8, 10, 1, 5, 0, 6, 6]], [[28, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 11, 13, 29, 11, 17, 19, 21, 23, 25, 27, 29, 31, 32, 35, 37, 39, 21]], [[37, 3, 29, 3, 3, 3, 29]], [[0, 2, 4, 6, 21, 7, 1, 3, 5, 7, 9, 4, 11, 13, 15, 11, 19, 21, 23, 6, 27, 39, 29, 31, 35, 39, 29, 21, 5]], [[3, 28, 28, 3, 3, 21, 6, 3]], [[0, 2, 4, 6, 8, 10, 1, 37, 3, 5, 7, 9, 11, 13, 10, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 2, 37, 39, 7]], [[0, 4, 6, 21, 8, 8, 10, 1, 3, 5, 7, 9, 11, 30, 15, 11, 17, 19, 5, 21, 23, 25, 27, 28, 31, 33, 35, 37, 39, 23, 15]]], "completion": "\ndef pluck(arr):\n \"\"\"\n Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"\n even_nodes = [num for num in arr if num % 2 == 0]\n if not even_nodes:\n return []\n else:\n min_node = min(even_nodes)\n min_index = arr.index(min_node)\n return [min_node, min_index]\n", "raw_completion": "```python\ndef pluck(arr):\n \"\"\"\n Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"\n even_nodes = [num for num in arr if num % 2 == 0]\n if not even_nodes:\n return []\n else:\n min_node = min(even_nodes)\n min_index = arr.index(min_node)\n return [min_node, min_index]\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef pluck(arr):\n \"\"\"\n \"Given an array representing a branch of a tree that has non-negative integer nodes\n your task is to pluck one of the nodes and return it.\n The plucked node should be the node with the smallest even value.\n If multiple nodes with the same smallest even value are found return the node that has smallest index.\n\n The plucked node should be returned in a list, [ smalest_value, its index ],\n If there are no even values or the given array is empty, return [].\n\n Example 1:\n Input: [4,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index.\n\n Example 2:\n Input: [1,2,3]\n Output: [2, 1]\n Explanation: 2 has the smallest even value, and 2 has the smallest index. \n\n Example 3:\n Input: []\n Output: []\n \n Example 4:\n Input: [5, 0, 3, 0, 4, 2]\n Output: [0, 1]\n Explanation: 0 is the smallest value, but there are two zeros,\n so we will choose the first zero, which has the smallest index.\n\n Constraints:\n * 1 <= nodes.length <= 10000\n * 0 <= node.value\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/69", "prompt": "\ndef search(lst):\n '''\n You are given a non-empty list of positive integers. Return the greatest integer that is greater than \n zero, and has a frequency greater than or equal to the value of the integer itself. \n The frequency of an integer is the number of times it appears in the list.\n If no such a value exist, return -1.\n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n '''\n", "entry_point": "search", "canonical_solution": "\n\n count = dict()\n for num in lst:\n if num not in count:\n count[num] = 0\n count[num] += 1\n ans = -1\n for num, cnt in count.items():\n if cnt >= num:\n ans = max(ans, num)\n return ans\n\n", "test": "def check(candidate):\n\n # manually generated tests\n assert candidate([5, 5, 5, 5, 1]) == 1\n assert candidate([4, 1, 4, 1, 4, 4]) == 4\n assert candidate([3, 3]) == -1\n assert candidate([8, 8, 8, 8, 8, 8, 8, 8]) == 8\n assert candidate([2, 3, 3, 2, 2]) == 2\n\n # automatically generated tests\n assert candidate([2, 7, 8, 8, 4, 8, 7, 3, 9, 6, 5, 10, 4, 3, 6, 7, 1, 7, 4, 10, 8, 1]) == 1\n assert candidate([3, 2, 8, 2]) == 2\n assert candidate([6, 7, 1, 8, 8, 10, 5, 8, 5, 3, 10]) == 1\n assert candidate([8, 8, 3, 6, 5, 6, 4]) == -1\n assert candidate([6, 9, 6, 7, 1, 4, 7, 1, 8, 8, 9, 8, 10, 10, 8, 4, 10, 4, 10, 1, 2, 9, 5, 7, 9]) == 1\n assert candidate([1, 9, 10, 1, 3]) == 1\n assert candidate([6, 9, 7, 5, 8, 7, 5, 3, 7, 5, 10, 10, 3, 6, 10, 2, 8, 6, 5, 4, 9, 5, 3, 10]) == 5\n assert candidate([1]) == 1\n assert candidate([8, 8, 10, 6, 4, 3, 5, 8, 2, 4, 2, 8, 4, 6, 10, 4, 2, 1, 10, 2, 1, 1, 5]) == 4\n assert candidate([2, 10, 4, 8, 2, 10, 5, 1, 2, 9, 5, 5, 6, 3, 8, 6, 4, 10]) == 2\n assert candidate([1, 6, 10, 1, 6, 9, 10, 8, 6, 8, 7, 3]) == 1\n assert candidate([9, 2, 4, 1, 5, 1, 5, 2, 5, 7, 7, 7, 3, 10, 1, 5, 4, 2, 8, 4, 1, 9, 10, 7, 10, 2, 8, 10, 9, 4]) == 4\n assert candidate([2, 6, 4, 2, 8, 7, 5, 6, 4, 10, 4, 6, 3, 7, 8, 8, 3, 1, 4, 2, 2, 10, 7]) == 4\n assert candidate([9, 8, 6, 10, 2, 6, 10, 2, 7, 8, 10, 3, 8, 2, 6, 2, 3, 1]) == 2\n assert candidate([5, 5, 3, 9, 5, 6, 3, 2, 8, 5, 6, 10, 10, 6, 8, 4, 10, 7, 7, 10, 8]) == -1\n assert candidate([10]) == -1\n assert candidate([9, 7, 7, 2, 4, 7, 2, 10, 9, 7, 5, 7, 2]) == 2\n assert candidate([5, 4, 10, 2, 1, 1, 10, 3, 6, 1, 8]) == 1\n assert candidate([7, 9, 9, 9, 3, 4, 1, 5, 9, 1, 2, 1, 1, 10, 7, 5, 6, 7, 6, 7, 7, 6]) == 1\n assert candidate([3, 10, 10, 9, 2]) == -1\n\n", "contract": "\n assert all(type(val) == int and val > 0 for val in lst), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[5, 5, 5, 5, 1]], [[4, 1, 4, 1, 4, 4]], [[3, 3]], [[8, 8, 8, 8, 8, 8, 8, 8]], [[2, 3, 3, 2, 2]], [[2, 7, 8, 8, 4, 8, 7, 3, 9, 6, 5, 10, 4, 3, 6, 7, 1, 7, 4, 10, 8, 1]], [[3, 2, 8, 2]], [[6, 7, 1, 8, 8, 10, 5, 8, 5, 3, 10]], [[8, 8, 3, 6, 5, 6, 4]], [[6, 9, 6, 7, 1, 4, 7, 1, 8, 8, 9, 8, 10, 10, 8, 4, 10, 4, 10, 1, 2, 9, 5, 7, 9]], [[1, 9, 10, 1, 3]], [[6, 9, 7, 5, 8, 7, 5, 3, 7, 5, 10, 10, 3, 6, 10, 2, 8, 6, 5, 4, 9, 5, 3, 10]], [[1]], [[8, 8, 10, 6, 4, 3, 5, 8, 2, 4, 2, 8, 4, 6, 10, 4, 2, 1, 10, 2, 1, 1, 5]], [[2, 10, 4, 8, 2, 10, 5, 1, 2, 9, 5, 5, 6, 3, 8, 6, 4, 10]], [[1, 6, 10, 1, 6, 9, 10, 8, 6, 8, 7, 3]], [[9, 2, 4, 1, 5, 1, 5, 2, 5, 7, 7, 7, 3, 10, 1, 5, 4, 2, 8, 4, 1, 9, 10, 7, 10, 2, 8, 10, 9, 4]], [[2, 6, 4, 2, 8, 7, 5, 6, 4, 10, 4, 6, 3, 7, 8, 8, 3, 1, 4, 2, 2, 10, 7]], [[9, 8, 6, 10, 2, 6, 10, 2, 7, 8, 10, 3, 8, 2, 6, 2, 3, 1]], [[5, 5, 3, 9, 5, 6, 3, 2, 8, 5, 6, 10, 10, 6, 8, 4, 10, 7, 7, 10, 8]], [[10]], [[9, 7, 7, 2, 4, 7, 2, 10, 9, 7, 5, 7, 2]], [[5, 4, 10, 2, 1, 1, 10, 3, 6, 1, 8]], [[7, 9, 9, 9, 3, 4, 1, 5, 9, 1, 2, 1, 1, 10, 7, 5, 6, 7, 6, 7, 7, 6]], [[3, 10, 10, 9, 2]]], "atol": 0, "plus_input": [[[3, 2, 1, 1, 1, 1, 1]], [[5, 5, 5, 5, 5, 5, 5]], [[2, 2, 2, 2, 2, 2, 2, 2]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4]], [[2, 2, 2, 2, 2, 2, 2, 2, 2]], [[1, 2, 4, 4, 4, 4]], [[1, 1, 1, 2, 2, 2, 3, 3]], [[5, 5, 5, 4, 3, 5, 5]], [[4, 5, 6, 4, 3, 5, 5]], [[4, 5, 6, 4, 5, 3, 5, 5]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4]], [[4, 1, 1, 1, 2, 2, 2, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 6, 9, 10, 1]], [[5, 5, 4, 3, 5, 5]], [[6, 4, 5, 6, 3, 5, 3, 5, 5, 5]], [[1, 8, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 3]], [[4, 5, 4, 3, 5, 8]], [[1, 2, 3, 4, 5, 6, 7, 3, 9, 10]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4]], [[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 6, 4, 4, 4, 4, 4, 3, 1]], [[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 2]], [[1, 1, 1, 2, 2, 2, 3, 3, 2]], [[2, 1, 1, 1, 1, 1, 1]], [[4, 5, 4, 3, 1, 4, 8]], [[1, 1, 1, 2, 5, 2, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 4, 10]], [[2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2]], [[6, 4, 5, 3, 5, 3, 5, 5, 5]], [[1, 2, 2, 2, 2, 2, 2]], [[10, 5, 4, 3, 5, 8]], [[1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4]], [[9, 6, 4, 10, 5, 3, 5, 3, 5, 5]], [[5, 5, 5, 5, 5, 5, 5, 5]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]], [[4, 5, 6, 4, 5, 5]], [[2, 2, 2, 2, 2, 10, 2, 2, 2, 2, 2, 2]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4]], [[1, 1, 2, 2, 2, 3, 3]], [[1, 2, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4]], [[10, 9, 7, 6, 5, 4, 3, 1, 1]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4, 3]], [[5, 5, 4, 5, 5, 5]], [[5, 5, 5, 4, 3, 5, 4]], [[9, 6, 5, 4, 3, 1, 1]], [[3, 2, 1, 1, 1, 1, 1, 1]], [[2, 4, 4, 4, 4]], [[1, 2, 2, 2, 2, 3, 2, 3]], [[1, 2, 2, 2, 2, 2]], [[4, 5, 4, 3, 1, 4]], [[10, 9, 8, 6, 8, 6, 5, 4, 3, 2, 1]], [[1, 2, 10, 4, 5, 6, 7, 4, 10, 7, 7, 6]], [[3, 1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 1, 6, 4, 4, 4, 4, 4, 3, 1, 3]], [[5, 5, 6, 4, 5, 3, 5, 5]], [[1, 2, 4, 4, 4, 4, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4, 3, 4]], [[2, 4, 4, 4, 3]], [[9, 6, 5, 5, 4, 3, 1, 1]], [[5, 5, 3, 4, 3, 5, 5, 5]], [[1, 2, 2, 2, 2]], [[1, 1, 1, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 9, 4, 4, 3]], [[10, 5, 5, 4, 3, 5, 8]], [[6, 4, 4, 4, 3]], [[2, 2, 4, 4, 4, 4, 4, 4, 4]], [[1, 2, 10, 8, 5, 6, 7, 4, 10, 7, 7, 6]], [[10, 2, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4]], [[5, 5, 6, 4, 5, 3, 5, 5, 5]], [[6, 4, 5, 6, 3, 5, 3, 5, 5, 5, 4]], [[5, 5, 3, 4, 3, 5, 5, 5, 3]], [[1, 10, 4, 5, 6, 7, 4, 10, 7, 7, 6]], [[5, 5, 5, 5, 5, 4, 5, 5, 5]], [[2, 2, 4, 4, 4, 4, 4, 4]], [[1, 1, 1, 2, 2, 2, 2, 3, 3]], [[3, 2, 4, 4, 4, 4, 4, 4]], [[1, 1, 1, 1, 2, 2, 2, 3, 4, 7, 4, 4, 4, 4, 4, 4]], [[5, 4, 5, 3, 4, 3, 5, 5, 5, 3]], [[1, 8, 1, 2, 2, 2, 2, 3, 3, 2]], [[2, 2, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4, 3, 3]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]], [[4, 5, 6, 4, 5, 5, 5]], [[2, 2, 4, 4, 4, 4, 4, 4, 2, 4]], [[10, 2, 4, 4, 4, 4, 4, 4, 5, 2]], [[4, 5, 6, 4, 10, 5, 5, 10, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 3, 4, 4, 4, 3, 3]], [[9, 6, 5, 4, 3, 1, 1, 9]], [[10, 5, 4, 3, 10, 5]], [[4, 5, 6, 4, 5, 3, 5, 5, 4]], [[1, 1, 1, 2, 2, 2, 3, 3, 3]], [[1, 5, 1, 2, 2, 2, 3, 3, 2]], [[1, 1, 1, 8, 2, 2, 3, 3, 4, 7, 4, 4, 4, 4, 4, 4, 3, 4, 2]], [[1, 1, 1, 2, 7, 2, 3, 3, 3]], [[1, 1, 1, 2, 2, 2, 3, 3, 4, 7, 4, 4, 4, 8, 4, 4, 4, 3, 3, 2]], [[1, 1, 2]], [[3, 2, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 2, 2, 2, 3, 2]], [[10, 9, 8, 7, 5, 4, 3, 2, 1]], [[1, 1, 1, 6, 5, 2, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 2, 2, 12, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 14, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 1]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 14, 2, 3, 3, 3, 4, 4, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 9]], [[1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10, 5, 1]], [[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 4, 3, 3, 4, 4, 4, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 7]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 4, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 9]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 1, 14, 2, 3, 3, 3, 4, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 5]], [[1, 13, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 7]], [[1, 2, 3, 5, 6, 18, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 1, 3]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 7, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 1]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 3, 4, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 9, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 7, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 16, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 3, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 9, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 17, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 17, 3, 3, 19, 3, 4, 4, 4, 4, 4, 4]], [[2, 2, 3, 3, 4, 4, 4, 5, 6, 5, 5, 5]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1]], [[1, 1, 1, 15, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 13, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 10, 14]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 1, 14, 2, 3, 3, 3, 18, 1, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 19, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 1, 14, 2, 2, 2, 3, 3, 3, 18, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 18, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 7, 4, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 6, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7]], [[1, 2, 3, 4, 5, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 13]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 13, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 13, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7, 1]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 18, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 7, 4, 6, 8]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 8, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 9, 5, 7, 4, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 1, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 1, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 21, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 5, 6, 11, 7, 8, 9, 10, 5, 6, 8, 8, 9, 10, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 15, 4, 5, 6, 18, 7, 8, 9, 21, 17, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 15]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 13, 6]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 7, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7, 7]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 13, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 5, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 13, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5, 11]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 7, 10, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 7, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 3, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 1, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 8, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 10, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5, 11]], [[1, 2, 3, 4, 6, 6, 7, 8, 10, 10, 3, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 3, 1, 14, 2, 3, 3, 3, 4, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 20, 10, 5, 1]], [[2, 2, 3, 4, 4, 4, 5, 7, 5, 5]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 21, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 3]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3]], [[2, 2, 3, 4, 4, 4, 5, 7, 5, 5, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 5, 6, 11, 7, 8, 9, 10, 5, 6, 8, 8, 9, 10, 6, 7, 8, 10, 5, 6, 7, 8, 9]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[2, 2, 3, 3, 4, 4, 4, 5, 3, 6, 4, 5, 5, 5, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 17, 3, 3, 19, 3, 4, 4, 4, 4, 4, 4, 19]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 5, 1, 1, 1]], [[2, 2, 3, 3, 4, 4, 4, 5, 3, 6, 4, 4, 5, 5, 5, 3, 4]], [[9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[9, 9, 5, 6, 8, 2, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[2, 2, 3, 4, 10, 4, 5, 7, 5, 3]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 12, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 2]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 7, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 1]], [[1, 13, 2, 3, 4, 5, 6, 12, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 18, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 13, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 6, 13, 15, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 9, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 9, 8, 8, 9, 9, 9, 10, 10, 10, 7, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 21, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 12, 13, 5, 11]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 14, 6, 6, 12, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 12, 13, 5, 11]], [[1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 9, 8, 8, 9, 9, 9, 10, 2, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 10, 2, 2, 3, 11, 3, 17, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 9, 8, 8, 9, 9, 9, 10, 2, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 1]], [[1, 2, 3, 14, 5, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 14, 3, 3, 3, 3, 3, 3, 2]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 2, 3, 4, 5, 6, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 21, 15, 21]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 11, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 9, 5, 7, 4, 2, 6]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 21, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 3, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10]], [[2, 2, 3, 3, 4, 4, 4, 5, 3, 6, 4, 5, 5, 5, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 10, 10, 10, 10, 10, 16, 10, 11, 12, 13, 14, 15, 4]], [[9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10]], [[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 1, 9, 9, 9, 10, 10, 10, 1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 9, 8, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 7]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 19, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 19, 5, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 17, 3, 3, 19, 3, 4, 4, 4, 3, 4, 19]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 18, 9, 9, 10, 10, 10]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 11, 2, 12, 13, 14, 15, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 18, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 18, 8, 6, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 1]], [[1, 1, 1, 1, 1, 3, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 1, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 4]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 10, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 18, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 8, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 3, 8, 8, 9, 9, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5, 6]], [[1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 5, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 7, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 9, 5, 7, 3, 4, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 10, 9, 9, 10, 10, 10, 5, 1, 3, 9, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 3, 3]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 18, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 1, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1, 9]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[2, 2, 2, 3, 4, 4, 4, 6, 6, 5, 5, 5]], [[1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1, 1]], [[1, 1, 1, 1, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 1, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 7, 3]], [[20, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 2, 3, 3, 4, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 12, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[2, 2, 3, 4, 4, 4, 5, 7, 5, 13, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 2, 3, 4, 5, 4, 18, 7, 8, 9, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 1, 14, 2, 3, 3, 3, 18, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 18, 7, 8, 9, 10, 8]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 3, 1, 14, 2, 3, 3, 3, 4, 1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 8]], [[1, 2, 3, 4, 5, 6, 9, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 3]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 2, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 2, 3, 15, 1, 4, 5, 6, 18, 7, 8, 9, 21, 17, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 15]], [[3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 11, 10, 5, 1, 3, 1, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 7, 6, 7]], [[5, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 18, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1, 1]], [[1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 12, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 12, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 10, 5, 10, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 20, 10, 5, 1]], [[1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 4, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 19, 9, 9, 9, 10, 10, 10, 5, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 8, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 18, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 13, 6]], [[1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 18, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 8, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 11, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7, 5, 4]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 9, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 7, 4, 6]], [[1, 1, 1, 1, 1, 1, 7, 1, 1, 2, 2, 2, 2, 2, 2, 2, 6, 3, 3, 4, 4, 4]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 12, 15, 10, 10]], [[1, 1, 1, 15, 1, 1, 1, 14, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 1, 1]], [[1, 2, 3, 15, 1, 5, 6, 18, 7, 8, 9, 21, 17, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 15]], [[1, 2, 3, 5, 6, 18, 8, 9, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1]], [[1, 1, 1, 1, 1, 1, 2, 6, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 5, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 2, 3, 3, 4, 3, 3, 3, 3]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 13, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 10, 14, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 1, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 2, 7]], [[1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 3, 3, 3]], [[1, 3, 4, 6, 7, 9, 10, 10, 10, 10, 10, 10, 9, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 7, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4]], [[1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 19, 5, 5, 6, 2, 6, 6, 12, 7, 8, 8, 9, 9, 13, 10, 11, 11, 13, 6, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 7, 6, 7, 5]], [[1, 1, 1, 1, 1, 3, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 1, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5, 6]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 4, 2]], [[2, 2, 2, 5, 4, 4, 6, 6, 5, 5, 5]], [[1, 1, 2, 1, 1, 1, 7, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 5, 6]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 9, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 9, 5]], [[2, 2, 3, 4, 4, 5, 7, 5, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 8, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 1]], [[1, 2, 3, 5, 6, 18, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 12]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 13, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 18, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 2, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 6, 18, 8, 9, 7, 10, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1, 7]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 7, 9, 10, 10, 10]], [[1, 1, 17, 8, 1, 1, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 10, 10, 20, 10, 5, 1, 5]], [[1, 1, 1, 1, 19, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5, 6]], [[1, 2, 3, 4, 6, 6, 7, 8, 10, 10, 3, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 12]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 8, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 2]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 21, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 3, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 4, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 1, 14, 2, 3, 3, 3, 4, 4, 1, 2]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 13, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 14, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 10, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 18, 9, 9, 10, 10, 10, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 18, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 5]], [[2, 2, 20, 4, 4, 3, 5, 7, 5, 5, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 18, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 1, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10, 5]], [[1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 3, 3, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 14, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 13, 7]], [[2, 2, 20, 4, 4, 3, 3, 7, 5, 5, 2]], [[1, 1, 1, 15, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 12, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 2, 7, 8, 8, 9, 10, 10, 11, 11, 11, 12, 5, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 7, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 12, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[2, 2, 20, 6, 4, 4, 3, 3, 7, 5, 5, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 1, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 18, 9, 9, 9, 10, 10, 8, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 14, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3]], [[1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 5, 7, 4, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 20, 7, 12, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 8, 9, 10, 10, 20, 10, 5, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1]], [[1, 3, 4, 6, 7, 8, 9, 9, 10, 10, 10, 10, 10, 9, 11, 12, 13, 14, 15]], [[20, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 15, 2, 3, 3, 3, 3, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 10]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 18, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 1, 10, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 16, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 6, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 1, 14, 2, 2, 2, 3, 3, 3, 18, 1, 1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 1]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 6]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 6, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 5, 4]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 18, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 12, 21, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 3, 6]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 18, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 1, 10, 4]], [[1, 1, 1, 15, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 1, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[2, 2, 3, 3, 4, 4, 4, 5, 3, 6, 4, 4, 5, 5, 5, 3, 4, 5]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 4, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 14, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 14]], [[20, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 1]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 7, 6, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 10, 9, 9, 10, 10, 10, 5, 1, 3, 8]], [[1, 2, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 1, 10, 14, 8]], [[1, 2, 3, 4, 5, 6, 1, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 4, 9, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10, 5]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 13, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 10, 3, 3, 3, 4, 4, 4, 18, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 9, 18, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 14, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 9, 5, 18, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 14, 4, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 13, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 1, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 9, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 20, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 9]], [[1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 10, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 13, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6, 2, 4]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 10, 10, 11, 11, 12, 14]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 1, 1]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 11, 13, 14, 15]], [[1, 2, 3, 17, 5, 10, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 11, 13, 14, 15, 10]], [[2, 20, 4, 4, 3, 5, 7, 5, 5, 2, 20]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 11, 13, 14, 15, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 8, 8]], [[2, 11, 4, 3, 3, 4, 4, 4, 5, 6, 5, 5, 5]], [[1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 14, 2, 3, 3, 3, 4, 4, 4, 1, 3, 2, 4]], [[2, 6, 11, 4, 3, 3, 4, 4, 4, 5, 6, 5, 5, 5]], [[2, 2, 3, 10, 4, 4, 5, 7, 5, 5, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 2, 6, 2, 2, 2, 2, 3, 11, 3, 3, 4, 4, 4, 4, 4, 5, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 8, 7, 8, 9, 14, 10, 5, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 20, 7, 12, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 18, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 9, 8, 8, 9, 7, 9, 10, 10, 1, 10]], [[2, 3, 4, 5, 4, 18, 7, 8, 9, 8, 10, 11, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[2, 2, 2, 3, 4, 4, 4, 6, 6, 5, 5, 5, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 13, 4, 6, 18, 8, 9, 10, 10, 10, 10, 10, 11, 12, 6, 13, 15, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 18, 9, 9, 10, 10, 10, 1, 19]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 6, 7, 8, 10, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5, 7]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 13, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 10, 14, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 6, 18, 7, 8, 9, 10, 8]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 2, 8, 9, 8, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 13, 17, 3, 3, 19, 3, 4, 11, 4, 3, 4, 19]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 18, 3, 3, 4, 4, 5, 5, 6, 6, 7, 1, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10, 4, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 11, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 2, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 3, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 3, 7]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 8, 16, 10, 10, 10, 10, 11, 12, 13, 14, 15, 15, 7, 2]], [[9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 18, 9, 10, 10, 10, 19, 10, 11, 12, 13, 15, 1, 9]], [[1, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 10, 10, 11, 11, 13, 14, 15, 2, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 18, 2, 3, 4, 4, 4, 5, 5, 5, 6, 1, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 9, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1, 3, 9, 1]], [[1, 2, 3, 4, 5, 6, 18, 7, 8, 9, 10, 10, 10, 10, 9, 10, 11, 12, 13, 14, 15, 14]], [[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 18, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 2, 18, 2, 2, 18, 4, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 4]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 5, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 7, 9, 10, 10, 10]], [[1, 2, 3, 17, 5, 18, 8, 19, 10, 10, 10, 10, 10, 11, 2, 12, 13, 14, 15, 19, 3]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 13, 12, 13, 4, 7, 6]], [[20, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 5, 7, 8, 9, 9, 14, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 9, 5, 6, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 5, 11, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 10, 10]], [[1, 1, 1, 1, 3, 1, 2, 2, 2, 1, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 2, 9, 9, 10, 11, 13, 12, 13, 4, 7, 6]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 5, 3, 11, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 2, 6, 6, 12, 7, 8, 8, 9, 9, 10, 10, 11, 11, 13, 6]], [[2, 3, 4, 4, 4, 5, 7, 5, 13, 5]], [[1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 17, 3, 3, 19, 3, 4, 4, 4, 4, 4, 4, 19]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 5, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4, 7, 5, 4]], [[6, 2, 2, 3, 8, 3, 4, 4, 4, 5, 3, 6, 4, 5, 5, 5, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 5, 7, 4, 6, 8]], [[1, 2, 2, 3, 17, 5, 18, 8, 9, 10, 10, 10, 10, 13, 10, 10, 11, 12, 13, 14, 15, 10, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 18, 1, 1, 1, 1, 2, 2, 2, 8, 2, 3, 3, 3, 3, 4, 4, 12, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 10, 11, 11, 12, 13, 5]], [[1, 1, 1, 1, 8, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 9, 5, 7, 4, 6, 1]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 8, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 18, 2, 2, 18, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 3, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 5, 2, 2, 18, 3, 3, 4, 4, 4, 5, 12, 13, 5, 4, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 14, 9, 10, 10, 10, 14, 1]], [[1, 2, 3, 14, 5, 7, 8, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 14, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5, 1]], [[5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1]], [[2, 2, 2, 2, 2]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2]], [[2, 2, 3, 3, 4, 6, 4, 4, 7, 5, 5, 5]], [[1, 1, 1, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[2, 2, 3, 3, 13, 4, 4, 4, 5, 5, 5, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10, 5, 6, 8, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20]], [[1, 1, 1, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2]], [[1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 5, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 2]], [[1, 2, 3, 4, 5, 6, 2, 7, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 12, 16, 14, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 19, 17, 18, 19, 20, 2]], [[1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3]], [[3, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 1, 1, 8, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 6, 14, 15, 10]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 9, 4]], [[1, 3, 4, 5, 6, 9, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 6, 14, 15, 10, 7]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 3, 3, 7]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 1]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 3, 3, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 9]], [[2, 1, 2, 3, 2, 3, 4, 6, 4, 4, 7, 5, 5, 5, 4, 2]], [[1, 1, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 3, 20, 10, 9]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20]], [[4, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 8, 14, 15, 10]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 17, 6, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 12, 16, 14, 10, 16]], [[1, 2, 3, 9, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 4]], [[1, 1, 1, 8, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 11, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 2, 8, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2]], [[2, 2, 3, 3, 4, 6, 4, 4, 7, 5, 5, 5, 4]], [[2, 2, 3, 3, 13, 12, 4, 4, 4, 5, 5, 20, 5, 5, 2, 5, 2]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 6]], [[1, 2, 3, 4, 14, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 16, 17, 18, 19, 20]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 2]], [[2, 2, 3, 8, 4, 4, 4, 5, 5, 5, 5]], [[2, 2, 3, 8, 4, 8, 4, 4, 5, 5, 5, 5]], [[2, 2, 8, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 1, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[2, 2, 3, 8, 4, 4, 4, 5, 5, 9, 5, 8]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 1]], [[1, 3, 4, 5, 6, 9, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 6, 14, 15, 10, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 19]], [[1, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 12, 9, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 8]], [[3, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 20]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 9, 4]], [[1, 2, 3, 3, 5, 6, 7, 9, 10, 11, 12, 13, 1, 14, 15, 19, 17, 18, 6, 19, 20, 2, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 14, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 8]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 11, 12, 16, 14, 10, 16]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 2, 18]], [[2, 2, 3, 3, 4, 6, 4, 4, 7, 5, 5, 5, 3]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 3, 17]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 17, 17, 18, 19, 20, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 2, 2]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 1, 7, 18, 8, 9, 10, 11, 16, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 2, 3, 4, 5, 6, 19, 7, 4, 9, 10, 10, 9, 9, 10, 10, 10, 11, 12, 16, 14, 10, 16, 14]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4, 4]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 3, 20, 10, 9, 8]], [[1, 4, 5, 6, 9, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 14, 15, 10, 7, 6, 6]], [[1, 3, 4, 5, 3, 9, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 6, 14, 15, 10, 7, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 5, 2, 2]], [[1, 2, 3, 4, 5, 6, 19, 7, 4, 9, 10, 10, 9, 9, 10, 10, 10, 11, 12, 16, 14, 10, 16, 16, 14]], [[3, 1, 14, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 10]], [[1, 2, 3, 4, 5, 3, 6, 7, 8, 9, 10, 12, 13, 14, 10, 17, 17, 18, 19, 20, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 18, 2, 2, 2, 3, 3, 3, 4, 4, 10, 2]], [[1, 1, 11, 1, 1, 1, 11, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 15, 15]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3]], [[3, 2, 2, 3, 3, 4, 4, 4, 5, 5]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 18, 10]], [[1, 1, 1, 8, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[3, 18, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 3, 4]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2]], [[1, 2, 3, 4, 5, 2, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 1]], [[1, 2, 3, 4, 5, 2, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 1, 11]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4]], [[1, 1, 1, 1, 1, 2, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8, 6]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 10]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 11, 12, 11, 13, 14, 15, 10]], [[1, 2, 8, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 7, 7]], [[2, 2, 3, 3, 12, 4, 20, 4, 4, 5, 5, 5, 5, 2, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[3, 1, 2, 3, 4, 14, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 16, 17, 18, 19, 20]], [[1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 12, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[1, 1, 11, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, 4, 5, 5, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 19, 4]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 4, 1, 1]], [[1, 1, 11, 1, 1, 1, 11, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 15, 15]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 2]], [[20, 6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 4, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 4]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 8, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 15]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 10, 2, 2, 3]], [[3, 1, 2, 3, 4, 14, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 16, 17, 18, 19, 20, 3]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 13, 14, 15, 1, 16, 18, 19, 20, 8, 5]], [[1, 1, 3, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 1]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 10, 2, 2, 3, 1]], [[1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 1, 1, 4, 1, 2]], [[1, 2, 3, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20]], [[2, 2, 3, 3, 12, 4, 4, 5, 5, 5, 5, 2, 5, 2]], [[2, 2, 3, 3, 13, 12, 4, 4, 4, 5, 5, 20, 5, 5, 2, 5]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 6, 16, 17, 18, 19, 20, 10]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4, 4]], [[3, 18, 2, 2, 3, 3, 4, 4, 4, 5, 5, 3, 4]], [[1, 4, 5, 6, 9, 7, 8, 9, 10, 9, 10, 10, 10, 10, 10, 11, 12, 14, 15, 10, 7, 6, 6, 10]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 10, 11, 12]], [[1, 2, 3, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 16]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8, 7]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 12, 3, 3, 3, 3, 3, 3, 3, 1]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 3, 1]], [[1, 1, 12, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 3, 1]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 13, 14, 15, 10, 6]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 12, 12, 13, 13, 14, 15, 1, 16, 18, 19, 20, 8, 5, 1]], [[1, 5, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 19, 17, 18, 19, 20, 2, 4]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[4, 1, 2, 3, 4, 5, 2, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10, 7]], [[2, 2, 3, 8, 4, 8, 4, 11, 5, 5, 5, 5, 5]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 19, 14, 15, 10, 11, 12]], [[3, 18, 2, 15, 3, 4, 3, 4, 4, 4, 5, 5, 5, 3, 4]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 10, 2, 3, 1]], [[2, 8, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 9]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 11, 10, 10, 11, 12, 13, 14, 15, 15]], [[1, 2, 3, 4, 2, 14, 6, 7, 8, 9, 10, 11, 20, 12, 13, 1, 14, 16, 17, 18, 19, 20, 14]], [[2, 2, 3, 3, 12, 4, 17, 4, 5, 5, 5, 5, 2, 5, 2, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 4, 12, 10, 10, 10, 10, 10, 10, 10, 11, 12, 16, 14, 10, 12, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 7, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 12, 3]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 16, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 9, 4]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 5, 6, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10]], [[1, 1, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 13, 2, 2, 12, 2]], [[1, 7, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1]], [[1, 1, 12, 1, 1, 4, 1, 1, 9, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 9, 3, 1, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 10, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 8, 8]], [[1, 2, 3, 4, 5, 6, 7, 9, 10, 10, 10, 10, 10, 11, 4, 12, 16, 14, 10, 16]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 6, 5, 5, 6, 6, 6, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 10, 11, 12, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 6, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 3]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 16, 14, 10]], [[1, 1, 8, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[1, 2, 3, 11, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 6, 16, 17, 4, 18, 19, 20, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 5]], [[1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 5, 2, 15, 2, 2, 12, 2]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 13, 14, 15, 1, 16, 18, 19, 20, 8, 5, 20]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 4, 19, 20, 8, 8]], [[1, 2, 8, 3, 4, 13, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 19, 14, 15, 10, 11, 12]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 11, 16, 14, 10, 10, 5]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 13, 14, 15, 1, 16, 18, 19, 20, 8, 5, 10]], [[1, 2, 3, 4, 6, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 11, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 16, 4]], [[1, 2, 3, 4, 2, 14, 6, 7, 8, 9, 9, 11, 20, 12, 13, 1, 14, 16, 17, 18, 19, 20, 14]], [[20, 6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 10, 7, 11, 12, 13, 14, 15, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 20, 14, 15, 16, 17, 18, 19, 20, 8]], [[3, 18, 2, 15, 3, 4, 3, 4, 4, 4, 5, 5, 5, 3, 4, 4]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 6, 13, 14, 2, 15, 10, 6, 4]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 14, 15, 2, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 4, 12, 15, 10, 10, 10, 10, 10, 10, 11, 12, 16, 14, 12, 3]], [[1, 2, 3, 4, 5, 17, 6, 7, 18, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 8]], [[1, 2, 3, 4, 5, 1, 7, 18, 8, 9, 10, 11, 16, 13, 14, 10, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 1, 2, 2, 2, 14, 3, 3, 3, 3, 3, 3, 1, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 14, 15, 16, 17, 18, 20, 2]], [[3, 2, 2, 4, 18, 4, 4, 4, 5, 5, 5, 5]], [[13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 8, 14, 15, 10]], [[1, 2, 8, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 19, 14, 15, 10, 11, 4]], [[1, 1, 1, 1, 1, 7, 1, 2, 1, 2, 2, 2, 14, 3, 3, 3, 3, 3, 3, 1, 3, 1, 1]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 11, 10, 10, 11, 12, 13, 14, 15, 15, 13]], [[1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 14, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 10, 9, 9, 10, 10, 10]], [[2, 2, 3, 3, 12, 4, 4, 4, 10, 5, 5, 5, 5, 2, 5, 2]], [[1, 2, 3, 4, 1, 7, 18, 8, 9, 10, 11, 16, 5, 14, 9, 10, 16, 17, 18, 19, 20, 8, 19]], [[1, 2, 3, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 17, 14, 15, 16, 17, 18, 19, 20, 16]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 11, 16, 14, 10, 10, 5, 4]], [[3, 18, 2, 3, 3, 4, 4, 4, 5, 5, 3, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 8, 14, 15, 10, 9]], [[2, 2, 3, 3, 12, 4, 20, 4, 4, 5, 5, 5, 5, 2, 2, 4]], [[1, 2, 3, 4, 11, 6, 7, 18, 9, 9, 10, 11, 12, 13, 13, 14, 15, 1, 16, 18, 19, 20, 8, 5]], [[2, 2, 3, 8, 4, 8, 4, 4, 5, 11, 5, 5]], [[1, 2, 3, 4, 9, 5, 6, 7, 7, 9, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 13, 14, 10]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 3, 3]], [[2, 3, 4, 5, 6, 19, 7, 4, 9, 10, 10, 9, 9, 10, 10, 10, 11, 12, 16, 14, 10, 14]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 4, 3, 4, 4]], [[1, 2, 3, 4, 6, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 10]], [[1, 2, 3, 4, 5, 11, 6, 7, 9, 10, 10, 10, 10, 10, 11, 4, 12, 16, 14, 10, 16]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 3, 4]], [[1, 2, 3, 4, 5, 6, 7, 9, 10, 9, 10, 10, 10, 11, 4, 12, 16, 14, 10, 16]], [[1, 2, 3, 4, 5, 1, 7, 18, 8, 9, 10, 11, 16, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 15]], [[1, 8, 3, 4, 5, 6, 7, 8, 10, 10, 10, 10, 10, 10, 11, 12, 14, 14, 15, 10, 11, 12, 10, 10, 14]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 16, 16, 17, 18, 19, 3, 20, 10, 9, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 11, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 3, 2, 3, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 1, 3, 3, 2]], [[2, 2, 3, 3, 6, 4, 7, 5, 5, 5]], [[1, 3, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 16, 4]], [[1, 2, 3, 4, 9, 5, 6, 7, 9, 7, 9, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 17, 14, 15, 16, 17, 18, 19, 20, 16, 17]], [[1, 2, 3, 4, 7, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 13]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 15, 10, 10, 11]], [[2, 2, 3, 4, 8, 15, 4, 11, 5, 5, 5, 5, 5]], [[1, 2, 3, 11, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 6, 16, 17, 4, 18, 19, 20, 10, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 8, 1, 14, 15, 16, 17, 18, 20, 2, 15]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 8, 1, 14, 15, 16, 17, 18, 20, 2, 15]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 15, 13]], [[1, 2, 3, 16, 5, 6, 7, 18, 18, 8, 9, 10, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 3]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 17, 6, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[1, 1, 8, 1, 1, 1, 1, 4, 2, 16, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1]], [[2, 2, 3, 3, 4, 17, 7, 5, 5, 5, 3]], [[1, 1, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 14, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 17, 9, 9, 9, 10, 10, 10, 1]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 12, 3, 3, 3, 3, 3, 3, 3, 1, 1]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4, 2]], [[1, 1, 1, 1, 1, 1, 16, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 9, 4]], [[1, 1, 1, 1, 1, 1, 7, 1, 19, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 1]], [[1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 8, 14, 15, 10]], [[2, 2, 3, 3, 12, 2, 4, 4, 4, 10, 5, 5, 5, 5, 2, 5, 6, 2]], [[2, 2, 3, 1, 4, 8, 4, 4, 5, 5, 5, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 8, 13, 14, 10, 16, 17, 19, 2, 3, 20, 10, 9]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 8]], [[1, 2, 8, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 18, 20, 8]], [[4, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10, 7, 10]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4]], [[1, 1, 8, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 1, 4]], [[1, 2, 7, 8, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 7, 7, 10]], [[1, 20, 4, 5, 6, 7, 8, 9, 11, 12, 8, 1, 14, 15, 16, 17, 18, 20, 2, 15]], [[2, 1, 2, 3, 2, 3, 4, 6, 4, 4, 7, 5, 5, 4, 2]], [[1, 2, 3, 4, 5, 6, 2, 7, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 19, 20]], [[4, 1, 2, 3, 4, 5, 2, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10, 7, 11, 10]], [[1, 1, 1, 8, 1, 1, 1, 1, 2, 2, 2, 2, 2, 9, 2, 2, 3, 3, 3, 4, 4, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8, 7]], [[1, 2, 3, 4, 5, 6, 7, 18, 14, 9, 11, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 1, 1, 1, 1, 1, 16, 2, 2, 2, 2, 2, 2, 13, 3, 3, 3, 9, 4, 1]], [[3, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 4, 5, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 10, 8]], [[1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4, 16, 4]], [[1, 1, 1, 8, 1, 1, 2, 1, 2, 2, 2, 2, 2, 9, 2, 2, 3, 3, 3, 4, 4, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 6, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 8]], [[1, 2, 3, 4, 5, 6, 7, 4, 10, 10, 10, 10, 10, 10, 11, 12, 16, 14, 10, 16]], [[1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3]], [[1, 1, 3, 1, 1, 4, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 1, 2]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 3]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 8, 8, 15]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 1, 3, 14, 3, 2]], [[1, 2, 3, 2, 3, 4, 6, 4, 4, 7, 5, 5, 5, 4, 2]], [[1, 2, 3, 4, 2, 14, 6, 7, 8, 9, 10, 11, 20, 12, 13, 1, 14, 16, 17, 18, 19, 20, 14, 18]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 15, 18, 19, 20, 10, 9]], [[1, 2, 3, 4, 5, 6, 7, 18, 9, 9, 10, 11, 12, 13, 6, 14, 15, 16, 17, 18, 4, 19, 20, 8, 8]], [[20, 6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 1, 10, 10, 10, 10, 7, 11, 12, 13, 14, 15, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 1]], [[1, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 12, 10, 10, 11]], [[6, 1, 2, 3, 4, 5, 6, 10, 7, 8, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 8]], [[1, 1, 1, 1, 4, 1, 1, 1, 2, 2, 12, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4]], [[1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 6, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1]], [[1, 2, 3, 6, 16, 5, 6, 7, 18, 18, 8, 9, 10, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 2, 3, 11, 5, 1, 7, 18, 8, 9, 10, 11, 16, 13, 14, 10, 16, 17, 18, 19, 20, 8, 13]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3]], [[1, 2, 3, 4, 7, 6, 7, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 13]], [[1, 2, 3, 4, 5, 18, 8, 9, 11, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8]], [[1, 1, 11, 1, 1, 1, 11, 2, 2, 2, 2, 3, 3, 3, 3, 3, 15, 15]], [[1, 1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 7]], [[1, 7, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 2]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 18, 2, 2, 2, 3, 3, 3, 4, 4, 10, 2]], [[2, 2, 3, 4, 8, 4, 4, 5, 11, 5, 5]], [[1, 1, 1, 1, 1, 16, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 9, 4]], [[1, 3, 4, 5, 7, 7, 8, 9, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 6]], [[1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 9, 2, 3, 2, 3, 3, 4, 4]], [[1, 2, 16, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 18, 20, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 11, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10]], [[1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 4, 3, 4, 4]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 4, 3, 3, 4, 4, 3]], [[1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 3, 3]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 2, 1]], [[1, 11, 2, 7, 8, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 8, 7, 7, 10]], [[7, 9, 9, 5, 6, 8, 2, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4]], [[1, 2, 4, 5, 6, 7, 8, 9, 10, 5, 6, 5, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10, 8]], [[1, 2, 3, 2, 4, 7, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 13]], [[3, 18, 2, 15, 3, 4, 3, 4, 4, 4, 5, 5, 5, 3, 4, 4, 4]], [[2, 2, 3, 4, 4, 4, 5, 5, 5, 5]], [[1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 4, 4, 4, 4, 4, 4, 5, 5, 17, 6, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13]], [[2, 2, 3, 3, 13, 4, 4, 4, 5, 16, 5, 5, 5, 2]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 5, 11, 16, 14, 10]], [[1, 2, 3, 4, 7, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 20, 10, 21, 13, 10, 10]], [[1, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 2, 12, 9, 14, 15, 10, 4]], [[14, 2, 3, 1, 4, 8, 4, 4, 5, 5, 5, 5]], [[6, 2, 1, 2, 3, 2, 3, 6, 4, 4, 7, 5, 7, 5, 4, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 1, 10]], [[1, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 14]], [[3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 3]], [[1, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 10, 11, 12, 9, 14, 15, 10, 4]], [[1, 2, 3, 14, 4, 2, 14, 6, 7, 8, 9, 9, 11, 20, 12, 13, 1, 14, 16, 17, 18, 19, 20, 14]], [[1, 1, 1, 1, 1, 1, 7, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 1, 3, 3, 2, 1]], [[2, 2, 4, 8, 4, 4, 5, 11, 5, 5]], [[1, 2, 3, 4, 9, 5, 6, 7, 9, 7, 9, 8, 9, 10, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10]], [[2, 13, 2, 3, 3, 12, 4, 4, 4, 5, 5, 5, 2, 13, 2, 2, 12, 2, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 10, 16, 17, 18, 19, 3, 20, 10, 9, 3]], [[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 5, 2, 2, 2, 2, 13, 3, 3, 4, 4, 1, 2]], [[2, 3, 4, 5, 6, 19, 7, 4, 9, 10, 10, 9, 9, 10, 10, 10, 11, 12, 16, 14, 14, 10, 14, 9]], [[1, 3, 4, 4, 6, 7, 8, 9, 10, 20, 10, 10, 10, 10, 11, 12, 13, 15, 10, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 4, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 17, 9, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 15, 10, 15, 9]], [[2, 2, 3, 3, 12, 4, 20, 4, 4, 5, 5, 5, 5, 2, 2, 5]], [[2, 1, 2, 3, 2, 3, 4, 6, 4, 4, 7, 5, 5, 9, 4, 4, 2, 3]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 8, 6]], [[1, 2, 3, 4, 5, 6, 7, 4, 9, 10, 10, 10, 10, 10, 11, 16, 14, 10, 10, 5, 10]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 15, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[1, 2, 8, 3, 4, 5, 14, 6, 7, 18, 8, 9, 10, 10, 12, 13, 14, 10, 15, 16, 17, 18, 19, 20, 8, 7, 7]], [[1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 2, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10]], [[2, 2, 3, 3, 4, 6, 5, 4, 5, 5, 5, 3]]], "completion": "\nimport numpy as np\n\ndef search(lst):\n \"\"\"\n Returns the greatest integer that is greater than zero, and has a frequency greater than or equal to \n the value of the integer itself. If no such a value exist, return -1.\n \n Args:\n lst: a non-empty list of positive integers\n \n Returns:\n int: the greatest integer with required frequency or -1\n \n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n \"\"\"\n \n # create a dictionary with frequency of each integer in the list\n freq_dict = {i:lst.count(i) for i in set(lst)}\n \n # create a list of integers with required frequency and filter out the integers <= 0 \n filtered_lst = list(filter(lambda x: x>0 and x<=freq_dict[x], freq_dict))\n \n # if there are no integers with required frequency, return -1\n if len(filtered_lst)==0:\n return -1\n \n # return the maximum integer from the filtered list\n return np.max(filtered_lst)\n", "raw_completion": "```python\nimport numpy as np\n\ndef search(lst):\n \"\"\"\n Returns the greatest integer that is greater than zero, and has a frequency greater than or equal to \n the value of the integer itself. If no such a value exist, return -1.\n \n Args:\n lst: a non-empty list of positive integers\n \n Returns:\n int: the greatest integer with required frequency or -1\n \n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n \"\"\"\n \n # create a dictionary with frequency of each integer in the list\n freq_dict = {i:lst.count(i) for i in set(lst)}\n \n # create a list of integers with required frequency and filter out the integers <= 0 \n filtered_lst = list(filter(lambda x: x>0 and x<=freq_dict[x], freq_dict))\n \n # if there are no integers with required frequency, return -1\n if len(filtered_lst)==0:\n return -1\n \n # return the maximum integer from the filtered list\n return np.max(filtered_lst)\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef search(lst):\n '''\n You are given a non-empty list of positive integers. Return the greatest integer that is greater than \n zero, and has a frequency greater than or equal to the value of the integer itself. \n The frequency of an integer is the number of times it appears in the list.\n If no such a value exist, return -1.\n Examples:\n search([4, 1, 2, 2, 3, 1]) == 2\n search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3\n search([5, 5, 4, 4, 4]) == -1\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/70", "prompt": "\ndef strange_sort_list(lst):\n '''\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n '''\n", "entry_point": "strange_sort_list", "canonical_solution": "\n sorted_list = sorted(lst)\n ans, i, j = [], 0, len(sorted_list) - 1\n while i < j:\n ans.append(sorted_list[i])\n ans.append(sorted_list[j])\n i += 1\n j -= 1\n if i == j: ans.append(sorted_list[i])\n return ans\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1, 2, 3, 4]) == [1, 4, 2, 3]\n assert candidate([5, 6, 7, 8, 9]) == [5, 9, 6, 8, 7]\n assert candidate([1, 2, 3, 4, 5]) == [1, 5, 2, 4, 3]\n assert candidate([5, 6, 7, 8, 9, 1]) == [1, 9, 5, 8, 6, 7]\n assert candidate([5, 5, 5, 5]) == [5, 5, 5, 5]\n assert candidate([]) == []\n assert candidate([1,2,3,4,5,6,7,8]) == [1, 8, 2, 7, 3, 6, 4, 5]\n assert candidate([0,2,2,2,5,5,-5,-5]) == [-5, 5, -5, 5, 0, 2, 2, 2]\n assert candidate([111111]) == [111111]\n\n # Check some edge cases that are easy to work out by hand.\n assert True\n\n", "contract": "\n assert type(lst) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) == int for x in lst), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 3, 4]], [[5, 6, 7, 8, 9]], [[1, 2, 3, 4, 5]], [[5, 6, 7, 8, 9, 1]], [[5, 5, 5, 5]], [[]], [[1, 2, 3, 4, 5, 6, 7, 8]], [[0, 2, 2, 2, 5, 5, -5, -5]], [[111111]]], "atol": 0, "plus_input": [[[-5, 0, 5, 10]], [[10, 9, 8, 7, 6, 5]], [[2, 4, 6, 8, 10, 12]], [[1, 3, 5, 2, 4, 6]], [[100, 200, 300, 150, 75, 35, 10]], [[8, 4, 2, 6, 10]], [[2, 1, 4, 3, 6, 5]], [[-1, 0, 1, 2, 3, 4]], [[8, 8, 8, 8]], [[1]], [[10, 9, 8, 75, 6, 5]], [[-5, 0, 150, 5]], [[10, 9, 8, 150, 6, 5]], [[-5, 0, 5, 10, -5]], [[8, 4, 2, 6, 10, 2]], [[0, 5, 10, -5]], [[1, 3, 5, 2, 4, 6, 2]], [[100, 151, 200, 300, 150, 75, 35, 10]], [[0]], [[-5, 0, 150]], [[-5, 0, 150, 5, 150]], [[4, 10, 9, 75, 5, 5]], [[3]], [[]], [[-5, 0, 5, 151]], [[-5, 151, 4, 9, -5]], [[2, 4, 6, 8, 1, 10, 12]], [[-5, 4, 150, 5, 150]], [[100, 200, 300, 150, 75, 35, 10, 300]], [[-5, 151, 4, 9, -5, 151, -5, -5]], [[10, 9, 8, 10, 150, 6, 5]], [[-5, -1, 0, 5, 10, 75, -5]], [[-5, 0, 5]], [[8, 4, 2, 6, 10, 2, 2]], [[10, 9, 8, 10, 150, 6, 5, 8]], [[2, 1, 4, 3, 6, 5, 5]], [[-1, -1, 1, 2, 3, 4]], [[200, 300, 150, 75, 35, 10, 300]], [[-1, 0, 2, 3, 4]], [[10, 9, 8, 10, 150, 6]], [[8, 8, 8]], [[0, 0, 75, 0]], [[200, 300, 150, 35, 100]], [[200, 300, 150, 35, 100, 35]], [[-5, 0, 150, 12, 150]], [[10, 9, 8, 10, 150, 6, 5, 10]], [[10, 9, 8, 10, 149, 3, 5, 10]], [[4, 10, 8, 75, 5, 5]], [[8, 8, 8, 9, 8]], [[8, 8, 8, 8, 149, 8]], [[200, 300, 200, 35, 100]], [[-1, 3, 0, 2, 1, 2, 3, 4]], [[-5, 0, 5, 0]], [[4, -5, 9, 75, 5, 5]], [[0, 5, 9, 10]], [[-5, 4, 35, 150, 5, 150]], [[7, 3]], [[2, 4, 3, 5]], [[100, 151, 200, 300, 150, 75, 35, 101, 10]], [[-5, 1, 5, 0]], [[100, 151, 200, 300, 150, 75, 35, 10, 75]], [[-5, -1, 0, 5, 149, 10, -5]], [[4, 35, 150, 6, 150]], [[-1, 0, 2, 4]], [[4, 3]], [[0, 300, 100, 35]], [[1, 4, 4, 5, 4]], [[100, 200, 300, 9, 150, 75, 35, 10]], [[100, 151, 200, 300, 150, 75, 35, 10, 99, 75, 35]], [[-1, 0, 1, 2, 3, 4, 2]], [[-5, 0, 5, 10, -5, -5]], [[100, 200, 150, 75, 35, 10, 300]], [[8, 8, 149, 8, 8]], [[8, 4, 35, 150, 5, 150, 35]], [[-1, 200, 3]], [[100, 151, 200, 300, 75, 35, 10, 75]], [[-5, 149, 0, 150, 5]], [[-1, 0, 1, 2, 149, 4, 4]], [[-5, 4, 150, 5, 150, 150]], [[8, 4, 35, 150, 5, 149, 35, 35, 5]], [[4, 35, 150, 6, 6, 150]], [[4, 35, 150, 6, 150, 150, 35]], [[8, 8, 8, 9, 8, 8]], [[150, 8, 4, 35, 150, 5, 149, 35, 35, 5, 150]], [[99, 7, 3]], [[-5, 4, 150, 5, 101]], [[100, 200, 300, 150, 75, 35, 301, 10, 75]], [[-5, 0, 5, -1]], [[3, -1, 0, 3]], [[4, 35, 150, 150]], [[-1, 101, 0, 2, 1, 2, 3, 4, 300, 2]], [[8, 4, 35, 150, 149, 35, 35, 5]], [[10, 9, 8, 150, 6, 5, 8]], [[11, 9, 8, 7, 6, 5, 9]], [[-1, -1, 1, 2, 3, 4, 1]], [[4, 35, 5, 6, 150, 150, 35]], [[101, 200, 300, 150, 75, 35, 10, 300, 35]], [[100, 8, 8, 8, 8]], [[100, 200, 299, 150, 75, 35, 10]], [[5, 10, 15, 20, 25, 30]], [[30, 25, 20, 15, 10, 5]], [[10, -5, 0, 15, -10, -15]], [[-15, -10, 0, 10, 15, -5]], [[2, 4, 6, 8, 10, 12, 14, 16]], [[2, 16, 4, 14, 6, 12, 8, 10]], [[-10, 0, 10, 20, 30, 40, 50, 60, 70, 80]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40]], [[3, 2, 1, 4, 7, 6, 5]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7]], [[2, 4, 6, 8, 10, 12, 14, 16, 4]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30]], [[30, 25, 21, 15, 10, 5]], [[1, 25, 21, 15, 10, 5]], [[0, 25, 21, 15, 80, 5]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40]], [[7, 2, 16, 4, 14, 6, 12, 8, 10]], [[-10, 80, 12, 70, 10, 60, 20, 50, 49, 51, 40]], [[5, 10, 14, 21, 25, 30]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 30]], [[7, 2, 16, 7, 4, 14, 6, 12, 8, 10, 6]], [[-10, 80, 0, 70, 10, 60, 50, 30, 30]], [[-10, 79, 80, 12, 70, 10, 60, 20, 50, 30, 40]], [[7, 2, 16, 14, 6, 10, 12, 8, 10]], [[1, 25, 21, 15, 10, 5, 10]], [[-15, -10, 0, 10, 15, -5, -5]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10]], [[10, -5, 0, 15, -10, -15, -15]], [[-15, -10, 0, 10, 3, -5]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 40]], [[7, 16, 14, 6, 9, 12, 8, 10]], [[30, 26, 21, 15, 10, 5]], [[30, 25, 21, 15, 10, 5, 21]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 40, 10]], [[7, 2, 16, 7, 4, 14, 6, 8, 10, 6]], [[10, 20, 25, 79, 30]], [[30, 25, 21, 15, 10, 5, 21, 25]], [[5, 10, 14, 21, 25, 30, 10]], [[7, 2, 16, 7, 4, 14, 6, 10, 6]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0]], [[10, -5, 0, 15, -10, -15, -15, -5]], [[0, 25, 12, 21, 15, 80, 5]], [[-1, 0, -3, 5, 3, 2, 1, 1, 7]], [[-10, 80, 12, 14, 70, 10, 60, 9, 20, 50, 30, 30, 40, 40, 40]], [[4, 6, 8, 10, 12, 14, 16]], [[30, 25, 21, 15, 10, 5, 21, 21]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 80, 30]], [[50, -10, 80, 0, 70, 9, 60, 20, 50, 30, 30]], [[1, 24, 25, 21, 15, 10, 5]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, 60]], [[30, 25, 21, 15, 10, 4]], [[6, 6]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7, -3]], [[1, 24, 25, 21, 15, 10, 5, 21]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, 80]], [[-15, -10, 0, 10, 15, -5, 15]], [[-10, 80, 0, -1, 10, 51, 20, 50, 30, 40]], [[25, 80, 0, 70, 10, 60, 50, 30, 30, 80, 30]], [[-10, 80, 12, 14, 70, 10, 60, 20, 50, 30, 30, 40, 40, 40]], [[69, 50, -10, 80, 0, 70, 10, 60, 20, 50, 30]], [[10, -5, 0, 15, -16, -10, -15, -15, -5]], [[7, 2, 7, 4, 14, 6, 12, 8, 10, 6, 10]], [[-10, 80, 0, 70, 10, -9, 60, 50, 30, 30]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21]], [[21, 60, 25, 21, 15, 10, 5, 21, 21, 25]], [[30, 25, 21, 15, 10, 5, 21, 21, 25]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 80, 60, 30]], [[25, 80, 0, 70, 10, 60, 50, 30, 80, 30]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 80, 60, 30, 80, 25]], [[30, 25, 40, 20, 15, 10, 5, 21, 21]], [[10, 14, 21, 25, 30, 10]], [[-1, -3, 5, 3, 2, 1, 10, 7, -3]], [[-10, 80, 12, 14, 70, 10, 60, 9, 20, 50, 30, 30, 6, 40, 40]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 0, 21]], [[60, 80, 11, 70, 10, 60, 50, 30, 40, 40, 10]], [[50, 80, 70, 9, 60, 20, 50, 30, 30]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 21]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 40, 10, 70]], [[30, 25, 21, 10, 4]], [[-10, 80, 12, 70, 10, 60, 9, 20, 50, 30, 30, 40, 40, 40]], [[21, 60, 9, 25, 21, 15, 10, 5, 21, 21, 25]], [[-1, 0, -3, 5, 3, 2, 8, 1, 7]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, 60, 51, 40]], [[-1, 0, -3, 3, 2, 8, 1, 69]], [[4, 6, 8, 10, 12, 14]], [[7, 2, 16, 4, 14, 12, 8, 10]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 41, -10, 80]], [[-10, 79, 80, 12, 70, 60, 20, 50, 30, 40, 20]], [[69, 3, 50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 70]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 81, 60, 30, 80, 25]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7, -3, 5]], [[1, -10, 80, 0, 70, 10, 60, 20, 50, 30, 40, 60, 30]], [[50, -10, 71, 80, 0, 70, 10, 20, 50, 30]], [[-1, 0, -3, 5, 3, 4, 2, 60, 10, 7]], [[5, 10, 20, 25, 30]], [[10, -5, 0, 15, -16, -10, -15, -15, 15, -5]], [[0, 25, 22, 15, 80, 5]], [[1, -10, 80, 0, 70, 10, 60, 20, 30, 40, 60, 30]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 21]], [[30, 25, 40, 20, 41, 10, 5, 21, 21]], [[7, 2, 16, 7, 10, 4, 14, 10, 6]], [[-10, 80, 0, 70, 10, 60, 20, 50, 59, 30, 40, 60]], [[80, 0, 10, 60, 20, 50, 30, 39, 40, -10, 80]], [[7, 2, 16, 7, 4, 14, 6, 10, 6, 7]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7, 1]], [[30, 25, 21, 15, 15, 10, 4]], [[10, -5, 0, 15, -10, -15, 10]], [[1, -10, 80, 0, 70, 10, 60, 20, 30, 40, 60, 30, 1, 30]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 21, 50]], [[21, 29, 25, 21, 15, 10, 16]], [[7, 2, 16, 7, 30, 4, 14, 6, 10, 6, 7]], [[49]], [[30, 25, 21, 15, 10, 5, 21, 21, 5]], [[5, 10, 14, 21, 25, 30, 10, 10]], [[21, 60, 25, 21, 15, 10, 5, 21, 21, 25, 60]], [[7, 1, 16, 14, 6, 10, 12, 8, 10]], [[30, 25, 21, 15, 10, 5, 5]], [[1, 16, 14, 6, 10, 12, 8, 10]], [[50, -10, 80, 0, 70, 5, 10, 60, 21, 50, 26, 30, 0, 7]], [[41, 21, 15, 10, 5, 21, 5]], [[80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 21, 50]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 8, 21]], [[6, 7]], [[7, 3, 16, 14, 12, 8, 10]], [[-10, 22, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, 80]], [[12, 20, 25, 79, 30]], [[-1, -3, 5, 3, 2, 1, 81, 10, 7, -3, -3]], [[10, 21, 25, 70]], [[11, 14, 21, 25, 30, 10, 30]], [[30, 25, 21, 15, 10, 5, 21, 60, 5]], [[2, 4, 6, 10, 12, 14, 16]], [[-10, 80, 0, 70, -9, 10, 60, 20, 50, 30, 40, -10]], [[1, -10, 80, 0, 70, 10, 60, 80, 30, 40, 60, 30]], [[20, 80, 0, 70, 10, 60, 50, 30, 80, 30]], [[50, -10, 80, 80, 70, 60, 20, 50, 30]], [[9, 80, 12, 70, 10, 60, 20, 50, 40, 40, 10]], [[5, 10, 20, 25]], [[30, 25, 21, 15, 10, 5, 21, 29, 21]], [[30, 25, 21, 10, 4, 21]], [[1, 26, 21, 15, 10, 5, 10, 21, 21]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 80, 30, 80, 0, 0]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 50]], [[-10, 0, 70, 10, 60, 20, 50, 30, 0, 22]], [[30, 25, 21, 69, 15, 51, 5, 30]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 50]], [[30, 25, 21, 15, 10, 4, 5]], [[50, -10, 71, 80, 0, 70, 10, 8, 50, 30]], [[5, 5, 10, 14, 22, 25, 30, 10]], [[20, 21, 60, 9, 25, 21, 15, 5, 21, 21, 25]], [[-10, 22, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, 80, 10, 50]], [[10, -5, 0, 15, -16, -15, -15, -5]], [[-10, 79, 12, -5, 10, 60, 20, 50, 11, 30, 40]], [[80, 12, 70, 10, 60, 9, 20, 50, 30, 30, 40, 40, 40]], [[-10, 80, 13, 70, 10, 60, 20, 49, 51, 40]], [[5, 5, 10, 14, 22, 25, 30, 10, 5]], [[70, 30, 25, 21, 15, 10, 5, 5]], [[7, 2, 16, 7, 4, 14, 6, 8, 10, 6, 8]], [[7, 2, 7, 4, 6, 12, 8, 10, 6, 10]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 0, 50, 80]], [[5, 7, 5]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 9, 21]], [[-1, 51, -3, 5, 3, 2, 1, 10, 7]], [[30, 10, 21, 24, 70]], [[50, -10, -16, 80, 0, 70, 10, 20, 50, 30]], [[12, 20, 25, 79, 4]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 50, 80]], [[50, -10, -16, 80, 0, 70, 11, 20, 30, 80]], [[-1, 0, -3, 5, 3, 2, 1, 10, 1, 7, -3, 5]], [[-1, -3, 5, 3, 2, 1, 10, 7, -4]], [[-10, 80, 12, 14, 70, 10, 60, 49, 9, 20, 50, 30, 30, 6, 40, 40, 50, 30]], [[7, 2, 16, 7, 30, 4, 14, 6, 10, 29, 6, 7]], [[-15, -11, 0, 10, 9, 15, -5, 15]], [[49, 50, -10, 80, 81, 0, 70, 10, 60, 20, 50, 30, 0, 60]], [[5, 10, 14, 21, 24, 25, 30]], [[25, 80, 0, 70, 10, 60, 50, 30, 30, 80, 30, 30]], [[5, 10, 15, 21, 25, 29, 10, 5]], [[30, 25, 21, 15, 10, 4, 5, 30]], [[7, 1, 16, 14, 6, 12, 8, 10]], [[50, -10, 80, 70, 9, 60, 21, 50, 30, 0, 8, 21]], [[-1, -3, 12, 2, 1, 10, 7, -3]], [[10, -5, 0, 15, -10, -15, 10, -10]], [[5, 10, 14, 21, 25, 31, 10]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 50, 70]], [[5, 10, 14, 21, 24, 24, 25, 30, 25]], [[12, 21, 25, 79, 4]], [[80, 12, 70, 10, 60, 9, 20, 50, 39, 30, 30, 40, 40, 40]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, -10]], [[5, 7, 10, 20, 25, 7]], [[-10, 79, 12, 10, 60, 20, 50, 11, 30, 40]], [[6, 7, 6]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 21, 9, 21, 21]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 41, -10, 80, 41]], [[69, 39, 3, 50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 70]], [[30, 26, 21, 15, 10, 5, 21]], [[60, 80, 11, 70, 10, 60, 50, 30, 40, 81, 40, 10]], [[70, 30, 25, 21, 13, 10, 5, 5, 21]], [[71, 0, -3, 5, 3, 2, 1, 10, 7, -3]], [[-10, 80, 0, 70, -9, 10, 60, 20, 51, 30, 40, -10]], [[10, -5, 0, 15, -16, -15, -15, -5, -15]], [[2, 4, 6, 12, 14, -4, 16]], [[7, 2, 16, 7, 10, 4, 14, 10]], [[25, 80, 0, 10, 60, 50, 30, 30, 80, 30]], [[30, 25, 20, 15, 10, 5, 10, 10]], [[-10, 80, 30, 0, 70, 10, 60, 20, 50, 30, 40, 70]], [[6, 6, 6]], [[7, 2, 16, 14, 6, 12, 8, 15, 2]], [[-10, 80, 0, -9, 70, 10, 60, 20, 50, 30, 40]], [[10, -5, 0, 15, -1, -15]], [[10, 20, 25, 30, 20]], [[5, 10, 14, 21, 25, 4, 30]], [[4, 6, 7, 10, 12, 14, 16, 10]], [[2, 4, 6, 8, 10, 12, 14, 16, 4, 12]], [[50, -10, 80, 70, 60, 20, 50, 30]], [[30, 25, 40, 25, 20, 15, 10, 5, 21]], [[5, 10, 10, 14, 21, 25, -16, 10]], [[69, 50, -10, 80, 0, 70, 60, 20, 50, 30, 10]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 0, 81, 21, 30, 21]], [[10, -5, 0, 13, 15, -1, -15]], [[21, 60, 25, 21, 9, 15, 10, 5, 21, 21, 25]], [[7, 2, 16, 7, 4, 14, 6, 8, 6, 10, 6]], [[20, 80, 70, 10, 60, 50, 30, 80, 30]], [[7, 2, 16, 14, 6, 12, 8, 10]], [[7, 14, 6, 9, 12, 8, 10]], [[-10, 80, 0, 70, 10, 61, 20, 51, 50, 30, 40, 60, 51, 40]], [[60, 80, 11, 70, 10, 60, 50, 30, 40, 39, 10]], [[20, 21, 60, 9, 25, 21, 15, 5, 21, 21, 25, 60]], [[50, -10, 71, 80, 0, 70, 10, 20, 50, 69, 30]], [[7, 3, 16, 12, 8, 10, 10]], [[-10, 0, 70, -9, 10, 60, 20, 51, 30, 40, -10]], [[6]], [[5, 10, 15, 21, 25, 29, 5]], [[-1, 4, 0, -3, 5, 3, 2, 8, 1, 7]], [[-1, -3, 5, 40, 3, 2, 1, 10, 7, -3]], [[30, 25, 20, 15, 10, 5, 10, 10, 15]], [[50, -10, 80, 59, 70, 60, 20, 50, 30]], [[-1, 0, -3, 5, 3, 6, 2, 1, 10, 7, 1]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 40, 10, 70, 80]], [[2, 6, 12, 14, -4, 16]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 10, 70, 80]], [[30, 10, 21, 24, 70, 21]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, -16, 40, 40, 10]], [[10, 20, 25, 30, 20, 20]], [[30, 22, 25, 21, 15, 10, 4]], [[-10, 80, 0, 70, 10, 60, 30, 20, 50, 30, 14]], [[25, 22, 15, 80, 5]], [[-10, 80, 13, 70, 10, 60, 20, 49, 51, 40, 40]], [[-10, 80, 0, 81, 70, -9, 10, 59, 20, 50, 30, 40, -10, 10]], [[49, -10, 80, 81, 0, 70, 10, 60, 20, 50, 30, 0, 60]], [[30, 25, 20, 15, 10, 5, 10, 10, 15, 5]], [[4, 6, 8, 10, 12, 14, 16, 14]], [[-3, 6, 3, 2, 10, 7, -3]], [[-10, 79, 80, 12, 70, 10, 60, 20, 50, 30, 40, -10]], [[25, 21, 15, 10, 4, 5]], [[1, -10, 80, 0, 70, 10, 60, 20, 30, 40, 60, 30, 71, 30]], [[50, -10, 80, 0, 70, 10, 60, 21, -10, 50, 30, 0, 8, 21]], [[25, 24, 8, 15, 80, 5]], [[7, 1, -5, 14, 6, 12, 12, 8, 10, 8]], [[20, 80, 70, 10, 60, 50, 30, 80, 30, 30]], [[10, 25, 21, 15, 10, 4, 5, 30, 10]], [[50, -10, 80, 0, 70, 10, 60, 21, -10, 60, 30, 0, 8, 21]], [[10, 25, 21, 15, 10, 1, 5, 30, 10, 15]], [[7, 2, 16, 14, 6, 10, 12, 8, 10, 10]], [[5, 10, 14, 21, 25, -11, 30, 30, 10, 10, 10]], [[1, 25, 21, 10, 5, 10, 5, 5]], [[60, 9, 25, 21, 15, 10, 71, 5, 21, 21]], [[49, 80, 81, 0, 70, 10, 60, 20, 50, 30, 0, 60]], [[-15, 0, 10, 15, -5]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21, 21, -1]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21, 21, -1, 0]], [[4, 6, 10, 12, 14, 16]], [[50, 22, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21, -1, 0]], [[10, 21, 25, 71]], [[6, 30, 25, 20, 15, 10, 5, 10, 10]], [[-11, 49, -11]], [[1, -10, 80, 0, 70, 10, 26, 20, 30, 40, 60, 30, 1, 30]], [[60, 80, 11, 70, 10, 60, 50, 30, 40, 10]], [[7, 2, 16, 7, 10, 0, 4, 14, 10, 6]], [[49, 80, 81, 0, 70, 10, 60, 20, 30, 50, 30, 0, 60]], [[50, -10, 80, 0, 70, 5, 10, 60, 61, 50, 26, 30, 0, 7]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, 60]], [[50, -10, 80, 0, 70, 10, 60, 21, 80, 50, 30, 0, 81, 21, 30, 21]], [[10, 25, 21, 15, 10, 1, 5, 30, 10, 15, 15]], [[7, 2, 16, 14, 6, 11, 12, 8, 10]], [[-1, -4, -15, 0, 10, 15, -5]], [[4, 6, 8, 10, 12, 17]], [[30, 61, -4, 21, 69, 15, 51, 6, 30]], [[30, 10, 21, 24, 70, 10]], [[7, 2, 16, 80, 10, 4, 14, 10, 6]], [[16, 14, 12, 6, 9, 12, 8, 10, 6]], [[7, 2, 16, 7, 10, 0, 4, 4, 14, 6]], [[49, 50, -10, 80, 81, 0, 70, 10, 60, 20, 50, 30, 0, 60, 10]], [[9, 25, 21, 15, 10, 1, 30, 10, 15, 15]], [[25, 80, 0, 70, 10, 60, 50, 31, 80, 30]], [[10, -5, 0, -16, -5, -15, -15, -5, -15]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21, 21, -1, 50]], [[50, -10, 80, 0, 70, 10, 60, 21, 50, 30, 21, 21, 71, -1, 0, 30]], [[7, 2, 16, 14, 6, 11, 12, 8, 10, 2]], [[-10, 80, 70, 10, 60, 50, 30]], [[50, 80, 80, 70, 60, 80, 29, 50, 30]], [[2, 4, 12, 14, -4, 16]], [[39, 70, 30, 25, 21, 13, 10, 5, 5, 21]], [[14, 30, 25, 15, 10, 4, 15]], [[69, 50, 70, 80, 0, 25, 60, 20, 50, 30, 10]], [[7, 2, 16, 7, 71, 30, 4, 14, 6, 10, 29, 6, 7, 30, 71]], [[50, -10, 80, 80, 70, 60, 20, 30, 70]], [[2, 16, 4, 14, 6, 12, 8, 10, 8, 2]], [[7, 2, 16, 7, 10, 4, 10]], [[-5, 0, 15, -10, -15, -15, -5]], [[1, -10, 80, 0, 70, 10, 60, 30, 40, 60, 30, 71, 31]], [[25, -10, 80, 0, 10, 60, 50, 30, 30, 81, 60, 30, 80, 25]], [[10, -5, 0, 16, 15, -16, -15, -15, -5]], [[30, 25, 40, 20, 15, 10, 5, 21, 59, 21, 59]], [[2, 7, 1, 16, 14, 6, 12, 8, 10]], [[49, 50, 80, 81, 0, 70, 60, 20, 50, 30, 0, 60, 10]], [[-11, 12, 20, 25, 0, 30]], [[30, 25, 21, 15, 10, 5, 21, 29, 21, 15]], [[10, -5, 14, 0, 13, 15, -1, -15]], [[10, -5, 0, 15, -16, -15, -15, -5, -5, -5]], [[5, 4, 10, 14, 21, 25, 4, 30]], [[49, 80, 81, -1, 70, 10, 60, 20, 50, 30, 0, 60]], [[5, 10, 14, 21, 25, -11, 30, 30, 10, 10, 10, 10, 5]], [[60, 11, 70, 81, 10, 60, 50, 30, 40, 81, 40, 10]], [[50, -10, 80, 0, 70, 10, 26, 60, 21, 50, 30, 21, 21, -1, 0]], [[12, 21, 25, 79, 22, 4]], [[2, 3, 6, 12, 14, -4, 16]], [[50, -10, 80, 0, 13, 70, 10, 60, 20, 50, 30, 21]], [[2, 4, 6, 8, 10, 12, 16, 4, 12]], [[-1, 0, -2, 5, 3, 2, 1, 10, 7]], [[7, 2, 16, 7, 4, 14, 6, 7, 10, 6, 7, 2]], [[5, 6, 6]], [[7, 8, 2, 16, 7, 4, 14, 6, 8, 6, 10, 6]], [[5, 10, 14, 21, 25, 30, 10, 10, 10]], [[2, 16, 4, 14, 6, 12, 8, 10, 8, 2, 12]], [[-1, -3, 5, 40, 3, 2, 1, 10, 7, -3, 2]], [[69, 3, 50, 39, -10, 80, 0, 70, 10, 60, 20, 50, -11, 30, 70]], [[-2, 70, 30, 25, 21, -15, 70, 10, 5, 5, 21]], [[10, -5, 0, 15, -16, -10, -15, -15, 15, -5, -5]], [[30, 25, 21, 15, 10, 5, 21, 21, 30]], [[-10, 80, 12, 29, 10, 60, 20, 50, 30, 40, 40, 10]], [[-10, 80, 12, 14, 70, 10, 60, 49, 9, 20, 50, 30, 30, 6, 40, 40, 50, 30, 20]], [[-15, -10, 10, 15, -5, -5]], [[-15, 0, 10, 16, -5]], [[-15, -10, 10, 15, -5]], [[30, 25, 40, 20, 41, 39, 10, 5, 21, 21]], [[-1, -3, 5, 40, 3, 2, 1, 10, 7, -3, 2, 2]], [[5, 5, 10, 14, 26, -5, 30, 10]], [[-10, 41, 12, -5, 10, 60, 20, 50, 11, 30, 40]], [[-10, 80, 12, 14, 70, 10, 60, 49, 9, 50, 30, 30, 6, 40, 40, 50, 30, 30]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 80, 30]], [[-10, 80, 12, -5, 70, 10, 60, 20, 50, 30, 40, 10, 70, 80]], [[10, 25, 21, 15, 10, 1, 5, 30, 10, 71, 15]], [[-1, 0, 22, 5, 3, 2, 1, 10, 7, 41, 2]], [[50, -10, 80, 0, 70, 60, 21, 50, 0, 50, 80]], [[-10, 22, 80, 0, 70, 30, 10, 60, 20, 50, 30, 40, -10, 80]], [[-5, 0, 15, 31, -15, -15, -5]], [[50, -10, 71, 80, 0, 70, 10, 8, 30, 0]], [[5, 10, 14, 21, 25, 24, 25, 30, 25]], [[10, -5, 0, 15, -16, -15, 50, -5, -15]], [[-1, 0, -3, 5, 3, 2, 1, 31, 10, 7, -3, 5]], [[30, 25, 61, 15, 10, 5, 21, 25, 5]], [[25, -10, 80, 0, 70, 10, 60, 50, 30, 30, 81, 5, 60, 30, 80, 25, 60]], [[0, 22, 15, 80, 5]], [[10, -16, 25, 79, 30]], [[9, -10, 41, 12, -5, 10, 60, 20, 50, 11, 30, 40]], [[25, 22, 80, 5]], [[25, 20, 15, 10, 5, 10, 10, 15]], [[-1, 70, 30, 21, 13, 10, 5, 5, 21]], [[-5, 0, 13, 20, -1, -15]], [[25, 20, 15, 10, 5, 10, 10, 15, 25]], [[7, 8, 2, 16, 7, 4, 14, 6, 8, 6, 10, 6, 7]], [[-10, 79, 80, 12, 70, 10, 60, 20, 50, 30, 40, -10, 79]], [[14, 30, 25, 15, 10, 4, 15, 10, 30]], [[-15, -10, 0, 10, -11, 3, -5, -10]], [[-10, 80, 30, 0, 70, 10, 60, 20, 50, 29, 30, 40, 70]], [[50, -10, 80, 3, 0, 70, 10, 60, 21, 50, 30, 0, 21, 9, 21]], [[-10, 80, 12, 70, 60, 20, 50, 49, 51, 40]], [[21, 60, 25, 21, 15, 10, 5, 21, 21, 25, 5]], [[-1, 0, 3, 2, 8, 1, 69]], [[10, -5, 0, 15, -10, -15, 10, -15]], [[50, -10, 71, 50, 0, 70, 10, 20, 24, 50, 30, 10]], [[9, -10, 41, 12, -5, 10, 20, 50, 11, 30, 40]], [[-15, -10, 0, 10, 15, 15]], [[30, 25, 21, 15, 10, 6, 21, 29, 21]], [[11, 14, 51, 21, 25, 22, 30, 10, 30]], [[1, -1, 0, 22, 5, 3, 1, 10, 7, 41, 2]], [[81, 0, 9, 70, 10, 60, 50, 30, 80, 30]], [[26, -10, 80, 0, 70, 10, 60, 50, 30, 30, 80, 30, 80, 0, -1]], [[-10, 80, 0, -9, 79, 10, 60, 20, 50, 30, 40, -10, 60]], [[50, -10, -16, 80, 0, 70, 11, 20, 80, 12]], [[7, 8, 2, 16, 7, 4, 14, 6, 8, 6, 10, 5, 6]], [[2, 7, 16, 14, 6, 12, 8, 10]], [[-10, 80, 12, 14, 70, 10, 60, 49, 9, 20, 50, 30, 30, 6, 40, 40, 80, 30, 20, -10]], [[-1, -4, -16, 0, 10, 15, -5]], [[5, 10, 14, 21, 40, 25, 24, 25, 30, 25]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30]], [[-10, 80, 12, 70, -9, 10, 60, 20, 50, 30, 40, 40, 10, 10]], [[4, 6, 8, 10, 12, 17, 4]], [[30, 25, 20, 15, 10, 5, 10, 10, 15, 10]], [[26, -10, 80, 0, 70, 10, 60, 50, 30, 30, 61, 30, 80, 0, -1]], [[0, 70, 30, 21, 13, 10, 5, 5, 21]], [[2, 7, 1, 16, 24, 6, 12, 8, 10]], [[30, 25, 21, 15, 10, 5, 21, 29, 21, 15, -16, 21, 10]], [[2, 4, 6, 12, 14, -4, 16, 2]], [[50, -10, 71, 80, 0, 70, 10, -16, 50, 30]], [[50, -10, 80, 0, 70, 5, 10, 60, 21, 50, 26, 30, 0, 7, -10]], [[1, 10, 5, 3, 1, 10, 7, 41, 2]], [[4, 6, 8, 10, 8, 12, 14]], [[49, 50, -10, 80, 81, 0, 70, 10, 72, 20, 50, 80, 30, 0, 10]], [[50, -10, 71, 80, 0, 70, 10, -16, 8, 50, 30]], [[0, 0, -3, 5, 3, 2, 1, 10, 7]], [[7, 2, 7, 4, 21, 12, 8, 10, 6, 10]], [[69, 50, -10, 80, 0, 70, 60, 40, 71, 20, 50, 30, 10]], [[25, 20, 30, 10, 5, 10, 10, 15, 25]], [[30, 25, 21, 15, 10, 5, 10, 21, 21]], [[50, 22, -10, 80, 0, 70, 10, 22, 60, 21, 50, 30, 21, -1, 0, 10]], [[-1, 4, 0, -3, 5, 3, 2, 8, 1, 7, 3]], [[50, -10, 80, 0, 70, 80, 10, 60, 21, 50, 30, 0, 50, 80]], [[69, 3, 50, -10, 80, 0, 70, 10, 60, 20, 50, -11, 30, 70]], [[69, 50, 80, 0, 70, 60, 40, 71, 20, 50, 30, 10]], [[-10, 80, 12, 70, 10, 60, 20, 50, 30, 40, -10]], [[49, -10, 80, 81, 0, 10, 60, 20, 50, 30, 0, 60]], [[7, 2, 7, 71, 30, 4, 14, 6, 10, 29, 6, 7, 30, 71]], [[-1, -4, -16, 0, 10, 15]], [[50, -10, 80, 0, 70, 10, 21, 50, 30, 21, 21, 71, -1, 0, 30, 30]], [[22, 25, 21, 15, 10, 4]], [[30, 25, 21, 69, 15, 51, 5, 30, 30]], [[50, -10, 80, 0, 70, 60, 21, 50, 0, 50, 22, 80]], [[8, -10, 41, 12, -5, 10, 60, 20, 50, 11, 30, 41, 40]], [[30, 25, 21, 15, 10, 5, 21, 21, 21]], [[30, 25, 15, 10, 5]], [[25, 21, -2, 15, 51, 5, 21]], [[-10, 80, -1, -1, 10, 51, 20, 30, 40, 80]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, -10, 70]], [[25, 21, 15, 10, 5, 60, 21, 21, 5]], [[-9, 1, -10, 80, 0, 70, 10, 60, 20, 30, 40, 60, 30]], [[30, 25, 30, 21, 15, 10, 4]], [[4, 6, 8, 10, 12, 17, 4, 8]], [[2, 4, 6, 8, 10, 16, 4, 12]], [[-1, 0, -3, 2, 10, 3, 6, 2, 1, 10, 7, 1]], [[30, 25, 30, 25, 21, 15, 15, 10, 4]], [[0, 0, -3, 5, 3, 3, -1, 1, 10, 7]], [[7, 3, 16, 14, 12, 8, 10, 8]], [[7, 1, -5, 14, 6, 13, 12, 8, 13, 8]], [[50, -10, 80, 81, 0, 70, 10, 61, 21, 50, 30, 21, 21, -1, 0]], [[5, 10, 14, 21, 25, -11, 30, 30, 10, 10, 10, 10]], [[16, -10, 80, 70, -4, 10, 60, 50, 30, 50]], [[16, -10, 80, -4, 10, 60, 50, 1, 30, 50]], [[50, -10, 71, 50, 0, 0, 70, 10, 20, 24, 50, 30, 10, 50]], [[-15, -10, 0, 60, 15, 15]], [[5, 5, 10, 14, 26, 24, -5, 30, 10]], [[30, 25, 40, 25, 20, 15, 10, 5, 21, 20, 25]], [[-10, 80, 0, 81, 40, 70, -9, 10, 59, 20, 40, 50, 30, 40, -10, 10]], [[-1, -3, 12, 2, 1, 10, 7, -2, -3]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7, -3, 10]], [[7, 2, 16, 7, 4, 14, 6, 8, 10, -2]], [[7, 14, 9, 12, 8, 10]], [[10, -5, 0, 15, -16, -10, -15, -15, -5, -5]], [[-10, 26, 0, 10, 20, 40, 50, 60, 70, 80, 10]], [[-1, 70, 30, 21, 13, 10, 5, 5, 21, 5]], [[9, 25, 21, 15, 10, 1, 30, 15]], [[30, 25, 40, 20, 15, 10, 5, 21, 59, 21, 59, 25, 21]], [[7, 2, 7, 10, 14, 10, 6]], [[30, 25, 40, 6, 20, 15, 10, 5, 21]], [[-1, 0, -3, 5, 3, 2, 1, 11, 2, 7]], [[-1, 6, -3, 5, 3, 2, 1, 81, 10, 7, -3, -3]], [[-1, -3, 5, 3, 2, 1, 10, 7, 1]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 71, 11, 41, -10, 80]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 10]], [[-1, 0, -3, 5, 3, 2, 1, 10, 7, 1, 0]], [[9, 80, 12, 70, 10, 60, 20, 50, 40, 9, 40, 10]], [[20, 21, 60, 9, 25, 21, 15, 5, 21, 25, 60, 60]], [[30, 25, 21, 15, 10, 5, 21, 29, 21, 15, 21, 5]], [[30, 25, 21, 15, 59, 10, 5, 21, 29, 21, 15, -16, 21, 10]], [[60, 80, 11, 70, 10, 60, 50, 30, 40, 10, 60]], [[10, -16, 25, 79, 26, 30, 25]], [[20, 80, 10, 60, 50, 30, 80, 30, 30, 30]], [[50, -10, 51, 80, 70, 60, 61, 20, 50, 30, 0, 21]], [[69, 70, 80, 0, 25, 4, 20, 50, 30, 10]], [[6, 49, 6]], [[50, -10, 80, 1, 0, 70, 10, 60, 21, 50, 30, 0, 8, 21]], [[50, 80, 9, 60, 20, 50, 30, 30]], [[-1, 0, -3, 5, 3, 2, 1, 70, 10, 7, -3, 10]], [[5, 10, 14, 21, 25, 31, 6, 10]], [[6, 7, 2, 16, 7, 4, 14, 6, 12, 8, 10, 6]], [[50, -10, 80, 0, 70, 10, 60, 20, 50, 30, 20]], [[50, -10, 80, 0, 70, 22, 10, 60, 21, 50, 30, 0, 21, 50, 10]], [[10, 20, 25, 79, -3]], [[20, 21, 60, 9, 25, 61, 21, 15, 5, 21, 21, 25, 60, 21]], [[-10, 80, 0, -9, 70, 10, 60, 20, 41, 30, 40]], [[1, -10, 80, 0, 70, 10, 26, 20, 30, 40, 60, 30, 1, 30, 80]], [[80, 12, 70, 10, 60, 9, 20, 50, 30, 30, 40, 41, 40, 40]], [[6, 8, 10, 12, 17]], [[5, 20, 25, 30]], [[10, 14, 21, 25, 30, 10, 14]], [[-10, 80, 0, 70, 10, 60, 20, 50, 30, 40, -10, -10, 70, 40]], [[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1]], [[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4]], [[1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7]], [[7, 6, 5, 4, 3, 2, 1, 7, 6, 5, 4, 3, 2, 1]], [[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]], [[1, 2]], [[10000000000, 0, -10000000000]], [[-1, 0, -3, 3, 2, 1, 7, 3]], [[-5, 0, 15, -10, -15]], [[5, 10, 14, 20, 25, -10]], [[-5, 0, 15, -1, -15]], [[2, 16, 4, 15, 14, 6, 12, 8, 20, 10, 6]], [[-15, -10, 0, 10, 15, -5, 10]], [[10, 0, 15, -10, -15]], [[30, 25, 20, 15, 10, 7, 5, 7]], [[10, 0, 15, -10, 1, -15]], [[5, 2, 1, 4, 7, 6, 5, 8, 4]], [[-5, 0, 15, -1, -15, -6, -5]], [[3, 10, 1, 4, 7, 6, 5, 4]], [[-1, 0, -3, 3, 2, 1, 10, 7]], [[-1, 0, -3, 3, 2, 1, 10, 7, 7]], [[-1, 0, -3, 2, 1, 10, 7, 7]], [[-5, 0, 15, -1, -15, -6, -5, -15, -2, -5]], [[-10, 80, 0, 70, 60, 20, 50, 30, 40]], [[-5, 15, -1, -15, -6, -5]], [[3, 2, 1, 4, 7, 6, 5, 3]], [[-5, 0, 10, 15, -1, -15]], [[3, 10, 1, 4, 7, -1, 6, 5, 4]], [[16, 4, 14, 6, 12, 8, 10, 6]], [[-9, 80, 0, 70, 60, 20, 50, 30, 40]], [[-1, 0, -3, 3, 2, 1, 7, 7]], [[-10, 0, 10, 20, 30, 40, 50, 70, 80]], [[-1, 3, 0, -3, 3, 2, 1, 7, 3, 1]], [[-5, 0, 15, -1, -15, -1]], [[10, 0, 15, -10, -15, -15, -15]], [[5, 14, 80, 20, 25, -10, 25]], [[30, 25, 20, 15, 10, 6]], [[4, 6, 8, 10, 12, 14, 3, 16]], [[10, 0, 50, -10, -15, -15, -15]], [[-15, -10, 0, 10, 15, 10]], [[-1, 3, 0, -3, 3, 2, 2, 1, 7, 3, 1]], [[-1, 3, 0, -3, 2, 1, 7, 3, 1, 0, -3]], [[-1, 0, -2, -3, 3, 2, 1, 7, 3]], [[-1, 20, 0, -3, 3, 2, 1, 10, 7, 7, 2]], [[4, 6, 9, 10, 12, 14, 3, 16, 4, 16]], [[-1, 0, -3, 3, 2, 10, 7]], [[-15, -10, 0, 10, 15, -5, 70]], [[0, -3, 3, 2, 10, 7]], [[-9, 80, 0, 9, 70, 8, 20, 50, 30, 40]], [[0, -3, 3, 1, 10, 7]], [[-1, 0, -3, 3, 2, 1, 20, 3, 1]], [[-5, 15, -1, -15, 15, -5]], [[2, 4, 6, 8, 10, 12, 14, 16, 8]], [[12, 81, 5, 14, 80, 20, 25, -10]], [[-1, 0, -3, 3, 2, 1, 7, 80]], [[-15, -10, 0, 0, 10, 15, 10]], [[2, 16, 4, 14, 12, 8, 10]], [[2, 4, 6, 8, 10, 12, 14, 16, 8, 8]], [[-10, 0, 10, 20, 30, 40, 50, 70, 80, 80]], [[-5, 0, 15, -1, -15, -6, -5, -15, -2, -5, 0]], [[-10, 80, 0, 70, 10, 60, 20, 30, 40]], [[3, -5, 1, 4, 7, 6, 5, 4]], [[-10, 80, 0, 70, 60, 20, 50, 30, 30, 40]], [[25, 20, 15, 10]], [[-1, 0, -3, 3, -10, 2, 1, 20, 3, 1]], [[9, -5, 0, 15, -10, -5, -5]], [[10, 50, 0, 15, -10, -15, -15, -15]], [[-5, 0, 15, 16, -1, -14, -1, 0]], [[-1, 0, -3, 3, 2, 1, 10, 7, 7, 7]], [[0, 10, 0, 15, -10, -15, -15, -15]], [[-10, 10, 20, 30, 40, 50, 70, 80, 80]], [[25, 20, 15, 10, 6]], [[3, 2, 1, 4, 7, 5, 3]], [[-5, 0, 15, -1, -15, -6, -5, -15, -2, -5, -3, 0]], [[30, 25, 20, 15, 9, 5]], [[-1, 3, 0, -3, 3, 10, 2, 1, 7, 3]], [[16, 14, 6, 12, 8, 10, 6]], [[2, 4, 6, 8, 10, 12, 14, 16, 8, 6]], [[10, 0, -3, 4, 2, 1, 20, 3, 1, 3]], [[-1, 0, -3, 3, 2, 1, 10, 7, 1]], [[9, -5, 1, 15, -10, -5, -5]], [[-5, 0, 15, -15, -1]], [[-10, 80, 0, 70, 60, 50, 30, 40]], [[-1, 0, -3, 3, 2, 1, 20, 3]], [[9, -5, 50, 2, 15, -10, -5, -5]], [[-5, 0, 15, -6, -1, -15, -6, -5, -15, -2, -5, -15, -15]], [[10, 50, 0, 15, -10, -15, -15, -15, -15]], [[-5, 15, -1, -15, -6]], [[-10, 80, 0, 40, 0, 70, 60, 50, 30, 40]], [[10, -5, -10, 15, -10, -15]], [[-5, 0, 15, 20, -15, -6, -5, -15, -2, -5, -3, 0]], [[-1, 0, -3, 3, 2, 1, 7, 7, -1, -1, -1]], [[2, 4, 6, 8, 8, 10, 12, 14, 16, 8]], [[2, 4, 6, 8, 10, 12, 14, 16, 8, 8, 16]], [[4, 6, 8, 10, 12, 14, 16, 8, 8, 16, 16]], [[3, 10, 1, 4, 7, 6, 5, 4, 3]], [[12, 81, 14, 80, 20, 25, -10, 14]], [[10, 50, 0, 15, -10, -15, -15, -15, -15, 50]], [[-9, 80, 0, 9, 70, 8, 20, 50, 30, 40, 30]], [[-5, 0, 15, 20, -15, -6, -1, -5, -15, -2, -5, -3, 0]], [[-1, 0, -3, 3, 2, 1, 10, 7, 8, 7, 7]], [[30, 25, 15, 9, 5]], [[3, 10, -5, 4, 7, 6, 5, 4]], [[0, -6, 2, 10, 7]], [[-15, -10, 0, 8, 15, -5, 10, 15]], [[3, 1, 4, 7, 6, 5, 4]], [[-1, 0, -4, 3, 2, 10, 7, -3]], [[0, -3, 3, -6, 10, 7, -3]], [[4, 5, 9, 10, 12, 14, 3, 16, 4, 16]], [[30, 25, 20, 14, 10, 7, 5, 7]], [[-5, -10, 0, 10, 15, -1, -15, 10]], [[9, -5, 0, 15, -10, -5, -5, 9]], [[2, 16, 4, 14, 8, 10]], [[3, 10, -5, 4, 7, 6, 5, 5, 4]], [[-1, 0, -3, 5, 3, 2, 1, 10, 6, 7]], [[-1, 0, -3, 3, 2, 1, 20, 8, 80, 80]], [[16, 4, -15, 14, 12, 8, 10]], [[2, 4, 6, 8, 10, 12, 14, 16, 8, 8, 14]], [[2, 16, 4, 14, 12, 8, 10, 14]], [[12, 82, 5, 14, 80, 20, 25, -10]], [[16, 4, 25, 20, 6, 12, 8, 10, 6]], [[-1, 0, -3, 3, 2, 4, 1, 7, 3]], [[0, 3, 1, 10, 7]], [[-5, 0, 15, 20, 14, -6, -1, -5, -15, -2, -5, -3, 0]], [[10, 0, -3, 4, 5, 1, 20, 3, 1]], [[-11, 10, 20, 30, 39, 50, 70, 80, 80, 80]], [[30, 25, 20, 15, 10, 7, 5, 7, 30]], [[-5, 3, 10, 1, 4, 7, 6, 5, 4, 3]], [[-1, 0, -3, 2, 1, 7, 7, -2, -1, -1]], [[-1, 0, -3, 3, 2, 1, 7, 80, -1, 0, -1]], [[12, 0, 14, 80, 20, -10, 25, -10, 14]], [[50, 15, -1, -15, -6, -1]], [[9, -5, 1, 15, -10, -5, -5, 9, 1]], [[-1, 1, 3, 0, -3, 3, 2, 2, 1, 7, 3, 1, 0, 3, 0]], [[9, -5, 50, 2, 15, -10, -5, -5, -5, 9]], [[-5, 0, 15, -1, -15, -6, -5, -15, -2, -2, 0]], [[25, 20, 15, 10, 4]], [[0, -3, 40, 3, 20, -6, 10, 7, -3]], [[5, 10, 14, 20, 25]], [[10, 0, 15, -10, -15, -10]], [[-1, 0, -3, 3, 2, 1, 7]], [[-10, 0, 0, 10, 15, 80, 10]], [[-5, -10, 0, 10, 15, -1, 10]], [[5, 10, 15, 82, 25, 30]], [[9, -5, 1, 15, -10, -5, -5, 9, 1, -10]], [[9, -5, 50, 2, -10, -5, 50, -5, -5, 9]], [[10, -5, 1, 15, -10, -5, -5]], [[-1, 0, -14, 3, 2, 1, 7, 7, -1, -1, -1]], [[10, 0, -2, 4, 2, 1, 20, 3, 1, 3]], [[-1, 0, 0, -3, 3, 2, 4, 1, 7, 3, 20]], [[2, 4, 6, 8, 10, 12, 14, 16, 8, 8, 1, 14]], [[2, 16, 4, 14, 12, 8, 14, 10, 14]], [[10, 0, -15, 50, -10, -15, -15, -15, -15]], [[10, -5, 1, 15, -10, -5, -5, -5, 10]], [[3, 2, 1, 4, 7, 6, 2, 5]], [[10, 50, 0, 15, -10, -15, -2, -15, -15, -15]], [[-10, -1, 80, 0, 70, 10, 60, 20, 50, 30, 40]], [[2, 16, 4, 50, 14, 40, 12, 8, 10, 9, 4]], [[4, 5, 10, 10, 12, 14, 3, 16, 4, 16]], [[-1, 0, -3, 3, 60, 2, 1, 20, 1]], [[12, 82, 5, 14, 80, 20, 25, -10, 82]], [[2, 4, 6, 8, 10, 12, 14, 25, 8, 8, 16]], [[-5, 0, 15, -1, -15, -6, -5, -15, -2, -5, 15, -6]], [[-1, 20, -3, 3, 2, 1, 10, 7, 7, 2]], [[-10, 0, 10, -3, 30, 40, 50, 70, 80, 80]], [[30, 7, 50, 0, 15, -10, -15, -2, -15, -15]], [[12, 81, 5, 14, 80, 20, 25, -10, 12]], [[-15, -10, 0, 10, 15, -5, 70, 15]], [[-1, 6, -3, 2, 1, 10, 7, 7]], [[-15, 0, 10, 0, 15, -10, -15, -15, -15]], [[-10, 80, 0, 70, 59, 60, 20, 50, 30, 40]], [[-5, 14, -10, 0, 10, 15, -1, 10]], [[3, 10, 1, 4, 7, -1, 6, 5, -3]], [[-15, 0, 10, 0, 15, -10, -15, -1, -15, -15, -15]], [[9, -5, 1, 15, -10, -10, -5, 8, -5, 9, 1, -10]], [[12, 81, 82, 5, 14, 80, 20, 25, 82]], [[10, 0, 15, 4, 82, -10]], [[5, 10, 14, 20, 25, -10, 14]], [[2, 16, 4, 14, 12, 8, 14, 16]], [[-1, 0, -3, 3, 2, 1, 7, 7, 7]], [[-10, 80, 0, 70, 59, 60, 20, 50, 30, 39]], [[-5, -10, 0, 10, 15, -9, -1, -15, 10]], [[-1, 0, 0, 25, -3, 3, 2, 4, 1, 7, 3, 20]], [[16, 4, 25, 20, 6, 12, 8, 6]], [[5, 10, 15, 20, 25, 30, 20]], [[3, 10, 1, 4, 3, 7, 5, 4, 3, 5]], [[-1, 0, -14, 3, 2, 1, 7, 7, -1, 80]], [[-15, -10, 0, 10, 15, -5, 0]], [[12, 81, 5, 14, 80, 20, 25, -10, 81]], [[10, 16, 0, 15, -10, -15, -2, -15, -15]], [[30, -10, 0, 10, 20, 30, 40, 50, 70, 80]], [[2, 16, 4, 14, 6, 8, 10]], [[-9, 0, 70, 60, 20, 50, 30, 40, -10, 50]], [[2, 16, 4, 14, -1, 6, 12, 10]], [[0, 3, 1, 10, 7, 3, 3]], [[2, 16, 4, 14, 12, 10]], [[-15, 0, 10, 0, 15, -10, -15, -15, -15, 0]], [[9, -5, 0, 70, -10, -5, -5, 9, -5]], [[-5, 0, 15, 20, -15, -6, -1, -5, -15, -2, -5, -3, 0, -15]], [[2, 16, 4, 14, 12, -5, 10, 2, 14]], [[2, 5, 10, 15, 20, 25, 30]], [[3, 10, 1, 4, 3, 5, 4, 3, 5, 5]], [[0, 10, 0, -15, 15, -10, -15, -15, -15]], [[-5, 2, -10, 0, 10, 15, -9, -1, -15, 10]], [[10, -15, 0, 10, 1, 0, 15, -10, -15, -1, -15, -15, -15]], [[-1, 0, -3, 3, 2, 1, 10, 7, 1, 7, 3]], [[0, -3, 3, 60, 2, 1, 20, 1, 20]], [[-1, 0, -14, 3, 2, 1, 7, 7, -1, -1, -14, -1]], [[10, 1, 4, 7, -1, 6, 5, 4]], [[-10, 10, 20, 30, 40, 50, 70, 80, 80, 30]], [[-1, 3, 0, -3, 2, 1, 7, 3, 1, 0, -3, 0]], [[3, 20, 1, 4, 7, 6, 5, 4]], [[10, -5, 1, -9, -5, -5, -5, 10]], [[16, 2, 16, 4, 15, 14, 6, 12, 8, 20, 10, 6]], [[-1, 3, 0, -3, 3, 10, 1, 7, 3]], [[30, 25, 15, 9, 5, 9]], [[10, 50, 1, 16, -10, -15, -15, -15]], [[-1, 3, 0, -3, 2, 1, 7, -6, 3, 1, 0, -3]], [[2, 4, 6, 10, 12, 14, 16, 8]], [[6, 10, 0, -2, 4, 2, 1, 20, 3, 15, 1, 3]], [[10, -5, 1, -9, -5, -8, -5, -5, 10]], [[10, 16, 0, 15, -10, -14, -2, -15, -15]], [[10, 8, 0, 15, -10, -15, -15, -15]], [[16, 4, 25, -1, 6, 12, 8, 6]], [[-1, 0, -14, 3, 50, 1, 7, 7, -1, 80]], [[5, 2, -4, 1, 4, 7, 6, 5, -2, 8, 4]], [[-10, 2, -3, 1, 4, 7, 6, 5, -2, 8, 4, 4, 5]], [[-1, 3, 0, -3, 3, 10, 1, 7, 3, 1]], [[-5, 15, -1, 15]], [[30, 20, 15, 10, 7, 5, 11, 7, 30, 11]], [[0, -3, 40, 3, 20, -6, 10, 7, -3, -3]], [[12, 81, 5, 14, 20, 25, -10]], [[9, -5, 50, 2, 15, -10, -5, -5, -5, 9, 15]], [[49, -10, 0, 10, 30, 40, 50, 70, 80, 80]], [[2, 16, 4, 12, -5, 10, 2, 14]], [[2, 20, 1, 4, 7, 6, 5, 4]], [[-1, 1, 3, 0, -3, 3, 2, 2, 1, 7, 3, 1, 0, 3, 0, -3]], [[10, 15, -10, -15, -15, -15]], [[9, -5, 50, 2, 15, -10, -5, -5, -5]], [[-10, 0, 10, 15, -1, -15, -5]], [[-5, 2, -10, 0, 10, 15, -1, -15, 10]], [[3, 1, 6, 4, 7, 6, 5, 4]], [[-1, 0, 50, 4, 0, -3, 10, 3, 2, 4, 1, 7, 3, 20, 3]], [[9, -5, -11, 15, -10, -5, -6, -5]], [[16, 2, 16, 4, 15, 14, 6, 12, 8, 20, 10, 30, 6]], [[-1, 0, -3, 2, 1, 10, 7, 7, 2]], [[2, 16, 4, 6, 12, 8, 10]], [[30, 25, -14, 15, 9, 5]], [[-5, 0, 15, 20, -15, -9, -1, -5, -15, -2, -5, 5, -3, 0]], [[-5, 0, 15, -1, -15, -6, -5, -15]], [[-1, 0, -14, 3, 50, 1, 7, 7, -1, 80, 0]], [[10, -5, 0, 15, -10, -15, 15]], [[10, 8, 0, 15, -10, -15, -15]], [[16, 4, 25, 20, 6, 12, 8, 5, 12]], [[30, -10, 0, 10, 20, 30, 40, 50, 70, 80, 50]], [[9, -5, 1, 15, -10, -6, -5, -5]], [[3, 10, 4, 7, 6, 5, 4, 3]], [[-9, 80, 0, 70, 60, 20, 50, 30, 39]], [[10, 0, 15, 4, 82]], [[12, 81, 5, 14, 80, 20, 25, -10, 81, 25]], [[10, 16, 0, 15, -10, -15, -2, -15, -15, -15, 15]], [[10, 50, 0, 15, -10, -15, -15, -15, 50]], [[9, -5, 0, -1, 15, -10, -5, -5, 9]], [[-1, 0, -3, 3, 2, 1, 20, 8, 80, 80, 0]], [[2, 4, 6, 8, 10, 12, 16, 8, 8, 1, 14]], [[2, 4, -2, 8, 10, 12, 14, 16, 8, 8, 14]], [[-1, 0, -3, 5, 3, 2, 1, 10, 25, 6, 7]], [[9, -5, 50, 2, 15, -10, -5, -5, 16, 9]], [[40, 10, -15, 0, 10, 15, -5]], [[-10, 80, 0, 70, 10, 60, 30, 40]], [[-1, 3, 0, -3, 3, 10, 1, 7, 3, 1, 1]], [[-15, 1, -10, 0, 10, 15, -5]], [[10, 0, -3, 4, 2, 1, 20, 1, 3]], [[0, -3, 3, 60, 2, 1, 20, 0, 1, 20]], [[-1, 3, 0, -3, 3, 3, 10, 1, 7, 3, 1, 1]], [[11, 4, 7, 6, 5, 4, 3]], [[10, 0, 15, -10, -15, 25]], [[-5, 15, 16, -1, -14, -1, 0]], [[-1, 0, -3, 3, 2, 1, 20, 80, 8, 80, 80, 8]], [[30, 21, 25, 20, 15, 10, 6, 20]], [[-10, 80, 0, 71, 10, 30, 40]], [[-5, 0, -2, -1, -15]], [[4, 5, 9, 10, 12, 14, 3, 11, 16, 4, 16, 16]], [[2, 16, 3, 14, 8, 10, 14]], [[-10, 80, 0, 70, 59, 60, 20, 50, 30, 39, 0]], [[0, 3, 10, 7]], [[-1, 1, 3, 0, -2, 3, 2, 2, 1, 7, 3, 1, 0, 3, 0]], [[9, -5, 2, -10, -5, -5, -5, 9, 15, 9]], [[12, 81, 14, 80, 20, 25, -10, 14, 14, 14]], [[2, 4, 3, 6, 8, 10, 12, 14, 16, 8, 8, 14, 14, 14]], [[30, -10, 0, 10, 19, 30, 40, 50, 70, 80, 50]], [[3, 2, 1, 4, 7, 5, 3, 7]], [[11, -4, 15, -10, -15, 15]], [[2, 16, 4, 14, 12, -5, 10, 2, 14, 2]], [[0, -3, 40, 81, 3, 20, -6, 10, 7, -3]], [[10, -5, 16, 0, 15, -10, -15, 15]], [[10, 0, -3, 4, 5, 1, 20, 3, 1, -3]], [[3, 1, 4, 7, 6, 5, 4, 7]], [[9, -5, 0, 70, -10, 39, -5, -5, 9, -5]], [[-1, 0, -3, 2, 10, 7, 7, 2]], [[16, 9, 4, 25, -1, 6, 9, 12, 8, 6]], [[-1, 0, 50, 4, 0, 10, 3, 2, 4, 1, 7, 3, 20, 3, 50]], [[-1, 3, 0, -3, 2, 59, 1, 7, 3, 25, 0, -3]], [[-1, 0, -3, 3, 2, 1, 7, 80, -1, 12, 0, -1]], [[81, 30, 25, 15, 9, 5, 9]], [[-1, 3, 2, 0, -3, 3, 3, -8, 1, 7, 3, 1, 1]], [[3, 2, 4, 7, 6, 5]], [[2, -1, 0, -3, 3, 2, 1, 7]], [[-5, 0, 14, 20, 14, -6, -5, -15, -2, -5, -3, 0]], [[5, 10, 15, 6, 20, 25, 30, 20]], [[2, 4, 6, 8, 71, 2, 16, 8, 8, 1, 14]], [[80, -1, 70, 10, 60, 20, 30, 40]], [[25, 20, 30, 15, 10, 4, 4]], [[9, -5, 0, 70, -10, 39, -5, -5, 9, -5, 9]], [[-1, 0, -3, 3, -10, 2, 1, 20, 3, 1, -10]], [[2, 15, 14, -1, 6, 12, 10, 14]], [[10, 50, 0, 15, -10, -15, -2, -15, -15]], [[10, 21, 16, 0, 15, -10, -14, -2, -15, -15, 16]], [[-1, 0, -3, 3, 2, 1, 7, 3, 0]], [[30, 25, 20, 15, 10, 7, 7, 30]], [[12, 81, 14, 80, 20, 25, -10, 14, 14, 14, 25]], [[-10, 80, 0, 59, 60, 20, 50, 30, 40, 20]], [[2, 16, 4, 14, 12, -8, -5, 10, 2, 14]], [[4, 6, 8, 10, 12, 59, 16, 8, 8, 16, 16]], [[2, 16, 4, 14, 12, 8, 8, 10, 14]], [[16, 2, 16, 4, 15, 14, 6, 12, 8, 20, 10, 6, 4]], [[0, -3, 3, 2, 10, 7, 7]], [[11, -15, 40, -10, 0, 10, 15, 10]], [[31, -10, 80, 0, 70, 60, 20, 50, 30, 30, 40]], [[3, 10, -5, 4, -9, 7, 6, 5, 4]], [[-1, 14, 0, -3, 3, 10, 1, 7, 3, 1]], [[-1, 0, -3, 3, 1, 10, 7, 8, 8, 7]], [[3, 1, 10, 7, 3, 3]], [[17, 4, 6, 12, 8, 10, 6]], [[6, 10, 0, -2, 4, 2, 1, 20, 3, 15, 3]], [[30, 21, 25, 20, 15, 10, -8, 21, 20, 19]], [[-1, 0, -14, 3, 11, 1, 7, 7, -1, -1, -1]], [[-5, 0, 15, -1, 17, -6, -5, -11, -15, -2, -5]], [[10, 50, 0, 15, -10, -15, 21, -15, -15, -15, 50]], [[-1, 0, -3, -8, 3, 2, 20, 79, 8, 80, 80, 0]], [[16, 4, 14, 12, 8, 14, 10, 14, 10]], [[3, 11, 4, 10, 6, 5, 4, 3]], [[9, -5, 0, -10, -10, 39, -5, -5, 9, -5]], [[2, 16, 4, 14, 11, 8, 14, 16]], [[10, 50, 0, 15, -10, -15, -15, -15, 50, 50]], [[6, 0, 15, -1, -15]], [[16, 2, 16, 4, 14, 6, 12, 8, 20, 10, 30, 6]], [[10, 0, 40, -15, 50, -10, -15, -15, -15, -15, -15]], [[-1, 0, -3, 10, 7, 7, 2]], [[-5, 0, -2, -1, -15, -1]], [[-1, 0, -2, 3, 2, 1, 7, 3]], [[3, 10, -5, 4, 7, 6, 5, 5, 4, 5]], [[49, -10, 10, -3, 0, 10, 30, 40, 50, 70, 80, 80]], [[-1, 0, 31, 3, 2, 1, 7, 3]], [[12, -15, 81, 82, 5, 14, 80, 20, 25, 82]], [[30, 25, 20, 9, 15, 10, 5]], [[10, 1, 15, -10, -5, -5, -5, 10]], [[3, 10, 1, 4, 3, 5, 4, 3, 17, 5, 5, 5]], [[-1, 8, 0, -3, 2, 1, 10, 7, 7]], [[2, 4, 6, 10, 12, 14, 16, 9]], [[-5, 0, 15, -11, 8, -15, -6, -5, 50, -2, -5]], [[49, -10, 0, 10, 15, 10]], [[10, 0, -3, 4, 5, 20, 3, 1, -3]], [[-1, 1, 3, 0, -3, 3, 1, 2, 1, 7, 3, 1, -11, 3, 0, -3]], [[4, 5, 10, 10, 12, 3, 16, 4, 16]], [[-5, 0, 15, -1, -15, -6, -15]], [[-1, 0, -3, -2, 3, -2, 2, 2, 20, 80, 8, 80, 80, 8]], [[-15, -10, 9, 15, 10]], [[-9, 80, 0, 9, 70, 8, 20, 50, 30, 40, 40]], [[81, 39, 1, 10, 7]], [[6, 0, 15, 0, -15, 0, 0]], [[10, 20, 30, 39, 50, 70, 80, 80, 80]], [[25, 20, 30, 15, 25, 10, 4, 4]], [[10, 0, -3, 4, 2, 0, 20, 1, -1, 3, 4]], [[39, 1, 7, 10, 7]], [[3, 4, 7, 6, 5, 3]], [[-15, 10, 0, 15, -15, -15, -15, 0]], [[-1, 0, -3, 3, 2, 1, 20, 8, 80, 80, 0, 1]], [[-1, 10, -5, 4, -9, 59, 6, 5, 4]]], "completion": "\ndef strange_sort_list(lst):\n \"\"\"\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n \"\"\"\n sorted_lst = []\n lst = sorted(lst)\n while lst:\n sorted_lst.append(lst.pop(0))\n if lst:\n sorted_lst.append(lst.pop(-1))\n return sorted_lst\n", "raw_completion": "```python\ndef strange_sort_list(lst):\n \"\"\"\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n \"\"\"\n sorted_lst = []\n lst = sorted(lst)\n while lst:\n sorted_lst.append(lst.pop(0))\n if lst:\n sorted_lst.append(lst.pop(-1))\n return sorted_lst\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef strange_sort_list(lst):\n '''\n Given list of integers, return list in strange order.\n Strange sorting, is when you start with the minimum value,\n then maximum of the remaining integers, then minimum and so on.\n\n Examples:\n strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\n strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\n strange_sort_list([]) == []\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/71", "prompt": "\ndef triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''\n", "entry_point": "triangle_area", "canonical_solution": "\n\n if a + b <= c or a + c <= b or b + c <= a: return -1\n p = (a + b + c) / 2\n return round((p * (p - a) * (p - b) * (p - c)) ** 0.5, 2)\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(3, 4, 5) == 6.00, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(1, 2, 10) == -1\n assert candidate(4, 8, 5) == 8.18\n assert candidate(2, 2, 2) == 1.73\n assert candidate(1, 2, 3) == -1\n assert candidate(10, 5, 7) == 16.25\n assert candidate(2, 6, 3) == -1\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 1, 1) == 0.43, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(2, 2, 10) == -1\n\n", "contract": "\n assert a > 0 and b > 0 and c > 0, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[3, 4, 5], [1, 2, 10], [4, 8, 5], [2, 2, 2], [1, 2, 3], [10, 5, 7], [2, 6, 3], [1, 1, 1], [2, 2, 10]], "atol": 0, "plus_input": [[8, 9, 15], [10, 12, 15], [7, 7, 10], [3.6, 4.8, 6.1], [8, 15, 17], [6, 8, 10], [5, 5, 8], [9, 12, 15], [7, 24, 25], [2, 3, 4], [24, 23, 25], [7, 7, 7], [3, 5, 4], [24, 24, 25], [9, 11, 15], [6, 8, 4], [3, 23, 25], [2, 5, 4], [8, 9, 17], [3, 2, 3], [2, 9, 2], [5, 8, 8], [8, 15, 2], [10, 12, 3], [6, 17, 4], [7, 7, 11], [10, 8, 7], [9, 17, 17], [3, 3, 4], [24, 7, 5], [7, 23, 17], [6, 5, 10], [3, 22, 25], [22, 25, 25], [23, 17, 17], [6, 23, 10], [22, 25, 22], [8, 14, 2], [6, 24, 23], [4.8, 7.091641840978975, 6.1], [7, 11, 17], [12, 18, 8], [3, 4, 4], [12, 18, 3], [2, 17, 10], [24, 7, 6], [4, 10, 4], [6, 8, 6], [15, 7, 17], [2, 3, 3], [10, 7, 7], [8, 15, 4], [24, 25, 24], [2, 4, 7], [25, 25, 25], [7, 11, 16], [6, 5, 6], [5, 9, 6], [2, 2, 3], [4, 3, 23], [9, 8, 7], [16, 25, 22], [2, 1, 2], [3, 3, 3], [6, 23, 6], [1, 17, 4], [12, 13, 18], [18, 17, 17], [8, 9, 1], [8, 18, 1], [13, 9, 12], [7, 15, 15], [10, 8, 8], [9, 15, 15], [12, 8, 15], [10, 5, 5], [11, 18, 8], [12, 18, 17], [7, 15, 8], [4.8, 4.8, 4.8], [7, 17, 17], [9, 2, 3], [true, true, true], [8, 17, 8], [6, 17, 22], [9, 1, 7], [9, 8, 10], [6, 5, 5], [4, 15, 2], [25, 11, 15], [15, 1, 15], [5, 5, 10], [16, 1, 15], [6, 13, 6], [5, 5, 5], [3.6, 4.8, 3.961122069986524], [3.961122069986524, 4.8, 4.8], [16, 14, 18], [1, 4, 11], [15, 2, 15], [1, 1, 3], [3, 4, 7], [2, 2, 5], [1.5, 2.5, 3.5], [10000, 10000, 10000], [3, 3, 6], [10, 10, 20], [1.5, 2.4, 3.7], [2, 2, 4], [3, 4, 12], [1.5, 2.4, 2.4], [1, 2, 3], [1, 20, 20], [1.5, 2.4, 1.5], [6, 10, 20], [2, 2, 2], [1, 1, 4], [1.5, 2.243582514020111, 1.5], [1.5, 3.7, 2.4], [2.243582514020111, 3.5, 2.243582514020111], [3, 4, 3], [1.5, 2.5, 2.4], [12, 10, 20], [1.3641985205078329, 1.5, 1.3641985205078329], [10, 6, 20], [1.642992027072514, 2.4, 2.4], [3, 5, 6], [1.642992027072514, 2.5, 3.5], [12, 1, 3], [1, 2, 6], [1.5, 1.5, 1.5], [6, 10, 10], [12, 1, 1], [2.4, 1.4196153211881317, 2.4], [2.5, 4.195352879634535, 2.5], [10000, 11, 12], [5, 4, 6], [1, 10, 20], [4, 3, 10], [10, 6, 19], [4, 20, 4], [3, 5, 10000], [6, 10, 6], [1.5, 4.0558686746888934, 2.4], [12, 10, 7], [5, 12, 5], [4, 4, 20], [1.5, 3.7, 1.6354243288923729], [4, 1, 4], [12, 3, 1], [1, 5, 1], [20, 19, 6], [1.5, 2.1563641569599024, 4.0558686746888934], [2, 4, 2], [3, 10000, 7], [4, 12, 4], [7, 3, 6], [1.5, 1.642992027072514, 1.5], [2.1563641569599024, 1.4196153211881317, 2.4], [12, 10, 1], [11, 6, 19], [9, 6, 20], [12, 12, 3], [6, 4, 6], [1.642992027072514, 3.4498437377515523, 3.5], [6, 20, 20], [19, 12, 10], [5, 4, 4], [4, 10, 6], [6, 10, 21], [1, 21, 1], [1.5, 1.6608803064021642, 3.7], [1.5, 4.0558686746888934, 2.1678576332328428], [5, 11, 12], [10000, 11, 20], [12, 3, 3], [2.262075142531277, 2.1678576332328428, 1.3641985205078329], [4, 7, 4], [3, 12, 6], [6, 3, 3], [1.5, 3.7, 2.148304047537571], [4.0558686746888934, 2.4, 4.0558686746888934], [1.4196153211881317, 2.4, 2.4], [1.6354243288923729, 2.1563641569599024, 2.560595193053081], [1.5, 1.642992027072514, 2.1678576332328428], [10000, 10, 20], [6, 11, 12], [1, 2, 4], [2.33812767354038, 0.7033385138748636, 2.4], [1.5, 1.1510404896538393, 2.243582514020111], [12, 1, 2], [1.5, 2.5, 1.5], [0.8437220480478858, 4.157230829281458, 2.4], [11, 3, 11], [21, 19, 6], [1.5, 2.4430443203125956, 2.0977671953307357], [1.4196153211881317, 1.4196153211881317, 1.4196153211881317], [6, 4, 9], [20, 4, 8], [21, 5, 10], [13, 11, 12], [18, 6, 21], [5, 10000, 10000], [2, 3, 11], [2, 4, 4], [0.9326237111951746, 2.4, 2.4], [6, 13, 3], [2.262075142531277, 2.1678576332328428, 0.6542952965279305], [5, 12, 12], [2.084281061132473, 2.5, 0.9326237111951746], [17, 6, 21], [2, 3, 18], [2, 1, 4], [2.5, 3.4498437377515523, 3.7], [1.3641985205078329, 2.243582514020111, 1.5], [4.157230829281458, 4.0558686746888934, 2.4], [1, 5, 20], [20, 20, 6], [2.4430443203125956, 2.4, 1.9698229422274585], [10, 20, 18], [3, 6, 6], [10, 13, 17], [12, 13, 6], [0.622155751870696, 2.084281061132473, 2.5], [10, 1, 9], [10, 6, 10], [21, 10, 10], [11, 3, 4], [9, 13, 19], [1.200314718419552, 1.1926090998134464, 2.7631966786277014], [10000, 20, 6], [2.243582514020111, 1.5, 1.5], [3, 10000, 6], [10, 3, 2], [2.5, 4.442719755691903, 3.7], [6, 11, 21], [12, 3, 8], [6, 13, 2], [2.5, 4.195352879634535, 2.243582514020111], [1.3641985205078329, 2.243582514020111, 1.267558555857357], [2.262075142531277, 2.1678576332328428, 2.262075142531277], [6, 10000, 6], [18, 20, 21], [12, 4, 6], [13, 20, 20], [11, 4, 4], [12, 3, 17], [9999, 10000, 7], [3.9329677858307948, 2.128791392500959, 1.267558555857357], [4.0558686746888934, 0.7033385138748636, 0.7033385138748636], [2.4, 2.4, 2.4], [3, 7, 7], [21, 3, 10], [12, 6, 6], [19, 1, 4], [10000, 10000, 10001], [7, 6, 5], [1.8341166265297297, 1.5, 1.5], [4.0558686746888934, 1.8223871525574837, 4.0558686746888934], [2.3974882322548865, 2.4, 1.9698229422274585], [2.128791392500959, 1.6354243288923729, 2.1563641569599024], [1.3641985205078329, 2.243582514020111, 2.3432505278674434], [9999, 6, 9999], [5, 20, 4], [12, 3, 2], [19, 6, 19], [2.4, 2.1647966283290505, 2.038421077762675], [1.6608803064021642, 0.6542952965279305, 1.6608803064021642], [6, 4, 12], [3.4498437377515523, 3.7, 3.7], [2.084281061132473, 2.1678576332328428, 0.6542952965279305], [8, 10000, 6], [1, 4, 4], [4, 12, 12], [1, 3, 4], [1, 5, 2], [4.157230829281458, 2.4, 2.4], [9, 9, 9], [3, 6, 3], [6, 19, 20], [1, 6, 2], [11, 9, 11], [4, 6, 2], [9, 12, 9], [2.1647966283290505, 2.4, 2.4], [8, 9999, 10000], [10, 5, 9], [1.3641985205078329, 0.8706143907765709, 2.243582514020111], [2, 5, 2], [2, 3, 17], [2.128791392500959, 2.243582514020111, 1.5], [6, 2, 7], [1, 6, 10], [8, 9, 9], [1.8271158639570797, 2.262075142531277, 0.6542952965279305], [3, 2, 11], [7, 13, 2], [10, 20, 3], [3.4498437377515523, 2.8483563393502944, 2.33812767354038], [3, 19, 4], [2, 10001, 2], [1.5, 1.9329103191414176, 2.4430443203125956], [1.8271158639570797, 2.262075142531277, 0.686661599347447], [1.3985411647382533, 4.0558686746888934, 2.1678576332328428], [1.5, 2.5, 0.8706143907765709], [3, 8, 3], [8, 3, 2], [9, 5, 13], [21, 6, 10], [2.1678576332328428, 2.1678576332328428, 2.1678576332328428], [0.9426819238709225, 2.33812767354038, 2.33812767354038], [4, 10001, 13], [3, 6, 4], [4.07628098856003, 4.0558686746888934, 4.07628098856003], [2.4, 2.2818215819260073, 2.494614380837856], [10000, 17, 17], [4, 18, 19], [12, 6, 4], [17, 3, 17], [1.5, 1.9329103191414176, 1.9329103191414176], [1.642992027072514, 3.131397785578148, 3.1721622755476457], [10, 6, 12], [13, 21, 13], [21, 13, 13], [11, 9, 10], [18, 6, 10], [21, 20, 10], [20, 10, 4], [10001, 12, 10001], [12, 6, 7], [1.200314718419552, 0.9463641485630762, 2.7631966786277014], [5, 6, 6], [9999, 6, 6], [11, 13, 9], [1.5, 2.038421077762675, 1.6354243288923729], [10000, 1, 21], [0.8437220480478858, 4.157230829281458, 1.6629322548740264], [12, 3, 12], [2.2430034847370095, 1.200314718419552, 1.5], [20, 11, 12], [11, 13, 8], [3, 6, 7], [1.7425763109349286, 2.036174656564886, 2.036174656564886], [1, 21, 21], [21, 4, 13], [3, 19, 19], [1, 3, 1], [1.6161161492974772, 2.4430443203125956, 1.6161161492974772], [9, 4, 4], [8, 2, 2], [2.5, 0.8706143907765709, 2.5], [17, 12, 12], [4, 3, 4], [4.0558686746888934, 0.7033385138748636, 2.262075142531277], [1.5, 2.4430443203125956, 1.82003153357376], [2.1678576332328428, 1.2865323183268573, 2.1678576332328428], [2.4, 2.2692536905847067, 2.4], [2.1647966283290505, 3.1362954706820205, 0.7547267194279496], [1, 5, 4], [0.6542952965279305, 0.6542952965279305, 0.6542952965279305], [12, 11, 7], [10000, 5, 10000], [2.1647966283290505, 3.1362954706820205, 3.1362954706820205], [19, 13, 10], [2.5, 4.195352879634535, 4.195352879634535], [9, 11, 5], [4, 3, 8], [3.131397785578148, 2.036174656564886, 2.036174656564886], [1.8942368652837256, 1.5, 3.7], [5, 20, 20], [10001, 2, 12], [9999, 6, 3], [2.374627814375018, 2.1678576332328428, 1.2865323183268573], [1.642992027072514, 3.4498437377515523, 1.1926090998134464], [10001, 3, 4], [19, 19, 19], [1, 3, 9999], [1.6161161492974772, 2.4, 1.6161161492974772], [10, 4, 10], [9999, 10000, 9999], [3.0403331185139235, 2.5, 0.9326237111951746], [10, 10, 4], [10001, 6, 10000], [3, 9, 3], [1, 1, 12], [1.200314718419552, 2.4, 1.4196153211881317], [10000, 1, 10000], [8, 13, 3], [1, 6, 11], [1.5, 2.2818215819260073, 2.4430443203125956], [2.1678576332328428, 2.1678576332328428, 4.0558686746888934], [1, 20, 11], [3.3846415256380586, 2.7631966786277014, 0.7033385138748636], [12, 3, 10000], [9, 3, 3], [2.1563641569599024, 1.7425763109349286, 1.8467976059297913], [10000, 10, 17], [1.6951729635583077, 1.5, 1.3641985205078329], [10000, 1, 11], [1.9419930401569185, 1.5, 1.3641985205078329], [11, 10000, 11], [20, 4, 20], [9999, 10, 9999], [4, 4, 13], [10000, 9999, 10000], [5, 7, 6], [1.4196153211881317, 0.9326237111951746, 3.2842576395462033], [5, 20, 6], [3, 5, 18], [0.8437220480478858, 5.3599327367069565, 2.1678576332328428], [2.3974882322548865, 2.4, 2.3974882322548865], [8, 3, 6], [20, 2, 3], [1.3985411647382533, 2.1678576332328428, 2.1678576332328428], [1.3641985205078329, 2.2818215819260073, 2.4430443203125956], [3.7, 4.9453223141324845, 1.6354243288923729], [2.547296836044605, 2.262075142531277, 1.5], [1.3641985205078329, 1.8942368652837256, 2.4430443203125956], [10, 5, 17], [4, 17, 13], [4.0558686746888934, 0.7186421266908659, 0.7033385138748636], [2.1678576332328428, 1.6354243288923729, 4.0558686746888934], [10000, 17, 10000], [3.0403331185139235, 0.9426819238709225, 2.547296836044605], [1.8617258937082115, 1.5, 1.5], [12, 7, 6], [4, 20, 20], [1, 21, 11], [5, 10000, 5], [4, 6, 4], [18, 2, 3], [1, 2, 1], [2.1678576332328428, 1.2865323183268573, 2.4292543231973256], [2.4, 2.1647966283290505, 1.9329103191414176], [2.4, 4.195352879634535, 4.07628098856003], [2, 10000, 6], [4, 3, 5], [5, 2, 12], [2.4292543231973256, 0.6587933722848219, 2.1678576332328428], [1.5, 4.8599085277703695, 4.8599085277703695], [3, 6, 1], [10001, 2, 10001], [1, 5, 19], [6, 1, 2], [2.33812767354038, 0.8437220480478858, 1.267558555857357], [2.084281061132473, 0.6542952965279305, 0.6542952965279305], [7, 7, 12], [2.243154383102723, 2.5, 2.243154383102723], [2, 2, 12], [4.8599085277703695, 2.5, 2.4], [2.262075142531277, 2.1678576332328428, 2.1678576332328428], [10, 6, 2], [10000, 2, 12], [2.5736600105589718, 3.4498437377515523, 3.4498437377515523], [4.195352879634535, 4.761807742424063, 4.195352879634535], [7, 7, 6], [5.121265754105029, 1.5, 1.5], [21, 3, 9], [3.9329677858307948, 2.128791392500959, 2.128791392500959], [3.678124396317478, 4.9453223141324845, 1.6354243288923729], [4.9453223141324845, 1.6354243288923729, 3.678124396317478], [16, 17, 17], [1.6354243288923729, 2.8483563393502944, 2.1563641569599024], [2.4292543231973256, 1.3641985205078329, 1.5], [12, 10, 10], [10001, 8, 7], [11, 11, 4], [2.1678576332328428, 3.9329677858307948, 3.9329677858307948], [1.9329103191414176, 3.7, 3.7], [12, 12, 10001], [1.5, 1.6354243288923729, 1.6354243288923729], [1.3641985205078329, 2.457557909382755, 2.4430443203125956], [6, 7, 6], [3.678124396317478, 1.5, 3.7], [5.000194727632692, 2.4, 2.2818215819260073], [1.5, 1.3641985205078329, 1.3641985205078329], [14, 19, 10], [6, 12, 6], [3.7, 2.1563641569599024, 4.9453223141324845], [2, 20, 20], [7, 18, 18], [14, 11, 7], [5.000194727632692, 2.4, 1.4022164083137756], [17, 13, 20], [6, 6, 10000], [1.200314718419552, 1.1926090998134464, 2.0977671953307357], [2.4, 2.3065522317615503, 2.038421077762675], [5, 6, 5], [10, 6, 17], [21, 17, 12], [2.243154383102723, 2.243154383102723, 2.5], [3.794360538667089, 2.4, 2.2818215819260073], [1.267558555857357, 1.672462725576983, 1.672462725576983], [12, 4, 20], [19, 4, 20], [1.5, 3.7, 1.5], [5, 11, 11], [12, 10, 12], [2.457557909382755, 0.6542952965279305, 1.2865323183268573], [2, 10000, 10000], [17, 17, 3], [11, 20, 3], [5, 8, 3], [4, 3, 3], [0.6542952965279305, 2.1678576332328428, 4.0558686746888934], [1.9698229422274585, 1.6608803064021642, 1.6608803064021642], [10, 1, 12], [14, 11, 13], [12, 12, 6], [1.3641985205078329, 2.5736600105589718, 2.036174656564886], [1, 21, 12], [10001, 1, 16], [11, 12, 12], [2.3065522317615503, 2.5, 1.4196153211881317], [16, 11, 11], [1.5, 4.0558686746888934, 2.084281061132473], [1.5806722055724702, 1.3641985205078329, 1.3641985205078329], [3, 10001, 4], [4, 9, 4], [2.383272874482817, 2.547296836044605, 2.1678576332328428], [10, 2, 17], [1.31630964374628, 0.7033385138748636, 2.4], [10, 3, 10], [2.084281061132473, 2.5, 0.999057665066928], [16, 11, 10001], [0.8437220480478858, 2.1678576332328428, 0.8437220480478858], [2.128791392500959, 4.761807742424063, 4.195352879634535], [21, 21, 11], [2.5736600105589718, 2.084281061132473, 2.5], [8, 9, 10], [2.33812767354038, 0.5084534820362593, 2.4], [8, 13, 13], [4, 2, 2], [7, 5, 10001], [4.442719755691903, 2.444385575870246, 5.182676183528757], [2.5, 1.8942368652837256, 2.4430443203125956], [1.6161161492974772, 2.2818215819260073, 1.6161161492974772], [5, 11, 2], [1.5, 1.6629322548740264, 3.5], [6, 19, 6], [21, 19, 19], [1, 12, 1], [10, 5, 18], [0.7547267194279496, 5.000194727632692, 3.678124396317478], [4.195352879634535, 4.761807742424063, 4.379505351125754], [2.1678576332328428, 0.5084534820362593, 4.0558686746888934], [4, 12, 13], [9, 13, 8], [1.1172100175191195, 1.5, 1.5], [8, 12, 6], [20, 20, 4], [5, 6, 7], [1.5, 1.8763617511124884, 1.5], [12, 11, 8], [8, 8, 3], [2.560595193053081, 1.4196153211881317, 1.4196153211881317], [3, 14, 4], [13, 2, 2], [10, 10, 10], [3.2842576395462033, 2.128791392500959, 4.082623609596164], [1.5, 1.9419930401569185, 1.82003153357376], [2.6628618810103504, 2.2692536905847067, 2.4], [1.3641985205078329, 2.384080250520507, 1.3641985205078329], [4, 15, 14], [1.5, 1.9329103191414176, 2.3360169223640765], [2.33812767354038, 2.4, 2.4], [4, 19, 2], [9, 1, 4], [0.6287252629258216, 0.7547267194279496, 3.678124396317478], [5, 10001, 10000], [19, 6, 8], [2.383272874482817, 2.5130512703414154, 2.547296836044605], [7, 5, 7], [5, 8, 2], [3, 15, 4], [1.5, 1.201981374203674, 1.5], [10, 5, 10], [4.0558686746888934, 2.4, 4.579710571475333], [2, 4, 5], [19, 19, 18], [1, 10001, 2], [5, 20, 1], [1.4022164083137756, 2.6076642711640567, 1.1805686207244295], [7, 22, 21], [1.3641985205078329, 1.267558555857357, 1.3641985205078329], [8, 10, 6], [10001, 1, 4], [20, 3, 21], [1.4196153211881317, 2.4, 1.8617258937082115], [3.4498437377515523, 3.5, 3.5], [3.2842576395462033, 3.2842576395462033, 3.2842576395462033], [10, 20, 19], [1.3985411647382533, 1.3985411647382533, 1.3985411647382533], [3, 15, 11], [17, 10, 22], [7, 2, 19], [10000, 3, 17], [4, 3, 9999], [3, 18, 4], [5.121265754105029, 1.5, 1.8000031892339765], [1.200314718419552, 1.200314718419552, 1.5], [1, 1, 2], [10, 20, 30], [2, 3, 6], [0.5, 0.5, 0.5], [0.1, 0.2, 0.3], [1000, 1000, 1], [10000000000.0, 10000000000.0, 10000000000.0], [10000000000.0, 10000000000.0, 20000000000.0], [3, 19, 20], [10000, 1, 1], [2.5775891893369485, 2.4, 3.7], [19, 20, 19], [1.5, 1.5, 3.7], [10, 10, 3], [1.5, 0.8664110443033755, 3.7], [2.5775891893369485, 2.5775891893369485, 2.5775891893369485], [3, 2, 1], [2, 3, 5], [4, 12, 3], [3, 3, 2], [7, 3, 5], [11, 6, 11], [10000, 19, 10000], [20, 19, 20], [11, 9, 9], [9, 3, 5], [1.5, 0.503082583107345, 3.7], [2, 5, 12], [11, 19, 11], [11, 12, 4], [1.5, 3.3689705322719385, 3.8779389440890846], [3.7, 0.503082583107345, 1.5], [19, 21, 19], [3, 3, 9], [2.5775891893369485, 0.503082583107345, 3.4328160926834466], [2, 3, 1], [1.5, 2.5775891893369485, 2.5775891893369485], [1.5, 0.8664110443033755, 2.5], [11, 18, 11], [3, 1, 2], [18, 19, 10000], [2.5775891893369485, 3.7, 2.5775891893369485], [1.5, 1.9960886727799532, 1.9443319502273428], [20, 2, 4], [3.4328160926834466, 1.5, 1.5], [1.5, 0.8664110443033755, 1.9938336153289764], [2, 1, 1], [3, 3, 12], [4, 9, 3], [3.3689705322719385, 0.503082583107345, 3.5], [4, 3, 12], [11, 20, 11], [3, 21, 20], [3.5058221358099715, 1.9960886727799532, 2.5775891893369485], [6, 5, 2], [3.4328160926834466, 3.6335822420870274, 4.207085238320968], [4.207085238320968, 0.503082583107345, 3.4328160926834466], [1, 2, 5], [9, 9, 3], [1.9960886727799532, 0.8664110443033755, 3.7], [2.5775891893369485, 3.5, 2.5775891893369485], [1.9960886727799532, 4.207085238320968, 3.4328160926834466], [1, 9, 3], [19, 10000, 19], [9, 3, 9], [1.5, 3.5, 4.360176141608689], [10, 3, 3], [19, 9, 4], [3.246902781268715, 4.207085238320968, 3.4328160926834466], [1.7553134534575479, 2.5, 1.7553134534575479], [4.207085238320968, 2.5775891893369485, 1.9960886727799532], [1.9960886727799532, 1.5, 1.9443319502273428], [3, 21, 9], [0.503082583107345, 0.8664110443033755, 1.9938336153289764], [1, 1, 1], [1, 6, 1], [6, 11, 6], [3.5058221358099715, 0.5309244958084296, 2.5], [10, 9, 6], [2, 10, 5], [7, 1, 1], [2, 5, 11], [3.7, 3.6335822420870274, 4.207085238320968], [3, 2, 2], [1.5, 1.9960886727799532, 4.917579198095192], [18, 1, 2], [3.3689705322719385, 3.246902781268715, 3.246902781268715], [10, 5, 2], [3, 21, 19], [6, 9, 20], [8, 5, 3], [1.5, 1.5, 3.4328160926834466], [6, 4, 19], [4, 4, 12], [2, 4, 3], [0.5373016430540158, 0.789022824347914, 1.5], [10001, 9, 3], [1, 1, 10], [1.0689146796445856, 1.9960886727799532, 4.917579198095192], [10, 11, 20], [10, 7, 10001], [1.9960886727799532, 1.5, 3.7], [11, 7, 11], [0.789022824347914, 4.163437455766259, 4.163437455766259], [4, 7, 11], [2.1577955006176532, 2.5775891893369485, 0.5309244958084296], [4.207085238320968, 0.789022824347914, 1.9960886727799532], [10, 3, 6], [1, 6, 10000], [1, 4, 3], [3.3689705322719385, 1.060745627088426, 3.5058221358099715], [1.5, 2.32075270734248, 1.5], [9, 9, 10], [6, 1, 1], [1.7804616625202718, 3.6335822420870274, 4.207085238320968], [20, 3, 19], [1.0689146796445856, 2.3063784440650927, 4.917579198095192], [0.5373016430540158, 1.9960886727799532, 4.917579198095192], [1.060745627088426, 0.503082583107345, 3.4328160926834466], [9, 4, 9], [3.367869620967685, 2.5775891893369485, 3.5], [1.2532845399179122, 2.32075270734248, 1.5], [2.5775891893369485, 0.5309244958084296, 3.4328160926834466], [2.5775891893369485, 0.503082583107345, 3.784199020712859], [4.207085238320968, 0.503082583107345, 4.207085238320968], [10, 10, 8], [19, 2, 4], [2.5775891893369485, 3.5, 3.5], [1.5, 2.4, 3.459071983029828], [3.4328160926834466, 2.32075270734248, 1.9960886727799532], [3.4328160926834466, 2.5, 1.7553134534575479], [7, 5, 6], [3, 10, 9], [2.201886913968485, 3.5, 3.4328160926834466], [11, 2, 11], [1.060745627088426, 4.360176141608689, 3.6335822420870274], [9, 20, 20], [7, 5, 12], [10, 9, 9], [20, 7, 4], [9, 5, 9], [9, 3, 6], [6, 20, 6], [20, 19, 19], [5, 5, 6], [8, 3, 9], [3, 10, 3], [2, 6, 5], [3, 3, 21], [0.789022824347914, 2.628975182302735, 4.163437455766259], [6, 11, 11], [2.1746667368809547, 0.8664110443033755, 3.7], [1, 19, 20], [3, 12, 4], [2, 2, 19], [4, 9999, 2], [9, 5, 5], [1, 11, 1], [10000, 4, 4], [4.163437455766259, 6.208338272407481, 1.9960886727799532], [2.5775891893369485, 3.5740269495384656, 3.5], [1.5, 2.367970294271218, 3.7], [3.4328160926834466, 4.207085238320968, 4.207085238320968], [9, 5, 3], [4.207085238320968, 4.64480014813984, 4.207085238320968], [1, 7, 2], [4.917579198095192, 1.5, 0.3411767253815125], [2, 11, 11], [2, 1, 19], [7, 8, 10000], [10, 20, 10], [9, 10000, 10], [4, 9999, 4], [1.9960886727799532, 1.5, 1.6321291998415466], [3.5740269495384656, 3.367869620967685, 3.5], [3.246902781268715, 3.246902781268715, 4.207085238320968], [9, 4, 12], [2.5775891893369485, 2.4, 2.8915419464931533], [18, 10001, 5], [1.5, 1.957944137251767, 1.5], [4, 4, 4], [12, 18, 11], [3, 3, 11], [2.7339212786584164, 4.917579198095192, 3.5], [20, 18, 20], [1, 9, 4], [11, 19, 10], [11, 9, 20], [6, 3, 6], [4, 4, 21], [2.32075270734248, 1.8696675963417573, 1.8696675963417573], [9999, 7, 5], [1, 9, 1], [9999, 3, 12], [2.1746667368809547, 2.628975182302735, 1.5], [20, 7, 7], [10001, 2, 11], [20, 3, 1], [3.5058221358099715, 2.625974596400467, 1.2452726682226072], [12, 12, 4], [2.32075270734248, 1.8696675963417573, 2.32075270734248], [11, 3, 3], [10001, 4, 3], [7, 5, 2], [8, 6, 3], [2, 19, 1], [10001, 2, 10], [3.246902781268715, 4.207085238320968, 3.246902781268715], [9998, 9999, 3], [2.2381102658017995, 3.4328160926834466, 4.207085238320968], [4, 2, 5], [9, 21, 6], [9, 7, 10001], [9, 2, 9], [10, 4, 20], [2.7809171317859325, 2.8915419464931533, 2.8915419464931533], [11, 9998, 11], [11, 11, 11], [4, 9999, 5], [20, 11, 11], [3, 10001, 21], [3.4328160926834466, 2.1577955006176532, 3.030511801987072], [2.7809171317859325, 0.3411767253815125, 2.8915419464931533], [9, 8, 10001], [5, 11, 6], [21, 8, 21], [1.7804616625202718, 3.6335822420870274, 1.7804616625202718], [2.9484977977737055, 3.367869620967685, 3.5], [3, 1, 1], [18, 3, 20], [3, 10001, 10001], [10, 19, 9998], [2.3815043434381975, 1.970201770310558, 2.628975182302735], [18, 12, 1], [20, 9998, 21], [8, 1, 9], [2.7809171317859325, 2.001423133273598, 2.8915419464931533], [8, 9, 9998], [9, 10, 3], [11, 10, 9], [1, 1, 9], [3, 19, 11], [11, 1, 11], [10000, 11, 11], [3, 3, 8], [0.37177963614389875, 2.5775891893369485, 3.358804199499412], [9, 2, 20], [2.4, 1.7804616625202718, 2.4], [0.789022824347914, 1.482460007714667, 1.9960886727799532], [3, 21, 12], [7, 4, 9], [3.3689705322719385, 3.5, 3.5], [3.7, 3.5316349895705246, 4.207085238320968], [2.9484977977737055, 3.0318420283066305, 3.5661060159465414], [10, 5, 6], [5, 6, 19], [9999, 9998, 7], [2.325585792582476, 3.0318420283066305, 3.4328160926834466], [2.5775891893369485, 0.40279626268882396, 3.4328160926834466], [11, 12, 5], [2.32075270734248, 0.503082583107345, 3.784199020712859], [3.7160244561805635, 2.5775891893369485, 2.5775891893369485], [4, 19, 4], [11, 5, 12], [3.246902781268715, 3.246902781268715, 2.4579482734138156], [2.32075270734248, 1.1315109995443282, 1.1315109995443282], [7, 1, 7], [3.5058221358099715, 2.625974596400467, 3.7], [11, 9, 3], [11, 11, 3], [3.5740269495384656, 0.503082583107345, 3.5740269495384656], [3.3689705322719385, 0.503082583107345, 3.8341243975029715], [9, 4, 8], [9, 8, 19], [4, 2, 4], [0.3411767253815125, 2.5775891893369485, 3.5], [7, 11, 11], [0.503082583107345, 0.3411767253815125, 3.784199020712859], [3.4328160926834466, 3.316856186690004, 4.207085238320968], [9, 10, 8], [2.5775891893369485, 4.917579198095192, 3.5], [7, 10, 11], [11, 12, 11], [9, 9998, 10000], [10001, 3, 20], [5, 6, 4], [4, 10, 3], [1.8696675963417573, 1.482460007714667, 0.789022824347914], [2.678861990883893, 3.5058221358099715, 2.678861990883893], [3.5740269495384656, 2.8915419464931533, 3.5], [7, 8, 1], [6, 7, 7], [6, 7, 5], [5, 3, 4], [2.1577955006176532, 0.5309244958084296, 2.1577955006176532], [2, 19, 19], [11, 11, 8], [7, 6, 7], [11, 10, 10], [2.5775891893369485, 0.5309244958084296, 0.5309244958084296], [9998, 6, 20], [4.917579198095192, 3.5058221358099715, 2.678861990883893], [21, 6, 7], [1.2807265265156114, 1.9960886727799532, 1.957944137251767], [3.5118964806288524, 0.5309244958084296, 0.5309244958084296], [1.1315109995443282, 0.5067302806822526, 3.7], [18, 5, 4], [3.6736564663845668, 3.4328160926834466, 2.5], [1.5, 4.917579198095192, 4.917579198095192], [2.4579482734138156, 2.5775891893369485, 0.5309244958084296], [10, 11, 11], [1, 4, 1], [10000, 10000, 9999], [19, 21, 10000], [20, 6, 20], [10, 10, 5], [2.367970294271218, 3.6335822420870274, 4.207085238320968], [9, 9998, 9], [21, 10, 21], [7, 11, 7], [18, 20, 20], [1.5, 3.5259793391344623, 4.958203166262308], [10, 10, 11], [1.060745627088426, 0.503082583107345, 2.685971027356751], [10001, 5, 5], [3.4328160926834466, 3.023833703810185, 1.7553134534575479], [19, 11, 11], [2.678861990883893, 1.482460007714667, 2.678861990883893], [2, 9, 5], [8, 4, 9], [9, 8, 21], [10, 3, 5], [5, 7, 5], [2.8915419464931533, 3.8444967857751786, 2.7809171317859325], [11, 9, 8], [9999, 18, 2], [10, 6, 6], [2, 10002, 10001], [1.8173129323162371, 2.5775891893369485, 3.4328160926834466], [9999, 6, 12], [1.5, 4.360176141608689, 2.5775891893369485], [3.5058221358099715, 3.4328160926834466, 0.503082583107345], [21, 19, 20], [2.2381102658017995, 2.620487660007657, 6.208338272407481], [2.592531646989002, 3.0318420283066305, 3.4328160926834466], [11, 11, 6], [21, 19, 10001], [0.52105239573242, 3.7, 3.7], [1.8495977887811454, 2.4, 2.7495530227213765], [4, 8, 4], [2, 3, 7], [9999, 2, 5], [2.3815043434381975, 3.7, 2.367970294271218], [3.7, 3.6335822420870274, 3.7], [10000, 9998, 7], [8, 3, 3], [3.784199020712859, 4.958203166262308, 3.784199020712859], [1.8696675963417573, 1.2807265265156114, 1.8696675963417573], [1, 9, 20], [20, 20, 20], [0.8317897724869179, 3.3689705322719385, 3.8779389440890846], [0.5309244958084296, 3.529512511196066, 1.9960886727799532], [3.4328160926834466, 4.705954992842067, 1.5], [3, 2, 8], [11, 19, 19], [6, 19, 19], [20, 21, 10], [1.2807265265156114, 3.5058221358099715, 3.5058221358099715], [3.1220118375734565, 4.64480014813984, 4.64480014813984], [1.475401013148001, 2.3136608539481305, 4.360176141608689], [21, 3, 1], [7, 3, 7], [8, 2, 9999], [1.9960886727799532, 2.5775891893369485, 2.5775891893369485], [3, 6, 5], [4, 9, 8], [10001, 19, 10001], [0.789022824347914, 2.7819271644061514, 1.9960886727799532], [20, 2, 20], [7, 1, 10002], [9998, 21, 21], [4.899278040010196, 4.958203166262308, 3.784199020712859], [2.5775891893369485, 1.2734979643607847, 2.377135444015496], [0.3411767253815125, 4.163437455766259, 6.208338272407481], [2.1746667368809547, 0.8664110443033755, 0.8664110443033755], [4, 1, 5], [3.5058221358099715, 2.625974596400467, 1.4996802745331441], [3.6335822420870274, 1.4996802745331441, 4.207085238320968], [19, 9999, 13], [2.678861990883893, 2.678861990883893, 1.482460007714667], [6, 18, 11], [10000, 3, 7], [4, 3, 10002], [11, 10, 8], [4.207085238320968, 0.503082583107345, 2.678861990883893], [4.782093300355605, 4.018999343642049, 2.8915419464931533], [4, 11, 8], [10001, 10002, 5], [3, 11, 11]], "completion": "\nimport math\n\ndef triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''\n if a + b > c and b + c > a and c + a > b:\n s = (a + b + c) / 2\n area = math.sqrt(s * (s - a) * (s - b) * (s - c))\n return round(area, 2)\n else:\n return -1\n", "raw_completion": "```python\nimport math\n\ndef triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''\n if a + b > c and b + c > a and c + a > b:\n s = (a + b + c) / 2\n area = math.sqrt(s * (s - a) * (s - b) * (s - c))\n return round(area, 2)\n else:\n return -1\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef triangle_area(a, b, c):\n '''\n Given the lengths of the three sides of a triangle. Return the area of\n the triangle rounded to 2 decimal points if the three sides form a valid triangle. \n Otherwise return -1\n Three sides make a valid triangle when the sum of any two sides is greater \n than the third side.\n Example:\n triangle_area(3, 4, 5) == 6.00\n triangle_area(1, 2, 10) == -1\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/72", "prompt": "\ndef will_it_fly(q,w):\n '''\n Write a function that returns True if the object q will fly, and False otherwise.\n The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.\n\n Example:\n will_it_fly([1, 2], 5) \u279e False \n # 1+2 is less than the maximum possible weight, but it's unbalanced.\n\n will_it_fly([3, 2, 3], 1) \u279e False\n # it's balanced, but 3+2+3 is more than the maximum possible weight.\n\n will_it_fly([3, 2, 3], 9) \u279e True\n # 3+2+3 is less than the maximum possible weight, and it's balanced.\n\n will_it_fly([3], 5) \u279e True\n # 3 is less than the maximum possible weight, and it's balanced.\n '''\n", "entry_point": "will_it_fly", "canonical_solution": "\n return q == q[::-1] and sum(q) <= w\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate([3, 2, 3], 9) is True\n assert candidate([1, 2], 5) is False\n assert candidate([3], 5) is True\n assert candidate([3, 2, 3], 1) is False\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1, 2, 3], 6) is False\n assert candidate([5], 5) is True\n\n", "contract": "\n assert type(q) == list and all(type(x) in [int, float] for x in q), \"invalid inputs\" # $_CONTRACT_$\n assert type(w) in [int, float], \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[3, 2, 3], 9], [[1, 2], 5], [[3], 5], [[3, 2, 3], 1], [[1, 2, 3], 6], [[5], 5]], "atol": 0, "plus_input": [[[0], 0], [[1, 2, 1], 4], [[2, 3, 2], 7], [[1], 0], [[4, 2, 1, 2, 4], 13], [[4, 2, 1, 2, 4], 12], [[1, 2, 3, 2, 1], 7], [[1, 2, 3], 10], [[1, 2, 3, 2, 1], 10], [[1, 1, 1, 1, 1, 1, 1], 7], [[4, 2, 1, 2, 4, 4], 14], [[1, 0], 0], [[1, 2, 3], 0], [[1, 1, 0], 0], [[7, 2, 3], 0], [[1, 1], 0], [[1, 1], 3], [[1, 0], 7], [[1, 10, 1], 4], [[4, 1, 2, 3], 10], [[4, 2, 1, 2, 4, 4], 7], [[1], 12], [[2, 3, 2], 6], [[0, 1, 1], 3], [[3, 2, 1, 2, 4], 13], [[1], 13], [[1, 10, 1], 5], [[6], 0], [[1, 13, 1, 0], 6], [[1, 2, 3], 1], [[1, 1, 1, 1, 1, 1, 1, 1], 7], [[1, 2, 3, 2, 1], 5], [[1, 2, 1], 3], [[1, 1, 0, 1], 0], [[1, 1, 1, 1, 1, 1], 8], [[], 0], [[1, 2, 13], 0], [[1, 2, 1], 13], [[2, 2], 12], [[1, 2, 3, 2, 1], 4], [[2, 1, 2, 4, 4], 7], [[3, 2, 1, 2, 4], 3], [[3, 2, 1, 2, 4], 7], [[-15, 13, 83, 8], 0], [[1, 1, 1, 1, 1, 1, 1, 2, 1], 7], [[4, 2, 1, 2, 8, 4], 14], [[1], -1], [[1, 2, 13], 83], [[1, -1, 0], 0], [[14, 1], 83], [[1, 2, 3, 1], 1], [[1, 2, 13, 1], 1], [[3, 1, 2, 1, 2, 4], 3], [[4, 2, 1, 2, 8, 4, 1], 14], [[4, 1, 2, 3], 6], [[1, 2, 1], 8], [[2, 3], 0], [[4, 13, 1, 0], 6], [[1, 1], -1], [[], 2], [[2, 2], 2], [[3], -1], [[13, 83, 8], 0], [[2, 2, 2], 12], [[1, 13, 1, 0], 5], [[2], 13], [[1, 1, 1, 1, 1, 1], 7], [[0], 1], [[13, 2, 1], 3], [[1, 10, 1, 1], 4], [[48.77540799744989, -3.8838243003108204, -48.319352731351685], 2], [[2, 3, 2], -1], [[4, 1, 2, 8, 4], 13], [[13, 1], 2], [[48.77540799744989, -48.319352731351685, -3.8838243003108204, -48.319352731351685], 2], [[1, 2, 3], 5], [[1, 1, 0, 0], -15], [[1], 14], [[4, 1, 2, 3], 0], [[1, 10, 1, 1], 83], [[1, 2, 3, 2, 1], 8], [[12, 13, 83, 8], 0], [[7, 2, 2], 12], [[4, 2, 1, 2, 4, 4], 2], [[2, 3, 2], 1], [[3, 1, 2, 1, 2, 4, 2], 3], [[1, 2, 1, 1], 8], [[13, 83, 8], 1], [[4, 1, 13, 1, 0], 6], [[3], 14], [[1, 2, 13, 13], 12], [[14, 1], 82], [[6], -15], [[1, 13, 1, 0], 8], [[1, 1, 1, 1, 1, 1, 1, 1, 1], 7], [[1, 0], -1], [[7, 2], 12], [[4, 1, 2, 3], 1], [[2, 3, 2], -2], [[1, 1, 1, 1, 1], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 20], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 3, 5, 7, 9, 7, 5, 3, 1], 30], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 20], 20], [[1, 2, 3, 4], 5], [[1, 2, 3, 2, 1, 0], 7], [[1, 2, 3, 4, 5, 6], 6], [[1, 2, 3, 2, 1], 6], [[7], 7], [[1, 2, 3, 2, 1, 0, 1], 7], [[2, 4, 6, 8, 10, 12, 14, 17, 18, 20, 12], 3], [[1, 2, 3, 1, 2, 1, 0, 1], 7], [[1, 2, 3, 2, 1, 0, 1], 8], [[1, 2, 3, 2, 1, 0, 1], 4], [[1, 2, 3, 2, 1, 0, 1, 1], 8], [[1, 2, 3, 4, 5, 6], 1], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 6, 1], 14], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 20], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 6, 1, 2], 14], [[1, 2, 3, 2, 1, 2, 2], 6], [[1, 3, 2, 1, 0], 8], [[1, 2, 2, 1, 0], 7], [[1, 3, 5, 7, 9, 7, 5, 3, 1], 1], [[2, 2, 1], 7], [[1, 5, 2, 3, 4, 5, 6], 1], [[1, 4, 2, 3, 2, 1, 1], 8], [[1, 3, 2, 1, 0, 1], 8], [[1, 4, 3, 3, 2, 1, 1], 8], [[14, 2, 3, 4, 5], 6], [[1, 2, 3, 4, 5, 6], 5], [[1, 3, 1, 5, 7, 9, 7, 5, 3, 1, 5], 8], [[1, 2, 3, 2, 1, 0, 2], 7], [[0, 2, 3, 2, 1, 0, 2], 7], [[1, 2, 3, 2, 1, 0, 1], 9], [[1, 2, 3, 2, 1, 0, 9, 1], 9], [[2, 4, 6, 8, 10, 12, 14, 17, 17, 20, 12], 3], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 21], [[1, 2, 1, 0], 8], [[14, 7], 8], [[1, 2, 3, 4, 5, 6], 4], [[4, 2, 3, 2, 1, 1], 8], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 2], 20], [[1, 3, 5, 7, 9, 7, 5, 3, 1], 5], [[1, 2, 3, 2, 1, 0, 1, 1], 7], [[1, 2, 3, 4, 5, 3], 6], [[1, 2, 3, 5, 6], 1], [[1, 4, 2, 5, 3, 2, 1, 1], 8], [[1, 2, 3, 2, 1, 0, 1, 0, 2, 2], 8], [[1, 3, 5, 7, 9, 7, 5, 3, 1, 5], 7], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 1], [[1, 2, 1, 0], 14], [[1, 2, 3, 2, 1, 0, 1, 1], 4], [[2, 4, 6, 8, 10, 12, 14, 17, 17, 20, 12], 4], [[1, 2, 4, 1, 0], 14], [[2, 2, 1, 0], 21], [[2, 2, 1, 4], 21], [[1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 1], [[1, 2, 3, 4, 5, 6], 10], [[1, 7, 2, 3, 4, 5, 6], 6], [[1, 2, 3, 1, 2, 1, 0, 1], 10], [[1, 2, 3, 2, 1, 0, 9, 1], 0], [[2, 3, 2, 1], 8], [[30, 14, 2, 3, 4, 4, 5], 5], [[7, 7], 7], [[4, 2, 3, 2, 1, 1, 1], 0], [[2, 2, 18, 0], 30], [[1, 2, 3, 2, 1, 0, 9, 1, 1], 9], [[1, 4, 2, 5, 1, 3, 2, 1, 1], 8], [[2, 4, 6, 8, 10, 12, 16, 18, 20], 20], [[1, 3, 2, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 2], 20], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 17], [[2, 4, 6, 8, 10, 12, 13, 17, 17, 20, 12], 4], [[1, 4, 2, 5, 1, 14, 3, 2, 1, 1], 8], [[1, 2, 2, 1], 8], [[1, 3, 2, 1, 0], 7], [[1, 7, 2, 3, 4, 5, 6], 5], [[1, 2, 5, 3, 4, 5, 6], 4], [[2, 2, 18, 0], 31], [[1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 3, 2, 16], 20], [[0, 1, 4, 2, 5, 1, 3, 2, 1, 1], 8], [[1, 2, 3, 4, 5, 6], 3], [[1, 2, 3, 2, 1, 0, 1, 1, 1], 4], [[2, 4, 6, 8, 10, 12, 16, 18, 20], 21], [[1, 2, 3, 2, 1, 0, 1, 1], 9], [[1, 1, 2, 3, 5, 6], 0], [[14, 2, 3, 4, 5, 5], 6], [[1, 2, 5, 3, 4, 5, 6], 6], [[0, 1, 2, 5, 1, 3, 2, 1, 1], 8], [[2, 3, 1, 2, 1, 0, 1], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 3, 2, 3, 2, 1, 7, 2, 2], 20], [[2, 1, 2, 3, 2, 1], 7], [[1, 4, 3, 3, 2, 1, 1, 1], 21], [[1, 2, 3, 2, 1, 0, 1, 0, 2, 2], 14], [[1, 2, 5, 3, 4, 5, 6, 5], 6], [[1, 2, 3, 7, 2, 1, 0, 1], 7], [[1, 2, 3, 1, 0, 1, 1], 1], [[3, 3, 3, 2, 1, 0, 1], 7], [[1, 4, 3, 3, 2, 1, 1], 9], [[1, 4, 2, 3, 2, 1, 1, 1], 8], [[1, 3, 2, 1, 0, 2], 8], [[1, 2, 30, 3, 2, 1, 0, 2], 7], [[14, 2, 3, 4, 5, 5], 7], [[1, 2, 3, 2, 1, 0, 12, 1, 1], 8], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 16], [[1, 2, 3, 4, 5, 6, 6], 7], [[2, 6, 8, 10, 16, 18, 31, 20], 20], [[1, 2, 3, 1, 2, 1, 0, 1], 30], [[1, 2, 3, 2, 1, 0, 1, 1], 31], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 19], [[1, 2, 3, 2, 1, 0, 1, 1, 1], 9], [[1, 4, 3, 3, 12, 1, 1, 1, 1], 7], [[0, 1, 2, 5, 1, 31, 3, 2, 1], 8], [[1, 2, 3, 2, 1, 0, 1], 31], [[1, 2, 2, 2, 1, 0, 2], 9], [[1, 2, 3, 2, 1, 0, 1], 14], [[1, 2, 4, 1, 0], 2], [[1, 2, 2, 1], 7], [[30, 14, 2, 4, 4, 5], 10], [[14, 2, 3, 4, 5, 3], 6], [[1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 3, 2, 16], 1], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 3, 5, 7, 9, 7, 3, 1, 5], 7], [[1, 30, 3, 1, 5, 7, 9, 7, 5, 3, 1, 5], 8], [[1, 2, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 21], [[2, 2, 1, 0], 20], [[1, 2, 3, 6, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 2], 20], [[2, 4, 6, 8, 10, 12, 14, 17, 18, 20, 12, 6], 3], [[1, 2, 3, 7, 2, 1, 0, 1], 6], [[1, 2, 3, 2, 1, 0, 1], 30], [[1, 2, 4, 5, 0], 14], [[1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 1], [[1, 2, 3, 2, 1, 0, 1], 12], [[2, 4, 6, 8, 10, 12, 16, 18, 20], 13], [[1, 4, 2, 3, 2, 1, 1, 1], 9], [[1, 2, 3, 2, 1, 0, 9, 1], 30], [[1, 4, 31, 3, 3, 2, 2, 1, 1, 1], 21], [[1, 5, 7, 9, 7, 5, 3, 1, 5], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 21], [[1, 2, 5, 3, 4, 5, 6, 5, 5], 6], [[7, 2, 4, 5, 5], 6], [[1, 4, 2, 3, 2, 0, 1], 8], [[1, 4, 2, 5, 3, 2, 1], 8], [[2, 2, 1, 0, 2], 17], [[2, 4, 6, 8, 10, 14, 17, 17, 20, 12], 4], [[1, 2, 3, 2, 1, 0, 1, 1, 1], 1], [[2, 4, 6, 8, 10, 12, 14, 11, 17, 17, 20, 12], 3], [[0, 1, 4, 2, 5, 1, 3, 2, 1, 1], 10], [[1, 5, 7, 9, 7, 5, 1, 5], 8], [[0, 2, 3, 2, 1, 0, 1, 1, 1], 31], [[2, 4, 6, 8, 10, 12, 14, 17, 17, 20, 12], 11], [[1, 5, 2, 3, 4, 5, 6], 2], [[2, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 17], [[1, 2, 11, 4, 5, 6], 4], [[1, 4, 2, 5, 3, 2, 1, 1], 21], [[], 6], [[1, 3, 5, 7, 4, 9, 7, 5, 3, 1], -1], [[14, 2, 3, 4, 5, 3], 5], [[1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 2], [[14, 2, 3, 4, 5, 18, 3], 6], [[1, 10, 3, 1, 2, 1, 0, 1], 30], [[30, 14, 4, 4, 5], 10], [[1, 3, 1, 0], 7], [[1, 2, 2, 1, 0], 6], [[1, 30, 3, 5, 7, 9, 7, 5, 3, 1, 5], 8], [[1, 5, 7, 10, 7, 5, 3, 1, 5], 7], [[1, 2, 3, 4, 5, 6], 9], [[1, 2, 1, 0], 6], [[1, 3, 18, 4, 1, 0], -1], [[2, 2, 18, 0], 13], [[1, 4, 2, 5, 3, 2, 1, 1], 9], [[1, 4, 31, 3, 3, 2, 2, 1, 1, 1], 9], [[1, 2, 3, 2, 1, 1, 0, 1, 1], 31], [[1, 2, 2, 3, 4, 5, 6], 5], [[1, 2, 4, 3, 4, 5, 7], 7], [[1, 2, 5, 3, 4, 5, 6], 1], [[2, 3, 2, 1, 0, 1], 9], [[2, 4, 6, 8, 10, 14, 17, 17, 20, 12, 10], 4], [[30, 14, 4, 4], 10], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 3], 20], [[2, 4, 6, 8, 10, 12, 13, 17, 17, 20, 12], 2], [[1, 2, 3, 2, 1, 0, 1], 42], [[2, 4, 8, 10, 12, 14, 16, 18, 21], 20], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 22], [[1, 2, 11, 4, 5, 6], 10], [[1, 2, 3, 2, 1, 0, 1, 21, 3], 2], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 13], [[1, 2, -1, 4, 5, 0], 13], [[1, 4, 3, 4, 5, 6], 6], [[1, 2, 31, 1, -1, 0], 6], [[1, 2, 3, 8, 2, 1, 0, 1], 7], [[14, 2, 4, 5, 3], 6], [[2, 2, 1, 4], 12], [[2, 2, 1], 8], [[1, 2, 3, 1, 2, 1, 0, 1, 2], 30], [[1, 4, 3, 3, 2, 1, 1, 1], 8], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 19], [[2, 1, 0], 22], [[2, 4, 6, 8, 10, 12, 13, 17, 17, 20, 12], 30], [[1, 2, 4, 5, 6], 6], [[1, 4, 3, 3, 2, 1, 1, 4], 2], [[1, 2, 3, 2, 1, 2, 3, 2, 30, 1, 3, 2, 3, 2, 1, 7, 2, 2], 19], [[1, 2, 1, 0, 0], 14], [[1, 2, 5, 3, 4, 5, 6], 20], [[4, 2, 3, 2, 0], 8], [[1, 3, 5, 7, 4, 9, 7, 5, 1], -1], [[30, 14, 2, 4, 5], 10], [[1, 4, 2, 3, 2, 0, 1], 0], [[1, 2, 5, 3, 4, 4, 6, 5], 6], [[0, 1, 9, 2, 5, 1, 3, 2, 1, 1], 8], [[1, 2, 2, 1, 2, 3, 2, 2, 2, 3, 2, 2, 2], 17], [[30, 14, 2, 3, 4, 4, 5], 6], [[2, 4, 11, 6, 8, 10, 12, 14, 17, 18, 20, 12, 6], 3], [[1, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 21], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 22], [[2, 3, 2, 1], 7], [[1, 4, 3, 3, 1, 1, 1, 1], 21], [[0, 5, 1, 2, 0, 4, 5, 6], 5], [[1, 5, 3, 5, 6, 5], 6], [[1, 2, 1], 14], [[1, 2, 3, 4], 21], [[4, 2, 3, 2, 0, 2], 8], [[1, 3, 2, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 2], 6], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 3], 16], [[1, 2, 3, 2, 1, 0, 1, 1], 16], [[2, 4, 6, 8, 10, 12, 14, 11, 17, 17, 20, 12], 9], [[1, 2, 1, 3, 2, 1, 0], 7], [[1, 2, 3, 4, 6], 9], [[0, 1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 3, 2, 16], 1], [[1, 1, 2, 3, 1, 0, 1, 1], 1], [[1, 2, 2, 1, 0, 1], 7], [[1, 2, 3, 1, 2, 1, 0, 1, 2], 7], [[1, 2, 9, 3, 2, 1, 0, 9, 1], 22], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 30], [[1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 2, 2, 3], 1], [[1, 3, 2, 1, 2, 2], 6], [[1, 3, -1, 4, 5, 0], 13], [[1, 4, 3, 3, 2, 1, 1], 7], [[14, 2, 4, 5, 3, 3], 6], [[14, 2, 3, 4, 5, 3], 16], [[1, 2, 3, 2, 1, 0, 1, 1, 1], 31], [[2, 2, 1, 4], 6], [[7], 6], [[2, 3, 2, 1], 0], [[1, 2, 3, 21, 5, 6, 4], 14], [[2, 4, 6, 8, 10, 14, 17, 17, 20, 12, 8], 10], [[1, 2, 4, 1, 0, 4], 14], [[1, 2, 3, 2, 1, 2], 6], [[1, 2, 4, 5, 0], 15], [[1, 2, 3, -1, 2, 1, 2, 0, 1], 4], [[1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 3, 1, 16], 31], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 20, 2, 3, 2, 2, 3, 3], 16], [[1, 4, 3, 3, 12, 1, 1, 1, 1], 6], [[1, 2, 3, 2, 1, 2, 3, 2, 30, 1, 3, 2, 3, 4, 2, 1, 7, 2, 2], 19], [[7], 8], [[1, 2, 2, 3, 2, 1, 0], 7], [[0, 1, 2, 5, 1, 31, 3, 2, 1], 13], [[0, 1, 15, 5, 1, 3, 2, 1, 1], 8], [[6, 8, 10, 16, 19, 31, 20], 20], [[1, 2, 3, 2, 1, 0, 14], 16], [[1, 2, 5, 3, 4, 4, 6, 5, 3], 6], [[1, 2, 3, 1, 2, 1, 0], 9], [[1, 2, 42, 3, 4], 5], [[1, 3, 2, 1, 1, 2], 6], [[2, 3, 2, 1, 0], 21], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 22], 19], [[1, 2, 3, 2, 1, 0, 1, 1, 2, 1], 15], [[1, 6, 3, 5, 7, 9, 7, 5, 3, 1], 17], [[1, 4, 3, 4, 5, 6], 13], [[1, 1, 2, 1, 2, 3, 2, 1, 2, 2, 2, 3], 15], [[30, 14, 4, 4, 4], 10], [[2, 4, 6, 8, 10, 12, 13, 17, 17, 20, 12, 12], 4], [[6, 8, 10, 16, 19, 31, 20, 20], 42], [[2, 4, 6, 8, 10, 12, 14, 7, 17, 18, 20, 12, 6], 3], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 3, 3], 20], [[2, 2, 1, 1, 0], 20], [[14, 2, 3, 4, 5, 3], 4], [[1, 4, 3, 3, 2, 1, 1], 10], [[4, 2, 3, 2, 0, 2, 2], 8], [[1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 2, 2, 3], 1], [[2, 3, 1, 4, 5, 6], 0], [[1, 2, 1, 1, 2], 6], [[1, 2, 2, 3, 1, 0], 7], [[1, 2, 3, 2, 1, 0, 1, 1, 1], 19], [[1, 7, 2, 3, 4, 5, 6], 16], [[1, 5, 7, 21, 7, 5, 1, 5], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 11, 2, 3, 2, 1, 7, 2, 2], 20], [[1, 2, 3, 2, 1, 0, 9, 1], 22], [[30, 14, 4, 4, 4, 4], 16], [[2, 2, 1, 0, 2, 2], 0], [[1, 5, 7, 9, 7, 5, 3, 1, 5, 5], 7], [[1, 3, 2, 2, 1, 1, 2, 1], 6], [[10, 2, 2, 1, 0, 2], 17], [[1, 3, 5, 7, 9, 7, 5, 3, 1, 7], 30], [[1, 1, 7, 2, 3, 4, 5, 6], 4], [[13, 2, 3, 4, 5, 3], 4], [[1, 3, 2, 2, 1, 1, 2, 1, 1], 6], [[1, 31, 1, 2, 3, 1, 0, 1, 1], 1], [[1, 2, 3, 2, 1, 2, 3, 2, 30, 1, 3, 2, 3, 2, 1, 7, 3, 2], 19], [[1, 2, 3, 1, 2, 1, 2, 3, 2, 2, 1, 2, 3, 2, 2], 20], [[3, 3, 2, 1, 1, 1], 21], [[1, 2, 30, 3, 1, 0, 1, 1, 1], 2], [[2, 2, 18, 0], 29], [[1, 2, 2, 3, 4, 5, 6, 2], 5], [[1, 2, 2, 3, 2, 1, 2, 3, 1, 2, 3, 2, 1], 21], [[1, 10, 31, 3, 1, 2, 1, 0, 1], 30], [[7, 1, 2, 1, 0, 0], 14], [[2, 1, 2, 3, -1, 2, 1, 2, 0, 1], 4], [[2, 3, 1, 4, 5, 6], -1], [[1, 2, 3, 2, 1, 0, 1, 1, 0], 4], [[2, 3, 2, 1, 0, 1], 8], [[1, 2, 4, 5, 6], 9], [[1, 3, 2, 2, 1, 1, 2, 1, 1], 5], [[1, 7, 2, 3, 4, 5, 6], -1], [[1, 2, 3, 2, 1, 0, 9, 1, 3], 22], [[1, 3, 18, 16, 7, 0], -1], [[2, 2, 4], 6], [[1, 2, 15, 3, 2, 1, 0, 1], 7], [[1, 2, 3, 5, 6, 1], 20], [[2, 4, 6, 8, 17, 10, 12, 13, 17, 20, 12], 2], [[1, 4, 2, 5, 2, 1, 1], 9], [[1, 4, 2, 5, 1, 3, 3, 2, 1, 1], 8], [[2, 2, 4], -1], [[1, 29, 1, 2, 1, 0, 4, 1], 7], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 19], [[1, 2, 3, 5, 6], 5], [[1, 2, 3, 3, 1, 2, 3, 2, 2, 3, 2, 16], 20], [[1, 2, 3, 2, 2, 3, 2, 1, 2, 3, 2, 2, 2], 22], [[1, 3, 2, 1, 2, 3, 2, 1, 1, 2, 3, 2, 1, 2, 2], 7], [[1, 2, 3, 2, 20, 2, 3, 2, 1, 1, 3, 2, 3, 2, 1, 7, 2, 2], 20], [[1, 2, 3, 6, 2, 1, 1, 3, 2, 2, 3, 2, 2, 3, 2], 20], [[1, 3, 5, 7, 9, 7, 5, 3, 1, 3], 6], [[4, 2, 3, 1, 1, 1], 0], [[4, 2, 3, 2, 0, 2], 9], [[13, 3, 4, 5, 3, 3], 42], [[1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 2, 3], 1], [[1, 2, 3, 1, 2, 3, 2, 2, 3, 2, 16], 13], [[1, 2, 3, 2, 1, 3], 29], [[1, 2, 3, 2, 1, 0, 1], 5], [[2, 4, 6, 8, 10, 12, 13, 17, 20, 12], 2], [[1, 4, 2, 5, 3, 2, 1, 2], 20], [[1, 29, 1, 2, 1, 17, 4, 1], 7], [[1, 2, 1, 3, 2, 1, 0, 9, 1], 30], [[1, 4, 2, 5, 1, 3, 3, 2, 1], 8], [[2, 2, 1, 0, 2, 2], 30], [[1, 2, 3, 2, 1, 0, 1, 0, 2, 2], 20], [[1, 2, 3, 1, 2, 1, 16, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 2, 4, 2, 3, 2, 0, 1], 0], [[1, 31, 1, 2, 3, 1, 1, 1], 1], [[3, 3, 2, 1, 1, 1, 1], 10], [[1, 4, 3, 3, 2, 1, 1, 4], 31], [[1, 4, 2, 3, 2, 0, 1, 2], 8], [[3, 3, 3, 2, 1, 0, 7], 7], [[30, 14, 4, 4, 4, 4], 6], [[1, 4, 3, 4, 5, 6], 8], [[1, 2, 4, 5, 6], 4], [[2, 4, 6, 8, 10, 12, 14, 11, 17, 17, 20, 12], 22], [[1, 2, 3, 2, 1, 1, 0, 9, 1], 31], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 21], [[1, 2, 3, 3, 1, 1, 2, 3, 2, 1, 2, 3, 2, 16], 20], [[6, 8, 10, 19, 3, 31, 20], 20], [[6, 16, 8, 10, 19, 3, 31, 20], 20], [[1, 2, 1, 1, 3, 2, 1, 0], 7], [[1, 0, 2, 5, 3, 4, 5, 6], 20], [[1, 3, 2, 2, 1, 1, 2, 1, 1, 1], 5], [[17, 3, 1, 4, 5, 6], -1], [[1, 5, 7, 9, 7, 5, 1, 5], 16], [[1, 30, 5, 7, 9, 7, 5, 3, 1, 5], 29], [[13, 3, 4, 5, 3], 13], [[2, 5, 2, 1], 4], [[2, 4, 6, 8, 10, 12, 14, 17, 18, 20, 12], 4], [[1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 2, 2], 22], [[1, 7, 3, 5, 7, 9, 7, 5, 3, 1], 7], [[7, 2, 5, 5, 5], 6], [[1, 31, 3, 2, 1, 0, 1], 18], [[2, 4, 5, 8, 10, 12, 16, 18, 20], 13], [[7], 21], [[2, 2, 18, 0], 7], [[1, 5, 3, 6, 5, 1], 5], [[1, 3, 5, 7, 4, 9, 7, 5, 1], 42], [[1, 1, 2, 3, 5, 6, 3], 0], [[15, 3, -1, 4, 5, 0], 13], [[1, 2, 3, 2, 1, -1, 1], 7], [[1, 14, 3, 4, 1], 4], [[2, 5, 3, 4, 5, 6], 6], [[2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 2], 21], [[14, 3, 1, 0], 7], [[30, 14, 4, 5, 4], 10], [[0, 1, 15, 5, 1, 3, 2, 1, 0], 8], [[1, 3, 5, 7, 9, 7, 5, 3, 1], 29], [[1, 2, 2, 0, 1, 0], 6], [[2, 2, 18, 1, 0], 29], [[1, 2, 5, 3, 4, 5, 6, 5], 21], [[4, 2, 3, 2, 0, 2], 12], [[30, 2, 3, 4, 5, 3], 6], [[1, 4, 2, 5, 3, 2, 1, 1], 22], [[1, 2, 5, 6], 31], [[1, 2, 31, 1, 0], 16], [[1, 2, 2, 3, 1, 0], 8], [[1, 4, 2, 5, 3, 2, 1, 2, 2], 21], [[1, 2, 3, 1, 2, 13, 1, 0, 1], 30], [[1, 5, 7, 9, 7, 5, 3, 1, 5, 5, 1], 7], [[1, 2, 1, 1, 3, 2, 1, 0], 8], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 2, 1, 16], 31], [[30, 14, 4, 4, 5, 30], 10], [[3, 4, 16, 6, 10, 14, 17, 17, 20, 12], 4], [[1, 3, 2, 5, 7, 9, 7, 5, 3, 13, 1, 5], 9], [[1, 2, 5, 3, 4, 4, 6, 5, 3], 10], [[1, 2, 3, 5, 6, 5], 20], [[1, 5, 7, 9, 7, 5, 1, 5], 5], [[1, 5, 2, 4, 5, 6], 9], [[1, 2, 3, 1, 2, 3, 2, 2, 3, 2, 16], 4], [[1, 2, 3, 2, 1, 2, 3, 2, 30, 1, 3, 2, 3, 2, 1, 7, 3, 2], 18], [[1, 30, 3, 7, 9, 7, 5, 3, 1, 5], 8], [[4, 7, 3, 2, 1, 1, 1], 0], [[7, 1, 2, 1, 0, 0, 0], 30], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3], 1], [[2, 2, 1, 0, 2, 18], 0], [[1, 4, 2, 5, 3, 2, 1, 1], 15], [[1, 2, 3, 2, 1, -1], 8], [[7, 2, 5, 5, 5, 5], 1], [[1, 2, 2, 1, 3], 29], [[1, 4, 2, 1, 1, 3, 2, 1, 0], 4], [[1, 2, 2, 3, 2, 1, 2, 3, 2, 1, 2, 2, 1], 21], [[6, 8, 10, 16, 19, 31, 20], 15], [[1, 2, 3, 5, 6, 1], 19], [[1, 2, 3, 2, 1, 0, 1, 1], 17], [[2, 4, 5, 8, 10, 12, 16, 18, 20], 15], [[14, 2, 3, 4, 5, 5], 5], [[1, 2, 2, 3, 4, 5, 6, 2], 4], [[1, 2, 3, 2, 1, 0, 1, 1, 0, 1], 4], [[0, 1, 2, 5, 1, 31, 3, 2, 1, 31], 8], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 6, 1, 2, 2], 14], [[1, 2, 3, 6, 2, 1, 1, 3, 2, 2, 3, 2, 2, 3, 2], 4], [[1, 2, 2, 3, 2, 1, 2, 3, 2, 1, 2, 2, 1, 2], 14], [[1, 2, 15, 3, 2, 1, 0, 1], 8], [[1, 2, 3, 2, 1, 13, 1], 30], [[2, 3, 1, 4, 5, 6, 2], -1], [[1, 2, 4, 7, 0], 15], [[1, 4, 3, 3, 3, 2, 1, 1], 9], [[2, 2, 18, 19, 0], 42], [[1, 4, 2, 5, 2, 2, 1, 1], 15], [[1, 3, 18, 16, 7, 0, 16], 9], [[1, 2, 2, 1, 0, 1], 22], [[1, 30, 3, 7, 9, 7, 5, 3, 5], 8], [[1, 2, 3, 3, 1, 2, 3, 1, 2, 3, 2, 16], 1], [[1, 2, 5, 1, 3, 2, 1, 1], 3], [[1, 2, 2, 1, 0, 2], 7], [[1, 2, 2, 3, 1, 0], 18], [[2, 1, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], -1], [[2, 4, 8, 10, 12, 14, 16, 18, 21, 16], 20], [[14, 2, 4, 5, 5, 3], 3], [[4, 2, 3, 2, 1, 1, 1], 42], [[10, 2, 2, 1, 0, 2], 11], [[1, 4, 3, 3, 4, 29, 2, 1, 1], 9], [[4, 2, 3, 1, 1, 1], 12], [[1, 3, 5, 7, 9, 7, 5, 3, 1], 7], [[1, 2, 3, 2, 1, 2], 7], [[2, 6, 4, 6, 8, 10, 12, 16, 18, 20], 20], [[1, 2, 1, 1, 3, 2, 5, 1, 0], 7], [[1, 2, 5, 3, 4, 5, 6, -1], 6], [[14, 2, 3, 4, 5, 3], 31], [[1, 15, 2, 11, 2, 1, -1], 20], [[1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 3, 1, 16, 3], 31], [[1, 4, 4, 4, 5, 6], 19], [[1, 7, 2, 3, 4, 5, 6], 22], [[20, 2, 4, 6, 8, 10, 12, 13, 17, 17, 20, 12, 2], 4], [[1, 2, 30, 2, 1, 0, 1, 0, 2, 2], 20], [[2, 2, 1, 1, 0], 19], [[2, 5, 6, 8, 10, 30, 14, 17, 17, 20, 12, 10], 4], [[2, 2, 0, 2, 18], 12], [[0, 1, 2, 5, 1, 31, 3, 2, 1, 31, 2], 8], [[1, 3, 7, 2, 0, 1], 7], [[1, 2, 3, 2, 1, 2, 2], 17], [[1, 2, 3, 1, 2, 1, 0], 19], [[1, 2, 3, 2, 1, 0, 1, 0, 1], 0], [[2, 6, 18, 8, 10, 16, 18, 31, 20], 20], [[1, 1, 2, 3, 2, 1, -1, 1], 9], [[1, 3, 5, 7, 4, 9, 7, 5, 3, 1, 1, 4], -1], [[7, 2, 4, 5, 5, 2], 16], [[4, 2, 3, 2, 0, 1, 2], 8], [[19, 4, 8, 10, 12, 14, 16, 18, 21, 16], 20], [[6, 3, 3, 2, 1, 0, 1], 7], [[30, 14, 15, 4, 4, 5], 10], [[1, 3, 5, 7, 9, 7, 5, 3, 1, 3, 5], 6], [[2, 4, 6, 8, 10, 12, 14, 17, 17, 20], 4], [[2, 4, 6, 8, 10, 12, 14, 17, 18, 12], 22], [[1, 2, 3, 2, 1, 0, 1, 1, 2, 1], 5], [[1, 31, 1, 2, 3, 1, 0, 1, 1, 2], 1], [[1, 3, 2, 1, 2, 2], 17], [[14, 2, 4, 5, 3, 3, 3], 6], [[1, 2, 3, 2, 1, 0, 9, 1], 1], [[1, 6, 2, 3, 4, 5, 6, 2], 4], [[1, 3, 2, 1, 1, 2], 7], [[4, 1, 3, 2, 1, 0], 8], [[3, 3, 3, 15, 1, 0, 1], 7], [[1, 2, 2, 3, 2, 1, 0], 9], [[1, 4, 2, 5, 3, 2, 1], 7], [[2, 4, 6, 8, 10, 12, 14, 11, 17, 17, 10, 20, 12], 22], [[7, 2, 5, 5, 5], 1], [[1, 2, 17, 1, 2, 1, 16, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 2, 3, 2, 1, 0, 1], 15], [[2, 5, 2, 1, 0, 2, 2, 2, 2], 0], [[0, 2, 2, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 2], 1], [[1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 9, 1, 16, 1], 31], [[1, 3, 18, 16, 7, 12, 16, 16], 9], [[1, 31, 1, 2, 3, 1, 1, 1], 0], [[], 10], [[], 8], [[3], 0], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10], 100], [[10], 5], [[], 1], [[2], 1], [[2], 3], [[2, 5, 2], 10], [[1, 2, 3, 4], 8], [[1, 3, 5, 4, 7, 9, 7, 5, 3, 1, 5], 6], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 2, 2], 19], [[1, 2, 3, 2, 1, 2, 3, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 2, 3, 2, 1, 0, 0, 0], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 18], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 19], [[1, 2, 3, 2, 1, 2, 3, 3, 2, 1, 2, 3, 2, 2], 0], [[1, 2, 3, 1], 5], [[1, 2, 3, 2, 1, 0], 8], [[1, 10, 2, 4, 3, 2, 1, 4], 7], [[1, 1, 2, 3], 1], [[4, 6, 8, 10, 12, 14, 16, 18, 20], 20], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 19], [[1, 2, 14, 4], 5], [[1, 2, 3, 2, 1, 2, 3, 3, 2, 1, 4, 3, 2, 2], 20], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2], 3], [[1, 2, 3, 4], 9], [[1, 2, 3, 2, 1, 14, 3, 2, 1, 2, 3, 2, 2], 20], [[1, 2, 4], 5], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 3, 2, 1], 20], [[1, 2, 3, 4, 4], 5], [[30, 2, 3, 4, 4], 5], [[1, 8, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1], 6], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 3, 2, 1], 19], [[2, 3, 2, 1, 0], 8], [[1, 2, 3, 2, 1, 2, 3, 3, 2, 1, 2, 3, 2, 2, 2], 0], [[2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 14], 20], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 1], 19], [[30, 2, 3, 4, 4], 12], [[1, 3, 5, 7, 4, 9, 7, 5, 3, 1], 30], [[4, 6, 8, 10, 12, 14, 16, 18, 20], 7], [[6, 1, 3, 5, 4, 7, 9, 7, 5, 3, 1, 5], 6], [[30, 3, 3, 4, 4], 12], [[1, 3], 5], [[1, 2, 3, 2, 1, 2, 18, 3, 2, 1, 4, 3, 2, 2], 20], [[30, 2, 3, 2, 4, 4], 5], [[8, 1, 3, 5, 7, 4, 9, 7, 5, 3, 1, 5], 30], [[30, 3, 3, 4, 4], 11], [[30, 2, 3, 2, 4, 4], 4], [[1, 8, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1], 12], [[1, 3, 5, 7, 4, 9, 7, 5, 3, 1, 5], 30], [[1, 3], 7], [[4, 6, 8, 10, 12, 14, 16, 18, 20], 5], [[30, 12, 2, 3, 2, 4, 4], 0], [[1, 2, 3, 4, 5, 6, 2], 6], [[1, 2, 3, 4, 5, 6], 7], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 2], 0], [[1, 2, 3, 2, 2, 1, 2, 3, 2, 1, 3, 2, 1, 2], 20], [[1, 1, 8, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1, 1], 19], [[4, 6, 8, 10, 12, 14, 18, 11], 5], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 1], 19], [[1, 3, 4, 5, 6, 2], 19], [[1, 2, 3, 2, 1, 18, 3, 3, 2, 1, 2, 3, 2, 2], 21], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 1, 3], 19], [[1, 5, 7, 9, 7, 5, 3, 1], 30], [[1, 2, 3, 2, 1, 2, 3, 3, 2, 1, 2, 4, 2, 2], -1], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 9], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 1], 31], [[1, 8, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1, 3], 6], [[1, 3, 4, 5, 6, 2], 20], [[30, 3, 3, 4, 4], 18], [[1, 8, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 7], [[1, 2, 2, 1, 2, 3, 2, 1, 2, 19, 2, 3], 3], [[1, 3], 4], [[1, 1, 8, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1], 6], [[4, 6, 8, 10, 12, 14, 16, 18, 20, 12], 19], [[1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 2, 2], 0], [[1, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1], 19], [[1, 2, 3, 2, 30], 14], [[1, 3, 4, 5, 6, 2], 21], [[1, 3, 5, 7, 4, 9, 7, 5, 3, 1, 5], 9], [[30, 2, 3, 2, 4, 4], 12], [[1, 14], 7], [[1, 2, 3, 2, 7, 2, 3, 2, 1, 2, 2, 2, 2], 12], [[1, 8, 2, 3, 2, 1, 3, 2, 2, 1, 2, 3, 2, 1], 12]], "completion": "\ndef will_it_fly(q,w):\n return q == q[::-1] and sum(q) <= w\n", "raw_completion": "```python\ndef will_it_fly(q,w):\n return q == q[::-1] and sum(q) <= w\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef will_it_fly(q,w):\n '''\n Write a function that returns True if the object q will fly, and False otherwise.\n The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.\n\n Example:\n will_it_fly([1, 2], 5) \u279e False \n # 1+2 is less than the maximum possible weight, but it's unbalanced.\n\n will_it_fly([3, 2, 3], 1) \u279e False\n # it's balanced, but 3+2+3 is more than the maximum possible weight.\n\n will_it_fly([3, 2, 3], 9) \u279e True\n # 3+2+3 is less than the maximum possible weight, and it's balanced.\n\n will_it_fly([3], 5) \u279e True\n # 3 is less than the maximum possible weight, and it's balanced.\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/73", "prompt": "\ndef smallest_change(arr):\n \"\"\"\n Given an array arr of integers, find the minimum number of elements that\n need to be changed to make the array palindromic. A palindromic array is an array that\n is read the same backwards and forwards. In one change, you can change one element to any other element.\n\n For example:\n smallest_change([1,2,3,5,4,7,9,6]) == 4\n smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\n smallest_change([1, 2, 3, 2, 1]) == 0\n \"\"\"\n", "entry_point": "smallest_change", "canonical_solution": "\n arr_reversed, cnt = arr[::-1], 0\n for i in range(len(arr) // 2):\n if arr[i] != arr_reversed[i]:\n cnt += 1\n return cnt\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate([1,2,3,5,4,7,9,6]) == 4\n assert candidate([1, 2, 3, 4, 3, 2, 2]) == 1\n assert candidate([1, 4, 2]) == 1\n assert candidate([1, 4, 4, 2]) == 1\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([1, 2, 3, 2, 1]) == 0\n assert candidate([3, 1, 1, 3]) == 0\n assert candidate([1]) == 0\n assert candidate([0, 1]) == 1\n\n", "contract": "\n assert type(arr) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) == int for x in arr), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[1, 2, 3, 5, 4, 7, 9, 6]], [[1, 2, 3, 4, 3, 2, 2]], [[1, 4, 2]], [[1, 4, 4, 2]], [[1, 2, 3, 2, 1]], [[3, 1, 1, 3]], [[1]], [[0, 1]]], "atol": 0, "plus_input": [[[1, 2, 3, 4, 5]], [[1, 2, 2, 1]], [[1, 1, 1, 1]], [[1, 2, 3, 4, 4, 3, 2, 1]], [[1, 2, 3, 4, 2, 3, 2, 1]], [[1, 2, 3, 3, 3, 3, 2, 1]], [[1, 2, 3, 2, 2, 2, 2, 1]], [[1, 2, 2, 2, 2, 2, 3, 4]], [[1, 1, 2, 2, 3, 3, 4, 4]], [[5, 4, 3, 2, 1]], [[2, 2, 3, 4, 4, 3, 2, 1]], [[1, 2, 2, 1, 2]], [[1, 2, 2, 2, 1]], [[1, 1, 2, 2, 1, 1]], [[1, 2, 2, 2, 1, 2]], [[1, 1, 2, 3, 4, 5]], [[1, 2, 3, 2, 2, 2, 2, 1, 2]], [[1, 1, 3, 4, 5]], [[1, 1, 5, 2, 1, 1]], [[1, 1, 2, 2, 2, 2, 3, 4]], [[1, 2, 2, 2, 1, 2, 2]], [[5, 4, 2, 1, 1]], [[1, 2, 3, 2, 2, 2, 2, 2, 1, 2]], [[1, 1, 2, 2, 2, 2, 3, 4, 3]], [[5, 5, 3, 2, 1]], [[1, 2, 3, 3, 3, 3, 2, 1, 3]], [[1, 2, 3, 4, 2, 3, 2, 1, 1]], [[1, 3, 3, 4, 1, 5]], [[1, 2, 1]], [[1, 1, 5, 2, 2, 1, 1]], [[1, 2, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2]], [[4, 2, 1, 1, 3]], [[5, 4, 3, 2, 1, 3]], [[1, 1, 2, 2, 1, 2]], [[1, 2, 3, 3, 3, 3, 1, 3]], [[1, 1, 2, 3, 3, 4, 4]], [[1, 2, 3, 4, 4, 2, 3, 2, 1]], [[1, 1, 3, 4, 5, 3]], [[2, 2, 3, 4, 4, 3, 2, 1, 2]], [[1, 2, 3, 2, 2, 2, 2, 1, 2, 2]], [[1, 2, 2, 1, 1]], [[1, 2, 3, 4, 4]], [[1, 2, 3, 4, 4, 2, 3, 2, 1, 3]], [[1, 2, 0, 2, 2, 1, 2]], [[2, 2, 3, 4, 4, 3, 2, 1, 3, 2]], [[1, 1, 2, 3, 4, 5, 3]], [[1, 2, 3, 2, 2, 2, 2, 2, 3]], [[1, 4, 1]], [[1, 2, 3, 4, 4, 3, 2, 1, 1]], [[1, 1, 2, 1]], [[1, 2, 3, 5, 3, 4, 4]], [[1, 2, 2, 2, 2, 1, 2, 2]], [[1, 1, 2, 3, 3, 4, 4, 2]], [[1, 2, 3, 4, 2, 3, 2, 1, 2]], [[1, 2, 3, 4]], [[1, 2, 2, 2, 3, 2, 1, 2, 2, 1, 2]], [[1, 1, 2, 3, 0, 4, 4, 4, 2, 2]], [[1, 2, 3, 2, 2, 2, 2, 2, 1, 3]], [[1, 1, 2, 3, 3, 4, 4, 4, 2]], [[1, 2, 1, 1]], [[1, 1, 5, 2, 2, 1, 1, 5]], [[2, 1, 2, 3, 2, 2, 2, 2, 2, 1, 3, 1]], [[1, 2, 3, 3, 3, 1, 3]], [[1, 2, 3, 4, 2, 4, 3, 2, 1, 2]], [[1, 1, 2, 3, 3, 3, 1, 4, 4, 2]], [[1, 2, 3, 2, 2, 2, 2, 1, 2, 2, 2]], [[1, 2, 3, 4, 2, 3, 1, 1, 2]], [[1, 1, 2, 3, 4]], [[1, 3, 2, 3, 4, 1, 5]], [[3, 5, 5, 3, 3, 2, 1]], [[1, 1, 3, 0, 4, 5]], [[1, 2, 3, 4, 2, 2, 3, 1, 1, 2]], [[1, 1, 2, 3, 3, 4, 4, 2, 4]], [[1, 2, 2, 2, 2, 2, 3, 4, 2]], [[1, 2, 3, 4, 5, 3, 2, 1, 3]], [[2, 2, 3, 4, 4, 3, 2, 1, 1]], [[1, 2, 3, 4, 2, 3, 2, 1, 0, 2]], [[1, 2, 5, 2, 2, 2, 2, 1, 2, 2, 2]], [[1, 2, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2]], [[1, 2, 3, 2, 2, 2, 2, 1, 3]], [[1, 2, 3, 4, 4, 3, 2, 1, 3, 1]], [[5, 4, 2, 0, 2, 1]], [[1, 3, 3, 3, 3, 1, 3]], [[1, 2, 3, 4, 4, 2, 2, 2, 1]], [[4, 2, 1, 1, 3, 3]], [[1, 2, 2, 2, 0, 2, 2]], [[1, 2, 3, 4, 5, 3, 2, 1, 3, 5]], [[1, 1, 5, 2, 3, 1, 1]], [[1, 2, 2, 2, 3, 2, 1, 2, 1, 2]], [[5, 5, 3, 2, 0]], [[4, 2, 1, 1, 3, 2]], [[2, 1, 2, 3, 2, 2, 2, 2, 2, 1, 3, 1, 1]], [[1, 1, 1, 2, 2, 2, 2, 3, 4, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 3, 2, 1, 1, 2, 3, 4, 5]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 6, 48, 49, 50, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 22, 2, 1, 5]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 5, 4, 3, 22, 2, 1, 5]], [[1, 1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1]], [[2, 3, 1, 5, 7, 9, 10, 8, 4, 8]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 3, 2, 1, 1, 2, 4, 4, 5, 3]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 8, 7, 6, 5, 4, 3, 22, 2, 1, 5]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 42, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 6, 7, 8, -7, 9, 10, 10]], [[1, 1, 25, 2, 1, 2, 2, 12, 2, 1, 1, 1, 1, 0]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2]], [[1, 1, 25, 2, 2, 2, 12, 2, 2, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 30]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[1, 1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 1]], [[2, 2, 1, 5, 7, 9, 10, 8, 6, 4]], [[1, 2, 46, 3, 4, 5, 6, 7, 8, 9, 7, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 10]], [[1, 2, 4, 6, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2, 2]], [[-10, -9, -8, -7, -6, -5, 17, -4, -4, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3]], [[1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 34, 4, 5, 4, 25, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 4, 6, 7, 8, 10, 10, 9, 8, 7, 6, 9, 4, 3, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 2, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2]], [[1, 2, 3, 4, 18, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 2, 4, 4, 5, 3]], [[1, 2, 3, 34, 4, 18, 4, 25, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[26, 2, 3, 4, 5, 4, 3, 4, 5, -8, 3, 4, 5, 4, 3, 2, 30]], [[1, 2, 4, 6, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 11, 1, 1, 1]], [[2, 3, 1, 29, 7, 9, 10, 8, 4, 8]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 44, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, -5, 6]], [[1, 2, 4, 6, 6, 7, 8, 10, 10, 9, 7, 7, 6, 5, 4, 3, 2, 1, 1]], [[3, 1, 5, 7, 10, 10, 8, 6, 4, 5]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 11, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 3, 4, 5, 4, 3, 4, 5, 4, 3, 1, 30]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 36, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 12]], [[-10, -9, 36, -8, -7, -5, 17, -4, 41, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 24, 9, 10]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[-10, -9, -8, -7, -5, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, -5, 6]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 18, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 44, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 0]], [[1, 2, 45, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 12]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 4]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 42, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 1, 1, 42, 1, 1, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 13, 35]], [[2, 3, 4, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4]], [[1, 2, 3, 4, 45, 6, 7, 8, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2, 1]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 4, 4, 5, 3]], [[-10, -9, -7, -6, -5, 17, -4, -3, 24, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 8, 10]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 28, 1, 2, 1, 3, 1, 1, 1, 2, 2]], [[26, 2, 3, 4, 5, 4, 3, 4, 5, -8, 3, 4, 5, 4, 3, 2, 30, 4]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 4, 3, 2, 1, 2]], [[1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 11, 8, 9, 9, 10, 10]], [[2, 13, 3, 4, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4, 4]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 5, 4, 3, 2, 1]], [[1, 1, 1, 1, 2, 2, 2, 29, 2, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 1, 1, 2, 3, 4, 5, 7, 40, 7, 8, -7, 9, 10]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[-10, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 50, 2, 3, 4, 5, 6, 6, 7, 8, -7, 9, 10, 10]], [[2, 3, 4, 5, 4, 3, 4, 5, 3, 4, 3, 4, 5, 4, 3, 2, 1]], [[36, 1, 2, 4, 6, 6, 7, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 49, 13, 8]], [[1, 1, 1, 43, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 25, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 7, 4, 3, 2, 1]], [[2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 2, 3, 4, 5, 3, 2, 1, 12, 2, 3, 4, 5]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 20]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 44, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 2, 4, 6, 7, 8, 10, 10, 9, 7, 7, 6, 5, 4, 3, 2, 22, 1]], [[3, 3, 1, 6, 7, 9, 10, 8, 6, 4, 8]], [[1, 2, 3, 34, 5, 25, 3, 4, 5, 4, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 44, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2, 34]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 4, 3]], [[2, 13, 3, 4, 5, 41, 3, 40, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4, 4]], [[1, 12, 5, 3, 4, 5, 3, 4, 5, 4, 3, 3, 4, 5, 4, 3, 1, 30]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, -3, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 46, 48, 49, 50, 13, 35, 6]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 6, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2, 4]], [[1, 2, 4, 6, 6, 7, 8, 5, 10, 10, 9, 7, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 28, 1, 2, 1, 3, 1, 1, 1, 2, 2, 2, 1]], [[1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[0, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 22, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 3, 2, 4, 3, 4]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8]], [[3, 1, 5, 7, 10, 10, 8, 6, 5]], [[1, 12, 5, 4, 5, 3, 4, 5, 4, 3, 3, 4, 5, 4, 3, 1, 30, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 2, 2, 1]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 1]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 3, 2, 4, 3, 4, 3]], [[1, 12, 5, 4, 5, 3, 33, 5, 4, 3, 3, 4, 5, 4, 3, 1, 30, 3]], [[1, 2, 3, 33, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 3, 2, 4, 7, 4, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 6, 5, 4, 3, 2, 1, 4, 10]], [[1, 3, 2, 3, 4, 5, 12, 1, 1, 2, 4, 4, 5, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8]], [[5, 1, 3, 2, 3, 4, 5, 12, 1, 1, 2, 4, 4, 5, 3]], [[1, 2, 45, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 10]], [[3, 2, 1, 6, 7, 9, 10, 8, 6, 4, 8]], [[2, 3, 1, 7, 9, 10, 8, 6, 4]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 5, 6, 7, 8, 9, 10, -8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 12]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 1, 1, 42, 1, 1]], [[48, 1, 1, 44, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 9, 3, 6]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, -3, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 46, 48, 49, 50, 13, 35, 6, 49]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 3, 2, 4, 3, 4, 4]], [[1, 2, 3, 34, 4, 5, 4, 25, 3, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[2, 3, 1, 29, 15, 9, 10, 8, 4, 8]], [[48, 1, 1, 44, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 10, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2, 27]], [[1, 1, 25, 2, 2, 1, 2, 2, 12, 2, 1, 1, 1, 1, 0]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, 17, -6, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, -5, 6]], [[1, 2, 3, 34, 4, 5, 4, 25, 3, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, 18, 19, 20, 12]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 44, 38, 39, 40, 41, 42, 43, 43, 45, 46, 47, 48, 49, 50, 2, 34]], [[1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3, 4]], [[1, 3, 2, 3, 4, 6, 12, 1, 1, 2, 4, 4, 5, 3]], [[-10, 42, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[1, 1, 25, 2, 1, 2, 37, 2, 2, 1, 1, 1, 1, 0]], [[1, 18, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 6, 48, 49, 50, 2]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 0, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 3]], [[1, 1, 25, 2, 1, 2, 37, 2, 2, 1, 35, 1, 1, 1, 0]], [[1, 1, 1, 1, 2, 2, 2, 29, 1, 1, 1, 1, 1, 1]], [[30, 2, 3, 1, 29, 7, 9, 10, 8, 3, 4, 8]], [[1, 2, 4, 6, 5, 6, 7, 8, 10, 10, 8, 7, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, 18, 19, 20, 12]], [[1, 2, 3, 4, 5, 4, -7, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[-10, -9, 36, -8, -7, -5, 17, -4, 41, -2, -1, 0, 41, 1, 2, 3, 4, 5, 6, 7, 24, 9, 10]], [[2, 13, 3, 4, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, -5, 5, 4, 3, 2, 1, 4, 4]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 21]], [[-10, -9, -7, -6, -5, 17, -4, -3, 24, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 8, 10, -5]], [[2, 3, 4, 5, 4, 3, 4, 5, 3, 4, 3, 4, 24, 20, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 9, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 39, 2, 2, 1]], [[1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 5, 3]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 43, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 49, 13, 8]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 5, 4, 4, 3, 4, 5, 3, 3, 2, 4, 3, 4, 3, 4, 3]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 13, 49, 50]], [[1, 2, 3, 4, 5, 3, 1, 1, 1, 2, 4, 4, 5, 3]], [[-10, -9, 16, -8, -7, -6, -5, 17, -4, -3, -2, -1, 1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[1, 1, 2, 2, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2]], [[-10, -9, 17, -8, -7, -6, -5, 17, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 8, -7, 9, 10, -7, 3]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 0, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 13, 3, 13]], [[0, 1, 26, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[2, 3, 1, 5, 7, 10, 8, 6, 20, 7]], [[37, 3, 4, 5, 4, 3, 4, 5, 3, 4, 3, 4, 5, 4, 3, 2, 1, 37]], [[1, 2, 3, 4, 6, 7, 8, 10, 10, 9, 15, 7, 5, 4, 3, 22, 2, 1, 5, 3]], [[3, 2, 5, -8, 1, 6, 7, 9, 10, 41, 6, 4, 8]], [[-10, -9, -8, -7, -6, 0, -5, 17, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -3]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 1, 1, 42, 1]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 1, 2, 1]], [[37, -9, -8, -7, -6, 0, -5, 17, -8, -4, -3, -2, -1, -1, 49, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -3]], [[1, 2, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 3, 2, 1, 2]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 4, -2, 5, 3]], [[2, 2, 1, 5, 7, 9, 10, 8, 6, 4, 7]], [[2, 3, 4, 5, 4, 3, 40, 4, 5, 4, 3, 4, 5, 4, 3, 2, 2, 1, 4]], [[-10, -9, -8, 43, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8, 5]], [[1, 2, 4, 6, 0, 6, 7, 8, 37, 10, 10, 9, 8, 7, 6, 5, 7, 4, 3, 2, 1]], [[1, 2, 5, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1]], [[-10, -9, -7, -6, -5, 17, -4, -3, 24, -2, -1, -1, 1, 2, 3, 3, 4, 5, 6, 7, 8, -7, 8, 10, -7, 3]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 32, 10, 9, 8, 7, 6, 5, 4, 3, 2, 21]], [[1, 2, 3, 4, 5, 4, -7, 4, 5, 4, 4, 3, 5, 4, 3, 2, 1]], [[1, 2, 46, 3, 4, 5, 6, 7, 49, 9, 7, 10, 10, 9, 8, 38, 7, 6, 5, 4, 3, 2, 1, 10, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50]], [[1, 0, 1, 1, 2, 0, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[1, 2, 3, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2]], [[1, 2, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 3, 2, 1, 2, 4]], [[1, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2, 12]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 1, -7]], [[1, 0, 1, 2, 2, 5, 2, 12, 2, 1, 1, 1, 1, 1, 13, 1]], [[1, 1, 1, 1, 2, 1, 2, 12, 2, 28, 1, 2, 1, 3, 1, 1, 1, 2, 2]], [[1, 2, 46, 3, 4, 50, 6, 7, 8, 9, 7, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 10]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[2, 3, 4, 5, 4, 6, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 7, 4, 3, 2, 1, 6]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 1, 42, 1, 42]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 1, 1, 42, 1, 1, 1, 2]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 4, -2, 5, 3, 3, 1]], [[5, 26, 2, 3, 4, 5, 4, 3, 4, 5, -8, 3, 4, 5, 4, 3, 2, 30]], [[1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 12]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 1]], [[1, 1, 42, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 42, 1, 1, 1]], [[1, 2, 3, 4, 5, 34, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 34, 4, 5, 4, 3, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4, 1]], [[2, 3, 5, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[1, 2, 4, 6, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 3]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, 17, -1, -1, 1, 2, 3, 4, 5, 6, 16, 7, 8, -7, 9, 10, -9]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 44, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2, 35]], [[2, 3, 1, 7, 9, 10, 8, 6, 4, 4]], [[2, 3, 1, 9, 10, 8, 6, 4, 4]], [[2, 1, 5, 7, 9, 10, 8, 6, 4, 41, 7]], [[1, 4, 6, 5, 6, 7, 8, 10, 10, 8, 7, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 14, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 44, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 23]], [[1, 1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 25]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 0, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[5, 1, 3, 2, 3, 4, 5, 12, 1, 3, 1, 2, 4, 4, 5, 3, 4]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 9, 6, 48, 49, 50, 2]], [[1, 2, 3, 34, 5, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 4]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 27, 30, 31, 32, 33, 34, 35, 36, 37, 44, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 2, 34]], [[3, 2, 5, -8, 1, 6, 7, 9, 10, 41, 6, 4, 8, 10]], [[2, 3, 1, 5, 7, 9, 5, 10, 8, 6, 4, 9, 3, 6, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 38, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 23, 50]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 21, 5, 6, 7, 8, 9, 10]], [[3, 1, 5, 7, 10, 10, 8, 6, 4, 32, 5, 5]], [[1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 12]], [[2, 3, 1, 9, 10, 8, 6, 4]], [[36, 1, 2, 4, 6, 6, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 1, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 9, 7, 6, 5, 4, 3, 2, 1, 1]], [[36, 1, 2, 4, 6, 6, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 3]], [[3, 5, -8, 1, 6, 7, 9, 10, 41, 6, 4, 8, 10]], [[1, 2, 3, 4, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 6, 48, 49, 50, 2]], [[1, 27, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3, 3, 4]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 21, 2, 3, 4, 5, 6, 7, 8, 9, 10, -5]], [[2, 3, 1, 29, -5, 10, 8, 4, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 9, 7, 18, 5, 4, 3, 2, 1]], [[1, 1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[1, 2, 3, 5, 6, 7, 8, 10, 10, 8, 7, 6, 5, 4, 45, 22, 2, 1, 5]], [[1, 1, 1, 1, 2, 2, 29, 2, 1, 1, 1, 1, 1, 1]], [[1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 6, 13, 14, 15, 16, 17, 43, 19, 20, 12]], [[37, -9, -8, -7, -6, 1, -5, 17, -8, -4, -3, -2, -1, -1, 49, 1, 2, 3, 4, 5, 6, 6, 8, -7, 9, 10, -3]], [[2, 3, 35, 1, 29, 15, 9, 10, 8, 4, 8, 15]], [[2, 3, 1, 15, 9, 10, 8, 4, 8]], [[-10, 42, -9, -8, -6, -5, 17, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[2, 4, 6, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[2, 13, 3, 4, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4, 4, 1]], [[-10, -9, -8, -7, -6, -5, -4, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8, 5, -8]], [[1, 2, 3, 4, 5, 6, 7, -2, 8, 9, 10, 11, 12, 13, 14, 15, 16, 29, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 19, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 44, 45, 46, 47, 48, 49, 50]], [[3, 5, -8, 1, 6, 7, 9, 41, 6, 4, 8, 10]], [[-10, -9, -8, -7, -6, -5, 17, -4, -4, 31, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, 10]], [[2, 3, 4, 5, 4, 3, 4, 5, 3, 4, 3, 4, 24, 20, 4, 3, 2, 1, 3]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 2, 5, 4, 5, 3]], [[1, 4, 6, 5, 6, 7, 8, 37, 10, 8, 7, 7, 6, 5, 4, 3, 2, 1, 1]], [[2, 3, 4, 5, 4, 19, 6, 3, 4, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 12, 5, 4, 5, 3, 4, 5, 4, 3, 3, 4, 4, 3, 1, 30, 3]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 8]], [[1, 1, 25, 49, 2, 2, 2, 1, 1, 1, 1, 1]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 7, 6, 5, 7, 4, 3, 2, 1, 6]], [[1, 1, 25, 2, 2, 2, 13, 2, 1, 1, 1, 1, 0]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 8, 3]], [[1, 2, 4, 6, 6, 7, 8, 10, 10, 9, 7, 7, 6, 5, 4, 3, 2, 1, 11, 1, 1, 1]], [[3, 2, 5, 1, 4, 6, 7, 9, 10, 41, 6, 4, 8, 10, 1, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 9]], [[1, 3, 4, 5, 6, 7, 8, 11, 12, 13, -10, 14, 15, 16, 17, 18, 19, 20, 12, 19]], [[1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 3]], [[1, 2, 30, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 9]], [[1, 4, 6, 5, 6, 7, 8, 37, 10, 8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 37]], [[1, 2, 3, 4, 5, 6, 8, 10, 10, 8, 7, 6, 5, 4, 3, 22, 2, 1, 5, 5]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 21, 4]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 36, 20, 21, 22, 23, 24, 25, 20, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 12, 10]], [[34, 36, 1, 2, 4, 6, 6, 10, 10, 9, 8, 7, 16, 5, 4, 3, 2, 1]], [[2, 3, 1, 7, 9, 10, -10, 6, 4]], [[1, 1, 25, 2, 2, 2, 13, 2, 1, 1, 1, 1, 0, 25]], [[1, 2, 3, 4, 5, 6, 7, -4, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[2, 3, 1, 9, 10, 8, 6, 3, 2]], [[1, 2, 4, 5, 1, 2, 4, 5, 3, 4]], [[3, 2, 5, -9, 1, 6, 7, 9, 10, 41, 6, 4, 8, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 6, 7, 8, -7, 9, 10, 26]], [[2, 3, 35, 1, 29, 15, 11, 9, 10, 8, 8, 15]], [[2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5, 2]], [[1, 2, 3, 4, 5, 4, 3, 42, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[2, 4, 6, 6, 7, 8, 10, 10, 9, 8, 6, 5, 4, 3, 2, 1, 5]], [[1, 1, 2, 4, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 12, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 1, 2, 1]], [[1, 2, 3, 34, 3, 5, 4, 3, 5, 5, 4, 4, 3, 4, 5, 2, 4, 3, 4]], [[2, 3, 4, 5, 4, 6, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 2]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 43, 10, 11, 12, 13, 15, 15, 16, 17, 18, 19, 20, 3, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, 18, 18, 20, 12, 15]], [[1, 2, 4, 3, 34, 4, 18, 4, 25, 3, 4, 5, 4, 3, 5, 4, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 23]], [[1, 2, 3, 4, 5, 2, 1, 1, 4, 4, 45, 5, 3]], [[1, 2, 3, 4, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 24, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 6, 48, 49, 50, 2]], [[3, 1, 5, 7, 6, 10, 10, 8, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 1, 1, 1, 2, 2, 2, 2, 2, 42, 17, 1, 42, 1, 1, 1, 1, 1]], [[2, 3, 4, 5, 4, 3, 21, 5, 3, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 36, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 38, 44, 45, 46, 47, 48, 49, 50, 13, 8]], [[1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 11, 8, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 2, 3, 1, 1, 2, 5, 4, 5, 3, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -9]], [[1, 1, 1, 1, 2, 7, 2, 2, 2, 42, 1, 42, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -7, -1, 0, 1, 2, 3, 4, 5, 6, 8, -7, 9, 10, -8, 10]], [[37, 3, 4, 5, 4, 3, 4, 5, 3, 3, 4, 5, 4, 2, 1, 37]], [[2, 3, 1, 29, 7, 9, 10, 8, 4, 26]], [[1, 2, 3, 4, 5, 3, 4, 5, 4, 3, 4, 5, 4, 4, 0, 0, 30, 1]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 8, -7, 9, 10]], [[2, 13, 3, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, -5, 5, 4, 3, 2, 1, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 22, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 12, 39, 40, 41, 42, 43, 45, 44, 45, 46, 47, 48, 49, 50, 44]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 6, 8, -7, 10, 10, 26]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 10]], [[1, 2, 3, 4, 5, 3, 1, 2, 4, 4, 5, 5, 3]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 30, 2]], [[1, 2, 3, 4, 6, 7, -8, 9, 10, 11, 12, 13, 14, 15, 16, 8, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 43, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 13, 8]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 36, 20, 21, 22, 23, 24, 25, 20, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8, 19]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 3, 4, 3, 4, 4]], [[1, 2, 3, 4, 5, 6, 8, 9, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[3, 1, 10, 5, 7, 6, 9, 10, 8, 1, 6]], [[-9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 21, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 44, 45, 46, 47, 48, 49, 50, 8]], [[2, 3, 1, 29, 15, 11, 9, 10, 8, 8, 15]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 1, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 49, 13, 8]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 9, 10, 10]], [[1, 8, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 11, 8, 9, -1, 10, 10]], [[1, 12, 5, 4, 5, 3, 4, 5, 4, 3, 3, 4, 4, 3, 1, 30, 3, 1]], [[-10, -9, 17, -8, -7, -6, -5, 17, -4, -3, -2, -7, -1, -1, 1, 2, 3, 4, 5, 6, 8, -7, 9, 10, -7, 3]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, 44, -2, 17, -1, -1, 1, 10, 3, 3, 4, 5, 6, 16, 7, 8, -7, 9, 10, -9]], [[-5, 1, 2, 46, 3, 4, 5, 6, 7, 49, 9, 7, 10, 10, 9, 8, 38, 7, 6, 5, 4, 3, 2, 1, 10, 6]], [[1, 2, 30, 4, 5, 6, 7, 8, 9, 10, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 9]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 8, 3, 1]], [[1, 2, 3, 4, 5, 6, 7, 1, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 11, 12, 13, 14, 15, 16, 17, 18, 37, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 6, 5, 4, 3, 2, 1, 4, 10, 5, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 9, 8, 7, 5, 4, 3, 2, 1, 4, 5]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 10, 17, 18, 19, 20, 25, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 23, 45, 33, 46, 47, 48, 49, 50, 2, 27]], [[1, 2, 3, 4, 5, 6, 14, 7, 8, 18, 9, 10, 11, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 44, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[-10, -9, -8, -7, -6, -5, -4, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8, 5, -8, -6]], [[2, 3, 8, 1, 5, 7, 9, 20, 5, 10, 8, 6, 4, 9, 3, 6, 5]], [[1, 2, 3, 4, 5, 4, 3, 42, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[1, 2, 3, 34, 4, 39, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 4, 3, 4]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 24, 36]], [[36, 1, 2, 4, 6, 6, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 3]], [[2, 3, 35, 38, 1, 29, 15, 11, 9, 10, 8, 8, 15]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 26, 2, 3, 4, 6, 7, 8, -8, 9, 10]], [[1, 2, 3, 34, 4, 4, 5, 4, 9, 25, 3, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 26, 2, 3, 4, 5, 6, 7, 8, 9, 10, -5]], [[1, 2, 46, 3, 4, 50, 6, 7, 8, 9, 7, 10, 10, 9, 7, 6, 5, 4, 3, 2, 1, 10]], [[1, 1, 25, 2, 1, 2, 37, 2, 2, 35, 1, 1, 1, 0, 35]], [[1, 2, 1, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, -5, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 13, 49, 50]], [[1, 2, 3, 4, 5, 2, 1, 1, 2, 4, 4, 5, 3]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 13, 37]], [[2, 5, 37, -8, 1, 6, 7, 9, 10, 41, 6, 4, 8, 10]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1, 1]], [[-10, -9, -8, -7, -6, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 21, 5, 6, 7, 8, 9, 10]], [[-10, -9, -7, -6, -5, -4, -3, 24, -2, -1, -1, 1, 2, 3, 3, 4, 5, 6, 7, 8, -7, 8, 10, -7, 3]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[2, 3, 5, 1, 7, 9, 10, 8, 6, 4, 3, 7]], [[1, 2, 3, 4, 5, 2, 1, 1, 2, 5, 4, 5, 3, 1]], [[2, 3, 2, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1]], [[2, 3, 4, 5, 4, 3, 4, 5, 3, 5, 4, 3, 4, 24, 20, 4, 3, 2, 1, 4]], [[1, 2, 3, 4, 5, 6, 10, 7, 8, 9, 7, 10, 10, 9, 8, 6, 5, 4, 3, 2, 1, 4, 10]], [[1, 2, 3, 4, 5, 4, 6, -7, 4, 5, 4, 4, 3, 40, 4, 3, 2, 1]], [[1, 1, 1, 1, 2, 2, 2, 29, 1, 1, 1, 1, 1, 1, 1, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, -3, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 46, 48, 49, 50, 13, -7, 35, 6]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 21, 10, 1, -7]], [[3, 5, -8, 1, 6, 7, 9, 10, 41, 6, 34, 4, 8, 10]], [[2, 3, 1, 22, 5, 7, 9, 10, 8, 6, 8, 3, 1]], [[1, 1, 1, 43, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 12]], [[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 15, 16, 18, 18, 20, 12, 15]], [[1, 2, 3, 4, 5, 3, 4, 5, 4, 3, 4, 5, 4, 1, 30, 4]], [[1, 5, 5, 7, 10, 10, 8, 6, 5]], [[2, 3, 35, 38, 1, 29, 15, 11, 9, 10, 8, 8, -6, 15]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 1, 2, 1]], [[1, 2, 3, 4, 5, 2, 2, 1, 1, 4, 5, 3]], [[2, 13, 3, 4, 5, 4, 3, 40, 4, 5, 4, 4, 3, 4, 5, 4, 29, 2, 1, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 10]], [[1, 2, 3, 4, 5, 6, 10, 10, 8, 7, 5, 4, 3, 22, 2, 1, 5, 5]], [[2, 3, 35, 38, 1, 15, 11, 9, 10, 8, 8, 33, 15]], [[1, 2, 3, 4, 5, 3, 1, 2, 48, 4, 5, 5, 3]], [[1, 0, 1, 1, 2, 2, 2, 12, 2, -5, 1, 1, 1, 1, 2, 1]], [[37, -9, -8, -7, -6, 0, -5, -8, -4, -3, -2, -1, -1, 49, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -3]], [[1, 25, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 2]], [[1, 0, 1, 1, 2, 0, 2, 2, 12, 2, 1, 1, 1, 2]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 21, 2, 3, 4, 48, 6, 7, 8, 9, 10, -5]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 4, 5]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 21, 4, 0]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 25, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 8, 40, 45]], [[1, 0, 1, 2, 2, 5, 2, 2, 1, 1, 1, 1, 1, 13, 1]], [[1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3, 4, 3]], [[1, 18, 2, 3, 4, 5, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 6, 48, 49, 50, 2, 19, 8]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 3, 8, -7, 9, 10, 6]], [[1, 2, 4, 6, 6, 7, 8, 10, 32, 9, 9, 8, 7, 6, 5, 4, 3, 2, 21]], [[1, 2, 3, -9, 4, 5, 6, 7, 8, 10, 9, 8, 7, 5, 4, 3, 2, 1, 7, 5]], [[1, 2, 46, 3, 4, 5, 6, 7, 49, 9, 7, 10, 10, 9, 8, 38, 7, 6, 5, 4, 3, 2, 32, 1, 10, 6, 9]], [[2, 13, 3, 4, 5, 4, 3, 39, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4, 4]], [[3, 21, -8, 1, 6, 7, 9, 41, 6, 4, 8, 10]], [[3, 1, 5, 7, 8, 10, 10, 8, 6, 4, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 38, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 23, 50, 7]], [[1, 1, 1, 1, 2, 2, 2, 2, 42, 1, 1, 42, 1]], [[1, 2, 4, 6, 7, 8, 9, 10, 25, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 3, 40, 45]], [[2, 3, 5, 1, 9, 10, 8, 6, 4, 3, 7]], [[32, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13]], [[3, -8, 1, 6, 7, 9, 41, 6, 4, 8, 10]], [[2, 3, 3, 35, 38, 1, 29, 15, 11, 9, 10, 8, 8, -6, 15]], [[1, 2, 3, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[2, 3, 1, 5, 7, 9, 10, 8, 4, 8, 8]], [[3, 2, 5, 7, 6, 10, 10, 8, 6]], [[1, 1, 2, 3, 4, 5, 3, 1, 1, 2, 4, 4, 5, 3]], [[3, 2, 1, 6, 7, 9, 10, 8, 6, 4, 8, 10, 6]], [[37, -9, -8, -7, -6, 0, -5, -8, -4, -3, -2, -1, -1, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -3]], [[1, 2, -7, 3, 4, 5, 2, 2, 1, 1, 2, 5, 4, 5, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8, 7]], [[1, 2, 3, 34, 4, 5, 8, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 4]], [[1, 2, 3, 4, 5, 6, 8, 10, 8, 7, 6, 5, 4, 3, 22, 2, 1, 5, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 39, 2, 2, 1, 9]], [[1, 2, 4, 6, 0, 6, 7, 8, 10, 32, 10, 9, 8, 7, 6, 5, 32, 3, 2, 21]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 13, 26, -3, 28, 29, 30, 31, 28, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 46, 48, 49, 50, 13, 35, 6]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -9, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 13, 37]], [[37, -9, -8, -7, -6, 0, 41, -5, -8, -4, -3, -2, -1, -1, 49, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, -3]], [[1, 2, 3, 4, 6, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 24, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 2, 45, 46, 47, 6, 48, 49, 50, 2]], [[-10, -9, -8, -7, 13, -6, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 21, 5, 6, 7, 8, 9, 10, -4]], [[2, 2, 1, 5, 7, 9, 10, 6, 4, 7]], [[2, 3, 4, 4, 6, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 30, 2, 1]], [[1, 2, 3, 4, 5, 13, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 2]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 6, 7, 8, -7, 9, 10, 26, 7, 7]], [[2, 3, 1, 29, 15, 9, 10, 8, 10, 4, 8]], [[1, 8, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 11, 8, 9, -1, 10]], [[2, 3, 1, 5, 7, 9, 10, 8, 4, 8, 1]], [[1, 2, 3, 34, 5, 25, 3, 4, 5, 4, 4, 4, 37, 4, 5, 5, 3, 2, 1]], [[3, 5, -8, 1, 6, 9, 41, 6, 4, 8, 10]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, 10, 9]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 1, 1, 2, 3, 4, 5, 7, 40, 7, 8, -7, 9, 10, 10]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 40, 1, 2, 3, 4, 5, 6, 8, -7, 9, 10]], [[36, 1, 2, 3, 6, 6, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 3, 2]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, -6, 4, 3, 2, 1, 3]], [[1, 4, 6, 5, 6, 7, 8, 10, 10, 8, 7, 6, 5, 4, 3, 2, 1, 1]], [[1, 2, 3, 4, 5, 6, 6, 8, 9, 10, 10, 9, 7, 18, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 40, 4, 5, 4, 3, 2, 1]], [[2, 3, 2, 5, 4, 3, 4, 5, 4, 4, 3, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 0, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 3, 3]], [[2, 3, 1, 29, 15, 11, 9, 30, 10, 8, 15]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 5, 6, 7, 8, -6, 9, 10, -8]], [[1, 1, 2, 1, 43, 2, 2, 12, 2, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 5, 6, 7, 8, -6, 9, 10, -8, -4]], [[1, 12, 5, 4, 5, 3, 33, 5, 4, 3, 3, 4, 5, 4, 3, 1, 30, 6, 3]], [[37, -9, -8, -7, -6, 0, -5, -8, -4, -3, -2, -1, -1, 49, 1, 27, 2, 3, 4, 5, 6, 7, 8, -7, 9, 10, -3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -4, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 13, 49, 50]], [[3, 1, 10, 5, 7, 6, 9, 10, 6]], [[-10, -9, -8, -7, -6, -5, 17, -4, -3, -2, -1, 1, 1, 2, 3, 4, 5, 9, 6, 7, 8, -7, 9, 10]], [[1, 2, 3, 5, 6, 7, 8, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1, 2]], [[2, 3, 4, 5, 4, 3, 4, 5, 4, 4, 3, 4, 5, 4, 3, 2, 1, 5, 2, 3]], [[1, 2, 4, 6, 6, 7, 8, 37, 10, 10, 9, 7, 6, 4, 7, 4, 3, 2, 1, 1]], [[1, 2, 3, 4, 6, 7, 8, 9, 41, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 13, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 0, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 13, 3]], [[1, 2, 3, 34, 4, 5, 4, 3, 4, 5, 5, 4, 4, 3, 4, 5, 3, 3, 2, 4, 3, 4, 3, 4, 3, 4]], [[1, 12, 1, 1, 2, 2, 2, 12, 2, 1, 1, 1, 1, 2, 1, 49, 1]], [[1, 2, 3, 4, 5, 13, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 2, 13]], [[1, 2, 3, 4, 5, 6, 7, 34, 8, 9, 10, 10, 9, 9, 7, 6, 5, 4, 3, 2, 1, 6]], [[-9, -8, -7, -6, -5, 17, -4, -3, -2, 43, 0, 1, 2, 3, 4, 21, 5, 7, -3, 8, 9, 10]], [[1, 0, 1, 2, 2, 2, 2, 12, 2, 1, 1, 1, 1, 1, 1, 2, 1]], [[]], [[1, 2, 3, -3, -2, -1]], [[1, 2, 1, 2, 1, 2, 1]], [[1, 1, 1, 1, 1, 1]], [[2, 2, 2, 2, 2]], [[1, 2]], [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 1, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[2, 36, 3, 1, 5, 7, 9, 10, 8, 6, 4]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, -3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 9, 10]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 2]], [[2, 3, 1, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2]], [[2, 3, 1, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5]], [[1, 2, 3, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[2, 3, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 50, -3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, -3, -7]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 27, 1, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 10]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 4, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 23, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 20]], [[2, 3, 1, 5, 0, 7, 9, 10, 8, 6, 4]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -8]], [[-10, -9, -8, -7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7]], [[-10, -9, -8, -7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7, -8]], [[-10, -9, -8, -7, 18, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 9, 9, 10, 10]], [[2, 3, 1, 5, 7, 4, 9, 8, 3, 36, 6, 4, 2, 5, 8]], [[-10, -9, -8, -7, 7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7]], [[1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 3, 2, 1]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -8]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 2, 1]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 39, 19, -8, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, -8]], [[2, 3, 1, 5, 7, 9, 10, 8, 36, 6, 4, 2, 5]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, 19, -8]], [[2, 13, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, -9, 8, 9, 10, -3]], [[-10, -9, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -9, 1, 2, 3, 3, 5, 6, -9, 8, 9, 10, -3]], [[2, 3, 7, 9, 10, 8, 6, 4, 2, 1]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2]], [[-10, -9, -8, -7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7, 9]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 10, -9, -9]], [[1, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8]], [[1, 2, 3, 4, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[3, 1, 5, 7, 46, 9, 10, 8, 6, 4, 6, 9]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10]], [[-10, -9, -8, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 31, 8, 9, 10, -3, -7, 8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 23, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0]], [[1, 2, 3, 4, 5, 6, 7, 32, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[3, 2, 13, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 9]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6, 4]], [[39, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 3, 4, 5, 6, 7, -3, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 5, 1]], [[1, 2, 3, 4, 5, 4, 3, 3, 4, 5, 4, 3, 4, 5, 3, 2, 23, 1]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 21, 5, 6, 7, 8, 9, 10, 0, 2, -3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 3, 5, 7, 8, 9, 10]], [[1, 2, 3, 42, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 0]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -8, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 10]], [[-10, 3, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, -7]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, 0, 1, 3, 4, 5, 6, 7, -3, 8, 9, 10, -5]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 6, 34, 35, 36, 37, 38, 39, 40, 41, 1, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 50, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6]], [[-10, -9, -8, 33, -7, -6, -5, -4, -3, -2, -1, -9, 33, 1, 2, 3, 3, 5, 6, -3, 7, 9, 10, 50, -3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -10, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 1]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 2, 2, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 6, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, -8, 6]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 2, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6]], [[1, 2, 3, 4, 5, 6, 7, 32, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 11]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10]], [[-10, -9, -8, 33, -7, -6, -5, -4, -3, -2, -1, -9, 33, 1, 2, 3, 3, 5, 6, -3, 7, 9, 10, 50, -3, -3]], [[2, 3, 5, 7, 4, 3, 9, 10, 8, 36, 6, 4, 2, 5, 36]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 1]], [[1, 3, 1, 5, 7, 24, 10, 8, 6, 4, 6, 4, 10]], [[1, 2, 3, 4, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 50, 1, 3]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 18, 14]], [[1, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 15, 15, 16, 17, -8]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10, 4]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 23, 10, 6, 7, 7, 8, 8, 9, 9, 10, 10, 2]], [[-10, -9, -8, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, -9, 6, 7, -6, 31, 8, 9, 10, -3, -7, 8]], [[-10, -9, -8, -7, -6, -5, -4, -3, -1, -9, 6, 8, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, -3, -7]], [[-10, -9, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, -9, 6, 7, -6, 31, 8, 9, 10, -3, -7, 8, -6]], [[1, 2, 3, 3, 5, 6, 49, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 11]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 35, 9, 10, 50, -3]], [[1, 2, 3, 3, 5, 6, 7, 8, 10, 1, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 6]], [[1, 2, 38, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 34, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 13, 15, 16, 17, 18, 20]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 35, 16, 17, 18, 19, 20, 15]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 3, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, -3, -7, -7]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 4, 10, 10]], [[-10, -9, -8, 35, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 9, 10]], [[39, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 16, 17, -8]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 9, 8, 6, 5, 4, 3, 2, 1]], [[1, 2, 1, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 6, 7, 8, 10, 10, 9, 8, 7, 6, 49, 4, 3, 2, 50, 1, 3]], [[-10, -9, -8, -7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7, -9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 39, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 46]], [[0, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, 18, -6, -5, -4, -3, -2, -1, 0, 1, 7, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 20, 16]], [[1, 2, 3, 3, 5, 6, 49, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 24, 19, 20, 11]], [[1, 2, 3, 5, 6, 7, 8, 9, 10, 9, 9, 8, 7, 6, 5, 4, 2, 1]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, -8]], [[1, 2, 3, 4, 5, 6, 7, 43, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]], [[2, 3, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, 17, -1, 0, 1, 2, 3, 4, 5, 8, 10, 4, -7]], [[1, 2, 38, 3, 4, 5, 4, 4, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1, 38]], [[1, 1, 1, -1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 3, 1, 2]], [[1, 2, 3, 4, 5, 3, 2, 1, 1, 2, 3, 4, 5, 2]], [[1, 3, 2, 38, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 8, 9, 10, -3, -7]], [[39, 2, 40, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8]], [[1, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 22, 17, -8]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 5, 9, 9, 10, 10, 3]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, 23]], [[-10, -8, -8, -7, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7]], [[4, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 4, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 3, 5, 6, 7, 8, 28, 9, 10, 11, 12, 13, 14, 15, 35, 16, 17, 40, 18, 19, 20, 15]], [[-10, -9, -8, -7, -6, -5, -4, -3, 19, -1, 0, 1, 2, 3, 4, 5, 7, 8, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 7, 6, 5, 4, 2, 1, 8]], [[1, 2, 3, 3, 5, 6, 7, 8, 28, 9, 10, 11, 13, 14, 15, 35, 16, 17, 40, 18, 19, 20, 15]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 3, 3, 4, 5, 6, 7, 8, 9, 10, 0]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 10, 9, 4, 8, 7, 6, 5, 4, 3, 2]], [[-10, -8, -8, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, -5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 20, 18]], [[1, 2, 3, 5, 6, 8, 9, 10, 9, 9, 8, 7, 34, 5, 5, 4, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 36, 10, 11, 12, 13, 14, 15, 35, 16, 17, 20, 18, 19, 20, 15]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 39, -8, 9]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 23, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[1, 9, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 13, 15, 16, 17, 18, 20]], [[1, 1, 2, 2, 3, 3, 4, 5, 5, 23, 6, 7, 7, 8, 9, 9, 10, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 24, 40, 27]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 46, 6, 4]], [[-10, -9, -8, -7, -5, 27, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, -6, 45, 8, 9, 10, -3, -7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 9]], [[2, 7, 3, 5, 7, 3, 4, 9, 10, 8, 36, 6, 4, 2, 5, 10]], [[1, 0, 1, 1, 1, 3, 2, 2, 2, 2, 2, 27, 1, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 7, 10, 10, 9, 8, 7, 6, 5, 4, 2, 2, 10]], [[-10, -9, -8, -7, 18, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 10]], [[2, 3, 5, 7, 4, 3, 9, 8, 36, 6, 4, 2, 5, 36]], [[1, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, -8, 11]], [[2, 3, 1, 5, 7, 9, 10, 8, 6, -8, 5]], [[2, 36, 3, 1, 5, 7, 9, 10, 6, 4]], [[1, 2, 3, 4, 7, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 8, 10, 9, 4, 8, 7, 6, 5, 4, 3, 2]], [[-9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 50, -3]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[-10, -9, -8, -7, -6, -5, -4, -3, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, -3, -7, -7, -3, 9]], [[39, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 17, -8]], [[1, 2, 3, 46, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, -8, 14]], [[1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 1]], [[1, 2, 3, 4, 5, 6, 7, 7, 9, 10, -3, 10, 9, 8, 7, 3, 6, 5, 4, 2, 2, 10]], [[1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 27, 1, 47, 1, 1, 1, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 8, 49, 50, 18, 14]], [[-10, -8, -8, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, -5]], [[1, 1, 1, 1, 2, 2, 44, 2, 2, 1, 2, 1, 1, 1, 1, 3, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 9, 15, 16, 17, 30, 18, 19, 20, 3]], [[6, 1, 2, 3, 4, 2, 5, 6, 7, 8, 9, 10, -2, 9, 8, 6, 5, 4, 3, 2, 1]], [[1, 2, 22, 3, 4, 7, 4, 3, 4, 5, 4, 7, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 13, 15, 16, 17, 18, 20, 7]], [[1, 2, 3, 46, 5, 6, -3, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, -8, 14]], [[2, 36, 3, 1, 7, 9, 10, 6, 4]], [[39, 2, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8, 3]], [[1, 2, 3, 4, 5, 5, 7, 7, -2, 9, 10, -3, 10, 9, 8, 7, 3, 6, 5, 4, 2, 2, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 43, 12, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 8]], [[2, 36, 3, 25, 5, 7, 9, 10, 8, 6]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, -8, 2, 3, 3, 5, 6, 7, 8, 35, 9, 10, 50, -3, -8]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 3, 4, 5, 6, 7, -3, 8, 9, 10, 5]], [[-10, -9, -8, -7, -6, -5, 27, -3, -1, -9, 1, 2, 3, 3, 6, 5, 6, 7, -6, 8, 9, 10, -3, -7, -8]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 14, 15, 16, 17, 18, 20, 7]], [[0, 6, 1, 2, 3, 4, 2, 5, 6, 7, 8, 9, 10, -2, 9, 8, 6, 5, 4, 3, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -4, -2, -1, 0, 1, 2, 3, 4, 43, 5, 8, 9, 10, 4]], [[-10, -8, -8, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, -5, -8]], [[-10, -9, -8, -7, -6, -5, 45, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 10, -9, -9, -1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -10, 1, 2, 3, 3, 5, 7, 7, 9, 10, -3, 1]], [[39, 2, 3, 15, 3, 5, 49, 47, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8, 41, 3]], [[1, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 13, 15, 15, 16, 17, -8]], [[1, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 27, 1, 47, 1, 1, 1, 1, 1]], [[1, 17, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 3]], [[1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, -2, 20, 9]], [[2, 3, 1, 8, 5, 7, 9, 10, 8, 6, -8, 6]], [[-10, -9, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, -9, 6, 7, -6, 31, 8, 9, 10, -3, -7, 8, -6, -7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 12, 13, 15, 16, 17, 18, 20, 16, 15]], [[-10, -9, -8, -7, -5, -4, -3, -5, 17, -1, 0, 1, 2, 3, 4, 5, 8, 10, 4, -7, 4]], [[2, 3, 1, 5, 7, 9, 10, 30, 8, 6, 4, 6]], [[-10, -8, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, -5, -8]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 9, 8, 6, 5, 4, 3, 2, 1, 9]], [[-10, -10, -8, -7, -6, -5, -4, -2, -1, 0, 1, 3, 4, 5, 6, 7, -3, 8, 9, 10]], [[1, 1, 1, 1, 2, 2, 44, 2, 2, 1, 2, 1, 1, 1, 1, 21, 3, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 13, 16, 17, 18, 20]], [[3, 2, 13, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 10]], [[31, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 3, 3, 1, 3, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, 17, -1, 0, 1, 2, 3, 4, 5, 8, 10, 4, -7, -9]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 8, 10, 9, 4, 8, 7, 6, 5, 4, 3, 2, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 1, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[2, 3, 1, 5, 7, 4, 9, 20, 8, -9, 36, 6, 4, 2, 5, 6]], [[2, 8, 1, 5, 7, 9, 10, 8, 6, -8, 5]], [[2, 7, 3, 5, 7, 3, 4, 9, 10, 8, 36, 6, 4, 2, 5, 10, 7]], [[2, 8, 1, 5, 7, 9, 10, 8, 6, -8, 5, 1]], [[31, 1, 1, 1, 1, 20, 2, 2, 2, 2, 1, 2, 1, 1, 1, 3, 1, 3, 3]], [[1, 2, 4, 5, 6, -1, 7, 9, 10, 10, 9, 8, 7, 6, 5, 2, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 3, 2, 1]], [[-10, -9, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, -9, 6, 7, -6, 31, 8, 9, 10, -3, -7, 8, -6, -7, -9]], [[2, 3, 1, 5, 7, 9, 18, 8, 6, 4, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 2, 11, 12, 38, 13, 15, 16, 17, 18, 20]], [[-10, -8, 2, -5, -3, -2, 39, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 1, -7, -5, -8]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10]], [[1, 2, 12, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5]], [[1, 37, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 37, 2]], [[1, 1, 1, -1, 1, 2, 2, 2, 2, 1, 46, 2, 1, 1, 1, 3, 1, 2, -1]], [[7, 2, 36, 3, 1, 5, 7, 10, 6, 4]], [[-10, -9, -8, -7, -6, 32, 27, -3, -1, -9, 1, 2, 3, 3, 5, -9, 6, -8, 7, -6, 31, 8, 9, 10, -3, -7, 8]], [[1, 2, 3, 3, 5, 7, 7, 8, 10, 1, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 6]], [[2, 3, 5, 7, 4, 3, 9, 8, 36, 4, 2, 5, 36]], [[1, 2, 3, 3, 5, 6, 7, 8, 9, 36, 10, 11, 12, 13, 14, 15, 35, 16, 17, 20, 18, 19, 20, 15, 20]], [[-10, -9, -7, -6, -5, -4, -3, -2, -1, 0, 1, 5, 2, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 1, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1, 4, 5]], [[1, 2, 3, 3, 5, 6, 7, 8, 28, 9, 10, 11, 12, 13, 14, 15, 35, 16, 17, 40, 18, 19, 20, 15, 18]], [[1, 2, 22, 0, 3, 4, 7, 3, 4, 5, 4, 7, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, -6, 5, 4, 3, 2, 7]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 23, 10, 6, 7, 8, 8, 9, 9, 10, 10, 2]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10, 4, -1]], [[2, 3, 1, 5, 7, 9, 10, 8, 7, 6, 23]], [[1, 2, 1, 3, 4, 5, 4, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 4, 1, 4, 5]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 8, 10, 9, 4, 8, 7, 6, 4, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 23, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 39]], [[1, 2, 3, 4, 5, 6, 44, 7, 8, 9, 2, 11, 12, 13, 15, 16, 17, 18, 20, 7]], [[12, 1, 2, 22, 0, 3, 4, 7, 3, 4, 5, 4, 7, 3, 4, 5, 4, 3, 2, 1, 4]], [[2, 13, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 4, 2]], [[2, 3, 1, 5, 0, 7, 9, 10, 8, 6, 4, 10]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 39]], [[1, 2, 3, 4, 5, 4, 3, 4, 3, 4, 5, 4, 3, 2, 1]], [[1, 2, 4, 5, 6, 7, 7, 9, 10, 0, 10, 9, 4, 8, 7, 6, 5, 4, 3, 2, 4]], [[-10, -8, -8, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, -5, 1]], [[2, 3, 3, 5, 21, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 11, 19, 20, 3, 3]], [[2, 3, 1, 5, 7, 9, 25, 8, 6, 4]], [[-10, -9, -7, -6, -5, -4, -3, -2, -1, 0, 1, 3, 4, 5, 6, 7, 8, 9, 10]], [[1, 2, 3, 3, 5, 7, 7, 17, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 39, -8, 9]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 6, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -8, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 10, -8]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[2, 34, 1, 5, 0, 7, 9, 10, 8, 6, 4, 0]], [[2, 13, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 4]], [[1, 2, 4, 5, 6, 7, 6, 9, 10, 10, 9, 10, 4, 8, 7, 6, 5, 4, 3, 2]], [[1, 37, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 37, 2, 1]], [[1, 17, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 3, 10]], [[1, 5, 4, 3, 4, 5, 6, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 8]], [[2, 1, 5, 7, 9, 10, 8, 6, 23, 9]], [[-10, -9, -8, -7, 18, -6, -5, -4, -3, -2, -1, 0, 1, 7, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8, 3, -10]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6]], [[1, 2, 3, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 4, 6, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1]], [[2, 3, 30, 1, 5, 7, 9, 10, 8, 6, 9, 4, 2, 1]], [[2, 1, 5, 0, 7, 9, 10, 8, 6, 4, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 6, 5, 3, 2, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 7]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 8, 9, 10, 50, -3, -3]], [[2, 7, 3, 5, 7, 3, 4, 10, 8, 36, 6, 4, 2, 5, 10, 7]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 4, 4]], [[-10, -9, -8, 33, -7, -6, -5, -4, -3, -2, -1, -9, 33, 1, 2, 3, 3, 5, 6, -3, 7, 9, 10, 50, -3, -1]], [[1, 2, 4, 5, 6, 7, 6, 11, 9, 10, 10, 9, 10, 4, 8, 7, 6, 5, 4, 3, 2]], [[-10, -9, -8, 33, -7, 49, -5, -4, -3, -2, -1, -9, 33, 1, 2, 3, 3, 5, 6, -3, 7, 9, 10, 50, -3, -1]], [[2, 3, 5, 7, 4, 3, 9, 10, 8, 6, 4, 2, 5, 36]], [[6, 1, 2, 4, 5, 6, 7, 8, 9, 10, -1, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[2, 3, 1, 5, 7, 4, 9, 8, 36, 6, 4, 2]], [[-10, -9, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 3, 6]], [[0, 6, 1, 2, 3, 21, 4, 2, 5, 6, 7, 8, 9, 10, -2, 9, 8, 6, 5, 4, 3, 2, 1]], [[2, 47, 36, 3, 1, 5, 7, 9, 10, 8, 6, 4]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 1]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 2, 23, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 7, 21, 10, 10, 9, 8, 7, 6, 5, 4, 2, 2, 10]], [[1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 6, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 6]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 29, 23, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 39]], [[3, 2, 5, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 1, 9]], [[6, 1, 2, 4, 6, 6, 7, 8, 9, 10, -1, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 5, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 32, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 14, 13]], [[1, 3, 3, 5, 6, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8, 3]], [[1, 3, 4, 5, 23, 7, 7, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 10, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 6, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 31]], [[1, 2, 3, 4, 5, 6, 7, 8, 40, 9, 2, 11, 12, 13, 15, 16, 17, 18, 20]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 49]], [[1, 1, 1, 0, 1, 2, 38, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 45, 6, 4, 4]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 3, 15]], [[1, 2, 4, 5, 6, 7, 6, 11, 9, 10, 10, 9, 24, 4, 8, 7, 6, 5, -6, 3, 2]], [[1, 1, 1, 1, 2, 2, 44, 3, 2, 1, 2, 1, 1, 1, 1, 3, 1]], [[4, 1, 1, 2, 2, 3, 4, 4, 5, 5, 4, 6, 6, 7, 7, 8, 8, 9, 10, 10, 10]], [[1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 1, 1]], [[1, 2, 3, 4, 5, 6, 7, 32, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, -5, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[3, 1, 5, 9, 10, 8, 36, 6, 4, 2, 5]], [[6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 23, 7, 6, 7, 7, 8, 8, 9, 9, 10, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 5, 4, 1]], [[1, 2, 3, 5, 29, 7, 8, 9, 10, 9, 9, 7, 6, 5, 4, 2, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 1, 7, 8, 9, 10]], [[1, 1, 1, 1, 1, 2, 2, 44, 2, 2, 1, 2, 1, 1, 1, 1, 21, 3, 1]], [[-6, 1, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 5, 7, 7, 8, 8, 9, 9, 10, 10, 2]], [[1, 1, 1, 1, 2, 2, 44, 2, 2, 0, 2, 1, 1, 1, 1, 21, 3, 1]], [[2, 3, 30, 1, 5, 7, 9, 10, 8, 6, 9, 4, 2, 2]], [[6, 2, 3, 4, 5, 6, 7, 8, 2, 11, 12, 14, 15, 16, 17, 18, 20, 7]], [[-10, -9, -8, -7, -6, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 1, 7, 8, 9, 10]], [[39, 2, 3, 3, 5, 7, 17, 8, 9, 10, 11, 12, 13, 15, 15, 16, 17, -8, 3]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 2, 3, 4, 18, 6, 7, 8, 29, 9, 10]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 3, 2, 1]], [[1, 2, 3, 4, 7, 4, 3, 4, 5, 4, 40, 3, 4, 5, 4, 3, 2, 1]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 18, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 23, 41, 42, 43, 45, 46, 47, 48, 49, 50]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, -9, 1, -8, 2, 3, 3, 5, 6, 7, 8, 35, 9, 10, 50, -3, -8, 6]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 23, 26, 27, 28, 13, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 45, 46, 40, 47, 48, 49, 50, 46]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 33, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 11, 12, 13, 16, 17, 12, 18, 20]], [[1, 3, 1, 5, 7, 9, 10, 8, 6, 4, 6, 1]], [[-10, -9, -8, 33, -7, -6, -5, -4, -3, -2, -1, -9, 33, 1, 2, 3, 3, 1, 6, -3, 7, 9, 10, 50, -3, -3]], [[-10, -8, -8, -7, 2, -5, -4, -3, -2, -1, -9, 1, 2, 3, 3, 5, 6, 7, 9, 10, -3, 6, 1, -7, 3]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -8, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10, 4, -1, -10]], [[1, 2, 3, 4, 6, 7, 8, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 50, 1, 3, 4]], [[6, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -2, 9, 8, 7, 6, 5, 4, 3, 2, 1, 7]], [[49, 3, 1, 5, 0, 7, 9, 10, 8, 6, 4, 10, 5]], [[-10, -9, -8, -7, 18, -6, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 10]], [[-10, -9, -8, -7, 18, -6, -5, -4, -3, -2, -1, 10, 0, 1, 7, 2, 3, 4, 5, 6, 7, 8, 9, 10, -8]], [[1, 1, 1, 1, 2, 2, 44, 3, 2, 1, 2, 1, 1, 1, 0, 1, 3, 1]], [[-10, -9, -8, -7, -6, -5, -4, -3, -1, -9, 6, 8, 1, 2, 3, 7, 5, 6, 7, 8, 9, 10, -3, -7]], [[1, 2, 3, 4, 5, 6, 7, 32, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 45, 46, 47, 48, 49, 50, 14, 13, 5]], [[1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 23, 10, 6, 7, 7, 8, 8, 9, 9, 10, 9, 10, 2]], [[-10, -9, -8, -7, -6, -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 7, 8, 9, 10, -3, -7]], [[1, 1, 2, 6, 2, 3, 3, 4, 4, 5, 5, 23, 6, 7, 7, 8, 8, 9, 9, 10, 10, 7]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 2, 8, 6, 5, 3, 2, 1, 5]], [[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 14, 15, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 18, 29, 31, 32, 33, 34, 35, 37, 38, 40, 23, 41, 42, 43, 45, 46, 47, 48, 19, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 6, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 15, 45, 46, 47, 4, 49, 50]], [[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 25, 11, 12, 13, 14, 15, 16, 17, 18, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 13, 29, 30, 31, 32, 33, 1, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]], [[2, 13, 5, 7, 7, 4, 9, 10, 8, 36, 6, 4, 2, 5, 4, 9]], [[-10, -10, 23, -7, -6, -5, -4, -2, 0, 1, 3, 4, 5, 6, 7, -3, 8, 9, 10, 10]], [[1, 2, 3, 5, 6, 8, 9, 10, 9, 9, 8, 7, 34, 5, 5, 9, 2, 1]], [[1, 2, 3, 4, 6, 6, 7, 8, 9, 10, 10, 9, 8, 7, 6, 4, 3, 2, 1, 2]], [[2, 3, 5, 7, 4, 3, 9, 10, 8, 36, 6, 2, 5, 36, 5, 5]], [[-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 8, 9, 10, 3]], [[2, 13, 5, 7, 7, 4, 9, 10, 8, -9, 36, 6, 4, 2, 5, 4, 9]]], "completion": "\n\nimport numpy as np\n\ndef smallest_change(arr):\n \"\"\"\n Given an array arr of integers, find the minimum number of elements that\n need to be changed to make the array palindromic. A palindromic array is an array that\n is read the same backwards and forwards. In one change, you can change one element to any other element.\n\n For example:\n smallest_change([1,2,3,5,4,7,9,6]) == 4\n smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\n smallest_change([1, 2, 3, 2, 1]) == 0\n \"\"\"\n length = len(arr)\n if length == 0 or length == 1:\n return 0\n elif length == 2:\n return 0 if arr[0] == arr[1] else 1\n else:\n return np.sum(np.array(arr) != np.array(arr[::-1])) // 2\n \n", "raw_completion": "```python\n\nimport numpy as np\n\ndef smallest_change(arr):\n \"\"\"\n Given an array arr of integers, find the minimum number of elements that\n need to be changed to make the array palindromic. A palindromic array is an array that\n is read the same backwards and forwards. In one change, you can change one element to any other element.\n\n For example:\n smallest_change([1,2,3,5,4,7,9,6]) == 4\n smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\n smallest_change([1, 2, 3, 2, 1]) == 0\n \"\"\"\n length = len(arr)\n if length == 0 or length == 1:\n return 0\n elif length == 2:\n return 0 if arr[0] == arr[1] else 1\n else:\n return np.sum(np.array(arr) != np.array(arr[::-1])) // 2\n \n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef smallest_change(arr):\n \"\"\"\n Given an array arr of integers, find the minimum number of elements that\n need to be changed to make the array palindromic. A palindromic array is an array that\n is read the same backwards and forwards. In one change, you can change one element to any other element.\n\n For example:\n smallest_change([1,2,3,5,4,7,9,6]) == 4\n smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\n smallest_change([1, 2, 3, 2, 1]) == 0\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/74", "prompt": "\ndef total_match(lst1, lst2):\n '''\n Write a function that accepts two lists of strings and returns the list that has \n total number of chars in the all strings of the list less than the other list.\n\n if the two lists have the same number of chars, return the first list.\n\n Examples\n total_match([], []) \u279e []\n total_match(['hi', 'admin'], ['hI', 'Hi']) \u279e ['hI', 'Hi']\n total_match(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) \u279e ['hi', 'admin']\n total_match(['hi', 'admin'], ['hI', 'hi', 'hi']) \u279e ['hI', 'hi', 'hi']\n total_match(['4'], ['1', '2', '3', '4', '5']) \u279e ['4']\n '''\n", "entry_point": "total_match", "canonical_solution": "\n c1, c2 = sum(map(lambda s: len(s), lst1)), sum(map(lambda s: len(s), lst2))\n return lst1 if c1 <= c2 else lst2\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate([], []) == []\n assert candidate(['hi', 'admin'], ['hi', 'hi']) == ['hi', 'hi']\n assert candidate(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) == ['hi', 'admin']\n assert candidate(['4'], ['1', '2', '3', '4', '5']) == ['4']\n assert candidate(['hi', 'admin'], ['hI', 'Hi']) == ['hI', 'Hi']\n assert candidate(['hi', 'admin'], ['hI', 'hi', 'hi']) == ['hI', 'hi', 'hi']\n assert candidate(['hi', 'admin'], ['hI', 'hi', 'hii']) == ['hi', 'admin']\n\n\n # Check some edge cases that are easy to work out by hand.\n assert True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate([], ['this']) == []\n assert candidate(['this'], []) == []\n\n", "contract": "\n assert type(lst1) == type(lst2) == list, \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) == str for x in lst1), \"invalid inputs\" # $_CONTRACT_$\n assert all(type(x) == str for x in lst2), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[[], []], [["hi", "admin"], ["hi", "hi"]], [["hi", "admin"], ["hi", "hi", "admin", "project"]], [["4"], ["1", "2", "3", "4", "5"]], [["hi", "admin"], ["hI", "Hi"]], [["hi", "admin"], ["hI", "hi", "hi"]], [["hi", "admin"], ["hI", "hi", "hii"]], [[], ["this"]], [["this"], []]], "atol": 0, "plus_input": [[[""], ["hello"]], [["hello", "world"], ["hi", "there"]], [["coding", "is", "fun"], ["coding", "is", "awesome"]], [["abc"], ["abcdefghijklmnopqrstuvwxyz"]], [["happy", "new", "year"], ["merry", "christmas"]], [["happy", "new", "year"], ["happy", "new", "year", "2022"]], [["happy", "birthday", "sarah"], ["happy", "birthday", "sally"]], [["cat", "dog", "bird"], ["apple", "banana", "orange"]], [["kevin", "jessica", "lucas"], ["adam", "michael", "smith"]], [["1", "2", "3", "4"], ["one", "two", "three"]], [["christmas", "michael", "smith", "smith"], ["christmas", "michael", "smith", "smith"]], [["coding", "is", "fun", "coding"], ["coding", "is", "awesome"]], [["coding", "is", "codig", "fun", "coding"], ["codogding", "coding", "is", "awesome"]], [["coding", "is", "cocding", "awesome"], ["coding", "is", "cocding", "awesome"]], [["happy", "birthday", "one", "sally"], ["happy", "birthday", "one", "sally"]], [["coding", "is", "isorange", "fun"], ["coding", "is", "awesome"]], [["merdogry", "merry"], ["merdogry", "merry"]], [["2", "kevin", "jessica", "lucas"], ["adam", "michael", "smith"]], [["coding", "is", "codig", "fun", "coding"], ["codogding", "coding", "is", "awesome", "awesome"]], [["hello", "world"], ["cathi", "there"]], [[""], ["hello", "hello"]], [["coding", "is", "awesome", "is"], ["coding", "is", "awesome", "is"]], [["three", "2022", "dog", "birbananad"], ["three", "2022", "dog", "birbananad"]], [[], []], [["is", "awesome"], ["is", "awesome"]], [["bananaone"], ["bananaone"]], [["cat", "dog", "bird"], ["apple", "aple", "banana", "orange"]], [["happy", "birthday", "sally"], ["happy", "birthday", "sally"]], [["cathi", "there", "chathi", "there"], ["cathi", "there", "chathi", "there"]], [["happy", "birthday", "merry", "one", "sally"], ["happy", "birthday", "merry", "one", "sally"]], [["lly", "birhday", "happy", "birthday", "sally", "sally"], ["lly", "birhday", "happy", "birthday", "sally", "sally"]], [["kevin", "jessica", "lucas"], ["kevin", "jessica", "lucas"]], [["happy", "sally"], ["happy", "sally"]], [["allyc", "abc"], ["abcdefghijklmnopqrstuvwxyz"]], [["happy", "sally", "happy"], ["happy", "sally", "happy"]], [["coding", "codinghello", "is", "2", "is"], ["coding", "codinghello", "is", "2", "is"]], [["cathi", "there", "ccathi", "chathi", "chathi"], ["cathi", "there", "ccathi", "chathi", "chathi"]], [["kevin", "jessica", "lucas"], ["adam", "dogmichael", "smith"]], [["cahi", "there", "chathi", "there", "hcahi"], ["cahi", "there", "chathi", "there", "hcahi"]], [["allyc", "ab", "abc"], ["abcdefghijklmnopqrstuvwxyz"]], [["awesome", "is"], ["awesome", "is"]], [["2", "kevin", "jessica", "lucas"], ["michael", "smith"]], [["world"], ["there"]], [["happy", "birthday", "merry", "one"], ["happy", "birthday", "merry", "one"]], [["alucaspple", "banana", "orange"], ["alucaspple", "banana", "orange"]], [["happy", "new", "year", "2022"], ["happy", "new", "year"]], [["sally"], ["sally"]], [["cahi", "there", "chathi", "there", "hcahi", "hcahi"], ["cahi", "there", "chathi", "there", "hcahi", "hcahi"]], [["coding", "is", "codig", "fun", "coding", "codig", "is"], ["coding", "is", "codig", "fun", "coding", "codig", "is"]], [["happy", "birthday", "cathappy", "sally", "happy"], ["happy", "birthday", "cathappy", "sally", "happy"]], [["is"], ["is"]], [["alucaspple", "banana", "orange", "alucaspple"], ["alucaspple", "banana", "orange", "alucaspple"]], [["happy", "dogmichael", "new", "year", "2022", "dogmichael"], ["happy", "dogmichael", "new", "year", "2022", "dogmichael"]], [["2", "kevin", "lucas"], ["adam", "michael", "smith", "smith"]], [["cat", "doccathig", "bird", "doccathig"], ["cat", "doccathig", "bird", "doccathig"]], [["happy", "birthday", "merry", "e", "sally"], ["happy", "birthday", "merry", "e", "sally"]], [["world", "sally"], ["world", "sally"]], [["coding", "is", "fun", "cabcoding", "coding"], ["coding", "is", "fun", "cabcoding", "coding"]], [["is", "awesome", "awesome"], ["is", "awesome", "awesome"]], [["birthdaallycy", "sally"], ["birthdaallycy", "sally"]], [["cahi", "there", "chathi", "there", "orange", "hcahi", "hcahi"], ["cahi", "there", "chathi", "there", "orange", "hcahi", "hcahi"]], [["coding", "is", "codig", "fun", "chathicoding", "codnewing", "codig", "is"], ["coding", "is", "codig", "fun", "chathicoding", "codnewing", "codig", "is"]], [["1", "2", "3", "4"], ["one", "two", "three", "two"]], [["birthdaallycy", "sally", "sally"], ["birthdaallycy", "sally", "sally"]], [["coding", "is", "isorange", "fun"], ["coding", "is", "iis", "awesome"]], [["coding", "codinghello", "is", "cmerryodinghello", "2", "is"], ["coding", "codinghello", "is", "cmerryodinghello", "2", "is"]], [["kevin", "jessica", "lucas1", "lucas"], ["adam", "michael", "smith"]], [["sbananaally", "sally"], ["sbananaally", "sally"]], [["is", "awesome", ""], ["is", "awesome", ""]], [["newsally", "sbananaally", "sally"], ["newsally", "sbananaally", "sally"]], [["iis", "coding", "is", "fun", "coding"], ["coding", "is", "awesome"]], [["iis", "coding", "is", "fun", "coding"], ["iis", "coding", "is", "fun", "coding"]], [["happy", "sallly", "sally", "happy"], ["happy", "sallly", "sally", "happy"]], [["newsally", "sbananaally", "sally", "sbananaally"], ["newsally", "sbananaally", "sally", "sbananaally"]], [["two", "three", "two"], ["two", "three", "two"]], [["hellobananaone", "bananaone"], ["hellobananaone", "bananaone"]], [["thr", "three", "two"], ["thr", "three", "two"]], [["coding", "codinghello", "is", "cmerryodinghello", "2", "is", "2"], ["coding", "codinghello", "is", "cmerryodinghello", "2", "is", "2"]], [["2", "22", "kevin", "lucas"], ["2", "22", "kevin", "lucas"]], [["christmas", "michaechristmasl", "smith", "smith"], ["christmas", "michaechristmasl", "smith", "smith"]], [["bananaonee", "hellobananaone", "bananaone", "allyc", "hellobananaone"], ["bananaonee", "hellobananaone", "bananaone", "allyc", "hellobananaone"]], [["kevin", "jessica", "codnewing"], ["kevin", "jessica", "codnewing"]], [["cathappy"], ["okbeHIFbKz", "doccathig"]], [["saylly"], ["saylly"]], [["cathappy"], ["okbeHIFbKz"]], [["bananaon", "bananaone"], ["bananaon", "bananaone"]], [["one", "two", "three", "two"], ["one", "two", "three", "two"]], [["coding", "codinghello", "is", "cmerryodinghello", "2", "codin", "is", "2"], ["coding", "codinghello", "is", "cmerryodinghello", "2", "codin", "is", "2"]], [["one", "twoo", "thre", "two"], ["one", "twoo", "thre", "two"]], [["coding", "is", "isorange", "fun"], ["is", "awesome", "awesome"]], [["christmas", "michaechristmasl", "smith"], ["christmas", "michaechristmasl", "smith"]], [["one", "twoo", "onesally", "thre", "two", "one"], ["one", "twoo", "onesally", "thre", "two", "one"]], [["iis", "coding", "is", "fun", "coding"], ["is", "awesome"]], [["cahi", "there", "chathi", "michaelahi"], ["cahi", "there", "chathi", "michaelahi"]], [["happy", "hbirthday", "birthday", "merry", "one"], ["happy", "hbirthday", "birthday", "merry", "one"]], [["sbananaally", "sally", "sally"], ["sbananaally", "sally", "sally"]], [[], ["okbeHIFbKz"]], [["cahi", "there", "chathi", "michaelhahi"], ["cahi", "there", "chathi", "michaelhahi"]], [["coding", "is", "isorange", "fun"], ["aawesome", "coding", "is", "iis", "awesome"]], [["twoo", "thre", "two"], ["twoo", "thre", "two"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"]], [["hello", "world", "how", "are", "you"], ["HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ"]], [["apple", "banana", "cherry", "date"], ["Apple", "Banana", "Cherry", "Date"]], [[], ["hi", "admin"]], [["hello", "world", "how", "are", "you"], [""]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["hi", "admin"], ["how", "are", "yoU"]], [["12345", "56789"], ["9876543210"]], [["abcdefg", "hijklmnop", "qrstuvwxy", "z"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "1234567890"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ"]], [["", "banana", "cherry", "Lorem", "date"], ["", "banana", "cherry", "Lorem", "date"]], [["AbCdEfG", "HijKlMnOp", "QrStUv", "WxworldyZ"], ["AbCdEfG", "HijKlMnOp", "QrStUv", "WxworldyZ"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "Lorem"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "Lorem"]], [["abcdefg", "hijknlmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "Lorem", "cherry"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "Lorem", "cherry"]], [["abcdefg", "hijknlmnop", "qrstuv", "wxyz"], ["The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "Lorem", "elit"]], [["abcdefg", "hijklmnop", "yoU", "qrstuvwxy", "z"], ["abcdefg", "hijklmnop", "yoU", "qrstuvwxy", "z"]], [[""], [""]], [["The", "quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "over", "The"], ["The", "quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "over", "The"]], [["12345", "56789", "56789"], ["12345", "56789", "56789"]], [["", "datqrstuve", "banana", "cherry", "date", "Lorem"], ["", "datqrstuve", "banana", "cherry", "date", "Lorem"]], [["AbCdEfG", "HijKlMnOp", "QrStUv", "WxworldyZ", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "QrStUv", "WxworldyZ", "HijKlMnOp"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem"], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem"]], [["hello", "world", "how", "are", "you"], ["HELLO", "WORLD", "ARE", "YOU"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "wxyz"]], [["98765432170", "9876543210"], ["98765432170", "9876543210"]], [["", "datqrstuve", "banana", "cherry", "date", "cherhry", "Lorem"], ["", "datqrstuve", "banana", "cherry", "date", "cherhry", "Lorem"]], [["9876543210"], ["9876543210"]], [["56789", "56789"], ["9876543210"]], [["", "datqrstuve", "cherry", "Lorem", "date", "Lorem"], ["", "datqrstuve", "cherry", "Lorem", "date", "Lorem"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["987650", "98765432170", "9876543210", "987650"], ["987650", "98765432170", "9876543210", "987650"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "wxyz"]], [["abcdefg", "hijklmnop", "Lorem"], ["abcdefg", "hijklmnop", "Lorem"]], [["HELLHO", "5678hello9", "HELLO"], ["HELLHO", "5678hello9", "HELLO"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "WxyZ"]], [["", "banana", "cherry", "Lorem", "date", "Lorem"], ["", "banana", "cherry", "Lorem", "date", "Lorem"]], [["hello", "world", "how", "are", "you"], ["HELLO", "WORLD", "AERE", "YOU"]], [["", "datqrstuve", "cherry", "LoremWxworldyZ", "date", "Lorem", "datqrstuve"], ["", "datqrstuve", "cherry", "LoremWxworldyZ", "date", "Lorem", "datqrstuve"]], [["Loorem", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"], ["Loorem", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"]], [["hello", "world", "how", "are", "you", "how"], ["hello", "world", "how", "are", "you", "how"]], [["12345", "56789", "12345"], ["12345", "56789", "12345"]], [["abcdefg", "hijknlmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "5678hello9"]], [["9876543210", "9876543210"], ["9876543210", "9876543210"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["wxyhijklmnop", "abcdefg", "hijknlmnop", "qrstuv", "wxyz"]], [["hello", "world", "how", "are"], ["HELLO", "WORLD", "AERE", "YOU"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry"]], [["apple", "banana", "date98765432170", "cherry", "date"], ["apple", "banana", "date98765432170", "cherry", "date"]], [["brown"], ["brown"]], [["abcdefg", "hijklmnop", "qrstuv", "himnop", "wxyz", "hijklmnop", "hijklmnop"], ["HijKlMnOp", "QrStUv", "WxyZ"]], [["hello", "world", "how", "are", "hello"], ["hello", "world", "how", "are", "hello"]], [["ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"], ["ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890"]], [["wxyhijklmnop", "abcdefg", "hijknlmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["5679", "12345", "56789", "56789"], ["5679", "12345", "56789", "56789"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "QrStUvWxyZ"]], [["sit", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["sit", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["i", "admin"], ["how", "are", "yoU"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"]], [["hello", "world", "hohw", "are", "you"], ["hello", "world", "hohw", "are", "you"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "Lorem", "elit"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "Lorem", "elit"]], [["abcdefg", "hijklnmnop", "qrstuv", "wxyz", "qrstuv", "abcdefg"], ["WxyZHOW", "AbCdEfG", "HijKlMnOp", "WxyZ"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry"], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry"]], [["", "datqrstuve", "banana", "cherry", "date", "cherry", "cherry"], ["", "datqrstuve", "banana", "cherry", "date", "cherry", "cherry"]], [["The", "UuVvWwXxYZz", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "UuVvWwXxYZz", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["5679", "12345", "56789", "56789", "12345", "12345"], ["5679", "12345", "56789", "56789", "12345", "12345"]], [["QrStUvWxyZ", "5678hello9", "cherry", "Lorem", "date", "Lorem", "cherry"], ["QrStUvWxyZ", "5678hello9", "cherry", "Lorem", "date", "Lorem", "cherry"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "wxyz"], ["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "wxyz"]], [["The", "HijKlMnOp", "HijKlMnOip", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "HijKlMnOp", "HijKlMnOip", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["12345", "56789", "56789", "12345", "12345", "12345"], ["12345", "56789", "56789", "12345", "12345", "12345"]], [["LO", "HELLO", "WORLD", "1elit0", "YOU"], ["LO", "HELLO", "WORLD", "1elit0", "YOU"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "Lorem", "elit", "elit"]], [["The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv"], ["z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv"]], [["hello", "world", "how", "are", "hello", "world"], ["hello", "world", "how", "are", "hello", "world"]], [["abcdefg", "hijklmnop", "qrstuv"], ["AadipiscingbCdEfG", "HijKlMnOp", "WxyZ"]], [["HijKlMnOp", "WxyZ", "AadipiscingbCdEfG"], ["HijKlMnOp", "WxyZ", "AadipiscingbCdEfG"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem"]], [["", "datqrstuve", "banana", "jumpste", "chherry", "date", "Lorem"], ["", "datqrstuve", "banana", "jumpste", "chherry", "date", "Lorem"]], [["", "banana", "cherry", "Lorem"], ["", "banana", "cherry", "Lorem"]], [["wxyhijklmnop", "9876543210"], ["wxyhijklmnop", "9876543210"]], [["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU"], ["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "elit"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "elit"]], [["apple", "1elit0", "cherry", "date", "1elit0"], ["apple", "1elit0", "cherry", "date", "1elit0"]], [["Loorem", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"], ["Loorem", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "datqrstuve"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "datqrstuve"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "over", "elit", "amet"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "over", "elit", "amet"]], [["HijKlMnOp", "WxyZconsectetur", "AadipiscingbCdEfG"], ["HijKlMnOp", "WxyZconsectetur", "AadipiscingbCdEfG"]], [["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop"], ["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop"]], [["Loorem", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"], ["Loorem", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"]], [["datqrstuve", "banana", "cherry", "Lorem", "Lorem"], ["datqrstuve", "banana", "cherry", "Lorem", "Lorem"]], [["", "banana", "adidolorg", "cherry", "Lorem"], ["", "banana", "adidolorg", "cherry", "Lorem"]], [["HijKlMnOp", "dolor", "WxyZ", "ZWxyZ", "AadipiscingbCdEfG"], ["HijKlMnOp", "dolor", "WxyZ", "ZWxyZ", "AadipiscingbCdEfG"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "AREwxyz", "AREwxyz"]], [["abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz"], ["abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz"]], [["brrown", "brrrown", "brown"], ["brrown", "brrrown", "brown"]], [["hello", "world", "hohw", "are", "you", "hohw"], ["hello", "world", "hohw", "are", "you", "hohw"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "yoU", "Lorem", "cherry", ""], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "yoU", "Lorem", "cherry", ""]], [["", "thee", "cherry", "Lorem", "date", "Lorem"], ["", "thee", "cherry", "Lorem", "date", "Lorem"]], [["hello", "world", "how", "are", "you"], ["HELLO", "the", "WORLD", "AERE", "YOU"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["nAadipiscingbCdEfG"], ["nAadipiscingbCdEfG"]], [["Loorem", "", "ddate", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"], ["Loorem", "", "ddate", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"]], [["AbCdEfG", "HijKlMnOp", "WxydolorZ", "QrStUv", "WxyZ", "AbCdEfG"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["98765432170", "AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv", "hijknlmnop"], ["z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv", "hijknlmnop"]], [["hi", "admin", "admin"], ["are", "yoU"]], [["The", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["The", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["apple", "cherry", "date", "1elite0", "1elit0"], ["apple", "cherry", "date", "1elite0", "1elit0"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxoverz", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxoverz", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["datqrstuve", "brown", "cherry", "Lorem", "Lorem"], ["datqrstuve", "brown", "cherry", "Lorem", "Lorem"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "QrStUvWxyZ"]], [["wxyhijklmnop", "AadipiscingbCdEfG"], ["wxyhijklmnop", "AadipiscingbCdEfG"]], [["how", "are", "yoU"], ["1elit0i", "adm1elHELLHOit0in", "i", "admin"]], [["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv"], ["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv"]], [["WxyZ", "hello", "AadipiscingbCdEfG"], ["WxyZ", "hello", "AadipiscingbCdEfG"]], [["The", "UuVvWwXxYZz", "HijKlMOip", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "WxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["The", "UuVvWwXxYZz", "HijKlMOip", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "WxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["wxyhijklmnop", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "wxyhijklmnop"], ["wxyhijklmnop", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "wxyhijklmnop"]], [["WxyZ", "hello", "AadipiscingbCdEfG", "hello"], ["WxyZ", "hello", "AadipiscingbCdEfG", "hello"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "QrStUvWxyZ", "1234567890"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "QrStUvWxyZ", "1234567890"]], [["1elHELLHOit0", "world", "hohw", "are", "you"], ["1elHELLHOit0", "world", "hohw", "are", "you"]], [["brown", "brown"], ["brown", "brown"]], [["qrstuvwxy", "9876543210", "98765432170"], ["qrstuvwxy", "9876543210", "98765432170"]], [["i", "HijKlMnOp", "WxyZ", "AadipiscingbCdEfG"], ["i", "HijKlMnOp", "WxyZ", "AadipiscingbCdEfG"]], [["AadipiscingbCdEfG", "HijKlMnOp", "WxyZ"], ["AadipiscingbCdEfG", "HijKlMnOp", "WxyZ"]], [["", ""], ["", ""]], [["hello", "apple", "hohw", "are", "you"], ["hello", "apple", "hohw", "are", "you"]], [["The", "UuVvWwXxYZz", "ThQrStUvWHijKlMnOpxyZ", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "The"], ["The", "UuVvWwXxYZz", "ThQrStUvWHijKlMnOpxyZ", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "The"]], [["hi", "admin", "admin"], ["hi", "admin", "admin"]], [["abcdefg", "", "qrstuv", "wxyz"], ["AbCdEffG", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["AadipiscingbCdEfG", "WxyxZ"], ["AadipiscingbCdEfG", "WxyxZ"]], [["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "Y1elHELLHOit0OU"], ["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "Y1elHELLHOit0OU"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "ipsum", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "ipsum", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"]], [["agbcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["abcdefg", "", "rqrstuv", "wxyz"], ["abcdefg", "", "rqrstuv", "wxyz"]], [["hi", "date", ""], ["hi", "date", ""]], [["", "datqrstuve", "banana", "cherry", "Lorem", "Thedate", "cherry", "cherry", "cherry"], ["", "datqrstuve", "banana", "cherry", "Lorem", "Thedate", "cherry", "cherry", "cherry"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp"]], [["1elHELLHOit0", "world", "hohw", "arecherhry", "are", "you"], ["1elHELLHOit0", "world", "hohw", "arecherhry", "are", "you"]], [["hijklmnop", "qrsworldtuv", "qrsworldtuv"], ["hijklmnop", "qrsworldtuv", "qrsworldtuv"]], [["admin", "z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv"], ["admin", "z", "abcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv"]], [["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop", "hijklmnop"], ["abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop", "hijklmnop"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["Ip", "56789"], ["9876543210"]], [["LO", "HELLO", "1elHELLHOit0", "WORLD", "Y1elHELLHOit0OU"], ["LO", "HELLO", "1elHELLHOit0", "WORLD", "Y1elHELLHOit0OU"]], [["jumpste"], ["jumpste"]], [["abcdefg", "hijklnmnop", "qrstuv", "wxyz", "qrstuv", "abcdefg"], ["WxyZHOW", "AbCdEfG", "HijKplMnOp", "HijKlMnOp", "WxyZ"]], [["date98765432170", "tqrtstuv", "dolor", "qrtstuv", "hijklmnop", "qrstuv", "wxyz"], ["date98765432170", "tqrtstuv", "dolor", "qrtstuv", "hijklmnop", "qrstuv", "wxyz"]], [["", "banana", "cherry", "Lorem", "date", "ddate", "Lorem"], ["", "banana", "cherry", "Lorem", "date", "ddate", "Lorem"]], [["12345", "56789"], ["9876543210", "9876543210"]], [["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "you"], ["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "you"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "Appple", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "Appple", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["apple", "banana", "cherry", "date"], ["Banana", "Cherry", "Date"]], [["heollo", "world", "HELLO", "are", "you"], ["heollo", "world", "HELLO", "are", "you"]], [["", "datqrstuve", "banana", "chherry", "date", "Lorem"], ["", "datqrstuve", "banana", "chherry", "date", "Lorem"]], [["", "datqrstuve", "banana", "cherryarecherhry", "date", "cherry"], ["", "datqrstuve", "banana", "cherryarecherhry", "date", "cherry"]], [["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU", "1elit0"], ["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU", "1elit0"]], [["The", "brown", "fox", "lazipsumy", "jumps", "over", "the", "lazy", "dog"], ["The", "brown", "fox", "lazipsumy", "jumps", "over", "the", "lazy", "dog"]], [["WxyxZ"], ["WxyxZ"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "yoU", "Lorem", "cherry", "", "date"], ["", "datqrstuve", "banana", "jumpste", "cherry", "yoU", "Lorem", "cherry", "", "date"]], [["dolor", "WxyZ", "ZWxyZ"], ["dolor", "WxyZ", "ZWxyZ"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz", "UuVvWwXxYyZz"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz", "UuVvWwXxYyZz"]], [[], ["h", "admin"]], [["HELLHO", "5678hello9"], ["HELLHO", "5678hello9"]], [["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry"], ["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry"]], [["datqrstuve", "wxyhijklmnop", "cherry", "Lorem", "Lorem", "wxyhijklmnop"], ["datqrstuve", "wxyhijklmnop", "cherry", "Lorem", "Lorem", "wxyhijklmnop"]], [["", "ddate", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"], ["", "ddate", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"]], [["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"]], [["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "are", "you"], ["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "are", "you"]], [["abcdefg", "hijklmnop", "qrsY1elHELLHOit0OUv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ"]], [["hi", "Appple"], ["hi", "Appple"]], [["Appple"], ["Appple"]], [["datqrstuve", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"], ["datqrstuve", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"]], [["HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["", "datqrstuve", "banana", "hi", "cherry", "date", "yoU", "Lorem", "cherry", "", ""], ["", "datqrstuve", "banana", "hi", "cherry", "date", "yoU", "Lorem", "cherry", "", ""]], [["hello", "world", "how", "are", "you", "adidolorghow"], ["hello", "world", "how", "are", "you", "adidolorghow"]], [["AadipiscingbChellofG"], ["AadipiscingbChellofG"]], [["Loorem", "", "LoremWxworldyZ", "date", "datqrstuve", "date"], ["Loorem", "", "LoremWxworldyZ", "date", "datqrstuve", "date"]], [["wxyhijklmnop", "AadipiscingbCdEcherhryfG"], ["wxyhijklmnop", "AadipiscingbCdEcherhryfG"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG"]], [["Loorem", "", "L", "LoremWxworldyZ", "date", "datqrstuve", "date"], ["Loorem", "", "L", "LoremWxworldyZ", "date", "datqrstuve", "date"]], [["98765432170HijKlMnOp"], ["98765432170HijKlMnOp"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "AbbCdEfG", "WxyZ"]], [["The", "cherry", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "The"], ["The", "cherry", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "The"]], [["Loorem", "ThQrStUvWHijKlMnOpxyZ", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"], ["Loorem", "ThQrStUvWHijKlMnOpxyZ", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"]], [["", "datqrstuve", "chehrry", "banana", "cherry", "Lorem", "date", "cherry", "cherry"], ["", "datqrstuve", "chehrry", "banana", "cherry", "Lorem", "date", "cherry", "cherry"]], [["QrAppleStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG", "QrWStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "1234567890"], ["QrAppleStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG", "QrWStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "1234567890"]], [["Loorem", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "datcherryarecherhrye"], ["Loorem", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "datcherryarecherhrye"]], [["worold", "hello", "world", "how", "are", "you"], ["HELLO", "the", "WORLD", "AERE", "YOU"]], [["WxyZ", "hello", "AadipiscingbCdEfG", "hello", "hello"], ["WxyZ", "hello", "AadipiscingbCdEfG", "hello", "hello"]], [["HijKlMnp", "WxworldyZ"], ["HijKlMnp", "WxworldyZ"]], [["QrStUv9876543210WxyZ", "banana", "cherry", "Lorem", "date", "Lorem"], ["QrStUv9876543210WxyZ", "banana", "cherry", "Lorem", "date", "Lorem"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "Lorem"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherry", "cherry", "Lorem"]], [["heollo", "worlod", "world", "HELLO", "are", "you"], ["heollo", "worlod", "world", "HELLO", "are", "you"]], [["abcdefg", "qrstuv", "wxyz"], ["abcdefg", "qrstuv", "wxyz"]], [["abcdefg", "hijklmnop", "ThQrStUvWHijKlMnOpxyZ", "qrsworldtuv"], ["abcdefg", "hijklmnop", "ThQrStUvWHijKlMnOpxyZ", "qrsworldtuv"]], [["The", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYZz", "UuVvWwXxYyZz"], ["The", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYZz", "UuVvWwXxYyZz"]], [["The", "cherry", "brown", "fox", "over", "tThedate", "lazy", "dog"], ["The", "cherry", "brown", "fox", "over", "tThedate", "lazy", "dog"]], [["abcdefg", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz"], ["abcdefg", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz"]], [["AbCcherrydEfG", "QrStUv", "WxworldyZ", "wxyz", "HijKlMnOp", "HijKl", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "WxworldyZ", "wxyz", "HijKlMnOp", "HijKl", "HijKlMnOp"]], [["HijKlMOip", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["HijKlMOip", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["5679", "12345", "56789", "56789", "12345", "12345", "56789"], ["5679", "12345", "56789", "56789", "12345", "12345", "56789"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"]], [["The", "HijKlMnOip", "UqrstuvuVvWwXxYyZz", "QrStUvWxyZ", "UuVvWwXxYZz", "UuVvWwXxYyZz"], ["The", "HijKlMnOip", "UqrstuvuVvWwXxYyZz", "QrStUvWxyZ", "UuVvWwXxYZz", "UuVvWwXxYyZz"]], [["QrStUvWxyZ", "cherHijKlry", "5678hello9", "cherry", "Lorem", "date", "Lorem", "cherry"], ["QrStUvWxyZ", "cherHijKlry", "5678hello9", "cherry", "Lorem", "date", "Lorem", "cherry"]], [["hello", "world", "are"], ["HELLO", "WORLD", "AERE", "YOU"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ"]], [["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "hijklmop", "wxyz"], ["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "hijklmop", "wxyz"]], [["", "datqrstuve", "banana", "chherry", "date", "h"], ["", "datqrstuve", "banana", "chherry", "date", "h"]], [["The", "brown", "fox", "lazipsumy", "jumps", "the", "lazy", "dog"], ["The", "brown", "fox", "lazipsumy", "jumps", "the", "lazy", "dog"]], [["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKKlMnOp", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKKlMnOp", "HijKlMnOp"]], [["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKKlMnOp", "HijKlMnOp", "foxQrStUv", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKKlMnOp", "HijKlMnOp", "foxQrStUv", "HijKlMnOp"]], [["abcdefg", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["qrtstuv", "datqrstuve", "banana", "cherry", "date", "cherhry", "Lorem"], ["qrtstuv", "datqrstuve", "banana", "cherry", "date", "cherhry", "Lorem"]], [["abcdefg", "wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz", "hijklmnop"], ["abcdefg", "wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz", "hijklmnop"]], [["hHELLHOijklmnop", "abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop", "hijklmnop"], ["hHELLHOijklmnop", "abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmnop", "hijklmnop"]], [["AbCdEfG", "HijKlMnOp", "QrStUv", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "QrStUv", "HijKlMnOp"]], [["abcdefg", "hijkHijKlMnOpnlmnop", "qrstuv", "5678hello9", "qrstuv"], ["abcdefg", "hijkHijKlMnOpnlmnop", "qrstuv", "5678hello9", "qrstuv"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherryyou", "cherry", "cherry", "cherry", "datqrstuve"], ["", "datqrstuve", "banana", "cherry", "Lorem", "date", "cherryyou", "cherry", "cherry", "cherry", "datqrstuve"]], [["1elit0", "wxyhijklmnop", "987650", "wxyhijklmnop"], ["1elit0", "wxyhijklmnop", "987650", "wxyhijklmnop"]], [["The", "UuVvWwXxYZzz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxovrz", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxovrz"], ["The", "UuVvWwXxYZzz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxovrz", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxovrz"]], [["QrStUvWxyZ", "cherHijKlry", "5678hello9", "chehrry", "Lorem", "date", "Lorem", "cherry", "Lorem", "date"], ["QrStUvWxyZ", "cherHijKlry", "5678hello9", "chehrry", "Lorem", "date", "Lorem", "cherry", "Lorem", "date"]], [["worwld", "hello", "world"], ["worwld", "hello", "world"]], [["how", "quick", "are", "hothe", "yoU"], ["how", "quick", "are", "hothe", "yoU"]], [["aworoldbcdefg", "hijklmnop", "qrstuv"], ["AadipiscingbCdEfG", "HijKlMnOp", "WxyZ"]], [["HELLO", "The", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["HELLO", "The", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz", "hijklmnop", "hijklmnop"], ["wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hijklmnop", "hijklmnop", "wxyz", "hijklmnop", "hijklmnop"]], [["wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hotehe", "hijklmnop", "hijklmnop", "hijklmnoYOU", "wxyz", "hijklmnop", "hijklmnop"], ["wxyconsecteturz", "hijklmnop", "qrstuv", "i", "wxyz", "hotehe", "hijklmnop", "hijklmnop", "hijklmnoYOU", "wxyz", "hijklmnop", "hijklmnop"]], [["", "banana", "cheerry", "cherry", "Lorem", "date", "ddate", "Lorem"], ["", "banana", "cheerry", "cherry", "Lorem", "date", "ddate", "Lorem"]], [["5678hello9", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "UuVvWwXxYyZz"], ["5678hello9", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "UuVvWwXxYyZz"]], [["LoorecherHijKlrym", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"], ["LoorecherHijKlrym", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date"]], [["UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "HijKl", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxoverz", "1elit0the", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "HijKl", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxoverz", "1elit0the", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["Appplle", "hi", "Appple"], ["Appplle", "hi", "Appple"]], [["HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "1234567890", "1234567890"], ["HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "1234567890", "1234567890"]], [["datte", "", "banana", "cherry", "Lorem", "date", "Lorem"], ["datte", "", "banana", "cherry", "Lorem", "date", "Lorem"]], [[], ["hi"]], [["abcdefg", "hijklmnop", "abcdefgg", "Lorem"], ["abcdefg", "hijklmnop", "abcdefgg", "Lorem"]], [["brrown", "brrrown", "datebrrrown", "brown"], ["brrown", "brrrown", "datebrrrown", "brown"]], [["HELLO", "1elit0", "YOU"], ["HELLO", "1elit0", "YOU"]], [["hello", "world"], ["hello", "world"]], [["12345", "56789", "12345", "56789"], ["12345", "56789", "12345", "56789"]], [["", "datqrstuve", "jumpste", "chherry", "date", "Lorem"], ["", "datqrstuve", "jumpste", "chherry", "date", "Lorem"]], [["", "datqrstuve", "jumpste", "YOU", "chherry", "date", "Lorem"], ["", "datqrstuve", "jumpste", "YOU", "chherry", "date", "Lorem"]], [["", "datqrstuve", "banana", "cherry", "date", "cherry", "cherry", "date"], ["", "datqrstuve", "banana", "cherry", "date", "cherry", "cherry", "date"]], [["abcdefg", "hijknlmnop", "hijknlmnop", "wxyz"], ["abcdefg", "hijknlmnop", "hijknlmnop", "wxyz"]], [["Appplehow", "how", "quick", "are", "yoU"], ["Appplehow", "how", "quick", "are", "yoU"]], [["brrown", "brQrAppleStUvWxyZown", "brrrown", "brown"], ["brrown", "brQrAppleStUvWxyZown", "brrrown", "brown"]], [["Loorem", "", "ddate", "datqrstuve", "LoremWxworldyZ", "Lorem", "date", "Loorem"], ["Loorem", "", "ddate", "datqrstuve", "LoremWxworldyZ", "Lorem", "date", "Loorem"]], [["Lorem", "brrown", "ipsum", "dolor", "sit", "amet", "consectetur", "over", "elit", "amet", "ipsum"], ["Lorem", "brrown", "ipsum", "dolor", "sit", "amet", "consectetur", "over", "elit", "amet", "ipsum"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "TThe", "qudate98765432170", "UuVvWwXxYyZz", "QadidolorghowWxyZ", "HijKlMnOp", "QrStUvWxyZ"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "TThe", "qudate98765432170", "UuVvWwXxYyZz", "QadidolorghowWxyZ", "HijKlMnOp", "QrStUvWxyZ"]], [["abcdefg", "hijklnmnop", "qrstuv", "wxyz", "qrstuDatev", "abcdefg"], ["abcdefg", "hijklnmnop", "qrstuv", "wxyz", "qrstuDatev", "abcdefg"]], [["", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"], ["", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"]], [["", "datqrstuve", "banana", "hi", "cherry", "date", "yoU", "Lorem", "cherry", "", "", "yoU"], ["", "datqrstuve", "banana", "hi", "cherry", "date", "yoU", "Lorem", "cherry", "", "", "yoU"]], [["", "banana", "jumpste", "cherry", "date", "jue", "Lorem", "cherry"], ["", "banana", "jumpste", "cherry", "date", "jue", "Lorem", "cherry"]], [["brown", "fox", "lazipsumy", "jumps", "the", "lazy", "dog"], ["brown", "fox", "lazipsumy", "jumps", "the", "lazy", "dog"]], [["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "WxworldyZ", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"]], [["nAadipiscingbCdEfG", "HijKlMnp"], ["nAadipiscingbCdEfG", "HijKlMnp"]], [["AbCdEfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["AbCdEfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", ""], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", ""]], [["1elHELLHarecherhryOit0", "world", "hohw", "are", "you", "are"], ["1elHELLHarecherhryOit0", "world", "hohw", "are", "you", "are"]], [["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"]], [["AbCdEfG", "HijKlMnOip", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["AbCdEfG", "HijKlMnOip", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["hello", "hellHijKlMnOipo", "world", "hohw", "are", "you", "hohw"], ["hello", "hellHijKlMnOipo", "world", "hohw", "are", "you", "hohw"]], [["", "dartqrtuve", "banana", "cherry", "date", "cherhry", "Lorem", "cherry"], ["", "dartqrtuve", "banana", "cherry", "date", "cherhry", "Lorem", "cherry"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["5678hello9"], ["5678hello9"]], [["ipsum", "am", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit", "adipiscing", "sit"], ["ipsum", "am", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit", "adipiscing", "sit"]], [["hello", "worwld", "how", "are", "you", "adidolorhow", "you"], ["hello", "worwld", "how", "are", "you", "adidolorhow", "you"]], [["datqrstuve", "wxyhijklmnop", "AREwxyz", "Lorem", "wxyhijklmnop"], ["datqrstuve", "wxyhijklmnop", "AREwxyz", "Lorem", "wxyhijklmnop"]], [["AbCdEfG", "HijKlMnOp", "QrSUtUv", "WxyZ", "AbCdEfG"], ["AbCdEfG", "HijKlMnOp", "QrSUtUv", "WxyZ", "AbCdEfG"]], [["worold", "hello", "world", "how", "are", "you"], ["worold", "hello", "world", "how", "are", "you"]], [["", "banana", "cherry", "date"], ["", "banana", "cherry", "date"]], [["5678hello9", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "UuVvWwXxYyZz", "UuVvWwXxYyZz"], ["5678hello9", "The", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "UuVvWwXxYyZz", "UuVvWwXxYyZz"]], [["date98765432170", "tqrtstuv", "dolor", "qrtstuv", "qrtstutv", "qrstuvv", "hijklmnop", "qrstuv", "wxyz"], ["date98765432170", "tqrtstuv", "dolor", "qrtstuv", "qrtstutv", "qrstuvv", "hijklmnop", "qrstuv", "wxyz"]], [["heeollo", "world", "HELLO", "are", "you"], ["heeollo", "world", "HELLO", "are", "you"]], [["abcdefg", "qrstuuv", "qrstuv", "wxyz"], ["abcdefg", "qrstuuv", "qrstuv", "wxyz"]], [["abcdefg", "hijklmnop", "qrstuv", "qrstuv"], ["AadipiscingbCdEfG", "HijKlMnOp", "WxyZ"]], [["apple", "banana", "date98765432170", "date"], ["apple", "banana", "date98765432170", "date"]], [["brrown", "brrrown", "datebrrrown", "brown", "datebrrrown"], ["brrown", "brrrown", "datebrrrown", "brown", "datebrrrown"]], [["hello", "world", "how", "you", "how", "you"], ["hello", "world", "how", "you", "how", "you"]], [["WxyZ", "hello", "AadipiscingbCdEfG", "hello", "WxyZ"], ["WxyZ", "hello", "AadipiscingbCdEfG", "hello", "WxyZ"]], [["", "datqrstuve", "am", "banana", "hi", "cherry", "date", "yoU", "cherry", "", "ARE"], ["", "datqrstuve", "am", "banana", "hi", "cherry", "date", "yoU", "cherry", "", "ARE"]], [["", "banana", "date", "date"], ["", "banana", "date", "date"]], [["hbrrrownijklmnop", "qrsworldtuv", "qrsworldtuv"], ["hbrrrownijklmnop", "qrsworldtuv", "qrsworldtuv"]], [["apple", "banana", "cherry", "date", "banana"], ["apple", "banana", "cherry", "date", "banana"]], [["aAadipiscingbCdEfGdipiscing", "abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmn"], ["aAadipiscingbCdEfGdipiscing", "abcdefg", "hijklmnop", "qrsworldtuv", "qrsworldtuv", "hijklmn"]], [["hothe", "hijknlmnop", "qrstuv", "hijknlmnop"], ["hothe", "hijknlmnop", "qrstuv", "hijknlmnop"]], [["fox", "qrstuv", "UuVvWwXxYyZz", "wxyz"], ["fox", "qrstuv", "UuVvWwXxYyZz", "wxyz"]], [["Loorem", "1elit0the", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"], ["Loorem", "1elit0the", "", "LoremWxworldyZ", "date", "Lorem", "datqrstuve", "date"]], [["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "you", "1elHWxydolorZELLHOit0"], ["1elHELLHOit0", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "you", "1elHWxydolorZELLHOit0"]], [["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789"], ["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789"]], [["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry", "cherr"], ["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry", "cherr"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "5678hello9"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "TThe", "qudate98765432170", "UuVvWwXxYyZz", "TTThehe", "QadidolorghowWxyZ", "HijKlMnOp", "QrStUvWxyZ", "HijKlMnOip"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "TThe", "qudate98765432170", "UuVvWwXxYyZz", "TTThehe", "QadidolorghowWxyZ", "HijKlMnOp", "QrStUvWxyZ", "HijKlMnOip"]], [["HijKlMMnOp", "Q", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["HijKlMMnOp", "Q", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "qrstuv", "wxyz"]], [["rqrsuv", "abcdefg", "", "rqrstuv", "wxyz", ""], ["rqrsuv", "abcdefg", "", "rqrstuv", "wxyz", ""]], [["LO", "1elHELLHOit0", "WORLD", "Y1elHELLHOit0OU"], ["LO", "1elHELLHOit0", "WORLD", "Y1elHELLHOit0OU"]], [["hello", "world", "HELLO", "are", "you", "how"], ["hello", "world", "HELLO", "are", "you", "how"]], [["", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve", "date"], ["", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve", "date"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "Lorem", "elit", "Lorem"]], [["bananhijkHijKlMnOpnlmnop", "", "banana", "cherry", "Lorem", "date", "Lorem"], ["bananhijkHijKlMnOpnlmnop", "", "banana", "cherry", "Lorem", "date", "Lorem"]], [["arecherhryHijKlMnp", "nAadipiscingbCdEfG", "HijKlMnp"], ["arecherhryHijKlMnp", "nAadipiscingbCdEfG", "HijKlMnp"]], [["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "wxyconsecteturz", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "wxyconsecteturz", "HijKlMnOp"]], [["cMrzFFoMlp", "", "banana", "cherry", "Lorem", "cherry"], ["cMrzFFoMlp", "", "banana", "cherry", "Lorem", "cherry"]], [["HijKlMnlOp", "AdbCdEfG", "HijKlMnOp", "QrStUv", "HijKlMnOp", "HijKlMnlOp"], ["HijKlMnlOp", "AdbCdEfG", "HijKlMnOp", "QrStUv", "HijKlMnOp", "HijKlMnlOp"]], [["The", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["The", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789", "12345"], ["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789", "12345"]], [["qdogrstuv", "abcdefg", "qrstuv", "5678hello9", "qrstuv", "qrstuv", "qdogrstuv"], ["qdogrstuv", "abcdefg", "qrstuv", "5678hello9", "qrstuv", "qrstuv", "qdogrstuv"]], [["cherryarecherhry", "QrStUv9876543210WxyZ", "banana", "cherry", "Lorem", "date", "Lorem"], ["cherryarecherhry", "QrStUv9876543210WxyZ", "banana", "cherry", "Lorem", "date", "Lorem"]], [["The", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ"], ["The", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp", "QrStUvWxyZ"]], [["Loorem", "", "datqrstuve", "LoremWxworldyZ", "AREwxyz", "Lorem", "date"], ["Loorem", "", "datqrstuve", "LoremWxworldyZ", "AREwxyz", "Lorem", "date"]], [["1elHELLHarecherhryOit0", "world", "hohw", "you", "are"], ["1elHELLHarecherhryOit0", "world", "hohw", "you", "are"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "698765432170"], ["98765432170", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "698765432170"]], [["", "thee", "cherry", "Lorem", "date", "Lodogrem"], ["", "thee", "cherry", "Lorem", "date", "Lodogrem"]], [["hothe", "hello", "AadipiscingbCdEfG", "hellobrownThe", "hello"], ["hothe", "hello", "AadipiscingbCdEfG", "hellobrownThe", "hello"]], [["apple", "banana", "cheyrry", "cherry", "date", "banana"], ["apple", "banana", "cheyrry", "cherry", "date", "banana"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "elit", "ipsum"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "elit", "ipsum"]], [["", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", ""], ["", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", ""]], [["", "datqrstuve", "am", "banana", "hi", "cherry", "yoU", "cherry", "", "AARE"], ["", "datqrstuve", "am", "banana", "hi", "cherry", "yoU", "cherry", "", "AARE"]], [["sit", "HijKlMnOp", "QrStUvWxyZ", "UuVvWwXxYyZz"], ["sit", "HijKlMnOp", "QrStUvWxyZ", "UuVvWwXxYyZz"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "Lorem", "datqrstuve"], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "Lorem", "datqrstuve"]], [["ddatqrstuve", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"], ["ddatqrstuve", "cherry", "LoremWxworyouldyZ", "date", "Lorem", "datqrstuve"]], [["brrown", "brrrown", "datebrrrnown", "qdogrstuv", "brown", "datebrrrnown"], ["brrown", "brrrown", "datebrrrnown", "qdogrstuv", "brown", "datebrrrnown"]], [["Loorem", "ThQrStUvWHijKlMnOpxyZ", "LoremWxworldyZ", "date", "Lorem", "rbe", "Lm", "datqrstuve", "date"], ["Loorem", "ThQrStUvWHijKlMnOpxyZ", "LoremWxworldyZ", "date", "Lorem", "rbe", "Lm", "datqrstuve", "date"]], [["i", "WxyZ", "AadipiscingbCdEfG"], ["i", "WxyZ", "AadipiscingbCdEfG"]], [["", "datqrstuve", "banana", "cyherry", "Lorem", "Thedate", "cherry", "cherry", "cherry"], ["", "datqrstuve", "banana", "cyherry", "Lorem", "Thedate", "cherry", "cherry", "cherry"]], [["", "banana", "cheerry", "cherry", "Lorem", "Apple", "date", "ddate", "Lorem", "banana"], ["", "banana", "cheerry", "cherry", "Lorem", "Apple", "date", "ddate", "Lorem", "banana"]], [["abcdefg", "hijklmnop", "ThQrStUvWHijKlMnOpxyZ", "qrsworldtuv", "abcdefg"], ["abcdefg", "hijklmnop", "ThQrStUvWHijKlMnOpxyZ", "qrsworldtuv", "abcdefg"]], [["LoorecherHijKlrym", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date", ""], ["LoorecherHijKlrym", "", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date", ""]], [["z", "abcdefg", "qrstuv", "wxxyz", "qrstuv"], ["z", "abcdefg", "qrstuv", "wxxyz", "qrstuv"]], [["1eli0", "HELLO", "1elit0", "YOU"], ["1eli0", "HELLO", "1elit0", "YOU"]], [["1elit0i", "hello", "world", "how", "are", "hello"], ["1elit0i", "hello", "world", "how", "are", "hello"]], [["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit"], ["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit"]], [["Lorem", "ipsum", "dolor", "amet", "consectetur", "Lorem", "elit", "elit"], ["Lorem", "ipsum", "dolor", "amet", "consectetur", "Lorem", "elit", "elit"]], [["Lorem", "brrown", "ipsum", "dolor", "sit", "brrrown", "amet", "consectetur", "over", "elit", "amet", "ipsum"], ["Lorem", "brrown", "ipsum", "dolor", "sit", "brrrown", "amet", "consectetur", "over", "elit", "amet", "ipsum"]], [["The", "AadipiscingbCdEfG", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp"], ["The", "AadipiscingbCdEfG", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "HijKlMnOp"]], [["admin"], ["are", "yoU"]], [["hello", "world", "worldworld", "are", "worldworld"], ["HELLO", "WORLD", "AERE", "YOU"]], [["hello", "world", "hohw", "worldd", "are", "1elit0you", "hohw"], ["hello", "world", "hohw", "worldd", "are", "1elit0you", "hohw"]], [["The", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXUuVvWwXxovrzyZz"], ["The", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXUuVvWwXxovrzyZz"]], [["apple", "baanana", "cheyrry", "cherry", "date", "banana"], ["apple", "baanana", "cheyrry", "cherry", "date", "banana"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"]], [["hello", "world", "how", "are", "you"], ["lazy", "HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["ohow", "hello", "world", "how", "are", "you", "adidolorghow"], ["ohow", "hello", "world", "how", "are", "you", "adidolorghow"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ", "AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["AbCcherrydEfG", "QrStUv", "wxyz", "HijKlMnOp", "HijKl", "HijKlMnOp"], ["AbCcherrydEfG", "QrStUv", "wxyz", "HijKlMnOp", "HijKl", "HijKlMnOp"]], [["LO", "WORLD", "1elit0", "YOU"], ["LO", "WORLD", "1elit0", "YOU"]], [["brrown", "brnown", "brown"], ["brrown", "brnown", "brown"]], [["abcdefg", "hijklmnop", "qrsworldtuv", "56789", "qrsworldtuv", "hijklnmnop", "9876543210", "hijklmnop"], ["abcdefg", "hijklmnop", "qrsworldtuv", "56789", "qrsworldtuv", "hijklnmnop", "9876543210", "hijklmnop"]], [["ii", "i", "admin"], ["how", "are"]], [["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG"], ["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG"]], [["AbCdEf", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "UuVvWwXxYyZz"], ["AbCdEf", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "UuVvWwXxYyZz"]], [["apple", "banana", "cheyrry", "hcherry", "cherry", "date", "banana"], ["apple", "banana", "cheyrry", "hcherry", "cherry", "date", "banana"]], [["HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz"], ["HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg"], ["AbCdEfG", "HijKlMnOp", "WxyZ"]], [["wxyconsecteturz", "hijklmnop", "HELLO", "i", "wxyz", "hotehe", "hijklmnop", "ZWxyZ", "hijklmnop", "hijklmnoYOU", "wxyz", "hijklmnop", "hijklmnop"], ["wxyconsecteturz", "hijklmnop", "HELLO", "i", "wxyz", "hotehe", "hijklmnop", "ZWxyZ", "hijklmnop", "hijklmnoYOU", "wxyz", "hijklmnop", "hijklmnop"]], [["Loorem", "elit", "", "ddate", "datqrstuve", "date", "Lorem", "date", "date"], ["Loorem", "elit", "", "ddate", "datqrstuve", "date", "Lorem", "date", "date"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "cherryyyou", "date", "cherryyou", "cherry", "cherry", "cherry", "datqrstuve"], ["", "datqrstuve", "banana", "cherry", "Lorem", "cherryyyou", "date", "cherryyou", "cherry", "cherry", "cherry", "datqrstuve"]], [["", "datqrstuve", "banana", "cherryarecherhry", "date", "cherry", "cherryarecherhry"], ["", "datqrstuve", "banana", "cherryarecherhry", "date", "cherry", "cherryarecherhry"]], [["AbCdEffG", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOip"], ["AbCdEffG", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOip"]], [["Lorem", "ipsum", "dolor", "sit", "consectetur", "adidolorg", "elit"], ["Lorem", "ipsum", "dolor", "sit", "consectetur", "adidolorg", "elit"]], [["qrsworldv", "LoorecherHijKlrym", "", "qrsworldtuv", "LoremWxworldyZ", "date", "Lorem", "date", "", "Lorem"], ["qrsworldv", "LoorecherHijKlrym", "", "qrsworldtuv", "LoremWxworldyZ", "date", "Lorem", "date", "", "Lorem"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "brQrAppleStUvWxyZown", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890", "brQrAppleStUvWxyZown", "1elit0", "QrStUvWxyZ"]], [["abcdefg", "abcdefgg", "hijklmnop", "Lorem", "abcdefg"], ["abcdefg", "abcdefgg", "hijklmnop", "Lorem", "abcdefg"]], [["WWxyxZ", "WxyxZ"], ["WWxyxZ", "WxyxZ"]], [["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "HijKlMnOp"], ["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "HijKlMnOp"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "Appplle", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "Appplle", "UuVvWw", "1234567890", "QrStUvWxyZ", "1elit0", "QrStUvWxyZ"]], [["WxlazllyyxZ", "WxyxZ"], ["WxlazllyyxZ", "WxyxZ"]], [["", "datqrstuve", "banana", "worldworld", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem", "cherry"], ["", "datqrstuve", "banana", "worldworld", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem", "cherry"]], [["abcdefg", "hijklmnop", "qrstuv", "himnop", "wxyz", "hijklmnop", "hijklmnop", "abcdefg"], ["HijKlMnOp", "hcherry", "QrStUv", "WxyZ"]], [["Lorem", "ipsum", "doworldworldlor", "sit", "amet", "iipsum", "consectetur", "adipiscing", "elit"], ["Lorem", "ipsum", "doworldworldlor", "sit", "amet", "iipsum", "consectetur", "adipiscing", "elit"]], [["AbCdEfG", "HijKlMnOp", "worldd", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "worldd", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "HijKlMnOp"]], [["datte", "banana", "cherry", "Lorem", "date", "Lorem", ""], ["datte", "banana", "cherry", "Lorem", "date", "Lorem", ""]], [["are", "datqrstuve", "banana", "cherry", "date", "cherry", "date"], ["are", "datqrstuve", "banana", "cherry", "date", "cherry", "date"]], [["cabcdefg", "hijklmnop", "qrstuvwxy", "z"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "heollo", "1234567890"]], [["hello", "worwld", "qdogrstuvhow", "are", "you", "adidolorhow", "you"], ["hello", "worwld", "qdogrstuvhow", "are", "you", "adidolorhow", "you"]], [["LO", "WORLD", "1elit0", "YOU", "YOU"], ["LO", "WORLD", "1elit0", "YOU", "YOU"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AbCdEAbCdEffG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"], ["hijknlmnop", "qrstuv", "5678hello9"]], [["hello", "worwld", "how", "are", "uyou", "you", "adidolorhow", "you"], ["hello", "worwld", "how", "are", "uyou", "you", "adidolorhow", "you"]], [["hello", "world", "HELLO", "are", "you", "how", "are"], ["hello", "world", "HELLO", "are", "you", "how", "are"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "The"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "The"]], [["hello", "world", "HELLO", "are", "you", "a", "how"], ["hello", "world", "HELLO", "are", "you", "a", "how"]], [["hi", "Apppl"], ["hi", "Apppl"]], [["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU", "consectetur", "1elit0"], ["LO", "HELLO", "1elHELLHOit0", "WORLD", "1elit0", "YOU", "consectetur", "1elit0"]], [["worwaworoldbcdefgld", "hello", "world"], ["worwaworoldbcdefgld", "hello", "world"]], [["jpste"], ["jpste"]], [["987265432170", "9876543210"], ["987265432170", "9876543210"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "UnAadipiscingbCdEfGuVvWw", "HijKlMnOp", "QrStUvWxyZ", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "UnAadipiscingbCdEfGuVvWw", "HijKlMnOp", "QrStUvWxyZ", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"]], [["98765432170", "AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"], ["98765432170", "AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"]], [["HijKlMOip", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMOip"], ["HijKlMOip", "HijKlMnOip", "HijKlMnOp", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMOip"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWw", "1234567890", "QrStUvWxyZ"]], [["The", "HijKlMnOip", "UqrstuvuVvWwXxYyZz", "QrStUvWxyZ", "wUuVvWwXxYZz", "UuVvWwXxYyZz"], ["The", "HijKlMnOip", "UqrstuvuVvWwXxYyZz", "QrStUvWxyZ", "wUuVvWwXxYZz", "UuVvWwXxYyZz"]], [["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", "", "banana"], ["", "datqrstuve", "banana", "jumpste", "cherry", "date", "Lorem", "cherry", "", "banana"]], [["hHELLHOijklmnop", "abcdefg", "hijklmnop", "qrsworldtuv", "hijklmnop", "hijklmnop"], ["hHELLHOijklmnop", "abcdefg", "hijklmnop", "qrsworldtuv", "hijklmnop", "hijklmnop"]], [["56789"], ["9876543210", "9876543210"]], [["HELLO", "AARE", "The", "UuVvTTTheheXxYZz", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["HELLO", "AARE", "The", "UuVvTTTheheXxYZz", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["wxyccherhryonsecteturz", "abcdefg"], ["wxyccherhryonsecteturz", "abcdefg"]], [["The", "quick", "brown", "fox", "Thhe", "jumps", "over", "the", "lazy", "dog"], ["The", "quick", "brown", "fox", "Thhe", "jumps", "over", "the", "lazy", "dog"]], [["hello", "world", "hohw", "are", "you", "hohw", "world"], ["hello", "world", "hohw", "are", "you", "hohw", "world"]], [["thee", "cherry", "Lorem", "date", "Lodogrem"], ["thee", "cherry", "Lorem", "date", "Lodogrem"]], [["AbCdEfG", "HijKlMnOp", "Apppl", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijknlmnop", "qrstuv", "5678hello9"]], [["", "datqrstuve", "banana", "jumpste", "chherry", "date", "987265432170"], ["", "datqrstuve", "banana", "jumpste", "chherry", "date", "987265432170"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "lazy", "jumps", "quick"], ["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog", "lazy", "jumps", "quick"]], [["quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "The", "over", "The"], ["quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "The", "over", "The"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "98765432170HijKlMnOp", "QrStUvWxyZ"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvWxyZ", "98765432170HijKlMnOp", "QrStUvWxyZ"]], [["WxlazllyyxZ", "WxyxZ", "WxlazllyyxZ"], ["WxlazllyyxZ", "WxyxZ", "WxlazllyyxZ"]], [["abThheefg", "abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz"], ["abThheefg", "abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz"]], [["HELLO", "WORLD", "AERE", "YOU", "HELLO"], ["HELLO", "WORLD", "AERE", "YOU", "HELLO"]], [["ddatqrstuve", "cherry", "LoremWxworyouldyZ", "Lorem", "datqrstuve"], ["ddatqrstuve", "cherry", "LoremWxworyouldyZ", "Lorem", "datqrstuve"]], [["HELLO", "the", "WORLD", "AERE", "YOU"], ["HELLO", "the", "WORLD", "AERE", "YOU"]], [["", "datqrstuve", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "amet"], ["", "datqrstuve", "cherry", "Lorem", "date", "cherry", "cherry", "cherry", "amet"]], [["hello", "world", "how", "overare", "you"], ["hello", "world", "how", "overare", "you"]], [["abThheefg", "abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz", "hijknlmnop"], ["abThheefg", "abcdefg", "hijknlmnop", "qrstuv", "hijknlmnop", "wxyz", "hijknlmnop"]], [["LoorecherHijKlrym", "", "daatqrstuve", "LoremWxworldyZ", "date", "Lorem", "Lrorem", "date", ""], ["LoorecherHijKlrym", "", "daatqrstuve", "LoremWxworldyZ", "date", "Lorem", "Lrorem", "date", ""]], [["worldd", "Loorem", "", "L", "LoremWxworldyZ", "date", "datqrstuve", "date"], ["worldd", "Loorem", "", "L", "LoremWxworldyZ", "date", "datqrstuve", "date"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "hijklmnopwxxyz", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ", "1234567890"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "hijklmnopwxxyz", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ", "1234567890"]], [["", "datqrstuve", "banana", "chherry", "dat", "Lorem"], ["", "datqrstuve", "banana", "chherry", "dat", "Lorem"]], [["The", "UuVvWwXxYZz", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXhotehexYyZz"], ["The", "UuVvWwXxYZz", "HijKlMnOip", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXhotehexYyZz"]], [["abcdefg", "hijknlmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOip", "HijKlMnOp", "UUuVvWwXxYyZz", "QrStUvWHijKlMnOpxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["hello", "world", "how", "are", "you"], ["HELLO", "bananhijkHijKlMnOpnlmnop", "ARE", "YOU"]], [["98765432170", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz", "UuVvWwXxYyZz", "HELLHO"], ["98765432170", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "UuVvWwXxYyZz", "UuVvWwXxYyZz", "HELLHO"]], [["hello", "world", "HELLO", "are", "you", "a", "how", "you"], ["hello", "world", "HELLO", "are", "you", "a", "how", "you"]], [["", "juumpste", "datqrstuve", "jumpste", "YOU", "chherry", "date", "Lorem"], ["", "juumpste", "datqrstuve", "jumpste", "YOU", "chherry", "date", "Lorem"]], [["wxyz", "i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "HijKlMnOp", "WxxyZ"], ["wxyz", "i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "HijKlMnOp", "WxxyZ"]], [["", "thee", "cherry", "Lorem", "date", "Lodogrem", "thee"], ["", "thee", "cherry", "Lorem", "date", "Lodogrem", "thee"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890"]], [["LO", "HELLO", "HHELLO", "1elHELLHOit0", "WORLD", "1elit0", "1elit0"], ["LO", "HELLO", "HHELLO", "1elHELLHOit0", "WORLD", "1elit0", "1elit0"]], [["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "hijklmop", "hijklmnopHijKlMnOip", "wxyz"], ["date98765432170", "qrtstuv", "hijklmnop", "qrstuv", "hijklmop", "hijklmnopHijKlMnOip", "wxyz"]], [["brown", "fox", "lazipsumy", "Q", "the", "lazy", "dog", "the"], ["brown", "fox", "lazipsumy", "Q", "the", "lazy", "dog", "the"]], [["", "banana", "cheerry", "cherry", "Lorem", "ddate", "Lorem"], ["", "banana", "cheerry", "cherry", "Lorem", "ddate", "Lorem"]], [["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxove", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1elit0"], ["The", "UuVvWwXxYZz", "HijKlMnOp", "HijKlMnOip", "how", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxove", "1elit0", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1elit0"]], [["98765432170", "HijKlMnOp", "HijKlMnOip", "QhelloyZ", "UuVvWwXxYyZz", "HELLHO"], ["98765432170", "HijKlMnOp", "HijKlMnOip", "QhelloyZ", "UuVvWwXxYyZz", "HELLHO"]], [["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry", "QrStUv9876543210WxyZ"], ["QrStUvWxyZ", "5678hello9", "cherr", "Lorem", "date", "Lorem", "QrStUv9876543210WxyZ", "cherry", "QrStUv9876543210WxyZ"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "Lodogrem", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "HijKlMnOp", "QrStUvWxyZ", "Lodogrem", "hijklmnop", "UuVvWw", "1234567890", "QrStUvWxAbCdEQrStUvWHijKlMnOpxyZfGyZ", "QrStUvWxyZ"]], [["apple", "banana", "cheyrry", "date", "banana"], ["apple", "banana", "cheyrry", "date", "banana"]], [["HamijKlMnOip", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "HijLoremWxworyouldyZKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["HamijKlMnOip", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "HijLoremWxworyouldyZKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["datqrstuve", "wxyhijklmnop", "AREwxyz", "Lorem", "Lor", "wxyhijklmnop"], ["datqrstuve", "wxyhijklmnop", "AREwxyz", "Lorem", "Lor", "wxyhijklmnop"]], [["apple", "banaana", "banana", "applecherr", "cherry", "juumpste", "date"], ["Banana", "Cherry", "Date"]], [["hello", "ipsum"], ["hello", "ipsum"]], [["z", "qrstuvcheerry", "eabcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv", "z"], ["z", "qrstuvcheerry", "eabcdefg", "hijknlmnop", "qrstuv", "wxyz", "qrstuv", "z"]], [["AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "ohow", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890"], ["AbCdEQrStUvWHijKlMnOpxyZfG", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "ohow", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "1234567890"]], [["AbCdEfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOeoPpQqRrSsT", "UuVvWwXxYyZz"], ["AbCdEfG", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOeoPpQqRrSsT", "UuVvWwXxYyZz"]], [["Lorem", "ipsum", "dolor", "ssit", "amet", "consectetur", "ipsum"], ["Lorem", "ipsum", "dolor", "ssit", "amet", "consectetur", "ipsum"]], [["abcdefg", "hijklmnop", "abcdeffg", "Lorem"], ["abcdefg", "hijklmnop", "abcdeffg", "Lorem"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "rStUvWxyZ", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "The", "rStUvWxyZ", "UuVvWwXxYyZz", "QrStUvWxyZ", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["", "datqrstuve", "worldworld", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem", "cherry"], ["", "datqrstuve", "worldworld", "Lorem", "date", "cherry", "cherry", "cherry", "Lorem", "cherry"]], [["z", "abcdefg", "qrstuv", "wxxyz", "qrstuv", "abcdefg", "abcdefg"], ["z", "abcdefg", "qrstuv", "wxxyz", "qrstuv", "abcdefg", "abcdefg"]], [["HELLO", "The", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyrZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["HELLO", "The", "UuVvWwXxYZz", "HijKlMnOp", "QrStUvWxyrZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["LoorecherHijKlrym", "", "hcherry", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date", ""], ["LoorecherHijKlrym", "", "hcherry", "datqrstuve", "LoremWxworldyZ", "date", "Lorem", "date", ""]], [["o", "apple", "hohw", "are", "you"], ["o", "apple", "hohw", "are", "you"]], [["chercherHijKlryry", "", "datqrstuve", "banana", "jumpste", "cherry", "yoU", "Lorem", "cherry", "", "date"], ["chercherHijKlryry", "", "datqrstuve", "banana", "jumpste", "cherry", "yoU", "Lorem", "cherry", "", "date"]], [["apple", "WxydolorZ", "banana", "cheyrry", "hcherry", "cherry", "date", "banana"], ["apple", "WxydolorZ", "banana", "cheyrry", "hcherry", "cherry", "date", "banana"]], [["quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "The", "over", "The", "UUuVvWwXxYyZz", "The"], ["quick", "brown", "fox", "jumps", "brownThe", "over", "the", "lazy", "dog", "The", "over", "The", "UUuVvWwXxYyZz", "The"]], [["abcdefg", "hijklmnop", "qrstuv", "qrstuv", "qrstuv", "abcdefg", "qrstuv"], ["abcdefg", "hijklmnop", "qrstuv", "qrstuv", "qrstuv", "abcdefg", "qrstuv"]], [["", "datqrstuve", "banana", "98765432170", "cherry", "date", "Lorem"], ["", "datqrstuve", "banana", "98765432170", "cherry", "date", "Lorem"]], [["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789", "56789", "12345"], ["5679", "12345", "56789", "56789", "12345", "12345", "12345", "56789", "56789", "12345"]], [["qrsY1elHELLHOit0OUv", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "lazlly"], ["qrsY1elHELLHOit0OUv", "world", "hohw", "1elHWxydolorZELLHOit0", "are", "lazlly"]], [["AbCdE", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"], ["AbCdE", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOosT", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "HijKlMnOp"]], [["", "dartqrtuve", "banana", "cherry", "date", "cherhry", "Lorem", "cherry", "cherhry"], ["", "dartqrtuve", "banana", "cherry", "date", "cherhry", "Lorem", "cherry", "cherhry"]], [["", "datqrstuve", "banana", "chherry", "dat", "Lorem", "chherry"], ["", "datqrstuve", "banana", "chherry", "dat", "Lorem", "chherry"]], [["HijKlMnp", "WxworldyZ", "WxworldyZ"], ["HijKlMnp", "WxworldyZ", "WxworldyZ"]], [["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvZ", "HijKlMnOp", "QrStUvWxyZ"], ["The", "HijKlMnOp", "HijKlMnOip", "QrStUvWxyZ", "quick", "UuVvWwXxYyZz", "QrStUvZ", "HijKlMnOp", "QrStUvWxyZ"]], [["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit", "sit"], ["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adidolorg", "elit", "sit"]], [["yoU", "yametU", "9876543210"], ["yoU", "yametU", "9876543210"]], [["HijKlMnOp", "QrStUv", "Wxhothe", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "himnop", "wxyz", "hijklmnop", "hijklmnop"]], [["ssit", "AadipiscingbdChellofG"], ["ssit", "AadipiscingbdChellofG"]], [["", "datqrstuve", "WxyZ", "jumpste", "cherry", "date", "Lorem"], ["", "datqrstuve", "WxyZ", "jumpste", "cherry", "date", "Lorem"]], [["HijKlMnp", "z"], ["HijKlMnp", "z"]], [["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "AadipiscingbCdEfG"], ["i", "WxxyZ", "HijKlMnOp", "UuVvWwXxovrz", "WxyZ", "AadipiscingbCdEfG", "AadipiscingbCdEfG"]], [["1elit0i", "world", "how", "are", "hello"], ["1elit0i", "world", "how", "are", "hello"]], [["h", "admin"], ["h", "admin"]], [["abcdefg", "Appple", "hijknlmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["", "datqrstuve", "banana", "cherry", "Lorem", "cherry", "dateyoU", "cherrybrQrAppleStUvWxyZown", "L", "cherry"], ["", "datqrstuve", "banana", "cherry", "Lorem", "cherry", "dateyoU", "cherrybrQrAppleStUvWxyZown", "L", "cherry"]], [["WxyZ", "hello", "the", "AadipiscingbCdEfG", "WxyZ"], ["WxyZ", "hello", "the", "AadipiscingbCdEfG", "WxyZ"]], [["ohow", "hello", "world", "how", "worwld", "are", "worlod", "adidolorghow", "are"], ["ohow", "hello", "world", "how", "worwld", "are", "worlod", "adidolorghow", "are"]], [["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "himnop", "elit"], ["Lorerm", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "himnop", "elit"]], [["HELLO", "the", "AERE", "YOU", "the"], ["HELLO", "the", "AERE", "YOU", "the"]], [["abcdefg", "hijklmnop", "qrsworldtuv", "56789", "hijklnmnop", "9876543210", "hijklmnop"], ["abcdefg", "hijklmnop", "qrsworldtuv", "56789", "hijklnmnop", "9876543210", "hijklmnop"]], [["hi", "admin"], [""]], [[], [""]], [[], ["hello", "world"]], [["apple", "banana"], []], [["", ""], [""]], [["", "", ""], ["", ""]], [["\ud83d\udc3c", "\ud83e\udd81"], ["\ud83d\udc3b", "\ud83e\udd8a", "\ud83d\udc28"]], [[""], ["a"]], [["a"], [""]], [["cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z"], ["cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z"]], [["HELLO", "WORLD", "HOW", "ARE", "OU"], ["HELLO", "WORLD", "HOW", "ARE", "OU"]], [["hi", "admin", "admin"], ["how", "are", "yoU"]], [["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "WORLD"], ["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "WORLD"]], [["AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ", "AbCdEfG"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"]], [["abcdefg", "qrstuvwxy", "z", "hijklmnop"], ["abcdefg", "qrstuvwxy", "z", "hijklmnop"]], [["Apple", "Banana", "Cherry", "Date", "Banana"], ["Apple", "Banana", "Cherry", "Date", "Banana"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "UuVvWwXxYyZz"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit", "elit"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg"]], [["AbCdEfG", "admin", "QrStUvWxyZ", "UuVvWwXxYyZz"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz"]], [["hello", "h", "how", "are", "you"], ["hello", "h", "how", "are", "you"]], [["HELLO", "WORLD", "HOW", "OU"], ["HELLO", "WORLD", "HOW", "OU"]], [["brown", "hi", "admin"], ["brown", "hi", "admin"]], [["brown", "Banana", "admin"], ["brown", "Banana", "admin"]], [["hello", "world", "how", "are"], []], [["Banana", "Cherry", "Date"], ["apple", "banana", "cherry", "date"]], [["hi", "admin", "admin"], ["how", "are", "UuVvWwXxYyZz", "yoU"]], [["HELLO", "HOWW", "WORLD", "HOW", "OU", "OU"], ["HELLO", "HOWW", "WORLD", "HOW", "OU", "OU"]], [["Apple", "Banana", "HOWW", "Cherry", "Date", "Banana"], ["Apple", "Banana", "HOWW", "Cherry", "Date", "Banana"]], [["abcdefg", "hijklmno12345p", "hijklmnop", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwVXxYyZz"]], [["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg"]], [["abcdefg", "qrstuvwxy"], ["abcdefg", "qrstuvwxy"]], [["world", "how", "are"], []], [["Banana", "HOWW", "Cherry", "Date", "Banana"], ["Banana", "HOWW", "Cherry", "Date", "Banana"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"]], [["HELLO", "WORLD", "HOW", "OyoUU", "ARE", "OU", "WORLD"], ["HELLO", "WORLD", "HOW", "OyoUU", "ARE", "OU", "WORLD"]], [["Cherry", "Date"], ["apple", "banana", "Apple", "date"]], [["QrStUv", "abcdefg", "hijklmnop", "qrstuv"], ["QrStUv", "abcdefg", "hijklmnop", "qrstuv"]], [["HELLO", "WORLD", "HOW", "UOU"], ["HELLO", "WORLD", "HOW", "UOU"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz"]], [["HELLO", "ARE", "HOWW", "OOyoUUU", "WORLD", "HOW", "OU", "OU"], ["HELLO", "ARE", "HOWW", "OOyoUUU", "WORLD", "HOW", "OU", "OU"]], [["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "WORLD", "OU"], ["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "WORLD", "OU"]], [["HELLO", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW"], ["HELLO", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW"]], [["hello", "qrstuabcdefgv", "h", "how", "are", "you"], ["hello", "qrstuabcdefgv", "h", "how", "are", "you"]], [["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "qrstuv", "wxyz", "qrstuv"], ["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "qrstuv", "wxyz", "qrstuv"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "abcdefg"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "abcdefg"]], [["Banana", "HijKlMnOp", "HOWW", "Cherry", "Date", "Banana", "HOWW", "Date"], ["Banana", "HijKlMnOp", "HOWW", "Cherry", "Date", "Banana", "HOWW", "Date"]], [["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"], ["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"]], [["abcdefg", "hijklmno12345p", "qrstuv", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwVXxYyZz"]], [["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv"], ["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv"]], [["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy"], ["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy"]], [["HELLO", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW"], ["HELLO", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW"]], [["fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"], ["fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"]], [["HELLO", "WORLD", "HOW", "ARE", "YOU"], ["HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["apple", "The", "cherry", "date", "cherry"], ["apple", "The", "cherry", "date", "cherry"]], [["hijklmnop", "hijklmno12345p", "hijklmnop", "qrstuv", "wxyz"], ["hijklmnop", "hijklmno12345p", "hijklmnop", "qrstuv", "wxyz"]], [["apple", "banana", "cherry", "date"], ["Apple", "Banana", "12345Cherry", "Cherry", "Date"]], [["h", "how", "are", "you"], ["h", "how", "are", "you"]], [["QrStUvWxyZ", "qrstulazyv", "hijklmno12345p", "qrstuv", "hijklmnop", "QrvWxyZ", "qrstuv", "wxyz", "qrstuv"], ["QrStUvWxyZ", "qrstulazyv", "hijklmno12345p", "qrstuv", "hijklmnop", "QrvWxyZ", "qrstuv", "wxyz", "qrstuv"]], [["abcdefg", "hijklmnop", "qrstuv", "wz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["hello", "world", "how", "howw", "are", "you"], ["hello", "world", "how", "howw", "are", "you"]], [["abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop"]], [["UuVvWwXxYyZz", "hijklmnop", "qrstuvwxy", "z"], ["12ipsum7890", "AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "1234567890"]], [["hi", "admin"], ["hi", "admin"]], [["wxyz", "brown", "hi", "admin"], ["wxyz", "brown", "hi", "admin"]], [["over", "qrstuvwxy"], ["over", "qrstuvwxy"]], [["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"], ["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"]], [["HELLO", "HOW", "ARE", "YOU"], ["HELLO", "HOW", "ARE", "YOU"]], [["HELLOqrhstuvwxy", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"], ["HELLOqrhstuvwxy", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"]], [["YyouOU", "HELLO", "WORLD", "HOW", "ARE", "YOU"], ["YyouOU", "HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["abcdefg", "hijklamet", "fg", "HijKlMnOphijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop"], ["abcdefg", "hijklamet", "fg", "HijKlMnOphijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"], ["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["brown", "Banana", "admin", "Banana"], ["brown", "Banana", "admin", "Banana"]], [["h", "hoyoUuVvWwXxYyZzU", "are", "you", "you"], ["h", "hoyoUuVvWwXxYyZzU", "are", "you", "you"]], [["Lorem", "ipsum", "dolor", "sit", "consectetur", "adipiscing", "elit", "dolor"], ["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["12345", "56789"], ["OyoUU"]], [["qrstuv", "wxyz"], ["qrstuv", "wxyz"]], [["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are"], ["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are"]], [["AbCdEfG", "wz", "UuVvWwXxYyZz"], ["AbCdEfG", "wz", "UuVvWwXxYyZz"]], [["hello", "qrstuabcdefgv", "how", "are", "you", "how", "are"], ["hello", "qrstuabcdefgv", "how", "are", "you", "how", "are"]], [["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv", "qrstuv"], ["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv", "qrstuv"]], [["the", "hi", "admin", "admin", "the"], ["the", "hi", "admin", "admin", "the"]], [["hello", "12345Cherry", "how", "you"], ["hello", "12345Cherry", "how", "you"]], [["the", "hi", "admin", "admin", ""], ["the", "hi", "admin", "admin", ""]], [["abcdefg", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["abcdefg", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["HELLLLO", "WORLD", "HOW", "ARE", "YOU", "HOW"], ["HELLLLO", "WORLD", "HOW", "ARE", "YOU", "HOW"]], [["aadmin", "hi", "admin"], ["aadmin", "hi", "admin"]], [["Lorem", "ipsum", "you", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"], ["Lorem", "ipsum", "you", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg"]], [["brown", "admin"], ["brown", "admin"]], [["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox", "over"], ["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox", "over"]], [["YyouOU", "HELLO", "WORLD", "HOW", "YOU"], ["YyouOU", "HELLO", "WORLD", "HOW", "YOU"]], [["apple", "banana", "crherry", "date"], ["apple", "banana", "crherry", "date"]], [["cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "z"], ["cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "z"]], [["WHOW", "HELLO", "WORLD", "HOW", "ARE", "YOU"], ["WHOW", "HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["Lorem", "HOW", "OyoUU", "puyfupDda", "yoU", "TydBz"], []], [["hello", "world", "how", "howw", "are", "you", "hoTydBzw"], ["hello", "world", "how", "howw", "are", "you", "hoTydBzw"]], [["HELLO", "WORL9876543210D", "HOW", "ARE", "OU"], ["HELLO", "WORL9876543210D", "HOW", "ARE", "OU"]], [["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy", "hijklmnop"], ["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy", "hijklmnop"]], [["apple", "AREThe", "cherry", "date", "12345Cherry"], ["apple", "AREThe", "cherry", "date", "12345Cherry"]], [["YOU", "hi", "admin"], ["YOU", "hi", "admin"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"], ["The", "quick", "brown", "fox", "over", "brWORL9876543210Dwn", "the", "lazy", "dog"]], [["HELLO", "WORLD", "HOW", "ARE", "YOU", "WORLD", "WORLD"], ["HELLO", "WORLD", "HOW", "ARE", "YOU", "WORLD", "WORLD"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "qrstuv"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "qrstuv"]], [["wxyz", "brown", "OU", "hi"], ["wxyz", "brown", "OU", "hi"]], [["HijKlMnOp", "QrStUv", "WxyZ", "AbCdEfG"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop"]], [["apple", "The", "HELLLLO", "cherry", "date", "cherry", "The"], ["apple", "The", "HELLLLO", "cherry", "date", "cherry", "The"]], [["brown", "Banana", "admin", "brown", "admin"], ["brown", "Banana", "admin", "brown", "admin"]], [["HELLO", "WORLD", "HOW", "ARE", "jumps", "YOU", "YOU", "YOU"], ["HELLO", "WORLD", "HOW", "ARE", "jumps", "YOU", "YOU", "YOU"]], [["h", "how", "are"], ["h", "how", "are"]], [["hello", "world", "how", "howw", "are", "you", "hoTydBzw", "world"], ["hello", "world", "how", "howw", "are", "you", "hoTydBzw", "world"]], [["Lorem", "ipsum", "you", "sit", "amet", "consectetur", "adipiscing", "elit"], ["Lorem", "ipsum", "you", "sit", "amet", "consectetur", "adipiscing", "elit"]], [["HOWqrstuabcdefgv", "HOW", "ARE", "YOU", "ARE"], ["HOWqrstuabcdefgv", "HOW", "ARE", "YOU", "ARE"]], [["hello", "world", "worl", "how", "howw", "are", "you", "hoTydBzw"], ["hello", "world", "worl", "how", "howw", "are", "you", "hoTydBzw"]], [["the", "h", "hi", "admin", "admin", ""], ["the", "h", "hi", "admin", "admin", ""]], [["Lorem", "ipsum", "dolor", "sit", "amet", "12345", "consectetur", "adipiscing", "elit"], ["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [[], ["abcdefg"]], [["wxyz", "brown", "OU", "hi", "hi", "hi"], ["wxyz", "brown", "OU", "hi", "hi", "hi"]], [["apple", "AREThe", "cherry", "date", "datHOWe", "12345Cherry"], ["apple", "AREThe", "cherry", "date", "datHOWe", "12345Cherry"]], [["YyouOU", "HELLO", "HOW", "Lorem", "YOU"], ["YyouOU", "HELLO", "HOW", "Lorem", "YOU"]], [["adnmin", "aadmin", "admin", "hi", "aadmin"], ["adnmin", "aadmin", "admin", "hi", "aadmin"]], [["YyouOU", "HELLO", "WORLD", "HOW", "ARE"], ["YyouOU", "HELLO", "WORLD", "HOW", "ARE"]], [["apple", "banana", "chherry"], ["apple", "banana", "chherry"]], [["Cherry", "Date", "Date"], ["apple", "banana", "Apple", "date"]], [["hello", "world", "worl", "how", "howw", "are", "hoTydBzw"], ["hello", "world", "worl", "how", "howw", "are", "hoTydBzw"]], [["apple", "banana", "cherry", "date"], ["apple", "banana", "cherry", "date"]], [["brown", "Banana", "admin", "Banana", "Banana"], ["brown", "Banana", "admin", "Banana", "Banana"]], [["YyouOU", "HLELLO", "WORLD", "HOW", "ARE", "YOU"], ["YyouOU", "HLELLO", "WORLD", "HOW", "ARE", "YOU"]], [["zz", "cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "acdefg", "z"], ["zz", "cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "acdefg", "z"]], [["HELLO", "WORLD", "datHOWe", "ARE", "YOU", "WORLD", "WORLD"], ["HELLO", "WORLD", "datHOWe", "ARE", "YOU", "WORLD", "WORLD"]], [["broquickwn", "Banana"], ["broquickwn", "Banana"]], [["qrhstuvwxy", "z", "qrstuvwxy"], ["qrhstuvwxy", "z", "qrstuvwxy"]], [["abcdefg", "qrstuv", "lazy", "wxyz"], ["abcdefg", "qrstuv", "lazy", "wxyz"]], [["abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg", "hijklmnopwxyz"], ["abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg", "hijklmnopwxyz"]], [["HEELLO", "WORLD", "OU"], ["HEELLO", "WORLD", "OU"]], [["apple", "AREThe", "cherry", "12345Cherry"], ["apple", "AREThe", "cherry", "12345Cherry"]], [["adnmin", "aadmin", "adminHELLOqrhstuvwxy", "hi", "aadmin"], ["adnmin", "aadmin", "adminHELLOqrhstuvwxy", "hi", "aadmin"]], [["brown", "Banana", "admin", "brown", "admin", "brown", "brown", "brown"], ["brown", "Banana", "admin", "brown", "admin", "brown", "brown", "brown"]], [["orver", "over", "qrstuvwxy"], ["orver", "over", "qrstuvwxy"]], [["HELLO", "The", "HOW", "ARE", "YOU", "ARE"], ["HELLO", "The", "HOW", "ARE", "YOU", "ARE"]], [["HELLO", "HOW", "AR", "YOU", "ARE"], ["HELLO", "HOW", "AR", "YOU", "ARE"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg", "qrstuv"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg", "qrstuv"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz"]], [["Banana", "HijKlMnOp", "HOWW", "Date", "Banana", "howw", "HOWW", "Date"], ["Banana", "HijKlMnOp", "HOWW", "Date", "Banana", "howw", "HOWW", "Date"]], [["Date"], ["Date"]], [["WxyZ", "world", "how", "howw", "worldd", "are", "dog", "you", "hoTydBzw", "world"], ["WxyZ", "world", "how", "howw", "worldd", "are", "dog", "you", "hoTydBzw", "world"]], [["AbCdEfG", "HijKlMnOp", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp"]], [["Banana", "HijKlMnOp", "HOWW", "Date", "Banana", "howw", "HOWW", "Date", "howw"], ["Banana", "HijKlMnOp", "HOWW", "Date", "Banana", "howw", "HOWW", "Date", "howw"]], [["the", "hi", "HOWqrstuabcdefgv", "admin", ""], ["the", "hi", "HOWqrstuabcdefgv", "admin", ""]], [["YyouOU", "HLELLO", "WORLD", "ARE", "YOU"], ["YyouOU", "HLELLO", "WORLD", "ARE", "YOU"]], [["YOYU", "YOU", "hi", "admin"], ["YOYU", "YOU", "hi", "admin"]], [["QrStUvWxyZ", "qrstulazyv", "hijklmno12345p", "qrstuv", "hijklmnop", "QrvWxyZ", "qrstuv", "brown", "wxyz", "qrstuv", "hijklmnop"], ["QrStUvWxyZ", "qrstulazyv", "hijklmno12345p", "qrstuv", "hijklmnop", "QrvWxyZ", "qrstuv", "brown", "wxyz", "qrstuv", "hijklmnop"]], [["apple", "12345Cherry", "how", "you", "12345Cherry", "you"], ["apple", "12345Cherry", "how", "you", "12345Cherry", "you"]], [["apple", "banana", "date", "apple"], ["apple", "banana", "date", "apple"]], [["apple", "OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry"], ["apple", "OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg", "qsrstuv"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg", "qsrstuv"]], [["Apple", "12345", "56789"], ["OyoUU"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "jumpss", "lazy"], ["Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit"]], [["abcdefg", "hijklamet", "HijKlMnOphijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop", "fg", "abcdefg"], ["abcdefg", "hijklamet", "HijKlMnOphijklmnop", "qrstuv", "wxyz", "hijklmnop", "hijklmnop", "fg", "abcdefg"]], [["hi", "admin", "hi"], ["hi", "admin", "hi"]], [["hi", "brWORL9876543210Dwn"], ["hi", "brWORL9876543210Dwn"]], [["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv", "hijkhlmnop", "qrstuv"], ["abcdefg", "hijklmnop", "thHOWe", "qrstuv", "wxyz", "qrstuv", "hijkhlmnop", "qrstuv"]], [["fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "fg"], ["fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "fg"]], [["aadmin", "adminHELLOqrhstuvwxy", "hi", "aadmin"], ["aadmin", "adminHELLOqrhstuvwxy", "hi", "aadmin"]], [["YyouOU", "HLELLO", "WORLD", "EARE", "ARE", "YOU"], ["YyouOU", "HLELLO", "WORLD", "EARE", "ARE", "YOU"]], [["12345", "56789"], ["12345", "56789"]], [["the", "hi", "HOWqrstuabcdefgv", "admin"], ["the", "hi", "HOWqrstuabcdefgv", "admin"]], [["appe", "apple", "OOyoUUUAREThe", "cherry", "12345Cherry"], ["appe", "apple", "OOyoUUUAREThe", "cherry", "12345Cherry"]], [["Banana", "HijKlMnOp", "HOWW", "Cherry", "Banana", "HOWW", "Date"], ["Banana", "HijKlMnOp", "HOWW", "Cherry", "Banana", "HOWW", "Date"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "worldd"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "worldd"]], [["HOW"], ["HOW"]], [["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"], ["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"]], [["apple", "abanana", "crherry", "date"], ["apple", "abanana", "crherry", "date"]], [["acdefg", "apple", "OOyoUUUAametREThe", "cherry", "12345Cherry"], ["acdefg", "apple", "OOyoUUUAametREThe", "cherry", "12345Cherry"]], [["WHOW", "HELLO", "WORLD", "HOW", "ARE"], ["WHOW", "HELLO", "WORLD", "HOW", "ARE"]], [["YyouOU", "HLELLO", "WORLD", "ARE", "WORLLD", "YOU"], ["YyouOU", "HLELLO", "WORLD", "ARE", "WORLLD", "YOU"]], [["appe", "apple", "OOyoUUUAREThe", "12345Cherry"], ["appe", "apple", "OOyoUUUAREThe", "12345Cherry"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "AaBbCcDdEeFfGgHhIiJjKrSsT", "AaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg"]], [["wxyzYOYU", "brown", "hi", "admin"], ["wxyzYOYU", "brown", "hi", "admin"]], [["HELLOqrhstuvwxy", "wxyzYOYU", "brown", "hi", "hi"], ["HELLOqrhstuvwxy", "wxyzYOYU", "brown", "hi", "hi"]], [["AaBbCcDdEeFfGgHhIiJjKrSsT", "Banana", "admin", "brown", "admin", "admin"], ["AaBbCcDdEeFfGgHhIiJjKrSsT", "Banana", "admin", "brown", "admin", "admin"]], [["YOYU", "YOU", "haadmin", "admin", "YOYU"], ["YOYU", "YOU", "haadmin", "admin", "YOYU"]], [["adoge", "apple", "AREThe", "cherry", "date", "datHOWe", "AUOUEThe", "12345Cherry"], ["adoge", "apple", "AREThe", "cherry", "date", "datHOWe", "AUOUEThe", "12345Cherry"]], [["fg", "qrstuv", "hijklmnop"], ["fg", "qrstuv", "hijklmnop"]], [["aadmin", "hi", "aadmin"], ["aadmin", "hi", "aadmin"]], [["YyouOU", "HLELLO", "WORLD", "E", "WORLLD", "YOU"], ["YyouOU", "HLELLO", "WORLD", "E", "WORLLD", "YOU"]], [["YyouOU", "HLELLO", "HOW", "WORLD", "HOW", "ARE", "YOU"], ["YyouOU", "HLELLO", "HOW", "WORLD", "HOW", "ARE", "YOU"]], [["qrstuvwxy", "z"], ["qrstuvwxy", "z"]], [["abcdefg", "qrstuv", "wxyz", "qrstuv"], ["abcdefg", "qrstuv", "wxyz", "qrstuv"]], [["apple", "abanana", "crherry", "date", "abanana"], ["apple", "abanana", "crherry", "date", "abanana"]], [["hello", "hi", "admin"], ["hello", "hi", "admin"]], [["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "qrstuv", "WORLD", "qrstuv"], ["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "qrstuv", "WORLD", "qrstuv"]], [["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "ovoer", "dog", "fox"], ["The", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "ovoer", "dog", "fox"]], [["AbCdEfG", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsWHOWT", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsWHOWT", "HijKlMnOp", "HijKlMnOp"]], [["YyouOU", "HWOW", "HELLO", "WORLD", "HOW", "YOU"], ["YyouOU", "HWOW", "HELLO", "WORLD", "HOW", "YOU"]], [["wxyzYOYUz", "brown", "hi", "admin", "hi"], ["wxyzYOYUz", "brown", "hi", "admin", "hi"]], [["The", "quick", "brown", "fox", "over", "brWORL9876543210Dwn", "the", "lazy", "dog"], ["The", "quick", "brown", "fox", "over", "brWORL9876543210Dwn", "the", "lazy", "dog"]], [["HWOW", "abcdefg", "hijklmnop", "wxyz", "abcdefg"], ["HWOW", "abcdefg", "hijklmnop", "wxyz", "abcdefg"]], [["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "OU"], ["HELLO", "WORLD", "HOW", "ARE", "OU", "WORLD", "OU"]], [["apple", "OOyoUUUAREThe", "date", "apple", "date"], ["apple", "OOyoUUUAREThe", "date", "apple", "date"]], [["admin"], ["admin"]], [["hello", "qrstuabcdefgv", "h", "how", "are"], ["hello", "qrstuabcdefgv", "h", "how", "are"]], [["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"], ["The", "quick", "brown", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"]], [["AbCdEfG", "wz"], ["AbCdEfG", "wz"]], [["hhello", "hello", "world", "how", "are", "you"], ["HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["apple", "OOyoUUUAREThe", "AREThe", "a", "cherry", "12345Cherry"], ["apple", "OOyoUUUAREThe", "AREThe", "a", "cherry", "12345Cherry"]], [["AbCdEfG", "admin", "QrStUvWxyZ", "dmin", "UuVvWwXxYyZz"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz"]], [["HOW", "ARE", "YOU", "ARE", "HOW"], ["HOW", "ARE", "YOU", "ARE", "HOW"]], [["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp"]], [["jumps123Cherry45"], ["jumps123Cherry45"]], [["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "wxyz", "qrstuv"], ["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "wxyz", "qrstuv"]], [["HELLO", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD"], ["HELLO", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD"]], [["apple", "banana", "date", "apple", "apple"], ["apple", "banana", "date", "apple", "apple"]], [["wxyzYOYU", "brown", "hi", "admin", "wxyzYOYU"], ["wxyzYOYU", "brown", "hi", "admin", "wxyzYOYU"]], [["adoge", "apple", "cherry", "date", "datHOWe", "AUOUEThe", "12345Cherry"], ["adoge", "apple", "cherry", "date", "datHOWe", "AUOUEThe", "12345Cherry"]], [["qrstuv", "wxywz"], ["qrstuv", "wxywz"]], [["BaHOWqrstuabcdefgvnana", "Banana"], ["BaHOWqrstuabcdefgvnana", "Banana"]], [["YOU", "hi", "AaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "admin"], ["YOU", "hi", "AaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "admin"]], [["YyouOU", "WORLLLD", "WORLD", "WORLD", "A12345CherryE", "WORLLD", "YOU"], ["YyouOU", "WORLLLD", "WORLD", "WORLD", "A12345CherryE", "WORLLD", "YOU"]], [["Bana", "HijKlMnOphijklmnop", "UOU", "Cherry", "Date", "Banana"], ["Bana", "HijKlMnOphijklmnop", "UOU", "Cherry", "Date", "Banana"]], [["dadipiscingate", "banana", "date", "apple"], ["dadipiscingate", "banana", "date", "apple"]], [["The", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"], ["The", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"]], [["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "qrstuv", "qrstuv"], ["abcdefg", "fg", "hijklmnop", "qrstuv", "wxyz", "hijklmnop", "qrstuv", "qrstuv"]], [["brown", "admin", "Banana", "Banana"], ["brown", "admin", "Banana", "Banana"]], [["Banana", "Cherry", "Date"], ["apple", "chery", "date"]], [["apple", "AREThe", "wz", "date", "12345Cherry", "wz"], ["apple", "AREThe", "wz", "date", "12345Cherry", "wz"]], [["abcdefg", "hijklpmnop", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "abcdefg"], ["abcdefg", "hijklpmnop", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "abcdefg"]], [["banana", "date", "apple"], ["banana", "date", "apple"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp"]], [["HijKlMnOp", "abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["HijKlMnOp", "abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["abcdefg", "hijklmnop", "qrstuvwxy", "UuVvWwVXxYyZz", "z", "UuVvWwVXxYyZz", "UuVvWwVXxYyZz"], ["abcdefg", "hijklmnop", "qrstuvwxy", "UuVvWwVXxYyZz", "z", "UuVvWwVXxYyZz", "UuVvWwVXxYyZz"]], [["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "YyouOU"], ["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "YyouOU"]], [["hello", "qrstuabcdefgv", "h", "how", "you", "how", "are"], ["hello", "qrstuabcdefgv", "h", "how", "you", "how", "are"]], [["abcdefg", "hijklmnop", "qrstuv", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT"], ["HiOjKlMnOp", "AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ"]], [["WxyZ", "world", "how", "worldd", "are", "dog", "you", "hoTydBzw", "world"], ["WxyZ", "world", "how", "worldd", "are", "dog", "you", "hoTydBzw", "world"]], [["how", "are", "yoU", "yoyU", "how", "yoyU"], ["how", "are", "yoU", "yoyU", "how", "yoyU"]], [["hjumps123Cherry45ello", "hello", "qrstuabcdefgv", "h", "how", "are"], ["hjumps123Cherry45ello", "hello", "qrstuabcdefgv", "h", "how", "are"]], [["wxythez", "abcdefg", "hijklmno12345p", "hijklmnop", "qrstuv", "z"], ["wxythez", "abcdefg", "hijklmno12345p", "hijklmnop", "qrstuv", "z"]], [["HOW", "HOW"], ["HOW", "HOW"]], [["AR", "HLELLO", "WORLD", "E", "WORLLD", "YOU", "YOU"], ["AR", "HLELLO", "WORLD", "E", "WORLLD", "YOU", "YOU"]], [["HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"], ["HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"]], [["AbCdEfG", "HijKlqrstuabcdefgvMnOp", "HijKlMnOp", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "HijKlqrstuabcdefgvMnOp", "HijKlMnOp", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp"]], [["abcdefg", "hijklmnop", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT"], ["HiOjKlMnOp", "AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ"]], [["HELLO", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OOU", "OU", "HOW"], ["HELLO", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OOU", "OU", "HOW"]], [["abcdefg", "qrstudatev", "wxyz", "qrstuv"], ["abcdefg", "qrstudatev", "wxyz", "qrstuv"]], [["zz", "cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "zz", "acdefg", "z"], ["zz", "cherry", "abcdefg", "hijklmnop", "qrstuvwxy", "z", "zz", "acdefg", "z"]], [["YyouOU", "HLELLO", "WORLD", "WWORLLD", "ARE", "WORLLD", "YOU"], ["YyouOU", "HLELLO", "WORLD", "WWORLLD", "ARE", "WORLLD", "YOU"]], [["abcdefg", "hijklamet", "HijKlMnOphijklmnop", "xfox", "wxyz", "hijklmnop", "hijklmnop", "abcdefg"], ["abcdefg", "hijklamet", "HijKlMnOphijklmnop", "xfox", "wxyz", "hijklmnop", "hijklmnop", "abcdefg"]], [["the", "hi", "admarein", "", "the"], ["the", "hi", "admarein", "", "the"]], [["cherry", "abcdefg", "qrstuvwxy", "z", "qrstuvwxy", "abcdefg"], ["cherry", "abcdefg", "qrstuvwxy", "z", "qrstuvwxy", "abcdefg"]], [["apple", "banana", "cherry", "hibana", "date"], ["apple", "banana", "cherry", "hibana", "date"]], [["HELLO", "wxyzYOYUz", "AaBbCcDdEeFfGgHhIiJjKrSsT", "WORLD", "datHOWe", "ARE", "YOU", "WORLD", "WORLD"], ["HELLO", "wxyzYOYUz", "AaBbCcDdEeFfGgHhIiJjKrSsT", "WORLD", "datHOWe", "ARE", "YOU", "WORLD", "WORLD"]], [["h", "how", "are", "Bananayou"], ["h", "how", "are", "Bananayou"]], [["YyouOU", "HWOW", "HELLO", "WHWOW", "WORLD", "HOW", "YOU", "YOU"], ["YyouOU", "HWOW", "HELLO", "WHWOW", "WORLD", "HOW", "YOU", "YOU"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "QrStUvW", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "UuVvWwXxYyZz", "UuVvWwXxYyZz"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz"]], [["YyouOU", "ARHijKlMnOpE", "HELLO", "WORLD", "HOW", "AAppleRE"], ["YyouOU", "ARHijKlMnOpE", "HELLO", "WORLD", "HOW", "AAppleRE"]], [["brown", "admin", "Banana", "admin"], ["brown", "admin", "Banana", "admin"]], [[], ["hi", "admin", "hi"]], [["fg", "qrstuv"], ["fg", "qrstuv"]], [["HELLO", "WORLD", "HOW", "OyoUU", "Ohi", "WORLD", "HOW"], ["HELLO", "WORLD", "HOW", "OyoUU", "Ohi", "WORLD", "HOW"]], [["over", "qrstuvwxworldy"], ["over", "qrstuvwxworldy"]], [["WHOW", "HELLO", "WORLD", "HOW", "HOW"], ["WHOW", "HELLO", "WORLD", "HOW", "HOW"]], [["hhi", "hi", "admin"], ["hhi", "hi", "admin"]], [["hello", "hi", "adnmin"], ["hello", "hi", "adnmin"]], [["fg", "hijklmnophijklmnop", "qrstuv", "wxyz", "hijklmnop", "fg"], ["fg", "hijklmnophijklmnop", "qrstuv", "wxyz", "hijklmnop", "fg"]], [["HELLO", "WOD", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD"], ["HELLO", "WOD", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD"]], [["h", "how", "are", "Bananayou", "how"], ["h", "how", "are", "Bananayou", "how"]], [["Banana", "HOWW", "Cherry", "Datee", "Banana"], ["Banana", "HOWW", "Cherry", "Datee", "Banana"]], [["Banana", "qrhstuvwxy", "HOWW", "Date", "Banana", "Date"], ["Banana", "qrhstuvwxy", "HOWW", "Date", "Banana", "Date"]], [["Lorem", "ipsum", "you", "dolor", "jumps", "amet", "consectetur", "adipiscing", "elit"], ["Lorem", "ipsum", "you", "dolor", "jumps", "amet", "consectetur", "adipiscing", "elit"]], [["dolor", "apple", "banana", "banana"], ["dolor", "apple", "banana", "banana"]], [["YyouOU", "HWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "HOW", "YyouOU", "YyouOU"], ["YyouOU", "HWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "HOW", "YyouOU", "YyouOU"]], [["Lorem", "ipsum", "you", "dolor", "sit", "amet", "consectetur", "adipiscing", "YyouOUconsectetur"], ["Lorem", "ipsum", "you", "dolor", "sit", "amet", "consectetur", "adipiscing", "YyouOUconsectetur"]], [["aadmin", "adminHELLOqrhstuvwxy", "hi", "hi", "aadmin"], ["aadmin", "adminHELLOqrhstuvwxy", "hi", "hi", "aadmin"]], [["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "YyouOU", "YyouOU"], ["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "YyouOU", "YyouOU"]], [["AbCdEfG", "HijKlMnOp", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["abcdefg", "hijklmnop", "wxyz"]], [["HijKlMnOp", "abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "orver"], ["HijKlMnOp", "abcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "orver"]], [["hi", "aadmin"], ["hi", "aadmin"]], [["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "9876543210", "YyouOU"], ["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "9876543210", "YyouOU"]], [["HELLO", "admarein", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OOU", "OU", "HOW"], ["HELLO", "admarein", "YOU", "HOWqrstuabcdefgv", "HOWW", "WORLD", "HOW", "OOU", "OU", "HOW"]], [["Cherry", "date"], ["Cherry", "date"]], [["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are", "are"], ["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are", "are"]], [["hjumps123Cherry45ello", "hello", "h", "how", "are"], ["hjumps123Cherry45ello", "hello", "h", "how", "are"]], [["hello", "world", "how", "are", "hello"], []], [["YyouOU", "HELLO", "HOW", "YOU"], ["YyouOU", "HELLO", "HOW", "YOU"]], [["HELLOqrhstuvwxy", "HO", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"], ["HELLOqrhstuvwxy", "HO", "WORLD", "HOW", "OyoUU", "ARE", "Ohi", "WORLD", "HOW", "HOW"]], [["abcdefg", "hijklmnop", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT", "hijklmnop", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT"], ["HiOjKlMnOp", "AbCdEfG", "HijKlMnOp", "QrStUv", "WxyZ"]], [[], ["abcdefg", "abcdefg"]], [["abcdefg", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "qrstuv", "wxyz", "abyoucdefg", "qrstuv", "abcdefg", "qrstuv"], ["abcdefg", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "qrstuv", "wxyz", "abyoucdefg", "qrstuv", "abcdefg", "qrstuv"]], [["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "abcdhelloefg", "z", "qrstuvwxy", "hijklmnop"], ["cherry", "abcdefg", "hijklmnop", "qrhstuvwxy", "abcdhelloefg", "z", "qrstuvwxy", "hijklmnop"]], [["The", "lahhellozy", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"], ["The", "lahhellozy", "quick", "brown", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog", "fox"]], [["HELLO", "YOU", "HOWqrstuabcdfgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW"], ["HELLO", "YOU", "HOWqrstuabcdfgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW"]], [["HijKlMnOp", "QrStUv", "AbCdEfG"], ["HijKlMnOp", "QrStUv", "AbCdEfG"]], [["abcdefg", "fg", "hijklmnop", "abyoucdefg", "qrstuv", "wxyz", "hijklmnop", "qrstuv", "qrstuv"], ["abcdefg", "fg", "hijklmnop", "abyoucdefg", "qrstuv", "wxyz", "hijklmnop", "qrstuv", "qrstuv"]], [["HELLO", "WORLD", "HOW", "AR", "OU", "amet", "WORLD", "O", "OU"], ["HELLO", "WORLD", "HOW", "AR", "OU", "amet", "WORLD", "O", "OU"]], [["qrstuvwxy", "zz", "z", "z"], ["qrstuvwxy", "zz", "z", "z"]], [["Lorem", "ipsum", "dolor", "sit", "amet", "ametUuVvWwVXxYyZz", "adipiscing", "elit"], ["Lorem", "ipsum", "dolor", "sit", "amet", "ametUuVvWwVXxYyZz", "adipiscing", "elit"]], [["apple", "OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry", "cherry"], ["apple", "OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry", "cherry"]], [["AbCdEfG", "HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "chery", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "chery", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"]], [["HELLO", "WORLD", "HOW", "hibana", "ARE", "YOU", "ARE"], ["HELLO", "WORLD", "HOW", "hibana", "ARE", "YOU", "ARE"]], [["HELLO", "WORLD", "HOW", "OyoUU", "brcoquickwn", "ARE", "Ohi", "WORLD", "HOW"], ["HELLO", "WORLD", "HOW", "OyoUU", "brcoquickwn", "ARE", "Ohi", "WORLD", "HOW"]], [["hello", "how", "are", "you", "how", "are"], ["hello", "how", "are", "you", "how", "are"]], [["brown", "Banana", "admin", "worl", "Banana"], ["brown", "Banana", "admin", "worl", "Banana"]], [["HOW", "HOW", "HOHW", "HOW"], ["HOW", "HOW", "HOHW", "HOW"]], [["qrstuvwxy", "zz", "z", "z", "z", "zz"], ["qrstuvwxy", "zz", "z", "z", "z", "zz"]], [["HLELLO", "WOORLD", "HOW", "AERE", "YOU", "AERE", "AERE"], ["HLELLO", "WOORLD", "HOW", "AERE", "YOU", "AERE", "AERE"]], [["yoyU", "wxythez", "12ipsum7890", "hijklmno12345p", "hijklmnop", "qrstuv", "z"], ["yoyU", "wxythez", "12ipsum7890", "hijklmno12345p", "hijklmnop", "qrstuv", "z"]], [["HOW", "brWORL9876543210Dwn", "HOW"], ["HOW", "brWORL9876543210Dwn", "HOW"]], [["jumps123Cherry45", "h", "how", "are", "HiOjKlMnOp", "you"], ["jumps123Cherry45", "h", "how", "are", "HiOjKlMnOp", "you"]], [["AbCdEfG", "HijKlqrstuabcdefgvMnOp", "ddate", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp", "HijKlqrstuabcdefgvMnOp"], ["AbCdEfG", "HijKlqrstuabcdefgvMnOp", "ddate", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "HijKlMnOp", "HijKlMnOp", "HijKlqrstuabcdefgvMnOp"]], [["abcdefg", "OOU", "abcdefg"], ["abcdefg", "OOU", "abcdefg"]], [["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are", "HijKlMnOp", "you"], ["hello", "qrstuabcdefgv", "h", "how", "are", "you", "how", "are", "HijKlMnOp", "you"]], [["HELLO", "WORL9876543210D", "HOW", "ARE", "HELOHELLO", "OU"], ["HELLO", "WORL9876543210D", "HOW", "ARE", "HELOHELLO", "OU"]], [["fox", "jumps123Cherry45", "WORLD", "HOW", "UOU"], ["fox", "jumps123Cherry45", "WORLD", "HOW", "UOU"]], [["hello", "hi"], ["hello", "hi"]], [["apple", "cherry", "date", "datHOWe", "12345Cherry"], ["apple", "cherry", "date", "datHOWe", "12345Cherry"]], [["Apple", "Banana", "HOWW", "Cherry", "Bnana"], ["Apple", "Banana", "HOWW", "Cherry", "Bnana"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "YOUUuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "HijKlMnOp", "UuVvWwXxYyZz"], ["abcdefg", "hijklmnop", "cherry", "qrstuv", "wxyz", "abcdefg"]], [["The", "browWWORLLD", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"], ["The", "browWWORLLD", "xfox", "fox", "jumps", "sit", "over", "the", "lazy", "OU", "dog"]], [["dolor", "banaqrstudatev", "apple", "banana", "banana"], ["dolor", "banaqrstudatev", "apple", "banana", "banana"]], [["YOU", "AaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "admin"], ["YOU", "AaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "admin"]], [["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "sit"], ["amaet", "Lorem", "ipsum", "dolor", "sit", "amet", "consectetur", "adipiscing", "elit", "sit"]], [["apple", "banana", "apOUple", "hibana", "date"], ["apple", "banana", "apOUple", "hibana", "date"]], [["abcdefg", "hijklmnop", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT", "hijklmnop", "wxyAaBbCcDdEeFfGgHhIiJjKrSsT"], ["HiOjKlMnOp", "OyoUU", "HijKlMnOp", "QrStUv", "WxyZ"]], [["A12345CherryEhi", "the", "hi", "HOWqrstuabcdefgv", ""], ["A12345CherryEhi", "the", "hi", "HOWqrstuabcdefgv", ""]], [["brockwn", "Banana"], ["brockwn", "Banana"]], [["HOW", "HOW", "HOHW", "HOW", "HOW"], ["HOW", "HOW", "HOHW", "HOW", "HOW"]], [["hello", "world", "how", "howw", "are", "you", "hoTydBzw", "how"], ["hello", "world", "how", "howw", "are", "you", "hoTydBzw", "how"]], [["YyouOU", "WORLD", "HOW", "ARE"], ["YyouOU", "WORLD", "HOW", "ARE"]], [["AbCdEfG", "AEbCdEfG", "yoU", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsWHOWT", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "AEbCdEfG", "yoU", "date", "QrStUv", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsWHOWT", "HijKlMnOp", "HijKlMnOp"]], [["YOYU", "hi", "admin"], ["YOYU", "hi", "admin"]], [["hhello", "hello", "world", "how", "are", "you", "how"], ["HELLO", "WORLD", "HOW", "ARE", "YOU"]], [["fg", "hijklmnop", "qrstuv", "wxyz"], ["fg", "hijklmnop", "qrstuv", "wxyz"]], [["YOU", "hi"], ["YOU", "hi"]], [["abcdefg", "hijklmno12345p", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwVXxYyZz"]], [["WWORLD", "YyouOU", "HLELLO", "WORLD", "ARE", "WORLLD", "YOU"], ["WWORLD", "YyouOU", "HLELLO", "WORLD", "ARE", "WORLLD", "YOU"]], [["ipsum", "abcdefg", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "qrstuv", "wxyz", "abyoucdefg", "qrstuv", "abcdefg", "qrstuv", "wxyz"], ["ipsum", "abcdefg", "hijklmnop", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "qrstuv", "wxyz", "abyoucdefg", "qrstuv", "abcdefg", "qrstuv", "wxyz"]], [["AbCdEfG", "HijKlMnOp", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXyxYyZz", "HijKlMnOp"], ["abcdefg", "hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstuv", "abcdefg"]], [["hello", "qrstuabcdefgv", "how", "you", "how"], ["hello", "qrstuabcdefgv", "how", "you", "how"]], [["broquickwn", "BadminHELLOqrhstuvwxynana", "Banana"], ["broquickwn", "BadminHELLOqrhstuvwxynana", "Banana"]], [["HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg", "abcdefg"], ["HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg", "abcdefg"]], [["apple", "OOyoUUUAREThe", "AREThe", "amet", "cherry", "amet"], ["apple", "OOyoUUUAREThe", "AREThe", "amet", "cherry", "amet"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT"]], [["AbCdEfG", "TydBz", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXyxYyZz", "HijKlMnOp"], ["hijklmnop", "qrstuv", "wxyz", "abcdefg", "qrstqrstuvwxworldyuv", "abcdefg"]], [["BaHOWqrstuabcdefgvnana", "Banana", "Banana"], ["BaHOWqrstuabcdefgvnana", "Banana", "Banana"]], [["YyouOU", "WORLD", "HOW"], ["YyouOU", "WORLD", "HOW"]], [["AbCdEfG", "TydBz", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXyxYyZz", "HijKlMnOp"], ["AbCdEfG", "TydBz", "date", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXyxYyZz", "HijKlMnOp"]], [["HELLO", "WORLD", "HOW", "AR", "OU", "amet", "WORLD", "O", "OU", "amet"], ["HELLO", "WORLD", "HOW", "AR", "OU", "amet", "WORLD", "O", "OU", "amet"]], [["HELLOqrhstuvwxy", "wxyzYOYU", "brown", "hi", "hi", "HELLOqrhstuvwxy"], ["HELLOqrhstuvwxy", "wxyzYOYU", "brown", "hi", "hi", "HELLOqrhstuvwxy"]], [["AbCdEfG", "QrStUv", "WxyZ", "WxyZ"], ["AbCdEfG", "QrStUv", "WxyZ", "WxyZ"]], [["hello", "world", "are", "you"], [""]], [["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "YyouOU", "YyouO"], ["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOhjumps123Cherry45elloU", "YyouOU", "YyouO"]], [["banana", "date", "apple", "ARHijKlMnOpE"], ["banana", "date", "apple", "ARHijKlMnOpE"]], [["abcdefg", "hijklmno12345p", "wxyz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwVXxYyZz", "QrStUvWxyZ"]], [["abcdefg", "UuVvWwVXxYyZz", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["abcdefg", "UuVvWwVXxYyZz", "wxyz", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["HELLO", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD", "WORLD", "WORLD"], ["HELLO", "WORLD", "datHOWe", "ARE", "WORLD", "WORLD", "WORLD", "WORLD"]], [["YyouOU", "ARHijKlMnOpE", "HELLO", "WORLD", "HOW", "AAppleRE", "HOW"], ["YyouOU", "ARHijKlMnOpE", "HELLO", "WORLD", "HOW", "AAppleRE", "HOW"]], [["abcdefag", "qrstudatev", "wxyz", "qrstuv"], ["abcdefag", "qrstudatev", "wxyz", "qrstuv"]], [["the", "hi", "HOWqrstuabcdefgv", "admin", "hi"], ["the", "hi", "HOWqrstuabcdefgv", "admin", "hi"]], [["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBb12345CherryfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"], ["AbCdEfG", "HijKlMnOp", "QrStUvWxyZ", "AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz", "AaBb12345CherryfGgHhIiJjKkLlMmNnOoPpQqRrSsT", "UuVvWwXxYyZz"]], [["A12345CherryEhi", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy", "A12345CherryEhi"], ["A12345CherryEhi", "abcdefg", "hijklmnop", "qrhstuvwxy", "z", "qrstuvwxy", "A12345CherryEhi"]], [["Lorem", "ipsum", "dolor", "sit", "consectetur", "adipiscing", "dolor"], ["The", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]], [["12345", "56789qsrstuv", "56789"], ["12345", "56789qsrstuv", "56789"]], [["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOU", "YyouO"], ["YoyouOU", "YyouOU", "HWWOW", "WORLD", "YyouOU", "YyouO"]], [["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "HijKlqrstuabcdefgvMnOp", "wxyz", "qrstuv"], ["QrStUvWxyZ", "hijklmno12345p", "hijklmnop", "HijKlqrstuabcdefgvMnOp", "wxyz", "qrstuv"]], [["AaBbCcDdEeFfGgHhIiJjKrSsT", "Banana", "admin", "brown", "admin", "admin", "admin"], ["AaBbCcDdEeFfGgHhIiJjKrSsT", "Banana", "admin", "brown", "admin", "admin", "admin"]], [["HELLO", "YOU", "HOWqrstuabcdfgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW", "HOW"], ["HELLO", "YOU", "HOWqrstuabcdfgv", "HOWW", "WORLD", "HOW", "OU", "OU", "HOW", "HOW"]], [["the", "hi", "amdmin", "HOWqrstuabcdefgv", "admin", ""], ["the", "hi", "amdmin", "HOWqrstuabcdefgv", "admin", ""]], [["afbcdefg", "qrstuv", "wxyz"], ["afbcdefg", "qrstuv", "wxyz"]], [["hhello", "hello", "world", "how", "are", "you", "h"], ["hhello", "hello", "world", "how", "are", "you", "h"]], [["Banana", "HijKlMnOp", "hijklmno12345p", "HOWW", "Cherry", "Banana", "HOWW", "Date"], ["Banana", "HijKlMnOp", "hijklmno12345p", "HOWW", "Cherry", "Banana", "HOWW", "Date"]], [["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "OOyoUUUAametRETheYyouOU"], ["YyouOU", "HWOW", "WORLD", "HOW", "YOU", "YyouOU", "OOyoUUUAametRETheYyouOU"]], [["abcdefg", "abfcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"], ["abcdefg", "abfcdefg", "hijklmnopwxyz", "qrstuv", "abcdefg", "qrstuabcdefgv", "abcdefg"]], [["the", "Datehi", "t", "HOWqrstuabcdefgv", "adnmin"], ["the", "Datehi", "t", "HOWqrstuabcdefgv", "adnmin"]], [["AbCdEfG", "HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "chery", "QrStUv", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"], ["AbCdEfG", "HijKlMnOp", "dateAaBbCcDdEeFfhGgHhIiJjKkLlbMmNnOoPpQqRrSsT", "chery", "QrStUv", "HijKlMnOp", "HijKlMnOp", "HijKlMnOp"]], [["HELLO", "WOD", "WORLD", "datHOWe", "ARE", "WORLD"], ["HELLO", "WOD", "WORLD", "datHOWe", "ARE", "WORLD"]], [["YyouOU", "HLELLO", "HOW", "WORLD", "HOW", "ARE", "YOU", "YOU"], ["YyouOU", "HLELLO", "HOW", "WORLD", "HOW", "ARE", "YOU", "YOU"]], [["OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry"], ["OOyoUUUAREThe", "AREThe", "cherry", "12345Cherry"]], [["abdefg", "HWOW", "abcdefg", "hijklmnop", "wxyz", "abcdefg"], ["abdefg", "HWOW", "abcdefg", "hijklmnop", "wxyz", "abcdefg"]], [["hi", "quickadmin", "admin"], ["hi", "quickadmin", "admin"]]], "completion": "\n\ndef total_match(lst1, lst2):\n if sum([len(i) for i in lst1]) < sum([len(i) for i in lst2]):\n return lst1\n else:\n return lst2\n\n", "raw_completion": "```python\n\ndef total_match(lst1, lst2):\n if sum([len(i) for i in lst1]) < sum([len(i) for i in lst2]):\n return lst1\n else:\n return lst2\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef total_match(lst1, lst2):\n '''\n Write a function that accepts two lists of strings and returns the list that has \n total number of chars in the all strings of the list less than the other list.\n\n if the two lists have the same number of chars, return the first list.\n\n Examples\n total_match([], []) \u279e []\n total_match(['hi', 'admin'], ['hI', 'Hi']) \u279e ['hI', 'Hi']\n total_match(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) \u279e ['hi', 'admin']\n total_match(['hi', 'admin'], ['hI', 'hi', 'hi']) \u279e ['hI', 'hi', 'hi']\n total_match(['4'], ['1', '2', '3', '4', '5']) \u279e ['4']\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/75", "prompt": "\ndef is_multiply_prime(a):\n \"\"\"Write a function that returns true if the given number is the multiplication of 3 prime numbers\n and false otherwise.\n Knowing that (a) is less then 100. \n Example:\n is_multiply_prime(30) == True\n 30 = 2 * 3 * 5\n \"\"\"\n", "entry_point": "is_multiply_prime", "canonical_solution": "\n if a <= 1: return False\n isprime = [True] * (a + 1)\n for i in range(2, a + 1):\n if isprime[i]:\n for j in range(i + i, a + 1, i):\n isprime[j] = False\n cnt, tmp = 0, a\n for i in range(2, a + 1):\n while isprime[i] and tmp % i == 0:\n tmp //= i\n cnt += 1\n return cnt == 3\n\n", "test": "def check(candidate):\n\n assert candidate(5) == False\n assert candidate(30) == True\n assert candidate(8) == True\n assert candidate(10) == False\n assert candidate(125) == True\n assert candidate(3 * 5 * 7) == True\n assert candidate(3 * 6 * 7) == False\n assert candidate(9 * 9 * 9) == False\n assert candidate(11 * 9 * 9) == False\n assert candidate(11 * 13 * 7) == True\n\n", "contract": "\n assert type(a) == int, \"invalid inputs\" # $_CONTRACT_$\n assert a < 100, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[5], [30], [8], [10]], "atol": 0, "plus_input": [[33], [49], [77], [91], [99], [6], [90], [98], [25], [21], [48], [20], [22], [32], [26], [78], [19], [47], [31], [5], [29], [-98], [-37], [-38], [28], [18], [23], [-92], [-2], [57], [-99], [58], [56], [-1], [92], [1], [-80], [34], [-75], [-100], [-95], [16], [-94], [17], [59], [-7], [93], [-82], [-15], [-81], [-96], [-74], [2], [3], [7], [97], [42], [-101], [43], [44], [45], [-56], [60], [-55], [46], [62], [55], [61], [41], [40], [-57], [63], [-102], [52], [-72], [-97], [94], [12], [89], [53], [0], [8], [64], [-58], [65], [-71], [95], [35], [-70], [96], [-59], [15], [-33]], "completion": "\n\nimport numpy as np\n\ndef is_multiply_prime(a):\n \"\"\"\n Returns True if the given number is the multiplication of 3 prime numbers and False otherwise.\n \n Parameters:\n a (int): The given number\n \n Returns:\n bool: True if the given number is the multiplication of 3 prime numbers and False otherwise.\n \"\"\"\n primes = np.array([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97])\n factors = []\n for prime in primes:\n if a % prime == 0:\n factors.append(prime)\n if len(factors) == 3:\n return True\n return False\n\n", "raw_completion": "```python\n\nimport numpy as np\n\ndef is_multiply_prime(a):\n \"\"\"\n Returns True if the given number is the multiplication of 3 prime numbers and False otherwise.\n \n Parameters:\n a (int): The given number\n \n Returns:\n bool: True if the given number is the multiplication of 3 prime numbers and False otherwise.\n \"\"\"\n primes = np.array([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97])\n factors = []\n for prime in primes:\n if a % prime == 0:\n factors.append(prime)\n if len(factors) == 3:\n return True\n return False\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef is_multiply_prime(a):\n \"\"\"Write a function that returns true if the given number is the multiplication of 3 prime numbers\n and false otherwise.\n Knowing that (a) is less then 100. \n Example:\n is_multiply_prime(30) == True\n 30 = 2 * 3 * 5\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/76", "prompt": "\ndef is_simple_power(x, n):\n \"\"\"Your task is to write a function that returns true if a number x is a simple\n power of n and false in other cases.\n x is a simple power of n if n**int=x\n For example:\n is_simple_power(1, 4) => true\n is_simple_power(2, 2) => true\n is_simple_power(8, 2) => true\n is_simple_power(3, 2) => false\n is_simple_power(3, 1) => false\n is_simple_power(5, 3) => false\n \"\"\"\n", "entry_point": "is_simple_power", "canonical_solution": "\n if x == 1: return True\n if n == 0: return x == 0\n if n == 1: return x == 1\n if n == -1: return abs(x) == 1\n p = n\n while abs(p) <= abs(x):\n if p == x: return True\n p = p * n\n return False\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(16, 2)== True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(143214, 16)== False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(4, 2)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(9, 3)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(16, 4)==True, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(24, 2)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(128, 4)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n assert candidate(12, 6)==False, \"This prints if this assert fails 1 (good for debugging!)\"\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(1, 1)==True, \"This prints if this assert fails 2 (also good for debugging!)\"\n assert candidate(1, 12)==True, \"This prints if this assert fails 2 (also good for debugging!)\"\n\n", "contract": "\n assert type(x) == int and type(n) == int, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[16, 2], [143214, 16], [4, 2], [9, 3], [16, 4], [24, 2], [128, 4], [12, 6], [1, 1], [1, 12]], "atol": 0, "plus_input": [[25, 5], [81, 3], [64, 4], [36, 6], [10, 2], [20, 5], [15, 3], [35, 5], [49, 7], [125, 5], [5, 5], [23, 5], [25, 23], [23, 2], [21, 2], [6, 5], [6, 7], [81, 6], [64, 6], [2, 2], [2, 5], [23, 23], [25, 6], [82, 3], [82, 7], [81, 81], [10, 3], [36, 5], [15, 23], [7, 15], [82, 2], [10, 81], [49, 8], [81, 7], [21, 35], [20, 23], [81, 25], [35, 35], [81, 5], [83, 4], [64, 21], [23, 81], [64, 64], [49, 82], [8, 6], [4, 5], [125, 2], [82, 1], [8, 64], [11, 23], [49, 4], [11, 7], [125, 6], [24, 25], [64, 5], [5, 4], [20, 19], [15, 15], [82, 5], [4, 4], [11, 11], [25, 25], [24, 10], [3, 10], [23, 15], [82, 82], [11, 10], [80, 81], [3, 2], [36, 36], [8, 5], [5, 6], [35, 49], [6, 6], [19, 5], [8, 49], [49, 49], [37, 6], [3, 4], [65, 64], [6, 81], [37, 15], [65, 5], [10, 11], [82, 65], [82, 23], [24, 23], [66, 65], [10, 10], [7, 11], [7, 25], [4, 24], [49, 3], [84, 84], [2187, 3], [8192, 4], [16777216, 4], [1099511627776, 2], [4722366482869645213696, 6], [27, 3], [243, 3], [245, 5], [65536, 2], [245, 27], [2188, 3], [4722366482869645213696, 4722366482869645213696], [245, 245], [2188, 2189], [4, 3], [2189, 2189], [4, 65536], [243, 2], [65537, 65536], [2189, 2188], [2, 6], [2187, 2189], [245, 244], [81, 2188], [16777216, 16777217], [5, 27], [243, 6], [82, 245], [3, 3], [4, 16777217], [245, 16777217], [2188, 2188], [81, 16777217], [243, 4], [245, 2188], [242, 16777216], [3, 65537], [2188, 16777216], [246, 5], [242, 1099511627776], [240, 240], [1099511627776, 2187], [2188, 2], [3, 65536], [243, 16777217], [16777217, 81], [242, 242], [6, 4722366482869645213696], [16777217, 16777216], [243, 243], [26, 27], [4722366482869645213696, 1099511627776], [4722366482869645213695, 4722366482869645213696], [245, 16777216], [2, 81], [4722366482869645213695, 4], [4, 2187], [65536, 65536], [4, 16777216], [82, 246], [16777217, 16777217], [3, 5], [65537, 5], [27, 246], [2188, 16777217], [82, 4722366482869645213696], [4722366482869645213696, 1099511627777], [4722366482869645213695, 4722366482869645213695], [2187, 244], [65537, 245], [16777216, 16777216], [4722366482869645213695, 4722366482869645213697], [65536, 65537], [4722366482869645213696, 4722366482869645213695], [243, 242], [2187, 1099511627776], [2189, 3], [1099511627775, 1099511627775], [246, 246], [65537, 3], [240, 16777216], [1099511627776, 242], [16777215, 16777216], [4722366482869645213696, 65537], [246, 245], [1, 1], [81, 246], [8192, 27], [16777215, 245], [16777216, 240], [246, 65536], [2187, 245], [244, 1099511627776], [5, 1], [65537, 6], [65537, 65537], [4, 1099511627775], [2, 16777217], [2188, 2187], [1099511627776, 1], [2, 4722366482869645213695], [240, 2188], [27, 16777217], [82, 4722366482869645213697], [1099511627776, 1099511627777], [4722366482869645213695, 2188], [1099511627775, 1099511627776], [2187, 2188], [1099511627775, 244], [244, 244], [246, 243], [2187, 2187], [1099511627775, 5], [4, 246], [16777215, 4], [2186, 2187], [1099511627777, 2187], [16777216, 27], [2186, 2186], [65537, 1099511627776], [2187, 16777216], [246, 16777217], [65538, 65536], [1099511627777, 3], [80, 2188], [27, 245], [83, 82], [3, 4722366482869645213695], [247, 246], [1099511627777, 4722366482869645213696], [83, 81], [4722366482869645213697, 4722366482869645213695], [5, 245], [247, 247], [246, 247], [81, 4722366482869645213696], [1, 4], [243, 65536], [244, 27], [246, 2189], [2187, 16777215], [246, 16777215], [27, 27], [4, 4722366482869645213696], [245, 2189], [5, 3], [16777216, 2188], [1099511627778, 243], [2188, 1099511627777], [27, 2188], [2188, 6], [16777216, 28], [2187, 6], [4722366482869645213696, 27], [2, 82], [245, 246], [2, 1099511627778], [16777215, 27], [4722366482869645213695, 2], [1099511627778, 241], [244, 65537], [80, 243], [1099511627777, 16777216], [241, 240], [246, 2], [8192, 1099511627778], [4722366482869645213696, 244], [246, 244], [65536, 4722366482869645213697], [2186, 3], [82, 4722366482869645213695], [246, 4722366482869645213695], [16777216, 6], [27, 28], [66, 95], [26, 246], [2187, 2186], [4722366482869645213698, 4722366482869645213695], [246, 1099511627776], [4, 2188], [66, 66], [4, 82], [81, 243], [4722366482869645213697, 4722366482869645213697], [81, 16777216], [1, 27], [95, 4], [3, 242], [241, 82], [65538, 65537], [65536, 26], [81, 65538], [1, 245], [1099511627778, 1099511627777], [2, 3], [242, 82], [240, 65537], [1099511627778, 1099511627778], [2186, 1099511627775], [244, 6], [83, 1], [8192, 8192], [2187, 242], [65537, 27], [2186, 5], [247, 4722366482869645213697], [28, 2190], [0, 1], [1099511627775, 1], [4, 80], [245, 1099511627775], [1, 2], [65538, 65538], [4722366482869645213695, 81], [4722366482869645213693, 4722366482869645213693], [241, 65538], [2187, 1099511627774], [65537, 81], [4722366482869645213696, 2187], [1099511627776, 2190], [16777215, 2188], [242, 1], [1099511627777, 1099511627777], [4722366482869645213696, 3], [96, 4], [242, 2190], [2186, 82], [242, 241], [1099511627777, 1099511627776], [16777215, 26], [65536, 5], [1099511627776, 4722366482869645213693], [2190, 241], [3, 16777217], [1099511627775, 1099511627774], [1099511627778, 4722366482869645213695], [245, 247], [16777217, 2188], [245, 4], [66, 16777214], [65537, 2185], [1, 3], [2188, 1099511627776], [65538, 244], [94, 95], [81, 82], [65537, 2188], [1099511627775, 2], [29, 243], [65537, 28], [8193, 8192], [4722366482869645213698, 2189], [244, 245], [6, 2], [1099511627778, 1099511627779], [27, 1099511627776], [2186, 4722366482869645213696], [247, 8192], [-1, 0], [1099511627776, 244], [1099511627777, 26], [6, 4], [2189, 241], [1099511627778, 2188], [1099511627774, 1], [28, 16777216], [3, 16777216], [4722366482869645213698, 246], [65537, 65538], [4722366482869645213698, 4722366482869645213698], [1099511627776, 3], [4722366482869645213696, 66], [6, 16777215], [83, 95], [8193, 2], [244, 2188], [16777218, 81], [5, 26], [81, 66], [-1, -2], [1, 244], [247, 4722366482869645213698], [2187, 65536], [1099511627774, -2], [-2, 0], [82, 27], [29, 81], [4722366482869645213693, 96], [82, 81], [2, 1099511627776], [1, 246], [81, 2187], [83, 1099511627775], [4722366482869645213695, 16777217], [80, 1099511627774], [242, 243], [82, 6], [246, 81], [243, 1099511627775], [16777217, 2185], [1099511627774, 80], [6, -2], [1, 8192], [1099511627777, 4722366482869645213695], [4722366482869645213695, 1099511627776], [4722366482869645213695, 4722366482869645213694], [27, 26], [83, 80], [4, 27], [29, 82], [1099511627778, 4722366482869645213693], [247, 28], [16777214, 16777215], [1099511627774, 242], [242, 3], [247, 1099511627776], [2188, 241], [246, 3], [80, 80], [16777215, 2], [66, 4722366482869645213696], [242, 96], [4722366482869645213694, 4722366482869645213694], [81, 16777215], [4722366482869645213694, 244], [96, 242], [1, 65537], [2189, 82], [246, 1099511627778], [-2, -2], [16777215, 16777215], [4722366482869645213696, 16777216], [2187, 1099511627775], [8193, 4], [-1, 1099511627775], [4, 65537], [16777217, 2187], [2190, 4722366482869645213695], [240, 16777217], [26, -2], [82, 4722366482869645213698], [26, 26], [4, 6], [240, 241], [1099511627778, 82], [4, 65535], [16777217, 1099511627778], [8191, 82], [16777217, 243], [96, 65537], [1099511627776, 1099511627776], [95, 96], [27, 4722366482869645213695], [244, 8191], [1099511627774, 244], [65536, 247], [243, 2189], [1099511627774, 16777215], [95, 2], [80, 3], [244, 4722366482869645213696], [4722366482869645213695, 82], [4722366482869645213695, 8193], [2190, 16777217], [247, 245], [80, 4722366482869645213694], [16777214, 27], [-2, 5], [1099511627779, 65536], [2187, 95], [241, 1099511627776], [-1, 67], [95, 95], [2190, 65536], [6, 242], [95, 4722366482869645213694], [247, 2], [241, 65536], [241, 239], [1, 1099511627778], [247, 4722366482869645213696], [244, 95], [8192, 246], [241, 66], [16777216, 65537], [244, 16777214], [97, 242], [29, 29], [3, 241], [8192, 16777216], [96, 3], [248, 2185], [241, 241], [16777215, 65536], [80, 245], [245, 95], [2187, 1099511627779], [2187, 2], [2189, 1099511627779], [67, 67], [4722366482869645213694, 4722366482869645213693], [1, 4722366482869645213695], [3, 246], [16777215, 16777214], [82, 2188], [4, 2], [80, 5], [80, 1099511627775], [2186, 245], [4, 2190], [4722366482869645213697, 95], [2189, 2], [67, 1099511627779], [240, 6], [4722366482869645213699, 4722366482869645213695], [4722366482869645213697, 65537], [244, 4], [81, 2], [65537, 83], [4722366482869645213696, 8192], [2190, 4722366482869645213696], [1099511627777, 1099511627778], [81, 4722366482869645213695], [8192, 8193], [246, 2188], [2189, 2190], [80, 16777216], [242, 1099511627778], [93, 93], [95, 246], [7, 7], [2190, 2190], [1099511627774, 4722366482869645213699], [241, 242], [240, 244], [248, 82], [244, 1099511627775], [65537, 82], [1099511627775, 242], [16777215, 240], [3, 244], [16777214, 16777216], [2, 27], [28, 28], [4722366482869645213696, 80], [242, 1099511627775], [247, 1099511627779], [65536, 65538], [241, 16777216], [16777216, 66], [81, 28], [2186, 16777215], [2190, 245], [1099511627776, 2191], [0, 2], [-8, 2], [16, -2], [-1, 1], [0, 0], [-1, 2], [10, -3], [3, 1000000], [101, 101], [2, 8192], [4722366482869645213695, 6], [2, 65537], [8193, 3], [3, 81], [4722366482869645213695, 16777216], [8, 8], [16777216, 4722366482869645213695], [5, 8193], [2186, 4], [8, 245], [5, 246], [65536, 4722366482869645213696], [4, 2186], [243, 65537], [28, 245], [16777216, 3], [243, 28], [8192, 245], [5, 81], [4722366482869645213695, 2186], [246, 2187], [81, 4], [6, 8193], [28, 8192], [65537, 8], [8191, 245], [244, 3], [65536, 1], [247, 2187], [65537, 2], [3, 243], [8191, 8], [2, 1], [2187, 4], [246, 4], [8190, 8191], [246, 8], [1099511627776, 4722366482869645213696], [65535, 65535], [4722366482869645213695, 2185], [245, 81], [1, 2187], [5, 2186], [1, 1099511627776], [246, 8192], [25, 26], [244, 5], [4722366482869645213694, 4722366482869645213695], [4722366482869645213695, 2187], [25, 246], [1099511627777, 2], [65536, 6], [2186, 8191], [28, 65536], [4722366482869645213696, 8], [4722366482869645213695, 5], [6, 3], [5, 65535], [3, 27], [245, 2], [243, 27], [28, 65537], [8192, 2187], [1, 8193], [2, 1099511627777], [8194, 3], [5, 8], [1099511627776, 8192], [1099511627776, 8193], [2187, 1099511627777], [4722366482869645213696, 7], [65537, 2187], [26, 3], [28, 5], [3, 4722366482869645213694], [5, 8194], [7, 6], [1099511627776, 81], [25, 3], [8192, 247], [4722366482869645213694, 3], [7, 8], [4722366482869645213695, 8194], [2, 8193], [246, 8191], [1099511627776, 2186], [243, 8192], [0, 3], [4722366482869645213694, 4722366482869645213696], [4722366482869645213694, 16777216], [7, 5], [65536, 65535], [4722366482869645213694, 2186], [7, 4], [5, 8195], [6, 8], [4722366482869645213694, 2187], [29, 5], [3, 28], [5, 8192], [2186, 1], [65537, 4722366482869645213696], [9, 8], [16777216, 1], [2187, 8195], [8190, 4722366482869645213695], [2187, 26], [1, 0], [247, 3], [5, 4722366482869645213694], [16777216, 4722366482869645213696], [247, 5], [9, 4722366482869645213694], [246, 82], [4722366482869645213695, 8195], [5, 7], [246, 2186], [25, 2186], [243, 245], [1099511627779, 2186], [8190, 27], [2187, -99], [8, 65535], [10, 9], [65536, 27], [4722366482869645213694, 9], [9, 4], [29, 3], [2185, 2185], [9, 65536], [28, 8191], [65536, 3], [4722366482869645213695, 26], [25, 1], [244, 29], [0, 82], [4722366482869645213696, 5], [4722366482869645213693, 82], [4, 4722366482869645213695], [4722366482869645213695, 65535], [2187, 7], [2, 8194], [4722366482869645213695, 9], [245, 65537], [8195, 4722366482869645213696], [29, 2185], [8, 4722366482869645213695], [247, 6], [-99, -99], [2, 7], [245, 1099511627779], [7, 2], [5, 4722366482869645213696], [8190, 7], [9, 1099511627777], [8194, 4722366482869645213696], [8195, 2187], [8, 7], [65537, 247], [6, 247], [2186, 8192], [4722366482869645213696, 65536], [4722366482869645213694, 246], [242, 245], [65538, 4722366482869645213696], [4722366482869645213695, 8], [-99, 4722366482869645213695], [28, 246], [6, 8194], [242, 1099511627779], [1099511627779, 2185], [243, 246], [2, 8191], [-75, -73], [6, 1099511627778], [-100, 4722366482869645213695], [6, 29], [8189, 8190], [242, 65537], [2, 25], [65535, 4], [8194, 8194], [3, 25], [6, 8195], [8193, 2187], [8195, 65535], [1099511627777, 8192], [1099511627779, 1], [-74, -75], [3, 247], [2186, 1099511627779], [6, 16777216], [4722366482869645213693, 4722366482869645213694], [2186, 6], [1099511627777, 65537], [8189, 8189], [7, 4722366482869645213693], [8191, 2188], [-100, -99], [246, 4722366482869645213694], [245, 8], [2187, 81], [10, -73], [8191, 247], [1099511627779, 1099511627779], [8194, 8193], [4722366482869645213695, 3], [8193, 8193], [8190, 65535], [2186, 8195], [82, 25], [9, 3], [26, 29], [65537, 8195], [8193, 8194], [4722366482869645213695, 8189], [2, 1099511627779], [4722366482869645213696, 9], [3, -74], [65535, 27], [8191, 65535], [8, 4722366482869645213693], [245, 65538], [8190, 8190], [245, 26], [65536, 4722366482869645213693], [50, 50], [2, -73], [6, 8192], [65536, 10], [16777216, 1099511627778], [244, 8192], [8191, 4722366482869645213693], [8192, 3], [4722366482869645213695, 65537], [8195, 8195], [4722366482869645213694, 5], [65537, 65535], [4722366482869645213696, 8195], [4722366482869645213696, 2189], [9, 8195], [2185, 4722366482869645213695], [4722366482869645213694, 2185], [7, 244], [1099511627780, -99], [8191, 8191], [65535, 65537], [-100, 4722366482869645213694], [65539, 65538], [1, 5], [16777217, 3], [27, 65536], [9, 2], [9, 9], [8193, 6], [1099511627775, 2186], [25, 1099511627778], [3, 1], [240, 65536], [1099511627780, -100], [2, 65536], [4722366482869645213696, 246], [2, 65539], [1099511627777, 65534], [29, 28], [2187, 4722366482869645213695], [-56, 81], [-74, 8192], [8, 242], [65536, 4722366482869645213694], [8, 50], [65539, 4722366482869645213695], [1099511627777, 247], [1099511627776, 16777217], [28, 3], [245, 28], [65535, 65536], [65535, 8191], [4722366482869645213696, 65535], [8192, 6], [2, 247], [246, 1], [-72, -73], [2187, 65535], [8194, 8190], [65534, 6], [2186, 8], [8193, 2188], [50, 242], [8195, 11], [245, -72], [8193, -16], [246, 1099511627779], [8190, 4], [246, 9], [4722366482869645213695, 8191], [16777216, 8191], [244, 65538], [8193, 1099511627775], [1099511627778, 1], [241, -99], [5, 2187], [6, 246], [1099511627779, 1099511627780], [65537, 8192], [2185, 2187], [4, 8191], [-101, 4722366482869645213695], [-71, -73], [29, 30], [8191, -100], [-72, 6], [1099511627777, 2186], [8190, 3], [8194, 16777217], [-99, 65535], [2, 4722366482869645213696], [7, 65536], [8190, 2187], [26, 4], [65534, 246], [1099511627780, 245], [51, 242], [65536, 29], [4, 1], [2188, -99], [-71, 2187], [8, 28], [2187, -72], [11, 2185], [4722366482869645213695, 1099511627780], [4722366482869645213697, 82], [1099511627775, 4722366482869645213695], [-56, 245], [1099511627780, -16], [243, -70], [1099511627775, 65536], [1099511627778, 5], [47, 82]], "completion": "\n\ndef is_simple_power(x, n):\n \"\"\"Returns True if x is a simple power of n, False otherwise.\n A number x is a simple power of n if n**int(x) == x.\n \"\"\"\n if x == 1:\n return True\n for i in range(2, int(x**(1.0/n))+1):\n if i**n == x:\n return True\n return False\n\n", "raw_completion": "```python\n\ndef is_simple_power(x, n):\n \"\"\"Returns True if x is a simple power of n, False otherwise.\n A number x is a simple power of n if n**int(x) == x.\n \"\"\"\n if x == 1:\n return True\n for i in range(2, int(x**(1.0/n))+1):\n if i**n == x:\n return True\n return False\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef is_simple_power(x, n):\n \"\"\"Your task is to write a function that returns true if a number x is a simple\n power of n and false in other cases.\n x is a simple power of n if n**int=x\n For example:\n is_simple_power(1, 4) => true\n is_simple_power(2, 2) => true\n is_simple_power(8, 2) => true\n is_simple_power(3, 2) => false\n is_simple_power(3, 1) => false\n is_simple_power(5, 3) => false\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/77", "prompt": "\ndef iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this ingeger is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''\n", "entry_point": "iscube", "canonical_solution": "\n a = abs(a)\n return int(round(a ** (1. / 3))) ** 3 == a\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(1) == True, \"First test error: \" + str(candidate(1))\n assert candidate(2) == False, \"Second test error: \" + str(candidate(2))\n assert candidate(-1) == True, \"Third test error: \" + str(candidate(-1))\n assert candidate(64) == True, \"Fourth test error: \" + str(candidate(64))\n assert candidate(180) == False, \"Fifth test error: \" + str(candidate(180))\n assert candidate(1000) == True, \"Sixth test error: \" + str(candidate(1000))\n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate(0) == True, \"1st edge test error: \" + str(candidate(0))\n assert candidate(1729) == False, \"2nd edge test error: \" + str(candidate(1728))\n\n", "contract": "\n assert type(a) == int, \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [[1], [1], [2], [2], [-1], [-1], [64], [64], [180], [180], [1000], [1000], [0], [0], [1729], [1728]], "atol": 0, "plus_input": [[-8], [27], [125], [729], [512], [-27], [-64], [1000000], [-1000000], [120], [57], [-63], [510], [728], [999999], [-999999], [55], [123], [56], [26], [-1000001], [730], [-7], [119], [-28], [126], [-6], [-62], [58], [-5], [727], [-26], [-39], [-1000002], [-46], [999998], [726], [731], [54], [725], [-29], [59], [-47], [31], [25], [509], [124], [-40], [511], [99], [45], [-45], [-999997], [121], [-48], [4], [732], [-726], [1111], [1331], [-13824], [1000000000], [-1000000000], [987654321], [-987654321], [-13825], [-987654320], [-987654319], [-13823], [-727], [-729], [-1000000001], [1332], [3], [-25], [2], [987654322], [-725], [5], [1112], [6], [-1000000002], [7], [-68], [999999999], [-728], [-24], [-724], [-13822], [-987654322], [1110], [8], [-69], [-70], [-723], [-730], [999999998], [-23], [10], [-13821], [1113], [122], [-987654318], [1330], [-1000000003], [-1000000004], [-71], [9], [81], [-22], [999999997], [-21], [-987654317], [-75], [999999996], [-73], [-13826], [-2], [-13820], [82], [987654320], [1109], [28], [-41], [46], [-1000], [99999999999999999999999999], [-99999999999999999999999999], [-1729], [-2147483648], [2147483647], [9223372036854775807], [-9223372036854775808], [1000000001], [127], [1108], [1333], [130], [128], [129], [1107], [1334], [32], [1336], [1000000002], [-18], [1000000003], [30], [-19], [117], [69], [118], [1000000004], [-999999998], [-94], [-1], [29]], "completion": "\n\ndef iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this integer is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''\n return (a**(1/3))%1 == 0\n\n", "raw_completion": "```python\n\ndef iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this integer is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''\n return (a**(1/3))%1 == 0\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef iscube(a):\n '''\n Write a function that takes an integer a and returns True \n if this ingeger is a cube of some integer number.\n Note: you may assume the input is always valid.\n Examples:\n iscube(1) ==> True\n iscube(2) ==> False\n iscube(-1) ==> True\n iscube(64) ==> True\n iscube(0) ==> True\n iscube(180) ==> False\n '''\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"} +{"task_id": "HumanEval/78", "prompt": "\ndef hex_key(num):\n \"\"\"You have been tasked to write a function that receives \n a hexadecimal number as a string and counts the number of hexadecimal \n digits that are primes (prime number, or a prime, is a natural number \n greater than 1 that is not a product of two smaller natural numbers).\n Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.\n Prime numbers are 2, 3, 5, 7, 11, 13, 17,...\n So you have to determine a number of the following digits: 2, 3, 5, 7, \n B (=decimal 11), D (=decimal 13).\n Note: you may assume the input is always correct or empty string, \n and symbols A,B,C,D,E,F are always uppercase.\n Examples:\n For num = \"AB\" the output should be 1.\n For num = \"1077E\" the output should be 2.\n For num = \"ABED1A33\" the output should be 4.\n For num = \"123456789ABCDEF0\" the output should be 6.\n For num = \"2020\" the output should be 2.\n \"\"\"\n", "entry_point": "hex_key", "canonical_solution": "\n \n return len(list(filter(lambda x: x in \"2357BD\", num)))\n\n", "test": "def check(candidate):\n\n # Check some simple cases\n assert candidate(\"AB\") == 1, \"First test error: \" + str(candidate(\"AB\")) \n assert candidate(\"1077E\") == 2, \"Second test error: \" + str(candidate(\"1077E\")) \n assert candidate(\"ABED1A33\") == 4, \"Third test error: \" + str(candidate(\"ABED1A33\")) \n assert candidate(\"2020\") == 2, \"Fourth test error: \" + str(candidate(\"2020\")) \n assert candidate(\"123456789ABCDEF0\") == 6, \"Fifth test error: \" + str(candidate(\"123456789ABCDEF0\")) \n assert candidate(\"112233445566778899AABBCCDDEEFF00\") == 12, \"Sixth test error: \" + str(candidate(\"112233445566778899AABBCCDDEEFF00\")) \n\n\n # Check some edge cases that are easy to work out by hand.\n assert candidate([]) == 0\n\n", "contract": "\n assert all(x in \"0123456789ABCDEF\" for x in num), \"invalid inputs\" # $_CONTRACT_$\n", "base_input": [["AB"], ["AB"], ["1077E"], ["1077E"], ["ABED1A33"], ["ABED1A33"], ["2020"], ["2020"], ["123456789ABCDEF0"], ["123456789ABCDEF0"], ["112233445566778899AABBCCDDEEFF00"], ["112233445566778899AABBCCDDEEFF00"], [[]]], "atol": 0, "plus_input": [["ABCDEF"], ["999999"], ["77777"], ["898989"], ["67ABCD23"], ["111"], ["444"], [""], ["1"], ["9"], ["777777"], ["1111"], ["8998989"], ["8898989"], ["11111"], ["7767ABCD237777"], ["11111777777"], ["444444"], ["679D99999ABCD23"], ["1679D99999ABCD23"], ["89679D99999ABCD2398989"], ["6979D99999ABCD23"], ["7767ABCD23777"], ["77C67ABCD237777"], ["88898989"], ["4944"], ["8988898989"], ["888989"], ["776B7ABCD23777"], ["1679D999799ABCD23"], ["77C67ABCD2C37777"], ["1C679D999799A9B7CD23"], ["44888989894"], ["77C67ABCCD237777"], ["1C679D999799A9B7C23"], ["1111188898989"], ["D6747767ABCD23777744D23"], ["67BABCD2B3"], ["679D99999ABC"], ["1C679D999799A9B77C23"], ["67ABCD2"], ["81111188898989"], ["944"], ["D6747767ABCD237777A44D23"], ["1C679D9699799A9B77C23"], ["77C67ABCDB2C37777"], ["771679D99999ABCD2371C679D999799A9B7CD23777"], ["4D6747767ABCD23777744D2344444"], ["776B7ABCBD23777"], ["8967BABCD2B38989"], ["89899"], ["67ABCD21C679D9997999A9B77C23"], ["1111189448898989"], ["9888989"], ["1C679D9999799A9B77C23"], ["67ABCD23111"], ["8111111881898989"], ["9494444"], ["994444"], ["988111118944889898988989"], ["89679D99999ABCD239679D99999ABC8989"], ["99"], ["77C6777C67ABCCD237777ABCD237777"], ["1C679D9997C99A99B7CD23"], ["811111111881897767ABCD237778989"], ["1C679D1119999799A9B77C23"], ["776B7ABCBD237777"], ["D6747767ABCD237777A4776B7ABCD237774D23"], ["679D999977777B3"], ["776B7AB1111189448898989CBD22377"], ["11114189448898989"], ["1C679D999799A9B"], ["776BB8989897ABCBD23777"], ["776B7ABCD23777999999"], ["7777"], ["4999999944"], ["11111988898989"], ["7767B7ABCD23777999999"], ["4444444"], ["679D999999ABC"], ["776BCBD237C777"], ["67ABCD811111111881897767ABCD23777898923"], ["949679D999977777B34444"], ["D6747767ABCD237777A74776B7ABCD237774D23"], ["67ABCD277C67ABCD2C377773111"], ["9444"], ["1BCD23"], ["7767B7ABCD237779"], ["67ABCD776B7ABCD2377799999923111"], ["8111111881898989776B7ABCBD237777"], ["8967BABCD2B3898967ABCD23111"], ["7767ABCD237767ABCD277C67ABCD2C37777311177"], ["98811111679D99999ABCD2389448898198988989"], ["88989811111888989899"], ["77C6777C67ABCCD2377767BABCD2B37ABCD237777"], ["98811111679D99999ABCD26389448898198988989"], ["7767ABCD23777444444"], ["77C6777C676ABCCD2377767BABCD2B37ABCD237777"], ["4488488989894"], ["898967BABCD2B389898989"], ["CEEFAD"], ["202E"], ["7"], ["753BD"], ["753BDCEEFAD2020123456789ABCDEF0"], ["BB333A11DDBC"], ["1234567890ABCDEF12345BBAA20200"], ["11ABCD2020DDBBCC22EEFFEEDDCCBBAA"], ["ABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555"], ["ACDF11118872159CEFF23BCCBBD4"], ["ACDF11118872159CEFFCEEFAD213BCCBBD4"], ["753BDCEE753BDF0"], ["1234567CEEFAD890ABCDEF12345BBAA20200"], ["753BDCEE753BDCF0"], ["12345B67CEEFAD890ABCDEF12345BBAA20200"], ["ABCDEF202020CBAABBBBB333A11DDBC5555"], ["11ABCD2020DDB2BCC22EEFFEEDDCCBBAA"], ["2022E"], ["12345B67C2022EEEFAD890ABCDEF12345BBAA20200"], ["ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["12345B67C2022EEEFAD890ABCDEF1234ACDF11118872159CEFF23BCCBBD45BBAA20200"], ["ABCDEF202020CBAABBBDDDDDDCCCCC11111222223333344444555555"], ["753BDCEEFAD20201234567F89ABCDEF0"], ["123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA20200"], ["ACDF12345B67C2022EEEFAD890ABCDEF12345BBAA202001111887215E753BD9CEFF23BCCBBD4"], ["753"], ["22E"], ["22022E"], ["ABDBC5555"], ["7ABCDEF202020CBAABBBBB333A11DDBC55553BD"], ["753BDCE0201234567F89ABCDEF0"], ["77"], ["753BDCEE7753BDCF0"], ["73"], ["7353"], ["73533"], ["ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555555"], ["753BDCE0201234567F89ADBCDEF0"], ["753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA"], ["753BDCE02067F89ADBCDEF0"], ["73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["11ABCD2020DDBBCCEEFFEEDDCCBBAA"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA202003344444555555"], ["753BDCEEFFA7F89ABCDEF0"], ["20202E"], ["753BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC55552020CBAABBBBB333A11DDBC55553BD"], ["123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC555547567CEEFAD890ABCDEF12345BBAA20200"], ["753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0"], ["75322022EBDCEEFFA7F89ABCDEF0"], ["ABDBC555"], ["73ABB333A11DDBCBBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["AABDBC555BDBC5555"], ["3753"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20200"], ["11ABCD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAA"], ["275322022EBDCEEFFA7F89ABCDEF002E"], ["CEEFAD753BDCEE753BDFCF0"], ["11ABCD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAA"], ["CEEFAD753BDCEE7CF0"], ["1234567CEEFAD890ABCD73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55550"], ["33"], ["20222E"], ["7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBC55553BD"], ["ABCDEF202020CB5"], ["337312345B67CEEFAD890ABCDEF12345BBAA20200"], ["275322022EBDCEEFFBA7F89ABCDEF002E"], ["11ABCD2020DDBBCC22EEF"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["2220222E"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAA"], ["12345B67AABDBC555BDBC55559CEFF23BCCBBD45BBAA20200"], ["275322022EBDCEEFFBA7537F89ABCDEF002E"], ["11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAA"], ["22202753BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["202222E"], ["7ABCDEF202020CBAABBBBB333A11DDBC55ACDF11118872159CEFF23BCCBBD4D"], ["73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DD"], ["2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA"], ["753BDCEACDF12345B67C2022EEEFAD890ABCDEF12345BBAA202001111887215E753BD9CEFF23BC337312345B67CEEFAD890ABCDEF12345BBAA20200CBBD431BDCF0"], ["12345B67AABDACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4BC555BDBC55559CEFF23BCCBBD45BBAA20200"], ["11ACD2020DDBB123ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAA"], ["75322022EBDCEEFFA7F9ABCDEF0"], ["CABCDEF202020CB5"], ["ACDF11118872159CEEFFCEEFAD213BCCBBD4"], ["753BBDCEE7753BDCF0"], ["12345B67C2022EEEFAD890ABCFDEF12345BBAA20200"], ["73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555"], ["E753BDCE02067F89ADBCDEF0"], ["2022ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555555E"], ["A753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAABCDEF202020CB5"], ["73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555"], ["ABB333BBB2BB333CA11DDBC5555"], ["FAD753BDCEE753BDFCF0"], ["7ABCDEF22022ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555555E02020CBAABBBBB333A11DDBC55ACDF11118872159CEFF23BCCBBD4D"], ["ACDF11118872159CEFFCEEFAD1213BCCBBD4"], ["237530222E"], ["123456753BD7890ABCDEF12345BBAA20200"], ["753BDCEE7753BDC7353F0"], ["CEEEFEAD"], ["73ABB333A11DDBCBCDEF2BB333A11DDBC02020CBAABBB2BB333CA11DD"], ["7ABCDEF202020CBAABBBBB33773A11DDBC55553BD"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAAABDBC555"], ["75322022EBDC2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF0"], ["CEEEFE"], ["77ABCDEF202020CBAABBBBB333A11DDBC5555"], ["CEEEFEAED"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEAD"], ["753BDCE0201234567F89ADDBCDEF753BDCE02067F89ADBCDEF0"], ["753BDC11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["275322022EBDCEEFFBA7F89ABCDEF002"], ["753BDCEEFAD2020123456789ABCDEABCD11ACD2020DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAABDBC555ABBBDDDDDDCCCCC1111122222333334444455555F0"], ["7ABCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC55553BD"], ["1234567CEEFAD89073533ABCDEF12345BBAA20200"], ["7532202F2EBDC2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF0"], ["ABCDEF22020CB5"], ["7532202F2EBDC2022E753BDCEE7711ABCD2020D0DB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF0"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033444555555"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF12345BBAA20200F12345BBBBAA"], ["7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BD"], ["275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E"], ["1234567CEEFAD890ABCDEF12345B20200"], ["FAD753BD"], ["77ABCDEF202020CBAABBBBB333A112220222EDDBC5555"], ["7ABCDEF202020CBAABBBBB333A11DDBC55A2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAACDF11118872159CEFF23BCCBBD4D"], ["12345B67C12345BBAA20200"], ["73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC511ABCD2020DDBBCC22EEF555"], ["73ABB333A11DDBCB75322022EBDCEEFFA7F9ABCDEF0BBB2BB333CA11D0DBC5555"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555"], ["2B75322022EBDCEEFFBA7F89ABCDEF002E"], ["ACDF111188721159CEFFCEEFAD213BCCBBD4"], ["275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002E"], ["7EF0"], ["AB11DDBC5555"], ["77ABCDEF202020CBAABBBBB75322022EBDCEEFFA7F89ABCDEF0333A11DDBC5555"], ["ABCDEF20202CB5"], ["ABCDEF202020CBAABBBDDD2DDDCCCCC1111122222333334444455555"], ["CE73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDEFEAD"], ["2022E753BDCEE7711ABACDF11118872159CEFFCEEFAD1213BCCBBD4CD2020DDB2BCC22EEFFEEDDCCBBAA"], ["ACDF111188727159CEFFCEEFAD1213BCCBBD4"], ["1234567C275322022EBDCEEFFA7F89ABCDEF002EEEFAD89073533ABCDEF12345BBAA20200"], ["753BDCDEE753BDF0"], ["FAD1234567CEEFAD890ABCD73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55550753BD"], ["ACDF12345B633A11DDBCBCDEF202020CB2022EAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4"], ["12345B67C2022EEEFAD890ABCDEF1234A72159CEFF23BCCBBD45BBAA20200"], ["737ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BDABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["123ABB333A11DDBCBCDEF2020200CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA20200"], ["7ABCDEF202020CBAABB75322022EBDCEEFFA123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA202007F89ABCDEF0BBB333A11DDBC55553BD"], ["73ABB3033A11DFAD753BDDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555"], ["75322022EBDCEEFFA7F9DABCDEF0"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEAD"], ["753BDCEEFAD20201234567F89A753BDCEE7753BDC7353F0BCDEF0"], ["37753BDCEEFFA7F89ABCDEF0"], ["22202273ABB333A11DDBCBCDEF2BB333A11DDBC02020CBAABBB2BB333CA11DD2E"], ["1234575322022EBDCEEFFA7F9DABCDEF067890ABCDEF12345BBAA20200"], ["ACDF111188727159CEFFCEEFAD12173BCCBBD4"], ["73ABB3033A11DDBCBCDEF202020CB0AABBB2BB333CA11D0DBC5555"], ["2B75322022EBDCEEFFBA7F89ABCDEFE002E"], ["11ABCD2020DDBCC22EEF"], ["373533"], ["BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A113DDBC"], ["2375302"], ["7ABCDEF202020CBAABBBBB33773A11DDBC535553BD"], ["A753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB2AABCDEF202020CB5"], ["ACDF11118872159CEFACDF11118872115CE73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDEFEAD9CEFFCEEFAD213BCCBBD4FCEEFAD1213BCCBBD4"], ["753BDCEE7757353F0"], ["ACDF11118872159CEFFCEEFAD213BCCBBBD4"], ["2022E753BDCEE7711ABACDF11118872159CEFFCEEFAD1213BCCBBD4CD2020DDB2BCC22EEFFEEACDF11118872159CEFFCEEFAD213BCCBBBD4DDCCBBAA"], ["12345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A113DDBC200"], ["753BD7ABCDEF202020CBAABBBBB333A11DDBC55A2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAACDF11118872159CEFF23BCCBBD4D"], ["CEE11ABCD20CABCDEF202020CB520D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEAD"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEAD"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAA20200"], ["753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAABDBC555ABBBDDDDDDCCCCC1111122222333334444455555F0F89ABCDEF0"], ["12345B67C2022EEEFAD8BBAA20200"], ["CEEEFEE"], ["AB4CDEF202020CBAABBBDDDDDDCCCC73ABB333A11DDBCBCDEF2BB333A11DDBC02020CBAABBB2BB333CA11DDC111112212345B67CEEFAD890ABCDEF12345BBAA202003344444555555"], ["CEFEAD"], ["22202CEFEA2D22E"], ["CE73ABB333A11DDBCBCDEF202011ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD8190ABCDEF12345BBAA202003344444555555"], ["11ABCD22020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAA"], ["CE73ABB333A11DDBCBCDEF202011ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002E12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["333"], ["753BDCEE7753B73533DC7353F0"], ["1234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["753BDCEEFAD202012304567F89ABCDDEF0"], ["ABBE753BDCE02067F89ADBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["753BD7CE02067F89ADBCDEF0"], ["ACDF11118872159CEFFCEEFAD2138BCCBBD4"], ["ACDF1111887FF23BCCBBD4"], ["7532202F2EBDC2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDCEF0"], ["ABBE753BDCE02067F89ADBCDEF0333A11DDBCBCDEF2B02020CBAABBB2BB333CA11DDBC5555"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC2222EEEFFEEDDCCBBAAEFEAD"], ["CE73ABB333A11DDBCBCDEF202020CBAABBB2B337312345B67CEEFAD890ABCDEF12345BBAA20200DEFEAD"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20AD"], ["ACDF12345B67C2022EEEFAD8F90ABCD4EF12345BBAA2020011118872B15E753BD9CEFF23BCCBBD4"], ["FAD753BDCEE753BDFC1234567890ABCDEF12345BBAA20200F0"], ["7ABCDEF20202011ACD2020DDBB123ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAACBAABBBBB33773A11DDBC535553BD"], ["2753BDCEEFAD20201234567F89ABCDEF02202CEFEA2D22E"], ["CE73ABB333A11DDBCBCDEF202011ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033444555555E12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["CEACDF111188727159CEFFCEEFAD1213BCCBBD4EEFEAED"], ["275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E"], ["12345B67AABDBC555BDBC55559CEFF23BCCBBD45BBACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4AA20200"], ["753BCDCDEE753BDF0"], ["7ABCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB3332A11DDBC55553BD"], ["73ABB3313A11DDBCBCDEF202020CBAABBB2BB333CA11DD"], ["B1234575322022EBDCEEFFA7F9DABCDEF067890ABCDEF12345BBAA20200"], ["220222E"], ["753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAAB2DBC555ABBBDDDDDDCCCCC1111122222333334444455555F0F89ABCDEF0"], ["CEEEFEAEED"], ["275322022EBDCEEFFBABBE753BDCE02067F89ADBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555A7F89ABCDEF002"], ["123ABB333A11DDBCBCDEF2020200CBAAB2BB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA20200"], ["ACDF"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF2020C20CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["753BDCEEFA1234567890ABCDEF12345BBAA20200D6202012304567F89ABCDDFAD753BDCEE753BDFC1234567890ABCDEF12345BBAA20200F0EF0"], ["ACDF111188727159CEFFCEEFAD12113BCCBBD4"], ["AB11DDBC57353555"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDD275322022EBDCEEFFA7F89ABCDEF002ECCBBAAEFEAD"], ["753BDCE02067FE89ADBCDEF0"], ["7CEEFAD7553BDCEE7CF053BDCEEFAD20201234567F89A753BDCEE7753BDC7353F0BCDEF0"], ["753BBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEADDCEE7753BDCF0"], ["753BDCEEFAD2020123456789ABCDEABCD11ACD20204DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAABDBC555ABBBDDDDDDCCCCC1111122222333334444455555F0"], ["CEEE12345B67CEEFAD890ABCDEF12345BBAA20200FEE"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAAAABDBC555"], ["7ABCDEF20202011ACD2020DDBB123ACDF12B345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC555545267CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAACBAABBBBB33773A11DDBC535553BD"], ["75312345B67C2022EEEFAD8BBAABDF0"], ["11ABCD2020D45B67C2022EEEFAD890AACDF11118872159CEFFCEEFAD1213BCCBBD42345BBAA20200CC22EEFFEEDDCCBBAA"], ["22202273ABB333A11DDBCDBCDEF2BB333A1753BBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEADDCEE7753BDCF01DDBC02020CBAABBB2BB333CA11DD2E"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD8190ABCDEF12345B20222EBAA202003344444555555"], ["1234567BB333A11DDBC53BD7890ABCDEF12345BBAA2753BDCE02067F89ADBCDEF00"], ["753BDCEE753BDCEE7757353F0C7353F0"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED444444555555"], ["ACDF11118872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4"], ["CEEB1234575322022EBDCEEFFA7F9DABCDEF067890ABCDEF12345BBAA20200FAD"], ["CEACDF111188727159CEFFCEEFAD12139BCCBBD4EEFEAED"], ["ACDF12345B67C2022EEEFAD890AB1232ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4"], ["AB4CDEF202020CBAABBBDDDDDCDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED444444555555"], ["2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEE2DDCCBBAA"], ["753BD7ABCDEF2020202CBAABBBBB333A11DDBC55A2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAACDF11118872159CEFF23BCCBBD4D"], ["AB11DDBC5555753BD"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF20202C0CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC20012212345B67CEEFAD890ABCDEF12345BBAA2020033444555555"], ["ABDBC55"], ["CE73ABB333A11DDBBCBCDEF202020CBAABBB2BB333CA11DDEFEAD"], ["ACCDF"], ["12345B67C20200"], ["ABD5BC555"], ["73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CBA11D0DBC511ABCDC2020DDBBCC22EEF555"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890A7353BCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4"], ["12345BB67C2022EEEFAD8BBAA20200"], ["AB4CDEF202020CBAABBBDDDDDCEEEFEAEDCDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED444444555555"], ["ACDF123AB11DDBC5555753BD45B633A11DDBCBBCDEF202020CB2022EAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E75CBBD4"], ["3312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAA202003"], ["773"], ["CEEEAED"], ["777"], ["7753"], ["753BDCE0201234567F89ADBC7532202F2EBDC2022E753BDCEE7711ABCD2020D0DB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF0DEF753BDCE02067FABB333BBB2BB333CA11DDBC555589ADBCDEF0"], ["A753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB2AABCDEFB202020CB5"], ["23755302"], ["E75312345B67C2022EEEFAD8BBAABDF0"], ["22202273ABB333A11DDBCDBCDEF2BB333A1753BBCEE11ABCD2020D45B67C2022EEEFAD890ABC7DEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEADDCEE7753BDCF01DDBC02020CBAABBB2BB333CA11DD2E"], ["711ABCD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAA53BCDCDEE753BDF0"], ["ACDF11118872F159CEFFCEEFAD12132B75322022EBDCEEFFBA7F89ABCDEF002EBCCBBD4"], ["12345753220212345B67C202002EBDCEEFFA7F9DABCDEF067890ABCDEF12345BBAA20200"], ["733"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["2022222E"], ["ABCDEF202020CBAABBBDDDDDDCCCABCDEF202020CB555"], ["75322022EBDCEEFFA7F9DABCBDEF0"], ["ACDF123AB11DDBC5555753BD45B633A11DDBCBBCDEF202020CB2022EAABBB2BB3375CBBD4"], ["1234575322022EBDCEEFFA7F9DABCDEF06789F0ABCDEF12345BBAA20200"], ["753BDCE0201234567F89ADBCDEF753BDCE020679F89ADBCDE11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAAF0"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFEAD890ABCFDEF12345BBAA20200F12345BBBBAA"], ["7275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E53BDCE0201234567F89ABCDEF0"], ["1234567C275322022EBDCEEFFA7F2753BDCEEFAD20201234567F89ABCDEF02202CEFEA2D22E89ABCDEF002EEEFAD89073533ABCDEF12345BBAA20200"], ["7ABCDEF202020CBAABBBBB333A11DDBC55ACDF111318872159CEFF23BCCBBD4D"], ["20222EACDF12345B67C2022EEEFAD890ABCDEF12345BBAA202001111887215E753BD9CEFF23BCCBBD4"], ["23757302"], ["2220A2273ABB333A11DDBCBCDEF2BB333A11DDBC02020CBAABBB2BB333CA11DD2E"], ["7532202F2EBDC2022E753BDCEE7711BABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF0"], ["377ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BD53"], ["2B75322022EBDCEEFFBA7F89ABACDEFE002E"], ["ACDF111188727159CEFFCCBBD4"], ["ABCDEF202020CBAABBBDDDDDDCCCCC111112222233333455"], ["753FBDCEE753BDF01234567CEEFAD89073533ABCDEF12345BBAA20200"], ["7ABCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC5555D"], ["CE73ABB333A11DDBCBCDEF20753BDCEEFFA7F89ABCDEF02011ACD2020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002E12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["3ABCDEF202020CBAABBBDDDDDDCCCABCDEF202020CB555753"], ["2022E753BDCEE77117532202F2EBDC2022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDCEF0ABCD2020DDB2BCC22EFFEEDDCCBBAA"], ["11ABCD22020DDBB12345B67C2022EEEFAD890ABAB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC20012212345B67CEEFAD890ABCDEF12345BBAA2020033444555555CDEF12345BBBBAA"], ["2022E753BDCEE7711ABACDF11118872159CEFFDCEEFAD1213BCCBBD4CD2020DDB2BCC22EEFFEEDDCCBBAA"], [{}], ["1234ACDF11118872159CEFFCEEFAD21753B12345B67C20200D4567CEEFAD89073533ABCDEF12345BBAA20200"], ["337312345B67CEEFAD890ABCDEF12345BB73AA20200"], ["2B75322022EBDCFFBA7F89ABCDEF002E"], ["1234567CEEFAD890ABCD73ABB333A11DDBCBCDEF202022022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA0CBAABBB2BB333CA11DDBC55550"], ["7ABCDEF202020CBA275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E318872159CEFF23BCCBBD4D"], ["7ABCDEF202020CBAABBBBB33773A11DDBC55553202EBD"], ["7ABCDEF202020CBAABBBBB3377B3AA11DDBC55553BD"], ["7ABCDEF20202011ACD2020DDBB123ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAACB275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002EAABBBBB33773A11DDBC535553BD"], ["3312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF122345BBAA202003"], ["3ABCDEF2020202022E753BDCEE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA55753"], ["753BDC11ABCD2020D45B67C2022EEEFAD890ABCDEF1234275322022EBDCEEFFBA7F89ABCDEF002E5BBAA20200CC22EEFFEEDDCCBBAAE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["ACDF12345B633A11DDBCBCDEF202020CB2022EAABBB2BB333CA11DDBCC55554567CEEFAD8390ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4"], ["123412345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A1113DDBC200ACDF11118872159CEFFCEEFAD21753B12345B67C20200D4567CEEFAD89073533ABCDEF12345BBAA20200"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC5555437567CEEFAD890ABCDEF12345BBAA20200"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF11118872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF123453334444455555F0F89ABCDEF0"], ["11ACD2020DD200F12345BBBBAA"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAAE20200"], ["237530222E2022E"], ["37753BDCEEFFA77F89ABCDEF0"], ["11ACD2020DDBB123D45B67C2022EEEFAD890ABCDEF12345BBBBAAAABDBC555"], ["ACDF123AB11DDBC5555753BD45B633A11DDBCBBCDEF202020CB2022EAABBB2BB333CA11DDBC55554567753FBDCEE753BDF01234567CEEFAD89073533ABCDEF12345BBAA20200EEFAD890ABCDEF12345BBAA2020015E75CBBD4"], ["ABCDEF202020CBAABBBDD7ABCDEF202020CBAABBBBB333A11DDBC55ACDF11118872159CEFF23BCCBBD4DDDDDCCCABCDEF202020CB555"], ["11ABCD2020DDBBCC22EEFFDEEDDCCBBAA"], ["B1234575322022EBDCE0EFFA7F9DABCDEF067890ABCDEF12345BBAA20200"], ["ACDF1111ABDBC5558872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4"], ["ABCDEF202020CBA5ABBBDDDDDDCCCABCDEF202020CB555"], ["753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020BDDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAAB2DBC555ABBBDDDDDDCCCCC1111122222333334444455555F0F89ABCDEF0"], ["3312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890AB2753BDCEEFAD20201234567F89ABCDEF02202CEFEA2D22ECDEF122345BBAA202003"], ["AD202012304567F89ABCDDEF0"], ["AB11DDBC5555753BD1234571234567BB333A11DDBC53BD7890ABCDEF12345BBAA2753BDCE02067F89ADBCDEF00EF12345BBAA20200"], ["ABBE753B5DCE02067F89ADBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["CEEFACEFEADD2B75322022EBDCEEFFBA7F89ABCDEFE002E753BDCEE753BDFCF0"], ["ABCDEF202020CBAABBBDDDDDDCCCCCC1111122222333334444455555"], ["275322EBDCDEF002E"], ["1234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533AEBCDEF12345BBBAA20200"], ["753BDCEEFAD20201234567F877ABCDEF202020CBAABBBBB333A11DDBC55559A753BDCEE7753B2DC7353F0BCDEF0"], ["273ABB333A11DDBCB75322022EBDCEEFFA7F9ABCDEF0BBB2BB333CA11D0DBC55552202CEFEA2D22E"], ["75753"], ["11ABCD2020D45B67C2022EEEFAD890AACDF11118872159CEFFCEEFAD1213BCCBBD423A20200CC22EEFFECBBAA"], ["753BDCDEDF0"], ["ACDF12345B767C2022EEEFAD890AB123ABB333A11DDBCBCDEF2020C20CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABC753BD9CEFF23BCCBBD4"], ["753BDC7ABCDEF202020CBA275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E318872159CEFF23BCCBBD4DEEFAD202012304567F89ABCDDEF0"], ["1234567CEEFAD890ABCD73275322022EBDCEEFFBA7537F89ABCDEF002EABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55550"], ["123412345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEABD5BC555EEFEAED44444555555A1113DDBC200ACDF11118872159CEFFCEEFAD21753B12345B67C20200D4567CEEFAD89073533ABCDEF12345BBAA20200"], ["7773ABB333A11DDBCB75322022EBDCEEFFA7F9ABCDEF0BBB2BB333CA11D0DBC5555A7F89ABCDEF0333A11DDBC5555"], ["7ABCDEF202020CBAABBBBB33773A511DDBC55553202EBD"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA2020123F4567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF11118872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["237525302"], ["CE73ABB333A118DDBCBCDEF20753BDCEEFFA7F89ABC12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["73ABB3313A11BAABBB2BB333CA11DD"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDABCDEF20202CB5EF12345BBAA20200"], ["753BDC11ABCD2020D45B67C2022EEEFAD890ABCDEF1234275322022EBDCEEFFBA7F345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890AB2753BDCEEFAD20201234567F89ABCDEF02202CEFEA2D22ECDEF122345BBAA202003EF0"], ["753BDCEE7753BDC0"], ["2022E753BDCEE7711ABACDF11118872159CEFFCEEFAD1213BCCBBD4CD2020DDB11ABCD2020D45B67C2022EEEFAD890AACDF11118872159CEFFCEEFAD1213BCCBBD42345BBAA20200CC22EEFFEEDDCCBBAA2BCC22EEFFEEDDCCBBAA"], ["CEACDF111188727159C8EFFCEEFAD1213BCCBBD4EEFEAED"], ["3312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD977ABCDEF202020CBAABBBBB75322022EBDCEEFFA7F89ABCDEF0333A11DDBC5555CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAA202003"], ["7275322022EBDCABB73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC511ABCD2020DDBBCC22EEF555333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E53BDCE0201234567F89ABCDEF0"], ["E"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD22022E890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAAE20200"], ["CEE11ABCD20CABCCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20ADDEF202020CB520D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEAD"], ["73ABB333A11DDBCBCDEF202020CBAABBB2B7353B333CA11DD"], ["ABCDEF202020CBAABBBDDDDDDCCABD5BC555344444555555"], ["11ABCD2020D45B67BC2022EEEFAD890ABCDEF12345BBAA20200CC22E73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC511ABCD2020DDBBCC22EEF555EFFEEDDCCBBAA"], ["202ABB333A11DDBCBCDEF202020CBAA753BDCEACDF12345B67C2022EEEFAD890ABCDEF12345BBAA202001111887215E753BD9CEFF23BC337312345B67CEEFAD890ABCDEF12345BBAA20200CBBD431BDCF0DBC5555E"], ["123ABB333A11DDBCBCDEF2020200CBAABBB2BB333CA11DDBC55554567CEEFAD8F90ABCDEF12345BBAA20200"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBBBAADBC555"], ["2B75322022EBDCEEFDFBA7F89ABCDEF002E"], ["AB11DDBC5555753BD1234571234567B275322022EBDCEEFFA7F89ABCDEF002EB333A11DDBC53BD7890ABCDEF12345BBAA2753BDCE02067F89ADBCDEF00EF12345BBAA20200"], ["7ABCDEF202020CBAABBBBB3B3773A11DDBC535553BD"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0E73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC555520012212345B67CEEFAD890ABCDEF12345BBAA2020033444555555"], ["123ABB333A11DDBCBCDEF2020200CBAAB2BB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BB3AA20200"], ["ABCDEF202020CBAABBBDDDDDDCCCABCDCEACDF111188727159CEFFCEEFAD1213BCCBBD4EEFEAEDEF202020CB555"], ["7ABCDEF202020CBAABB75ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890AB2022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC55553BD"], ["11ACD2020DDBB123ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890A753BD7CE02067F89ADBCDEF0BCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAA"], ["7553"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA2020123F4567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF11118872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCCEEFACEFEADD2B75322022EBDCEEFFBA7F89ABCDEFE002E753BDCEE753BDFCF0BBD4DD89073533ABCDEF12345BBBAA20200"], ["753BDC7ABCDEF202020CBA275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB33CDEF002E318872159CEFF23BCCBBD4DEEFAD20202B75322022EBDCEEFFBA7F89ABCDEF002EDDEF0"], ["ABCDEF20202C7ABCDEF202020BCBAABBBBB33773A11DDBC55553BDB5"], ["11ABCD22020DDBB12345B67C2022EEEFAD890ABAB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BB5AA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC2001221234275322022EBDCEEFFBA7F89ABCDEF0025B67CEEFAD890ABCDEF12345BBAA2020033444555555CDEF12345BBBBAA"], ["ABCDEF202020CBAABBBDDF202020CB555"], ["753BD7ABCDEF202020CBAABBBBB333A11DDBC55A2022E753BDCEE7711ABCD2020D11ABCD2020DDB2BCC22EEFFEEDDCCBBAADB2BCC22EEFFEEDDCCBBAACDF11118872159CEFF23BCC337312345B67CEEFAD890ABCDEF12345BBAA20200BBD4D"], ["AC377ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BD53DF12345B767C2022EEEFAD890AB123ABB333A11DDBCBCDEF2020C20CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["237573072"], ["7ABCDEF202020CBAABBBBB3377B3DAA11CDDBC55553BD"], ["77532202F2EBDC2022E753BDCEE7711BABCD2020DDB2BCC22EEFFEEDDCCBBAAEEFFA7F9ABCDEF033753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAABDBC555ABBBDDDDDDCCCCC1111122222333334444455555F0F89ABCDEF0"], ["7535BDCEE7757353F0"], ["22202273ABB333A11DDBCDBCDEF2BB333A1753BBCCEEEFEADEE11ABCD2020D45B67C2022EEEFAD890ABC7DEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEADDCEE7753BDCF01DDBC02020CBAABBB2BB333CA11DD2E"], ["11ABCD22020DDBB12345B67C2022EEEFAD890ABAB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CD275322EBDCDEF002EEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BB5AA2020033CCEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC20012212342175322022EBDCEEFFBA7F89ABCDEF0025B67CEEFAD890ABCDEF12345BBAA2020033444555555CDEF12345BBBBAA"], ["CE73A3BB333A118DDBCBCDEF20753BDCEEFFA7F89ABC12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["73ABDBCB75322022EBDCEEFFAB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC20012212345B67CEEFAD890ABCDEF12345BBAA2020033444555555A7F9ABCDEF0BBB2BB333CA11D0D773BC5555"], ["ABCDEF22020CBB5"], ["AB11DDBC5555753BD1234571234567BB333A11DDBC53BD7890ABCDEF12345BBAA2753BAB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033444555555DCE02067F89ADBCDEF00EF12345BBAA20200"], ["73AABDBC555BDBC555553"], ["7FAD753BD53BDCEE7753BDC0"], ["12534567CEEFAD89073533ABCDEF12345BBAA20200"], ["CEE11ABCD20CA2BCCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20ADDEF202020CB520D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEAD"], ["2220A2273ABB333A11DDBCBCDEF2BB3311ABCD2020DDBBCC22EEF3A11DDEBC02020CBAABBB2BB333CA11DD2"], ["ABBE753BDCE02067F89ADBBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555"], ["1234ACDF11118872159CEFFCEEFAD21753B12345B67CC20200D4567CEEFAD89073533ABCDEF12345BBAA20200"], ["11ACD2020DDBB12345B67C2022EEEFAD890ABCDEF12345BBCEEEAEDAA"], ["12345B67C12345BACDF11118872159CEFACDF11118872115CE73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDEFEAD9CEFFCEEFAD213BCCBBD4FCEEFAD1213BCCBBD4BAA20200"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAA209200"], ["CE73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDEBFEAD"], ["123405B67C2022EEEFAD890ABCDEF12345BBAA20200"], ["AB4CDEF202020CBAABBBDDDDDDCCCCCC111112212345B67CEEFAD8190ABCDEF12345BBAA202003344444555555"], ["ABD11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAABC555"], ["2022E753BDC123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF1123ABB333A11DDBCBCDEF2020200CBAAB2BB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BB3AA20200AD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200EE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA"], ["2302"], ["C753BDCDEDF0"], ["12345B67AABDBC555BDBC55559CEFF23BCCBBD45BBACDF12345B67C2022EEEFCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4AA20200"], ["11ABCD22020DDBB12345B67C2022EEEFAD890ABAB4CDEF202020CBAABBBDDDDDDCCCCC111112345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BB35AA2020033CEEEF753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EAED44444555555A113DDBC2001221234275322022EBDCEEFFBA7F89ABCDEF0025B67CEEFAD890ABCDEF12345BBAA2020033444555555CDEF12345BBBBAA"], ["ABCCDEF202020CBAABBBDDF202020CB555"], ["73ABB3313A211BAABBB2BB333C275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002EA11DD"], ["7ABCDEF202020CBA275322022EBDCABB333A11DDBCBCDEF202020CB2AABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E318872159CEFF23BCCBBD4D"], ["123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC573ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC555555547567CEEFAD890ABCDEF12345BBAA20200"], ["A753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBFAD753BDBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB2AABCDEF202020CB5"], ["DAB11D75312345B67AABDBC555BDBC55559CEFF23BCCBBD45BBACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4AA20200BD"], ["CE73A3BB333A118DDBCBCDEF20753BDCEEFFA7F89ABC12345BBAA20200F12345BBBBAA20CBA33CA11DDEFEAD"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCD123456753BD7890ABCDEF12345BBAA20200EF202020CBAABBB2BB333CA11DDBC5555D4567CEEFAD22022E890ABCDEF12345BBAA200"], ["E8BBAABDF0"], ["7ABCDEF20202011ACD2020DDBB123ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAACBAABBBBB373ABB333A11DDBCBBCDEF202020CBAABBB2BB333CA11DDBC55553773A11DDBC535553BD"], ["ACDF11118872159CEFFCEEFAD121312345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A113DDBC200BCCBBD4"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A112DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["3312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BFBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF122345BBAA202003"], ["23725302"], ["73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DD753BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["AD2020123045677ABCDEF202020CBAABBBBB3377B3AA11DDBC55553BDF89ABCDDEF0"], ["753BDCEE7753B73533DC7350"], ["237253202"], ["753BDC11ABCD2020D405B67C2022EEEFAD890ABCDEF1234275322022EBDCEEFFBA7F89ABCDEF002E5BBAA20200CC22EEFFEEDDCCBBAAE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["753BD7ABCDEF202020CBAABBBBB333A11DDBC55ACDF111318872159CEFF23BCCBBD4D"], ["CEE11ABCD2020D45B67C2022EEEFAD890ABACDEF12345BBAA20200CC22EEFFEEDD275322022EBDCEEFFA7F89ABCDEF002753BDCEEFFA7753BDCEEFAD2020123456789ABCDEABCD11ACD2020BDDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAAB2DBC555ABBBDDDDDDCCCCC1111122222333334444455555F0F89ABCDEF0ECCBBAAEFEAD"], ["73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DD753CEEFAD753BDCEE753BDFCF0BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0"], ["AACDF12345B633A11DDBCBCDEF202020CB2022EAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4D4"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF2020C20CBAABBB2BB33B3CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4"], ["753BDCE0201234567F889ADDBCDEF753BDCE02067F89ADBDCDEF0"], ["C753BDCDEDF0C753BDCDEDF0"], ["12345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF1209200"], ["3"], ["377ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC5555D20222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BD53"], ["AB4CDEF202020753BD7CE02067F89ADBCDEF0CBAABBBDDDDDDCCCCC111112212345B67CEEFAD8190ABCDEF12345BBAA202003344444555555"], ["12534567CEE1234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200FAD89073533ABCDEF12345BBAA20200"], ["753BDCEACDF12345B67C2022EECEFAD890ABCDEF132345BBAA202001111887215E753BD9CEFF23BC337312345B67CEEFAD890ABCDEF12345BBAA20200CBBD431BDCF0"], ["AB4CDEF202020CBAABBBDDDDDDCCCCCC1A753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB2AABCDEF202020CB52212345B67CEEFAD8190ABCDEF12345BBAA202003344444555555"], ["275322022EBDCABB333A11DDBCBC753BDC11ABCD2020D45B67C2022EEEFAD890ABCDEF1234275322022EBDCEEFFBA7F345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890AB2753BDCEEFAD20201234567F89ABCDEF02202CEFEA2D22ECDEF122345BBAA202003EF0DEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E"], ["77ABCDEF20E2020CBAABBBBB333A112220222EDDBC5555"], ["CEE11ABCD2020D45B67C2022EEEFAD8753BDCE0201234567F89ABCDEF090ABCDEF12345BBAA20200CCE22EEFFEEDDCCBBAAEFEAD"], ["753BDCEEFFA7F89ABACDF11118872159CEFF23BCCBBD4EF0"], ["3733533"], ["2022E753BDC123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF11253ABB333A11DDBCBCDEF2020200CBAAB2BB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BB3AA20200AD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200EE7711ABCD2020DDB2BCC22EEFFEEDDCCBBAA"], ["CEEB1234575322022EBDCEEFFA7F9DABCDEF0677890ABCDEF12345BBAA20200FAD"], ["7773AB2022EBDCEEFFA7F9ABCDEF0BBB2BB333CA11D0DBC555ACDF11118872159CEEFFCEEFAD213BCCBBD45A7F89ABCDEF0333A11DDBC5555"], ["CE73AB22EB333A11DDBCBCDEF202022E753BDCEE7711ABCD2020DDB2BCC22EEFFEE2DDCCBBAABB2BB333CA11DDEFEAD"], ["275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5A753BDCEEFAD2020123456789ABCDEABCD11ACD20204DDBB12345B67C2022EEEFAD890ABCD1234567890ABCDEF12345BBAA20200EF12345BBBBAAABDBC555ABBBDDDDDDCCCCC1111122222333334444455555F0BB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89AB753BDCE0201234567F89ADBCDEF0002E"], ["2B75322022EBDCEEFFBA7F89ABACDEFE0022E"], ["753BDCABDBC555EE7711A020DDB2BCC22EEFFEEDDCCBBAA"], ["CE73ABB333A11DDBCBCDEF202011ACD2753BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0020DDBB12345B67C2022EEEFAD890ABCDE12345B67C2022EEEFAD890ABCFDEF275373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033444555555E12345BBAA20200F12345BBBBAA20CBAABBB2BB333CA11DDEFEAD"], ["73123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20201234567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCEE11ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA202003"], ["2022E753BDCEE7711ABACDF11118872159CEFFCEEFAD1213BCCBBD4CD2020DDB11ABCD2020D45B67C2022EEEFAD890AACCDF11118872159CEFFCEEFAD1213BCCBBD42345BBAA20200CC22EEFFEEDDCCBBAA2BCC22EEFFEEDDCCBBAA"], ["ACDF111188727159CEFFCEBEFAD12173BCCBBD4"], ["CEEB1234575322022EBDCEEFFA7F9DABCDEF06778123ABB333A11DDBCBCDEF2020200CBAAB2BB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020090ABCDEF12345BBAA20200FAD"], ["11ABCD2020D45B67BC2022EEEFAD890ABCDEF12345BBAA20200CC22E73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBCACDF111188727159CEFFCCBBD4511ABCD2020DDBBCC22EEF555EFFEEDDCCBBAA"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC1111122CE73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDEFEAD5555"], ["12345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED4444455C5555A113DDB0"], ["11ABCD2020D45B67C2022EEEFAD890A2022E753BDCEE7711ABACDF11118872159CEFFCEEFAD1213BCCBBD4CD2020DDB11ABCD2020D45B67C2022EEEFAD890AACCDF11118872159CEFFCEEFAD1213BCCBBD42345BBAA20200CC22EEFFEEDDCCBBAA2BCC22EEFFEEDDCCBBAABCDEF12345BBAA20200CC22EEFFEEDDCCBBAA"], ["275ACDF111188727159CEFFCEBEFAD12173BCCBBD4373ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC5555EF002E"], ["23312345ACDF12345B67C202B2EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4C2022EEEFAD890ABCDEF122345BBAA2020030"], ["1234567CEEFAD890ABCD73ABB333A11DDBCBCDEF202022022E753BDCEE771"], ["CEEFFAD"], ["232"], ["7AEBCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC5555D"], ["753EBBDCEE7753BDECF0"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DD7ABCDEF22022ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555555E02020CBAABBBBB333A11DDBC55ACDF11118872159CEFF23BCCBBD4DBC555547567CEEFAD890ABCDABCDEF20202CB5EF12345BBAA20200"], ["275322022EBDCEEFFBACDF11118872159CEFFCEEFAD121312345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A113DDBC200BCCBBD4ADBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555A7F89ABCDEF002"], ["7773ABB333A11DDBCB75322022EBDCEEFFA7F9ABCDEF0BBB2BB333CA11D055A7F89ABCDEF0333A11DDBC5555"], ["275322022EBD73ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DD753CEEFAD753BDCEE753BDFCF0BDCE0201234567F89ADBCDEF753BDCE02067F89ADBCDEF0CEEFFBABBE753BDCE02067F89ADBCDEF0333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555A7F89ABCDEF002"], ["123456753BD78CEACDF111188727159CEFFCEEFAD1213BCCBBD4EEFEAED90ABCDEF12345BBAA20200"], ["B1234575322022EBDCEEFFA7F9DABCDEF067890ABCDEF12345BBADA20200"], ["ACD7C200015E753BD9CEFF23BCCBBD4"], ["11ABDEEDDCCBBAA"], ["7275322022EBDCABB73ABB3033A11DDBCBCDEF202020CBAABBB2BB333CA11D0DBC511ABCD2020DDBBCC22EEF555333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CBA11DDBC55555557F89ABCDEF002E53BDCE0201234567F89ABCDEF0"], ["7ABCDEF20ABCDEF20202CEACDF111188727159CEFFCEEFAD12139BCCBBD4EEFEAED0CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBC55553BD"], ["12345067BB333A11DDBC53BD7890ABCDEF12345BBAA2753BDCE02067F89ADBCBDEF00"], ["2220A2273ABB333A11DDBCBCDEF2BB3311ABCD2020DDBBCC22EEF3A11DDEBC02020CBAABBB2BB333CA11D7553D2"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA2020123F4567CEEFA7ABCDEF20ABCDEF202020CBAABBBBB333A11DDBC555520222E2020CBAABBBBB333A11DDBCACDF111188727159CEFFCEEFAD12113BCCBBD4EE11ACDF11118872159CEFFCEEFAD21753BDCEE753BDCF03BCCBBBD4ABCD2020D45B67C2022EEEFAD890ABCDEF12345BBAA20200AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA202003344444555555CC22EEFFEEDDCCBBAAEFEADC55553BACDF11118872159CEEFFCEEFAD213BCCBBD4DD89073533ABCDEF12345BBBAA20200"], ["75312345B67C2022EEEACDF12345B633A11DDBCBCDEF202020CB2022EAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4BDF0"], ["7ABCDEF2020230CBA275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF2202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E318872159CEFF23BCCBBD4D"], ["753BDCEE7757353312345ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD977ABCDEF202020CBAABBBBB75322022EBDCEEFFA7F89ABCDEF0333A11DDBC5555CEFF23BCCBBD4C2022EEEFAD890ABCDEF12345BBAA2020033F0"], ["753BDCEE753BDC7353F0"], ["CEE11ABCD2020D45B267C2A022EEEFAD890ABCDEF12345BBAA20AD"], ["753B7ABCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC55553BDDCEE7753BDC7353F0"], ["12345B67AABDBC555BDBC55559CEFF23BCCBBD45BBAA202007EF0"], ["753BDCEEFA1234567890ABCDEF12345BBAA20200D6202012304567F89ABCDDFAD753BDCEE753BDFC1234567890ABCDEF12345BBAA20C200F0EF0"], ["123456753BD78CEACDF111188727159CEFFCEEFAD1213BCCBBD4EEFEAED90ABCDEF1D2345BBAA202007"], ["753BDCEACDF12345B67C2022EEEFAD890ABCDEF12345BBAA202001111887215E753BD9CEFF23BC337312345B67CEEFABD890ABCDEF12345BBACDF12345B67C2022EEEFAD123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC555547567CEEFAD890ABCDEF12345BBAA20200890AB123ABB333A11DDBCBCDEF20202C0CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDEF12345BBAA20200BCCBBD4AA20200CBBD431BDCF0"], ["7ABCDEF20202011ACD2020DDBB123ACDF12345B6777ABCDEF202020CBAABBBBB333A11DDBC5555C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF23BCCBBD4DEF12345BBBBAACBAABBBBB33773A11DDBC535553BD"], ["753BD7ABCDEF202020CBAABBBBB333A11DDBC55A2022E753BDCEB2BCC22EEFFEEDDCCBBAACDF11118872159CEFF23BCC337312345B67CEEFAD890ABCDEF12345BBAA20200BBD4D"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF231234567890ABCDBEF12345BBAA20200BCCBBD4"], ["1234567CEEFAD890735DEF12345BBAA20200"], ["A753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB22AABCDEF202020CB5"], ["7ABCDEF220227AEBCDEF202020CBAABB75322022EBDCEEFFA7F89ABCDEF0BBB333A11DDBC5555DABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5555555E02020CBAABBBBB333A11DDBC55ACDF11118872159CEFF23BCCBBD4D"], ["ACDF1111887FF23BCCBBACDF111188727159CEFFCEEFAD12113BCCBBD4D4"], ["123ABB333A11DDBCBCDEF202020CBAABBB73533A11DDBC5555437567CEEFAD890ABCDEF12A345BBAA20200"], ["123ABB333A11DDBCBC7275322022EBDCABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC5ABB333A11DDBCBCDEF202020CBAABBB2BB333CA11DDBC55555557F89ABCDEF002E53BDCE0201234567F89ABCDEF0DEF202020CBAABBB73533A11DDBC555547567CEEFAD890ABCDEF12345BBAA20200"], ["C123412345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A1113DDBC200ACDF11118872159CEFFCEEFAD21753B12345B67C20200D4567CEEFAD89073533ABCDEF12345BBAA20200ABCDEF202020CB5"], ["ABDBC512345B67C1BB333AB4CDEF202020CBAABBB5DDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033CEEEFEAED44444555555A113DDBC2005"], ["ACDF12345B67C2022EEEFAD890AB123ABB333A11DDBCBCDEF2020C20CBAABBB2BB33B3CA11DDBC55554567CEEFAD890ABCDEF12345BBAA2020015E753BD9CEFF2312345BD4"], ["AB4CDEF202020CBAABBBDDDDDDCCCCC111112212345B67CEEFAD890ABCDEF12345BBAA2020033444753BDCEE7753BDC7353F0555555"], ["AA753BDC753BDCEEFAD2020123456789ABCDEABCDEF202020CBAABBBDDDDDDCCCCC1111122222333334444455555F0EE7711ABCD2020DDB27BCC22EEFFEEDDCCBB2AABCDEF202020CB5CCDF"], ["123ABB333A11DDBCBCDEF21020200CBAABBB2BB333CA11DDBC55554567CEEFAD890ABCDEF12345BBAA20200"], ["11ABCD2020D45B67BC2022EEEFAD890ABCDEF12345BBAA2CCBBAA"], ["5"], ["ACDF11118872159CEFF23BCCBB333A11DDBCBBBD4"], ["ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44"], ["BB3133A11DDBC"], ["BB3137D1DDBC"], ["BB3137D1DDBB1C"], ["CEAD"], ["1234567890ABCDEF12345BBAA2202E"], ["ACDF11118872753BD159CEFF23BCCBB333A11DDBCBBBD4"], ["BB37137D1DDBC"], ["11ABCD2020753BDDDBBCFFEEDDCCBBAA"], ["BB3D137D1DDBC"], ["1234567890ABCDEFA12345BBAA20200"], ["1234567890ABCDEF12345BBAA2201234567890ABCDEFA12345BBAA202002E"], ["753BDCEEFAD20753BD20123456789ABCDEF0"], ["172345BBAA20200"], ["CEA"], ["BB3137D1DDBB31C"], ["CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA"], ["11ABCD2020DDBBCEC22EEFFEEDDCCBBAA"], ["2753BDCEEFAD2020123456789ABCDEF0020E"], ["1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA12345BBAA20200"], ["BB37137D1DDBCBB3133A11DDBC"], ["753BDCEEFAD2020123456789CDEF0"], ["BB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC"], ["BB11ABCD2020DDBBCC22EEFFEEDDCCBBAA3133A11DDBC"], ["172345BBAAA20200"], ["CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200"], ["ACDF11118872159CEFFACDF1BB37137D1DDBC1118872159CEFF23BCCBB333A11DDBCBBBD44"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBAA202002E345BBAAA200"], ["11ABCD2020DDBBCC22EBB3137D1DDBB31CEFFEEDDCCBBAA"], ["1234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202E"], ["ABCDEF202020CBAABBBDDDDDDBCCCCC111112222233333444442753BDCEEFAD2020123456789ABCDEF0020E55555"], ["BB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD"], ["ACDF111188FF23BCCBBD4"], ["2"], ["CEA753BDD"], ["7D"], ["202753BDCEEFAD20753BD20123456789ABCDEF0E"], ["1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200"], ["CAEA"], ["BB37137D1DDBCB1234567890ABCDEF12345BBAA2201234567890ABCDEFA12345BBAA202002EB3133A11DDCBC"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBAA202002E34BB333A11DDBC5BBAAA200"], ["CCEEFADAEEA"], ["BB11ABCD2020DDBBCC22EECEA"], ["BB11CEADA2BCD2020DDBBCC22EECEA"], ["BBB3137D1DDBB1CB3D137D1DDBC"], ["BB3133A311DDBC"], ["BCD2020DDBBCC22EECEA"], ["1234567890ABCDEF1BB11ABCD2020DDBBCC22EECEA2345BBAA2202E"], ["7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD2020123456789CDEF0"], ["BB37137D1DDBCBB3133A11DDBB11ABCD2020DDBBCC22EECEABC"], ["BBB3BB333A11DDBC1DDBB1CB3D137D1DDBC"], ["1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200"], ["ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44"], ["1234567890ABCDEFA12345BBAA202070"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBAA202002CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200"], ["ACDF111188FF23FBCCBBD4"], ["BCACDF11118872159CEFF23BCCBBD4D2020DDBBCC22EECEA"], ["ACDF11118872159CEFF23BCCBCB333A11DDBCBB1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA1234E5BBAA20200BD4"], ["CACEADEA"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA202002E345BBAAA200"], ["BC"], ["BB31A7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD2020123456789CDEF0BBD4437D1DDBC753BD"], ["75F3BDCEEFAD2020123456789CDEF0"], ["1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA12345BBABA20200"], ["BBCC"], ["11ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200BCC22EBB3137D1DDBB31CEFFEEDDCCBBAA"], ["ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["ACDF11118872753BD159CEFF723BCCBB333A191DDBFCBBBD4"], ["ABCDEF202020CBAABBBDDDDDDBCCCCC111112222233333444172345BBAAA20200442753BDCEEFAD2020123456789ABCDEF0020E55555"], ["D"], ["1234567890ABCDEFA12345BBA00"], ["BB37753BDCEEFAD20753BD20123456789ABCDEF0137D1DD3BCBB3133A11DDBC"], ["1234567891234567890ABCDEF123B45BBAA2202E0ABCDEF12345BBAA2202E"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200BAA202002E345BBAAA200"], ["1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCEADCDEFA12345BBAA20200"], ["BBB3BB333A11DDBC1DDBDB1CB3D137D1DDBC"], ["22"], ["1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA202000"], ["11ABCD2020DDBBCC2ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAA"], ["BB37137D1DDBCBB31373A11DDBC"], ["BCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEA"], ["11ABCD2020753BDDDBBCCBBAA"], ["123456782290ABCDEFA12345BBA00"], ["202753BDCEEFAD20753BD201239ABCDEF0E"], ["1172345BBAA20200"], ["BB37137D1DDBCCBB3133A11DDBC"], ["CACEADEAD"], ["BB33D137D1DDBC"], ["1234567891234567890ABCDEF123B45BBAA22020A2202E"], ["BB37137D1DDBCB1234567890ABCDEF12345BBAA22201234567890ABCDEFA12C"], ["BBC"], ["BCAEAB3133A311DDBC"], ["72753BDCEEFAD2020123456789ABCDEF0020ED"], ["ACDF11118872159CEFF23BCCBCB333A11DDBCBB1ACDF11118872159CEFF23BCCBBD42334567890ABCDEFA1234E5BBAA20200BD4"], ["1234567582290ABCDEFA12345BBA00"], ["ACDF11118872159C3BCCBBD4"], ["1ACDF11118872159CEFF23BCCBBD423456711ABCD20D20753BDCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200DDBBBCFFEEDDCCBBAA890ABCEADCDEFA12345BBAA20200"], ["1234567891234567890ABCDEF123B45BBAA2202E0ABCDEF12345BBAA220E"], ["BB11ABCD22020DDBBCC22EECEA"], ["1234567890ABCDEF1BB11ABCD2020DDBDBCC22EECEA2345BBAA2202E"], ["12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202E"], ["1ACDF11118872159CEFF23BCCBBD423456711ABCD20D20753BDCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBBAA20200DDBBBCFFEEDDCCBBAA890ABCEADCDEFA12345BBAA20200"], ["71234567891234567890ABCDEF123B45BBAA22020A2202E"], ["1234567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A00"], ["ACDF11118872159CEFF23BCCBB333AF11DDBCBBBD4"], ["ACDAF11118872753BD159CEFF723BCCBB333A191BB3133A11DDBCBBD4"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200"], ["BCD2020DDBBACC22EECEA"], ["172345BB11ABCD2020DDBBCC22EECEABBAA20200"], ["753BDCEEFAD202013456789ABCDEF0"], ["BB3137D1DDBBC"], ["1234567582290ABC2DEFA12345BBA00"], ["1ACDF11118872159CEFF23BCCBBACDF11118872159CEFFACDF1BB37137D1DDBC1118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA202000"], ["75F3BDCEEFAD2020123451234567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A006789CDEF0"], ["12345CEA753BDD67891234567890ABCDEF121234567890ABCDEF12345BBAA2202E345BBAA2202E0ABCDEF12345BBAA2202E"], ["BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC"], ["172345BB11ABCD2020DDBBCEABBAA20200"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEBB37137D1DDBCBB31373A11DDBCEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200"], ["CACE1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEAD"], ["BCD2020DDBBCC22EECAEA"], ["1234567891234567EF12345BBAA2202E"], ["BB11ABCD22020DDBB2CC22EECEA"], ["1234567890ABCDEFA12345BBAA2020270"], ["75F3BDCEEFAD2020123451234567582290AB753BDCDEFAACDF11118872159CEFF23BCCBBD4A006789CDEF0"], ["BBCEA31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD"], ["CAACEADEA"], ["2753BDCEEFAD2020123456789AB3CD0020E"], ["CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202ED"], ["CACEADEA12345CEA753BDD67891234567890ABCDEF121234567890ABCDEF12345BBAA2202E345BBAA2202E0ABCDEF12345BBAA2202E"], ["ACDF11118872753BD159CEFF723BCCACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44BB333A191DDBFCBBBD4"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA20200345BBAAA200"], ["BB37137BC"], ["7BB31A7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD2020123456789CDEF0BBD4437D1DDBC753BD"], ["11ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAA"], ["172345BBAA2A20200"], ["BB1B1ABCD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBC"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA202002E4345BBAAA200"], ["1721234567890ABCD3EF120345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200BAA202002E345BBAAA200"], ["123BB3137D1DDBB1CE"], ["BB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBB1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA202002E345BBAAA200BD4437D1DDBC753BD"], ["DD"], ["1234567890ABC020270"], ["ACDF11118872159CEFFACDFBCD2020DDBBCC22EECEA11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["BCACDF11118872159CEFF2CACEADEA3BCCBBD4D2020"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDFBB11ABCD22020DDBB2CC22EECEA11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200"], ["7531234567891234567890ABCDEF12345BBAA2202E0ABCAEACD3456789CDEF0"], ["BB37137D1DDBCBB1DDBC"], ["BCD21234567890ABCDEFA12345BBAA20200DBBCC22EECE1234567ACDF11BAA2202E"], ["BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBDBC"], ["ACDF11118872159CEFF2322BCCBCB333A11DDBCBB1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA1234E5BBAA20200BD4"], ["1234567890ABCDEFA12345ABBAA202011ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAA70"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31CBAA202002E345BBAAA200"], ["CCEEFEACDAF11118872753BD159CEFF723BCCBB333A191BB3133A11DDBCBBD4A"], ["CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202ED"], ["CCEEFEACDAF11118872753BD159CEFF723BCCBB333A13133A11DDBCBBD4A"], ["BBC1234567891234567890ABCDEF123B45BBAA22020A2202EC"], ["BCACDF11118872159CEFF2CACEADE0A3BCCBBD4D2020"], ["CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E01234567891234567EF12345BBAA2202EABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202ED"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200BBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEAAA202002E345BBAAA200"], ["1ACDF11118872159CEFF23BCCBBACDF11118872159CEFFACDF1BB37137D1DDBC1118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C290753BDDDBBCFFEEDDCCBBAA12345BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC67890ABCDEBF12345BBAA202000"], ["BB37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB3133A11DDBC"], ["BCD2123A20200DBBCC22EECEA"], ["12345753BD67891234567890ABCDEF123B45BBAA22020A2202E"], ["BB333A11DDBBB33D137D1DDBCC"], ["123456782290ABCDEFA12345BBA0A0"], ["BB31ACDF11118872159CEFFACDF111188721333A11DDBCBBBD4437D1DDBC753BD"], ["172345BBAAACDF11118872753BD159CEFF723BCCBB333A191DDBFCBBBD42A20200"], ["1234567890ABCDEF1BB11ABCD2020DDBBCC22EECEA2345BBAA2A202E"], ["BB37137D1DDBCB1234567890ABCDEFA12345BBAA2201234567890ABCDEFA12345BBAA202002EB3133A11DDCBC"], ["7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF123475BBAA2202EBDCEEFAD2020123456789CDEF0"], ["1723753BDCEEFAD202013456789ABCDEF045BBAA20200"], ["ACDF11118872753BBCCB333A191DDBFCBBBD4"], ["202753BDCEEFAD20753BD20BB37137D1DDBCB1234567890ABCDEF12345BBAA2201234567890ABCDEFA12345BBAA202002EB3133A11DDCBC1239ABCDEF0E"], ["ACDF11118872753BD159CEFF723BCCBB333A191BD4"], ["ACDF111188721202753BDCEEFAD20753BD20123456789ABCDEF0E59CEFF23BCCBB333A11DDBCBBBD4"], ["172345BB11ABCD2020DDBBCC22EECEABBAA1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA20200345BBAAA20020200"], ["BCD2020D0DBBCC22EECAEA"], ["75312324567891234567890AABCDEF12345BBAA2202E0ABCDEF123475BBAA2202EBDCEEFAD2020123456789CDEF0"], ["CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2A202E0ABCDEF12345BBAA2202ED"], ["BCD21234567890ABCDEFA12345BBAA260200DBBCC22EECEA"], ["12345753BD6789123567890ABCDEF123B45BBAA22020A2202E"], ["123BDB3137D1DDBB1CE"], ["BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBBBDBC"], ["BACDF11118872753BD159CEFF723FBCCBB333A191DDBFCBBBD4B37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB3133A11DDBC"], ["BB11ABCD2020DDBBCC22EEFFEEDDCCBBAA3133AB11DDBC"], ["CEEF"], ["753BDCEEFAD2020121721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31CBAA202002E345BBAAA200456789CDEF0"], ["1721234567890ABCDEF12345BBAA2201233456790ABCDEFA123435BBAA202002E4345BBAAA200"], ["BC133A311DDBC"], ["BB3D137DD1DDBC"], ["202753BDCEEFAD20753BD20EF0E"], ["BB1B1ABCD2020DDBBCC22EEFF1EEDDBCCBBAA3133A11DDBC"], ["172345BB11ABCD2020DDBBCEABBA0A20200"], ["ACDAF11118872753BD15A90ABCDEF123B45BBAA22020A2202ECD4"], ["CCEA"], ["123BDB3137D1DD1CE"], ["1234567890ABCDEF12345BBAA22012345678900ABCDEFEA12345CACE1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEADBBAA202002E"], ["ACDF11118872753BD159CEFF723BCCBB333A3191BD4"], ["CEEFA12345CEA753BDD6789E1234567890ABCDEF12345BB753BDCEEFAD2020123456789ABCDEF0AA2202E0ABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202ED"], ["753BDCEEFAD202012345E6789CDEF0"], ["BCD2123BBCEA31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD4567890ABCDEFA12345BBAA20200DBBCC22EECEA"], ["BB37137D1DDB"], ["11ABCD2020DDBBCEC22EEFFEBEDDCCBBAA"], ["BB31BBB3BB333A11DDBC1DDBB1CB3D137D1DDBCACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC"], ["753BDCEEFAD20201234567895ABCDEF0"], ["CEADCEAD"], ["172345BB11ABCD2020DDBBCEA1BBAA20200"], ["CAEBB1B1ABCD2020DDBBCC22EEFF1EEDDBCCBBAA3133A11DDBCA"], ["1723753BDCEEFAD202013456789ABCDEF045BBAA2020"], ["17212BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBBBDBC34567890ABCDEAF12345BBAA22012334567890ABCDEFA123435BBAA20200345BBAAA200"], ["1234567890ABCDEF12345BBAA22012345678900ABCDEFEA12345CACE1721234567890ABCDEF12345BBAA22012334567890ABCDEFA1234BB37137D1DDBCB1234567890ABCDEF12345BBAA2201234567890ABCDEFA12345BBAA202002EB3133A11DDCBC5BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEADBBAA202002E"], ["ACDF11118872753BD159CEFF23BCCBB333A1D4"], ["ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB33BBD44"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEBB37137D1DDBCBB31373A11DDBCEFAD11ABCD20C2ACDF11118872159C3BCCBBD40753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200"], ["172345BBA"], ["75F3BDCEEFABCD2020DDBBCC22EECAEAD2020123451234567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A006789CDEF0"], ["BCD275F3BDCEEFAD2020123456789CDEF01234567890ABCDEFA12345BBAA260200DBBCC22EECEA"], ["12345612345CEA753BDD67891234567890ABCDEF121234567890ABCDEF12345BBAA2202E345BBAA2202E0ABCDEF12345BBAA2202E782290ABCDEFA12345BBA0A0"], ["ACDF11118872753BD159CEFF723BCCBBD333A3191BD4"], ["1234567890ABCDEF12345BBAA22012345678900ABCDEFEA12345CACE1721234567890ABCDEF12345BBAA22012334567890ABEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEADBBAA202002E"], ["BB31ACDF11118872F159C3EFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC"], ["172345BBAAACDF11111721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBAA202002CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200EFF723BCCBB311ABCD2020DDBBCEC22EEFFEEDDCCBBAA33A191DDBFCBBBD42A20200"], ["1234567890345BBAA28202E"], ["BBCEA31ACDF11118872159CEFFACDF11118872A159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD"], ["753B7DCEEFAD2020130456789ABCDEF0"], ["1234567890ABCDEF1BB11ABCD2020DDBBCC22EECEA2345BB02E"], ["BB31ACDF11118872159CEFFACDF1311188721333A11DDBCBBBD4437D1DDBC753BD"], ["7531234567891234567890ABCD2EF12345BBAA2202E0ABCAEACD3456789CDEF0"], ["11ABCD2020DDBBCC22EEFFEEDDCCBBEAA"], ["CEEFAD11ABCD20C2075CEEFAD3BDDDBBCFFEEDDCCBBAA"], ["172345BBAAACDF11111721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBAA202002CEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200EFF723BCCBB311ABCD2020DDBBCEC22EEFFEEDDCACDF11118872753BBCCB333A191DDBFCBBBD4CBBAA33A191DDBFCBBBD42A20200"], ["BB37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB3133A11DDBCCEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202ED"], ["BCACDF11118872159CEFF2CACEADEA3BCC"], ["20275CDEF0E"], ["123BB3137D1D22BB1CE"], ["2ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["BBB31A7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD202053BDBC"], ["AC118872159CEFFACDF1BB37137D1DDBC1118872157D9CEFF23BCCBB333A11DDBCBBBD44"], ["12345675822BB3D137D1DDBCA12345BBA00"], ["222"], ["BBBB11ABCD22020DDBB2CC22EECEA3D137DD1DDBC"], ["202EACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44"], ["1ACDF1111887118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C290753BDDDBBCFFEEDDCCBBAA12345BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC67890ABCDEBF12345BBAA202000"], ["BB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD41437D1DDBC753BD"], ["BBB3BB333A11DDBC1DDBDB1CB3D137D1DDBCBB33D137D1DDBC"], ["202753BDCEBCD275F3BDCEEFAD2020123456789CDEF01234567890ABCDEFA12345BBAA260200DBBCC22EECEA0E"], ["ACDF111188721202753BDCEEFAD20753BD20123456789ABCDEF0753BDCEEFAD2020123456789CDEF0E59CEFF23BCCBB333A11DDBCBBBD4"], ["ACDF11118872753BD159CFEFF23BCCBB333A11DDBCBBBD4"], ["7BB31A7531234567891234567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A001234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD2020123456789CDEF0BBD4437D1DDBC753BD"], ["CCEA753BDD"], ["11ABCD2BAA"], ["11ABCD1723753BDCEEFAD202013456789ABCDEF045BBAA202002BAA"], ["13234567890ABCDEF1DBB11ABCD2020DDBDBCC22EECEA2345BBAA2202E"], ["753BDCEEFAD2020121721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31CBAA202002E345BBAAA200456789C11ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200BCC22EBB3137D1DDBB31CEFFEEDDCCBBAADEF0"], ["172345BBA1234567890345BBAA28202E"], ["BBCEA31ACDF11118872159CEFFACDF11118872159CEFF23BCCBBD1DDBC753BD"], ["CCEEFEACDAF11118872753BD159CEFF723B11ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAAD4A"], ["ACDF11118872159CEFFACDFBCD2020DDBBCC22EECEA11118872159CECFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["202753BDCEEFAFD20753BD20EF0E"], ["BCACDF11118872159CEFF2CACEADEA3BCC20"], ["BBB313D7D1DDBB1CB3D137D1DDBC"], ["BBBB11ABCD22020DDBB2CC22EECEA3D13B7DD1DDBC"], ["CEEFAA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF212345BBAA2202ED"], ["ACDF111ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200BCC22EBB3137D1DDBB31CEFFEEDDCCBBAA1118872753BD159CEFF723BCCBBD333A3191BD4"], ["B2B37137D1DDBCBB3133A11DDBB11ABCD2020DDBBCC22EECEABC"], ["71234567891234567890ABCDEF123B45BBAAA22020A2202E"], ["751234567890ABCDEFA12345BBAA2020703BDCEEFAD20753BD20123456789ABCDEF0"], ["ACDF11118872159CEFF23BCBB11ABCD22020DDBBCC22EECEACBB333AF11DDBCBBBD4"], ["ACDF11118872753BD159CEFF723BCCBB333A31951BD4"], ["CCEA75313234567890ABCDEF1DBB11ABCD2020DDBDBCC22EECEA2345BBAA2202EBDD"], ["BB31AC172345BBAA20200DF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD41437D1DDBC753BD"], ["75312324567891234567890AABCDEF12345BBAA2202E0ABCDEF123475BCCEABDCEEFAD2020123456789CDEF0"], ["2ACDF11118872159CEFFACDF11118872159CEFF23BCACCEADEA"], ["172345BBA12345678BB37137D1DDBCCBB3133A11DDBC0345BBAA28202E"], ["BCD20220DDBBCC22EECAEA"], ["202EACDF11118872159CEFFACD1F11118872159CEFF23BCCBB333A11DDBCBBBD44"], ["17234C5BB11ABCD2020DDBBCC22EECEABBAA20200"], ["ACDF11118872753BD159CEFF723BCCBB333A191BD7BB11ABCD22020DDBB2CC22EECEA5F3BDCEEFAD20201234512134567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A006789CDEF04"], ["202EACDF11118872159CEFFAC33A11DDBCBBBD44CCEA753BDD"], ["CBCD21234567890ABCDEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF212345BBAA2202ED"], ["ACD17234C5BB11ABCD2020DDBBCC22EECEABBAA2020011118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44"], ["11ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD4ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4442EEFFEEDDCCBBAA"], ["0202E"], ["ACDF1111887C2159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44"], ["CCEEFEACDAF11118872753BD159CEFF723B11ABCD2020DDBBCC2EACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAAD4A"], ["ACDF1111887215C9CEFF23BCCBCB333A11DDBCBB1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA1234E5BBAA20200BD4"], ["753BDCEEFAD2020121721234567890ABCDEF12345BBAA22012334567890ABCDACDF11118872753BD159CEFF723BCCBB333A191BD7BB11ABCD22020DDBB2CC22EECEA5F3BDCEEFAD20201234512134567582290ABCDEFAACDF11118872159CEFF23BCCBBD4A006789CDEF04EFA12345BBB3137D1DDBB31CBAA202002E345BBAAA200456789C11ACDF1111887C2159CEFFACDF11118872159CEFF12345753BD6789123567890ABCDEF123B45BBAA22020A2202E23BCCBB333A11DDBCBBBD44ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA3137D1DDBB31CEFFEEDDCCBBAADEF0"], ["BBCEA31ACDF11118872159CEFFACDFD11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD"], ["ACDF11118872753BD159CEFF723BCBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDB12345753BD6789123567890ABCDEF123B45BBAA22020A2202ECBBBD44BB333A191DDBFCBBBD4"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEBB37137D1DDBCBB31373A11DDBCEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF212345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202E3BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200"], ["ABCDEF202020CBAABBBDDDDDDBCCCCC1111122222333733444442753BDCEEFAD2020123456789ABCDEF0020E55555"], ["ACDF11118872753BD159CEFF723BCBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB3137D1DDBB1CBB333A11DDB12345753BD6789123567890ABCDEF123B45BBAA22020A2202ECBBBD44BB333A191DDBFCBBBD4"], ["123456758229A0AABCDEFA12345BBA00"], ["1ACDF11118872159CEDFF23BCCBBACDF11118872159CEFFACDF1BB37137D1DDBC1118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C290753BDDDBBCFFEEDDCCBBAA12345BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC67890ABCDEBF12345BBAA202000"], ["123457531BD6789123567890ABCDEF123B45BBAA22020A2202E"], ["1721234567890ABCDEF12345BBAA220123A20200345BBAAA200"], ["BBB313D7D1DDBBB3D137D1DDBC"], ["753BDCEEFAD202012345E6789CDDEF0"], ["1721234567890AB1CDEF12345BBAA22012334567890ABCDEFA12345BBAA202002E34BB333A11DDBC5BBAAA200"], ["17212BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBBBDBC34567890ABCDEAF12345BBAA22012334567890ABCDEFA123435BBAA20200345BBAAA2060"], ["BB37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB312345CEA753BDD678BBC67890ABCDEF12345BBAA42202E0ABCDEF12345BBAA2202E133A11DDBC"], ["BB11CEADA2BCD2020DDBBC11ABCD2020753BDDDBBCFFEEDDCCBBAAC22EECEA"], ["72753BDCEEF5AD2020123456789ABCDEF0020ED"], ["202753BDCEBCD275F3BDCEEFAD2020123456789CDEF011ACDF1111887118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C290753BDDDBBCFFEEDDCCBBAA12345BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC67890ABCDEBF12345BBAA202000234567890ABCDEFA12345BBAA260200DBBCC22EECEA0E"], ["202753BDCEEFAD20753BD2012345678BCDEF0E"], ["1234567890ABCDEF12345BBAA22012345678900ABCDEFEA12345CACE1721234567890ABCDEF12345BBAA2201233CD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEADBBAA202002E"], ["1ACDF11118872159CEFF23BCCBBDDDBBCFFEEDDCCBBBAA20200DDBBBCFFEEDDCCBBAA890ABCEAD0CDEFA12345BBAA20200"], ["ACDF1811188FF23BCCBBD4"], ["BACDF11118872753BD159CEFF7BB3133A11BC23FBCCBB333A191DDBFCBBBD4B37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB31333A11DDBC"], ["172345BBAA2A0200"], ["BB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBB1721234567890ABCDEF12345BBAA220123345678902753BDCEEFAD2020123456789AB3CD0020EABCDEFA123435BBAA202002E345BBAAA200BD4437D1DDBC753BD"], ["123456789A0ABCDEF12345BBAA2201234567890ABCDEFA12345BBAA202002E"], ["753BDCEEFAD20201345689ABCDEF0"], ["11ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200BCC22EBB31753BD37D1DDBB31CEFFEEDD11ABCD2020DDBBCEC22EEFFEEDDCCBBAACCBBAA"], ["BB1B1ADBCD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBC"], ["ACDF11118872753BD159CEFF723BCB1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEBB37137D1DDBCBB31373A11DDBCEFAD11ABCD20C2ACDF11118872159C3BCCBBD40753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200CD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDB12345753BD678DDBFCBBBD4"], ["1ACDF11118872159CEFF23BCCBBD4234567890ABCDEFA123BB3137D1DDBB31C45BBAA20200"], ["BDBB3BB333A11DDBC1DDBB1CB3D137D1DDBC"], ["1234567891234567890ABCDEF123B45BBAA2202BCAEAB3133A311DDBCE0ABCDEF12345BBAA220E"], ["ACDF11118872159C172345BB11ABCD2020DDBBCC22EECEABBAA202003BCCBBD4"], ["1ACDF11118872159CEFF23BCCBBDDDBBCFFEEDDCCBBBAA20200DDBBBCCACEADEA12345CEA753BDD67891234567890ABCDEF121234567890ABCDEF12345BBAA2202E345BBAA2202E0ABCDEF12345BBAA2202EFFEEDDCCBBAA890ABCEAD0CDEFA12345BBAA20200CEEF"], ["BB1B1ABCDD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBC"], ["2ACDF11118872159CEFFACDF11118872159CEFF23BCAACCEADEA"], ["CBBB37137D1DDBCBB31373A11CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EDFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF212345BBAA2202ED"], ["B3ACDF11118872753BD159CEFF723FBCCBB333A191DDBFCBBBD4B37753BDCEE3BD20123456789ABCDEF0137D1DD3BCBB3133A11DDBC"], ["ACDF1111887215CACEADEA9CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44"], ["ACDF11118872753BD159CEFF723BCBCD212345CACEADEA67890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDB12345753BD6789123567890ABCDEF123B45BBAA22020A2202ECBBBD44BB333A191DDBFCBBBD4"], ["172345BBAAACDF11118872753BD159CEFF723BCCBB333A191DDBFCBABBD42A20200"], ["CEEEFAA12345CEA753BDD67891234567890ABCDEF12345BACDF11118872753BD159CEFF723BCBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB3137D1DDBB1CBB333A11DDB12345753BD6789123567890ABCDEF123B45BBAA22020A2202ECBBBD44BB333A191DDBFCBBBD4F212345BBAA220ED"], ["CEEFAA12345CEA753BDD67891234567890ABCD2345BBAA2202E0ABCDEF212345BBAA220ED"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31BAA202002E345BBAAA200"], ["BCD2123BBCEA31ACDF11118872159CEFFACDF11118872159CEFF23B345BBAA20200DBBCC22EECEA"], ["CAC"], ["ACD17234C5BB11ABCD2020DDBBCC22EECEABBAA202001111812345675822BB3D137D1DDBCA12345BBA00872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44"], ["BBBB11ABCD22020DDBB2CC22EECEA3D1BBB313D1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEBB37137D1DDBCBB31373A11DDBCEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA2007D1DDBB1CB3D137D1DDBC3B7DD1DDBC"], ["ACDFC11118872159C172345BB11ABCD2020DDBBCC22EECEAAA202003BCCBBD4"], ["1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20172345BB11ABCD2020DDBBCC22EECEABBAA1721234567890ABCDEF12345BBAA22012334567890ABCDEFA123435BBAA20200345BBAAA20020200200BAA202002E345BBAAA200"], ["ACDF11118872159CEFFACDFBCD211ABCDBB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD2020753BDDDBBCFFEEDDCCBBAA020DDBBCC22EECEA11118872159CECFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["211ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD442EEFFEEDDCCBBAA"], ["172345BB11ABCD2020DDBBCEA1BB2AA20200"], ["BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11D11ABCD2020DDBBCC22EEFFEEDDCCBBEAADBCBBBBDBC"], ["1ACDF1F1118872159CEFF23BCCBBACDF11118872159CEFFACDF1BB37137D1DDBC1118872159CEFF23BCCBB333A11DDBCBBBD44D4234567890ABCDEFA12345BBABA2020CEEFAD11ABCD20C290753BDDDBBCFFEEDDCCBBAA12345BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC67890ABCDEBF12345BBAA202000"], ["753CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202EDBD"], ["BB33DBB31A7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD2020123456789CDEF0BBD4437D1DDBC753BD137D1DDBC"], ["CEEEFAA12345CEA753BDD67891234567890ABCDEF12345BACDF11118872753BD159CEFF723BCBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB3137D1DDBB1CBB333A123BB3137D1DDBB1CE11DDB12345753BD6789123567890ABCDEF123B45BBAA22020A2202ECBBBD44BB333A191DDBFCBBBD4F212345BBAA220ED"], ["2ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCB172345BB11ABCD2020DDBBCC22EECEABBAA20200BBD44CACCEADEA"], ["BB37137BB1B1ABCDD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBCD1DDBCCBB3133A1BB31ACDF11118872F159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC1DDBC"], ["211ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCC753BDCEEFAD20201345689ABCDEF0BB333A11DDBCBBBD442EEFFEEDDCCBBAA"], ["1CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345B1234567890ABCDEFA12345BBA00BAA2202EDACDF11118872159CEFF23BCCBBD4234567890ABCDEFA12345BBAA20200"], ["BBB3BB333A11DDBC1DDBDB1CB3D137D1DD"], ["B2B37137D1DDBCBB3133A11DDBB11ABCD20202DDBBCC22EECEABC"], ["BB31A7531234567891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EBDCEEFAD1234567890ABCDEF12345BBAA22012345678900ABCDEFEA12345CACE1721234567890ABCDEF12345BBAA2201233CD20C20753BDDDBBCFFEEDDCCBBAA1ACDF11118872159CEFFACDF11118B872159CDEFF23BCCBB333A11DDBCBBBD44234567890ABCDEF12345BBAA20200BAA202002E345B7BAAA200ADEADBBAA202002EDDBC753BD"], ["1721234567890AB1CDEF12345BBCAA22012334567890ABCDEFA12345BBAA202002E34BB333A11DDBC5BBAAA200"], ["11ABCD2020DDBBCDC22EEFFEEDDCCBBEAA"], ["753BDCEEFAD20201345689ABCEDEF0"], ["11ABCD2020DDBBCC2ACDF1BBCC1118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD4ACDF11118872159CEFFACDF11118872159CEFF23BC11ABCD2020DDBBCEC22EEFFEBEDDCCBBAACBB333A11DDBCBBBD4442EEFFEEDDCCBBAA"], ["172345BBABB31ACDF11118872F159C3EFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC12345678BB37137D1DDBCCBB3133A11DDBC0345BBAA28202E"], ["ACDF11118872159CEFFACDFBCD2020DDBBCC22E1234567890ABCDEF12345BBAA2202EECEA11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["75F3BD11ABCD2BAACEEFAD20201234567D89CDEF0"], ["12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202ECAC"], ["BBBB11ABCD221721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BCEEFAD11ABCD20C20753BDDDBBCFFEEDDCCBBAA1234567890ABCDEF12345BBAA20200BBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEAAA202002E345BBAAA200020DDBB2CC22EECEA3D137DD1DDBC"], ["BB31ACDF11118872159CEFFACDF111188721333A11D1721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31BAA202002E345BBAAA200BBD4437D1DDBC753BD"], ["ACDF11118872159CEFFACDFBCD211ABCDBB31ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD4437D1DDBC753BD2020753BDDDBBCFFEEDDCCBBA5A020DDBBCC22EECEA11118872159CECFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["BBBC"], ["CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E01234567891234567EF12345BBAA2202EABCDEF12345B1234567890ABCDEFA12345BBA00BAA22022ED"], ["ACDF1111123457531BD6789123567890ABCDEF123B45BBAA22020A2202E8872159CEFFACDFBCD2020DDBBCC22E1234567890ABCDEF12345BBAA2202EECEA11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADEA"], ["2ACDF11118872159CEFFACDF11118872159CEFF23BCAC753BDCEEFAD2020121721234567890ABCDEF12345BBAA22012334567890ABCDEFA12345BBB3137D1DDBB31CBAA202002E345BBAAA200456789C11ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAA20200BCC22EBB3137D1DDBB31CEFFEEDDCCBBAADEF0EADEA"], ["2753BDC2EEFAD2020123456789ABCDEF0020E"], ["ACDF11118872159CEFFACDF11118872159CEFF2344CACCEADEA"], ["BB11ABCD2020DDBBCC22EECCBBAA3133AB11DDBC"], ["1723753BDCEEFAD202013456789ABCDEF045BBAA202001234567890ABCDEF1BB11ABCD2020DDBBCC22EECEA2345BBAA2A202E"], ["CEEFAD11ABCD20C2075CEECEA753BDDFAD3BDDDBBCFFEEDDCCBBAA"], ["172345BBAA020200"], ["11ABCD2020DDB1ACDF11118872159CEFF23BCCBBD423456711ABCD2020753BDDDBBBCFFEEDDCCBBAA890ABCDEFA12345BBAAC20200BCC22EBB3137D1DDBB31CEFFEEDDCCBBAA"], ["172345BB3A"], ["3B2B37137D1D172345BBADDBCBB3133A11DDBB11ABCD2020DDBB"], ["ACDF11118872159CEFFACDF11118872159CEFF23BCCBB333A11DDBCBBBD44CACCEADECCEEFADAEEAA"], ["753BDCEEFAD2020123BB1B1ABCD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBC456789ABCDEF0"], ["11ABCD2020DDBCBCEC22EEFFEBEDDCCBBAA"], ["172345BBAA2A"], ["BB37137BBC"], ["1ABCDF11118872159CEFF23BCCBBDDDBBCFFEEDDCCBBBAA20200DDBBBCF753BDCEEFAD2020123BB1B1ABCD2020DDBBCC22EEFFEEDDBCCBBAA3133A11DDBC456789ABCDEF0FEEDDCCBBAA890ABCEAD0CDEFA12345BBAA20200"], ["1723753BDCEEFAD2020132BBAA20200"], ["CEEEFAA12345CEA753BDD67891234567890ABCDEF12345BACDF11118872753BD159CEFF723BCBCD21234567890ABCDEFA12345BBAA20200DBBCC22EECEACACDF11118872159CEFFACDF11118872159CDEFF23BCCBB20ED"], ["ACDF11118872159CEFF23BCCBB333AACDF11118872159CEFFACDF11118872159CDEFF23BCCBB333A11DDBCBBBD44F11DDBCBBBD4"], ["BB3133A3CBBB37137D1DDBCBB31373A11CEEFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF12345BBAA2202EDFA12345CEA753BDD67891234567890ABCDEF12345BBAA2202E0ABCDEF212345BBAA2202EDDBC"], ["ABCDEF202020CBAABBBDDDDDDBCCCCC1111122222333733444442753EBDDCEEFAD2020123456789ABCDEF0020E55555"], ["1234567890ABCDEF1231ACDF11118872159CEFF23BCCBBDDDBBCFFEEDDCCBBBAA20200DDBBBCFFEEDDCCBBAA890ABCEAD0CDEFA12345BBAA2020045BBAA2201234567890ABCDEFA12345BAA202002E"], ["CACEAA"]], "completion": "\n\ndef hex_key(num):\n primes = {'2', '3', '5', '7', 'B', 'D'}\n count = 0\n for digit in num:\n if digit in primes:\n count += 1\n return count\n\n", "raw_completion": "```python\n\ndef hex_key(num):\n primes = {'2', '3', '5', '7', 'B', 'D'}\n count = 0\n for digit in num:\n if digit in primes:\n count += 1\n return count\n\n```", "actual_prompt": "\n### Instruction:\nProvide a response which completes the following Python code: \n\n```python\n\ndef hex_key(num):\n \"\"\"You have been tasked to write a function that receives \n a hexadecimal number as a string and counts the number of hexadecimal \n digits that are primes (prime number, or a prime, is a natural number \n greater than 1 that is not a product of two smaller natural numbers).\n Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.\n Prime numbers are 2, 3, 5, 7, 11, 13, 17,...\n So you have to determine a number of the following digits: 2, 3, 5, 7, \n B (=decimal 11), D (=decimal 13).\n Note: you may assume the input is always correct or empty string, \n and symbols A,B,C,D,E,F are always uppercase.\n Examples:\n For num = \"AB\" the output should be 1.\n For num = \"1077E\" the output should be 2.\n For num = \"ABED1A33\" the output should be 4.\n For num = \"123456789ABCDEF0\" the output should be 6.\n For num = \"2020\" the output should be 2.\n \"\"\"\n\n```\n\n### Notes: \nRespond with the entire complete function definition, including a re-stated function definition.\nUse only built-in libraries and numpy, assume no additional imports other than those provided in the problem statement.\nDo not add any comments, be as concise in your code as possible.\n"}