Skip to content

izzatkarimov/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

70 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Leetcode Solutions

Easy

# Title Solution Difficulty
01 Two Sum C++ Easy
14 Longest Common Prefix C++ Easy
20 Valid Parentheses C++ Easy
26 Remove Duplicates from Sorted Array C++ Easy
27 Remove Element C++ Easy
35 Search Insert Position C++ Easy
66 Plus One C++ Easy
88 Merge Sorted Array C++ Easy
118 Pascal's Triangle C++ Easy
125 Valid Palindrome C++ Easy
217 Contains Duplicate C++ Easy
242 Valid Anagram C++ Easy
412 Fizz Buzz C++ Easy
1752 Check if Array is Sorted and Rotated C++ Easy
1790 Check if One String Swap can make Strings equal C++ Easy
1800 Maximum Ascending Subarray Sum C++ Easy
1929 Concatenation of Array C++ Easy
3105 Longest Strictly Increasing or Strictly Decreasing Subarray C++ Easy
3151 Special Array Ⅰ C++ Easy
3174 Clear Digits C++ Easy

Medium

# Title Solution Difficulty
11 Container with Most Water C++ Medium
15 3Sum C++ Medium
22 Generate Parentheses C++ Medium
36 Valid Sudoku C++ Medium
49 Group Anagrams C++ Medium
128 Longest Consecutive Sequence C++ Medium
150 Evaluate Reverse Polish Notation C++ Medium
155 Min Stack C++ Medium
167 Two Sum Ⅱ - Input Array is Sorted C++ Medium
238 Product of Array Except Selft C++ Medium
347 Top K Frequent Elements C++ Medium
670 Maximum Swap C++ Medium
889 Construct Binary Tree from Preorder and Postorder traversal C++ Medium
1079 Letter Tile Possibilities C++ Medium
1261 Find Elements in a Contaminated Binary Tree C++ Medium
1352 Product of the Last K Numbers C++ Medium
1415 The k-th Lexicographical String of all Happy Strings of Length n C++ Medium
1545 Find kth Bit in Nth Binary String C++ Medium
1718 Construct the Lexicographically Largest Valid Sequence C++ Medium
1726 Tuple with Same Product C++ Medium
1910 Remove All Occurances of a Substring C++ Medium
1980 Find Unique Binary String C++ Medium
2044 Count Number of Maximum Bitwise-OR Subsets C++ Medium
2342 Max Sum of a Pair With Equal Sum of Digits C++ Medium
2349 Design a Number Container System C++ Medium
2364 Count Number of Bad Pairs C++ Medium
2375 Construct Smallest Number From DI String C++ Medium
2698 Find the Punishment Number of an Integer C++ Medium
3066 Minimum Operations to Exceed Threshold Value Ⅱ C++ Medium
3160 Find the Number of Distinct Colors among the Balls C++ Medium

Hard

# Title Solution Difficulty
42 Trapping Rain Water C++ Hard
1028 Recover a Tree from Preorder Traversal C++ Hard
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy