KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #developer-tools #cli #codex #claude-code #dsh-plugin #mcp #react #agent #dsh #deepseek-harness

Python-Codes

★ 105 Open GitHub ↗

Collection of codes written in Python3. Give a Star if found helpful.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Python-Codes
I have just started writing codes in Python3.
Here I will be keeping every programs written in this language for future reference.
It will also help other begineers as codes complexity will increase from basics to much complex one.

Some Announcements:
<ul>
<li>Here is only python specific data types like lists,dict,tuples...</li>
<li>I have also written codes for Graphs and some other algorithms in Python3 which is in another repo.</li>
 </ul>
[DS_ALGO](https://github.com/sahilrider/DS_ALGO)</t>

## Table of contents
* Basics
  * [Fibonacci](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Fibonacci.Py)
  * [Check Fermat Theorem](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Check-Fermat-Theorem.Py)
  * [Leap Year](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Leap_Year.Py)
  * [GCD](https://github.com/sahilrider/Python-Codes/blob/master/Basics/GCD.Py) and [GCD 2](https://github.com/sahilrider/Python-Codes/blob/master/Basics/GCD2.Py)
  * [Perfect Number](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Perfect_Number.Py)
  * [Prime Check](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Prime_Check.Py)
  * [Prime Range](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Prime_Range.Py)
  * [Time](https://github.com/sahilrider/Python-Codes/blob/master/Basics/Time.Py)
* Class-Example
  * [Circle](https://github.com/sahilrider/Python-Codes/blob/master/Class-Example/Circle.Py)
  * [Kangaroo](https://github.com/sahilrider/Python-Codes/blob/master/Class-Example/Kangaroo.Py)
  * [Time](https://github.com/sahilrider/Python-Codes/blob/master/Class-Example/Time.Py)
* Data Structures
  * [Linked List](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/LinkedList.py)
  * [Find Middle Elem in Linked List](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/MiddleElemList.py)
  * [Find Nth node from End](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/NthNodeFromEnd.py)
  * [Reverse List](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/reverseList.py)
  * [Floyd_Cycle_Detection_Algorithm](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/Floyd_Cycle_Detection_Algorithm.py)
  * [Stack](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/Stack.py)
  * [Get Min from Stack](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/getMin_Stack.py)
  * [Binary Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/BinaryTree.py)
  * [Find MaxVal in Binary Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/FindMax_BT.py)
  * [Mirror of Binary Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/MirrorOfBinaryTree.py)
  * [Size of Binary Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/SizeOfBinaryTree.py)
  * [Search Binary Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/search_BT.py)
  * [Binary Search Tree](https://github.com/sahilrider/Python-Codes/blob/master/Data%20Structures/BST.py)
* Dictionary
  * [Fibonacci Memo](https://github.com/sahilrider/Python-Codes/blob/master/Dictionary/Fibonacci_Memo.Py)
  * [Histogram](https://github.com/sahilrider/Python-Codes/blob/master/Dictionary/Histogram.Py)
  * [Inverse_Dict](https://github.com/sahilrider/Python-Codes/blob/master/Dictionary/Inverse_Dict.Py)
  * [Reverse_Lookup](https://github.com/sahilrider/Python-Codes/blob/master/Dictionary/Reverse_Lookup.Py)
  * [The Captain's Room](https://github.com/sahilrider/Python-Codes/blob/master/Dictionary/The%20Captain's%20Room.Py)
* File 
  * [Avoid Word](https://github.com/sahilrider/Python-Codes/blob/master/File/Avoid_Word.Py)
  * [Is ABCDarian? (Check if letters are in alphabetical order)](https://github.com/sahilrider/Python-Codes/blob/master/File/Is_abecedarian.Py)
  * [Print words without "e"](https://github.com/sahilrider/Python-Codes/blob/master/File/Print_words_without_e.Py)
  * [Uses All (Print word which uses all letters in string)](https://github.com/sahilrider/Python-Codes/blob/master/File/Uses_All.Py)
  * [Uses Only(Prints word containing only letters in string)](https://github.com/sahilrider/Python-Codes/blob/master/File/Uses_Only.Py)
* Interviewbit
  * [Arrays](https://github.com/sahilrider/Python-Codes/blob/master/Interviewbit/Arrays)
  * [Math](https://github.com/sahilrider/Python-Codes/blob/master/Interviewbit/Math)
  * [Binary Search](https://github.com/sahilrider/Python-Codes/tree/master/Interviewbit/BinarySearch)
  * [Bit Manipulation](https://github.com/sahilrider/Python-Codes/blob/master/Interviewbit/BitManipulation)
  * [Strings](https://github.com/sahilrider/Python-Codes/blob/master/Interviewbit/Strings)
  * [Two Pointers](https://github.com/sahilrider/Python-Codes/tree/master/Interviewbit/TwoPointers)
  * [Linked Lists](https://github.com/sahilrider/Python-Codes/tree/master/Interviewbit/LinkedLists)
  * [Stacks and Queues](https://github.com/sahilrider/Python-Codes/tree/master/Interviewbit/StacksnQueues)
* HackerEarth Problems
  * [Addition ain't simple](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Addition-ain't-simple.Py)
  * [Chandu and Consecutive Letters](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Chandu%20and%20Consecutive%20Letters.Py)
  * [Digit Problem](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Digit-Problem.Py)
  * [Dorsplen](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Dorsplen.Py)
  * [Exploring Ruins](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Exploring%20ruins)
  * [Jarvis and Seven Segments](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Jarvis-and-Seven-Segments.Py)
  * [Monk and Lucky Minimum](https://github.com/sahilrider/Python-Codes/blob/master/Hackerearth-Problems/Monk%20and%20Lucky%20Minimum.Py)
* List
   * [Operations](https://github.com/sahilrider/Python-Codes/blob/master/List/Operations.Py)
   *  [Sort on Kth Item](https://github.com/sahilrider/Python-Codes/blob/master/List/Sort%20On%20Kth%20Item.Py)
* NPTEL
   * [Week 2](https://github.com/sahilrider/Python-Codes/blob/master/NPTEL/Week2.Py)
   * [Week 3](https://github.com/sahilrider/Python-Codes/blob/master/NPTEL/Week3.Py)
   * [Week 4](https://github.com/sahilrider/Python-Codes/blob/master/NPTEL/Week4.Py)
* Pattern
  * [Chessboard Grid](https://github.com/sahilrider/Python-Codes/blob/master/Pattern/Chessboard_Grid.Py)
  * [Designer Doormat](https://github.com/sahilrider/Python-Codes/blob/master/Pattern/Designer_DoorMat.Py)
* Recursion
  * [Ackerman](https://github.com/sahilrider/Python-Codes/blob/master/Recurssion/Ackermann.Py)  
  * [Factorial](https://github.com/sahilrider/Python-Codes/blob/master/Recurssion/Factorial.Py)
  * [GCD Euclid](https://github.com/sahilrider/Python-Codes/blob/master/Recurssion/GCD_Euclid.Py)
* Sets
  * [No idea](https://www.hackerrank.com/challenges/no-idea)
* String
  * [Anagram](https://github.com/sahilrider/Python-Codes/blob/master/String/Anagram.Py)
  * [Count Substring in a String](https://github.com/sahilrider/Python-Codes/blob/master/String/Count_String.Py)
  * [Palindrome](https://github.com/sahilrider/Python-Codes/blob/master/String/Palindrome.Py)
  * [Rotate Word](https://github.com/sahilrider/Python-Codes/blob/master/String/Rotate-Word.Py)
* Tuples
  * [Anagram Set](https://github.com/sahilrider/Python-Codes/blob/master/Tuples/Anagram_Set.Py)
  * [Metathesis Pair](https://github.com/sahilrider/Python-Codes/blob/master/Tuples/Metathesis_Pair.Py)
  * [Most Frequent](https://github.com/sahilrider/Python-Codes/blob/master/Tuples/Most_Frequency.Py)
* Turtle
   * [Pattern Branch](https://github.com/sahilrider/Python-Codes/blob/master/Turtle/Pattern-Branch.Py)
   * [Polygon](https://github.com/sahilrider/Python-Codes/blob/master/Turtle/Polygon.Py)
   * [Snowflake (Koch curve)](https://github.com/sahilrider/Python-Codes/blob/master/Turtle/Snowflake-koch-curve.Py)

''Program testing can be used to show the presence of bugs, but never to show
their absence!''
 
 
“The question of whether computers can think is like the question of whether submarines can swim.” 
 
— Edsger W. Dijkstra

Python-Codes

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README