Session 38: IL for Trie

Original Session

Date: 06 Feb 2025

Topic: Trie IL

Programs

1. 140. Word Break II
   1. leetcode here

      class Solution {
          List<String> ans = new ArrayList<>();
          Tries trie = new Tries();
      
          public List<String> wordBreak(String s, List<String> wordDict) {
              for (String word : wordDict) {
                  trie.insert(word);
              }
      
              // Start the recursive helper function
              helper(s, "", 0);
              return ans;
          }
      
          void helper(String s, String st, int pos) {
              if (pos == s.length()) {
                  ans.add(st.trim()); // Trim extra space at the end
                  return;
              }
      
              StringBuilder temp = new StringBuilder();
      
              for (int i = pos; i < s.length(); i++) {
                  temp.append(s.charAt(i));
      
                  if (trie.search(temp.toString())) {
                      helper(s, st + (st.isEmpty() ? "" : " ") + temp.toString(), i + 1);
                  }
              }
          }
      }

2. 212. Word Search II
   1. leetcode here

      Just Understand question will be covered in Graph

3. [HomeWork] 648. Replace Words
   1. leetcode here

4. [HomeWork] 336. Palindrome Pairs
   1. leetcode here