𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

IBM SDE off Campus Hiring 2022 | 2021 | 2020 | 2019 Batch | Salary 7LPA+ Country/Region:IN

State:MULTIPLE
City:Multiple Cities
Category:Software Development & Support
Required Education:Bachelor's Degree
Position Type:Entry Level
Employment Type:Full-Time
Contract Type:Regular
Company:(0063) IBM India Private Limited
Req ID:585772BR

Click here to apply

https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?PageType=JobDetails&partnerid=26059&siteid=5016&jobid=614910&codes=IBM_CareerWebSite#jobDetails=614910_5016

Brassring

Software Developer - IBM Careers - Job Details

Job Details: You will be part of Squad which will be co-located in Bangalore or HyderabadYou will be involved in analysis/p

👍2

751 viewsDushyant, 17:40

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Infosys SP and DSE 3pm
Python 3✅

852 viewsDushyant, edited 11:06

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Infosys SP and DSE 3pm
Entropy and dominant
Python 3

👍1

873 viewsDushyant, edited 11:43

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Great news for Programmers❗️

We have created a separate channel to help you guys prepare for the coding interviews.
We will provide practice questions with solutions and study material to crack coding interviews

Join fast
👇👇
@crackingthecodinginterviews

788 viewsSAGE, 16:24

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Cisco Off Campus Drive❗️

🎖 Batch - 2023 & 2024
📝 Link - jobs.cisco.com/jobs/ProjectDetail/Software-Engineer-Quality-and-Operations-Intern-India-UHR/1375533

👍1

816 viewsSAGE, 16:25

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️HCL Careers for Freshers 2022 : Hiring as Graduate Trainee With 6 LPA❗️

👨‍💻 Designation : Graduate Trainee
🎖 Batch : 2020/2021/2022
🎓 Eligibility : B.E/B.Tech/M.E/M.Tech/MBA/B.Com
💰 CTC : Rs. 4.6-6LPA

https://freshers.hcltech.com/

✅ Share with your friends

761 viewsSAGE, 18:20

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Axis Bank Recruitment 2022 : Hiring for Freshers as Assistant Manager with 4.54 LPA❗️

👨‍💻 Designation : Assistant Manager
🎓 Eligibility : Any Degree
🎖 Batch : 2020/2021/2022
💰 CTC : Rs. 4.54LPA

https://axisbankybp.online-ap1.com/index.html

✅ Share with your friends

Online-Ap1

Axis Bank | Young Bankers Program

778 viewsSAGE, 18:21

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Reznet Off Campus Drive 2022 : Hiring for Freshers as Rail Signalling Engineer❗️

👨‍💻 Job Role : Rail Signalling Engineer
🎓 Qualification : B.E/B.Tech
🎖 Batch : 2022
💰 Salary : 3 LPA*

https://www.firstnaukri.com/careers/customised/landingpage/reznet/index.html

✅ Share with your friends

👍1

791 viewsSAGE, 18:22

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🔔KPMG Off Campus Recruitment 2022 : Hiring for Freshers as Analyst

*Designation: Analyst
*Eligibility: B.E/B.Tech
*Batch: 2020/2021/2022
*Job Location: Bangalore
*Salary CTC: 3 LPA*

https://aa046.taleo.net/careersection/ex/jobdetail.ftl?job=59282

✅ Share with your friends

875 viewsSAGE, 18:25

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

https://leetcode.com/problems/find-and-replace-pattern/description/

857 viewsDushyant, 03:55

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』 pinned «https://leetcode.com/problems/find-and-replace-pattern/description/»

03:55

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

class Solution {
private:
bool isvalidMatching(string & word, string & pattern) {
unordered_map<char,char>mpp;
unordered_set<char>lookup;
for(int i=0;i<word.size();i++){
if(mpp.find(word[i])!=mpp.end()){
if(mpp[word[i]]!=pattern[i]) return false;
}else{
if(lookup.count(pattern[i])) return false;
mpp[word[i]]=pattern[i];
lookup.insert(pattern[i]);
}
}
return true;

}
public:
vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
vector<string>ans;
for(auto &word:words){
if(isvalidMatching(word,pattern)){
ans.push_back(word);
}
}
return ans;
}
};

Find and Replace Pattern ✅
(C++)

👍1

923 viewsDushyant, edited 03:56

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』 pinned «class Solution { private: bool isvalidMatching(string & word, string & pattern) { unordered_map<char,char>mpp; unordered_set<char>lookup; for(int i=0;i<word.size();i++){ if(mpp.find(word[i])!=mpp.end()){ …»

03:57