leetcode

KO | EN

gitlite — search

#ai #typescript #llm #golang #go #machine-learning #java #kubernetes #security #pytorch #mcp #ios #openai #open-source

(★ 27)

This Repository Contain LEETCODE Solutions using Golang & Dart Programming language.

leetcode 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# ![image](https://drive.google.com/uc?export=view&id=1IBvuG9l3ThDoDj286r9jPmJV2vaWcNx5)

This 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 and the Fastest Possible Solution in GO Most of the solution.

Exteding  **TypeScript**

## Solutions

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

## Reach me via

[![Gmail](https://img.shields.io/badge/Gmail-D14836?style=for-the-badge&logo=gmail&logoColor=white)](https://ayoubzulfiqar3@gmail.com)

[![GitHub](https://img.shields.io/badge/github-%23121011.svg?style=for-the-badge&logo=github&logoColor=white)](https://github.com/ayoubzulfiqar)

[![LeetCode](https://img.shields.io/badge/LeetCode-000000?style=for-the-badge&logo=LeetCode&logoColor=#d16c06)](https://leetcode.com/ayoubzulfiqar/)

leetcode

leetcode 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

leetcode

leetcode 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README