Skip to content
/ Leetcode Public

Add your approaches for DSA problems in leetcode , here are mine add yours

License

MIT license
5 stars 3 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

SjxSubham/Leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

98 Commits
.github
.github
 
 
100. same Tree or Identical Tree
100. same Tree or Identical Tree
 
 
101. Symetric Tree
101. Symetric Tree
 
 
1019. Next Greater Node in Linked List
1019. Next Greater Node in Linked List
 
 
102. Binary Tree level Order Traversal
102. Binary Tree level Order Traversal
 
 
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
 
 
110. Blanced Binary Tree
110. Blanced Binary Tree
 
 
113. Path Sum 2
113. Path Sum 2
 
 
114. Flatten Binary Tree to Linked List
114. Flatten Binary Tree to Linked List
 
 
118. Pascal Triangle
118. Pascal Triangle
 
 
134. Gas Station
134. Gas Station
 
 
138. Copy List with random pointer
138. Copy List with random pointer
 
 
144. Binary Tree PreOrder traversal.cpp
144. Binary Tree PreOrder traversal.cpp
 
 
145. Binary tree PostOrder Traversal
145. Binary tree PostOrder Traversal
 
 
15. 3Sum
15. 3Sum
 
 
1512. Number of Good Pairs
1512. Number of Good Pairs
 
 
155. Min Stack
155. Min Stack
 
 
160. Intersection of Two Linked List
160. Intersection of Two Linked List
 
 
1605. Find valid matrix Given Row and Coloumn Sums
1605. Find valid matrix Given Row and Coloumn Sums
 
 
162. Find Peak Element
162. Find Peak Element
 
 
1662. Check if Two String Arrays are Equivalent
1662. Check if Two String Arrays are Equivalent
 
 
1716. Calculate Money in Leetcode bank
1716. Calculate Money in Leetcode bank
 
 
191. Number of 1 Bits
191. Number of 1 Bits
 
 
1963. Minimum number of Swaps to make String Balanced.cpp
1963. Minimum number of Swaps to make String Balanced.cpp
 
 
2009. Minimum number of Operations to Make a Array Continuous.cpp
2009. Minimum number of Operations to Make a Array Continuous.cpp
 
 
2058. Find min and max number between critical Point
2058. Find min and max number between critical Point
 
 
2181. Merge Nodes between two Zeros
2181. Merge Nodes between two Zeros
 
 
2210. count Hills and valleys in an Array
2210. count Hills and valleys in an Array
 
 
225.Implement Stack Using Queues
225.Implement Stack Using Queues
 
 
2251. Number of Flowers in Full Bloom.cpp
2251. Number of Flowers in Full Bloom.cpp
 
 
230. Kth Smallest Element
230. Kth Smallest Element
 
 
232.Implement Queue using Stacks
232.Implement Queue using Stacks
 
 
235. Lowest Common Ancestor of a Binary Search Tree
235. Lowest Common Ancestor of a Binary Search Tree
 
 
236. lowest Common Ancestor of A Binary tree
236. lowest Common Ancestor of A Binary tree
 
 
239. Sliding Window Maximum
239. Sliding Window Maximum
 
 
2583. Kth Largest Sum in a Binary Tree.cpp
2583. Kth Largest Sum in a Binary Tree.cpp
 
 
287. Find The Duplicate number
287. Find The Duplicate number
 
 
3. Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating Characters
 
 
32. Longest Valid Parentheses
32. Longest Valid Parentheses
 
 
338.Counting Bits
338.Counting Bits
 
 
34. Find First and Last Position of Element in Sorted Array
34. Find First and Last Position of Element in Sorted Array
 
 
344. Reverse String.cpp
344. Reverse String.cpp
 
 
35. Search Insert Position
35. Search Insert Position
 
 
389. Find the Difference
389. Find the Difference
 
 
4. Median of Two Sorted Array
4. Median of Two Sorted Array
 
 
42. Trapping Rain Water
42. Trapping Rain Water
 
 
48. Rotate image
48. Rotate image
 
 
543. Diameter of Binary Tree
543. Diameter of Binary Tree
 
 
557. Reverse Words in a String III
557. Reverse Words in a String III
 
 
567. Permutation in String.cpp
567. Permutation in String.cpp
 
 
61. Rotate List
61. Rotate List
 
 
653. Two Sum IV - Input is a BST
653. Two Sum IV - Input is a BST
 
 
70. Climbing Stairs
70. Climbing Stairs
 
 
724. Find Pivot Index
724. Find Pivot Index
 
 
725. Split Linked list in parts
725. Split Linked list in parts
 
 
83. Remove Duplicates from Sorted List
83. Remove Duplicates from Sorted List
 
 
84. Largest Rectangle in Histogram
84. Largest Rectangle in Histogram
 
 
852. peak Index in a Mountain Array
852. peak Index in a Mountain Array
 
 
853. Car Fleet I
853. Car Fleet I
 
 
867. Transpose Matrix
867. Transpose Matrix
 
 
880. Decoded String at Index.cpp
880. Decoded String at Index.cpp
 
 
89. Grey Code
89. Grey Code
 
 
896.Monotonic Array
896.Monotonic Array
 
 
92. Reverse Linked List II
92. Reverse Linked List II
 
 
98. Validate Binary Search Tree
98. Validate Binary Search Tree
 
 
CONTRIBUTING.MD
CONTRIBUTING.MD
 
 
DutchflagAlgo.cpp
DutchflagAlgo.cpp
 
 
FloydCycle.cpp
FloydCycle.cpp
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation

Contributors are most welcome

Here is the answers of LeetCode questions that i have done in my carrier through learning DSA

Leetcode sjx_subham

pure C++
Leetcode Info

About

Add your approaches for DSA problems in leetcode , here are mine add yours

Topics

leetcode hacktoberfest dsa leetcode-cpp hacktoberfest-accepted hacktoberfest2024

Resources

Readme

License

MIT license
Activity

Stars

5 stars

Watchers

0 watching

Forks

3 forks
Report repository

Sponsor this project

Contributors 3

  •  
  •  
  •  

Languages