day 9/30. Like and comment if you have understood the explanation as well as the code.😄
@jbr.1Ай бұрын
Yes brother facing problem building and implementing logic.
@anshasati1920Ай бұрын
12:50 Yes facing the problem
@AmanKumar-qr8jxАй бұрын
Yes, facing issues while building logic by myself.
@PriyanshuKumar-i8eАй бұрын
I'm able to solve this question using the brute force method khud se(tle aa gya), but optimise nhi kr paya(thoda idea aa rha tha ki hme hr range ke liye ans store krne pdenge, and hashmap ki trf jaa rha tha mai, but not able to code the optimise solution on my own. Thank you for the cool explanation.
@Bhalu-kl7sqАй бұрын
you are the only one who provide the best content regarding daily question literally now i can only understand your solutions only i would like to give you a suggestion to make contest discussions also thank you so much bhaiya
@rajaryanbehera8628Ай бұрын
yes bhaiya, if you upload logic building tutorial then it may help us to from where to start and how to move forward
@yash3638Ай бұрын
yes, bhaiya video banao logic building pe..
@beinghappy9223Ай бұрын
Thanks for the sweet and simple explanation.
@radhakrishnatelaprolu9360Ай бұрын
You are literally a rare underrated gem!!🙌🫶 And can you pleasee make a video on that logic building also!! Please make sure that should be in your style!!!(Unique one)) tqq bro!!
@shashwat_tiwari_stАй бұрын
@@radhakrishnatelaprolu9360 ✨️🙌
@rohandede9720Ай бұрын
I'm became consistent because of only you bhaiya thank you for your support and motivation ❤
@shashwat_tiwari_stАй бұрын
@@rohandede9720 keep growing ♥️
@TanuKumari-ue4opАй бұрын
Your explanation make easy to formulate the logic but most of time I stuck in finding the approch. Please make video on logic building.
@DarkDragon-bz6qpАй бұрын
Yes video on logic building
@techoom74Ай бұрын
yes sir we need a video on logic building plz upload //
@sagargoswami5750Ай бұрын
hnji bhiya 1 mast C video bnao es problem ke upr
@srashtirai5630Ай бұрын
Yes I facing this problem
@mathongo1940Ай бұрын
Yes sir bahot problem hoti hai easy questions ho jate hai but ,ache questions mein logic build nhi ho pata
@Star_Bawa9Ай бұрын
Yes logic building mai problm ho rhi hai
@aush3212Ай бұрын
Bhaiya 6 7 Month Ho gaye hai question ka logic hi nhi ban raha hai. jab tak solution na dekhu code ka logic hi nhi banta hai :/
@bgmihighlights6378Ай бұрын
Haa bhaiya kabhi kabaar logic building mai problem hoti hai bhaiyaaa
@dhananjaybamhande1604Ай бұрын
ha bhaiyaa logic build nahi ho pa raha but when i see your tutorial then i get some logic building but for us How to start Building logic and find the problem approach thats complicated so pls for us make videos on it ... thanks for your guidance Sir(shashwat Bhaiyaa) .
@thAsciNileshPalАй бұрын
Pllease make a video of logic building of questions approach
@anamikakumari5808Ай бұрын
yes sir, i also face this problem. actually,i did code daily but i am not able to build the approach of code.
@100nitishyadav829 күн бұрын
Logic build to ho jate but not completly from 0 to 100 also leetcode per solve kerna is completly different then koi test ka OA dena unka question mai time hota h + testcases bhi nhi dikhte + many things which makes it completly difficult
@RAVIPRAKASHVERMABCAАй бұрын
please make video sir how to approach question
@zaffarzeshan1308Ай бұрын
plz make a video on JDBC lect
@DreamPuller-cf6ylАй бұрын
Bhaiya tutorial dekhkar hi question ban rhe hai, kuch samaj nhi aarha, plz video le aoo
@The.VikingsАй бұрын
//I have stored the index of last valid index and than checked (without prefix sum ).It runs fine beats 100% class Solution { public boolean[] isArraySpecial(int[] nums, int[][] queries) { int n=nums.length; int m=queries.length; int[] range=new int[n]; int prev=0; for(int i=1;i
@shubhm59Ай бұрын
yes bhaiya logic building mein dikkat ho rhi hai, please help
@Gutsss77Ай бұрын
using a simple brute force // class Solution { // public: // vector isArraySpecial(vector& nums, vector& queries) { // vector ans; // for (auto& q : queries) { // int start = q[0]; // int end = q[1]; // bool isSpecial = true; // for (int i = start; i < end; ++i) { // if ((nums[i] % 2 == nums[i+1] % 2)) { // isSpecial = false; // break; // } // } // ans.push_back(isSpecial); // } // return ans; // } // }; but time limit exceed 💀XD, well thanks
@soumyajitpaul-p8zАй бұрын
Kitne test case pass hua
@VivekSingh-lf1rnАй бұрын
Logic build nahi ho raha hai
@sparshjaiswal4005Ай бұрын
yes
@vemanasumanth1925Ай бұрын
Yes
@mohit.j555426 күн бұрын
logic building video plz 🥸
@arabindaparida4075Ай бұрын
Yes sir
@soumyajitpaul-p8zАй бұрын
355 test passs hua 356 TLE agya 😢😢😢😢
@shashwat_tiwari_stАй бұрын
@@soumyajitpaul-p8z brute force me?
@jacksonripper-mp8drАй бұрын
constraints given in the question: - queries array can go upto 10^5 and the same goes for nums array, so brute force would take O(n*q) operations in the worst case which is approx 10^5*10^5 ~= 10^10..... 10^10 > 10^8 [Operations that are perfromed under 1 second], so it gives TLE.......
@shashwat_tiwari_stАй бұрын
@@jacksonripper-mp8dr ha okay. Brute force TLE dega hi, I thought counting approach TLE de rha tmhe 🫡
@soumyajitpaul-p8zАй бұрын
@@shashwat_tiwari_st sir iya question apko first time ei click kra gaya .... , sir kuch roadmap or guidance dedo ta ki ham bi logic build karne lge.... And thankyou sir for your reply ❤