code-wars
There are 0 repository under code-wars topic.
trannguyenhan / workspace-algorithms
Không gian luyện tập và rèn luyện thuật toán.
Language:C++ 83esadakman / javaScript-coding-challenges
JavaScript Coding Challenges
SamyBeshoy / JS-Problems
JS Problems Solving
Language:HTML 2- Language:Solidity 2
chrisaaronr / Code-Wars
Daily Coding Exercises to sharpen problem solving skills
Language:JavaScript 1- Language:Rust 1
Alexandre-A11 / Desafios
Desafios de sites CodeWars, CoderBye, HackerRank, LeetCode.
Language:Python 0- Language:C++ 0
gzachariadis / Code-Wars
A quick remake of the Code Wars code editor, with iterative code execution.
Language:Python 0anasmak04 / Codewars-Problems-Solving
Codewars solutions
Language:JavaScriptbell-kevin / countingValleys
code wars solution to Counting Valleys on codeWars.com for JavaScript
Language:JavaScriptIf you have completed the Tribonacci sequence kata, you would know by now that mister Fibonacci has at least a bigger brother. If not, give it a quick look to get how things work. Well, time to expand the family a little more: think of a Quadribonacci starting with a signature of 4 elements and each following element is the sum of the 4 previous, a Pentabonacci (well Cinquebonacci would probably sound a bit more italian, but it would also sound really awful) with a signature of 5 elements and each following element is the sum of the 5 previous, and so on. Well, guess what? You have to build a Xbonacci function that takes a signature of X elements - and remember each next element is the sum of the last X elements - and returns the first n elements of the so seeded sequence.
Language:JavaScriptROT13 is a simple letter substitution cipher that replaces a letter with the letter 13 letters after it in the alphabet. ROT13 is an example of the Caesar cipher. Create a function that takes a string and returns the string ciphered with Rot13. If there are numbers or special characters included in the string, they should be returned as they are. Only letters from the latin/english alphabet should be shifted, like in the original Rot13 "implementation".
Language:JavaScript"The Shell Game" involves cups upturned on a playing surface, with a ball placed underneath one of them. The index of the cups are swapped around multiple times. After that the players will try to find which cup contains the ball. Your task is as follows. Given the cup that the ball starts under, and list of swaps, return the location of the ball at the end. Cups are given like array/list indices. For example, given the starting position 0 and the swaps [(0, 1), (1, 2), (1, 0)]: The first swap moves the ball from 0 to 1 The second swap moves the ball from 1 to 2 The final swap doesn't affect the position of the ball. So swaps = [[0,1], [1,2], [1, 0]] find_the_ball(0, swaps) == 2 There aren't necessarily only three cups in this game, but there will be at least two. You can assume all swaps are valid, and involve two distinct indices.
Language:JavaScript- Language:JavaScript
inamtyulhaq / Miscellaneous-Platforms
This repository contains solutions to the problems that I solved on several sites which are mentioned in the repository. Solution along with the explanation will be available here.
Language:C++MohamedCuerci / exercicios-ruby
só uns codigo que eu faço quando vou tirar alguma duvida de sintaxe ou algo do tipo usando a linguagem ruby
Language:Ruby- Language:PHP
