Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

solutions for coderbyte coding challenges

NotificationsYou must be signed in to change notification settings

Liangmp/coderbyte-solution

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Here are my solutions for coding challenges incoderbyte.

Hope you have fun with these coding challenges.

Keep updating.

Easy:

  • CheckNums
  • Longest Word
  • Time Convert
  • Alphabet Soup
  • First Reverse
  • Simple Adding
  • Letter Changes
  • Simple Symbols
  • First Factorial
  • Letter Capitalize
  • Correct Path
    • I hate bruteforce!
  • Scale Balancing
  • Vowel Square
    • Simple searching.
  • Closest Enemy II
    • The key to solve this challenge is to handle wrappingl.
  • Question Marks

Medium:

  • Eight Queens
    • This challenge only asks you to determine if there is any attack, which is much simpler than to find solutions that no queen attacking each other as described inwikiedia.

Hard

  • Kaprekars Constant
  • Chessboard Traveling
    • It's all about permutation.
  • Maximal Square
    • I think this one is very hard when it comes to matrix and filter, and how to handle filter movement within a matrix by pure code without using some matrix handling library.
    • Since coderbyte uses python2, and my own laptop uses python3, I have 2 versions of the code.
    • For python2 version, you can just copy and paste the code on to thecoderbyte online editor and test the code.
    • For python3, you can run it on your own computer. You need to copy and paste the test case on strArr, for example:strArr = ["0111", "1111", "1111", "1111"]
    • You can uncomment theprint() to have a close monitor on how it works. Have fun!
  • Pentagonal Number
    • Although it is a hard challenge, it is not hard at all. All you need to do is to find the regular pattern of how the pentagon grows.

About

solutions for coderbyte coding challenges

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages


[8]ページ先頭

©2009-2025 Movatter.jp