Machine Learning Projects
creating smart machines...
Machine Learning Projects
creating smart machines...
Python Program to Check if a Number is Odd or Even – 2024
Python Program to Check if a Number is Positive, Negative or 0 – 2024
Python Program to Convert Celsius To Fahrenheit – 2024
Python Program to Convert Kilometers to Miles – 2024
Python Program to Generate a Random Number – 2024
Python Program to Swap Two Variables – 2024
Python Program to Solve Quadratic Equations – 2024
Python Program to Calculate the Area of a Triangle – 2024
Python Program to Find the Square Root – 2024
Python Program to Add Two Numbers – 2024
Python Program to print Hello World! – 2024
[Solved] A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise.
[Solved] Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time.
[Solved] You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123. Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.
[Solved] Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.
[Solved] A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node’s values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path.
[Solved] You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day. Find and return the maximum profit you can achieve.
[Solved] You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.