main
leetcode-erlang
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2349.Design a Number Container System\Solution.java
6 1 1
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.ts
6 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.py
6 1 -
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.java
6 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.py
6 1 -
A
solution\2000-2099\2085.Count Common Words With One Occurrence\Solution.java
6 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.py
6 1 -
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6 1 1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.cpp
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.java
6 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -
A
solution\0700-0799\0729.My Calendar I\Solution.java
6 1 1
A
solution\0600-0699\0623.Add One Row to Tree\Solution.ts
6 1 -