data structures using python quiz ANSWER KEY.pdf
54 KB
Results for "Data Structure Using Python" quiz are out. Congratulations to the Winners. 🙌
Go and check your answers with the Answer Key.
Keep Learning, Keep Participating!
Go and check your answers with the Answer Key.
Keep Learning, Keep Participating!
💩1🍌1🖕1
"Problem of the Day"
Solve this question to get points
Given a string S, the task is to count number of subsequences of the form aibjck, where i >= 1, j >=1 and k >= 1.
Full Problem: https://bit.ly/3zUZ60n
Solve this question to get points
Given a string S, the task is to count number of subsequences of the form aibjck, where i >= 1, j >=1 and k >= 1.
Full Problem: https://bit.ly/3zUZ60n
practice.geeksforgeeks.org
Count subsequences of type a^i, b^j, c^k | Practice | GeeksforGeeks
Given a string S, the task is to count number of subsequences of the form aibjck, where i >= 1, j >=1 and k >= 1.
Note:
1. Two subsequences are considered different if the set of array indexes picked for the 2 subsequences are
Note:
1. Two subsequences are considered different if the set of array indexes picked for the 2 subsequences are
React is the future of web creation with its extra versatility and ease. Building a good React project is easy if you know some amazing practices.
In this blog, we will discuss the 10 Best Practices every developer should follow to build a good React project. So let’s get started.
Read more here: https://bit.ly/3y7eHZt
In this blog, we will discuss the 10 Best Practices every developer should follow to build a good React project. So let’s get started.
Read more here: https://bit.ly/3y7eHZt
"Problem of the Day"
Solve this question to get points
Given N, the number of plots on either sides of the road. Find the total ways to construct buildings in the plots such that there is a space between any 2 buildings.
Full Problem: https://bit.ly/3O9miMF
Solve this question to get points
Given N, the number of plots on either sides of the road. Find the total ways to construct buildings in the plots such that there is a space between any 2 buildings.
Full Problem: https://bit.ly/3O9miMF
practice.geeksforgeeks.org
Count possible ways to construct buildings | Practice | GeeksforGeeks
Given N, the number of plots on either sides of the road. Find the total ways to construct buildings in the plots such that there is a space between any 2 buildings. All plots on one side of the road are continuous.
Lets suppose * represents a plot,
Lets suppose * represents a plot,
We’ve been observing a constant shift in technology and innovations in almost every part of the world.
We have come across a list of the Top 7 Software Development Trends that will work in a more drastic way in this industry. Let’s have a look at them.
Go to the link and read more: https://bit.ly/3OyHoDR
#technology #technologyinnovation #softwaredevelopment #softwaredeveloper #technologytrends
We have come across a list of the Top 7 Software Development Trends that will work in a more drastic way in this industry. Let’s have a look at them.
Go to the link and read more: https://bit.ly/3OyHoDR
#technology #technologyinnovation #softwaredevelopment #softwaredeveloper #technologytrends
"Problem of the Day"
Solve this question to get points
Consider a special family of Engineers and Doctors with following rules :
Full Problem: https://practice.geeksforgeeks.org/problems/finding-profession3834/1
Solve this question to get points
Consider a special family of Engineers and Doctors with following rules :
Full Problem: https://practice.geeksforgeeks.org/problems/finding-profession3834/1
practice.geeksforgeeks.org
Finding Profession | Practice | GeeksforGeeks
Consider a special family of Engineers and Doctors with following rules :
Everybody has two children.
First child of an Engineer is an Engineer and second child is a Doctor.
First child of an Doctor is Doctor and second child is an Engineer
Everybody has two children.
First child of an Engineer is an Engineer and second child is a Doctor.
First child of an Doctor is Doctor and second child is an Engineer
Poll of the Day!
What goes well with the error in your code? Do let us know 😆
What goes well with the error in your code? Do let us know 😆
Anonymous Poll
22%
Coffee ☕
7%
Maggie🍝
31%
A power nap 💤
5%
A trip 🛵
35%
Jo hoga, dekha jaega 😝
"Problem of the Day"
Solve this question to get points
In a city water tanks are connected by pipeline(As a tree). Since people working at the city corporation are lazy they usually select one of the tank and pour complete amount of water into it, when the tank is filled, the excess water evenly flows to the connected tanks.
Full Problem: https://bit.ly/3NmrOKK
Solve this question to get points
In a city water tanks are connected by pipeline(As a tree). Since people working at the city corporation are lazy they usually select one of the tank and pour complete amount of water into it, when the tank is filled, the excess water evenly flows to the connected tanks.
Full Problem: https://bit.ly/3NmrOKK
practice.geeksforgeeks.org
Fill the Tank | Practice | GeeksforGeeks
In a city water tanks are connected by pipeline(As a tree). Since people working at the city corporation are lazy they usually select one of the tank and pour complete amount of water into it, when the tank is filled, the excess water evenly flows to
Your weekly self-evaluation with the "Android App Development" quiz. ✅
Solve the MCQs to learn and win. You can submit your entry by 26th June, 11:59 PM IST.
Hurry and Participate Now: https://forms.gle/M4cCUHGnAiohEPzK8
Solve the MCQs to learn and win. You can submit your entry by 26th June, 11:59 PM IST.
Hurry and Participate Now: https://forms.gle/M4cCUHGnAiohEPzK8
"Problem of the Day"
Solve this question to get points
Given an array arr[] of n integers. Count the total number of sub-array having total distinct elements same as that of total distinct elements of the original array.
Full Problem: https://bit.ly/3a0eIF8
Solve this question to get points
Given an array arr[] of n integers. Count the total number of sub-array having total distinct elements same as that of total distinct elements of the original array.
Full Problem: https://bit.ly/3a0eIF8
practice.geeksforgeeks.org
Equivalent Sub-Arrays | Practice | GeeksforGeeks
Given an array arr[] of n integers. Count the total number of sub-array having total distinct elements same as that of total distinct elements of the original array.
Example 1:
Input:
N=5
arr[] = {2, 1, 3, 2, 3}
Output: 5
Expla
Example 1:
Input:
N=5
arr[] = {2, 1, 3, 2, 3}
Output: 5
Expla
"Problem of the Day"
Solve this question to get points
Given a number N, complete the following tasks,
Task 1. Generate a new number from N by changing the zeroes in the binary representation of N to 1.
Full Problem: https://practice.geeksforgeeks.org/problems/change-bits1538/1
Solve this question to get points
Given a number N, complete the following tasks,
Task 1. Generate a new number from N by changing the zeroes in the binary representation of N to 1.
Full Problem: https://practice.geeksforgeeks.org/problems/change-bits1538/1
practice.geeksforgeeks.org
Change Bits | Practice | GeeksforGeeks
Given a number N, complete the following tasks,
Task 1. Generate a new number from N by changing the zeroes in the binary representation of N to 1.
Task 2. Find the difference between N and the newly generat
Task 1. Generate a new number from N by changing the zeroes in the binary representation of N to 1.
Task 2. Find the difference between N and the newly generat
"Problem of the Day"
Solve this question to get points
Given an array A[] of N positive integers and two positive integers K1 and K2. Find the sum of all elements between K1th and K2th smallest elements of the array.
Full Problem: https://bit.ly/3Oq46OU
Solve this question to get points
Given an array A[] of N positive integers and two positive integers K1 and K2. Find the sum of all elements between K1th and K2th smallest elements of the array.
Full Problem: https://bit.ly/3Oq46OU
practice.geeksforgeeks.org
Sum of elements between k1'th and k2'th smallest elements | Practice | GeeksforGeeks
Given an array A[] of N positive integers and two positive integers K1 and K2. Find the sum of all elements between K1th and K2th smallest elements of the array. It may be assumed that (1 <= k1 < k2 <= n).
E
E
👍1
In computing, memoization is used to speed up computer programs by eliminating the repetitive computation of results, and by avoiding repeated calls to functions that process the same input.
With this article, we have tried to provide you with a complete tutorial on memoization. So, let's get started.
Read more here: https://bit.ly/3ONFVJY
With this article, we have tried to provide you with a complete tutorial on memoization. So, let's get started.
Read more here: https://bit.ly/3ONFVJY
"Problem of the Day"
Solve this question to get points
Given an positive integer N and a list of N integers A[]. Each element in the array denotes the maximum length of jump you can cover.
Full Problem: https://bit.ly/3ypaUH5
Solve this question to get points
Given an positive integer N and a list of N integers A[]. Each element in the array denotes the maximum length of jump you can cover.
Full Problem: https://bit.ly/3ypaUH5
practice.geeksforgeeks.org
Jump Game | Practice | GeeksforGeeks
Given an positive integer N and a list of N integers A[]. Each element in the array denotes the maximum length of jump you can cover. Find out if you can make it to the last index if you start at the first index of the list.
Example 1:
Input:
N =
Example 1:
Input:
N =
👍1
Attention Geeks,🤓
We are now on Reddit. 😍
Join this subreddit for Geeks from all across the globe! Let's learn and have fun together.
Waiting for you all there. 😇
Join Now: https://www.reddit.com/r/Geeks_For_Geeks?utm_medium=android_app&utm_source=share
We are now on Reddit. 😍
Join this subreddit for Geeks from all across the globe! Let's learn and have fun together.
Waiting for you all there. 😇
Join Now: https://www.reddit.com/r/Geeks_For_Geeks?utm_medium=android_app&utm_source=share
👍1
"Problem of the Day"
Solve this question to get points
Given a value N. In how many ways you can construct a grid of size N x 4 using tiles of size 1 x 4.
Full Problem: https://bit.ly/39Z7f9G
Solve this question to get points
Given a value N. In how many ways you can construct a grid of size N x 4 using tiles of size 1 x 4.
Full Problem: https://bit.ly/39Z7f9G
practice.geeksforgeeks.org
Number of ways | Practice | GeeksforGeeks
Given a value N. In how many ways you can construct a grid of size N x 4 using tiles of size 1 x 4.
Example 1:
Input: N = 1
Output: 1
Explaination: There is only one way.
Example 2:
Input: N = 4
Output: 2
Explaination: Th
Example 1:
Input: N = 1
Output: 1
Explaination: There is only one way.
Example 2:
Input: N = 4
Output: 2
Explaination: Th
This media is not supported in your browser
VIEW IN TELEGRAM
Aap bhi tyaari shuru kardo....
Geek-O-lympics 2022 coming to your computer screens on 1st July.
Stay Tuned!!
Geek-O-lympics 2022 coming to your computer screens on 1st July.
Stay Tuned!!
"Problem of the Day"
Solve this question to get points
Given an equation of the form f(n) = f(n-1) + f(n-2) where f(0) = 1, F(1) = 1 , the task is to find the nth term of this sequence.
Full Problem: https://bit.ly/3a9lt7R
Solve this question to get points
Given an equation of the form f(n) = f(n-1) + f(n-2) where f(0) = 1, F(1) = 1 , the task is to find the nth term of this sequence.
Full Problem: https://bit.ly/3a9lt7R
practice.geeksforgeeks.org
Matrix Exponentiation | Practice | GeeksforGeeks
Given an equation of the form f(n) = f(n-1) + f(n-2) where f(0) = 1, F(1) = 1 , the task is to find the nth term of this sequence.
Example 1:
Input: n = 3
Output: 3
Explanation: f(3) = f(2) + f(1) = 3
Example 2:
Example 1:
Input: n = 3
Output: 3
Explanation: f(3) = f(2) + f(1) = 3
Example 2:
👍1
Media is too big
VIEW IN TELEGRAM
Roll up your sleeves, Geeks! 🤓
Coz, this month is gonna be too much fun...
Geek-O-Lympics is NOW LIVE. 🔴
Click here to enjoy the thrilling fun: https://www.geeksforgeeks.org/geek-o-lympics/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekolympics
Coz, this month is gonna be too much fun...
Geek-O-Lympics is NOW LIVE. 🔴
Click here to enjoy the thrilling fun: https://www.geeksforgeeks.org/geek-o-lympics/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekolympics
👍1