๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.6K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
class Node:
    def init(self, val):
        self.val = val
        self.left = None
        self.right = None

class BST:
    def init(self, val):
        self.root = Node(val)

    def insert(self, val):
        curr = self.root
        while True:
            if val < curr.val:
                if curr.left is None:
                    curr.left = Node(val)
                    break
                else:
                    curr = curr.left
            else:
                if curr.right is None:
                    curr.right = Node(val)
                    break
                else:
                    curr = curr.right

    def max_path_sum(self, node):
        if node is None:
            return 0
        left_sum = self.max_path_sum(node.left)
        right_sum = self.max_path_sum(node.right)
        return node.val + max(left_sum, right_sum)

def max_path_sum_after_inserting(A):
    bst = BST(A[0])
    max_sum = bst.max_path_sum(bst.root)
    for i in range(1, len(A)):
        bst.insert(A[i])
        max_sum = max(max_sum, bst.max_path_sum(bst.root))
    return max_sum

Maximum Path Sumโœ…
Airbus Exam
๐Ÿ”ฅ2
class Solution {
    public static int firstMissingPositiveLostInteger(int[] a) {
        int[] arr = new int[a.length+1];
        if(a.length == 1 && a[0] == 1)  return 2;
        for(int num : a)
            if(num > 0 && num <= a.length)  arr[num] = 1;
        int i = 1;
        while(i <= a.length){
            if(arr[i] == 0) return i;
            i++;
        }
        return i;
    }
}

Java 8โœ…
class Solutions
{
    public static String findSpecialPair(int a[],int T)
    {
        int size = a.length;
        int i = 0, j = 1;
        while (i < size && j < size)
        {
            if (i != j && (a[j] - a[i] == T || a[i] - a[j] == T))
            {
                return "yes";
            }
            else if (a[j] - a[i] < n)
                j++;
            else
                i++;
        }
        return "no" ;
    }

Java 8โœ