Programming

Container With Most Water

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Note: You may not slant the container and n is at least 2. Example: …

Container With Most Water Read More »

Check If It Is a Straight Line

You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a straight line in the XY plane. Example 1: Input: coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]] Output: true Example 2: Input: coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]] Output: false Constraints: 2 <= coordinates.length <= 1000 coordinates[i].length == 2 -10^4 <= coordinates[i][0], coordinates[i][1] <= 10^4 coordinates contains …

Check If It Is a Straight Line Read More »

First Bad Version

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versions [1, 2, …, n] and you want to …

First Bad Version Read More »

Callback functions in JavaScript

Hi friends! In this article we going to learn about Callback functions in JavaScript with several examples. Callback functions is also called higher order functions. In JavaScript functions are called as first class objects. We can pass object to function as an argument. We can also pass other functions into function as an argument, to …

Callback functions in JavaScript Read More »

Minimum Remove to Make Valid Parentheses

Introduction In this article, we will see about Minimum Remove to Make Valid Parentheses. We have to remove the minimum number of parentheses to make a string with valid parentheses. BACKGROUND Day 15 of 100 Days of Leetcode Programming Challenge. This problem tests our knowledge in the Stack data structure. LANGUAGE I took C# programming language …

Minimum Remove to Make Valid Parentheses Read More »

Look and Say (Count and Say) Sequence

Day 10 Find the nth term in Count and Say Sequence. The Count and Say sequence is the sequence of below integers: “1” “11” “21” “1211” “111221” “312211” “13112221” “1113213211” “31131211131221” “13211311123113112211” “11131221133112132113212221” “3113112221232112111312211312113211” “1321132132111213122112311311222113111221131221” “11131221131211131231121113112221121321132132211331222113112211” “311311222113111231131112132112311321322112111312211312111322212311322113212221” For example: If you have “1”, the next line is “11”. If you have “11”, the next line …

Look and Say (Count and Say) Sequence Read More »