## Append a digit in the end to make the number equal to the length of the remaining string

Given a string str in which an integer is appended in the end (with or without leading zeroes). The task is to find a single… Read More »

- Data Structures and Algorithms Online Courses : Free and Paid
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Why companies like Amazon, Microsoft, Google focuses on Data Structures and Algorithms : Answered
- Zig-Zag traversal of a Binary Tree using Recursion
- Find the first maximum length even word from a string
- Insertion and Deletion in Heaps
- Difference between Stack and Queue Data Structures
- Reverse zigzag Traversal of a Binary Tree
- Reverse Level Order traversal in spiral form
- Number of special nodes in an n-ary tree
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Minimum length substring with exactly K distinct characters
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Print Stack Elements from Bottom to Top
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Iterative Postorder traversal | Set 3
- LCA in a tree using Binary Lifting Technique
- Find the longest string that can be made up of other strings from the array
- Find maximum in stack in O(1) without using additional stack
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Minimum number of edges between two vertices of a graph using DFS
- Sum of all the Boundary Nodes of a Binary Tree
- Count the number of nodes at a given level in a tree using DFS
- Print all leaf nodes of a binary tree from right to left
- Two nodes of a BST are swapped, correct the BST | Set-2
- Sum of nodes in bottom view of Binary Tree
- Sum of maximum elements of all possible sub-arrays of an array
- Print all internal nodes of a Binary tree

Given a string str in which an integer is appended in the end (with or without leading zeroes). The task is to find a single… Read More »

Given a 2-D matrix mat[][], the task is to print it in the spiral form. Examples: Input: mat[][] = { {1, 2, 3, 4}, {5,… Read More »

Given an array arr[] and two integers X and K. The task is to perform the following operation on array K times: Sort the array.… Read More »

Given a tree with N nodes and N-1 edges with root at 1 and given an array of N-1 integers. The task is to assign… Read More »

Given an array a of size N and an integer K, the task is to divide the array into K segments such that sum of… Read More »

Given an array a of size N. The task is to merge all elements in the array and find the maximum possible value. One can… Read More »

Given a tree and a node, the task is to reverse the path till the given Node and print the in-order traversal of the modified… Read More »

Given two string s1 and s2, the task is to check if characters of the first string can be mapped with the character of the… Read More »

Given two integers X (1 ≤ X ≤ 15) and Y. The task is to find an array of the maximum possible length N such… Read More »

Implement a dictionary using Trie such that if the input is a string representing a word, the program prints its meaning from the prebuilt dictionary.… Read More »

Given two string arrays s1[] and s2[]. The task is to find the count of pairs (s1[i], s2[j]) such that s1[i] = s2[j]. Note that… Read More »

Given a binary array arr[], the task is to find the length of the longest sub-array of the given array such that if the sub-array… Read More »

Given an integer array arr of size N. The task is to find the maximum possible elements in the array which are divisible by 2… Read More »

Given an array arr[] and two integers K and D, the task is to find exactly K pairs (arr[i], arr[j]) from the array such that… Read More »

Given an array of size N and an integer K. The task is to partition the array in K segments such that bitwise AND of… Read More »