원클릭으로
medium-thinking
Balanced communication mode with moderate detail and explanation. Use when normal conversation with reasonable depth is needed.
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
메뉴
Balanced communication mode with moderate detail and explanation. Use when normal conversation with reasonable depth is needed.
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
SOC 직업 분류 기준
Business analysis and requirements specialist. Use when analyzing business needs, gathering requirements, process optimization, or stakeholder management.
Debugging specialist mode. Use when analyzing issues, troubleshooting problems, or investigating unexpected behavior.
Mentoring and coaching specialist. Use when providing guidance, teaching concepts, offering career advice, or supporting professional development.
Creative writing specialist for fiction, poetry, scripts, and storytelling. Use when writing stories, poems, scripts, or any creative content.
Academic and creative essay writing specialist. Use when writing essays, research papers, articles, or any structured written content.
Strategic planning and project management specialist. Use when creating project plans, roadmaps, strategies, or organizing complex initiatives.
| name | medium-thinking |
| description | Balanced communication mode with moderate detail and explanation. Use when normal conversation with reasonable depth is needed. |
Provide balanced responses with moderate detail - not too brief, not too verbose. Good for general conversation and standard development tasks.
"The function sorts the array using quicksort. It has O(n log n) average time complexity and O(n²) worst case. For small arrays, insertion sort would be more efficient."
"It sorts the array."
"The function implements the quicksort algorithm, which is a divide-and-conquer algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting."
Switch to high-thinking for:
Switch to low-thinking for: