About Us

By

KULDEEP LUVANI

The simplest and most powerful programming language, I’ve ever used! I cannot imagine what if I lose Python forever. I still remember my first python tutorial on Codecademy. As an electronic engineer, I have not used Python for Machine Learning and Algorithm development. I clearly memorize the way I learn python and used it in competitive coding platforms like Hackerrank, Leetcode, Codefight and Project Euler. Almost all my machine learning related work, programming assignments, and even my research works are done with Python.

Find me on https://kuldeepluvani.github.io



MANTHAN VAGHASIYA

I am a Computer Science student who is enthusiastic about  Machine Learning, Data Science, Natural Language Processing, and Algorithms. I always love to solve complex and challenging coding problems with different approaches. My journey with Python has been smooth but full of challenges. By the way, did I tell you that I looove challenges? I have used Python for various purposes, i.e. Competitive coding, Machine Learning, Website development, API development. 

Thank you, for visiting our site.

Find me on LinkedIn

Comments

Post a Comment

Best Programming language for machine learning.

Popular posts from this blog

Hackerrank - Implementation - Picking Numbers

By
Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is  . Input Format The first line contains a single integer,  , denoting the size of the array. The second line contains   space-separated integers describing the respective values of  . Constraints The answer will be  . Output Format A single integer denoting the maximum number of integers you can choose from the array such that the absolute difference between any two of the chosen integers is  . Sample Input 0 6 4 6 5 3 3 1 Sample Output 0 3 Explanation 0 We choose the following multiset of integers from the array:  . Each pair in the multiset has an absolute difference   (i.e.,   and  ), so we print the number of chosen integers,  , as our answer. Sample Input 1 6 1 2 2 3 1 2 Sample Output 1 5
Read more

Hackerrank - Graph Theory - Even Tree

By
Image
You are given a tree (a simple connected graph with no cycles). The tree has   nodes numbered from   to   and is rooted at node  . Find the maximum number of edges you can remove from the tree to get a  forest  such that each connected component of the forest contains an even number of nodes.
Read more

Hackerrank - Dynamic Programming - The Coin Change Problem

By
You have   types of coins available in infinite quantities where the value of each coin is given in the array  . Can you determine the number of ways of making change for   units using the given types of coins? For example, if  , and  , we can make change for   units in three ways:  ,  , and  . Given  ,  , and  , print the number of ways to make change for   units using any number of coins having the values given in  . Input Format The first line contains two space-separated integers describing the respective values of   and  .  The second line contains   space-separated integers describing the respective values of   (the list of distinct coins available in infinite amounts). Constraints Each   is guaranteed to be distinct. Hints Solve overlapping subproblems using  Dynamic Programming  (DP):   You can solve this problem recursively but will not pass all the test cases without optimizing to eliminate the  overlapping subproblems . Think of a way
Read more