Phyton Talent Advisors’ Post

Hello Guys, ✅ I want to share insights about the Topological Sort Algorithm. ⭐ Topological Sort is a linear ordering of vertices in a Directed Acyclic Graph (DAG) such that for every directed edge (u -> v), vertex u comes before vertex v in the ordering. Real-Time Examples 🌟 Course Prerequisites 🌟 Dependency Installation (Maven and NPM) 🌟 Task Schedule Topological Sorting can be achieved in two ways. 1. BFS (Breadth-First Search)- Kahn's Algorithm 2. DFS (Depth-First Search) ✅ LeetCode Problems 👉 Course Schedule - 207 👉 Course Schedule II - 210 👉 Alien Dictionary - 269 👉 Parallel Courses - 1136 #java #DSA #LeetCode #TopologicalSort #Problem_Solving #Problems #Software_Engineer #Tree #Graph

🌟 Achievement Unlocked: Solved a Complex Graph Problem on LeetCode! 🌟 I am thrilled to share that I recently solved a challenging graph problem on LeetCode. 🎉 Graphs can be quite intricate, with their nodes and edges representing relationships in a variety of contexts, from social networks to transportation systems. This problem really pushed me to think critically and apply concepts like BFS, DFS, and shortest path algorithms. Problem solving|Leetcode | 207. Course Schedule| Graph Priblem Link: https://lnkd.in/gGxETTuU Github Solution: https://lnkd.in/giFgDcQJ #datastructure #algorithm #dynamicprogramming #DSA #Java #leetcode #problemsolving #leetcode #leetcodehard #graph 

I just earned the Variables [Memory] badge on Codédex! 🏅 It's been a great experience diving into Python from the basics to strengthen my foundation. Looking forward to continuing the learning journey! #Python #Coding #Learning #Codedex

🚀#Day34 of #100daysofcodechallenge 💻 Topic -> 🎯 Recursion Questions -> Bubble Sort -> Reverse a string -> A to the power of B -> Selection sort -> Insertion sort #dsa #datastructuresandalgorithms #leetcode #100daysofdsachallenge

🎯 Week 4: 🌡Solved Five DSA problem on LeetCode . #leetcode Question 🔸 Symmetric Tree.(Topic: Binary Tree) 🔸 Binary tree Inorder Traversal. (Topic: Binary Tree) 🔸 Binary tree Preorder Traversal . (Topic: Binary Tree) 🔸 Binary tree Postorder Traversal . (Topic: Binary Tree) 🔸Sqrt(x) . (Topic: Binary search) #leetcode #dsa #100daysofcoding #100dayscodingchallenge #binarysearch #binarytree Be Consistent ✌️

**Day 4/100 - 100 Days of Code Challenge** **Today's Progress:** Revised Recursion (week-7 of Love Babbar) lecture question and concepts. Also, I took time to revise my notes. 📝 **Questions:** --->How to write recursive function 1. Binary Search. 2.Checking for Sorting. 3. and many small-small questions --->Include-exclude theorem and problem on this theorem. 1.subsequences of a substring #100Daysofcode #DSA #lovebabbar #leetcode #geeksforgeeks

🌟 #Day_7_Of_One_DSA_Problem_a_Day: Fibonacci Numbers on LeetCode! 🌟 Hello, LinkedIn community! Today, I tackled #LeetCode_Problem_509: Fibonacci Number. It was an exciting challenge that helped me explore various methods to solve this classic problem. What I Learned: Iterative Method: Efficient and simple with low space complexity. Recursive Method with Memoization: Optimizes the naive recursive approach by storing previous results. Key Takeaways: Iterative Approach: Straightforward and efficient. Recursive with Memoization: Enhances understanding of recursion and optimization. Let’s connect and share our experiences. 🚀 solution : https://lnkd.in/g75Vd3Zu Hyder Abbas PW (PhysicsWallah) Aryan Singh Raghav Garg Manvi Tyagi #Java #LeetCode #DSA #DynamicProgramming #Recursion #CodingChallenge #LearningJourney

🌟 Day 3 of #leetcode 🚀 🔥 Problem 199: Binary Tree Right Side View... 💡 Approach: 1. Recursive Depth-First Search (DFS) -> Traverse the Tree: Use recursion to traverse the tree starting from the root. -> Maintain Depth Information: Keep track of the current depth to determine if the node should be added to the result. -> First Encounter: Only add the first node encountered at each depth (rightmost node). 2. Iterative Breadth-First Search (BFS) -> Level Traversal: Traverse the tree level by level. -> Rightmost Node: At each level, capture the last node encountered. #day3 #LeetCode #binarytreerightsideview #binarytree #dsa #problemsolving #learning 🔗 Program link -> https://lnkd.in/gZyAhrhe

➡️Day 54 of #100daysofcode Challenge Journey! 🚀 Binary Tree Maximum Path Sum (LeetCode) Problem statement : A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path. Problem Link :https://lnkd.in/dt25fDuA #100daysofcodechallenge #DrGViswanathan #VITBhopal #VITBhopalLion #DrGViswanathanChallenge #drgvishwanathanchallenge #LeetCode #GeeksForGeeks

There are many ways to reverse a string. In this video, we will specifically reverse a string using recursion. #campushire #javafullstackdevelopercourse #javaplacementcourse #javajobs