4.3 Longest palindromic substring (Manacher's algorithm) O(n) int dp[HHH]; int lengthLongestPalindromSubstring(string& s) { memset(dp, 0, sizeof(dp)); int ans = 0; int pivot = 1; int len = s.length() * 2; // _s0_s1_s2 = 2 * length for (int i = 1; i < len; i+...
Union Find is a useful algorithm for graph DSU for integers class DSU: def __init__(self, N): self.par = list(range(N)) def find(self, x): # Find Parent if self.par[x] != x: self.par[x] = self.find(self.par[x]) return self.par[x] def union(self, x, y): xr, yr...
When using a sequence comparison algorithm, test and reference sequences are entered into a computer, subsequence coordinates are designated, if necessary, and sequence algorithm program parameters are designated. Default program parameters can be used, or alternative parameters can be designated. The ...
989 Another array reconstruction algorithm E2 1900 Q# 06 July 2018 17:45:55 988 Distinguish four 2-qubit states - 2 B4 1700 Q# 06 July 2018 17:23:38 987 Bernstein-Vazirani algorithm E1 1500 Q# 06 July 2018 16:27:07 986 Distinguish four 2-qubit states B3 1600 Q# 06 July 2018 16:22...
5 5. Longest Palindromic Substring.java Medium [DP, String] O(n^2) O(n^2) Java 342 303 303. Range Sum Query - Immutable.java Easy [DP, PreSum] O(1) query, O(n) setup O(n) Java 343 674 674. Longest Continuous Increasing Subsequence.java Easy [Array, Coordinate DP, DP, Sliding...