📘 Problem Overview You are given a directed, weighted graph with n nodes (1-indexed), and a list of travel times times, where each element is [u, v,
🧩 Problem Summary You are given an integer array nums where each element represents your maximum jump length at that position. Your goal is to return
🧠 Problem Overview You’re given an integer array nums, where each element represents the maximum jump length from that position. Starting at index 0,
🏠 Problem Overview You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but adjacen
Problem Summary You are given numCourses courses labeled from 0 to numCourses - 1, and a list of prerequisites where each element is a pair [a, b] mea
🔍 Problem Overview You’re given an m x n grid, where: 0 represents an empty cell 1 represents a fresh orange 2 represents a rotten orange Each minute
🌊 Problem Summary You are given a 2D grid consisting of '1's (land) and '0's (water). An island is formed by connecting adjacent lands horizontally o
✨ Problem Description Given an integer array nums, return all the unique triplets [nums[i], nums[j], nums[k]] such that i ≠ j ≠ k, and nums[i] + nums[
🧩 Problem Description Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements. Examp
