Three Consecutive Odds - Array - Easy - LeetCode
💻 coding

Three Consecutive Odds - Array - Easy - LeetCode

1 min read 94 words
1 min read
ShareWhatsAppPost on X
  • 1The function checks for three consecutive odd numbers in an integer array.
  • 2It returns true if such a sequence exists, otherwise it returns false.
  • 3The solution has a time complexity of O(n) and a space complexity of O(1).

AI-generated summary · May not capture all nuances

Key Insight
AskGif

"The function checks for three consecutive odd numbers in an integer array."

Three Consecutive Odds - Array - Easy - LeetCode

Given an integer array arr, return true if there are three consecutive odd numbers in the array. Otherwise, return false.

Example 1:

Input: arr = [2,6,4,1] Output: false Explanation: There are no three consecutive odds. Example 2:

Input: arr = [1,2,34,3,4,5,7,23,12] Output: true Explanation: [5,7,23] are three consecutive odds.

Constraints:

1 <= arr.length <= 1000 1 <= arr[i] <= 1000

public class Solution {
 public bool ThreeConsecutiveOdds(int[] arr) { 
 if(arr.Length<3){
 return false;
 }
 for(int i=2;i<arr.Length;i++){
 if(arr[i-2]%2==1 && arr[i-1]%2==1 && arr[i]%2==1){
 return true;
 }
 }
 return false;
 }
}

Time Complexity: O(n)

Space Complexity: O(1)

Enjoyed this article?

Share it with someone who'd find it useful.

ShareWhatsAppPost on X

sumitc91

Published on 27 September 2020 · 1 min read · 94 words

Part of AskGif Blog · coding

You might also like

Three Consecutive Odds - Array - Easy - LeetCode | AskGif Blog