Word Break LeetCode Java

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given
s = "leetcode",
dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

Have you been asked this question in an interview?

 Idea: Dynamic programming + Nested Loop
      Create the DP table to store results of sub-problems.
      The value res[i] will be true if str[0..i-1]
      can be segmented into dictionary words,
      otherwise false.

    Steps in detail:
    outer loop: i start from 0 to N
    inner loop: j start from 0 to i
    res[i+1]<- true iff res[j]<-true and dict contain this word

 public static boolean wordBreak(String s, Set<String> dict) {
        if(s==null || s.length()==0) return true;
        int len=s.length();
        boolean res[]=new boolean[len+1];
        //initial res[0]
        res[0]=true;
        for(int i=0;i<len;i++){
            StringBuilder tempStr=new StringBuilder(s.substring(0,i+1));
            for(int j=0;j<=i;j++){
                if(res[j] && dict.contains(tempStr.toString())){
                    res[i+1]=true;
                    break;
                }
                tempStr.deleteCharAt(0);
            }
        } 
          /*  For the case of str="leetcode"  dict="leet", "code"
          res= [true, false, false, false, true, false, false, false, true]
          after the nested loop
             */
        return res[len];
    }