🏆💢💯 Faster✅💯 Lesser🧠 🎯 C++✅Python3🐍✅Java✅C✅Python🐍✅💥🔥💫Explained☠💥🔥 Beats 💯
Intuition\n\n\n\nPython []\nclass Solution(object):\n    def findDelayedArrivalTime(self, arrivalTime, delayedTime):\n        """\n        :type arrivalTime: in
# Intuition\n![0ehh83fsnh811.jpg](https://assets.leetcode.com/users/images/2fc74bd7-4396-48d4-88fc-38c6eaa0427a_1716342217.473444.jpeg)\n![Screenshot 2024-05-22 071408.png](https://assets.leetcode.com/users/images/c5981e6f-e930-427b-ade1-faca3273b4c4_1716342262.6079235.png)\n![Screenshot 2024-05-22 071435.png](https://assets.leetcode.com/users/images/484d8e00-cc2f-48e3-b4c4-b32f72f28e2f_1716342287.48214.png)\n```Python []\nclass Solution(object):\n    def findDelayedArrivalTime(self, arrivalTime, delayedTime):\n        """\n        :type arrivalTime: int\n        :type delayedTime: int\n        :rtype: int\n        """\n        x = arrivalTime + delayedTime\n        return x - 24 if x >= 24 else x\n```\n```Java []\nclass Solution {\n    public int findDelayedArrivalTime(int arrivalTime, int delayTime) {\n         if(arrivalTime + delayTime >=24)\n           return (arrivalTime + delayTime) - 24;\n        return arrivalTime + delayTime;\n    }\n}\n```\n```C++ []\nclass Solution {\npublic:\n    int findDelayedArrivalTime(int arrivalTime, int delayTime) {\n        if(arrivalTime + delayTime >=24)\n           return (arrivalTime + delayTime) - 24;\n        return arrivalTime + delayTime;\n    }\n};\n````\n```Python3 []\nclass Solution:\n    def findDelayedArrivalTime(self, arrivalTime: int, delayedTime: int) -> int:\n        if arrivalTime + delayedTime >= 24:\n            return (arrivalTime + delayedTime) - 24;\n        return arrivalTime + delayedTime\n```\n```C []\nint findDelayedArrivalTime(int arrivalTime, int delayedTime){\n    if(arrivalTime + delayedTime >=24)\n        return (arrivalTime + delayedTime) - 24;\n    return arrivalTime + delayedTime;\n}\n```\n\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n     O(1)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n     O(1)\n# Code\n```\nclass Solution {\n    public int findDelayedArrivalTime(int arrivalTime, int delayTime) {\n         if(arrivalTime + delayTime >=24)\n           return (arrivalTime + delayTime) - 24;\n        return arrivalTime + delayTime;\n    }\n}\n```\n# *Please upvote if it\'s useful for you*\n![th.jpeg](https://assets.leetcode.com/users/images/c6cdaa78-7d81-4359-beb8-b1de02d3a944_1716342422.3919911.jpeg)\n
['Math', 'Brainteaser', 'C', 'Python', 'C++', 'Java', 'Python3']