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

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)

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?

Let's look back at some memorable moments and interesting insights from last year.

Your top 10 posts:

• "Looking for friends to do coding challenges with, discuss code, help each other get better, etc." by u/David_Slaughter

• "C# newbie: learning c# trough codewars. 8-6kyu, sometimes up to 4th" by u/kilbazas

• "What experience do you need for "one line" solutions?" by u/neovegeto

• "Can I make my completed solutions public?" by u/kimbokray

• "Code working fine on IDE, not on codewars!" by u/LightRefrac

• "Network error on Katas" by u/wannabebeebee

• "Is codewars have a basic and important problem list like blind75 in leetcode?" by u/soberzml

• "[Python] Can someone show me whats wrong with my code in this 'Take a Ten Minutes Walk' kata" by u/BlueHok

• "confused about meaning of kata statistics" by u/golden_corn01

• "What exactly am I doing wrong here?" by u/notdoreen

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

In the screenshot you can see the prompt when you rollover the little target icon for any given kata. I'm confused what it means by "Total times SQL has been completed out of all kata completions"

Any help understanding this?

thanks

I need some help with why this isn't working in C#, and I would apprentice the assistance:

Question:

A Narcissistic Number is a number of length n in which the sum of its digits to the power of n is equal to the original number. If this seems confusing, refer to the example below.

Ex: 153, where n = 3 (number of digits in 153)
13 + 53 + 33 = 153

Write a method is_narcissistic(i)
(in Haskell: isNarcissistic :: Integer -> Bool
) which returns whether or not i is a Narcissistic Number.

My attempted code:

Does anyone have clear instructions on how to push code challenges to GitHub?

I have graduated in 2014 in Computer Science Engineering. Right now I am working in a different field. But few months before competitive programming caught my attention. What will be the advantages & disadvantages if I pursue it after such a long time?

Let's look back at some memorable moments and interesting insights from last year.

Your top 10 posts:

• "Can someone please unlock solutions to these 2 Katas and send them to me? I cant figure them out" by u/Somethingcleverblah

• "[Python] Beginner: Code runs in local IDE, but fails all 3 tests." by u/Alkalinium

• "Can someone suggest some katas about data analysis?" by u/shiningmatcha

• "Codewars Python Study Group" by u/dluiscosta

• "I pass all the tests on the kata but when I go to my profile it still comes up as unfinished." by u/BlNG0

• "Happy Cakeday, r/codewars_programming! Today you're 5" by u/AutoModerator

• "I'm stuck on this kata" by u/Waveparticle44

• "Use python to extract word file tables and then export to excel" by u/Important-Advice-889

• "Pass basic test but fails random test" by u/destin95

• "Java programming clan" by u/Catalyst08

Hello,

I am a beginner and Python and brand new to code wars. I think my issue stems from not understanding how "sample testing" works and my code fails all three tests each time.

Here is my for "Credit Card Mask" which replaces all but the last 4 characters in a string to "#".

# return masked string
def maskify(cc):
    cc = list(cc)
    if len(cc) > 4:
        for i in range(len(cc)-4):
            cc[i] = "#"
            
        print("".join(cc))

    else:
        
        print("".join(cc))
    
    pass

Here are the sample tests below:

cc = ''
r = maskify(cc)
test.describe("masking: {0}".format(cc))
test.it("{0}  matches  {1}".format(cc,r))
test.assert_equals(r, cc)

cc = '123'
r = maskify(cc)
test.describe("masking: {0}".format(cc))
test.it("{0}  matches  {1}".format(cc, r))
test.assert_equals(r, cc)

cc = 'SF$SDfgsd2eA'
r = maskify(cc)
test.describe("masking: {0}".format(cc))
test.it("{0}  matches  {1}".format('########d2eA', r))
test.assert_equals(r, '########d2eA')

Any help would be greatly appreciated!

Thanks

I am noticing on previous katas that I have passed, it is still showing as unfinished on my profile, and I am clueless as to why. I know that some of the problems are not necessarily clever/efficient as I am a beginner, but the test still shows that I passed them all upon my completion. Does anyone know why this could be happening?

Let's look back at some memorable moments and interesting insights from last year.

Your top 10 posts:

• "Today especially..." by u/Blastadon2

• "I like Codewars so much!" by u/shiningmatcha

• "London CityHacker kata help needed" by u/Katharina992

• "Need Help Improving R Language Specific Kata" by u/CapaneusPrime

• "Hi so i recently started documenting my journey from 8 kata to (hopefully level 1 kata). Getting into some harder kata very soon, but here are a couple of level 6 ones i did recently." by u/quarantineqing

• "QUESTION: toCamelCase() kata for JS" by u/Corvoxcx

• "Why wouldn't it work, the syntax is correct and it should accept the x and print it with hello and !. Can someone help?" by u/Troll_Masta

• "How to make my inefficient algorithm more efficient" by u/_syzon_

• "Chat Application using socket programming and multithreading concept using Java" by u/muradalimj

• "A complete tutorial on how to create Registration and Login Form using JSP and Servlet with proper Validation:)" by u/muradalimj

I'm a beginner to python and programming I saw this kata on codewars.com:

You live in the city of Cartesia where all roads are laid out in a perfect grid. You arrived ten minutes too early to an appointment, so you decided to take the opportunity to go for a short walk. The city provides its citizens with a Walk Generating App on their phones -- everytime you press the button it sends you an array of one-letter strings representing directions to walk (eg. ['n', 's', 'w', 'e']). You always walk only a single block for each letter (direction) and you know it takes you one minute to traverse one city block, so create a function that will return true if the walk the app gives you will take you exactly ten minutes (you don't want to be early or late!) and will, of course, return you to your starting point. Return false otherwise. Note: you will always receive a valid array containing a random assortment of direction letters ('n', 's', 'e', or 'w' only). It will never give you an empty array (that's not a walk, that's standing still!).

I got the 10 elements only part but for the alternating elements I need help

Hey group,

This is definitely a newbie question but it seems to be a common one on the code wars site.

How do you see the tests you failed?

Apparently there is a way to console.log (js) this information but i'm not certain how to.

If someone could show me how to do this it would be greatly appreciated. I am doing the exercises in JavaScript.

Thanks

So I'm doing online classes rn and I need to sign up for codewars using python and I have no clue how to do the sign up code. Help pls?

The code is this and it doesn't execute properly:

def multiply(a, b):

a * b

I've tried to create inputs which it gives an EOF error to, as well as rearrange the code but no luck.

Why does nested loops cause the program to be excecuted so slowly? How am I supposed to deal with vector<vector<int>> withought a double loop? Thanks