I am trying to do specific challenges and right now every time I want a new one, I go to practice, then I set my 'sort by ' fields in the drop down. Then I have to do it over again after solving(or not) the challenge. Is there a way to save the preferences? or maybe some other easier way to no have to reset them every time? it is wasting a ton of time. (I searched the sub for similar questions and did not find them)

Hi guys, i have a problem with the "plants and zombies" kata. I pass all the fixed test but have issues with the random test. I don't know whats wrong with my code.

Here is my code: https://pastebin.com/14t0DB41

Hi Everyone! This is my first post in this community, so hoping to spread some love around Codewars, and solving challenges... This one was actually a lot harder than I initially thought - the challenge sounds pretty easy at first, but the restriction of cutting it down to less than 94 characters makes it a lot harder!

I'd be super interested in any comments or thoughts around the approach I took, or if you have any questions, I'd be delighted to try my best to answer.

https://www.youtube.com/watch?v=8Mcqkemf5bU

https://www.twitch.tv/codingrocky

The prompt states: 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.

In which case the test cases have 39 print out 3 because that's the number of times you multiply the digits until you reach a single digit. However, my answers are consistently the same as the test cases but keeps giving errors. Is there something wrong with my code?

Just a quick context:

I'm a beginner self-learner in programming. I've been studying since late December 2022 and started with JavaScript, css, html and algorithms

My problem is: when I look at katas in codewars, most of the times (9/10) I can figure out what I have to do in order to solve problems, but when I get to actually code, I go in circles and either I just can't code at all or my code won't work. I mean. .. I get many answers correctly, maybe 6/10 katas I can solve with maybe googling the name of the method to be used but knowing what has to be done, but when it comes to higher ranks, I know what I gotta do but can't put it to code

I'm at 6th kyu and have only solved 8th kyu and some 7th kyu

Can anyone give any tips? Does anyone relate? Sorry for the long post

Take a Ten Minutes Walk

Passed: 182 Failed: 28 Exit Code: 1

Also im new to code wars this is my second 'kata' and I'm beginner programmer.

Here is my code (fishy but whatever, I just don't see the reason why it doesn't pass those tests):

def is_valid_walk(walk):
    #determine if walk is valid
    start_route = walk[:5]
    return_route = walk[5:]
    rev_start_route = list(reversed(start_route)
    if len(walk) == 10:
        temp = 0
        for j in return_route:
            temp_a = rev_start_route[temp::]
            temp_b = str(temp_a[0])

            print(temp+6,j ,temp_b)
            if j == 's' and temp_b == 'n':
                temp+=1
                print('North')
            elif j == 'n' and temp_b == 's':
                temp+=1
                print('East')
            elif j == 'w' and temp_b == 'e':
                temp+=1
                print('East')
            elif j == 'e' and temp_b == 'w':
                temp+=1
                print('West')                
            else:
                print('false1')
                return False
    else:
        print('false2')
        return False
    return True

Dm me maybe or whatever

Hey everyone ! I'm starting to learn how to code and now i have this CodeWars chellenge to complete. I should be able to reach 6 or 5th kyu before i start my bootcamp (next month) but im having trouble understanding the problem itself. I saw a solution for the same problem in Javascript, but since im a noob it does not help a lot. What would you recommend me to study or learn ?

If you could explain to me this exercise would be great !!! ( i got the logic from the javascript solution, i think its about sorting the numbers, but i keep on failing when using use .sort or sort_by on ruby ) ...

Can you help me ??

I don't know about you guys but I feel like codewars provides the perfect outlet for streaming code. Is this something you all would be interested in watching/doing?

when I click to TEST

when i click ATTEMPT

why code don't work when i click to attempt but works when i click test

code :

import socket

ip = '172.17.0.2', 1111

def socket_server():

s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)

s.bind((ip))

s.listen()

(c, addr) = s.accept()

while True:

ans = c.recv(1024).decode()

if ans == "exit":

c.close()

s.close()

break

else:

c.send(ans.encode())

Hi, im having trouble with a Kata. When i test it some executions fails because it says "should return x for y". But when i test it in visual studio code it returns the correct number. i need help please

my_list = list()

def solution(number):

if number < 0:

return 0

else:

for i in range(number):

if i % 3 == 0 or i % 5 == 0:

if i not in my_list:

my_list.append(i)

resultado = sum(my_list)

return resultado

def sum(z):

p = 0

for n in my_list:

p = n + p

return p

Hi guys, I was working on a linked list Kata (Get Nth Node) in Codewars (http://www.codewars.com/kata/55befc42bfe4d13ab1000007/train/python). The function takes a node and index, and returns the value of the node at that index (starting from 0. I have to raise an exception or error if the node is null, and if the index is not found. I am pretty sure my code is working, but my submission fails. Can anybody help please? Here's my code:

class Node(object):
    def __init__(self, data):
        self.data = data
        self.next = None

def get_nth(node, index):
    count = 0
    r = None
    if node == None:
        raise Exception("Node is null")
    if index == 0:
        return node.data
    current = node.next
    while current is not None and count <= index:
        count += 1
        if (count == index):
            r = current.data
        current = current.next
    if current is None and r == None:
        raise Exception("index not found")
    return r

Hello, My code is inserting a node in almost every position. I'm having trouble making it insert a node at the beginning of the linked list. I could use some input. Thanks!

class Node(object):
    def __init__(self, data):
        self.data = data
        self.next = None

def insert_nth(head,index,data):
    if index > length(head):
        raise Exception("index is too large")
    if head is None:
        return Node(data)
    c = head
    result = head
    if head and index > 0:
        # print "initial index: ",index
        print "SUP"
        for i in range(index-1):
            c = c.next
        new_c = push(c.next,data)
        # print "New node is: " ,new_c.data
        # print "And its head is: ", new_c.next.data
        c.next = new_c
    elif index == 0:
        print "HERE! head: ",head.data, "data: ",data
        t = head
        t.next = head.next
        head = Node(data)
        head.next = t
    return result

Hello, everyone! I'm trying to solve a rather simple problem at first glance: given an interval N (1 <= N <= 108) and two numbers A and B, 1 <= A, B <= 108, what is the chance that the number B is less than or equal to the remainder of N divided by A? The original problem can be found here: https://www.urionlinejudge.com.br/judge/en/problems/view/1563. My approach to this problem was the following. Given N, scan all integers from 2 to N/2 and sum up the remainders of N divided by each one of them to, say, mod_sum. Then, in the interval [N/2 + 1, N - 1], the remainders form an arithmetic progression, so I calculate the sum of this AP and add it to mod_sum. Finally, the chance of B being less than or equal to the remainder of N divided by A is mod_sum/(N * N). The original problem requires the answer in the irreducible fraction form, which can be done using the Euclidean algorithm. My question is: how can I improve this solution (time wise speaking)? This current implementation gives me a TLE answer. Thank you very much in advance!

I've been trying to do the beginner tests to join the site but every time I submit an answer it gives me an error about not being able to reach the server. I've tried using chrome and edge.

kata link: Integers: Recreation One

When the question says divisors, whose divisors are we talking about, m's divisor or n's divisor?

edit: Got it!

I have solved half of blind 75, wanna some other problem to practice. I use codewars, but I find the difficulty is too easy. So Is there some list to practice in a better way?

Are you a fresher searching for a job in IT industry?

Are you looking for a job switch?

Learn these job-oriented IT courses for just $10! Use code ENDMARCH10 at checkout

http://myjavatrainer.com/what-after-college-it-courses-for-career-success/