POTD Solutions

GeeksforGeeks Java Solutions

Daily Problem of the Day solutions — clean Java code for every GFG POTD.

531

Solved

531 problems

#	Title
1	0 - 1 Knapsack Problem
2	2D Difference Array
3	2D Submatrix Sum Queries
4	Activity Selection
5	Add 1 to a Linked List Number
6	Add Binary Strings
7	Add Number Linked Lists
8	Aggressive Cows
9	Alien Dictionary
10	All numbers with specific difference
11	All Subsets Xor Sum
12	All Unique Permutations of an array
13	Allocate Minimum Pages
14	Alternate positive and negative numbers
15	Alternative Sorting
16	Anagram
17	Ancestors in Binary Tree
18	AND In Range
19	Array Duplicates
20	Array to BST
21	Articulation Point - II
22	ASCII Range Sum
23	Assign Mice Holes
24	Balancing Consonants and Vowels Ratio
25	Bellman-Ford
26	BFS of graph
27	Binary Tree to DLL
28	Bitonic Point
29	Boolean Parenthesization
30	Bottom View of Binary Tree
31	Brackets in Matrix Chain Multiplication
32	Bridge edge in a graph
33	BST to greater sum tree
34	BST with Dead End
35	Burning Tree
36	Bus Conductor
37	Bus Ticket Change
38	Candy
39	Case-specific Sorting of Strings
40	Check for BST
41	Check if a String is Subsequence of Other
42	Check if frequencies can be equal
43	Check If two Line segments Intersect
44	Chocolate Distribution Problem
45	Chocolate Pickup II
46	Circle of strings
47	Clone a linked list with next and random pointer
48	Clone an Undirected Graph
49	Clone List with Next and Random
50	Closest Neighbour in BST
51	Closest Three Sum
52	Coin Change (Count Ways)
53	Coin Change (Minimum Coins)
54	Coin Piles
55	Compare two fractions
56	Construct an array from its pair-sum array
57	Construct Binary Tree from Parent Array
58	Construct Tree from Inorder & Preorder
59	Construct Tree from Preorder & Postorder
60	Container With Most Water
61	Count all triplets with given sum in sorted array
62	Count distinct elements in every window
63	Count elements less than or equal to k in a sorted rotated array
64	Count Indices to Balance Even and Odd Sums
65	Count Inversions
66	Count Linked List Nodes
67	Count Numbers Containing Specific Digits
68	Count of distinct substrings
69	Count pairs Sum in matrices
70	Count Pairs whose sum is less than target
71	Count pairs with given sum
72	Count Reverse Pairs
73	Count set bits
74	Count Smaller elements
75	Count Subarray with k odds
76	Count Subarrays with given XOR
77	Count Subset With Target Sum II
78	Count the Coprimes
79	Count the number of possible triangles
80	Count the paths
81	Count Unique Vowel Strings
82	Count ways to N'th Stair(Order does not matter)
83	Count X in Range of a Sorted Array
84	Counting elements in two arrays
85	Course Schedule II
86	Coverage of all Zeros in a Binary Matrix
87	Cutting Binary String
88	Decode the string
89	Delete Alternate Nodes
90	Delete node in Doubly Linked List
91	Deletion and Reverse in Circular Linked List
92	Design MinMax Queue
93	Detect Loop in linked list
94	DFS of Graph
95	Diameter of a Binary Tree
96	Dice throw
97	Difference Check
98	Dijkstra Algorithm
99	Directed Graph Cycle
100	Distance of nearest cell having 1
101	Distribute Candies
102	Divisible by 13
103	Duplicate Subtrees
104	Edit Distance
105	Elements in range [a, b]
106	Equalize the Towers
107	Equilibrium Point
108	Evaluation of Postfix Expression
109	Exactly one swap
110	Expression Add Operators
111	Expression contains redundant bracket or not
112	Extract the Number from the String
113	Facing the sun
114	Farthest Smaller Right
115	Find all possible palindromic partitions of a String
116	Find All Triplets with Zero Sum
117	Find H-Index
118	Find K Smallest Sum Pairs
119	Find Kth Rotation
120	Find length of Loop
121	Find maximum volume of a cuboid
122	Find median in a stream
123	Find Only Repetitive Element from 1 to n-1
124	Find rectangle with corners as 1
125	Find the closest pair from two arrays
126	Find the first node of loop in linked list
127	Find the longest string
128	Find the number of islands
129	Find the Sum of Last N nodes of the Linked List
130	Fixing Two nodes of a BST
131	Flattening a Linked List
132	Flood fill Algorithm
133	Floyd Warshall
134	Form a palindrome
135	Form the Largest Number
136	Frog Jump
137	Game of XOR
138	Game with String
139	Gas Station
140	Generate all binary strings
141	Generate Binary Numbers
142	Generate IP Addresses
143	Generate Permutations of an array
144	Get Min from Stack
145	Get Minimum Squares
146	Gold Mine Problem
147	Graph Diameter
148	Group Balls by Sequence
149	Happiest Triplet
150	Height of Binary Tree
151	Histogram Max Rectangular Area
152	Identical Linked Lists
153	Implement Atoi
154	Implement k Queues in a Single Array
155	Implement Pow
156	Implement Trie
157	Indexes of Subarray Sum
158	Inorder Traversal
159	Insert in Sorted Circular Linked List
160	Insert in Sorted way in a Sorted DLL
161	Insert Interval
162	Integral Points Inside Triangle
163	Interleave the First Half of the Queue with Second Half
164	Interleaved Strings
165	Intersection in Y Shaped Lists
166	Intersection of Two arrays with Duplicate Elements
167	Intersection Point in Y Shaped Linked Lists
168	Is Binary Tree Heap
169	Is Linked List Length Even
170	Job Sequencing Problem
171	Josephus problem
172	K closest elements
173	K Closest Points to Origin
174	K closest Values
175	k largest elements
176	K Sized Subarray Maximum
177	K Sum Paths
178	K-Pangrams
179	K-th element of two Arrays
180	K-th Largest Sum Contiguous Subarray
181	k-th Smallest in BST
182	Kadane's Algorithm
183	Koko Eating Bananas
184	Kth distance
185	Kth element in Matrix
186	Kth Missing Positive Number in a Sorted Array
187	Kth Smallest
188	Kth Smallest Number in Multiplication Table
189	Largest BST
190	Largest Divisible Subset
191	Largest number in K swaps
192	Largest number in one swap
193	Largest Pair Sum
194	Largest square formed in a matrix
195	Largest subarray of 0's and 1's
196	Last Moment Before All Ants Fall Out
197	LCM Triplet
198	LCS of three strings
199	Left Rotate Matrix K times
200	Left View of Binary Tree
201	Length of Longest Cycle in a Graph
202	Level Order in spiral form
203	Level order traversal
204	Lexicographically Largest String After Deleting K Characters
205	Linked List Group Reverse
206	Linked List Matrix
207	Linked list of strings forms a palindrome
208	Longest alternating subsequence
209	Longest Bounded-Difference Subarray
210	Longest Common Increasing Subsequence
211	Longest Common Prefix of Strings
212	Longest Common Subsequence
213	Longest Common Substring
214	Longest Consecutive Subsequence
215	Longest Increasing Subsequence
216	Longest Palindrome in a String
217	Longest Palindromic Subsequence
218	Longest Periodic Proper Prefix
219	Longest Prefix Suffix
220	Longest Span in two Binary Arrays
221	Longest String Chain
222	Longest Subarray Length
223	Longest subarray with Atmost two distinct integers
224	Longest Subarray with Majority Greater than K
225	Longest Subarray with Sum K
226	Longest substring with distinct characters
227	Longest Substring with K Uniques
228	Longest valid Parentheses
229	Look and Say Pattern
230	Lowest Common Ancestor in a BST
231	LRU Cache
232	Majority Element
233	Majority Element II
234	Majority Vote
235	Make array elements unique
236	Make Binary Tree From Linked List
237	Make Matrix Beautiful
238	Make Strings Equal
239	Matrix Chain Multiplication
240	Max Circular Subarray Sum
241	Max DAG Edges
242	Max distance between same elements
243	Max min Height
244	Max of min for every window size
245	Max rectangle
246	Max Score from Subarray Mins
247	Max sum in the configuration
248	Max Sum Increasing Subsequence
249	Max sum path in two arrays
250	Max Sum Subarray of size K
251	Max Xor Subarray of size K
252	Maximise String Score
253	Maximize Array Value After Rearrangement
254	Maximize median after doing k addition operation
255	Maximize Number of 1's
256	Maximize partitions in a String
257	Maximize The Cut Segments
258	Maximize the minimum difference between k elements
259	Maximum Connected group
260	Maximum Difference
261	Maximum Non-Adjacent Nodes Sum
262	Maximum Non-Overlapping Odd Palindrome Sum
263	Maximum number of overlapping Intervals
264	Maximum of minimum for every window size
265	Maximum path sum
266	Maximum path sum from any node
267	Maximum People Visible in a Line
268	Maximum Product Subarray
269	Maximum product subset of an array
270	Maximum Stone Removal
271	Maximum subarray sum 2
272	Maximum Sum Combination
273	Maximum sum of elements not part of LIS
274	Maximum sum of Non-adjacent nodes
275	Maximum sum Rectangle
276	Maximum XOR of two numbers in an array
277	Median in a row-wise sorted Matrix
278	Median of BST
279	Median of two sorted arrays
280	Meeting Rooms
281	Meeting Rooms III
282	Merge K sorted linked lists
283	Merge Sort for Linked List
284	Merge two BST 's
285	Merge two sorted linked lists
286	Merge Without Extra Space
287	Middle of a Linked List
288	Min Add to Make Parentheses Valid
289	Min Chars to Add for Palindrome
290	Min Cost Climbing Stairs
291	Minimal Cost
292	Minimize the Heights I
293	Minimize the Heights II
294	Minimum Cost of ropes
295	Minimum Cost Path
296	Minimum cost to connect all houses in a city
297	Minimum Cost to cut a board into squares
298	Minimum Cost to Cut a Stick of length N
299	Minimum Cost to Merge Stones
300	Minimum days to make M bouquets
301	Minimum Deletions
302	Minimum Jumps
303	Minimum K Consecutive Bit Flips
304	Minimum number of deletions and insertions
305	Minimum Number of Workers
306	Minimum Operations to Connect Hospitals
307	Minimum Platforms
308	Minimum repeat to make substring
309	Minimum Steps to Halve Sum
310	Minimum sum
311	Minimum Weight Cycle
312	Minimum Window Subsequence
313	Mirror Tree
314	Missing And Repeating
315	Missing Element in Range
316	Missing element of AP
317	Missing in Array
318	Mobile numeric keypad
319	Modify the Array
320	Move All Zeroes to End
321	Multiply two linked lists
322	Multiply two strings
323	N meetings in one room
324	N-Queen Problem
325	nCr
326	Nearest multiple of 10
327	Nearly sorted
328	Next element with greater frequency
329	Next Greater Element
330	Next Greater Element in Circular Array
331	Next Permutation
332	Nine Divisors
333	Non Repeating Character
334	Non-overlapping Intervals
335	Not a subset sum
336	Nth Natural Number
337	Number of BST From Array
338	Number of distinct subsequences
339	Number of occurrence
340	Number of pairs
341	Number of paths in a matrix with k coins
342	Number of Rectangles in a Circle
343	Number of Ways to Arrive at Destination
344	Occurence of an integer in a Linked List
345	Optimal binary search tree
346	Optimal Strategy For A Game
347	Overlapping Intervals
348	Pair Sum in BST
349	Pair with given sum in a sorted array
350	Pairs with difference k
351	Palindrome Linked List
352	Palindrome Sentence
353	Palindrome SubStrings
354	Parenthesis Checker
355	Partition Equal Subset Sum
356	Pascal Triangle
357	Path With Minimum Effort
358	Peak element
359	Permutations of a String
360	Police and Thieves
361	Populate Inorder Successor for all nodes
362	Possible Words From Phone Digits
363	Postfix Evaluation
364	Postorder Traversal
365	Power of k in factorial of n
366	Powerful Integer
367	Predecessor and Successor
368	Prime List
369	Prime Pair with Target Sum
370	Print Anagrams Together
371	Print Bracket Number
372	Print leaf nodes from preorder traversal of BST
373	Product array puzzle
374	Pythagorean Triplet
375	Queue Reversal
376	Quick Sort on Linked List
377	Rat in a Maze
378	Rat in a Maze Problem - I
379	Remaining String
380	Remove all occurences of duplicates in a linked list
381	Remove BST keys outside given range
382	Remove Duplicates
383	Remove duplicates in array
384	Remove Half Nodes
385	Remove loop in Linked List
386	Remove the balls
387	Reorganize The Array
388	Replace O's with X's
389	Reverse a Doubly Linked List
390	Reverse a linked list
391	Reverse an Array
392	Reverse Words
393	Roman Number to Integer
394	Roof Top
395	Root to leaf path sum
396	Root to Leaf Paths
397	Root to leaf paths sum
398	Rotate a Linked List
399	Rotate and delete
400	Rotate Array
401	Rotate by 90 degree
402	Rotate Deque By K
403	Rotten Oranges
404	Row with max 1s
405	Safe States
406	Search in a Row-Column sorted matrix
407	Search in a row-wise sorted matrix
408	Search in a sorted Matrix
409	Search in an almost Sorted Array
410	Search in fully rotated sorted 2D matrix
411	Search in Rotated Sorted Array
412	Search insert position of K in a sorted array
413	Search Pattern (KMP-Algorithm)
414	Search Pattern (Rabin-Karp Algorithm)
415	Second Best Minimum Spanning Tree
416	Second Largest
417	Segregate 0s and 1s
418	Serialize and deserialize a binary tree
419	Set Matrix Zeroes
420	Set Matrix Zeros
421	Shop in Candy Store
422	Shortest Common Supersequence
423	Shortest Cycle
424	Shortest path in Undirected Graph
425	Shortest Path in Weighted undirected graph
426	Shortest Path Using Atmost One Curved Edge
427	Single Number
428	Smallest distinct window
429	Smallest Divisor
430	Smallest number
431	Smallest Positive Missing
432	Smallest Positive Missing Number
433	Smallest range in K lists
434	Smallest window containing all characters
435	Smallest window in a string containing all the characters of another string
436	Solve the Sudoku
437	Sort 0s, 1s and 2s
438	Sort a k sorted doubly linked list
439	Sort a linked list of 0s, 1s and 2s
440	Sort by Absolute Difference
441	Sort in specific order
442	Sort the given array after applying the given equation
443	Sorted and Rotated Minimum
444	Sorted subsequence of size 3
445	Sorting Elements of an Array by Frequency
446	Spirally traversing a matrix
447	Split an array into two equal Sum subarrays
448	Split array in three equal sum subarrays
449	Split Array Largest Sum
450	Split Array Subsequences
451	Split Linked List Alternatingly
452	Split the Array
453	Square root of a number
454	Stickler Thief
455	Stickler Thief II
456	Stock Buy and Sell – Max 2 Transactions Allowed
457	Stock Buy and Sell – Max K Transactions Allowed
458	Stock Buy and Sell – Max one Transaction Allowed
459	Stock Buy and Sell – Multiple Transaction Allowed
460	Stock Buy and Sell with Cooldown
461	Stock span problem
462	Stream First Non-repeating
463	String stack
464	Strings Rotations of Each Other
465	Sub-arrays with equal number of occurences
466	Subarray range with given sum
467	Subarrays With At Most K Distinct Integers
468	Subarrays with First Element Minimum
469	Subarrays with sum K
470	Subset Sum Problem
471	Subset XOR
472	Substrings of length k with k-1 distinct elements
473	Substrings with K Distinct
474	Substrings with same first and last characters
475	Sum of all substrings of a number
476	Sum of Mode
477	Sum of Nodes in BST Range
478	Sum of nodes on the longest path
479	Sum of subarray minimum
480	Sum of subarray minimums
481	Sum of subarray ranges
482	Sum of Subarrays
483	Sum Pair closest to target
484	Sum Tree
485	Sum-string
486	Summed Matrix
487	Swap and Maximize
488	Swap diagonals
489	Swap Kth nodes from ends
490	Symmetric Tree
491	The Celebrity Problem
492	The Knight's tour problem
493	The Painter's Partition Problem-II
494	The Palindrome Pattern
495	Toeplitz matrix
496	Top K Frequent in Array
497	Top View of Binary Tree
498	Topological sort
499	Total count
500	Total Decoding Messages
501	Trail of ones
502	Transpose of Matrix
503	Trapping Rain Water
504	Travelling Salesman Problem
505	Tree Boundary Traversal
506	Triplet Family
507	Two Smallests in Every Subarray
508	Two Sum - Pair with Given Sum
509	Two Swaps
510	Tywin's War Strategy
511	Undirected Graph Cycle
512	Union of Arrays with Duplicates
513	Union of Two Sorted Arrays with Distinct Elements
514	Unique K-Number Sum
515	Unique Number I
516	Unique Number II
517	Unique Number III
518	Unique Paths in a Grid
519	Validate an IP Address
520	Vertical Tree Traversal
521	Vertical Width of a Binary Tree
522	Walls Coloring II
523	Ways to Reach the n'th Stair
524	Ways To Tile A Floor
525	Weighted Job Scheduling
526	Wildcard Pattern Matching
527	Word Break
528	Word Search
529	XOR Linked List
530	XOR Pairs less than K
531	ZigZag Tree Traversal