Beats 95.58%✅🔥| Python💻| SUPER EASY Solution📕
Beats 95.58%\u2705\uD83D\uDD25| Python\uD83D\uDCBB| SUPER EASY Solution\uD83D\uDCD5\n\n## 1. Proof (Python3)\n\n\n## 2. Algorithms\n\n* Simple array traversal\n
# Beats 95.58%\u2705\uD83D\uDD25| Python\uD83D\uDCBB| SUPER EASY Solution\uD83D\uDCD5\n\n## 1. Proof (Python3)\n![image.png](https://assets.leetcode.com/users/images/3ee7e34a-dd96-43b1-9dd6-72eb0cb13913_1722526388.2966347.png)\n\n## 2. Algorithms\n\n* Simple array traversal\n\n## 3. Code (with inline explanation)\n\n```python3 []\nclass Solution:\n    def countSeniors(self, details: List[str]) -> int:\n        # 1-10 (phone) --> 11 (gender) --> 12-13 (age) --> 14-15 (seat)\n        res = 0\n        for passenger in details:\n            if int(passenger[11 : 13]) > 60: # If digits 12 & 13 (indices 11 & 12), which indicates the age\n                res += 1\n        return res\n```\n\n## 4. Complexity\n\n- Time complexity: $$O(N)$$\n\n- Space complexity: $$O(1)$$\n\n### Upvote if you find this solution helpful, thank you \uD83E\uDD0D
['Array', 'String', 'Python', 'Python3']