Count-ways-reach-nth-stair-using-step-1-2

Count-ways-reach-nth-stair-using-step-1-2

Code:

public class Main{
static int fib(int n)
{
if(n<=1)
return n;
return fib(n-1)+fib(n-2);
}
static int ways(int n)
{
return fib(n+1);
}
public static void main(String[] args) {
System.out.println("count-ways-reach-nth-stair-using-step-1-2:"+ways(8));

}
}

Output: count-ways-reach-nth-stair-using-step-1-2:8

#tcs nqt question

count-ways-reach-nth-stair-using-step-1-2:8

Comments

Naming Convention

Naming Convention : A naming convention is a convention for naming things: Please find below the table for naming conventions: Naming Convention Format Example Camel Case camelCase 🐪aBcD Kebab Case kebab-case 🍢a-b-c-d Snake Case snake_case 🐍a_b_c_d Pascal Case PascalCase 🧑‍🦳AbCd Flat Case flatcase 📏abcd Upper Flat Case UPPERFLATCASE ABCD Screaming Snake Case SCREAMING_SNAKE_CASE 🐍A_B_C_D Camel Snake Case camel_Snake_Case 🐪🐍ab_Cd Pascal Snake Case Pascal_Snake_Case Ab_Cd Train Case Train-Case 🚃Ab-Cd Cobol Case COBOL-CASE 🍢AB-CD

Fibonacci series

Fibonacci series Code: import java.util.Scanner; class Main{ public static void main(String anyVar[]){ Scanner sc=new Scanner(System.in); System.out.println("Enter any number till that yu want Fibonacci series:"); int num=sc.nextInt(); System.out.println("Fibonacci series till "+num+"is as follows:"); int num1=1,num2=1,num3=0; for(int i=0;i<num;i++){ if(i==0||i==1) System.out.print(1); else{ //Fibonacci number is sum of previous two Fibonacci number num3=num1+num2; num1=num2; ...

NVL

NVL: The NVL function allows you to replace null values with a default value. Simple explanation: if( first parameter's value==null ) then return second parameter value if( first parameter's value!=null) then return first parameter as is Example: nvl("xyz","")---->return xyz nvl(null,'xyz') ------------>return xyz

Vishakha Umale

Search This Blog