We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 18: Queues and Stacks
  5. Discussions

Day 18: Queues and Stacks

Sort by

recency

|

695 Discussions

|

  • illogicalsleepi1
     + 0 comments
    class Solution:
    def __init__(self):
        self.stack=[]
        self.queue=[]
    def pushCharacter(self,x):
        self.stack.append(x)
    def enqueueCharacter(self,x):
        self.queue.insert(0,x)
    def popCharacter(self):
        return self.stack.pop()
    def dequeueCharacter(self):
        return self.queue.pop()

  • dadougla
     + 0 comments

    There is a PHP error with the code provided.

    PHP Fatal error: Array and string offset access syntax with curly braces is no longer supported in Solution.php on line 34

  • cpharshadeep
     + 0 comments

    code in java 15 class solution {

    ArrayDeque ad1=new ArrayDeque(); //for stack ArrayDeque ad2=new ArrayDeque(); //for queue

    void pushCharacter(char ch)
{
    ad1.push(ch);

}
void enqueueCharacter(char ch)
{
    ad2.add(ch);
}


char popCharacter()
{
    return (char)ad1.pop();
}

char dequeCharacter()
{
    return (char)ad2.poll();
}





public static void main(String[] args) {

    Scanner sc=new Scanner(System.in);
    String s=sc.nextLine();
    Solution p=new Solution();
    for(int i=0;i<s.length();i++)
    {
        p.pushCharacter(s.charAt(i));
        p.enqueueCharacter(s.charAt(i));
    }

    boolean b=true;
    for(int i=0;i<s.length()/2;i++)
    {
        if(p.popCharacter()!=p.dequeCharacter())
        {
            b=false;
            break;
        }
    }
    if(b)
    {
        System.out.println("The word, "+s+", is a palindrome.");
    }
    el
            }se
    {
    System.out.println("The word, "+s+", is not a palindrome.");
    }
}

  • vinayabusam188
     + 0 comments

    def init(self): self.stack = [] self.queue = []

    def pushCharacter(self, char):
    self.stack.append(char)

def enqueueCharacter(self, char):
    self.queue.append(char)

def popCharacter(self):
    if len(self.stack) == 0:
        return None
    return self.top()
    self.stack = self.stack[:-1]

def top(self):
    if len(self.stack) == 0:
        return None
    return self.stack[-1]

def dequeueCharacter(self):
    if len(self.queue) == 0:
        return None
    return self.front()
    self.queue = self.queue[1:]

def front(self):
    if len(self.queue) == 0:
        return None
    return self.queue[0]

  • 19n81a05p0tb
     + 0 comments

    Java

    public class Solution {
    // Write your code here.
     Stack<Character> stack = new Stack<>();
    Queue<Character> queue = new LinkedList<>();
    public void pushCharacter(char c)
    {
        stack.push(c);
    }
    public void enqueueCharacter(char c)
    {
        queue.add(c);
    }
    public char popCharacter()
    {
        return stack.pop();
    }
    public char dequeueCharacter()
    {
        return queue.remove();
    }