Your Tech querries at Technical world

 fibaonaci series using dp class Solution { public int usingDp ( int n , int dp []) { if (n <= 1 ) return n ; if (dp[n] != - 1 ) return dp[n]; return dp[n] = usingDp (n - 1 ,dp) + usingDp (n - 2 ,dp); } public int fib ( int n ) { int [] dp = {n + 1 , - 1 }; int no = usingDp (n, dp); return no; } } TC = o(n) linear SC = o(n)+o(n) {array, stack space for recur}

 Wissen only ---------------- "1.reverse the string code import java.util.*; import java.lang.*; class  main{      public static String reverseString(String str) {   String s[] = str.split(" ");   StringBuilder reverse = new StringBuilder();   int n = s.length;   for(int i=n-1;i>=0;i-- )   {     reverse.append(s[i]).append(" ");   }   return reverse.toString();    } public static void main (String[] args) {       Scanner sc = new Scanner(System.in);   String input = sc.nextLine();   System.out.println(reverseString(input));     } } 2.spring boot working 3.create db for user and group and perform different operations using joins CREATE TABLE Users (     UserID INT PRIMARY KEY,     UserName VARCHAR(50),     GroupID INT,     FOREIGN KEY (GroupID) REFERENCES Groups(GroupID) ); -- Create table for groups CREATE TABLE Groups (   ...

 1 two sum class Solution {     public int [] twoSum ( int [] nums , int target ) {         int n = nums . length ;         /*         HashMap<Integer,Integer> mpp = new HashMap();         for(int i=0;i<n;i++)           mpp.put(nums[i],i);         int [] ans = {-1,-1};         int low =0;         int high = n-1;          Arrays.sort(nums);         while(low < high)         {             int sum = nums[low] + nums[high];             if(sum==target)             {                 ans[0] = mpp.get(nums[low]);                 ans[1] = mpp.get(nums[high]);   ...