# Youtube

youtube

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

# Flatten A Nested Object

Flatten a nested object that contains arrays and objects as children. The task is to make the object flat, i.e. there should be no nested children lef...

Easy

# BST Traversal

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

Easy

# Remove Duplicates From a Linked List

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

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

Hard

# Command Palette

Create a Command Palette that opens up with Keyboard events like Command + K. In this problem, The command palette will have navigation links to which...

Medium

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