MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / initMemo

Function initMemo

javascript/1143-Longest-Common-Subsequence.js:20–21  ·  view source on GitHub ↗
(text1, text2)

Source from the content-addressed store, hash-verified

18}
19
20var initMemo = (text1, text2) => new Array((text1.length + 1)).fill()/* Time O(N) | Space O(N) */
21 .map(() => new Array((text2.length + 1)).fill(null)); /* Time O(M) | Space O(M) */
22
23var dfs = (text1, text2, p1, p2, memo) => {
24 const left = longestCommonSubsequence(text1, text2, (p1 + 1), p2, memo); /* Time O(N * M) | Space O(HEIGHT) */

Callers 1

longestCommonSubsequenceFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected