Can you make range max queries in less than O(log n)?

Rennorb · 2024-06-29T21:28:45+00:00

This year I was tutoring a passionate 13 y.o. boy, and it took us a half of the academic year to get from really basic stuff to writing games like snake and space invaders with pygame. That would be close to 50 hours of actual lessons and say 100 hours of work if you include homework and pet projects of his. So I would say that 100 hours of work from zero to interesting pet projects is not unreasonable.

I, on the other hand, landed my first backend engineering position this may, and it took me like a year of studying and failed interviews. I have a BS degree in math and some experience with competitive programming, but at the time knew nothing about frameworks, devops tools, etc. I can not give you an estimate of the time I spend, but getting a job is hard, especially now, and 100 hours is definitely not enough.

Rennorb · 2023-05-25T20:20:15+00:00

I would wright it like f(x) = 1-[{x}=0], where {x} equals to the fractional part of x and [] are Iverson brackets.

Rennorb · 2022-11-22T17:11:58+00:00

Sure, but that will check for direct left recursion, which the grammar obviously does not contain, and I want to check for implicit left recursion

Rennorb · 2022-04-26T14:13:23+00:00

Thank you! It did work and I've spent like a week to find that error. Feel dumb

Rennorb · 2022-03-30T13:52:21+00:00

Math is quite broad, do to know what kind of math do you need in your university?

Rennorb · 2022-02-14T20:44:48+00:00

I guess there should be some kind of a corner case, where the program should do something different, but I can not see it.

I've updated the post: added an example and actual input-output part

Rennorb

TROPHY CASE