LeetCode-Solutions

This repositiry contains the solution of LeetCode, CodeStudio questions which i have solved till now. [ This repository gets updated everyday. ]

next up - power of three

For solutions with runtime 0ms, faster than 100% solution and solution of other LeetCode questions visit https://github.com/Arunim313/LeetCode-Solutions

Name		Name	Last commit message	Last commit date
0001. Two Sum		0001. Two Sum
0007. Reverse Integer		0007. Reverse Integer
0009. Palindrome Number		0009. Palindrome Number
0013. Roman to Integer		0013. Roman to Integer
0020. Valid Parentheses		0020. Valid Parentheses
0026. Remove Duplicates from Sorted Array		0026. Remove Duplicates from Sorted Array
0033. Search in Rotated Sorted Array		0033. Search in Rotated Sorted Array
0034. Find First and Last Position of Element in Sorted Array		0034. Find First and Last Position of Element in Sorted Array
0048. Rotate Image		0048. Rotate Image
0050. Pow(x,n)		0050. Pow(x,n)
0054. Spiral Matrix		0054. Spiral Matrix
0069. Sqrt(x)		0069. Sqrt(x)
0074. Search a 2D Matrix		0074. Search a 2D Matrix
0088. Merge Sorted Array		0088. Merge Sorted Array
0121. Best Time to Buy and Sell Stock		0121. Best Time to Buy and Sell Stock
0125. Valid Palindrome		0125. Valid Palindrome
0136. Single Number		0136. Single Number
0169. Majority Element		0169. Majority Element
0189. Rotate Array		0189. Rotate Array
0191. Number of 1 Bits		0191. Number of 1 Bits
0204. Count Primes		0204. Count Primes
0217. Contains Duplicate		0217. Contains Duplicate
0231. Power of Two		0231. Power of Two
0240. Search a 2D Matrix II		0240. Search a 2D Matrix II
0268. Missing Number - Copy		0268. Missing Number - Copy
0283. Move Zeroes		0283. Move Zeroes
0287. Find the Duplicate Number		0287. Find the Duplicate Number
0338. Counting Bits		0338. Counting Bits
0344. Reverse String		0344. Reverse String
0387. First Unique Character in a String		0387. First Unique Character in a String
0443. String Compression		0443. String Compression
0567. Permutation in String		0567. Permutation in String
1009. Complement of Base 10 Integer		1009. Complement of Base 10 Integer
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
1108. Defanging an IP Address		1108. Defanging an IP Address
1207. Unique Number of Occurrences		1207. Unique Number of Occurrences
1281. Subtract the Product and Sum of Digits of an Integer		1281. Subtract the Product and Sum of Digits of an Integer
1342. Number of Steps to Reduce a Number to Zero		1342. Number of Steps to Reduce a Number to Zero
1480. Running Sum of 1d Array		1480. Running Sum of 1d Array
1672. Richest Customer Wealth		1672. Richest Customer Wealth
1752. Check if Array Is Sorted and Rotated		1752. Check if Array Is Sorted and Rotated
1910. Remove All Occurrences of a Substring		1910. Remove All Occurrences of a Substring
1929. Concatenation of Array		1929. Concatenation of Array
2016. Maximum Difference Between Increasing Elements		2016. Maximum Difference Between Increasing Elements
2169. Count Operations to Obtain Zero		2169. Count Operations to Obtain Zero
2235. Add Two Integers		2235. Add Two Integers
2347. Best Poker Hand		2347. Best Poker Hand
2351. First Letter to Appear Twice		2351. First Letter to Appear Twice
35. Search Insert Position		35. Search Insert Position
704. Binary Search		704. Binary Search
852. Peak Index in a Mountain Array		852. Peak Index in a Mountain Array
AggressiveCows.cpp		AggressiveCows.cpp
BookAllocation		BookAllocation
LICENSE		LICENSE
README.md		README.md

Navigation Menu

Repository files navigation

LeetCode-Solutions

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode-Solutions

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages