## Easy way to check an array for contiguous three or more numbers in Swift

Is there any easy way to check if an array contains contiguous value of three or more? e.g. `[4, 2, 1, 1, 1, 7, 4, 4, 4, 4]`

contains two contiguous sequence of 1 and 4. To check I wish to give 1 and minimum allowed conjugation, in this case 2, it will just return `true`

. Thanks.

**Get Array Size in Swift - count function - Examples,** How do I find the length of an array in Swift? We have discussed different solutions for distinct elements in below post. Check if array elements are consecutive. A simple solution is to first sort the array. Then traverse the array to check if all consecutive elements differ at most by one.

I think the simplest possible way is with the help of the reduce function. If you want you can extend the data structures, but I am not quite a fan of that. So here is a simple solution to your example

// example array let a = [4, 2, 1, 1, 1, 7, 4, 4, 4, 4] let minRepeats = 3 // desired min repeats let elementToCheck = 4 // element to check let m = a.reduce(0) { (initial: Int, el: Int) -> Int in if initial >= minRepeats { return initial } else { return el == elementToCheck ? initial + 1 : 0 } } // if m == minRepeats the check is positive, if m < minRepeats the check is negative // let check = a.reduce(0){...} == minRepeats gives you the right result // Thanks to user3441734 for the correction

**Check if the array elements are consecutive,** How do you know if an array has consecutive elements? Use the capacity and count properties to determine how many more elements the array can store without allocating larger storage. For arrays of most Element types, this storage is a contiguous block of memory. For arrays with an Element type that is a class or @objc protocol type, this storage can be a contiguous block of memory or an instance of NSArray.

The answers above were helpful but not quite as generic as I needed. Also, they are a little outdated, so for those who come across this requirement, here's a generic reusable Swift 4.2 implementation:

An extension on any `Collection`

that returns an array of ranges representing the indices of consecutive elements in a collection matching a given predicate.

https://gist.github.com/shaps80/8ec24f82ad1e54d42709277ec2af93a3

**Check if array elements are consecutive,** Check if array elements are consecutive | Added Method 3. Given an unsorted array of numbers, write a function that returns true if array consists of consecutive numbers. Driver program to test above functions */ Maximum sum such that no two elements are adjacent · Leaders in an array · Count Inversions in an array Check if it is possible to sort an array with conditional swapping of adjacent allowed; Count the number of ways to divide an array into three contiguous parts having equal sum; k-th distinct (or non-repeating) element in an array. Sort an array after applying the given equation; Count pairs (a, b) whose sum of cubes is N (a^3 + b^3 = N)

**Swift programming exercises: Array,** The array length should be 1 or more. 3. Write a Swift program to test if two given arrays of integers have the same first Write a Swift program to test if a given array of integers contains three increasing adjacent numbers. Check if array elements are consecutive | Added Method 3. Given an unsorted array of numbers, write a function that returns true if array consists of consecutive numbers. Examples: a) If array is {5, 2, 3, 1, 4}, then the function should return true because the array has consecutive numbers from 1 to 5. b) If array is {83, 78, 80, 81, 79, 82}, then the function should return true because the array has consecutive numbers from 78 to 83.

**Array,** Swift makes it easy to create arrays in your code using an array literal: simply An array of 'Int' elements let oddNumbers = [1, 3, 5, 7, 9, 11, 13, 15] // An array of Using a negative number or an index equal to or greater than count triggers a For arrays of most Element types, this storage is a contiguous block of memory. Divide the array in blocks of size sqrt (n). Make a count array which stores the count of element for each block. as default. For the elements belonging to the selected block, use the method of hashing (explained in next step) to find the repeating element in that block.

**ArraySlice,** For more information about using arrays, see Array and ContiguousArray For example, suppose you have an array holding the number of absences index into an indexOf method to find the second day, in Swift you perform the Print the results using the indices found in steps 1 and 3 on the original absences array. Naive solution would be to check if every element in the array is repeated or not using nested for loops. The time complexity of this solution would be O(n2). // Generic function to check for duplicates in an array private static <T> boolean checkForDuplicates(T array)