## Find minimum operations needed to make an Array beautiful

Given a binary array( consider it as cyclic with start and end tied together) of length N having only one’s and zero’s where . The… Read More »

- Recursive Practice Problems with Solutions
- Sum of cousins of a given node in a Binary Tree
- Abstract Data Types
- Load Factor and Rehashing
- Maximize the total profit of all the persons
- Insert a node at a specific position in a linked list
- Sum of all the elements in an array divisible by a given number K
- Rat in a Maze | Backtracking using Stack
- Sum of the minimum elements in all connected components of an undirected graph
- Inorder predecessor and successor for a given key in BST | Iterative Approach
- Delete all the even nodes from a Doubly Linked List
- Find the node with maximum value in a Binary Search Tree
- Print all nodes between two given levels in Binary Tree
- Find the maximum node at a given level in a binary tree
- Applications of Graph Data Structure
- How do Dynamic arrays work?
- Check whether the two Binary Search Trees are Identical or Not
- Find the product of last N nodes of the given Linked List
- Check if Queue Elements are pairwise consecutive | Set-2
- Number of Counterclockwise shifts to make a string palindrome
- Check if concatenation of two strings is balanced or not
- Check if a binary tree is sorted level-wise or not
- Leftover element after performing alternate Bitwise OR and Bitwise XOR operations on adjacent pairs
- Subtree of all nodes in a tree using DFS
- Find if given vertical level of binary tree is sorted or not
- Self Referential Structures
- Sum and Product of minimum and maximum element of Binary Search Tree
- Check if the elements of stack are pairwise sorted
- Product of all the elements in an array divisible by a given number K
- Check if there exists any sub-sequence in a string which is not palindrome

Given a binary array( consider it as cyclic with start and end tied together) of length N having only one’s and zero’s where . The… Read More »

Given a N X N matrix consisting of characters. Also given are Q queries, where each query contains a co-ordinate (X, Y). For every query,… Read More »

In queue, insertion and deletion happen at the opposite ends, so implementation is not as simple as stack. To implement a queue using array, create… Read More »

Given an integer and two integer arrays H[] and C[] of size where H[] stores the height of consecutive buildings and C[] stores the color… Read More »

Given two arrays div and rem which hold the values for divisors and remainders, the task is to find the number which after being successively… Read More »

Given a string of length consisting of lowercase alphabets. The task is to find the number of such substrings whose characters occur in alphabetical order.… Read More »

Given an array of integers arr, the task is to find the running absolute difference of elements at even and odd index positions separately. Note:… Read More »

Given an integer n and an array of characters S, the task is to generate Lyndon words of length n having characters from S. A… Read More »

Given a singly circular linked list. The task is to find the sum and product of nodes which are divisible by K of the given… Read More »

Given an array A[] of integers. The task is to print all indices of this array such that after removing the ith element from the… Read More »

Given an array A[] of N non-negative integers. Find an Integer greater than 1, such that maximum array elements are divisible by it. In case… Read More »

Given an array A[] of integers. The task is to count the total number of strictly decreasing subarrays( with size > 1 ). Examples: Input… Read More »

Given a square matrix of odd order N. The task is to find the side-length of the largest square formed in the matrix. A square… Read More »

Given an array of integers and a number K. The task is to sort only those elements of the array which yields remainder P upon… Read More »

Delete all odd position nodes from circular linked list Given a Singly Circular Linked List, starting from the first node delete all odd position nodes… Read More »