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
351

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
352

Convert Binary Tree into Threaded Binary Tree

Hard % 0
353

Double Threaded Binary Tree Complete Implementation

Hard % 0
354

Single Threaded Binary Tree Complete Implementation

Hard % 0
355

Introduction to Threaded Binary Tree

Medium % 0
356

Implement Stack Using Linked List

Beginner % 0
357

Doubly Linked List Complete Implementation

Beginner % 0
358

Circular Linked List Complete Implementation

Beginner % 0
360

Convert BST to Greater Sum Tree

Medium % 0
361

Shortest Range in K-sorted Lists

Hard % 1
362

Reverse Alternative 'k' nodes in a Linked List.

Medium % 0
363

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

Medium % 0
364

Generate Maximum revenue by selling K tickets from N windows

Medium % 0
365

Get the Sum of all left leaves in a Binary tree

Beginner % 1
366

Convert binary tree to its Sum tree

Medium % 1
367

Binary Tree-Postorder Traversal - Non Recursive Approach

Beginner % 0
368

Binary Tree - Preorder Traversal - Non Recursive Approach

Beginner % 0
369

Binary Tree-Inorder Traversal - Non Recursive Approach

Beginner % 0
370

Delete the Binary Tree

Beginner % 0
371

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

Beginner % 0
372

Tree Traversals

Beginner % 1
373

Find the Size of a Binary Tree without Recursion

Beginner % 0
374

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
375

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 1
376

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

Hard % 0
377

Dynamic Programming - Longest Common Substring

Medium % 0
378

Dynamic Programming - Longest Common Subsequence

Medium % 0
379

Dynamic Programming - Rod Cutting Problem

Medium % 1
380

Dynamic Programming - Coin Change Problem

Medium % 1
381

Dynamic Programming - Minimum Cost Path Problem

Medium % 1
382

Generate Well Ordered Passwords of a Given Length K

Medium % 0
383

All N Length Strings from Given String of Length K

Medium % 0

Kadane's Algorithm - 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

Shortest Range in K-sorted Lists

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

Get the Sum of all left leaves in a Binary tree

Convert binary tree to its Sum tree

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

Tree Traversals

Find the Size of a Binary Tree without Recursion

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Maximum Product Cutting Problem.

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

Dynamic Programming - Rod Cutting Problem

Dynamic Programming - Coin Change Problem

Dynamic Programming - Minimum Cost Path Problem

Generate Well Ordered Passwords of a Given Length K

All N Length Strings from Given String of Length K