Skip to content
View yataknemogy's full-sized avatar
πŸ‡²πŸ‡±
γ‚½γƒ•γƒˆγ‚¦γ‚§γ‚’γ‚¨γƒ³γ‚Έγƒ‹γ‚’
πŸ‡²πŸ‡±
γ‚½γƒ•γƒˆγ‚¦γ‚§γ‚’γ‚¨γƒ³γ‚Έγƒ‹γ‚’

Highlights

  • Pro

Block or report yataknemogy

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.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, 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
yataknemogy/README.md

πŸ’» Stack

πŸ“Š GitHub Stats

GitHub Stats Top Languages

Pinned Loading

  1. DistributeX DistributeX Public

    DistributeX is a distributed computing platform designed for efficient task management and dynamic load balancing across multiple execution nodes. This system leverages microservices architecture t…

    Go 1

  2. BlogWebApplication BlogWebApplication Public archive

    This name clearly indicates that the repository is a blog application built using Spring Boot, making it easy for users to understand the purpose of the project.

    Java 3

  3. JavaAlgorithms JavaAlgorithms Public

    Implementations of various sorting and searching algorithms in Java, including classic sorting algorithms (bubble, selection, quick, merge) and search methods (linear, binary).

    Java 3

  4. JavaMathFunctionCalculator JavaMathFunctionCalculator Public

    Java application for calculating a specific mathematical function using trigonometric and logarithmic calculations.

    Java 1

  5. lake-islands-detector lake-islands-detector Public

    An algorithm to count the number of distinct islands on a lake map using BFS. Each island is a group of connected land cells ('L') surrounded by water ('W').

    Java 1

  6. treasureMazeSolver treasureMazeSolver Public

    An algorithm to solve the "Treasure Maze" problem. Navigate a maze, collect all treasures, and reach the exit with the minimum number of steps.

    Java 1