Coding test was a HackerRank Question sent during the interview. I shared my screen and talked through what I was doing. I was able to get it working minus some outlying cases. I will paraphrase the question. It was called goodSegment. Write a function that takes three inputs. An Upper bound, a Lower bound and then an array of "badNumbers" . The function should iterate through a range starting at the Lower bound iterating through the Upper bound. Count the number of consecutive numbers until you hit until you land on a number that matches one of the numbers in the badNumbers Array. The function should return the count of the largest value of consecutive good numbers through the range. For example if the Lower is 2, Upper is 10 and the bad numbers are [2, 4]. the largest set of consecutive good numbers would be 5-10. So the function should return 5.
