/2023/08/13/role-of-algorithms.html: log N?

[safinaskar]

You wrote:

without extra memory, and in guaranteed O(log N)?

It seems you meant O(N log N)

[safinaskar]

Also:

Ditto, any kind of exploration problem is usually solved with bfs. Eg, rust-analyzer uses dfs for directory traversal

Looks strange. I think you meant bfs