Skip to content

Nickolas161202/Complexity-algorithms

View on GitHub ↗Related repositories →

this repo was created to store all the cvodes that I developed through my classes of complexity Algorithms. Here, you will find some leetcode problems involving dynamic programming, divide and conquer and greedy algorithms.

active 2025-06-132025-07-01 (UTC)

Complete coverage26,586 / 26,586 hourly files (100%) · 2 absent upstream2023-08-152026-08-26 (UTC)
Events
12
Pushes
11
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 19 days from 2025-06-13 to 2025-07-01. Pushes: 11 total, peak 6 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
Nickolas161202111100

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.