(nums, num)
| 24 | }; |
| 25 | |
| 26 | const isStreak = (nums, num) => { |
| 27 | for (let i = 0; i < nums.length; i++) { |
| 28 | /* Time O(N) */ |
| 29 | const isEqual = nums[i] === num; |
| 30 | if (isEqual) return true; |
| 31 | } |
| 32 | |
| 33 | return false; |
| 34 | }; |
| 35 | |
| 36 | /** |
| 37 | * Sort - HeapSort Space O(1) | QuickSort Space O(log(K)) |
no outgoing calls
no test coverage detected