main
leetcode-rect
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.ts
4 1 -
A
solution\0800-0899\0832.Flipping an Image\Solution.js
4 1 -
A
solution\0500-0599\0573.Squirrel Simulation\Solution.java
4 1 -
A
solution\2200-2299\2203.Minimum Weighted Subgraph With the Required Paths\Solution.py
4 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.cpp
4 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.java
4 1 -
A
solution\2400-2499\2427.Number of Common Factors\Solution.ts
4 1 -
A
solution\0500-0599\0582.Kill Process\Solution.java
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.py
4 1 -
A
solution\2100-2199\2190.Most Frequent Number Following Key In an Array\Solution.java
4 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.ts
4 1 -
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\2500-2599\2516.Take K of Each Character From Left and Right\Solution.ts
4 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.c
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -