- Notifications
You must be signed in to change notification settings - Fork39
Liangmp/coderbyte-solution
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Here are my solutions for coding challenges incoderbyte.
Hope you have fun with these coding challenges.
Keep updating.
- 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
- 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.
- 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 the
print()
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
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Releases
No releases published
Packages0
No packages published