# binary search : https://leetcode.com/problems/binary-search/


class Solution:
    def search(self, nums: List[int], target: int) -> int:
        for i, el in enumerate(nums):
            if el == target:
                return i
        return -1

1ef31516a024df388309194eb18951f5a7be420c
<mask token>

class Solution:
    <mask token>

class Solution:

    def search(self, nums: List[int], target: int) ->int:
        for i, el in enumerate(nums):
            if el == target:
                return i
        return -1

# binary search : https://leetcode.com/problems/binary-search/


class Solution:
    def search(self, nums: List[int], target: int) -> int:
        for i, el in enumerate(nums):
            if el == target:
                return i
        return -1
