Robina Li

Problem

Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false...

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

There is a dungeon with n x m rooms arranged as a grid.

There is a dungeon with n x m rooms arranged as a grid.

A message containing letters from A-Z can be encoded into numbers using the following mapping:

There are n people standing in a queue numbered from 0 to n - 1 from left to right. You are given an array heights of distinct integers where heights[i]...

There exists an undirected tree with n nodes numbered 0 to n-1. You are given a 2D integer array edges of length n-1, where edges[i] = [ui, vi, lengthi] indicates...

You have numCourses courses labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] means you must take course bi before course...

You have infinitely many lakes, all initially empty. When it rains on lake n, that lake becomes full. If it rains on a lake that is already full, a flood...