Java O(NlogN) TreeSet
Find the first jump possible from the current position/\n\nclass Solution \n{\n    public boolean canReach(String temp, int minJump, int maxJump) \n    {\n     
Find the first jump possible from the current position/\n```\nclass Solution \n{\n    public boolean canReach(String temp, int minJump, int maxJump) \n    {\n        char[] s=temp.toCharArray(); \n        TreeSet<Integer> memo=new TreeSet<Integer>();\n        if(s[s.length-1]==\'0\')\n            memo.add(s.length-1);\n        for(int i=s.length-2;i>=0;--i)\n            if((s[i]==\'0\')&&!memo.isEmpty()&&(memo.contains(i+minJump)||(memo.higher(i+minJump)!=null&&memo.higher(i+minJump)<=i+maxJump)))\n                memo.add(i);\n        return !memo.isEmpty()&&memo.contains(0);\n    }\n}\n```
['Greedy', 'Tree', 'Ordered Set', 'Java']