Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

How to Crack AMD: The Software Engineer Interview, From Real Experiences

20 min read

AMD software engineer interview guide from nine real accounts: DSA rounds, full-stack and DevOps scenarios, verification, PCIe, GPU systems, HR questions and verified practice links.

In this article
On this page

Last reviewed November 20, 2026 · 29 min read · For candidates targeting Software Engineer, SDE and SDE 2 roles in India, the US and Canada

Researched and written by the Codinzhub Editorial Team from nine independent sources: four internal candidate records, four public first-hand accounts and one dated assessment catalogue. AMD intern, hardware-profile, senior AI and project-manager accounts were reviewed but excluded from the question counts. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round.

The 30-second version: AMD software loops vary by team. An Indian campus SWE process used a GeekAssess OA with MCQs and two coding questions, a whiteboard full-stack scenario, React and Docker rounds, then HR. An SDE 2 loop had four technical rounds, the last two hours long, dominated by trees, matrices and linked lists. GPU and NPU roles in Canada and the US added inference systems, profiling and hardware-accelerator discussions, while a verification role went deep on SystemVerilog, UVM and PCIe. Across all of them, C++, DSA depth and the ability to defend resume projects were constant.

Important things to know before you start

There is no single AMD loop. One account was rejected after a single technical round, another had four rounds including a two-hour challenge, and a GPU systems candidate had four onsite sessions over two weeks. Match your preparation to the team's domain rather than memorising one sequence.

DSA is deep, not just medium LeetCode. The SDE 2 account reports Trapping Rain Water, first duplicate in O(1) space, matrix search, matrix multiplication, linked-list intersection and a tree-sum construction problem. The earlier rounds on trees and stacks were routine by comparison.

C++ and low-level fundamentals recur. const versus static, virtual destructors, stack versus heap, polymorphism and output prediction appeared alongside pointers, inheritance and memory management in other accounts.

Your resume sets the agenda. A verification candidate was told that if your resume says PCIe or UVM, expect deep probing. A full-stack candidate was asked to defend four diverse projects and then design a student grade management system on a whiteboard.

AI-tool usage is now a question. One 2026 account was asked when and how heavily they would use AI tools at work. Treat this as a real interview topic rather than a side remark.

What this guide covers

This guide covers AMD Software Engineer hiring across SDE, SWE, SDE 2 and C++ Developer titles in India, the US and Canada. It does not cover AMD internships, hardware-profile roles, senior AI engineering or project management; those accounts are described only in the level table. AMD Construction Group is a different company and was excluded entirely.

Scope: Software Engineer role family, 2021–2026 evidence, with most accounts from 2024–2026. One older 2022 Canadian verification account is marked stale but retained because it is the only detailed verification source.

Selected vs. rejected: do this, not that

These habits come from offers and rejections in the dataset. With nine accounts, they are observations, not a proven formula.

Do thisNot thatWhy it matters
Optimise OA solutions.Accept brute force when test cases are partial.One candidate passed only half the weighted-range-query tests with a brute-force approach.
Know tree, matrix and linked-list patterns cold.Revise only easy array problems.The SDE 2 loop escalated to seven coding tasks in a two-hour round.
Defend every resume line.List PCIe, UVM or BERT without depth.Verification and full-stack accounts were probed deeply on exactly their listed technologies.
Reason through trade-offs out loud.Give a single answer to a debate prompt.SQL versus NoSQL was treated as a discussion, not a factual question.
Connect your background to the team's domain.Give the same story to every team.The NPU candidate had to link their work to AI and hardware accelerators.

Round-by-round breakdown

Stage 1: Application

The routes are recruiter outreach, LinkedIn job posts and campus drives. A 2024 SDE 2 candidate was contacted after a recruiter posted openings on LinkedIn; a GPU systems candidate began with recruiter outreach and an initial screen; a 2026 NPU candidate had a recruiter call about location and sponsorship. One Indian campus drive shortlisted four candidates for two different teams.

Stage 2: Shortlisting

Resume screening decides who reaches the assessment or first technical call. A GPU systems candidate had an extended hiring-manager conversation before an onsite. A full-stack candidate discovered only later that the broad job description concealed team-specific requirements, so ask early which team you are interviewing for and what that team actually does.

Stage 3: Online assessment

How it works. Only one account describes the assessment in detail: GeekAssess, with MCQs on operating systems, basic computer networks and C program output, plus Maximum Falling Path Sum and a Weighted Range Sum Queries problem. Two dated catalogue titles from September 2026 are included as additional assessment examples, clearly labelled.

At a glance: MCQs plus two coding questions in one account; duration and platform otherwise not reported. Topics: OS, networks, C output, matrix DP, prefix sums, strings and counting.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Maximum falling path sum in a matrix, similar to LeetCode Minimum Falling Path Sum.Matrix DPNot reportedSWE, IndiaMinimum Falling Path Sum
Weighted range sum queries: for each (l,r), multiply each element by its position in the subarray. Example nums=[5,2,7,6,3], queries [[1,3],[2,5],[4,5]] -> [30,46,12].Prefix sumsNot reportedSWE, IndiaNo verified practice match
MCQs on OS, basic computer networks and C program output.CS fundamentalsNot reportedSWE, IndiaNo verified practice match
Final string after sequential character replacement queries.Strings and simulationNot reported2026 assessment catalogueNo verified practice match
Counting triplets with all pair sums divisible by K.Counting and modular arithmeticNot reported2026 assessment catalogueNo verified practice match

Reading the last two rows: they come from a dated public catalogue with no candidate narrative. They are included as recent assessment examples, not as questions from a named interview.

AMD OA questions on Codinzhub: Browse AMD questions.

Full AMD interview experiences on Codinzhub: Co-op intern, DTU.

Stage 4: Technical rounds

Round 1: DSA and coding

How it works. DSA rounds range from 45 minutes to two hours. The SDE 2 account describes four rounds, with a two-hour final round covering seven tasks. A 2026 SDE account stayed conceptual: arrays, linked lists, trees and graphs with complexity, C++/OOP pointers and inheritance, OS and computer architecture. A verification role was almost entirely SystemVerilog, UVM and PCIe; a GPU role focused on top-k coding, profiling and inference systems.

At a glance: 45 to 120 minutes; 2 to 7 coding questions; surfaces include shared editor, whiteboard, blank paper, video and in-person. Topics: trees, arrays, DP, matrices, linked lists, LRU cache, GPU systems, verification and C++ internals.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Implement a queue using a stack.Stack compositionNot reportedSDE 2Implement Queue using Stacks
Explain AVL trees and their applications.Self-balancing treesNot reportedSDE 2No verified practice match
A custom BST becomes slow after a large data stream; diagnose and fix it.Unbalanced tree analysisSuggest AVL or Red-Black treeSDE 2No verified practice match
Trapping Rain Water.Two pointers / monotonic stackNot reportedSDE 2Trapping Rain Water
Verify the height balance of a binary tree.Tree recursionNot reportedSDE 2Balanced Binary Tree
First duplicate in O(n) time and O(1) space.In-place markingNot reportedSDE 2Contains Duplicate
Write inorder, preorder and postorder traversals.Tree traversalNot reportedSDE 2Binary Tree Inorder Traversal
Count ways to climb n stairs with 1 or 2 steps.Fibonacci DPNot reportedSDE 2Climbing Stairs
Search a number in a sorted n*n matrix.Matrix binary searchNot reportedSDE 2Search a 2D Matrix
Check whether all tree nodes are at the same level.Tree BFSNot reportedSDE 2Binary Tree Level Order Traversal
Compare strings for rotations.String rotationNot reportedSDE 2Rotate String
Find the intersection node of two linked lists.Two pointersNot reportedSDE 2Intersection of Two Linked Lists
Allocate and free a dynamically sized matrix.C/C++ memory managementNot reportedSDE 2No verified practice match
Multiply two matrices.Nested loopsNot reportedSDE 2No verified practice match
Build a binary tree from the sum of two trees.Tree recursionNot reportedSDE 2No verified practice match
Design and implement an LRU cache.Hash map + linked listFollow-ups while coding2026 accountLRU Cache
Coin Change.DPNot reportedC++ DeveloperCoin Change
Top-k task: heap versus partition-based selection.Selection algorithmsInterviewer discussed partition approachGPU systems, CanadaTop K Frequent Elements
Find the bug in singly linked list insertAfter code and predict output.Code debuggingNot reported2026 accountNo verified practice match
Predict the output of C++ polymorphism and overriding code.Virtual dispatchRelated follow-ups2026 accountNo verified practice match

Round 2: Systems and domain rounds

How it works. This is where roles diverge. Full-stack candidates designed APIs and databases on a whiteboard and debated SQL versus NoSQL. C++ candidates faced virtual destructors, red-black trees, tries and sharding. Verification candidates discussed SystemVerilog, UVM, scoreboards, coverage and PCIe protocols. GPU candidates discussed attention caching, batching, register spilling and matrix-transpose performance.

At a glance: 30 to 120 minutes; 4 to 9 named prompts per account; whiteboard, video and in-person. Topics: full-stack design, DBMS, DevOps, C++ internals, verification, PCIe, GPU performance, OS and networks.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Design an API and frontend for student grade management, including layout, JavaScript POST, backend route, schema and database choice.Full-stack designPagination, indexing, >100k rowsSWE, IndiaNo verified practice match
Write a basic HTML template with input and submit button.Front-end basicsNot reportedSWE, IndiaNo verified practice match
Write React functional and class components with state; Angular versus React.React fundamentalsFollow-up comparisonSWE, IndiaNo verified practice match
What is Docker and why use it? Do you know Nomad?DevOpsKubernetes explained in detailSWE, IndiaNo verified practice match
SQL or NoSQL? Defend your choice in a debate.Database trade-offsInterviewer argued for NoSQLSWE, IndiaNo verified practice match
What is BERT and how does it work?NLP fundamentalsNot reportedSWE, IndiaNo verified practice match
Explain a C project using multithreading, file locking and two-phase locking.Concurrency and DBMSNot reportedSWE, IndiaNo verified practice match
Const versus static in C++; deleting a base pointer without a virtual destructor; stack versus heap.C++ object modelStack vs heap2026 accountNo verified practice match
Explain red-black trees and tries.Advanced data structuresNot reported2026 accountNo verified practice match
Sharding versus indexing; how to fetch a huge log file; Jenkins plugins.Databases and toolingNot reported2026 accountNo verified practice match
SystemVerilog/UVM basics, testbench setup, scoreboard, monitor, coverage and RTL basics.Verification fundamentalsResume projects in depthVerification, CanadaNo verified practice match
PCIe TS1/TS2, LTSSM, link training, ordering, posted/non-posted/completion and TLP.PCIe protocolWhen transactions may reorderVerification, CanadaNo verified practice match
GPU profiling: memory-versus-compute limits, register spilling, matrix-transpose performance.Performance diagnosisNot reportedGPU systems, CanadaNo verified practice match
Inference systems and agent architectures: attention caching and batching.ML systemsNot reportedGPU systems, CanadaNo verified practice match
Arrays, linked lists, trees/graphs with complexity; C++/OOP; OS and architecture.CS fundamentalsNot reportedSDE, India 2026No verified practice match
SQL queries with loops, conditionals, subqueries and functions; stock price variation reverse logic.SQL and logicNot reportedC++ DeveloperNo verified practice match

Round 3: HR and managerial

How it works. HR rounds are short in the Indian campus account, more conversational in the Canadian and US accounts. A hiring manager asked a GPU candidate about learning habits, teamwork and emerging inference directions. An NPU candidate's manager followed up on almost everything they said.

At a glance: 15 minutes in one account, otherwise not reported; 5 to 10 prompts; no coding reported here.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Why do you want to join AMD?MotivationNot reportedIndia campus, C++ DeveloperNo verified practice match
Are you open to relocation?LogisticsNot reportedIndia campusNo verified practice match
Family, native place and interests.ConversationNot reportedIndia campusNo verified practice match
Do you have any questions for us?EngagementTeam and role askedIndia campusNo verified practice match
Are you okay with this team's work? What are your interest areas?Role fitTeam need clarifiedIndia campusNo verified practice match
When and how heavily would you use AI tools at work?Tooling judgementNot reported2026 accountNo verified practice match
Learning habits, teamwork and emerging inference directions.Learning and collaborationNot reportedGPU systems, CanadaNo verified practice match
Behavioral follow-ups on almost everything you say.ConsistencyNot reportedNPU, USNo verified practice match
Connect your background to AI and hardware accelerators.Role narrativeNot reportedNPU, USNo verified practice match
Experience with DevOps teams.BackgroundNot reported2026 accountNo verified practice match

Stage 5: Decision

An SDE 2 candidate received an offer letter. A GPU systems candidate received an offer about three weeks after an onsite that followed two weeks after availability was requested. An SDE candidate was rejected after a fundamentals-focused interview, and a C++ Developer was not selected after the final round. No account describes a formal hiring committee or team-match stage.

Candidate experiences reviewed

BackgroundRole and reported outcomeWhat was asked
NIT Warangal - 2026SDE - rejectedArrays, linked lists, trees, C++/OOP, OS, architecture, projects
India campusSWE, full-stack and DevOps - selectedGeekAssess OA; grade-management API design; React, Docker, SQL vs NoSQL; HR
Hyderabad, 2.6 years - 2024SDE 2 - offerFour DSA rounds; queue/stack, AVL, trapping rain water, matrices, linked lists
Not statedC++ Developer - not selectedDSA with Coin Change; OOP, SQL, multithreading; OS, networks, design
Toronto/Markham - 2026GPU Software Engineer - offerInference systems, GPU profiling, top-k coding, compiler concepts, manager round
Vancouver - 2022Verification Software EngineerSystemVerilog/UVM, testbench, PCIe protocol deep dive
San Jose - 2026NPU Software Engineer - offerBehavioral, role narrative, coding and team interviews

The Codinzhub Next-Round Playbook

To get past the assessment

  1. Practise matrix DP and prefix sums. Maximum Falling Path Sum and Weighted Range Sum Queries are the only fully specified OA tasks.
  2. Revise OS, networks and C output for MCQs rather than assuming a pure coding screen.
  3. Optimise brute-force solutions. One candidate lost test cases by stopping at brute force.

To get past DSA rounds

  1. Drill trees, matrices and linked lists. These supply most of the SDE 2 questions.
  2. Prepare the O(1)-space variants of duplicate detection and in-place algorithms.
  3. Practise code prediction and bug finding in C++ and linked lists, not just fresh implementations.
  4. For GPU roles, add top-k selection, heap versus partition trade-offs, and an understanding of register spilling and memory-bound kernels.

To get past systems and domain rounds

  1. Prepare one full-stack design end to end: frontend, API, schema, indexing and pagination. Expect to write snippets on a whiteboard.
  2. Revise C++ internals: const versus static, virtual destructors, polymorphism, stack versus heap.
  3. For verification roles, know your UVM testbench and be able to explain scoreboard, monitor and coverage from your own projects. If PCIe is on your resume, revise TS1/TS2, LTSSM, ordering and TLP.
  4. For GPU and inference roles, connect ML concepts to systems and rehearsal of performance diagnosis.

To get past HR

Prepare a clear "why AMD", a relocation answer, two questions about the team, and a domain narrative linking your background to the group. Expect a hiring manager to probe every claim.

How the loop differs by level and role

Level / trackTypical experienceWhat the accounts emphasiseDepth
SWE, new gradOA, full-stack/DevOps scenario, React, Docker, HRPractical full-stack knowledge, DBMS and reasoningMedium
SDE 2 / C++ Developer3 to 4 technical rounds, one up to 2 hoursDeep DSA, C++ internals, OS and networksHigh
GPU / NPU Software EngineerRecruiter, hiring manager, coding, onsite or Zoom sequenceInference systems, profiling, hardware accelerators, role fitHigh and domain-specific
Verification EngineerThree video rounds, two technicalSystemVerilog, UVM, PCIe, resume projectsHigh and protocol-specific
Intern (out of scope)Two 2-hour rounds after shortlistProjects, Linux commands, C programsSeparate guide needed
Senior SWE AI (out of scope)Five technical rounds including ML roundsTransformers, attention, object detection, smart pointersDifferent role family

Most-asked topics

TopicWhat it meansEvidence-backed priorityReported examples
Trees and BSTsTraversals, balance checks, AVL and Red-Black reasoning.High - 3 of 8 technical accountsBST diagnosis, balance, traversals, tree sum
Arrays, strings and matricesScanning, DP and matrix algorithms.Very high - 5 of 8 technical accountsFalling path, weighted queries, trapping rain water, matrix search
Dynamic programmingState design and optimisation.Medium - 3 of 8 technical accountsCoin Change, N stairs, falling path
C++ and OOPObject model, virtual dispatch, memory.Very high - 4 of 8 technical accountsVirtual destructor, polymorphism output, const/static
DBMS and DevOpsSchema design, indexing, sharding, containers.Medium - 2 of 8 technical accountsGrade-management schema, SQL vs NoSQL, Docker, Jenkins
Verification and PCIeUVM methodology and protocol details.Medium - 1 of 8 technical accountsTestbench, scoreboard, TS1/TS2, LTSSM, TLP
GPU and inference systemsProfiling, kernels and inference architecture.Medium - 1 of 8 technical accountsRegister spilling, attention caching, batching, top-k
CS fundamentalsOS, networks and complexity.High - 4 of 8 technical accountsProcess vs thread, memory, protocols, complexity

The question patterns that keep coming back

1. Tree recursion with a precise contract

  • Recognise it: balance checks, same-level nodes, tree sums, traversal lists.
  • Invariant: state what the recursive function returns before coding, and test one node and a two-level tree.
  • Action: write all three DFS traversals and a height-balance function from memory.

2. Matrix and array DP

  • Recognise it: falling path, trapping rain water, weighted range queries.
  • Invariant: define the state and the recurrence in words, then derive the prefix or running structure.
  • Action: trace each problem on a 3x3 example before writing code.

3. Constant-space and in-place tricks

  • Recognise it: first duplicate in O(1) space, dynamic matrix memory.
  • Invariant: use the input array itself as a visited marker when allowed, and state the destructive side effect.
  • Action: write the in-place version and explain the trade-off.

4. C++ object model

  • Recognise it: virtual destructor, polymorphism output prediction, const versus static.
  • Invariant: connect the answer to vtables, dispatch time and object lifetime.
  • Action: predict outputs of three short snippets and explain each.

5. Domain-specific depth

  • Recognise it: resume says PCIe, UVM or BERT.
  • Invariant: prepare a five-minute explanation and one worked example for each listed technology.
  • Action: rehearse a PCIe link-training walkthrough and a UVM testbench diagram.

Preparing for the HR and managerial round

The strongest pattern is direct follow-up on your statements. Prepare a truthful, specific account of your work and be ready to explain every claim. Six STAR stories cover the usual prompts: challenge, collaboration, failure, adaptability, achievement and self-awareness. Treat this as editorial advice rather than a reported question list.

Practice problems that match these experiences

Note on practice analogues: These pages cover the named technique. Unless marked "Exact reported problem", they are analogues, not leaked questions.

#Practice problemPatternSeen in these experiences asLink
1Minimum Falling Path SumMatrix DPOA maximum falling path sumLeetCode #931
2Trapping Rain WaterTwo pointersSDE 2 technical roundLeetCode #42
3LRU CacheHash map + linked listThree-round C++/DevOps loopLeetCode #146
4Intersection of Two Linked ListsTwo pointersTwo-hour SDE 2 roundLeetCode #160
5Balanced Binary TreeTree recursionTree height-balance questionLeetCode #110
6Coin ChangeDPC++ Developer DSA roundLeetCode #322

How to handle a question you have never seen

  1. Restate the problem and ask about constraints before writing anything.
  2. Give a brute-force baseline and its complexity, then state what you would optimise.
  3. Name the structural cue: matrix means DP or binary search, linked list means two pointers, virtual destructor means object lifetime.
  4. Write clean code with edge-case guards, then dry-run on a small example.
  5. Explain a second approach when asked, and compare time and space costs.
  6. For domain questions, admit the boundary of your knowledge and say how you would find out. Verification and GPU accounts reward depth, not guessing.

Why candidates were rejected

No recruiter feedback is reported. Two self-reflections are relevant: an SDE candidate was rejected after a fundamentals-focused interview, and a C++ Developer was not selected after the final round. A third candidate passed only half the OA test cases with brute force. Treat these as observations, not proven causes.

If you remember only five things

  1. Expect deep DSA, especially trees, matrices and linked lists, across several rounds.
  2. Revise C++ internals and output prediction, not just syntax.
  3. Be ready for a domain deep dive in full-stack, verification, PCIe or GPU systems.
  4. Master one full-stack design end to end with schema, indexing and pagination.
  5. Prepare a role-specific narrative and a clear answer on AI-tool usage.

Frequently asked questions (FAQ)

Is this an AMD hardware interview guide?

No. Hardware Profile is a separate role family and is excluded from the question counts. Verification and PCIe questions appear here only because those came from Software Engineer titles.

Is there an online assessment for every AMD software role?

Only one account describes one. Do not assume a universal OA.

How long are the technical rounds?

The reported lengths range from 30 minutes to two hours. The longest was a single SDE 2 round with seven coding tasks.

Several are exact reported problems, including Trapping Rain Water, LRU Cache, Coin Change and queue using stacks. Others are analogues for the named technique.

Does AMD ask system design for new grads?

There is no standalone architecture round in the Indian new-grad account, but a full-stack whiteboard design with API, schema and database choices was asked. Treat it as practical design, not distributed-systems architecture.

Why are two catalogue items included?

They are dated AMD assessment titles from 2026. They have no candidate narrative and are labelled as catalogue items, used only to show recent assessment topics.


About this guide and methodology

This guide was compiled by the Codinzhub Editorial Team from nine independent sources: four internal candidate records, four public first-hand accounts and one dated assessment catalogue. Intern, hardware-profile, senior AI, project-manager and AMD Construction Group records were excluded. No external research URLs, internal record identifiers or private ledgers appear here. Practice links are verified analogue or exact-problem pages.

Disclaimer: Hiring processes vary by team, region and year. This guide reflects reported historical experiences and is not an official statement from AMD. Confirm the current format with your recruiter.


Other company and role guides


Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 110 questions

  • Maximum falling path sum in a matrix, similar to LeetCode Minimum Falling Path Sum.

    Level: Not reported.

    Matrix DPCodingOnline assessment
  • Weighted range sum queries: for each (l,r), multiply each element by its position in the subarray. Example nums=[5,2,7,6,3], queries [[1,3],[2,5],[4,5]] -> [30,46,12].

    Level: Not reported.

    Prefix sumsCodingOnline assessment
  • MCQs on OS, basic computer networks and C program output.

    Level: Not reported.

    CS fundamentalsCodingOnline assessment
  • Final string after sequential character replacement queries.

    Level: Not reported.

    Strings and simulationCodingOnline assessment
  • Counting triplets with all pair sums divisible by K.

    Level: Not reported.

    Counting and modular arithmeticCodingOnline assessment
  • Implement a queue using a stack.

    Level: Not reported.

    Stack compositionCodingRound 1
  • Explain AVL trees and their applications.

    Level: Not reported.

    Self-balancing treesCodingRound 1
  • A custom BST becomes slow after a large data stream; diagnose and fix it.

    Level: Suggest AVL or Red-Black tree.

    Unbalanced tree analysisCodingRound 1
  • Trapping Rain Water.

    Level: Not reported.

    Two pointers / monotonic stackCodingRound 1
  • Verify the height balance of a binary tree.

    Level: Not reported.

    Tree recursionCodingRound 1
  • First duplicate in O(n) time and O(1) space.

    Level: Not reported.

    In-place markingCodingRound 1
  • Write inorder, preorder and postorder traversals.

    Level: Not reported.

    Tree traversalCodingRound 1
  • Count ways to climb n stairs with 1 or 2 steps.

    Level: Not reported.

    Fibonacci DPCodingRound 1
  • Search a number in a sorted n*n matrix.

    Level: Not reported.

    Matrix binary searchCodingRound 1
  • Check whether all tree nodes are at the same level.

    Level: Not reported.

    Tree BFSCodingRound 1
  • Compare strings for rotations.

    Level: Not reported.

    String rotationCodingRound 1
  • Find the intersection node of two linked lists.

    Level: Not reported.

    Two pointersCodingRound 1
  • Allocate and free a dynamically sized matrix.

    Level: Not reported.

    C/C++ memory managementCodingRound 1
  • Multiply two matrices.

    Level: Not reported.

    Nested loopsCodingRound 1
  • Build a binary tree from the sum of two trees.

    Level: Not reported.

    Tree recursionCodingRound 1
Page 1 of 6

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.