Problems Topics Tags Progress

Search

Home

|

Tag

|

O Nlogr

Problems with tag O(nlogr)

34 found, showing 1 to 30

1

;

Amount of New Area Painted Each Day ->

Hard, #2158, 2 solutions

Apply Operations on Array to Maximize Sum of Squares ->

Hard, #2897, 2 solutions

Capacity To Ship Packages Within D Days ->

Medium, #1011, 2 solutions

Count Number of Distinct Integers After Reverse Operations ->

Medium, #2442, 2 solutions

Cutting Ribbons ->

Medium, #1891, 2 solutions

Difference Between Element Sum and Digit Sum of an Array ->

Easy, #2535, 2 solutions

Find Subarray With Bitwise AND Closest to K ->

Hard, #3171, 2 solutions

Find the Array Concatenation Value ->

Easy, #2562, 2 solutions

Find the K-or of an Array ->

Easy, #2917, 2 solutions

Find the Sum of Encrypted Integers ->

Easy, #3079, 2 solutions

K-th Smallest Prime Fraction ->

Medium, #786, 2 solutions

Koko Eating Bananas ->

Medium, #875, 3 solutions

Kth Smallest Subarray Sum ->

Medium, #1918, 2 solutions

Largest Combination With Bitwise AND Greater Than Zero ->

Medium, #2275, 2 solutions

Max Pair Sum in an Array ->

Easy, #2815, 2 solutions

Max Sum of a Pair With Equal Sum of Digits ->

Medium, #2342, 2 solutions

Maximum Candies Allocated to K Children ->

Medium, #2226, 2 solutions

Maximum GCD-Sum of a Subarray ->

Hard, #2941, 2 solutions

Maximum Points After Collecting Coins From All Nodes ->

Hard, #2920, 2 solutions

Maximum Strong Pair XOR I ->

Easy, #2932, 2 solutions

Maximum Strong Pair XOR II ->

Hard, #2935, 2 solutions

Maximum Tastiness of Candy Basket ->

Medium, #2517, 2 solutions

Maximum XOR of Two Non-Overlapping Subtrees ->

Hard, #2479, 2 solutions

Maximum XOR of Two Numbers in an Array ->

Medium, #421, 2 solutions

Minimize Max Distance to Gas Station ->

Hard, #774, 2 solutions

Minimize OR of Remaining Elements Using Operations ->

Hard, #3022, 2 solutions

Minimum Operations to Make Numbers Non-positive ->

Hard, #2702, 2 solutions

Minimum Speed to Arrive on Time ->

Medium, #1870, 3 solutions

Minimum Split Into Subarrays With GCD Greater Than One ->

Medium, #2436, 2 solutions

Minimum Time to Complete Trips ->

Medium, #2187, 2 solutions