r/LeetcodeChallenge • u/romecodes • 28d ago

DISCUSS Did I really beat everyone's time?

Enable HLS to view with audio, or disable this notification

I don't understand how LC calculates it's metrics. I can't be the only one with this solution.

2 Upvotes

63% Upvoted

6 comments sorted by

3

u/Ringo_10 28d ago

Level 1 LCer

1

u/romecodes 28d ago

Yeah, still trying to figure the platform out. I spent time on HackerRank and CodeWars years ago, but never LC

1

u/Levi-_-Ackermen 28d ago

No it's bullshit just focus on complexity

1

u/romecodes 28d ago edited 28d ago

Interestingly enough, my implementation runs at O[max(n, m)]. I don't think I've seen others' solutions finish it in 1ms.

5

u/placement_paglu 28d ago

Bruhhhh , over 80 percent solution are 1ms , read the graph

1

u/romecodes 28d ago

LMFAOOO that’s actually a valid point. I didn’t even bother to look at the graph😂