From 7f1cbe746a52433fe500988ac5106584a956da56 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Sat, 29 Mar 2025 21:28:04 -0300 Subject: [PATCH] [Hacker Rank] Interview Preparation Kit: Dictionaries and Hashmaps: Sherlock and Anagrams. Better docummentation. --- .../sherlock_and_anagrams-solution-notes.md | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md b/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md index ba6a8f9..ae41758 100644 --- a/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md +++ b/docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md @@ -22,9 +22,8 @@ The second part of this problem can be solved with the binomial coefficient form But the entire cost of this formula falls on the "factorial" function. -In javascript, the factorial quickly reaches results that return large numbers, -in scientific notation, losing precision. -This loss of precision can result in an erroneous result -in the final calculation of permutations. +The factorial quickly reaches results that return large numbers, +overflowing the length of primitive number types. -To avoid this problem, it is necessary to introduce large number handling using BigInt. +To avoid this problem in Java, it is necessary to introduce large number handling +using java.math.BigInteger