Hi , 1.5 year experienced engineer working in Service Based, I went for an interview for a Hyderabad based startup he told me dude you have knowledge of a 5 year experienced guy. Just follow this playlist you are good to go for any company Fodd doge koi bhi java interview. Tcs, infosys toh mazaak lagengey iske baad😂 Thanks bhai❤
second time i watched the full video. It gives much confidence now. Thank You so much. And I request you to please make a video on multithreading and java 8 features.
the explanation you do is awesome. I have some doubts 48:19 when you stored key 2 and value B , it should stored in the array first na ? you have written outside the index 3 block. another doubt , is there any order for load factor and treefy thresholding ? I think that as per the scenario either of these 2 could come to the action , am I right ?
Hello Shryansh, really good details in a simpler way . I have one doubt. If in key we store any Object then we need to override that particular class's hashCode() method. But what will happen in case of coelution ? Then how we will compare while getting value? How we will compare hashValue of key and key object?
I have 2 doubts. 1) 37:52 does it count the horizontal values also before doing re-hash for 13 nodes (16*0.75 + 1)? Suppose I have 13 nodes.. and 7 of them are forming a linkedList. Will it count it as a scenario when it have to do re-hash or does it wait till the moment 13 nodes gets filled vertically? 2) If both load factor and treefyThreashold gets crossed at same time which one will heppen first? At 26:59 here as per example the key 5 is producing two different hash values. I think that is a mistake.
Hi,I am also having the same questions. can you please address these. And also while calculating the index after getting hash value and dividing the hash value by size, in this are we also considering the LinkedList that were created on collision or are we only considering initial size of array of nodes
Hey shreyansh, excellent video. I have one request though, can you make a video on spring boot learning path and resources from which one can learn. I am coming from python django background and recently giving the interviews and most of the time, the requirementb is of java and spring boot. I know you will create a series on spring boot going forward but if you just make one video for now which covers the introduction and resources and what are important interview question then it will be immensely helpful
putifAbsent -> if key already exists return the value already associated, else create a new mapping with this key and value. put -> if map already has the same key present it will overwrite the value now provided and do not have the key present: it will add new key-value mapping.
Hey shreyansh, I had a doubt suppose initially when the length of array is 16 I put key as 'A' hash will generate for 'A' and it will mod with 16 we will get the index for it correct. Suppose after some insertion the array size increased to 64 and we again tries to put key 'A' for updating the value, now for 'A' same hash will be generated but this time we are going to mod with different size that is 64 so we will get the different index for 'A'.
Hi shreyansh, Thanks for amazing video! I have a doubt on Java Date class. sometimes we code across the code that uses different flavours of Dates. someone uses Date, DateTime, ZonedTime - as per their comfort also hell lot of utilities that provides date and DateFormatter() its all rabbit hole now. Assuming a new guy in java what are the best practices to use proper class of Date?? Is there any standard like given 100s of Date classes always use these 2 or 5 class??
Hey Shreyansh, just one doubt suppose rehashing is happening then its size will be increase and old entry has some hasing value and based on these hasing value index were generated using logic(hashvalue%sizeofArray) now after rehasing and we have called put method and so again it will generate the hasValue which will be same as old one but this time while generating index it will different because this time index = hashValue % size of array and this time of size of array will be different how it work for keys whose were stored before rehashing?
when resizing is occur, the new array is created the all the values from old are shifted based on the newly created index in new array. after that when some put method will be called its stored in newly created array.
when resizing is occur, the new array is created the all the values from old are shifted based on the newly created index in new array. after that when some put method will be called its stored in newly created array.
