Skip to content

Yet another collection of solutions to LeetCode problems

License

Notifications You must be signed in to change notification settings

protaskin/LeetCode-Solutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 
 
 
 
 

Repository files navigation

LeetCode-Solutions

Yet another collection of solutions to LeetCode problems. Written (mostly) in C++.

Solutions

# Title Solution Difficulty
1689 Partitioning Into Minimum Number Of Deci-Binary Numbers C++ Medium
1647 Minimum Deletions to Make Character Frequencies Unique C++ Medium
1480 Running Sum of 1d Array C++ Easy
1461 Check If a String Contains All Binary Codes of Size K C++ Medium
1423 Maximum Points You Can Obtain from Cards C++ Medium
1342 Number of Steps to Reduce a Number to Zero C++ Easy
1332 Remove Palindromic Subsequences C++ Easy
968 Binary Tree Cameras C++ Hard
867 Transpose Matrix C++ Easy
462 Minimum Moves to Equal Array Elements II C++ Medium
318 Maximum Product of Word Lengths C++ Medium
304 Range Sum Query 2D - Immutable C++ Medium
268 Missing Number C++ Easy
191 Number of 1 Bits C++ Easy
167 Two Sum II - Input Array Is Sorted C++ Medium
160 Intersection of Two Linked Lists C++ Easy
120 Triangle C++ Medium
88 Merge Sorted Array C++ Easy
52 N-Queens II C++ Hard
51 N-Queens C++ Hard
5 Longest Palindromic Substring C++ Medium
3 Longest Substring Without Repeating Characters C++ Medium

Copyright and License

Copyright 2022 Artyom Protaskin.

All the solutions are licensed under the MIT License.

About

Yet another collection of solutions to LeetCode problems

Topics

Resources

License

Stars

Watchers

Forks

Languages