How to Compute the Number of Equivalent Domino Pairs?
Given a list of dominoes, dominoes = is equivalent to dominoes = if and only if either (a==c and b==d), or (a==d and b==c) – that is, one domino …
Category: brute force
Two Pointer Algorithm to Find Maximum Two Sum Less Than K
June 30, 2019
algorithms, brute force, c / c++, data structure, Hash Map / Hash Set, python, Two Pointer
1 Comment
Given an array A of integers and integer K, return the maximum S such that there exists i < j with A + A = S and S < …
Algorithms to Find the Missing Element in Sorted Array
Given a sorted array A of unique numbers, find the K-th missing number starting from the leftmost number of the array. Example 1: Input: A = , K = …
Algorithms to Find Maximum Size Subarray (Contiguous) Sum That Equals k
Given an array nums and a target value k, find the maximum length of a Contiguous subarray that sums to k. If there isn’t one, return 0 instead. The …
Powerful Integers by Bruteforce Algorithm using C++
Given two positive integers x and y, an integer is powerful if it is equal to x^i + y^j for some integers i >= 0 and j >= 0. …