Stock Buy Sell Maximum Profit Solution
The cost of a stock on each day is given in an array. Each day, you can either buy one share, sell any number of shares that you own, or not make any transaction at all.
Rectangular Game Solution
You are given an infinite 2d grid with the bottom left cell referenced as (1,1). All the cells contain a value of zero initially. Let’s play a game?
The game consists of N steps wherein each step you are given two integers a and b.
Hotel Bytelandia Solution
Hotel Bytelandia Solution – A number of guests have made reservations. Each reservation consists of an arrival time, and a departure time
Carvans Solution
You’re given the maximum speed of N cars in the order they entered the long straight segment of the circuit. Each car prefers to move at its maximum speed. If that’s not possible because of the front car being slow, it might have to lower its speed. It still moves at the fastest possible speed while avoiding any collisions.
How to crawl Instagram data using its public API and Python?
In 2022, the official Instagram API allow you to access only your own posts and not even public comments and posts on Instagram because of the rising privacy concerns from the users and frequent accusations of data-breach at many big companies including Facebook. This has made it difficult for programmers to crawl Instagram data.
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.
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.
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.
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.
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.