# Category Archives: Algorithms

Given an integer array arr[]. The task is to minimize the number of removals required such that the maximum element in arr[] becomes less than… Read More
Given a matrix, the task is to find the maximum element of each row. Examples:  Input : [1, 2, 3] [1, 4, 9] [76, 34,… Read More
Given a matrix, the task is to find the maximum element of each row. Examples:  Input : [1, 2, 3] [1, 4, 9] [76, 34,… Read More
Given a matrix, the task is to find the maximum element of each row.Examples:  Input : [1, 2, 3] [1, 4, 9] [76, 34, 21]… Read More
Given a matrix, the task is to find the maximum element of each row.Examples:   Input : [1, 2, 3] [1, 4, 9] [76, 34, 21]… Read More
Given a matrix, the task is to find the maximum element of each row.Examples:  Input : [1, 2, 3] [1, 4, 9] [76, 34, 21]… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given an array of integers, you have to find three numbers such that the sum of two elements equals the third element.Examples: Input: {5, 32,… Read More
Given an array of integers, you have to find three numbers such that the sum of two elements equals the third element.Examples: Input: {5, 32,… Read More
Given an array of integers, you have to find three numbers such that the sum of two elements equals the third element.Examples: Input: {5, 32,… Read More
Given an array of integers, you have to find three numbers such that the sum of two elements equals the third element.Examples: Input: {5, 32,… Read More
Given an array of integers, you have to find three numbers such that the sum of two elements equals the third element.Examples: Input: {5, 32,… Read More
Two pointers is really an easy and effective technique which is typically used for searching pairs in a sorted array.Given a sorted array A (sorted… Read More