Skip to content

Commit 593a758

Browse files
committed
Refactor mermaid diagrams in Procedure.md for improved clarity and consistency
1 parent c6d0a50 commit 593a758

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed

Daily_Problems/DailyProblem7/Procedure.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -13,8 +13,8 @@ This is a **Medium** problem that involves:
1313

1414
```mermaid
1515
flowchart TD
16-
A[Start: s1, s2, baseStr] --> B[Initialize Union Find Structure]
17-
B --> B1[parent[i] = i for all 26 characters<br/>Each character is its own parent initially]
16+
A["Start: s1, s2, baseStr"] --> B["Initialize Union Find Structure"]
17+
B --> B1["parent[i] = i for all 26 characters\nEach character is its own parent initially"]
1818
B1 --> C[Process Equivalence Pairs]
1919
C --> C1[For each i in s1.length]
2020
C1 --> C2[Union s1[i] and s2[i]]
@@ -34,7 +34,7 @@ flowchart TD
3434
F1 --> F2[Replace with mapped equivalent]
3535
F2 --> G{More characters?}
3636
G -->|Yes| F1
37-
G -->|No| H[Return Result String]
37+
G -->|No| H["Return Result String"]
3838
3939
style A fill:#e1f5fe
4040
style H fill:#c8e6c9
@@ -44,8 +44,8 @@ flowchart TD
4444

4545
```mermaid
4646
graph TB
47-
subgraph "Union Find Operations"
48-
A1[Find(x)] --> B1{parent[x] == x?}
47+
subgraph Union_Find_Operations
48+
A1["Find(x)"] --> B1{"parent[x] == x?"}
4949
B1 -->|Yes| C1[Return x]
5050
B1 -->|No| D1[parent[x] = Find(parent[x])]
5151
D1 --> E1[Return parent[x]]
@@ -57,8 +57,8 @@ graph TB
5757
D2 -->|No| F2[Already connected]
5858
end
5959
60-
subgraph "Example: s1='abc', s2='cde'"
61-
G1[Initial: aa, bb, cc, dd, e→e] --> H1[Union(a,c): aa, c→a]
60+
subgraph Example_abc_cde
61+
G1["Initial: a->a, b->b, c->c, d->d, e->e"] --> H1["Union(a,c): a->a, c->a"]
6262
H1 --> I1[Union(b,d): b→b, d→b]
6363
I1 --> J1[Union(c,e): c→a, e→a]
6464
J1 --> K1[Final groups: {a,c,e}, {b,d}]

0 commit comments

Comments
 (0)