Minimum number of platforms required for a railway station
Python, 62 bytes

lambda l:max(sum(a-b^b-h^h-a&lt;1for a,b in l)for h in range(24))

Try it online!
Golfing Surculose Sputum's solution. The new part is a-b^b-h^h-a&lt;1 to check whether the time h lies in the interval from a to b taken cyclically, that is, their sorted ordering is a cyclic permutation of [a,h,b]. To do this, we check whether an odd number of the differences a-b, b-h,h-a are negative. I first did this with multiplication (a-b)^(b-h)^(h-a)&lt;1. But, xor (^) lets us do the same and cuts parens with better precedence.