jargon4072 / ds-algo_implementations Goto Github PK

View Code? Open in Web Editor NEW

0.0 0.0 0.0 873 KB

This is collection of implementation of various algorithms and data structures in c++.

License: GNU General Public License v3.0

C++ 92.05% C 0.42% Python 6.52% Java 0.10% C# 0.11% Scala 0.80%

algorithm cpp data-structures

ds-algo_implementations's Introduction

🥷🏻Chandan Dwivedi

AI Engineer

👋 Hi, I’m Chandan Dwivedi
👀 I’m interested in Artifical Intelligence and Machine Learning
🌱 I’m currently learning Reinforcement Learning
💞️ I’m looking to collaborate on ML,Deep Learning, Neural Networks

Need to contact me? Find me here:

🧑🏼‍💻 Languages and Tools I work with:

📠 My Latest Blogs:

📊 Stats

ds-algo_implementations's People

Contributors

Watchers

ds-algo_implementations's Issues

attempt it after bfs.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/queue/mintimetorotoranges.cpp

Lines 8 to 9 in c3d9175

    
               vector<vector<int>> vec(i,vector<int> (j,0));    //TODO: attempt it after bfs. 
        
           }

check this function for expression like ()(()))))

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/stack/lenlongestvalidsubstring.cpp

Lines 12 to 17 in c3d9175

    
             stack<char> st;              */  //TODO: check this function for expression like ()(())))) 
        
             /*int l=s.length(); 
        
             string str; 
        
             st.push('N'); 
        
             for(int i=0;i<l;i++){      //push given string in stack st in reverse order. 
        
               st.push(s[l-i-1]);

implement it again.also imp. it without classes(i.e. function call);

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trie/pattern_searching.cpp

Lines 4 to 9 in c3d9175

    
           class suffixtrienode{        //TODO: implement it again.also imp. it without classes(i.e. function call); 
        
           private: 
        
               suffixtrienode* children[max_char]; 
        
               list<int> *indexes; 
        
           public: 
        
               suffixtrienode(){

complete this after q1.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/cj_qr_2.cpp

Lines 83 to 85 in c3d9175

    
                                          // TODO: complete this after q1. 
        
             } 
        
           }

implement it again after implementing inorder traversal without recursion or stack;

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/BST/kthsmallestelementBST.cpp

Lines 29 to 34 in c3d9175

    
           int kthsmallestelementmorris(treenode* root, int value){ //TODO:implement it  again after implementing inorder traversal without recursion or stack; 
        
               int count=0; 
        
               int ksmall=INT_MIN; 
        
               treenode* curr=root; 
        
               while(curr!=NULL){ 
        
                   if(curr->left==NULL){

implement it again.

opened via imdone.io from a code comment on c3d9175

https://github.com/Jargon4072/DS-ALGO_implementations/blob/c3d9175dab821d5476f9f16fb805da972e0f719a/c++/trie/insert&search.cpp#L4-L9

implement it with count=q.size();

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trees/printlevelordertreelinebyine.cpp

Lines 16 to 21 in c3d9175

    
           void levelorderlinebyline(treenode* root){     //TODO: implement it with count=q.size(); 
        
               if(root==NULL) 
        
                   return; 
        
               treenode* temp=new treenode; 
        
               temp=root; 
        
               queue<treenode *> q;

try to implement it without pointer

    return 0;                               //i.e. with int height insted of int* height

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trees/diameterofbinarytree.cpp

Lines 35 to 41 in c3d9175

    
               *height=0;                      //TODO: try to implement it without pointer 
        
               return 0;                               //i.e. with int height insted of int* height 
        
           } 
        
           int lh=0,rh=0; 
        
           int ldiameter=diameter(root->left,&lh); 
        
           int rdiameter=diameter(root->right,&rh); 
        
           *height=max(lh,rh)+1;

implement it with preorder traversal.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trees/maxwidthoftree.cpp

Lines 15 to 20 in c3d9175

    
           int maxwidth(treenode* root){     //TODO: implement it with preorder traversal. 
        
               if(root==NULL) 
        
                   return 0; 
        
               queue<treenode* > q; 
        
               q.push(root); 
        
               int w=0;

implement it again.aldo do for in & post

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trees/tree_with_In_Preorder.cpp

Lines 22 to 27 in c3d9175

    
           treenode* buildTree(char in[], char pre[], int inStrt, int inEnd){    //TODO: implement it again.aldo do for in & post 
        
             static int preIndex = 0; 
        
             if(inStrt > inEnd) 
        
                   return NULL; 
        
             treenode *tNode = newnode(pre[preIndex++]);

not a efficient func. try to look closer into behaviour of sort.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/cj_qr_2.cpp

Lines 4 to 9 in c3d9175

    
           #define MAX 1000000            //NOTE: not a efficient func. try to look closer into behaviour of sort. 
        
           /*void swap(ll *xp, ll *yp) 
        
           { 
        
               ll temp = *xp; 
        
               *xp = *yp; 
        
               *yp = temp;

analyze it and implement it again differently.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/stack/stockspan.cpp

Lines 3 to 8 in c3d9175

    
           void stockspan(string str){     //TODO: analyze it and implement it again differently. 
        
             stack<int> st; 
        
             st.push(0); 
        
             istringstream stream(str); 
        
             int p; 
        
             int arr[100000];

implement it wihtout stack.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trees/nonrecursiveinorder.cpp

Lines 23 to 28 in c3d9175

    
           void nonrecursiveinorder(treenode* root){    //TODO: implement it wihtout stack. 
        
               stack<treenode* > st; 
        
               treenode* temp=new treenode; 
        
               temp=root; 
        
               while(1){ 
        
                   while(temp!=NULL){

create a blogpost for this.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/stack/celebrityproblem.cpp

Lines 45 to 50 in c3d9175

    
           int main(){            //TODO:create a blogpost for this. 
        
             int n=4; 
        
             int id=celebrity(n); 
        
             if(id==-1){ 
        
               cout<<"No celebrity."<<endl; 
        
             }

Try this after attempting level order tree trversal.

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/queue/checkbinerytreecompleteornot.cpp

Lines 2 to 7 in c3d9175

    
           using namespace std;         //TODO: Try this after attempting level order tree trversal. 
        
           struct node{ 
        
               int data; 
        
               node* left; 
        
               node* right; 
        
           };

impelement it with extra node prevnode pointing to the TrieNode which corresponds

bool isleaf;                 //to the last entered character by the user

opened via imdone.io from a code comment on 311ccb5a91bf6bb5d1d8940b11f02f47e73ebbdf by Chandan Dwivedi [email protected]

DS-ALGO_implementations/c++/trie/phone_directory.cpp

Lines 12 to 18 in c3d9175

    
           struct trienode{          //TODO:impelement it with extra node prevnode pointing to the TrieNode which corresponds 
        
               bool isleaf;                 //to the last entered character by the user 
        
               trienode* children[50]; 
        
               list<string> word; 
        
           }; 
        
           trienode* getnode(void){ 
        
               trienode* new_node=NULL;

	vector<vector<int>> vec(i,vector<int> (j,0)); //TODO: attempt it after bfs.
	}

	stack<char> st; */ //TODO: check this function for expression like ()(()))))
	/*int l=s.length();
	string str;
	st.push('N');
	for(int i=0;i<l;i++){ //push given string in stack st in reverse order.
	st.push(s[l-i-1]);

	class suffixtrienode{ //TODO: implement it again.also imp. it without classes(i.e. function call);
	private:
	suffixtrienode* children[max_char];
	list<int> *indexes;
	public:
	suffixtrienode(){

	int kthsmallestelementmorris(treenode* root, int value){ //TODO:implement it again after implementing inorder traversal without recursion or stack;
	int count=0;
	int ksmall=INT_MIN;
	treenode* curr=root;
	while(curr!=NULL){
	if(curr->left==NULL){

	void levelorderlinebyline(treenode* root){ //TODO: implement it with count=q.size();
	if(root==NULL)
	return;
	treenode* temp=new treenode;
	temp=root;
	queue<treenode *> q;

	*height=0; //TODO: try to implement it without pointer
	return 0; //i.e. with int height insted of int* height
	}
	int lh=0,rh=0;
	int ldiameter=diameter(root->left,&lh);
	int rdiameter=diameter(root->right,&rh);
	*height=max(lh,rh)+1;

	int maxwidth(treenode* root){ //TODO: implement it with preorder traversal.
	if(root==NULL)
	return 0;
	queue<treenode* > q;
	q.push(root);
	int w=0;

	treenode* buildTree(char in[], char pre[], int inStrt, int inEnd){ //TODO: implement it again.aldo do for in & post
	static int preIndex = 0;

	if(inStrt > inEnd)
	return NULL;
	treenode *tNode = newnode(pre[preIndex++]);

	#define MAX 1000000 //NOTE: not a efficient func. try to look closer into behaviour of sort.
	/void swap(ll xp, ll *yp)
	{
	ll temp = *xp;
	xp = yp;
	*yp = temp;

	void stockspan(string str){ //TODO: analyze it and implement it again differently.
	stack<int> st;
	st.push(0);
	istringstream stream(str);
	int p;
	int arr[100000];

	void nonrecursiveinorder(treenode* root){ //TODO: implement it wihtout stack.
	stack<treenode* > st;
	treenode* temp=new treenode;
	temp=root;
	while(1){
	while(temp!=NULL){

	int main(){ //TODO:create a blogpost for this.
	int n=4;
	int id=celebrity(n);
	if(id==-1){
	cout<<"No celebrity."<<endl;
	}

	using namespace std; //TODO: Try this after attempting level order tree trversal.
	struct node{
	int data;
	node* left;
	node* right;
	};

	struct trienode{ //TODO:impelement it with extra node prevnode pointing to the TrieNode which corresponds
	bool isleaf; //to the last entered character by the user
	trienode* children[50];
	list<string> word;
	};
	trienode* getnode(void){
	trienode* new_node=NULL;

jargon4072 / ds-algo_implementations Goto Github PK

ds-algo_implementations's Introduction

🥷🏻Chandan Dwivedi

🧑🏼‍💻 Languages and Tools I work with:

📠 My Latest Blogs:

📊 Stats

ds-algo_implementations's People

Contributors

Watchers

ds-algo_implementations's Issues

Recommend Projects

Recommend Topics

Recommend Org