Channel address:
Categories:
Work
Language: English
Subscribers:
1.57K
Description from channel
Welcome to Offcampus Hub
1. Freshers Jobs
2. Off Campus Jobs
3. Walk - In Interviews
4. Government Jobs
5. Placement Papers
6. Study Meterial
For All Graduates ( Engineering, Degree, Diploma)
Join Link:https://t.me/joinchat/qhSKjmyhRn4xNzdl
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
1
4 stars
0
3 stars
0
2 stars
1
1 stars
0
The latest Messages
2022-07-30 20:09:23
OffCampusHub: Byju's Off Campus Drive 2022 Hiring Freshers as Business Development Associate of Any Graduate Degree.
https://www.offcampushub.online/2022/07/byjus-off-campus-drive-2022-hiring.html
663 viewsElliot, 17:09
2022-07-30 16:33:23
Follow us on Google News Guys
666 viewsElliot, 13:33
2022-07-30 16:33:05
OffCampusHub.
https://news.google.com/s/CBIwgOCm-pUB?sceid=IN:en&sceid=IN:en&r=0&oc=1
655 viewsElliot, 13:33
2022-07-30 13:47:47
Total savings of year
Python
Telegram:- @offcampusjobs24
585 viewsElliot, 10:47
2022-07-30 13:47:14
C++
452 viewsElliot, 10:47
2022-07-30 13:28:49
class Solution
{
public:
vector
frequncey(string s)
{
vector freq(26, 0);
for (int i = 0; i < s.length(); i++)
freq[s[i] - 'a']++;
return freq;
}
vector wordSubsets(vector &words1, vector &words2)
{
vector ans;
vector Freq(26, 0);
for (auto &x : words2)
{
vector freq1 = frequncey(x);
for (int i = 0; i < 26; i++)
Freq[i] = max(freq1[i], Freq[i]);
}
for (auto &x : words1)
{
vector freq1 = frequncey(x);
bool flag = true;
for (int i = 0; i < 26; i++)
{
if (freq1[i] < Freq[i])
{
flag = false;
break;
}
}
if (flag)
ans.push_back(x);
}
return ans;
}
};
C++
Word Subsets Code
Telegram - @offcampusjobs24
450 viewsElliot, 10:28
2022-07-30 11:13:05
https://www.offcampushub.online/2022/07/qualitest-off-campus-drive-2022-for.html
383 viewsElliot, 08:13
2022-07-30 10:19:59
C++
Minimum Discomfort Code
Telegram - @offcampusjobs24
405 viewsElliot, 07:19
2022-07-30 10:13:01
https://www.offcampushub.online/2022/07/freshworks-off-campus-drive-2022-for.html
391 viewsElliot, 07:13
2022-07-30 09:00:36
#include
using namespace std;
#define ll long long int
ll solve(ll n)
{
ll position = 1;
ll m = 1;
while (!(n & m)) {
m = m << 1;
position++;
}
return position;
}
int main() {
// your code goes here
ll n,p;
cin>>n;
vector ans(n);
for(int i=0;i {
cin>>p;
ans[i] = solve(p+1);
}
for(int i=0;i cout< return 0;
}
C++
Telegram - @offcampusjobs24
452 viewsElliot, 06:00
O
