Cracking a software engineer interview comes down to three things: problem-solving depth, fundamentals, and communication. Most product companies test data structures and algorithms, core CS subjects like OS, DBMS and OOP, and how well you explain your reasoning. Build depth by solving problems consistently instead of passively watching tutorials, know your resume projects inside out because interviewers dig into them, and do a few mock interviews to practise thinking out loud. If you can clarify the problem, discuss time and space complexity, and handle follow-up questions calmly, you are already ahead of most candidates.

A focused 8–12 week plan works for most people. Spend the first 4–6 weeks strengthening DSA patterns like two pointers, sliding window, binary search, trees, graphs and dynamic programming, the next 2–3 weeks on CS fundamentals and your resume projects, and the final 2 weeks on company-specific questions, revision and mock interviews. Track weak areas, revisit problems you failed after a week, and simulate real conditions with a timer. Preparing in phases like this prevents last-minute panic and gives you time to fix gaps properly.

Google interviews focus heavily on data structures, algorithms and problem-solving rather than specific technologies. Expect multiple coding rounds where you must think aloud, clarify requirements, start with a brute force approach, optimise it, and analyse complexity. Practise medium and hard LeetCode-style problems on graphs, trees, DP and heaps, and revise CS fundamentals for the later rounds. Since the bar is high, start 3–6 months in advance, do timed practice, and take mocks that simulate probing follow-up questions.

Most companies in India follow a similar flow: an online assessment or coding test, followed by 2–4 technical rounds covering DSA, CS fundamentals and projects, and finally an HR or hiring-manager round. Product companies often add a system design or LLD round for experienced candidates, while service companies lean more on aptitude, SQL and basic programming. Some roles also include a take-home assignment or a pair-programming round. Timelines vary from a few days to a few weeks, and off-campus applications usually take longer than campus placements.

For freshers, interviewers usually start with basics: OOP concepts, arrays vs linked lists, time complexity, SQL joins, and one or two easy-to-medium DSA problems like string reversal or cycle detection. Then they probe your resume — internships, projects and technologies you claim to know — followed by puzzles or situational questions, and finally HR questions like why they should hire you. Practising common fresher questions plus explaining your projects out loud covers most of what you will face.

Competitive programming is solving algorithmic problems under time limits on platforms that automatically judge your code for correctness and efficiency. Contests give you problems rated by difficulty, and your speed and accuracy build a rating over time. It sharpens DSA skills, quick thinking and clean coding under pressure, which is exactly what coding interviews test. For students in India, a strong competitive programming background also makes a resume stand out for product companies and programs like GSoC.

Start by learning one language well — usually C++ or Python — then pick a platform and begin with the easiest rated problems instead of jumping straight into contests. Learn topics in order: arrays, strings, sorting, searching, two pointers and prefix sums, then recursion, and only after that trees and graphs. Solve 2–3 problems daily, read editorials when stuck too long, and enter your first contest after 3–4 weeks even if you solve only one problem. Consistency over six months matters far more than natural talent at the start.

Effective practice means solving problems slightly above your current level, not grinding hundreds of easy ones. Give every problem a genuine 30–45 minute attempt before reading the editorial, then re-solve it from scratch a few days later. After each contest, upsolve the problems you could not crack during the round — this is where most improvement actually happens. Keep a notes file of patterns and mistakes, and focus on one topic at a time until you can solve its standard problems reliably.

A competitive programming profile is your public record on platforms like Codeforces, CodeChef or LeetCode — your rating, contest history, problems solved and rankings. Recruiters at product companies and selection committees for programs like GSoC often check these profiles as proof of problem-solving ability, especially for freshers with limited work experience. A solid rating can get your resume shortlisted faster, and participating in rated contests regularly keeps the profile active and credible.

A practical progression looks like this: in months 1–2, master one language along with arrays, strings, sorting, searching and prefix sums; in months 3–4, learn recursion, backtracking, basic number theory and greedy techniques; in months 5–6, move to trees, graphs and dynamic programming while giving regular rated contests. After that, focus on advanced DP and segment trees with higher problem volume. Give one contest every week from month two onwards and always upsolve afterwards. Adjust the pace to your college or work schedule, but never skip the fundamentals phase.

Codeforces, CodeChef and LeetCode are the most widely used. Codeforces is best for serious rating growth and fast-paced contests, CodeChef works well for Indian students with its contests and campus chapters, and LeetCode is ideal if your main goal is interview preparation since its problems closely match company interviews. AtCoder is excellent for clean, logical problems, and HackerRank is a gentle starting point for absolute beginners. Pick one primary platform for ratings and one for interview-style practice instead of spreading yourself thin across all of them.

Two books cover most needs. "Guide to Competitive Programming" by Antti Laaksonen is beginner-friendly and walks through standard topics with working code. "Competitive Programming 4" by Steven and Felix Halim is far more detailed and better suited once you are comfortable with basics and want depth for ICPC-level contests. That said, most people today learn faster from platform editorials and curated problem sets, so treat books as theory reference material rather than your only resource.

Begin with easy problems in core topics — arrays, hashing, two pointers, stacks, linked lists and binary trees — and focus on understanding the underlying pattern of each solution instead of memorising code. Once easies feel comfortable, shift most of your time to medium problems, since interviews are dominated by them. If you have an interview lined up, study the company-tagged top interview questions, and use the discuss section when a solution does not click. Roughly 150–200 well-understood problems beat 500 rushed ones.

Curated lists work far better than solving problems randomly. The Blind 75 is a compact starting list covering the essential patterns, and the NeetCode 150 expands it with clearer topic organisation and video explanations. If you have more time before applications, LeetCode's company-tagged top interview questions help in the final weeks. Whichever list you pick, finish it with full understanding — re-solving the problems you initially failed — rather than jumping between multiple lists at once.

Yes — interview experiences are one of the best free preparation resources available. They reveal the actual round structure, difficulty level, types of questions asked and even the interviewer's style for a specific company, which job descriptions never show. Read the recent posts for your target company and role, note the recurring questions and topics, and practise those patterns yourself instead of just reading the answers. Remember that experiences vary by team, so use them as a guide rather than a guarantee.