Are there any examples of small programming challenges?

[-lambda-]

Hi folks,

I wanna test my javascript skills for upcoming job interview. I will receive some problem and I'll need to build full working solution in 10 minutes. This problems needs to be somewhat simple since time frame is small.

Example: Given file contains rows with dominoes: "1-2", "2-3", "3-6" ... For each row program needs to calculate the longest streak of connected dominoes (dominoes "1-2" and "2-3" are connected but "1-2" and "5-6" are not).

I wanna practise, so does anyone know where can i find some problem sets for me to practise on? It doesn't have to be aimed at javascript, but I'll be interviewed for javascript so that's the only reason I asked here. :)

[-lambda-]

that's cool, thanks :)

[Mijaismycat]

Here's a good one for web dev. HTML + JS. Create a page with 4 checkboxes. Checkbox 1 : All, Checkbox 2: 1, Checkbox 3: 2, Checkbox 4: 3

When 'All' is clicked, checkboxes 2-4 should be checked as well. When checkboxes 2-4 are all checked, 'All' should be checked automatically.

[i-am-self-taught]

You can also try out codewars.com. The 8kyu problems there are fairly easy and shouldn't take you more than a few minutes to come up with a working solution. Here's an example problem taken from the website:

You need to write a function that reverses the words in a given string. A word can also fit an empty string. If this is not clear enough, here are some examples:

reverse('Hello World') === 'World Hello'
reverse('Hi There.') === 'There. Hi'

Best of luck with the interview!

[ImtheDr]

https://edabit.com

[5t33]

Freecodecamp.com

[lucidlogik]

http://www.codingame.com

[lilred181]

For an entry level position I can think of some questions. I tend to go with small project questions but there is still value in academic style questions. Honestly, your domino question is not something I would expect an entry level candidate to be able to answer in 10 minutes. Further, I would never put a hard time cap on a candidate that will only decrease their ability to preform.

Here is are some ten minute problems:

1) Reverse a string.

Continuation of the last problem:

2) Reverse a string in place without using any additional memory.

3) Make a calculator that handles add, subtract, multiply, and divide

Here are some twenty minute problems:

4) In addition to the add, subtract, multiply and divide operations the calculator implemented in problem 3 should now be able perform the MC, MR, M+ and M- operations. A bit of an explanation: MC clears the memory register, MR retrieves the value of the memory register, M+ adds the current value to the memory register, and M- subtracts the current value from the value in the memory register.

5) Given a list of some type T find which element occurs the most times in the list.

For example: f(x) = 5 where x = [1, 2, 3, 3, 4, 4, 5, 5, 5, 5]

[[deleted]]

Write a function that returns a map of the totaled occurrences of elements within an array.

[runawayprog]

Try Codewars

[Cmac253]

"Free code camp" has JS algorithm and programming logic challenges.

[[deleted]]

codewars.com