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.
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
Find duplicate elements in two lists
Delete node in BST
Given an array of integers [1,2,3,4]. and target t = 5. Come up with a solution that will print out all the unique pairs in the array that are equal t.
Connect nodes at the same level in a binary tree
You've a singly linked list where every node in the list has a field "random" which points to other node in the same list. Write a function to clone this list (create a new copy of the same). Don't use extra space (just the pointer variables are fine).
Not hard at all.
Viewing 11 - 20 interview questions