Pages

Saturday, May 31, 2025

Friends Pairing using Recursion in C++

 #include<iostream>

#include<string>
using namespace std;

int friendsPairing(int n) {
    if(n == 1 || n == 2) {
        return n;
    }

    // // single
    // friendsPairing(n-1);

    // // pair
    // (n-1) * friendsPairing(n-2)
    return friendsPairing(n-1) + (n-1) * friendsPairing(n-2);
}

int main() {
    cout << friendsPairing(4) << endl; // 10
return 0;

}

No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...