You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+11-3Lines changed: 11 additions & 3 deletions
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,6 @@
1
-
# Leetcode Solutions
1
+
# Leetcode Notes
2
2
3
-
## Two Pointer
3
+
## Two Pointers
4
4
<div>
5
5
<p> In this approach two pointers move towards or opposite to each other.
6
6
It does not divide the search space logarithmicaly.
@@ -12,4 +12,12 @@
12
12
<p> In this approach we continuosly divide search space into two halves.
13
13
It divides the search space logarithmicaly.
14
14
</p>
15
-
</div>
15
+
</div>
16
+
17
+
## Dynamic Programming
18
+
<div>
19
+
<p> In this approach, we store the results of overlapping subproblems to avoid redundant calculations. It optimizes recursive solutions by using memoization (top-down) or tabulation (bottom-up).
20
+
</p>
21
+
</div>
22
+
23
+
See my <ahref="https://leetcode.com/u/khemssharma/">Leetcode Profile</a>
0 commit comments