Skip to main content

Posts

Showing posts with the label BFS

Full Stack Developer Without Degree: How to Become One

If you're interested in becoming a Full Stack Developer without a degree, we've put together some tips and resources to help you get started. Learn the Fundamentals The first step to becoming a Full Stack Developer is to learn the fundamentals of coding. You can start with HTML, CSS, and JavaScript, which are the building blocks of web development. There are plenty of free resources available online, such as Codecademy and FreeCodeCamp, which offer interactive courses that teach you the basics of web development. Once you have a solid understanding of the basics, you can move on to more advanced topics such as back-end development, databases, and frameworks. You can learn these topics through online courses or by working on personal projects. Build a Portfolio One of the most important things you can do as a Full Stack Developer is to build a portfolio. Your portfolio should showcase your skills and experience and demonstrate your ability to build real-world applications. You c...

BFS of graph (DSA)

  Problem Statement :(👈click here for GFG) Given a directed graph. The task is to do Breadth First Traversal of this graph starting from 0. Note:  One can move from node u to node v only if there's an edge from u to v and find the BFS traversal of the graph starting from the 0th vertex,  from left to right according to the graph. Also, you should only take nodes directly or indirectly connected from Node 0 in consideration. Example 1: Input: Output: 0 1 2 3 4 Explanation : 0 is connected to 1 , 2 , 3. 2 is connected to 4. so starting from 0, it will go to 1 then 2 then 3.After this 2 to 4, thus bfs will be 0 1 2 3 4. Example 2: Input: Output: 0 1 2 Explanation : 0 is connected to 1 , 2. so starting from 0, it will go to 1 then 2, thus bfs will be 0 1 2. Your task: You dont need to read input or print anything. Your task is to complete the function bfsOfGraph() which takes the integer V denoting the number of vertices and adjacency list as inpu...