gyoogle/tech-interview-for-developer

★ 17,336JavaAudience · developerComplexity · 1/5Setup · easy

Mindmap

mindmap
  root((Tech Interview Guide))
    Computer Science
      Computer Architecture
      Data Structures
      Algorithms
    Database
      SQL joins and injection
      Normalization and indexes
      Transactions and Redis
    Network
      OSI 7 layers
      TCP handshakes
      Flow and congestion control
    Audience
      Korean CS students
      New graduate developers

mindmap root((Tech Interview Guide)) Computer Science Computer Architecture Data Structures Algorithms Database SQL joins and injection Normalization and indexes Transactions and Redis Network OSI 7 layers TCP handshakes Flow and congestion control Audience Korean CS students New graduate developers

Click or tap to explore — scroll the page freely

Things people build with this

USE CASE 1

Study CS fundamentals like trees, heaps, B-trees, and hash tables before a Korean developer technical interview.

USE CASE 2

Review database concepts such as SQL joins, normalization, transactions, and Redis in a single organized reference.

USE CASE 3

Use the topic table of contents as a personal checklist to identify knowledge gaps in network protocols and computer architecture.

Getting it running

Difficulty · easy Time to first run · 5min

License not specified in the explanation.

In plain English

This is a Korean-language tech interview study guide for entry-level developers, essentially a curated encyclopedia of the computer science topics that come up in junior-developer technical interviews. The README describes itself as a major-subject and technical-interview encyclopedia for new developers, and it has been growing as a community-edited reference since March 2019. The way it works is that the repository is organized as a table of contents pointing to one Markdown file per topic. Computer Science is split into sections such as Computer Architecture (with notes on CPU, cache memory, fixed and floating point, parity bits, ARM processors), Data Structure (Array, LinkedList, Stack, Queue, Heap, Tree, Binary Search Tree, Hash, Trie, B-Tree and B+Tree), Database (SQL joins, SQL injection, SQL vs NoSQL, normalization, indexes, transactions and isolation levels, stored procedures, Redis), and Network (OSI 7 layers, TCP three-way and four-way handshakes, flow and congestion control). Each entry is a self-contained explainer rather than runnable code, a companion website at gyoogle.dev offers easier browsing. Someone would use this if they are a Korean-speaking software engineering student or new graduate preparing for technical interviews in Korea and want a single organized reference for the standard CS curriculum questions, or if they want a topic checklist to test their own knowledge. It is a study resource, not a software library, so although the repository is tagged as Java, you do not run it, you read it. Contributions arrive through issues and pull requests, with 58 contributors credited so far. The full README is longer than what was provided.

Copy-paste prompts

Prompt 1

Explain the difference between B-Tree and B+Tree as covered in the tech-interview-for-developer guide, and give me an interview-ready answer for when to use each.

Prompt 2

Summarize the database transaction isolation levels from the tech-interview-for-developer study guide with concrete examples of what each level allows and prevents.

Prompt 3

Walk me through the TCP three-way handshake and four-way termination handshake as explained in the tech-interview-for-developer network section.

Prompt 4

What does the tech-interview-for-developer guide say about SQL injection, and how would I concisely answer that question in a technical interview?

Prompt 5

I'm preparing for a Korean tech interview. Using the tech-interview-for-developer structure, quiz me on the OSI 7 layers and what protocol operates at each layer.

Open on GitHub → Explain another repo

← gyoogle on gitmyhub — every repo by this author, as a profile.

Verify against the repo before relying on details.