| Field | Details | |--------|---------| | Company | Arcesium | | Role | Staff Software Engineer | | Location | Hyderabad | | Interview Mode | Virtual | | Interview Process | Ongoing | I recently interviewed for the Staff Software Engineer position at Arcesium. The hiring process started with an online assessment followed by virtual technical interview rounds. The interview focused on problem-solving skills, practical coding and discussions around previous work experience. ...

I recently interviewed with QRT (Quadeye) for a Software Engineer – Data Platform role in Mumbai. The opportunity began when a recruiter reached out to me on LinkedIn regarding a Data Engineer position. Since I was more interested in software engineering, I declined the original role, and the recruiter suggested interviewing for the Software Engineer position instead. The interview process consisted of four rounds, covering coding, low-level design, and high-level system design. Overall, the interviews focused heavily on software engineering fundamentals, design patterns, performance optimization, and distributed systems rather than only algorithmic problem solving. Interview Overview | Company | QRT (Quadeye) | | -------------- | ------------------------------------------------------------- | | Role | Software Engineer – Data Platform (Quantitative Technologist) | | Location | Mumbai |...

I recently interviewed for the SDE-3 position at Tesco. The interview process consisted of two technical rounds, with one round focused on Low-Level Design (LLD) and coding, followed by a High-Level Design (HLD) interview. One notable aspect of the process was the scheduling. After completing the first round on a Monday, the second interview was postponed four times before finally taking place on the Friday of the following week. Here's a detailed breakdown of my experience. Interview Overview | Company | Tesco | | -------------- | ---------------------------------------- |...

Cisco recently conducted its Technical Intern 2027 On-Campus Online Assessment (OA) for students through campus placements. The assessment was well-balanced, evaluating candidates on Computer Science fundamentals, problem-solving ability and implementation skills under a strict time limit. In this thread, I'll share the assessment pattern, the coding questions that were asked, the approaches to solve them and some preparation tips for future candidates. Assessment Overview | Company | Cisco | | -------------------- | ----------------------- | | Role | Technical Intern (2027) |...

Uber recently conducted its 2027 Summer Software Engineering Internship Online Assessment (OA) for campus hiring. The assessment consisted of three coding questions to be solved within a 65-minute time limit. The problems primarily tested data structures, graph traversal, tree algorithms, and simulation skills. Here's a detailed breakdown of the questions and the overall experience. Assessment Overview | Company | Uber | | ------------------- | ----------------------------------------- | | Role | Software Engineering Intern (Summer 2027) | | Hiring Mode | Campus Recruitment |...

Landing a Google L4 Software Engineer interview is a significant milestone for experienced software engineers. Recently, I completed the complete interview process for the Google L4 (US) role. The process consisted of a phone screen, a Googliness interview, two onsite technical coding rounds, and finally the team-matching stage. In this article, I'll share the interview structure, the types of questions I encountered, and my overall experience. Interview Overview | Company | Google | | ---------------- | ---------------------------------- | | Role | Software Engineer L4 |...

The Telescoping Constructor Anti-Pattern occurs when a class has multiple constructors with different combinations of parameters to support optional fields. As the number of optional parameters grows, the number of constructors increases, making the class difficult to read, maintain and use correctly. Example Suppose you have a Car class. public class Car { public string Brand { get; } public string Model { get; }...

The interview began with a brief self-introduction, where I talked about my professional background, current role and the projects I have worked on. The interviewer then focused on my technical experience. Since I had mentioned working with both Memcached and Redis, the interviewer asked me to compare the two. The discussion covered their architecture, use cases, performance characteristics, persistence, data structures and scenarios where one would be preferred over the other. After the technical discussion, the interviewer moved on to a Data ...

NET / C# Fundamentals Can you explain the SOLID principles in object-oriented design? What is Dependency Injection (DI) in C# and why is it important? What are the different service lifetimes in ASP.NET Core (Singleton, Scoped and Transient)? What is middleware in ASP.NET Core and how does the middleware pipeline work? Angular How would you optimize the performance of an Angular application? Entity Framework How can you optimize Entity Framework queries for better performance? What are the differences between the Code-First and Database-First approaches in Entity Framework?...

You are given: A string s consisting of uppercase English letters. An integer k. You are allowed to change at most k characters in the string. During each operation, you can replace any character with any other uppercase English letter. Your goal is to return the length of the longest substring that can be ...

Given two strings s1 and s2, return true if any permutation (anagram) of s1 exists as a substring of s2. Otherwise, return false. A permutation means rearranging all the characters of a string without adding or removing any character. Example 1 Input: s1 = "ab" s2 = "eidbaooo" ...

As part of the interview process for the Tech Lead – Full Stack position at 021 Trade, I was asked to design a highly scalable, low-latency automated trading system capable of executing trades based on user-defined strategies. The assignment focuses on system design, architecture, scalability, reliability, communication protocols, and handling real-world trading scenarios rather than implementation details. Senior Backend Engineer Assignment Context Stocky is a hypothetical stock brokerage startup working on NSE and BSE. ...

Arcesium is widely regarded as one of the most challenging product-company interviews in India. Unlike many companies that focus exclusively on Data Structures and Algorithms (DSA), Arcesium evaluates candidates across multiple dimensions: Problem Solving DSA Low-Level Design Machine Coding Backend Engineering System Design Computer Science Fundamentals ...

KLA is one of the most underrated product companies for software engineers. While companies like Google, Microsoft and Amazon receive most of the attention, KLA builds software that powers semiconductor inspection and manufacturing systems used across the chip industry. As a result, KLA interviews emphasize: Strong computer science fundamentals Problem-solving ability Software design skills Engineering depth Debugging mindset ...

Tools like ChatGPT and GitHub Copilot can generate code, fix bugs, and even explain complex concepts instantly. While they boost speed, some argue they reduce deep learning and problem-solving ability. 👉 Let’s discuss: Do you feel more productive or less confident without AI? Where should we draw the line?

Traditionally, cracking interviews required strong DSA skills. But today, recruiters are also looking for practical experience, GitHub portfolios and deployed projects. At the same time, big tech companies still emphasize algorithmic problem-solving. 👉 For experienced developers: What actually helped you get hired? What would you prioritize if starting again?

With the rise of tools powered by Generative AI, many entry-level coding tasks (like writing boilerplate code, debugging or documentation) are now automated. This raises an important concern are companies still hiring freshers or expecting fewer but more skilled engineers? 👉 Would love to hear from hiring managers and recent graduates: Are junior roles shrinking? ...

I am working mainly with C# (.NET) and JavaScript (React). My tasks include writing new features, fixing bugs and refactoring existing code. I need an AI model that produces the most accurate and reliable code with ...

I work mainly with .NET core (c#) in backend and React for Frontend. Which AI model is best for coding and debugging complex bugs in production-level projects?

Hi everyone, After 2.5 years of consistent effort and preparation, I’m thrilled to share that I’ve finally cracked Atlassian! 🎉 Experience: 8 years Current CTC: ~30 LPA (all fixed) Bonus Stocks: ~10L Atlassian Offer:...

YOE: 1.5 Application Source: Referral (from a senior employee with 15+ years at Microsoft) Screening Test (HackerRank) Q1: Difference Array Question (Easy) You are given an array and multiple range update queries. Each query asks you to add a given value to all elements in a subarray range [l, r]. After performing all queries, return the final array. Example:...

I recently went through the Meta interview process and wanted to share my experience. Hopefully it helps someone set the right expectations. Phone Screen I got two medium-level questions, both from the Top 50 Meta tag on LeetCode. I was able to solve them successfully, so that gave me some confidence going forward. Onsite Interviews Round 1: Coding I got two problems. I was able to solve both optimally in about 35 minutes. ...

I am currently in my first year and have been practicing DSA using Python. I also know a little bit of Java. Should I continue solving problems in Python, switch to Java or try learning a different language for DSA?

How I Started Getting 2+ Recruiter Messages Daily For the past 2 months, I’ve been getting at least 2 recruiter messages daily, and here’s exactly what worked for me 1. Optimize Your Profile Update your LinkedIn headline with the role you’re targeting + key technologies. Rewrite your About section to highlight your journey, strengths and skills. ...

I see many people trying to solve hard problems every day, thinking that’s the only way to improve. But honestly, it can sometimes feel too much and discouraging. So what’s better? Solving a few easy or medium problems every day to stay consistent. Trying harder problems, even if it means solving fewer and struggling more. ...

I recently interviewed for the Software Development Engineer (SDE) - Level 2 role at Zeta . Here’s a detailed breakdown of my experience across all rounds. Interview Rounds Round 1 – Data Structures & Algorithms (DSA) | Attribute | Details | |-----------------|--------------|...

Round 1 – MCQs (10 Java Programming + 10 Aptitude) Focus: Deeper Java pointer/reference and array manipulation — not just “what’s the output” questions. Aptitude: Included classic problems like train problem, speed & work, probability — challenging and time-consuming. Key Takeaway: Time management is crucial in this round. Round 2 – DSA (HackerRank Style) (6 Problems) Duration: 2 hours. Sample Problems: Sherlock and Array Top View of a Tree ...

I was contacted by a recruiter from Vunet Systems for a role requiring the following skills and experience: 3-5 years of experience .NET, OpenTelemetry, APM, Monitoring, AWS, Docker, Kubernetes Hybrid work model Currently, I have 4 years of experience with a CTC of 22 LPA (base)....

I recently got this question in an Amazon Online Assessment (OA) for SDE-2. Thought I’d share my experience + approach since it’s a pretty neat problem. Given an array arr of size n and two integers: m → size of subarray to pick k → max number of +1 increments allowed (total across the whole array) Task: Pick a subarray of size m Apply ≤ k increments (on any elements in that subarray) Maximize the bitwise AND of the chosen subarray Observations 1. Nature of AND AND keeps only the bits that are 1 in every number. So, if we want the final AND to have a certain bit set, that bit must be 1 in all m numbers of the window. 2. Role of Increments By adding +1 repeatedly to a number, at some point a given bit flips to 1 (due to binary carry). Our job is to spend ≤ k total increments to make every number in a window have the same set of target bits. 3. Greedy by Bits Build the answer bitmask from high to low. At each step ask: `text Can I make some window of length m have all bits of this candidate mask using ≤ k increments? ` 4. Cost for One Number to Satisfy a Target Mask X We want a final value y ≥ a such that (y & X) == X. Case 1: (a & X) == X → already good → cost = 0 Case 2: a X but missing some X bits The smallest y ≥ a that has all X bits is (a | X). cost = (a | X) - a 5. Sliding Window Check For a fixed target mask X: Compute per-element costs. Use a sliding window of size m. If any window has sum(costs) ≤ k, then X is achievable. Step-by-step Approach 1. Upper bound Compute an upper bound for the answer: maxVal = max(arr) + k (We can’t push bits higher than what increments allow.) 2. Build the answer bit-by-bit (MSB → LSB) Start with ans = 0. For each bit from the highest present in maxVal down to 0: candidate = ans | (1 X and missing some bits) → cost = (a | X) - a Slide a window of size m over the cost array: If any window sum ≤ k → feasible. `java import java.util.*; public class MaxAndSubarrayWithIncrements { public static long maxAndSubarray(int[] arr, int m, long k) { int n = arr.length; if (m n) return 0; long[] a = new long[n]; long maxA = 0; for (int i = 0; i maxA) maxA = a[i]; } long maxVal = maxA + k; // upper bound of what AND could reach int highestBit = 63 - Long.numberOfLeadingZeros(maxVal); // up to where we should try long ans = 0L; for (int bit = highestBit; bit >= 0; bit--) { long candidate = ans | (1L = m) windowSum -= cost[i - m]; if (i >= m - 1) { if (windowSum = a such that (y & mask) == mask private static long fixCost(long a, long mask) { if ((a & mask) == mask) { return 0L; // already has all required bits } else if (a = a that surely contains mask is mask itself return mask - a; } else { // a >= mask but missing some required bits -> push to a|mask long y = a | mask; return y - a; } } public static void main(String[] args) { System.out.println(maxAndSubarray(new int[]{1, 4, 10, 2}, 2, 8)); // 10 System.out.println(maxAndSubarray(new int[]{1, 1, 1}, 3, 3)); // 2 } } ` Complexity Let B = 1 + floor(log2(max(arr) + k)) (number of bits we try). Time: O(B * n) (we do one linear scan per bit to check feasibility with a sliding window). Space: O(n) for the temporary cost array (can be reduced with some care, but O(n) is simple and fine).

Below is a structured breakdown of the Meesho SDE-3 interview process, including the rounds, sample questions and preparation tips. Interview Rounds Overview Several interview experiences indicate a pattern of the following rounds: Low-Level Design (LLD) / Machine Coding (Possible) System Design / HLD – varies based on role ...