Interview Q&A

Master technical and career interviews with structured answers—short definition, real examples, pitfalls, and how to answer in 60–90 seconds.

4608 total questions 4508 technical 100 career & HR 4272 from PDF library
Timed practice exams Career & HR Resume builder LinkedIn optimizer
All Career & HR Junior Mid Senior

Showing 26–27 of 27

Career & HR topics

All career 100 AI Career (2026) 10 Career Growth 10 Freelancing 10 Interview Preparation 10 Job Change 10 LinkedIn & Personal Brand 10 Notice Period 10 Resume & ATS 10 Salary Negotiation 10 Work & Office 10

By tech stack

ADO.NET 105 AI Career (2026) 10 ASP.NET Core 261 ASP.NET Core MVC 56 ASP.NET Web API 106 Agile & Scrum 75 Angular 114 Azure DevOps 47 C# Coding Interview 142 C# Collections 108 C# MNC Coding Interview 9 C# OOP 157 Career Growth 10 DSA & Coding Interviews 44 Design Patterns & SOLID 104 Entity Framework Core 154 Freelancing 10 Gang of Four Patterns 372 Git & GitHub 193 High-Impact Interview Questions 16 Interview Preparation 10 JavaScript 286 Job Change 10 LINQ 221 LinkedIn & Personal Brand 10 Managerial Interview 63 Microservices 697 Microsoft Azure 297 Node.js 165 Notice Period 10 React.js 160 Resume & ATS 10 SQL & Databases 310 Salary Negotiation 10 Unit Testing 103 Work & Office 10

Popular tracks

Microservices with .NET 697 C# Programming Tutorial 519 Design Patterns in C# 476 Developer Essentials 347 Microsoft Azure Tutorial 344 SQL Server Tutorial 310 JavaScript Tutorial 286 ASP.NET Core Tutorial 261 LINQ Tutorial 221 Node.js Tutorial 165 React.js Tutorial 160 Entity Framework Core Tutorial 154
Mid
How do you solve Subsets / Permutations with backtracking?

Short answer: Subsets: at each index choose include/exclude (or loop-based cascading). Permutations: swap/choose unused elements recursively. Always discuss time complexity exponential in n and when to prune. Complexity…

Backtracking Read answer
Mid
How do you detect a cycle in an undirected graph?

Short answer: DFS while tracking parent: visiting an already-visited neighbor that is not the parent means a cycle. Union-Find (Disjoint Set) also works for edge lists: union fails if both ends share a parent. Complexity…

Graphs Read answer

DSA & Coding Interviews Coding Interview FAQ · Backtracking

Short answer: Subsets: at each index choose include/exclude (or loop-based cascading). Permutations: swap/choose unused elements recursively. Always discuss time complexity exponential in n and when to prune.

Complexity

Subsets O(n * 2^n); Permutations O(n * n!).

Draw the decision tree for n=3 — it proves you understand recursion depth.
Permalink & share

DSA & Coding Interviews Coding Interview FAQ · Graphs

Short answer: DFS while tracking parent: visiting an already-visited neighbor that is not the parent means a cycle. Union-Find (Disjoint Set) also works for edge lists: union fails if both ends share a parent.

Complexity

Time O(V + E).

Do not reuse the directed-graph “gray node” story without adjusting for parent.
Permalink & share
Toolliyo Assistant
Ask about tutorials, ebooks, training, pricing, mentor services, and support. I use public site content only—not admin or internal tools.

care@toolliyo.com

Need callback? Share your details