- 263
- 30 264
GDSC FIU
United States
Приєднався 30 вер 2020
Welcome to the Developer Student Club at Florida International University! We're the coolest tech organization at FIU. DSC is a program supported by Google Developers. Our mission is to train thousands of student developers to work with their communities to solve real-life problems. By joining DSC, you’ll grow your knowledge in a peer-to-peer learning environment and build solutions for local businesses and your community. Students of ALL majors with an interest in growing as a developer are welcomed!
[Game Dev #1] - "So, you want to make a video game?" - Video Game Fundamentals
[Game Dev #1] - "So, you want to make a video game?" - Video Game Fundamentals
Переглядів: 123
Відео
![[AI] - Fourth Developer Community Meeting, Spring 2022](http://i.ytimg.com/vi/MYX9wNxoYlo/mqdefault.jpg)
![[AI] - Fourth Developer Community Meeting, Spring 2022](/img/tr.png)
[AI] - Fourth Developer Community Meeting, Spring 2022
Переглядів 172 роки тому
[AI] - Fourth Developer Community Meeting, Spring 2022
![[AI] - Third Developer Community Meeting, Spring 2022](http://i.ytimg.com/vi/GHFc7s7HH80/mqdefault.jpg)
[AI] - Third Developer Community Meeting, Spring 2022
Переглядів 212 роки тому
[AI] - Third Developer Community Meeting, Spring 2022
Data Analysis with Pandas and Matplotlib
Переглядів 372 роки тому
Data Analysis with Pandas and Matplotlib
![[AI] - Second Developer Community Meeting, Spring 2022](http://i.ytimg.com/vi/h-rrtMNGoWI/mqdefault.jpg)
[AI] - Second Developer Community Meeting, Spring 2022
Переглядів 352 роки тому
[AI] - Second Developer Community Meeting, Spring 2022
![[AI] - First Developer Community Meeting, Spring 2022](http://i.ytimg.com/vi/BHj2GwE6TQM/mqdefault.jpg)
[AI] - First Developer Community Meeting, Spring 2022
Переглядів 462 роки тому
[AI] - First Developer Community Meeting, Spring 2022
Web Dev - React MERN stack Project Set up - Spring 2022
Переглядів 4422 роки тому
Web Dev - React MERN stack Project Set up - Spring 2022
LeetCode #1553 - Minimum Number of Days to Eat N Oranges: Dynamic Programming
Переглядів 2132 роки тому
LeetCode #1553 - Minimum Number of Days to Eat N Oranges: Dynamic Programming
LeetCode #91 - Decode Ways: Dynamic Programming
Переглядів 352 роки тому
LeetCode #91 - Decode Ways: Dynamic Programming
LeetCode #198 - House Robber: Dynamic Programming
Переглядів 202 роки тому
LeetCode #198 - House Robber: Dynamic Programming
LeetCode #70 - Climbing Stairs: Dynamic Programming
Переглядів 162 роки тому
LeetCode #70 - Climbing Stairs: Dynamic Programming
LeetCode #208 - Implement Trie (Prefix Tree): Trie Trees
Переглядів 242 роки тому
LeetCode #208 - Implement Trie (Prefix Tree): Trie Trees
LeetCode #1268 - Search Suggestions System: Trie Trees
Переглядів 2572 роки тому
LeetCode #1268 - Search Suggestions System: Trie Trees
LeetCode #45 - Jump Game II: Arrays ft. Ember Sunn
Переглядів 1612 роки тому
LeetCode #45 - Jump Game II: Arrays ft. Ember Sunn
LeetCode #684 - Redundant Connection: Graphs
Переглядів 272 роки тому
LeetCode #684 - Redundant Connection: Graphs
LeetCode #547 - Number of Provinces: Graphs
Переглядів 592 роки тому
LeetCode #547 - Number of Provinces: Graphs
LeetCode #301 - Minimum Height Trees: Trees
Переглядів 362 роки тому
LeetCode #301 - Minimum Height Trees: Trees
LeetCode #1718 - Construct the Lexicographically Largest Valid Sequence: Backtracking
Переглядів 7272 роки тому
LeetCode #1718 - Construct the Lexicographically Largest Valid Sequence: Backtracking
LeetCode #1774 - Closest Dessert Cost: Backtracking
Переглядів 1902 роки тому
LeetCode #1774 - Closest Dessert Cost: Backtracking
LeetCode #691 - Stickers to Spell Word: Backtracking
Переглядів 1,3 тис.2 роки тому
LeetCode #691 - Stickers to Spell Word: Backtracking
LeetCode #1079 - Letter Tile Possibilities: Backtracking
Переглядів 3,5 тис.2 роки тому
LeetCode #1079 - Letter Tile Possibilities: Backtracking
LeetCode #430 - Flatten a Multilevel Doubly Linked List: Linked Lists
Переглядів 182 роки тому
LeetCode #430 - Flatten a Multilevel Doubly Linked List: Linked Lists
LeetCode #328 - Odd Even Linked List: Linked Lists
Переглядів 122 роки тому
LeetCode #328 - Odd Even Linked List: Linked Lists
LeetCode #25 - Reverse Nodes in k Group: Linked Lists
Переглядів 212 роки тому
LeetCode #25 - Reverse Nodes in k Group: Linked Lists
LeetCode #1669 - Merge In Between Linked Lists: Linked Lists
Переглядів 3162 роки тому
LeetCode #1669 - Merge In Between Linked Lists: Linked Lists
LeetCode #811 - Subdomain Visit Count: Arrays
Переглядів 2032 роки тому
LeetCode #811 - Subdomain Visit Count: Arrays
LeetCode #1402 - Reducing Dishes: Arrays
Переглядів 1452 роки тому
LeetCode #1402 - Reducing Dishes: Arrays
LeetCode #957 - Prison Cells After N Days: Arrays
Переглядів 392 роки тому
LeetCode #957 - Prison Cells After N Days: Arrays
LeetCode #1475 - Final Price with a Special Discount in a Shop: Arrays
Переглядів 3062 роки тому
LeetCode #1475 - Final Price with a Special Discount in a Shop: Arrays
I want to participate! How do I reach out?
Hey! You can stop by our meetings every week, they're on Wednesdays at 3:30 PM!
@@gdscfiu654 where at?
@@betolix In CASE 235!
This is the most simplest explanation by far! Thank you!
nicely done.
5:00
Great Video!!! Thanks
Very helpful video!
Really wonderful explanation. God Bless You.
thank you!!
dude that keeps talking and not letting my man teach (swag) is lucky I wasn't there or I'd of molested his ass during the lunch break😗
fake accent !!
Your linkedin profile ?
You are so good at explaining! Thank you! 🙏
Brilliant solution
Thank you !
Thanks :)
Thank you for such a lucid explanation! I watched 4 other videos on UA-cam about this question and as of writing this comment, the quality of those videos left much to be desired.
Thanks for the solution. I think you actually write in the reverse while using a mouse
good explanation.
Greatly explained!
Looks nice and clear!
thanks, this video really helps me understanding this question, thx
Thanks for the amazing vid! I've been looking for a good explanation for this problem everywhere
Still a bit confused the else if
if you mean the 'else if p2 < len(right)' then the reason for this is because we still have some elements in the right list that were greater than the elements in the left list. Therefore, we must add these remaining elements to the merge list.
Will this work if the duplicates are more than 2?
Yes, the hashmap will contain the frequency of each subtree. Therefore, if there are more than 2 duplicates then the hashmap will notice this
Please continue with this series. Very much liked.
Sir,How to represent all the min cuts of graph in the form of cactus graph?
Decompose the cactus graph into simple cycles and create a new graph where the vertices are the cycles of the cactus graph. Connect cycles by an edge if they share a vertex. The resulting graph would be a tree and is a representation of all the mincuts of the cactus graph because any 2 edges on any one of these cycles will give you a mincut, thus characterizing all the mincuts.
@@girinarasimhan9500 but in the first place we don't have cactus graph know sir. We are given a Normal weighted graph and we have to represent all its min cuts in the form of cactus graph.
@@girinarasimhan9500 Sir please give some hint for creating cactus graph from given original graph.
Giri and David
Wow, this workshop is, might I say, a little pog
We would even go as far to say this is epic
I went too slow!! Sorry guys!
Prof. Giri Rocks. Good Explanation Prof.
Loved it! exactly what I needed
Loved it!
I loved this!
This helped me so much! thank you
You are great
My grandson I love you
Great job David!
I had this guy as my professor last semester and he was great! 👍
What is the time and space complexity of the solution above?
O n ² and on
May I know how to join the discord channel?
This was a very helpful video, thank you!
Best video for this question on UA-cam.
I know it aint much but you get my subscribe. Hats off best explanation to this problem Thanks!
Nice channel!! Keep uploading! A little tip, go and search for SMZeus . c o m! I’ve been using it to promote my main channel and it helped me get my videos higher in the search results!!!