In my first interview round, I was given a problem based on the queue. The question was that you have been given a list of integers in which you can move only in forward direction basically you are given two function getnextelement() and endlist() when endlist() is true then you have completely traversed the list. Now I was asked to develop an algorithm such that I print first odd number the first even number then second odd and second even and so on for example, the list is 1,4,6,7,2,3 my output will be 1,4,7,6,3,2
