Nov 30, 2021

2 min read

Leetcode 2085: Count Common Words With One Occurrence

In this Leetcode problem, we want to know which word occurs exactly once in each of the 2 lists of words provided.

Given two string arrays words1 and words2, return the number of strings that appear exactly once in each of the two arrays.

These are the couple of examples provided:

Examples and contraints

Solution idea

--

More from Pierre-Marie Poitevin

Likes to code and to learn.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

in

The Startup

Flutter Login & Registration Using Firebase

in

Dev Genius

Formatting Strings using Templates in C#

Get Ready for Chrome User-Agent String Phase Out

What is a Web Developer? How Should a Web Developer’s Roadmap Be? (English Version)

in

Towards Data Science

Machine Learning Pipelines With Scikit-Learn

in

Tari Labs

Tari Protocol Discussion #4

Spring Boot — Dynamically ignore fields while converting Java Object to JSON

Asynchronous Task Management with Celery

About Help Terms Privacy

Get the Medium app

Pierre-Marie Poitevin

Pierre-Marie Poitevin

Likes to code and to learn.

More from Medium

Leetcode Q189. Rotate Array (Q181)

Leetcode 2141: Maximum Running Time of N Computers

Critical Review of Prim’s Algorithm

Binary Tree Inorder Traversal🛹

Help
Status
Writers
Blog
Careers
Privacy
Terms
About
Knowable