Skip to content
BranchesTags

Latest commit

 

History

33 Commits

Folders and files

NameName
Last commit message
Last commit date
Best_time_to_buy_and_sell_stocks_ii.cpp
Best_time_to_buy_and_sell_stocks_ii.cpp
 
 
Devide_two_integer.cpp
Devide_two_integer.cpp
 
 
Find_the_closest_pellindrome.cpp
Find_the_closest_pellindrome.cpp
 
 
GCD_of_an_array.cpp
GCD_of_an_array.cpp
 
 
Longest_common_subsequence.cpp
Longest_common_subsequence.cpp
 
 
Minimum_element_after_replacement_with_digit_sum.cpp
Minimum_element_after_replacement_with_digit_sum.cpp
 
 
Perfect_number.cpp
Perfect_number.cpp
 
 
README.md
README.md
 
 
Rectangle_area.cpp
Rectangle_area.cpp
 
 
Relative_ranks.cpp
Relative_ranks.cpp
 
 
Rotating_the_box
Rotating_the_box
 
 
Search_a_2d_Matrix.cpp
Search_a_2d_Matrix.cpp
 
 
Search_in_Matrix_ii.cpp
Search_in_Matrix_ii.cpp
 
 
Shift_2d_grid.cpp
Shift_2d_grid.cpp
 
 
Sqrt(x).cpp
Sqrt(x).cpp
 
 
Trapping_Rain_water.cpp
Trapping_Rain_water.cpp
 
 
basic_calculator.cpp
basic_calculator.cpp
 
 
exel_sheet_column_number.cpp
exel_sheet_column_number.cpp
 
 
find_duplicate.cpp
find_duplicate.cpp
 
 
longest_pelindrome_substring.cpp
longest_pelindrome_substring.cpp
 
 
permutation_in_string.cpp
permutation_in_string.cpp
 
 
permutations.cpp
permutations.cpp
 
 
remove_All_adjecent_duplicates_in_a_string.cpp
remove_All_adjecent_duplicates_in_a_string.cpp
 
 
search_insert.cpp
search_insert.cpp
 
 
spiral_matrix.cpp
spiral_matrix.cpp
 
 
string_compression.cpp
string_compression.cpp
 
 
super_pow.cpp
super_pow.cpp
 
 
walking_robot.cpp
walking_robot.cpp
 
 
walking_robot_II.cpp
walking_robot_II.cpp
 
 

Repository files navigation

LeetCode Solutions in C++

This repository contains carefully selected interesting and valuable LeetCode problems and their solutions implemented in C++. It focuses on problems that teach important algorithmic concepts and are frequently asked in technical interviews.

📚 Problems Covered

# Problem Difficulty Topic
1 Longest Common Subsequence Medium Dynamic Programming
2 Minimum Element After Digit Sum Replacement Medium Simulation
3 Basic Calculator Hard Stack, String Parsing
4 Excel Sheet Column Number Easy Math
5 Find Duplicate Number Medium Array, Two Pointers
6 Longest Palindrome Substring Medium String, Dynamic Programming
7 Permutation in String Medium Sliding Window
8 Permutations Medium Backtracking
9 Remove All Adjacent Duplicates in String Easy Stack
10 Search Insert Position Easy Binary Search
11 Spiral Matrix Medium Matrix, Simulation
12 String Compression Medium String, Two Pointers
13 Super Power Medium Math, Modular Arithmetic
14 Walking Robot Medium Simulation, Set
15 Walking Robot II Hard Simulation, Complex Logic

🎯 Key Topics

  • Dynamic Programming: Longest Common Subsequence, Longest Palindrome Substring
  • Backtracking: Permutations
  • Sliding Window: Permutation in String
  • Stack: Basic Calculator, Remove Adjacent Duplicates
  • Binary Search: Search Insert Position
  • Array Techniques: Find Duplicate, Spiral Matrix
  • String Processing: String Compression, Excel Sheet Column
  • Simulation: Walking Robot, Walking Robot II
  • Math: Super Power, Modular Arithmetic

🚀 How to Use

  1. Clone the repository:

    git clone https://github.com/Myparadox-creator/C-_leetcode.git

  2. Browse through the problems by difficulty level or topic.

  3. Check individual files for:

    • Well-documented C++ solutions
    • Algorithm explanations
    • Time and space complexity analysis
    • Edge cases handled

💡 Why This Repo?

  • ✅ Quality Over Quantity: Only the most valuable and insightful problems
  • 🎓 Interview Ready: Problems frequently asked in technical interviews
  • 📖 Learning Resource: Each solution demonstrates important algorithmic patterns
  • 🔍 Well-Organized: Problems categorized by difficulty and topic
  • 💻 Production-Grade Code: Well-structured and commented solutions

🤝 Contributing

Contributions are welcome! You can:

  • Suggest optimizations for existing solutions
  • Add more valuable problems and solutions
  • Improve explanations or documentation
  • Fix bugs or edge cases

📄 License

This repository is under the MIT License.

Happy coding! 🚀

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages