aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* 1290. convert binary number in a linked list to integerHEADmasterJack Sangdahl12 hours2-0/+66
|
* 2410. maximum matching of players with trainersJack Sangdahl39 hours2-0/+70
|
* 1900. the earliest and latest rounds where players competeJack Sangdahl2 days2-0/+110
|
* 932. beautiful arrayJack Sangdahl3 days2-0/+91
|
* 3440. reschedule meetings for maximum free time 2Jack Sangdahl4 days2-0/+96
|
* 2945. find maximum non decreasing array lengthJack Sangdahl5 days2-0/+92
|
* 3439. reschedule meetings for maximum free time 1Jack Sangdahl5 days2-0/+95
|
* 1751. maximum number of events that can be attended 2Jack Sangdahl6 days2-0/+110
|
* 1353. maximum number of events that can be attendedJack Sangdahl8 days2-0/+46
|
* 1865. finding pairs with a certain sumJack Sangdahl8 days1-0/+54
|
* 1394. find lucky integer in an arrayJack Sangdahl10 days2-0/+59
|
* 3304. find the kth character in string game 1Jack Sangdahl12 days2-0/+45
|
* 3333. find the original typed string 2Jack Sangdahl13 days3-0/+103
|
* 3330. find the original typed string 1Jack Sangdahl14 days2-0/+54
|
* 594. longest harmonious subsequenceJack Sangdahl2025-06-292-0/+88
|
* 1498. number of subsequences that satisfy the given sum conditionJack Sangdahl2025-06-292-37/+57
|
* 2099. find subsequence of length k with the largest sumJack Sangdahl2025-06-272-0/+94
|
* chore: remove old cpp and rust solutionsJack Sangdahl2025-06-27680-24389/+0
|
* 2014. longest subsequence repeated k timesJack Sangdahl2025-06-262-0/+145
|
* 728. self dividing numbersJack Sangdahl2025-06-252-0/+83
|
* 2311. longest binary subsequence less than or equal to kJack Sangdahl2025-06-252-0/+59
|
* 2040. kth smallest product of two sorted arraysJack Sangdahl2025-06-242-0/+140
|
* 528. random pick with weightJack Sangdahl2025-06-232-0/+93
|
* 2081. sum of k-mirror numbersJack Sangdahl2025-06-222-0/+337
|
* 2138. divide a string into groups of size kJack Sangdahl2025-06-212-0/+89
|
* 3085. minimum deletions to make string k-specialJack Sangdahl2025-06-202-0/+63
|
* 3443. maximum manhattan distance after k changesJack Sangdahl2025-06-192-0/+74
|
* 2294. partition array such that maximum difference is kJack Sangdahl2025-06-182-0/+66
|
* 2966. divide array into arrays with max differenceJack Sangdahl2025-06-172-23/+63
|
* 3405. count the number of arrays with k matching adjacent elementsJack Sangdahl2025-06-162-0/+76
|
* 2016. maximum difference between increasing elementsJack Sangdahl2025-06-152-0/+53
|
* 1195. fizz buzz multithreadJack Sangdahl2025-06-143-0/+240
|
* 593. valid squareJack Sangdahl2025-06-142-0/+87
|
* 2566. maximum difference by remapping a digitJack Sangdahl2025-06-132-0/+56
|
* 2616. minimise the maximum difference of pairsJack Sangdahl2025-06-122-10/+50
|
* 2663. lexicographically smallest beautiful stringJack Sangdahl2025-06-122-0/+83
|
* 3423. maximum difference between adjacent elements in a circular queueJack Sangdahl2025-06-122-0/+50
|
* 3445. maximum difference between even and odd frequency 2Jack Sangdahl2025-06-102-0/+198
|
* 3442. maximum difference between even and odd frequency 1Jack Sangdahl2025-06-092-0/+64
|
* 1649. create sorted array through instructionsJack Sangdahl2025-06-082-0/+99
|
* 386. lexicographical numbersJack Sangdahl2025-06-071-19/+14
|
* 3170. lexicographically minimum string after removing starsJack Sangdahl2025-06-062-0/+187
|
* 3561. resulting string after adjacent removalsJack Sangdahl2025-06-052-0/+80
|
* 2434. using a robot to print the lexicographically smallest stringJack Sangdahl2025-06-052-0/+102
|
* 1061. lexicographically smallest equivalent stringJack Sangdahl2025-06-043-44/+95
|
* 3403. find the lexicographically largest string from the box 1Jack Sangdahl2025-06-032-0/+70
|
* 1298. maximum candies you can get from boxesJack Sangdahl2025-06-022-0/+144
|
* 135. candyJack Sangdahl2025-06-011-40/+25
|
* 2929. distribute candies among children 2Jack Sangdahl2025-05-312-0/+57
|
* 909. snakes and laddersJack Sangdahl2025-05-302-0/+147
|