Skip to content
View Misoding's full-sized avatar
🏠
Working from home
🏠
Working from home

Highlights

  • Pro

Block or report Misoding

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. LeetCode-Journey LeetCode-Journey Public

    Formal implementations and complexity analysis of algorithmic problems. Focus on asymptotic behavior, recurrence relations, and correctness proofs.

    C++

  2. Java-Chess-Desktop-Application-with-Observer-Pattern Java-Chess-Desktop-Application-with-Observer-Pattern Public

    Monolithic Java chess engine with Swing GUI implementing Observer and Strategy patterns. Features complete chess rules, user authentication, JSON persistence, and move history tracking. Educational…

    Java

  3. Asm-algorithms Asm-algorithms Public

    Low-level programming showcase: data structures, algorithms, and optimization techniques implemented in Assembly with production-quality testing

    C

  4. Browser-Simulation Browser-Simulation Public

    A minimal C-based browser simulator demonstrating tab management via a circular doubly‑linked list and stack‑based backward/forward navigation. Built for learning data structures, it supports openi…

    C

  5. Satellites_Huffman Satellites_Huffman Public

    Efficiently build and explore Huffman-like trees from satellite data! This C project uses heaps and binary trees to encode, decode, and analyze data structures—perfect for learning or experimenting…

    C

  6. 0-1-Knapsack-Algorithmic-Analysis 0-1-Knapsack-Algorithmic-Analysis Public

    Comparative analysis of three algorithmic paradigms (Backtracking, Dynamic Programming, Greedy) for solving the 0/1 Knapsack Problem. Includes NP-hardness proof, empirical benchmarking on Pisinger'…

    Java