We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Viral Advertising
  5. Discussions

Viral Advertising

Sort by

recency

|

1342 Discussions

|

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/SbHCdf_c7ss

    int viralAdvertising(int n) {
    int ans = 0, shared = 5;
    for(int i = 1; i <= n; i++){
        ans += shared / 2;
        shared = (shared/2)*3;
    }
    return ans;
}

  • ali313xA
     + 0 comments
    function viralAdvertising(n) {
    let shared = 5; 
    let ans = 0; 
    for(let i = 1; i <= n; i++) {
        let liked = Math.floor(shared / 2);
        ans += liked; 
        shared = liked * 3; 
    }
    return ans; 
}

  • Ramesh_Kumar_S
     + 0 comments

    Python3 Simple Brute force approach.

    def viralAdvertising(n):
    Acc = 0
    Shares = 5  # Initial shares on the first day

    for _ in range(n):
        Likes = Shares // 2  # Calculate likes as half of the shares
        Acc += Likes  # Accumulate the total likes
        Shares = Likes * 3  # Calculate new shares based on the likes

    return Acc

  • alex_k5
     + 0 comments

    Solution with recursion

    def viralAdvertising(n): def rec(n, r): if n == 1: return r return r + rec(n-1, r*3//2)

    return rec(n, 2)

  • mehran_khmn
     + 1 comment

    I spent a lot of time trying to figure out an o(1) solution.

    It looks like a form of exponential or logarithmic growth that can be calculated without iterating through an array. Anyone have any ideas?