Skip to content

priyanjalipatel/Leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
.ipynb_checkpoints
.ipynb_checkpoints
 
 
Binary Tree Level Order Traversal.ipynb
Binary Tree Level Order Traversal.ipynb
 
 
100. Same Tree.ipynb
100. Same Tree.ipynb
 
 
104. Maximum Depth of Binary Tree.ipynb
104. Maximum Depth of Binary Tree.ipynb
 
 
20. Valid Parentheses.ipynb
20. Valid Parentheses.ipynb
 
 
21. Merge Two Sorted Lists.ipynb
21. Merge Two Sorted Lists.ipynb
 
 
21. Merge two Sorted Lists.ipynb
21. Merge two Sorted Lists.ipynb
 
 
35. Search Insert Position.ipynb
35. Search Insert Position.ipynb
 
 
39. Combination Sum.ipynb
39. Combination Sum.ipynb
 
 
560. Subarray Sum Equals K.ipynb
560. Subarray Sum Equals K.ipynb
 
 
98. Validate Binary Search Tree.ipynb
98. Validate Binary Search Tree.ipynb
 
 
Add_Two_Numbers.ipynb
Add_Two_Numbers.ipynb
 
 
Bonus_interview_question.ipynb
Bonus_interview_question.ipynb
 
 
Construct Binary Tree from Preorder and Inorder Traversal.ipynb
Construct Binary Tree from Preorder and Inorder Traversal.ipynb
 
 
Contigous_Array.ipynb
Contigous_Array.ipynb
 
 
Half_Pyramid.ipynb
Half_Pyramid.ipynb
 
 
Happy_number.ipynb
Happy_number.ipynb
 
 
Linked_List_cycle.ipynb
Linked_List_cycle.ipynb
 
 
Longest_Substring.ipynb
Longest_Substring.ipynb
 
 
Max69.ipynb
Max69.ipynb
 
 
MaxLength.ipynb
MaxLength.ipynb
 
 
Maximum Average Subarray I.ipynb
Maximum Average Subarray I.ipynb
 
 
Median_two_sorted_arrays.ipynb
Median_two_sorted_arrays.ipynb
 
 
Merge_two_sorted_list.ipynb
Merge_two_sorted_list.ipynb
 
 
No_leetcode_Enter_number.ipynb
No_leetcode_Enter_number.ipynb
 
 
Palindrome.ipynb
Palindrome.ipynb
 
 
Plus_One.ipynb
Plus_One.ipynb
 
 
README.md
README.md
 
 
Range_Sum_Query.ipynb
Range_Sum_Query.ipynb
 
 
Remove Duplicates from Sorted Array.ipynb
Remove Duplicates from Sorted Array.ipynb
 
 
Remove Element.ipynb
Remove Element.ipynb
 
 
Three_Sum.ipynb
Three_Sum.ipynb
 
 
Two_Sum.ipynb
Two_Sum.ipynb
 
 
Word Search.ipynb
Word Search.ipynb
 
 
container.ipynb
container.ipynb
 
 
difference2num_K.ipynb
difference2num_K.ipynb
 
 
imp_median_array.txt
imp_median_array.txt
 
 
longest_Palindrome.ipynb
longest_Palindrome.ipynb
 
 
longest_Palindrome_substring.ipynb
longest_Palindrome_substring.ipynb
 
 
maxProfit.ipynb
maxProfit.ipynb
 
 
reverselist.ipynb
reverselist.ipynb
 
 
sum_less_k.ipynb
sum_less_k.ipynb
 
 

Repository files navigation

LeetCode Practice

This repository contains my solutions to LeetCode problems, written while practicing Data Structures and Algorithms. The goal of this repo is to improve problem-solving skills, understand core DSA patterns, and prepare for technical interviews.

📌 Topics Covered

  • Arrays
  • Strings
  • Linked Lists
  • Stacks & Queues
  • Recursion
  • Hashing
  • Two Pointers
  • Sliding Window
  • Binary Search

🧠 Approach

For each problem, I focus on:

  • Understanding the problem constraints
  • Choosing the optimal data structure
  • Writing clean and readable code
  • Analyzing time and space complexity

Some solutions include:

  • Comments for clarity
  • Alternative approaches when applicable

🗂 Repository Structure


└── README.md

🧪 Example Problem Format

Each problem file typically includes:

  • Problem name & number
  • Brief explanation of the approach
  • Time & space complexity
  • Clean implementation

🚀 Goal

  • Build strong fundamentals in DSA
  • Identify common problem-solving patterns
  • Prepare for coding interviews and online assessments

📈 Progress

Problems are added regularly as I continue practicing.

🔗 Profile

  • LeetCode: [your LeetCode profile link here]

⚠️ Disclaimer

These solutions are for learning and reference purposes. I encourage solving problems independently before referring to solutions.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages