## Queries to find the last non-repeating character in the sub-string of a given string

Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »

- How can one become good at Data structures and Algorithms easily?
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Sort the array of strings according to alphabetical order defined by another string
- Find the first maximum length even word from a string
- Zig-Zag traversal of a Binary Tree using Recursion
- Number of array elements derivable from D after performing certain operations
- Number of special nodes in an n-ary tree
- Print all odd nodes of Binary Search Tree
- Reverse zigzag Traversal of a Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Difference between Stack and Queue Data Structures
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Number of subarrays have bitwise OR >= K
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Number of sub-strings which are anagram of any sub-string of another string
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Reverse Level Order traversal in spiral form
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Minimum number of edges between two vertices of a graph using DFS
- Minimum length substring with exactly K distinct characters
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Maximum length of the sub-array whose first and last elements are same
- Count the number of nodes at a given level in a tree using DFS
- Sum of minimum elements of all possible sub-arrays of an array
- Minimum value to add to arr[i] so that an array can be split at index i with equal sum
- Sum of all the Boundary Nodes of a Binary Tree
- Multidimensional Collections in Java

Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose sum of digits of weights… Read More »

Given an array arr[] of positive integers, the task is to find whether it is possible to make this array strictly increasing by modifying atmost… Read More »

Given two integers N and M, the task is to print an N x M matrix such that each row and column contain all the… Read More »

Given a matrix mat[][], the task is to check if the given matrix is strictly increasing or not. A matrix is said to be strictly… Read More »

Given an array arr[] of N integers from 1 to N. The task is to perform the following operations N – 1 times. Select two… Read More »

Given a linked list and two integers p and q, the task is to divide the linked list in the ratio p:q i.e. the first… Read More »

Given a string str, the task is to check whether the string contains two non-overlapping sub-strings s1 = “geek” and s2 = “keeg” such that… Read More »

Given an integer array arr[], the task is to check if that array contains all the divisor of some integer. Examples: Input: arr[] = {… Read More »

Given a tree and the weights of all the nodes, the task is to count the number of nodes whose weights are even parity i.e.… Read More »

Given a string str, the task is to check whether the given string is made up of only two alternating characters. Examples: Input: str =… Read More »

Given an array of n integers, the task is to make two Binary Search Tree from the given array (in any order) such that the… Read More »

Given an alphanumeric string str, the task is to sort the string in such a way that if a position is occupied by an alphabet… Read More »

Given two linked list of equal sizes, the task is to create new linked list using those linked lists where at every step, the maximum… Read More »

Given an array arr[] of non-negative integers. We have to delete elements from this array such that arr[i + 1] > arr[j] for each valid… Read More »