650
订阅者
无数据24 小时
-27 天
-330 天
帖子存档
𝐇𝐞𝐥𝐥𝐨 𝐄𝐯𝐞𝐫𝐲𝐨𝐧𝐞,
𝐔𝐧𝐥𝐨𝐜𝐤 𝐲𝐨𝐮𝐫 𝐥𝐞𝐚𝐫𝐧𝐢𝐧𝐠 𝐩𝐨𝐭𝐞𝐧𝐭𝐢𝐚𝐥 𝐰𝐢𝐭𝐡 𝐄𝐚𝐫𝐧𝐲𝐐𝐮𝐢𝐳! 🚀🧠 𝐃𝐚𝐢𝐥𝐲 𝐪𝐮𝐢𝐳𝐳𝐞𝐬, 𝐫𝐞𝐚𝐥 𝐫𝐞𝐰𝐚𝐫𝐝𝐬. 𝐉𝐨𝐢𝐧 𝐧𝐨𝐰: https://www.earnyquiz.in/ 🌟 #𝐂𝐨𝐧𝐭𝐢𝐧𝐮𝐨𝐮𝐬𝐋𝐞𝐚𝐫𝐧𝐢𝐧𝐠 #𝐄𝐚𝐫𝐧𝐲𝐐𝐮𝐢𝐳
https://deloitteconsultingnla.hirepro.in/engineeringhiring.html
Apply
2024 passout
Hi everyone!
It takes a lot of work to find and share useful opportunities every day. Can you help me by telling your college friends about our channel. Your support keeps me going and encourages me to share more opportunities. Just taking a few seconds to spread the word can make a big difference!
Thanks a lot😊🌟
Main Channel -
https://t.me/Coding_000 ❤️
Job Updates:
https://t.me/Offcampus_000 ✅
Free Exam help:
https://t.me/whitehatcoding ❤️
Share above all channels to your friends 😍✅✅
My request to our group family don't trust anyone simply and don't lose money 🙏🥹
Team @whitehatcoding❤️
Sharing = caring = spreading happiness😊
Meesho Screening Test All Details:
You need to login using your registered email id and mobile number on NextLevel App and upload resume in that app. After that you can give the test on NextLevel App.
Camera and Mic will be ON.
You can give your test using your Smart Phone.
This test is like an AI screening in which AI is used to ask you questions and you have to answer the questions verbally similar to interviews.
Questions like, what is polymorphism, time complexity of merge sort etc.
You have to answer them verbally like an interview.
Topics: OOPS, Operating Systems, Data Structures, Algorithms, DBMS, Networking, Error Handling,
There will be MCQ based questions, Answer based questions and output based questions.
Sequential and concept wise questions will be asked.
Don’t do any mistake like moving away your face out of camera (screen) during AI Interview, etc. else your test will be auto submitted.
There will be in total 30 minutes for 26 questions.
Particular time is allotted for each question.✅
All the best .😊 Share @whitehatcoding❤️
How many Of u writing IBM EXam Today ? Give reactions....❤️
Based on reactions i will help...✅
Guys share ur coding questions
👇👇
https://t.me/exams_discussion
https://t.me/exams_discussion
How many of u want IBM Solutions..🆓🆓🆓😊👍👍
Share our channel make 2k 🎯
I will send all ans here....✅✅
Saks subarray product✅
long long solve(vector& nums, int k) {
if (k <= 1) return 0;
int n = nums.size();
long long p = 1;
int i = 0, j = 0;
long long ans = 0;
while (j < n) {
p *= nums[j];
while (i <= j && p > k) {
p /= nums[i];
i++;
}
ans += j - i + 1;
j++;
}
return ans;
}
#include <iostream>
#include <vector>
#include <set>
using namespace std;
vector<vector<int>> edge;
int enemy, person;
vector<bool> visited;
vector<bool> dirty;
void dfs(int node, int par) {
visited[node] = true;
for (int child : edge[node]) {
if (!visited[child]) {
dfs(child, node);
}
}
if (par != -1) {
dirty[par] = dirty[par] || dirty[node];
}
}
int main() {
int n;
cin >> n;
int sz = 0;
for (int i = 0; i < n; ++i) {
int node;
cin >> node;
sz = max(sz, node + 1);
}
edge.resize(sz);
visited.resize(sz, false);
dirty.resize(sz);
int edges;
cin >> edges;
while (edges--) {
int u, v;
cin >> u >> v;
edge[v].push_back(u);
}
cin >> enemy >> person;
dirty[enemy] = true;
dfs(person, -1);
for (int child : edge[person]) {
if (dirty[child]) {
cout << child << " ";
}
}
return 0;
}
juspay✅
# include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
void dfs(vector <vector<ll>> &graph,vector <bool> &visited,ll i)
{
visited[i]=true;
for(auto x: graph[i])
{
if(!visited[x])
dfs(graph,visited,x);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t,i,j,k,n;
cin>>n;
map <ll,ll> m;
for(i=0;i<n;i++)
{
cin>>j;
m[j]=i;
}
ll q;
cin>>q;
vector <vector<ll>> graph(n);
while(q--)
{
ll x1,x2;
cin>>x1>>x2;
graph[m[x1]].push_back(m[x2]);
}
ll x1,x2;
cin>>x1>>x2;
x1=m[x1];
x2=m[x2];
vector <bool> visited(n,false);
dfs(graph,visited,x1);
if(visited[x2])
cout<<"1"<<endl;
else
cout<<"0"<<endl;
}
juspay✅
