ProDeveloperTutorial.com
  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G

ProDeveloperTutorial.com

  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G
ProDeveloperTutorial.com

What are You Looking For?

  • Coding Interview Questions
  • C++ Tutorial
  • 5G NR
  • DataStructure and Algorithms
ProDeveloperTutorial
onJanuary 19, 2025

Binary Trees: Find Duplicate Subtrees

Problem Statement: You are given a binary tree, you need to find all the duplicate sub trees. Example Input : 1 / \ 2 3 / / \ 4 2 4 / 4 Output…
Discover More
ProDeveloperTutorial
onJanuary 19, 2025

Binary Trees: Minimum swap required to convert binary tree to binary search tree

Problem Statement: You are given an array representation of a complete binary tree. You need to find the minimum swaps required to convert…
Discover More
ProDeveloperTutorial
onJanuary 19, 2025

Binary Trees: Construct Binary Tree from preorder and inorder traversal

Problem Statement: You are given 2 arrays with inorder and pre-order. You need to construct a binary tree with the given array. Example Input:…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Binary Trees: Convert Binary tree into Sum tree

Problem Statement: You are given an binary tree, you need to convert into sum tree. Example Solution We can solve this problem with the help…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Binary Trees: Convert Binary Tree to DLL

Problem Statement: You are given a binary tree, you need to convert into DLL. Example In-place convert Binary Tee to a Doubly Linked List 4…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Binary Trees: Diagonal Traversal of a Binary tree

Problem Statement: You are given a binary tree, you need to traverse diagonal and print the nodes. Example   The diagonal traversal is :…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Linked List: Segregate even and odd nodes in a Linked List

Problem Statement: You are given an LL, you need to segregate the list such that all the even number appear before all the odd numbers in the…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Linked List: Delete nodes which have a greater value on right side using recursion

Problem Statement: You are given a LL, you need to remove all the nodes that have a greater value to their right side Example Input: 11 ->…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Linked List: Multiply two numbers represented by Linked Lists

Problem Statement: You are given 2 LL, you need to get the multiplication of the 2 LL. Example Input: 1 -> 2 2 Output: 24 Solution We…
Discover More
ProDeveloperTutorial
onJanuary 18, 2025

Linked List: Flatten a Linked List

Problem Statement: You are given a LL that has below properties: 1. Pointer to the next node in the main list 2. Pointer to a sorted LL with…
Discover More

Posts pagination

Previous 1 … 92 93 94 … 129 Next
ProDeveloperTutorial.com
Tutorials and Programming Solutions
  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G
© 2024 — ProDeveloperTutorial. All Rights Reserved.