Echo's Home

1498. Number of Subsequences That Satisfy the Given Sum Condition

Posted on 2025-02-22 Edited on 2025-06-14 In Leetcode

1498. Number of Subsequences That Satisfy the Given Sum Condition

Description

You are given an array of integers nums and an integer target.

983. Minimum Cost For Tickets

Posted on 2025-02-22 Edited on 2025-06-14 In Leetcode

983. Minimum Cost For Tickets

Description

You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365.

735. Asteroid Collision

Posted on 2025-02-22 Edited on 2025-06-14 In Leetcode

735. Asteroid Collision

Description

We are given an array asteroids of integers representing asteroids in a row. The indices of the asteriod in the array represent their relative position in space.

1197. Minimum Knight Moves

Posted on 2025-02-21 Edited on 2025-06-14 In Leetcode

1197. Minimum Knight Moves

Description

In an infinite chess board with coordinates from -infinity to +infinity, you have a knight at square [0, 0].

229. Majority Element II

Posted on 2025-02-20 Edited on 2025-06-14 In Leetcode

229. Majority Element II

Description

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

825. Friends Of Appropriate Ages

Posted on 2025-02-20 Edited on 2025-06-14 In Leetcode

825. Friends Of Appropriate Ages

Description

There are n persons on a social media website. You are given an integer array ages where ages[i] is the age of the i^th person.

1891. Cutting Ribbons

Posted on 2025-02-20 Edited on 2025-06-14 In Leetcode

1891. Cutting Ribbons

Description

You are given an integer array ribbons, where ribbons[i] represents the length of the i^th ribbon, and an integer k. You may cut any of the ribbons into any number of segments of positive integer lengths, or perform no cuts at all.

490. The Maze

Posted on 2025-02-20 Edited on 2025-06-14 In Leetcode

490. The Maze

Description

There is a ball in a maze with empty spaces (represented as 0) and walls (represented as 1). The ball can go through the empty spaces by rolling up, down, left or right , but it won’t stop rolling until hitting a wall. When the ball stops, it could choose the next direction.