# Arrays

Array-based problems

Medium

# Spiral Traversal

Given a 2D matrix of numbers, return a spiral traversal of the matrix in the clockwise direction.

Easy

# Product Sum

Given an array (that can have nested arrays) - return the sum of all the numbers in the array. If nested array is encountered, recursively add the num...

Easy

# Non Repeating First Character

Given a string of characters, return the index of the first non-repeating character.

Easy

# Move Element

Given an array of integers and a target value, move all instances of that target value to the end end of the array. The order of the resulting array d...

Medium

# Maximum Subset Sum With No Adjacent

Given an array of POSITIVE INTEGERS, find the greatest sum that can be generated without adding 2 numbers positioned next to each other.

Easy

# Multiple Filters

Given a list of products and a list of filters, create a multi-filters buttons bar with a list of filters. If any of the filter is clicked, the list o...

Easy

# Form Validation

Create a Form Component in React that renders out a list of input fields and validates them before finally submitting the form. Create the form from s...

Easy

# Nth Fibonacci

Given an integer n, return the nth Fibonacci number. In mathematics, the Fibonacci numbers form a sequence called the Fibonacci sequence - In which ea...

Easy

# Smallest Difference

Given two arrays of integers, find the pair of values (one value in each array) with the smallest (non-negative) difference.

Medium

# Number of Ways To Make Change

Given a target amount and a set of denominations (coins), find the total number of ways the given target amount can be expressed by using the denomina...

Medium

# Minimum Number Of Coins To Make Change

Given an array of coins or denominations and a target sum, calculate the minimum number of coins required to match the total. Note that the coins arra...