๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Go many dms regarding code with Cisco that all participants should be present in front of a laptop.

But thatโ€™s not mandatory now, you guys can share your screen using WebEx or any other tool.

Best of luck for tomorrowโ€™s assessment ๐Ÿ˜Œโค๏ธ
int maxPoints(vector<int> &nums)
{
    int n = nums.size();
    if (n == 0)
        return 0;
    if (n == 1)
        return nums[0];
    if (n == 2)
        return max(nums[0], nums[1]);
    vector<int> dp(n, 0);
    dp[0] = nums[0];
    dp[1] = nums[1];
    for (int i = 2; i < n; i++)
    {
        dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]);
    }
    return dp[n - 1];
}

Cisco โœ…
int n = markers.size();
    vector<vector<int>> dp(n, vector<int>(n, 0));

    for (int len = 1; len <= n; len++) {
        for (int i = 0; i + len - 1 < n; i++) {
            int j = i + len - 1;
            int left = (i + 2 <= j) ? dp[i + 2][j] : 0;
            int diagonal = (i + 1 <= j - 1) ? dp[i + 1][j - 1] : 0;
            int right = (i <= j - 2) ? dp[i][j - 2] : 0;

            dp[i][j] = max(markers[i] + min(left, diagonal), markers[j] + min(diagonal, right));
        }
    }

    return dp[0][n - 1];

Markers code
Ciscoโœ…
a = int(input())
b = []
for i in range(a):
    b.append(int(input()))
b.sort(reverse=True)

bob=[]
j=[]
for i in range(0,len(b),2):
    j.append(b[i])
    bob.append(b[i+1])
    if i==a:
        break;
   

if sum(bob) > sum(j):
    print(sum(bob))
elif sum(j) > sum(bob):
    print(sum(j))
else:
    print(sum(j))


in python 3
Cisco โœ