Name		Name	Last commit message	Last commit date
Latest commit History 578 Commits
Binary Search		Binary Search
Dynammic Programming		Dynammic Programming
GeeksforGeeks		GeeksforGeeks
Introduction to Java		Introduction to Java
SQL 50		SQL 50
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
100182. Maximum Points After Enemy Battles		100182. Maximum Points After Enemy Battles
1002. Find Common Characters		1002. Find Common Characters
101. Symmetric Tree		101. Symmetric Tree
1023. Camelcase Matching		1023. Camelcase Matching
1023. Camelcase Matching (alternative)		1023. Camelcase Matching (alternative)
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1027. Longest Arithmetic Subsequence		1027. Longest Arithmetic Subsequence
1029. Two City Scheduling		1029. Two City Scheduling
1035. Uncrossed Lines		1035. Uncrossed Lines
1041. Robot Bounded In Circle		1041. Robot Bounded In Circle
1051. Height Checker		1051. Height Checker
1052. Grumpy Bookstore Owner		1052. Grumpy Bookstore Owner
1072. Flip Columns For Maximum Number of Equal Rows		1072. Flip Columns For Maximum Number of Equal Rows
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
1105. Filling Bookcase Shelves		1105. Filling Bookcase Shelves
1106. Parsing A Boolean Expression		1106. Parsing A Boolean Expression
1110. Delete Nodes And Return Forest		1110. Delete Nodes And Return Forest
1122. Relative Sort Array		1122. Relative Sort Array
1128. Number of Equivalent Domino Pairs		1128. Number of Equivalent Domino Pairs
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1143. Longest Common Subsequence		1143. Longest Common Subsequence
1155. Number of Dice Rolls With Target Sum		1155. Number of Dice Rolls With Target Sum
1160. Find Words That Can Be Formed by Characters		1160. Find Words That Can Be Formed by Characters
1161. Maximum Level Sum of a Binary Tree		1161. Maximum Level Sum of a Binary Tree
117. Populating Next Right Pointers in Each Node II		117. Populating Next Right Pointers in Each Node II
1171. Remove Zero Sum Consecutive Nodes from Linked List		1171. Remove Zero Sum Consecutive Nodes from Linked List
1190. Reverse Substrings Between Each Pair of Parentheses		1190. Reverse Substrings Between Each Pair of Parentheses
1207. Unique Number of Occurrences		1207. Unique Number of Occurrences
1208. Get Equal Substrings Within Budget		1208. Get Equal Substrings Within Budget
1218. Longest Arithmetic Subsequence of Given Difference		1218. Longest Arithmetic Subsequence of Given Difference
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1233. Remove Sub-Folders from the Filesystem		1233. Remove Sub-Folders from the Filesystem
1239. Maximum Length of a Concatenated String with Unique Characters		1239. Maximum Length of a Concatenated String with Unique Characters
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1248. Count Number of Nice Subarrays		1248. Count Number of Nice Subarrays
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
1266. Minimum Time Visiting All Points		1266. Minimum Time Visiting All Points
1287. Element Appearing More Than 25% In Sorted Array		1287. Element Appearing More Than 25% In Sorted Array
1289. Minimum Falling Path Sum II		1289. Minimum Falling Path Sum II
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
1291. Sequential Digits		1291. Sequential Digits
131. Palindrome Partitioning		131. Palindrome Partitioning
1325. Delete Leaves With a Given Value		1325. Delete Leaves With a Given Value
1331. Rank Transform of an Array		1331. Rank Transform of an Array
1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance		1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
1342. Number of Steps to Reduce a Number to Zero		1342. Number of Steps to Reduce a Number to Zero
1346. Check If N and Its Double Exist		1346. Check If N and Its Double Exist
1347. Minimum Number of Steps to Make Two Strings Anagram		1347. Minimum Number of Steps to Make Two Strings Anagram
1353. Maximum Number of Events That Can Be Attended		1353. Maximum Number of Events That Can Be Attended
136. Single Number		136. Single Number
1367. Linked List in Binary Tree		1367. Linked List in Binary Tree
138. Copy List with Random Pointer		138. Copy List with Random Pointer
1380. Lucky Numbers in a Matrix		1380. Lucky Numbers in a Matrix
1382. Balance a Binary Search Tree		1382. Balance a Binary Search Tree
139. Word Break		139. Word Break
1395. Count Number of Teams		1395. Count Number of Teams
140. Word Break II		140. Word Break II
1400. Construct K Palindrome Strings		1400. Construct K Palindrome Strings
1404. Number of Steps to Reduce a Number in Binary Representation to One		1404. Number of Steps to Reduce a Number in Binary Representation to One
1408. String Matching in an Array		1408. String Matching in an Array
141. Linked List Cycle		141. Linked List Cycle
1422. Maximum Score After Splitting a String		1422. Maximum Score After Splitting a String
1424. Diagonal Traverse II		1424. Diagonal Traverse II
143. Reorder List		143. Reorder List
1436. Destination City		1436. Destination City
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit		1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
1441. Build an Array With Stack Operations		1441. Build an Array With Stack Operations
1442. Count Triplets That Can Form Two Arrays of Equal XOR		1442. Count Triplets That Can Form Two Arrays of Equal XOR
1448. Count Good Nodes in Binary Tree		1448. Count Good Nodes in Binary Tree
145. Binary Tree Postorder Traversal		145. Binary Tree Postorder Traversal
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence		1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
1457. Pseudo-Palindromic Paths in a Binary Tree		1457. Pseudo-Palindromic Paths in a Binary Tree
146. LRU Cache		146. LRU Cache
1460. Make Two Arrays Equal by Reversing Subarrays		1460. Make Two Arrays Equal by Reversing Subarrays
1464. Maximum Product of Two Elements in an Array		1464. Maximum Product of Two Elements in an Array
147. Insertion Sort List		147. Insertion Sort List
1482. Minimum Number of Days to Make m Bouquets		1482. Minimum Number of Days to Make m Bouquets
1496. Path Crossing		1496. Path Crossing
1497. Check If Array Pairs Are Divisible by k		1497. Check If Array Pairs Are Divisible by k
15. 3Sum		15. 3Sum
1503. Last Moment Before All Ants Fall Out of a Plank		1503. Last Moment Before All Ants Fall Out of a Plank
1508. Range Sum of Sorted Subarray Sums		1508. Range Sum of Sorted Subarray Sums
1509. Minimum Difference Between Largest and Smallest Value in Three Moves		1509. Minimum Difference Between Largest and Smallest Value in Three Moves
1512. Number of Good Pairs		1512. Number of Good Pairs
1514. Path with Maximum Probability		1514. Path with Maximum Probability
1518. Water Bottles		1518. Water Bottles
1530. Number of Good Leaf Nodes Pairs		1530. Number of Good Leaf Nodes Pairs
1531. String Compression II		1531. String Compression II
1535. Find the Winner of an Array Game		1535. Find the Winner of an Array Game
1544. Make The String Great		1544. Make The String Great
1545. Find Kth Bit in Nth Binary String		1545. Find Kth Bit in Nth Binary String
1550. Three Consecutive Odds		1550. Three Consecutive Odds
1552. Magnetic Force Between Two Balls		1552. Magnetic Force Between Two Balls

Folders and files

Latest commit

History

Repository files navigation

DSA-Java

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors