Skip to main content

Full Stack Developer Without Degree: How to Become One

By
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...
Post a Comment

Detect cycle in a directed graph (DSA)

Image
By

 


problem Statement:(👈click here for GFG)

Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, check whether it contains any cycle or not.


Example 1:

Input:



Output: 1
Explanation: 3 -> 3 is a cycle


Example 2:

Input:


Output: 0
Explanation: no cycle in the graph
Your task:
You dont need to read input or print anything. Your task is to complete the function isCyclic() which takes the integer V denoting the number of vertices and adjacency list as input parameters and returns a boolean value denoting if the given directed graph contains a cycle or not.

Expected Time Complexity: O(V + E)
Expected Auxiliary Space: O(V)

Constraints:
1 ≤ V, E ≤ 10^5

Solution:
class Solution {
  // Function to detect cycle in a directed graph.
  isCyclic(V, adj) {
    // Create arrays to keep track of visited nodes and nodes in the current recursion stack.
    let visited = new Array(V).fill(false);
    let recStack = new Array(V).fill(false);

    // Helper function to check if the graph contains a cycle.
    function isCyclicHelper(node) {
      visited[node] = true;
      recStack[node] = true;

      // Check all adjacent nodes.
      for (let i = 0; i < adj[node].length; i++) {
        let neighbor = adj[node][i];

        // If the neighbor is not visited yet, recursively check if it is part of a cycle.
        if (!visited[neighbor] && isCyclicHelper(neighbor)) {
          return true;
        }

        // If the neighbor is already in the recursion stack, a cycle has been found.
        else if (recStack[neighbor]) {
          return true;
        }
      }

      // Remove the current node from the recursion stack.
      recStack[node] = false;

      return false;
    }

    // Check if the graph contains a cycle.
    for (let i = 0; i < V; i++) {
      if (!visited[i] && isCyclicHelper(i)) {
        return true;
      }
    }

    return false;
  }
}

Labels:

Comments

Post a Comment

Popular posts from this blog

Boundary Traversal of binary tree (DSA)

By
  Problem Statement :(👈click here for GFG) Given a Binary Tree, find its Boundary Traversal. The traversal should be in the following order:  Left boundary nodes:  defined as the path from the root to the left-most node  ie- the leaf node you could reach when you always travel preferring the left subtree over the right subtree.  Leaf nodes:  All the leaf nodes except for the ones that are part of left or right boundary. Reverse right boundary nodes:  defined as the path from the right-most node to the root. The right-most node is the leaf node you could reach when you always travel preferring the right subtree over the left subtree. Exclude the root from this as it was already included in the traversal of left boundary nodes. Note:  If the root doesn't have a left subtree or right subtree, then the root itself is the left or right boundary.  Example 1: Input: 1   /...
Post a Comment
Read more

JavaScript For Loops: A Complete Tutorial

By
A for loop in JavaScript is a control structure that allows you to repeat a block of code a specified number of times. It is one of the most commonly used loops in JavaScript and is often used when you need to iterate over an array or perform some action a fixed number of times. The syntax for a for loop in JavaScript is as follows: for (initialization; condition; increment/decrement) {    // code to be executed } Here's a breakdown of what each part of the for loop does: Initialization: This is where you initialize the loop variable. It's only executed once before the loop starts. Condition: This is the condition that's checked before each iteration of the loop. If the condition is true, the loop continues. If it's false, the loop ends. Increment/decrement: This is where you change the value of the loop variable after each iteration of the loop. It can be an increment (++) or a decrement (--). Code to be executed: This is the code that's executed for each iteration...
Post a Comment
Read more

Finding middle element in a linked list (DSA)

By
  Problem Statement:  (👈click here for GFG) Given a singly linked list of  N  nodes. The task is to find the  middle  of the linked list. For example, if the linked list is 1-> 2->3->4->5 ,   then the middle node of the list is  3 . If there are two middle nodes(in case, when  N  is even), print the  second middle  element. For example, if the linked list given is  1->2->3->4->5->6 , then the middle node of the list is  4 . Example 1: Input: LinkedList: 1->2->3->4->5 Output: 3 Explanation: Middle of linked list is 3. Example 2:  Input: LinkedList: 2->4->6->7->5->1 Output: 7 Explanation: Middle of linked list is 7. Your Task: The task is to complete the function getMiddle() which takes a head reference as the only argument and should return the data at the middle node of the linked list. Expected Time Complexity: O(N). Expected Auxilia...
Post a Comment
Read more