100% Faster Code (Simple) || O(1) space || O(n) Time || Java
Time Complexity : O(n)\nSpace Complexity : O(1)\n\n### Java Solution :-\n\nclass Solution {\n    public int countSeniors(String[] details) {\n        int count=
***Time Complexity : O(n)\nSpace Complexity : O(1)***\n\n### **Java Solution :-**\n```\nclass Solution {\n    public int countSeniors(String[] details) {\n        int count=0;\n        for(String str:details){\n            if(str.charAt(11)>\'6\' || (str.charAt(11)==\'6\' && str.charAt(12)>\'0\'))count++;\n        }\n        return count;\n    }\n}\n```
['Java']