hsaputra

# generate a list of container ID from the docker ps command
!docker ps -a | awk '{print $1}' | tail -n +2

hsaputra

# for each container ID use the docker "rm" command to remove/delete the container
!for cid in $(docker ps -a | awk '{print $1}' | tail -n +2);do docker rm $cid; done

hsaputra

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList) {
      
      // check input
      if (!wordList.contains(endWord)) {
        return 0;
      }
      
      // We are going to use BFS to build the graph of the beginWord to endWord using
      // all words in the wordList

hsaputra

Add it to your ~/.bashrc file"

export JAVA_HOME=$(readlink -f /usr/bin/java | sed "s:bin/java::")

hsaputra

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.

We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.

You must solve this problem without using the library's sort function. 

Example 1:

Input: nums = [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]