• Sign Up
    Time to claim your honor
  • Training
  • Practice
    Complete challenging Kata to earn honor and ranks. Re-train to hone technique
  • Freestyle Sparring
    Take turns remixing and refactoring others code through Kumite
  • Community
  • Leaderboards
    Achieve honor and move up the global leaderboards
  • Chat
    Join our Discord server and chat with your fellow code warriors
  • Discussions
    View our Github Discussions board to discuss general Codewars topics
  • About
  • Docs
    Learn about all of the different aspects of Codewars
  • Blog
    Read the latest news from Codewars and the community
  • Log In
  • Sign Up
Skratch Avatar
Name:Unknown
Clan:Unknown
Member Since:Aug 2015
Last Seen:Dec 2015
Profiles:
Following:0
Followers:2
Allies:0
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations
  • Replies
  • Authored
  • Needs Resolution (8)
  • Custom User Avatar
    • YurichBRO
    • created an issue for "Triangulate a konvex polygon" kata
    • 10 days ago

    1 should be an acceptable answer to n=3 as there a single way to triangulate a triangle - do not do anything. I don't get why you chose not to consider this.

  • Custom User Avatar
    • ASM.teleco
    • created an issue for "Triangulate a konvex polygon" kata
    • 2 months ago

    Python.
    I think it's important to say that n is the number of vertices the polygon has.
    If the above is true, then the phrasing 'For n=2, possible_triangulations(2) returns 2,' Doesn't make any sense. To return 2, n should be 4; and when n = 2, it should return 'Not a valid polygon'.

  • Custom User Avatar
    • farhanaditya
    • created an issue for "Hamming Distance - Part 1: Binary codes" kata
    • 4 years ago

    JS Test Case: Missing describe blocks.

  • Custom User Avatar
    • ejini战神
    • created an issue for "Triangulate a konvex polygon" kata
    • 4 years ago

    Python new test framework should be used (Refer this for more detail)

  • Custom User Avatar
    • FArekkusu
    • created an issue for "You look like a classy instance! Show me what you've got! - Part 1" kata
    • 6 years ago

    No random tests.

  • Custom User Avatar
    • user2228739
    • created a suggestion for "Triangulate a konvex polygon" kata
    • 7 years ago

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar
    • Voile
    • created an issue for "Triangulate a konvex polygon" kata
    • 7 years ago

    10 random tests are not enough, considering that it's very unlikely to have tests at the lower range (1 <= n <= 100) except the three fixed tests.

  • Custom User Avatar
    • Voile
    • created an issue for "Triangulate a konvex polygon" kata
    • 7 years ago

    Description is inconsistent with fixed tests:

    If the number of vertices is less than 4, return 'Not a valid polygon'.

    but

    Examples: For n=2, possible_triangulations(2) returns 2, as there are two ways to triangulate a rectangle.

    Also, returning mixed data type is a bad practice.

  • © 2025 Codewars
  • About
  • API
  • Blog
  • Privacy
  • Terms
  • Code of Conduct
  • Contact

Confirm

  • Cancel
  • Confirm

Collect: undefined

Loading collection data...