LeetCode 3751 - Total Waviness of Numbers in Range | June 3 POTD | Brute Force | O(N) | Java | Med

追加: 2026-06-06

[00:00:01]Hello.

[00:00:02]Hope you guys are doing well. So, let's get started with our today's lead code problem of the day. It's 3715.

[00:00:09]It's 3715 and total waviness of numbers in range one.

[00:00:15]Now, it's a medium problem. So, first let's read this problem. You are given two integers num1 and num2. Like we are given with two integers num1 and num2 representing representing an inclusive range. Like num1 and num2 both are included.

[00:00:32]The waviness of number is defined as a total count of its peaks and valleys. Now, let's take a number and its wavy how we are going to define its waviness. Its waviness is the count of the total count of its peaks and valleys. Now, what is a peak?

[00:00:49]A digit is a peak if it is strictly greater than both of its immediate neighbors. Let's say if it is two. If it is if digit is two, it is greater than its It is greater than it both of its both of its neighbor.

[00:01:05]Right? A digit is a valley A digit is a valley if it is strictly lesser than both of its immediate neighbors.

[00:01:12]>> [laughter] [clears throat] >> Uh-huh. Let's see.

[00:01:19]Zero is a valley.

[00:01:23]>> [snorts] >> The first and last digits of a number cannot be peaks or valleys. Like the first and the last digit of a number cannot be peaks or valleys. Any number with fewer than three digits has a waviness of zero. Any number who like any number with who any number who has digits fewer than three its waviness will be zero. Now, return the total sum of waviness for all numbers in the range num2. Let's take it.

[00:01:55]This one.

[00:01:59]Now the thing is I have to start considering number from 120 to 120 121 122 till it's what? 123 124 125 126 127 128 and 129 130. Now two it's strictly greater than both of its neighbors so it will be what?

[00:02:30]It's >> [cough] >> It's waviness will be what?

[00:02:35]One.

[00:02:37]It's already greater than both of its neighbors. It's waviness is one.

[00:02:41]It's not It's not It's not not not not not not.

[00:02:47]What about this? Yes. So it's total its output will be what? Three.

[00:02:53]Similarly we can do for this range. Now the and similarly we can do for this range.

[00:03:03]>> [clears throat] >> Let's take this this example.

[00:03:07]It's simple.

[00:03:11]Now number is going to start from 4 84 8 and it will end at the very same number.

[00:03:17]So 8 it's greater than both of its neighbor. 4 it's lesser than both of its neighbor so its waviness will be what?

[00:03:22]Two.

[00:03:25]What about this one?

[00:03:27]Let's take this number as well.

[00:03:34]1 198 200 201 202. It's waviness is what? 9 is greater than both of its neighbor. It's a peak so considering it will give us one. Zero not. What about this lesser than both of its neighbor? It's It is a valley, so it will impact one. What about this? It's lesser than Both the numbers are greater than its neighbors, so it will impact one. So, total peak waviness of this range will be what? Three.

[00:04:08]Now, my range will be from 1 to 10 raised to the power 5. So, let's take one thing.

[00:04:15]Uh now, uh if I'm given with the number, let's first write the function to get the waviness of a particular number. Let's say this is my function private int get waviness.

[00:04:30]Now, the thing is I'll take a number inside it. Now, convert it to what? String.

[00:04:37]Because com- Parsing strings are way easier, otherwise you have to deal with more divide and so on.

[00:04:44]So, I'll do what? I'll just convert it into string. Integer. load to string.

[00:04:51]And here it it what it it will be num.

[00:04:54]Now, [clears throat] it has been converted to a string. Now, initially my waviness will be equal to what? Zero. Now, iterate over your string from where? Because zero then the last index won't impact to any waviness, so I'll I equal to one I less than s.length minus one and I plus plus because I don't want to consider last index of my string. Now, if let's say current character will be what? Current character will be s.

[00:05:25]charAt(i).

[00:05:26]Now, previous character will be equal to what? Previous character will be equal to s. charAt(i 1). Now, >> [clears throat] >> next character will be what?

[00:05:40]s. charAt(i + 1).

[00:05:42]i + 1. Now, the thing is Now, the thing is if my current character is greater than previous and and current character is greater than next then my waviness will be increased by what? Otherwise if this condition is failed check another condition if cur is less than prev and and cur is less than what? Next then increase increment your waviness by one. Once it is done close your for loop and finally return what? Return waviness.

[00:06:21]Now this is a function that take any number and get its waviness. Now we have to start from range num one and num two.

[00:06:29]Now my main function will do what?

[00:06:32]public int calculate waviness what is like calculate waviness int num one int num two Now for each of the number get call this function and get your total answer in total equal to what? Zero for int I equal to num one and I less than or equal to what? Num two I plus plus. Now do what? Total plus or equal to what? Get waviness and pass this I.

[00:07:09]Waviness pass this I and close your for loop and finally return what? Return total.

[00:07:18]Once it is done now your time complexity will be what?

[00:07:23]Your time complexity will be num two minus num one it's approximately equal to 10 raise to the power five. Now for each of the number I am just first converting it into string.

[00:07:35]Converting it into string will be what?

[00:07:38]Log of like we whatever number it is let's take in inverse case scenario num two, log into num two, and that's all. That's all into like we are doing how much?

[00:07:52]Two iterations, one for converting and one for checking the waviness. It's somewhat equal to it this much. So, uh it's n log like n kind of thing.

[00:08:06]I'll I'll just I'll just calculate it exactly once I get once I submit [clears throat] my solution. So, let's move to the its implementation. So, this is my code.

[00:08:16]So, uh First, let's write a function.

[00:08:22]Uh my function will be what? A function that gives gives me the waviness for any of the function that gives me the waviness for a particular number.

[00:08:32]num for a particular number num.

[00:08:37]Once it is done, I'll do what?

[00:08:39]I'll just calculate for each of the number from num range num one to num two.

[00:08:44]private int get waviness Now, int num. First, convert it into what? String. String s will be what?

[00:08:55]String s equal to integer It is a integer class.

[00:09:00]Integer. to string to string. Now, num.

[00:09:07]Now, your waviness initially will be equal to what? Zero. Now, iterate over your string from where to where? One to s.length - 1 i ++ Now, get me the current character. Current character equal to what? Equal to s.

[00:09:29]care at of i Previous character will be equal to what? care previous equal to s. care at of i minus 1.

[00:09:43]What will be my next character? Next character will be equal to s. care at of i plus 1.

[00:09:51]Now, if curr is greater than prev and and curr is greater than next, do what? Waviness plus plus.

[00:10:06]Waviness plus plus. Else if otherwise, do what? If curr is less than prev and and curr is less than what? Next. Do what? Waviness plus plus. Once I come out of the loop, I'll do what? Return wavy ness.

[00:10:27]Now, I want to calculate for the whole range in total equal to zero.

[00:10:33]Now, for int i equal to what? i equal to zero.

[00:10:38]i less than No, no, no. I'll start from num 1. i less than or equal to what? Num 2. i plus plus. Now, the thing is total, I'll add up the waviness for each of the number. Get wavy ness of what? i.

[00:10:58]Now, finally return what? Return total.

[00:11:06]Now, let's try to >> [laughter] >> Oh, I have applied two.

[00:11:21]I think that's all.

[00:11:29]And again and again, why are we getting these errors?

[00:11:36]It's carrot.

[00:11:38]Carrot.

[00:11:41]It's carrot.

[00:11:50]Hopefully, this time it gets accepted.

[00:11:56]It's taking lot of time.

[00:12:08]Yeah, let's submit this.

[00:12:15]Preparing and diamond environment, speeding up.

[00:12:20]I think it's accepted because accepted is already there.

[00:12:26]Yeah, it got submitted.

[00:12:29]Now, let's see the time complexity for this.

[00:12:32]Move to editorial.

[00:12:35]Its time complexity is somewhat around num2 into log num2. That's what I told you.

[00:12:41]Like, because we are iterating over the whole range, so taking the maximum num2.

[00:12:46]Now, log num2, why? Because converting a number to a string will take how like in a number, how many digits are there?

[00:12:54]In there are log n almost, so I'll take log num n two into two. That's what That's my That will be my time complexity. I think it's clear. Space complexity will be big of one.

[00:13:06]So, I think the space and time space and time complexity are clear. If you guys want me to solve this problem using the optimized optimized way, then feel like let me know. And thank you very much, guys. If you guys have any doubt, like if you want to ask anything, just feel free to comment. I'll try to help you. Thank you guys. Bye-bye.