Math Bit Manipulation Learner Implement the reverseBitsSimple method that returns the integer formed after reversing the bits. Solved
Math Bit Manipulation Learner Implement the countBitsUpToNSum method that returns the total count of set bits for all numbers from 0 to n. Solved
Math Bit Manipulation Intermediate Implement the singleNumberTwoValuesCount method that counts the two values that appear once when others appear twice. Solved
Math Bit Manipulation Learner Implement the singleNumberUsingXor method that returns the number that appears once using XOR logic. Solved
Array Sorting Greedy Intermediate Implement the maximumUnitsTruck method that returns the maximum units that can be loaded onto the truck. Solved
Array Sorting Greedy Intermediate Implement the reconstructQueueCount method that returns the number of people after reconstructing the queue. Solved
Array Sorting Greedy Intermediate Implement the partitionLabelsNumber method that returns how many partitions can be made so each character appears in one part. Solved
Array Sorting Greedy Learner Implement the assignCookiesMaximumChildren method that returns the maximum number of children that can receive a suitable cookie. Solved
Array Sorting Greedy Intermediate Implement the minimumArrowsBalloons method that returns the minimum arrows needed to burst all balloons. Solved
Array Sorting Greedy Intermediate Implement the eraseOverlapIntervalsCount method that returns how many intervals must be removed to avoid overlaps. Solved
Array Sorting Greedy Proficient Implement the candyDistributionMinimum method that returns the minimum candies needed while respecting rating rules. Solved
Array Sorting Greedy Intermediate Implement the gasStationCircuitStart method that returns the gas station index from which the full circuit can be completed. Solved
Array Sorting Greedy Intermediate Implement the jumpGameMinimumJumpsGreedy method that returns the minimum number of jumps needed to reach the end. Solved
Array Sorting Greedy Learner Implement the jumpGameReachableGreedy method that checks whether the last index is reachable using greedy logic. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Learner Implement the floodFillChangedCount method that returns how many cells are changed during flood fill. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Proficient Implement the dijkstraShortestPathSimple method that returns the shortest weighted path using Dijkstra-style logic. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the minimumSpanningTreeWeightSimple method that returns the total weight of a minimum spanning tree. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the bipartiteGraphCheck method that checks whether a graph can be divided into two valid groups. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the connectedComponentsCount method that counts connected components in an undirected graph. Solved