when i can use unordered_map and when i can't?

Revision en2, by THERE_IS_NO_RETURN, 2021-02-14 21:05:46

hi i am learning dynamic programming and i wonder what are the cases when i can use unordered_map to store results without fear from TLE ? what is time complexity for inserting and finding out if the result stored or not ? i have searched and find many answers but i was complicated for me because i am totally beginner.

Tags #dynamic programing, unordered_map, time complexity

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English THERE_IS_NO_RETURN 2021-02-14 21:06:56 1 Tiny change: 'wers but i was compl' -> 'wers but it was compl'
en2 English THERE_IS_NO_RETURN 2021-02-14 21:05:46 10
en1 English THERE_IS_NO_RETURN 2021-02-14 21:04:58 365 Initial revision (published)