Easy JAVA Solution || 100% Faster || 0ms
\n- Time complexity: O(n)\n\n- Space complexity: O(1)\n\n\nclass Solution {\n    public int countSeniors(String[] details) {\n\n     int count=0;\n     for(int 
\n- Time complexity: O(n)\n\n- Space complexity: O(1)\n\n```\nclass Solution {\n    public int countSeniors(String[] details) {\n\n     int count=0;\n     for(int i=0;i<details.length;i++)\n     {\n         int a=details[i].charAt(11)-\'0\';\n         a*=10;\n         a+=details[i].charAt(12)-\'0\';\n         if(a>60)\n         {\n             count++;\n         }\n     }\n     return count;    \n    }\n}\n```
['Java']