InJavascript by doingbyRiccardo Canella·Oct 19🏆 Meta Hacker Cup 2020 — Qualification Round: Travel RestrictionsDifficulty: Easy Topic: Prefix Sums, Prefix & Suffix Arrays 📄 View original problem statement
Garinesaiajay·Sep 26The Data Structure I Almost OverlookedThere is a particular category of competitive programming problem that looks ridiculously simple until the constraints arrive.
InAlgorithmic problem solving (Mastering patterns and data structures)bySravya·Aug 12Programming articles — Arrays tricky (Hashtable, Prefix sum)560. Subarray Sum Equals K We need to find how many subarrays have a sum equal to k. A subarray is any contiguous range (i, j) where i <= j…
software engineer·Jul 19[CT스터디] 알고리즘 복기: 생존 조건, 구간합, 문자열 재배치, 재귀 분할, 연결 복구, 점수 계산Algorithm Review: From Problem Conditions to Code Structures
software engineer·Jul 17[CT스터디] 프로그래머스 9문제 풀이 복기: 문제 조건을 저장값과 갱신식으로 바꾸기Reframing Coding Test Problems into State, Update Rule, and Final Answer
Tarjan·Jul 1Prefix Sum: The Pattern Behind Most Subarray ProblemsLearn the intuition behind Prefix Sum, recognize it in interviews, and solve most subarray sum problems with confidence.
Harsh Jaiswal·Jun 11Array Patterns: Prefix Sum & HashingWhile revising DSA, I realized that many array problems are actually built on a few powerful patterns. Here are six problems that helped me…
![[CT스터디] 알고리즘 복기: 생존 조건, 구간합, 문자열 재배치, 재귀 분할, 연결 복구, 점수 계산](https://miro.medium.com/v2/resize:fill:160:106/1*LUVbxBCUzMt-D9sUl9UCYg.png)
![[CT스터디] 알고리즘 복기: 생존 조건, 구간합, 문자열 재배치, 재귀 분할, 연결 복구, 점수 계산](https://miro.medium.com/v2/resize:fill:320:214/1*LUVbxBCUzMt-D9sUl9UCYg.png)
![[CT스터디] 프로그래머스 9문제 풀이 복기: 문제 조건을 저장값과 갱신식으로 바꾸기](https://miro.medium.com/v2/resize:fill:160:106/1*rkJ-8NIrzFIyhjdsmKj2jQ.png)
![[CT스터디] 프로그래머스 9문제 풀이 복기: 문제 조건을 저장값과 갱신식으로 바꾸기](https://miro.medium.com/v2/resize:fill:320:214/1*rkJ-8NIrzFIyhjdsmKj2jQ.png)
