filmov
tv
Two Sum - Input Array Is Sorted - Leetcode 167 - All solutions explained! (Kotlin)

Показать описание
Let's solve some sample interview questions together!
167. Two Sum II - Input Array Is Sorted
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number.
Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.
The tests are generated such that there is exactly one solution. You may not use the same element twice. Your solution must use only constant extra space.
Actual question:
Timecodes
00:00 - Introduction
03:00 - Binary search solution O(nlog(n))
09:38 - O(n) time complexity solution!
#leetcode
#kotlin
#twopointer
167. Two Sum II - Input Array Is Sorted
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number.
Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.
The tests are generated such that there is exactly one solution. You may not use the same element twice. Your solution must use only constant extra space.
Actual question:
Timecodes
00:00 - Introduction
03:00 - Binary search solution O(nlog(n))
09:38 - O(n) time complexity solution!
#leetcode
#kotlin
#twopointer