Skip to content

praTeek271/leetcode_solved-Questions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

66 Commits
_imgs_
_imgs_
 
 
1155. Number of Dice Rolls With Target Sum.md
1155. Number of Dice Rolls With Target Sum.md
 
 
1220. Count Vowels Permutation.md
1220. Count Vowels Permutation.md
 
 
1235. Maximum Profit in Job Scheduling.md
1235. Maximum Profit in Job Scheduling.md
 
 
1424. Diagonal Traverse II.md
1424. Diagonal Traverse II.md
 
 
1441. Build an Array With Stack Operations.md
1441. Build an Array With Stack Operations.md
 
 
1503. Last Moment Before All Ants Fall Out of a Plank.md
1503. Last Moment Before All Ants Fall Out of a Plank.md
 
 
1535. Find the Winner of an Array Game.md
1535. Find the Winner of an Array Game.md
 
 
1637. Widest Vertical Area Between Two Points Containing No Points.md
1637. Widest Vertical Area Between Two Points Containing No Points.md
 
 
1685. Sum of Absolute Differences in a Sorted Array.md
1685. Sum of Absolute Differences in a Sorted Array.md
 
 
1688. Count of Matches in Tournament.md
1688. Count of Matches in Tournament.md
 
 
1743. Restore the Array From Adjacent Pairs.md
1743. Restore the Array From Adjacent Pairs.md
 
 
1758. Minimum Changes To Make Alternating Binary String.md
1758. Minimum Changes To Make Alternating Binary String.md
 
 
1814. Count Nice Pairs in an Array.md
1814. Count Nice Pairs in an Array.md
 
 
1845. Seat Reservation Manager.md
1845. Seat Reservation Manager.md
 
 
1887. Reduction Operations to Make the Array Elements Equal.md
1887. Reduction Operations to Make the Array Elements Equal.md
 
 
191. Number of 1 Bits.md
191. Number of 1 Bits.md
 
 
1913. Maximum Product Difference Between Two Pairs.md
1913. Maximum Product Difference Between Two Pairs.md
 
 
1921. Eliminate Maximum Number of Monsters.md
1921. Eliminate Maximum Number of Monsters.md
 
 
1980. Find Unique Binary String.md
1980. Find Unique Binary String.md
 
 
2125. Number of Laser Beams in a Bank.md
2125. Number of Laser Beams in a Bank.md
 
 
2147. Number of Ways to Divide a Long Corridor.md
2147. Number of Ways to Divide a Long Corridor.md
 
 
2265. Count Nodes Equal to Average of Subtree.md
2265. Count Nodes Equal to Average of Subtree.md
 
 
2353. Design a Food Rating System.md
2353. Design a Food Rating System.md
 
 
2391. Minimum Amount of Time to Collect Garbage.md
2391. Minimum Amount of Time to Collect Garbage.md
 
 
2433. Find The Original Array of Prefix Xor.md
2433. Find The Original Array of Prefix Xor.md
 
 
2610. Convert an Array Into a 2D Array With Conditions.md
2610. Convert an Array Into a 2D Array With Conditions.md
 
 
2642. Design Graph With Shortest Path Calculator.md
2642. Design Graph With Shortest Path Calculator.md
 
 
2706. Buy Two Chocolates.md
2706. Buy Two Chocolates.md
 
 
2870. Minimum Number of Operations to Make Array Empty.md
2870. Minimum Number of Operations to Make Array Empty.md
 
 
300. Longest Increasing Subsequence.md
300. Longest Increasing Subsequence.md
 
 
446. Arithmetic Slices II - Subsequence.md
446. Arithmetic Slices II - Subsequence.md
 
 
455. Assign Cookies.md
455. Assign Cookies.md
 
 
501. Find Mode in Binary Search Tree.md
501. Find Mode in Binary Search Tree.md
 
 
661. Image Smoother.md
661. Image Smoother.md
 
 
872. Leaf-Similar Trees.md
872. Leaf-Similar Trees.md
 
 
91. Decode Ways.md
91. Decode Ways.md
 
 
938. Range Sum of BST.md
938. Range Sum of BST.md
 
 
README.md
README.md
 
 

Repository files navigation

LeetCode Solutions

Welcome to my daily LeetCode problem-solving repository! 🚀 LeetCode Logo

Overview

This repository contains my solutions to various LeetCode problems. I challenge myself to solve at least one problem every day to enhance my problem-solving skills and share my solutions with the community.

Feel free to explore the solutions and provide feedback or alternative solutions. Contributions are also welcome!

How to Use

  1. Navigate to the respective day's folder.
  2. Choose the programming language you are interested in (e.g., Java or Python).
  3. Check out the solution for the specific problem.

Contribution

If you'd like to contribute a solution or improve an existing one:

  1. Fork the repository.
  2. Create a new branch for your feature: git checkout -b feature/new-solution.
  3. Commit your changes: git commit -am 'Add new solution'.
  4. Push to the branch: git push origin feature/new-solution.
  5. Submit a pull request.

Acknowledgments

I appreciate the LeetCode community for providing a platform to sharpen my coding skills.

Happy coding! 🚀

Another Image

Questions ---

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published