{"id":19153226,"url":"https://github.com/ayoubzulfiqar/leetcode","last_synced_at":"2025-05-07T06:26:24.751Z","repository":{"id":61347391,"uuid":"539013865","full_name":"ayoubzulfiqar/leetcode","owner":"ayoubzulfiqar","description":"This Repository Contain LEETCODE Solutions using Golang \u0026 Dart Programming language.","archived":false,"fork":false,"pushed_at":"2025-03-13T09:38:44.000Z","size":1056,"stargazers_count":26,"open_issues_count":0,"forks_count":5,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-19T19:05:30.800Z","etag":null,"topics":["compitative-coding","dart","dart-leetcode","go","go-leetcode","golang","leetcode","leetcode-go","leetcode-golang","leetcode-solution","leetcode-solutions","programming","solutions"],"latest_commit_sha":null,"homepage":"","language":"Dart","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ayoubzulfiqar.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2022-09-20T13:50:34.000Z","updated_at":"2025-03-14T15:56:46.000Z","dependencies_parsed_at":"2025-04-20T14:15:49.127Z","dependency_job_id":null,"html_url":"https://github.com/ayoubzulfiqar/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayoubzulfiqar%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayoubzulfiqar%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayoubzulfiqar%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayoubzulfiqar%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ayoubzulfiqar","download_url":"https://codeload.github.com/ayoubzulfiqar/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252826010,"owners_count":21810029,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["compitative-coding","dart","dart-leetcode","go","go-leetcode","golang","leetcode","leetcode-go","leetcode-golang","leetcode-solution","leetcode-solutions","programming","solutions"],"created_at":"2024-11-09T08:22:21.371Z","updated_at":"2025-05-07T06:26:24.719Z","avatar_url":"https://github.com/ayoubzulfiqar.png","language":"Dart","readme":"# ![image](https://drive.google.com/uc?export=view\u0026id=1dB-zc6mm2gBZQsOPqDWXRFPqDdrtv4d-)\n\nThis repo contain leetcode solution using DART and GO programming language. You can find the Question Instructions in DART file. And I have done multiple Solutions in dart and Best adn the Fastest Possible Solution in GO Most of the solution.\nDescalimer: Becasue of some weird reasons i decided to drop the support for dart. From now on I will implement in **Golang** and **Pyhton**\n\nProbably **Zig** in near future\n\n## Solutions\n\n- [**67.** Add Binary](AddBinary)\n- [**948.** Bag of Tokens](BagOfTokens)\n- [**110.** Balanced Binary Tree](BalancedBinaryTree)\n- [**188.** Best Time to Buy and Sell Stock IV](BestTimeToBuyAndSellStock_IV)\n- [**94.** Binary Tree In Order Traversal](BinaryTreeInOrderTrasversel)\n- [**70.** Climbing Stairs](ClimbingStairs)\n- [**108.** Convert Sorted Array To Binary Search Tree](ConvertSortedArrayToBinarySearchTree)\n- [**609.** Find Duplicate File in System](FindDuplicateFileInSystem)\n- [**2007.** Find Original Array From Double Array](FindOriginalArrayFromDoubledArray)\n- [**28.** Implement str Str](ImplementstrStr)\n- [**58.** Length of Last word](LengthOfLastWord)\n- [**14.** Longest Common Prefix](LongestCommonPrefix)\n- [**104.** Maximum Depth of Binary tree](MaximumDepthOfBinaryTree)\n- [**718.** Maximum Length of Repeated SubArray](MaximumLengthofRepeatedSubarray)\n- [**1383.** Maximum Performance of a Team](MaximumPerformanceofaTeam)\n- [**88.** Merge Sorted Array](MergeSortedArray)\n- [**21.** Merge Two Sorted Lists](MergeTwoSortedLists)\n- [**111.** Minimum Depth of Binary Tree](MinimumDepthofBinaryTree)\n- [**9.** Palindrome Number](PalindromeNumber)\n- [**118.** Pascal's Triangle](Pascal'sTriangle)\n- [**112.** Path Sum](PathSum)\n- [**66.** Plus One](PlusOne)\n- [**1457**. Pseudo-Palindrome Path In A Binary Tree](Pseudo-PalindromicPathsInABinaryTree)\n- [**26.** Remove Duplicates From Sorted Array](RemoveDuplicatesfromSortedArray)\n- [**83.** Remove Duplicates from Sorted List](RemoveDuplicatesfromSortedList)\n- [**27.** Remove Element](RemoveElement)\n- [**557.** Reverse Words In A String III](ReverseWordsInAString_III)\n- [**13.** Roman To Integer](RomanToInteger)\n- [**100.** Same Tree](SameTree)\n- [**35.** Search Insert Position](SearchInsertPosition)\n- [**69.** SqrtX](SqrtX)\n- [**985.** Sum of Even Number After Queries](SumofEvenNumbersAfterQueries)\n- [**101.** Symmetric Tree](SymmetricTree)\n- [**1996.** The Number Of week Character In The Game](TheNumberOfWeekCharactersInTheGame)\n- [**42.** Trapping Rain Water](TrappingRainWater)\n- [**1.** Two Sum](TwoSum)\n- [**393.** UFT-8 Validation](UTF-8Validation)\n- [**20.** Valid Parenthesis](ValidParentheses)\n- [**1680.** Concatenation of Consecutive Binary Numbers](ConcatenationofConsecutiveBinaryNumbers)\n- [**113.** Path Sum II](PathSumII)\n- [**119.** Pascal's Triangle II](Pascal'sTriangle-II)\n- [**622.** Design Circular Queue](DesignCircularQueue)\n- [**990.** Satisfiability of Equality Equations](SatisfiabilityOfEqualityEquations)\n- [**121.** Best Time to Buy and Sell Stock](BestTimeToBuyAndSellStock)\n- [**125.** Valid Palindrome](ValidPalindrome)\n- [**838.** Push Dominoes](PushDominoes)\n- [**136.** Single Number](SingleNumber)\n- [**19.** Remove Nth Node From End of List](RemoveNthNodeFromEndOfList)\n- [**141.** Linked List Cycle](LinkedListCycle)\n- [**144.** Binary Tree PreOrder Traversal](BinaryTreePreorderTraversal)\n- [**145.** Binary Tree PostOrder Traversal](BinaryTreePostorderTraversal)\n- [**157.** Read N Characters Given Read4](ReadNCharactersGivenRead4)\n- [**8160.** Intersection of Two Linked Lists](IntersectionOfTwoLinkedLists)\n- [**163.** Missing Ranges](MissingRanges)\n- [**658.** Find K Closest Elements](FindKClosestElements)\n- [**168.** Excel Sheet Column Title](ExcelSheetColumnTitle)\n- [**169.** Majority Element](MajorityElement)\n- [**218.** The Skyline Problem](TheSkylineProblem)\n- [**170.** Two Sum III - Data Structure Design](TwoSum-III-DataStructureDesign)\n- [**8171.** Excel Sheet Column Number](ExcelSheetColumnNumber)\n- [**91.** Decode Ways](DecodeWays)\n- [**191.** Number of 1 Bits](NumberOf-1-Bits)\n- [**190.** Reverse Bits](ReverseBits)\n- [**202.** Happy Number](HappyNumber)\n- [**1155.** Number of Dice Rolls With Target Sum](NumberOfDiceRollsWithTargetSum)\n- [**203.** Remove Linked List Elements](RemoveLinkedListElements)\n- [**1578.** Minimum Time to Make Rope Colorful](MinimumTimeToMakeRopeColorful)\n- [**205.** Isomorphic Strings](IsomorphicStrings)\n- [**623.** Add One Row to Tree](AddOneRowToTree)\n- [**981.** Time Based Key-Value Store](TimeBasedKeyValueStore)\n- [**732.** My Calendar III](MyCalendar-III)\n- [**206.** Reverse Linked List](ReverseLinkedList)\n- [**217.** Contains Duplicate](ContainsDuplicate)\n- [**219.** Contains Duplicate II](ContainsDuplicate-II)\n- [**225.** Implement Stack using Queues](ImplementStackUsingQueues)\n- [**226.** Invert Binary Tree](InvertBinaryTree)\n- [**228.** Summary Ranges](SummaryRanges)\n- [**231.** Power of Two](PowerOfTwo)\n- [**232.** Implement Queue using Stacks](ImplementQueueUsingStacks)\n- [**16.** 3Sum Closest](3SumClosest)\n- [**653.** Two Sum IV - Input is a BST](TwoSumIV-InputIsABST)\n- [**242.** Valid Anagram](ValidAnagram)\n- [**1328.** Break a Palindrome](BreakAPalindrome)\n- [**234.** Palindrome Linked List](PalindromeLinkedList)\n- [**334.** Increasing Triplet Subsequence](IncreasingTripletSubsequence)\n- [**243.** Shortest Word Distance](ShortestWordDistance)\n- [**976.** Largest Perimeter Triangle](LargestPerimeterTriangle)\n- [**257.** Binary Tree Paths](BinaryTreePaths)\n- [**237.** Delete Node in a Linked List](DeleteNodeInALinkedList)\n- [**247.** Strobo-Grammatic Number](StrobogrammaticNumber)\n- [**252.** Meeting Rooms](MeetingRooms)\n- [**2095.** Delete the Middle Node of a Linked List](DeleteTheMiddleNodeOfALinkedList)\n- [**1531.** String Compression II](StringCompression-II)\n- [**258.** Add Digits](AddDigits)\n- [**1335.** Minimum Difficulty of a Job Schedule](MinimumDifficultyOfAJobSchedule)\n- [**1832.** Check if the Sentence Is Pangram](CheckIfTheSentenceIsPangram)\n- [**38.** Count and Say](CountAndSay)\n- [**692.** Top K Frequent Words](TopKFrequentWords)\n- [**12.** Integer to Roman](IntegerToRoman)\n- [**263.** Ugly Number](UglyNumber)\n- [**76.** Minimum Window Substring](MinimumWindowSubstring)\n- [**645.** Set Mismatch](SetMismatch)\n- [**1239.** Maximum Length of a Concatenated String with Unique Characters](MaximumLengthOfAConcatenatedStringWithUniqueCharacters)\n- [**1662.** Check If Two String Arrays are Equivalent](CheckIfTwoStringArraysAreEquivalent)\n- [**523.** Continuous SubArray Sum](ContinuousSubarraySum)\n- [**835.** Image Overlap](ImageOverlap)\n- [**49.** Group Anagrams](GroupAnagrams)\n- [**2136.** Earliest Possible Day of Full Bloom](EarliestPossibleDayOfFullBloom)\n- [**1293.** Shortest Path in a Grid with Obstacles Elimination](ShortestPathInAGridWithObstaclesElimination)\n- [**766.** Toe-Plitz Matrix](ToeplitzMatrix)\n- [**288.** Missing Number](MissingNumber)\n- [**278.** First Bad Version](FirstBadVersion)\n- [**283.** Move Zeroes](MoveZeroes)\n- [**1706.** Where Will the Ball Fall](WhereWillTheBallFall)\n- [**290.** Word Pattern](WordPattern)\n- [**292.** Nim Game](NimGame)\n- [**303.** Range Sum Query - Immutable](RangeSumQuery-Immutable)\n- [**433.** Minimum Genetic Mutation](MinimumGeneticMutation)\n- [**2131.** Longest Palindrome by Concatenating Two Letter Words](LongestPalindromeByConcatenatingTwoLetterWords)\n- [**345.** Reverse Vowels of a String](ReverseVowelsOfAString)\n- [**151.** Reverse Words in a String](ReverseWordsInAString)\n- [**947.** Most Stones Removed with Same Row or Column](MostStonesRemovedWithSameRowOrColumn)\n- [**222.** Count Complete Tree Nodes](CountCompleteTreeNodes)\n- [**326.** Power of Three](PowerOfThree)\n- [**338.** Counting Bits](CountingBits)\n- [**374.** Guess Number Higher or Lower](GuessNumberHigherOrLower)\n- [**342.** Power of Four](PowerOfFour)\n- [**344.** Reverse String](ReverseString)\n- [**349.** Intersection of Two Arrays](IntersectionOfTwoArrays)\n- [**223.** Rectangle Area](RectangleArea)\n- [**350.** Intersection of Two Arrays II](IntersectionOfTwoArraysII)\n- [**367.** Valid Perfect Square](ValidPerfectSquare)\n- [**383.** Ransom Note](RansomNote)\n- [**587.** Erect the Fence](ErectTheFence)\n- [**387.** First Unique Character in a String](FirstUniqueCharacterInAString)\n- [**389.** Find the Difference](FindTheDifference)\n- [**224.** Basic Calculator](BasicCalculator)\n- [**1926.** Nearest Exit from Entrance in Maze](NearestExitFromEntranceInMaze)\n- [**295.** Find Median from Data Stream](FindMedianFromDataStream)\n- [**279.** Perfect Squares](PerfectSquares)\n- [**36.** Valid Sudoku](ValidSudoku)\n- [**79.** Word Search](WordSearch)\n- [**907.** Sum of Sub-Array Minimums](SumOfSubarrayMinimums)\n- [**1235.** Maximum Profit in Job Scheduling](MaximumProfitInJobScheduling)\n- [**446.** Arithmetic Slices II - Subsequence](ArithmeticSlicesII-Subsequence)\n- [**2225.** Find Players With Zero or One Losses](FindPlayersWithZeroOrOneLosses)\n- [**380.** Insert Delete GetRandom O(1)](InsertDeleteGetRandom-01)\n- [**1207.** Unique Number of Occurrences](UniqueNumberOfOccurrences)\n- [**392.** Is Subsequence](IsSubsequence)\n- [**1704.** Determine if String Halves Are Alike](DetermineIfStringHalvesAreAlike)\n- [**1657.** Determine if Two Strings Are Close](DetermineIfTwoStringsAreClose)\n- [**401.** Binary Watch](BinaryWatch)\n- [**451.** Sort Characters By Frequency](SortCharactersByFrequency)\n- [**2256.** Minimum Average Difference](MinimumAverageDifference)\n- [**876.** Middle of the Linked List](MiddleOfTheLinkedList)\n- [**328.** Odd Even Linked List](OddEvenLinkedList)\n- [**938.** Range Sum of BST](RangeSumOfBST)\n- [**872.** Leaf-Similar Trees](LeafSimilarTrees)\n- [**1026.** Maximum Difference Between Node and Ancestor](MaximumDifferenceBetweenNodeAndAncestor)\n- [**1339.** Maximum Product of Splitted Binary Tree](MaximumProductOfSplittedBinaryTree)\n- [**124.** Binary Tree Maximum Path Sum](BinaryTreeMaximumPathSum)\n- [**931.** Minimum Falling Path Sum](MinimumFallingPathSum)\n- [**198.** House Robber](HouseRobber)\n- [**1143.** Longest Common Subsequence](LongestCommonSubsequence)\n- [**150.** Evaluate Reverse Polish Notation](EvaluateReversePolishNotation)\n- [**739.** Daily Temperatures](DailyTemperatures)\n- [**1971.** Find if Path Exists in Graph](FindIfPathExistsInGraph)\n- [**841.** Keys and Rooms](KeysAndRooms)\n- [**886.** Possible Bipartition](PossibleBipartition)\n- [**980.** Unique Paths III](UniquePathsIII)\n- [**520.** Detect Capital](DetectCapital)\n- [**944.** Delete Columns to Make Sorted](DeleteColumnsToMakeSorted)\n- [**2244.** Minimum Rounds to Complete All Tasks](MinimumRoundsToCompleteAllTasks)\n- [**452.** Minimum Number of Arrows to Burst Balloons](MinimumNumberOfArrowsToBurstBalloons)\n- [**1833.** Maximum Ice Cream Bars](MaximumIceCreamBars)\n- [**149.** Max Points on a Line](MaxPointsOnALine)\n- [**1443.** Minimum Time to Collect All Apples in a Tree](MinimumTimeToCollectAllApplesInATree)\n- [**1519.** Number of Nodes in the Sub-Tree With the Same Label](NumberOfNodesInTheSub-TreeWithTheSameLabel)\n- [**2246.** Longest Path With Different Adjacent Characters](LongestPathWithDifferentAdjacentCharacters)\n- [**1061.** Lexicographically Smallest Equivalent String](LexicographicallySmallestEquivalentString)\n- [**2421.** Number of Good Paths](NumberOfGoodPathss)\n- [**57.** Insert Interval](InsertIntervals)\n- [**926.** Flip String to Monotone Increasing](FlipStringToMonotoneIncreasings)\n- [**918.** Maximum Sum Circular Sub-Array](MaximumSumCircularSubarrays)\n- [**974.** SubArray Sums Divisible by K](SubarraySumsDivisibleByKs)\n- [**491.** Non-decreasing Subsequences](Non-DecreasingSubsequencess)\n- [**93.** Restore IP Addresses](RestoreIPAddresses)\n- [**131.** Palindrome Partitioning](PalindromePartitioning)\n- [**909.** Snakes and Ladders](SnakesAndLadders)\n- [**2359.** Find Closest Node to Given Two Nodes](FindClosestNodeToGivenTwoNodes)\n- [**787.** Cheapest Flights Within K Stops](CheapestFlightsWithinKStops)\n- [**472.** Concatenated Words](ConcatenatedWords)\n- [**352.** Data Stream as Disjoint Intervals](DataStreamAsDisjointIntervals)\n- [**460.** LFU Cache](LFUCache)\n- [**1137.** N-th Tribonacci Number](N-thTribonacciNumber)\n- [**1626.** Best Team With No Conflicts](BestTeamWithNoConflicts)\n- [**1071.** Greatest Common Divisor of Strings](GreatestCommonDivisorOfStrings)\n- [**953.** Verifying an Alien Dictionary](VerifyingAnAlienDictionary)\n- [**6.** Zigzag Conversion](ZigzagConversion)\n- [**1470.** Shuffle the Array](ShuffleTheArray)\n- [**904.** Fruit Into Baskets](FruitIntoBaskets)\n- [**45.** Jump Game II](JumpGameII)\n- [**2306.** Naming a Company](NamingACompany)\n- [**1162.** As Far from Land as Possible](AsFarFromLandAsPossible)\n- [**1129.** Shortest Path with Alternating Colors](ShortestPathWithAlternatingColors)\n- [**2477.** Minimum Fuel Cost to Report to the Capital](MinimumFuelCostToReportToTheCapital)\n- [**1523.** Count Odd Numbers in an Interval Range](CountOddNumbersInAnIntervalRange)\n- [**989.** Add to Array-Form of Integer](AddToArrayFormOfInteger)\n- [**1472.** Design Browser History](DesignBrowserHistory)\n- [**347.** Top K Frequent Elements](TopKFrequentElements)\n- [**837.** New 21 Game](New21Game)\n- [**705.**. Design HashSet](DesignHashSet)\n- [**1396.** Design Underground System](DesignUndergroundSystem)\n- [**2101.** Detonate the Maximum Bombs](DetonateTheMaximumBombs)\n- [**1376.** Time Needed to Inform All Employees](TimeNeededToInformAllEmployees)\n- [**404.** Sum of Left Leaves](SumOfLeftLeaves)\n- [**1232.** Check If It Is a Straight Line](CheckIfItIsAStraightLine)\n- [**405.** Convert a Number to Hexadecimal](ConvertANumberToHexadecimal)\n- [**1502.** Can Make Arithmetic Progression From Sequence](CanMakeArithmeticProgressionFromSequence)\n- [**409.** Longest Palindrome](LongestPalindrome)\n- [**1351.** Count Negative Numbers in a Sorted Matrix](CountNegativeNumbersInASortedMatrix)\n- [**744.** Find Smallest Letter Greater Than Target](FindSmallestLetterGreaterThanTarget)\n- [**1802.** Maximum Value at a Given Index in a Bounded Array](MaximumValueAtAGivenIndexInABoundedArray)\n- [**412.** Fizz Buzz](FizzBuzz)\n- [**414.** Third Maximum Number](ThirdMaximumNumber)\n- [**415.** Add Strings](AddStrings)\n- [**2352.** Equal Row and Column Pairs](EqualRowAndColumnPairs)\n- [**1569.** Number of Ways to Reorder Array to Get Same BST](NumberOfWaysToReorderArrayToGetSameBst)\n- [**1187.** Make Array Strictly Increasing](MakeArrayStrictlyIncreasing)\n- [**1732.** Find the Highest Altitude](FindTheHighestAltitude)\n- [**2090.** K Radius SubArray Averages](KRadiusSubarrayAverages)\n- [**714.** Best Time to Buy and Sell Stock with Transaction Fee](BestTimeToBuyAndSellStockWithTransactionFee)\n- [**1027.** Longest Arithmetic Subsequence](LongestArithmeticSubsequence)\n- [**956.** Tallest Billboard](TallestBillboard)\n- [**864.** Shortest Path to Get All Keys](ShortestPathToGetAllKeys)\n- [**1970.** Last Day Where You Can Still Cross](LastDayWhereYouCanStillCross)\n- [**859.** Buddy Strings](BuddyStrings)\n- [**137.** Single Number II](SingleNumberII)\n- [**1493.** Longest Subarray of 1's After Deleting One Element](LongestSubarrayOf1SAfterDeletingOneElement)\n- [**2024.** Maximize the Confusion of an Exam](MaximizeTheConfusionOfAnExam)\n- [**2551.** Put Marbles in Bags](PutMarblesInBags)\n- [**863.** All Nodes Distance K in Binary Tree](AllNodesDistanceKInBinaryTree)\n- [**207.** Course Schedule](CourseSchedule)\n- [**146.** LRU Cache](LRUCache)\n- [**735.** Asteroid Collision](AsteroidCollision)\n- [**673.** Number of Longest Increasing Subsequence](NumberofLongestIncreasingSubsequence)\n- [**50.** Pow(x, n)](PowOfXN)\n- [**852.** Peak Index in a Mountain Array](PeakIndexInAMountainArray)\n- [**1870.** Minimum Speed to Arrive on Time](MinimumSpeedToArriveOnTime)\n- [**486.** Predict the Winner](PredictTheWinner)\n- [**808.** Soup Servings](SoupServings)\n- [**139.** Word Break](WordBreak)\n- [**95.** Unique Binary Search Trees II](UniqueBinarySearchTreesII)\n- [**74.** Search a 2D Matrix](SearchA2DMatrix)\n- [**2616.** Minimize the Maximum Difference of Pairs](MinimizeTheMaximumDifferenceOfPairs)\n- [**81.** Search in Rotated Sorted Array II](SearchInRotatedSortedArrayII)\n- [**518.** Coin Change II](CoinChangeII)\n- [**2369.** Check if There is a Valid Partition For The Array](CheckIfThereIsAValidPartitionForTheArray)\n- [**86.** Partition List](PartitionList)\n- [**239.** Sliding Window Maximum](SlidingWindowMaximum)\n- [**542.** 01 Matrix](01Matrix)\n- [**1615.** Maximal Network Rank](MaximalNetworkRank)\n- [**1489.** Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](FindCriticalAndPseudoCriticalEdgesInMinimumSpanningTree)\n- [**1203.** Sort Items by Groups Respecting Dependencies](SortItemsByGroupsRespectingDependencies)\n- [**97.** Interleaving String](InterleavingString)\n- [**646.** Maximum Length of Pair Chain](MaximumLengthOfPairChain)\n- [**2483.** Minimum Penalty for a Shop](MinimumPenaltyForAShop)\n- [**2366.** Minimum Replacements to Sort the Array](MinimumReplacementsToSortTheArray)\n- [**138.** Copy List with Random Pointer](CopyListWithRandomPointer)\n- [**725.** Split Linked List in Parts](SplitLinkedListInParts)\n- [**377.** Combination Sum IV](CombinationSumIV)\n- [**1282.** Group the People Given the Group Size They Belong To](GroupThePeopleGivenTheGroupSizeTheyBelongTo)\n- [**1647.** Minimum Deletions to Make Character Frequencies Unique](MinimumDeletionsToMakeCharacterFrequenciesUnique)\n- [**1584.** Min Cost to Connect All Points](MinCostToConnectAllPoints)\n- [**1631.** Path With Minimum Effort](PathWithMinimumEffort)\n- [**1337.** The K Weakest Rows in a Matrix](TheKWeakestRowsInAMatrix)\n- [**1424** Diagonal Traverse II](DiagonalTraverseIi)\n- [**1630.** Arithmetic Subarrays](ArithmeticSubarrays)\n- [**1561.** Maximum Number of Coins You Can Get](MaximumNumberOfCoinsYouCanGet)\n- [**1685.** Sum of Absolute Differences in a Sorted Array](SumOfAbsoluteDifferencesInASortedArray)\n- [**201.** Bitwise AND of Numbers Range](BitwiseAndOfNumbersRange)\n  Desclainmer: Dropping Dart for Python\n- [**8** String to Integer (atoi)](StringToInteger)\n- [**7** Reverse Integer](ReverseInteger)\n\n## Reach me via\n\n[![Gmail](https://img.shields.io/badge/Gmail-D14836?style=for-the-badge\u0026logo=gmail\u0026logoColor=white)](https://ayoubzulfiqar3@gmail.com)\n\n\n[![GitHub](https://img.shields.io/badge/github-%23121011.svg?style=for-the-badge\u0026logo=github\u0026logoColor=white)](https://github.com/ayoubzulfiqar)\n\n[![LeetCode](https://img.shields.io/badge/LeetCode-000000?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=#d16c06)](https://leetcode.com/ayoubzulfiqar/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayoubzulfiqar%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayoubzulfiqar%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayoubzulfiqar%2Fleetcode/lists"}