APPTITUDE TCS 10 AM
1]3
2]7+11√5 / 2
3]3.5miles/hour
4]300
5]150,000
6. 25000
7.4000
8. 9
9. 1225
10. 0
11. 400
12. 27
13) 1000
14) 52.6
15) 4.5
16) 644
17.c
18.25%
19) 3460

TCS Exam Ans

✅Telegram :@Coding_human
https://t.me/DMAD_Discussion
https://t.me/capgemini_accenture_code

Python
Make string palindrome Code✅✅
Telegram -@Coding_human
@Coding_human
@Coding_human

TCS Answer 2:30 PM

1.144
2 .325
3.2.2
4.2100
5. 4.555
6.99
7. 510
8. 3.82. @Coding_human
9. 6084
10. 23
11-144
12) 21530 or 22245
13)300000
14) 52,22
15) 4
16) 8
17.200000
18.325.2
19.A
20.0.4
21.12.6
22.19

Telegram @Coding_human

Numerical Ability

1)4320
2)720
3)1:11
4)11mins
5)28
6)5f=4h
7)28.67
8)24,12
9)1565
10.12
11 16.5

✅Telegram @Coding_human

TCS 10Am slot Answer's

1.4536
2.540
3.1:10
4.11Min
5.28
6.5f =4H
7.28.67
8.24,12
9.1565
10.12%
11. 16.5
12. 104

✅Telegram :@Coding_human

public class SmithNumbers {
public static boolean isPrime(int number) {
int loop;
int prime = 1;
for(loop = 2; loop < number; loop++) {
if((number % loop) == 0) {
prime = 0;
}
}
if (prime == 1) {
return true;
} else {
return false;
}
}
public static ArrayList<Integer> primeFactors(int number) {
int sum = 0;
ArrayList al = new ArrayList();
for(int i = 2; i< number; i++) {
while(number % i == 0) {
System.out.println(i+" ");
al.add(i);
number = number/i;
}
}
if(number >2) {
System.out.println(number);
al.add(number);
}
return al;
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number :");
int num = sc.nextInt();
int sum = 0;
@Coding_human
if(isPrime(num)) {
System.out.println("Given number is not smith number ");
} else {
ArrayList<Integer> arrayList = primeFactors(num);
System.out.println("Prime factors of the given number are"+arrayList);
Iterator it = arrayList.iterator();

while(it.hasNext()) {
int n = (int) it.next();
System.out.println(n);
while(n!=0) {
sum = sum+n%10;
n = n/10;
}
}
int temp = 0;
while(num != 0) {
temp = temp + num%10;
num = num/10;
}
System.out.println("sum of the digits of the numbers of the prime factorization: "+sum);
System.out.println("Sum of digits in the given number: "+temp);

if(temp==sum) {
System.out.println("Given number is a smith number");
} else {
System.out.println("Given number is not smith number ");
}
}
}
}

Java
Smith number Code
✅Telegram :@Coding_human

Python minimum operation Code

Join @Coding_human
@Coding_human

Replace diagonal c++ code accenture

@Coding_human

Smith number python
Accenture

@Coding_human @Coding_human

⭐️Technical and HR interviews material

https://bit.ly/3F98IDJ

Share our channel with your college friends : https://t.me/Coding_human

ACCENTURE EXAM ALL SLOTS SOLUTION GROUP:

@Coding_human
https://t.me/accenture_all_slots_exam_code

✅ Share post in ur college Whatsapp grps.

N = int(raw_input().strip())

if N % 2 != 0:
print "Weird" @Coding_human
else:
if N >= 2 and N <= 5:
print "Not Weird"
elif N >= 6 and N <= 20:
print "Weird"
elif N > 20:
print "Not Weird"

Tg : @Coding_human

N = int(raw_input().strip())

if N % 2 != 0:
print "Weird" @Coding_human
else:
if N >= 2 and N <= 5:
print "Not Weird"
elif N >= 6 and N <= 20:
print "Weird"
elif N > 20:
print "Not Weird"

Accenture exam ans
@Coding_human

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

int main() {
int n;
cin>>n;
set<int> s;
for(int i=0;i<=n;i++)
{
int x;
cin>>x;
s.insert(x);
}
cout<<s.size();
return 0;
}


Primes with a twist Code


🔗 Telegram: @Coding_human

🔔Unmute this channel to never miss any updates

Numerical

1. 5.505
2.9.99hrs
3.2:5
4.6002
5.25
6.83.25
7. 70, 71
8. I and II but not III
9.only ll
10.820
11) 91

Telegram - @Coding_human

def flip( ch):
return '1' if (ch == '0') else '0'

# Utility method to get minimum flips when
# alternate string starts with expected char
def getFlipWithStartingCharcter(str, expected):

flipCount = 0
for i in range(len( str)):

# if current character is not expected,
# increase flip count
if (str[i] != expected):
flipCount += 1

# flip expected character each time
expected = flip(expected)
return flipCount

# method return minimum flip to make binary
# string alternate
def minFlipToMakeStringAlternate(str):

# return minimum of following two
# 1) flips when alternate string starts with 0
# 2) flips when alternate string starts with 1
return min(getFlipWithStartingCharcter(str, '0'),
//allcoding1 getFlipWithStartingCharcter(str, '1'))

# Driver code to test above method
if name == "main":

str = "0001010111"
print(minFlipToMakeStringAlternate)

Python
✅Telegram- @Coding_human
@Coding_human

Infosys ans
@Coding_human
https://t.me/DMAD_Discussion
@Coding_human
@Coding_human

10AM slot