Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-simula
1,196
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0450.Delete Node in a BST\Solution.ts
11
1
1
A
solution\2000-2099\2043.Simple Bank System\Solution.java
10
1
1
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.ts
2
1
1
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.ts
3
1
1
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7
1
1
A
solution\2000-2099\2043.Simple Bank System\Solution.ts
10
1
1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.py
5
1
1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.ts
5
1
1
A
solution\0600-0699\0658.Find K Closest Elements\Solution.ts
3
1
1
A
solution\0600-0699\0641.Design Circular Deque\Solution.ts
20
1
1
A
solution\0600-0699\0628.Maximum Product of Three Numbers\Solution.ts
7
1
1
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
5
1
1
A
solution\0300-0399\0381.Insert Delete GetRandom O(1) - Duplicates allowed\Solution.java
8
1
1
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.ts
5
1
1
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.ts
6
1
1
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.ts
6
1
1
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2
1
1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
4
1
1
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
5
1
1
A
solution\0400-0499\0493.Reverse Pairs\Solution.java
10
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!