C0P3530 Stepik Solution – Stacks&Queues

15.00 $



Write a method bool inLanguage(char* theString) that uses one stack to determine whether theString has the same number of A’s as B’s. If the string contains anything other than A or B (capital A or capital B), return false.


You are given a queue of integers. Check if the queue is valid. A valid queue is one in which the numbers are inserted in ascending order. The queue (5, 44, 333) is a valid queue while the queue (5,44,33) is not.