Interview
Goldman Sachs India Hackathon 2027: Dates, Eligibility and Practice Questions
Goldman Sachs India Hackathon 2027 dates are not announced. See last year's timeline, CS and Quant tracks, eligibility, sample questions and the PPI route.

Practise the rounds for the Goldman Sachs India Hackathon
Short answer: The 2027 edition has not been announced as of 29 October 2026. The last edition (2026) ran registration from 22 April to 10 May 2026, with the Quant track on 23 May and the CS track on 24 May, each 9 AM to 9 PM IST, per a third-party listing. If the pattern repeats, expect the 2027 window in April to May, but that is an inference, not an announcement. Goldman Sachs's own page blocked my automated access, so confirm everything on the official hackathon page.
The Goldman Sachs India Hackathon isn't a build-an-app hackathon. It's an individual, timed coding contest on HackerRank, with a Computer Science track and a Quantitative track. Think of it as a very long online assessment that doubles as a hiring funnel.
If you're graduating in 2028 or 2029 and want to be ready for the next one, you have roughly six months. That's enough time if you start now.
Goldman Sachs India Hackathon: Key Dates (last checked 29 Oct 2026)
| Detail | 2026 edition (last) | 2027 edition |
|---|---|---|
| Registration opens | 22 April 2026 (Internshala, third-party) | Not announced |
| Registration closes | 10 May 2026 (Internshala, third-party) | Not announced |
| Quant track | 23 May 2026, 9 AM-9 PM IST (third-party) | Not announced |
| CS track | 24 May 2026, 9 AM-9 PM IST (third-party) | Not announced |
| Mentorship | June 2026 for shortlisted students (third-party) | Not announced |
| Finale | Campus finale after mentorship (third-party) | Not announced |
| Expected window (inferred) | April to May 2027, based on the 2025 and 2026 pattern |
For the 2025 edition, a Talentd summary points to a similar spring timeline, with registration starting around 21 April. These are all aggregator sources. The official Goldman Sachs page returned an access error for me, so none of these dates are confirmed from Goldman itself. Check the page before you plan around any date.
Format: Tracks and Rounds
Per the third-party listing for the 2026 edition:
- Computer Science track: data structures, algorithms, optimisation and programming logic.
- Quantitative track: probability, statistics, linear algebra, calculus and mathematical modelling.
- You can enter one track or both; they run on different days.
- Online, individual, hosted on HackerRank, 12 hours long (9 AM to 9 PM). You need an active HackerRank account.
- Judging is described as accuracy, code efficiency and handling time pressure.
- There is one timed contest per track, not a multi-round elimination as such. Shortlisted students then go to mentorship sessions with Goldman Sachs engineers and a campus finale.
The listings do not state which languages were allowed, how many problems each track had, or the scoring weights, so I won't guess. If you've done Goldman's HackerRank online test, our HackerRank Goldman Sachs guide covers what that platform experience is like.
A 12-hour window sounds relaxed but isn't. The skill being tested is sustained accuracy: not burning out, not shipping a brute force that times out, and pacing across problems.
Goldman Sachs Hackathon Eligibility
For the 2026 edition, listings agree on:
- Engineering students graduating in 2027 or 2028 (so the next edition likely targets 2028 and 2029 graduates; inferred)
- From eligible Indian colleges
- Registration is free, and incomplete or inaccurate registrations may be disqualified (per a search summary of the official page, which I could not open directly)
Goldman Sachs Hackathon Eligible Colleges
I could not retrieve an official list. The aggregator pages I read do not reproduce one, and one source says the official list (a "Schedule A") is the definitive reference. So:
- Open the official hackathon page when registration opens.
- Look for the eligible-colleges list in the terms or FAQs.
- If your college is missing, email the contact on the page before the deadline rather than relying on a blog.
Don't trust any site that gives you a confident college list without linking the official document.
Prizes and the Pre-Placement Interview Route
The 2026 listing reports Apple-device prizes (a MacBook Air for first place, an iPhone for second, an iPad for third). Those are less interesting than the second benefit: the hackathon acts as a hiring funnel, with high performers described as getting fast-tracked pre-placement interview (PPI) opportunities for Goldman Sachs internships and roles. Terms like which batch gets PPIs are listed differently across aggregators, so confirm eligibility with Goldman.
How it routes into the internship interviews
A strong hackathon result can put you directly into the interview process, but the interviews themselves are the standard Goldman engineering ones. Prepare for:
- A HackerRank-style coding round: Goldman Sachs HackerRank guide
- The wider summer analyst process: Goldman Sachs 2027 Summer Analyst engineering prep
- The coding patterns commonly reported: Goldman Sachs coding interview patterns
- The Superday-style conversation: Goldman Sachs interview process
Treat the hackathon as getting you a better seat at that table, not as replacing it.
Goldman Sachs Hackathon Questions: What to Expect
Goldman doesn't publish past papers, and I will not reproduce any problem a candidate has leaked. What the track descriptions imply is a mix of algorithmic coding (CS) and probability and maths-heavy problems (Quant). Below are original practice problems in that style, with approach notes. They are not real hackathon questions.
Practice problem 1 (CS): Minimum-cost task batching
You have n tasks in a row, each with a processing time. You must split them into consecutive batches. A batch's cost is its total time squared, plus a fixed setup cost S. Minimise the total cost.
Approach: Define dp[i] as the best cost for the first i tasks. dp[i] = min over j < i of dp[j] + (prefix[i] - prefix[j])^2 + S. That's O(n^2). With n up to around 10^5 you need the convex hull trick, since the cost function is a convex quadratic in prefix sums. Say the O(n^2) version first, then optimise. Watch for integer overflow: squares of large prefix sums need 64-bit.
Practice problem 2 (CS): Order book matching
Given a stream of buy and sell orders (price, quantity, timestamp), match the highest buy with the lowest sell whenever buy price >= sell price, and output the trades.
Approach: Two heaps: a max-heap for buys and a min-heap for sells, with timestamp as a tie-break for time priority. Process each order, match while the top prices cross, and push the remainder back. The traps are partial fills and tie-breaking, so write down your rules before coding. This is a finance-flavoured heap problem, which fits the firm's domain.
Practice problem 3 (CS): Longest window with bounded range
Given an array of daily prices, find the longest contiguous window where max minus min is at most K.
Approach: Sliding window with two monotonic deques (one for max, one for min). Expand right, shrink left while the range exceeds K. O(n). A sorted-container solution works but is slower.
Practice problem 4 (Quant): Expected rolls
You roll a fair six-sided die repeatedly until you see two consecutive sixes. What is the expected number of rolls?
Approach: Use states: E0 (no six just rolled), E1 (last roll was a six). E0 = 1 + (1/6)E1 + (5/6)E0; E1 = 1 + (1/6)(0) + (5/6)E0. Solve: E0 = 42. Show the state equations first; they generalise to any pattern problem.
Practice problem 5 (Quant): Random walk ruin
A gambler starts with 3 units, wins or loses 1 unit with equal probability each round, and stops at 0 or 10. What is the probability of reaching 10?
Approach: For a fair walk the probability of hitting the upper boundary is the starting position over the total: 3/10. The reasoning to articulate is that the walk is a martingale, so expected final wealth equals starting wealth.
Practice problem 6 (Quant): Matrix power
A Markov chain has transition matrix P over three states. How do you find the long-run distribution, and when does it exist?
Approach: Solve pi P = pi with the entries summing to 1, which is a left eigenvector for eigenvalue 1. A unique solution exists if the chain is irreducible; convergence from any start needs aperiodicity as well. Be ready to compute it by hand for a 3x3 case.
A Six-Month Preparation Plan
Months 1-2: Core DSA. Cover arrays, hashing, heaps, graphs and DP using the DSA Patterns Sheet.
Month 3: Quant foundations (if you plan the Quant track). Conditional probability, expectation, linearity of expectation, basic Markov chains, and matrices.
Month 4: Long-contest stamina. Run 4 to 6 hour mock sessions, then a full 12-hour weekend simulation once. Practise eating, breaks and re-planning.
Month 5: Implementation under pressure. Heap and order-processing simulations, string parsing, and careful edge cases.
Month 6: Registration readiness. Create your HackerRank account, check the official eligible-colleges list, and practise explaining your solutions aloud with an AI mock interview so the PPI conversation doesn't catch you cold.
Pair this with the hackathon strategy guide for time-management habits and keep the hackathons calendar bookmarked for date updates.
Common Mistakes
- Waiting for the announcement to start. The 2026 registration window was under three weeks long.
- Relying on a blog's college list. Only Goldman's own document counts.
- Entering both tracks without preparing for both. Quant and CS problems need different warm-ups.
- Ignoring efficiency. The listing says code efficiency is judged, so a slow correct solution loses marks.
- Treating it as a team event. It's individual.
Frequently Asked Questions
When is the Goldman Sachs Hackathon 2027?
Not announced. The 2026 contests were on 23 and 24 May 2026, and registration ran 22 April to 10 May. Expect a similar spring window (inferred) and check the official page.
What is the Goldman Sachs India Hackathon format?
An individual, 12-hour online contest on HackerRank with a CS track and a Quant track, followed by mentorship and a campus finale for shortlisted students (third-party listing for 2026).
Which colleges are eligible?
Eligible Indian colleges per Goldman's own list, which I could not retrieve. Check the official page.
Who is eligible?
For 2026: engineering students graduating in 2027 or 2028. The 2027 edition will likely shift by a year (inferred).
What are Goldman Sachs hackathon questions like?
CS: data structures, algorithms and optimisation. Quant: probability, statistics, linear algebra, calculus and modelling. Our sample problems above are original, not past questions.
Can I enter both tracks?
Yes, per the 2026 listing; they run on different days.
Does winning get me an internship?
Strong performers are described as getting fast-tracked PPI opportunities. It is not an automatic offer.
Is it free?
Registration was free in the 2026 listing.
Final Thoughts
The Goldman Sachs India Hackathon rewards people who treat it as a long, serious assessment: strong fundamentals, stamina and clean code. The 2027 dates aren't out, so use the lead time to build both the algorithm toolkit and the endurance. When the page goes live, check eligibility the same day and register early.
Topics
Related on Thita
Your next step
Practise the rounds for the Goldman Sachs India Hackathon
Most selection rounds open with a timed coding test. Work through the DSA patterns they draw on, run your code in the browser, then rehearse the interview out loud with an AI interviewer.