Patching Array
vidyanand kumar
June 08, 2021
Patching Array Given a sorted integer array nums and an integer n , add/patch elements to the array such that any number in the range [1...
Read More
Tuesday 8 June 2021
Friday 27 November 2020
Partition Equal Subset Sum Solution
vidyanand kumar
November 27, 2020
Partition Equal Subset Sum Solution Given a non-empty array nums containing only positive integers , find if the array can be partiti...
Read More
Thursday 17 September 2020
Largest Rectangle in Histogram
vidyanand kumar
September 17, 2020
Largest Rectangle in Histogram Given n non-negative integers representing the histogram's bar height where the width of each bar is...
Read More
Trapping Rain Water
vidyanand kumar
September 17, 2020
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water i...
Read More
Max Points on a Line
vidyanand kumar
September 17, 2020
Max Points on a Line Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Example 1: Inpu...
Read More
Find Median from Data Stream
vidyanand kumar
September 17, 2020
Find Median from Data Stream Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle ...
Read More
Largest Number
vidyanand kumar
September 17, 2020
Largest Number Given a list of non-negative integers, arrange them such that they form the largest number. Example 1: Input: [10,2] Outp...
Read More
Tuesday 15 September 2020
Word Break
vidyanand kumar
September 15, 2020
Word Break Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmen...
Read More
Check If String Is Transformable With Substring Sort Operations
vidyanand kumar
September 15, 2020
Check If String Is Transformable With Substring Sort Operations Given two strings s and t , you want to transform string s into str...
Read More
![Given inorder and postorder traversals of a Binary Tree in the arrays in[] and post[] respectively. The task is to construct the binary tree from these traversals.](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_vJK7GfzzvfGbeeL9UBOY_Wd2XbhdynlmcLVLhVAY-jUh9lzIwWkYNDJUWVCLPibwgJtgaG9eT-4_NOyu98SW_eiY8OIYhSsObMRK8gph4x8G1WesTQhEuCCllXcy6FVSpNFYE3PHpkhQcypDOs1w=w72-h72-p-k-no-nu)
