main
leetcode-swift
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0838.Push Dominoes\Solution.py
9 1 -
A
solution\2500-2599\2528.Maximize the Minimum Powered City\Solution.cpp
9 1 -
A
solution\0800-0899\0838.Push Dominoes\Solution.ts
9 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.cpp
9 1 -
A
solution\0800-0899\0845.Longest Mountain in Array\Solution.java
9 1 -
A
solution\0800-0899\0845.Longest Mountain in Array\Solution.py
9 1 1
A
solution\2300-2399\2337.Move Pieces to Obtain a String\Solution.ts
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\0400-0499\0444.Sequence Reconstruction\Solution.cpp
9 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.java
9 1 -
A
solution\0400-0499\0444.Sequence Reconstruction\Solution.java
9 1 -
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.java
9 1 -
A
solution\2500-2599\2523.Closest Prime Numbers in Range\Solution.py
9 1 -
A
solution\0400-0499\0444.Sequence Reconstruction\Solution.py
9 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.py
9 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.java
9 1 -
A
solution\0800-0899\0859.Buddy Strings\Solution.java
9 1 -
A
solution\0300-0399\0381.Insert Delete GetRandom O(1) - Duplicates allowed\Solution.py
9 1 1
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.java
9 1 -