Please complete the following 4 functions. You can test by running the pytest or python3 commands:

• To run just the main code for one problem: python3 reverse.py
• To run the tests for one problem: pytest reverse_test.py
• To run all the tests prior to submission: pytest

You SHOULD implement your problem solutions in the following files:

• reverse.py
• matching.py
• generate_binary.py
• count_longest.py

You SHOULD NOT modify the following files:

• Queue.py
• Stack.py
• count_longest_test.py
• generate_binary_test.py
• matching_test.py
• reverse_test.py

Looking for additional practice problems to prepare for the exam?

• practice-problems.py

• Thinking of using a loop? For loops are for strings, whiles are for Stacks & Queues!
• The only way to iterate / loop through the Stack or Queue you've been given in this assignment is to destroy it (i.e., make it empty).

Write a function reverse in python that takes a queue as a parameter and returns a new queue in reverse order. Your solution should not use any built-in or library functions other than those in the Stack and Queue classes provided.

Note: We are using the notation Q[ ] here to differentiate our queues from lists or arrays.

Hint: use a stack to help! You can destroy the queue & make it empty!

Write a function matcher in python that takes a string containing braces ([{()}]) as a parameter and returns True if the braces are matched, and False otherwise. The braces may be nested. Your solution should not use any built-in or library functions other than those in the Stack and Queue classes provided.

Hint: use a stack!

Write a function generate_binary_numbers that takes a number N as a parameter and returns a queue of binary number strings from 1 to N without using any built-in or library functions like bin(). In fact, your solution should not use any built-in or library functions other than those in the Stack and Queue classes provided. The front of the queue begins @ '1'. If N is too small, return an empty queue.

Hint: use an extra queue to help! Start from 1, & add 0 & 1 to copies of it.

Recall that the typical numbers we are used to working with every day are decimal numbers, or base 10. By contrast, computers natively work with binary numbers, which are base 2.

To read binary numbers, begin writing the powers of 2 from right to left:

Note: The dots (.) should not be in your final output, but are used here to align the numbers under the appropriate power of 2.

Write a function count_longest that takes a queue of characters as a parameter and returns the length of the longest consecutive subsequence. For example:

Hint: you can destroy the queue & make it empty!

Your solution should not use any built-in or library functions other than those in the Stack and Queue classes provided.

Click the "Work in Repl.it" button. Edit the file. To run, see the commands below.

With this option, you can develop on your laptop. You will need to install PyCharm (or another IDE), git, and pytest. PyCharm has some built-in git support.

Many of the tests are failing right now because the functions aren't outputting the correct information. Fixing this will make the tests pass & turn green.

To use pytest on repl.it, install it first:

pip3 install pytest

To install pytest on the command line for running on a laptop (using a linux or unix based command-line like MacOS):

sudo -H pip3 install pytest

If using PyCharm, you may need to fix your project setup.

• Open the Settings/Preferences | Tools | Python Integrated Tools settings dialog.
• In the Default test runner field select pytest.
• Click OK to save the settings.

To run just the main code for one problem:

python3 reverse.py

To run the tests for one problem:

pytest reverse_test.py

To run all the tests prior to submission:

pytest