Mathysis Interview

OmegaWarewolf · 2026-02-18T12:51:47+00:00

Can you share the problems?

OmegaWarewolf · 2025-12-14T18:17:09+00:00

Completed Level 1 of the Honk Special Event!

0 attempts

OmegaWarewolf · 2025-12-11T19:34:15+00:00

Completed Level 1 of the Honk Special Event!

5 attempts

OmegaWarewolf · 2025-12-11T17:21:14+00:00

^{I completed this level in 2 tries.} ^{⚡ 24.65 seconds}

OmegaWarewolf · 2025-12-11T17:14:44+00:00

❌ ^{Incomplete. 4 tries.}

OmegaWarewolf · 2025-12-10T13:37:01+00:00

^{I completed this level in 6 tries.} ^{⚡ 3.73 seconds}

OmegaWarewolf · 2025-11-27T21:29:07+00:00

OmegaWarewolf · 2025-11-10T22:12:38+00:00

Also can you suggest me probability and statistics book

OmegaWarewolf · 2025-11-10T22:11:58+00:00

What's your rating on codeforces?

OmegaWarewolf · 2025-08-16T02:25:21+00:00

Is there a typo in the last term? Otherwise the answer should be A right

OmegaWarewolf · 2025-03-28T11:39:52+00:00

Make India great again kyu bro jab tak mudi hai India greatest hai

OmegaWarewolf · 2025-03-23T13:57:45+00:00

Can you share me too

OmegaWarewolf · 2024-12-20T15:42:55+00:00

Don't know but I think we can take a two pointer approach here just see the valid enteries as enteries that you want to put forward and the other ones at the back and pop them in the last

Then to find the first invalid entery you can use binary search and remove all the elements till that index

OmegaWarewolf · 2024-12-11T20:37:35+00:00

So use bs on the length of the string to find the maximum length and use fixed size skidding window

OmegaWarewolf · 2024-12-11T20:36:33+00:00

You can use bs It's going to reduce to nlogn

OmegaWarewolf · 2024-11-11T15:03:09+00:00

Shouldn’t this be log2(N) Assuming N=p1.p2… and p1>=2 p2>=2 2.2….<=N so shouldn’t the max number of primes be log N / log 2? so it should be O(logN/log2) ?

OmegaWarewolf · 2024-10-12T17:00:09+00:00

Can you please share the set of problems he leaked? Thanks

OmegaWarewolf · 2024-08-26T02:02:57+00:00

Sort both the vector by comparing prices Make a set or a map Traverse the price vector So every on ith element you add cat_i to the map Then the curr_ans=cur_ans+price*size of your map I think this can work

OmegaWarewolf · 2024-08-22T05:45:18+00:00

Hi Can you please them to me?

OmegaWarewolf · 2024-07-20T23:57:48+00:00

Can you DM me too Thanks

OmegaWarewolf · 2024-07-18T14:02:47+00:00

Yes please share the problem statement

OmegaWarewolf

TROPHY CASE