Question #109851
Given an array of length n, write an algorithm to determine if there are more than 3 instances of the same item in a row.
Example: 1,2,3,4,5,6,7,8,9 returns false
Example: 1,2,3,4,4,4,5,6,7 returns true
Example: 1,2,3,2,3,2,3,2,3 returns false
Example: 1,2,3,4,5,6,7,8,9 returns false
Example: 1,2,3,4,4,4,5,6,7 returns true
Example: 1,2,3,2,3,2,3,2,3 returns false
Expert's answer
Dear baddy main, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order
Comments