๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
Hello Everyone, due to some reason we have decided to stop the services on stupidtechy.me. Right now we have disabled Registration. Soon we will delete the site. Sorry for Inconvenience... ๐Ÿ˜”
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