https://github.com/ragibasif/data-structures-and-algorithms

My DSA repository
https://github.com/ragibasif/data-structures-and-algorithms

algo algorithms c competitive-programming computer-science cpp data-structures data-structures-and-algorithms haskell math mathematics python

Last synced: 6 days ago
JSON representation

My DSA repository

• Host: GitHub
• URL: https://github.com/ragibasif/data-structures-and-algorithms
• Owner: ragibasif
• License: mit
• Created: 2024-10-16T14:10:02.000Z (4 months ago)
• Default Branch: master
• Last Pushed: 2024-11-29T03:50:50.000Z (2 months ago)
• Last Synced: 2024-11-29T04:27:44.678Z (2 months ago)
• Topics: algo, algorithms, c, competitive-programming, computer-science, cpp, data-structures, data-structures-and-algorithms, haskell, math, mathematics, python
• Language: C++
• Homepage:
• Size: 90.3 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Data Structures and Algorithms

[Neetcode.io](https://neetcode.io/practice)

[Junior Training Sheet - Competitive Programming](https://docs.google.com/spreadsheets/d/1iJZWP2nS_OB3kCTjq8L6TrJJ4o-5lhxDOyTaocSYc-k/edit?gid=84654839#gid=84654839)

[My Competitive Programming Training Sheet](https://docs.google.com/spreadsheets/d/1QXDzX45hHSb82_gBo1FXZaYpA0x4D3IrWZZrJrqewno/edit?usp=sharing)

[Advent of Code](https://adventofcode.com/)

---

**Codeforces C++ template**

```cpp

#include 

using namespace std;

int main(int argc, char* argv[]) {

    // Fast I/O

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

}

    // Example of handling command-line arguments

    if (argc > 1) {

        cout << "Command-line arguments provided:\n";

        for (int i = 0; i < argc; ++i) {

            cout << "argv[" << i << "] = " << argv[i] << "\n";

        }

    } else {

        cout << "No command-line arguments provided.\n";

    }

    // Example problem-solving logic (replace with actual code)

    int t; // Number of test cases

    cin >> t;

    while (t--) {

        int n;

        cin >> n;

        vi arr(n);

        FOR(i, 0, n) cin >> arr[i];

        sort(all(arr));

        EACH(x, arr) cout << x << " ";

        cout << "\n";

    }

    return 0;

}

```