Skip to content

loisekk/LEET.CODES

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

52 Commits
01_Twosum.py
01_Twosum.py
 
 
1732. Find the Highest Altitude.py
1732. Find the Highest Altitude.py
 
 
1979. Find Greatest Common Divisor of Array.py
1979. Find Greatest Common Divisor of Array.py
 
 
2000. Reverse Prefix of Word.py
2000. Reverse Prefix of Word.py
 
 
2037. Minimum Number of Moves to Seat Everyone.py
2037. Minimum Number of Moves to Seat Everyone.py
 
 
2042. Check if Numbers Are Ascending in a Sentence.py
2042. Check if Numbers Are Ascending in a Sentence.py
 
 
2057. Smallest Index With Equal Value.py
2057. Smallest Index With Equal Value.py
 
 
2068. Check Whether Two Strings are Almost Equivalent.py
2068. Check Whether Two Strings are Almost Equivalent.py
 
 
2078. Two Furthest Houses With Different Colors.py
2078. Two Furthest Houses With Different Colors.py
 
 
2124. Check if All A's Appears Before All B's.py
2124. Check if All A's Appears Before All B's.py
 
 
2154. Keep Multiplying Found Values by Two.py
2154. Keep Multiplying Found Values by Two.py
 
 
2160. Minimum Sum of Four Digit Number After Splitting Digits.py
2160. Minimum Sum of Four Digit Number After Splitting Digits.py
 
 
2164. Sort Even and Odd Indices Independently.py
2164. Sort Even and Odd Indices Independently.py
 
 
2169. Count Operations to Obtain Zero.py
2169. Count Operations to Obtain Zero.py
 
 
2176. Count Equal and Divisible Pairs in an Array.py
2176. Count Equal and Divisible Pairs in an Array.py
 
 
2206_Divide_Array_Into_Equal_Pairs.py
2206_Divide_Array_Into_Equal_Pairs.py
 
 
2210. Count Hills and Valleys in an Array.py
2210. Count Hills and Valleys in an Array.py
 
 
2259. Remove Digit From Number to Maximize Result.py
2259. Remove Digit From Number to Maximize Result.py
 
 
2264. Largest 3-Same-Digit Number in String.py
2264. Largest 3-Same-Digit Number in String.py
 
 
2273. Find Resultant Array After Removing Anagrams.py
2273. Find Resultant Array After Removing Anagrams.py
 
 
2278. Percentage of Letter in String.py
2278. Percentage of Letter in String.py
 
 
2283. Check if Number Has Equal Digit Count and Digit Value.py
2283. Check if Number Has Equal Digit Count and Digit Value.py
 
 
2287. Rearrange Characters to Make Target String.py
2287. Rearrange Characters to Make Target String.py
 
 
2293. Min Max Game.py
2293. Min Max Game.py
 
 
2299. Strong Password Checker II.py
2299. Strong Password Checker II.py
 
 
2309. Greatest English Letter in Upper and Lower Case.py
2309. Greatest English Letter in Upper and Lower Case.py
 
 
2315. Count Asterisks.py
2315. Count Asterisks.py
 
 
2341. Maximum Number of Pairs in Array.py
2341. Maximum Number of Pairs in Array.py
 
 
2357. Make Array Zero by Subtracting Equal Amounts.py
2357. Make Array Zero by Subtracting Equal Amounts.py
 
 
2399. Check Distances Between Same Letters.py
2399. Check Distances Between Same Letters.py
 
 
Day01_TwoSum.py
Day01_TwoSum.py
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation

🚀 LeetCode Problem Solving Journey

Consistency • Problem Solving • Growth

👋 About This Repository

This repository represents my LeetCode problem-solving journey, focused on building strong fundamentals in Data Structures & Algorithms through consistent practice.

Instead of explaining every individual problem, this repo reflects my learning mindset, discipline, and continuous improvement as a B.Tech student preparing for software engineering roles.

🎯 Goals & Focus

  • Strengthen logical and analytical thinking
  • Identify and apply common DSA patterns
  • Write clean, efficient, and readable code
  • Build consistency through daily practice
  • Track long-term growth publicly

🛠️ Tech Stack

  • Language: Python
  • Platform: LeetCode
  • Concepts: Arrays, Strings, Hashing, Two Pointers, Greedy, Math, and more

📈 Journey Highlights

  • Problems solved across Easy → Medium difficulty
  • Focus on optimized solutions over brute force
  • Emphasis on clarity, correctness, and simplicity
  • Learning through solving, reviewing, and refining

⚡ Minimal Summary (Recruiter View)

  • 📌 Purpose: Consistent LeetCode problem solving to master DSA
  • 🧠 Skills: Logical thinking, pattern recognition, optimization
  • 🛠️ Tools: Python, LeetCode
  • 📈 Outcome: Strong problem-solving foundation for SDE roles

👤 Author

Yash Brahmankar
B.Tech Student | Aspiring Software Engineer

  • 📂 GitHub: This repository
  • 💻 LeetCode: Active problem solver

📄 License

This repository is licensed under the MIT License.
You are free to use, modify, and share the code with proper attribution.

⭐ If this repository adds value or inspires consistency, consider starring it.

Small progress every day leads to big results.

About

No description, website, or topics provided.

Resources

Readme

License

MIT license
Activity

Stars

2 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages