source string | points list | n_points int64 | path string | repo string |
|---|---|---|---|---|
class Solution(object):
def searchLeftMost(self, nums, target):
# init with len, instead of len - 1, to handle corner case or one-element array
l, r = 0, len(nums)
while l != r:
m = (l + r) // 2
if nums[m] >= target:
r = m
else:
... | [
{
"point_num": 1,
"id": "has_nested_function_def",
"question": "Does this file contain any function defined inside another function?",
"answer": false
},
{
"point_num": 2,
"id": "every_function_has_docstring",
"question": "Does every function in this file have a docstring?",
"ans... | 3 | binary_search/34_find_first_and_last_position_of_element_in_sorted_array.py | shawlu95/Algorithm-Toolbox |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.