class TreeNode:
def init(self, value=0, left=None, right=None):
self.value = value
self.left = left
self.right = right

def count_nodes(node, counts):
if node is None:
return
if node.value in counts:
counts[node.value] += 1
else:
counts[node.value] = 1
count_nodes(node.left, counts)
count_nodes(node.right, counts)

def find_double_roots(root):
counts = {}
count_nodes(root, counts)
double_roots = [value for value, count in counts.items() if count > 1]
return double_roots

def main():
# Example tree:
# 1
# / \
# 2 3
# / \
# 2 4
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(2)
root.left.right = TreeNode(4)

result = find_double_roots(root)
print("Nodes with double roots:", result)

if name == "main":
main()

def longest_equal_subarray():
n = int(input())
A = [int(input()) for _ in range(n)]
A = [-1 if x == 0 else 1 for x in A]
prefix_sum_map = {}
prefix_sum = 0
max_length = 0

for i in range(n):
prefix_sum += A[i]

if prefix_sum == 0:
max_length = i + 1

if prefix_sum in prefix_sum_map:
max_length = max(max_length, i - prefix_sum_map[prefix_sum])
else:
prefix_sum_map[prefix_sum] = i

return max_length

print(longest_equal_subarray())



Infosys Longest Subarray code

This is the code


Everyone write neatly

All test cases passed

Python 3 Infosys

Music melodies

import sys

def get_ans(N, K, A):



def main():

  N = int(sys.stdin.readline().strip())

  K = int(sys.stdin.readline().strip())

  A = []

  for _ in range(N):

    A.append(int(sys.stdin.readline().strip()))

  result = get_ans(N, K, A)

  print(result)


if name == "main":

  main()


Subset with LCM code in python

Tree lis Query

Unique subarray sum solution

Minimum unique sum

Short String

All codes are available

Once check it 👇👇


https://www.instagram.com/allcoding1_official?igsh=ZHJpNXdpeWh1d2No

// coins game

import java.util.*;

class HelloWorld {

static int helper(int a, int b, int i ,int[]x,int n){

if(i==x.length) return 0;

int left=(x[i]>n)?0:Math.abs(x[i]-a)+helper(x[i],b,i+1,x,n);
int right=(x[i]>n)?0:Math.abs(x[i]-b)+helper(a,x[i],i+1,x,n);
return Math.min(left,right);
}

public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
int Q=sc.nextInt();
int A=sc.nextInt();
int B=sc.nextInt();
int[]x=new int[Q];
for(int i=0;i<Q;i++){
x[i]=sc.nextInt();
}

System.out.println(helper(A,B,0,x,N));
}
}

//Equilibrium path


#include <bits/stdc++.h>

using namespace std;

string trim(string str) {
str.erase(0, str.find_first_not_of(' '));
str.erase(str.find_last_not_of(' ') + 1);
return str;
}

int solve(int N, vector<int> A) {
int total_sum = accumulate(A.begin(), A.end(), 0);
int left_sum = 0;
int equilibrium_count = 0;

for (int i = 0; i < N; ++i) {
int right_sum = total_sum - left_sum - A[i];
if (left_sum == right_sum) {
equilibrium_count++;
}
left_sum += A[i];
}

return equilibrium_count;
}

int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);

string inputline;
getline(cin, inputline);
int N = stoi(trim(inputline));

vector<int> A(N);
for (int j = 0; j < N; j++) {
getline(cin, inputline);
A[j] = stoi(trim(inputline));
}

int result = solve(N, A);
cout << result << endl;

return 0;
}

///find largest swuare linked in

public static int findLargestSquareSize(int[][] samples) {
if (samples == null || samples.length == 0) return 0;

int n = samples.length;
int maxSize = 0;

int[][] dp = new int[n][n];

for (int i = 0; i < n; i++) {
dp[i][0] = samples[i][0];
dp[0][i] = samples[0][i];
maxSize = Math.max(maxSize, dp[i][0]);
maxSize = Math.max(maxSize, dp[0][i]);
}

for (int i = 1; i < n; i++) {
for (int j = 1; j < n; j++) {
if (samples[i][j] == 1) {
dp[i][j] = Math.min(Math.min(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1]) + 1;
maxSize = Math.max(maxSize, dp[i][j]);
} else {
dp[i][j] = 0;
}
}
}

return maxSize;
}