ChangeCX Coding Questions and Answers

October 4, 2023

ChangeCX Coding Questions and Answers

ChangeCX is a Information Technologye and service providing company with it’s headquarters In the United States.

On this page we will discuss about ChnageCX coding question and answers which will help you in it’s Technical test during Recruitment Process

Go through the entire page to have an idea about the questions asked in ChangeCX

Practice ChangeCX Coding Questions and Answers

Question 1: Stars Between Bars

Given a string s consisting of stars “*” and bars “|” ,an array of starting indices starIndex, and an array of ending indices endIndex, determine the number of stars between any two bars within the substrings between the two indices inclusive . NOTE that in this problem indexing starts at 0.

A Star is represented as an asterisk [*=ascii decimal 42]
A Bar is represented as a Pipe [“|”=ascii decimal 124]

Example

s=’|**|*|’
n = 2
startIndex=[0,0]
endIndex=[4,5]

For the first pair of indices (0,4) the substrings is “|**|*” . There are 2 stars between a pair of bars
For the second pair of indices (0,5) the substring is “|**|*|” and there are 2+1=3 stars in between the bars.
Both of the answers are returned to the array [2,3].

Constraints

1 <= n <= 105
1 <= StartIndex[i] <= endIndex[i]
Each Character of s is either “*” or “|”

Input Format for Custom testing

First line contains a string S. The next line contains an integer n , the no.of elements in startIndex and endIndex. Each line i of the n subsequent lines contains an integer of startIndex. Each line i of the n subsequent lines contains an integer of endindex.

Sample Input

*|*| → s=”*|*|”
1 → size of startindex[] and endIndex[] is 1.
0 → startindex = 0
2 → endindex = 2

Sample output:

Explanation :

The substring from index = 0 to index = 2 is “*|*” . there is no consecutive pair of bars in this string.

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

C++

Java

Python

C++

Run

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

int main() {
    string str;
    cin >> str;
    int n;
    cin >> n;
    vector<int> startIndex(n);
    vector<int> endIndex(n);
    for (int i = 0; i < n; i++) {
        cin >> startIndex[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> endIndex[i];
    }
    int len = str.length();
    vector<int> counter(len, -1);
    int count = 0;
    int lastIdx = -1;

    stack<int> st;
    for (int i = 0; i < len; i++) {
        char ch = str[i];
        if (ch == '|') {
            while (!st.empty()) {
                int idx = st.top();
                st.pop();
                counter[idx] = i;
            }
        }
        st.push(i);
    }

    vector<int> ansArr(n);
    for (int i = 0; i < n; i++) {
        int sIndex = startIndex[i];
        int eIndex = endIndex[i];
        int sCount = 0;
        if (str[sIndex] != '|')
            sIndex = counter[sIndex];
        if (sIndex == -1 || counter[sIndex] == -1) {
            ansArr[i] = 0;
            continue;
        }
        while (sIndex < eIndex) {
            int nextIdx = counter[sIndex];
            if ((nextIdx != -1) && (nextIdx <= eIndex))
            {
                sCount += nextIdx - sIndex - 1;
            }
            sIndex = nextIdx;
        }
        ansArr[i] = sCount;
    }

    for (int ele : ansArr) {
        cout << ele << " ";
    }
    cout << endl;

    return 0;
}

Java

Run

import java.util.*;

class Main
{
    public static void main(String[] args) {
        Scanner scn = new Scanner(System.in);
        String str = scn.next();
        int n = scn.nextInt();
        int startIndex[] = new int[n];
        int endIndex[] = new int[n];
        for(int i = 0; i < n; i++)
        {
            startIndex[i] = scn.nextInt();
        }
        for(int i = 0; i < n; i++)
        {
            endIndex[i] = scn.nextInt();
        }
        int len = str.length();
        int counter[] = new int[len];
        int count = 0;
        int lastIdx = -1;
        
        Arrays.fill(counter, -1);
        Stack<Integer> st = new Stack<>();
        for(int i = 0; i < len; i++)
        {
            char ch = str.charAt(i);
            if(ch == '|')
            {
                while(!st.empty())
                {
                    int idx = st.pop();
                    counter[idx] = i;
                }
            }
            st.push(i);
        }
        
        int ansArr[] = new int[n];
        for(int i = 0; i < n; i++)
        {
            int sIndex = startIndex[i];
            int eIndex = endIndex[i];
            int sCount = 0;
            if(str.charAt(sIndex) != '|')
                sIndex = counter[sIndex];
            if(sIndex == -1 || counter[sIndex] == -1)
            {
                ansArr[i] = 0;
                continue;
            }
            while(sIndex < eIndex)
            {
                int nextIdx = counter[sIndex];
                if((nextIdx != -1) && (nextIdx <= eIndex))
                {
                    sCount += nextIdx - sIndex - 1;
                }
                sIndex = nextIdx;
            }
            ansArr[i] = sCount;
        }
        
        for(int ele : ansArr)
        {
            System.out.print(ele + " ");
        }
    }
}

Python

Run

str = input()
n = int(input())
startIndex = []
endIndex = []
for i in range(n):
    startIndex.append(int(input()))
for i in range(n):
    endIndex.append(int(input()))

len_str = len(str)
counter = [-1] * len_str
count = 0
lastIdx = -1

st = []
for i in range(len_str):
    ch = str[i]
    if ch == '|':
        while st:
            idx = st.pop()
            counter[idx] = i
    st.append(i)

ansArr = []
for i in range(n):
    sIndex = startIndex[i]
    eIndex = endIndex[i]
    sCount = 0
    if str[sIndex] != '|':
        sIndex = counter[sIndex]
    if sIndex == -1 or counter[sIndex] == -1:
        ansArr.append(0)
        continue
    while sIndex < eIndex:
        nextIdx = counter[sIndex]
        if nextIdx != -1 and nextIdx <= eIndex:
            sCount += nextIdx - sIndex - 1
        sIndex = nextIdx
    ansArr.append(sCount)

for ele in ansArr:
    print(ele, end=" ")

Question 2 : Duplicates

The principal has a problem with repetitions. Everytime someone sends the same email twice he becomes angry and starts yelling. His personal assistant filters the mails so that all the unique mails are sent only once, and if there is someone sending the same mail again and again, he deletes them. Write a program which will see the list of roll numbers of the student and find how many emails are to be deleted.

Input Format:

First line takes n, which is the total no. of mails recieved.
Second line takes the n no. of email id as input./li>

Output Format:

Total no. of duplicate email id’s to be deleted.

Constraints:

1 <= n <= 10^4

Sample input:

6
1 3 3 4 3 3

Sample output

C++

Java

Python

C++

Run

#include<bits/stdc++.h>
using namespace std;
map<int,int> m;
int main()
{
    int n,a,ans=0;
    cin>>n;
    while(n--)
    {
        cin>>a;
        m[a]++;
        if(m[a]>1) ans++;
    }
    cout<<ans;
}

Java

Run

import java.util.*;

public class Main{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    TreeSet list=new TreeSet<>();
    for(int i=0;i<n;i++)
      list.add(sc.nextInt()); 
    
    System.out.println(Math.abs(n-list.size()));
 }
}

Python

Run

def countDuplicate(numbers):
    c=0
    for i in set(numbers):
        if numbers.count(i)>1:
            c+=numbers.count(i)-1
    return c
    
n=int(input())
numbers=[]
numbers = list(map(int, input().split()))
print(countDuplicate(numbers))

Question 3: Jagannath and his Brothers

Problem Statement :

Jagannath was with two of his young brothers in work. He wants to work less, and wants his brothers to work more, as he is a lazy person. Now, in the work field, there is an array of buildings, from where they can earn money. So that there arises no conflict between his brothers that who earns more, he arrives in one building, tells his brother that the very building will bring the most money (Which may not be true), and tells one of his brothers to go to the left and another one to go to the right.
You have to write a program so that you can predict which building will be getting Jagannath, and how much money each of his friends are gonna earn.

Input Format:
First line saying the number of test cases, n.
Then next n pairs of lines, first one depicting the number of buildings k and second one containing k space separated integers denoting the number of earnings possible.

Constraints
1 <= n <= 10 ^ 6
1 <= k < n
-10 ^ 9 <= a[i] <= 10 ^ 9 (Earnings)
1 <= t <= 25

Output Format:
n lines, with the index of building jagannath working, space separately the money His brothers each making. If the combination is not possible, answers are 0.

Sample Input:
1
5
1 2 2 4 5
Sample Output:
4 5
Explanation:
Jagannath will work in the 4th building, and his brothers are making 5 rupees each.

C++

JAVA

Python

C++

Run

#include <bits/stdc++.h>

using namespace std;

void func() {
    int k;
    cin >> k;
    int ans1 = 0, ans2 = 0;
    vector < int > a(k), l(k), r(k);
    for (int i = 0; i < k; i++) cin >> a[i];
    l[0] = a[0];
    r[k - 1] = a[k - 1];
    for (int i = 1; i < k; i++) l[i] = l[i - 1] + a[i]; for (int i = k - 2; i >= 0; i--) r[i] = r[i + 1] + a[i];
    for (int i = 1; i < k - 1; i++)
        if (l[i - 1] == r[i + 1]) {
            ans1 = i + 1;
            ans2 = l[i - 1];
            break;
        }
    cout << ans1 << " " << ans2 << endl; } int main() { int n; cin >> n;
    while (n--)
        func();
}

JAVA

Run

import java.util.Scanner;
import java.util.Vector;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int z = 0; z < t; z++) {
            int k = sc.nextInt();
            int ans1 = 0, ans2 = 0;
            int[] a = new int[k];
            int[] l = new int[k];
            int[] r = new int[k];
            for (int i = 0; i < k; i++) {
                a[i] = sc.nextInt();
            }
            l[0] = a[0];
            r[k - 1] = a[k - 1];
            for (int i = 1; i < k; i++) l[i] = l[i - 1] + a[i]; for (int i = k - 2; i >= 0; i--)
                r[i] = r[i + 1] + a[i];
            for (int i = 1; i < k - 1; i++) {
                if (l[i - 1] == r[i + 1]) {
                    ans1 = i + 1;
                    ans2 = l[i - 1];
                    break;
                }
            }
            System.out.println(ans1 + " " + ans2);
        }
    }
}

Python

Run

for t in range(int(input())):
    n = int(input())
    ar = list(map(int, input().split()))
    left, right = [0] * n, [0] * n
    left[0] = ar[0]
    right[-1] = ar[-1]
    for i in range(1, n):
        left[i] = left[i - 1] + ar[i]
    for i in range(n - 2, -1, -1):
        right[i] = right[i + 1] + ar[i]

    i, j, m, y = 0, 2, 0, 0
    while i < n and j < n:
        if left[i] == right[j]:
            m = left[i]
            y = i + 2
            break
        i += 1
        j += 1
    print(y, m)

Question 4: Shushil’s Madness

Problem Statement :

Shushil has gone crazy after he lost a big amount of his money in the share market. Now he keeps all the money he has distributed in his room and calculates them in a very problematic way. Every time he calculates hisnetworth, he writes it down adding with the last 3 rooms he has one.
Then after that when he reaches the next room he adds the last 3 rooms’s money with the money found in that room and adds again. Suppose he is in ith room, he will add i-1,i-2 and i-3th rooms money with ith one and add it into his net worth (if the rooms exist).
Given an array of money in the rooms, find what will he calculate as his net worth?
Input Format:
First line saying the number of rooms, r
Next line r space separated money amounts in each room
Next line contains an m, denoting a number that we will use to take module of the final value

Constraints:

1<= r <= 1018
1<= a[i] <= min(600,r)
1<= M <= 1018

Output Format:
Print the answer on the first line

Sample Input:
5
1 2 3 4 5
100

Sample Output:
34

C++

JAVA

Python

C++

Run

#include <bits/stdc++.h>

using namespace std;

int main() {
    int m, r, ans = 0;
    cin >> r;
    vector < int > a(r);
    for (int i = 0; i < r; i++) cin >> a[i];
    cin >> m;
    for (int i = 0; i < 4; i++)
        for (int j = 0; j <= i; j++)
            ans += a[j];
    for (int i = 4; i < r; i++)
        ans += (a[i] + a[i - 1] + a[i - 2] + a[i - 3]);
    cout << ans % m;
}

JAVA

Run

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m, r, ans = 0;
        r = sc.nextInt();
        int[] a = new int[r];
        for (int i = 0; i < r; i++)
            a[i] = sc.nextInt();
        m = sc.nextInt();
        for (int i = 0; i < 4; i++)
            for (int j = 0; j <= i; j++)
                ans += a[j];
        for (int i = 4; i < r; i++)
            ans += (a[i] + a[i - 1] + a[i - 2] + a[i - 3]);
        System.out.println(ans % m);
    }
}

Python

Run

ans = 0
r = int(input())
a = list(map(int, input().split()))
m = int(input())
for i in range(4):
    for j in range(i + 1):
        ans += a[j]
for i in range(4, r):
    ans += a[i] + a[i - 1] + a[i - 2] + a[i - 3]
print(ans % m)

Question 5: Class Monitor

Problem Statement :

After JEE Mains, some students got admission into an engineering college. Now there is a class consisting of such n students, and the HOD came to say it is time to select the class monitor. But He never gets all of them at one time. So he brought a register, every time he gets someone with less rank than the previous time he cut the name and wrote the name of the student and the rank.
For a given number of ranks he gets each time, you have to predict how many names are cut in the list.

Constraints:
Number of Visiting<=10^9
ranks <=10000

Input Format:
Number of Visiting N in their first line
N space separated ranks the HOD gets each time

Output Format:
Number of ranks cut in the list

Sample Input:
6
4 3 7 2 6 1

Sample Output:
3

C++

JAVA

Python

C++

Run

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, p, m = INT_MAX, ans = 0;
    cin >> n;
    vector < int > a(n);
    for (int i = 0; i < n; i++) { cin >> p;
        if (p < m) {
            m = p;
            ans++;
        }
    }
    cout << ans - 1;
}

JAVA

Run

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        int n, p, ans = 0, m = Integer.MAX_VALUE;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            p = sc.nextInt();
            if (p < m) {
                m = p;
                ans++;
            }
        }
        System.out.print(ans - 1);
    }
}

Python

Run

n = int(input())
a = list(map(int, input().split()))
m = a[0]
ans = 0
for i in range(1, n):
    if a[i] < m:
        m = a[i]
        ans += 1
print(ans)

Question 6 : Help of Prepsters

Problem Statement :

Arnab has given me a challenge. I have to calculate the number of numbers which are less than a certain value n, and have exactly k set bits in its binary form. As you are a Prepster like me, help me write a code that will take input for n and k and give the expected output.

Constraints :
1<=n<=10000
1<=k<=10
Input Format :
First line containing n and k space separated
Output Format :
Number of numbers present in a single line

Sample Input:
7 2
Sample Output:
3
Explanation:
11,110,101 -> These three numbers.

C++

JAVA

Python

C++

Run

#include <bits/stdc++.h>

using namespace std;
int n, k, ans, l;
map < int, int > m;

void func(int i, string s, int L) {
  // cout<< s<< endl; if (L > l) {
    return;
  }
  if (i == 0 && m[stoull(s, 0, 2)] == 0) {
    m[stoull(s, 0, 2)]++;
    ans++;
  }
  if (s != "")
    if (n < stoull(s, 0, 2)) { return; } func(i - 1, s + "1", L + 1); func(i, s + "0", L + 1); } int main() { cin >> n >> k;
  char res[10000];
  itoa(n, res, 2);
  ans = 0;
  l = strlen(res);
  func(k - 1, "1", 1);
  cout << ans;
}
    }

JAVA

Run

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int ans = 0;
        for (int i = 1; i < n; i++) {
            if (countSetBits(i) == k) {
                ans++;
            }
        }
        System.out.println(ans);
    }

    private static int countSetBits(int i) {
        if (i == 0)
            return 0;
        else
            return 1 + countSetBits(i & (i - 1));
    }

}

Python

Run

ans = 0
n, k = map(int, input().split())
l = len(bin(n)[2:])


def func(i, s, L):
    global l
    global ans
    if L > l:
        return
    if i == 0:
        ans += 1
    if s != "":
        if n < int(s, 2):
            return
    func(i - 1, s + "1", L + 1)
    func(i, s + "0", L + 1)


func(k - 1, "1", 1)
print(ans)

Question 7: Majority Element

The majority element in an array is defined as the element that appears more than ⌊n/2⌋ times, where n is the length of the array.
In other words, it is the element that occurs most frequently and makes up more than half of the array.

Given an array of integers, the task is to find the majority element and return it. If there is no majority element, If there is no majority element, the algorithm should indicate that.

Examples:

Example 1:
Input: [3, 3, 4, 2, 4, 4, 2, 4, 4]
Output: 4
Explanation:
In the given array, the number 4 appears 5 times, which is more than half of the array size (9/2 = 4.5). Therefore, 4 is the majority element.

Example 2:
Input: [1, 2, 3, 4, 4, 4, 4]
Output: 4
Explanation:
In this case, the number 4 appears 4 times, which is more than half of the array size (7/2 = 3.5). Thus, 4 is the majority element.

Example 3:
Input: [1, 2, 3, 4, 5]
Output: -1
Explanation:
There is no majority element in this array since no number appears more than half of the array size (5/2 = 2.5).

Example 4:
Input: [2, 2, 2, 3, 3, 4, 4, 4, 4]
Output: -1
Explanation:
In this case, although the number 4 appears 4 times, it does not occur more than half of the array size (9/2 = 4.5).
Hence, there is no majority element.

C++

Python

Java

C++

Run

#include
#include

int majorityElement(std::vector& nums) {
    int count = 0;
    int candidate = 0;

    for (int num : nums) {
        if (count == 0) {
            candidate = num;
            count = 1;
        } else if (num == candidate) {
            count++;
        } else {
            count--;
        }
    }

    return candidate;
}

int validateMajorityElement(std::vector& nums, int candidate) {
    int count = 0;
    for (int num : nums) {
        if (num == candidate) {
            count++;
        }
    }

    if (count > nums.size() / 2) {
        return candidate;
    } else {
        return -1; // No majority element found
    }
}

int findMajorityElement(std::vector& nums) {
    int candidate = majorityElement(nums);
    return validateMajorityElement(nums, candidate);
}

int main() {
    std::vector nums = {3, 3, 4, 2, 4, 4, 2, 4, 4};
    int result = findMajorityElement(nums);

    if (result != -1) {
        std::cout << "Majority Element: " << result << std::endl;
    } else {
        std::cout << "No majority element found." << std::endl;
    }

    return 0;
}

Python

Run

def majority_element(nums):
    count = 0
    candidate = None

    for num in nums:
        if count == 0:
            candidate = num
            count = 1
        elif num == candidate:
            count += 1
        else:
            count -= 1

    return candidate

def validate_majority_element(nums, candidate):
    count = 0
    for num in nums:
        if num == candidate:
            count += 1

    if count > len(nums) // 2:
        return candidate
    else:
        return None

def find_majority_element(nums):
    candidate = majority_element(nums)
    return validate_majority_element(nums, candidate)

# Example usage
nums = [3, 3, 4, 2, 4, 4, 2, 4, 9]
result = find_majority_element(nums)
if result is not None:
    print("Majority Element:", result)
else:
    print("No majority element found.")

Java

Run

import java.util.HashMap;
import java.util.Map;

public class Main {
    public static int majorityElement(int[] nums) {
        int count = 0;
        int candidate = 0;

        for (int num : nums) {
            if (count == 0) {
                candidate = num;
                count = 1;
            } else if (num == candidate) {
                count++;
            } else {
                count--;
            }
        }

        return candidate;
    }

    public static int validateMajorityElement(int[] nums, int candidate) {
        int count = 0;
        for (int num : nums) {
            if (num == candidate) {
                count++;
            }
        }

        if (count > nums.length / 2) {
            return candidate;
        } else {
            return -1; // No majority element found
        }
    }

    public static int findMajorityElement(int[] nums) {
        int candidate = majorityElement(nums);
        return validateMajorityElement(nums, candidate);
    }

    public static void main(String[] args) {
        int[] nums = {3, 3, 4, 2, 4, 4, 2, 4, 4};
        int result = findMajorityElement(nums);

        if (result != -1) {
            System.out.println("Majority Element: " + result);
        } else {
            System.out.println("No majority element found.");
        }
    }
}

Question 8: Smallest window in a string containing all the characters of another string

Given two strings S and P, the task is to find the smallest window in string S that contains all the characters (including duplicates) of string P. If no such window exists, return “-1”. If there are multiple windows of the same length, return the one with the smallest starting index.
Note that all characters are lowercase alphabets.

Example 1:

Input:
S = “timetopractice”
P = “toc”
Output : toprac
Explanation: The smallest substring in S that contains “toc” is “toprac”.

Example 2:
Input:
S = “zoomlazapzo”
P = “oza”

Output:
apzo
Explanation:
The smallest substring in S that contains “oza” is “apzo”.

Question 9: HR issues

Problem statement :

Shovon is an HR in a renowned company and he is assigning people to work. Now he is assigning people work in a fashion where if he assigns some work a work of cost 2, the next person will be strictly getting a job with cost equal or more than 2. Given that Shovon’s company has infinite work and a number of employees, how many distributions can be possible. The cost of jobs can go 0 to 9.

Function Description:

Complete the special_numbers function in the editor below. It has the following parameter(s):

Parameters:

Name	Type	Description
N	Integer	The number of depts.
arr[ ]	Integer array	The number of employees in each dept..

Return: The function must return an INTEGER denoting the sum of answers for all distinct distributions.

Constraints:

1 <= n <= 100
1 <= arr[i] <= 200

Sample Cases:

Sample Input 1
2
4
1
Sample Output 1
725
Description
The ans if m = 1 is 10, which is all numbers from 0 to 9
The ans for m = 2 is 55
The answer for m = 3 is 220
The answer for m = 4 is 715
So fun(4) + fun(1) = 725

C++

Python

Java

C++

Run

#include<bits/stdc++.h>
using namespace std;
int func(int s,int p,int n)
{
  if(p==n-1) return 1;
  int ans=0;
  for(int i=s;i<=9;i++) ans+=func(i,p+1,n); return ans; } int main() { int n,a, ans=0; cin>>n;
  vector v(n);
  for(int i=0;i<n;i++) { cin>>a;
    for(int i=0;i<=9;i++)
    ans+=func(i,0,a);
  }
  cout<<ans;
}

Python

Run

n=int(input())
a1=[]
for i in range(n):
 a1.append(int(input()))
dp=[0]*201
dp[1]=10
dp[2]=55
a=[1]*10
i=3
while i<201:
 s=0
 for i1 in range(10):
   s+=a[i1]
   a[i1]=s
   dp[i]+=(s*(10-i1))
   dp[i]=dp[i]%((10**9)+7)
 i+=1
s1=0
for i in a1:
 s1+=dp[i]
 s1=s1%((10**9)+7)
print(s1)

Java

Run

import java.util.*;
class Main
{
  static int func(int s,int p,int n)
  {
    if(p==n-1) return 1;
    int ans=0;
    for(int i=s;i<=9;i++)
    ans += func(i,p+1,n);
    return ans;
  }
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
    int n = sc.nextInt ();
    int  ans=0;    
    for(int i=0; i<n; i++){       
        int a = sc.nextInt ();
        for(int j=0; j <=9; j++)
           ans+=func(j,0,a);       
    }    
    System.out.println (ans);
  }
}

Question 10: Consecutive Prime Sum

Problem Description

Question – : Some prime numbers can be expressed as a sum of other consecutive prime numbers.

For example
- 5 = 2 + 3,
- 17 = 2 + 3 + 5 + 7,
- 41 = 2 + 3 + 5 + 7 + 11 + 13.
  Your task is to find out how many prime numbers which satisfy this property are present in the range 3 to N subject to a constraint that summation should always start with number 2.

Write code to find out the number of prime numbers that satisfy the above-mentioned property in a given range.

Input Format: First line contains a number N

Output Format: Print the total number of all such prime numbers which are less than or equal to N.

Constraints: 2<N<=12,000,000,000

C++

JAVA

Python

Run

#include
int prime(int b);
int main()
{
 int i,j,n,cnt,a[25],c,sum=0,count=0,k=0;
 printf("Enter a number : ");
 scanf("%d",&n);
 for(i=2;i<=n;i++)
 {
 	cnt=1;
 	for(j=2;j<=n/2;j++)
 	{
     	if(i%j==0)
     	cnt=0;
 	}
 	if(cnt==1)
 	{
    	a[k]=i;
    	k++;
    	}
 }
 for(i=0;i<k;i++)
 {
 	sum=sum+a[i];
	c= prime(sum);
	if(c==1)
	count++;
 }
 printf(" %d",count);
 return 0;
}

int prime(int b)
{
	int j,cnt;
	cnt=1;
 	for(j=2;j<=b/2;j++)
 	{
     	if(b%j==0)
     	cnt=0;
 	}
 	if(cnt==0)
 	return 1;
 	else
 	return 0;
}

Output
Enter a number : 43
4

C++

Run

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

int prime(int b)
{
    int j,cnt;
    cnt=1;
     for(j=2;j<=b/2;j++)
     {
         if(b%j==0)
         cnt=0;
     }
     if(cnt==0)
     return 1;
     else
     return 0;
}
int main() 
{
 int i,j,n,cnt,a[25],c,sum=0,count=0,k=0;
 cout<<"Enter a number : "; 
cin>>n;
 for(i=2;i<=n;i++)
 {
     cnt=1;
     for(j=2;j<=n/2;j++)
     {
         if(i%j==0)
         cnt=0;
     }
     if(cnt==1)
     {
        a[k]=i;
        k++;
        }
 }
 for(i=0;i<k;i++)
 {
     sum=sum+a[i];
    c= prime(sum);
    if(c==1)
    count++;
 }
 cout<<count;
 return 0;
}

Output
Enter a number : 5
1

JAVA

Run

import java.util.Scanner;
 class Main {
 
    static int prime(int b) {
        int j,cnt;
        cnt=1;
        for (j = 2; j <= b/2; j++) {
            if(b%j==0)
                cnt=0;
        }
        if(cnt==0)
        return 1;
        else
            return 0;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i,j,n=0,cnt,c=0,sum=0,count=0,k=0;
        Main t = new Main();
        int[] a = new int[25];
        System.out.println("Enter no");
        n = sc.nextInt();
        for (i = 2; i <=n ; i++) {
            cnt=1;
            for (j = 2; j <= n/2; j++) {
                if(i%j==0)
                    cnt=0;
            }
            if(cnt==1) {
                a[k]=i;
                k++;
            }
            
        }
        for (i = 0; i < k; i++) {
            sum=sum+a[i];
            c=t.prime(sum);
            if(c==1)
                count++;
        }
        System.out.println(count);
    }

}

Output
43
4

Python

Run

num = int(input())
arr = []
sum = 0
count = 0
if num > 1:
    for i in range(2, num + 2):
        for j in range(2, i):
            if i % j == 0:
                break
        else:
            arr.append(i)
def is_prime(sum):
    for i in range(2, (sum // 2) +2):
        if sum % i == 0:
            return False
        else:
            return True
for i in range(0, len(arr)):
    sum = sum + arr[i]
    if sum <= num:
        if is_prime(sum):
            count = count + 1

print(count)

Output
20
2

FAQ's related to ChangeCX

Question 1: What are the roles offered in ChangeCX?

The job role offered is of trainee engineer where a student needs to conduct research and collate data and provide general support to the engineering department .

Question 2: What is ChangeCX Recruitment Process?

The Online Selection Process consist of

Online Test (Virtual Mode)
Company presentation and Technical interview (On campus)
HR interview of selected students (On campus)

Question 3 : What is the Eligibility Criteria for ChangeCX Recruitment Process?

The Eligibility criteria as per the placement policy of the company is 70% marks in 10th & 12th, and CGPA of 8.0 and above, with no active backlog(s).

Question 4 : What is the Package offered for Trainee Engineer role in ChangeCX?

The Stipend during internship is INR 25,000 per month which will be of 6 months, based on performance during the internship and, if converted, to a full-time role the package is INR 10LPA

Question 5 : What are the skills that are required in this job role of ChangeCX?

JavaScript technologies such as Nodejs, Reactjs are required in order to fullfill the skill set that is required for the role of trainee engineer in this company, Questions related to these can be asked in technical interview

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Unlock this article for Free,
by logging in

ChangeCX Coding Questions and Answers