data structure and exercises in leetcode and geekforgeek
# find mid point
mid = (l + r) / 2
l + (r-l)/2 => 2l/2 + (r-l)/2 => (r+l)/2
#
-
nested structure can be handled using
stack
inter-action/leetcode-and-algorithms
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|