{"id":22499660,"url":"https://github.com/arindam2003/cpp_dsa","last_synced_at":"2026-05-17T00:41:04.893Z","repository":{"id":259284567,"uuid":"876914417","full_name":"Arindam2003/CPP_DSA","owner":"Arindam2003","description":"This Repo Contains Data Structures and Algorithm in C++ in organize manner. It have all Problem from Basic to Advanced and Compititie Program","archived":false,"fork":false,"pushed_at":"2025-01-14T13:55:34.000Z","size":161,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-09T02:39:58.431Z","etag":null,"topics":["cpp","data-structures","data-structures-and-algorithms","dsa","dsa-algorithm","dsa-cpp"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Arindam2003.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2024-10-22T19:03:42.000Z","updated_at":"2025-01-14T13:55:38.000Z","dependencies_parsed_at":"2024-11-12T15:18:05.845Z","dependency_job_id":"658259c4-c449-4550-8dbf-e11449597248","html_url":"https://github.com/Arindam2003/CPP_DSA","commit_stats":null,"previous_names":["arindam2003/cpp_dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Arindam2003/CPP_DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Arindam2003%2FCPP_DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Arindam2003%2FCPP_DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Arindam2003%2FCPP_DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Arindam2003%2FCPP_DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Arindam2003","download_url":"https://codeload.github.com/Arindam2003/CPP_DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Arindam2003%2FCPP_DSA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274718974,"owners_count":25337236,"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","status":"online","status_checked_at":"2025-09-11T02:00:13.660Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["cpp","data-structures","data-structures-and-algorithms","dsa","dsa-algorithm","dsa-cpp"],"created_at":"2024-12-06T22:14:49.897Z","updated_at":"2026-05-17T00:40:59.856Z","avatar_url":"https://github.com/Arindam2003.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# C Programs\nContain C Programs...\n\n\u003cdetails\u003e\n    \u003csummary\u003eC Programs\u003c/summary\u003e\n\n- [All Programs](./C_Program/)\n\n\u003c/details\u003e\n\n\u003c/br\u003e\n\n\n# C++\nContain C+++ Programs...\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉Basics_C++\u003c/summary\u003e\n\n- [1. Hello World with NewLine](./Basics_cpp/print_hello.cpp)\n- [2. Sum of Two Number](./Basics_cpp/sum_two.cpp)\n- [3. Area of Circle](./Basics_cpp/area_circle.cpp)\n- [4. Volume of Cuboid](./Basics_cpp/volume_cuboid.cpp)\n- [5. Average of three Number](./Basics_cpp/avg_three.cpp)\n- [6. Square of Number](./Basics_cpp/square_number.cpp)\n- [7. Swap without using third variable](./Basics_cpp/swap_without_3rd.cpp)\n- [8. Maximum of two Number](./Basics_cpp/max_two_number.cpp)\n- [9. Sum of 10 Numbers in an array](./Basics_cpp/add_array_of_10.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉Functions in C++\u003c/summary\u003e\n\n- [1. Prime Number in Range](./Function_Cpp/print_prime_range.cpp)\n- [2. Highest value digit in Number](./Function_Cpp/highest_digit_number.cpp)\n- [3. X raised to the power Y](./Function_Cpp/x_tothepower_y.cpp)\n- [4. Pascal Triangle](./Function_Cpp/pascal_triangle.cpp)\n- [5. Find number in Fibo Series](./Function_Cpp/find_fibo.cpp)\n- [6. Add 2 or 3 Number using Default Argument](./Function_Cpp/add_2_3_default.cpp)\n- [7. Area of Circle,Rec,Tri](./Function_Cpp/area_cir_rec_tri_overloading.cpp)\n- [8. Diffrent Argument Passing](./Function_Cpp/diffrent_arg.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉Classes and Objects in C++\u003c/summary\u003e\n\n- [1. Complex Number Class and Object with Add,Subs](./Classes_Object/complex_number.cpp)\n- [2. Time Class and Object](./Classes_Object/time.cpp)\n- [3. Date get and set Object](./Classes_Object/date.cpp)\n- [4. Circle get set and return Object](./Classes_Object/circle.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉🏻Member Function C++\u003c/summary\u003e\n\n- [1. Complex Number Add](./Member_Function/Complex_Number.cpp)\n- [2. Time Normalize and Greater](./Member_Function/Time.cpp)\n- [3. Test Result](./Member_Function/TestResult.cpp)\n\u003c/details\u003e\n\n\u003c!-- \u003cdetails\u003e\n    \u003csummary\u003e👉🏻Constructor in C++\u003c/summary\u003e\n\n\n\u003c/details\u003e --\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉🏻Operator Overloading\u003c/summary\u003e\n    \n- [1. Basic Operator Overloading](./Operator_Overloading/basic_operator.cpp)\n- [2. Time OverLoading](./Operator_Overloading/time_overload.cpp)\n- [3. Matrix Operation Oveloading](./Operator_Overloading/matrix_overload.cpp)\n- [4. Fraction Operation Overload](./Operator_Overloading/fraction.cpp)\n- [5. Distance Add,pre,Post Decrement Overloadig](./Operator_Overloading/distance.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e👉🏻Friend Function\u003c/summary\u003e\n    \n- [1. Friend Function Example](./Friend-fun_Operator/friend.cpp)\n- [2. Complex Number using friend](./Friend-fun_Operator/Complex.cpp)\n- [3. Time input output](./Friend-fun_Operator/time_inp_out.cpp)\n- [4.  Array Deep Copy, Concatinate](./Friend-fun_Operator/overloading_array.cpp)\n- [5. Integer Number](./Friend-fun_Operator/integer.cpp)\n- [6. Coordinate Value Assign](./Friend-fun_Operator/coordinate.cpp)\n- [7. Student checking](./Friend-fun_Operator/student.cpp)\n\n\u003c/details\u003e\n\n\n\u003c/br\u003e\n\n# Data-Structures Using c++\nCollection of Data Structure Implement in C++...\n\n\u003cdetails\u003e\n    \u003csummary\u003e✅Array Data Structure in C++\u003c/summary\u003e\n\n- [1. Modified Array--\u003einsert,delete,append,edit,count,get_element,deallocate,find_element](./Array_Data_Structure/modified_array.cpp)\n- [2. On Modified Array--\u003eCopy Constructor and Copy Assignment Operator](./Array_Data_Structure/copy_const_modified.cpp)\n- [3. Dynamic Array With Double and Half Array Concept](./Array_Data_Structure/Dynamic_Array.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e✅Linked List\u003c/summary\u003e\n\n- [1. Singly Linked List All](./Linked_List_Data_Structure/singly_linked_list.cpp)\n- [2. Doubly Linked List All](./Linked_List_Data_Structure/doubly_linked_list.cpp)\n- [3. Circular Linked List With Start Pointer](./Linked_List_Data_Structure/circular_linked_list.cpp)\n\n\n- [5. Doubly Circular Linked List](./Linked_List_Data_Structure/Circular_Doubly_LL.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e✅Stack\u003c/summary\u003e\n\n- [1. Stack Using Array](./Stack_Data_Structure/stack_using_array.cpp)\n- [2. Stack Using Linked List](./Stack_Data_Structure/stack_using_linked_list.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e✅Queue\u003c/summary\u003e\n\n- [1. Queue Using Array](./Queue_Data_Structure/queue_using_array.cpp)\n- [2. Queue_using_array_best](./Queue_Data_Structure/Queue_array_best.cpp)\n\n\u003c/details\u003e\n\n\u003cdetails\u003e\n    \u003csummary\u003e✅Tree\u003c/summary\u003e\n\n- [1. Binary Search Tree](./Tree_/binary_search_tree.cpp)\n\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\n\u003cdetails\u003e\n\u003c/details\u003e\n\n\u003cbr\u003e\n\n# Final-450-Question\nTo Solve Real World Problem It's Needed...\n\n\u003cdetails\u003e\n    \u003csummary\u003e⭐️Array\u003c/summary\u003e\n\n- [1. Revese an Array](./Final_450/Reverse_array_string.c)\n- [2. Max and Min in Array Return](./Final_450/Max_and_Min_array.cpp)\n- [3. Rotate by One](./Final_450/Rotate_by_one.cpp)\n- [4. Find the Duplicate Number](./Final_450/Find_Duplicate.cpp)\n- [5. Merge Intervals](./Final_450/Merge_intervals.cpp)\n\n\n\u003c/details\u003e\n\u003c/br\u003e\n\n\n\n# LeetCode\nTo Solve Real World Problem,It's Needed...\n\n\u003cdetails\u003e\n    \u003csummary\u003e⭐️POTD\u003c/summary\u003e\n\n- [1. Count Suffix and Prefix](./LeetCode/count_prefix_suffiex.cpp)\n- [2. Count Words with a  Given Prefix](./LeetCode/counting_words_given_prefix.cpp)\n\n\u003c/details\u003e\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farindam2003%2Fcpp_dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farindam2003%2Fcpp_dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farindam2003%2Fcpp_dsa/lists"}