Computational-Techniques on maladroit.dev

Computational technique

Mon, 01 Jan 0001 00:00:00 +0000

Computational Technique

Pre-computation

Mon, 01 Jan 0001 00:00:00 +0000

Pre-computation

When the computational algorithm that is to be applied to a sub-array of the array is involved or complex, it can be advantageous to take advantage of pre-computation. This can take the shape of prefix/suffix operation or using hashing.

Recursion

Mon, 01 Jan 0001 00:00:00 +0000

Recursion

Recursion is a problem solving strategy that involves breaking a problem down into smaller and smaller pieces and using those solutions collectively to find the original solution. All recursive functions have at least these two parts:

A base case where the recursion stops
Breaking the problem down and calling the function recursively

Techniques

Memoization

Some recursive functions may end up calling the same function multiple times. When possible, store the results of previously calculated functions and re-use the to improve efficiency.

Traverse from right

Mon, 01 Jan 0001 00:00:00 +0000

Traverse-from-right

Occasionally it can be effect to traverse an array from right to left instead of left to right.

Two pointers

Mon, 01 Jan 0001 00:00:00 +0000

Two pointers

The two pointers technique is a generalization of the Sliding-window technique. The primary difference is that the two pointers can cross over one another and could reference different arrays.

Common use cases

Palindromic sub-strings
Sorting colors
Merging sorted arrays