๐Ÿ“ƒ
Algorithms;Problem Solving Skills
  • 6 steps problem solving skills
  • SW ๋ฌธ์ œ๋ฅผ ์™„๋ฒฝํ•˜๊ฒŒ ํ’€๊ธฐ ์œ„ํ•œ 5๋‹จ๊ณ„
  • ์ดํด๋ฆฝ์Šค ๋‹จ์ถ•ํ‚ค
  • Algorithm Problems
    • Approach
    • MeetingRoom
    • MoveZeros
    • MeetingRoom2
    • TwoSum
    • Daily Temperature
    • Merge Interval
    • Jewels and Stones
    • License Key Formatting
    • K Closest Points to Origin
    • Maximum Subarray
    • Find Anagrams Mapping
    • Find All Anagrams
    • Spiral Matrix
    • Group Anagrams
    • TrappingRainWater
    • Kth Largest Element in an Array
    • Find Missing Range
    • Plus One
    • Unique Email Address
    • Longest Substring With At Most Two Distinct
  • Linked List
    • Add Two Numbers
    • Merge K Sorted Lists
    • Reverse LinkedList
  • STACK & QUEUE
    • Baseball Game
    • Valid Parentheses
    • Binary Tree Level Order Traversal
  • GRAPH(DFS, BFS)
    • Number Of Island by DFS
    • Number Of Island by BFS
    • Maximum Depth of Binary Tree
    • Maximum Depth of Binary Tree_DFS
    • Maximum Depth of Binary Tree_BFS
    • Max Area of Island
    • Word Ladder
    • Word Search
    • Remove Invalid Parentheses
    • Continue
    • Maze_BFS
    • Maze_DFS
    • Topological Sort_Course Schedudle
  • Dynamic Programming
    • Make 1
    • Tiling 2xn
    • Purchase Card
    • Unique Paths
    • Coin Change
    • Climbing Stairs
    • Max Contiguous Subarray Sum
    • Square Sum
    • Sum Decomposition
    • Sum Decomposition-Advanced Solution
    • Climbing Number
    • Sticker
    • Integer Triangle
    • Longest Decreasing Subarray
    • Longest Bitonic Subarray
    • Buy a Card
    • Sampling Wine
    • Tiling(3n)
    • RGB Street
    • ์„ฑ๋ƒฅ ๊ฐœ๋น„
  • Basic Addition
    • A+B #6
  • Data Structures
    • Reverse Sentence word by word
  • Brute Force
    • Calculate Date(by Modular)
    • Remote Control
    • Seven Dwarfs
    • Tetromino
    • Cain Calendar
    • N M1
    • N M2(by Choice)
    • N M3
    • N M4(by Order)
    • N M 5
    • N M9
    • N M9 2๋ฒˆ์งธ ์‹œ๋„, ๋ฌธ์ œ ๋ณต๊ธฐ
    • N M 10
    • N M Series Summary
    • Next Permutation
    • All Permutation
    • BRUTE FORCE - RECURSION
    • BF - Using Array&Recursion Tip
    • Ciphertext
    • Ciphertext
    • Resign
    • One Two Three plus - Recursive Solution
    • One Two Three plus - Review
    • A Sign of Inequality
    • A Sign of Inequality - Back Tracking
    • Start Link - Review
    • Traveling Salesperson Probelm
  • bit masking
    • Set
    • Subset Sum
    • StartLink - BitMasking, BackTracking
    • Paper Piece
  • graph
    • DFS and BFS
    • Connected Component
    • Numbering Group
    • Number of Island
    • Maze Search - Minimum Distance
    • Tomato
    • Night Move
    • Hide and Seek
    • Two Dots
    • Subway Line#2
    • (Challenge)BFS Special Judge
    • (Challenge)Make a Bridge
    • Hide and Seek4
    • Hide and Seek4 2ํšŒ์ฐจ
    • Bipartite Graph
    • BipartiteGraph_DFS
  • BFS(Getting Minimum Value)
    • Emoji
    • BFS&Deque - Algospot, Hide_Seek3
    • MonkeyWannabeHorse
    • Treasure Island
    • StartLink
    • Iceberg
    • MoveCrashingWall
    • MoveCrashingWall_answer2
    • MoveCrashingWall - map[nx][ny]๊ฐ’ ๊ธฐ์ค€ vs ๋ฒฝ๋ถ€์ˆœํšŸ์ˆ˜(0or1)๊ธฐ์ค€
    • MoveCrashingWall2
    • FIRE
    • BabyShark
    • Lab3
  • implementation
    • (Graph)Wedding
    • Conveyer Belt Robot
    • Push Operator
    • Truck
    • GearWheel
  • string
    • IBM Minus 1
  • ๋ณต๊ธฐ of ๋ณต๊ธฐ
    • NM2 - by Choice
  • DFS
    • Alphabet
  • ์‚ผ์„ฑ ๊ธฐ์ถœ ๋ฌธ์ œ์ง‘
    • ์ƒ์–ด์ดˆ๋“ฑํ•™๊ต
    • ์Šคํƒ€ํŠธ์™€ ๋งํฌ
    • ํ†ฑ๋‹ˆ๋ฐ”ํ€ด
    • ์ธ๊ตฌ์ด๋™
    • ์•„๊ธฐ ์ƒ์–ด
    • ๋‚š์‹œ์™•
    • ์ปจ๋ฒ ์ด์–ด ๋ฒจํŠธ
    • ์—ฐ์‚ฐ์ž ๋ผ์›Œ๋„ฃ๊ธฐ
    • ์—ฐ๊ตฌ์†Œ3 ๋ฌธ์ œ ํ’€๊ธฐ ์œ„ํ•œ ๋น„ํŠธ๋งˆ์Šคํ‚น ๋ณต์Šตโญ๏ธ
    • ์—ฐ๊ตฌ์†Œ3
    • ๋‚˜๋ฌด ์žฌํ…Œํฌ ํ’€๊ธฐ ์œ„ํ•œ Iterator
    • ๋‚˜๋ฌด ์žฌํ…Œํฌ - LinkedList, Iterator, addAll(0,List)๋กœ ํ’€๊ธฐ
    • ๋‚˜๋ฌด ์žฌํ…Œํฌ-ArrayList<Integer>[ ][ ]๋กœ ํ’€๊ธฐ
    • ์‹œํ—˜ ๊ฐ๋… - ๋ฆฌํŒฉํ† ๋ง
    • (๋ฌธ์ œ ์ œ๋Œ€๋กœ ์•ˆ ์ฝ์–ด์„œ ํ‹€๋ฆผ)์ฃผ์‚ฌ์œ„ ๊ตด๋ฆฌ๊ธฐ
    • ํ…ŒํŠธ๋กœ๋ฏธ๋…ธ
    • ๋ฏธ์„ธ๋จผ์ง€ ์•ˆ๋…•!
    • ์น˜ํ‚จ ๋ฐฐ๋‹ฌ
    • ๋งˆ๋ฒ•์‚ฌ ์ƒ์–ด์™€ ํŒŒ์ด์–ด๋ณผ
    • ๋กœ๋ด‡ ์ฒญ์†Œ๊ธฐ
    • ๊ฐ์‹œ
    • ๋งˆ๋ฒ•์‚ฌ ์ƒ์–ด์™€ ๋น„๋ฐ”๋ผ๊ธฐ
    • ์‚ฌ๋‹ค๋ฆฌ ์กฐ์ž‘
    • ๋“œ๋ž˜๊ณค ์ปค๋ธŒ
    • ์ด์ฐจ์› ๋ฐฐ์—ด๊ณผ ์—ฐ์‚ฐ
    • ๊ฒŒ๋ฆฌ ๋งจ๋”๋ง2
    • ์Šคํƒ€ํŠธ ํƒ์‹œ
    • ๋งˆ๋ฒ•์‚ฌ ์ƒ์–ด์™€ ํ† ๋„ค์ด๋„
    • ๋งˆ๋ฒ•์‚ฌ ์ƒ์–ด์™€ ํŒŒ์ด์–ด ์Šคํ†ฐ
    • BFS-์„ฌ์˜ ๊ฐฏ์ˆ˜
    • ๋ฑ€
    • ๊ฒฝ์‚ฌ๋กœ
    • ์›ํŒ ๋Œ๋ฆฌ๊ธฐ
    • ์–ด๋ฅธ ์ƒ์–ด
    • ์ƒ์–ด์ค‘ํ•™๊ต
    • ๊ตฌ์Šฌ ํƒˆ์ถœ2
    • ๊ตฌ์Šฌ ํƒˆ์ถœ
    • ๊ฒŒ๋ฆฌ ๋งจ๋”๋ง2_์žฌ๋„์ „
    • 2048(Easy)
    • ์ƒˆ๋กœ์šด ๊ฒŒ์ž„2
    • ๋ชจ๋…ธ๋ฏธ๋…ธ ๋„๋ฏธ๋…ธ2
  • ๊ตฌํ˜„ ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ํ›ˆ๋ จ
    • ์น˜์ฆˆ
    • ํŠธ๋Ÿญ
    • ์šฐ์„ ์ˆœ์œ„ ํ
    • ๊ฒฝ์Ÿ์  ์ „์—ผ
  • ์นด์นด์˜ค ๊ธฐ์ถœ
    • ์ •๊ทœํ‘œํ˜„์‹ Meta ๋ฌธ์žํ‘œ
    • 1. ์‹ ๊ทœ ์•„์ด๋”” ์ถ”์ฒœ - ๋ฌธ์ž, ๋ฌธ์ž์—ด ๋ฉ”์„œ๋“œ or์ •๊ทœํ‘œํ˜„์‹ ์ด์šฉ
    • 2. ๋ฉ”๋‰ด ๋ฆฌ๋‰ด์–ผ
    • 3. ์ˆœ์œ„ ๊ฒ€์ƒ‰
    • ๋‹ค์ต์ŠคํŠธ๋ผ ์•Œ๊ณ ๋ฆฌ์ฆ˜
    • ํ”Œ๋กœ์ด๋“œ ์™€์ƒฌ
    • ๋‹ค์ต์ŠคํŠธ๋ผ vs ํ”Œ๋กœ์ด๋“œ ์™€์ƒฌ ์ฐจ์ด์ 
    • 4. ํ•ฉ์Šน ํƒ์‹œ ์š”๊ธˆ
    • 5. ๊ด‘๊ณ  ์‚ฝ์ž…
    • 6. ์นด๋“œ ์ง ๋งž์ถ”๊ธฐ
    • 6. ๋งค์นญ ์ ์ˆ˜(๋ฌธ์ž์—ด ํŒŒ์‹ฑ)
  • SWEA
    • ๋ฏธ์ƒ๋ฌผ ๊ฒฉ๋ฆฌ
    • ๋“ฑ์‚ฐ๋กœ ์กฐ์„ฑ
    • ํƒˆ์ฃผ๋ฒ” ๊ฒ€๊ฑฐ
    • ์ˆ˜์˜์žฅ
    • ์ ์‹ฌ ์‹์‚ฌ ์‹œ๊ฐ„
    • ์ฐจ๋Ÿ‰ ์ •๋น„์†Œ
    • ๋ฒŒ๊ฟ€ ์ฑ„์ทจ
    • ๋””์ €ํŠธ ์นดํŽ˜(๊ฒŒ๋ฆฌ๋งจ๋”๋ง2 ๋ฌธ์ œ)
    • ํŠน์ดํ•œ ์ž์„(ํ†ฑ๋‹ˆ๋ฐ”ํ€ด ๋ฌธ์ œ)
    • ํ™œ์ฃผ๋กœ ๊ฑด์„ค(๊ฒฝ์‚ฌ๋กœ ๋ฌธ์ œ)
    • ํ™ˆ ๋ฐฉ๋ฒ” ์„œ๋น„์Šค
    • ๋ณดํ˜ธ ํ•„๋ฆ„
    • ๋ณด๋ฌผ ์ƒ์ž ๋น„๋ฐ€๋ฒˆํ˜ธ
    • ๋ฒฝ๋Œ ๊นจ๊ธฐ
    • ์ค„๊ธฐ ์„ธํฌ ๋ฐฐ์–‘
    • ํ•€๋ณผ ๊ฒŒ์ž„
    • ์›์ž ์†Œ๋ฉธ ์‹œ๋ฎฌ๋ ˆ์ด์…˜
    • ๋ฌด์„  ์ถฉ์ „
  • ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค Weekly
    • ํผ์ฆ ์กฐ๊ฐ ์ฑ„์šฐ๊ธฐ
Powered by GitBook