We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I've been working in some HackerRank exercices in which a queue implementation was required, so I implemented it myself using an array and a couple of indexes (head and tail). However, I see that in many answers people refer to to the List/Queue/Map/Set classes defined in java.util.* Can we also use them to solve the exercices? I thought that we were required to implement all these things manually in the exercices (specially for selection process exams). Could you please clarify it?
Best wishes,
jscupc
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Level Order Traversal
You are viewing a single comment's thread. Return to all comments →
Hi @enmar, all,
I've been working in some HackerRank exercices in which a queue implementation was required, so I implemented it myself using an array and a couple of indexes (head and tail). However, I see that in many answers people refer to to the List/Queue/Map/Set classes defined in java.util.* Can we also use them to solve the exercices? I thought that we were required to implement all these things manually in the exercices (specially for selection process exams). Could you please clarify it?
Best wishes,
jscupc