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. C++
  3. Inheritance
  4. Magic Spells
  5. Discussions

Magic Spells

Sort by

recency

|

116 Discussions

|

  • istvankiss_edu
     + 0 comments

    This problem is more about longest common subsequence than C++.......

  • yashdeora98294
     + 0 comments

    Here is Magic Spells solution in C++ - https://programmingoneonone.com/hackerrank-magic-spells-solution-in-cpp.html

  • peter_32
     + 0 comments

    A sane way to describe the task:

    1. The only thing that matters is, that your code produces the correct output to std::out!
    2. for pointer passed to the counterspell() function which are derived, the matching method needs to be called (reveal*())
    3. for pointer passed to counterspell() function which are not derived, the number of common characters need to be printed (comparing the scroll name and the global journal string). This matches the number of lines the linux diff utility does not show (which are identical).

  • leonardo_monchi1
     + 1 comment

    If anyone is interested in a recursive solution to the second part :) :

        //Get spell and journal name
    string spellName = spell->revealScrollName();
    string journal = SpellJournal::journal;  

    // Initialize the memoization table with -1 (indicating uncomputed)
    int n = spellName.size();
    int m = journal.size();
    //memo is used to keep track of the computation, avoiding usless computation
    vector<vector<int>> memo(n + 1, vector<int>(m + 1, -1)); 

    auto f = [&spellName, &journal, &memo](int n, int m, auto& f) -> int {
        if (n == 0 || m == 0) return 0; //Reached the end of one string
        if (memo[n][m] != -1) return memo[n][m]; //If already computed
        
        if (spellName[n - 1] == journal[m - 1]) { //Update memo adding the new computation
            memo[n][m] = 1 + f(n - 1, m - 1, f);
        } else {
            memo[n][m] = std::max(f(n - 1, m, f), f(n, m - 1, f)); //Recall f over n-1 and m-1 to gety the substring which return the  highest value
        }
        return memo[n][m]; // Return the computed result
    };

  • kaushalsubho2005
     + 1 comment

    how did you all find out all the spell like thunderstorm and waterbolt where is it given