Commit e5b5944

authored

1 parent 2c67b48 commit e5b5944Copy full SHA for e5b5944

File tree

-4

lines changed

-4

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
@@ -46,7 +46,7 @@ Let's say we have an array of prices `[7, 6, 4, 3, 1]` and we're on the _1st_ da
`46`	`46`	1. _Option 1: Keep the money_ → profit would equal to the profit from buying/selling the rest of the stocks → `keepProfit = profit([6, 4, 3, 1])`.
`47`	`47`	2. _Option 2: Buy/sell at current price_ → profit in this case would equal to the profit from buying/selling the rest of the stocks plus (or minus, depending on whether we're selling or buying) the current stock price → `buySellProfit = -7 + profit([6, 4, 3, 1])`.
`48`	`48`
`49`		-The overall profit would be equal to → `overalProfit = Max(keepProfit, buySellProfit)`.
	`49`	+The overall profit would be equal to → `overallProfit = Max(keepProfit, buySellProfit)`.
`50`	`50`
`51`	`51`	As you can see the `profit([6, 4, 3, 1])` task is being solved in the same recursive manner.
`52`	`52`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -59,7 +59,7 @@ and return false.`
`59`	`59`	`queen here leads to a solution.`
`60`	`60`	`b) If placing queen in [row, column] leads to a solution then return`
`61`	`61`	`true.`
`62`		`- c) If placing queen doesn't lead to a solution then umark this [row,`
	`62`	`+ c) If placing queen doesn't lead to a solution then unmark this [row,`
`63`	`63`	`column] (Backtrack) and go to step (a) to try other rows.`
`64`	`64`	`3) If all rows have been tried and nothing worked, return false to trigger`
`65`	`65`	`backtracking.`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -93,7 +93,7 @@ three factors: the size of the bloom filter, the`
`93`	`93`	`number of hash functions we use, and the number`
`94`	`94`	`of items that have been inserted into the filter.`
`95`	`95`
`96`		`-The formula to calculate probablity of a false positive is:`
	`96`	`+The formula to calculate probability of a false positive is:`
`97`	`97`
`98`	`98`	`( 1 - e <sup>-kn/m</sup> ) <sup>k</sup>`
`99`	`99`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -279,7 +279,7 @@ export default class Heap {`
`279`	`279`	`/* istanbul ignore next */`
`280`	`280`	`pairIsInCorrectOrder(firstElement, secondElement) {`
`281`	`281`	throw new Error(`
`282`		`- You have to implement heap pair comparision method`
	`282`	`+ You have to implement heap pair comparison method`
`283`	`283`	`for ${firstElement} and ${secondElement} values.`
`284`	`284`	`);
`285`	`285`	`}`

Comments

(0)