I ran the same program twice. First time it said I was faster than 5% of submissions and then second time the number became 63%. How do we get an accurate analysis?
Want to see the real deal?
More inside scoop? View in App
More inside scoop? View in App
blind
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
FOLLOWING
Industries
Job Groups
- Software Engineering
- Product Management
- Information Technology
- Data Science & Analytics
- Management Consulting
- Hardware Engineering
- Design
- Sales
- Security
- Investment Banking & Sell Side
- Marketing
- Private Equity & Buy Side
- Corporate Finance
- Supply Chain
- Business Development
- Human Resources
- Operations
- Legal
- Admin
- Customer Service
- Communications
Return to Office
Work From Home
COVID-19
Layoffs
Investments & Money
Work Visa
Housing
Referrals
Job Openings
Startups
Office Life
Mental Health
HR Issues
Blockchain & Crypto
Fitness & Nutrition
Travel
Health Care & Insurance
Tax
Hobbies & Entertainment
Working Parents
Food & Dining
IPO
Side Jobs
Show more
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
comments
LC stats won't tell you asymptotic runtime, you gave to figure it out yourself and then compare to other solutions in the discussion section
E.g. bubble sorting is O(n^2), merge sorting is O(n*log n)
There are cases where a O(n^2) algorithm would run faster than a O(n*log n) algorithm on leetcode, because of a small enough input size in their test cases (happens very often)
Interviewers generally don't care how fast your algorithm runs, they care about the asymptotic runtime.
That being said, if your algorithm times out on leetcode, it probably has a terrible asymptotic runtime.