Logan, Author at Only Code

Ciel and Receipt Solution

Tomya like a positive integer p, and now she wants to get a receipt of Ciel’s restaurant whose total price is exactly p. Note that the i-th menu has the price 2i-1 (1 ≤ i ≤ 12). Find the minimum number of menus whose total price is exactly p.

Competitive Programming, Greedy approach

Root to leaf path – LeetCode Solution [Easy]

Root to leaf path problem statement is:
Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children.

Trees

Jump game – LeetCode Solution [Medium]

You are given an integer array nums. You are initially positioned at the array’s first index, and each element in the array represents your maximum jump length at that position.

Arrays, Competitive Programming

Find maximum of all subarrays of size k

Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k.

Arrays, Competitive Programming, Interview Questions

Machine Learning | Multiple Linear Regression

In the last post we learnt about Linear regression with one variable. What if, we have more than one independent variables or features. As we could see, with more independent variables, our model exactly fits the training data.

Machine Learning

Python Machine Learning Libraries

Python has several ML libraries but major libraries that are used are the following:
Numpy, Scikit-Learn, Pandas..

Machine Learning, Python

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.

Machine Learning

Assembly-Line Scheduling

Assembly line scheduling is a classic problem in production optimization, often encountered in manufacturing industries.

Dynamic Programming

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.

Java

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.

Interview Questions, Trees