Stack Data Structure Tutorial – Solve Coding Challenges
By freeCodeCamp.org
Published: Oct 05, 2022“
Questions on the stack data structure are very common in technical interviews. Learn how to master the data structure, starting from the easiest problems on LeetCode and InterviewBit and slowly building up intuitions so that the hard problems seem easy. All the questions are popular interview questions from Google, Meta, Microsoft and more!
Tanishq Chaudhary developed this course. Check out his channel: https://www.youtube.com/c…
Course Contents
SECTION 0 – Introduction
- (0:00:00) Introduction to the course on the Stack data structure
- (0:00:31) Stack implementation intuitions + Code in Python3 and C++
- (0:06:23) Simplify Path | InterviewBit | LeetCode
- (0:19:01) Min Stack | InterviewBit | LeetCode
SECTION 1 – Parentheses
- (0:30:04) Introduction to Parentheses questions
- (0:40:24) Valid Parentheses | InterviewBit | LeetCode
- (0:52:27) Redundant Braces | InterviewBit
- (1:02:08) Minimum Remove to Make Valid Parentheses | LeetCode
- (1:12:58) Longest Valid Parentheses | LeetCode
SECTION 2 – Calculator
- (1:17:42) Introduction to Calculator questions
- (1:22:51) Convert Infix to Postfix
- (1:40:15) Evaluate Reverse Polish Notation| InterviewBit | LeetCode
- (1:47:18) Basic Calculator I, II, III | LeetCode
Learn to code for free and get a developer job: https://www.freecodecamp.org
Read hundreds of articles on programming: https://freecodecamp.org/news
And subscribe for new videos on technology every day: https://youtube.com/subscription_cent…
”
Tag: Tanishq Chaudhary
[#Script #Coding] Greedy Algorithms Tutorial – Solve Coding Challenges
Greedy Algorithms Tutorial – Solve Coding Challenges
By freeCodeCamp.org
Published: Jun 27, 2022“
Learn how to use greedy algorithms to solve coding challenges. Many tech companies want people to solve coding challenges during interviews and many of the challenges can be solved using a greedy algorithm. A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
Course from Tanishq Chaudhary. Check out his channel: https://www.youtube.com/c/TanishqChau…
Links to coding challenges on InterviewBit:
- Highest product: https://www.interviewbit.com/problems…
- Bulbs: https://www.interviewbit.com/problems…
- Disjoint intervals: https://www.interviewbit.com/problems…
- Largest permutation: https://www.interviewbit.com/problems…
- Meeting rooms: https://www.interviewbit.com/problems…
- Distribute candy: https://www.interviewbit.com/problems…
- Seats: https://www.interviewbit.com/problems…
- Assign mice to holes: https://www.interviewbit.com/problems…
- Majority element: https://www.interviewbit.com/problems…
- Gas station: https://www.interviewbit.com/problems…
Course contents
- (0:00:00) Greedy introduction
- (0:04:32) Bulbs
- (0:12:11) Highest product
- (0:17:08) Disjoint intervals
- (0:28:43) Largest permutation
- (0:38:30) Meeting rooms
- (0:49:25) Distribute candy
- (1:03:13) Seats
- (1:19:13) Assign mice to holes
- (1:24:19) Majority element
- (1:35:28) Gas station
- (1:52:39) End
”
