Today, let's get into Recursion & Backtracking.
Recursion: The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function.
Backtracking: Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point in time.
There are numerous topics in Recursion & Backtracking.
Let's start with the Program for the Tower of Hanoi.
To understand this concept: https://bit.ly/3pIXwZ7
Practice with: The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod.
Full Problem: https://bit.ly/3pJ1elB
Learn more with the full article: https://bit.ly/3z3UfrD
Recursion: The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function.
Backtracking: Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point in time.
There are numerous topics in Recursion & Backtracking.
Let's start with the Program for the Tower of Hanoi.
To understand this concept: https://bit.ly/3pIXwZ7
Practice with: The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod.
Full Problem: https://bit.ly/3pJ1elB
Learn more with the full article: https://bit.ly/3z3UfrD
👍1😁1
"Problem of the Day"
Solve this question to get points.
Given a string str of length N, you have to find number of palindromic subsequence (need not necessarily be distinct) which could be formed from the string str.
Note: You have to return the answer module 109+7;
Full Problem: https://bit.ly/3wwObaR
Solve this question to get points.
Given a string str of length N, you have to find number of palindromic subsequence (need not necessarily be distinct) which could be formed from the string str.
Note: You have to return the answer module 109+7;
Full Problem: https://bit.ly/3wwObaR
practice.geeksforgeeks.org
Count Palindromic Subsequences | Practice | GeeksforGeeks
Given a string str of length N, you have to find number of palindromic subsequence (need not necessarily be distinct) present in the string str.
Note: You have to return the answer module 109+7;
Example 1:
Input:
Str
Note: You have to return the answer module 109+7;
Example 1:
Input:
Str
Getting into any of the top product-based companies is a dream of every IT graduate.
But....there's a question that often arises in the mind of individuals, is competitive programming necessary for getting jobs at product-based companies?
To answer all your questions related to Competitive Programming, we've penned down something!!
Have a look: https://bit.ly/3wwlBWX
But....there's a question that often arises in the mind of individuals, is competitive programming necessary for getting jobs at product-based companies?
To answer all your questions related to Competitive Programming, we've penned down something!!
Have a look: https://bit.ly/3wwlBWX
Who doesn't know about Apple and how strongly it holds a tight spot in the tech big four companies?
This SDE sheet is a complete roadmap and is specially curated for those, who are ready to give what all it takes. So, let's get started.
To get started with the SDE Sheet: https://bit.ly/3ck8UHT
This SDE sheet is a complete roadmap and is specially curated for those, who are ready to give what all it takes. So, let's get started.
To get started with the SDE Sheet: https://bit.ly/3ck8UHT
❤3
"Problem of the Day"
Solve this question to get points.
Given an unsorted array Arr of N positive and negative numbers. Your task is to create an array of alternate positive and negative numbers without changing the relative order of positive and negative numbers.
Full Problem: https://bit.ly/3RgfIoE
Solve this question to get points.
Given an unsorted array Arr of N positive and negative numbers. Your task is to create an array of alternate positive and negative numbers without changing the relative order of positive and negative numbers.
Full Problem: https://bit.ly/3RgfIoE
practice.geeksforgeeks.org
Alternate positive and negative numbers | Practice | GeeksforGeeks
Given an unsorted array Arr of N positive and negative numbers. Your task is to create an array of alternate positive and negative numbers without changing the relative order of positive and negative numbers.
Note: Array should start with positive n
Note: Array should start with positive n
👍3
The hassle free learning and ultimate career growth is here. 🙌
Get 75% off on our doubt assistance feature and bid goodbye to your doubts. 🤩
Applicable on all of our courses with doubt assistance till 07 September.
To grab this offer: https://bit.ly/3RfrRdz
Get 75% off on our doubt assistance feature and bid goodbye to your doubts. 🤩
Applicable on all of our courses with doubt assistance till 07 September.
To grab this offer: https://bit.ly/3RfrRdz
👍2
Everything you need to Ace the DSA concepts is here. 😇🤩
Join the 06 hours live stream 🔴 on arrays at 10:00 PM 🕙 IST today with our in-house mentors.
Get ready to have an edge over your competitors with exclusive live session. 🕚
To join the workshop: https://youtu.be/EUyagu556cQ
Join the 06 hours live stream 🔴 on arrays at 10:00 PM 🕙 IST today with our in-house mentors.
Get ready to have an edge over your competitors with exclusive live session. 🕚
To join the workshop: https://youtu.be/EUyagu556cQ
🔥2👍1
"Problem of the Day"
Solve this question to get points.
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL.
Full Problem: https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1
Solve this question to get points.
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL.
Full Problem: https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1
practice.geeksforgeeks.org
Binary Tree to DLL | Practice | GeeksforGeeks
Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be same as Inorder of the give
👍2🔥1
The career goal of a majority of the tech graduates is to get a job at FAANG (Facebook, Amazon, Apple, Netflix & Google) companies.
You need to be prepared really well with all the required tech or non-tech skills. You need to have quality learning resources along with a solid interview preparation plan & strategies to crack the interview of your desired job.
And to get your preparation right, participate in this week's interview series.
To know more in detail and register now: https://bit.ly/3RhWajK
You need to be prepared really well with all the required tech or non-tech skills. You need to have quality learning resources along with a solid interview preparation plan & strategies to crack the interview of your desired job.
And to get your preparation right, participate in this week's interview series.
To know more in detail and register now: https://bit.ly/3RhWajK
👍1
"Problem of the Day"
Solve this question to get points.
Given a Binary tree and a key in the binary tree, find the node right to the given key. If there is no node on right side, then return a node with value -1.
Full Problem: https://bit.ly/3ARMgjs
Solve this question to get points.
Given a Binary tree and a key in the binary tree, find the node right to the given key. If there is no node on right side, then return a node with value -1.
Full Problem: https://bit.ly/3ARMgjs
practice.geeksforgeeks.org
Next Right Node | Practice | GeeksforGeeks
Given a Binary tree and a key in the binary tree, find the node right to the given key. If there is no node on right side, then return a node with value -1.
Example 1:
Input:
10
/ \
2 6
/ \
Example 1:
Input:
10
/ \
2 6
/ \
👍1🔥1
We know how much importance DSA holds in every tech interview and having a strong foundation is a must for IT professionals.
Here you go! Check out this complete tutorial on Pseudocode and start learning.
To get started with it: https://bit.ly/3Tl0i4q
Here you go! Check out this complete tutorial on Pseudocode and start learning.
To get started with it: https://bit.ly/3Tl0i4q
👍1🔥1
"Problem of the Day"
Solve this question to get points.
Bob, a teacher of St. Joseph School given a task by his principal to merge the details of the students where each element details[i] is a list of strings, where the first element details[i][0] is a name of the student, and the rest of the elements are emails representing emails of the student.
Full Problem: https://bit.ly/3e9OrpX
Solve this question to get points.
Bob, a teacher of St. Joseph School given a task by his principal to merge the details of the students where each element details[i] is a list of strings, where the first element details[i][0] is a name of the student, and the rest of the elements are emails representing emails of the student.
Full Problem: https://bit.ly/3e9OrpX
practice.geeksforgeeks.org
Merging Details | Practice | GeeksforGeeks
Bob, a teacher of St. Joseph School given a task by his principal to merge the details of the students where each element details[i] is a list of strings, where the first element details[i][0] is a name of the student, and the rest of the e
If you have the passion to excel, the urge to be creative, a never-ending thirst for knowledge, and the desire to grow, HCL is the right place for you!
We have prepared this sheet to help you secure that place.
To get started with it: https://bit.ly/3QeJOIx
We have prepared this sheet to help you secure that place.
To get started with it: https://bit.ly/3QeJOIx
👍1
Today, we are going to cover "Bit Manipulation" in SDE interview preparation.
So, Bit Manipulation is a technique used in a variety of problems to get the solution in an optimised way.
In Bit Manipulation, we have numerous concepts to understand. Let's start with Rotate Bits.
Rotate bits of a number:
A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.
Understand the concept: https://bit.ly/3Q0rD9f
Practice with the problem: Given an integer N and an integer D, rotate the binary representation of the integer N by D digits to the left as well as right and print the results in decimal values after each of the rotation.
Full Problem: https://bit.ly/3R0VBeF
Find more topics in the main article. Link to the main article: https://bit.ly/3z3UfrD
So, Bit Manipulation is a technique used in a variety of problems to get the solution in an optimised way.
In Bit Manipulation, we have numerous concepts to understand. Let's start with Rotate Bits.
Rotate bits of a number:
A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.
Understand the concept: https://bit.ly/3Q0rD9f
Practice with the problem: Given an integer N and an integer D, rotate the binary representation of the integer N by D digits to the left as well as right and print the results in decimal values after each of the rotation.
Full Problem: https://bit.ly/3R0VBeF
Find more topics in the main article. Link to the main article: https://bit.ly/3z3UfrD
👍2
"Problem of the Day"
Solve this question to get points.
Given a set of integers, find all distinct sums that can be generated from the subsets of the given sets.
Full Problem: https://bit.ly/3AUj0Yr
Solve this question to get points.
Given a set of integers, find all distinct sums that can be generated from the subsets of the given sets.
Full Problem: https://bit.ly/3AUj0Yr
practice.geeksforgeeks.org
Find all distinct subset (or subsequence) sums | Practice | GeeksforGeeks
Given a set of integers, find all distinct sums that can be generated from the subsets of the given sets.
Example 1:
Input: nums = {1,2}
Output: {0,1,2,3}
Explanation: Four distinct sums can be
calculated which are 0, 1, 2 and 3.
Example 1:
Input: nums = {1,2}
Output: {0,1,2,3}
Explanation: Four distinct sums can be
calculated which are 0, 1, 2 and 3.
Did you know?
Netflix consumes more than 15% of the world’s internet bandwidth and has subscribers in more than 190 countries.
And, if you're willing to be a part of this giant, we've something to prepare you.
Yes, we have compiled an SDE sheet with almost all questions that have been asked in Netflix interviews (& much more than that).
Check out now: https://bit.ly/3KnoE9D
Netflix consumes more than 15% of the world’s internet bandwidth and has subscribers in more than 190 countries.
And, if you're willing to be a part of this giant, we've something to prepare you.
Yes, we have compiled an SDE sheet with almost all questions that have been asked in Netflix interviews (& much more than that).
Check out now: https://bit.ly/3KnoE9D
❤4👍2
A data picker dialog is basically a UI interface ensuring a user selecting a date with a valid format from the calendar.
In this video, we are going to create a date picker using Android studio as an IDE and java as a programming language.
To watch the video, click here: https://bit.ly/3ebdwRd
In this video, we are going to create a date picker using Android studio as an IDE and java as a programming language.
To watch the video, click here: https://bit.ly/3ebdwRd
👍1
"Problem of the Day"
Solve this question to get points.
Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in a doubly-linked list whose sum is equal to given value target.
Full Problem: https://practice.geeksforgeeks.org/problems/find-pairs-with-given-sum-in-doubly-linked-list/1
Solve this question to get points.
Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in a doubly-linked list whose sum is equal to given value target.
Full Problem: https://practice.geeksforgeeks.org/problems/find-pairs-with-given-sum-in-doubly-linked-list/1
practice.geeksforgeeks.org
Find pairs with given sum in doubly linked list | Practice | GeeksforGeeks
Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in a doubly-linked list whose sum is equal to given value target.
Example 1:
Input:
1 <-> 2 <-> 4 <-> 5 <-> 6 <
Example 1:
Input:
1 <-> 2 <-> 4 <-> 5 <-> 6 <
👍2
"Problem of the Day"
Solve this question to get points.
A board of length M and width N is given. The task is to break this board into M * N squares such that cost of breaking is minimum.
Full Problem: https://practice.geeksforgeeks.org/problems/minimum-cost-to-cut-a-board-into-squares/1
Solve this question to get points.
A board of length M and width N is given. The task is to break this board into M * N squares such that cost of breaking is minimum.
Full Problem: https://practice.geeksforgeeks.org/problems/minimum-cost-to-cut-a-board-into-squares/1
practice.geeksforgeeks.org
Minimum Cost to cut a board into squares | Practice | GeeksforGeeks
A board of length M and width N is given. The task is to break this board into M * N squares such that cost of breaking is minimum. The cutting cost for each edge will be given for the board in two arrays X[] and Y[]. In
👍2
Having multiple sources of income has become a necessity these days and maintaining a balance between multiple jobs is next to impossible.
Passive Income is the answer to all your doubts. Know what it is and the best ideas to have passive income with this article.
Check out now: https://bit.ly/3ehEF54
Passive Income is the answer to all your doubts. Know what it is and the best ideas to have passive income with this article.
Check out now: https://bit.ly/3ehEF54