nkhi / dailycodingproblem

🧩📆 Daily algorithms and coding-interview style problem solutions

🎧 Currently listening to:

dailycodingproblem's Issues

Problem #298

You sure about these results?

Output for [3, 3, 3, 3] should be 0 and we get 3.
Reason: Since there is only one type in the whole dataset.
Pasting question here for better understanding:

A girl is walking along an apple orchard with a bag in each hand. She likes to pick apples from each tree as she goes along, but is meticulous about not putting different kinds of apples in the same bag.

Given an input describing the types of apples she will pass on her path, in order, determine the length of the longest portion of her path that consists of just two types of apple trees.

Output for [1, 2, 1, 2, 1, 2, 1] should be 7 and we get 6.
Reason: The longest portion is 7 (i.e. complete list), since it only contains two types of apple.

Please correct me if I'm wrong.
Thanks