@@ -0,0 +1,1252 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 683. K Empty Slots%0A *%0A *  There is a garden with N slots. In each slot, there is a flower.%0A *  The N flowers will bloom one by one in N days.%0A *  In each day, there will be exactly one flower blooming and it will be in the status of blooming since then.%0A *  Given an array flowers consists of number from 1 to N. Each number in the array represents the place where the flower will open in that day.%0A *  For example, flowers%5Bi%5D = x means that the unique flower that blooms at day i will be at position x, where i and x will be in the range from 1 to N.%0A *  Also given an integer k, you need to output in which day there exists two flowers in the status of blooming,%0A *  and also the number of flowers between them is k and these flowers are not blooming.%0A *  If there isn't such day, output -1.%0A%0A Example 1:%0A Input:%0A flowers: %5B1,3,2%5D%0A k: 1%0A Output: 2%0A Explanation: In the second day, the first and the third flower have become blooming.%0A%0A Example 2:%0A Input:%0A flowers: %5B1,2,3%5D%0A k: 1%0A Output: -1%0A%0A Note:%0A The given array will be in the range %5B1, 20000%5D.%0A%0A */%0Apublic class _683 %7B%0A%0A    public static class Solution1 %7B%0A        public int kEmptySlots(int%5B%5D flowers, int k) %7B%0A            return -1;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton of 683