Easy

# Monotonic Arrays

A monotonic array is an array whose elements, from left to right, are entirely non-increasing, or entirely non-decreasing. Return true if the given ar...

Medium

# Polyfills

A polyfill is a code snippet (in terms of javascript web architecture) used for modern world functionalities on older browsers that do not implement i...

Medium

# Spiral Traversal

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

Easy

# Three Number Sum

Given an array of integers, find three integers in the array that sum to a specific target number.

Hard

# Countdown Timer

A countdown timer has hours, minutes, and seconds that count down to 0 when started. In this problem, you are required to create a Countdown component...

Easy

# Remove Duplicates From a Linked List

Given a sorted linked list, delete all duplicates such that each element appear only once.

Easy

# Binary Search

Given an array of sorted integers in ascending order, and a target integer, write a function to search target in nums array. If target exists, return ...

Easy

# Guess The Output I

Given a set of instructions in javascript, guess the output of the given code snippet. It will have promises, setTimeout(), setInterval(), and other a...

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...

Easy

# Typewriter Effect

A Typewriter Effect is something where a piece of text constructs itself with some milliseconds in delay. You will see the text getting generated from...

Easy

# Countries List with Debounce

Debouncing is a method of preventing a function from being invoked too often, and instead of waiting a certain amount of time until it was last called...

Medium

# Find Successor

Given the root of a binary tree and a node in it, return the in-order successor of that node in the BST. If the given node has no in-order successor i...

Easy

# Depth First Search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting s...