Commit b7ca5ce

committed

2 sum

1 parent 6dbbd10 commit b7ca5ceCopy full SHA for b7ca5ce

File tree

+26

-3

lines changed

+26

-3

lines changed

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -40,9 +40,10 @@`
`40`	`40`
`41`	`41`
`42`	`42`
`43`		`-`
`44`		`-`
`45`		`-`
	`43`	`+## Array Easy`
	`44`	`+\| # \| Title \| Solution \| Time \| Space \| Video\|`
	`45`	`+\| --- \| ----- \| -------- \| ---- \| ----- \| ---- \|`
	`46`	`+\|1\| [Two Sum](https://leetcode.com/problems/two-sum/) \| [Python](./array/1.py) \| _O(n)_\| _O(n)_ \|https://www.youtube.com/watch?v=uajne4jeGaA\|`
`46`	`47`
`47`	`48`
`48`	`49`

Lines changed: 14 additions & 0 deletions

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,8 @@`
	`1`	`+What's the motivation behind the problem?`
	`2`	`+How could you use it to solve real-world problems?`
	`3`	`+What are the insights, the clever observations made on the problem's constraints that make the solution possible?`
	`4`	`+What details of the problem does the solution take advantage of to get that extra performance gain / space saving?`
	`5`	`+Where does the algorithm / data-structure / solution suck?`
	`6`	`+How could you make it better?`
	`7`	`+What do you lose and gain by doing so?`
	`8`	`+For the specific problem at hand, which solution presents the most acceptable trade-offs?`

Comments

(0)