โผ๏ธ USEFUL SITES TO MAKE YOUR WORK EASIER โผ๏ธ
1. Media.io โ Online Free File Converter, Editor, Compressor
2. https://alternativeto.net/ - Lacks of softwares
3. https://geektyper.com/mobile/ - Pretend to be a hacker
4. http://Leetcode.com/ - Practice your coding skills
5. https://www.privacytools.io/ - Amazing site for privacy tools
6. http://Rainymood.com/ - Amazing site for Rainy & Thunderstorm sounds (to listen while sleeping)
๐Unmute Notification & Share Channel For More Content โ
1. Media.io โ Online Free File Converter, Editor, Compressor
2. https://alternativeto.net/ - Lacks of softwares
3. https://geektyper.com/mobile/ - Pretend to be a hacker
4. http://Leetcode.com/ - Practice your coding skills
5. https://www.privacytools.io/ - Amazing site for privacy tools
6. http://Rainymood.com/ - Amazing site for Rainy & Thunderstorm sounds (to listen while sleeping)
๐Unmute Notification & Share Channel For More Content โ
๐5โค2
Various types of test used in statistics for data science
T-test: used to test whether the means of two groups are significantly different from each other.
ANOVA: used to test whether the means of three or more groups are significantly different from each other.
Chi-squared test: used to test whether two categorical variables are independent or associated with each other.
Pearson correlation test: used to test whether there is a significant linear relationship between two continuous variables.
Wilcoxon signed-rank test: used to test whether the median of two related samples is significantly different from each other.
Mann-Whitney U test: used to test whether the median of two independent samples is significantly different from each other.
Kruskal-Wallis test: used to test whether the medians of three or more independent samples are significantly different from each other.
Friedman test: used to test whether the medians of three or more related samples are significantly different from each other.
T-test: used to test whether the means of two groups are significantly different from each other.
ANOVA: used to test whether the means of three or more groups are significantly different from each other.
Chi-squared test: used to test whether two categorical variables are independent or associated with each other.
Pearson correlation test: used to test whether there is a significant linear relationship between two continuous variables.
Wilcoxon signed-rank test: used to test whether the median of two related samples is significantly different from each other.
Mann-Whitney U test: used to test whether the median of two independent samples is significantly different from each other.
Kruskal-Wallis test: used to test whether the medians of three or more independent samples are significantly different from each other.
Friedman test: used to test whether the medians of three or more related samples are significantly different from each other.
๐4โค2
Type of problem, while solving DSA problem in Array
โ There are many types of problems that can be solved using arrays and different techniques in Data Structures and Algorithms. Here are some common problem types and techniques that you might encounter:
๐. ๐๐ฅ๐ข๐๐ข๐ง๐ ๐ฐ๐ข๐ง๐๐จ๐ฐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are given an array and a window size, and you have to find a subarray of that size that satisfies certain conditions. You can use a sliding window technique to efficiently search through the array by maintaining a current window of fixed size and updating it as you move forward.
๐. ๐๐ฐ๐จ ๐ฉ๐จ๐ข๐ง๐ญ๐๐ซ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you use two pointers to traverse the array from both ends and find a certain pattern or condition. For example, you can use two pointers to find a pair of elements that sum up to a target value, or to reverse an array.
๐. ๐๐จ๐ซ๐ญ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to sort an array in a certain way, such as in ascending or descending order, or according to certain criteria such as frequency or value. You can use sorting algorithms such as merge sort or quick sort to efficiently sort the array.
๐. ๐๐๐๐ซ๐๐ก๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to find a specific element in the array or to search for a certain pattern. You can use searching algorithms such as binary search or linear search to efficiently search through the array.
๐. ๐๐ฎ๐๐๐ซ๐ซ๐๐ฒ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to find a contiguous subarray that satisfies certain conditions. You can use techniques such as prefix sum or Kadane's algorithm to efficiently find the subarray with the maximum sum.
๐. ๐๐จ๐ฎ๐ง๐ญ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to count the occurrences of certain elements or to count the number of subarrays or subsequences that satisfy certain conditions. You can use techniques such as hashing or dynamic programming to efficiently count the occurrences or number of subarrays.
โ There are many types of problems that can be solved using arrays and different techniques in Data Structures and Algorithms. Here are some common problem types and techniques that you might encounter:
๐. ๐๐ฅ๐ข๐๐ข๐ง๐ ๐ฐ๐ข๐ง๐๐จ๐ฐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are given an array and a window size, and you have to find a subarray of that size that satisfies certain conditions. You can use a sliding window technique to efficiently search through the array by maintaining a current window of fixed size and updating it as you move forward.
๐. ๐๐ฐ๐จ ๐ฉ๐จ๐ข๐ง๐ญ๐๐ซ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you use two pointers to traverse the array from both ends and find a certain pattern or condition. For example, you can use two pointers to find a pair of elements that sum up to a target value, or to reverse an array.
๐. ๐๐จ๐ซ๐ญ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to sort an array in a certain way, such as in ascending or descending order, or according to certain criteria such as frequency or value. You can use sorting algorithms such as merge sort or quick sort to efficiently sort the array.
๐. ๐๐๐๐ซ๐๐ก๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to find a specific element in the array or to search for a certain pattern. You can use searching algorithms such as binary search or linear search to efficiently search through the array.
๐. ๐๐ฎ๐๐๐ซ๐ซ๐๐ฒ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to find a contiguous subarray that satisfies certain conditions. You can use techniques such as prefix sum or Kadane's algorithm to efficiently find the subarray with the maximum sum.
๐. ๐๐จ๐ฎ๐ง๐ญ๐ข๐ง๐ ๐ฉ๐ซ๐จ๐๐ฅ๐๐ฆ๐ฌ: In these problems, you are asked to count the occurrences of certain elements or to count the number of subarrays or subsequences that satisfy certain conditions. You can use techniques such as hashing or dynamic programming to efficiently count the occurrences or number of subarrays.
๐11โค3
Bard AI by Google is finally out ๐
Try it here: https://bard.google.com
Bard AI python API : https://github.com/dsdanielpark/BARD_API
Try it here: https://bard.google.com
Bard AI python API : https://github.com/dsdanielpark/BARD_API
Gemini
Google Gemini
Meet Gemini, Googleโs AI assistant. Get help with writing, planning, brainstorming, and more. Experience the power of generative AI.
๐3