โ
โ
โ
#HackerRank EV Positive Prefixes - HackerRank Python Solutions
https://stupidtechy.me/threads/ev-positive-prefixes-hackerrank-python-solutions.261/
https://stupidtechy.me/threads/ev-positive-prefixes-hackerrank-python-solutions.261/
โ
โ
โ
#HackerRank EV Longest Work Slot - Python HackerRank Solutions
https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/
โ โ โ #HackerRank EV Longest Work Slot - Python HackerRank Solutions
https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/
https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/
โ โ โ #HackerRank EV Longest Work Slot - Python HackerRank Solutions
https://stupidtechy.me/threads/ev-longest-work-slot-python-hackerrank-solutions.260/
StupidTechy.Me
HackerRank - EV Longest Work Slot - Python HackerRank Solutions
EV Longest Work Slot - Python HackerRank Solutions
Python 3 - Solutions
(Hidden text: Visit the forum thread!)
EV Longest Work Slot - Python HackerRank Solutions
Python 3 - Solutions
(Hidden text: Visit the forum thread!)
EV Longest Work Slot - Python HackerRank Solutions
โ
โ
โ
#HackerRank Coding Friends HackerRank Java Solutions
https://stupidtechy.me/threads/coding-friends-hackerrank-java-solutions.262/
https://stupidtechy.me/threads/coding-friends-hackerrank-java-solutions.262/
StupidTechy.Me
HackerRank - Coding Friends HackerRank Java Solutions
Coding Friends HackerRank Java Solutions
Java - Code
(Hidden text: Visit the forum thread!)
Coding Friends HackerRank Java Solutions
Java - Code
(Hidden text: Visit the forum thread!)
Coding Friends HackerRank Java Solutions
โ
โ
โ
#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))
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))
โ
โ
โ
#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โ
โ
โ
#HackerRank First Unique Character - C++ Solutions - HackerRank Solutions
# include <iostream>
using namespace std;
int printDistinct(string str)
{
int count[256];
int ans;
int i=-1;
for (i = 0;i< str.length(); i++)
if(str[i]!=' ')
count[str[i]]++;
for (i = 0; i <str.length(); i++)
if (count[str[i]] == 1){
ans=i+1;
break;
}
return ans;
}
int main()
{
string str;
cin>>str;
int res=printDistinct(str);
cout<<res;
return 0;
}
๐ฐTelegram - t.me/sup777examsโ
โ
โ
#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))
๐ฐTelegram - t.me/sup777examsโ
โ
โ
#HackerRank Circular Array - C++ Solution
https://i.ibb.co/5hbxdJY/circular-array-test-problem-description.jpg
Code - https://pastebin.com/vzrsQerd
https://i.ibb.co/5hbxdJY/circular-array-test-problem-description.jpg
Code - https://pastebin.com/vzrsQerd
โ
โ
โ
#HackerRank Examination Data - SQL Solution
Select UPPER(Name),Marks from exam
where marks%2=0
order by name;