코딩테스트 – TildAlice

코딩테스트 완벽 대비 가이드: 알고리즘 유형부터 문제 풀이 전략까지

2025년 12월 30일

Solve Two Sum in O(n) with hash maps instead of O(n²) brute force. Compare 3 approaches with time complexity proof and LeetCode patterns.

2025년 12월 27일

Solve N-Queen, permutations, and Sudoku with backtracking. Python implementations with pruning strategies that actually speed things up.

2025년 12월 25일

Master DP patterns that solve 80% of coding interviews: Knapsack, LIS, LCS, and bitmask DP with Python code and O(n) optimizations.

2025년 12월 24일

BFS vs DFS: when to use each, how they differ in time complexity, and 5 graph problems you can't solve without mastering both algorithms.

2025년 12월 24일

Greedy algorithms decoded: solve activity selection, meeting rooms, and coin change in O(n log n). Spot the 3 cases where greedy fails.

2025년 12월 22일

Speed up subarray problems from O(n²) to O(n) using sliding window. Fixed vs variable size, two pointers, and 4 LeetCode patterns solved.

2025년 12월 16일

Master dynamic programming for coding interviews: derive recurrence relations, optimize space complexity, solve knapsack and LIS in Python.

2025년 12월 13일

Two Pointers drops array search from O(n²) to O(n). Master same-direction and opposite-direction patterns with 6 LeetCode problems solved.