{"id":9975,"date":"2022-09-26T11:48:20","date_gmt":"2022-09-26T11:48:20","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9975"},"modified":"2022-12-14T10:34:58","modified_gmt":"2022-12-14T10:34:58","slug":"reverse-a-string-using-a-stack","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/reverse-a-string-using-a-stack\/","title":{"rendered":"Reverse a String using a Stack"},"content":{"rendered":"

\"\"<\/p>\n

Problem Statement<\/h3>\n

You are given a string, and your task is to reverse the string using a stack data structure<\/a>.<\/p>\n

Input<\/strong>: String.
\nOutput<\/strong>: Reversed string.<\/p>\n

Test cases:<\/h3>\n

Input<\/strong>: \u201cPrepbytes\u201d
\nOutput<\/strong>: \u201csetybpreP\u201d<\/p>\n

Explanation:<\/h3>\n

Reading the input string \u201cPrepbytes\u201d from right to left we get \u201csetybpreP\u201d.
\nApproach – Using Stack
\nThe idea is to traverse the given string from left to right and push each character in the stack. Then, pop the characters from the stack one by one and append them to a new string. The newly created will be the reverse of the input string because of the LIFO (Last-in-first-out) property of the stack data structure. The last character pushed into the stack will be the first to get popped.<\/p>\n

Algorithm<\/h3>\n
    \n
  1. Initialize an empty stack and an array.<\/li>\n
  2. Traverse the given string from left to right\n
      \n
    • Push the current character to the stack<\/li>\n<\/ul>\n<\/li>\n
    • Initialize an empty StringBuilder<\/li>\n
    • Pop from the stack one by one.\n
        \n
      • Append the current character at last.<\/li>\n<\/ul>\n<\/li>\n
      • Return the newly created StringBuilder as a string.<\/li>\n<\/ol>\n

        Dry Run:<\/h3>\n

        \"\"<\/p>\n

        \"\"
        \n\"\"
        \n\"\"
        \n\"\"
        \n\"\"
        \n\"\"
        \n\"\"
        \n\"\"
        \n\"\"<\/p>\n

        Code Implementation:<\/h3>\n\t\t\t\t\t\t