Malay Sharma, Co-founder of Peoplegains is offering a group session to help you discover your skills & techniques and to answer your questions and doubts directly.
Heโll be sharing the following:
- Experience and insights on the interview process
- How to enhance your skill set
- Tips to grab high-paying job opportunities
- Ways to build your resume.
Register now - https://visit.preplaced.in/g18
The session will also include a live Q&A, where the mentor will answer all your doubts and concerns.
Heโll be sharing the following:
- Experience and insights on the interview process
- How to enhance your skill set
- Tips to grab high-paying job opportunities
- Ways to build your resume.
Register now - https://visit.preplaced.in/g18
The session will also include a live Q&A, where the mentor will answer all your doubts and concerns.
www.preplaced.in
Get Ready to Sparkle in Your Campus Interview! Learn the Secrets to Stand Out from the Crowd. | Preplaced
Group Session by Malay Sharma | Co-Founder @peoplegains | HR / Behavioural & Communication Mentor @Preplaced | Teamwork , Communication Specialist
๐1
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ pinned ยซMalay Sharma, Co-founder of Peoplegains is offering a group session to help you discover your skills & techniques and to answer your questions and doubts directly. Heโll be sharing the following: - Experience and insights on the interview process - How toโฆยป
If you are a working professional at some startup or, MNC.
Do let us know in the comments below your company and role.
We are planning to create a closed referral group.
Do let us know in the comments below your company and role.
We are planning to create a closed referral group.
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ pinned ยซIf you are a working professional at some startup or, MNC. Do let us know in the comments below your company and role. We are planning to create a closed referral group.ยป
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
(CarDekho Group) is looking to hire Quality Analysts within 0-2 years of experience range.
Location: Gurgaon
Batch: Freshers
Link: https://docs.google.com/forms/d/e/1FAIpQLSfjZOS0Rv8rGrPpsEFMNq4LXo5wrKk2etj_G1xm8ZKoshIKBw/viewform
Location: Gurgaon
Batch: Freshers
Link: https://docs.google.com/forms/d/e/1FAIpQLSfjZOS0Rv8rGrPpsEFMNq4LXo5wrKk2etj_G1xm8ZKoshIKBw/viewform
๐1
How many female candidates have all three exams - Microsoft , DE Shaw and Atlassian on same date - 16th?
Is this for everyone.
Is this for everyone.
๐5
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Founderlink Technologies
Role: Software Developer Intern
Batch eligible: 2023 and 2024 grads
Apply: https://bit.ly/48iea7c
Role: Software Developer Intern
Batch eligible: 2023 and 2024 grads
Apply: https://bit.ly/48iea7c
cuvette.tech
Software Developer Internship in Founderlink technologies Pvt Ltd at Gurugram, Haryana, India | Cuvette
Apply For Software Developer Internship | Skills required are Data Structure, Analytical Thinking, Java | Stipend โน20K-30K | FULL-TIME INTERNSHIP | Location is Gurugram, Haryana, India
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Coding Blocks
Role: DSA Mentor (Java)
Batch eligible: 2023 and previous grads
Apply: https://www.linkedin.com/jobs/view/3716093858
P.S: Apply only if you have decent knowledge of DSA in Java language.
Role: DSA Mentor (Java)
Batch eligible: 2023 and previous grads
Apply: https://www.linkedin.com/jobs/view/3716093858
P.S: Apply only if you have decent knowledge of DSA in Java language.
Linkedin
15 Fulltime Instructor jobs in India
Todayโs top 15 Fulltime Instructor jobs in India. Leverage your professional network, and get hired. New Fulltime Instructor jobs added daily.
๐1
bool isDancingNumber(int num) {
string str_num = to_string(num);
for (int i = 1; i < str_num.length(); i++) {
int diff = abs(str_num[i] - str_num[i - 1]);
if (diff != 1 && diff != 9) {
return false;
}
}
return true;
}
vector<int> print_dancing_numbers(int dancing_limit) {
vector<int> dancingNumbers;
for (int i = 0; i <= dancing_limit; i++) {
if (isDancingNumber(i)) {
dancingNumbers.push_back(i);
}
}
return dancingNumbers;
}
string str_num = to_string(num);
for (int i = 1; i < str_num.length(); i++) {
int diff = abs(str_num[i] - str_num[i - 1]);
if (diff != 1 && diff != 9) {
return false;
}
}
return true;
}
vector<int> print_dancing_numbers(int dancing_limit) {
vector<int> dancingNumbers;
for (int i = 0; i <= dancing_limit; i++) {
if (isDancingNumber(i)) {
dancingNumbers.push_back(i);
}
}
return dancingNumbers;
}
๐1
string convert(string s, int numRows) {
int n = 0;
int i = 0;
bool direction = true;
map<int,vector<char>> ds;
for(auto e:s)
{
ds[n].push_back(s[i]);
if(n == numRows-1)
{
direction = false;
}
if(n == 0)
{
direction = true;
}
i++;
if(direction)
{
n++;
}
else
{
n--;
}
}
string ans = "";
for(auto e:ds)
{
reverse(e.second.begin(),e.second.end());
for(auto k:e.second)
{
ans.push_back(k);
}
}
reverse(ans.begin(),ans.end());
return ans;
}
int n = 0;
int i = 0;
bool direction = true;
map<int,vector<char>> ds;
for(auto e:s)
{
ds[n].push_back(s[i]);
if(n == numRows-1)
{
direction = false;
}
if(n == 0)
{
direction = true;
}
i++;
if(direction)
{
n++;
}
else
{
n--;
}
}
string ans = "";
for(auto e:ds)
{
reverse(e.second.begin(),e.second.end());
for(auto k:e.second)
{
ans.push_back(k);
}
}
reverse(ans.begin(),ans.end());
return ans;
}
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
string convert(string s, int numRows) { int n = 0; int i = 0; bool direction = true; map<int,vector<char>> ds; for(auto e:s) { ds[n].push_back(s[i]); if(n == numRows-1) { โฆ
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name : Beepkart
Role : Software Engineer Internship
Batch : 2023,2024,2022 passouts
Duration : 6-9 months
Link : https://docs.google.com/forms/d/e/1FAIpQLScbkovP5Ef_sALJDgD4X81nvQ68ty8af729OyZq0NaxeLS-gg/viewform
Role : Software Engineer Internship
Batch : 2023,2024,2022 passouts
Duration : 6-9 months
Link : https://docs.google.com/forms/d/e/1FAIpQLScbkovP5Ef_sALJDgD4X81nvQ68ty8af729OyZq0NaxeLS-gg/viewform
#include<bits/stdc++.h>
using namespace std;
const int MAX_CHAR = 100;
bool check(int freq[], int k) {
for (int i = 0; i < MAX_CHAR; i++) {
if (freq[i] != 0 && freq[i] != k) {
return false;
}
}
return true;
}
int perfectSubstring(string s, int k) {
int count = 0;
for (int i = 0; s[i]; i++) {
int freq[MAX_CHAR] = {0}; // Initialize the frequency array for each character
for (int j = i; s[j]; j++) {
int index = s[j] - '0';
freq[index]++;
if (freq[index] > k) {
break;
}
else if (freq[index] == k && check(freq, k)) {
count++;
}
}
}
return count;
}
int main() {
string s;
int k;
cout << "";
cin >> s;
cout <<"";
cin >> k;
int result = perfectSubstring(s, k);
cout << " " << result << endl;
return 0;
}
UI Path โ
using namespace std;
const int MAX_CHAR = 100;
bool check(int freq[], int k) {
for (int i = 0; i < MAX_CHAR; i++) {
if (freq[i] != 0 && freq[i] != k) {
return false;
}
}
return true;
}
int perfectSubstring(string s, int k) {
int count = 0;
for (int i = 0; s[i]; i++) {
int freq[MAX_CHAR] = {0}; // Initialize the frequency array for each character
for (int j = i; s[j]; j++) {
int index = s[j] - '0';
freq[index]++;
if (freq[index] > k) {
break;
}
else if (freq[index] == k && check(freq, k)) {
count++;
}
}
}
return count;
}
int main() {
string s;
int k;
cout << "";
cin >> s;
cout <<"";
cin >> k;
int result = perfectSubstring(s, k);
cout << " " << result << endl;
return 0;
}
UI Path โ
๐2โค1
unordered_map<string, int> memo;
int recur_cost(const vector<int>& lst, int x, int y, int pos, int curr_cost, int count) {
int minm_cost = INT_MAX;
string key = to_string(pos) + "|" + to_string(count);
if (memo.find(key) != memo.end()) {
return memo[key];
}
if (pos >= lst.size() && count == 0) {
return curr_cost;
}
if (pos >= lst.size()) {
return minm_cost;
}
if (count == 0) {
return curr_cost;
}
int curr = recur_cost(lst, x, y, pos + y, lst[pos] + curr_cost, count - 1);
int skip_curr = recur_cost(lst, x, y, pos + 1, 0, x);
minm_cost = min(minm_cost, min(curr, skip_curr));
memo[key] = minm_cost;
return minm_cost;
}
int minm_rehab_cost_r(const vector<int>& lst, int x, int y) {
memo.clear();
return recur_cost(lst, x, y, 0, 0, x);
}
Microsoft Task 1โ
int recur_cost(const vector<int>& lst, int x, int y, int pos, int curr_cost, int count) {
int minm_cost = INT_MAX;
string key = to_string(pos) + "|" + to_string(count);
if (memo.find(key) != memo.end()) {
return memo[key];
}
if (pos >= lst.size() && count == 0) {
return curr_cost;
}
if (pos >= lst.size()) {
return minm_cost;
}
if (count == 0) {
return curr_cost;
}
int curr = recur_cost(lst, x, y, pos + y, lst[pos] + curr_cost, count - 1);
int skip_curr = recur_cost(lst, x, y, pos + 1, 0, x);
minm_cost = min(minm_cost, min(curr, skip_curr));
memo[key] = minm_cost;
return minm_cost;
}
int minm_rehab_cost_r(const vector<int>& lst, int x, int y) {
memo.clear();
return recur_cost(lst, x, y, 0, 0, x);
}
Microsoft Task 1โ
โค1