Problems

# Status Problem Level Completes Likes
36

Dynamic Programming - Coin Change Problem

Medium % 0
37

Generate Well Ordered Passwords of a Given Length K

Medium % 0
38

All N Length Strings from Given String of Length K

Medium % 0
39

Dynamic Programming - Subset Sum Problem

Hard % 0
40

The Word Break Problem

Hard % 0
41

Dynamic Programming - Longest Increasing Subsequence

Medium % 0
42

Sort Names by their Last Names.

Beginner % 0
43

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 0
44

Dynamic Programming - Minimum Coin Change Problem

Medium % 0
45

Find the Height of a tree without using Recursion

Medium % 0
49

Generate All Strings of n bits.

Medium % 0
50

Alternate Splitting of a given Linked List

Medium % 0
51

Reverse The Doubly Linked List

Medium % 0
53

Delete X Nodes After Y Nodes In a Linked List

Beginner % 0
54

Merge Sort in a Linked list

Medium % 0
55

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
56

Inorder Predecessor and Successor in Binary Search Tree

Hard % 0
57

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Medium % 0
58

Search an Element in a Rotated Sorted Array

Medium % 0
60

Find the Maximum Depth OR Height of a Binary Tree

Beginner % 0

Dynamic Programming - Coin Change Problem

Generate Well Ordered Passwords of a Given Length K

All N Length Strings from Given String of Length K

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Dynamic Programming - Longest Increasing Subsequence

Sort Names by their Last Names.

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Find the Height of a tree without using Recursion

Generate All Strings of n bits.

Alternate Splitting of a given Linked List

Reverse The Doubly Linked List

Delete X Nodes After Y Nodes In a Linked List

Merge Sort in a Linked list

Construct a binary tree from given Inorder and Level Order Traversal

Inorder Predecessor and Successor in Binary Search Tree

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Search an Element in a Rotated Sorted Array

Find the Maximum Depth OR Height of a Binary Tree