The Minimum Absolute Difference Algorithm of an Array
Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pairs in ascending order(with …
Category: brute force
Counting Substrings with Only One Distinct Letter with Different Algorithms
Given a string S, return the number of substrings that have only one distinct letter. Example 1: Input: S = “aaaba” Output: 8 Explanation: The substrings with one distinct …
Bruteforce Algorithm to Find the Next Closet Time Reusing the Current Digits
Given a time represented in the format “HH:MM”, form the next closest time by reusing the current digits. There is no limit on how many times a digit can …
How to Find the K-diff Pairs in an Array with Two Pointer or Hash Map?
Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as …
How to Generate Parentheses using Bruteforce or Depth First Search (Backtracking) Algorithms?
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: We can use the …