Our first design video. Here we go with the breakdown of a possible portfolio project!
Skip to content

takeUforward

Change Theme
Change Theme
  • Striver’s DSA Sheets
    • Strivers A-Z DSA Course
      (Absolute beginner)
    • Strivers SDE Sheet
      (For anyone who knows DSA)
    • Strivers 79 Sheet
      (For anyone with minimal time for interviews)
  • Striver’s DSA Playlists
    • Patterns (Beginner)
    • Arrays Series
    • Tree Series
    • Graph Series
    • DP Series
  • System Design
  • CS Subjects
    • SDE Core Sheet
    • Operating Systems
    • Computer Networks
  • Interview Prep Sheets
    • Blind 75
    • TCS NQT Coding Sheet
    • Interview Experience
    • Interview Prep Roadmap
  • Striver’s CP Sheet

Category: Graph

November 23, 2022 Data Structure / Graph

Minimum Spanning Tree – Theory: G-44

In this article, we will be discussing the minimum spanning tree. So, to understand the minimum spanning tree, we first

Continue reading
November 23, 2022 Data Structure / Graph

Find the City With the Smallest Number of Neighbours at a Threshold Distance: G-43

Problem Statement: There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi,weighti] 

Continue reading
November 23, 2022 Data Structure / Graph

Floyd Warshall Algorithm: G-42

Problem Statement: The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed

Continue reading
November 23, 2022 Data Structure / Graph

Bellman Ford Algorithm: G-41

Problem Statement: Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of

Continue reading
November 23, 2022 Data Structure / Graph

Dijkstra’s Algorithm – Using Set : G-33

Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list

Continue reading
November 23, 2022 Data Structure / Graph

Dijkstra’s Algorithm – Using Priority Queue : G-32

Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list

Continue reading
November 23, 2022 Graph

Word Ladder-II (Optimised Approach) G-31

Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all

Continue reading
November 9, 2022 Graph

G-30 : Word Ladder-II

Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all

Continue reading
November 9, 2022 Data Structure / Graph

Alien Dictionary – Topological Sort: G-26

Problem Statement: Given a sorted dictionary of an alien language having N words and k starting alphabets of a standard

Continue reading
November 9, 2022 Data Structure / Graph

Find Eventual Safe States – BFS – Topological Sort: G-25

Problem Statement: A directed graph of V vertices and E edges is given in the form of an adjacency list

Continue reading

Posts navigation

«Previous Posts 1 2 3 4 5 … 7 Next Posts»
Latest Video on takeUforward
Latest Video on Striver

Recent Posts

  • Functions in Java (Pass by Reference and Value)
  • Functions in C++ (Pass by Reference and Value)
  • While Loops in Programming
  • Understanding For Loop
  • Switch Case Statements

TUF Logo

Don't have an account?

TUF Logo

Already have an account?

Company tags



0/4000

Company yt-sol

takeUforward
The best place to learn data structures, algorithms, most asked
coding interview questions, real interview experiences free of cost.
Follow Us
DSA Playlist Array Series Tree Series Graph Series DP Series
DSA Sheets Striver’s SDE Sheet Striver’s A2Z DSA Sheet SDE Core Sheet Striver’s CP Sheet
Contribute Write an Article
Copyright © 2023 takeuforward | All rights reserved