Welcome to the LeetCode Study Group, a collaborative space to enhance algorithm problem-solving skills through structured discussions and teamwork. Let's grow together! 🚀
- Host: Yunyeong Kim
- Contact: [email protected]
| Name | Role | Email Address |
|---|---|---|
| Yunyeong Kim | Organizer | [email protected] |
| Daehyun Kim | Participant | [email protected] |
| Yunho Jo | Participant | [email protected] |
| Jiheon | Participant | [email protected] |
| Naeun Kim | Participant | [email protected] |
If you'd like to join the study, please contact the organizer at [email protected]. 🎉
- Platform: LeetCode (Focus: Easy & Medium problems)
- Frequency: Weekly Google Meet sessions
- Session Agenda: Analyze and discuss 2 algorithm problems per meeting
For each session, select 1-2 algorithm problems and prepare the following:
-
Problem Analysis
- Clearly interpret the problem.
- Define the requirements and objectives of the problem.
-
First Code Submission
- Share the initial solution you wrote (even if it’s incorrect).
- Include the time taken to come up with this solution.
-
First Code Analysis
- Analyze your initial code.
- Focus on the time complexity (Big O) and the data structures used.
-
Optimized Solution
- If the First Code is not optimal, use LeetCode's explanation as a reference.
- Highlight the issues with the First Code and explain how the optimized solution resolves these issues.
- Prepare visual aids to explain your approach (e.g., flowcharts, diagrams, pseudocode).
- Tools like Obsidian or basic drawing tools (e.g., Paint) are encouraged.
- Keep your presentation under 15 minutes.
- Focus on clarity, structure, and providing insights into your problem-solving process.
- After each presentation, allocate 5 minutes for group feedback.
- Feedback can include:
- Code quality and readability
- Alternative approaches
- General improvement suggestions
- Feedback doesn’t have to be strictly about the code.
- Feel free to discuss new algorithm concepts, English terminology, or problem-solving techniques.
- Positive reinforcement is encouraged! Highlight what the presenter did well. 🌟
- Feel free to ask questions about the approach or problem-solving methodology.
| Session | Date | Problems Discussed |
|---|---|---|
| 1 | 2025-02-22 | [561] array partition / [88] Merge Sorted array / [53] Maximm Subarray |
| 2 | 2025-03-01 | [169] Majority Element / [229] Majority Element II/ [347] Top K Frequent Words |
| 3 | 2025-03-08 | [463] Island Perimeter [221] Maximal Square / [1277] Count Square Submatrices with All Ones / |
| 4 | 2025-03-15 | Unsolved Problem || Retry solved Problem |
| 5 | 2025-03-22 | [643] Maximum Average Subarray I / [3] Longest Substring Without Repeating Characters / [209] Minimum Size Subarray Sum |