Welcome to our collaborative repository for practicing LeetCode interview questions!
This repo is designed to help software engineers prepare for technical interviews by providing solutions to popular LeetCode problems. π»π¨βπ»
Below is a curated list of LeetCode problems we're working on. Each problem is linked to its original LeetCode page and marked with its completion status.
- 1. Two Sum
- 15. 3Sum
- 33. Search in Rotated Sorted Array
- 34. Find First and Last Position of Element in Sorted Array
- 55. Jump Game
- 136. Single Number
- 238. Product of Array Except Self
- 283. Move Zeroes
- 344. Reverse String
- 807. Max Increase to Keep City Skyline
- 94. Binary Tree Inorder Traversal
- 104. Maximum Depth of Binary Tree
- 226. Invert Binary Tree
- 617. Merge Two Binary Trees
- 701. Insert into a Binary Search Tree
- Fork this repository
- Choose an uncompleted problem from the list
- Solve the problem and add your solution in the appropriate folder
- Update the README to mark the problem as completed
- Create a pull request with your changes
Please follow these guidelines when submitting solutions:
- Use meaningful variable and function names
- Include comments to explain your thought process
- Provide time and space complexity analysis for your solution
Happy coding and good luck with your interview preparation! ππͺ