100+ Interview & Practice Questions
➤ Data Structures
➤ Algorithms
Practice in
❯ C++
❯ Java
❯ C#
❯ Golang
❯ Python
❯ JavaScript
❯ Rust
or, any language of your choice.
⇩
➤ Data Structures
➤ Algorithms
Practice in
❯ C++
❯ Java
❯ C#
❯ Golang
❯ Python
❯ JavaScript
❯ Rust
or, any language of your choice.
⇩
Level: Beginner to Medium
Topics:
➊ Algorithms
➋ Data Structures
➌ Array
➍ Array - Operations
➎ Linked List
➏ Linked List - Operations
➐ Practice Questions
You can read all these questions uninterrupted and download them to a PDF as well using doc.clickup.com
Topics:
➊ Algorithms
➋ Data Structures
➌ Array
➍ Array - Operations
➎ Linked List
➏ Linked List - Operations
➐ Practice Questions
You can read all these questions uninterrupted and download them to a PDF as well using doc.clickup.com
➊ Algorithms
➀ What is an algorithm?
➁ What is time and space complexity of an algorithm?
➂ What is Brute Force algorithm?
➃ What is recursion?
➄ What is iteration?
➅ Difference between Recursion and Iteration.
➆ Give some examples and use cases of Recursions.
➀ What is an algorithm?
➁ What is time and space complexity of an algorithm?
➂ What is Brute Force algorithm?
➃ What is recursion?
➄ What is iteration?
➅ Difference between Recursion and Iteration.
➆ Give some examples and use cases of Recursions.
➇ What is Divide and Conquer?
➈ Give examples and use cases of Divide and Conquer algorithms.
➉ What is a greedy algorithm?
➀➀ Give examples and use cases of greedy algorithms.
➀➁ What is Dynamic Programming?
➈ Give examples and use cases of Divide and Conquer algorithms.
➉ What is a greedy algorithm?
➀➀ Give examples and use cases of greedy algorithms.
➀➁ What is Dynamic Programming?
➀➂ Give examples and use cases of dynamic programming algorithms.
➀➃ What is Backtracking Algorithm?
➀➄ Give examples and use cases of backtracking algorithms?
➀➅ What is Randomised Algorithm?
➀➆ Give examples and use cases of randomised algorithms?
➀➃ What is Backtracking Algorithm?
➀➄ Give examples and use cases of backtracking algorithms?
➀➅ What is Randomised Algorithm?
➀➆ Give examples and use cases of randomised algorithms?
➋ Data Structures
➀ Define a Data Structure.
➁ Give some examples of Data Structures.
➂ Relate one of the real-life scenarios with a Data Structure and explain it.
➃ What are different types of data structures?
➄ What is a linear data structure? Give Examples.
➀ Define a Data Structure.
➁ Give some examples of Data Structures.
➂ Relate one of the real-life scenarios with a Data Structure and explain it.
➃ What are different types of data structures?
➄ What is a linear data structure? Give Examples.
➅ Give some examples of non-linear data structures.
➆ What are some common operations performed on any data structure?
➇ Which data structures do not guarantee the order of elements as they are inserted?
➈ Which data structure doesn't contain duplicate elements?
➆ What are some common operations performed on any data structure?
➇ Which data structures do not guarantee the order of elements as they are inserted?
➈ Which data structure doesn't contain duplicate elements?
➌ Array
➀ Define an array.
➁ What is the dimension of an array?
➂ How is an array stored in memory?
➃ How is a multi-dimensional array stored in memory?
➄ While creating an array, is its size always static?
➅ How to make the size of an array dynamic?
➀ Define an array.
➁ What is the dimension of an array?
➂ How is an array stored in memory?
➃ How is a multi-dimensional array stored in memory?
➄ While creating an array, is its size always static?
➅ How to make the size of an array dynamic?
➆ What is the index in an array?
➇ What is the base index? Take an example of a language and tell what the base index is.
➈ How to find the memory location of an element at a particular index?
➇ What is the base index? Take an example of a language and tell what the base index is.
➈ How to find the memory location of an element at a particular index?
➍ Array - Operations
✧ Write Pseudo Code and find Time and Space complexity for each.
➀ traversing through elements
➁ insert at the start
➂ insert at the last
➃ insert at any position
➄ remove from the start
➅ remove from the last
➆ remove from any position
✧ Write Pseudo Code and find Time and Space complexity for each.
➀ traversing through elements
➁ insert at the start
➂ insert at the last
➃ insert at any position
➄ remove from the start
➅ remove from the last
➆ remove from any position
➇ fetch the first element
➈ fetch the last element
➉ fetch any element
➀➀ check if the array is empty
➈ fetch the last element
➉ fetch any element
➀➀ check if the array is empty
➎ Linked List
➀ Define a Linked List Data Structure.
➁ How is a Linked List different from an Array?
➂ For which operations Linked List should be preferred over an Array? Explain why.
➃ What are the different types of Linked List implementations?
➀ Define a Linked List Data Structure.
➁ How is a Linked List different from an Array?
➂ For which operations Linked List should be preferred over an Array? Explain why.
➃ What are the different types of Linked List implementations?
➄ Which performance bottlenecks of a Simple Linked List can be overcome by using a Doubly Linked List? How?
➅ What are the use cases of using a Circular Linked List?
➅ What are the use cases of using a Circular Linked List?
➏ Linked List - Operations
✧ Write Pseudo Code and find Time and Space complexity for each.
✧ Do it separately for a Linked List, DLL and CLL.
➀ traversing through nodes
➁ insert at the start
➂ insert at the last
➃ insert at any position
➄ remove from the start
✧ Write Pseudo Code and find Time and Space complexity for each.
✧ Do it separately for a Linked List, DLL and CLL.
➀ traversing through nodes
➁ insert at the start
➂ insert at the last
➃ insert at any position
➄ remove from the start
➅ remove from the last
➆ remove from any position
➇ fetch the first element
➈ fetch the last element
➉ fetch any element
➀➀ size of the list
➀➁ check if the list is empty
➆ remove from any position
➇ fetch the first element
➈ fetch the last element
➉ fetch any element
➀➀ size of the list
➀➁ check if the list is empty
➐ Practice Questions
✧ Write Pseudo Code and find Time and Space complexity.
✧ Solve these for both Array & Linked List.
❑ Filter
➀ Filter elements for specific conditions
❑ Reduce
Find
➀ sum
➁ minimum
➂ maximum
of elements.
✧ Write Pseudo Code and find Time and Space complexity.
✧ Solve these for both Array & Linked List.
❑ Filter
➀ Filter elements for specific conditions
❑ Reduce
Find
➀ sum
➁ minimum
➂ maximum
of elements.
❒ Sorting
➀ Bubble
➁ Selection
➂ Insertion
➃ Merge
➄ Quick
➅ Heap
➆ Tree
➇ Tim
➈ Odd-Even
➉ Comb
➀➀ Cocktail
➀➁ Shell
➀➂ Counting
➀➃ Radix
➀➄ Bucket
➀ Bubble
➁ Selection
➂ Insertion
➃ Merge
➄ Quick
➅ Heap
➆ Tree
➇ Tim
➈ Odd-Even
➉ Comb
➀➀ Cocktail
➀➁ Shell
➀➂ Counting
➀➃ Radix
➀➄ Bucket
❑ Divide
➀ Divide an array into 2 equal parts
➁ Divide an array into k equal parts
➂ Divide an array into k parts where each sub-array contains elements at k-distance
➀ Divide an array into 2 equal parts
➁ Divide an array into k equal parts
➂ Divide an array into k parts where each sub-array contains elements at k-distance
❒ Pick/Drop
➀ Return a new array by picking each kth element
➁ Return a new array by dropping each kth element
❑ Merge
➀ Merge 2 or, more arrays
➁ Merge 2 sorted arrays to form another sorted array
➀ Return a new array by picking each kth element
➁ Return a new array by dropping each kth element
❑ Merge
➀ Merge 2 or, more arrays
➁ Merge 2 sorted arrays to form another sorted array
❒ Reverse
➀ Reverse an array
➁ Divide an array in k parts and reverse each
➂ Create a mirror reflection of an array (reverse + merge)
❑ Rotate/Shuffle
➀ Rotate an array clockwise/anti-clockwise for k times
➁ Shuffle an array
➀ Reverse an array
➁ Divide an array in k parts and reverse each
➂ Create a mirror reflection of an array (reverse + merge)
❑ Rotate/Shuffle
➀ Rotate an array clockwise/anti-clockwise for k times
➁ Shuffle an array
❒ Map/Group
➀ Return a new array by adding/multiplying each element with some value
➁ Based on some classifying rule, group elements of an array and form separate arrays
➀ Return a new array by adding/multiplying each element with some value
➁ Based on some classifying rule, group elements of an array and form separate arrays
❒ Others
➀ Check if an array is a palindrome
➁ TWO SUM: In an array of integers, return indices of 2 integers such that they add up to a given target value.
➂ PLUS ONE: Given an array of digits, return a new array of digits by adding one to the number.
➀ Check if an array is a palindrome
➁ TWO SUM: In an array of integers, return indices of 2 integers such that they add up to a given target value.
➂ PLUS ONE: Given an array of digits, return a new array of digits by adding one to the number.
➃ In an array of integers, given an element, find the next largest number after that index which is present maximum times.
➄ Given a number, convert it into a stream of binaries (0's and 1's). Check how many times 'k' consecutive 1's exist.
➄ Given a number, convert it into a stream of binaries (0's and 1's). Check how many times 'k' consecutive 1's exist.
🚥 Disclaimer
⬘ Few of these questions have previously been shared by me.
⬗ Don't assume that only these types of questions are asked during interviews.
⬙ For interviews, you should be able to provide solutions to practical problems. Keep practicing problems.
⬘ Few of these questions have previously been shared by me.
⬗ Don't assume that only these types of questions are asked during interviews.
⬙ For interviews, you should be able to provide solutions to practical problems. Keep practicing problems.
Hey 👋
I am a Tech Writer, Educator, and Mentor from India 🇮🇳
I am sharing
❯ Tutorials
❯ Career Tips
❯ Interview Questions
❯ Roadmaps
on
➠ Web Development
➠ DSA
➠ Databases
Do you find these questions useful? Share your feedback 🗨️
I am a Tech Writer, Educator, and Mentor from India 🇮🇳
I am sharing
❯ Tutorials
❯ Career Tips
❯ Interview Questions
❯ Roadmaps
on
➠ Web Development
➠ DSA
➠ Databases
Do you find these questions useful? Share your feedback 🗨️
Loading suggestions...