Learn JavaScript

Home >> Learn JavaScript

Learn JavaScript

JavaScript is becoming one of the most important language day by day. Here, I have covered topics of the JavaScript Language.

Coming Soon!!



Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Java Constructors - The Coding Shala

Image
Home >> Learn Java >> Java Constructors Java Constructors We write constructor inside the class. Every class contains constructor, if we don't write constructor then the java compiler creates one by default. Constructors are used to initializing the object's state. Every time when we create a new object using a new() keyword, the constructor also called. Constructors contain instructions like methods, often it is used to assign initial values to the data members. There are two types of constructor in Java: No- argument constructor(Default Constructor) Parameterized Constructor Point to Remember:  The constructor of a class must have the same name as the class name in which it resides. A constructor cannot be abstract, final and static. Access modifiers can be used in constructors. Default Constructor or No-argument Constructor in Java A constructor that has no parameter is known as the default constructor. The default constructor provide...
Read more

Longest Common Prefix Java Solution - The Coding Shala

Home >> Interview Questions >> Longest Common Prefix Longest Common Prefix Problem: Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: ["flower","flow","flight"] Output: "fl" Example 2: Input: ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Note: All given inputs are in lowercase letters a-z. Longest Common Prefix Java Solution Approach: We will check character at every index of every string given in array if not matched then will break the loop. Java Code::  class Solution { public String longestCommonPrefix ( String [] strs ) { int len = strs . length ; if ( strs == null || len == 0 ) return "" ;...
Read more

Anti Diagonals - The Coding Shala

Image
Home >> Interview Questions >> Anti Diagonals Anti Diagonals Java Solution Give an N*N square matrix, return an array of its anti-diagonals. Look at the example for more details. Example: Input: 1 2 3 7 8 9 4 5 6 Return the following : [ [1], [2, 4], [3, 5, 7], [6, 8], [9] ] Input : 1 2 3 4 Return the following : [ [1], [2, 3], [4] ] Anti Diagonals Java Solution 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 public class Solution { public ArrayList < ArrayList < Integer >> diagonal ( ArrayList < ArrayList < Integer >> A ) { ArrayList < ArrayList < Integer >> ans = new ArrayList < ArrayList < Integer >>(); int N = A . size (); int i = N - 1 ; while ( i >= 0 ){ ArrayList < Integer > tmp = new ArrayList < Integer >(); ...
Read more

Spiral Order Matrix II - The Coding Shala

Image
Home >> Interview Questions >> Spiral Order matrix 2 Spiral Order Matrix II Problem Solution Given an integer n, generate a square matrix filled with elements from 1 to n 2  in spiral order. Example: Given n = 3, You should return the following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ] Solution: (Java) The concept is the same as how to print the Spiral Order Matrix. Approach: Let's see for n= 4, then numbers will come from 1 to 16(n*n) in the matrix. As we need to insert numbers in spiral order so here we need 4 things to check, first and last column and top and bottom row. The following four steps we need to do: First, we need to insert numbers in the top row. Our loop will go from the left column to the right then will increase the top row by one and now the top is our second row. Now we are inserting the numbers in the right column, will start the loop from top to bottom, and then decrease the value of the right ...
Read more

Time Complexity, Space Complexity, Asymptotic Notations - The Coding Shala

Image
Home >> Algorithms >> Time and space complexity Time Complexity, Space Complexity, and Asymptotic Notations Time complexity describes the time taken by an algorithm and space complexity describes the memory used by an algorithm. Asymptotic Notations are languages that allow us to calculate time complexity and space complexity. Big O is most commonly used for time complexity or analysis of algorithms. Time Complexity In Computer Science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients and lowers order terms.[From Wikipedia] In a simple way we can say how much time our code takes to execute.  So, How to calculate the running time of an algorithm? We can have three cases to analyze an algorithm: Worst Case Average Case Best C...
Read more