7️⃣5️⃣ Data Structures and Algorithms (DSA) questions

You should be able to master all these in coming days through the upcoming DSA series.

🧵 👇
1️⃣ Algorithms Basics

1️⃣ What is an algorithm?
2️⃣ How to approach to solve a problem?
3️⃣ What is time complexity? How to measure it?
4️⃣ What is space complexity? How to measure it?
2️⃣ Data Structure Basics

5️⃣ What are types of data structures?
6️⃣ What are some mostly used data structure operations?
7️⃣ What is traversal?
8️⃣ How to insert an element?
9️⃣ How to delete an element?
1️⃣0️⃣ How to get an element?
1️⃣1️⃣ How to update an element?
3️⃣ Array

1️⃣2️⃣ What is an Array?
1️⃣3️⃣ What is a multi dimensional Array?
1️⃣4️⃣ What are mostly used operations on Array?
1️⃣5️⃣ What are time complexity and space complexity of all Array operations?
1️⃣6️⃣ How to reverse an Array?
4️⃣ Linked List

1️⃣7️⃣ What is a Linked List?
1️⃣8️⃣ Where to use Linked List over an Array and vice versa?
1️⃣9️⃣ What is a Node?
2️⃣0️⃣ What is a Pointer?
2️⃣1️⃣ What is a Double Linked List?
2️⃣2️⃣ What is a Circular Linked List?

++
2️⃣3️⃣ What are time and space complexity of Linked List operations?
2️⃣4️⃣ How to traverse through a linked list?
2️⃣5️⃣ How to reverse a linked list?
2️⃣6️⃣ How to check if a cycle of nodes is formed?
5️⃣ Stack & Queue

2️⃣7️⃣ What is a Stack?
2️⃣8️⃣ What is a Queue?
2️⃣9️⃣ What operations a Stack and Queue provide?
3️⃣0️⃣ What is the difference between a Stack and a Queue?
3️⃣1️⃣ Where to choose a Stack over a Queue and vice versa?
3️⃣2️⃣ What is a Dequeue?
3️⃣3️⃣ What is a priority Queue?
6️⃣ Hash Table

3️⃣4️⃣ What is a Hash Table?
3️⃣5️⃣ What are Keys and Values in a Hash Table?
3️⃣6️⃣ What is a Hashing Function?
3️⃣7️⃣ What are different Hashing Functions available?
3️⃣8️⃣ What is a hash collision?
3️⃣9️⃣ What are different techniques used to avoid/resolve a hash collision?
7️⃣ Tree

4️⃣0️⃣ What is a Tree?
4️⃣1️⃣ What are Binary Trees?
4️⃣2️⃣ What is a node in a Tree?
4️⃣3️⃣ What is the height of a Tree/Node?
4️⃣4️⃣ What is the depth of a Node?
4️⃣5️⃣ What is degree of a Node?
4️⃣6️⃣ What is the maximum number of nodes in a k-height binary tree?

++
4️⃣7️⃣ What are different tree traversal techniques?
4️⃣8️⃣ Print Left/Right View of any Binary Tree.
4️⃣9️⃣ What is a Binary Search Tree?
5️⃣0️⃣ What is an AVL Tree?
5️⃣1️⃣ What is a B-Tree?
5️⃣2️⃣ What is a B+ Tree?
5️⃣3️⃣ What is a Red Black Tree?
5️⃣4️⃣ What is a Trie?
8️⃣ Heap

5️⃣5️⃣What is a Heap?
5️⃣6️⃣What is a Max Heap and, Min Heap?
5️⃣7️⃣What is Heapify operation?
5️⃣8️⃣How to pick a max/min element from a Heap?
5️⃣9️⃣How to extract a max/min element from a Heap?
6️⃣0️⃣What is the difference between pick and extract?
6️⃣1️⃣What is a Fibonacci Heap?
9️⃣ Graph

6️⃣2️⃣ What is a Graph Data Structure?
6️⃣3️⃣ How to represent a graph?
6️⃣4️⃣ What is Adjacency List and, Adjacency Matrix?
6️⃣5️⃣ What is difference between Tree and Graph?
6️⃣6️⃣ What is Breadth First Search and Depth First Search?

++
6️⃣7️⃣ What is the difference between BFS and DFS?
6️⃣8️⃣ Where to use BFS over DFS and vice versa?
6️⃣9️⃣ What is a topological sorting in a Graph?
1️⃣0️⃣ Sorting

7️⃣0️⃣ How to approach a Sorting?
7️⃣1️⃣ What are some known sorting techniques?
7️⃣2️⃣ Provide Time and space complexity of different sorting techniques.
1️⃣1️⃣ Searching

7️⃣3️⃣ What is Linear Searching?
7️⃣4️⃣ What is Binary Searching?
7️⃣5️⃣ What is time and space complexity of search techniques?
This thread is a precursor to the upcoming DSA series. 👇 thread lists all the topics that will be covered through this series.

Check 👇 infographics for one example. It is a condensed one. But as part of this series, we will explain step by step.

Are you excited to learn DSA along with me? The DSA series is coming soon for you.

A topic will be described in a thread which will have explanations in both Text and Infographics. All materials will be beginner friendly.

See you soon in this upcoming series. 👋
This is a thread before you begin with DSA. Know about what approach you can take while trying to solve a problem.

• • •

Missing some Tweet in this thread? You can try to force a refresh
 

Keep Current with Swapna Kumar Panda ✨

Swapna Kumar Panda ✨ Profile picture

Stay in touch and get notified when new unrolls are available from this author!

Read all threads

This Thread may be Removed Anytime!

PDF

Twitter may remove this content at anytime! Save it as PDF for later use!

Try unrolling a thread yourself!

how to unroll video
  1. Follow @ThreadReaderApp to mention us!

  2. From a Twitter thread mention us with a keyword "unroll"
@threadreaderapp unroll

Practice here first or read more on our help page!

More from @swapnakpanda

17 Oct
😊 Are you a beginner in programming domain?

😢 Are you getting confused of what approach to take while solving a problem?

🙃 Are you wondering why is DSA so important in Problem Solving?

Let's clear all confusions and master the skill through 1️⃣0️⃣ super simple steps 😎

🧵 👇
1️⃣ Read-Realise-Write-Run-Reshape

Yes. I say it often when someone asks me how to approach during solving a problem.

Let's see what are these.
1️⃣.1️⃣ Read & Realise

These 2 actions are so close to each other that we can hardly keep apart.

Do like this.

1. When you try to solve a problem, first "Read" it properly once.

2. Then, "Realise" what it is asking to solve.

++
Read 22 tweets
15 Oct
Are you new to Data Structures and Algorithms (DSA)?

Let's get to know about all of those we would be learning.

🧵 👇
1️⃣ Array

👉 Data Structures

1️⃣ One-Dimensional Array
2️⃣ Multi-Dimensional Array

👉 Algorithms

1️⃣ Traverse
2️⃣ Insert
3️⃣ Delete
4️⃣ Get
5️⃣ Search
6️⃣ Size
7️⃣ Reverse
2️⃣ Linked List

👉 Data Structures

1️⃣ Singly Linked List
2️⃣ Doubly Linked List

👉 Algorithms

1️⃣ Traverse
2️⃣ InsertAtHead
3️⃣ InsertAtEnd
4️⃣ Insert
5️⃣ DeleteAtHead
6️⃣ DeleteAtEnd
7️⃣ Delete
8️⃣ Update
9️⃣ Get
1️⃣0️⃣ Search
1️⃣1️⃣ IsEmpty
1️⃣2️⃣ Reverse
Read 13 tweets
13 Oct
🔥 9️⃣ Useful Hacks to simplify your JavaScript code

Follow these simple yet most useful hacks in your code. These are not only modern way of writing JS code but also minifies your code.

🧵 👇
We will cover,

1️⃣ Converting to Boolean
2️⃣ Converting to Number
3️⃣ Converting to String
4️⃣ Short-Circuit && and ||
5️⃣ Default Function Parameters
6️⃣ Nullish Coalescing Operator
7️⃣ Optional Chaining Operator
8️⃣ Array Resizing
9️⃣ Converting Array-Like to Array
1️⃣ Converting to Boolean

To convert any data to a Boolean type, use

→ Boolean function or,
→ !! operator
Read 12 tweets
12 Oct
🔥 Array and Object Destructuring in JavaScript 🚀

This 🧵 will have everything that you may need to learn this important feature of "Destructuring".

Let's explore 👇
We will discuss about

→ History (why this feature was necessary)
→ Introduction to Destructuring
→ How does destructuring work?
→ Limitations and future improvements

Let's deep dive 🚀
0️⃣ Some History

Back to 2015, JS codes were a little heavy.

If I had an array, say

arr = [10, 20]

To access elements of the array, I had to use index. Eg., arr[0], arr[1].

And if I had to store these values in some other variables, then

first = arr[0]
second = arr[1]

++
Read 22 tweets
17 Aug
6 Insert Techniques for JavaScript Arrays

Check the 🧵 👇

#DEVCommunity #javascript
(1/n)

Insert an element at the beginning of an array by both mutating and not mutating the original array.

👇
(2/n)

Insert an element at the end of an array by both mutating and not mutating the original array.

👇
Read 6 tweets
16 Aug
🔍 Search Operation Explained for Non-Programmers

A comprehensive 🧵 👇 🔍  Search Operation Explained for Non-Programmers
In this 🧵, I will explain

🙋🏼‍♀️ What is Search?
🙋🏼‍♀️ Where do we use it?
🙋🏼‍♀️ How important is it?
🙋🏼‍♀️ How better can it be?

Understand about concepts like Sorting, Hashing.

No programming knowledge required for reading this thread.
(1/n)

What is Search? - Search is basically when you are looking for something.

You must have come across terms like 'Find', 'Filter', 'Fetch', 'Get', 'Check', 'Select', 'Read', 'Look for' etc. They all involve 'Search'.
Read 19 tweets

Did Thread Reader help you today?

Support us! We are indie developers!


This site is made by just two indie developers on a laptop doing marketing, support and development! Read more about the story.

Become a Premium Member ($3/month or $30/year) and get exclusive features!

Become Premium

Too expensive? Make a small donation by buying us coffee ($5) or help with server cost ($10)

Donate via Paypal Become our Patreon

Thank you for your support!

Follow Us on Twitter!

:(