🔰 Node JS: Beginners Guide
❤4👍1
Data Structures that make databases fast and scalable ✅
👍4❤1👏1
Top 40 commonly asked DSA questions :
𝗔𝗿𝗿𝗮𝘆𝘀 𝗮𝗻𝗱 𝗦𝘁𝗿𝗶𝗻𝗴𝘀:
1. Find the missing number in an array of integers.
2. Implement an algorithm to rotate an array.
3. Check if a string is a palindrome.
4. Find the first non-repeating character in a string.
5. Implement an algorithm to reverse a linked list.
6. Merge two sorted arrays.
7. Implement a stack using arrays/linked list.
8. Write a program to remove duplicates from a sorted array.
𝗟𝗶𝗻𝗸𝗲𝗱 𝗟𝗶𝘀𝘁𝘀:
1. Detect a cycle in a linked list.
2. Find the intersection point of two linked lists.
3. Reverse a linked list in groups of k.
4. Implement a function to add two numbers represented by linked lists.
5. Clone a linked list with next and random pointer.
𝗧𝗿𝗲𝗲𝘀 𝗮𝗻𝗱 𝗕𝗶𝗻𝗮𝗿𝘆 𝗦𝗲𝗮𝗿𝗰𝗵 𝗧𝗿𝗲𝗲𝘀 (𝗕𝗦𝗧):
1. Find the height of a binary tree.
2. Check if a binary tree is balanced.
3. Find the lowest common ancestor in a binary tree.
4. Serialize and deserialize a binary tree.
5. Implement an algorithm for in-order traversal without recursion.
6. Convert a BST to a sorted doubly linked list.
You can check these amazing resources for DSA Preparation
All the best 👍👍
𝗔𝗿𝗿𝗮𝘆𝘀 𝗮𝗻𝗱 𝗦𝘁𝗿𝗶𝗻𝗴𝘀:
1. Find the missing number in an array of integers.
2. Implement an algorithm to rotate an array.
3. Check if a string is a palindrome.
4. Find the first non-repeating character in a string.
5. Implement an algorithm to reverse a linked list.
6. Merge two sorted arrays.
7. Implement a stack using arrays/linked list.
8. Write a program to remove duplicates from a sorted array.
𝗟𝗶𝗻𝗸𝗲𝗱 𝗟𝗶𝘀𝘁𝘀:
1. Detect a cycle in a linked list.
2. Find the intersection point of two linked lists.
3. Reverse a linked list in groups of k.
4. Implement a function to add two numbers represented by linked lists.
5. Clone a linked list with next and random pointer.
𝗧𝗿𝗲𝗲𝘀 𝗮𝗻𝗱 𝗕𝗶𝗻𝗮𝗿𝘆 𝗦𝗲𝗮𝗿𝗰𝗵 𝗧𝗿𝗲𝗲𝘀 (𝗕𝗦𝗧):
1. Find the height of a binary tree.
2. Check if a binary tree is balanced.
3. Find the lowest common ancestor in a binary tree.
4. Serialize and deserialize a binary tree.
5. Implement an algorithm for in-order traversal without recursion.
6. Convert a BST to a sorted doubly linked list.
You can check these amazing resources for DSA Preparation
All the best 👍👍
❤5👍2