• 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
cacr Avatar
Name:Chris
Clan:Leonteq Securities AG
Skills:scala, java, aikibudo, silat
Member Since:Mar 2016
Last Seen:Apr 2025
Profiles:
Following:7
Followers:10
Allies:7
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations (121)
  • Replies
  • Authored
  • Needs Resolution
  • Custom User Avatar
    • cacr
    • resolved an issue on "N-Point Crossover" kata
    • 4 months ago

    thanks, it should be fixed now

  • Custom User Avatar
    • KayleighWasTaken
    • created an issue for "N-Point Crossover" kata
    • 4 months ago

    Description:`

    • crossover : Int -> 'a list -> 'a list -> 'a list * 'a list should be crossover : int list -> 'a list -> 'a list -> 'a list * 'a list
  • Custom User Avatar
    • have2b
    • commented on "Multiples of 3 or 5" rust solution
    • 4 months ago

    Using (3..num) maybe better?

  • Custom User Avatar
    • monadius
    • commented on ""Concatenate two list" OCaml Translation"
    • 8 months ago

    Rejected: the solution is trivial

  • Custom User Avatar
    • KayleighWasTaken
    • commented on ""Longest Common Subsequence" Scala Translation"
    • 9 months ago

    Old test framework, old language version. Rejected.

  • Custom User Avatar
    • piotaixr
    • commented on "Highest and Lowest" rust solution
    • 12 months ago

    This does two iterations where the solution can be found with only one.

  • Custom User Avatar
    • thebluetropics
    • commented on "Multiples of 3 or 5" rust solution
    • 13 months ago

    modulo operation was expensive isn't it? it can be done without using module operation at all..

  • Custom User Avatar
    • UponTheSky
    • commented on "Highest and Lowest" rust solution
    • 2 years ago

    This is I guess the best answer

  • Custom User Avatar
    • michaelzalewski
    • commented on "Multiples of 3 or 5" rust solution
    • 2 years ago

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

  • Custom User Avatar
    • RPG-Alex
    • commented on "Highest and Lowest" rust solution
    • 2 years ago

    This seems like a thing of beauty

  • Custom User Avatar
    • Awesome A.D.
    • resolved a suggestion on "N-Point Crossover" kata
    • 2 years ago

    approved.

  • Custom User Avatar
    • Awesome A.D.
    • created a suggestion for "N-Point Crossover" kata
    • 2 years ago

    Rust translation ready for review.

  • Custom User Avatar
    • monkey_on_a_keyboard_1
    • resolved an issue on "N-Point Crossover" kata
    • 2 years ago
  • Custom User Avatar
    • australian
    • commented on "Detect Pangram" java solution
    • 2 years ago

    This is really fucking smart

  • Custom User Avatar
    • qmstuart
    • commented on "N-Point Crossover" kata
    • 2 years ago

    Yeah, I have not got a clue from the description what I've actually to do.

    It badly needs a decent worked example.

    I thought I understood it until this line:

    The transformed first chromosome must appear at the first position of the tuple. the second one at the second position. Therefore :

    Crossover([]int { 1 }, []int {1,2,3}, []int {10,11,12}) should be ([]int { 1,11,12 }, int[] { 10,2,3 })

    What is this saying ?

  • Loading more items...
  • © 2025 Codewars
  • About
  • API
  • Blog
  • Privacy
  • Terms
  • Code of Conduct
  • Contact

Confirm

  • Cancel
  • Confirm

Collect: undefined

Loading collection data...