Skip to content
View yasinkuyuk's full-sized avatar
14 followers · 14 following
  • mediaQX
  • Istanbul

Achievements

Achievement: Pair Extraordinairex2Achievement: Pull Sharkx3Achievement: QuickdrawAchievement: YOLO
BetaSend feedback

Achievements

Achievement: Pair Extraordinairex2Achievement: Pull Sharkx3Achievement: QuickdrawAchievement: YOLO
BetaSend feedback
Block or Report

Block or report yasinkuyuk

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
yasinkuyuk/README.md

Senior Software Engineer @mediaQX

Tech Stack
  • Vue & React
  • Node.js & Flask & Django
  • AWS EB / S3 / Code Pipeline / Code Build & Docker
  • MongoDB & MySQL

@yk7

Pinned

  1. turkey-dhondt-calculator turkey-dhondt-calculator Public

    Vue 2

  2. armut-case-vue armut-case-vue Public

    armut like job creation process

    Vue

  3. quicksort-algorithm quicksort-algorithm Public

    C++

  4. mst-algorithms mst-algorithms Public

    In this prohject the C++ algorithm will find the minimum spanning tree in the given city plan.

    C++ 1

  5. greedy-algorithms greedy-algorithms Public

    * q1 part includes modifies dijktra's algorithm to find the path which has the maximum capacity a.k.a. maximum bottleneck path.

    C++

  6. smith-waterman-algorithm smith-waterman-algorithm Public

    Perl