GitHub - Har-12/Coding-Contributions: Leetcode problem solving || #LeetCodeSolutions || This repository contains my solutions to problems from LeetCode, a platform for practicing coding problems and improving algorithmic skills. || LeetCode is a popular platform where developers can practice coding problems across various domains such as algorithms, data structures,

Har-12 / Coding-Contributions Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Leetcode problem solving || #LeetCodeSolutions || This repository contains my solutions to problems from LeetCode, a platform for practicing coding problems and improving algorithmic skills. || LeetCode is a popular platform where developers can practice coding problems across various domains such as algorithms, data structures,

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

About

java programming-language leetcode code interview code-generation interview-questions interview-preparation dsa javadsa

Activity

1 star

1 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 100.0%

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 1,006 Commits
Sorry, we had to truncate this directory to 1,000 files. 3 entries were omitted from the list.
1000. Minimum Cost to Merge Stones		1000. Minimum Cost to Merge Stones
1001. Grid Illumination		1001. Grid Illumination
1002. Find Common Characters		1002. Find Common Characters
1003. Check If Word Is Valid After Substitutions		1003. Check If Word Is Valid After Substitutions
1004. Max Consecutive Ones III		1004. Max Consecutive Ones III
1008. Construct Binary Search Tree from Preorder Traversal		1008. Construct Binary Search Tree from Preorder Traversal
1009. Complement of Base 10 Integer		1009. Complement of Base 10 Integer
101. Symmetric Tree		101. Symmetric Tree
1010. Pairs of Songs With Total Durations Divisible by 60		1010. Pairs of Songs With Total Durations Divisible by 60
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1012. Numbers With Repeated Digits		1012. Numbers With Repeated Digits
1013. Partition Array Into Three Parts With Equal Sum		1013. Partition Array Into Three Parts With Equal Sum
1014. Best Sightseeing Pair		1014. Best Sightseeing Pair
1015. Smallest Integer Divisible by K		1015. Smallest Integer Divisible by K
1016. Binary String With Substrings Representing 1 To N		1016. Binary String With Substrings Representing 1 To N
1017. Convert to Base -2		1017. Convert to Base -2
1018. Binary Prefix Divisible By 5		1018. Binary Prefix Divisible By 5
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
1020. Number of Enclaves		1020. Number of Enclaves
1021. Remove Outermost Parentheses		1021. Remove Outermost Parentheses
1022. Sum of Root To Leaf Binary Numbers		1022. Sum of Root To Leaf Binary Numbers
1023. Camelcase Matching		1023. Camelcase Matching
1024. Video Stitching		1024. Video Stitching
1025. Divisor Game		1025. Divisor Game
1027. Longest Arithmetic Subsequence		1027. Longest Arithmetic Subsequence
1028. Recover a Tree From Preorder Traversal		1028. Recover a Tree From Preorder Traversal
1029. Two City Scheduling		1029. Two City Scheduling
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1030. Matrix Cells in Distance Order		1030. Matrix Cells in Distance Order
1031. Maximum Sum of Two Non-Overlapping Subarrays		1031. Maximum Sum of Two Non-Overlapping Subarrays
1032. Stream of Characters		1032. Stream of Characters
1033. Moving Stones Until Consecutive		1033. Moving Stones Until Consecutive
1034. Coloring A Border		1034. Coloring A Border
1035. Uncrossed Lines		1035. Uncrossed Lines
1036. Escape a Large Maze		1036. Escape a Large Maze
1037. Valid Boomerang		1037. Valid Boomerang
1038. Binary Search Tree to Greater Sum Tree		1038. Binary Search Tree to Greater Sum Tree
1039. Minimum Score Triangulation of Polygon		1039. Minimum Score Triangulation of Polygon
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1040. Moving Stones Until Consecutive II		1040. Moving Stones Until Consecutive II
1041. Robot Bounded In Circle		1041. Robot Bounded In Circle
1042. Flower Planting With No Adjacent		1042. Flower Planting With No Adjacent
1044. Longest Duplicate Substring		1044. Longest Duplicate Substring
1045. Customers Who Bought All Products		1045. Customers Who Bought All Products
1046. Last Stone Weight		1046. Last Stone Weight
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
1048. Longest String Chain		1048. Longest String Chain
1049. Last Stone Weight II		1049. Last Stone Weight II
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
1050. Actors and Directors Who Cooperated At Least Three Times		1050. Actors and Directors Who Cooperated At Least Three Times
1051. Height Checker.java		1051. Height Checker.java
1052. Grumpy Bookstore Owner.java		1052. Grumpy Bookstore Owner.java
1053. Previous Permutation With One Swap.java		1053. Previous Permutation With One Swap.java
1054. Distant Barcodes		1054. Distant Barcodes
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1061. Lexicographically Smallest Equivalent String		1061. Lexicographically Smallest Equivalent String
107. Binary Tree Level Order Traversal II		107. Binary Tree Level Order Traversal II
1070. Product Sales Analysis III.sql		1070. Product Sales Analysis III.sql
1071. Greatest Common Divisor of Strings		1071. Greatest Common Divisor of Strings
1072. Flip Columns For Maximum Number of Equal Rows		1072. Flip Columns For Maximum Number of Equal Rows
1073. Adding Two Negabinary Numbers		1073. Adding Two Negabinary Numbers
1078. Occurrences After Bigram		1078. Occurrences After Bigram
1079. Letter Tile Possibilities		1079. Letter Tile Possibilities
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
1080. Insufficient Nodes in Root to Leaf Paths		1080. Insufficient Nodes in Root to Leaf Paths
1081. Smallest Subsequence of Distinct Characters		1081. Smallest Subsequence of Distinct Characters
1084. Sales Analysis III.sql		1084. Sales Analysis III.sql
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
1090. Largest Values From Labels		1090. Largest Values From Labels
1091. Shortest Path in Binary Matrix		1091. Shortest Path in Binary Matrix
1093. Statistics from a Large Sample		1093. Statistics from a Large Sample
1094. Car Pooling		1094. Car Pooling
1096. Brace Expansion II		1096. Brace Expansion II
110. Balanced Binary Tree		110. Balanced Binary Tree
1103. Distribute Candies to People		1103. Distribute Candies to People
1104. Path In Zigzag Labelled Binary Tree		1104. Path In Zigzag Labelled Binary Tree
1105. Filling Bookcase Shelves		1105. Filling Bookcase Shelves
1106. Parsing A Boolean Expression		1106. Parsing A Boolean Expression
1109. Corporate Flight Bookings		1109. Corporate Flight Bookings
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
1110. Delete Nodes And Return Forest		1110. Delete Nodes And Return Forest
1111. Maximum Nesting Depth of Two Valid Parentheses Strings		1111. Maximum Nesting Depth of Two Valid Parentheses Strings
1115. Print FooBar Alternately		1115. Print FooBar Alternately
1116. Print Zero Even Odd		1116. Print Zero Even Odd
1117. Building H2O		1117. Building H2O
1122. Relative Sort Array		1122. Relative Sort Array
1123. Lowest Common Ancestor of Deepest Leaves		1123. Lowest Common Ancestor of Deepest Leaves
1124. Longest Well-Performing Interval		1124. Longest Well-Performing Interval
1125. Smallest Sufficient Team		1125. Smallest Sufficient Team
1128. Number of Equivalent Domino Pairs		1128. Number of Equivalent Domino Pairs
1129. Shortest Path with Alternating Colors		1129. Shortest Path with Alternating Colors
1130. Minimum Cost Tree From Leaf Values		1130. Minimum Cost Tree From Leaf Values
1138. Alphabet Board Path		1138. Alphabet Board Path
1139. Largest 1-Bordered Square		1139. Largest 1-Bordered Square
1140. Stone Game II		1140. Stone Game II
1144. Decrease Elements To Make Array Zigzag		1144. Decrease Elements To Make Array Zigzag
1145. Binary Tree Coloring Game		1145. Binary Tree Coloring Game
1147. Longest Chunked Palindrome Decomposition		1147. Longest Chunked Palindrome Decomposition
1154. Day of the Year		1154. Day of the Year

Har-12/Coding-Contributions

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages