Darbar · Stack 37 slots in the Leetcode Darbar catalog. Darbar Slot Problem Subtopic Difficulty 394 Increasing Order Search Tree binary tree based easy 395 Binary Tree Inorder Traversal binary tree based easy 396 Binary Tree Postorder Traversal binary tree based easy 397 Binary Tree Preorder Traversal binary tree based easy 398 Palindrome Linked List binary tree based easy 399 Implement Queue Using Stacks design easy 400 Implement Stack Using Queues design easy 401 Min Stack design easy 402 Design A Stack With Increment Operation design medium 403 Online Stock Span design medium 404 Maximum Binary Tree divide and conquer medium 405 Construct Binary Search Tree From Preorder Traversal divide and conquer medium 406 Longest Valid Parentheses dp based hard 407 Trapping Rain Water dp based hard 408 Maximal Rectangle dp based hard 409 Minimum Number Of Increments On Subarrays To Form A Target Array dp based hard 410 Valid Parenthesis String dp based medium 411 Next Greater Element I hashing easy 412 Construct Binary Search Tree From Preorder Traversal hashing medium 413 Final Prices With A Special Discount In A Shop monotonic stack easy 414 Next Greater Element I monotonic stack easy 415 Min Stack monotonic stack easy 416 Maximum Binary Tree monotonic stack medium 417 Daily Temperatures monotonic stack medium 418 N Ary Tree Postorder Traversal recursion easy 419 N Ary Tree Preorder Traversal recursion easy 420 Maximum Twin Sum Of A Linked List recursion medium 421 Basic Calculator recursion hard 422 Maximum Nesting Depth Of The Parentheses simple stack easy 423 Remove Outermost Parentheses simple stack easy 424 Baseball Game simple stack easy 425 Remove All Adjacent Duplicates In String simple stack easy 426 Build An Array With Stack Operations simple stack easy 427 Maximum Twin Sum Of A Linked List two pointer medium 428 Minimum Number Of Swaps To Make The String Balanced two pointer medium 429 Trapping Rain Water two pointer hard 430 Maximum Score Of A Good Subarray two pointer hard All topics · Syllabus