Facebook

Facebook

Easy

30 minutes

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

Easy

60 minutes

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

60 minutes

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

Easy

30 minutes

Three Number Sum

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

Medium

30 minutes

Spiral Traversal

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

Medium

45 minutes

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

30 minutes

Remove Duplicates From a Linked List

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

Easy

30 minutes

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

30 minutes

Smallest Difference

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

Easy

30 minutes

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

Medium

30 minutes

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