Michael Li

Prefix Sum Array

19

## 🚀 Feature An easy to implement an algorithm that calculates range sums. It supports O(1) queries and O(n) updates. ### Have you read the Contribution Guidelines? :+1: ## Pitch...

String Hashing for O(1) queries

2

## 🚀 Feature The trivial way of comparing if two strings are identical is to use the built in function (.equals() in Java); however, this takes O(n) time. When many...

*Longest Common Subsequence

4

## 🚀 Feature The *longestcommon subsequence (LCS for short) is a classic dynamic programming question where you have to find the *lonest subsequence between two strings (usually). It runs in...

Binary Index Tree DS

2

## 🚀 Feature Binary Index Tree, (BIT for short), is a data structure that efficiently updates and queries prefix sums in both O(logN) time. This is a mixture between arrays...