## Check if the bracket sequence can be balanced with at most one change in the position of a bracket | Set 2

Given a bracket sequence as a string str, the task is to find whether the given string can be balanced by moving at most one… Read More »

- Coin Change | BFS Approach
- Repeated Character Whose First Appearance is Leftmost
- Count the triplets such that A[i] < B[j] < C[k]
- Complexity Analysis of Binary Search
- Minimum number of times A has to be repeated such that B is a substring of it
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Pair with largest sum which is less than K in the array
- Implement a Dictionary using Trie
- Minimum steps required to reach the end of a matrix | Set 2
- Count duplicates in a given linked list
- Find the Nth term divisible by a or b or c
- Sort an array of strings based on the frequency of good words in them
- Longest string in an array which matches with prefix of the given string
- Square root of a number without using sqrt() function
- Maximum length palindromic substring such that it starts and ends with given char
- Create a Sorted Array Using Binary Search
- Find the winner of the match | Multiple Queries
- Queries to find the first non-repeating character in the sub-string of a string
- Implementation of BFS using adjacency matrix
- Minimize the number of steps required to reach the end of the array | Set 2
- Find the position of the given row in a 2-D array
- Length of longest subarray in which elements greater than K are more than elements not greater than K
- Search in a trie Recursively
- Number of subarrays having absolute sum greater than K | Set-2
- Count of strings in the first array which are smaller than every string in the second array
- Maximum possible middle element of the array after deleting exactly k elements
- Find a partition point in array to maximize its xor sum
- Find Leftmost and Rightmost node of BST from its given preorder traversal
- Length of the largest substring which have character with frequency greater than or equal to half of the substring

Given a bracket sequence as a string str, the task is to find whether the given string can be balanced by moving at most one… Read More »

Given an array arr[] of N elements, the task is to find the count of triplets (arr[i], arr[j], arr[k]) such that (arr[i] + arr[j] +… Read More »

Given N ranges [L, R] and an integer K, the task is to check if there are any K ranges which overlap at any point.… Read More »

Given four integers A, B, C and K. Assume that all the multiples of A, B and C are stored in a set in sorted… Read More »

Given Q queries where each query consists of an integer N and the task is to find the smallest integer greater than N such that… Read More »

Quickselect is a selection algorithm to find the k-th smallest element in an unordered list. It is related to the quick sort sorting algorithm. Examples:… Read More »

Sentinal Linear Search as the name suggests is a type of Linear Search where the number of comparisons are reduced as compared to a traditional… Read More »

Given an array arr[] of strings containing the names of employees in a company. Assuming that the names are being entered in a system one… Read More »

Breadth First Search (BFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be… Read More »

Depth First Search (DFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be… Read More »

Given an array arr[] of N positive integers, the task is to calculate the absolute difference between XOR of non-prime numbers and prime numbers. Note… Read More »

Given an array arr[] of N elements, the task is to check if the array has an element which is equal to the XOR of… Read More »

Given an array arr[] of size N. For every element in the array, the task is to find the index of the farthest element in… Read More »

The m-way search trees are multi-way trees which are generalised versions of binary trees where each node contains multiple elements. In an m-Way tree of… Read More »

Given an array arr[] of length N. The task is to find the length of the longest subarray in which elements greater than a given… Read More »