{"id":21315413,"url":"https://github.com/rajsoni03/data-structure-in-cpp","last_synced_at":"2025-03-15T21:26:18.035Z","repository":{"id":112055325,"uuid":"423346027","full_name":"Rajsoni03/Data-Structure-in-CPP","owner":"Rajsoni03","description":null,"archived":false,"fork":false,"pushed_at":"2022-10-07T04:05:21.000Z","size":71,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-22T10:31:28.762Z","etag":null,"topics":["algorithm","cpp","data-structures"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Rajsoni03.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-11-01T05:18:07.000Z","updated_at":"2024-08-27T14:58:35.000Z","dependencies_parsed_at":"2023-05-04T11:34:05.509Z","dependency_job_id":null,"html_url":"https://github.com/Rajsoni03/Data-Structure-in-CPP","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FData-Structure-in-CPP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FData-Structure-in-CPP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FData-Structure-in-CPP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rajsoni03%2FData-Structure-in-CPP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Rajsoni03","download_url":"https://codeload.github.com/Rajsoni03/Data-Structure-in-CPP/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243791601,"owners_count":20348480,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","cpp","data-structures"],"created_at":"2024-11-21T18:19:51.433Z","updated_at":"2025-03-15T21:26:18.028Z","avatar_url":"https://github.com/Rajsoni03.png","language":"C++","readme":"# Data Structure in C++\n\n## Array\n- Implement Array template class\n- Pointer to array\n- Implement find, indexAt methods\n- Implement Binary Search Algorithm\n- Copy Constructor \u0026 Copy Assignment\n- Move Constructor \u0026 Move Assignment \n- Operator Overloading\n- Use STL Array \n\n## Vector\n- Implement Vector Template Class\n- Dynemic Memory Management in Heap\n- Implement `push_back()` \u0026 `push_front()`\n- Implement `pop_back()` \u0026 `pop_front()`\n- Vector Scaling Algorithms\n  - Increase Capacity by 1 \n  - Increase Capacity by BLOCK_SIZE - 2, 4, 8, 16\n  - Increase Capacity by Double the Capacity\n- Time \u0026 Space Complexity\n- Use STL Vector\n\n## Linked List\n- Implement Singly LinkedList Template Class\n- Use nested Node class\n- Implement insertion methods\n  - `push_front()`\n  - `push_back()`\n  - `push_at()`\n- Implement deletion methods\n  - `pop_front()`\n  - `pop_back()`\n  - `pop_at()`\n  - `earse()`\n- Struct based Implementation of Linked List\n- Fetch N th element and overload `operator[]`\n- Implement Linear Search\n- Reverse the Linked List \n  - With new Node\n  - Stack Based\n  - Inplace with 3 pointers\n- Fetch N th element from last of Linked List\n- loop detection in singly Linked List\n  - Using set\n  - Flyod's Algorithm\n- Create Doubly LinkedList Template Class\n- Implement `push_front()`, `push_back()` and `push_at()`\n- Implement `pop_front()`, `pop_back()` and `pop_at()`\n\n## Tree\n- Implementing Binery Tree using Node Class\n- Recursive Traversal\n  - Inorder Traversal\n  - Preorder Traversal\n  - Postorder Traversal\n- Check if Two Trees Are Same\n- Convert to Mirror Tree\n- Check if Two Trees Are Mirror\n- Iterative Traversal\n  - Inorder Traversal\n  - Preorder Traversal\n  - Postorder Traversal\n- Dapth/Hight of The Tree\n  - Max Depth\n  - Min Depth\n- Flatten Binary Tree to Linked List\n\n## Algorithms\n- Recursion\n  - Print Number Series \n  - Sum of Numbers\n  - Factorial of number\n  - Digit Sum\n  - Fibonacci Series\n  - All Pattern Printing\n  \n## Dynamic Programming\n- 1D DP\n  - Fibonacci Series\n  - Frog Jump \n  - Min Cost Climbing Stairs\n- DP on String\n  - Longest Common Substring\n\n## Design Patterns\n- Singletan\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajsoni03%2Fdata-structure-in-cpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frajsoni03%2Fdata-structure-in-cpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajsoni03%2Fdata-structure-in-cpp/lists"}