Remove adjacent duplicate characters from a string
Given a string, remove adjacent duplicates characters from it. In other words, remove all consecutive same characters except one.
Tag: Easy
Add elements of two arrays into a new array
Given two arrays of positive integers, add their elements into a new array. The solution should add both arrays, one by one starting from the 0th index, and split the sum into individual digits if it is a 2–digit number
Find the maximum occurring word in a given set of strings
Given a huge set of words with duplicates present, find the maximum occurring word in it. If two words have the same count, return any one of them.
How to Boost QuickSort Performance?
Quicksort performance can be boosted in several ways. In this post, we will cover a few of them.
Maximum Sum Subarray Problem (Kadane’s Algorithm)
Given an integer array, find a contiguous subarray within it that has the largest sum using Kadane’s algorithm.
Find the maximum product of two integers in an array
Given an integer array, find the maximum product of two integers in it. For example, consider array {-10, -3, 5, 6, -2}. The maximum product is the (-10, -3) or (5, 6) pair.
Move all zeros present in an array to the end
Given an integer array, move all zeros present in it to the end. The solution should maintain the relative order of items in the array and should not use constant space.
Find majority element (Boyer–Moore Majority Vote Algorithm)
Given an integer array containing duplicates, return the majority element if present. A majority element appears more than n/2 times, where n is the array size.
Find equilibrium index of an array
Given an integer array, find the equilibrium index in it. For an array A consisting n elements, index i is an equilibrium index if the sum of elements of subarray A[0…i-1] is equal to the sum of elements of subarray A[i+1…n-1].
Find a pair with the given sum in an array
Given an unsorted integer array, find a pair with the given sum in it.
Sort binary array in linear time
Given a binary array, sort it in linear time and constant space. The output should print all zeros followed by all ones.
Find k’th largest node in a BST
Given a BST and a positive number k, find the k’th largest node in the BST.