main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.java
2 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.ts
2 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.ts
2 1 -
A
solution\0700-0799\0788.Rotated Digits\Solution.py
2 1 1
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.cpp
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
2 1 -
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.java
2 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.ts
2 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.ts
2 1 -
A
solution\2300-2399\2300.Successful Pairs of Spells and Potions\Solution.cpp
2 1 -
A
solution\2300-2399\2303.Calculate Amount Paid in Taxes\Solution.cpp
2 1 -
A
solution\2300-2399\2303.Calculate Amount Paid in Taxes\Solution.java
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.java
2 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.js
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.cpp
2 1 -
A
solution\2400-2499\2425.Bitwise XOR of All Pairings\Solution.ts
2 1 -
A
solution\2300-2399\2312.Selling Pieces of Wood\Solution.py
2 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\2300-2399\2317.Maximum XOR After Operations\Solution.cpp
2 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.cpp
2 1 -