69 CS651 Lecture Notes - Lecture 57: Hash Table, Linked List

5 views2 pages

Document Summary

Implement | lesson 57 | dsa in java | Mitesh from coding ninjas has produced a new video on hash tables. in this video, we "ll be talking about hash tables how we can represent them and how they can implement them. in our hash table. In our hash table. a linked list of pair pairs can tell whether 1 and minus 1 is present in our hash map or not. How we can do that. that in our array at index 0 whether it is true. or false right so if this is true that means that uh element 0 is present. if we are looking at 1. We are saying that we"re looking for both a of 1 as well as a of minus 1. We can we can. tell that. we can safely assume that there is no such value present there For each key for each key we have a string named as coding.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions