WalkCCC
walkccc.me › LeetCode
LeetCode Solutions
LeetCode Solutions in C++23, Java, Python, MySQL, and TypeScript.
GitHub
github.com › walkccc › LeetCode
GitHub - walkccc/LeetCode: 💡 LeetCode in C++23/Java/Python/MySQL/TypeScript (respect coding conventions)
💡 Solutions to LeetCode in C++23, Java, Python, MySQL, and TypeScript.
Starred by 1.3K users
Forked by 454 users
Languages C++ 37.6% | Java 36.4% | Python 25.5%
Videos
01:39:20
Solving Coding Interview Questions in Python on LeetCode (easy ...
27:13
Solving LeetCode SQL Interview Questions | Part 1/3 - YouTube
18:41
How to solve coding problems on LeetCode - YouTube
15:31
How to solve coding interview problems ("Let's leetcode") - YouTube
14:54
How to use LeetCode and pick problems to solve effectively in #2024 ...
08:21
How to Start Leetcode as a Beginner - YouTube
LeetCode
leetcode.com › problems › walking-robot-simulation
Walking Robot Simulation - LeetCode
Can you solve this real interview question? Walking Robot Simulation - A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot receives an array of integers commands, which represents a sequence of moves that it needs to execute. There are only three possible types of instructions the robot can receive: * -2: Turn left 90 degrees.
LeetCode
leetcode.com › problems › find-a-safe-walk-through-a-grid
Find a Safe Walk Through a Grid - LeetCode
Example 1: Input: grid = [[0,1,0,0,0],[0,1,0,1,0],[0,0,0,1,0]], health = 1 Output: true Explanation: The final cell can be reached safely by walking along the gray cells below. [https://assets.leetcode.com/uploads/2024/08/04/3868_examples_1drawio.png] Example 2: Input: grid = [[0,1,1,0,0,0...
Walkccc
walkccc.me
walkccc.me
💡 Solutions to LeetCode in C++23, Java, Python, MySQL, and TypeScript.
LeetCode
leetcode.com › u › walk
walk - LeetCode Profile
View walk's profile on LeetCode, the world's largest programming community.
LeetCode
leetcode.com › problems › climbing-stairs
Climbing Stairs - LeetCode
Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top.
LeetCode
leetcode.com › explore
Explore - LeetCode
LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore.
LeetCode
leetcode.com › problems › minimum-cost-walk-in-weighted-graph
Minimum Cost Walk in Weighted Graph - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
GitHub
gist.github.com › SuryaPratapK › 97e8e343258f1f5c5eb80e381c727722
Minimum Cost Walk in Weighted Graph | Leetcode 3108 · GitHub
Minimum Cost Walk in Weighted Graph | Leetcode 3108 · This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below.
GitHub
github.com › walkccc
walkccc (Peng-Yu Chen) · GitHub
walkccc Follow · 🌎 · 🌎 · Follow · Readability Enthusiast · 914 followers · 28 following · New York, NY · https://pengyuc.com · @pengyuc_ Block or Report · Report abuse · Contact GitHub support about this user’s behavior. Learn more about reporting abuse. Report abuse · More · Overview · Repositories · Projects · Packages · Stars · LeetCode ·
WalkCCC
walkccc.me › LeetCode › problems › 1
1. Two Sum - LeetCode Solutions
LeetCode Solutions in C++23, Java, Python, MySQL, and TypeScript.
AlgoMonster
algo.monster › liteproblems › 874
874. Walking Robot Simulation - In-Depth Explanation
In-depth solution and explanation for LeetCode 874. Walking Robot Simulation in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis. Better than official and forum solutions.
LeetCode
leetcode.com › problems › walking-robot-simulation-ii
Walking Robot Simulation II - LeetCode
Walking Robot Simulation II - A width x height grid is on an XY-plane with the bottom-left cell at (0, 0) and the top-right cell at (width - 1, height - 1). The grid is aligned with the four cardinal directions ("North", "East", "South", and ...
LeetCode
leetcode.com › u › walkccc
walkccc - LeetCode Profile
walkccc · Rank29,600 · walkccc · Community Stats · Views · 5.8K · Last week0 · Solution · 21 · Last week0 · Discuss · 0 · Last week0 · Reputation · 105 · Last week0 · Languages · C++ 949 problems solved · Python3 · 751 problems solved · Java · 711 problems solved ·
LeetCode
leetcode.com › discuss › general-discussion › 898638 › how-do-you-walk-through-examples
Discuss - LeetCode
The Geek Hub for Discussions, Learning, and Networking.
Reddit
reddit.com › r/leetcode › leetcode walkthrough
r/leetcode on Reddit: Leetcode walkthrough
February 25, 2019 -
Hi everyone. I am new to leetcode style problem-solving. So I was looking for some sort of text walkthrough of each problem. Not necessarily it has to cover every problem.
I found this repo: https://github.com/azl397985856/leetcode
Unfortunately, it is in Chinese. Translating Chinese to English works. But it doesn't provide the best experience.
I was wondering anyone knows anything similar to this.
PS: I prefer text walkthrough rather than video explanation.
Top answer 1 of 2
1
I think it is really important to categorize the problems you want to solve.
For example ... arrays, stacks & queues, trees, graph search (sub topics bfs dfs djikstras bellman ford)
And then answer questions on these problems and find walkthroughs for each type of problem because there are sooo many.
I do something like this on my Youtube channel and a lot of Youtubers do but I won't leave links because you're not a fan of video explanations.
2 of 2
1
https://www.youtube.com/playlist?list=PLod2hJhyen5fBGkRZelDtg5YBVgd8aSvx
Medium
medium.com › @zohaibshahzadTO › the-walkthrough-leetcode-1-6dba9588235d
The Walkthrough: LeetCode 1. LeetCode 1: Two Sum | by Zohaib Shahzad | Medium
December 13, 2021 - Let’s start with the example given in the LeetCode problem. Suppose we’re given the array [2, 7, 11, 18] and a target value of 9. We’re tasked with finding two number within the array that add up to…
LeetCode
leetcode.com › problems › shortest-path-in-a-grid-with-obstacles-elimination
Shortest Path in a Grid with Obstacles Elimination - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Medium
nwthomas.medium.com › unique-paths-leetcode-62-b1f4c6fcc154
Unique Paths (LeetCode #62). This article is part of a series from… | by Nathan Thomas | Medium
November 1, 2022 - If you’re looking for a quick walkthrough of an optimal solution to the LeetCode Unique Paths problem, you’re in the right spot.