main
leetcode-simula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\0300-0399\0394.Decode String\Solution.ts
5 1 5
A
solution\0900-0999\0914.X of a Kind in a Deck of Cards\Solution.cpp
5 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.java
5 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.py
5 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.cpp
5 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.ts
5 1 1
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.js
5 1 1
A
solution\0400-0499\0497.Random Point in Non-overlapping Rectangles\Solution.java
5 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.cpp
5 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.cpp
5 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
5 1 1
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.py
5 1 -
A
solution\2000-2099\2095.Delete the Middle Node of a Linked List\Solution.ts
5 1 1
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
5 1 1
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -