find-common-characters

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string array <code>words</code>, return an array of all characters that show up in all strings within the <code>words</code> (including duplicates). You may return the answer in any order.

&nbsp;
Example 1:
<pre>Input: words = ["bella","label","roller"]
Output: ["e","l","l"]
</pre>Example 2:
<pre>Input: words = ["cool","lock","cook"]
Output: ["c","o"]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists of lowercase English letters.</li>
</ul>

第 126 场周赛

weekly-contest-126

commonChars

Find Common Characters

Intersection of Two Arrays II

intersection-of-two-arrays-ii

两个数组的交集 II

Array

Hash Table

String

给你一个字符串数组 <code>words</code> ，请你找出所有在 <code>words</code> 的每个字符串中都出现的共用字符（包括重复字符），并以数组形式返回。你可以按 任意顺序 返回答案。
&nbsp;

示例 1：

<pre>
输入：words = ["bella","label","roller"]
输出：["e","l","l"]
</pre>

示例 2：

<pre>
输入：words = ["cool","lock","cook"]
输出：["c","o"]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> 由小写英文字母组成</li>
</ul>