Merge pull request #4 from naman-narula/master

Create codingninjas.cpp

Author: Mehulcoder

Graphs1/codingninjas.cpp

@@ -0,0 +1,71 @@
+bool check(char graph[][MAXN],int n,int m,bool visited[][MAXN],string s,int i,int j)
+{
+    if(s[0]=='\0')
+        return true;
+    if(visited[i][j]==true)
+        return false;
+    visited[i][j]=true;
+    bool ans=false;
+	if(graph[i-1][j-1]==s[0]&&(i-1>=0&&j-1>=0))
+    {
+       ans=check(graph,n,m,visited,s.substr(1),i-1,j-1);
+        if(ans)
+            return true;
+    }
+    if(graph[i-1][j]==s[0]&&i-1>=0)
+    {    ans=check(graph,n,m,visited,s.substr(1),i-1,j);
+     if(ans)
+            return true;
+    }
+    if(graph[i-1][j+1]==s[0]&&(i-1>=0&&j+1<m))
+    {   ans = check(graph,n,m,visited,s.substr(1),i-1,j+1);
+     if(ans)
+            return true;
+    }
+    if(graph[i][j+1]==s[0] && j+1<m)
+    {	ans = check(graph,n,m,visited,s.substr(1),i,j+1);
+     if(ans)
+            return true;
+    }
+     if(graph[i+1][j+1]==s[0] && (j+1<m&&i+1<n))
+     {
+         ans = check(graph,n,m,visited,s.substr(1),i+1,j+1);
+         if(ans)
+            return true;
+     }
+     if(graph[i+1][j]==s[0] && i+1<n)
+     {ans= check(graph,n,m,visited,s.substr(1),i+1,j);
+      if(ans)
+            return true;
+     }
+     if(graph[i+1][j-1]==s[0] && (j-1>=0&&i+1<n))
+     {ans = check(graph,n,m,visited,s.substr(1),i+1,j-1);
+      if(ans)
+            return true;
+     }
+     if(graph[i][j-1]==s[0] && j-1>=0)
+     {ans = check(graph,n,m,visited,s.substr(1),i,j-1);
+       if(ans)
+            return true;
+     }
+    visited[i][j]=false;
+	if(ans==false)
+        return false;
+    
+    
+}
+int solve(char graph[][MAXN],int N, int M)
+{
+	// Write your code here.
+    bool visited[N][MAXN]={false};
+    string s="CODINGNINJA";
+    for(int k=0;k<N;k++)
+    {
+        for(int l=0;l<M;l++)
+        {	if(graph[k][l]=='C')
+        	{
+            if(check(graph,N,M,visited,s.substr(1),k,l))
+                return true;
+        	}
+        }
+        

Tries/autocomplete.cpp

@@ -0,0 +1,101 @@
+#include <bits/stdc++.h>
+using namespace std;
+class trienode{
+    public:
+    char letter;
+    bool eow;//end of word
+    trienode** children=new trienode* [26];
+    trienode()
+    {
+        letter='\0';
+        eow=false;
+        for(int i=0;i<26;i++)
+            children[i]=NULL;
+    }
+};
+void insert(string s,trienode* head)
+{
+    trienode* curr= head;
+    int i=0;
+    for(i=0;i<s.length();i++)
+    {
+        int index=s[i]-'a';
+        if(curr->children[index]!=NULL)
+        {
+            curr=curr->children[index];
+        }
+        else
+        {
+            curr->children[index]=new trienode();
+            curr->children[index]->letter=s[i];
+            curr=curr->children[index];
+        }
+    }
+        
+        if(i==s.length())
+        {
+            curr->eow=true;
+        }
+    
+}
+void dfs(trienode* root,string in)
+{	if(root->eow)
+    	cout<<in<<endl;
+    
+    for(int i=0;i<26;i++)
+    {	if(root->children[i])
+        dfs(root->children[i],in+root->children[i]->letter);
+    }
+    
+}
+int complete(string search,trienode* head)
+{	trienode* curr = head;
+    for(int i=0;i<search.length();i++)
+    {
+        int index=search[i]-'a';
+        if(curr->children[index]!=NULL)
+        {
+            curr=curr->children[index];
+        }
+        else
+        {
+            return 0;
+        }
+    }
+ 	dfs(curr,search);
+        return 1;
+}
+int main()
+{int n;
+ cin>>n;
+ string input;
+ trienode* head=new trienode();
+ for(int i=0;i<n;i++)
+ {
+     cin>>input;
+    insert(input,head);
+ }
+/* for(int i=0;i<26;i++)
+ {
+     if(head->children[i])
+     {
+         cout<<head->children[i]->letter<<endl;
+     }
+ }*/
+ int q;
+ cin>>q;
+ string search;
+ int result;
+ for(int i=0;i<q;i++)
+ {
+     cin>>search;
+     result=complete(search,head);
+     if(result==0)
+     {
+         cout<<"No suggestions"<<endl;
+         insert(search,head);
+     }
+ }
+ 
+    return 0;
+}