Sample Code in Java<\/h2>\n

<\/div>

import java.util.*;   \/\/stack class Stack {     int size;     int top;     char[] a;        \/\/function to check if stack is empty     boolean isEmpty()     {         return (top < 0);     }           Stack(int n)     {         top = -1;         size = n;         a = new char[size];     }       \/\/function to push element in Stack     boolean push(char x)     {         if (top >= size)         {         System.out.println("Stack Overflow");         return false;         }         else        {             a[++top] = x;             return true;         }     }       \/\/function to pop element from stack     char pop()     {         if (top < 0)         {         System.out.println("Stack Underflow");         return 0;         }         else        {             char x = a[top--];             return x;         }     } }     \/\/ Driver code class Main {     \/\/function to reverse the string     public static void reverse(StringBuffer str)     {         \/\/ Create a stack of capacity          \/\/ equal to length of string         int n = str.length();         Stack obj = new Stack(n);                   \/\/ Push all characters of string          \/\/ to stack         int i;         for (i = 0; i < n; i++)         obj.push(str.charAt(i));               \/\/ Pop all characters of string          \/\/ and put them back to str         for (i = 0; i < n; i++)         {              char ch = obj.pop();             str.setCharAt(i,ch);         }     }            \/\/driver function     public static void main(String args[])     {         \/\/create a new string         StringBuffer s= new StringBuffer("Wikitechy");                   \/\/call reverse method         reverse(s);                   \/\/print the reversed string         System.out.println("Reversed string is " + s);     } } <\/code><\/pre> <\/div>\n
\n
\n
Output<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
Reversed string<\/span> is yhcetikiW.\r\n<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n
\n
\n
Time Complexity:<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
O(n) where n is number of characters in\u00a0stack.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Answer : Given a string, reverse it using stack…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,3230,971,491,221,368,203,199,214,198,363,3057,3228,205,222,15934,484,3054,3231,3225,196,212,3232,207,366,204,3221,3219,3224,3235,3218,3222,3226,3215,3214,3216,3227,3233,3234,3217,15925,206,972,3229,200,3055,197,3223,968,3056,3220,285,969],"class_list":["post-478","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-algorithm-for-palindrome-using-stack","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-applied-materials-interview-questions-and-answers","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-te-interview-questions-and-answers","tag-data-structure-to-reverse-string-other-than-stack","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-flipkart-interview-questions-and-answers","tag-geekyants-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-how-to-push-a-string-into-a-stack-in-c","tag-how-to-reverse-a-stack-in-c","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-java-input-string","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-rereverse-a-string-using-stack-in-cstack-string-java","tag-reverse-a-linked-list-using-stack-in-c","tag-reverse-a-list-using-stack-in-c","tag-reverse-a-number-using-stack","tag-reverse-a-number-using-stack-in-c","tag-reverse-a-string-in-java","tag-reverse-a-string-using-stack-c","tag-reverse-a-string-using-stack-in-c","tag-reverse-a-string-using-stack-in-java","tag-reverse-a-string-using-stack-in-python","tag-reverse-string-using-stack-data-structure-in-c","tag-reverse-string-using-stack-in-java","tag-reverse-words-in-a-string-using-stack","tag-reverse-words-in-a-string-using-stack-c","tag-samsung-interview-questions-and-answers","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-stack-string-java","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-use-a-stack-to-reverse-the-words-of-a-sentence","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-write-a-program-to-reverse-a-string-using-stack-data-structu","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n