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.
See above for type of question?
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.
Online Test
// // Write a function that takes a string and returns its length without using built in properties (such as .length or .size()). //
First question: for a random-ordered bucket of numbers 1 through 3000 with one number missing, how would you detect which number is missing?
Check if a string is a pallindrome Find the longest distance between any two nodes in a binary tree.
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
Viewing 231 - 240 interview questions