๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
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 โœ…
Internship Alert ๐Ÿšจ

What do we need?

1. Understanding of AI, LLMs and underlying basics

2. Python with Colab, Streamlit and VectorDB

3. Product Thinking and love to own projects and work on them end to end

What's in it for you?

๐Ÿ‘‰ Deep learning, learn from the best

๐Ÿ‘‰ Directly report to our AI Lead and get exponential learning

๐Ÿ‘‰ Stipend

๐Ÿ‘‰ PPO opportunity

https://tally.so/r/3yXDpd?trk=feed-detail_main-feed-card-text
Stanza Living is #hiringInterns for Data Analyst Role:-

Interested candidate can send updated resume on dhairya.rogha@stanzaliving.com

Or Fill out the google Form Given Below:- https://lnkd.in/d-cxFqfi

Other Details :-

Requirements :- Proficient in Microsoft Excel, SQL (Mandatory)

Monthly Stipend :- 15,000 Fixed

Duration :- 60 Days

Location :- Gurugram Corporate Office
Other Benefits :- โœ…

Pre-Placement Opportunity โœ…

Certificate of Completion โœ…

Letter of Recommendation
#product_of_number
def ProductArray(arr, n):
    n= len(arr)
    result = [0] * n

    product = 1
    for i in range(n):
        result[i] = product
        product *= arr[i]

    product = 1
    for i in range(n-1, -1, -1):
        result[i] *= product
        product *= arr[i]

    return result

Accenture โœ