Counting Triangles Coding Question

[@gowrisankar98jammu49]

Amazing experience and explanation

[@devanshdixitmusicallyyours3885]

you are really a very very good explainer whatever u explain u code exactly that which helps us to understand more easily.

[@vishnumacharla8836]

nice explanation

[@SirAkPandey]

awesome content 🙏🙏

[@schan263]

Thank you for the video. It was fun.

[@SomneelMaity]

Thank you so much for amazingly explaining the solution.

[@Its_________bansal4821]

Best explanation

[@rockyjoe3817]

Subscribed to you with my two accounts . Your explanation is top notch

[@gauravathawale6495]

thank you for such a nice explanation

[@Aman-wu4mb]

Thanks a lot dii for such a nice explanation.

[@atulpanchal4324]

nice explain di

[@tbt4283]

love it, thanks

[@atanunayak6637]

Hello di great explanation, but the solution is O(n^2). And it is given that n can be as large as 10^5. Don't you think the solution should have failed?

[@showsshorts4696]

did aproach appko pehle se pata thi ya app ko question dekhke samjh aagayi

[@Chirag_Dhouni]

what will ve the complexity

[@SahilGupta-cd8lc]

super simplle

[@ashvinkumhar5819]

Thanks dii

[@AmanSharma-vb5jl]

mam its time complexity is O(n^2) ?

[@codingwithsmallsteps2878]

Yes. The time complexity is O(n^2). The first for loop is for fixing the c (third side) and the second while loop is for counting valid a and b using two pointer approach.

[@abhishekyadav-hy3gq]

@@codingwithsmallsteps2878 why is O(n^2) working since n=1e5