Problems

# Status Problem Level Completes Likes
351

Doubly Linked List Complete Implementation

Beginner % 0
352

Circular Linked List Complete Implementation

Beginner % 0
354

Convert BST to Greater Sum Tree

Medium % 0
355

Shortest Range in K-sorted Lists

Hard % 1
356

Reverse Alternative 'k' nodes in a Linked List.

Medium % 0
357

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

Medium % 0
358

Generate Maximum revenue by selling K tickets from N windows

Medium % 0
359

Get the Sum of all left leaves in a Binary tree

Beginner % 0
360

Convert binary tree to its Sum tree

Medium % 1
361

Binary Tree-Postorder Traversal - Non Recursive Approach

Beginner % 0
362

Binary Tree - Preorder Traversal - Non Recursive Approach

Beginner % 0
363

Binary Tree-Inorder Traversal - Non Recursive Approach

Beginner % 0
364

Delete the Binary Tree

Beginner % 0
365

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

Beginner % 0
366

Tree Traversals

Beginner % 0
367

Find the Size of a Binary Tree without Recursion

Beginner % 0
368

Dynamic Programming — Longest Palindromic Subsequence

Hard % 0
369

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 0
370

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

Hard % 0
371

Dynamic Programming - Longest Common Substring

Medium % 0
372

Dynamic Programming - Longest Common Subsequence

Medium % 0
373

Dynamic Programming - Rod Cutting Problem

Medium % 0
374

Dynamic Programming - Coin Change Problem

Medium % 0
375

Dynamic Programming - Minimum Cost Path Problem

Medium % 0
376

Generate Well Ordered Passwords of a Given Length K

Medium % 0
377

All N Length Strings from Given String of Length K

Medium % 0
380

Dynamic Programming - Maximum size square sub-matrix with all 1s

Medium % 0
381

Dynamic Programming - Subset Sum Problem

Hard % 0
382

The Word Break Problem

Hard % 0
383

Dynamic Programming - Longest Increasing Subsequence

Medium % 0
384

Backtracking - Knight's Tour Problem

Hard % 0
385

Backtracking - Search a Word In a Matrix

Hard % 0

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

Dynamic Programming - Maximum size square sub-matrix with all 1s

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Dynamic Programming - Longest Increasing Subsequence

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix