Within this repository, you'll discover a collection of LeetCode problems that I've tackled, along with a README detailing my thought process for each one.
Additionally, I've included exercises from various courses focused on learning data structures and algorithms. In the README, I strive to provide explanations for these exercises, accompanied by illustrative code demonstrating the algorithms or data structures discussed.
-
Inside the
ArrayExercisefolder, you'll encounter various types of array problems that require solving specific challenges. -
The
MathExercisefolder contains mathematical problems for exploration. -
Within the
Sorting and Searchingfolder, you'll discover problems related to sorting and searching, all of which I've solved. -
Moving on to
StringsExercise, this section encompasses a diverse range of solved problems centered around string manipulation and related topics. -
Lastly, in the
frontendmastersfolder, you'll find solved exercises along with detailed descriptions focusing on data structures and algorithms.
Coverage Report
| File | Stmts | Miss | Cover | Missing |
|---|---|---|---|---|
| ArrayExercise/Best_Time_to_Buy_and_Sell_Stock_II | ||||
| BestTimetoBuyandSellStockII.py | 9 | 0 | 100% | |
| ArrayExercise/Contains_Duplicate | ||||
| containsDuplicate.py | 21 | 0 | 100% | |
| ArrayExercise/Height_Checker | ||||
| heightChecker.py | 12 | 0 | 100% | |
| ArrayExercise/Intersection_of_Two_Arrays_II | ||||
| intersectionOfTwoArrays.py | 11 | 0 | 100% | |
| ArrayExercise/Max_Consecutive_Ones | ||||
| MaxConsecutiveOnes.py | 14 | 0 | 100% | |
| ArrayExercise/Move_Zeroes | ||||
| moveZeros.py | 28 | 1 | 1 | 96% |
| ArrayExercise/Plus_One | ||||
| plusOne.py | 14 | 0 | 100% | |
| ArrayExercise/Remove_Duplicates_from_Sorted_Array | ||||
| duplicateItemLeetcodeSolution.py | 10 | 0 | 100% | |
| removeDuplicateItem.py | 12 | 0 | 100% | |
| ArrayExercise/Remove_Element | ||||
| RemoveElement.py | 18 | 0 | 100% | |
| ArrayExercise/Replace_Elements_with_Greatest_Element_on_Right_Side | ||||
| ReplaceElementswithGreatestElementonRightSide.py | 10 | 0 | 100% | |
| ArrayExercise/Rotate_Array | ||||
| rotatearray.py | 14 | 0 | 100% | |
| ArrayExercise/Single_Number | ||||
| singleNumber.py | 9 | 0 | 100% | |
| ArrayExercise/Sort_Array_By_Parity | ||||
| SortArrayByParity.py | 11 | 0 | 100% | |
| ArrayExercise/Squares_of_a_Sorted_Array | ||||
| SquaresOfASortedArray.py | 8 | 0 | 100% | |
| ArrayExercise/Two_Sum | ||||
| twoSum.py | 14 | 1 | 1 | 93% |
| MathExercise/Find_Numbers_with_Even_Number_of_Digits | ||||
| FindNumbersWithEvenNumberOfDigits.py | 14 | 0 | 100% | |
| MathExercise/Fizz_Buzz | ||||
| FizzBuzz.py | 16 | 0 | 100% | |
| MathExercise/Power_of_three | ||||
| PowerOfThree.py | 10 | 1 | 1 | 90% |
| MathExercise/Roman_to_Integer | ||||
| RomanToInteger.py | 12 | 0 | 100% | |
| Sorting_and_Searching_Exercise/Check_If_N_and_Its_Double_Exist | ||||
| CheckIfNandItsDoubleExist.py | 16 | 2 | 2 | 88% |
| Sorting_and_Searching_Exercise/Duplicate_Zeros | ||||
| DuplicateZeros.py | 12 | 0 | 100% | |
| Sorting_and_Searching_Exercise/Merge_Sorted_Array | ||||
| MergeSortedArr.py | 8 | 0 | 100% | |
| Sorting_and_Searching_Exercise/Valid_Mountain_Array | ||||
| ValidMountainArray.py | 13 | 1 | 1 | 92% |
| StringExercise/First_Unique_Character_in_a_String | ||||
| FirstUniqueCharacterInAString.py | 8 | 1 | 1 | 88% |
| StringExercise/Reverse_Integer | ||||
| reverseInt.py | 13 | 1 | 1 | 92% |
| StringExercise/Reverse_String | ||||
| reverseString.py | 15 | 0 | 100% | |
| StringExercise/Valid_Anagram | ||||
| anagram.py | 13 | 1 | 1 | 92% |
| StringExercise/Valid_Palindrome | ||||
| palindrom.py | 13 | 8 | 8 | 38% |
| frontendmasters/Complete_Intro_to_Computer_Science/AVLTree | ||||
| avltree.py | 95 | 8 | 8 | 92% |
| frontendmasters/Complete_Intro_to_Computer_Science/BinarySearchTree | ||||
| binarySearchTree.py | 38 | 1 | 1 | 97% |
| frontendmasters/Complete_Intro_to_Computer_Science/BreadthFirstTreeTraversals | ||||
| breadthFirstTreeTraversals.py | 27 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/DepthFirstTreeTraversals | ||||
| depthFirstTreeTraversals.py | 27 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/Graphs | ||||
| graphs.py | 22 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/InsertionSort | ||||
| insertionsort.py | 12 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/Pathfinding | ||||
| pathfinding.py | 49 | 2 | 2 | 96% |
| frontendmasters/Complete_Intro_to_Computer_Science/Tries | ||||
| tries.py | 38 | 1 | 1 | 97% |
| frontendmasters/Complete_Intro_to_Computer_Science/arraylist | ||||
| arraylist.py | 23 | 1 | 1 | 96% |
| frontendmasters/Complete_Intro_to_Computer_Science/binarySearch | ||||
| binarySearch.py | 18 | 1 | 1 | 94% |
| frontendmasters/Complete_Intro_to_Computer_Science/bloomfilters | ||||
| bloomfilters.py | 15 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/bubblesort | ||||
| bubblesort.py | 13 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/heapsort | ||||
| heapsort.py | 26 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/linkedList | ||||
| linkedList.py | 66 | 15 | 15 | 77% |
| frontendmasters/Complete_Intro_to_Computer_Science/mergesort | ||||
| mergeSort.py | 22 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/radixSort | ||||
| radixsort.py | 31 | 0 | 100% | |
| frontendmasters/Complete_Intro_to_Computer_Science/recursion | ||||
| recursionFactorial.py | 8 | 1 | 1 | 88% |
| recursionNestedArray.py | 10 | 0 | 100% | |
| TOTAL | 918 | 47 | 95% | |