- Array Previous Less Array Previous Less
- Buble Sort Bubble Sort
- Array Maximal Adjacent Difference Array Maximal Adjacent Difference
- Default Argument Default Argument
- Sorting Array of Objects and Arrays Sorting Array of Objects and Arrays
- Sorting with Comparator function v2 Sorting with Comparator function -v2
- Sorting with Comparator function Sorting with Comparator Function
- Array Max Consecutive Sum Array Max Consecutive Sum
- Remove Duplicates Remove Duplicates
- Min Max v2 Min Max v2
- Remove Duplicates v2 Remove Duplicates v2
- Remove Duplicates v3 Remove Duplicates v3
- Min Max Min Max
- Array Conversion Array Conversion
- Array Change Array Change
- Are Similar Are SimilarTwo arrays are called similar if one can be obtained from another by swapping at most one pair of elements in one of the arrays.
- Are Equally Strong Are Equally StrongCall two arms equally strong if the heaviest weights they each are able to lift are equal.Call two people equally strong if their strongest arms are equally strong (the strongest arm can be both the right and the left), and so are their weakest arms.Given your and your friend’s arms’ lifting capabilities find out if you two are equally strong.
- Alternating Sum Alternating SumYou are given an array of positive integers - the weights of the people. Return an array of two integers, where the first element is the total weight of team 1, and the second element is the total weight of team 2 after the division is complete.
- Alphabetic SubSequence Alphabetic SubSequenceCheck whether the given string is a subsequence of the plaintext alphabet.
- Alphabetic Shift Alphabetic ShiftGiven a string, replace each its character by the next one in the English alphabet (z would be replaced by a).
- Almost Increasing Sequence Almost Increasing SequenceGiven a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array.
- Border v2 Border v2
- Border Border
- Add Add
- fibonacci Recursive v2 Fibonacci Recursive v2
- Fibonacci Iterative v2 Fibonacci Iterative v2
- Spiral Matrix v-1 Spiral Matrix v-1Write a function that accepts an integer N and returns a NxN spiral matrix.’
- Find Vowel-v2 Find Vowel-v2We write a function that returns the number of vowels used in a string. Vowels are characters ‘a’ ,’e’, ‘i’, ‘o’ and ‘u’
- Add Key and Value Add Key and Value
- Reverse String-v8 Reverse String-v8
- Reverse String-v7 Reverse String-v7
- Pyramid v2 Pyramid v2
- HasOddNumber HasOddNumber
- Maching Braces Maching Braces
- Reverse String-v6 Reverse String-v6
- Has A Zero Has A Zero
- HasEvenNumber HasEvenNumber
- Has Only Odd Number Has Only Odd Number
- Has Only Even Number Has Only EvenNumber
- HasNoDuplicates Has No Duplicates
- Has Certain Key Has Certain KeyIn nested objects if all of the keys have same key it returns true if some of them do not have it returns false;
- Has Certain Value Has Certain ValueWrite a function called hasCertainValue which accepts an array of objects and a key, and a value, and returns true if every single object in the array contains that value for the specific key. Otherwise it should return false.
- Special Multiply Special MultiplySpecial Multiply is a form of code where we have one function and we check if they are not arrays, strings or objects plain numbers and we return a callback function where we multiply the parameters;
- Extract Value Vowel CountExtracting value from nested arrays and key to find which array are left behind.
- Vowel Count Vowel CountVowel Count is counting the vowels (a,e,i,o,u) from string.
- Guessing Game Guessing GameGuessing Game is a game where you guess if the number from first function is the guess from the second one and if your guess is bigger you return “Your guess is too high!” else “Your guess is too low!”
- Find Vowel-v1 Find Vowel-v1We write a function that returns the number of vowels used in a string. Vowels are characters ‘a’ ,’e’, ‘i’, ‘o’ and ‘u’
- Sentence Capitalization-v1 Sentence Capitalization v1
- Sentence Capitalization-v2 Sentence Capitalization v2
- The Steps Question The Steps Question
- Anagram Anagram
- Anagram v2 Anagram v2
- Array Chunk v2 Array Chunk v2
- Array Chunk Array Chunk
- FizzBuzz FizzBuzz
- FizzBuzz-v2 FizzBuzz v2
- Max Char Max Char
- Integer Reversal Integer Reversal
- Palindrom-v6 Palindrom v6
- Palindrom-v2 Palindrom v2
- String Reversal v4 String Reversal v4
- Max Non Overlapping Segments From Codility Max Non Overlapping Segments”
- Min ABS SUM From Codility
- Numbers From Codility
- Div Count Div Count
- Cars Passing Cars Passing
- Max Profit Max Profit
- Maximum Sub Array Maximum Sub Array
- Dominator Dominator
- MaximumSliceProblem Maximum Slice Problem
- Brackets Brackets
- Sieve of Eratosthenes Sieve of Eratosthenes
- Memoized Fibonacci Memoized Fibonacci
- Find Factorial Recursive Find Factorial Recursive
- Fibonacci Iterative Fibonacci Iterative
- Find Factorial Recurative Fibonacci Iterative Recursive
- Fibonacci-v2 Fibonacci v2In mathematics, the Fibonacci numbers, commonly denoted Fn, form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. ___
- ArrayConvertion ArrayConvertion
- Palindrom-v5 Palindrom v5
- Palindrom-v4 Palindrom v4
- CountLetters CountLetters
- isPrime-v2 isPrime-v2
- isPrime isPrime
- AreSimilar Are SimilarYou are given an array of integers. On each move you are allowed to increase exactly one of its element by one. Find the minimal number of moves required to obtain a strictly increasing sequence from the input.___
- AreSimilar AreSimilarTwo arrays are called similar if one can be obtained from another by swapping at most one pair of elements in one of the arrays. ___
- AreEquallyStrong AreEquallyStrongCall two arms equally strong if the heaviest weights they each are able to lift are equal.
- AlternatingSum Alternating SumAn alternating sum is a sequence of arithmetic operations in which each addition. is followed by a subtraction, and viceversa, applied to a sequence of numerical entities___
- AlphabeticSubSequence AlphabeticSubSequenceGiven two strings, find if first string is a subsequence of second___
- Factorial v2 Factorial v2
- BinarySearch BinarySearchIn computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.___
- Two Sum Two SumGiven an array of integers nums and an integer target , return indices of the two numbers such that they add up to target .
- Fibonacci FibonacciIn mathematics, the Fibonacci numbers, commonly denoted Fn, form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. ___
- Pyramid Pyramid
- Second Value Second ValueSecond Value is when we return the middle value and unique values.
- Reverse String v5 Reverse String v5
- Unique Values-v3 Unique Values-v3
- Unique Properties Unique Properties
- Unique Values-v2 Unique Values-v2
- Unique Values-v2 Unique Values-v2
- Reverse Array in Place Reverse Array in Place
- Array Sum Array Sum
- Reversed String-v3 Reversed String
- Unique Values Unique Values
- Caeser Cipher Caeser Cipher
- Capitalize Letter Capitalize Letter
- Palindrom-v3 Palindrom v3
- Longest Words Longest Words
- Harmless Ransom Note Harmless Ransom Note
- Harmless Ransom Note Harmless Ransom Note
- Rock Paper Scissors Rock Paper Scissors
- Dice Game Dice Game
- The Steps Question The Steps Question
- Reverse String-v2 Reverse String v2
- Background Color Generator Background Color Generator
- Alphabetic Shift Alphabetic Shift
- Almost Increasing Sequence Almost Increasing Sequence
- All Longest Strings All Longest Strings
- Adjecent Element Product Adjecent Element Product Given an array of integers, find the pair of adjacent elements that has the largest product and return that product.
- Absolute Values Sum Minization Absolute Values Sum MinizationGiven a sorted array of integers a, find an integer x from a such that the value of abc(a[0] - x) + abs(a[1] - x) + … + abc(a[a.length - 1] - x)is the smallest possible (here abc denotes the absolute value).If there are several possible answers output the smallest one.
- Add Two Digits Add Two Digitis
- Truncate String Truncate String
- String Repeater String Repeater
- Palindrom Palindrom
- Adding array of numbers Adding array of numbers
- Factorial Factorial Calculator
- Triple Add Triple Add
- String Reversal String Reversal
- How to solve problems How to solve problems
- Introduction Programming in General