Cheat Sheet For Developers

 MSAL  node --version , command to check the latest version of angular  npm install -g @angular/cli                         ng new msal-angular-tutorial --routing=true --style=css --strict=false    cd msal-angular-tutorial                         npm install @angular/material @angular/cdk           npm install @azure/msal-browser @azure/msal-angular ng generate component home                        ng generate component profile                  The next Step is to register the application

Regions , Zones and Edge Location ? Region is the geographic location, where the data centers are available. A Region has atleast two availability zones.  The  availability zone  refers to an isolated  data center   Global vs Regional vs Zonal Resources  ?  portal.azure.com  is the url  Azure Cloud shell, in the cloud shell there are two language of choice, i.e. the BASH and POWERSHELL , on windows you need powershell 7, the default windows powershell does not  have the azure SDK install module  PS C:\WINDOWS\system32> Install-Module -Name Az update module  So the powershell commands are like  Get-Module to get the Module details, Install-Module to install the module and Update-Module to update the module, followed by the -Name and the SDK to be installed   How to login into the Azure using the command line either bash or powershell  using bash how to login   az login -u $username -p $password az --help a...

 What is the difference between the Access key and the Secret ?  How to do an POC on Alexa? for this you need an developer account in the application -  https://developer.amazon.com/

Commands  .\gradlew bootrun   --args='--server.port=8888'    to change the port number in the bootrun Spring  1. What is dependency injection 2. What is inversion of control 3. What is the role of IOC Container 4. Spring bean life cycle 5. What is ApplicationContext - IOC Conatiner, in addition it provide like AOP, internationalization, web application features 6. What is Beanfactory  - IOC conatiner, but only basic features (Memory constraint)  7. How to define application context? using java @Configuration  or XML . AnnotationConfigApplicationContext   8. for junit how to create the context configuration ?  using @Runwith() and @ContextConfiguration  9. What is the ComponentScan ?  @Component, find where the components are, @Componentscan using the basePackages to search in the package. 10. @SpringBootApplication ?  this will initaite the conponentscan within package or subpackages, if we need to explicitly ...

Recursion   Recursion basically is function calling itself, when you call a function - from another function i.e functionA() calling functionB() or functionC() calling itself, it will create an stack, and the idea of calling functionX() is basically solving the smaller problems or solving the problems with small use case or inputs. Recursion technique is widely used if you want to Break the problem into small usecases and use the result or the output of the usecase to solve the larger problem.  lets take an example - Factorial of the number n! ? the nth factorial would be        n!= n * (n-1)! example  5! = 5 * 4!  Different Algorithms where the recursion is used extensively 1. Divide and Conquer 2. Backtracking 3. Tree Data structure - iteration   Common Steps of recursion    The first step is to identify the Base case , The base case defines the edge case or the smallest part of the problem, beyond which you cannot break...

Difference between substring and subsequence ? substring is continuous, while subsequence is not continuous   1. Longest Palindrome Substring - example -   ababd Approach 1. Brute force -  create all the substring, so create the substring of length 1 , length 2 , length 3, length 4 , and length 5. and then check for the string that has the maximum length .  Time complexity is O(N^3)  2. Decision Tree -    return max(count,          max(longestPalindromic(str, i + 1 , j, 0 ), longestPalindromic(str, i, j - 1 , 0 ))); 3. Dynamic programming using the TABULAR Approach   for d = 0; d < noOfRowSize; d++  // Row major      for i =0, j = d; i < noOfRowsSize, j < noOfColumnsSize ; i++ , j++         if (i == j || d i.e. Diagonal is Zero ) // that means they are equal               DP[i][j] = 1 ...