Problem link: https://www.codechef.com/problems/LUCKY10

Problem in short:

You are given two strings A and B consisting of digits 0 to 9 and of length n. You create a string C from A and B as follows:

• Re-order the strings A and B in any way you want.
• i-th digit of C is given by C[i] = max{A[i], B[i]}.
• Remove all digits from C that are not 4 or 7.

You want to find the string C which is the lexicographically greatest possible string among all the strings that can be obtained from the given strings A and B by the described process.

Constraints:

• n <= 20,000
• Number of test cases T <= 10,000
• Sum of n over all test cases <= 200,000

In this course, we will learn about data visualization with Python using the matplotlib and seaborn libraries.

Prerequisites: Python, Statistics

This course consists of tutorials, coding exercises and real-world projects to learn natural language processing.

Natural language processing comprises of a set of computational techniques to understand natural languages such as English, Spanish, Chinese, etc.

Primary objectives of ...

In the previous course, Foundations of Machine Learning you already learnt about the core machine learning concepts as well as the linear regression and gradient descent algorithms. In this course, you will learn various other machine learning algorithms, both for supervised learning as well as unsupervised learning.

Prerequisites: Foundations of Machine Learning

This comprehensive Data Science Career Path takes you from being a complete beginner all the way to a data scientist. After completing this path, you'll be ready to analyze real-world datasets in Python and deliver valuable insights. All the required background, such as Python, linear algebra, probability, etc is included in this path.

Key Features of the Career Path

1. 10+ portfolio projects and 300+ exercises to give you a lot of practice and build fluency.
2. Most of the tutorials are available in three different formats — video, long article and bite-sized cards — so you can learn the way that works best for you.
3. Articles and videos have code execution built-in. You can play the instructor's code right inside the video!
4. Exceptional content quality. We teach you the real thing, no dumbing things down or only talking about...

In this course, we will start by learning what machine learning is, and introduce a simple learning algorithm: linear regression + gradient descent. Using this algorithm, we'll introduce the core concepts in machine learning: model parameters, cost function, optimization method, and overfitting and regularization. This course ends with a visual review of these concepts and a tutorial on the different types of machine learning problems.

In this course, we will learn about databases and SQL, used for storing and managing data used in computer systems. We'll also look at map reduce, a programming model that allows us to perform parallel processing on large data sets in a distributed environment. As always, the tutorials will be interleaved with quizzes and hands-on assignments.

This course consists of two end-to-end data science projects. The last tutorial contains a list of 10 project ideas (including datasets and suggested algorithms). It is recommended that you do at-least one end-to-end project as part of the course.