Define a stack, in which we can get its minimum number with a function min. In this stack, the time complexity of min(), push() and pop() are all O(1).
Implement a queue with two stacks. Please implement two functions: appendTail to append an element into tail of a queue, and deleteHead to delete an element from head of a queue.
Given two integer sequences, one of which is the push sequence of a stack, please check whether the other sequence is a corresponding pop sequence or not.
For example, if 1, 2, 3, 4, 5 is a push sequence, 4, 5, 3, 2, 1 is a corresponding pop sequence, but the sequence 4, 3, 5, 1, 2 is not.
Given an array of numbers and a sliding window size, how to get the maximal numbers in all sliding windows?
How can you implement n (n >= 2) stacks in a single array, where no stack overflows until no space left in the entire array space?
Wonderful and detailed content . It helped me a lot.
ReplyDeleteStack Interview Questions
Publish Research Paper: Authors should submit the manuscript/paper that has been attentively proof-read and brilliance. Authors are mandatory to refer to the UIJRT manuscript/paper template format. This will assure fast processing and publication. Through E-mail acceptance or rejection, the notification will be sent to all authors. Fast Paper Publication
ReplyDeleteYou can publish your research and review paper at Multidisciplinary International Journal of Research and Development.
ReplyDelete연수구출장맛사지
ReplyDelete남동구출장맛사지
부평구출장맛사지
계양구출장맛사지
광산구출장맛사지
유성구출장맛사지
대덕구출장맛사지
진해구출장맛사지
마산회원구출장맛사지
마산합포구출장맛사지