Topic: "code-wars"
trannguyenhan/workspace-algorithms
Không gian luyện tập và rèn luyện thuật toán.
Language: C++ - Size: 78.1 MB - Last synced at: over 1 year ago - Pushed at: about 3 years ago - Stars: 75 - Forks: 88

SamyBeshoy/JS-Problems
JS Problems Solving
Language: HTML - Size: 45.9 KB - Last synced at: 22 days ago - Pushed at: 12 months ago - Stars: 4 - Forks: 0

Tafara-N/Code_Challenges
Coding challenges from different platforms.
Language: Python - Size: 404 KB - Last synced at: 18 days ago - Pushed at: 6 months ago - Stars: 3 - Forks: 0

esadakman/javaScript-coding-challenges
JavaScript Coding Challenges
Size: 255 KB - Last synced at: 10 months ago - Pushed at: 10 months ago - Stars: 2 - Forks: 0

zerotoolz/cse
Сodewars.com Solidity Solution Examples
Language: Solidity - Size: 22.5 KB - Last synced at: almost 2 years ago - Pushed at: almost 3 years ago - Stars: 2 - Forks: 0

esadakman/python-coding-challenges
Python Coding Challenges
Size: 271 KB - Last synced at: 10 months ago - Pushed at: 10 months ago - Stars: 1 - Forks: 0

icyJoseph/code-wars
Code Wars solutions
Language: Rust - Size: 66.4 KB - Last synced at: about 2 months ago - Pushed at: over 2 years ago - Stars: 1 - Forks: 0

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++ - Size: 98.6 KB - Last synced at: 9 months ago - Pushed at: 9 months ago - Stars: 0 - Forks: 0

d0ugherty/code-wars
code wars challenge submission repo
Language: C++ - Size: 175 KB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

chrisaaronr/Code-Wars
Daily Coding Exercises to sharpen problem solving skills
Language: JavaScript - Size: 78.1 KB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

coderrob22/Code-Wars
A code war kata a day, keeps the doctor away!
Language: JavaScript - Size: 3.08 MB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 0 - Forks: 0

Haselstein/CodeWars
My CodeWars solutions on java
Language: Java - Size: 42 KB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 0 - Forks: 0

Alexandre-A11/Desafios
Desafios de sites CodeWars, CoderBye, HackerRank, LeetCode.
Language: Python - Size: 147 KB - Last synced at: about 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

anasmak04/Codewars-Problems-Solving
Codewars solutions
Language: JavaScript - Size: 37.1 KB - Last synced at: about 1 month ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

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 - Size: 16.6 KB - Last synced at: about 1 month ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

thaisclxt/kata
Repository to backup katas from Code Wars
Language: PHP - Size: 1.95 KB - Last synced at: over 1 year ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

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.
Language: JavaScript - Size: 17.6 KB - Last synced at: about 1 month ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0

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.
Language: JavaScript - Size: 17.6 KB - Last synced at: about 1 month ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0

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".
Language: JavaScript - Size: 17.6 KB - Last synced at: about 1 month ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0

bell-kevin/countingValleys
code wars solution to Counting Valleys on codeWars.com for JavaScript
Language: JavaScript - Size: 17.6 KB - Last synced at: about 1 month ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0

kallyas/coding-challenges
coding challenges
Size: 2.93 KB - Last synced at: about 1 year ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0
