LeetCode OJ
Sign up Sign in
Welcome to LeetCode Discuss.  Please read the FAQ to help yourself making the best use of Discuss.
Ask a Question

Welcome to LeetCode Discuss.

This is a place to ask questions related to only OJ problems.

Please read the FAQ to help yourself making the best use of Discuss.

Most popular tags

37 questions

41 answers

135 comments

80 users

Recent activity

0 votes
0 answers 7 views
Cannot pass the large test case -> run time error
commented 37 minutes ago in Reorder List by 1337c0d3r (1,430 points)
0 votes
0 answers 6 views
Search a 2D matrix
commented 2 hours ago in Search a 2D Matrix by Shangrila (1,990 points)
0 votes
1 answer 26 views
Try this test case pow(-0.5,-2147483648)
commented 10 hours ago in Pow(x, n) by Shangrila (1,990 points)
0 votes
1 answer 55 views
I don't understand!
commented 11 hours ago in Median of Two Sorted Arrays by raoxuanxuan (100 points)
0 votes
4 answers 409 views
Does everyone solved it with O(n) complexity?
commented 12 hours ago in Linked List Cycle by Shangrila (1,990 points)
0 votes
0 answers 18 views
Submission Result: Memory Limit Exceeded
commented 21 hours ago in Merge Intervals by Shangrila (1,990 points)
+2 votes
2 answers 45 views
How to deal with long overflow?
answer edited 1 day ago in Sqrt(x) by Shangrila (1,990 points)
0 votes
0 answers 32 views
One way to avoid overflow
commented 1 day ago in Palindrome Number by Decheng (180 points)
0 votes
1 answer 105 views
Is there better solution for this word breakII
commented 1 day ago in Word Break II by [email protected] (190 points)
0 votes
1 answer 32 views
Wrong answer in a->b->c?
answer selected 2 days ago in Word Ladder by princessmaja (250 points)
0 votes
0 answers 62 views
Is the complexity O(kn)?
commented 2 days ago in Merge k Sorted Lists by Shangrila (1,990 points)
+2 votes
1 answer 34 views
The information is insufficient for this question
commented 3 days ago in Integer to Roman by Amax (140 points)
To see more, click for the full list of questions or popular tags.
...