L -32 Median of a row wise sorted matrix | Java plus DSA Placement | FAANG
Вставка
- Опубліковано 21 тра 2023
- Contest Name: June Code Challenge With Shashwat
Rules:
1. Day1 : Create a LinkedIn or Twitter Post mentioning that you are participating in this challenge and use the hashtag #junecodechallengewithshashwat and tag me.
LinkedIn Id: @shashwattiwari1999
Twitter Id: @shashwatt89
2. Comment on each of the 30 videos in 30 days.
Example:
Day 1 Completed on first video,
Day 2 Completed on second video.
.
.
.
Day 30 Completed on 30th Video.
3. Day 11 and Day 21: make a LinkedIn and twitter post mentioning your progress in the challenge, you can share your learnings. (don't forget to tag me and use the hashtag mentioned.)
4. Day 30: Create a post mentioning that you completed this challenge!
Prize: 1 Lucky winner will get mechanical keyboard.
June code challenge with shashwat playlist:
• June Code Challenge wi...
....................................................................................................................................................
In this lecture, we will study about programming language, its type and memory management.
Topics covered:
1. Median of a row-wise sorted matrix
Java Plus DSA Placement Course:
• Java and DSA Course Pl...
Notes:
github.com/Tiwarishashwat/Jav...
Telegram Link:
shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding #problemsolving leetcode, hackerrank,
median of a matrix, median of a row wise sorted matrix, binary search in java, binary search on matrix, search in a matrix, find median of a matrix,
hackerearth, codechef, codesignal, algorithms, javaprogramming, sde, placement, programming, programming language, java, dsa, coding, memory management, java plus dsa placement course,
coding, programming, programmer, python, developer, code, javascript, coder, computerscience, technology, java, codinglife, html, webdeveloper, tech, webdevelopment, css, software, webdesign, softwaredeveloper, linux, programmers, softwareengineer, php, programmingmemes, machinelearning, programminglife, pythonprogramming, codingisfun, java plus dsa, java, dsa, faang, interview questions, placement course, learn in the best way
Amazing explanation sir.... i was not able to understand this question on striver's channel, saw the comment section and someone shared your video's link to this question .... and that's how i came here.
Keep it up man.
Great! You can also checkout BS series for all variations of similar problem😃
@@shashwat_tiwari_stbehan ke lode madarchod kya smjhaya h tu
Same
same
same
After watching 3-4 videos......it made me understand the concept....nice work
how are we making sure that assumedMedian is always a part of the matrix?
Best explanation in yt, better than anyone. thank u tiwari ji
how do you make sure that the assumed median is always present in the matrix?
simple and clear explanation!
thanks for updated video😍
Thank you sir,very well explained
Great explanation 🙌
those who are finding it difficult to understand just watch it once (bcz on whole yt this is best) then see the code and write the code by taking help of this vdo then again go through the video you will get it deeply.
really amazing explanation
Although I watched previous video(white board one), But I will watch this video too : P
this gained you a subscriber
don't forget to subscribe!!!!!
watch at 1.25 for better experience
excellent
Mja aa gya sir ji😀😀
Day 14 challenge completed #junecodechallengewithshashwat
aesa samjhaya h ki bacha bacha smajh jae
Had a doubt what to know before doing arraylist and linkedlist my exams are cominy so can u pls list the pre requisites before these topics sir??
Java dsa sheet out hai, topics order wise hi hai. LinkedList ke pehle, you need to know Oops concepts, recursion and basics to hai hi.
minium remove to make a valid parathesis ki video dalna
Already uploaded
ua-cam.com/video/FB6wSdPjVGw/v-deo.html
ham
Na Nhi aaega. Binary Search on Answer concept ka logic hi yhi hai. Search space end hone pr hi Answer aata hai.
What is the time and space complexity for this code ?
Log2000*(LogN*M) where N and M are rows and columns and base of the log will be 2. You can watch my Time Complexity lecture for detailed explanation
If we choose max and min value of matrix for search space then whats the complexity.
I understool the algorithm, but still confused how this algorithm ensures that the value returned i.e. (start or min) exists in the matrix, as it started as the min limit 1 & max limit 2000 those were never in the matrix (not in example at least) and calculation for mid = s +(e-s)/2 is only giving the mid values of those limits and we are couting and updating the min ,max and at the last when min goes bigger than max , return min.
Hi,.
This is Binary Search on Answer concept.
Here we don't deal with actual value.
We take a value in range( It may or may not exist in the array /matrix)
Now, if this arbitrary value is an answer, it will definitely exist and if it does not exist then it cannot be our answer.
@@shashwat_tiwari_st so can we take the end as Integer.MAX_VALUE as well ?
I think the solution on GFG and most of YT is wrong (and i think the reason is that this question hasn't been asked a lot repeatedly). However once we have the value calculated as shown in the video we can quickly form the answer in lets say O (R*Log(C))
Time complexity of the above code should be mentioned in the video
Sure!
Day 14 challenge completed #junecodechallengewithshashwat