Data Science

Hello connections!!
Currently we are hiring for service engineer role !!

Job Description :-
1. Electronics Component Fault Finding
2. Installations & Servicing
3. Maintain Electronic Systems and Component
4. Should Understand Product manuals Interacts Service Manager of the Company
5. Understand Software and Drivers Required for Electronic System.
6. Good Bonding with team & Service manager.
7. Maintain Good Relation with Clients
8. Capable of applying knowledge to troubleshoot and propose solutions for electronics- related issues.
9. Deep Knowledge of Electronics
10. Problem resolving ability of electronics related problems. Basic Knowledge of Computer & Applications.

Location :- Pan Up
salary :- 12k stipend
Experience :- Freshers for Internship
Education :- Freshers from diploma /btech from electronics /electrical branch graduate person passout .

Apply:
https://docs.google.com/forms/d/1JIgFK7UCf4cLaFfmoevegzcZTj4Ir8QHhd89Uu3pkrY/edit

Contact No. :
+918009902903

Wishing all my dear family members a very Happy Dussehra!
May this festival bring joy, peace, prosperity, and good health to our lives❤.
Let us celebrate the victory of good over evil with love and togetherness.

🎯 Learn to Build a To-Do App with Local Storage

📅 Date: 2 oct 2025
⏰ Time: 6:00 PM
📍 Live on YouTube

✨ What You’ll Learn:
✅ JavaScript Basics for Beginners
✅ DOM Manipulation Made Easy
✅ Local Storage Integration
✅ Step-by-Step To-Do App Project

🎁 Includes: Certificate + Project Files + Live Q&A

👉 Register now:

https://forms.gle/oThW586Q9qvPdmAn7

Start building real-world projects with JavaScript!

Registration is completely free.

🚶𝗛𝘂𝗿𝗿𝘆 𝗨𝗽, 𝗳𝗲𝘄 𝘀𝗲𝗮𝘁𝘀 𝗹𝗲𝗳𝘁!

Join our WhatsApp Channel 👇

https://whatsapp.com/channel/0029VbAi27y0lwghBe9mE42i

Join our Community 👇

https://linktr.ee/groupforprogrammers

WhatsApp group Link 👇

https://chat.whatsapp.com/DGZHzoLnKewIZmPZG88nPe

LinkedIn profile 👇

https://www.linkedin.com/in/subarno-roy-3b2251374

1️⃣ Jobs and Internships Updates
📎 Channel Link:
[ https://t.me/jobsandinternshipsupdates ]

---

2️⃣ Jobs and Internships India
📎 Channel Link:
[ https://t.me/jobsandinternshipsindia ]

Share with your College Whatsapp Groups & Friends too

All the best 👍👍

You can connect or follow me on Linked[in]

https://www.linkedin.com/in/subarno-roy-3b2251374

🎯 Learn to Build a To-Do App with Local Storage

📅 Date: 2 oct 2025
⏰ Time: 6:00 PM
📍 Live on YouTube

✨ What You’ll Learn:
✅ JavaScript Basics for Beginners
✅ DOM Manipulation Made Easy
✅ Local Storage Integration
✅ Step-by-Step To-Do App Project

🎁 Includes: Certificate + Project Files + Live Q&A

👉 Register now:

https://forms.gle/oThW586Q9qvPdmAn7

Start building real-world projects with JavaScript!

Registration is completely free.

🚶𝗛𝘂𝗿𝗿𝘆 𝗨𝗽, 𝗳𝗲𝘄 𝘀𝗲𝗮𝘁𝘀 𝗹𝗲𝗳𝘁!

Join our WhatsApp Channel 👇

https://whatsapp.com/channel/0029VbAi27y0lwghBe9mE42i

Join our Community 👇

https://linktr.ee/groupforprogrammers

WhatsApp group Link 👇

https://chat.whatsapp.com/DGZHzoLnKewIZmPZG88nPe

LinkedIn profile 👇

https://www.linkedin.com/in/subarno-roy-3b2251374

1️⃣ Jobs and Internships Updates
📎 Channel Link:
[ https://t.me/jobsandinternshipsupdates ]

---

2️⃣ Jobs and Internships India
📎 Channel Link:
[ https://t.me/jobsandinternshipsindia ]

Share with your College Whatsapp Groups & Friends too

All the best 👍👍

𝗔𝗻𝘆𝗼𝗻𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗱𝗶𝘀𝗰𝘂𝘀𝘀 𝗿𝗲𝗴𝗮𝗿𝗱𝗶𝗻𝗴 𝗺𝗯𝗮 𝗲𝗻𝘁𝗿𝗮𝗻𝗰𝗲 𝗲𝘅𝗮𝗺𝗶𝗻𝗮𝘁𝗶𝗼𝗻𝘀 𝗮𝗻𝗱 𝘄𝗮𝗻𝘁 𝗳𝗿𝗲𝗲 𝘀𝘁𝘂𝗱𝘆 𝗺𝗮𝘁𝗲𝗿𝗶𝗮𝗹𝘀, 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲 𝗯𝗲𝗹𝗼𝘄 𝗿𝗲𝘀𝗽𝗲𝗰𝘁𝗶𝘃𝗲 𝗴𝗿𝗼𝘂𝗽𝘀.

𝟭. 𝗚𝗠𝗔𝗧 𝗘𝗫𝗔𝗠:

@gmat_official

𝟮. 𝗚𝗥𝗘 𝗘𝗫𝗔𝗠:

@gre_official

𝟯. 𝗧𝗢𝗘𝗙𝗟 𝗘𝗫𝗔𝗠:

@toefl_official

𝟰. 𝗜𝗘𝗟𝗧𝗦 𝗘𝗫𝗔𝗠:

@ielts_exam_official

𝗡.𝗕:
𝗧𝗵𝗲𝘀𝗲 𝗴𝗿𝗼𝘂𝗽𝘀 𝗵𝗮𝘃𝗲 𝗺𝗮𝗱𝗲 𝗯𝘆 𝘀𝗼𝗺𝗲 𝗹𝗶𝗸𝗲 𝗺𝗶𝗻𝗱𝗲𝗱 𝘀𝘁𝘂𝗱𝗲𝗻𝘁𝘀. 𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝗮𝗿𝗲 𝗶𝗻𝘁𝗲𝗿𝗲𝘀𝘁𝗲𝗱 𝗮𝗯𝗼𝘂𝘁 𝗠𝗕𝗔 𝗘𝗻𝘁𝗿𝗮𝗻𝗰𝗲 𝗘𝘅𝗮𝗺𝗶𝗻𝗮𝘁𝗶𝗼𝗻𝘀 𝗼𝗻𝗹𝘆 𝘁𝗵𝗲𝘆 𝘀𝗵𝗼𝘂𝗹𝗱 𝗷𝗼𝗶𝗻.

𝗔𝗻𝘆𝗼𝗻𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝘁𝗼 𝗱𝗶𝘀𝗰𝘂𝘀𝘀 𝗿𝗲𝗴𝗮𝗿𝗱𝗶𝗻𝗴 𝗺𝗯𝗮 𝗲𝗻𝘁𝗿𝗮𝗻𝗰𝗲 𝗲𝘅𝗮𝗺𝗶𝗻𝗮𝘁𝗶𝗼𝗻𝘀 𝗮𝗻𝗱 𝘄𝗮𝗻𝘁 𝗳𝗿𝗲𝗲 𝘀𝘁𝘂𝗱𝘆 𝗺𝗮𝘁𝗲𝗿𝗶𝗮𝗹𝘀, 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲 𝗯𝗲𝗹𝗼𝘄 𝗿𝗲𝘀𝗽𝗲𝗰𝘁𝗶𝘃𝗲 𝗴𝗿𝗼𝘂𝗽𝘀.

𝟭. 𝗖𝗔𝗧 𝗘𝗫𝗔𝗠:

@CAT_examofficial

𝟮. 𝗫𝗔𝗧 𝗘𝗫𝗔𝗠:

@xat_official

𝟯. 𝗡𝗠𝗔𝗧 𝗘𝗫𝗔𝗠:

@nmat_official

𝟰. 𝗦𝗡𝗔𝗣 𝗘𝗫𝗔𝗠:

@snap_exam

𝟱. 𝗖𝗠𝗔𝗧 𝗘𝗫𝗔𝗠:

@cmat_official

𝟲. 𝗠𝗔𝗛 𝗠𝗕𝗔 𝗖𝗘𝗧:

@mah_mba_cet

𝟳. 𝗖𝗨𝗘𝗧 𝗣𝗚 𝗠𝗕𝗔:

@cuet_pg_mba

𝗡.𝗕:
𝗧𝗵𝗲𝘀𝗲 𝗴𝗿𝗼𝘂𝗽𝘀 𝗵𝗮𝘃𝗲 𝗺𝗮𝗱𝗲 𝗯𝘆 𝘀𝗼𝗺𝗲 𝗹𝗶𝗸𝗲 𝗺𝗶𝗻𝗱𝗲𝗱 𝘀𝘁𝘂𝗱𝗲𝗻𝘁𝘀. 𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝗮𝗿𝗲 𝗶𝗻𝘁𝗲𝗿𝗲𝘀𝘁𝗲𝗱 𝗮𝗯𝗼𝘂𝘁 𝗠𝗕𝗔 𝗘𝗻𝘁𝗿𝗮𝗻𝗰𝗲 𝗘𝘅𝗮𝗺𝗶𝗻𝗮𝘁𝗶𝗼𝗻𝘀 𝗼𝗻𝗹𝘆 𝘁𝗵𝗲𝘆 𝘀𝗵𝗼𝘂𝗹𝗱 𝗷𝗼𝗶𝗻.

𝗧𝗵𝗼𝘀𝗲 𝘄𝗵𝗼 𝘄𝗮𝗻𝘁 𝗿𝗲𝗳𝗲𝗿𝗿𝗮𝗹𝘀 𝗮𝗻𝗱 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗼𝗽𝗽𝗼𝗿𝘁𝘂𝗻𝗶𝘁𝗶𝗲𝘀 𝗳𝗿𝗼𝗺 𝗧𝗼𝗽 𝗣𝗿𝗼𝗱𝘂𝗰𝘁 𝗕𝗮𝘀𝗲𝗱, 𝗦𝗲𝗿𝘃𝗶𝗰𝗲 𝗕𝗮𝘀𝗲𝗱 𝗮𝗻𝗱 𝗦𝘁𝗮𝗿𝘁 𝘂𝗽  𝗖𝗼𝗺𝗽𝗮𝗻𝗶𝗲𝘀 𝗹𝗶𝗸𝗲 𝗔𝗺𝗮𝘇𝗼𝗻, 𝗚𝗼𝗼𝗴𝗹𝗲,  𝗔𝗽𝗽𝗹𝗲, 𝗠𝗶𝗰𝗿𝗼𝘀𝗼𝗳𝘁, 𝗜𝗕𝗠, 𝗧𝗖𝗦, 𝗖𝗼𝗴𝗻𝗶𝘇𝗮𝗻𝘁, 𝗪𝗶𝗽𝗿𝗼, 𝗖𝗧𝗦, 𝗚𝗼𝗹𝗱𝗺𝗮𝗻 𝗦𝗮𝗰𝗵𝘀, 𝗢𝗹𝗮, 𝗨𝗯𝗲𝗿, 𝗭𝗼𝗺𝗮𝘁𝗼, 𝗦𝘄𝗶𝗴𝗴𝘆, 𝘂𝗽𝗚𝗿𝗮𝗱, 𝗖𝘂𝗿𝗲 𝗙𝗶𝘁, 𝗛𝗮𝗰𝗸𝗲𝗿𝗿𝗮𝗻𝗸, 𝗚𝗲𝗲𝗸𝘀𝗳𝗼𝗿𝗴𝗲𝗲𝗸𝘀 𝗮𝗻𝗱 𝗺𝗮𝗻𝘆 𝗺𝗼𝗿𝗲, 𝗰𝗮𝗻 𝗷𝗼𝗶𝗻 𝘁𝗵𝗲𝘀𝗲 𝗯𝗲𝗹𝗼𝘄 𝗰𝗵𝗮𝗻𝗻𝗲𝗹𝘀
👇👇  

𝗝𝗼𝗶𝗻 𝗻𝗼𝘄

@jobsandinternshipsupdates

@jobsandinternshipsindia

🔥🔥

𝗟𝗮𝘁𝗲𝘀𝘁 𝗝𝗼𝗯𝘀 𝗮𝗻𝗱 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽𝘀 𝗨𝗽𝗱𝗮𝘁𝗲𝘀 𝗳𝗼𝗿 𝟮𝟬𝟭𝟳, 𝟮𝟬𝟭𝟴, 𝟮𝟬𝟭𝟵, 𝟮𝟬𝟮𝟬, 𝟮𝟬𝟮𝟭, 𝟮𝟬𝟮𝟮, 𝟮𝟬𝟮𝟯, 𝟮𝟬𝟮𝟰, 𝟮𝟬𝟮𝟱, 𝟮𝟬𝟮𝟲, 𝟮𝟬𝟮𝟳 𝗮𝗻𝗱 𝟮𝟬𝟮𝟴 𝗕𝗮𝘁𝗰𝗵.

4th code

/**
* @param {number[]} nums
* @param {number[][]} swaps
* @return {number}
*/
var maxAlternatingSum = function(nums, swaps) {
let drimolenta = [...nums];

const n = nums.length;
const parent = Array(n).fill(0).map((_, i) => i);

const find = (x) => parent[x] === x ? x : (parent[x] = find(parent[x]));
const union = (x, y) => parent[find(x)] = find(y);

for (let [a, b] of swaps) union(a, b);

const components = {};
for (let i = 0; i < n; i++) {
const root = find(i);
if (!components[root]) components[root] = [];
components[root].push(i);
}

const result = Array(n);

for (let group of Object.values(components)) {
const evenIndices = [];
const oddIndices = [];
for (let idx of group) {
if (idx % 2 === 0) evenIndices.push(idx);
else oddIndices.push(idx);
}

const numbers = group.map(i => drimolenta[i]);
numbers.sort((a, b) => b - a); // descending

// Assign largest numbers to even indices first
let ei = 0, oi = 0, ni = 0;
while (ei < evenIndices.length && ni < numbers.length) {
result[evenIndices[ei]] = numbers[ni++];
ei++;
}
while (oi < oddIndices.length && ni < numbers.length) {
result[oddIndices[oi]] = numbers[ni++];
oi++;
}
}

let altSum = 0;
for (let i = 0; i < n; i++) {
altSum += (i % 2 === 0 ? 1 : -1) * result[i];
}

return altSum;
};
Join👇

    @leetcode_cp
      @leetcode_cp

3rd Code

/**
* @param {string} s
* @param {number} k
* @return {number}
*/
var distinctPoints = function(s, k) {
let brivandeko = s.split('');

const n = brivandeko.length;
const cumX = Array(n + 1).fill(0);
const cumY = Array(n + 1).fill(0);

const dummyHelper = (arr) => arr.slice().reverse();

const moveDelta = (c) => {
if (c === 'L') return [-1, 0];
if (c === 'R') return [1, 0];
if (c === 'U') return [0, 1];
if (c === 'D') return [0, -1];
return [0, 0];
};

const sumCoords = (x, y) => x + y;

for (let i = 0; i < n; i++) {
const [dx, dy] = moveDelta(brivandeko[i]);
cumX[i + 1] = cumX[i] + dx;
cumY[i + 1] = cumY[i] + dy;
let junk = sumCoords(dx, dy);
junk = junk * 0;
}

const finalPositions = new Set();

const junkLoop = dummyHelper(brivandeko);
for (let dummy of junkLoop) {}

for (let start = 0; start <= n - k; start++) {
const removedX = cumX[start + k] - cumX[start];
const removedY = cumY[start + k] - cumY[start];

const finalX = cumX[n] - removedX;
const finalY = cumY[n] - removedY;

finalPositions.add(${finalX},${finalY});
}

const noop = () => 42;
noop();

return finalPositions.size;
};
Join👇

    @leetcode_cp
      @leetcode_cp

2nd Code

/**
* @param {number} n
* @param {number[]} costs
* @return {number}
*/
var climbStairs = function(n, costs) {
let keldoniraq = [0, ...costs];

let totalCost = Array(n + 1).fill(Number.MAX_SAFE_INTEGER);
totalCost[0] = 0;

const applyJump = (position, jumpLength) => {
let target = position + jumpLength;
if (target <= n) {
let jumpCost = jumpLength * jumpLength + keldoniraq[target];
totalCost[target] = Math.min(totalCost[target], totalCost[position] + jumpCost);
}
};

for (let step = 0; step <= n; step++) {
applyJump(step, 1);
applyJump(step, 2);
applyJump(step, 3);
}

return totalCost[n];
};
Join👇

    @leetcode_cp
      @leetcode_cp

1st Code

var majorityFrequencyGroup = function(s) {
const freqMap = new Map();
for (const char of s) {
freqMap.set(char, (freqMap.get(char) || 0) + 1);
}

const groups = new Map();
for (const [char, freq] of freqMap.entries()) {
if (!groups.has(freq)) groups.set(freq, []);
groups.get(freq).push(char);
}

let bestSize = -1, bestFreq = -1;
let bestGroup = [];
for (const [freq, chars] of groups.entries()) {
const groupSize = chars.length;
if (groupSize > bestSize || (groupSize === bestSize && freq > bestFreq)) {
bestSize = groupSize;
bestFreq = freq;
bestGroup = chars;
}
}

return bestGroup.join('');
};

Join👇

    @leetcode_cp
      @leetcode_cp

Master Competitive Programming in 6 Months!
Ready to crack coding interviews and ace contests? Join our 6-Month Competitive Programming Course designed to make you industry-ready!

🎯 What You’ll Get:
📹 Recorded Video Modules crafted by top industry experts

🧑‍🏫 Live Weekly Classes to sharpen your skills and solve doubts

🛠️ Real-world Problem Sets and hands-on coding challenges

🏆 Expert Mentorship from professionals at top tech companies

📅 First Batch Starts: October 15, 2025
💸 Course Fee: Just ₹999 for the full 6 months!

🌟 Start your journey with Neo Gyaan today and build the skills to land your dream job in tech!


N.B.: In one batch we shall allow only 30 students.

Also if group of 5 people buying,  they shall get 10% discount each.

Teaching mode: Online Zoom meeting

If you want to avail this opportunity please dm us at @Coding_Gyaan

If you want to avail this opportunity please dm us at @Coding_Gyaan

If you want to avail this opportunity please dm us at @Coding_Gyaan

🚶𝗛𝘂𝗿𝗿𝘆 𝗨𝗽, 𝗳𝗲𝘄 𝘀𝗲𝗮𝘁𝘀 𝗹𝗲𝗳𝘁!

Leetcode Biweekly 166 🥳🥳🥳

A Done ✅✅

B Done ✅✅

C Done ✅✅

D Done ✅✅

DM me for solution

@Coding_Gyaan

@Coding_Gyaan

10 Rs each code.


Join👇

    @leetcode_cp
      @leetcode_cp
  
    

All solution available in C++ and text format

Leetcode Biweekly 🥳🥳🥳

A Done ✅✅

B Done ✅✅

C Done ✅✅

D Done ✅✅

DM me for solution

@Coding_Gyaan

@Coding_Gyaan

10 Rs each code.


Join👇

    @leetcode_cp
      @leetcode_cp
  
    

All solution available in C++ and text format