Datasets:

callensxavier
/

laya-coding-curriculum-78k

text string	choice_label string	has_noul bool	has_choice bool	has_score bool	dataset_id string	pillar int64
PROBLEM: There are $n$ candy boxes in front of Tania. The boxes are arranged in a row from left to right, numbered from $1$ to $n$. The $i$-th box contains $r_i$ candies, candies have the color $c_i$ (the color can take one of three values — red, green, or blue). All candies inside a single box have the same color (a...	fail	true	true	true	code_rm_unittest	1
PROBLEM: If you visit Aizu Akabeko shrine, you will find a unique paper fortune on which a number with more than one digit is written. Each digit ranges from 1 to 9 (zero is avoided because it is considered a bad omen in this shrine). Using this string of numeric values, you can predict how many years it will take bef...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You have a deck of $n$ cards, and you'd like to reorder it to a new one. Each card has a value between $1$ and $n$ equal to $p_i$. All $p_i$ are pairwise distinct. Cards in a deck are numbered from bottom to top, i. e. $p_1$ stands for the bottom card, $p_n$ is the top card. In each step you pick some intege...	fail	true	true	true	code_rm_unittest	1
PROBLEM: The number obtained by multiplying 1 by 2, 3, 5 several times (0 or more times) is called the Hamming numbers. For example * 1 * 1 x 2 x 2 = 4 * 1 x 2 x 2 x 3 x 5 x 5 = 300 Etc. are humming numbers, but 11, 13, 14 etc. are not humming numbers. All humming numbers are divisible by a power of 60 (for exampl...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a number s(in string form). Find the Smallest number (Not leading Zeros) which can be obtained by rearranging the digits of given number. Example 1: Input: s = "846903" Output: 304689 Explanation: 304689 is the smallest number by rearranging the digits. Example 2: Input: s = "55010" Output: 10055 Expla...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Dilpreet wants to paint his dog's home that has n boards with different lengths. The length of i^{th }board is given by arr[i] where arr[] is an array of n integers. He hired k painters for this work and each painter takes 1 unit time to paint 1 unit of the board. The problem is to find the minimum time to ge...	fail	true	true	true	code_rm_unittest	1
PROBLEM: An anagram is the result of rearranging the letters of a word to produce a new word. Note: anagrams are case insensitive Complete the function to return `true` if the two arguments given are anagrams of each other; return `false` otherwise. ## Examples * `"foefet"` is an anagram of `"toffee"` * `...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Arkady decides to observe a river for n consecutive days. The river's water level on each day is equal to some real value. Arkady goes to the riverside each day and makes a mark on the side of the channel at the height of the water level, but if it coincides with a mark made before, no new mark is created. Th...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Tom has finally taken over the business empire and now looking for a new Name of the business to make a new start. Joe (Tom's dear friend) suggested a string $S$ consisting of Uppercase and lowercase letters Tom wants to make some changes as per the following criteria: 1) String should $not$ have an...	fail	true	true	true	code_rm_unittest	1
PROBLEM: When Chef was born, his parents took him to the famous monk Doctor Strange to know whether he will land himself in heaven after his life or not. According to Strange, Chef will live for $L$ years in total. If he wants to go to heaven, he must spend at least $50\%$ of his life years doing good deeds. He also sh...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a string 's'. The task is to find the smallest window length that contains all the characters of the given string at least one time. For eg. A = aabcbcdbca, then the result would be 4 as of the smallest window will be dbca. Example 1: Input : "AABBBCBBAC" Output : 3 Explanation : Sub-string -> "BAC" Ex...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given an array A of N integers A_{1}, A_{2}, \ldots, A_{N}. Determine if there are two [permutations] B and C of this array, for which the following condition is satisfied: * There doesn't exist a pair of integers (i, j) such that 1 ≤ i ≤ j ≤ N and (i, j) \neq (1, N), for which the subarray B[i:j] is ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: For some reason in many American cartoons anvils fall from time to time onto heroes' heads. Of course, safes, wardrobes, cruisers, planes fall sometimes too... But anvils do so most of all. Anvils come in different sizes and shapes. Quite often they get the hero stuck deep in the ground. But have you ever tho...	fail	true	true	true	code_rm_unittest	1
PROBLEM: # Esolang Interpreters #3 - Custom Paintfuck Interpreter ## About this Kata Series "Esolang Interpreters" is a Kata Series that originally began as three separate, independent esolang interpreter Kata authored by [@donaldsebleung](http://codewars.com/users/donaldsebleung) which all shared a similar format an...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given an array $a_1, a_2, \dots, a_n$. You can perform the following operation any number of times: Choose a pair of two neighboring equal elements $a_i = a_{i + 1}$ (if there is at least one such pair). Replace them by one element with value $a_i + 1$. After each such operation, the length of the ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: There are players standing in a row each player has a digit written on their T-Shirt (multiple players can have the same number written on their T-Shirt). You have to select a group of players, note that players in this group should be standing in $\textbf{consecutive fashion}$. For example second player of...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given an array arr[] which contains data of N nodes of Complete Binary tree in level order fashion. The task is to print the level order traversal in sorted order. Example 1: Input: N = 7 arr[] = {7 6 5 4 3 2 1} Output: 7 5 6 1 2 3 4 Explanation: The formed Binary Tree is: 7 / \ ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given the prices of stock for n number of days. every ith day tell the price of the stock on that day.find the maximum profit that you can make by buying and selling stock any number of times as you can't proceed with other transactions if you hold any transaction. Example: Input: n = 7 prices = [1,2,3...	fail	true	true	true	code_rm_unittest	1
PROBLEM: <image> Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes. In order to have such a nested structure, the body of each ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has A_i gold coins, B_i silver coins and C_i bronze coins. Snuke is thinking of getting gold coins from X of those people, silver coins from Y of the people and bronze coins from Z of the people. It is not possible to get two or more diff...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more interesting thing to do. First, he thinks of some set of circles on a plane, and then tries to choose a beautiful set of points, such that there is at least one point from the set inside or on the border of each...	fail	true	true	true	code_rm_unittest	1
PROBLEM: In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning time duration per Teemo's attacking, you need to output the total time that Ashe is in poisoned condition. You m...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Implement a function called makeAcronym that returns the first letters of each word in a passed in string. Make sure the letters returned are uppercase. If the value passed in is not a string return 'Not a string'. If the value passed in is a string which contains characters other than spaces and alphabet l...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are the principal of the Cake school in chefland and today is your birthday. You want to treat each of the children with a small cupcake which is made by you. But there is a problem, You don't know how many students are present today. The students have gathered of the morning assembly in $R$ rows and $C$ c...	fail	true	true	true	code_rm_unittest	1
PROBLEM: The EEE classes are so boring that the students play games rather than paying attention during the lectures. Harsha and Dubey are playing one such game. The game involves counting the number of anagramic pairs of a given string (you can read about anagrams from here). Right now Harsha is winning. Write a prog...	fail	true	true	true	code_rm_unittest	1
PROBLEM: There are N people standing in a row from west to east. Each person is facing east or west. The directions of the people is given as a string S of length N. The i-th person from the west is facing east if S_i = E, and west if S_i = W. You will appoint one of the N people as the leader, then command the rest of...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A string of '0's and '1's is monotone increasing if it consists of some number of '0's (possibly 0), followed by some number of '1's (also possibly 0.) We are given a string S of '0's and '1's, and we may flip any '0' to a '1' or a '1' to a '0'. Return the minimum number of flips to make S monotone increasing....	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given two values ‘a’ and ‘b’ that represent coefficients in “ax – by = 0”, find the smallest values of x and y that satisfy the equation. It may also be assumed that x > 0, y > 0, a > 0 and b > 0. Example 1: Input: a = 25, b = 35 Output: 7 5 Explaination: 257 - 355 = 0. And x = 7 and y = 5 are the least pos...	fail	true	true	true	code_rm_unittest	1
PROBLEM: When little Petya grew up and entered the university, he started to take part in АСМ contests. Later he realized that he doesn't like how the АСМ contests are organised: the team could only have three members (and he couldn't take all his friends to the competitions and distribute the tasks between the team me...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Nikit has to give a short contest of duration "n" minutes. The contest is divided into 2 sections-Easy and Hard. x and y marks will be awarded per problem for Easy and Hard respectively. Assume that he will take p minutes to solve an Easy problem and q minutes to solve a Hard problem successfully. There are a ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: # Solve For X You will be given an equation as a string and you will need to [solve for X](https://www.mathplacementreview.com/algebra/basic-algebra.php#solve-for-a-variable) and return x's value. For example: ```python solve_for_x('x - 5 = 20') # should return 25 solve_for_x('20 = 5 * x - 5') # should retu...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Write a function that takes an array/list of numbers and returns a number such that Explanation total([1,2,3,4,5]) => 48 1+2=3--\ 3+5 => 8 \ 2+3=5--/ \ == 8+12=>20\ ==>5+7=> 12 / \ 20+28 => 48 3+4=7--\ / == 12+16=>28/ 4+5=9--/ 7+9 => 16 / if total([...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A faro shuffle of a deck of playing cards is a shuffle in which the deck is split exactly in half and then the cards in the two halves are perfectly interwoven, such that the original bottom card is still on the bottom and the original top card is still on top. For example, faro shuffling the list ```python [...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given an array A of size N of integers. Your task is to find the sum of minimum and maximum element in the array. Example 1: Input: N = 5 A[] = {-2, 1, -4, 5, 3} Output: 1 Explanation: min = -4, max = 5. Sum = -4 + 5 = 1 Example 2: Input: N = 4 A[] = {1, 3, 4, 1} Output: 5 Explanation: min = 1, max = 4. Su...	fail	true	true	true	code_rm_unittest	1
PROBLEM: We have n cards with each card numbered from 1 to n. All cards are randomly shuffled. We are allowed only operation moveCard(n) which moves the card with value n to the top of the pile. You are required to find out the minimum number of moveCard() operations required to sort the cards in increasing order. Ex...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Write a method that will search an array of strings for all strings that contain another string, ignoring capitalization. Then return an array of the found strings. The method takes two parameters, the query string and the array of strings to search, and returns an array. If the string isn't contained in a...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Now, we'll try to solve a famous stack problem. You are given an array A of size N. You need to first push the elements of the array into a stack and then print minimum in the stack at each pop until stack becomes empty. Example 1: Input: N = 5 A = {1 2 3 4 5} Output: 1 1 1 1 1 Explanation: After pushing el...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Consider sequences \{A_1,...,A_N\} of length N consisting of integers between 1 and K (inclusive). There are K^N such sequences. Find the sum of \gcd(A_1, ..., A_N) over all of them. Since this sum can be enormous, print the value modulo (10^9+7). Here \gcd(A_1, ..., A_N) denotes the greatest common divisor of...	fail	true	true	true	code_rm_unittest	1
PROBLEM: There are two $n$-element arrays of integers, $A$ and $B$. Permute them into some $A^{\prime}$ and $B^{\prime}$ such that the relation $A^{\prime}[i]+B^{\prime}[i]\ge k$ holds for all $i$ where $0\leq i<n$. There will be $q$ queries consisting of $A$, $B$, and $k$. For each query, return YES if some permutat...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You're a statistics professor and the deadline for submitting your students' grades is tonight at midnight. Each student's grade is determined by their mean score across all of the tests they took this semester. You've decided to automate grade calculation by writing a function `calculate_grade()` that takes ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Today, Chef has a fencing job at hand and has to fence up a surface covering N$N$ points. To minimize his work, he started looking for an algorithm that had him fence the least amount of length. He came up with the Convex Hull algorithm, but soon realized it gave him some random shape to fence. However, Chef...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given two arrays a[] and b[] of size n and m respectively. The task is to find the number of elements in the union between these two arrays. Union of the two arrays can be defined as the set containing distinct elements from both the arrays. If there are repetitions, then only one occurrence of element should...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down. Moon cycle lasts 30 days. The size of the visible part of the moon (in Vity...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given an array $a$ of length $n$ consisting of zeros. You perform $n$ actions with this array: during the $i$-th action, the following sequence of operations appears: Choose the maximum by length subarray (continuous subsegment) consisting only of zeros, among all such segments choose the leftmost one...	fail	true	true	true	code_rm_unittest	1
PROBLEM: We all love the future president (or Führer or duce or sōtō as he could find them more fitting) donald trump, but we might fear that some of his many fans like John Miller or John Barron are not making him justice, sounding too much like their (and our as well, of course!) hero and thus risking to compromise h...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You probably know the "like" system from Facebook and other pages. People can "like" blog posts, pictures or other items. We want to create the text that should be displayed next to such an item. Implement a function `likes :: [String] -> String`, which must take in input array, containing the names of people...	fail	true	true	true	code_rm_unittest	1
PROBLEM: The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests! Heidi designed a series of increasingly difficult tasks for them to ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Jerry is a little mouse. He is trying to survive from the cat Tom. Jerry is carrying a parallelepiped-like piece of cheese of size A × B × C. It is necessary to trail this cheese to the Jerry's house. There are several entrances in the Jerry's house. Each entrance is a rounded hole having its own radius R. Cou...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given an undirected graph and a starting node, determine the lengths of the shortest paths from the starting node to all other nodes in the graph. If a node is unreachable, its distance is -1. Nodes will be numbered consecutively from $1$ to $n$, and edges will have varying distances or lengths. For example...	fail	true	true	true	code_rm_unittest	1
PROBLEM: John is new to Mathematics and does not know how to calculate GCD of numbers. So he wants you to help him in a few GCD calculations. John has a list A of numbers, indexed 1 to N. He wants to create another list B having N+1 numbers, indexed from 1 to N+1, and having the following property: GCD(B[i], B[i+1]) =...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given three integers $n, a, b$. Determine if there exists a permutation $p_1, p_2, \ldots, p_n$ of integers from $1$ to $n$, such that: There are exactly $a$ integers $i$ with $2 \le i \le n-1$ such that $p_{i-1} < p_i > p_{i+1}$ (in other words, there are exactly $a$ local maximums). There are exact...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A gene is represented as a string of length $n$ (where $n$ is divisible by $4$), composed of the letters $\mbox{A}$, $\mbox{C}$, $\textbf{T}$, and $\mbox{G}$. It is considered to be steady if each of the four letters occurs exactly $\frac{n}{4}$ times. For example, $\textbf{GACT}$ and $\textbf{AAGTGCCT}$ are ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Casimir has a string $s$ which consists of capital Latin letters 'A', 'B', and 'C' only. Each turn he can choose to do one of the two following actions: he can either erase exactly one letter 'A' and exactly one letter 'B' from arbitrary places of the string (these letters don't have to be adjacent); or he c...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Snuke found a random number generator. It generates an integer between 0 and 2^N-1 (inclusive). An integer sequence A_0, A_1, \cdots, A_{2^N-1} represents the probability that each of these integers is generated. The integer i (0 \leq i \leq 2^N-1) is generated with probability A_i / S, where S = \sum_{i=0}^{2...	fail	true	true	true	code_rm_unittest	1
PROBLEM: We have a distribution of probability of a discrete variable (it may have only integer values) ``` x P(x) 0 0.125 1 0.375 2 0.375 3 0.125 Total = 1.000 # The sum of the probabilities for all the possible values should be one (=1) ``` The mean, ```μ```, of the values of x is: ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Read problems statements in [Hindi], [Mandarin Chinese], [Russian], [Vietnamese], and [Bengali] as well. You are given an odd integer $N$ and two integer sequences $A_{1}, A_{2}, \ldots, A_{N}$ and $B_{1}, B_{2}, \ldots, B_{N}$. Your task is to reorder the elements of $B$, forming a new sequence $C_{1}, C_{2...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si. In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He chooses two numbers l and r (1 ≤ l ≤ r ≤ n) and each pair of ants with indi...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Little Elephant is playing a game with arrays. He is given an array A0, A1, ..., AN−1 of N integers. And then Q queries are given, each containing an integer K. He has to tell how many subarrays satisfy the condition: the function foo returns K when it is applied to the subarray. In this problem, a subarray i...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given 3 characters 'a', 'b', 'c'. Find the number of strings of length n that can be formed from these 3 characters. Given that : we can use ‘a’ as many times as we want, ‘b’ maximum once, and ‘c’ maximum twice. Example 1: Input: n = 2 Output: 8 Expalantion: There are total 8 possible strings and these are: ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A frog starts at the point 0. In his first turn, he can make a jump of 1 unit. Now for all consequent turns, if the frog is currently at a distance x (from the start), his jump will take him x units forward. Given a leaf at a distance N, you have to find if the frog can reach that leaf or not. Example 1: Inp...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a 2-D binary matrix of size n*m, where 0 represents an empty space while 1 represents a wall you cannot walk through. You are also given an integer k. You can walk up, down, left, or right. Given that you can remove up to k walls, return the minimum number of steps to walk from the top left corner (0, 0)...	fail	true	true	true	code_rm_unittest	1
PROBLEM: View Russian Translation Little pig Benny has just taken a shower. Now she is going to buy some gifts for her relatives. But the problem is that Benny doesn't know how to reach to the gift shop. Her friend Mike has created a special set of instructions for her. A set of instructions is a string which consist...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a string, find the longest substring which is palindrome in Linear time O(N). Input: The first line of input contains an integer T denoting the no of test cases . Then T test cases follow. The only line of each test case contains a string. Output: For each test case print the Longest Palindromic Substrin...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given a decimal representation of an integer $x$ without leading zeros. You have to perform the following reduction on it exactly once: take two neighboring digits in $x$ and replace them with their sum without leading zeros (if the sum is $0$, it's represented as a single $0$). For example, if $x = ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a dictionary of words and a pattern. Every character in the pattern is uniquely mapped to a character in the dictionary. Find all such words in the dictionary that match the given pattern. Example 1: Input: N = 4 dict[] = {abb,abc,xyz,xyy} pattern = foo Output: abb xyy Explanation: xyy and abb have the...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Silver Fox is fighting with N monsters. The monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i. Silver Fox can use bombs to attack the monsters. Using a bomb at the coordinate x decreases the healths of...	fail	true	true	true	code_rm_unittest	1
PROBLEM: One day Patrik met a magician.He asked magician for his magic pencil.So magician decided to give him magic pencil only if he correctely answers to his question. Magician gave him 3 numbers a, b and c and asked him to find the multiple of c which is closest to a^b.Help patrik to solve this problem and win ma...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Nauuo is a girl who loves drawing circles. One day she has drawn a circle and wanted to draw a tree on it. The tree is a connected undirected graph consisting of n nodes and n-1 edges. The nodes are numbered from 1 to n. Nauuo wants to draw a tree on the circle, the nodes of the tree should be in n distinct...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given a sorted array a of length n. For each i(0<=i<=n-1), you have to make all the elements of the array from index 0 till i equal, using minimum number of operations. In one operation you either increase or decrease the array element by 1. You have to return a list which contains the minimum number o...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a text, text. The task is to count the number of sentences and words in the text. Definition of a sentence :- Sentences are defined as contiguous space-separated strings of characters ending with a sentence punctuation (' . ', ' ! ' or ' ? ') or the last contiguous set of space-separated strings, even ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Vasya’s elder brother Petya loves playing computer games. In one of his favourite computer games Petya reached the final level where a fight with the boss take place. While playing the game Petya found spell scrolls and now he is about to use them. Let’s describe the way fighting goes on this level: 1) The b...	fail	true	true	true	code_rm_unittest	1
PROBLEM: The chef is trying to decode some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem. -----Input:----- - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a singl...	fail	true	true	true	code_rm_unittest	1
PROBLEM: King Tle4Ever of Time Limit Exceeded is really fascinated about Tic Tac Toe. He organizes a national level contest for Tic Tac Toe every year in Time Limit Exceeded. (Though I agree you need to be really stupid to loose a game of Tic Tac Toe but for the sake of question assume playing Tic Tac Toe for them is s...	fail	true	true	true	code_rm_unittest	1
PROBLEM: $n$ students attended the first meeting of the Berland SU programming course ($n$ is even). All students will be divided into two groups. Each group will be attending exactly one lesson each week during one of the five working days (Monday, Tuesday, Wednesday, Thursday and Friday), and the days chosen for the ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A palindrome is a string that is the same whether it is read from left to right or from right to left. Chota Bheem likes palindromes a lot. As a birthday gift he received two strings A and B. Now he is curious if there is a way to insert string B into string A so that the resulting string is a palindrome. You ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Now you can take online courses in the Berland State University! Polycarp needs to pass k main online courses of his specialty to get a diploma. In total n courses are availiable for the passage. The situation is complicated by the dependence of online courses, for each course there is a list of those that mu...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. Example: Input: 1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0 0 1 0 Output: 4 CODE:	fail	true	true	true	code_rm_unittest	1
PROBLEM: The sum of digits of a non-negative integer $a$ is the result of summing up its digits together when written in the decimal system. For example, the sum of digits of $123$ is $6$ and the sum of digits of $10$ is $1$. In a formal way, the sum of digits of $\displaystyle a=\sum_{i=0}^{\infty} a_i \cdot 10^i$, wh...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Read problems statements in Mandarin Chinese and Russian. You are given an array that consists of n integer numbers. You have to change at most K elements of this array, so that the resulting array will be a arithmetic progression. From all the possible arithmetic progressions, you should choose most beautif...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Consider the following well known rules: - A number is divisible by 3 if the sum of its digits is divisible by 3. Let's call '3' a "1-sum" prime - For 37, we take numbers in groups of threes from the right and check if the sum of these groups is divisible by 37. Example: 37 * 123456787 = 4567901119 => 4 + ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You will be given a two-dimensional array with row consisting values 0 or 1. A move consists of choosing any column or row, and toggling all the 0’s as 1’s and 1’s as 0’s. After making the required moves, every row represents a binary number and the score of the matrix will be sum of all the numbers repres...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Born a misinterpretation of [this kata](https://www.codewars.com/kata/simple-fun-number-334-two-beggars-and-gold/), your task here is pretty simple: given an array of values and an amount of beggars, you are supposed to return an array with the sum of what each beggar brings home, assuming they all take regula...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Given an unsorted array Arr of size N of positive integers. One number 'A' from set {1, 2,....,N} is missing and one number 'B' occurs twice in array. Find these two numbers. Example 1: Input: N = 2 Arr[] = {2, 2} Output: 2 1 Explanation: Repeating number is 2 and smallest positive missing number is 1. Exampl...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given a positive integer $x$. You can apply the following operation to the number: remove one occurrence of any digit in such a way that the resulting number does not contain any leading zeroes and is still a positive integer. For example, $10142$ can be converted to $1142$, $1042$, $1012$ or $1014$ (...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given a sequence A, where its elements are either in the form + x or -, where x is an integer. For such a sequence S where its elements are either in the form + x or -, define f(S) as follows: * iterate through S's elements from the first one to the last one, and maintain a multiset T as you iterat...	fail	true	true	true	code_rm_unittest	1
PROBLEM: In a cricket game, an over is a set of six valid deliveries of balls performed by one player ― the bowler for this over. Consider a cricket game with a series of $N$ overs (numbered $1$ through $N$) played by $K$ players (numbered $1$ through $K$). Each player may be the bowler for at most $L$ overs in total, ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Manao is taking part in a quiz. The quiz consists of n consecutive questions. A correct answer gives one point to the player. The game also has a counter of consecutive correct answers. When the player answers a question correctly, the number on this counter increases by 1. If the player answers a question inc...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Vasya had an array of $n$ integers, each element of the array was from $1$ to $n$. He chose $m$ pairs of different positions and wrote them down to a sheet of paper. Then Vasya compared the elements at these positions, and wrote down the results of the comparisons to another sheet of paper. For each pair he wr...	fail	true	true	true	code_rm_unittest	1
PROBLEM: C: Skewering problem One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura. There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C blocks of cubic blocks with a side length of 1 without any gaps. E...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are situated in an N dimensional grid at position (x1,x2,...,xN). The dimensions of the grid are (D1,D2,...DN). In one step, you can walk one step ahead or behind in any one of the N dimensions. (So there are always 2×N possible different moves). In how many ways can you take M steps such that you do not l...	fail	true	true	true	code_rm_unittest	1
PROBLEM: ## Your story You've always loved both Fizz Buzz katas and cuckoo clocks, and when you walked by a garage sale and saw an ornate cuckoo clock with a missing pendulum, and a "Beyond-Ultimate Raspberry Pi Starter Kit" filled with all sorts of sensors and motors and other components, it's like you were suddenly h...	fail	true	true	true	code_rm_unittest	1
PROBLEM: There are three piles of pens. A pens in the first pile and B pens in the second Pile.Find the minimum number of pens that should be there in the third pile so that sum of all three piles produces either a prime number or unity. Note: there should be atleast one pen in the third pile. Example 1: Input: A = 1,...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Ujan has been lazy lately, but now has decided to bring his yard to good shape. First, he decided to paint the path from his house to the gate. The path consists of $n$ consecutive tiles, numbered from $1$ to $n$. Ujan will paint each tile in some color. He will consider the path aesthetic if for any two diff...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Lots of geeky customers visit our chef's restaurant everyday. So, when asked to fill the feedback form, these customers represent the feedback using a binary string (i.e a string that contains only characters '0' and '1'. Now since chef is not that great in deciphering binary strings, he has decided the foll...	fail	true	true	true	code_rm_unittest	1
PROBLEM: At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan. JOI village is divided into a grid shap...	fail	true	true	true	code_rm_unittest	1
PROBLEM: Sebi goes to school daily with his father. They cross a big highway in the car to reach to the school. Sebi sits in front seat beside his father at driving seat. To kill boredom, they play a game of guessing speed of other cars on the highway. Sebi makes a guess of other car's speed being SG kph, his father FG...	fail	true	true	true	code_rm_unittest	1
PROBLEM: The task is to complete the insert() function which is used to implement Insertion Sort. Example 1: Input: N = 5 arr[] = { 4, 1, 3, 9, 7} Output: 1 3 4 7 9 Example 2: Input: N = 10 arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1} Output: 1 2 3 4 5 6 7 8 9 10 Your Task: You don't have to read input or print anything. ...	fail	true	true	true	code_rm_unittest	1
PROBLEM: You are given a binary string s and an integer m. You need to return an integer r. Where r = k%m, k is the binary equivalent of string s. Example 1: Input: s = "101" m = 2 Output: 1 Explanation: Here k=5 because (101)_{2} = (5)_{10}. Hence 5 mod 2 = 1. Example 2: Input: s = "1000" m = 4 Output: 0 Explanation:...	fail	true	true	true	code_rm_unittest	1
PROBLEM: A [Power Law](https://en.wikipedia.org/wiki/Power_law) distribution occurs whenever "a relative change in one quantity results in a proportional relative change in the other quantity." For example, if y = 120 when x = 1 and y = 60 when x = 2 (i.e. y halves whenever x doubles) then when x = 4, y...	fail	true	true	true	code_rm_unittest	1

End of preview. Expand in Data Studio

Laya-Curriculum-78k: 10 Structured Coding Datasets + 5 Verifier Datasets

Unified, multi-task curriculum dataset designed for training non-autoregressive System 1 code companions, quality gates, and neuro-symbolic routing models (Laya-LoRA and GWAYA).

Total Core Records: 78,503 structured examples across 3 stages
Verifier Records: 500 multi-domain verifier examples (Python, Rust, Lean 4, Mathematics)
Target Model: callensxavier/laya-lora-modernbert-r8
Permanent Archival DOI: 10.5281/zenodo.23076256
License: Apache 2.0

1. Curriculum Stages and Subsets

Stage 1: Security, Vulnerability, and Anti-Stub (46,196 records)

Focuses on binary gating ($p_\text{pass} \in [0, 1]$), blocking malicious patterns, stub detection (pass, ..., unproven sorry, unimplemented!()), and security classification.

PyCode-Vul (28,340 records): Real-world Python vulnerabilities and exploits.
CodeRM-UnitTest (17,562 records): Unit tests with execution assertions.
SmellBench (294 records): Code smells, God classes, and architectural anti-patterns.

Stage 2: Performance Efficiency & Energy (1,263 records)

Focuses on predicting execution complexity ($O(1)$ to $O(n^3)$) and continuous physical energy regression ($E \in [0, \infty)$ Joules).

EffiBench-X (623 records): Algorithmic execution efficiency.
SWE-Perf (140 records): Real-world software engineering performance patches.
RAPL Energy Bench (500 records): Hardware energy consumption measurements.

Stage 3: Formal Verification & Trace Alignment (31,044 records)

Focuses on formal mathematical proofs, interactive theorem proving, and execution alignment.

Lean-Workbook (10,000 records): Formal Lean 4 mathematical proofs.
miniF2F-Lean4 (244 records): Formal olympiad math benchmark problems.
Magpie-Qwen2.5-20K (20,000 records): High-quality multi-turn reasoning traces.
CRUXEval (800 records): Code reasoning and input/output execution prediction.

Verifier Curriculum: GWAYA Multi-Domain Ground Truth (500 records)

Targeted verification records for parallel zero-trust verification of frontier agent outputs (Gemini 3.1 Pro & 3.8 Flash):

Muennighoff/mbpp (Python: verified unit tests & assertions)
bigcode/the-stack-smol-rust (Rust: borrow checking & SIMD memory safety)
HuggingFaceH4/MATH-500 (Formal math & Lean 4 olympiad reasoning)
semeru/code-smell-dataset (Python: AST smells & stub detection)
openai/gsm8k (Step-by-step arithmetic & numerical consistency)

2. Record Schema

Each record is formatted as a single JSON line:

{
  "text": "def compute(x): return x * 2",
  "noul_label": 1,
  "choice_label": 0,
  "score_label": 0.05,
  "gate_score": 1.0,
  "dataset_id": "clean_code",
  "pillar": "python"
}

3. Citation

@article{callens2026laya,
  title={Laya-LoRA Coding Companion: Asymmetric Dual-Process Test-Time Compute, Full-Scale Curriculum on 10 Structured Coding Datasets, and Serverless Multi-Tier Inference Infrastructure on GCP},
  author={Callens, Xavier},
  journal={Systems for Machine Learning / Compound AI Systems},
  year={2026},
  doi={10.5281/zenodo.23076256},
  url={https://huggingface.co/datasets/callensxavier/laya-coding-curriculum-78k}
}

Downloads last month: 42