-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Lecture "Brute-force argorithms", exercise 2 #18
Comments
To test the algorithm introduced in Listing 2, I have found 2 different approaches. first approach
You can see the code in action here
|
|
It returns:
|
|
If we execute the code, the result is |
|
Task_2
print(testing([0, 1, 2], deque([0, 1, 2]))) #the test returns True |
from collections import deque def test_stack_from_list(input_list, expected) print(test_stack_from_list(list[12, 13, 14, 15], deque([12, 13, 14, 15]))) |
|
Hi @ManuSrivastava1, Please, go back to see how the template of the test works, since you are specifying too many parameters to the testing function. You have made things a little more complicated for a user perspective. |
|
|
|
|
Create a test case for the algorithm introduced in Listing 2.
The text was updated successfully, but these errors were encountered: