Skip to content

Commit 394c707

Browse files
committed
revisions
1 parent 0c31997 commit 394c707

File tree

2 files changed

+7
-3
lines changed

2 files changed

+7
-3
lines changed

dsa-solutions/gfg-solutions/0001-value-equal-to-index-value.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -47,8 +47,8 @@ You don't need to read input or print anything. Your task is to complete the fun
4747

4848
## Constraints
4949

50-
* 1 ≤ N ≤ 105
51-
* 1 ≤ `Arr[i]` ≤ 106
50+
* `1 ≤ N ≤ 105`
51+
* `1 ≤ Arr[i] ≤ 106`
5252

5353
## Problem Explanation
5454

dsa-solutions/gfg-solutions/0002-fascinating-number.md

Lines changed: 5 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,15 +24,19 @@ Fascinating Number: When a number(should contain 3 digits or more) is multiplied
2424

2525
Example 1:
2626

27+
```
2728
Input: N = 192
2829
Output: Fascinating
2930
Explanation: After multiplication with 2 and 3, and concatenating with original number, number will become 192384576 which contains all digits from 1 to 9.
31+
```
3032

3133
Example 2:
3234

35+
```
3336
Input: N = 853
3437
Output: Not Fascinating
3538
Explanation: It's not a fascinating number.
39+
```
3640

3741
## Your Task
3842

@@ -43,7 +47,7 @@ Expected Auxiliary Space: $O(1)$
4347

4448
## Constraints
4549

46-
100 <= N <= 2*10^9
50+
`100 <= N <= 2*10^9`
4751

4852
## Problem Explanation
4953

0 commit comments

Comments
 (0)