What do you mean by strict upper bound in Space Time Complexity Webinar (Time-1:04:00)?
https://online.codingblocks.com/player/11688/content/397?s=1618
Time complexity
Hey Shashwat, the upper bound of an algorithm is denoted by the Big O notation, it bounds a function only from above. You can say that it denotes the worst case complexity of an algorithm.