Summary
Full Transcript
C++ STL TUTORIALS : https://youtube.com/playlist?list=PLauivoElc3gh3RCiQA82MDI-gJfXQQVnn FREE COMPETITIVE PROGRAMMING COURSE TUTORIALS : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- FOR DOUBTS AND DISCUSSIONS, JOIN DISCORD : https://discord.gg/GMH23tq7Y7 In this video I a very important question which is done using stacks in O(n) Complexity which is finding Next greater element for every value in a given Array. We discuss the whole logic and also see how we can easily code it as well . Practice Questions : https://www.hackerrank.com/contests/second/challenges/next-greater-element/problem https://leetcode.com/problems/next-greater-element-i/ https://leetcode.com/problems/next-greater-element-ii/ Timestamps: Logic explanation : (0:00) Code using Stack: (9:36) Bloopers : (19:38) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #next #greater #element #stack #tutorial #competitivecoding
