content stringlengths 263 5.24M | pred_label stringclasses 1
value | pred_score_pos float64 0.6 1 |
|---|---|---|
"""
exchange(lst1::Vector{Int}, lst2::Vector{Int})::String
In this problem, you will implement a function that takes two lists of numbers,
and determines whether it is possible to perform an exchange of elements between
them to make lst1 a list of only even numbers. There is no limit on the number
of exchanged ele... | __label__POS | 0.979555 |
"""
hex_key(num::String)::Int
You have been tasked to write a function that receives a hexadecimal number as a
string and counts the number of hexadecimal digits that are primes (prime
number, or a prime, is a natural number greater than 1 that is not a product of
two smaller natural numbers). Hexadecimal digits a... | __label__POS | 0.995627 |
"""
do_algebra(operator::Vector{String}, operand::Vector{Int})
Given two lists operator, and operand. The first list has basic algebra
operations, and the second list is a list of integers. Use the two given lists
to build the algebric expression and return the evaluation of this expression.
The basic algebra ope... | __label__POS | 0.846496 |
"""
order_by_points(nums::Vector{Int})::Vector{Int}
Write a function which sorts the given list of integers in ascending order
according to the sum of their digits. Note: if there are several items with
similar sum of their digits, order them based on their index in original list.
# Examples
```jldoctest
julia> ... | __label__POS | 0.999953 |
"""
sort_numbers(numbers::String)::String
Input is a space-delimited string of numberals from "zero" to "nine". Valid
choices are "zero", "one", "two", "three", "four", "five", "six", "seven",
"eight" and "nine". Return the string with numbers sorted from smallest to
largest
# Examples
```jldoctest
julia> sort... | __label__POS | 0.99868 |
"""
circular_shift(x::Int, shift::Int)::String
Circular shift the digits of the integer x, shift the digits right by `shift` and
return the result as a string. If `shift` > number of digits, return digits
reversed.
# Examples
```jldoctest
julia> circular_shift(12, 1)
"21"
julia> circular_shift(12, 2)
"12"
```
"... | __label__POS | 0.997974 |
"""
compare_one(a::Union{Integer, AbstractFloat, AbstractString}, b::Union{Integer, AbstractFloat, AbstractString})::Union{Integer, AbstractFloat, AbstractString, Nothing}
Create a function that takes integers, floats, or strings representing real
numbers, and returns the larger variable in its given variable type... | __label__POS | 0.67127 |
"""
simplify(x::String, n::String)::Bool
Your task is to implement a function that will simplify the expression x * n.
The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the
following format, <numerator>/<denominator> ... | __label__POS | 0.998844 |
"""
sort_array_based_on_head_tail(xs::Int)::Vector{Int}
Given an array of non-negative integers, return a copy of the given array after
sorting, you will sort the given array in ascending order if the sum( first
index value, last index value) is odd, or sort it in descending order if the
sum( first index value, la... | __label__POS | 0.999533 |
"""
sort_third(l::Vector)
This function takes a list `l` and returns a list l' such that l' is identical to
`l` in the indicies that are not divisible by three, while its values at the
indicies that are divisible by three are equal to the values of the
corresponding indicies of l, but sorted.
# Examples
```jldoc... | __label__POS | 0.999208 |
"""
find_max(words::Vector{String})::String
Write a function that accepts a list of strings. The list contains different
words. Return the word with maximum number of unique characters. If multiple
strings have maximum number of unique characters, return the one which comes
first in lexicographical order.
# Examp... | __label__POS | 0.997053 |
"""
is_sorted(xs::Vector{Int})::Bool
Given a list of numbers, return whether or not they are sorted in ascending
order. If list has more than 1 duplicate of the same number, return `false`.
Assume no negative numbers and only integers.
# Examples
```jldoctest
julia> is_sorted([5])
true
julia> is_sorted([1, 2, 3... | __label__POS | 0.998056 |
"""
digitSum(s::String)::Int
Write a function that takes a string as input and returns the sum of the upper
characters only ASCII codes.
# Examples
```jldoctest
julia> digitSum("")
0
julia> digitSum("abAB")
131
julia> digitSum("abcCd")
67
julia> digitSum("helloE")
69
julia> digitSum("woArBld")
131
julia> di... | __label__POS | 1.000007 |
"""
rounded_avg(n::Int, m::Int)::Union{Int, String}
You are given two positive integers n and m, and your task is to compute the
average of the integers from n through m (including n and m). Round the answer
to the nearest integer and convert that to binary. If n is greater than m,
return -1.
# Examples
```jldoc... | __label__POS | 0.997082 |
"""
get_row(xs::Vector{Vector{Int}}, x::Int)::Vector{Tuple{Int, Int}}
You are given a 2 dimensional data, as a nested lists, which is similar to
matrix, however, unlike matrices, each row may contain a different number of
columns. Given `xs`, and integer `x`, find integers `x` in the list `xs`, and
return list of ... | __label__POS | 0.998068 |
"""
fibfib(n::Int)::Int
The FibFib number sequence is a sequence similar to the Fibbonacci sequnece
that's defined as follows:
- fibfib(0) == 0
- fibfib(1) == 0
- fibfib(2) == 1
- fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3)
Please write a function to efficiently compute the n-th element of the fibfi... | __label__POS | 0.99752 |
"""
compare(game::Vector{Int}, guess::Vector{Int})::Vector{Int}
I think we all remember that feeling when the result of some long-awaited event
is finally known. The feelings and thoughts you have at that moment are
definitely worth noting down and comparing. Your task is to determine if a
person correctly guessed... | __label__POS | 0.992013 |
"""
closest_integer(value::String)::Int
Create a function that takes a value (string) representing a number and returns
the closest integer to it. If the number is equidistant from two integers, round
it away from zero.
!!! note
Rounding away from zero means that if the given number is equidistant
from t... | __label__POS | 0.999044 |
"""
multiply_unit_digits(a::Int, b::Int)::Int
Complete the function that takes two integers and returns the product of their
unit digits. Assume the input is always valid.
# Examples
```jldoctest
julia> multiply_unit_digits(148, 412)
16
julia> multiply_unit_digits(19, 28)
72
julia> multiply_unit_digits(2020, 1... | __label__POS | 0.996764 |
"""
cycpattern_check(a::String , b::String)::Bool
You are given 2 words. You need to return `true` if the second word or any of
its rotations is a substring in the first word.
# Example
```jldoctest
julia> cycpattern_check("abcd", "abd")
false
julia> cycpattern_check("hello", "ell")
true
julia> cycpattern_chec... | __label__POS | 0.94027 |
"""
prime_length(s::String)::Bool
Write a function that takes a `s` and returns `true` if `s` length is a prime
number or `false` otherwise.
# Examples
```jldoctest
julia> prime_length("Hello")
true
julia> prime_length("abcdcba")
true
julia> prime_length("kittens")
true
julia> prime_length("orange")
false
```... | __label__POS | 0.999765 |
"""
histogram(s::String)::Dict{String, Int}
Given a string representing a space separated lowercase letters, return a
dictionary of the letter with the most repetition and containing the
corresponding count. If several letters have the same occurrence, return all of
them.
# Examples
```jldoctest
julia> histogram... | __label__POS | 0.993571 |
"""
is_multiply_prime(a::Int)::Bool
Write a function that returns `true` if the given number is the multiplication
of 3 prime numbers and false otherwise. Knowing that `a` is less then 100.
# Examples
```jldoctest
julia> is_multiply_prime(30) # 30 = 2 * 3 * 5
true
```
"""
# Helper function to check if a number... | __label__POS | 0.999979 |
"""
odd_count(xs::Vector{String})::Vector{String}
Given a list of strings, where each string consists of only digits, return a
list. Each element `i` of the output should be "the number of odd elements in
the string i of the input." where all the i"s should be replaced by the number
of odd digits in the i"th strin... | __label__POS | 0.99985 |
"""
match_parens(lst::Vector{String})::String
You are given a list of two strings, both strings consist of open parentheses
"(" or close parentheses ")" only. Your job is to check if it is possible to
concatenate the two strings in some order, that the resulting string will be
good. A string S is considered to be ... | __label__POS | 0.999568 |
"""
fix_spaces(s::String)::String
Given a string text, replace all spaces in it with underscores, and if a string
has two or more consecutive spaces, then replace all consecutive spaces with -
# Examples
```jldoctest
julia> fix_spaces("Example")
"Example"
julia> fix_spaces("Example 1")
"Example_1"
julia> fix_s... | __label__POS | 0.999537 |
"""
file_name_check(file_name::String)::String
Create a function which takes a string representing a file's name, and returns
'Yes' if the the file's name is valid, and returns 'No' otherwise. A file's name
is considered to be valid if and only if all the following conditions are met:
- There should not be more tha... | __label__POS | 0.787918 |
"""
even_odd_palindrome(n::Int)::Tuple{Int, Int}
Given a positive integer n, return a tuple that has the number of even and odd
integer palindromes that fall within the range(1, n), inclusive.
!!! note
1. 1 <= n <= 10^3
2. returned tuple has the number of even and odd integer palindromes respectively.
... | __label__POS | 0.999476 |
"""
check_if_last_char_is_a_letter(s::String)::Bool
Create a function that returns `true` if the last character
of a given string is an alphabetical character and is not
a part of a word, and `false` otherwise.
Note: "word" is a group of characters separated by space.
# Examples
```jldoctest
julia> check_if_las... | __label__POS | 0.934795 |
"""
sort_array(arr::Vector{Int})::Vector{Int}
In this Kata, you have to sort an array of non-negative integers according to
number of ones in their binary representation in ascending order. For similar
number of ones, sort based on decimal value.
It must be implemented like this:
# Examples
```jldoctest
julia> ... | __label__POS | 0.990626 |
"""
intersection(interval1::Vector{Int}, interval2::Vector{Int})::String
You are given two intervals, where each interval is a pair of integers. For
example, interval = (start, end) = (1, 2). The given intervals are closed which
means that the interval (start, end) includes both start and end. For each given
inter... | __label__POS | 0.99995 |
"""
min_path(grid::Vector{Vector{Int}}, k::Int)::Vector{Int}
Given a grid with `N` rows and `N` columns (`N >= 2`) and a positive integer
`k`, each cell of the grid contains a value. Every integer in the range `[1, N * N]` inclusive appears exactly once on the cells of the grid.
You have to find the minimum path ... | __label__POS | 0.999923 |
"""
prod_signs(xs::Vector{Int})::Union{Nothing,Int}
You are given an array `xs` of integers and you need to return sum of magnitudes
of integers multiplied by product of all signs of each number in the array,
represented by 1, -1 or 0. Note: return None for empty `xs`.
Example: julia> prod_signs([1, 2, 2, -4]) -9... | __label__POS | 0.999781 |
"""
double_the_difference(xs::Vector)
Given a list of numbers, return the sum of squares of the numbers in the list
that are odd. Ignore numbers that are negative or not integers.
If the input list is empty, return 0.
# Examples
```jldoctest
julia> double_the_difference([1, 3, 2, 0]) # 1 + 9 + 0 + 0
10
julia>... | __label__POS | 0.999781 |
"""
fruit_distribution(s::String, n::Int)::Int
In this task, you will be given a string that represents a number of apples and
oranges that are distributed in a basket of fruit this basket contains apples,
oranges, and mango fruits. Given the string that represents the total number of
the oranges and apples and an... | __label__POS | 0.877328 |
"""
search(numbers::Vector)::Int
You are given a non-empty list of positive integers. Return the greatest integer
that is greater than zero, and has a frequency greater than or equal to the
value of the integer itself. The frequency of an integer is the number of times
it appears in the list. If no such a value ex... | __label__POS | 0.999649 |
"""
int_to_mini_roman(number::Int)::String
Given a positive integer, obtain its roman numeral equivalent as a string, and
return it in lowercase.
Restrictions: 1 <= num <= 1000
# Examples
```jldoctest
julia> int_to_mini_roman(19)
"xix"
julia> int_to_mini_roman(152)
"clii"
julia> int_to_mini_roman(426)
"cdxxvi... | __label__POS | 0.994517 |
"""
find_closest_elements(numbers::Vector{Float64})::Tuple{Float64, Float64}
From a supplied list of numbers (of length at least two) select and return two
that are the closest to each other and return them in order (smaller number,
larger number).
# Examples
```jldoctest
julia> find_closest_elements([1.0, 2.0, ... | __label__POS | 0.994376 |
"""
n_digits_in_binary(N::Int)::String
Given a positive integer N, return the total sum of its digits in binary.
@N integer Constraints: 0 ≤ N ≤ 10000.
# Examples
```jldoctest
julia> n_digits_in_binary(1000)
"1"
julia> n_digits_in_binary(150)
"110"
julia> n_digits_in_binary(147)
"1100"
```
"""
"""
n_digi... | __label__POS | 1.000001 |
"""
any_int(x::Number, y::Number, z::Number)::Bool
Create a function that takes 3 numbers. Returns `true` if one of the numbers is
equal to the sum of the other two, and all numbers are integers. Returns `false`
in any other cases.
# Examples
```jldoctest
julia> any_int(5, 2, 7)
true
julia> any_int(3, 2, 2)
fal... | __label__POS | 0.659157 |
"""
will_it_fly(q::Vector{Int}, w::Int)::Bool
Write a function that returns `true` if the object `q` will fly, and `false`
otherwise. The object `q` will fly if it's balanced (it is a palindromic list)
and the sum of its elements is less than or equal the maximum possible weight
`w`.
# Examples
```jldoctest
juli... | __label__POS | 0.999981 |
"""
correct_bracketing(brackets::String)::Bool
Brackets is a string of "(" and ")". Return `true` if every opening bracket has
a corresponding closing bracket.
# Examples
```jldoctest
julia> correct_bracketing("(")
false
julia> correct_bracketing("()")
true
julia> correct_bracketing("(()())")
true
julia> corr... | __label__POS | 0.706371 |
"""
remove_duplicates(numbers::Vector{Int})::Vector{Int}
From a list of integers, remove all elements that occur more than once. Keep
order of elements left the same as in the input.
# Examples
```jldoctest
julia> remove_duplicates([1, 2, 3, 2, 4])
3-element Vector{Int64}:
1
3
4
```
"""
"""
remove_duplic... | __label__POS | 0.990578 |
"""
max_fill(grid::Vector{Vector{Int}}, capacity::Int)::Int
You are given a rectangular grid of wells. Each row represents a single well,
and each 1 in a row represents a single unit of water. Each well has a
corresponding bucket that can be used to extract water from it, and all buckets
have the same capacity. Yo... | __label__POS | 0.995488 |
"""
pluck(xs::Vector{Int})::Vector{Int}
Given an array representing a branch of a tree that has non-negative integer
nodes your task is to pluck one of the nodes and return it. The plucked node
should be the node with the smallest even value. If multiple nodes with the same
smallest even value are found return the... | __label__POS | 0.984465 |
"""
triples_sum_to_zero(l::Vector{Int})::Bool
Takes a list of integers as an input. It returns `true` if there are three
distinct elements in the list that sum to zero, and `false` otherwise.
# Examples
```jldoctest
julia> triples_sum_to_zero([1, 3, 5, 0])
false
julia> triples_sum_to_zero([1, 3, -2, 1])
true
j... | __label__POS | 0.997275 |
"""
anti_shuffle(s::String)::String
Write a function that takes a string and returns an ordered version of it.
Ordered version of string, is a string where all words (separated by space) are
replaced by a new word where all the characters arranged in ascending order
based on ascii value.
Note: You should keep the... | __label__POS | 0.999536 |
"""
tri(n::Int)::Vector{Int}
Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in
the last couple centuries. However, what people don't know is Tribonacci
sequence. Tribonacci sequence is defined by the recurrence:
tri(1) = 1
tri(n) = 1 + n / 2, if n is even.
tri(n) = tri(n - 1) + tri(... | __label__POS | 0.916457 |
"""
strange_sort_list(xs::Vector{Int})::Vector{Int}
Given list of integers, return list in strange order. Strange sorting, is when
you start with the minimum value, then maximum of the remaining integers, then
minimum and so on.
# Examples
```jldoctest
julia> strange_sort_list([1, 2, 3, 4])
4-element Vector{Int6... | __label__POS | 0.997083 |
"""
encrypt(s::String)
Create a function `encrypt` that takes a string as an argument and returns a
string encrypted with the alphabet being rotated. The alphabet should be rotated
in a manner such that the letters shift down by two multiplied to two places.
# Example
```jldoctest
julia> encrypt("hi")
"lm"
juli... | __label__POS | 0.998418 |
"""
decimal_to_binary(decimal::Int)::String
You will be given a number in decimal form and your task is to convert it to
binary format. The function should return a string, with each character
representing a binary number. Each character in the string will be '0' or '1'.
There will be an extra couple of character... | __label__POS | 0.955408 |
"""
words_in_sentence(sentence::String)::String
You are given a string representing a sentence, the sentence contains some words
separated by a space, and you have to return a string that contains the words
from the original sentence, whose lengths are prime numbers, the order of the
words in the new string should... | __label__POS | 0.98648 |
"""
prime_fib(n::Int)::Int
Returns n-th number that is a Fibonacci number and it's also prime.
```jldoctest
julia> prime_fib(1)
2
julia> prime_fib(2)
3
julia> prime_fib(3)
5
julia> prime_fib(4)
13
julia> prime_fib(5)
89
```
"""
"""
prime_fib(n::Int)::Int
Returns n-th number that is a Fibonacci number an... | __label__POS | 0.999956 |
"""
reverse_string(s::String)::String
You are given a string `s`. If `s[i]` is a letter, reverse its case from lower
to upper or vise versa, otherwise keep it as it is. If the string contains no
letters, reverse the string. The function should return the resulted string.
# Examples
```jldoctest
julia> reverse_s... | __label__POS | 0.990752 |
"""
pairs_sum_to_zero(l::Vector{Int})::Bool
`pairs_sum_to_zero` takes a list of integers as an input. It returns `true` if
there are two distinct elements in the list that sum to zero, and false
otherwise.
```jldoctest
julia> pairs_sum_to_zero([1, 3, 5, 0])
false
julia> pairs_sum_to_zero([1, 3, -2, 1])
false
ju... | __label__POS | 0.994776 |
"""
get_odd_collatz(n::Int)::Vector{BigInt}
Given a positive integer `n`, return a sorted list that has the odd numbers in
collatz sequence.
The Collatz conjecture is a conjecture in mathematics that concerns a sequence
defined as follows: start with any positive integer n. Then each term is
obtained from the pre... | __label__POS | 0.99676 |
"""
rescale_to_unit(numbers::Vector{Float64})::Vector{Float64}
Given list of numbers (of at least two elements), apply a linear transform to
that list, such that the smallest number will become 0 and the largest will
become 1
# Examples
```jldoctest
julia> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])
5-element Vec... | __label__POS | 0.699119 |
"""
valid_date(date::String)::Bool
You have to write a function which validates a given date string and returns
`true` if the date is valid otherwise `false` The date is valid if all of the
following rules are satisfied:
1. The date string is not empty.
2. The number of days is not less than 1 or higher than 31... | __label__POS | 0.644045 |
"""
bf(planet1::String, planet2::String)::NTuple
There are eight planets in our solar system: the closerst to the Sun is Mercury,
the next one is Venus, then Earth, Mars, Jupiter, Saturn, Uranus, Neptune. Write
a function that takes two planet names as strings `planet1` and `planet2`. The
function should return a ... | __label__POS | 0.870044 |
"""
vowels_count(s::String)::Int
Write a function `vowels_count` which takes a string representing a word as
input and returns the number of vowels in the string. Vowels in this case are
'a', 'e', 'i', 'o', 'u' in both lower and upper cases. Here, 'y' or 'Y' is also
a vowel, but only when it is at the end of the g... | __label__POS | 0.977714 |
"""
correct_angle_bracketing(brackets::String)::Bool
Brackets is a string of "<" and ">". Return true if every opening bracket has a
corresponding closing bracket.
# Examples
```jldoctest
julia> correct_angle_bracketing("<")
false
julia> correct_angle_bracketing("<>")
true
julia> correct_angle_bracketing("<<><... | __label__POS | 0.852879 |
"""
is_nested(s::String)::Bool
Create a function that takes a string as input which contains only square
brackets. The function should return `true` if and only if there is a valid
subsequence of brackets where at least one bracket in the subsequence is nested.
# Examples
```jldoctest
julia> is_nested("[[]]")
tr... | __label__POS | 0.994224 |
"""
specialFilter(nums::Vector{Int})::Int
Write a function that takes an array of numbers as input and returns the number
of elements in the array that are greater than 10 and both first and last digits
of a number are odd (1, 3, 5, 7, 9).
# Example
```jldoctest
julia> specialFilter([15, -73, 14, -15])
1
julia>... | __label__POS | 1.000009 |
"""
is_simple_power(x::Number, n::Number)::Bool
Your task is to write a function that returns `true` if a number `x` is a simple
power of `n` and `false` in other cases. `x` is a simple power of `n` if n ^
int = x.
# Examples:
```jldoctest
julia> is_simple_power(1, 4)
true
julia> is_simple_power(2, 2)
true
jul... | __label__POS | 0.999782 |
"""
smallest_change(xs::Vector{Int})::Int
Given an array arr of integers, find the minimum number of elements that need to
be changed to make the array palindromic. A palindromic array is an array that
is read the same backwards and forwards. In one change, you can change one
element to any other element.
# Examp... | __label__POS | 0.999991 |
"""
f(n::Int)::Vector{Int}
Implement the function `f` that takes `n` as a parameter, and returns a list of
size n, such that the value of the element at index `i` is the factorial of `i`
if `i` is even or the sum of numbers from 1 to `i` otherwise. `i` starts from 1.
The factorial of `i` is the multiplication of t... | __label__POS | 0.987821 |
"""
encode_swap(message::String)::String
Write a function that takes a message, and encodes in such a way that it swaps
case of all letters, replaces all vowels in the message with the letter that
appears 2 places after that vowel in the english alphabet. Assume only
letters.
# Examples
```jldoctest
julia> encod... | __label__POS | 0.995981 |
"""
palindrome_with_append(s::String)::String
Find the shortest palindrome that begins with a supplied string. Algorithm idea
is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before
the palindromic suffix... | __label__POS | 0.990936 |
"""
skjkasdkd(xs::Vector{Int})::Int
You are given a list of integers. You need to find the largest prime value and
return the sum of its digits.
# Examples
```jldoctest
julia> skjkasdkd([0, 3, 2, 1, 3, 5, 7, 4, 5, 5, 5, 2, 181, 32, 4, 32, 3, 2, 32, 324, 4, 3])
10
julia> skjkasdkd([1, 0, 1, 8, 2, 4597, 2, 1, 3, ... | __label__POS | 0.998545 |
"""
get_max_triples(n::Int)::Int
You are given a positive integer n. You have to create an integer array a of length n.
For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,
and a[i] + a[j] + a[k] is a multiple of 3.
# Examples
```jldocte... | __label__POS | 0.999248 |
"""
select_words(s::String, n::Int)::Vector{<:AbstractString}
Given a string `s` and a natural number `n`, you have been tasked to implement a
function that returns a list of all words from string `s` that contain exactly
`n` consonants, in order these words appear in the string `s`. If the string `s`
is empty the... | __label__POS | 0.999438 |
"""
is_bored(s::String)::Int
You'll be given a string of words, and your task is to count the number of
boredoms. A boredom is a sentence that starts with the word "I". Sentences are
delimited by '.', '?' or '!'.
# Examples
```jldoctest
julia> is_bored("Hello world")
0
julia> is_bored("The sky is blue. The sun ... | __label__POS | 0.96888 |
"""
split_words(txt::String)::Union{Vector{<:AbstractString},Int}
Given a string of words, return a list of words split on whitespace, if no
whitespaces exists in the text you should split on commas "," if no commas
exists you should return the number of lower-case letters with odd order in the
alphabet, ord("a") ... | __label__POS | 0.958243 |
"""
next_smallest(xs::Vector{Int})::Union{Nothing,Int}
You are given a list of integers. Write a function `next_smallest(xs)` that
returns the 2nd smallest element of the list. Return `nothing` if there is no
such element.
# Examples
```jldoctest
julia> next_smallest([1, 2, 3, 4, 5])
2
julia> next_smallest([5, ... | __label__POS | 0.998959 |
"""
same_chars(s0::String, s1::String)::Bool
Check if two words have the same characters.
# Examples
```jldoctest
julia> same_chars("eabcdzzzz", "dddzzzzzzzddeddabc")
true
julia> same_chars("abcd", "dddddddabc")
true
julia> same_chars("dddddddabc", "abcd")
true
julia> same_chars("eabcd", "dddddddabc")
false
... | __label__POS | 0.948863 |
"""
sum_squares_round(xs::Vector)::Int
You are given a list of numbers. You need to return the sum of squared numbers
in the given list, round each element in the list to the upper int(Ceiling)
first.
# Examples
```jldoctest
julia> sum_squares_round([1, 2, 3])
14
julia> sum_squares_round([1, 4, 9])
98
julia> s... | __label__POS | 0.997442 |
"""
largest_smallest_integers(xs::Vector{Int})::Tuple{Union{Nothing, Int}, Union{Nothing,Int}}
Create a function that returns a tuple (a, b), where "a" is the largest of
negative integers, and "b" is the smallest of positive integers in a list. If
there is no negative or positive integers, return them as `nothing`... | __label__POS | 0.910431 |
"""
total_match(xs::Vector{String}, ys::Vector{String})::Vector{String}
Write a function that accepts two lists of strings and returns the list that has
total number of chars in the all strings of the list less than the other list.
If the two lists have the same number of chars, return the first list.
# Examples... | __label__POS | 0.998374 |
"""
top_k(xs::Vector{Int}, k::Int)::Vector{Int}
Given an array `xs` of integers and a positive integer `k`, return a sorted list
of length `k` with the maximum `k` numbers in `xs` in the descending order.
!!! note
1. The length of the array will be in the range of [1, 1000].
2. The elements in the arra... | __label__POS | 0.999002 |
"""
separate_paren_groups(paren_string::String)::Vector{String}
Input to this function is a string containing multiple groups of nested
parentheses. Your goal is to separate those group into separate strings and
return the list of those. Separate groups are balanced (each open brace is
properly closed) and not nes... | __label__POS | 0.966658 |
"""
count_up_to(n::Int)::Vector{Int}
Implement a function that takes an non-negative integer and returns an array of
the first n integers that are prime numbers and less than n.
# Example
```jldoctest
julia> count_up_to(5)
2-element Vector{Int64}:
2
3
julia> count_up_to(11)
4-element Vector{Int64}:
2
3
5
... | __label__POS | 0.999811 |
"""
reverse_delete(s::String, c::String)::Tuple{String, Bool}
We are given two strings `s` and `c`, you have to deleted all the characters in
`s` that are equal to any character in `c` then check if the result string is
palindrome. A string is called palindrome if it reads the same backward as
forward. You should... | __label__POS | 0.990863 |
"""
move_one_ball(xs::Vector{Int})::Bool
We have an array `xs` of N integers xs[1], xs[2], ..., xs[N].The numbers in the
array will be randomly ordered. Your task is to determine if it is possible to
get an array sorted in non-decreasing order by performing the following
operation on the given array: You are allow... | __label__POS | 0.991525 |
"""
eat(number::Int, need::Int, remaining::Int)::Vector{Int}
You're a hungry rabbit, and you already have eaten a certain number of carrots,
but now you need to eat more carrots to complete the day's meals. you should
return an array of [ total number of eaten carrots after your meals, the number
of carrots left a... | __label__POS | 0.996106 |
"""
below_zero(operations::Vector{Int})::Bool
You're given a list of deposit and withdrawal operations on a bank account that
starts with zero balance. Your task is to detect if at any point the balance of
account falls below zero, and at that point function should return `true`.
Otherwise it should return `false`... | __label__POS | 0.933239 |
"""
right_angle_triangle(a::Number, b::Number, c::Number)::Bool
Given the lengths of the three sides of a triangle. Return `true` if the three
sides form a right-angled triangle, `false` otherwise. A right-angled triangle
is a triangle in which one angle is right angle or 90 degree.
# Examples
```jldoctest
julia... | __label__POS | 0.977729 |
"""
triangle_area3(a::Number, b::Number, c::Number)::Number
Given the lengths of the three sides of a triangle. Return the area of the
triangle rounded to 2 decimal points if the three sides form a valid triangle.
Otherwise return -1 Three sides make a valid triangle when the sum of any two
sides is greater than t... | __label__POS | 0.998883 |
"""
words_string(s::String)::Vector{String}
You will be given a string of words separated by commas or spaces. Your task is
to split the string into words and return an array of the words. Results
shouldn't contain empty string.
# Example
```jldoctest
julia> words_string("Hi, my name is John")
5-element Vector{S... | __label__POS | 0.956327 |
"""
by_length(xs::Vector{Int})::Vector{String}
Given an array of integers, sort the integers that are between 1 and 9
inclusive, reverse the resulting array, and then replace each digit by its
corresponding name from "One", "Two", "Three", "Four", "Five", "Six", "Seven",
"Eight", "Nine".
If the array is empty, re... | __label__POS | 0.99808 |
"""
unique_digits(xs::Vector{Int})::Vector{Int}
Given a list of positive integers `xs`. Return a sorted list of all
elements that hasn't any even digit.
!!! note
Returned list should be sorted in increasing order.
# Examples
```jldoctest
julia> unique_digits([15, 33, 1422, 1])
3-element Vector{Int64}:
1
... | __label__POS | 0.997453 |
"""
get_closest_vowel(word::String)::String
You are given a word. Your task is to find the closest vowel that stands between
two consonants from the right side of the word (case sensitive).
Vowels in the beginning and ending doesn't count. Return empty string if you
didn't find any vowel met the above condition.
... | __label__POS | 0.996176 |
"""
sorted_list_sum(xs::Vector{String})::Vector{String}
Write a function that accepts a list of strings as a parameter, deletes the
strings that have odd lengths from it, and returns the resulted list with a
sorted order,
The list is always a list of strings and never an array of numbers, and it may
contain dupli... | __label__POS | 0.99847 |
"""
exchange(lst1::Vector{Int}, lst2::Vector{Int})::String
In this problem, you will implement a function that takes two lists of numbers,
and determines whether it is possible to perform an exchange of elements between
them to make lst1 a list of only even numbers. There is no limit on the number
of exchanged ele... | __label__POS | 0.979384 |
"""
hex_key(num::String)::Int
You have been tasked to write a function that receives a hexadecimal number as a
string and counts the number of hexadecimal digits that are primes (prime
number, or a prime, is a natural number greater than 1 that is not a product of
two smaller natural numbers). Hexadecimal digits a... | __label__POS | 0.962224 |
"""
do_algebra(operator::Vector{String}, operand::Vector{Int})
Given two lists operator, and operand. The first list has basic algebra
operations, and the second list is a list of integers. Use the two given lists
to build the algebric expression and return the evaluation of this expression.
The basic algebra ope... | __label__POS | 0.968716 |
"""
order_by_points(nums::Vector{Int})::Vector{Int}
Write a function which sorts the given list of integers in ascending order
according to the sum of their digits. Note: if there are several items with
similar sum of their digits, order them based on their index in original list.
# Examples
```jldoctest
julia> ... | __label__POS | 0.999347 |
"""
circular_shift(x::Int, shift::Int)::String
Circular shift the digits of the integer x, shift the digits right by `shift` and
return the result as a string. If `shift` > number of digits, return digits
reversed.
# Examples
```jldoctest
julia> circular_shift(12, 1)
"21"
julia> circular_shift(12, 2)
"12"
```
"... | __label__POS | 0.997699 |
"""
compare_one(a::Union{Integer, AbstractFloat, AbstractString}, b::Union{Integer, AbstractFloat, AbstractString})::Union{Integer, AbstractFloat, AbstractString, Nothing}
Create a function that takes integers, floats, or strings representing real
numbers, and returns the larger variable in its given variable type... | __label__POS | 0.924488 |
"""
simplify(x::String, n::String)::Bool
Your task is to implement a function that will simplify the expression x * n.
The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the
following format, <numerator>/<denominator> ... | __label__POS | 0.884881 |
"""
sort_array_based_on_head_tail(xs::Int)::Vector{Int}
Given an array of non-negative integers, return a copy of the given array after
sorting, you will sort the given array in ascending order if the sum( first
index value, last index value) is odd, or sort it in descending order if the
sum( first index value, la... | __label__POS | 0.999499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.