Problems Topics Tags Progress

Search

Home

|

Tag

|

Brute Force

Problems with tag Brute Force

32 found, showing 1 to 30

1

;

Collecting Chocolates ->

Medium, #2735, 2 solutions

Count Beautiful Substrings I ->

Medium, #2947, 2 solutions

Check if Strings Can be Made Equal With Operations I ->

Easy, #2839, 2 solutions

Count Beautiful Substrings II ->

Hard, #2949, 2 solutions

Count Numbers With Unique Digits II ->

Easy, #3032, 2 solutions

Count Prefix and Suffix Pairs I ->

Easy, #3042, 2 solutions

Count Symmetric Integers ->

Easy, #2843, 2 solutions

Count the Number of Incremovable Subarrays I ->

Easy, #2970, 2 solutions

Distribute Candies Among Children I ->

Easy, #2928, 2 solutions

Distribute Candies Among Children II ->

Medium, #2929, 2 solutions

Find Longest Self-Contained Substring ->

Hard, #3104, 2 solutions

Find Longest Special Substring That Occurs Thrice I ->

Medium, #2981, 2 solutions

Find the Largest Area of Square Inside Two Rectangles ->

Medium, #3047, 2 solutions

Find the Minimum Area to Cover All Ones II ->

Hard, #3197, 2 solutions

Find the Number of Good Pairs I ->

Easy, #3162, 2 solutions

Match Alphanumerical Pattern in Matrix I ->

Medium, #3078, 2 solutions

Match Substring After Replacement ->

Hard, #2301, 2 solutions

Maximum Good People Based on Statements ->

Hard, #2151, 2 solutions

Maximum Points in an Archery Competition ->

Medium, #2212, 2 solutions

Maximum Strong Pair XOR I ->

Easy, #2932, 2 solutions

Maximum Sum of an Hourglass ->

Medium, #2428, 2 solutions

Minimize Result by Adding Parentheses to Expression ->

Medium, #2232, 2 solutions

Minimum Time to Revert Word to Initial State I ->

Medium, #3029, 2 solutions

Number of Subarrays That Match a Pattern I ->

Medium, #3034, 2 solutions

Number of Unique Categories ->

Medium, #2782, 2 solutions

Remove Letter To Equalize Frequency ->

Easy, #2423, 2 solutions

Shortest String That Contains Three Strings ->

Medium, #2800, 2 solutions

Shortest Subarray With OR at Least K I ->

Easy, #3095, 2 solutions

Split Message Based on Limit ->

Hard, #2468, 2 solutions

Sum of k-Mirror Numbers ->

Hard, #2081, 2 solutions