![Code with Alisha](/img/default-banner.jpg)
- Видео 345
- Просмотров 2 459 713
Code with Alisha
Индия
Добавлен 5 ноя 2020
Wish to make Data Structures and Algorithm problems easy. Join our journey and enjoy learning!
Nivedita, Co-founder Climate Warrior | M.S. in Environment Studies from University of Michigan
As co-founder of Climate Warrior Network, Nivedita has played a pivotal role in driving initiatives aimed at addressing climate change.
Просмотров: 842
Видео
Everything about product management | Sangeeta, Senior Director of Product Management at Beem
Просмотров 4512 месяца назад
Timestamps: 0:00 Introduction about Sangeeta 3:50 Educational & Job Background 6:35 Career Introspection & Shift 11:00 Journey into Product Manage 15:31 Lessons on PM 18:16 Why PM 24:50 Interesting project 28:35 People that inspires Sangeeta 31:20 filter for apply while applying for pm 36:09 advice to young girls 40:05 advice to manage stress
Kavitha | Founder of Coaching Business
Просмотров 4042 месяца назад
www.wellset.co/blog/productivity-menstrual-cycle Research material productivity cycle and period cycle thrive.kavithathecoach.com/products/My-Monthly-Goals-Worksheet-6639ab9b01204179049a5906?dgps_s=dsh&dgps_u=c&dgps_uid=62cf0af20cf2f25240bc2579&dgps_t=cp_m Timestamps: 0:00 Introduction 0:50 How did Kavitha start coaching business? 2:17 Learnings in coaching business 3:22 How to reach out to rig...
Monika Kothari | Founder of Betaa Capital | Growth Stage Investor in Stock market
Просмотров 9432 месяца назад
Chapters: 0:00 - Introduction 0:35 - How Monika got inspired to be in this space 4:15 - How Monika's father's opinion has changed now 5:10 - Who is better investor? Monika or her husband? 6:09 - What is growth stage investing 6:43 - Why do people have fear of investing 7:30 - How much stock market has actually growth in 20 years 8:30 - Where to start if you have never invested 11:21 - Important...
Building a Women's Health Business : Sanjana, Founder of ThePinkBox
Просмотров 5532 месяца назад
Explore pinkbox products here : www.thepinkbox.in thepinkboxindia 0:00 Introduction 1:25 Idea behind the product 2:52 About poro and its learning for current product 4:14 Lean methodology 5:56 Challenges to break stigma 8:55 Eco friendly product 10:54 Trends and importance of product 12:06 The bigger picture 13:32 Achievements 16:00 Awareness 17:46 Product data 18:40 Advice for yo...
How to Build your marketing Business #entrepreneurship #podcast
Просмотров 1,1 тыс.3 месяца назад
In talks with CEO, Brew Tech Marketing, Snigdha Srivastava Background of Snigdha 00:00 - 3:27 Snigdha's favorite brand and taglines - 3:27 - 5:07 Passions apart from work - 5:07-7:00 How did name Brew Tech Marketing come -7:00-9:44 Why is Brew tech Marketing successful - 9:44-11:37 How to bring first clients without a brand -11:37-12:49 How to overcome challenges as an entrepreneur, especially ...
Leetcode 894. All Possible Full Binary Trees
Просмотров 4,1 тыс.Год назад
Use coupon ALISHA on any GeeksforGeeks course to get 10% discount: practice.geeksforgeeks.org/courses Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/ Check out our other playlists: Dynamic Programming: ruclips.net/p/PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS Trees: ruclips.net/p/PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd Heaps and Maps: ruclips.net/p/PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_ou...
Walls Coloring | GeeksforGeeks POTD 14 Feb 2023 | Dynamic Programming
Просмотров 2,3 тыс.Год назад
Use coupon ALISHA on any GeeksforGeeks course to get 10% discount: practice.geeksforgeeks.org/courses Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/ Check out our other playlists: Dynamic Programming: ruclips.net/p/PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS Trees: ruclips.net/p/PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd Heaps and Maps: ruclips.net/p/PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_ou...
Leetcode 2435. Paths in Matrix Whose Sum Is Divisible by K |Dynamic Programming| Weekly Contest Hard
Просмотров 5 тыс.Год назад
Use coupon ALISHA on any GeeksforGeeks course to get 10% discount: practice.geeksforgeeks.org/courses Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/ Check out our other playlists: Dynamic Programming: ruclips.net/p/PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS Trees: ruclips.net/p/PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd Heaps and Maps: ruclips.net/p/PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_ou...
How to crack Top Product Based Companies? Become MAANG Ready using Bosscoder Academy
Просмотров 4,7 тыс.Год назад
Link to BossCoder Academy : bit.ly/3qICg6i Bosscoder Academy can help you Grab your Dream Tech Offer ✅ A highly structured, personalized, and guided world-class program ✅ Designed by industry experts ✅ That will make you the best of software developers out there ✅ For ambitious learners, who don't want to settle for anything less in their tech careers
Leetcode 2398. Maximum Number of Robots Within Budget | Biweekly Contest 86. | Hard | Most Optimal
Просмотров 2,8 тыс.2 года назад
Sliding Window Maximum: Problem: leetcode.com/problems/sliding-window-maximum/ Solution: ruclips.net/video/l_CFMVPKv2Q/видео.html Use coupon ALISHA on any GeeksforGeeks course to get 10% discount: practice.geeksforgeeks.org/courses Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/ Check out our other playlists: Dynamic Programming: ruclips.net/p/PLLT4EuYB4kIY_DWiiFY_TW3...
Leetcode 2397. Maximum Rows Covered by Columns | Biweekly Contest 86.
Просмотров 2,2 тыс.2 года назад
Use coupon ALISHA on any GeeksforGeeks course to get 10% discount: practice.geeksforgeeks.org/courses Connect with me on LinkedIn : www.linkedin.com/in/alisha-parveen-80579850/ Check out our other playlists: Dynamic Programming: ruclips.net/p/PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS Trees: ruclips.net/p/PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd Heaps and Maps: ruclips.net/p/PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_ou...
Leetcode 2395. Find Subarrays With Equal Sum | Biweekly Contest 86.
Просмотров 1,9 тыс.2 года назад
Leetcode 2395. Find Subarrays With Equal Sum | Biweekly Contest 86.
Leetcode 2401. Longest Nice Subarray | Weekly Contest 2401.
Просмотров 6 тыс.2 года назад
Leetcode 2401. Longest Nice Subarray | Weekly Contest 2401.
Leetcode 2392. Build A Matrix With Conditions | Weekly Contest 308.
Просмотров 3,5 тыс.2 года назад
Leetcode 2392. Build A Matrix With Conditions | Weekly Contest 308.
Leetcode 2391. Minimum Amount of Time to collect Garbage | Weekly Contest 308.
Просмотров 2,8 тыс.2 года назад
Leetcode 2391. Minimum Amount of Time to collect Garbage | Weekly Contest 308.
Leetcode 2390. Removing Stars From a String | Weekly Contest 308.
Просмотров 3,7 тыс.2 года назад
Leetcode 2390. Removing Stars From a String | Weekly Contest 308.
Leetcode 2389. Longest Subsequence With Limited Sum | Weeekly Contest 308. Easy
Просмотров 3,6 тыс.2 года назад
Leetcode 2389. Longest Subsequence With Limited Sum | Weeekly Contest 308. Easy
Leetcode 2370. Longest Ideal Subsequence | Weekly Contest 305. Medium
Просмотров 6 тыс.2 года назад
Leetcode 2370. Longest Ideal Subsequence | Weekly Contest 305. Medium
LEETCODE 2369. Check if There is a Valid Partition For The Array | WEEKLY CONTEST 305. MEDIUM
Просмотров 3,7 тыс.2 года назад
LEETCODE 2369. Check if There is a Valid Partition For The Array | WEEKLY CONTEST 305. MEDIUM
Leetcode 2368. Reachable Nodes With Restrictions | WeeklyContest 305. Medium
Просмотров 1,3 тыс.2 года назад
Leetcode 2368. Reachable Nodes With Restrictions | WeeklyContest 305. Medium
Leetcode 2367. Number of Arithmetic Triplets | Weekly Contest 305. Easy
Просмотров 4,8 тыс.2 года назад
Leetcode 2367. Number of Arithmetic Triplets | Weekly Contest 305. Easy
Leetcode 2360. Longest Cycle in a Graph | Weekly Contest 304. Hard Problem 4
Просмотров 10 тыс.2 года назад
Leetcode 2360. Longest Cycle in a Graph | Weekly Contest 304. Hard Problem 4
Leetcode 2359. Find Closest Node to Given Two Nodes | Weekly Contest 304. Problem 3 Medium
Просмотров 3 тыс.2 года назад
Leetcode 2359. Find Closest Node to Given Two Nodes | Weekly Contest 304. Problem 3 Medium
Leetcode 2358. Maximum Number of Groups Entering a Competition | Weekly Contest 304 Problem 2 Medium
Просмотров 2,5 тыс.2 года назад
Leetcode 2358. Maximum Number of Groups Entering a Competition | Weekly Contest 304 Problem 2 Medium
Leetcode 2357. Make Array Zero by Subtracting Equal Amounts | Weekly Contest 304. Problem 1 Easy
Просмотров 2,5 тыс.2 года назад
Leetcode 2357. Make Array Zero by Subtracting Equal Amounts | Weekly Contest 304. Problem 1 Easy
Leetcode 2352. Equal Row and Column Pairs | Weekly Contest 303. | Google Must Do interview Question
Просмотров 5 тыс.2 года назад
Leetcode 2352. Equal Row and Column Pairs | Weekly Contest 303. | Google Must Do interview Question
Leetcode 2354. Number of Excellent Pairs | Weekly Contest 303. Hard
Просмотров 1,8 тыс.2 года назад
Leetcode 2354. Number of Excellent Pairs | Weekly Contest 303. Hard
BST to greater sum tree | Transform BST to greater sum tree, node = sum of all nodes greater than it
Просмотров 3,8 тыс.2 года назад
BST to greater sum tree | Transform BST to greater sum tree, node = sum of all nodes greater than it
Minimum X (xor) A | GeeksforGeeks Problem of The Day
Просмотров 6 тыс.2 года назад
Minimum X (xor) A | GeeksforGeeks Problem of The Day
Excellent Video Thanks you great explanation.
This is such a neat explanation!
Thanks u have given very clear explaination
Simply count the frequencies in one iteration and then refill array using these frequencies in another iteration?
Tysm alisha, you have no idea how useful this video was to me <3
🙏🙏♥️♥️
In the example walkthrough, Even on Day 3, 2 transaction isn't possible right ? Why do we've to fill it then ?
very nice logic and good explantaion
🙏🙏♥️♥️
perfectly explained
Girl you are brilliant!
try to display more code in sigle page clearly
Good one , Thanks
Solved by your logic , watched till 4:56 only
This Video help me to clarify my doubts..
Thank u
Great work...everthing runs on brain...and thats why only brains communicate not mouth.
assalamualaikum mam. from bangladesh
you are so kind and lovely
Nice explanation ✨✨
aap bahut acha samjhate ho didi!!! thank u so much!!
thank you for intution
great explanation maam😀
Great explanation!!!
Excellent explanation, respect for you ❤❤
amazing video didi!! thank u so much!!
thanks
this is the best explanation i ever got
good explanation
Please ma'm try to make videos in 1080 picxels 🙂
Ma'm your explanation is very well 😊
Can't this be solved better with prefix and suffix array in O(n) time ?
Why this video is two hours long? 😕
Eye opener for me. Just an observation - we don't even need to counteven. Because if the bit is zero in the answer then we need to do nothing in the loop as we have initialized the answer to zero to start with. But for the sake of explanation you had it - Really helps.
SUPERB explanation - watched this videos several times to understand the logic. Thanks a Million. The right most set bit (determined from the XOR of the two numbers) is the key and in the two numbers that are different one will have the right most bit set and the other one will not
Great logic and explaination....Thanks for the video..
That's a great explanation ,You nailed it I say. I watched 4 to 5 videos, But your's is best!!!
Can you please tell without giving values to ans matrix vector how we are using it's value like you have written v[j]=ans[i-1][j]+ans[i-1][j-1];
Thanks Alisha didi
Excellent
XOR definition was perfect. But how does it apply to this problem at hand was not adequately explained. Anyways - but your solutions especially in C++ are GEMS. Hard to find anywhere else.. python, javascript solutions are available all over ... but C++ hard to find. I would say you were the first one to solve so much in C++
nice one
khud pdh ke khud samjh ke khud code kar li...bhut bdhiya -_-
on the first approach with storing the left and right max arrays, is that aslo a term called memoization ?
great explanation i follow your playlist of each for problem solving
WHAT IS SPACE AND TIME COMPLEXITY OF THIS SOLUTION?...
Best solution
greatt
Amazing explanation! Thank you so much!
good explanation. thank you very much