Google

Google

Easy

20 minutes

Implement Currying

Create a function `sum` that implements currying. Currying is a transformation of functions that translates a function from being callable as f(x, y, ...

Medium

60 minutes

Folder Structure

Given a data object resembling a folder structure, create a folder structure UI resembling that of VS code with appropriate functionalities.

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

30 minutes

Invert Binary Tree

Given a binary tree, invert the binary tree - Inverting a binary tree means that the resulting binary tree should be a mirror replica of the input bin...

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

Medium

30 minutes

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

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

Easy

30 minutes

BST Traversal

Given a Binary Search Tree, Traverse the tree in Preorder, Postorder, and inorder traversal.

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

35 minutes

BST Construction

Construct a Binary Search Tree and implement that implements insert, search, traverse and delete methods.

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

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

Medium

30 minutes

Levenshtein Distance

Given 2 strings, find the minimum number of operations required to change one string to the other. An operation is defined as either replacement of a ...