Try it on GfG Practice Given an array arr[] containing only 0s and 1s, find the longest subarray which contains equal no of 0s and 1s. Examples: Input: arr[] = [1, 0, 1, 1, 1, 0, 0] Output: 6 Explanation: arr[1 ... 6] is the longest subarray with three 0s and three 1s. Input: arr[] = [0, 0, 1, 1, 0]…

Given a string str of length n and a 2d array queries[][], where each query queries[i] is of type [i, j]. For each query, your task is to check if the substring str[i:j] is a palindrome. Examples : Input: str = "abaaabaaaba" queries[][] = [ [0, 10], [5, 8], [2, 5], [5, 9] ] Output: 1 0 0 1…

Hash Table supports following operations in O(1) time. 1) Search 2) Insert 3) Delete The time complexity of above operations in a self-balancing Binary Search Tree (BST) (like Red-Black Tree, AVL Tree, Splay Tree, etc) is O(Logn). So Hash Table seems to beating BST in all common operations. When…

Try it on GfG Practice Given an array arr[] of size n and an integer k, return the count of distinct numbers in all windows of size k. Examples: Input: arr[] = [1, 2, 1, 3, 4, 2, 3], k = 4 Output: [3, 4, 4, 3] Explanation: First window is [1, 2, 1, 3], count of distinct numbers is 3. Second window…

Try it on GfG Practice Given an array arr[] of n integers and a target value, the task is to find whether there is a pair of elements in the array whose sum is equal to target. This problem is a variation of 2Sum problem. Examples: Input: arr[] = [0, -1, 2, -3, 1], target = -2 Output: true…

Try it on GfG Practice Given an array arr[] of size n, the task is to find the length of the longest subarray with sum equal to 0. Examples: Input: arr[] = {15, -2, 2, -8, 1, 7, 10, 23} Output: 5 Explanation: The longest subarray with sum equals to 0 is {-2, 2, -8, 1, 7} Input: arr[] = {1, 2, 3}…

Try it on GfG Practice Given an array arr[] of distinct integers. The task is to determine if there exist two pairs (a, b) and (c, d) such that a + b = c + d, where a, b, c, and d are distinct elements. Note: If multiple solutions exist, return any one valid pair. Examples: Input: arr[] = [3, 4, 7,…

Try it on GfG Practice Given two singly Linked Lists, create union and intersection lists that contain the union and intersection of the elements present in the given lists. Each of the two linked lists contains distinct node values. Note: The order of elements in output lists doesn’t matter.…

This post explores the fundamental properties of a binary tree, covering its structure, characteristics, and key relationships between nodes, edges, height, and levels Binary tree representation Note: Height of root node is considered as 0. Properties of Binary Trees 1. Maximum Nodes at Level 'l' A…

A binary tree is a tree that has at most two children for any of its nodes. There are several types of binary trees. To learn more about them please refer to the article on "Types of binary tree" Applications: General Applications DOM in HTML: Binary trees help manage the hierarchical structure of…

A Binary Tree Data Structure is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. It is commonly used in computer science for efficient storage and retrieval of data, with various operations such as insertion, deletion, and…

Tree is a non-linear data structure. It consists of nodes and edges. A tree represents data in a hierarchical organization. It is a special type of connected graph without any cycle or circuit. Advantages of Tree: Efficient searching: Trees are particularly efficient for searching and retrieving…

A tree is a type of data structure that represents a hierarchical relationship between data elements, called nodes. The top node in the tree is called the root, and the elements below the root are called child nodes. Each child node may have one or more child nodes of its own, forming a branching…

Menu Back to Explore Page

Menu Back to Explore Page

A tree in data structures is a hierarchical data structure that consists of nodes connected by edges. It is used to represent relationships between elements, where each node holds data and is connected to other nodes in a parent-child relationship. Types of Trees Tree The main types of trees in data…

Tree data structure is a hierarchical structure that is used to represent and organize data in the form of parent child relationship. The following are some real world situations which are naturally a tree. Folder structure in an operating system.Tag structure in an HTML (root tag the as html tag)…

Given a Binary Tree, The task is to convert it to a Doubly Linked List keeping the same order. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be the same as in Inorder for the given Binary Tree. The…

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree and two nodes. The task is to count the number of turns needed to reach from one node to another node of the Binary tree. Examples: Input: Below Binary Tree and two nodes 5 & 6 1 / \ 2 3 / \ / \ 4 5 6 7 / / \ 8 9 10 Output: Number of Turns needed to reach…

Try it on GfG Practice Given a binary tree and an integer k, the task is to count the number of paths in the tree such that the sum of the nodes in each path equals k. A path can start from any node and end at any node and must be downward only. Examples: Input: k = 7 Output: 3 Table of Content…

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Try it on GfG Practice Given a Binary Tree, the task is to return the size of the largest subtree which is also a Binary Search Tree (BST). If the complete Binary Tree is BST, then return the size of the whole tree. Examples: Input: Output: 3 Explanation: The below subtree is the maximum size BST:…

Try it on GfG Practice Given a Binary Tree where every node has data, a next pointer, a right pointer, and a random pointer. The random pointer points to any random node of the binary tree and can even point to NULL, the task is to clone the given binary tree. Example: Approach: The idea is to use…

Menu Back to Explore Page

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree with a value associated with each node, we need to choose a subset of these nodes such that the sum of selected nodes is maximum under a constraint that no two chosen nodes in the subset should be directly connected, that is, if we have taken a node in our…

Menu Back to Explore Page

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree, the task is to check if it is a Sum Tree. A Sum Tree is a Binary Tree where the value of a node is equal to the sum of the nodes present in its left subtree and right subtree. An empty tree is Sum Tree and the sum of an empty tree can be considered as 0. A…

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page