Thanks to visit codestin.com
Credit goes to tamnd.github.io

tag

#deque

5 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 862: Shortest Subarray with Sum at Least K

Problem Restatement We are given an integer array nums and an integer k . We need to return the length of the shortest non-empty contiguous subarray whose sum is at least k . If no such subarray exists, return -1 . A subarray must be contiguous. We cannot skip elements. Input and Output Item Meaning Input nums , an integer array Input k , the target minimum sum Output The...
leetcode array prefix-sum monotonic-queue deque May 12, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 272: Closest Binary Search Tree Value II

Problem Restatement We are given: The root of a binary search tree A floating-point target An integer k We need to return the k values in the BST that are closest to target . The answer may be returned in any order. The problem guarantees that there is only one unique set of k closest values. Also, k is valid, so k does not exceed the number of nodes in...
leetcode tree binary-search-tree inorder-traversal deque May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 239: Sliding Window Maximum

Problem Restatement We are given an integer array nums and an integer k . There is a sliding window of size k . It starts at the left side of the array and moves one position to the right each time. For each window, we need to return the maximum value inside that window. LeetCode gives this example: Input: nums = [1,3,-1,-3,5,3,6,7], k = 3 Output: [3,3,5,5,6,7] The constraints allow...
leetcode array sliding-window deque monotonic-queue May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 353: Design Snake Game

Problem Restatement We need to implement a simplified Snake game. The screen has size: height x width The snake starts at the top-left cell: (0, 0) Its initial length is 1 . We are given a list of food positions. Food appears one at a time. The second food appears only after the snake eats the first food. Each call to move(direction) moves the snake one cell in one of...
leetcode design deque hash-set matrix May 10, 2026
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.4 Queues and Deques

1.4 Queues and deques, 35 index slug name 1 array-queue Array Queue 2 circular-queue Circular Queue 3 linked-queue Linked Queue 4 deque Deque 5 priority-queue-basic Basic Priority Queue 6 queue-enqueue-dequeue Enqueue Dequeue 7 queue-two-stacks Queue via Stacks 8 deque-array Array Deque 9 deque-linked Linked Deque 10 monotonic-queue Monotonic Queue 11 blocking-queue Blocking Queue 12 lock-free-queue Lock Free Queue 13 queue-buffer Buffer Queue 14 queue-scheduler Scheduler Queue 15 queue-bfs BFS Queue...
algorithms data-structures queue deque