Tech Jargon - Decoded

رفتن به کانال در Telegram

Confused by tech terms? Don’t worry, we’ve got you 🤝 We make things simple, one concept at a time. Learn daily Easy & clear Turn Confusion into clarity. #tech #it #softwareengineer #cs #development

نمایش بیشتر

الهند99 679 فناوری و برنامه‌ها31 078

2 015

مشترکین

-224 ساعت

-67 روز

-4130 روز

137

نمایش های پست

اطلاعاتی وجود ندارد24 ساعت

اطلاعاتی وجود ندارد48 ساعت

6.80%

نرخ مشارکت

اطلاعاتی وجود ندارد

پست های در روز

Ads index

beta

آرشیو پست ها

2 015

🔥🔥Portronics Key7 Combo Wireless Keyboard & Mouse Set 🎁 Deal Price : ₹796 Buy Here : https://amzn-to.co/TPV08i

2 015

🔥🔥Roadster Women Navy Blue Solid Hooded Sweatshirt 🎁 Deal Price : ₹389 Buy Here : https://myntr.in/vT7qM5 More : https://myntr.in/GtrHTj

2 015

🔥🔥RED TAPE Men Low-Top Lace-Up Sneakers 🎁 Deal Price : ₹1,188 Buy Here : https://ajiio.co/4JmOVA More : https://ajiio.co/qj4sFP

2 015

🔥🔥THE INDIAN GARAGE CO Slim Fit Chinos with Insert Pockets 🎁 Deal Price : ₹607 Buy Here : https://ajiio.co/3nrxHT More : https://ajiio.co/nGtbQ5

2 015

realme Buds Wireless 3 Neo in Ear Bluetooth Neckband ✔️Offer Price: ₹999 ❌Regular Price: ₹1300 🔗Buy here: https://amzn-to.co/ukhj6u Grab Faster🛒

2 015

🔥🔥 AJIO : Upto 70% Off On Netplay Clothing 🔠 Shirts : https://ajiio.co/TNCAsQ 🔠 Sweaters : https://ajiio.co/JCLnBS 🔠 Sweatshirt : https://ajiio.co/OL1b4k 🔠 T-Shirts : https://ajiio.co/F4nVO0 🔠 Trousers : https://ajiio.co/4Umwrr 🔠 Jackets : https://ajiio.co/Hx08aI

2 015

🔥🔥AJIO : Upto 82% Off On RED TAPE Men's Shoes Buy Here : https://ajiio.co/o3Kdvs

2 015

Hey Everyone👋, Hope all are doing well, After researching a lot about what course to suggest for my channel members i have came through with this course, Full Stack Java Developer by iNeuron. The course is very well structured and at last you will get trained enough for the company needs, the cost for the course is also affordable. You can get a 10% discount by enrolling through below link

2 015

23/02/24

// Program to check wheather a string is palindrome or not
class Palindrome{
    public static void main(String args[])
    {
        String str="mam";
        System.out.println(isPalindrome(str));
    }
    public static boolean isPalindrome(String str){
        int left=0;
        int right=str.length()-1;
        while(left<right){
            if(str.charAt(left)!=str.charAt(right)){
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
}

2 015

17/02/24 Leetcode 31. Next Permutation https://leetcode.com/problems/next-permutation/

uploaading

2 015

17/02/24 Leetcode 881. Boats to Save People https://leetcode.com/problems/boats-to-save-people/

class Solution {
    public int numRescueBoats(int[] people, int limit) {
        int left=0;
        int right=people.length-1;
        int boatCount=0;
        Arrays.sort(people);
        while(left<=right)
        {
            if(people[left]+people[right]<=limit){
                left++;
            }
            right--;
            boatCount++;
        }
        return boatCount;
    }
}

2 015

Given an array consisting of only 0s, 1s, . The task is to sort the given array. The solution should put all 0s first, then all 1s at last

uploading

2 015

15/02/24 Leetcode 167. Two Sum II - Input Array Is Sorted https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ Brute force approach

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] index=new int[2];
         for (int i = 0; i < numbers.length; i++) {
            for (int j = i + 1; j < numbers.length; j++) {
                if (numbers[i] + numbers[j] == target) {
                  index[0]=i+1;
                  index[1]=j+1;
                }
            }
        }
                return index;
    }
}

Efficient approach

uploading

2 015

14/02/24 Leetcode 26. Remove Duplicates from Sorted Array https://leetcode.com/problems/remove-duplicates-from-sorted-array/

class Solution {
    public int removeDuplicates(int[] nums) {
        int uniqueIndex=0;
        for(int i=1;i<nums.length;i++)
        {
            if(nums[i-1]!=nums[i])
            {
                uniqueIndex++;
                nums[uniqueIndex]=nums[i];
            }
        }
        return uniqueIndex+1;
    }
}

2 015

14/02/24 Leetcode 54. Spiral Matrix https://leetcode.com/problems/spiral-matrix/

uploading

2 015

13/02/24 Leetcode 48. Rotate Image https://leetcode.com/problems/rotate-image/

uploading

if anyone solved send solution to this username👇

2 015

//Program to rotate a 2D array clockwise

class RotateMatrix {
    public static void main(String args[]) {
        int[][] matrix = {
            {1, 2, 3},
            {4, 5, 6},
            {7, 8, 9}
        };
        
        rotate(matrix);
        
        
    }

    public static void rotate(int[][] matrix) {
        int n = matrix.length;
        int[][] rotatedMatrix = new int[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                rotatedMatrix[j][n - 1 - i] = matrix[i][j];
            }
        }
        // Copy rotatedMatrix back to matrix
        // Print the rotated matrix
        for (int[] row : rotatedMatrix) {
            for (int element : row) {
                System.out.print(element + " ");
            }
            System.out.println();
        }
    }
}

2 015

12/02/24 Leetcode 73-Set Matrix Zeroes https://leetcode.com/problems/set-matrix-zeroes/

Code will be uploaded within evening

If anyone have solved send the program to this username👇

2 015

Leetcode 857 -Transpose of a matrix

class Solution {
    public int[][] transpose(int[][] matrix) {
        int rows=matrix.length;
        int cols=matrix[0].length;
        int[][] transpose=new int[cols][rows];
        for(int i=0;i<rows;i++){
            for(int j=0;j<cols;j++){
                transpose[j][i]=matrix[i][j];
            }
        }
        return transpose;
    }
}

2 015

// Program for multiplication of two matrices
class MatrixMultiplication{
    public static void main(String args[]){
        int[][] arr1={
            {1,2,3},
            {4,5,6},
            {7,8,9}
        };
        int[][] arr2={
            {7,8,9},
            {4,5,6},
            {1,2,3}
        };
        int rows1=arr1.length;
        int cols1=arr1[0].length;
        int rows2=arr2.length;
        int cols2=arr2[0].length;
        if(cols1 != rows2){
            System.out.println("Matrix cannot be multiplied");
        }
        else{
            int[][] res=new int[rows1][cols2];
            for(int i=0;i<rows1;i++){
                for(int j=0;j<cols2;j++){
                    int sum=0;
                    for(int k=0;k<cols1;k++){
                        sum=sum+arr1[i][k]*arr2[k][j];
                    }
                    res[i][j]=sum;
                 }
            }
            System.out.println("Resultant matrix is:");
            for(int i=0;i<rows1;i++){
                for(int j=0;j<cols2;j++){
                    System.out.print(res[i][j]+" ");
                }
                System.out.println();
            }
        }
    }
}