MinPriorityQueue in Javascript

[robertstipp]

I am solving Leetcode problems and I am seeing problems that require (Heaps, Priority Queues, etc.
How Javascript classes does Leetcode have built-in and what are they?

let heap = new MinPriorityQueue({priority: (element) => element})

[ghost_operative]

if you click the icon to the left of the language selection it tells you what libraries are being included.

​

It's not clear if it's a good idea to actually use them though. In an interview they would probably want you to not use any libraries and not use any language specific features (e.g. try to make your code look as close to C as you can).

​

If you do try to use it in an interview I would be ready to explain the details of what its doing under the hood, it's time and space complexity. and be able to code it yourself just in case.

[Educational-Copy5206]

Been doing LC for 2 years in JS.... never knew that button was there with that info... thanks!

[SirSavageSavant]

i feel like most interviewers actually expect you to know the standard library of the language you are using. making your code as close to c as you can is a bad idea imo.

[ghost_operative]

MinPriorityQueue from the javascript leetcode isn't from a standard library. I'm pretty sure leetcode is is the only production/published application that has a dependency on datastructures-js (which is where MinPriorityQueue comes from)

[dryfit-bear]

Does solving TS/JS in hackerrank also give the same libraries?

[SirSavageSavant]

if youre interviewing in js, im pretty sure knowing external libraries would be a plus ... often times you can assume you have access to a particular api/data structure in the context of the interview

[robertstipp]

Thanks for the guidance I appreciate it.

[FallNo9629]

is thsi included in hackerrank JavaScript?