Data-Structures-And-Algorithms

KO | EN

gitlite — search

#python #golang #android #rust #linux #macos #java #windows #awesome #cli #kubernetes #pytorch #mcp #openai

Data-Structures-And-Algorithms

(★ 14)

Collection of Python solutions for problems for various competitive programming sites

Data-Structures-And-Algorithms Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Data Structures And Algorithms

## Collection of Python solutions for various Data Structures And Algorithms questions.

- [LeetCode](https://leetcode.com/vikasviki489/)
  + PREMIUM
    * [Nested List Weight Sum](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Premium/Nested%20List%20Weight%20Sum.md)
    * [Palindrome Permutation](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Premium/Palindrome%20Permutation.md)
    * [Missing Ranges](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Premium/Missing%20Ranges.md)
    * [Shortest Word Distance](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Premium/Shortest%20Word%20Distance.md)
  + EASY
    * [Flipping an Image](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Flipping%20an%20Image.md)
    * [Binary Tree Tilt](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Binary%20Tree%20Tilt.md)
    * [Minimum Cost to Move Chips to The Same Position](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position.md)
    * [Consecutive Characters](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Consecutive%20Characters.md)
    * [Convert Binary Number in a Linked List to Integer](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer.md)
    * [Summary Ranges](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Summary%20Ranges.md)
    * [Minimum Depth of Binary Tree](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Minimum%20Depth%20of%20Binary%20Tree.md)
    * [Buddy Strings](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Buddy%20Strings.md)
    * [Binary Search](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Binary%20Search.md)
    * [Complement of Base 10 Integer](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Complement%20of%20Base%2010%20Integer.md)
    * [Number of Recent Calls](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Number%20of%20Recent%20Calls.md)
    * [Find the Difference](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Easy/Find%20the%20Difference.md)
  + MEDIUM
    * [Maximum Difference Between Node and Ancestor](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Maximum%20Difference%20Between%20Node%20and%20Ancestor.md)
    * [Add Two Numbers II](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Add%20Two%20Numbers%20II.md)
    * [Minimum Height Trees](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Minimum%20Height%20Trees.md)
    * [Insertion Sort List](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Insertion%20Sort%20List.md)
    * [Number of Longest Increasing Subsequence](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Number%20of%20Longest%20Increasing%20Subsequence.md)
    * [Maximize Distance to Closest Person](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Maximize%20Distance%20to%20Closest%20Person.md)
    * [Linked List Cycle II](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Linked%20List%20Cycle%20II.md)
    * [Champagne Tower](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Champagne%20Tower.md)
    * [Bag of Tokens](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Bag%20of%20Tokens.md)
    * [132 Pattern](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/132%20Pattern.md)
    * [Asteroid Collision](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Asteroid%20Collision.md)
    * [Clone Graph](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Clone%20Graph.md)
    * [Minimum Domino Rotations For Equal Row](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Minimum%20Domino%20Rotations%20For%20Equal%20Row.md)
    * [Repeated DNA Sequences](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Repeated%20DNA%20Sequences.md)
    * [Search A 2D Matrix](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Search%20a%202D%20Matrix.md)
    * [Rotate Array](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Rotate%20Array.md)
    * [House Robber II](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/House%20Robber%20II.md)
    * [Sort List](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Sort%20List.md)
    * [Remove Duplicate Letters](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Remove%20Duplicate%20Letters.md)
    * [Minimum Number of Arrows to Burst Balloons](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons.md)
    * [Rotate List](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Rotate%20List.md)
    * [Insert into Binary Search Tree](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Insert%20into%20a%20Binary%20Search%20Tree.md)
    * [Remove Covered Intervals](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Remove%20Covered%20Intervals.md)
    * [K Diff Pairs in Array](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/K-diff%20Pairs%20in%20an%20Array.md)
    * [Combination Sum](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Combination%20Sum.md)
    * [Word Break](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Word%20Break.md)
    * [Subarray Product Less Than K](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Subarray%20Product%20Less%20Than%20K.md)
    * [Evaluate Division](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Evaluate%20Division.md)
    * [Teemo Attacking](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Teemo%20Attacking.md)
    * [Largest Number](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Largest%20Number.md)
    * [Gas Station](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Gas%20Station.md)
    * [Sequential Digits](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Sequential%20Digits.md)
    * [Car Pooling](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Car%20Pooling.md)
    * [Majority Element II](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Medium/Majority%20Element%20II.md)
  + HARD
    * [Recover Binary Search Tree](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Hard/Recover%20Binary%20Search%20Tree.md)
    * [Stone Game IV](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Hard/Stone%20Game%20IV.md)
    * [Best Time to Buy and Sell Stock IV](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Hard/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV.md)
    * [First Missing Positive](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Hard/First%20Missing%20Positive.md)
    * [Unique Paths III](https://github.com/VikasViki/Competitive_Programming/blob/master/LeetCode/Hard/Unique%20Paths%20III.md)
    
- [InterviewBit](https://www.interviewbit.com/profile/vikasviki)
  + Day 2: Array and Math
    * Assignment
      - [Closest MinMax](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%202:%20Array%20and%20Math/Assignment/Closest%20MinMax)
  + Day 3
    * HomeWork
      - [Alternate positive and negative elements (Using Extra Space)](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day-3/HomeWork/Alternate%20positive%20and%20negative%20elements%20(Using%20Extra%20Space))
  + Day 6
    * Assignment
      - [Greatest Common Divisor](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Assignment/Greatest%20Common%20Divisor)
      - [Delete One](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Assignment/Delete%20one)
      - [Pubg](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Assignment/Pubg)
      - [Divisor Game](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Assignment/Divisor%20Game)
      - [Delete Elements](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Assignment/Delete%20Elements)
    * Homework
      - [Trailing Zeros in Factorial](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Homework/Trailing%20Zeros%20in%20Factorial)
      - [Enumerating GCD](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Homework/Enumerating%20GCD)
      - [A, B and Modulo](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Homework/A%2C%20B%20and%20Modulo)
      - [Consecutive Number Sum](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%206/Homework/Consecutive%20Number%20Sum)
   + Day 8
     * Assignment
       - [Count of divisors for multiple queries](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%208/Assignment/Count%20of%20divisors%20for%20multiple%20queries)
       - [Factorial Array](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%208/Assignment/Factorial%20Array)
     * Homework
       - [Prime Sum](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%208/Homework/Prime%20Sum)
       - [Lucky Numbers](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%208/Homework/Lucky%20Numbers)
       - [Find nth Magic Number](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%208/Homework/Find%20nth%20Magic%20%20Number)
    + Day 17 - Two Pointers
      * Assignment
        - [Count of pairs with the given sum](https://github.com/VikasViki/Competitive_Programming/blob/master/InterviewBit/Day%2017%20:%20Two%20Pointers/Assignment/Count%20of%20pairs%20with%20the%20given%20sum)
        
- [Codechef](https://www.codechef.com/users/vikasviki)
  + Long Challenge's
    * FEB19
      - [HMAPPY2](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Long_Challenge/FEB19/HMAPPY2.py)
      - [CHEFING](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Long_Challenge/FEB19/CHEFING.py)
    * MAR19
      - [CHNUM](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Long_Challenge/MAR19/CHNUM.py)
  + Cook Off's
    * FEB19
      - [TABLET](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Cook-Off/FEB19/TABLET.py)
      - [CHFPARTY](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Cook-Off/FEB19/CHFPARTY.py)
    * MAR19
      - [NBONACCI](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Cook-Off/MAR19/NBONACCI.py)
  + Lunch Time's 
    * FEB19
      - [AVG](https://github.com/VikasViki/Competitive_Programming/blob/master/Codechef/Lunch_Time/FEB19/AVG.py)
  + Practice
    * BEGINNER
    * EASY
    * MEDIUM
    * HARD
    
- Hacker Rank
- [Geeks For Geeks](https://auth.geeksforgeeks.org/user/VikasViki/)
  + SCHOOL
    * [Reverse an Array](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/SCHOOL/Reverse%20an%20Array.py)
    * [Print alternate elements of an array](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/SCHOOL/Print%20alternate%20elements%20of%20an%20array.py)
  + BASIC
    * [Search an Element in an array](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Search%20an%20Element%20in%20an%20array.py)
    * [Rotating an Array](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Rotating%20an%20Array.py)
    * [Sort in specific order](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Sort%20in%20specific%20order.py)
    * [Find second largest element](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Find%20second%20largest%20element.py)
    * [Repeated I.Ds](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Repeated%20I.Ds.py)
    * [Multiply left and right array sum](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Multiply%20left%20and%20right%20array%20sum.py)
    * [Immediate Smaller Element](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Immediate%20Smaller%20Element.py)
    * [Reverse array in groups](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Reverse%20array%20in%20groups.py)
    * [Print an array in Pendulum Arrangement](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Print%20an%20array%20in%20Pendulum%20Arrangement.py)
    * [Transform to prime](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Transform%20to%20prime.py)
    * [Find the closest number](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Find%20the%20closest%20number.py)
    * [Count nodes of linked list](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Count%20nodes%20of%20linked%20list.py)
    * [Product of array elements](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Product%20of%20array%20elements.py)
    * [Start Coding - Python](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Start%20Coding%20-%20Python.py)
    * [Space Seperated - Python](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/BASIC/Space%20Seperated%20-%20Python.py)
  + EASY
    * [Sort an array of 0s, 1s and 2s](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Sort%20an%20array%20of%200s%2C%201s%20and%202s.py)
    * [Chocolate Distribution Problem](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Chocolate%20Distribution%20Problem.py)
    * [Index Of an Extra Element](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Index%20Of%20an%20Extra%20Element.py)
    * [Leaders in an array](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Leaders%20in%20an%20array.py)
    * [SP - Palindrome Family](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/SP%20-%20Palindrome%20Family.py)
    * [Sum of given range](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Sum%20of%20given%20range.py)
    * [Triangular Number](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Triangular%20Number.py)
  + MEDIUM
    * [Excel Sheet | Part - 1](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Excel%20Sheet%20%7C%20Part%20-%201.py)
    * [Sum of bit differences](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Sum%20of%20bit%20differences.py)
    * [Kth smallest element](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Kth%20smallest%20element.py)
    * [Multiply two strings](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Multiply%20two%20strings.py)
    * [Case-specific Sorting of Strings](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Case-specific%20Sorting%20of%20Strings.py)
    * [Find Prime numbers in a range](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Find%20Prime%20numbers%20in%20a%20range.py)
    * [Nearly Sorted Algorithm](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/MEDIUM/Nearly%20Sorted%20Algorithm.py)
    * [Subarray with given sum](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/EASY/Subarray%20with%20given%20sum.py)
  + HARD
    * [Return two prime numbers](https://github.com/VikasViki/Competitive_Programming/blob/master/Geeks%20For%20Geeks/HARD/Return%20two%20prime%20numbers.py)
    
- Hacker Earth

- CodeForces

- Hacker Blocks
  + GENERAL
    * [Rotate Image](https://github.com/VikasViki/Competitive_Programming/blob/master/Hacker%20Blocks/GENERAL/Rotate%20Image)

Data-Structures-And-Algorithms

Data-Structures-And-Algorithms Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Data-Structures-And-Algorithms

Data-Structures-And-Algorithms Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README