Software engineering salaries

Very easy interview, interviewer was in hurry to ask questions quickly mostly oops and os and few dsa one of them was 2sum and other was sorting a list of squared integers. Overall anyone can crack the interview, i'll update the company culture once i join.

BTech Dual from Tier 1 Years of Experience: 4.5 For experienced engineer, what's your current and past experience? Previously at FAANG Date of the Offer: Dec 2024 Company: LinkedIn Title/Level: Senior Software Engineer Location: Bangalore Salary: 61 LPA Stock bonus: 140k USD over 4 years Bonus: 10% Total comp (Salary + Bonus + Stock): ~95 LPA

Tier 1 Master\u2019s YOE 6.5 Last Company Oracle Last Role: SSE IC3 CCTC 22 all fixed Offered CTC : SDE 2 L5 Base 32 LPA Joining bonus 10 LPA / year for first 2 years. 9 RSU for first year = ~ Rs. 1,74,000 (175 RSU for 4 years) TC = ~44 LPA Is this a low-ball offer due to my last CTC? Also, when they asked my expectation initially I asked for 45 base and \u201csome\u201d stocks. Please suggest if there is any better way to ask for compensation. And should I say the total compensation expectation (inckluding stocks) clearly when I\u2019m asked?

BTech from Tier-3 college, 4 years of experience as Software Engineer at product-based org, current compensation 18 LPA + 2 lakhs worth stocks per year, offered position SDE-2, offered compensation 30 LPA + 10% performance bonus + 15 lakhs of stocks vested over 4 years

Received this offer from Qualcomm:- Gross Salary + Retirals - INR 2,668,109 Joining RSU - 15k USD Performance RSU - 9.75k USD Performance Bonus - 1.87 Lakh Locations - Bangalore, India.

For 2024, Research Associate Sysmex offered me 6 million yen as annual compensation for Research Associate position.

The user is seeking advice on career path and pay for data engineers vs web/backend developers.

Companies paying 50 LPA as Base to a FE developer I am a Frontend developer(React) with close to 5 years of experience. I do have basic DSA knowledge like I can solve questions related to Arrays, Strings, LinkedList, Stack, Queues and bit of Tree related problems. But I have not practised graphs, DP, 2D array etc or hard level problems. I am well versed with FE principles and FE system design etc. I am preparing to crack companies who can pay 60 LPA as base. My Current compensation is 30 as fixed.

Base Salary: Rs. 13,78,00 LPA Relocation Bous: Rs. 2,22,000 LPA Stock: 200 RSUs vested over 4 years(around 14.5 lakhs) CTC: 30.5LPA

HTML-formatted description with main points in bullet points

Total YOE - 7 years Current TC - 36L Base + 4L Variable pay + 35L RSU/year Current Company - Fintech US Based

HTML-formatted description with main points in bullet points

Greedy Algorithm / Math / Distance Calculation We are given three positions on a number line: · x: Position of Person 1. · y: Position of Person 2. · z: Position of Person 3 (the destination point). Person 1 and Person 2 both move towards Person 3 at the same speed, and we need to determine which person reaches Person 3 first. If both arrive at the same time, we return 0. Otherwise, we return 1 for Person 1 or 2 for Person 2, depending on who arrives first. The problem is quite simple and involves calculating the absolute distance from each person to Person 3 and comparing those distances. Calculate the Distance: We can calculate the distance from Person 1 to Person 3 as abs(x - z), and similarly, calculate the distance for Person 2 with abs(y - z). Comparison: If the distance for Person 1 is smaller than that of Person 2, return 1 (meaning Person 1 reaches first). If the distance for Person 2 is smaller than that of Person 1, return 2. If both distances are the same, return 0 (indicating they reach at the same time). This approach ensures an O(1) time complexity, as we only need to perform a few constant-time operations. Code Implementation: class Solution { public: int findClosest(int x, int y, int z) { int dist1 = abs(x - z); // Distance from Person 1 to Person 3 int dist2 = abs(y - z); // Distance from Person 2 to Person 3 if (dist1 Time Complexity: The time complexity of the solution is O(1) because we are performing constant-time operations. Space Complexity: The space complexity is O(1) as we are only using a fixed amount of extra space to store distances.

Can You Solve This in Under 8 Minutes ?

null

...