---
title: "Discussion on \"How to solve the Leetcode 1657. Determine if Two Strings Are Close problem in JavaScript\" | Hashnode"
description: "Discussion on \"How to solve the Leetcode 1657. Determine if Two Strings Are Close problem in JavaScript\". Use a hash map to compare the letters and their frequencies"
url: "https://hashnode.com/posts/how-to-solve-the-leetcode-1657-determine-if-two-strings-are-close-problem-in-javascript/638a3ae4763770cc9160adff"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [How to solve the Leetcode 1657. Determine if Two Strings Are Close problem in JavaScript](https://blog.petefowler.dev/how-to-solve-the-leetcode-1657-determine-if-two-strings-are-close-problem-in-javascript?utm_source=hashnode&utm_medium=feed)

Use a hash map to compare the letters and their frequencies

Dec 2, 2022 · 6 min read · blog.petefowler.dev  
Read the article

-   [#javascript](https://hashnode.com/tag/javascript)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#array](https://hashnode.com/tag/array)
-   [#hashmap](https://hashnode.com/tag/hashmap)

## Written by

[Pete Fowler](https://hashnode.com/@pfowler)

@pfowler · Denver, CO

  
[View profile](https://hashnode.com/@pfowler)

Full Stack Software Engineer | JavaScript, TypeScript, React, C# / .NET, Amazon Web Services (AWS)

Full stack software engineer building a financial data integration SaaS product. Led a complete rebuild of the team’s web app using JavaScript, TypeScript, React, C#/.NET, EntityFramework Core and SQL, with testing in Jest, React Testing Library, xUnit, and Moq. Utilized AWS services including MySQL RDS, EC2, ECS with Docker, S3, Lambda, and EventBridge. Passionate about continuous improvement, clean code, and best practices (where they exist). Dedicated rock climber and runner based in Colorado. Names variables like a first born child.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
