As a Software Engineer at Neuberger Berman, you play a pivotal role in developing and maintaining software solutions that enhance the firm's investment strategies and operations. This position is essential for driving innovation within the financial technology space, enabling the firm to provide superior service to its clients. You will be part of a collaborative team that focuses on creating scalable, secure, and high-performance systems tailored to meet the dynamic needs of the financial industry. The impact of your work as a Software Engineer is profound. You will contribute to critical projects that involve data analysis, algorithmic trading, and client-facing applications. By leveraging cutting-edge technologies, you will help the firm navigate complex financial landscapes and deliver impactful results. This role not only demands technical prowess but also offers the chance to engage with strategic problem-solving that influences the firm’s broader objectives. Candidates can expect to work on a variety of projects, from enhancing existing applications to creating new tools that support investment decision-making. You will collaborate closely with cross-functional teams, including data scientists, product managers, and operations staff, to ensure that your contributions align with the firm’s goals. This environment fosters both personal and professional growth, making it an exciting opportunity for software engineers seeking to make a meaningful impact.
Initial Phone Interview
reportedDiscuss background and technical knowledge in a preliminary phone call.
What to demonstrate
- Discuss background and technical knowledge in a preliminary phone call
- Depth in Embedded C
How to prepare
- Answer aloud and timed: What is the difference between a stack and a queue?
- Answer aloud and timed: Explain how you would optimize a SQL query.
Technical Assessments
reportedComplete one or more technical assessments, including coding challenges or system design questions.
What to demonstrate
- Complete one or more technical assessments
- Including coding challenges or system design questions
How to prepare
- Answer aloud and timed: Describe the principles of object-oriented programming.
- Answer aloud and timed: How do you manage dependencies in a software project?
In-Person Interviews
reportedParticipate in in-person interviews with team members and managers, focusing on technical skills and behavioral assessments.
What to demonstrate
- Participate in in-person interviews with team members and managers
- Focusing on technical skills and behavioral assessments
How to prepare
- Answer aloud and timed: What are the key differences between synchronous and asynchronous programming?
- Answer aloud and timed: Write a function to reverse a linked list.
PracHub editorial advice for the preparation topics above.
Be Prepared to Showcase Your Work
Bring examples of your past projects or contributions. Demonstrating your experience through tangible results will resonate well with interviewers.
Practice Technical Questions
Use platforms like LeetCode or HackerRank to practice coding problems. Being comfortable with coding on a whiteboard or in a virtual environment is crucial.
Understand the Financial Domain
Familiarize yourself with the basics of investment management and financial technology. This knowledge will enhance your ability to discuss how your work contributes to the firm’s goals.
Ask Insightful Questions
Prepare thoughtful questions to ask your interviewers that demonstrate your interest in the role and the company. This also helps you assess if the company culture aligns with your values.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
What are the key differences between synchronous and asynchronous programming?
What are the key differences between synchronous and asynchronous programming?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Write a function to reverse a linked list.
Write a function to reverse a linked list.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
How would you implement a binary search algorithm?
How would you implement a binary search algorithm?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Given an array of integers, find two numbers that add up to a specific target.
Given an array of integers, find two numbers that add up to a specific target.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Describe a time complexity analysis for a sorting algorithm you know.
Describe a time complexity analysis for a sorting algorithm you know.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Can you explain recursion, and provide an example?
Can you explain recursion, and provide an example?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Explain how you would optimize a SQL query.
Explain how you would optimize a SQL query.
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- Handle the rows that do not match: that is usually the actual question.
Follow-up
- How does the query change if that join becomes one-to-many?
- What happens to this when the table is ten times larger?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
What is the difference between a stack and a queue?
What is the difference between a stack and a queue?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Describe the principles of object-oriented programming.
Describe the principles of object-oriented programming.
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How do you manage dependencies in a software project?
How do you manage dependencies in a software project?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How would you design a scalable web application?
How would you design a scalable web application?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
What considerations would you make for data storage in a large-scale application?
What considerations would you make for data storage in a large-scale application?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Describe how you would approach designing an API.
Describe how you would approach designing an API.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
What are the trade-offs between microservices and monolithic architectures?
What are the trade-offs between microservices and monolithic architectures?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you ensure security in software design?
How do you ensure security in software design?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Edge instances grow 400 MB per hour until the nightly restart
Edge API instances start at 700 MB resident and grow about 400 MB/hour; a nightly rolling restart has hidden it for weeks. Growth continues unchanged when request rate halves overnight, p99 degrades in the last hours before an instance is recycled, and heap used immediately after a forced full GC rises monotonically. The service holds no product state. Name the discriminating measurement that separates the plausible causes, give the most likely cause, and give the fix and how you would verify it.
Approach
- Separate resident memory from live heap first, because they fail differently. Resident size can grow from fragmentation, native buffers or thread stacks while the heap is flat; heap used after a full GC rising monotonically is the measurement that says objects are reachable and not being released. You already have it, so this is retention, not fragmentation, and that closes off half the candidate list.
- Use the rate's independence from traffic as the discriminator. Growth that continues at half the request rate rules out per-request objects that are merely slow to collect and points at a structure that grows with distinct values observed rather than with call volume. Write the candidates that have that property: a metrics registry keyed on a high-cardinality label, an unevicted cache, an interner, a per-key lock map.
- Take two heap snapshots an hour apart and diff by retained size, reading the dominator tree, not by allocation count or instance count. Expect one root holding a map with millions of entries, then follow the reference chain to the code that inserts and never removes. Allocation profilers point at churn, which is the wrong signal here.
- The candidate that fits this service is an observability label carrying an identifier, such as a request path recorded before templating so that /v1/resources/48213 becomes its own metric series. That grows with distinct ids seen, is independent of rate, and explains the late p99 degradation, since GC cost rises with the size of the live set.
Follow-up
- Post-GC heap is now flat but resident size still creeps. What are you looking at, and does it matter?
- How would you have detected this before an OOM, given the nightly restart masked the trend?
Built from the rounds and topics Neuberger Berman candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Neuberger Berman loop
- Write out the reported sequence: Initial Phone Interview, Technical Assessments, In-Person Interviews.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.
02Work Embedded C
- Spend the session on Embedded C, which Neuberger Berman candidates report being tested on.
- Write one worked example in Embedded C and time yourself on it.
Deliverable: One timed worked example in Embedded C.
03Work Data structures
- Spend the session on Data structures, which Neuberger Berman candidates report being tested on.
- Write one worked example in Data structures and time yourself on it.
Deliverable: One timed worked example in Data structures.
04Work Algorithms
- Spend the session on Algorithms, which Neuberger Berman candidates report being tested on.
- Write one worked example in Algorithms and time yourself on it.
Deliverable: One timed worked example in Algorithms.
05Answer out loud: Technical / Domain Questions
- Answer aloud, timed: What is the difference between a stack and a queue?
- Answer aloud, timed: Explain how you would optimize a SQL query.
Deliverable: Spoken answers to 2 reported Technical / Domain Questions question(s), under time.
06Answer out loud: Coding / Algorithms
- Answer aloud, timed: Write a function to reverse a linked list.
- Answer aloud, timed: How would you implement a binary search algorithm?
Deliverable: Spoken answers to 2 reported Coding / Algorithms question(s), under time.
07Answer out loud: Behavioral / Leadership
- Answer aloud, timed: Describe a challenging project you worked on. How did you handle it?
- Answer aloud, timed: How do you prioritize tasks when faced with multiple deadlines?
Deliverable: Spoken answers to 2 reported Behavioral / Leadership question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe a challenging project you worked on. How did you handle it?
Describe a challenging project you worked on. How did you handle it?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you prioritize tasks when faced with multiple deadlines?
How do you prioritize tasks when faced with multiple deadlines?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Can you provide an example of a time you led a team or project?
Can you provide an example of a time you led a team or project?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you handle conflicts within a team?
How do you handle conflicts within a team?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
What motivates you to perform at your best?
What motivates you to perform at your best?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
- 01
Describe a challenging project you worked on. How did you handle it?
- 02
How do you prioritize tasks when faced with multiple deadlines?
- 03
Can you provide an example of a time you led a team or project?
- 04
How do you handle conflicts within a team?
How difficult is the interview process?
The interview process at Neuberger Berman is generally considered rigorous, with candidates often facing both technical and behavioral questions. Expect to dedicate time to preparation, especially for coding assessments and system design questions.
Neuberger Berman Software Engineer candidate reports ↗What differentiates successful candidates?
Successful candidates typically demonstrate a strong technical foundation, effective problem-solving abilities, and alignment with the firm’s culture and values. Clear communication and collaboration skills are also highly valued.
Neuberger Berman Software Engineer candidate reports ↗What is the culture like at Neuberger Berman?
Neuberger Berman fosters a collaborative and inclusive culture that values diversity and innovation. Employees are encouraged to share ideas and contribute to the firm’s mission of delivering exceptional investment solutions.
Neuberger Berman Software Engineer candidate reports ↗How long does the interview process usually take?
The timeline can vary, but candidates can expect the entire process to take anywhere from a few weeks to over a month, depending on scheduling and the number of interview rounds.
Neuberger Berman Software Engineer candidate reports ↗Are there remote work options available?
Neuberger Berman offers flexible work arrangements, including hybrid and remote work options, depending on the role and team requirements.
Neuberger Berman Software Engineer candidate reports ↗What topics does Neuberger Berman test in interviews?
Neuberger Berman interviews most often cover Python, Behavioral Interviewing, SQL, Problem Solving, and Program Management. The exact emphasis depends on the specific role you apply for.
Neuberger Berman Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Neuberger Berman Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
CoreWeave Software Engineer Interview Guide
Failure-handling practice for CoreWeave software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Aerospike Software Engineer Interview Questions & Guide 2026
Aerospike database-engine preparation through an original single-owner Python key-value store with bounded logical index accounting, disk-offset reads, conditional writes, tombstones, process-restart recovery and 3,240 checks. Existing 14 p
Slack Software Engineer Interview Guide
What Slack asks Software Engineer candidates, from reported rounds and questions.
Securitas Software Engineer Interview Guide
What Securitas asks Software Engineer candidates, from reported rounds and questions.