๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
TCS IRA answers (Python)

35)c
Null records from manager table

36)b
1

37)Daron
A

38)emp1

39)a
Brids are crow

40)b
0 2 4

41)5 8 0 9

42)a
13, 9

43)c
3210

44)a
1 3 4

46)d

21)b class

27)A inner
๐Ÿ‘2
TCS IRA answers (Java)

1.C
2 PRIVATE CLOUD
3. VOLUME
4.ALL THE EVIDENCE
5. INTEGRITY
6.choose
7.accurate and accessible
8.instruct
9.the table
23.ERROR
24.95,195
25.ALL OF THESE
36.length()
37.string()
41.non of thesee
42.reference of array
45.e BU
๐Ÿ‘1
๐Ÿ“ŒTCS INTERVIEW EXPERIENCE(Mechanical):

1) Introduction
2)OOPS concept with example
3) Hard water Vs Soft Water
4) Law of thermodynamics
5)Explain Static Void main
6)Explain Garbage Collector
7)Why Mechanical to IT
8) Why Should we hire you
9)What do you know about TCS

HR:
1)Introduction
2)Any problem for relocate /Night Shift
3)Any backlog
4) 60% above in 10/12/graduation
๐Ÿ“Œ TCS DIGITAL INTERVIEW EXPERIENCE (ECE)
1) Introduction
2)Explain OOPS in Java
3)Explain Factorial Code using different approaches
4)Explain Types of Joins
5)Explain different types of Normalisations
6)Write query to find second largest salary
7)Explain About Your Project
8) Difference Between List and Tuple
HR Questions :
9)Do you have any backlogs
10) Are you comfortable with relocation
11) Why would you like to join TCS
๐Ÿ“ŒWIPRO INTERVIEW EXPERIENCE:

1)Self introduction
2)Project
3)How you are quick learner
4)Leadership skill
5)Willing to relocation
6)Bond
7)10 th mark
8)12 th mark
9)Graduation cgpa
10)Any question
๐Ÿ‘1
ude<bits/stdc++.h>
// bigger smaller code
using namespace std;



int main() {
int n,k;
cin>>n>>k;
vector<int> arr(n);
multiset<int> s;
set<int> ss;
set<int>::iterator it;
for(int i=0;i<n;i++){
cin>>arr[i];
s.insert(arr[i]);
ss.insert(arr[i]);
}
while(k--){
if(ss.size()==1){
break;
}
it=ss.begin();
int first =*it;
ss.erase(it);
it=ss.begin();
int second=*it;
ss.erase(it);
ss.insert(second-1);
ss.insert(first+1);
auto it1=s.lower_bound(first);
s.erase(it1);
auto it2=s.lower_bound(second);
s.erase(it2);
s.insert(second-1);
s.insert(first+1);

}
int ans=0;
for(auto it:ss)
ans=max(ans,it);
cout<<ans<<endl;
return 0;

Bigger to Smaller (C++)
IDFC