Valid Triangle Number | Leetcode 611 | Live Coding session 🔺🔺🔺

Показать описание

Here is the solution to "Valid Triangle Number" leetcode question. Hope you have a great time going through it.

Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Question walkthrough
3) 2:30 Algorithm
5) 8:00 Coding it up

For discussion/feedback

PS : Please increase the speed to 1.25X

Рекомендации по теме

Комментарии

@10:31, at line no. 13 of your code, you forget to explain the dry run for right--(decrementing right just after adding (right-left) to ans.) By the way good explanation.

Suggestions: can you please explain intuition/observation behing the optimal approach, So it can develop our thought process.

rohan

My extra like to clear the Intuition behind this problem -> Actually, I faced a problem why R-L gives me right occurrences now I got it.
For someone who wants to know the reference: since we sort the elements so if nums[L] + nums[R] gives me one right answer then all elements between L and R are able to provide me the answer that's why count += R-L -> Hope this makes sense

abhishekvishwakarma

pretty tricky for optimal answer, ....nice work bro!!

subhamtripathi

this makes a lot more sense now. Thanks, man.

sakshamsrivastava

This one is tricky! Thanks for the great explanation!

shrimpo

Please write down things a little bit more clearly while giving a dry run of your algorithm..it would be very helpful.

mansiverma

clean explanation, thanks a lot buddy

jaatharsh

i have taken left equals to i+1 and right=n-1 I am not getting correct answer

ShivamKhantwal

O(1) Space complexity? Does sorting the array asymptotically affect runtime?

j-espresso

When calculating the time complexity, isn't the sorting complexity(O(nlogn) taken into consideration?

jancoder

i have one request can you write this coding in c language ..
i will be very thankful to u please help

princijaiswal

it's great solution. Thank you . But I have an doubt "we are sorting an array which is going to take (nlogn) time complexity. how come TC becomes o(n2) ? isn't sorting going to take additional time ?

praveenj

Valid Triangle Number | Leetcode 611 | Live Coding session 🔺🔺🔺

Valid Triangle Number | Leetcode 611 | Live Coding session 🔺🔺🔺

Leetcode - Valid Triangle Number (Python)

Valid Triangle Number | Leetcode 611 | Sorting Two Pointer | LinkedIn

Valid Triangle Number | Leetcode 611 | C++ | Python | Approach + Code

Bloomberg Interview Question - Valid Triangle Number- Leetcode 611- Python

Valid Triangle Number | LeetCode 611 | Theory + Python

Valid Triangle Number | LeetCode 611 | Coders Camp

611. Valid Triangle Number - Day 15/31 Leetcode July Challenge

Valid Triangle Number | Leetcode 611 | Explained with Code | CodeBaker

Valid Triangle Number || Solution || Week 3 || July LeetCode Challenge

611. Valid Triangle Number (LeetCode)

ByteDance Coding Interview Question | Leetcode 611 | Valid Triangle Number

Valid Triangle Number (leetCode)

Valid Triangle Number. LeetCode 611.

How many LeetCode problems should you solve? #leetcode #techinterview #developer #softwareengineer

Valid Number | Live Coding with Explanation | Leetcode - 65

Count Possible Triangles | GFG | Valid Triangle Number | LeetCode | Algorithm Explanation by alGOds!

Leetcode 611. Valid Triangle Number (Python)

Counting Triangles Coding Question #InterviewBit Code+Explanation+Example

No Sound Leetcode 611: Valid Triangle Number

Valid Triangle Number | Leetcode | Binary Search

July 15/2021 LeetCode Challenge: Valid Triangle Number

Valid Triangle Number | Leetcode 611 Explained with C++ | Two Pointer + Sorting Approach

Leetcode - Valid Triangle Number (Java)