I recently learnt big O notation, so when I analysed complexities of some example codes, I observed almost all had less memory and more time, so I thought if vice versa is possible

Now some example came to me was, say taking input of N* N matrix, and printing out just 1 value at a given index, but when I thought more, essentially if we store N*N matrix, we have to take input, so O(N^2) time complexity is probably essential if I have O(N^2) memory complexity

Is my thinking correct, or is there a counterexample I am missing on