This repository is part of my personal Python learning journey, created to help beginners understand Python from the ground up. Whether you're just starting or revising core concepts, this repo is packed with helpful examples, exercises, and mini-projects.
🧠 Inspired by continuous practice and real-world application.
Tip
Welcome to Learn Python Language Read, Practice, Code!
- Python Setup & Installation
- Introduction to Python
- Operators in Python
- Variables & Data Types
- String in Python
- Lists in Python
- Tuples in Python
- Set in Python
- Dictionary in Python
- Conditional Statements in Python
- Loops in Python
- Function in Python
- Recursion in Python
- File Input and Output (I/O) in Python
- OOPS in Python
- Inprotant Questions
- Conditional Statements & Loops Questions
- Interview Questions
- Project
- Setup VScode
Data Structures and Algorithms (DSA) using Python. Ideal for beginners, and self-taught developers preparing for coding interviews.
- 🟢 Beginner
- 🟡 Intermediate
- 🔴 Advanced
- Reverse an array
- Find the maximum/minimum element
- Remove duplicates from a list
- Rotate array by k positions
- Check if a string is a palindrome
- Count vowels and consonants
- Implement Python’s
split()manually
- Prime number check
- GCD and LCM of two numbers
- Factorial using recursion
- Fibonacci series
- Palindromic number check
- Linear search
- Binary search
- Bubble sort
- Selection sort
- Insertion sort
- Reverse a linked list
- Detect a cycle in a linked list
- Merge two sorted linked lists
- Find middle of linked list
- Implement stack using list or deque
- Valid parentheses (LeetCode #20)
- Implement queue using two stacks
- Next Greater Element (LeetCode #496)
- Two Sum problem (LeetCode #1)
- Group anagrams (LeetCode #49)
- Longest substring without repeating characters
- Generate all subsets of a list
- Permutations of a list
- Sudoku solver
- N-Queens problem
- Inorder, Preorder, Postorder traversal
- Check if a tree is balanced
- Lowest common ancestor
- Serialize and deserialize a tree
- Kth largest element (LeetCode #215)
- Merge k sorted arrays
- Top K frequent elements
- BFS and DFS traversal
- Detect cycle in a graph
- Dijkstra's algorithm
- Topological sorting
- 0/1 Knapsack
- Longest Common Subsequence
- Longest Increasing Subsequence
- Coin Change problem
| Sheet | Type | Link |
|---|---|---|
| Striver's SDE Sheet | Interview-focused | takeuforward.org |
| Love Babbar’s 450 DSA Sheet | Comprehensive | 450dsa.com |
| Fraz’s 200 DSA Sheet | LeetCode focused | GitHub |
| LeetCode Top 100 | Must-do | LeetCode |
| GFG DSA Sheet | Topic-wise | GFG |
-
Clone the repository:
git clone https://github.com/codewithdhruba01/Learn-python-language.git
-
Navigate to any topic folder.
-
Run
.pyfiles to understand the concept. -
Edit and experiment on your own for better learning.
⭐ If you like this repo, star it on GitHub — it helps a lot!
