Work4freshers - Job Updates
160K subscribers
504 photos
2 files
8.52K links
πŸ’Ό Daily Job Updates For Freshers & Experienced πŸ“’
BE | BTech | MTech | BCA | MCA | BBA | BBM | MSc | MBA | Diploma and many more

Apply Here πŸ‘‡
https://work4freshers.com/

πŸ›‘Note: Be aware of fake calls and do not pay any money for a job
Download Telegram
Infosys Code
n = int(input())
A = int(input())
A1 = []
A2= []
A3= []
ans = 0
for i in range(n):
A1.append(int(input()))
for j in range(n):
A2.append(int(input()))
for k in range(n):
A2.append([p[k], b[k]])
a.sort()
for z in a:
if a[0] > N:
break
N += a[1]
ans += 1
print(ans)

Python 3

Follow @work4freshers
πŸ‘12
Sec 2 - techinal ability

Q1) median of terms
7
C


Q2) avarege of eleven
20
B


Q3) x y means
N p $
C

Q4) Five brothers
B
Muliplex


Q5) harsh
4 days
A


Q6) a fruit
1900
C

Q7) if m n
East
B


Q8) if the second
S
D



Infosys exam Answer
πŸ‘5
C++

Follow @work4freshers
πŸ‘3
Lexographically smallest question code in C++ 17
πŸ‘4
Number Of Subsequences Code For Infosys

int A[] = {10,13,7,8,14,11};
int n = 6;

int memo[6];//initialized with -1s;

int count(int currIndex){
if (currIndex == n-1) return 1;
if (memo[currIndex] != -1) return memo[currIndex];

int res = 0;
for (int i=currIndex+1 ; i<n ; i++){
if (abss(A[currIndex] - A[i]) <= 3){
res += count(i);
}
}

memo[currIndex] = res;
return res;
}


c++
πŸ‘5
// Infosys
// N flowers on a Recatangular pana
int ans = 100000000;
void solve(vector<int> a, int n, int k, int index, int sum,
int maxsum)
{
if (k == 1)
{
maxsum = max(maxsum, sum);
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
}
maxsum = max(maxsum, sum);
ans = min(ans, maxsum);
return;
}
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
maxsum = max(maxsum, sum);
solve(a, n, k - 1, i + 1, sum, maxsum);
}
}
int GetMaxBeauty(int N, int K, vector<int> A)
{

solve(A, N, K, 0, 0, 0);
return ans;
}
πŸ‘2
array AR of size N

perfect_sum(arr, s, result) :
x = [0]*len(arr)
j = len(arr) - 1

while (s > 0) :
x[j] = s % 2
s = s // 2
j -= 1
sum = 0
for i in range(len(arr)) :
if (x[i] == 1) :
sum += arr[i]
if (sum == result) :
print("{",end="");
for i in range(len(arr)) :
if (x[i] == 1) :
print(arr[i],end= ", ");
print("}, ",end="")

def print_subset(arr, K) :
x = pow(2, len(arr))
for i in range(1, x):
perfect_sum(arr, i, K)

# Driver code
arr = [ ]
n = int(input("Enter length of array : "))
s=int(input("Enter sum : "))
for i in range(n):
ele=int(input("Enter element : "))
arr.append(ele)
print_subset(arr, s)

Python
πŸ‘5❀2
Organization: HBC
Job Title: Trainee
Salary: 3.2LPA (Expected)
Location: Bangalore
Job Type: Full time
Experience: 0 – 2 Years
Batch: 2022/21/20/19/18

Apply Now : https://work4freshers.com/hbc-off-campus-drive-2022-fresher-trainee/
πŸ‘5
Organization: Bosch Global Software
Job Title: Trainee
Salary: 5 LPA (Expected)
Location: Bangalore, Coimbatore, Hyderabad & Pune
Job Type: Full time
Experience: 0 – 2 Years
Batch: 2022

Apply Now: https://work4freshers.com/bosch-global-software-recruitment/
❀2πŸ‘2
Live stream started