36 docs tagged with "Stack"

This is a solution to the 1190. Reverse Substrings Between Each Pair of Parentheses problem on LeetCode.

This is a solution to the 1717. Maximum Score From Removing Substrings problem on LeetCode.

This is a solution to the Add Two Numbers II problem on LeetCode.

This is a solution to baseball game in leetcode

This gives solution to the problem basic calculator

This gives solution to the problem basic calculator II

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Return the number of distinct groups of cars (car fleets) that reach the target mile together, where a fleet is formed when a faster car catches up to a slower car and they travel at the slower car's speed.

Problem Description

This document provides an implementation of a queue using stacks, supporting push, pop, peek, and empty operations.

This document provides solutions to implement a stack using array.

This is a solution to the Implement Stack using Queues problem on LeetCode.

This is a solution to the Implement Two Stacks in an Array problem on Geeks for Geeks.

This is a solution to the Lexicographically Minimum String After Removing Stars problem on LeetCode.

This is a solution to the longest-valid-parentheses on LeetCode

This gives the solution for maximal Rectangle problem of leetcode

This document provides solutions for maximum of minimum values in all subarrays.

This is a solution to the Mini Parser problem on LeetCode.

Given the root of an n-ary tree, return the postorder traversal of its nodes' values.

Given the root of an n-ary tree, return the preorder traversal of its nodes' values.

This is a solution to the next greater element I problem on LeetCode.

Given a circular integer array nums (i.e., the next element of `nums[nums.length - 1]` is `nums[0]`), return the next greater number for every element in nums..

This is a solution to the Number of Atoms problem on LeetCode.

Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

This tutorial covers the solution to the Parenthesis Checker problem from the GeeksforGeeks website, featuring implementations in Python and C++.

Solution to Leetcode 1209. Remove All Adjacent Duplicates in String II

This is a solution to the Reorder List problem on LeetCode.

This is a solution to the Reverse Only Letters problem on LeetCode.

This is a solution to the Reverse Words in a String III problem on LeetCode.

This is a solution to the Simplify Path problem on LeetCode.

This is a solution to the Stack Designer problem on GeeksForGeeks.

This is a solution to the Stock Spanner on LeetCode.

Problem Description

This is a solution to the Tag Validator problem on LeetCode.

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.