task_id stringlengths 5 7 | question stringlengths 192 1.48k | test_list listlengths 2 5 | test_function stringlengths 54 236 | entry_point stringclasses 1
value | test_matching stringlengths 57 291 | test_match_function stringclasses 1
value |
|---|---|---|---|---|---|---|
OOP/69 | Question: Given a square integer array **matrix** of size n x n, find and return the minimum sum of a descending path through the **matrix**;
Based on the above question, create a class **DPH** in Python with the attribute **matrix**. Then create another class **SN_DPH** that inherits from the **DPH** class, and add a ... | [
"assert candidate([[2,1,3],[6,5,4],[7,8,9]])==13",
"assert candidate([[-19,57],[-40,-5]])==-59"
] | def test_run(content1):
return SN_DPH(content1).descent_path() | test_run | assert candidate([["class DPH", "def __init__(self, matrix)", "class SN_DPH(DPH)", "super().__init__(matrix)", "def descent_path"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/70 | Question: An array **nums** of length **n** is considered a beautiful array if it meets the following conditions:
1. **nums** is a permutation of the integers in the range [1, n].
2. For every 0 <= i < j < n, there is no index **k** (i < k < j) such that 2*nums[k] == nums[i] + nums[j].
Given an integer **n**, return ... | [
"assert candidate(4)==[2,1,4,3]",
"assert candidate(5)==[3,1,2,5,4]"
] | def test_run(content1):
return SN_BAR(content1).Beautiful_array() | test_run | assert candidate([["class BAR", "def __init__(self, n)", "class SN_BAR(BAR)", "super().__init__(n)", "def Beautiful_array"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/71 | Question: Given a binary matrix **grid** of size n x n, where 1 represents land and 0 represents water. An island is a maximum group formed by 1s connected on all four sides, i.e., it will not be connected to any other 1s not in the group. There are exactly two islands in the grid. You can turn any number of 0s into 1s... | [
"assert candidate([[0,1],[1,0]])==1",
"assert candidate([[0,1,0],[0,0,0],[0,0,1]])==2",
"assert candidate([[1,1,1,1,1],[1,0,0,0,1],[1,0,1,0,1],[1,0,0,0,1],[1,1,1,1,1]])==1"
] | def test_run(content1):
return SN_FNE(content1).Flip_Number() | test_run | assert candidate([["class FNE", "def __init__(self, grid)", "class SN_FNE(FNE)", "super().__init__(grid)", "def Flip_Number"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/72 | Question: Given a log array **logs**. Each log is a string separated by spaces, with the first word being an identifier mixed with letters and numbers. There are two different types of logs:
1. Letter logs: Apart from the identifier, all words are composed of lowercase letters; 2. Number logs: Apart from the identifier... | [
"assert candidate([\"dig1 8 1 5 1\",\"let1 art can\",\"dig2 3 6\",\"let2 own kit dig\",\"let3 art zero\"])==[\"let1 art can\",\"let3 art zero\",\"let2 own kit dig\",\"dig1 8 1 5 1\",\"dig2 3 6\"]",
"assert candidate([\"a1 9 2 3 1\",\"g1 act car\",\"zo4 4 7\",\"ab1 off key dog\",\"a8 act zoo\"])==[\"g1 act car\",\... | def test_run(content1):
return SN_FOR(content1).Final_order() | test_run | assert candidate([["class FOR", "def __init__(self, logs)", "class SN_FOR(FOR)", "super().__init__(logs)", "def Final_order"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/73 | Question: Given a set of points **drop** on the xy-plane, determine the minimum area of the rectangle formed by these points, where the sides of the rectangle are parallel to the x-axis and y-axis. If no rectangle can be formed, return 0;
Based on the above question, please create a class **MAR** in Python language wit... | [
"assert candidate([[1,1],[1,3],[3,1],[3,3],[2,2]])==4",
"assert candidate([[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]])==2"
] | def test_run(content1):
return SN_MAR(content1).Minimum_Area() | test_run | assert candidate([["class MAR", "def __init__(self, drop)", "class SN_MAR(MAR)", "super().__init__(drop)", "def Minimum_Area"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/74 | Question: Given a string **s**, calculate the number of different non-empty sub-sequences of **s**;
Based on the above question, please create a class **ESU** in Python language with the attribute **s**. Then create another class **SN_ESU** that inherits from the **ESU** class, and add a public function **empty_subsequ... | [
"assert candidate(\"abc\")==7",
"assert candidate(\"aba\")==6",
"assert candidate(\"aaa\")==3"
] | def test_run(content1):
return SN_ESU(content1).empty_subsequence() | test_run | assert candidate([["class ESU", "def __init__(self, s)", "class SN_ESU(ESU)", "super().__init__(s)", "def empty_subsequence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/75 | Question: Given an integer array **nums**. Each **move** operation will choose any index **i** that satisfies 0<=i<nums.length, and increase **nums[i]** by 1. Return the minimum number of operations required to make each value in **nums** unique;
Please create a class **MOT** with the attribute **nums** in Python based... | [
"assert candidate([1,2,2])==1",
"assert candidate([3,2,1,2,1,7])==6"
] | def test_run(content1):
return SN_MOT(content1).Minimum_operations() | test_run | assert candidate([["class MOT", "def __init__(self, nums)", "class SN_MOT(MOT)", "super().__init__(nums)", "def Minimum_operations"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/76 | Question: Given two sequences **pushed** and **popped**, each with unique values, return True if they could be the result of a sequence of **push** and **pop** operations on an initially empty stack; otherwise, return False.
Based on the above question, create a class **ISK** in Python language with the attribute **pu... | [
"assert candidate([1,2,3,4,5],[4,5,3,2,1])==True",
"assert candidate([1,2,3,4,5],[4,3,5,1,2])==False"
] | def test_run(content1,content2):
return SN_ISK(content1,content2).Initial_stack() | test_run | assert candidate([["class ISK", "def __init__(self, pushed)", "class SN_ISK(ISK)", "def __init__(self, pushed, popped)", "super().__init__(pushed)", "def Initial_stack"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/77 | Question: There are **n** stones placed on some integer coordinates in a two-dimensional plane. Each coordinate can have at most one stone. If a stone has other stones on the same row or column, it can be removed. Given an array of length **n**, **stones**, where stones[i] = [x_i, y_i] represents the position of the i-... | [
"assert candidate([[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]])==5",
"assert candidate([[0,0],[0,2],[1,1],[2,0],[2,2]])==3",
"assert candidate([[0,0]])==0"
] | def test_run(content1):
return SN_RSN(content1).Removed_stones() | test_run | assert candidate([["class RSN", "def __init__(self, stones)", "class SN_RSN(RSN)", "super().__init__(stones)", "def Removed_stones"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/78 | Question: Your initial energy is **power**, and your initial score is 0. You only have one pack of **tokens**. Where tokens[i] is the value of the i-th token (index starts from 0). There are two possible ways to use the tokens as follows:
1. If you have at least token[i] points of energy, you can flip the i-th token fa... | [
"assert candidate([100],50)==0",
"assert candidate([100,200],150)==1",
"assert candidate([100,200,300,400],200)==2"
] | def test_run(content1,content2):
return SN_INY(content1,content2).Initial_energy() | test_run | assert candidate([["class INY", "def __init__(self, tokens)", "class SN_INY(INY)", "def __init__(self, tokens, power)", "super().__init__(tokens)", "def Initial_energy"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/79 | Question: Given an array composed of 4 digits, return the maximum time that can be set in accordance with the 24-hour system. The 24-hour format is **HH:MM**, where HH is between 00 and 23, and MM is between 00 and 59. The smallest 24-hour system time is 00:00, and the largest is 23:59. Starting from 00:00 (midnight), ... | [
"assert candidate([1,2,3,4])==\"23:41\"",
"assert candidate([5,5,5,5])==\"\"",
"assert candidate([0,0,0,0])==\"00:00\"",
"assert candidate([0,0,1,0])==\"10:00\""
] | def test_run(content1):
return SN_ETM(content1).effective_time() | test_run | assert candidate([["class ETM", "def __init__(self, arr)", "class SN_ETM(ETM)", "super().__init__(arr)", "def effective_time"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/80 | Question: Given a non-empty array **nums** composed of different positive integers, consider the following graph:
1. There are nums.length nodes, marked from nums[0] to nums[nums.length-1]; 2. There is an edge between nums[i] and nums[j] only when nums[i] and nums[j] share a common factor greater than 1. Return the siz... | [
"assert candidate([4,6,15,35])==4",
"assert candidate([20,50,9,63])==2",
"assert candidate([2,3,6,7,4,12,21,39])==8"
] | def test_run(content1):
return SN_CCN(content1).Connected_components() | test_run | assert candidate([["class CCN", "def __init__(self, nums)", "class SN_CCN(CCN)", "super().__init__(nums)", "def Connected_components"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/81 | Question: Given an integer array **arr** of even length, return True if **arr** can be rearranged to satisfy for each 0<=i<len(arr)/2, arr[2*i+1]=2*arr[2*i]; otherwise, return False.
Please create a class **RSF** with the attribute **arr** in Python based on the above question. Then create another class **SN_RSF** tha... | [
"assert candidate([3,1,3,6])==False",
"assert candidate([2,1,2,6])==False",
"assert candidate([4,-2,2,-4])==True"
] | def test_run(content1):
return SN_RSF(content1).Reorganization_satisfaction() | test_run | assert candidate([["class RSF", "def __init__(self, arr)", "class SN_RSF(RSF)", "super().__init__(arr)", "def Reorganization_satisfaction"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/82 | Question: Given an array **strs** composed of **n** strings, where each string is of equal length. Select a deletion index sequence, for each string in **strs**, delete the character at each corresponding index. Suppose, we have chosen a set of deletion indices **answer**, then after performing the deletion operation, ... | [
"assert candidate([\"ca\",\"bb\",\"ac\"])==1",
"assert candidate([\"xc\",\"yb\",\"za\"])==0",
"assert candidate([\"zyx\",\"wvu\",\"tsr\"])==3"
] | def test_run(content1):
return SN_MPL(content1).Minimum_possible() | test_run | assert candidate([["class MPL", "def __init__(self, strs)", "class SN_MPL(MPL)", "super().__init__(strs)", "def Minimum_possible"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/83 | Question: You are installing a billboard and want it to be as high as possible. This billboard will have two steel brackets, one on each side. The height of each steel bracket must be equal. You have a pile of **rods** that can be welded together. For example, if the lengths of the rods are 1, 2, and 3, they can be wel... | [
"assert candidate([1,2,3,6])==6",
"assert candidate([1,2,3,4,5,6])==10",
"assert candidate([1,2])==0"
] | def test_run(content1):
return SN_IBD(content1).Install_billboards() | test_run | assert candidate([["class IBD", "def __init__(self, rods)", "class SN_IBD(IBD)", "super().__init__(rods)", "def Install_billboards"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/84 | Question: In an nxn grid composed of 1x1 squares, each 1x1 square is made up of '/', '\' or a space. These characters divide the square into some regions with common edges. Given the grid represented as an array of strings, return the number of regions;
Please create a class **NAS** in Python based on the above questio... | [
"assert candidate([\" /\",\"/ \"])==2",
"assert candidate([\" /\",\" \"])==1",
"assert candidate([\"/\\\",\"\\/\"])==5"
] | def test_run(content1):
return SN_NAS(content1).Number_areas() | test_run | assert candidate([["class NAS", "def __init__(self, grid)", "class SN_NAS(NAS)", "super().__init__(grid)", "def Number_areas"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/85 | Question: Given an array of **strs** composed of **n** lowercase letter strings, where each string is of equal length. Select a deletion index sequence, and for each string in **strs**, delete the character at each corresponding index. For example, if strs = ["abcdef", "uvwxyz"], and the deletion index sequence is {0,2... | [
"assert candidate([\"babca\",\"bbazb\"])==3",
"assert candidate([\"edcba\"])==4",
"assert candidate([\"ghi\",\"def\",\"abc\"])==0"
] | def test_run(content1):
return SN_MSI(content1).Minimum_spossible() | test_run | assert candidate([["class MSI", "def __init__(self, strs)", "class SN_MSI(MSI)", "super().__init__(strs)", "def Minimum_spossible"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/86 | Question: Given an integer array **A**, a slope is a tuple (i, j), where i < j and A[i] <= A[j]. The width of such a slope is j-i. Find the maximum width of the slope in **A**, if it does not exist, return 0.
Please create a class **WSP** in Python language based on the above question, with the attribute **A**. Then cr... | [
"assert candidate([6,0,8,2,1,5])==4",
"assert candidate([9,8,1,0,1,9,4,0,4,1])==7"
] | def test_run(content1):
return SN_WSP(content1).Width_slope() | test_run | assert candidate([["class WSP", "def __init__(self, A)", "class SN_WSP(WSP)", "super().__init__(A)", "def Width_slope"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/87 | Question: Given a set of points **drop** on the **xy** plane, determine the minimum area of any rectangle formed by these points, where the sides of the rectangle are not necessarily parallel to the x-axis and y-axis. If there are no rectangles, return 0;
Based on the above question, please create a class **ARE** in Py... | [
"assert candidate([[1,2],[2,1],[1,0],[0,1]])==2.00000",
"assert candidate([[0,1],[2,1],[1,1],[1,0],[2,0]])==1.00000",
"assert candidate([[0,3],[1,2],[3,1],[1,3],[2,1]])==0",
"assert candidate([[3,1],[1,1],[0,1],[2,1],[3,3],[3,2],[0,2],[2,3]])==2.00000"
] | def test_run(content1):
return SN_ARE(content1).Any_rectangle() | test_run | assert candidate([["class ARE", "def __init__(self, drop)", "class SN_ARE(ARE)", "super().__init__(drop)", "def Any_rectangle"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/88 | Question: Given a positive integer **x**, we will write an expression of the form x(op1)x(op2)x(op3)x..., where each operator op1, op2, ... can be one of addition, subtraction, multiplication, or division (+, -, *, or /). For example, for x=3, we can write the expression 3*3/3+3-3, which equals 3. When writing such exp... | [
"assert candidate(3,19)==5",
"assert candidate(5,501)==8",
"assert candidate(100,100000000)==3"
] | def test_run(content1,content2):
return SN_MNOOT(content1,content2).minimum_operators==5() | test_run | assert candidate([["class MNOOT", "def __init__(self, x)", "class SN_MNOOT(MNOOT)", "def __init__(self, x, target)", "super().__init__(x)", "def minimum_operators"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/89 | Question: Return all non-negative integers of length **n** such that the absolute difference between the digits in every two consecutive positions is **k**;
Please create a class **NIG** in Python language based on the above question, with the attribute **n**. Then create a class **SN_NIG** that inherits from the **NIG... | [
"assert candidate(3,7)==[181,292,707,818,929]",
"assert candidate(2,1)==[10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]",
"assert candidate(2,0)==[11,22,33,44,55,66,77,88,99]",
"assert candidate(2,2)==[13,20,24,31,35,42,46,53,57,64,68,75,79,86,97]"
] | def test_run(content1,content2):
return SN_NIG(content1,content2).nonnegative_integer() | test_run | assert candidate([["class NIG", "def __init__(self, n)", "class SN_NIG(NIG)", "def __init__(self, n, k)", "super().__init__(n)", "def nonnegative_integer"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/90 | Question: Given an integer array **arr**, please sort the array using pancake flipping. The execution process of a pancake flip is as follows:
1. Choose an integer **k**, where 1<=k<=arr.length; 2. Reverse the sub-array arr[0...k-1] (index starts from 0); Return the sequence of **k** values corresponding to the pancake... | [
"assert candidate([3,2,4,1])==[4,2,4,3]",
"assert candidate([1,2,3])==[]"
] | def test_run(content1):
return SN_PFG(content1).Pancake_flipping() | test_run | assert candidate([["class PFG", "def __init__(self, arr)", "class SN_PFG(PFG)", "super().__init__(arr)", "def Pancake_flipping"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/91 | Question: Given three integers **x**, **y**, and **bound**, return a list of all powerful integers that are less than or equal to **bound**;
Based on the above question, please create a class **SIG** in Python with the attribute **x**; then create a class **SN_SIG** that inherits from the **SIG** class, and add two att... | [
"assert candidate(2,3,10)==[2,3,4,5,7,9,10]",
"assert candidate(3,5,15)==[2,4,6,8,10,14]"
] | def test_run(content1,content2,content3):
return SN_SIG(content1,content2,content3).Strong_integer() | test_run | assert candidate([["class SIG", "def __init__(self, x)", "class SN_SIG(SIG)", "def __init__(self, x, y, bound)", "super().__init__(x)", "def Strong_integer"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/92 | Question: Given two strings **s** and **t**, each string represents a non-negative rational number, return True only when they represent the same number;
Based on the above question, please create a class **SNR** in Python with the attribute **s**; then create another class **SN_SNR** inheriting from the **SNR** class,... | [
"assert candidate(\"0.(52)\",\"0.5(25)\")==True",
"assert candidate(\"0.1666(6)\",\"0.166(66)\")==True",
"assert candidate(\"0.9(9)\",\"1.\")==True"
] | def test_run(content1,content2):
return SN_SNR(content1,content2).() | test_run | assert candidate([["class SNR", "def __init__(self, s)", "class SN_SNR(SNR)", "def __init__(self, s, t)", "super().__init__(s)", "def Same_number"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/93 | Question: Given an array **points**, where points[i] = [x_i, y_i] represents a point on the X-Y plane, and an integer **k**, return the **k** points closest to the origin (0,0);
Based on the above question, create a class **NOG** in Python, with the attribute **points**; then create a class **SN_NOG** that inherits fro... | [
"assert candidate([[1,3],[-2,2]],1)==[[-2,2]]",
"assert candidate([[3,3],[5,-1],[-2,4]],2)==[[3,3],[-2,4]]"
] | def test_run(content1,content2):
return SN_NOG(content1,content2).Nearest_origin() | test_run | assert candidate([["class NOG", "def __init__(self, points)", "class SN_NOG(NOG)", "def __init__(self, points, k)", "super().__init__(points)", "def Nearest_origin"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/94 | Question: Given an integer array **nums** and an integer **k**, return the number of (continuous, non-empty) sub-arrays whose sum of elements can be divided by **k**.
Please create a class **SET** in Python language based on the above question, which has the attribute **nums**. Then create another class **SN_SET**, in... | [
"assert candidate([4,5,0,-2,-3,1],5)==7",
"assert candidate([5],9)==0"
] | def test_run(content1,content2):
return SN_SET(content1,content2).Sum_Elements() | test_run | assert candidate([["class SET", "def __init__(self, nums)", "class SN_SET(SET)", "def __init__(self, nums, k)", "super().__init__(nums)", "def Sum_Elements"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/95 | Question: Given an integer array **A**, you can start from a certain index and make a certain number of jumps. During your jumping process, the 1-th, 3-th, 5-th... jumps are called odd jumps, while the 2-th, 4-th, 6-th... jumps are called even jumps. You can jump from index **i** to index **j** (where **i < j**) in the... | [
"assert candidate([10,13,12,14,15])==2",
"assert candidate([2,3,1,1,4])==3",
"assert candidate([5,1,3,4,2])==3"
] | def test_run(content1):
return SN_SID(content1).start_index() | test_run | assert candidate([["class SID", "def __init__(self, A)", "class SN_SID(SID)", "super().__init__(A)", "def start_index"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/96 | Question: Given an integer array **arr**, return the length of the maximum **turbulence subarray** in **arr**. A subarray is a **turbulence subarray** if the comparison sign flips between each pair of adjacent elements in the subarray;
Based on the above question, create a class **MTL** in Python, which has the attribu... | [
"assert candidate([9,4,2,10,7,8,8,1,9])==5",
"assert candidate([4,8,12,16])==2",
"assert candidate([100])==1"
] | def test_run(content1):
return SN_MTL(content1).Maximum_turbulence() | test_run | assert candidate([["class MTL", "def __init__(self, arr)", "class SN_MTL(MTL)", "super().__init__(arr)", "def Maximum_turbulence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/97 | Question: On a two-dimensional grid **grid**, there are 4 types of squares:
**1** represents the starting square, and there is only one starting square; **2** represents the ending square, and there is only one ending square; **0** represents the empty square that we can walk through; **-1** represents the obstacle tha... | [
"assert candidate([[1,0,0,0],[0,0,0,0],[0,0,2,-1]])==2",
"assert candidate([[1,0,0,0],[0,0,0,0],[0,0,0,2]])==4",
"assert candidate([[0,1],[2,0]])==0"
] | def test_run(content1):
return SN_DPS(content1).Different_paths() | test_run | assert candidate([["class DPS", "def __init__(self, grid)", "class SN_DPS(DPS)", "super().__init__(grid)", "def Different_paths"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/98 | Question: Given an integer array **nums**, return the number of bitwise AND triplets. A bitwise AND triplet is a triplet made up of indices (i, j, k) that satisfy all of the following conditions:
1. 0<=i<nums.length; 2. 0<=j<nums.length; 3. 0<=k<nums.length; 4. nums[i]&nums[j]&nums[k]==0, where & represents the bitwise... | [
"assert candidate([2,1,3])==12",
"assert candidate([0,0,0])==27"
] | def test_run(content1):
return SN_BTT(content1).Bitwise_triplet() | test_run | assert candidate([["class BTT", "def __init__(self, nums)", "class SN_BTT(BTT)", "super().__init__(nums)", "def Bitwise_triplet"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/99 | Question: Given two integers a and b, return any string s that satisfies the following conditions:
1. The length of s is a+b, and it contains exactly a occurrences of the letter 'a' and b occurrences of the letter 'b'.
2. The substring 'aaa' does not appear in s.
3. The substring 'bbb' does not appear in s.
Please crea... | [
"assert candidate(1,2)==\"abb\"",
"assert candidate(4,1)==\"aabaa\""
] | def test_run(content1,content2):
return SN_ASG(content1,content2).Any_string() | test_run | assert candidate([["class ASG", "def __init__(self, a)", "class SN_ASG(ASG)", "def __init__(self, a, b)", "super().__init__(a)", "def Any_string"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/100 | Question: Given two lists composed of some closed intervals, **firstList** and **secondList**, where firstList[i]=[start_i,end_i] and secondList[j]=[start_j,end_j]. Each interval list is pairwise disjoint and already sorted. Return the intersection of these two interval lists;
Based on the above question, please create... | [
"assert candidate([[0,2],[5,10],[13,23],[24,25]],[[1,5],[8,12],[15,24],[25,26]])==[[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]",
"assert candidate([[1,3],[5,9]],[])==[]",
"assert candidate([],[[4,8],[10,12]])==[]",
"assert candidate([[1,7]],[[3,10]])==[[3,7]]"
] | def test_run(content1,content2):
return SN_ILT(content1,content2).Interval_List() | test_run | assert candidate([["class ILT", "def __init__(self, firstList)", "class SN_ILT(ILT)", "def __init__(self, firstList, secondList)", "super().__init__(firstList)", "def Interval_List"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/101 | Question: Given an array composed of string equations that represent the relationships between variables, each string equation equations[i] has a length of 4 and takes one of two different forms: **a==b** or **a!=b**. Here, a and b are lowercase letters (not necessarily different), representing single-letter variable n... | [
"assert candidate([\"a==b\",\"b!=a\"])==False",
"assert candidate([\"b==a\",\"a==b\"])==True",
"assert candidate([\"a==b\",\"b==c\",\"a==c\"])==True",
"assert candidate([\"a==b\",\"b!=c\",\"c==a\"])==False",
"assert candidate([\"c==c\",\"b==d\",\"x!=z\"])==True"
] | def test_run(content1):
return SN_SVE(content1).Single_variable() | test_run | assert candidate([["class SVE", "def __init__(self, equations)", "class SN_SVE(SVE)", "super().__init__(equations)", "def Single_variable"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/102 | Question: On a broken calculator displaying the number **startValue**, we can perform the following two operations:
1. Double: Multiply the number on the display by 2; 2. Decrement: Subtract 1 from the number on the display. Given two integers, **startValue** and **target**, return the minimum number of operations requ... | [
"assert candidate(2,3)==2",
"assert candidate(5,8)==2",
"assert candidate(3,10)==3"
] | def test_run(content1,content2):
return SN_MOS(content1,content2).Minimum_operands() | test_run | assert candidate([["class MOS", "def __init__(self, startValue)", "class SN_MOS(MOS)", "def __init__(self, startValue, target)", "super().__init__(startValue)", "def Minimum_operands"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/103 | Question: Given a positive integer array **nums** and an integer **k**, return the number of good sub-arrays in nums. If the number of different integers in a sub-array of nums is exactly **k**, then this continuous, not necessarily different sub-array of **nums** is called a good sub-array;
Based on the above question... | [
"assert candidate([1,2,1,2,3],2)==7",
"assert candidate([1,2,1,3,4],3)==3"
] | def test_run(content1,content2):
return SN_GAR(content1,content2).Good_array() | test_run | assert candidate([["class GAR", "def __init__(self, nums)", "class SN_GAR(GAR)", "def __init__(self, nums, k)", "super().__init__(nums)", "def Good_array"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/104 | Question: In the given m x n grid **grid**, each cell can have one of the following three values:
1. Value 0 represents an empty cell.
2. Value 1 represents a fresh orange.
3. Value 2 represents a rotten orange.
Every minute, a rotten orange will make any fresh orange in the four adjacent directions rot. Return the m... | [
"assert candidate([[2,1,1],[1,1,0],[0,1,1]])==4",
"assert candidate([[2,1,1],[0,1,1],[1,0,1]])==-1",
"assert candidate([[0,2]])==0"
] | def test_run(content1):
return SN_MME(content1).Min_Minutes() | test_run | assert candidate([["class MME", "def __init__(self, grid)", "class SN_MME(MME)", "super().__init__(grid)", "def Min_Minutes"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/105 | Question: Given a binary array **nums** and an integer **k**, return the minimum number of k-bit flips required for the array to have no zeros. If it's not possible, return -1. A k-bit flip means choosing a subarray of length **k** from nums, and simultaneously changing every 0 in the subarray to 1, and every 1 in the ... | [
"assert candidate([0,1,0],1)==2",
"assert candidate([1,1,0],2)==-1",
"assert candidate([0,0,0,1,0,1,1,0],3)==3"
] | def test_run(content1,content2):
return SN_MFI(content1,content2).Min_Flip() | test_run | assert candidate([["class MFI", "def __init__(self, nums)", "class SN_MFI(MFI)", "def __init__(self, nums, K)", "super().__init__(nums)", "def Min_Flip"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/106 | Question: Given a non-negative integer array **A**, if the sum of every pair of adjacent elements is a perfect square, then this array is called a square array. Return the number of square arrangements of **A**.
Please create a **SAT** class based on the above question, with the attribute **A**; then create a **SN_SAT*... | [
"assert candidate([1,17,8])==2",
"assert candidate([2,2,2])==1"
] | def test_run(content1):
return SN_SAT(content1).Square_arrangement() | test_run | assert candidate([["class SAT", "def __init__(self, A)", "class SN_SAT(SAT)", "super().__init__(A)", "def Square_arrangement"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/107 | Question: There are **n** piles of stones arranged in a row, with stones[i] stones in the i-th pile. Each move requires merging **k** consecutive piles of stones into one pile, and the cost of this move is the total number of stones in these **k** piles. Return the lowest cost to merge all the stones into one pile. If ... | [
"assert candidate([3,2,4,1],2)==20",
"assert candidate([3,2,4,1],3)==-1",
"assert candidate([3,5,1,2,6],3)==25"
] | def test_run(content1,content2):
return SN_SMG(content1,content2).Stone_Merge() | test_run | assert candidate([["class SMG", "def __init__(self, stones)", "class SN_SMG(SMG)", "def __init__(self, stones, K)", "super().__init__(stones)", "def Stone_Merge"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/108 | Question: In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the i-th domino respectively. (A domino is formed by two numbers from 1 to 6 arranged in columns - each half of the tile has a number.) We can rotate the i-th domino so that the values of tops[i] and bottoms[i] are swapped. Re... | [
"assert candidate([2,1,2,4,2,2],[5,2,6,2,3,2])==2",
"assert candidate([3,5,1,2,3],[3,6,3,3,4])==-1"
] | def test_run(content1,content2):
return SN_DMS(content1,content2).Dominoes() | test_run | assert candidate([["class DMS", "def __init__(self, tops)", "class SN_DMS(DMS)", "def __init__(self, tops, bottoms)", "super().__init__(tops)", "def Dominoes"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/109 | Question: In the song list, the duration of the i-th song is time[i] seconds. Return the number of song pairs whose total duration (in seconds) can be divided by 60;
Based on the above question, please create a class **TDN** in Python, with the attribute **time**; then create another class **SN_TDN**, inheriting from t... | [
"assert candidate([30,20,150,100,40])==3",
"assert candidate([60,60,60])==3"
] | def test_run(content1):
return SN_TDN(content1).Total_duration() | test_run | assert candidate([["class TDN", "def __init__(self, time)", "class SN_TDN(TDN)", "super().__init__(time)", "def Total_duration"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/110 | Question: The packages on the **conveyor belt** must be transported from one port to another within **days**. The weight of the i-th package on the conveyor belt is weights[i]. Every day, we load packages onto the conveyor belt in the order of the given weights. The weight we load will not exceed the maximum carrying w... | [
"assert candidate([1,2,3,4,5,6,7,8,9,10],5)==15",
"assert candidate([3,2,2,4,1,4],3)==6",
"assert candidate([1,2,3,1,1],4)==3"
] | def test_run(content1,content2):
return SN_MCG(content1,content2).Minimum_carrying() | test_run | assert candidate([["class MCG", "def __init__(self, weights)", "class SN_MCG(MCG)", "def __init__(self, weights, days)", "super().__init__(weights)", "def Minimum_carrying"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/111 | Question: Given a positive integer **n**, return the number of positive integers within the range [1, n] that have at least one repeating digit;
Based on the above question, please create a class called **RNS** in Python, with an attribute **n**. Then create another class **SN_RNS** that inherits from the **RNS** class... | [
"assert candidate(20)==1",
"assert candidate(100)==10",
"assert candidate(1000)==262"
] | def test_run(content1):
return SN_RNS(content1).Repeating_numbers() | test_run | assert candidate([["class RNS", "def __init__(self, n)", "class SN_RNS(RNS)", "super().__init__(n)", "def Repeating_numbers"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/112 | Question: Given a positive integer array **values**, where values[i] represents the rating of the i-th sightseeing spot, and the distance between two spots i and j is j-i. The score of a sightseeing combination of a pair of spots (i<j) is values[i]+values[j]+i-j, which is the sum of the ratings of the spots minus the d... | [
"assert candidate([8,1,5,2,6])==11",
"assert candidate([1,2])==2"
] | def test_run(content1):
return SN_SCT(content1).Sightseeing_combination() | test_run | assert candidate([["class SCT", "def __init__(self, values)", "class SN_SCT(SCT)", "super().__init__(values)", "def Sightseeing_combination"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/113 | Question: Given a positive integer **k**, you need to find the length of the smallest positive integer **n** that can be divided by **k** and only contains the digit 1. Return the length of **n**. If there is no such **n**, return -1;
Based on the above question, please create a class **MIR** in Python with the attribu... | [
"assert candidate(1)==1",
"assert candidate(2)==-1",
"assert candidate(3)==3"
] | def test_run(content1):
return SN_MIR(content1).Minimum_integer() | test_run | assert candidate([["class MIR", "def __init__(self, k)", "class SN_MIR(MIR)", "super().__init__(k)", "def Minimum_integer"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/114 | Question: Given a binary string **s** and a positive integer **n**, return True if the binary representation of every integer in the range [1, n] is a substring of **s**, otherwise return False;
Please create a class **ETG** in Python language based on the above question, with the attribute **s**. Then create a class *... | [
"assert candidate(\"0110\",3)==True",
"assert candidate(\"0110\",4)==False"
] | def test_run(content1,content2):
return SN_ETG(content1,content2).Each_integer() | test_run | assert candidate([["class ETG", "def __init__(self, s)", "class SN_ETG(ETG)", "def __init__(self, s, n)", "super().__init__(s)", "def Each_integer"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/115 | Question: Given an integer **n**, return its negative binary (base-2) representation in the form of a binary string;
Based on the above question, create a class **NGY** in Python language with the attribute **n**; then create a class **SN_NGY** that inherits from the **NGY** class, and add a public function **negabinar... | [
"assert candidate(2)==\"110\"",
"assert candidate(3)==\"111\"",
"assert candidate(4)==\"100\""
] | def test_run(content1):
return SN_NGY(content1).negabinary() | test_run | assert candidate([["class NGY", "def __init__(self, n)", "class SN_NGY(NGY)", "super().__init__(n)", "def negabinary"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/116 | Question: Given a linked list of length **n**, **head**. For each node in the list, find the value of the next larger node. That is, for each node, find the value of the first node next to it, the value of this node is strictly greater than its value. Return an integer array **answer**, where answer[i] is the value of ... | [
"assert candidate([2,1,5])==[5,5,0]",
"assert candidate([2,7,4,3,5])==[7,0,5,5,0]"
] | def test_run(content1):
return SN_LNS(content1).Larger_nodes() | test_run | assert candidate([["class LNS", "def __init__(self, head)", "class SN_LNS(LNS)", "super().__init__(head)", "def Larger_nodes"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/117 | Question: Given a binary matrix grid of size m x n, where 0 represents an ocean cell and 1 represents a land cell. A move is defined as moving from one land cell to another adjacent (up, down, left, right) land cell or crossing the border of the **grid**. Return the number of land cells in the grid that cannot leave th... | [
"assert candidate([[0,0,0,0],[1,0,1,0],[0,1,1,0],[0,0,0,0]])==3",
"assert candidate([[0,1,1,0],[0,0,1,0],[0,0,1,0],[0,0,0,0]])==0"
] | def test_run(content1):
return SN_LCL(content1).Land_Cell() | test_run | assert candidate([["class LCL", "def __init__(self, grid)", "class SN_LCL(LCL)", "super().__init__(grid)", "def Land_Cell"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/118 | Question: Given a string array **queries** and a string representing a **pattern**, return a boolean array **answer**. Only when the query item queries[i] matches the pattern string pattern, answer[i] is True, otherwise it is False;
Based on the above question, please create a class **BAY** in Python with the property ... | [
"assert candidate([\"FooBar\",\"FooBarTest\",\"FootBall\",\"FrameBuffer\",\"ForceFeedBack\"],\"FB\")==[True,False,True,True,False]",
"assert candidate([\"FooBar\",\"FooBarTest\",\"FootBall\",\"FrameBuffer\",\"ForceFeedBack\"],\"FoBa\")==[True,False,True,False,False]",
"assert candidate([\"FooBar\",\"FooBarTest\... | def test_run(content1,content2):
return SN_BAY(content1,content2).boolean_array() | test_run | assert candidate([["class BAY", "def __init__(self, queries)", "class SN_BAY(BAY)", "def __init__(self, queries, pattern)", "super().__init__(queries)", "def boolean_array"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/119 | Question: Given an integer array **nums**, return the length of the longest arithmetic subsequence in **nums**;
Based on the above question, create a class **LSQ** using Python language, with the attribute **nums**. Then create another class **SN_LSQ**, inheriting from the **LSQ** class, and add a public function **Lon... | [
"assert candidate([3,6,9,12])==4",
"assert candidate([9,4,7,2,10])==3",
"assert candidate([20,1,15,3,10,5,8])==4"
] | def test_run(content1):
return SN_LSQ(content1).Longest_subsequence() | test_run | assert candidate([["class LSQ", "def __init__(self, nums)", "class SN_LSQ(LSQ)", "super().__init__(nums)", "def Longest_subsequence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/120 | Question: The company plans to interview 2n people. Given an array **costs**, where costs[i]=[aCosti,bCosti]. The cost for the i-th person to fly to city **a** is **aCost_i**, and the cost to fly to city **b** is **bCost_i**. Return the minimum cost to fly each person to either city **a** or **b**, with the requirement... | [
"assert candidate([[10,20],[30,200],[400,50],[30,20]])==110",
"assert candidate([[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]])==1859",
"assert candidate([[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]])==3086"
] | def test_run(content1):
return SN_MCT(content1).Minimum_cost() | test_run | assert candidate([["class MCT", "def __init__(self, costs)", "class SN_MCT(MCT)", "super().__init__(costs)", "def Minimum_cost"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/121 | Question: Given an integer array **nums** and two integers **firstLen** and **secondLen**, you are to find and return the maximum sum of elements in two non-overlapping subarrays, with lengths respectively as **firstLen** and **secondLen**;
Based on the above question, create a class **OSR** in Python with the attribut... | [
"assert candidate([0,6,5,2,2,5,1,9,4],1,2)==20",
"assert candidate([3,8,1,3,2,1,8,9,0],3,2)==29",
"assert candidate([2,1,5,6,0,9,5,0,3,8],4,3)==31"
] | def test_run(content1,content2,content3):
return SN_OSR(content1,content2,content3).overlapping_subarray() | test_run | assert candidate([["class OSR", "def __init__(self, nums)", "class SN_OSR(OSR)", "def __init__(self, nums, firstLen, secondLen)", "super().__init__(nums)", "def overlapping_subarray"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/122 | Question: Three stones are placed on the number line at positions **a**, **b**, and **c**. In each round, you can pick up a stone from one of the ends (either the largest or smallest position) and place it in any free position between the two ends. Formally, suppose the three stones are currently at positions **x**, **... | [
"assert candidate(1,2,5)==[1, 2]",
"assert candidate(4,3,2)==[0, 0]"
] | def test_run(content1,content2,content3):
return SN_SMT(content1,content2,content3).Stone_movement() | test_run | assert candidate([["class SMT", "def __init__(self, a)", "class SN_SMT(SMT)", "def __init__(self, a, b, c)", "super().__init__(a)", "def Stone_movement"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/123 | Question: Write down the integers in **nums1** and **nums2** in the given order on two independent horizontal lines. Now, some lines can be drawn connecting the two numbers nums1[i] and nums2[j]. These lines need to satisfy the following conditions:
1. nums1[i] == nums2[j];
2. The drawn line does not intersect with an... | [
"assert candidate([1,4,2],[1,2,4])==2",
"assert candidate([2,5,1,2,5],[10,5,2,1,5,2])==3",
"assert candidate([1,3,7,1,7,5],[1,9,2,5,1])==2"
] | def test_run(content1,content2):
return SN_MCT(content1,content2).max_connections() | test_run | assert candidate([["class MCT", "def __init__(self, nums1)", "class SN_MCT(MCT)", "def __init__(self, nums1, nums2)", "super().__init__(nums1)", "def max_connections"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/124 | Question: In a 10^6x10^6 grid, the coordinates of each cell are (x,y). Now, starting from the source cell source=[sx,sy], the intention is to rush to the target cell target=[tx,ty]. The array blocked is a list of blocked cells, where each blocked[i]=[xi,yi] indicates that the cell with coordinates (xi,yi) is forbidden ... | [
"assert candidate([[0,1],[1,0]],[0,0],[0,2])==False",
"assert candidate([],[0,0],[999999,999999])==True"
] | def test_run(content1,content2,content3):
return SN_SGD(content1,content2,content3).Source_grid() | test_run | assert candidate([["class SGD", "def __init__(self, blocked)", "class SN_SGD(SGD)", "def __init__(self, blocked, source, target)", "super().__init__(blocked)", "def Source_grid"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/125 | Question: You have a convex n-polygon, each vertex of which has an integer value. Given an integer array **values**, where values[i] is the value of the i-th vertex (i.e., in clockwise order). Assume the polygon is divided into n-2 triangles. For each triangle, the value of the triangle is the product of the vertex lab... | [
"assert candidate([1,2,3])==6",
"assert candidate([3,7,4,5])==144",
"assert candidate([1,3,1,4,1,5])==13"
] | def test_run(content1):
return SN_TGT(content1).triangulation() | test_run | assert candidate([["class TGT", "def __init__(self, values)", "class SN_TGT(TGT)", "super().__init__(values)", "def triangulation"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/126 | Question: On an infinite plane, the robot initially stands at the point (0,0), facing north. Note:
1. North is the positive direction of the y-axis. 2. South is the negative direction of the y-axis. 3. East is the positive direction of the x-axis. 4. West is the negative direction of the x-axis. The robot can accept on... | [
"assert candidate(\"GGLLGG\")==True",
"assert candidate(\"GG\")==False",
"assert candidate(\"GL\")==True"
] | def test_run(content1):
return SN_EIT(content1).Execute_instructions() | test_run | assert candidate([["class EIT", "def __init__(self, instructions)", "class SN_EIT(EIT)", "super().__init__(instructions)", "def Execute_instructions"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/127 | Question: There are **n** gardens, labeled from 1 to **n**. There is also an array **paths**, where paths[i] = [x_i, y_i] describes the bidirectional path from garden **x_i** to garden **y_i**. In each garden, you plan to plant one of four types of flowers. Moreover, each garden can have at most three paths leading in ... | [
"assert candidate(3,[[1,2],[2,3],[3,1]])==[1,2,3]",
"assert candidate(4,[[1,2],[3,4]])==[1,2,1,2]",
"assert candidate(4,[[1,2],[2,3],[3,4],[4,1],[1,3],[2,4]])==[1,2,3,4]"
] | def test_run(content1,content2):
return SN_PFS(content1,content2).Planted_flowers() | test_run | assert candidate([["class PFS", "def __init__(self, n)", "class SN_PFS(PFS)", "def __init__(self, n, paths)", "super().__init__(n)", "def Planted_flowers"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/128 | Question: Given an integer array **arr**, please divide this array into some (continuous) sub-arrays with a maximum length of **k**. After the division, all values in each sub-array will become the maximum value in that sub-array. Return the maximum sum of elements that can be obtained after the array is divided and tr... | [
"assert candidate([1,15,7,9,2,5,10],3)==84",
"assert candidate([1,4,1,5,7,3,6,1,9,9,3],4)==83",
"assert candidate([1],1)==4"
] | def test_run(content1,content2):
return SN_STF(content1,content2).Separation_transformation() | test_run | assert candidate([["class STF", "def __init__(self, arr)", "class SN_STF(STF)", "def __init__(self, arr, k)", "super().__init__(arr)", "def Separation_transformation"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/129 | Question: Given a string **s**, consider all its repeated substrings: that is, the (continuous) substrings of **s** that appear 2 or more times in **s**. These appearances may overlap. Return any one of the possible longest repeated substrings. If **s** does not contain repeated substrings, then the answer is "";
Pleas... | [
"assert candidate(\"banana\")==\"ana\"",
"assert candidate(\"abcd\")==\"\""
] | def test_run(content1):
return SN_RST(content1).Repeated_substring() | test_run | assert candidate([["class RST", "def __init__(self, s)", "class SN_RST(RST)", "super().__init__(s)", "def Repeated_substring"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/130 | Question: Given a word array **words**, each word is composed of lowercase English letters. If we can add exactly one letter anywhere in **wordA** without changing the order of other characters to make it become **wordB**, then we consider **wordA** to be the predecessor of **wordB**. For example, **abc** is the predec... | [
"assert candidate([\"a\",\"b\",\"ba\",\"bca\",\"bda\",\"bdca\"])==4",
"assert candidate([\"xbc\",\"pcxbcf\",\"xb\",\"cxbc\",\"pcxbc\"])==5",
"assert candidate([\"abcd\",\"dbqca\"])==1"
] | def test_run(content1):
return SN_FCA(content1).Form_chain() | test_run | assert candidate([["class FCA", "def __init__(self, words)", "class SN_FCA(FCA)", "super().__init__(words)", "def Form_chain"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/131 | Question: There is a pile of stones, represented by an integer array **stones**. Where stones[i] represents the weight of the i-th stone. Each round, select any two stones from it and crush them together. Suppose the weights of the stones are **x** and **y**, and x <= y. Then the possible results of crushing are as fol... | [
"assert candidate([2,7,4,1,8,1])==1",
"assert candidate([31,26,33,21,40])==5"
] | def test_run(content1):
return SN_MWG(content1).Minimum_weight() | test_run | assert candidate([["class MWG", "def __init__(self, stones)", "class SN_MWG(MWG)", "super().__init__(stones)", "def Minimum_weight"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/132 | Question: Given a positive integer array **arr** (which may contain duplicate elements), please return the maximum arrangement that is lexicographically smaller than **arr** and can be obtained by one swap (swapping the positions of two numbers arr[i] and arr[j]). If such operation is not possible, please return the or... | [
"assert candidate([3,2,1])==[3,1,2]",
"assert candidate([1,1,5])==[1,1,5]",
"assert candidate([1,9,4,6,7])==[1,7,4,6,9]"
] | def test_run(content1):
return SN_OEH(content1).One_exchange() | test_run | assert candidate([["class OEH", "def __init__(self, arr)", "class SN_OEH(OEH)", "super().__init__(arr)", "def One_exchange"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/133 | Question: In a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i]. Please rearrange these barcodes so that no two adjacent barcodes are the same. You can return any answer that meets this requirement, and it is guaranteed that an answer exists;
Please create a class **ABD** in Python based on ... | [
"assert candidate([1,1,1,2,2,2])==[2,1,2,1,2,1]",
"assert candidate([1,1,1,1,2,2,3,3])==[1,3,1,3,2,1,2,1]"
] | def test_run(content1):
return SN_ABD(content1).Adjacent_barcodes() | test_run | assert candidate([["class ABD", "def __init__(self, barcodes)", "class SN_ABD(ABD)", "super().__init__(barcodes)", "def Adjacent_barcodes"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/134 | Question: Given two strings of equal length, **s1** and **s2**, and another string, baseStr, where s1[i] and s2[i] are a pair of equivalent characters. For example, if s1 = **abc** and s2 = **cde**, then 'a' == 'c', 'b' == 'd', and 'c' == 'e'. Equivalent characters follow the general rules of any equivalence relation:
... | [
"assert candidate(\"parker\",\"morris\",\"parser\")==\"makkek\"",
"assert candidate(\"hello\",\"world\",\"hold\")==\"hdld\"",
"assert candidate(\"leetcode\",\"programs\",\"sourcecode\")==\"aauaaaaada\""
] | def test_run(content1,content2,content3):
return SN_EST(content1,content2,content3).Equivalent_String() | test_run | assert candidate([["class EST", "def __init__(self, s1)", "class SN_EST(EST)", "def __init__(self, s1, s2, baseStr)", "super().__init__(s1)", "def Equivalent_String"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/135 | Question: Given an m x n matrix **matrix**, you can select any number of columns from it and flip each cell on it. (That is, after flipping, the value of the cell changes from 0 to 1, or from 1 to 0.) Return the maximum number of rows where all values in the row are equal after some flips;
Please create a class **MRW**... | [
"assert candidate([[0,1],[1,1]])==1",
"assert candidate([[0,1],[1,0]])==2",
"assert candidate([[0,0,0],[0,0,1],[1,1,0]])==2"
] | def test_run(content1):
return SN_MRW(content1).Maximum_rows() | test_run | assert candidate([["class MRW", "def __init__(self, matrix)", "class SN_MRW(MRW)", "super().__init__(matrix)", "def Maximum_rows"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/136 | Question: Given two numbers **arr1** and **arr2** in base -2, return the result of their addition;
Please create a class named **ANS** in Python based on the above question, with the attribute **arr1**. Then create another class named **SN_ANS**, which inherits from the **ANS** class, and adds the attribute **arr2**, a... | [
"assert candidate([1,1,1,1,1],[1,0,1])==[1,0,0,0,0]",
"assert candidate([0],[0])==[0]",
"assert candidate([0],[1])==[1]"
] | def test_run(content1,content2):
return SN_ANS(content1,content2).Adding_Numbers() | test_run | assert candidate([["class ANS", "def __init__(self, arr1)", "class SN_ANS(ANS)", "def __init__(self, arr1, arr2)", "super().__init__(arr1)", "def Adding_Numbers"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/137 | Question: Given a **matrix** and a **target** value, return the number of non-empty submatrices whose sum of elements equals the target value;
Please create a class **ESI** in Python language based on the above question, with the attribute **matrix**; then create another class **SN_ESI**, inheriting from the **ESI** cl... | [
"assert candidate([[0,1,0],[1,1,1],[0,1,0]],0)==4",
"assert candidate([[1,-1],[-1,1]],0)==5",
"assert candidate([[904]],0)==0"
] | def test_run(content1,content2):
return SN_ESI(content1,content2).empty_submatrix() | test_run | assert candidate([["class ESI", "def __init__(self, matrix)", "class SN_ESI(ESI)", "def __init__(self, matrix, target)", "super().__init__(matrix)", "def empty_submatrix"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/138 | Question: You have a set of movable type **tiles**, each of which is engraved with a letter tiles[i]. Return the number of non-empty letter sequences you can print;
Please create a class **LSQ** based on the above question, with the attribute **tiles** using Python language; then create another class **SN_LSQ**, inheri... | [
"assert candidate(\"AAB\")==8",
"assert candidate(\"AAABBC\")==188",
"assert candidate(\"V\")==1"
] | def test_run(content1):
return SN_LSQ(content1).letter_sequence() | test_run | assert candidate([["class LSQ", "def __init__(self, tiles)", "class SN_LSQ(LSQ)", "super().__init__(tiles)", "def letter_sequence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/139 | Question: Return the subsequence of **s** with the smallest lexicographical order, which contains all distinct characters of **s** and only contains them once;
Based on the above question, create a class **SSU** in Python language with the attribute **s**. Then create another class **SN_SSU**, which inherits from the *... | [
"assert candidate(\"bcabc\")==\"abc\"",
"assert candidate(\"cbacdcbc\")==\"acdb\""
] | def test_run(content1):
return SN_SSU(content1).smallest_subsequence() | test_run | assert candidate([["class SSU", "def __init__(self, s)", "class SN_SSU(SSU)", "super().__init__(s)", "def smallest_subsequence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/140 | Question: We have a set of **n** items. Two integer arrays, **values** and **labels**, are given, where the value and label of the i-th element are values[i] and labels[i] respectively. Two more integers, **numWanted** and **useLimit**, are also given. We are to select a subset **s** from the **n** elements such that:
... | [
"assert candidate([5,4,3,2,1],[1,1,2,2,3],3,1)==9",
"assert candidate([5,4,3,2,1],[1,3,3,3,2],3,2)==12",
"assert candidate([9,8,8,7,6],[0,0,0,1,1],3,1)==16"
] | def test_run(content1,content2,content3,content4):
return SN_MSR(content1,content2,content3,content4).Maximum_score() | test_run | assert candidate([["class MSR", "def __init__(self, values)", "class SN_MSR(MSR)", "def __init__(self, values, labels, numWanted, useLimit)", "super().__init__(values)", "def Maximum_score"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/141 | Question: Given an n x n binary matrix **grid**, return the length of the shortest unobstructed path in the matrix. If such a path does not exist, return -1;
Based on the above question, please create a **UPT** class in Python with a **grid** attribute; then create a **SN_UPT** class that inherits the **UPT** class, an... | [
"assert candidate([[0,1],[1,0]])==2",
"assert candidate([[0,0,0],[1,1,0],[1,1,0]])==4",
"assert candidate([[1,0,0],[1,1,0],[1,1,0]])==-1"
] | def test_run(content1):
return SN_UPT(content1).Unobstructed_path() | test_run | assert candidate([["class UPT", "def __init__(self, grid)", "class SN_UPT(UPT)", "super().__init__(grid)", "def Unobstructed_path"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/142 | Question: Given two strings **str1** and **str2**, return the shortest string that has both **str1** and **str2** as subsequences;
Please create a class **SSI** in Python, which has the attribute **str1**. Then create another class **SN_SSI** that inherits from the **SSI** class, and add the attribute **str2**, as well... | [
"assert candidate(\"abac\",\"cab\")==\"cabac\"",
"assert candidate(\"aaaaaaaa\",\"aaaaaaaa\")==\"aaaaaaaa\""
] | def test_run(content1,content2):
return SN_SSI(content1,content2).Shortest_string() | test_run | assert candidate([["class SSI", "def __init__(self, str1)", "class SN_SSI(SSI)", "def __init__(self, str1, str2)", "super().__init__(str1)", "def Shortest_string"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/143 | Question: Initially, there are **capacity** empty seats on the bus. The bus can only travel in one direction (that is, it is not allowed to turn around or change direction). Given the integer **capacity** and an array **trips**, trip[i] = [numPassengers_i, from_i, to_i] indicates that there are **numPassengers_i** pass... | [
"assert candidate([[2,1,5],[3,3,7]],4)==False",
"assert candidate([[2,1,5],[3,3,7]],5)==True"
] | def test_run(content1,content2):
return SN_PPG(content1,content2).Pick_passengers() | test_run | assert candidate([["class PPG", "def __init__(self, trips)", "class SN_PPG(PPG)", "def __init__(self, trips, capacity)", "super().__init__(trips)", "def Pick_passengers"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/144 | Question: Given a mountain array **mountainArr**, please return the smallest index **index** that makes mountainArr.get(index) equal to **target**. If there is no such index **index**, please return -1. What is a mountain array? If array **A** is a mountain array, then it satisfies the following conditions:
1. A.length... | [
"assert candidate([1,2,3,4,5,3,1],3)==2",
"assert candidate([0,1,2,4,2,1],3)==-1"
] | def test_run(content1,content2):
return SN_MAR(content1,content2).Mountain_array() | test_run | assert candidate([["class MAR", "def __init__(self, array)", "class SN_MAR(MAR)", "def __init__(self, array, target)", "super().__init__(array)", "def Mountain_array"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/145 | Question: Given a boolean expression **expression** in string form, return the result of the operation. A boolean expression is an expression whose result is either True or False. Valid expressions must follow the following conventions:
1. 't', the operation result is True; 2. 'f', the operation result is False; 3. '!(... | [
"assert candidate(\"&(|(f))\")==False",
"assert candidate(\"|(f,f,f,t)\")==True",
"assert candidate(\"!(&(f,t))\")==True"
] | def test_run(content1):
return SN_BLS(content1).Booleans() | test_run | assert candidate([["class BLS", "def __init__(self, expression)", "class SN_BLS(BLS)", "super().__init__(expression)", "def Booleans"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/146 | Question: Here we have **n** flights, numbered from 1 to **n**. There is a flight booking sheet **bookings**. The i-th booking record in the sheet, bookings[i]=[firsti,lasti,seatsi], means that **seatsi** seats have been booked on each flight from **firsti** to **lasti** (including **firsti** and **lasti**). Please ret... | [
"assert candidate([[1,2,10],[2,3,20],[2,5,25]],5)==[10,55,45,25,25]",
"assert candidate([[1,2,10],[2,2,15]],2)==[10,25]"
] | def test_run(content1,content2):
return SN_RSA(content1,content2).Reserved_seats() | test_run | assert candidate([["class RSA", "def __init__(self, bookings)", "class SN_RSA(RSA)", "def __init__(self, bookings, n)", "super().__init__(expression)", "def Reserved_seats"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/147 | Question: Given a work schedule **hours**, which records the daily working hours of an employee. We consider that if the working hours of an employee in a day exceed 8 hours, then this day is a tiring day. The so-called good performance period means that during this period, the number of tiring days is strictly greater... | [
"assert candidate([9,9,6,0,6,6,9])==3",
"assert candidate([6,6,6])==0"
] | def test_run(content1):
return SN_PWL(content1).Performing_well() | test_run | assert candidate([["class PWL", "def __init__(self, hours)", "class SN_PWL(PWL)", "super().__init__(hours)", "def Performing_well"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/148 | Question: As a project manager, you have planned a list of required skills **req_skills**, and intend to select some people from the list of alternative personnel **people** to form a **necessary team** (the alternative personnel numbered **i**, people[i], has a list of skills that this alternative personnel masters). ... | [
"assert candidate([\"java\",\"nodejs\",\"reactjs\"],[[\"java\"],[\"nodejs\"],[\"nodejs\",\"reactjs\"]])==[0,2]",
"assert candidate([\"algorithms\",\"math\",\"java\",\"reactjs\",\"csharp\",\"aws\"],[[\"algorithms\",\"math\",\"java\"],[\"algorithms\",\"math\",\"reactjs\"],[\"java\",\"csharp\",\"aws\"],[\"reactjs\",... | def test_run(content1,content2):
return SN_NTM(content1,content2).Necessary_team() | test_run | assert candidate([["class NTM", "def __init__(self, req_skills)", "class SN_NTM(NTM)", "def __init__(self, req_skills, people)", "super().__init__(req_skills)", "def Necessary_team"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/149 | Question: Given an integer **n**, which is the number of nodes in a directed graph, where the nodes are labeled from 0 to n-1. Each edge in the graph is either red or blue, and there may be self-loops or parallel edges. Given two arrays **redEdges** and **blueEdges**, where:
1. redEdges[i]=[a_i,b_i] represents that the... | [
"assert candidate(3,[[0,1],[1,2]],[])==[0,1,-1]",
"assert candidate(3,[[0,1]],[[2,1]])==[0,1,-1]"
] | def test_run(content1,content2,content3):
return SN_AAR(content1,content2,content3).Alternating_appearance() | test_run | assert candidate([["class AAR", "def __init__(self, n)", "class SN_AAR(AAR)", "def __init__(self, n, red_edges, blue_edges)", "super().__init__(n)", "def Alternating_appearance"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/150 | Question: Given two integer arrays of equal length, return the maximum value of the following expression: |arr1[i]-arr1[j]|+|arr2[i]-arr2[j]|+|i-j| where the indices **i**, **j** satisfy 0<=i,j<arr1.length;
Based on the above question, please create a class **MES** in Python, which has the attribute **arr1**. Then crea... | [
"assert candidate([1,2,3,4],[-1,4,5,6])==13",
"assert candidate([1,-2,-5,0,10],[0,-2,-1,-7,-4])==20"
] | def test_run(content1,content2):
return SN_MES(content1,content2).Maximum_expression() | test_run | assert candidate([["class MES", "def __init__(self, arr1)", "class SN_MES(MES)", "def __init__(self, arr1, arr2)", "super().__init__(arr1)", "def Maximum_expression"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/151 | Question: Given a two-dimensional **grid** composed of several 0s and 1s, please find the largest square sub-grid whose boundaries are all composed of 1s, and return the number of elements in the sub-grid. If it does not exist, return 0;
Please create a class **SSR** with the property **grid** in Python based on the ab... | [
"assert candidate([[1,1,1],[1,0,1],[1,1,1]])==9",
"assert candidate([[1,1,0,0]])==1"
] | def test_run(content1):
return SN_GGG(content1).Square_subgrid() | test_run | assert candidate([["class SSR", "def __init__(self, grid)", "class SN_GGG(GGG)", "super().__init__(grid)", "def Square_subgrid"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/152 | Question: Alice and Bob continue their stone game. Many piles of stones are lined up, each pile has a positive integer number of stones piles[i]. The game is decided by who has the most stones in their hands. Alice and Bob take turns, with Alice starting first. Initially, M=1. In each player's turn, the player can take... | [
"assert candidate([2,7,9,4,4])==10",
"assert candidate([1,2,3,4,5,100])==104"
] | def test_run(content1):
return SN_SGA(content1).Stone_Game() | test_run | assert candidate([["class SGA", "def __init__(self, piles)", "class SN_SGA(SGA)", "super().__init__(piles)", "def Stone_Game"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/153 | Question: Given two strings **text1** and **text2**, return the length of the longest common subsequence of these two strings. If there is no common subsequence, return 0. A subsequence of a string is a new string that is formed by deleting some characters (or no characters) from the original string without changing th... | [
"assert candidate(\"abcde\",\"ace\")==3",
"assert candidate(\"abc\",\"abc\")==3",
"assert candidate(\"abc\",\"def\")==0"
] | def test_run(content1,content2):
return SN_SSN(content1,content2).Shared_subsequences() | test_run | assert candidate([["class SSN", "def __init__(self, text1)", "class SN_SSN(SSN)", "def __init__(self, text1, text2)", "super().__init__(text1)", "def Shared_subsequences"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/154 | Question: Given an integer array **nums**, each operation will select an element and decrease its value by 1. If one of the following conditions is met, then array **A** is a zigzag array:
1. Each element corresponding to an even index is greater than its adjacent elements, i.e., A[0]>A[1]<A[2]>A[3]<A[4]>...;
2. Or, e... | [
"assert candidate([1,2,3])==2",
"assert candidate([9,6,1,6,2])==4"
] | def test_run(content1):
return SN_JAR(content1).Jagged_array() | test_run | assert candidate([["class JAR", "def __init__(self, nums)", "class SN_JAR(JAR)", "super().__init__(nums)", "def Jagged_array"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/155 | Question: You will be given a string **text**, which should be divided into **k** substrings (subtext1, subtext2,…,subtextk), with the following requirements:
1. Each **subtexti** is a non-empty string;
2. The concatenation of all substrings equals to **text** (i.e., subtext1+subtext2+...+subtextk==text);
3. For all ... | [
"assert candidate(\"ghiabcdefhelloadamhelloabcdefghi\")==7",
"assert candidate(\"merchant\")==1",
"assert candidate(\"antaprezatepzapreanta\")==11"
] | def test_run(content1):
return SN_ESI(content1).empty_string() | test_run | assert candidate([["class ESI", "def __init__(self, text)", "class SN_ESI(ESI)", "super().__init__(text)", "def empty_string"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/156 | Question: Here we have **n** identical dice, each with **k** faces, numbered from 1 to **k**. Given three integers **n**, **k**, and **target**, return the number of possible ways (out of a total of k^n ways) to roll the dice so that the sum of the numbers facing up equals **target**;
Based on the above question, pleas... | [
"assert candidate(1,6,3)==1",
"assert candidate(2,6,7)==6",
"assert candidate(30,30,500)==222616187"
] | def test_run(content1,content2,content3):
return SN_FUP(content1,content2,content3).face_up() | test_run | assert candidate([["class FUP", "def __init__(self, n)", "class SN_FUP(FUP)", "def __init__(self, n, k, target)", "super().__init__(n)", "def face_up"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/157 | Question: If all characters in a string are the same, then the string is a single-character repeated string. Given a string **text**, you can only swap two characters once or do nothing, and then get some single-character repeated substrings. Return the length of the longest substring;
Please create a **DSN** class in ... | [
"assert candidate(\"ababa\")==3",
"assert candidate(\"aaabaaa\")==6",
"assert candidate(\"aaabbaaa\")==4",
"assert candidate(\"aaaaa\")==5",
"assert candidate(\"abcdef\")==1"
] | def test_run(content1):
return SN_DSN(content1).Duplicate_string() | test_run | assert candidate([["class DSN", "def __init__(self, text)", "class SN_DSN(DSN)", "super().__init__(text)", "def Duplicate_string"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/158 | Question: You currently have a **grid** of size n x n in your hand, with each cell marked with 0 and 1. Here, 0 represents the ocean, and 1 represents the **land**. Please find an ocean cell where the distance to the nearest land cell is the maximum, and return this distance. If the grid only contains land or ocean, pl... | [
"assert candidate([[1,0,1],[0,0,0],[1,0,1]])==2",
"assert candidate([[1,0,0],[0,0,0],[0,0,0]])==4"
] | def test_run(content1):
return SN_OCL(content1).Ocean_Cell() | test_run | assert candidate([["class OCL", "def __init__(self, grid)", "class SN_OCL(OCL)", "super().__init__(grid)", "def Ocean_Cell"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/159 | Question: Given a string **s**, find all its substrings and sort them in lexicographical order, return the last substring;
Based on the above question, create a class **LAM** in Python language with the attribute **s**; then create another class **SN_LAM**, inheriting from the **LAM** class, and add a public function *... | [
"assert candidate(\"abab\")==\"bab\"",
"assert candidate(\"leetcode\")==\"tcode\""
] | def test_run(content1):
return SN_LAM(content1).Lexicographic_arrangement() | test_run | assert candidate([["class LAM", "def __init__(self, s)", "class SN_LAM(LAM)", "super().__init__(s)", "def Lexicographic_arrangement"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/160 | Question: A transaction may be invalid under the following two circumstances:
1. The transaction amount exceeds $1000; 2. Or, it is not more than 60 minutes (including 60 minutes) apart from another transaction with the same name in another city; Given the string array transaction list **transactions**. Each transactio... | [
"assert candidate([\"alice,20,800,mtv\",\"alice,50,100,beijing\"])==[\"alice,20,800,mtv\",\"alice,50,100,beijing\"]",
"assert candidate([\"alice,20,800,mtv\",\"alice,50,1200,mtv\"])==[\"alice,50,1200,mtv\"]",
"assert candidate([\"alice,20,800,mtv\",\"bob,50,1200,mtv\"])==[\"bob,50,1200,mtv\"]"
] | def test_run(content1):
return SN_TLI(content1).Transaction_List() | test_run | assert candidate([["class TLI", "def __init__(self, transactions)", "class SN_TLI(TLI)", "super().__init__(transactions)", "def Transaction_List"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/161 | Question: Given two integer arrays **arr1** and **arr2**, return the minimum number of operations required to make **arr1** strictly increasing (possibly 0). In each operation, you can select an index from both **arr1** and **arr2**, respectively **i** and **j**, where 0<=i<arr1.length and 0<=j<arr2.length, and then pe... | [
"assert candidate([1,5,3,6,7],[1,3,2,4])==1",
"assert candidate([1,5,3,6,7],[4,3,1])==2",
"assert candidate([1,5,3,6,7],[1,6,3,3])==-1"
] | def test_run(content1,content2):
return SN_SII(content1,content2).Strictly_Increasing() | test_run | assert candidate([["class SII", "def __init__(self, arr1)", "class SN_SII(SII)", "def __init__(self, arr1, arr2)", "super().__init__(arr1)", "def Strictly_Increasing"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/162 | Question: Given a string **s** (containing only lowercase English letters and parentheses), please reverse the string in each pair of matching parentheses from the inside out in order, and return the final result;
Based on the above question, please create a class **MBC** in Python language with the attribute **s**. Th... | [
"assert candidate(\"(abcd)\")==\"dcba\"",
"assert candidate(\"(u(love)i)\")==\"iloveu\"",
"assert candidate(\"(ed(et(oc))el)\")==\"leetcode\"",
"assert candidate(\"a(bcdefghijkl(mno)p)q\")==\"apmnolkjihgfedcbq\""
] | def test_run(content1):
return SN_MBC(content1).Match_Brace() | test_run | assert candidate([["class MBC", "def __init__(self, s)", "class SN_MBC(MBC)", "super().__init__(s)", "def Match_Brace"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/163 | Question: Given an integer array **arr** and an integer **k**, modify the array by repeating **k** times. Return the sum of the largest subarray in the modified array;
Please create a class **SSA** in Python based on the above question, with the attribute **arr**. Then create a class **SN_SSA** that inherits from the *... | [
"assert candidate([1,2],3)==9",
"assert candidate([1,-2,1],5)==2",
"assert candidate([-1,-2],7)==0"
] | def test_run(content1,content2):
return SN_SSA(content1,content2).Sum_subarrays() | test_run | assert candidate([["class SSA", "def __init__(self, arr)", "class SN_SSA(SSA)", "def __init__(self, arr, k)", "super().__init__(k)", "def Sum_subarrays"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/164 | Question: Given four integers: **n**, **a**, **b**, **c**, please design an algorithm to find the n-th ugly number;
Based on the above question, create a class **UNB** in Python, with the attribute **n**; then create another class **SN_UNB**, inheriting from the **UNB** class, and add three attributes **a**, **b** and ... | [
"assert candidate(3,2,3,5)==4",
"assert candidate(4,2,3,4)==6",
"assert candidate(5,2,11,13)==10",
"assert candidate(1000000000,2,217983653,336916467)==1999999984"
] | def test_run(content1,content2,content3,content4):
return SN_UNB(content1,content2,content3,content4).Ugly_number() | test_run | assert candidate([["class UNB", "def __init__(self, n)", "class SN_UNB(UNB)", "def __init__(self, n, a, b, c)", "super().__init__(n)", "def Ugly_number"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/165 | Question: Given a string **s** and some index pairs array **pairs** in the string, where pairs[i]=[a,b] represents two indexes in the string (numbered from 0). You can swap the characters at any pair of indexes in pairs any number of times. Return the lexicographically smallest string that **s** can become after severa... | [
"assert candidate(\"dcab\",[[0,3],[1,2]])==\"bacd\"",
"assert candidate(\"dcab\",[[0,3],[1,2],[0,2]])==\"abcd\"",
"assert candidate(\"cba\",[[0,1],[1,2]])==\"abc\""
] | def test_run(content1,content2):
return SN_DMM(content1,content2).Dictionary_minimum() | test_run | assert candidate([["class DMM", "def __init__(self, s)", "class SN_DMM(DMM)", "def __init__(self, s, pairs)", "super().__init__(s)", "def Dictionary_minimum"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/166 | Question: Given two strings of equal length, **s** and **t**. Changing the i-th character in **s** to the i-th character in **t** requires a cost of |s[i]-t[i]| (the cost could be 0), which is the absolute difference of the ASCII values of the two characters. The maximum budget for changing the string is **maxCost**. D... | [
"assert candidate(\"abcd\",\"bcdf\",3)==3",
"assert candidate(\"abcd\",\"cdef\",3)==1",
"assert candidate(\"abcd\",\"acde\",0)==1"
] | def test_run(content1,content2,content3):
return SN_MBG(content1,content2,content3).Maximum_budget() | test_run | assert candidate([["class MBG", "def __init__(self, s)", "class SN_MBG(MBG)", "def __init__(self, s, t, maxCost)", "super().__init__(s)", "def Maximum_budget"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/167 | Question: Given a string **s**, the **k** times repeated item deletion operation will select **k** adjacent and equal letters from **s** and delete them, connecting the left and right sides of the deleted string. You need to repeatedly perform such deletion operations on **s** indefinitely until it can no longer contin... | [
"assert candidate(\"abcd\",2)==\"abcd\"",
"assert candidate(\"deeedbbcccbdaa\",3)==\"aa\"",
"assert candidate(\"pbbcggttciiippooaais\",2)==\"ps\""
] | def test_run(content1,content2):
return SN_DOT(content1,content2).Delete_Operation() | test_run | assert candidate([["class DOT", "def __init__(self, s)", "class SN_DOT(DOT)", "def __init__(self, s, k)", "super().__init__(s)", "def Delete_Operation"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
OOP/168 | Question: Given an integer array **arr** and an integer **difference**, please find and return the length of the longest arithmetic subsequence in **arr**, where the difference between adjacent elements equals **difference**;
Based on the above question, please create a class **ESQ** in Python, which has the attribute ... | [
"assert candidate([1,2,3,4],1)==4",
"assert candidate([1,3,5,7],1)==1",
"assert candidate([1,5,7,8,5,3,4,2,1],-2)==4"
] | def test_run(content1,content2):
return SN_ESQ(content1,content2).Equidistant_subsequence() | test_run | assert candidate([["class ESQ", "def __init__(self, arr)", "class SN_ESQ(ESQ)", "def __init__(self, arr, difference)", "super().__init__(arr)", "def Equidistant_subsequence"]]) == True | def matching_function(content):
def run_match(text):
for task in text:
if task not in str_content:
return False
return True
len_cont = len(content)
if len_cont==1 and run_match(content[0]) == True:
return True
elif (len_cont==2 and run_match(content[0]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.