Echo's Home

286. Walls and Gates

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

286. Walls and Gates

Description

You are given an m x n grid roomsinitialized with these three possible values.

778. Swim in Rising Water

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

778. Swim in Rising Water

Description

You are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that point (i, j).

271. Encode and Decode Strings

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

271. Encode and Decode Strings

Description

Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.

269. Alien Dictionary

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

269. Alien Dictionary

Description

There is a new alien language that uses the English alphabet. However, the order of the letters is unknown to you.

268. Missing Number

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

268. Missing Number

Description

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

763. Partition Labels

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

763. Partition Labels

Description

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part.

253. Meeting Rooms II

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

253. Meeting Rooms II

Description

Given an array of meeting time intervals intervals where intervals[i] = [start_i, end_i], return the minimum number of conference rooms required.

252. Meeting Rooms

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

252. Meeting Rooms

Description

Given an array of meeting time intervalswhere intervals[i] = [start_i, end_i], determine if a person could attend all meetings.

746. Min Cost Climbing Stairs

Posted on 2025-01-07 Edited on 2025-02-12 In Leetcode

746. Min Cost Climbing Stairs

Description

You are given an integer array cost where cost[i] is the cost of i^th step on a staircase. Once you pay the cost, you can either climb one or two steps.

217. Contains Duplicate

Posted on 2025-01-03 Edited on 2025-02-12 In Leetcode

217. Contains Duplicate

Description

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.