DSA Practice - Easy Level (Python)

This repository contains my Data Structures and Algorithms practice problems solved in Python.
All problems are at the Easy level.

---

How to Run

Make sure Python is installed, then run any file directly:

python binary_search.py
python twoSum.py
# etc.

No external libraries needed — pure Python only.

---

Files

File	Topic	Technique
binary_search.py	Binary Search	Divide & Conquer
twoSum.py	Two Sum	HashMap
valid_parantheses.py	Valid Parentheses	Stack
largest ele in arr.py	Largest Element	Linear Scan / Sorting
second largest ele.py	Second Largest Element	Linear Scan
max_ele.py	Max Element	Built-in & Manual
sorted_or_not.py	Check Sorted Array	Linear Scan
reverse.py	Reverse Array	Slicing
left_rotate.py	Left Rotate Array	In-place Shift
remove_duplicates.py	Remove Duplicates	HashSet
merge_two_sorted_arr.py	Merge Sorted Arrays	Two Pointer
linked_list.py	Singly Linked List	Linked List Basics
reverse_a_linked_list.py	Reverse Linked List	In-place Pointer Flip
detect_loop_in_linked_list.py	Detect Cycle in Linked List	Floyd's Algorithm

---

Notes

• Each file includes a # WORKFLOW section at the bottom explaining how the code works step by step.
• Time and Space complexity is mentioned in each workflow.

---

Happy Coding! 🚀

python-dsa-practice

My personal DSA practice journey — easy level problems with step-by-step workflow notes