When A Guy Talk with a girl

Why a guy talk with a girl it is not about love it maybe

  1. He needs some advice related work, Carrer.
  2. He want to share his thought with a girl
  3. He want to know how is his friend ( a girl)
  4. He is need of urgent help.

and Vice Versa 😛

Broden your thinking!

 

Advertisements

17 Things to be done in 2017 !!

  1. Codeutasva 1.0
  2. Competitive Programming
  3. Try to Gain More weight 😀 .
  4. Healthy lifestyle (will try to learn a game)
  5. Better Placement
  6. Blog/Quora/Stackoverflow Writing
  7. Sponsor education of 2 Kids.
  8. Be a speaker in a PYCON
  9.  5 Books min (Suggestion are welcomed)
  10. 1 Foreign trip min 😀
  11. More Fluent English
  12. Learning of new Tech skill
  13.  Submission of First Patch in open source
  14. New Laptop (with 24′ Monitor)
  15. Mentoring of cs Domain student
  16. Helping Aravali scholar in great Initiative
  17. Family Trips to Hill station

Trie Implementation…

Trie Implementation in C++

Source /Psuedo Code :- https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/
#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
using namespace std;
struct trie
{
long int words;
long int prefixs;
struct trie * children[26];
};
void initialize(struct trie * node)   //Initialisation  of Node
{
node->words=0;
node->prefixs=0;
for(int i=0;i<26;++i)
node->children[i]=NULL;
}
void addWord(struct trie * node,char * s)  //To add string s
{
if(s[0]==’\0′)
{
node->words+=1;
return;
}
else
{
node->prefixs+=1;
char k=s[0];
if(node->children[k-‘a’]==NULL)
{
node->children[k-‘a’]= (struct trie *) malloc(sizeof(struct trie));
initialize(node->children[k-‘a’]);
}
addWord(node->children[k-‘a’],s+1);  //Recurence
}

}
int countWords(struct trie * node,char *s)
{
if(s[0]==’\0′)
return node->words;
else if(node->children[s[0]-‘a’]==NULL)
return 0;
else
return countWords(node->children[s[0]-‘a’],s+1);
}
int countPrefix(struct trie * node,char *s)
{
if(s[0]==’\0′)
return node->prefixs;
else if(node->children[s[0]-‘a’]==NULL)
return 0;
else
return countPrefix(node->children[s[0]-‘a’],s+1);
}
int main()
{
struct trie * root;
root=(struct trie *) malloc(sizeof(struct trie));
initialize(root);
char S[]=”lalit”;
char prefix[]=”l”;
addWord(root,S);
addWord(root,(char *)”satt”);
addWord(root,(char *)”satt”);
addWord(root,(char *)”satt”);
addWord(root,(char *)”satt”);
addWord(root,(char *)”chauhan”);
cout<<countPrefix(root,(char *)””)<<endl;
return 0;
}

First Blog

Hello Everyone ,

I am Lalit (Fresher :D) . I am Undergraduate student at N.I.T Raipur .   I have Knowledge of Python ,C++,C,Opencv,Ubuntu like things .If you struck  in same then You can ask your query through mail (lalitc375@gmail.com) or by commenting .

Cheers

Lalit Chauhan
Junior Undergraduate (B.Tech 2nd Year)
Dept. of Information Technology