Create Number of Distinct Substrings in a String Using Trie

Number of Distinct Substrings in a String Using Trie

@@ -0,0 +1,53 @@
+Problem Statement: Given a string of alphabetic characters. Return the count of distinct substrings of the string
+(including the empty string) using the Trie data structure.
+
+CODE:
+#include<iostream>
+
+using namespace std;
+
+struct Node {
+  Node * links[26];
+
+  bool containsKey(char ch) {
+    return (links[ch - 'a'] != NULL);
+  }
+
+  Node * get(char ch) {
+    return links[ch - 'a'];
+  }
+
+  void put(char ch, Node * node) {
+    links[ch - 'a'] = node;
+  }
+};
+
+int countDistinctSubstrings(string & s) {
+  Node * root = new Node();
+  int count = 0;
+  int n = s.size();
+  for (int i = 0; i < n; i++) {
+    Node * node = root;
+
+    for (int j = i; j < n; j++) {
+      if (!node -> containsKey(s[j])) {
+        node -> put(s[j], new Node());
+        count++;
+      }
+      node = node -> get(s[j]);
+    }
+
+  }
+  return count + 1;
+}
+
+int main() {
+  string s1 = "ababa";
+  cout << "Total number of distinct substrings : " << countDistinctSubstrings(s1);
+  cout << "\n";
+
+  string s2 = "ccfdf";
+  cout << "Total number of distinct substrings : " << countDistinctSubstrings(s2);
+
+  return 0;
+}