Skip to content

NvsYashwanth/Leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

ForTheBadge built-with-love

GitHub last commit

PLEASE SCROLL TO THE BOTTOM OF THE PAGE TO READ THE CONTRIBUTION GUIDELINES ⚑

Note πŸ“Œ

  • The table below summarizes this repo
  • Clicking on the problem name will redirect you to the specific problem page of leetcode website
  • For each problem corresponding solutions for C++ and Python are mentioned as Yes or No indicating the availability of the solution in that specific language in the repository. Clicking on Yes for corresponding problem will take you to the repo link of problem solution.

Happy Leetcoding ❀️

# Problem C++ πŸ’ͺ Python 🐍
1 Add and Search Word - Data structure design No Yes
2 Add Binary No Yes
3 Add Digits No Yes
4 Add Strings No Yes
5 Arranging coins No Yes
6 Array Partition I No Yes
7 Available Captures for Rook No Yes
8 Average Salary Excluding the Minimum and Maximum Salary No Yes
9 Best Time to Buy and Sell Stock No Yes
10 Binary Gap No Yes
11 Binary Number with Alternating Bits No Yes
12 Binary Search No Yes
13 Buddy strings No Yes
14 Build an Array With Stack Operations Yes Yes
15 Bulb switcer III No Yes
16 Bulb Switcher No Yes
17 Can Make Arithmetic Progression From Sequence No Yes
18 Cells with Odd Values in a Matrix No Yes
19 Check If All 1's Are at Least Length K Places Away No Yes
20 Complement of Base 10 Integer No Yes
21 Container With Most Water No Yes
22 Contains Duplicate Yes Yes
23 Convert Binary Number in a Linked List to Integer No Yes
24 Count Good Triplets No Yes
25 Count Largest Group No Yes
26 Count Negative Numbers in a Sorted Matrix No Yes
27 Count Number of Teams No Yes
28 Count Odd Numbers in an Interval Range No Yes
29 Count Primes No Yes
30 Count Triplets That Can Form Two Arrays of Equal XOR No Yes
31 Counting Bits No Yes
32 Create Target Array in the Given Order No Yes
33 Day of the week No Yes
34 Decompress Run Length Encoded List No Yes
35 Decrypt String from Alphabet to Integer Mapping No Yes
36 Defanging an IP Address No Yes
37 Delete Node in a Linked List No Yes
38 Design Hashset No Yes
39 Destination City No Yes
40 Detect capital No Yes
41 DI String Match No Yes
42 Divisor Game No Yes
43 Duplicate Zeros No Yes
44 Element Appearing More Than 25% In Sorted Array No Yes
45 Factorial Trailing Zeroes No Yes
46 Fair candy swap No Yes
47 Fibonacci Number No Yes
48 Final Prices With a Special Discount in a Shop No Yes
49 Find All Anagrams in a String No Yes
50 Find All Duplicates in an Array No Yes
51 Find All Numbers Disappeared in an Array No Yes
52 Find common characters No Yes
53 Find Lucky Integer in an Array No Yes
54 Find N Unique Integers Sum up to Zero No Yes
55 Find Numbers with Even Number of Digits No Yes
56 Find Peak Element No Yes
57 Find the differnece No Yes
58 Find the Distance Value Between Two Arrays No Yes
59 Find the Minimum Number of Fibonacci Numbers Whose Sum Is K No Yes
60 Find Words That Can Be Formed by Characters No Yes
61 First Unique Character in a String No Yes
62 Flipping an Image No Yes
63 Generate a String With Characters That Have Odd Counts No Yes
64 Goat Latin No Yes
65 Hamming distance No Yes
66 Happy Number No Yes
67 Height Checker No Yes
68 How Many Numbers Are Smaller Than the Current Number No Yes
69 Implement strStr() No Yes
70 Increasing Decreasing String No Yes
71 Integer replacement No Yes
72 Intersection of Two Arrays No Yes
73 Jewels and Stones No Yes
74 Kids With the Greatest Number of Candies No Yes
75 Kth Missing Positive Number No Yes
76 Linked List Cycle No Yes
77 Longest Common Prefix No Yes
78 Longest Subarray of 1's After Deleting One Element No Yes
79 Longest Substring Without Repeating Characters No Yes
80 Lucky Numbers in a Matrix No Yes
81 Majority Element No Yes
82 Make The String Great No Yes
83 Make Two Arrays Equal by Reversing Sub-arrays Yes Yes
84 Max Consecutive Ones Yes Yes
85 Maximum number 69 No Yes
86 Maximum Product of Two Elements in an Array No Yes
87 Maximum Product of Word Lengths No Yes
88 Maximum subarray No Yes
89 Merge sorted array No Yes
90 Merge Two Sorted Lists No Yes
91 Middle of the Linked List No Yes
92 Minimum Absolute Difference No Yes
93 Minimum Operations to Make Array Equal No Yes
94 Minimum Time Visiting All Points No Yes
95 Minimum Value to Get Positive Step by Step Sum No Yes
96 Missing number No Yes
97 Monotonic Array No Yes
98 Move zeros No Yes
99 N-Repeated Element in Size 2N Array No Yes
100 Number Complement No Yes
101 Number of 1 bits No Yes
102 Number of Good Pairs No Yes
103 Number of Steps to Reduce a Number in Binary Representation to One No Yes
104 Number of Steps to Reduce a Number to Zero No Yes
105 Number of Students Doing Homework at a Given Time No Yes
106 Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold No Yes
107 Number of Substrings With Only 1s No Yes
108 Palindrome Linked List No Yes
109 Pascals triangle 1 No Yes
110 Pascals triangle 2 No Yes
111 Peak Index in a Mountain Array No Yes
112 Permutation in String No Yes
113 Play with chips No Yes
114 Plus One No Yes
115 Power of four No Yes
116 Power of three No Yes
117 Power of two No Yes
118 Prime Number of Set Bits in Binary Representation No Yes
119 Product of Array Except Self No Yes
120 Queries on a Permutation With Key No Yes
121 Range Sum of Sorted Subarray Sums No Yes
122 Ransom Note No Yes
123 Reduce Array Size to The Half No Yes
124 Reformat Date No Yes
125 Relative Sort Array No Yes
126 Remove All Adjacent Duplicates In String No Yes
127 Remove Duplicates from Sorted Array No Yes
128 Remove Duplicates from Sorted List No Yes
129 Remove element No Yes
130 Remove Linked List Elements No Yes
131 Remove Outermost Parentheses No Yes
132 Remove Palindromic Subsequences No Yes
133 Replace Elements with Greatest Element on Right Side No Yes
134 Reshape the Matrix No Yes
135 Reverse bits No Yes
136 Reverse Integer No Yes
137 Reverse Linked List No Yes
138 Reverse Only Letters No Yes
139 Reverse String No Yes
140 Reverse Words in a String III No Yes
141 Robot Return to Origin No Yes
142 Roman to Integer No Yes
143 Rotate array No Yes
144 Running Sum of 1d Array No Yes
145 Search Insert Position No Yes
146 Self Dividing Numbers No Yes
147 Shift 2D Grid No Yes
148 Shortest Unsorted Continuous Subarray No Yes
149 Shuffle string No Yes
150 Shuffle the Array No Yes
151 Single Number II No Yes
152 Single Number III No Yes
153 Single Number No Yes
154 Sort Array By Parity II No Yes
155 Sort Array By Parity No Yes
156 Sort Integers by The Number of 1 Bits No Yes
157 Split a String in Balanced Strings No Yes
158 Sqrt(x) No Yes
159 Squares of a Sorted Array No Yes
160 Subdomain Visit Count No Yes
161 Subrectangle Queries No Yes
162 Subsets No Yes
163 Subtract the Product and Sum of Digits of an Integer No Yes
164 Sum of Even Numbers After Queries No Yes
165 Sum of two integers No Yes
166 The K Weakest Rows in a Matrix No Yes
167 Three Consecutive Odds No Yes
168 To Lower Case No Yes
169 Topelitz Matrix No Yes
170 Transpose Matrix No Yes
171 Two Sum II - Input array is sorted No Yes
172 Two Sum No Yes
173 Unique Email Addresses No Yes
174 Unique Morse Code Words No Yes
175 Unique Number of Occurrences No Yes
176 Valid Boomerang No Yes
177 Valid Palindrome I No Yes
178 Valid Palindrome II No Yes
179 Valid parentheses No Yes
180 Vertical Order Traversal of a Binary Tree No Yes
181 Water bottles No Yes
182 XOR Operation in an Array No Yes
183 XOR Queries of a Subarray No Yes
184 Rank transform of an array Yes No

Contribution Guidlines πŸ“ƒ

How to contribute? πŸ‘€

  1. Fork the repository
  2. Make the desired changes (add/delete/modify)
  3. Make a pull request

When to contribute? πŸ‘€

  1. If there is no solution to a problem in either C++ or Python in the main branch
  2. If your solution to an existing problem is asymptotically faster than the one in the main branch
  3. If your algorithm has the same time complexity but with reduced code size. In such cases comment the original solution and make a pull request with your solution
  4. If your method of solving asymptotically slower then comment your solution and make a pull request