Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
@24th-Dragon
Usually simpler than that. You're supposed to ask what the criteria for a valid word is, and implement a function to check according to what they state.
It'll be something like "three letter word has to have a vowel in the middle," so the comp set of chars for pos 1 is 6/5 chars wide, positions 0 and 2 are 20/21 chars wide. The bonus pivot there is "is y a vowel?"
It's also generally faster if you convert everything to numbers (char code or discrete enum) which would get you more points.
Stackoverflow.
When you have a super annoying problem that Google has been unable to help with... But you stumble upon a link...
I am preparing for interviews and brushing up on my algorithms. I understand what BFS and DFS do, but trying to transform the word
CAB to DOG
...and making sure each time you change the word it's a valid word... Like what the fuck? Who thinks of these problems.
I am getting very discouraged when it comes to these "Medium" problems (or at least like this). I don't know how to approach them. Reading the solution just feels like cheating and I should be able to get there by myself.
Can anyone help me not feel discouraged? I just feel very shitty right now.
rant
practice
interview
ugh