Added files

Author: avidLearnerInProgress

30-days-of-code-may/11.singleElementInSortedArray.cpp

@@ -2,11 +2,9 @@ class Solution {
 public:
     int singleNonDuplicate(vector<int>& nums) {
 
-        int start = 0, end = nums.size() - 1, mid;
-        
+        int start = 0, end = nums.size() - 1, mid;      
         while(start < end){
             mid = start + (end - start) / 2;
-            
             if(mid % 2 == 0){
                 if(nums[mid] == nums[mid+1]) start = mid + 2;
                 else if(nums[mid] == nums[mid-1]) end = mid - 2;

30-days-of-code-may/13.triePrefixInsertSearch.cpp

@@ -0,0 +1,57 @@
+class Trie {
+    
+    private:
+    Trie *next[26] = {};
+    bool isWord = false;
+    
+    
+    public:
+        /** Initialize your data structure here. */
+        Trie() {}
+
+        /** Inserts a word into the trie. */
+        void insert(string word) {
+            Trie *node = this;
+            for(auto ch : word){
+                ch -= 'a';
+                
+                if(!node->next[ch]){
+                    node->next[ch] = new Trie();
+                }
+                node = node->next[ch];
+            }
+            node->isWord = true;
+        }
+
+        /** Returns if the word is in the trie. */
+        bool search(string word) {
+            Trie *node = this;
+            for(auto ch : word){
+                ch -= 'a';
+                
+                if(!node->next[ch]) return false;
+                node = node->next[ch];
+            }
+            return node->isWord;
+        }
+
+        /** Returns if there is any word in the trie that starts with the given prefix. */
+        bool startsWith(string prefix) {
+            
+            Trie *node = this;
+            for(auto ch : prefix){
+                ch -= 'a';
+                if(!node->next[ch]) return false;
+                node = node->next[ch];
+            }
+            return true;
+        }
+};
+
+/**
+ * Your Trie object will be instantiated and called as such:
+ * Trie* obj = new Trie();
+ * obj->insert(word);
+ * bool param_2 = obj->search(word);
+ * bool param_3 = obj->startsWith(prefix);
+ */