LeetSolve - Master your coding skills by solving Leetcode challenges

Hashnode

Hashnode

LeetSolve - Master your coding skills by solving Leetcode challenges

About
The book

Write

Command Palette

Search for a command to run...

Latest articles

Leetcode 120. How To Find The Minimum Path From Top To Bottom Of A Triangle

Jan 23, 2024·4 min read·266

How To Find The Longest Substring Without Repeating Characters

Jan 16, 2024·3 min read·473

Leetcode 59. How To Go Around A Square Matrix In Spiral Order

A simple example of using C++ switch

Jan 31, 2024·2 min read·561

How To Find The Maximal Subarray Having Distinct Elements

Jan 9, 2024·2 min read·267

Common Mistakes in Coding Interviews and How to Avoid Them

Jan 2, 2024·6 min read·269

LeetSolve - Master your coding skills by solving Leetcode challenges

77 posts

LeetSolve shares how to solve a coding challenge in C++. The challenges are selected from leetcode.com. Here you can learn essential algorithms, basic data structures, and elementary C++.

How to Check If a Number is a Power of Four

The math behind Leetcode 342. Power of Four.

Dec 26, 2023·2 min read·228

How to Encode Morse Code

A C++ solution to Leetcode 804. Unique Morse Code Words using mapping and std::unordered_set to keep track of unique representations.

Dec 19, 2023·3 min read·129

How To Add Two Numbers Represented As Linked Lists

By iterating digit by digit, and calculating the sum and carry, it handles scenarios for the lengths of the input lists and any remaining carry values

Dec 12, 2023·3 min read·139

How to Solve Coding Challenges: A Comprehensive Guide

A step-by-step approach to effectively solve coding challenges, prepare for coding interviews, and land dev jobs.

Dec 5, 2023·7 min read·372

How To Count Unique Paths In A Grid With Obstacles

An example of dynamic programming

Nov 30, 2023·4 min read·265

How to Perform a Counting Using Array and Hash Table

Finding the first non-repeating character in a string

Nov 28, 2023·3 min read·255

Read my book to support my work. Thank you for your support!

Archive
Privacy
Terms

Sitemap RSS