Linked Questions

I was watching a youtube tutorial in DS&A (using JS) and he mentioned that the time complexity of accessing or removing property in an object is constant? how is that possible shouldn't we search ...

I have the following object: let obj = { "name": "someName", "age": 33, "city": "someCity" } I understand that an object is not indexed "...

I need to map accented letters (é, ü, á, ï, ö, ..., etc.) to their corresponding letters in English (e, u, a, i, o, ..., etc.). I know I can do this in several approaches: Looping through an array - ...

Why do I keep seeing different runtime complexities for these functions on a hash table? On wiki, search and delete are O(n) (I thought the point of hash tables was to have constant lookup so what's ...

Objects in JavaScript can be used as Hashtable (the key must be String) Is it perform well as Hashtable the data structure? I mean , does it implemented as Hashtable behind the scene? Update: (1) I ...

For some algorithm I was writing recently I thought that a hash would be excellent. I thought that I could probably just use the member variables in an object as key value pairs. I am not sure if this ...

here is a sample example where there are two arrays and we have a merge() to which we pass the arrays. the merge() should return the merged array such that it should merge the objects which have same ...

I have an array of objects with a property I want to filter on called "Country". I have the user select which countries they want to see and wish to return an array of objects filtered by that ...

I have a socket with realtime values. I get the unsorted row object then I need to create a list of the received objects and sort them by price. After this, my data is sorted correctly. I am using ...

var key = 'a'; map[key] = 'value'; map['a'] = 'value'; In Java this is optimized automatically during compilation. I want to know if any JS compiler does such optimization on its own.