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
+16-8
Original file line number
Diff line number
Diff line change
@@ -1211,32 +1211,40 @@ Binary Search is used to solve 2 kinds of problems:
1211
1211
- Watch this [Binary Search conceptual video from Errichto](https://www.youtube.com/watch?v=GU7DpgHINWQ&list=PLl0KD3g-oDOHpWRyyGBUJ9jmul0lUOD80)
1212
1212
1213
1213
Next you have to solve some basic binary search problems.
1214
+
1214
1215
### Binary Search Basic Problems
1215
1216
1216
1217
- Do all basics problems related to binary search [that I have given in this link](https://codepen.io/collection/vBORpO)
1217
1218
- Next do all below advanced problems
1218
1219
1219
1220
### Binary Search Advanced Questions
1220
1221
1221
-
Below problems are lying under optimization problems. Just watch `Book Allocation` and `Aggressive Cows` videos (links are below) to understand optimization logic. Once you understood them after that for rest problems you need to apply same logic. Every iteration you reduce the search space by either maximizing or minimizing the solution.
1222
+
Below problems are lying under optimization problems. Just watch `Book Allocation` and `Aggressive Cows` videos (links are below) to understand optimization logic. Once you understood them after that for rest problems you need to apply same logic. Every iteration you reduce the search space by either maximizing or minimizing the solution.
0 commit comments