Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. This is a very interesting questions of stacks. Here, we are going to create our own stack.
Question Name:
Normal Stack
Question Link:
https://www.pepcoding.com/resources/o...
Question Statement:
1. You are required to complete the code of our CustomStack class. The class should mimic the behaviour of java.util.Stack class and implement LIFO semantic.
2. Here is the list of functions that you are supposed to complete
2.1. push Should accept new data if there is space available in the underlying
array or print Stack overflo otherwise.
2.2. pop Should remove and return last data if available or print Stack
underflow otherwise and return 1.
2.3. top Should return last data if available or print Stack underflow
otherwise and return -1.
2.4. size -Should return the number of elements available in the stack.
2.5. display - Should print the elements of stack in LIFO manner (space-
separated) ending with a line-break.
3. Input and Output is managed for you.
Topic: #Stacks #Queues #StacksAndQueues
Used #DataStructure: #Stacks #Arrays
#TimeComplexity: O(1)
#SpaceComplexity: O(1)
--------------------------------------------------------------
Similar Questions:
1. Dynamic Stack
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
--------------------------------------------------------------
Dependent Questions:
1. Dynamic Stack
a. Pepcoding Portal Link: https://www.pepcoding.com/resources/o...
--------------------------------------------------------------
More Youtube PlayList:
Level 1 In Java English : • Java Level 1 In English
Level 1 In Java Hindi : • DSA - Level 1
Level 2 In Java Hindi : • DSA - Level 2
Constructive Algorithm - Level 3 : • Constructive Algorithm - Level 3
Geometry - Level 3 : • Geometry Level 3
Maths for CP - Level 3 : • Maths For CP - Level 3
DP - Level 3 : • DP - Level 3
Euler Tour - Level 3 : • Euler Tour - Level 3
Ternary Search : • Ternary Search
Recursion & Backtracking - Level 1 : • Recursion & Backtracking - Level 1
Recursion & Backtracking - Level 2 : • Backtracking - Level 2
Graphs - Level 1 : • Graphs - Level 1
Dyanmic Programming - Level 1 : • Dynamic Programming - Level 1
Generic Trees - Level 1 : • Generic Trees - Level 1
Time and Space - Level 1 : • Time and Space - Level 1
---------------------------------------------------------------
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
We also provide professional courses with live classes and placement opportunities.
For more visit our website: https://bit.ly/2ZCS68a
For more free study resources, visit: https://bit.ly/3liICaJ
Have a look at our result: https://bit.ly/2YcmDZR
Follow us on our Youtube page: / pepcoding
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Follow us on Pinterest: / _created
Follow us on Twitter: / pepcoding
.
.
.
Happy Programming !!! Pep it up
----------------------------------------------------------------
#Stacks #Queues #StacksAndQueues #NormalStack #Arrays
=================================================================
На этой странице сайта вы можете посмотреть видео онлайн Normal Stack | Module : Basics Data Structures | In Hindi | Python | Video_15 длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Pepcoding 01 Январь 1970, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 128 раз и оно понравилось 4 зрителям. Приятного просмотра!