Тёмный

Leetcode 2370. Longest Ideal Subsequence | Weekly Contest 305. Medium 

Code with Alisha
Подписаться 28 тыс.
Просмотров 6 тыс.
50% 1

Use coupon ALISHA on any GeeksforGeeks course to get 10% discount:
practice.geeksforgeeks.org/co...
Connect with me on LinkedIn : / alisha-parveen-80579850
Check out our other playlists:
Dynamic Programming:
• Dynamic Programming
Trees:
• Trees
Heaps and Maps:
• Heaps and Maps
Arrays and Maths:
• Arrays and Maths
Bit Manipulation:
• Bit Manipulation
Greedy Algorithms:
• Greedy Algorithms
Sorting and Searching:
• Sorting and Searching
Strings:
• Strings
Linked Lists:
• Linked Lists
Stack and Queues:
• Stacks and Queues
Two Pointers:
• Two pointers
Graphs, BFS, DFS:
• Graphs, DFS, BFS
Backtracking:
• Backtracking
Non- DSA playlists:
Probability:
• Probability
SQL-Basic Join functions:
• SQL - Basic JOIN Funct...
SQL-Basic Aggregate functions:
• SQL-Basic Aggregate Fu...

Опубликовано:

 

6 авг 2022

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 15   
@probabilitycodingisfunis1
@probabilitycodingisfunis1 Год назад
vectordp(26,0); int ans = 0; for(int i=0;i=0 && j>=element-k; j--) { if(j==element && dp[j]==0) { dp[j] = 1; ans = max(ans,dp[element]); continue; } dp[element] = max(dp[element], dp[j]+1); } //right limit for(int j=element+1;j
@TonyStark90743
@TonyStark90743 Год назад
Please solve biweekly contests too. That would be very helpful, Alisha.
@SairamBandi-vk1on
@SairamBandi-vk1on 3 месяца назад
good job alisha
@Ak-um1yg
@Ak-um1yg Год назад
17:38 u can simply assign ans = 1 take some break in between .. U feel like exhausted ...voice loudness has decreased nice explanation 👍
@sarankumaar6009
@sarankumaar6009 Год назад
thank u so much for the video.
@princegupta5339
@princegupta5339 Год назад
alisha I can uderstand you totally
@mashab9129
@mashab9129 Год назад
brilliant walk through !! can also just set ans initially to 1 vs 0 ?
@ahmmedabdullahsaquif559
@ahmmedabdullahsaquif559 3 месяца назад
wow..well approach
@1084kmp
@1084kmp Год назад
Nicely done
@SandeepSaini-gi9ir
@SandeepSaini-gi9ir Год назад
Please Explain Leetcode 2035 problem, the concept of meet in the Middle.
@nikhilrajsoni4541
@nikhilrajsoni4541 Год назад
Subscribed ma'am
@ROHITKADYANJI
@ROHITKADYANJI Год назад
You are given 3 binary strings A, B, and C each of length N. You select the string A and shuffle its characters. Similarly, you can do this for the strings B as well as C. Let, X, Y, and Z be the decimal representations of the strings A, B, and C respectively after shuffling is done. Let, G = X⊕Y⊕Z. You want to make the value of G equal to 0. Output "YES", if it is possible to shuffle the strings A, B, and C so that G becomes 0, else print "NO" in a new line. ex:Assumptions N = 3 A = 101 B = 011 C = 110 op yes ma'am please take this question
@LongForgottenOne
@LongForgottenOne 9 месяцев назад
This sh1t is supposed to be medium??!?! I struggled a lot to understand it. But thank you, good video.
@r3xxxx
@r3xxxx 3 месяца назад
and today we got it as potd 💀
@abhinavmishra3954
@abhinavmishra3954 Год назад
Aapka wfh chal raha hai ??
Далее
Я ВЕРНУЛСЯ 🔴 | WICSUR #shorts
00:57
Просмотров 767 тыс.
The LeetCode Fallacy
6:08
Просмотров 451 тыс.
Leetcode 5. Longest Palindromic Substring
23:52
Просмотров 44 тыс.
Longest increasing subsequence
20:44
Просмотров 126 тыс.
Crack coding rounds in Big Tech
14:44
Просмотров 13 тыс.