TCS Digital Interview Experience 12th Sept 2020: https://techdose.co.in/tcs-codevita2020-interview-experience/

This Sunday I will be taking a LIVE session on a typical recursion problem where people can ask LIVE questions to get the topic absolutely clarified. This will only be for channel members and it's a beta phase work. Once it's successfull I will announce to everyone.

Thanks for your love & support ❤️

LINK for 7 days DSA brush-up sheet: https://techdose.co.in/wp-content/uploads/2020/12/7Days_Plan.pdf

Happy new year everyone ❤️ May this new year be healthy, prosperous and joyful for you all 🎉

𝐇𝐢 𝐂𝐨𝐝𝐞𝐫𝐬!!

Is 𝐆𝐑𝐀𝐏𝐇 algorithm your biggest worry in interview prep ?

Do you want to greatly improve and gain confidence in 𝐆𝐑𝐀𝐏𝐇 algorithms ?

If you answer is 𝐘𝐄𝐒, then you should join our 30 𝑑𝑎𝑦𝑠 𝐺𝑟𝑎𝑝ℎ 𝑝𝑟𝑜𝑏𝑙𝑒𝑚𝑠 𝑐ℎ𝑎𝑙𝑙𝑒𝑛𝑔𝑒 where I will share 1 problem a day with the solution for the same on next day with a brief on the approach used.

.

It will be posted on our 𝐓𝐞𝐥𝐞𝐠𝐫𝐚𝐦 channel everyday for the 𝑛𝑒𝑥𝑡 30 𝑑𝑎𝑦𝑠 from 𝐉𝐚𝐧 𝟏𝐬𝐭 (evening).


#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-1:
Course Schedule: https://leetcode.com/problems/course-schedule/
Leetcode #207

Solution will be shared tomm evening followed by a new question 🙂

#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-1: Solution
Course Schedule: https://leetcode.com/problems/course-schedule/
Leetcode #207

Algorithm: Cycle detection
Solution Video: https://www.youtube.com/watch?v=kXy0ABd1vwo

Day-2:
Course Schedule-2: https://leetcode.com/problems/course-schedule-ii/
Leetcode #210

Please go through the algorithm from the link below (Please don’t watch the course schedule part in the 2nd half of the video without solving yourself 🙂 )
Algorithm: Topological Sort -> https://youtu.be/qe_pQCh09yU
Solution will be shared tomm evening followed by a new question 🙂

#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-2: Solution
Course Schedule-2 (Topological Sort): https://youtu.be/qe_pQCh09yU
Leetcode #207

Algorithm: Topological Sort

#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-3:
All Paths From Source to Target:
https://leetcode.com/problems/all-paths-from-source-to-target/
Leetcode #797

Algorithm: DFS
Video for DFS: https://youtu.be/CvUMf8c2JFo
Please go through the video to understand DFS and then implement in the problem 🙂

Solution will be shared tomm evening 🙂

#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-3: Solution
All Paths From Source to Target (Topological Sort):
https://leetcode.com/problems/all-paths-from-source-to-target/
Leetcode #797

Algorithm: DFS
Video for DFS: https://youtu.be/CvUMf8c2JFo
Please go through the video to understand DFS and then implement in the problem 🙂

Solution CODE: https://gist.github.com/SuryaPratapK/ae74fe725299479eca9ed45a02680941
STEPS:-
1 Make adjacency-list
2 Find all possible paths using DFS (by maintaining current path in stack or array)

#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-4: DFS
Clone Graph
Leetcode #133

Algorithm: DFS
Video for DFS: https://youtu.be/CvUMf8c2JFo
Please go through the video to understand DFS and then implement in the problem 🙂

Solution will be shared on the next day 🙂


#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-4: Solution
Clone Graph
Leetcode #133

Algorithm: DFS
Video for DFS: https://youtu.be/CvUMf8c2JFo
Clone Graph (Solution): https://youtu.be/f2EfGComRKM
Please go through the video to understand DFS and then implement in the problem 🙂



#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-5:

Number of Operations to Make Network Connected
Leetcode #1319

Algorithm: Disjoint Set
Video for Disjoint Set (Union & Find): https://youtu.be/eTaWFhPXPz4
Video for Disjoint Set (Union by RANK & Find->Path Compression): https://youtu.be/kaBX2s3pYO4

Please go through the video to understand DFS and then implement in the problem 🙂



#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-5: Solution

Number of Operations to Make Network Connected
Leetcode #1319

Algorithm: Disjoint Set
Solution Link: https://youtu.be/3JIwIRir2sM
CODE Link: https://gist.github.com/SuryaPratapK/277764a98ebbfb3618091503611a2fa1
Video for Disjoint Set (Union & Find): https://youtu.be/eTaWFhPXPz4
Video for Disjoint Set (Union by RANK & Find->Path Compression): https://youtu.be/kaBX2s3pYO4

Please go through the video to understand Disjoint Set and then implement in the problem



#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-5:
Number of Provinces
Leetcode #547

Algorithm: Disjoint Set
Video for Disjoint Set (Union & Find): https://youtu.be/eTaWFhPXPz4
Video for Disjoint Set (Union by RANK & Find->Path Compression): https://youtu.be/kaBX2s3pYO4

Please go through the video to understand Disjoint Set and then implement in the problem 🙂



#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Above problem is for Day-6 🙂

Day-6: Solution
Number of Provinces
Leetcode #547

Algorithm: Disjoint Set
Code Implementation: https://gist.github.com/SuryaPratapK/fe865b1680aceda9594a5160f80fb870
Video for Disjoint Set (Union & Find): https://youtu.be/eTaWFhPXPz4
Video for Disjoint Set (Union by RANK & Find->Path Compression): https://youtu.be/kaBX2s3pYO4

Logic:-
1 Use disjoint set to add all edges
2 DSUF array will have -1 value for only absolute parents
3 No of -1 = No of absolute parents = No of components (because all absolute parents belongs to different tree, hence different components 🙃 )

Please go through the video to understand Disjoint Set and then implement in the problem 🙂



#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa

Day-7:
Evaluate Division
Leetcode #399

Algorithm: Disjoint Set
Video for Disjoint Set (Union & Find): https://youtu.be/eTaWFhPXPz4
Video for Disjoint Set (Union by RANK & Find->Path Compression): https://youtu.be/kaBX2s3pYO4


Please go through the video to understand Disjoint Set and then implement in the problem 🙂


#30DaysOfGraph #techdose #interviewpreparation #graphs #dsa