Completed Hashing-2 problems

[subbu4061]

No description provided.

[super30admin]

• Strengths:
  • Correct implementation of the algorithms for all three problems.
  • Good use of data structures (HashMap, HashSet) to achieve optimal time and space complexity.
  • Clear comments explaining the approach.
• Areas for Improvement:
  • Ensure consistent indentation throughout the code for better readability.
  • Always include a newline at the end of files to adhere to standard coding practices.
  • Consider using map.getOrDefault() in the "Subarray sum equals k" solution to simplify the code, similar to the reference solution.
  • For the "Longest palindrome" solution, consider initializing the count variable with a more descriptive name like palindromeLength for better clarity.