DSA has been the anchoring point for any tech interview preparation, especially when you want to ace SDE interviews.
We have decoded a simple trick for you. Here are the important DSA topics and we'll be looking at them one by one.
Let's start with Arrays:
An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.
1) Leaders in an array-
Understand the concept: https://bit.ly/3OI6xMb
Practice with this problem: Given an array A of positive integers. Your task is to find the leaders in the array.
Full Problem: https://bit.ly/3ScxY3K
2) Equilibrium point -
Understand the concept: https://bit.ly/3cQnarO
Practice with this problem: Given an array A of n positive numbers. The task is to find the first Equilibrium Point in the array.
Full Problem: https://bit.ly/3bfn7Fu
Find more in this main article: https://bit.ly/3z3UfrD
We have decoded a simple trick for you. Here are the important DSA topics and we'll be looking at them one by one.
Let's start with Arrays:
An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.
1) Leaders in an array-
Understand the concept: https://bit.ly/3OI6xMb
Practice with this problem: Given an array A of positive integers. Your task is to find the leaders in the array.
Full Problem: https://bit.ly/3ScxY3K
2) Equilibrium point -
Understand the concept: https://bit.ly/3cQnarO
Practice with this problem: Given an array A of n positive numbers. The task is to find the first Equilibrium Point in the array.
Full Problem: https://bit.ly/3bfn7Fu
Find more in this main article: https://bit.ly/3z3UfrD
👍3
Enhance your CSS skills with the offer of the day. 🤓
Grab our CSS Foundation, self-paced course at 25% discount, the lowest price ever.
Use the coupon code "GOLCSS25" till today midnight.
Grab it now: https://practice.geeksforgeeks.org/courses/css-course?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=css
Grab our CSS Foundation, self-paced course at 25% discount, the lowest price ever.
Use the coupon code "GOLCSS25" till today midnight.
Grab it now: https://practice.geeksforgeeks.org/courses/css-course?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=css
❤1🔥1
"Problem of the Day"
Solve this question to get points.
Given a string consisting of lowercase english alphabets. Find the repeated character present first in the string.
Full Problem: https://bit.ly/3JvQxMt
Solve this question to get points.
Given a string consisting of lowercase english alphabets. Find the repeated character present first in the string.
Full Problem: https://bit.ly/3JvQxMt
practice.geeksforgeeks.org
Repeated Character | Practice | GeeksforGeeks
Given a string consisting of lowercase english alphabets. Find the repeated character present first in the string.
Example 1:
Input:
S = "geeksforgeeks"
Output: g
Explanation: g, e, k and s are the repeating
characters. Out of t
Example 1:
Input:
S = "geeksforgeeks"
Output: g
Explanation: g, e, k and s are the repeating
characters. Out of t
👍4🔥1
Test your Backend Development skills with this weekly quiz.
Solve the MCQs based on Java Backend Development and win assured rewards.
You can submit your entry by 31st July, 11:59 PM IST.
Participate Now: https://forms.gle/nQiqDdGZevFa9rJm8
Solve the MCQs based on Java Backend Development and win assured rewards.
You can submit your entry by 31st July, 11:59 PM IST.
Participate Now: https://forms.gle/nQiqDdGZevFa9rJm8
Last one has to be this. ✨
Develop complete web app with the offer of the day.
Now grab Java Backend Development, live course at 20% discount, the lowest price ever.
Use the coupon code "GOLJBDL20" till today midnight.
To grab this offer: https://practice.geeksforgeeks.org/courses/Java-backend-live?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=jbdl
Develop complete web app with the offer of the day.
Now grab Java Backend Development, live course at 20% discount, the lowest price ever.
Use the coupon code "GOLJBDL20" till today midnight.
To grab this offer: https://practice.geeksforgeeks.org/courses/Java-backend-live?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=jbdl
"Problem of the Day"
Solve this question to get points.
Given an array arr[] containing positive elements. A and B are two numbers defining a range. The task is to check if the array contains all elements in the given range.
Full Problem: https://practice.geeksforgeeks.org/problems/elements-in-the-range2834/1
Solve this question to get points.
Given an array arr[] containing positive elements. A and B are two numbers defining a range. The task is to check if the array contains all elements in the given range.
Full Problem: https://practice.geeksforgeeks.org/problems/elements-in-the-range2834/1
practice.geeksforgeeks.org
Elements in the Range | Practice | GeeksforGeeks
Given an array arr[] containing positive elements. A and B are two numbers defining a range. The task is to check if the array contains all elements in the given range.
Example 1:
Input: N = 7, A = 2, B = 5
arr[] = {1, 4, 5, 2, 7, 8, 3}
Ou
Example 1:
Input: N = 7, A = 2, B = 5
arr[] = {1, 4, 5, 2, 7, 8, 3}
Ou
🔥1
"Problem of the Day"
Solve this question to get points.
You are given N identical eggs and you have access to a K-floored building from 1 to K.
Full Problem: https://bit.ly/3cR8cBQ
Solve this question to get points.
You are given N identical eggs and you have access to a K-floored building from 1 to K.
Full Problem: https://bit.ly/3cR8cBQ
practice.geeksforgeeks.org
Egg Dropping Puzzle | Practice | GeeksforGeeks
You are given N identical eggs and you have access to a K-floored building from 1 to K.
There exists a floor f where 0 <= f <= K such that any egg dropped at a floor higher than f will break, and any egg dropped a
There exists a floor f where 0 <= f <= K such that any egg dropped at a floor higher than f will break, and any egg dropped a
🔥2
To achieve our goals, we must have a great plan with us, be it interview preparation or being a great programmer.
In this context, we have come up with a complete guide on Arrays for interview preparation. In this guide, we have covered top Theoretical interview questions and Top interview coding questions.
Check out this article for more: https://bit.ly/3JnZHKS
In this context, we have come up with a complete guide on Arrays for interview preparation. In this guide, we have covered top Theoretical interview questions and Top interview coding questions.
Check out this article for more: https://bit.ly/3JnZHKS
🔥2
"Problem of the Day"
Solve this question to get points.
Given a BST and a value k, the task is to delete the nodes having values greater than or equal to k.
Full Problem: https://practice.geeksforgeeks.org/problems/delete-nodes-greater-than-k/1
Solve this question to get points.
Given a BST and a value k, the task is to delete the nodes having values greater than or equal to k.
Full Problem: https://practice.geeksforgeeks.org/problems/delete-nodes-greater-than-k/1
practice.geeksforgeeks.org
Minimum Swaps for Bracket Balancing | Practice | GeeksforGeeks
You are given a string S of 2N characters consisting of N ‘[‘ brackets and N ‘]’ brackets. A string is considered balanced if it can be represented in the for S2[S1] where S1 and S2 are balanced strings. We can make an unbalan
👍1
Media is too big
VIEW IN TELEGRAM
Earn while Learn! 🤩
Yes, you heard it right. GeeksforGeeks brings you Refer and Earn, a referral program to learn and earn.
Watch the full video to understand more about the process, eligibility, and benefits.
Check out here: https://practice.geeksforgeeks.org/referral?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=referandearn
Yes, you heard it right. GeeksforGeeks brings you Refer and Earn, a referral program to learn and earn.
Watch the full video to understand more about the process, eligibility, and benefits.
Check out here: https://practice.geeksforgeeks.org/referral?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=referandearn
👏2
The next topic, we are going to cover in DSA for SDE Interview Preparation is Searching And Sorting.
In Searching and Sorting, there are a number of concepts, you can try your hands on.
Quick Sort:
Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.
Understand the concept here: https://bit.ly/3cTZin7
Practice with this problem: Quick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.
Full Problem: https://bit.ly/3bvHjmu
You can find more problems related to sorting and searching in the main article.
The link to the main article: https://bit.ly/3z3UfrD
In Searching and Sorting, there are a number of concepts, you can try your hands on.
Quick Sort:
Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.
Understand the concept here: https://bit.ly/3cTZin7
Practice with this problem: Quick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.
Full Problem: https://bit.ly/3bvHjmu
You can find more problems related to sorting and searching in the main article.
The link to the main article: https://bit.ly/3z3UfrD
👍4❤1
"Problem of the Day"
Solve this question to get points.
Given an array arr[] of N nodes representing preorder traversal of some BST. You have to build the exact BST from it's given preorder traversal.
Full Problem: https://bit.ly/3OPy2nb
Solve this question to get points.
Given an array arr[] of N nodes representing preorder traversal of some BST. You have to build the exact BST from it's given preorder traversal.
Full Problem: https://bit.ly/3OPy2nb
practice.geeksforgeeks.org
Preorder to BST | Practice | GeeksforGeeks
Given an array arr[] of N nodes representing preorder traversal of some BST. You have to build the exact BST from it's given preorder traversal.
In Pre-Order traversal, the root node is visited before the left child and right child no
In Pre-Order traversal, the root node is visited before the left child and right child no
👍1
This media is not supported in your browser
VIEW IN TELEGRAM
Winners of JBDL quiz are out.
Congratulations to all the geeks. 🎉
A special congratulations to Mr. Tushar Khanna, for being the most consistent participant with a total score of 60/80, in all of our weekly quizzes held in the month of July.
Keep up the good work!🙌
Congratulations to all the geeks. 🎉
A special congratulations to Mr. Tushar Khanna, for being the most consistent participant with a total score of 60/80, in all of our weekly quizzes held in the month of July.
Keep up the good work!🙌
👏3❤1👍1
We know that you'll love it.❤
We bring to you, Job-A-Thon: Amazon.
Now get a chance to work at Amazon by participating in this hiring contest, happening on 05th August.
Don't miss this chance to become an Amazonian. 👀
You can register and find all the details here: https://practice.geeksforgeeks.org/contest/job-a-thon-exclusive-hiring-challenge-2-for-amazon-alexa?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=amazon_jobathon2
We bring to you, Job-A-Thon: Amazon.
Now get a chance to work at Amazon by participating in this hiring contest, happening on 05th August.
Don't miss this chance to become an Amazonian. 👀
You can register and find all the details here: https://practice.geeksforgeeks.org/contest/job-a-thon-exclusive-hiring-challenge-2-for-amazon-alexa?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=amazon_jobathon2
👍1🔥1
"Problem of the Day"
Solve this question to get points.
Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not.
Full Problem: https://bit.ly/3OT8Agl
Solve this question to get points.
Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not.
Full Problem: https://bit.ly/3OT8Agl
practice.geeksforgeeks.org
Complete Binary Tree | Practice | GeeksforGeeks
Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not. A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far l
👍3
If you're a fresher and finding it difficult to start your career in the IT industry, then you need to check this blog.
Well, we know that having any relevant experience or knowledge can give you an edge but for a fresher, it is indeed a challenge.
So, to cater to all your thoughts, we have listed down some useful tips on how to get an IT job without experience.
Read more here: https://bit.ly/3cZoFnz
Well, we know that having any relevant experience or knowledge can give you an edge but for a fresher, it is indeed a challenge.
So, to cater to all your thoughts, we have listed down some useful tips on how to get an IT job without experience.
Read more here: https://bit.ly/3cZoFnz
👍5
"Problem of the Day"
Solve this question to get points.
Given a grid of n*m consisting of O's and X's. The task is to find the number of 'X' total shapes.
Full Problem: https://bit.ly/3zyYonJ
Solve this question to get points.
Given a grid of n*m consisting of O's and X's. The task is to find the number of 'X' total shapes.
Full Problem: https://bit.ly/3zyYonJ
practice.geeksforgeeks.org
X Total Shapes | Practice | GeeksforGeeks
Given a grid of n*m consisting of O's and X's. The task is to find the number of 'X' total shapes.
Note: 'X' shape consists of one or more adjacent X's (diagonals not included).
Examp
Note: 'X' shape consists of one or more adjacent X's (diagonals not included).
Examp
🥰2👍1
"Problem of the Day"
Solve this question to get points.
Sort the given doubly linked list of size N using quicksort. Just complete the partition function using the quicksort technique.
Full Problem: https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1
Solve this question to get points.
Sort the given doubly linked list of size N using quicksort. Just complete the partition function using the quicksort technique.
Full Problem: https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1
practice.geeksforgeeks.org
QuickSort on Doubly Linked List | Practice | GeeksforGeeks
Sort the given doubly linked list of size N using quicksort. Just complete the partition function using the quicksort technique.
Example 1:
Input:
LinkedList: 4->2->9
Output:
2 4 9
Explaination: After sorting output will loo
Example 1:
Input:
LinkedList: 4->2->9
Output:
2 4 9
Explaination: After sorting output will loo
👍1
Your weekly quiz is here.🙌
Solve the MCQs based on Data Structure & Algorithms and win assured rewards.
You can submit your entry by 07 Aug, 11:59 PM IST.
To participate in this quiz: https://forms.gle/6CNxi8jirkcGeb8X7
Solve the MCQs based on Data Structure & Algorithms and win assured rewards.
You can submit your entry by 07 Aug, 11:59 PM IST.
To participate in this quiz: https://forms.gle/6CNxi8jirkcGeb8X7
"Problem of the Day"
Solve this question to get points.
Given an array of N positive integers where all numbers occur even number of times except one number which occurs odd number of times.
Full Problem: https://practice.geeksforgeeks.org/problems/find-the-odd-occurence4820/1
Solve this question to get points.
Given an array of N positive integers where all numbers occur even number of times except one number which occurs odd number of times.
Full Problem: https://practice.geeksforgeeks.org/problems/find-the-odd-occurence4820/1
practice.geeksforgeeks.org
Minimum swaps and K together | Practice | GeeksforGeeks
Given an array arr of n positive integers and a number k. One can apply a swap operation on the array any number of times, i.e choose any two index i and j (i < j) and swap arr[i] , arr[j] . Find the minimum number of swaps req
👍1