Skip to content

8.01 Triple step #77

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 13 commits into from
May 24, 2021
Merged

8.01 Triple step #77

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
e395595
tripleStep Backtracking, Top Down and Bottom up memoization implement…
Oct 22, 2020
306b9cb
removed comments
Oct 22, 2020
f22ccd7
removed more comments
Oct 22, 2020
a8b15b9
8.01 tripleStep O(1) or constant space
Nov 7, 2020
8fcc717
removed multi-line comment
Nov 7, 2020
71c9eeb
less bloating code for triple step
Nov 7, 2020
bd53d3d
constant space solution
Nov 7, 2020
87ad856
tripleStep version 2
Mar 1, 2021
432fab6
Merge branch 'master' of https://github.com/careercup/CtCI-6th-Editio…
Mar 1, 2021
6b354dd
original and tripleStepv2
Mar 1, 2021
2d4fb25
formatted code
Mar 1, 2021
876f811
added TEST comment
Mar 1, 2021
b1c471c
added whitespace so both origin files are the same
Mar 1, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
removed more comments
  • Loading branch information
Carlos Green committed Oct 22, 2020
commit f22ccd780457de4d6e4f8a87dc937852726d80c0
4 changes: 0 additions & 4 deletions chapter08/8.01 - Triple Step/tripleStep.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,19 +11,16 @@ var tripleStep = function(n, res=0) {

// Top Down Memoization
// Time & Space O(n)
/*
var tripleStep = function(n, i=3, memo = [1, 1, 2, 4]) {
if (n < 0) return memo[0]
if (n === 1) return memo[n]
if (i > n ) return memo[memo.length - 1]
memo[i] = memo[i - 1] + memo[i - 2] + memo[i - 3]
return tripleStep(n, i+1, memo)
}
*/

// Bottom Up memoization
// Time & Space O(n)
/*
var tripleStep = function(n, memo=[1,1,2,4]) {

for (let i = 3; i <= n; i++) {
Expand All @@ -32,7 +29,6 @@ var tripleStep = function(n, memo=[1,1,2,4]) {

return memo[memo.length - 1]
}
*/

/* TEST */
console.log(tripleStep(1), 1);
Expand Down