Coders Crushby Napplied AI
Back to Arena
HardGraph Algorithms

Social Network Influence Maximization

Given a social network graph, find the k most influential users to seed a viral marketing campaign, maximizing expected reach.

Constraints
Network has 1M+ nodes. Use Independent Cascade or Linear Threshold model.
Examples & Scenarios

This is an Arena challenge - solutions are not shown publicly.

Work on this problem and submit your solution to contribute!

Stats
Views
0
Solutions
0
Submitted By

Coders Crush Team

12/11/2025

Tags
Graph Theory
Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

Looking for jobs? Visit Napplied AI Jobs Search Agent

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • My Crush

Coders Crush by Napplied AI - Tech Interview & Coding Should Be Effortless

Influence Propagation
Optimization