Interview_question_for_beginner

๐Ÿ‘ฆ ๐Ÿ‘ง Technical-Interview guidelines written for those who started studying programming. I wish you all the best. ๐Ÿ‘พ
Alternatives To Interview_question_for_beginner
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
Algorithms22,512141a month ago5October 04, 2020200mitPython
Minimal examples of data structures and algorithms in Python
Interview_question_for_beginner16,246
a month ago23mit
:boy: :girl: Technical-Interview guidelines written for those who started studying programming. I wish you all the best. :space_invader:
Awesome Algorithms13,904
2 months ago
A curated list of awesome places to learn and/or practice algorithms.
Dsa.js Data Structures Algorithms Javascript7,009
15 months ago44November 30, 20216mitJavaScript
๐ŸฅžData Structures and Algorithms explained and implemented in JavaScript + eBook
Smile5,73612130a month ago30December 05, 202010otherJava
Statistical Machine Intelligence & Learning Engine
C Sharp Algorithms5,453
8 months ago1August 14, 202147mitC#
:books: :chart_with_upwards_trend: Plug-and-play class-library project of standard Data Structures and Algorithms in C#
Algodeck5,005
4 months agoother
An Open-Source Collection of 200+ Flash Cards to Help You Preparing Your Algorithms & Data Structures Interview ๐Ÿ’ฏ
Java Algorithms Implementation4,157
6 months ago78apache-2.0Java
Algorithms and Data Structures implemented in Java
Javascript Datastructures Algorithms4,112
2 months ago25TypeScript
:books: collection of JavaScript and TypeScript data structures and algorithms for education purposes. Source code bundle of JavaScript algorithms and data structures book
Algorithms.js3,2981152 years ago16May 04, 20168mitJavaScript
Atwood's Law applied to CS101 - Classic algorithms and data structures implemented in JavaScript
Alternatives To Interview_question_for_beginner
Select To Compare


Alternative Project Comparisons
Readme

Technical Interview Guidelines for Beginners

ํ•ด๋‹น Repository ์— ๊ธฐ์—ฌ๋ฅผ ํ•ด์ฃผ์‹  ๋ถ„๋“ค์ž…๋‹ˆ๋‹ค. ๊ฐ์‚ฌํ•ฉ๋‹ˆ๋‹ค. ๐Ÿ™

๐Ÿ“ Table of Contents

What is this?

์˜ˆ๋น„ ๊ฐœ๋ฐœ์ž๋“ค ๋˜๋Š” ๊ฐœ๋ฐœ์ž๋“ค์˜ ๊ธฐ์ˆ  ๋ฉด์ ‘ ์ค€๋น„๋ฅผ ์œ„ํ•œ ์ž๋ฃŒ๋ฅผ ์ •๋ฆฌํ•ด๋†“์€ ์ €์žฅ์†Œ์ž…๋‹ˆ๋‹ค. ๊ฐœ๋ฐœ์ด๋ผ๋Š” ๋ถ„์•ผ๋ฅผ ๋ชจ๋‘ ๋‹ด์ง€๋Š” ๋ชปํ–ˆ์Šต๋‹ˆ๋‹ค. ๊ทธ์ € ๊ฐ€์ด๋“œ๋ผ์ธ์œผ๋กœ ์ฐธ๊ณ ํ•ด์ฃผ์‹œ๋ฉด ๊ฐ์‚ฌํ•˜๊ฒ ์Šต๋‹ˆ๋‹ค. ๋˜ํ•œ ์ œ๊ฐ€ ๊ฐœ์ธ์ ์œผ๋กœ ๋ฉด์ ‘์„ ์ค€๋น„ํ•˜๋ฉด์„œ ์ •๋ฆฌํ•œ ๋‚ด์šฉ์ด๋ผ ์ž˜๋ชป๋œ ๋ถ€๋ถ„์ด ์žˆ์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. ์ด๋Ÿฐ ๋ถ€๋ถ„๋“ค์— ๋Œ€ํ•ด์„œ๋Š” Pull Request or Issue๋กœ ์ฐธ์—ฌํ•ด์ฃผ์‹œ๋ฉด ์ •๋ง ๊ฐ์‚ฌํ•˜๊ฒ ์Šต๋‹ˆ๋‹ค. ์ฃผ์ œ์™€ ๊ด€๋ จ๋œ ์ข‹์€ ์ฐธ๊ณ  ์ž๋ฃŒ๋ฅผ ์ถ”๊ฐ€ํ•˜๋Š” ๊ฒƒ๋„ ๊ฐ€๋Šฅํ•ฉ๋‹ˆ๋‹ค. ํ•ด๋‹น Repository ์—์„œ ํ•™์Šต์„ ํ•˜์‹œ๋‹ค๊ฐ€ ์ƒ๊ธฐ๋Š” ์งˆ๋ฌธ์€ Issue์— ์˜ฌ๋ ค์ฃผ์„ธ์š”!

์ทจ์ค€์ƒ ์—ฌ๋Ÿฌ๋ถ„์˜ ๊ฑด์Šน์„ ๊ธฐ์›ํ•ฉ๋‹ˆ๋‹ค ๐Ÿ‘

โœจ HELP

๐Ÿ™ HOW TO CONTRIBUTE
โญ๏ธ ์ด ์ €์žฅ์†Œ๋Š” PR ๊ณผ star ๋ฅผ ๋จน๊ณ  ์ž๋ž๋‹ˆ๋‹ค.

๋ฉด์ ‘์—์„œ ๋ฐ›์•˜๋˜ ์งˆ๋ฌธ๋“ค

ํ•ด๋‹น Issue ์—์„œ ์‹ค์ œ๋กœ ๋ฐ›์•˜๋˜ ๋ฉด์ ‘ ์งˆ๋ฌธ๋“ค์„ ๊ณต์œ ํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.


ํšŒ์‚ฌ์— ๊ถ๊ธˆํ•œ ์ ์ด ์žˆ์œผ์‹ ๊ฐ€์š”?

์ธํ„ฐ๋ทฐ๋ฅผ ๋งˆ์น˜๊ณ  ํ•œ๋ฒˆ์”ฉ์€ ๋ฐ˜๋“œ์‹œ ๋“ค์–ด๋ดค์„ ์งˆ๋ฌธ์ž…๋‹ˆ๋‹ค. ์ด ๋•Œ ์–ด๋– ํ•œ ์งˆ๋ฌธ์„ ํ•˜๋ฉด ์ข‹์„๊นŒ์š”? ์ ์ ˆํ•œ ์งˆ๋ฌธ๋“ค์„ ์ •๋ฆฌํ•ด๋‘” Reverse Interview ๋ชฉ๋ก์ž…๋‹ˆ๋‹ค.


Part 1. ์ „์‚ฐ ๊ธฐ์ดˆ

๐Ÿ’ก ๊ฐœ๋ฐœ์ƒ์‹ Link

  • ์ข‹์€ ์ฝ”๋“œ๋ž€ ๋ฌด์—‡์ธ๊ฐ€?
  • ๊ฐ์ฒด ์ง€ํ–ฅ ํ”„๋กœ๊ทธ๋ž˜๋ฐ์ด๋ž€ ๋ฌด์—‡์ธ๊ฐ€?
  • RESTFul API ๋ž€?
  • TDD ๋ž€ ๋ฌด์—‡์ด๋ฉฐ ์–ด๋– ํ•œ ์žฅ์ ์ด ์žˆ๋Š”๊ฐ€?
  • ํ•จ์ˆ˜ํ˜• ํ”„๋กœ๊ทธ๋ž˜๋ฐ์ด๋ž€?
  • MVC ํŒจํ„ด์ด๋ž€ ๋ฌด์—‡์ธ๊ฐ€?
  • Git ๊ณผ GitHub ์— ๋Œ€ํ•ด์„œ

๐Ÿ’ก ์ž๋ฃŒ๊ตฌ์กฐ Link

  • Array vs Linked List
  • Stack and Queue
  • Tree
    • Binary Tree
    • Full Binary Tree
    • Complete Binary Tree
    • BST (Binary Search Tree)
  • Binary Heap
  • Red-Black Tree
    • ์ •์˜
    • ํŠน์ง•
    • ์‚ฝ์ž…
    • ์‚ญ์ œ
  • Hash Table
    • Hash Function
    • Resolve Collision
      • Open Addressing
      • Separate Chaining
    • Resize
  • Graph
    • Graph ์šฉ์–ด ์ •๋ฆฌ
    • Graph ๊ตฌํ˜„
    • Graph ํƒ์ƒ‰
    • Minimum Spanning Tree
      • Kruskal algorithm
      • Prim algorithm

๐Ÿ’ก ๋„คํŠธ์›Œํฌ Link

  • GET, POST ๋ฐฉ์‹์˜ ์ฐจ์ด์ 
  • TCP 3-way-handshake
  • TCP ์™€ UDP ์˜ ์ฐจ์ด์ 
  • HTTP ์™€ HTTPS ์˜ ์ฐจ์ด์ 
    • HTTP ์˜ ๋ฌธ์ œ์ ๋“ค
  • DNS round robin ๋ฐฉ์‹
  • ์›น ํ†ต์‹ ์˜ ํฐ ํ๋ฆ„

๐Ÿ’ก ์šด์˜์ฒด์ œ Link

  • ํ”„๋กœ์„ธ์Šค์™€ ์Šค๋ ˆ๋“œ์˜ ์ฐจ์ด
  • ์Šค์ผ€์ค„๋Ÿฌ์˜ ์ข…๋ฅ˜
    • ์žฅ๊ธฐ ์Šค์ผ€์ค„๋Ÿฌ
    • ๋‹จ๊ธฐ ์Šค์ผ€์ค„๋Ÿฌ
    • ์ค‘๊ธฐ ์Šค์ผ€์ค„๋Ÿฌ
  • CPU ์Šค์ผ€์ค„๋Ÿฌ
    • FCFS
    • SJF
    • SRT
    • Priority scheduling
    • RR
  • ๋™๊ธฐ์™€ ๋น„๋™๊ธฐ์˜ ์ฐจ์ด
  • ๋ฉ€ํ‹ฐ์Šค๋ ˆ๋“œ
    • ์žฅ์ ๊ณผ ๋‹จ์ 
  • ํ”„๋กœ์„ธ์Šค ๋™๊ธฐํ™”
    • Critical Section
    • ํ•ด๊ฒฐ์ฑ…
  • ๋ฉ”๋ชจ๋ฆฌ ๊ด€๋ฆฌ ์ „๋žต
    • ๋ฉ”๋ชจ๋ฆฌ ๊ด€๋ฆฌ ๋ฐฐ๊ฒฝ
    • Paging
    • Segmentation
  • ๊ฐ€์ƒ ๋ฉ”๋ชจ๋ฆฌ
    • ๋ฐฐ๊ฒฝ
    • ๊ฐ€์ƒ ๋ฉ”๋ชจ๋ฆฌ๊ฐ€ ํ•˜๋Š” ์ผ
    • Demand Paging (์š”๊ตฌ ํŽ˜์ด์ง•)
    • ํŽ˜์ด์ง€ ๊ต์ฒด ์•Œ๊ณ ๋ฆฌ์ฆ˜
  • ์บ์‹œ์˜ ์ง€์—ญ์„ฑ
    • Locality
    • Caching line

๐Ÿ’ก ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค Link

  • ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค
    • ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค๋ฅผ ์‚ฌ์šฉํ•˜๋Š” ์ด์œ 
    • ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค ์„ฑ๋Šฅ
  • Index
    • Index ๋ž€ ๋ฌด์—‡์ธ๊ฐ€
    • Index ์˜ ์ž๋ฃŒ๊ตฌ์กฐ
    • Primary index vs Secondary index
    • Composite index
    • Index ์˜ ์„ฑ๋Šฅ๊ณผ ๊ณ ๋ คํ•ด์•ผํ•  ์‚ฌํ•ญ
  • ์ •๊ทœํ™”์— ๋Œ€ํ•ด์„œ
    • ์ •๊ทœํ™” ํƒ„์ƒ ๋ฐฐ๊ฒฝ
    • ์ •๊ทœํ™”๋ž€ ๋ฌด์—‡์ธ๊ฐ€
    • ์ •๊ทœํ™”์˜ ์ข…๋ฅ˜
    • ์ •๊ทœํ™”์˜ ์žฅ๋‹จ์ 
  • Transaction
    • ํŠธ๋žœ์žญ์…˜(Transaction)์ด๋ž€ ๋ฌด์—‡์ธ๊ฐ€?
    • ํŠธ๋žœ์žญ์…˜๊ณผ Lock
    • ํŠธ๋žœ์žญ์…˜์˜ ํŠน์„ฑ
    • ํŠธ๋žœ์žญ์…˜์˜ ์ƒํƒœ
    • ํŠธ๋žœ์žญ์…˜์„ ์‚ฌ์šฉํ•  ๋•Œ ์ฃผ์˜ํ•  ์ 
  • Statement vs PreparedStatement
  • NoSQL
    • ์ •์˜
    • CAP ์ด๋ก 
      • ์ผ๊ด€์„ฑ
      • ๊ฐ€์šฉ์„ฑ
      • ๋„คํŠธ์›Œํฌ ๋ถ„ํ•  ํ—ˆ์šฉ์„ฑ
    • ์ €์žฅ๋ฐฉ์‹์— ๋”ฐ๋ฅธ ๋ถ„๋ฅ˜
      • Key-Value Model
      • Document Model
      • Column Model

์ถ”๊ฐ€์ž๋ฃŒ

๐Ÿ’ก Design Pattern Link

  • Singleton

๐Ÿ’ก Algorithm (์•Œ๊ณ ๋ฆฌ์ฆ˜) Link

  • ์†์ฝ”๋”ฉ ๋ฐ ์ฝ”๋”ฉ ํ…Œ์ŠคํŠธ ๋Œ€๋น„ => ๋Œ€๋ถ€๋ถ„์˜ ๋‚ด์šฉ์ด ์ฝ”๋“œ์ด๊ธฐ ๋•Œ๋ฌธ์— ๋ณ„๋„์˜ Java Algorithm Training Repository์— ์ €์žฅํ•ฉ๋‹ˆ๋‹ค.
  • ์ฝ”๋”ฉ ํ…Œ์ŠคํŠธ๋ฅผ ์œ„ํ•œ Tip
  • ๋ฌธ์ œ ํ•ด๊ฒฐ์„ ์œ„ํ•œ ์ „๋žต์  ์ ‘๊ทผ
  • Sorting Algorithm
  • Prime Number Algorithm

(๋ชฉ์ฐจ๋กœ ๋Œ์•„๊ฐ€๊ธฐ)


Part 2. Language

๐Ÿ’Ž Java Link

  • JVM ์— ๋Œ€ํ•ด์„œ / GC ์˜ ์›๋ฆฌ
  • Collection
  • Annotation
  • Generic
  • final
  • Overriding vs Overloading
  • Access Modifier
  • Wrapper class
  • Multi-Thread ํ™˜๊ฒฝ์—์„œ์˜ ๊ฐœ๋ฐœ

์ถ”๊ฐ€ ์ž๋ฃŒ

๐Ÿ’Ž JavaScript Link

  • JavaScript Event Loop
  • Hoisting
  • Closure
  • this ์— ๋Œ€ํ•ด์„œ
  • Promise

์ถ”๊ฐ€ ์ž๋ฃŒ

๐Ÿ’Ž Python Link

  • Generator
  • ํด๋ž˜์Šค๋ฅผ ์ƒ์†ํ–ˆ์„ ๋•Œ ๋ฉ”์„œ๋“œ ์‹คํ–‰ ๋ฐฉ์‹
  • GIL ๊ณผ ๊ทธ๋กœ์ธํ•œ ์„ฑ๋Šฅ ๋ฌธ์ œ
  • GC ์ž‘๋™ ๋ฐฉ์‹
  • Celery
  • PyPy ๊ฐ€ CPython ๋ณด๋‹ค ๋น ๋ฅธ ์ด์œ 
  • ๋ฉ”๋ชจ๋ฆฌ ๋ˆ„์ˆ˜๊ฐ€ ๋ฐœ์ƒํ•  ์ˆ˜ ์žˆ๋Š” ๊ฒฝ์šฐ
  • Duck Typing
  • Timsort : Python์˜ ๋‚ด๋ถ€ sort

์ถ”๊ฐ€ ์ž๋ฃŒ

(๋ชฉ์ฐจ๋กœ ๋Œ์•„๊ฐ€๊ธฐ)


Part 3. ๋ถ„์•ผ๋ณ„

๐Ÿ”ถ Front-End Link

  • ๋ธŒ๋ผ์šฐ์ €์˜ ์ž‘๋™ ์›๋ฆฌ
  • Document Object Model
    • Event Bubbling and Capturing
    • Event delegation
  • CORS
  • ํฌ๋กœ์Šค ๋ธŒ๋ผ์šฐ์ง•
  • ์›น ์„ฑ๋Šฅ๊ณผ ๊ด€๋ จ๋œ Issues
  • ์„œ๋ฒ„ ์‚ฌ์ด๋“œ ๋ Œ๋”๋ง vs ํด๋ผ์ด์–ธํŠธ ์‚ฌ์ด๋“œ ๋ Œ๋”๋ง
  • CSS Methodology
  • normalize.css vs reset.css
  • ๊ทธ ์™ธ ํ”„๋ก ํŠธ์—”๋“œ ๊ฐœ๋ฐœ ํ™˜๊ฒฝ ๊ด€๋ จ

์ถ”๊ฐ€ ์ž๋ฃŒ

๐Ÿ”ถ iOS Link

  • App Life Cycle
  • View Life Cycle
  • Delegate vs Block vs Notification
  • Memory Management
  • assign vs weak
  • Frame vs Bounds
  • ๊ธฐํƒ€ ์งˆ๋ฌธ

์ถ”๊ฐ€ ์ž๋ฃŒ

๐Ÿ”ถ Machine Learning Link

  • Cost Function

์ถ”๊ฐ€ ์ž๋ฃŒ

(๋ชฉ์ฐจ๋กœ ๋Œ์•„๊ฐ€๊ธฐ)


๊ทธ ์™ธ ์ข‹์€ ์ž๋ฃŒ


License

MIT

Popular Algorithms Projects
Popular Graph Projects
Popular Computer Science Categories
Related Searches

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Javascript
Algorithms
Graph
Awesome
Interview