πŸ‘¨β€πŸ’»
Cracking-Interview
search
⌘Ctrlk
πŸ‘¨β€πŸ’»
Cracking-Interview
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
  • Stack and Queue
    • Problems
      • 1.Min Stack
      • 2. Max Stack
      • 3.Valid Parentheses
      • 4.Evaluate Reverse Polish Notation
      • 5.Infix And Prefix and Postfix Conversions
      • 6.Next Greater Element I
      • 7.Next Greater Element II
      • 8.Sliding Window Maximum
      • 9.Gas Station (Circular Tour Problem)
      • 10.Daily Temperatures
      • 11.Decode String
      • 12. Largest Rectangle in Histogram
      • 13. Maximal Rectangle
      • 14. Minimum Remove to Make Valid Parentheses
      • 15. Map of Highest Peak
      • 16. Longest Valid Parentheses
      • 17. Online Stock Span
      • 18. Score of Parentheses
      • 19. Remove K Digits(imp)
      • 20. Design a Stack With Increment Operation
      • 21. Final Prices With a Special Discount in a Shop
      • 22. Valid Parenthesis String
      • 23. Reveal Cards In Increasing Order
      • 24. Remove All Adjacent Duplicates In String
      • 25. Number of Visible People in a Queue
      • 26.Number following a pattern
    • Implementation
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
  • Dynamic Programming
  • Greedy Algorithms
  • Backtracking
  • Sub Array and Sliding Window Problems
  • Design
  • Maths
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • πŸ’ΎDBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • πŸ–₯️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • πŸš™OOPS
    • Introduction and Definitions
  • πŸ“¨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Stack and Queue

Problems

1.Min Stackchevron-right2. Max Stackchevron-right3.Valid Parentheseschevron-right4.Evaluate Reverse Polish Notationchevron-right5.Infix And Prefix and Postfix Conversionschevron-right6.Next Greater Element Ichevron-right7.Next Greater Element IIchevron-right8.Sliding Window Maximumchevron-right9.Gas Station (Circular Tour Problem)chevron-right10.Daily Temperatureschevron-right11.Decode Stringchevron-right12. Largest Rectangle in Histogramchevron-right13. Maximal Rectanglechevron-right14. Minimum Remove to Make Valid Parentheseschevron-right15. Map of Highest Peakchevron-right16. Longest Valid Parentheseschevron-right17. Online Stock Spanchevron-right18. Score of Parentheseschevron-right19. Remove K Digits(imp)chevron-right20. Design a Stack With Increment Operationchevron-right21. Final Prices With a Special Discount in a Shopchevron-right22. Valid Parenthesis Stringchevron-right23. Reveal Cards In Increasing Orderchevron-right24. Remove All Adjacent Duplicates In Stringchevron-right25. Number of Visible People in a Queuechevron-right26.Number following a patternchevron-right
PreviousStack and Queuechevron-leftNext1.Min Stackchevron-right

Last updated 4 years ago