Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

All Problems

# Status Problem Level Completes Likes
386

Dynamic Programming - Maximum Subarray Problem

Medium % 0
387

Convert Binary Tree into Threaded Binary Tree

Hard % 0
388

Double Threaded Binary Tree Complete Implementation

Hard % 0
389

Single Threaded Binary Tree Complete Implementation

Hard % 0
390

Introduction to Threaded Binary Tree

Medium % 0
391

Implement Stack Using Linked List

Beginner % 0
392

Doubly Linked List Complete Implementation

Beginner % 0
393

Circular Linked List Complete Implementation

Beginner % 0
395

Convert BST to Greater Sum Tree

Medium % 0
396

Reverse Alternative 'k' nodes in a Linked List.

Medium % 0
397

Reverse a Linked List in groups of given size 'K'

Medium % 0
398

Generate Maximum revenue by selling K tickets from N windows

Medium % 0
399

Binary Tree-Postorder Traversal - Non Recursive Approach

Beginner % 0
400

Binary Tree - Preorder Traversal - Non Recursive Approach

Beginner % 0
401

Binary Tree-Inorder Traversal - Non Recursive Approach

Beginner % 0
402

Delete the Binary Tree

Beginner % 0
403

Search the Element in a binary tree - With and Without Recursion

Beginner % 0
404

Find the Size of a Binary Tree without Recursion

Beginner % 0
405

Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number

Hard % 0
406

Dynamic Programming - Longest Common Substring

Medium % 0
407

Dynamic Programming - Longest Common Subsequence

Medium % 0
408

Generate Well Ordered Passwords of a Given Length K

Medium % 0
409

All N Length Strings from Given String of Length K

Medium % 0
412

Dynamic Programming - Subset Sum Problem

Hard % 0
413

The Word Break Problem

Hard % 0
414

Backtracking - Knight's Tour Problem

Hard % 0
415

Backtracking - Search a Word In a Matrix

Hard % 0
416

Backtracking - N Queens Problem - Better Solution

Hard % 0
417

Backtracking - N Queens Problem

Hard % 0
418

Find the Kth Smallest/Largest Element in an Array

Beginner % 0
419

Priority Queue in Data Structure

Beginner % 0
420

Breadth-First Search/Traversal in a Binary Tree

Beginner % 0

Dynamic Programming - Maximum Subarray Problem

Convert Binary Tree into Threaded Binary Tree

Double Threaded Binary Tree Complete Implementation

Single Threaded Binary Tree Complete Implementation

Introduction to Threaded Binary Tree

Implement Stack Using Linked List

Doubly Linked List Complete Implementation

Circular Linked List Complete Implementation

Convert BST to Greater Sum Tree

Reverse Alternative 'k' nodes in a Linked List.

Reverse a Linked List in groups of given size 'K'

Generate Maximum revenue by selling K tickets from N windows

Binary Tree-Postorder Traversal - Non Recursive Approach

Binary Tree - Preorder Traversal - Non Recursive Approach

Binary Tree-Inorder Traversal - Non Recursive Approach

Delete the Binary Tree

Search the Element in a binary tree - With and Without Recursion

Find the Size of a Binary Tree without Recursion

Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number

Dynamic Programming - Longest Common Substring

Dynamic Programming - Longest Common Subsequence

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

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix

Backtracking - N Queens Problem - Better Solution

Backtracking - N Queens Problem

Find the Kth Smallest/Largest Element in an Array

Priority Queue in Data Structure

Breadth-First Search/Traversal in a Binary Tree