Login

All Problems

Problem title

Difficulty

Avg time to solve

Jump Game

Moderate

15 mins

Price Pattern

Easy

15 mins

Count Nodes within K-distance

Hard

10 mins

Remove Duplicates From String

Moderate

25 mins

Next Smaller Element

Moderate

25 mins

Longest Repeating Subsequence

Moderate

15 mins

Delete Leaf Nodes With Value X

Moderate

27 mins

Count Even Odd

Easy

10 mins

Remove String

Moderate

35 mins

Count Distinct Substrings

Moderate

10 mins

Problem

Submissions

9

Avg. time to solve

25 min

Success Rate

75%

Problem Statement

```
If the given array is [ 2, 3, 1], we need to return [1, 1, -1]. Because for 2, 1 is the Next Smaller element. For 3, 1 is the Next Smaller element and for 1, there is no next smaller element hence the answer for this element is -1.
```

```
The first line of input contains an integer ‘T’ which contains the number of test cases.
The first line of each test case contains an integer 'N' denoting the number of elements in the array 'ARR'.
The second line of each test case contains 'N' space-separated integers denoting the array 'ARR'.
```

```
For each test case, print a single line containing 'N' space-separated integers denoting the value of Next Smaller Element for each of the 'N' array elements.
The output for each test case will be printed in a separate line.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 10
1 <= N <= 10 ^ 5
0 <= ARR [i] <= 10 ^ 9
Time Limit: 1sec.
```

```
2
4
2 1 4 3
3
1 3 2
```

```
1 -1 3 -1
-1 2 -1
```

```
For the first test case :
1) For ARR [1] = 2 , the next smaller element is 1.
2) For ARR [2] = 1 , the next smaller element is -1 as no element in the array has value smaller than 1.
3) For ARR [3] = 4 , the next smaller element is 3.
4) For ARR [4] = 3 , the next smaller element is -1 as no element exists in the right of it.
Hence, we will return the array [ 1, -1, 3, -1] in this case.
For the second test case :
1) For ARR [1] = 1 , the next smaller element is -1 as no element in the array has value smaller than 1.
2) For ARR [2] = 3 , the next smaller element is 2.
3) For ARR [3] = 2 , the next smaller element is -1 as no element exists in the right of it.
Hence we will return the array [ -1, 2, -1 ] in this case.
```

```
2
4
1 2 3 4
2
5 0
```

```
-1 -1 -1 -1
0 -1
```

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Language

Change Theme

Solution submission not allowed

Save Code

Reset Code