-
Delete all containers
$ docker ps -q -a | xargs docker rm
-q prints only the container IDs -a prints all containers
Notice that it uses xargs to issue a remove container command for each container ID
- Delete all untagged images
| def coin_change_dp_bottom_top(amount: int, coins: set): | |
| db = [0] * (amount + 1) | |
| db[0] = 1 | |
| for coin in coins: | |
| for i in range(coin, amount + 1): | |
| db[i] += db[i - coin] | |
| return db[amount] |
| /* | |
| Merge two linked lists | |
| head pointer input could be NULL as well for empty list | |
| Node is defined as | |
| class Node { | |
| int data; | |
| Node next; | |
| } | |
| */ |
| /* | |
| Print elements of a linked list in reverse order | |
| head pointer input could be NULL as well for empty list | |
| Node is defined as | |
| class Node { | |
| int data; | |
| Node next; | |
| } | |
| */ | |
| void ReversePrint(Node head) { |
| /* | |
| Reverse a linked list and return pointer to the head | |
| The input list will have at least one element | |
| Node is defined as | |
| class Node { | |
| int data; | |
| Node next; | |
| } | |
| */ |
| /* | |
| Compare two linked lists A and B | |
| Return 1 if they are identical and 0 if they are not. | |
| Node is defined as | |
| class Node { | |
| int data; | |
| Node next; | |
| } | |
| */ | |
| int CompareLists(Node headA, Node headB) { |
Delete all containers
$ docker ps -q -a | xargs docker rm
-q prints only the container IDs -a prints all containers
Notice that it uses xargs to issue a remove container command for each container ID
git clone [email protected]:YOUR-USERNAME/YOUR-FORKED-REPO.git
cd into/cloned/fork-repo
git remote add upstream git://github.com/ORIGINAL-DEV-USERNAME/REPO-YOU-FORKED-FROM.git
git fetch upstream