groups-of-strings

Groups of Strings

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

ruby

bash

swift

golang

scala

html

pythonml

kotlin

rust

typescript

racket

erlang

elixir

dart

groupStrings

You are given a 0-indexed array of strings <code>words</code>. Each string consists of lowercase English letters only. No letter occurs more than once in any string of <code>words</code>.

Two strings <code>s1</code> and <code>s2</code> are said to be connected if the set of letters of <code>s2</code> can be obtained from the set of letters of <code>s1</code> by any one of the following operations:

<ul>
	<li>Adding exactly one letter to the set of the letters of <code>s1</code>.</li>
	<li>Deleting exactly one letter from the set of the letters of <code>s1</code>.</li>
	<li>Replacing exactly one letter from the set of the letters of <code>s1</code> with any letter, including itself.</li>
</ul>

The array <code>words</code> can be divided into one or more non-intersecting groups. A string belongs to a group if any one of the following is true:

<ul>
	<li>It is connected to at least one other string of the group.</li>
	<li>It is the only string present in the group.</li>
</ul>

Note that the strings in <code>words</code> should be grouped in such a manner that a string belonging to a group cannot be connected to a string present in any other group. It can be proved that such an arrangement is always unique.

Return an array <code>ans</code> of size <code>2</code> where:

<ul>
	<li><code>ans[0]</code> is the maximum number of groups <code>words</code> can be divided into, and</li>
	<li><code>ans[1]</code> is the size of the largest group.</li>
</ul>

&nbsp;
Example 1:

<pre>
Input: words = [&quot;a&quot;,&quot;b&quot;,&quot;ab&quot;,&quot;cde&quot;]
Output: [2,3]
Explanation:
- words[0] can be used to obtain words[1] (by replacing &#39;a&#39; with &#39;b&#39;), and words[2] (by adding &#39;b&#39;). So words[0] is connected to words[1] and words[2].
- words[1] can be used to obtain words[0] (by replacing &#39;b&#39; with &#39;a&#39;), and words[2] (by adding &#39;a&#39;). So words[1] is connected to words[0] and words[2].
- words[2] can be used to obtain words[0] (by deleting &#39;b&#39;), and words[1] (by deleting &#39;a&#39;). So words[2] is connected to words[0] and words[1].
- words[3] is not connected to any string in words.
Thus, words can be divided into 2 groups [&quot;a&quot;,&quot;b&quot;,&quot;ab&quot;] and [&quot;cde&quot;]. The size of the largest group is 3. 
</pre>

Example 2:

<pre>
Input: words = [&quot;a&quot;,&quot;ab&quot;,&quot;abc&quot;]
Output: [1,3]
Explanation:
- words[0] is connected to words[1].
- words[1] is connected to words[0] and words[2].
- words[2] is connected to words[1].
Since all strings are connected to each other, they should be grouped together.
Thus, the size of the largest group is 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 2 * 104</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 26</code></li>
	<li><code>words[i]</code> consists of lowercase English letters only.</li>
	<li>No letter occurs more than once in <code>words[i]</code>.</li>
</ul>

String

Bit Manipulation

Union Find

Accenture

Accolite

Activision

Adobe

Aetion

Affinity

Affirm

Airbnb

Airtel

Akamai

Akuna Capital

Alation

Alibaba

AllinCall

alphonso

Altimetrik

Amazon

American Express

Analytics quotient

AppDynamics

Apple

AQR Capital Management LLC

Arcesium

Arista Networks

Asana

Ascend

Athenahealth

Atlassian

Audible

Avalara

Baidu

Barclays

BitGo

BlackRock

Blizzard

Bloomberg

Bolt

Booking.com

Bridgewater Associates

ByteDance

C3 IoT

Canonical

Capgemini

Capital One

Cashfree

Cisco

Citadel

Citrix

Clari

Cloudera

Code Studio

codeagon

Codenation

CoderByte

Cognizant

Cohesity

Coinbase

Commvault

Coupang

Coursera

Cruise Automation

Cryptic Studios

DailyHunt

Databricks

Dataminr

DE Shaw

Dell

Deloitte

Deutsche Bank

DiDi

Directi

Discord

Docusign

DoorDash

Drawbridge

Dropbox

Dunzo

Duolingo

eBay

edabit

Electronic Arts

Epam Systems

Epic Systems

epiFi

Evernote

Expedia

Facebook

FactSet

Fallible

Fleetx

Flipkart

ForUsAll

fourkites

Garena

GE Digital

GE Healthcare

Online Assessment

Phone Interview

On Campus Interview

Onsite Interview

Don't know

last week

last month

last 3 months

last 6 months

more than 6 months

other