Skip to content

luizfls/LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

64 Commits
0002.cpp
0002.cpp
 
 
0012.cpp
0012.cpp
 
 
0014.cpp
0014.cpp
 
 
0017.cpp
0017.cpp
 
 
0021.cpp
0021.cpp
 
 
0033.cpp
0033.cpp
 
 
0034.cpp
0034.cpp
 
 
0058.cpp
0058.cpp
 
 
0064.cpp
0064.cpp
 
 
0073.cpp
0073.cpp
 
 
0088.cpp
0088.cpp
 
 
0098.cpp
0098.cpp
 
 
0100.cpp
0100.cpp
 
 
0124.cpp
0124.cpp
 
 
0125.cpp
0125.cpp
 
 
0137.cpp
0137.cpp
 
 
0146.cpp
0146.cpp
 
 
0200.cpp
0200.cpp
 
 
0201.cpp
0201.cpp
 
 
0207.cpp
0207.cpp
 
 
0217.cpp
0217.cpp
 
 
0232.cpp
0232.cpp
 
 
0238.cpp
0238.cpp
 
 
0242.cpp
0242.cpp
 
 
0328.cpp
0328.cpp
 
 
0343.cpp
0343.cpp
 
 
0392.cpp
0392.cpp
 
 
0394.cpp
0394.cpp
 
 
0415.cpp
0415.cpp
 
 
0438.cpp
0438.cpp
 
 
0451.cpp
0451.cpp
 
 
0463.cpp
0463.cpp
 
 
0540.cpp
0540.cpp
 
 
0543.cpp
0543.cpp
 
 
0567.cpp
0567.cpp
 
 
0575.cpp
0575.cpp
 
 
0617.cpp
0617.cpp
 
 
0637.cpp
0637.cpp
 
 
0733.cpp
0733.cpp
 
 
0807.cpp
0807.cpp
 
 
0831.cpp
0831.cpp
 
 
0890.cpp
0890.cpp
 
 
0895.cpp
0895.cpp
 
 
0958.cpp
0958.cpp
 
 
0986.cpp
0986.cpp
 
 
0993.cpp
0993.cpp
 
 
0997.cpp
0997.cpp
 
 
1008_iterative.cpp
1008_iterative.cpp
 
 
1008_recursive.cpp
1008_recursive.cpp
 
 
1028.cpp
1028.cpp
 
 
1038.cpp
1038.cpp
 
 
1106.cpp
1106.cpp
 
 
1222.cpp
1222.cpp
 
 
1232.cpp
1232.cpp
 
 
1302.cpp
1302.cpp
 
 
1329.cpp
1329.cpp
 
 
1338.cpp
1338.cpp
 
 
1381.cpp
1381.cpp
 
 
README.md
README.md
 
 

Repository files navigation

LeetCode

My solutions to LeetCode problems

https://leetcode.com/

# Problem description Difficulty Notes
0002 Add Two Numbers Medium
0012 Integer to Roman Medium
0014 Longest Common Prefix Easy
0017 Letter Combinations of a Phone Number Medium
0021 Merge Two Sorted Lists Easy
0033 Search in Rotated Sorted Array Medium
0034 Find First and Last Position of Element in Sorted Array Medium
0058 Length of Last Word Easy
0064 Minimum Path Sum Medium
0073 Set Matrix Zeroes Medium
0088 Merge Sorted Array Easy
0098 Validate Binary Search Tree Medium
0100 Same Tree Easy
0124 Binary Tree Maximum Path Sum Hard
0125 Valid Palindrome Easy
0137 Single Number II Medium
0146 LRU Cache Medium
0200 Number of Islands Medium
0201 Bitwise AND of Numbers Range Medium
0207 Course Schedule Medium
0217 Contains Duplicate Easy
0232 Implement Queue using Stacks Easy
0238 Product of Array Except Self Medium
0242 Valid Anagram Easy
0328 Odd Even Linked List Medium
0343 Integer Break Medium
0392 Is Subsequence Easy
0394 Decode String Medium
0415 Add Strings Easy
0438 Find All Anagrams in a String Medium
0451 Sort Characters By Frequency Medium
0463 Island Perimeter Easy
0540 Single Element in a Sorted Array Medium
0543 Diameter of Binary Tree Easy
0567 Permutation in String Medium
0575 Distribute Candies Easy
0617 Merge Two Binary Trees Easy
0637 Average of Levels in Binary Tree Easy
0733 Flood Fill Easy
0807 Max Increase to Keep City Skyline Medium
0831 Masking Personal Information Medium
0890 Find and Replace Pattern Medium
0895 Maximum Frequency Stack Hard
0958 Check Completeness of a Binary Tree Medium
0986 Interval List Intersections Medium
0993 Cousins in Binary Tree Easy
0997 Find the Town Judge Easy
1008 Construct Binary Search Tree from Preorder Traversal Medium Iterative
1008 Construct Binary Search Tree from Preorder Traversal Medium Recursive
1028 Recover a Tree From Preorder Traversal Hard
1038 Binary Search Tree to Greater Sum Tree Medium
1106 Parsing A Boolean Expression Hard
1222 Queens That Can Attack the King Medium
1232 Check If It Is a Straight Line Easy
1302 Deepest Leaves Sum Medium
1329 Sort the Matrix Diagonally Medium
1338 Reduce Array Size to The Half Medium
1381 Design a Stack With Increment Operation Medium

About

My solutions to LeetCode problems

Topics

leetcode

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages