Skip to content

akgmage/data-structures-and-algorithms

View on GitHub ↗Related repositories →

Learn Basic to Advanced Data Structures and Algorithms in your Favorite language (Go, Python, Javascript, C++, Java) [Contributions are welcome!]

active 2023-08-152026-01-11 (UTC)

Complete coverage26,529 / 26,529 hourly files (100%) · 2 absent upstream2023-08-152026-08-24 (UTC)
Events
781
Pushes
200
Pull requests
228
Issues
204
Stars
68
Forks
25

Activity over time

Daily event counts in the loaded window

Line chart, 881 days from 2023-08-15 to 2026-01-11. Pushes: 200 total, peak 8 in a day. Pull requests: 228 total, peak 8 in a day. Issues: 204 total, peak 172 in a day. Comments: 23 total, peak 8 in a day. Stars: 68 total, peak 3 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
akgmage6392001986
Abhinavcode13300271
Geeks-Arpan7016
avrachnou6006
JimNtantakas2002
anandv071001
p1kalys1010
Evangelos-Dimos1010
LogicalGagan1001

Recent activity

Latest issues, pull requests and releases

  • Issue comment#1789LogicalGagan2024-10-26 17:41
    Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level) in C++
  • Pull request#1796akgmage2024-01-14 17:34
  • Pull request#1796akgmage2024-01-14 17:34
  • Issue comment#1741akgmage2024-01-14 04:50
    Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a pah from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Python
  • Issue comment#1728akgmage2024-01-11 02:08
    Heap: Given an integer array nums and an integer k, return the k most frequent elements in Python
  • Issue comment#1728JimNtantakas2024-01-10 21:56
    Heap: Given an integer array nums and an integer k, return the k most frequent elements in Python
  • Issue comment#1741JimNtantakas2024-01-10 21:11
    Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a pah from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Python
  • Pull request#1795akgmage2023-11-25 17:32
  • Pull request#1795akgmage2023-11-25 17:32
  • Pull request#1794akgmage2023-11-24 18:18
  • Pull request#1794akgmage2023-11-24 18:18
  • Pull request#1793akgmage2023-11-22 18:14
  • Pull request#1793akgmage2023-11-22 18:14
  • Pull request#1792akgmage2023-11-21 18:19
  • Pull request#1792akgmage2023-11-21 18:19
  • Pull request#1791akgmage2023-11-20 17:41
  • Pull request#1791akgmage2023-11-20 17:41
  • Pull request#1790akgmage2023-11-19 18:03
  • Pull request#1790akgmage2023-11-19 18:03
  • Issue#1789akgmage2023-11-18 16:18
    Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level) in C++
  • Issue#1788akgmage2023-11-18 16:18
    Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level) in Go
  • Pull request#1787akgmage2023-11-17 12:31
  • Pull request#1786akgmage2023-11-16 17:19
  • Pull request#1786akgmage2023-11-16 17:19
  • Pull request#1785akgmage2023-11-15 17:36

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