Skip to content
  •  Soul Society
  •  0858#969#6261
  •  N/A
Dev Path for CC
  • About
  • Contact

Tag: Prim

3419. Minimize the Maximum Edge Weight of Graph
LeetCode

3419. Minimize the Maximum Edge Weight of Graph

January 12, 2025 Heap, Medium, Minimum Spanning Tree, Prim

‘Node 0 must be reachable from all other nodes.’ means 0 is the root of a tree. And because we are going to remove…

Leave a Comment on 3419. Minimize the Maximum Edge Weight of Graph

Recent Posts

  • 🚨 Welcome to the Era of o4: Powerful, Autonomous… and Hallucinating?
  • 3472. Longest Palindromic Subsequence After at Most K Operations
  • 3473. Sum of K Subarrays With Length at Least M
  • 3474. Lexicographically Smallest Generated String
  • 1524. Number of Sub-arrays With Odd Sum

Recent Comments

  1. lcsqr on 1462. Course Schedule IV
  2. lcsqr on 1462. Course Schedule IV
  3. lcsqr on 3409. Longest Subsequence With Decreasing Adjacent Difference
  4. lcsqr on 3413. Maximum Coins From K Consecutive Bags
  5. lcsqr on 3411. Maximum Subarray With Equal Products

Archives

  • April 2025
  • March 2025
  • February 2025
  • January 2025

Categories

  • Artificial Intelligence
  • LeetCode
  • Others
Designed by Nasio Themes || Powered by WordPress