๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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 โœ…

4)b
The table was served

5)c
I like the

6)d
All the above


9)c
Traditional


10)b
Veracity


11)b
0 to 54

36)b

37)d

38)b

39)b

40)a

35)b
Select *from bags brand ;

33)a
The statement will fail
31)a
Update bags price

49)error

47) b

23)b

24)c

25)d

14) a

15)a

16)c
class Items:
def init(self,itemId,itemName,itemPrice,itemTotq):
self.itemId=itemId
self.itemName=itemName
self.itemPrice=itemPrice
self.itemTotq=itemTotq
class ItemManagementSystem:
def init(self,L1,comp):
self.comp=comp
def itemWithMaxQuantity(self):
L=[]
d={}
for k in L1:
L.append(k.itemTotq)
for k in L1:
if k.itemTotq==max(L):
d[k.itemName]=[k.itemId,k.itemName,k.itemPrice]
d=dict(sorted(d.items(),key=lambda x:x[0],reverse=True))
for k in d:
print(*d[k])
def findStockAvaliable(self):
c=0
for k in L1:
if k.itemTotq>=comp:
print(k.itemId)
c+=1
if c==0:
print("Item not found")
L1=[]
for _ in range(5):
itemId=int(input())
itemName=input()
itemPrice=int(input())
itemTotq=int(input())
L1.append(Items(itemId,itemName,itemPrice,itemTotq))
comp=int(input())
obj=ItemManagementSystem(L1,comp)
obj.itemWithMaxQuantity()
obj.findStockAvaliable()

Python PRAโœ…
โœ…โœ…โœ…#HackerRank Paths in a Warehouse - HackerRank Python Solution

def numPaths(warehouse):
paths = [[0]*len(warehouse[0]) for i in warehouse]
if warehouse[0][0] == 1:
paths[0][0] = 1
for i in range(1, len(warehouse)):
if warehouse[i][0] == 1:
paths[i][0] = paths[i-1][0]
for j in range(1, len(warehouse[0])):
if warehouse[0][j] == 1:
paths[0][j] = paths[0][j-1]

for i in range(1, len(warehouse)):
for j in range(1, len(warehouse[0])):
if warehouse[i][j] == 1:
paths[i][j] = paths[i-1][j] + paths[i][j-1]
return paths[-1][-1]%(10**9+7)

warehouse = [[1,1,1,1], [1,1,1,1],[1,1,1,1]]
print(numPaths(warehouse))
๐Ÿ”” Infosys Off Campus Drive | Digital Hiring | 9.5 LPA

* Job Role : Specialist Programmer(9.5 LPA) & Digital Specialist Engineer (6.25 LPA)
* Education : BE, B.Tech, ME, M.Tech, MCA, MSc
* Branch : All Branches Eligible
* Batch : 2019, 2020, 2021, 2022
* CTC : 6.25 LPA To 9.5 LPA

https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Digital-Hiring-9.5-LPA.html

โœ… Share with your friends
๐Ÿ“Œ WIPRO INTERVIEW EXPERIENCE (IT) :

Intro
How to handle team members complaint conflict
How to handle clients complain
Relocation
Bond
How do handle disagreement with higher authority
How to handle your mistake
Any questions
Why Wipro
๐Ÿ”” IBM Recruitment 2022 : Hiring Freshers as Associate Systems Engineer With 4.2 LPA

* Job Role : Associate Systems Engineer
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
* Batch : 2019/2020/2021/2022
* Salary : upto Rs 4.2 LPA

https://fresherearth.blogspot.com/2022/03/IBM-Recruitment-2022-Hiring-Freshers-as-Associate-Systems-Engineer-With-4.2-LPA.html

โœ… Share with your friends
๐Ÿ‘1
๐Ÿ“Œ WIPRO INTERVIEW EXPERIENCE (CSE) :

Introduction
Why Wipro
Team management questions
Leadership Abilities
Social works
Family Background
Explain Project
What technology you use currently
Internship technical role
Different b/w C C++
Pointer
What is JVM JRE JDK
What is Inheritance
and Oops questions
ready to sign bond
๐Ÿ‘2
โœ…โœ…โœ…#HackerEarth The Abandoned City - C++ Solution

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

#define ll long long

int main(){
ll n;
cin>>n;
ll arr[100005];
for(ll i=1;i<=n;i++){
cin>>arr[i];
}
ll k;
cin>>k;
ll pre[100005];
pre[0]=0;

for(ll i=1;i<=n;i++){
pre[i] = pre[i-1]+arr[i];
}
if(pre[n]<k){
cout<<-1<<"\n";
}
else{
ll ans = INT_MAX;
for(ll i=1;i<=n;i++){
ll l=i;
ll r=n;
ll mid;
while(l<=r){
//cout<<l<<" "<<r<<"\n";
mid = (l+r)/2;
if(pre[mid]-pre[i-1]>=k){
//cout<<mid<<"\n";
ans = min(ans,mid-i+1);
r=mid-1;
}
else
l=mid+1;
}

}
cout<<ans<<"\n";
}
return 0;
}
โœ…โœ…โœ…#HackerRank Football Scores - Python Solutions

def counts(teamA, teamB):
ans = []
teamA.sort()
for score in teamB:
lo, hi = 0, len(teamA) - 1
while lo <= hi:
mid = (lo + hi) // 2
if teamA[mid] > score:
hi = mid - 1
else:
lo = mid + 1
ans.append(lo)
return ans