Projects in Awesome Lists tagged with code-wars

https://github.com/samybeshoy/js-problems

JS Problems Solving

code-wars competitive-programming javascript javascript-problems problem-solving

Last synced: 17 Jan 2025

https://github.com/tafara-n/code_challenges

Coding challenges from different platforms.

code-wars leetcode practise-python project-euler w3-resource

Last synced: 12 Apr 2025

https://github.com/icyjoseph/code-wars

Code Wars solutions

code-wars rust

Last synced: 15 Mar 2025

https://github.com/bell-kevin/countingvalleys

code wars solution to Counting Valleys on codeWars.com for JavaScript

code-wars code-wars-solution

Last synced: 17 Mar 2025

https://github.com/bell-kevin/rot13

ROT13 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".

code-wars code-wars-solution

Last synced: 17 Mar 2025

https://github.com/bell-kevin/fibonacci-tribonacci-and-friends

If 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.

code-wars code-wars-solution

Last synced: 17 Mar 2025

https://github.com/gzachariadis/code-wars

A quick remake of the Code Wars code editor, with iterative code execution.

challenges code-wars codewars script scripting watchdog

Last synced: 23 Feb 2025

https://github.com/bell-kevin/theshellgame

"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.

code-wars code-wars-solution

Last synced: 17 Mar 2025