code-wars-solution
Here are 21 public repositories matching this topic...
Language:All
Sort:Most stars
Codewars Solutions: This repository contains my solutions to various programming challenges on Codewars. Each solution is written in the respective language specified by the challenge.
- Updated
Nov 3, 2024 - Python
Сodewars.com Solidity Solution Examples
- Updated
May 26, 2022 - Solidity
Este repositório contém um arquivo JavaScript com a resposta para o kata "Pillars" na categoria 8kyu do Codewars.
- Updated
Dec 8, 2023 - JavaScript
code wars challenge submission repo
- Updated
Mar 29, 2024 - C++
Codewars solutions
- Updated
Dec 8, 2022 - JavaScript
Given a lowercase string that has alphabetic characters only and no spaces, return the highest value of consonant substrings. Consonants are any letters of the alphabet except "aeiou". We shall assign the following values: a = 1, b = 2, c = 3, .... z = 26. For example, for the word "zodiacs", let's cross out the vowels. We get: "z o d ia cs" -- …
- Updated
Jul 6, 2022 - JavaScript
Desafios de sites CodeWars, CoderBye, HackerRank, LeetCode.
- Updated
Dec 10, 2022 - Python
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…
- Updated
Jul 6, 2022 - 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 bal…
- Updated
Jul 6, 2022 - JavaScript
A stream of data is received and needs to be reversed. Each segment is 8 bits long, meaning the order of these segments needs to be reversed, for example: 11111111 00000000 00001111 10101010 (byte1) (byte2) (byte3) (byte4) should become: 10101010 00001111 00000000 11111111 (byte4) (byte3) (byte2) (byte1) The total number of bits will always be a…
- Updated
Jul 6, 2022 - JavaScript
Jaden Smith, the son of Will Smith, is the star of films such as The Karate Kid (2010) and After Earth (2013). Jaden is also known for some of his philosophy that he delivers via Twitter. When writing on Twitter, he is known for almost always capitalizing every word. For simplicity, you'll have to capitalize each word, check out how contractions…
- Updated
Jul 6, 2022 - JavaScript
Write 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. For example (Input --> Output): 39 --> 3 (because 3*9 = 27, 2*7 = 14, 1*4 = 4 and 4 has only one digit) 999 --> 4 (because 9*9*9 = 729, …
- Updated
Jul 6, 2022 - JavaScript
só uns codigo que eu faço quando vou tirar alguma duvida de sintaxe ou algo do tipo usando a linguagem ruby
- Updated
Nov 29, 2022 - Ruby
code wars solution to Counting Valleys on codeWars.com for JavaScript
- Updated
Jul 6, 2022 - JavaScript
Improve this page
Add a description, image, and links to thecode-wars-solution topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thecode-wars-solution topic, visit your repo's landing page and select "manage topics."