GitHub - GeniusNirmit/Leetcode-Rundown: This is the repository which contains the solutions of all the Leetcode Problems that I have solved.

Name		Name	Last commit message	Last commit date
Latest commit History 914 Commits
.gitignore		.gitignore
1.) Two Sum.cpp		1.) Two Sum.cpp
100.) Same Tree.cpp		100.) Same Tree.cpp
1002.) Find Common Characters.java		1002.) Find Common Characters.java
1004.) Max Consecutive Ones III.cpp		1004.) Max Consecutive Ones III.cpp
1008.) Construct Binary Search Tree from Preorder Traversal.cpp		1008.) Construct Binary Search Tree from Preorder Traversal.cpp
101.) Symmetric Tree.cpp		101.) Symmetric Tree.cpp
1011.) Capacity To Ship Packages Within D Days.cpp		1011.) Capacity To Ship Packages Within D Days.cpp
1019.) Next Greater Node In Linked List.cpp		1019.) Next Greater Node In Linked List.cpp
102.) Binary Tree Level Order Traversal.cpp		102.) Binary Tree Level Order Traversal.cpp
1020.) Number of Enclaves.cpp		1020.) Number of Enclaves.cpp
1026.) Maximum Difference Between Node and Ancestor.cpp		1026.) Maximum Difference Between Node and Ancestor.cpp
1029.) Two City Scheduling.cpp		1029.) Two City Scheduling.cpp
103.) Binary Tree Zigzag Level Order Traversal.cpp		103.) Binary Tree Zigzag Level Order Traversal.cpp
1033.) Moving Stones Until Consecutive.cpp		1033.) Moving Stones Until Consecutive.cpp
1038.) Binary Search Tree to Greater Sum Tree.cpp		1038.) Binary Search Tree to Greater Sum Tree.cpp
104.) Maximum Depth of Binary Tree.cpp		104.) Maximum Depth of Binary Tree.cpp
1042.) Flower Planting With No Adjacent.cpp		1042.) Flower Planting With No Adjacent.cpp
1043.) Partition Array for Maximum Sum.cpp		1043.) Partition Array for Maximum Sum.cpp
1046.) Last Stone Weight.cpp		1046.) Last Stone Weight.cpp
1047.) Remove All Adjacent Duplicates In String.cpp		1047.) Remove All Adjacent Duplicates In String.cpp
1048.) Longest String Chain.cpp		1048.) Longest String Chain.cpp
105.) Construct Binary Tree from Preorder and Inorder Traversal.cpp		105.) Construct Binary Tree from Preorder and Inorder Traversal.cpp
1051.) Height Checker.java		1051.) Height Checker.java
1052.) Grumpy Bookstore Owner.java		1052.) Grumpy Bookstore Owner.java
106.) Construct Binary Tree from Inorder and Postorder Traversal.cpp		106.) Construct Binary Tree from Inorder and Postorder Traversal.cpp
107.) Binary Tree Level Order Traversal II.cpp		107.) Binary Tree Level Order Traversal II.cpp
1071.) Greatest Common Divisor of Strings.cpp		1071.) Greatest Common Divisor of Strings.cpp
1074.) Number of Submatrices That Sum to Target.cpp		1074.) Number of Submatrices That Sum to Target.cpp
1081.) Smallest Subsequence of Distinct Characters.cpp		1081.) Smallest Subsequence of Distinct Characters.cpp
109.) Convert Sorted List to Binary Search Tree.cpp		109.) Convert Sorted List to Binary Search Tree.cpp
1091.) Shortest Path in Binary Matrix.cpp		1091.) Shortest Path in Binary Matrix.cpp
1092.) Shortest Common Supersequence.cpp		1092.) Shortest Common Supersequence.cpp
1095.) Find in Mountain Array.cpp		1095.) Find in Mountain Array.cpp
11.) Container With Most Water.cpp		11.) Container With Most Water.cpp
110.) Balanced Binary Tree.cpp		110.) Balanced Binary Tree.cpp
1105.) Filling Bookcase Shelves.java		1105.) Filling Bookcase Shelves.java
111.) Minimum Depth of Binary Tree.cpp		111.) Minimum Depth of Binary Tree.cpp
1110.) Delete Nodes And Return Forest.java		1110.) Delete Nodes And Return Forest.java
112.) Path Sum.cpp		112.) Path Sum.cpp
1122.) Relative Sort Array.java		1122.) Relative Sort Array.java
113.) Path Sum II.cpp		113.) Path Sum II.cpp
1137.) N-th Tribonacci Number.cpp		1137.) N-th Tribonacci Number.cpp
114.) Flatten Binary Tree to Linked List.cpp		114.) Flatten Binary Tree to Linked List.cpp
1143.) Longest Common Subsequence.cpp		1143.) Longest Common Subsequence.cpp
1146.) Snapshot Array.cpp		1146.) Snapshot Array.cpp
115.) Distinct Subsequences.cpp		115.) Distinct Subsequences.cpp
1155.) Number of Dice Rolls With Target Sum.cpp		1155.) Number of Dice Rolls With Target Sum.cpp
116.) Populating Next Right Pointers in Each Node.java		116.) Populating Next Right Pointers in Each Node.java
1160.) Find Words That Can Be Formed by Characters.cpp		1160.) Find Words That Can Be Formed by Characters.cpp
1161.) Maximum Level Sum of a Binary Tree.cpp		1161.) Maximum Level Sum of a Binary Tree.cpp
117.) Populating Next Right Pointers in Each Node II.java		117.) Populating Next Right Pointers in Each Node II.java
1171.) Remove Zero Sum Consecutive Nodes from Linked List.cpp		1171.) Remove Zero Sum Consecutive Nodes from Linked List.cpp
118.) Pascals Triangle.cpp		118.) Pascals Triangle.cpp
119.) Pascal's Triangle II.cpp		119.) Pascal's Triangle II.cpp
1190.) Reverse Substrings Between Each Pair of Parentheses.cpp		1190.) Reverse Substrings Between Each Pair of Parentheses.cpp
1192.) Critical Connections in a Network.cpp		1192.) Critical Connections in a Network.cpp
12.) Integer to Roman.cpp		12.) Integer to Roman.cpp
120.) Triangle.cpp		120.) Triangle.cpp
1207.) Unique Number of Occurrences.cpp		1207.) Unique Number of Occurrences.cpp
1208.) Get Equal Substrings Within Budget.cpp		1208.) Get Equal Substrings Within Budget.cpp
121.) Best Time to Buy and Sell Stock.cpp		121.) Best Time to Buy and Sell Stock.cpp
1219.) Path with Maximum Gold.cpp		1219.) Path with Maximum Gold.cpp
122.) Best Time to Buy and Sell Stock II.cpp		122.) Best Time to Buy and Sell Stock II.cpp
1220.) Count Vowels Permutation.cpp		1220.) Count Vowels Permutation.cpp
123.) Best Time to Buy and Sell Stock III.cpp		123.) Best Time to Buy and Sell Stock III.cpp
1232.) Check If It Is a Straight Line.cpp		1232.) Check If It Is a Straight Line.cpp
1235.) Maximum Profit in Job Scheduling.cpp		1235.) Maximum Profit in Job Scheduling.cpp
1239.) Maximum Length of a Concatenated String with Unique Characters.cpp		1239.) Maximum Length of a Concatenated String with Unique Characters.cpp
124.) Binary Tree Maximum Path Sum.cpp		124.) Binary Tree Maximum Path Sum.cpp
1248.) Count Number of Nice Subarrays.cpp		1248.) Count Number of Nice Subarrays.cpp
1249.) Minimum Remove to Make Valid Parentheses.cpp		1249.) Minimum Remove to Make Valid Parentheses.cpp
125.) Valid Palindrome.cpp		125.) Valid Palindrome.cpp
126.) Word Ladder II.cpp		126.) Word Ladder II.cpp
1266.) Minimum Time Visiting All Points.cpp		1266.) Minimum Time Visiting All Points.cpp
127.) Word Ladder.cpp		127.) Word Ladder.cpp
1277.) Count Square Submatrices with All Ones.cpp		1277.) Count Square Submatrices with All Ones.cpp
128.) Longest Consecutive Sequence.cpp		128.) Longest Consecutive Sequence.cpp
1282.) Group the People Given the Group Size They Belong To.cpp		1282.) Group the People Given the Group Size They Belong To.cpp
1287.) Element Appearing More Than 25% In Sorted Array.cpp		1287.) Element Appearing More Than 25% In Sorted Array.cpp
1289.) Minimum Falling Path Sum II.cpp		1289.) Minimum Falling Path Sum II.cpp
129.) Sum Root to Leaf Numbers.cpp		129.) Sum Root to Leaf Numbers.cpp
1291.) Sequential Digits.cpp		1291.) Sequential Digits.cpp
1296.) Divide Array in Sets of K Consecutive Numbers.java		1296.) Divide Array in Sets of K Consecutive Numbers.java
1299.) Replace Elements with Greatest Element on Right Side.cpp		1299.) Replace Elements with Greatest Element on Right Side.cpp
13.) Roman to Integer.java		13.) Roman to Integer.java
130.) Surrounded Regions.cpp		130.) Surrounded Regions.cpp
1302.) Deepest Leaves Sum.cpp		1302.) Deepest Leaves Sum.cpp
131.) Palindrome Partitioning.cpp		131.) Palindrome Partitioning.cpp
1310.) XOR Queries of a Subarray.cpp		1310.) XOR Queries of a Subarray.cpp
1312.) Minimum Insertion Steps to Make a String Palindrome.cpp		1312.) Minimum Insertion Steps to Make a String Palindrome.cpp
1318.) Minimum Flips to Make a OR b Equal to c.cpp		1318.) Minimum Flips to Make a OR b Equal to c.cpp
1319.) Number of Operations to Make Network Connected.cpp		1319.) Number of Operations to Make Network Connected.cpp
132.) Palindrome Partitioning II.cpp		132.) Palindrome Partitioning II.cpp
1323.) Maximum 69 Number.cpp		1323.) Maximum 69 Number.cpp
1325.) Delete Leaves With a Given Value.cpp		1325.) Delete Leaves With a Given Value.cpp
1326.) Minimum Number Of Taps To Open To Water A Garden.cpp		1326.) Minimum Number Of Taps To Open To Water A Garden.cpp
133.) Clone Graph.cpp		133.) Clone Graph.cpp
1334.) Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp		1334.) Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp
1335.) Minimum Difficulty of a Job Schedule.cpp		1335.) Minimum Difficulty of a Job Schedule.cpp

GeniusNirmit/Leetcode-Rundown

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Releases

Packages 0

Contributors 2

Languages

Packages