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

int mod = 1e9+7;
int main() {
  int k;
  string s1,s2;
  cin >> s1>>s2 >> k;
  int n = s1.length();
  int f[1005];
  memset(f,0,sizeof(f));
  string sx = s1+s1;
  set<int> st;
  for(int i = 0;i<n;++i){
    if(sx.substr(i,n) == s2)
      st.insert(i);
    if(i != 0)
      f[i] = 1;
  }
  int sum0 = 0;
  for(int i = 0;i<n;++i)
    sum0 += f[i];
  for(int j = 2;j<=k;++j){
    int sum1 = 0;
    for(int i = 0;i<=1;++i){
      f[i] = ((sum0 - f[i])%mod + mod)%mod;
      f[i] %= mod;
    }
    sum1 =  ( (long long )f[1] * (n-1) + f[0])%mod;
    sum0 = sum1;
  }
  int sum = 0;
  for(auto x: st) {
    if(x%n == 0)
      sum += f[0];
    else
      sum += f[1];
    sum%=mod;
  }
  cout << (sum+mod)%mod <<endl;
  return 0;

}

NLP Atlasian ✅

#include <iostream>
#include <vector>
using namespace std;

long getMaximumPower(vector<int>& power) {
    long max_power = *max_element(power.begin(), power.end()); // Find the maximum value in the power vector
    vector<long> power_counts(max_power + 1, 0); // Create a vector to store power counts

    for (int p : power) {
        power_counts[p] += p;
    }

    long prev_power = 0;
    long curr_power = power_counts[1];

    for (int i = 2; i <= max_power; i++) {
        long new_power = max(curr_power, prev_power + power_counts[i]);
        prev_power = curr_power;
        curr_power = new_power;
    }

    return curr_power;
}

int main() {
    // Sample Input
    vector<int> power = {1, 2, 3, 4, 5};

    // Calculate and print the maximum possible sum
    long result = getMaximumPower(power);
    cout << result << endl;

    return 0;
}

Process Execution✅

def prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

def subseq(s, i=0, c=""):
    if i == len(s):
        if not c:
            return []
        return [c]
    a = subseq(s, i+1, c + s[i])
    b = subseq(s, i+1, c)
    return a + b

def solve(b):
    s = subseq(b)
    p = [int(x, 2) for x in s if x and x[0] != '0' and prime(int(x, 2))]
    return max(p) if p else -1

print(solve("1011"))

Maximum Prime ✅

ll solve(vector<int> &arr){
    int n=arr.size();
    vector<ll> pf(n),sf(n);
    pf[0]=arr[0];
    sf[n-1]=arr[n-1];
    for(int i=1;i<n;i++) pf[i]=arr[i]+pf[i-1];
    for(int i=n-2;i>=0;i--) sf[i]=arr[i]+sf[i+1];
    ll sm=0,mn=0;
    ll mx=-1e18;
    for(int i=0;i<n;i++){
        sm+=arr[i];
        if(sm>0) sm=0;
        mn=min(mn,sm);
        mx=max(mx,pf[i]-2*mn-(i<n-1?sf[i+1]:0));
    }
    return mx;
}

Subarray sums ✅

int n;
    cin>>n;
    int starts[n+1];
    for(int i=0;i<n;i++){
        cin>>starts[i];
    }
    int d;
    cin>>d;
    int l=0,r=100000;
    while(l<r){
        int mid=(l+r+1)>>1;
        int ans=1;
        int pr=0;
        for(int i=0;i<n;i++){
            if(pr>starts[i]+d){
                ans=0;
            }else{
                pr=max(pr+mid,starts[i]);
            }
        }
        if(ans){
            l=mid;
        }else{
            r=mid-1;
        }
    }
    cout<<l;

Range Selection ✅

Array Transformation ✅

#include <vector>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

vector<int> photoAlbum(vector<int>& index, vector<int>& identity) {
    int n = index.size();
    vector<int> album(n, -1);

    for (int i = 0; i < n; i++) {
        int idx = index[i];
        int id = identity[i];
        for (int j = n - 1; j > idx; j--) {
            album[j] = album[j - 1];
        }

        album[idx] = id;
    }

    return album;
}

int main() {
    int n;
    cin >> n;

    vector<int> index(n), identity(n);
    for (int i = 0; i < n; i++) {
        cin >> index[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> identity[i];
    }

    vector<int> result = photoAlbum(index, identity);
    for (int id : result) {
        cout << id << " ";
    }
    cout << endl;

    return 0;
}

Photo Album
Cpp✅

Sypto is hiring for Frontend Developer Intern (2024 and 2025 grads can apply) [Only go if you have knowledge of ReactJS]

Apply: https://bit.ly/3sYE3J3

Secure Blink is hiring for Backend Developer Intern (2024 and 2025 grads)

Apply: https://bit.ly/44URJBN

Company Name: Merkle

Role: Associate Software Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://www.merkle.com/content/merkle/en/careers/jobs/743999928332970.html

CometChat Hiring Trainee Engineer

location - Mumbai

Batch - 2023

Apply now
https://careers.cometchat.com/jobs/cHTX5h4Ik5_N/trainee-engineer-hybrid

Software Internship at Clearfeed

Link :
https://clearfeed.freshteam.com/jobs/Qc-tv46N596-/software-engineer-intern?ft_source=5000516891&ft_medium=5000462114

Epiq is hiring SDE Intern 😊

For 2023/2024 Grads

Link 🔗
https://epiqsystems.wd5.myworkdayjobs.com/Epiq_Careers/job/IND-Hyderabad-Sohini-Tech-Park-3rd-Floor-Financial-District/Software-Engineering-Intern_R0026243-1?