Python Machine Learning Libraries
Python has several ML libraries but major libraries that are used are the following:
Numpy, Scikit-Learn, Pandas..
Introduction to Machine Learning | Linear Regression
Linear regression is a linear approach to modeling the relationship between a scalar response (or dependent variable) and one or more independent variables.
Assembly-Line Scheduling
Assembly line scheduling is a classic problem in production optimization, often encountered in manufacturing industries.
String in Java
Implementing strings as a built-in objects allows Java to provide a full complement of features that makes string handling in Java very convenient. For example, Java provide various methods to modify a string object like methods to compare two strings, search for a substring, or concatenate two strings etc.
Lowest Common Ancestor in a Binary Tree in C++
The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants.
Best Time to Buy and Sell Stock [Interview Question]
You are given an array prices where prices[i] is the price of a given stock on the ith day. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Determine if two trees are same in C++ – LeetCode Solution [Easy]
Given the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and each identical node has the same value.
Find the Minimum Depth of Binary Tree in C++ – LeetCode Solution [Easy]
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
Note: A leaf is a node with no children.
Convert Sorted Array to Binary Search Tree in C++ – LeetCode Solution [Easy]
Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.
Add Binary numbers in C++ – LeetCode Solution [Easy]
This problem could be solved in O(N) time complexity, where N is the maximum of the given two strings length. We could start traversing the two strings from the last and keep calculating the sum of each string’s character ie ‘0’ and ‘1’. If there’s a carry propagate it to the sum of the next digits in iteration.