Explain why Stack is a recursive data structure

Get lifetime access

Track progress

Save time

for a tech interview

Web & Mobile dev Web & Mobile dev

Data structures & Algorithms Data structures

Software Architecture Design patterns

Only challenges

- 1.
Explain why Stack is a recursive data structure

# Answer:

- 2.
Define Stack

# Answer:

- 3.
What is Queue?

# Answer:

- 4.
Name some characteristics of Array Data Structure

# Answer:

- 5.
Define Linked List

# Answer:

- 6.
Define Tree Data Structure

# Answer:

- 7.
What is Priority Queue?

# Answer:

- 8.
What is Heap?

# Answer:

- 9.
What is Hash Table?

# Answer:

- 10.
What is String in Data Structures?

# Answer:

- 11.
Define Binary Tree

# Answer:

- 12.
What is a Graph?

# Answer:

- 13.
What is Trie?

# Answer:

- 14.
What is Complexity Analysis of Queue operations?

# Answer:

- 15.
Name some disadvantages of Linked Lists?

# Answer:

- 16.
What are some types of Queue?

# Answer:

- 17.
Why and when should I use Stack or Queue data structures instead of Arrays/Lists?

# Answer:

- 18.
What are Dynamic Arrays?

# Answer:

- 19.
What are some types of Linked List?

# Answer:

- 20.
What is the space complexity of a Hash Table?

# Answer:

- 21.
What is Binary Heap?

# Answer:

- 22.
What's the difference between the data structure Tree and Graph?

# Answer:

- 23.
What is Binary Search Tree?

# Answer:

- 24.
Under what circumstances are Linked Lists useful?

# Answer:

- 25.
What is the difference between Strings vs. Char arrays?

# Answer:

- 26.
Return the N-th value of the Fibonacci sequence Recursively

# Answer:

- 27.
Return the N-th value of the Fibonacci sequence. Solve in

*O(n)*time# Answer:

- 28.
How to implement a

*Tree*data-structure? Provide some code.# Answer:

- 29.
Convert a

*Singly Linked List*to*Circular Linked List*# Answer:

- 30.
Implement

*Pre-order Traversal*of*Binary Tree*using*Recursion*# Answer:

- 31.
What does Sparse Array mean?

# Answer:

- 32.
What is an Associative Array?

# Answer:

- 33.
Compare Heaps vs Arrays to implement Priority Queue

# Answer:

- 34.
What is complexity of Hash Table?

# Answer:

- 35.
Name some common types and categories of Graphs

# Answer:

- 36.
Name some application of Trie data structure

# Answer:

- 37.
What is Balanced Tree and why is that important?

# Answer:

- 38.
What is AVL Tree?

# Answer:

- 39.
Explain how

*Heap Sort*works# Answer:

- 40.
LIS: Find length of the

*longest increasing subsequence (LIS)*in the array. Solve using DP.# Answer:

- 41.
How to merge two sorted

*Arrays*into a*Sorted Array*?# Answer:

- 42.
How to check if two Strings (words) are

*Anagrams*?# Answer:

- 43.
Convert a Binary Tree to a Doubly Linked List

# Answer:

- 44.
Find all the

*Permutations*of a String# Answer:

- 45.
Can you do

*Iterative Pre-order Traversal*of a*Binary Tree*without*Recursion*?# Answer:

- 46.
What is Red-Black tree?

# Answer:

- 47.
What are some main advantages of Tries over Hash Tables

# Answer:

- 48.
How would you traverse a Linked List in

*O(n1/2)*?# Answer:

- 49.
What is Bipartite Graph? How to detect one?

# Answer:

- 50.
What are Pascal Strings?

# Answer:

- 51.
Explain what is B-Tree?

# Answer:

- 52.
How To Choose Between a Hash Table and a Trie (Prefix Tree)?

# Answer:

- 53.
When is doubly linked list more efficient than singly linked list?

# Answer:

- 54.
What is Rope Data Structure is used for?

# Answer:

- 55.
Binet's formula: How to calculate Fibonacci numbers without Recursion or Iteration?

# Answer:

- 56.
Explain how

*QuickSort*works# Answer:

- 57.
Explain what is

*Fibonacci Search*technique?# Answer:

- 58.
How to implement 3

*Stacks*with one*Array*?# Answer:

- 59.
Find the

*length*of a Linked List which contains*Cycle (Loop)*# Answer:

- 60.
Compare lookup operation in Trie vs Hash Table

# Answer:

- 61.
How are B-Trees used in practice?

# Answer:

One tip that got me hired by Google, Microsoft, and Stripe

I've worked for Microsoft, Google, Stripe, and received offers from many other companies. One thing I learned when I was interviewing myself is that standard interview tips are woefully inadequate.

Reverse Tech Interview: Questions to Stump an Interviewer

Few people want to get into an uncomfortable environment or an unprofitable company with no prospects. If you’re wondering how to get a real feel for a company during an interview, you’re welcome. I’ll give a list of questions that interviewers don’t usually expect...

How to become a programmer, move to the US, and get a dream job

Are you curious about what you need to do to earn more than $15.000 a month, drive a Tesla, live in sunny California, and work at Google, Apple, Facebook, or Amazon?

11 Reactive Systems interview questions and answers for software engineers

Reactive systems are an architectural style that allows multiple individual applications to blend into one unit, reacting to their environment, while staying aware of each other. Here is a list of coding interview questions on Reactive Systems to help you get ready for your next data struc...

Reactive Systems34 Microservices interview questions and answers for software engineers

Microservice architecture – a variant of the service-oriented architecture structural style – arranges an application as a collection of loosely coupled services. In a microservices architecture, services are fine-grained and the protocols are lightweight. Here is a list of coding intervie...

Microservices7 Layering & Middleware interview questions for developers

Middleware in the context of distributed applications is software that provides services beyond those provided by the operating system to enable the various components of a distributed system to communicate and manage data. Middleware supports and simplifies complex distributed application...

Layering & Middleware55 Docker interview questions and answers for software engineers

Docker is a set of platform as a service products that use OS-level virtualization to deliver software in packages called containers. Here is a list of coding interview questions on Docker to help you get ready for your next data structures interview in 2021.

Docker23 Databases interview questions and answers for software engineers

A database is an organized collection of data, generally stored and accessed electronically from a computer system. Where databases are more complex they are often developed using formal design and modeling techniques. Here is a list of coding interview questions on Databases to help you g...

Databases21 Concurrency interview questions and answers for software engineers

In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the final outcome. Here is a list of coding interview questions on Concurrency to help you get ready for your n...

Concurrency13 CAP Theorem interview questions and answers for software engineers

In theoretical computer science, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that it is impossible for a distributed data store to simultaneously provide more than two out of the following three guarantees: Consistency: Every read receives the ...

CAP Theorem
Load more posts

Get the inside track on what to expect in your next tech interview. We offer you a collection of high quality technical interview questions to help you prepare for your next coding interview.

A smart interface helps you track your progress and focus on the topics you need. You can search through questions or sort them by difficulty or type.

Save tens of hours searching for information on hundreds of low-quality sites designed to drive traffic and make money from advertising.

Prepare for a technical interview

tech interview questions & answers