Update README.md

Author: techieJarek

README.md

@@ -101,3 +101,5 @@ Given a binary tree, determine if it is a valid Binary Search Tree (BST).
 [**ValidParentheses.java**](https://github.com/techieJarek/coding-problems/blob/master/ValidParentheses.java) - Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
 The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and
 "([)]" are not.
+
+[**AppleOrchardTree.java**](https://github.com/techieJarek/coding-problems/blob/master/AppleOrchardTree.java) -  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.