The Western Suburbs Croquet Club has two categories of membership, Senior and Open. They would like your help with an application form that will tell prospective members which category they will be placed.
To be a senior, a member must be at least 55 years old and have a handicap greater than 7. In this croquet club, handicaps range from -2 to +26; the better the player the lower the handicap.
Input:
Input will consist of a list of lists containing two items each. Each list contains information for a single potential member. Information consists of an integer for the person's age and an integer for the person's handicap.
Note for F#: The input will be of (int list list) which is a List
Example Input:
[[18, 20],[45, 2],[61, 12],[37, 6],[21, 21],[78, 9]]
Output:
Output will consist of a list of string values (in Haskell: Open or Senior) stating whether the respective member is to be placed in the senior or open category.
Example Output:
["Open", "Open", "Senior", "Open", "Open", "Senior"]
Make a program that filters a list of strings and returns a list with only your friends name in it.
If a name has exactly 4 letters in it, you can be sure that it has to be a friend of yours! Otherwise, you can be sure he's not...
Ex: Input = ["Ryan", "Kieran", "Jason", "Yous"], Output = ["Ryan", "Yous"]
i.e.
friend ["Ryan", "Kieran", "Mark"] should be ["Ryan", "Mark"]
Note: keep the original order of the names in the output.
ATM machines allow 4 or 6 digit PIN codes and PIN codes cannot contain anything but exactly 4 digits or exactly 6 digits.
If the function is passed a valid PIN string, return true, else return false.
eg:
validatePIN("1234") === true
validatePIN("12345") === false
validatePIN("a234") === false
An isogram is a word that has no repeating letters, consecutive or non-consecutive.
Implement a function that determines whether a string that contains only letters is an isogram.
Assume the empty string is an isogram.
Ignore letter case.
isIsogram("Dermatoglyphics") == true
isIsogram("aba") == false
isIsogram("moOse") == false // -- ignore letter case
Count the number of Duplicates
Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string.
The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.
Example:
"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (`b` and `B`)
"indivisibility" -> 1 # 'i' occurs six times
"Indivisibilities" -> 2 # 'i' occurs seven times and 's' occurs twice
"aA11" -> 2 # 'a' and '1'
"ABBA" -> 2 # 'A' and 'B' each occur twice
Your task is to make a function that can take any non-negative integer as a argument and return it with its digits in descending order.
Essentially, rearrange the digits to create the highest possible number.
Examples:
Input: 21445; Output: 54421
Input: 145263; Output: 654321
Input: 123456789; Output: 987654321
Return the number (count) of vowels in the given string.
We will consider a, e, i, o, and u as vowels for this Kata.
The input string will only consist of lower case letters and/or spaces.
Complete the solution so that it splits the string into pairs of two characters.
If the string contains an odd number of characters then it should replace the missing second character of the final pair with an underscore ('_').
Examples:
solution('abc') // should return ['ab', 'c_']
solution('abcdef') // should return ['ab', 'cd', 'ef']
You will be given a number and you will need to return it as a string in Expanded Form. For example:
expandedForm(12); // Should return '10 + 2'
expandedForm(42); // Should return '40 + 2'
expandedForm(70304); // Should return '70000 + 300 + 4'
NOTE: All numbers will be whole numbers greater than 0.
There is an array with some numbers. All numbers are equal except for one. Try to find it!
findUniq([ 1, 1, 1, 2, 1, 1 ]) === 2
findUniq([ 0, 0, 0.55, 0, 0 ]) === 0.55
It’s guaranteed that array contains at least 3 numbers.
The tests contain some very huge arrays, so think about performance.
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 who like an item. It must return the display text as shown in the examples:
likes [] // must be "no one likes this"
likes ["Peter"] // must be "Peter likes this"
likes ["Jacob", "Alex"] // must be "Jacob and Alex like this"
likes ["Max", "John", "Mark"] // must be "Max, John and Mark like this"
likes ["Alex", "Jacob", "Mark", "Max"] // must be "Alex, Jacob and 2 others like this"
For 4 or more names, the number in and 2 others simply increases.
Write simple .camelCase method (camel_case function in PHP, CamelCase in C# or camelCase in Java) for strings.
All words must have their first letter capitalized without spaces.
For instance:
"hello case".camelCase() => HelloCase
"camel case word".camelCase() => CamelCaseWord
We need to sum big numbers and we require your help.
Write a function that returns the sum of two numbers.
The input numbers are strings and the function must return a string.
Example:
add("123", "321"); -> "444"
add("11", "99"); -> "110"
Notes:
- The input numbers are big.
- The input is a string of only digits
- The numbers are positives
The rgb function is incomplete.
Complete it so that passing in RGB decimal values will result in a hexadecimal representation being returned.
Valid decimal values for RGB are 0 - 255.
Any values that fall out of that range must be rounded to the closest valid value.
Note: Your answer should always be 6 characters long, the shorthand with 3 will not work here.
The following are examples of expected output values:
rgb(255, 255, 255) // returns FFFFFF
rgb(255, 255, 300) // returns FFFFFF
rgb(0,0,0) // returns 000000
rgb(148, 0, 211) // returns 9400D3
Write a function called findUnique which returns the only unique number from an array.
All numbers in the unsorted array are present twice, except the one you have to find.
The numbers are always valid integer values between 1 and 2147483647, so no need for type and error checking.
The array contains at least one number and may contain millions of numbers.
So make sure your solution is optimized for speed.
Example Input:
[ 1, 8, 4, 4, 6, 1, 8 ]
Expected output:
6
Simple, given a string of words, return the length of the shortest word(s).
String will never be empty and you do not need to account for different data types.
Example:
Test.describe("Example tests",_=>{
Test.assertEquals(findShort("bitcoin take over the world maybe who knows perhaps"), 3);
Test.assertEquals(findShort("turns out random test cases are easier than writing out basic ones"), 3);
});
We have an input object whose keys are characters, and the values are the position of these characters in the final line.
There are no omissions among the numbers.
Example:
const obj = {
' ': [6],
',': [5],
d: [11],
e: [1],
H: [0],
l: [2, 3, 10],
o: [4, 8],
r: [9],
w: [7]
};
buildString(obj) -> Hello, world
buildString2() -> ""
The intersection of two arrays A and B is an array with only those elements A and B that simultaneously belong to both arrays, without duplicates.
Arrays are not sorted.
Example:
const arr1 = [14, 14, 8, 8, 3, 11, 7, 17, 4, 0, 5];
const arr2 = [14, 18, 14, 8, 8, 3, 2, 14, 19, 2];
IntersecArrays(arr1, arr2) -> [ 14, 8, 3 ]
Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.
Example:
moveZeros([false,1,0,1,2,0,1,3,"a"]) -> [false,1,1,2,1,3,"a",0,0]
Complete the function scramble(str1, str2) that returns true if a portion of str1 characters can be rearranged to match str2, otherwise returns false.
Notes:
-
Only lower case letters will be used (a-z). No punctuation or digits will be included;
-
Performance needs to be considered.
Input strings s1 and s2 are null terminated.
Examples:
scramble('rkqodlw', 'world') -> True
scramble('cedewaraaossoqqyt', 'codewars') -> True
scramble('katas', 'steak') -> False
Write a function, which takes a non-negative integer (seconds) as input and returns the time in a human-readable format (HH:MM:SS)
- HH = hours, padded to 2 digits, range: 00 - 99;
- MM = minutes, padded to 2 digits, range: 00 - 59;
- SS = seconds, padded to 2 digits, range: 00 - 59.
The maximum time never exceeds 359999 (99:59:59).
You can find some examples in the test fixtures.
Some new cashiers started to work at your restaurant.
They are good at taking orders, but they don't know how to capitalize words, or use a space bar!
All the orders they create look something like this:
"milkshakepizzachickenfriescokeburgerpizzasandwichmilkshakepizza"
The kitchen staff are threatening to quit, because of how difficult it is to read the orders.
Their preference is to get the orders as a nice clean string with spaces and capitals like so:
"Burger Fries Chicken Pizza Pizza Pizza Sandwich Milkshake Milkshake Coke"
The kitchen staff expect the items to be in the same order as they appear in the menu.
The menu items are fairly simple, there is no overlap in the names of the items:
1. Burger
2. Fries
3. Chicken
4. Pizza
5. Sandwich
6. Onionrings
7. Milkshake
8. Coke
Example:
Input: getOrder("milkshakepizzachickenfriescokeburgerpizzasandwichmilkshakepizza")
Output: "Burger Fries Chicken Pizza Pizza Pizza Sandwich Milkshake Milkshake Coke"
Write a function that returns a sequence (index begins with 1) of all the even characters from a string.
If the string is smaller than two characters or longer than 100 characters, the function should return "invalid string".
Example:
"abcdefghijklm" --> ["b", "d", "f", "h", "j", "l"]
"a" --> "invalid string"
Implement a function that finds the difference in arrays and returns it.
The order of returned elements is not important
Example:
arrayDifference1(['javascript', 'is', 'awesome'], ['javascript', 'awesome']) => ['is']
arrayDifference1([1, 2, 3, 4, 5], [3, 4, 2, 7]) => [1, 5, 7]
Implement a function that removes elements from an array.
Example:
destroyer([1, 2, 3, 4, 5, 6, 7], 1, 3, 5, 6) => [2, 4, 7]
destroyer(['this', 'is', 'simple', 'algorithm'], 'this', 'is') => ['simple', 'algorithm']
Check whether the second parameter of the function is true for each element of the collection.
If it is true for all elements (passes the if check), the function returns true, otherwise it returns false.
Example:
isEverythingTruthy([{name: 'Oleg', age: 25}, {name: 'Elena', age: 21}, {name: 'Victor', age: 12}], 'age'); => true
isEverythingTruthy([{car: 'Ford', owner: 'Oleg'}, {car: 'Audi', owner: null}, {car: 'BMW', owner: 'Amazon'}], 'owner') => false
This time we want to write calculations using functions and get the results. Let's have a look at some examples:
seven(times(five())); // must return 35
four(plus(nine())); // must return 13
eight(minus(three())); // must return 5
six(dividedBy(two())); // must return 3Requirements:
-
There must be a function for each number from 0 ("zero") to 9 ("nine")
-
There must be a function for each of the following mathematical operations: plus, minus, times, dividedBy (divided_by in Ruby and Python)
-
Each calculation consist of exactly one operation and two numbers
-
The most outer function represents the left operand, the most inner function represents the right operand
-
Division should be integer division. For example, this should return 2, not 2.666666...
You have an array of numbers. Your task is to sort ascending odd numbers but even numbers must be on their places.
Zero isn't an odd number and you don't need to move it. If you have an empty array, you need to return it.
Example:
sortArray([5, 3, 2, 8, 1, 4]) == [1, 3, 2, 8, 5, 4]In this Kata, you will be given a string that may have mixed uppercase and lowercase letters and your task is to convert that string to either lowercase only or uppercase only based on:
- make as few changes as possible.
- if the string contains equal number of uppercase and lowercase letters, convert the string to lowercase.
For example:
solve("coDe") = "code". Lowercase characters > uppercase. Change only the "D" to lowercase.
solve("CODe") = "CODE". Uppercase characters > lowecase. Change only the "e" to uppercase.
solve("coDE") = "code". Upper == lowercase. Change all to lowercase.Given Two integers a , b , find The sum of them , BUT You are not allowed to use the operators + and -
-
The numbers (a,b) may be positive , negative values or zeros .
-
Returning value will be an integer .
-
Javascript: the Array reduce methods are disabled, along with eval, require, and module .
add(5,19) ==> 24
add(-27,18) ==> -9
add(-14,-16) ==> -30Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.
persistence(39) === 3 // because 3*9 = 27, 2*7 = 14, 1*4=4
// and 4 has only one digit
persistence(999) === 4 // because 9*9*9 = 729, 7*2*9 = 126,
// 1*2*6 = 12, and finally 1*2 = 2
persistence(4) === 0 // because 4 is already a one-digit numberIn this kata you will have to change every letter in a given string to the next letter in the alphabet. You will write a function nextLetter to do this. The function will take a single parameter str (string).
"Hello" --> "Ifmmp"
"What is your name?" --> "Xibu jt zpvs obnf?"
"zoo" --> "app"
"zzZAaa" --> "aaABbb"Spaces and special characters should remain the same. Capital letters should transfer in the same way but remain capitilized.
zipWith takes a function and two arrays and zips the arrays together, applying the function to every pair of values. The function value is one new array.
If the arrays are of unequal length, the output will only be as long as the shorter one. (Values of the longer array are simply not used.)
Inputs should not be modified.
zipWith( Math.pow, [10,10,10,10], [0,1,2,3] ) => [1,10,100,1000]
zipWith( Math.max, [1,4,7,1,4,7], [4,7,1,4,7,1] ) => [4,7,7,4,7,7]
zipWith( function(a,b) { return a+b; }, [0,1,2,3], [0,1,2,3] ) => [0,2,4,6] Both forms are valid.
zipWith( (a,b) => a+b, [0,1,2,3], [0,1,2,3] ) => [0,2,4,6] Both are functions.Assume all input is valid.
In this kata, you have an integer array which was ordered by ascending except one number.
For Example: [1,2,3,4,17,5,6,7,8] For Example: [19,27,33,34,112,578,116,170,800] You need to figure out the first breaker. Breaker is the item, when removed from sequence, sequence becomes ordered by ascending.
For Example: [1,2,3,4,17,5,6,7,8] => 17 is the only breaker.
For Example: [19,27,33,34,112,578,116,170,800] => 578 is the only breaker.
For Example: [105, 110, 111, 112, 114, 113, 115] => 114 and 113 are breakers. 114 is the first breaker. When removed 114, sequence becomes ordered by ascending => [105, 110, 111, 112, 113, 115] When removed 113, sequence becomes ordered by ascending => [105, 110, 111, 112, 114, 115]
For Example: [1, 0, 2] => 1 and 0 are the breakers. 1 is the first breaker. When removed 1, sequence becomes ordered by ascending => [0, 2] When removed 0, sequence becomes ordered by ascending => [1, 2]
For Example: [1, 2, 0, 3, 4] => 0 is the only breaker. When removed 0, sequence becomes ordered by ascending. => [1, 2, 3, 4]
Write a function that returns the first breaker.
Input array does not contain any duplicate element.
Simple enough this one - you will be given an array. The values in the array will either be numbers or strings, or a mix of both. You will not get an empty array, nor a sparse one.
Your job is to return a single array that has first the numbers sorted in ascending order, followed by the strings sorted in alphabetic order. The values must maintain their original type.
Note that numbers written as strings are strings and must be sorted with the other strings.