## Maximum volume of cube for every person when edge of N cubes are given

Given an array of N integers which denotes the edges of N cubical structures respectively. Also given are M integers which denotes the number of… Read More »

- How can one become good at Data structures and Algorithms easily?
- Load Factor and Rehashing
- Rat in a Maze | Backtracking using Stack
- How do Dynamic arrays work?
- Find the node with maximum value in a Binary Search Tree
- Remove last node of the linked list
- Sort the array of strings according to alphabetical order defined by another string
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Number of array elements derivable from D after performing certain operations
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Print all nodes between two given levels in Binary Tree
- Number of special nodes in an n-ary tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Number of sub-strings which are anagram of any sub-string of another string
- Print all odd nodes of Binary Search Tree
- Number of subarrays have bitwise OR >= K
- Delete all the even nodes from a Doubly Linked List
- Check whether the two Binary Search Trees are Identical or Not
- Reverse zigzag Traversal of a Binary Tree
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Sum of all the elements in an array divisible by a given number K
- Sum and Product of minimum and maximum element of Binary Search Tree
- Difference between Stack and Queue Data Structures
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Find maximum among all right nodes in Binary Tree
- Minimum number of edges between two vertices of a graph using DFS

Given an array of N integers which denotes the edges of N cubical structures respectively. Also given are M integers which denotes the number of… Read More »

Given an array of n integers, we have to partition the array into three segments such that all the segments have equal sum. Segment sum… Read More »

Given an array arr[] of size N consisting of distinct integers from range [0, N – 1] arranged in a random order. Also given a… Read More »

Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent… Read More »

Given two arrays arr1[] and arr2[] of sizes N and M where 0 ≤ arr1[i], arr2[i] ≤ 1000 for all valid i, the task is… Read More »

Given an array arr[] of size n. The task is to count the number of possible sub-arrays such that their elements can be re-arranged to… Read More »

Given a number N(1<=N<=2000)., The task is to find the number strings of size N that can be obtained after using characters from 'a' to… Read More »

Given a string S and a range [L, R]. The task is to find the number of ways in which the sub-string in the range… Read More »

Given a connected undirected weighted graph with N nodes and M edges. The task is to perform given queries and find the weight of the… Read More »

Given a string str consisting of characters and numbers and an integer k, the task is to decrypt the string and the return the kth… Read More »

Given an array of positive and negative elements. The task is to replace every i-th element of the array by the absolute difference of absolute… Read More »

Given a string of alphanumeric characters, the task is to check whether the average character of the string is present or not. Average character refers… Read More »

Given an array arr[] of N unique elements and Q queries. Every query consists of two integers L and R. The task is to print… Read More »

Given an array arr[] of N integers, the task is to count the pairs of indices (i, j) such that 0 ≤ i < j… Read More »