CampusX Data Science Mentorship Program 2022-23 - Task 5 Solutions | Paid Members | Data Science Mentorship Program (DSMP) 2022-23

🔖 *Chapters:* 📝 *Topic 0 - Session start* 00:00:00 - Session start 📝 *Topic 1 - Tuples* 00:00:10 - 1. Join Tuples if similar initial element 00:05:52 - 2. Multiply Adjacent elements (both side) and take sum of right and lest side multiplication result. 00:09:56 - 3. Check is tuples are same or not? 00:13:19 - 4. Count no of tuples, list and set from a list. 00:16:52 - 5. Shortlist Students for a Job role. 📝 *Topic 2 - Sets* 00:26:24 - 1. Write a program to find set of common elements in three lists using sets. 00:29:53 - 2. Write a program to count unique number of vowels using sets in a given string. Lowercase and uppercase vowels will be taken as different. 00:31:47 - 3. Write a program to Check if a given string is binary string of or not. 00:33:18 - 4. find union of n arrays. 00:34:22 - 5. Intersection of two lists. Intersection of two list means we need to take all those elements which are common to both of the initial lists and store them into another list. Only use using list-comprehension. 📝 *Topic 3 - Dictionary* 00:35:48 - 1. Key with maximum unique values. 00:39:10 - 2. Replace words from Dictionary. Given String, replace it’s words from lookup dictionary. 00:41:24 - 3. Convert List to List of dictionaries. Given list values and keys list, convert these values to key value pairs in form of list of dictionaries. 00:44:21 - 4. Convert a list of Tuples into Dictionary. 00:45:54 - 5. Sort Dictionary key and values List. Code - https://colab.research.google.com/drive/17h1BUmK2qb9YZCCZKhUXsf6hRJuO42_t?usp=sharing