All Questions
6 questions
1
vote
0
answers
374
views
Codewars: Path Finder
Task
You are at position [0, 0] in maze NxN and you can only move in one of the four cardinal directions (i.e. North, East, South, West). Return true if you can reach position [N-1, N-1] or false ...
3
votes
1
answer
569
views
Find A Series of Numbers Who when Squared and Summed are equal to a given Square
I am working on a CodeWars titled 'Square into Squares. Protect trees!' it can be found here: https://www.codewars.com/kata/54eb33e5bc1a25440d000891/train/javascript
I have a working solution, the ...
- 169
4
votes
1
answer
553
views
React.js Nested Nav Bar
This was written for a coding challenge for a company I recently starting working for. I'm looking for any suggestions on how to clean up the code, as well as any issues anyone thinks may occur as it ...
- 41
3
votes
1
answer
336
views
Hand crafted longest common sub sequence
I know that the below solution is not the best one and I am in the way to learn that stuff till then I have applied the brute force to see how far I can go with my intuition.
...
- 5,177
3
votes
4
answers
1k
views
Finding the max sequence finder
Problem Statement
Find the max sequence finder.
findMaxSequence([3, 2, 3, 4, 2, 2, 4]);
...
- 3,401
5
votes
5
answers
7k
views
Finding complementary pairs
I've read the docs online explaining Log N and I do understand that the basic concept of it, but I'm still not sure I've managed to nail it.
The problem
This exercise is called "Complementary ...
- 233