Skip to content

Synopsys Interview Experience 2026

How Synopsys campus R&D/intern loops actually run: EDA-flavoured systems thinking with serious DSA and OS. Synthesized from recent candidate reports with rounds reorganized and prep notes added - treat this as a prep map, not a script.

Round-wise process at a glance

Round Typical format What clears you
OA ~60 MCQ: aptitude, C/C++, DSA, digital Accuracy across sections
Tech 1 DSA + OS / projects (~40+ min) Code + concurrency
Tech 2 Deeper DS (STL, LCA, sorts) Complexity literacy
Further / offer Projects, electronics, HR sometimes skipped Consistency

Technical interview experience 1 - 12-month Intern (selected)

Technical interview experience 1

Candidate profile: CSE/ECE; 70-75% criteria; Bangalore intern. Source: LeetCode Discuss Synopsys 12-month Intern On-Campus.

Round 1 - OA
  • Online assessment gating interviews
Round 2 - DSA + CP + OS
  • Coding profiles / CP ranks reviewed
  • Sheet of subcodes / debugging style prompts
  • DSA: Two Sum without using sort; reverse words in string; tree traversals (BFS/DFS functions)
  • OS (~20 min): deadlock why/conditions/prevention; semaphore vs mutex; reader-writer; multithreading code
Round 3 - Medium DSA + DS depth
  • STL set/map; hashing structure behind map (RBT/AVL) + insert/delete/find complexity
  • Inorder/preorder/postorder code; algorithm behind std::sort → write quicksort
  • BST LCA with code; Three Sum; heap/priority_queue ops; level-order traversal
  • Final result: Selected (4 interns; mail ~15 days later)

Takeaways

  • What decided it: Two Sum without a sort cheat, tree traversals, then STL map/set complexity plus deadlock/semaphore/reader-writer answers with code.
  • Common fail: Using sorting as a Two Sum shortcut; naming mutex vs semaphore without a reader-writer sketch.
  • How to practise: Write quicksort and BST LCA from scratch; implement a small reader-writer or semaphore example.

Technical interview experience 2 - R&D Engineer campus

Technical interview experience 2

Candidate profile: Composite of GFG Synopsys on-campus + Set 6 R&D Bangalore.

OA
  • 60 MCQs: quant, logical, C/C++, algorithms, DS, digital design
Technical rounds
  • Projects/thesis; shortest path + MST; BFS/DFS applications
  • Balanced tree check; rotations; ML clustering/SVM if listed; OS deadlock/scheduling; constructors/inheritance
  • Clustering points / bounding box style problem discussion
  • Macro disadvantages; BST apps; LL loop vs circular list
  • Set 6 OS-heavy: compilation stages; static vs shared libraries; processes/cores; PATH; gdb; linker/loader; palindrome code; stack push/pop; digital (DFF, NAND)
Outcome
  • Some drives shortlist to offer without separate HR
  • Final result: Offer on successful R&D accounts

Takeaways

  • What decided it: Holding projects plus graphs/MST, balanced-tree rotations, and OS/linker topics (compilation stages, static vs shared libs) in the same loop.
  • Common fail: Soft OS answers when Set-style drives probe gdb/linker/loader; ignoring digital MCQs on ECE-eligible OAs.
  • How to practise: One sheet covering deadlock, scheduling, and library linking; BFS/DFS applications with complexity aloud.

Technical interview experience 3 - R&D Engineer FTE, on-campus

Technical interview experience 3

Candidate profile: Campus R&D Engineer FTE drive (composite from GeeksforGeeks on-campus R&D report).

Round 1 - Online test (untimed sections)
  • Section A: CS MCQs (~20)
  • Section B: Aptitude (~15)
  • Section C: Electronics MCQs (~8)
  • No negative marking reported
Rounds 2–3 - Technical F2F
  • Reverse linked list; custom Vector class in C++
  • VTABLE/VPTR, polymorphism, name mangling
  • Graph bipartite check (LeetCode-style)
  • Pipelining, compilation stages, hard pointer MCQs
  • Puzzles: measure 45 minutes with two identical wires; mislabeled jars
Rounds 4–5 - HR/technical mix + design
  • Projects, cache coherence, pipelining recap
  • Validate BST; elevator design (full code discussion)
  • Scan-line / sweep algorithm discussion
  • Culture, team, location

Key takeaways: Five-round campus loops exist - prep OOP depth, medium graphs, and one OOP/design story, not only OA MCQs.

Technical interview experience 4 - R&D 2 Engineer, Noida (experienced)

Technical interview experience 4

Source: GeeksforGeeks R&D 2 Engineer experience - telephonic C++ screen then multi-round F2F.

Telephonic + early F2F themes
  • Virtual destructor; const tricks; call-by-reference vs value
  • Design an Array class; reverse linked list; balanced tree node counts
  • Non-copyable objects; deep vs shallow copy; BST validation; BFS/DFS
Later F2F (Bangalore lead)
  • Empty class size; copy constructors; 2D dynamic allocation
  • malloc vs new; constant member functions
  • Power-of-two check; Kth largest element

Key takeaways: Experienced loops are C++ language lawyer heavy - expect follow-ups on keyword placement in sample code.

Pre-interview checklist (Synopsys)

  • Confirm R&D vs Application Engineer track from req title
  • Timed OA: aptitude + C/C++ + digital section - do not skip electronics MCQs if eligible
  • C++: vtable, rule of three/five, malloc vs calloc, smart pointers basics
  • DSA: Two Sum variants, LCA, quicksort/std::sort, 0/1 knapsack, graph BFS/DFS
  • OS: deadlock, semaphore/mutex, reader-writer with code sketch
  • One ML/project narrative only if on resume - panels go deep
  • HR: Why Synopsys vs consumer Big Tech; Agility/Excellence STAR story
  • Managerial puzzle backup (jug/wire) - logic, not memorized answer

HR interview experience

HR interview experience

Candidate profile: When HR occurs

Themes
  • Why Synopsys / EDA interest
  • Location Bangalore; internship duration
  • Higher studies plans
  • Final result: Offer when cleared

Key takeaways: Genuine interest in chip/software tools beats generic “top product company.”

Sample answers for high-frequency questions

Technical

Q. What backs std::map? Complexities?
A. Typically red-black tree; insert/find/erase O(log n). Contrast unordered_map average O(1) with hash worst cases.

Q. Deadlock conditions?
A. Mutual exclusion, hold-and-wait, no preemption, circular wait. Prevention by breaking one; detection via wait-for graph.

Q. LCA in a BST?
A. Walk from root: if both keys < node go left; both > go right; else current is LCA. O(h).

HR

Q. Why Synopsys?
A. EDA software impact on chip design; map DSA/OS strength to tool reliability; Bangalore R&D pull if relevant.

Common questions checklist

OA

  • Aptitude; C/C++; DSA; digital MCQs

Technical

  • Two Sum / Three Sum; traversals; LCA; quicksort; STL maps; deadlock/semaphores; linker/libs

HR

  • Why EDA/Synopsys; Bangalore

Tips from successful candidates

Assessment tips

  • Do not skip digital design MCQs if ECE/eligible

Interview tips

  • Know STL complexities cold
  • Write reader-writer / deadlock answers structured

HR tips

  • Show tool-software curiosity

Practice with Synopsys placement papers

Sources

These links are research inputs we used to map R&D/intern loops and recurring STL/OS prompts - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Synopsys.

Confirm Bangalore centre and profile (R&D vs Integration) from the PPT. For the hub and HR prompts, see the Synopsys hub and Synopsys HR page.

HR interview

Synopsys may fold fit into technical panels. Prepare framed answers on the dedicated page.

Similar companies

Cadence · Intel · Texas Instruments · Qualcomm · NVIDIA

Ready to prepare? Lock C++ STL + OS concurrency + classic DSA codes before Synopsys day.