Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. All these operations of SpecialStack must be O(1). To implement SpecialStack, you should only use standard Stack data structure and no other data structure like arrays, list, etc.
1. if input is n=7 then print this pattern. Program should be dynamic. * ** *** **** *** ** * 2. One array have many numeric values arr[] = {2,3,4,5,2,5,9,45,23} output arr[] = {2,3,4,5,9,45,23}. Means remove duplicate values from array and store. 3. if n = 5 then print this pattern. * - - - - * * * - - - * * - * - - * * - - * - * * - - - * * 4. They ask me in second round -->if arr[] = "My _ _ _ _Name _ _ _ _ _ is _ _ _ _ _ _ _ _ _ _ xyz". In output there should be only one space between word like arr[] = "My _ Name _ is _ xyz". 5. Take input like 3,5,4,6 separately and output should one numeric value like 3546, for 4,5--> 45.
Why Applied Medical?
Online Test
NDA
1) Debug some code and take logic test 2) Perform coding challenge 3) Show general knowledge of software development, code something, talk about interests
longest substring palindrome
Give a similar one here: Find 4 numbers in an integer array and they sum zero
How to decide if a graph is acyclic?
Find duplicate elements in two lists
Viewing 241 - 250 interview questions