19 docs tagged with "leetcode"

Learn how to implement a balanced binary tree checker in Java, with explanations of the algorithm and time complexity analysis.

Learn how to implement a balanced binary tree checker in JavaScript, with explanations of the algorithm and time complexity analysis.

Determining if an array was originally sorted in non-decreasing order and then rotated using a simple traversal approach.

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Finding if a planet can destroy all asteroids using a greedy approach.

The "Date to Binary Conversion" problem on LeetCode typically involves converting a given date into its binary representation.

A palindrome reads the same forwards and backwards, like "121" or "racecar."

Finding the earliest possible completion time for taking exactly one land ride and one water ride using a greedy approach.

Solve the House Robber problem using dynamic programming to maximize the amount of money that can be robbed from houses without robbing two adjacent houses.

The Left and Right Sum Differences problem on LeetCode involves finding the absolute difference between the sum of elements to the left and right of each index in an array.

The Lemonade Change problem on LeetCode involves determining if a vendor can provide the correct change to every customer using a greedy approach.

Finding the minimum number of character replacements to make two strings anagrams using frequency counting.

Solve the Partition Equal Subset Sum problem using dynamic programming to check if a set can be partitioned into two subsets with equal sum.

Curated practice problems for mastering Prefix Sum and Difference Array techniques. Problems are organized by difficulty with hints and approach guidance.

The Reverse Bits problem asks you to reverse the bits of a given 32-bit unsigned integer. Essentially, you need to flip the binary representation of the number so that the least significant bit (LSB) becomes the most significant bit (MSB) and vice versa."

Solve the Rotten Oranges problem using Breadth-First Search (BFS) to determine the minimum time required for all fresh oranges to rot.

This document explains the Merge Intervals problem using the Sweep Line Algorithm, including its description, approach, and implementation in C++.

Determining the total sum of waviness for all numbers in a given range by checking for peaks and valleys among their digits.

The Unique Paths problem on LeetCode involves finding the number of possible unique paths for a robot to reach the bottom-right corner of a grid.