Daehong TIL Blog
👨🏻💻 하루에 한 걸음씩 꾸준히 나아가는 개발자
Today I Learned : 오늘 내가 배운 것들을 정리합니다.
저는 기초를 중요시하며, 꾸준하고 성실하게 공부하는 것을 선호합니다.
이것은 추후 저의 큰 자산이 될 것이며, 개발을 공부하는 다른 사람들에게도 큰 도움이 될 것입니다.
TIL List
Very Important Study Content
-
Mutex & Semaphore
-
Concurrency issues And Lock
-
DB index to improve performance
-
Redis Cache & Update Strategy
-
Very Important Transaction
-
DB Lock
Big-Data
Java
-
Java Basic JDK, JRE, JVM & JVM WarmUp
-
Java Version
-
OOP and SOLID
-
Multithread Synchronization Issues Basic
-
Assignment vs Equality vs Equals
-
Primitive vs Wrapper
-
Abstract Class vs Interface
-
Equals & HashCode
-
Call By Value vs Call By Reference
-
7 features of Java
-
Classes, Objects and Instances
-
Error in Floating Point
-
Short Circuit vs Eager Operator
-
Static ?
-
Immutable Class vs Mutable Class
-
Operators, TypeConversion, and MemoryOverflow
-
String
-
Libraries vs Frameworks
-
Final Keyword
-
Method Dispatch
-
Inner Class
-
Exception
-
Collection Basic & Hash Basic
-
Annotation
-
Generic
-
Garbage Collection
-
Shallow Copy vs Deep Copy
-
Daemon Thread
-
IO & NIO ( Blocking vs Non-Blocking )
-
JSP & Servlet
-
JDBC & Connection Pool
-
JVM Stack and Stack Frame
-
Blocking IO, Non Blocking IO, Sync, Async
-
Java Etc Study
Spring
-
Why use springs?
-
IoC & DI
-
IoC Container & DI Container
-
Spring Bean
-
Autowired
-
Quilifier vs Primary
-
POJO
-
Filter vs Interceptor
-
DTO vs VO vs Entity
-
Spring Etc Study
Web
Git & Github
CS
-
Why computers use binary numbers
-
Interrupt
-
Ram vs Disk and Cache
-
System Bus
-
File writing process in Java (OS, interrupt, I/O perspective)
-
Process vs Thread Basic
-
Process vs Thread Deep
-
TCP vs UDP
-
Early Return Pattern
-
Singleton Pattern
-
Layered Architecture
-
UML Basic
-
Design Pattern Basic
Algorithm ( Daily Problem Solving )
-
Mischief
-
TwoDimensional Array Sorting
-
Binary Search
-
MusicVideo(Binary Search)
-
Choosing Stable(Binary Search)
-
DFS(Recursive Function)
-
Factorial
-
Fibonacci ( Memoization )
-
BinaryTree ( DFS )
-
BinaryTree ( BFS )
-
Find Subset ( DFS )
-
Find Calf ( BFS )
-
Shortest Distance ( DFS, BFS )
-
Route Navigation ( Graph, DFS )
-
Route Navigation2 ( Graph List, DFS )
-
Graph Shortest Distance ( Graph / BFS )
-
Find Subsets Same Sum ( DFS )
-
Baduki Riding ( DFS )
-
Maximum Score ( DFS )
-
Finding Duplicate Permutations ( DFS )
-
Coin Exchange ( DFS )
-
Number of Combinations Memoization ( DFS )
-
Finding Permutations ( DFS )
-
Guess Sequence ( DFS )
-
Finding Combinations ( DFS )
-
Maze Navigation ( DFS )
-
Maze Navigation ( BFS )
-
Tomato ( BFS )
-
Island ( DFS )
-
Island ( BFS )
-
Pizza Delivery Distance ( DFS )
-
Wrestler ( Greedy )
-
MeetingRoom Assignment ( Greedy )
-
Wedding Ceremony ( Greedy )
-
Maximum Earnings Schedule ( Greedy )
-
Wonderland ( Union&Find )
-
Wonderland ( Prim Algorithm )
-
Climbing Stairs
-
Cross Stone Bridge
-
Maximum Partially Increasing Sequence
-
Build Tallest Tower
-
Maximum Score(Knapsack Algorithm)
-
Two Pointers Algorithm
-
Sliding Window
-
Sort Algorithm
-
Sum Of Consecutive Natural Numbers
-
Sieve of Eratosthenes
-
Dijkstra Algorithm
-
Union & Find
-
Knapsack Algorithm
-
String CodingTest Tip
-
Array CodingTest Tip
-
Hash CodingTest Tip
-
Stack and Queue CodingTest Tip
-
ETC CodingTest Tip
Development Tip
-
Lock
-
Iamge Upload
-
When modifying a session in a hurry
-
How to prepare for high volume traffic
-
Transactional(readOnly = true)
-
Why you should avoid NoArgsConstructor and AllArgsConstructor
ETC
Development BOOK
Daehong TIL Blog
Git : https://github.com/JeonDaehong
Curriculum Vitae : https://daehong770.oopy.io/
Another Blog (Develop Blog) : https://development-my-link.tistory.com/