#include <bits/stdc++.h>
using namespace std;

void solve(int k) {
   string s = to_string(k);
   int v[] = {2,3,4,5,6};
   cout<< ((s[0] - '0') - 1) * 10 + v[s.length()] << endl;
}
int main() {
   int k =4 ; N = 5;
   solve(k);
   return 0;
}

C++✅
Accenture

You can’t go back and change the beginning. But you can start from where you are & change the ending 😌

Yesterday to many people got this message all the best for interview ✌🏻

Accenture
C++✅

beGalileo is hiring Trainee Developer role.

Batch eligible: 2022 and 2023 grads.

Apply: https://www.linkedin.com/jobs/view/3648349891

P.S: Only go if you don’t have any other offer in hand.

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 😌❤️

Company Name: PhysicsWallah

Role: iOS Developer

Batch eligible: 2023 grads only

Stipend: 25k

Work From Office: Noida Location

Apply: https://www.linkedin.com/jobs/view/3648804258

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 ✅