This video explains a very important programming interview question which is ti find the smallest number after removing K digits from a given number. This is a very interesting and also a very important question. At first glace, it might seem easy but it has many special cases. I have first explained the possible cases and then the intuition for solving this problem. This can be solved very easily using a stack. At the end of the video, i have explained the
CODE and shown some more special cases and how to handle them. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: gist.github.co...
Негізгі бет Remove K digits | Build lowest number | Leetcode
No video
Пікірлер: 276