Societe Generale coding interview
questions, leaked.
2 problems reported across recent Societe Generale interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Societe Generale's technical assessment is lean. Two problems, one easy and one medium. You're looking at array and string work, with greedy and dynamic programming patterns buried underneath. The pool is small enough that you can own both problems cold before interview day. If you blank mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, so you don't crater on something you've seen before.
Top problems at Societe Generale
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Number of Swaps to Make the Binary String Alternating | MEDIUM | 100.0 | 43% | String · Greedy |
| 02 | Best Time to Buy and Sell Stock | EASY | 66.3 | 55% | Array · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Societe Generale OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array1 · 50%
- dynamic programming1 · 50%
- string1 · 50%
- greedy1 · 50%
The assessment splits neatly between a stock-trading DP problem on the easy side and a binary-string greedy problem at medium difficulty. Array and dynamic programming anchor the easier half. String and greedy anchor the harder half. Greedy patterns are the wildcard: the alternating-string problem requires you to think in terms of minimal swaps, not brute force. If you've drilled stock problems but haven't touched greedy string manipulation, that's your prep gap. On live assessment day, if the greedy logic gets tangled, StealthCoder is your hedge: it'll read the problem off your screen and hand you a working approach before the timer punishes you.
Companies with similar patterns
If you prepped for Societe Generale, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Societe Generale.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Societe Generale interview FAQ
Should I study dynamic programming or greedy first for Societe Generale?+
DP. One of the two problems is a classic stock buy-sell DP problem, which is foundational. After you own that pattern, pivot to greedy string problems. Both topics appear in the assessment, but DP is easier to drill correctly and builds confidence on the easier problem.
Is two problems enough to predict what they'll ask?+
No. Two problems is a small sample. Use them as signals, not a blueprint. You're seeing array, string, DP, and greedy. Brush up on all four. The assessment could pull another variant from any of those domains on your actual OA.
How much time should I spend on the binary-string alternating problem?+
It's medium, so expect 20 to 30 minutes under exam pressure if you're not fluent in greedy. That problem isn't about complex logic; it's about recognizing the greedy choice (swap from left vs. swap from right, pick the min). If greedy isn't your strength, drill similar problems until the pattern clicks.
Is the stock-buying problem a trap on easy difficulty?+
Not a trap, but don't underestimate it. The classic version is straightforward one-pass greedy. But variants add cooldown, transaction fees, or multiple buys. If Societe Generale's version has a twist, you could lose time. Know the base case cold and be ready to adapt.
What if I freeze on string manipulation during the live OA?+
String problems hinge on index-shift logic and loop discipline. If you blank, StealthCoder reads your problem and surfaces a working string solution invisibly while you collect yourself. That few minutes of breathing room often means the difference between a passing solution and a timeout.