### [leetcode] 1926. Nearest Exit from Entrance in Maze _ Algorithm Problem Solve for python

1. Problem 1926. Nearest Exit from Entrance in Maze You are given an m x n matrix maze (0-indexed) with empty cells (represented as ‘.’) and walls (represented as ‘+’). You are also given the entrance of the maze, where entrance = [entrancerow, entrancecol] denotes the row and column of the cell you are initially standing at. In one step, you...

### [leetcode] 1493. Longest Subarray of 1's After Deleting One Element _ Algorithm Problem Solve for python

1. Problem 1493. Longest Subarray of 1’s After Deleting One Element Given a binary array nums, you should delete one element from it. Return the size of the longest non-empty subarray containing only 1’s in the resulting array. Return 0 if there is no such subarray. Example 1: Input: nums = [1,1,0,1] Output: 3 Explanation: After deleting the...

### [leetcode] 2336. Smallest Number in Infinite Set _ Algorithm Problem Solve for python

1. Problem 2336. Smallest Number in Infinite Set You have a set which contains all positive integers [1, 2, 3, 4, 5, …]. Implement the SmallestInfiniteSet class: SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers. int popSmallest() Removes and returns the smallest integer contained in the infini...